diff --git a/src/math/automata/symbolic_automata_def.h b/src/math/automata/symbolic_automata_def.h
index c89080d3d..3be6a1da0 100644
--- a/src/math/automata/symbolic_automata_def.h
+++ b/src/math/automata/symbolic_automata_def.h
@@ -451,7 +451,15 @@ typename symbolic_automata<T, M>::automaton_t* symbolic_automata<T, M>::mk_produ
         }
     }
     if (mvs1.empty()) {
-        return alloc(automaton_t, m);
+        if (a.is_final_state(a.init()) && b.is_final_state(b.init())) {
+            // special case: automaton has no moves, but the initial state is final on both sides
+            // this results in the automaton which accepts the empty sequence and nothing else
+            final.clear();
+            final.push_back(0);
+            return alloc(automaton_t, m, 0, final, mvs1);
+        } else {
+            return alloc(automaton_t, m);
+        }
     }
     else {
         return alloc(automaton_t, m, 0, final, mvs1);
diff --git a/src/smt/theory_lra.cpp b/src/smt/theory_lra.cpp
index bd8572d73..0bb76cd90 100644
--- a/src/smt/theory_lra.cpp
+++ b/src/smt/theory_lra.cpp
@@ -2335,7 +2335,12 @@ namespace smt {
             lp::var_index vi = m_theory_var2var_index.get(v, UINT_MAX);
             vector<std::pair<rational, lp::var_index> > coeffs;
             rational coeff;
-            if (m_solver->is_term(vi)) {
+            if (vi == UINT_MAX) {
+                has_shared = false;
+                blocker = m.mk_false();
+                return inf_eps(rational::one(), inf_rational());
+            }
+            else if (m_solver->is_term(vi)) {
                 const lp::lar_term& term = m_solver->get_term(vi);
                 for (auto & ti : term.m_coeffs) {
                     coeffs.push_back(std::make_pair(ti.second, ti.first));