diff --git a/src/sat/smt/array_axioms.cpp b/src/sat/smt/array_axioms.cpp
index 613d7a17c..df1fecc49 100644
--- a/src/sat/smt/array_axioms.cpp
+++ b/src/sat/smt/array_axioms.cpp
@@ -281,8 +281,8 @@ namespace array {
      * a = b or default(a) != default(b) or a[md(a,b)] != b[md(a,b)]
      */
     bool solver::assert_diff(expr* md) {
-        expr* x, *y;
-        SASSERT(a.is_maxdiff(md, x, y) || a.is_mindiff(md, x, y));
+        expr* x = nullptr, *y = nullptr;
+        VERIFY(a.is_maxdiff(md, x, y) || a.is_mindiff(md, x, y));
         expr* args1[2] = { x, md };
         expr* args2[2] = { y, md };
         literal eq = eq_internalize(x, y);
diff --git a/src/sat/smt/pb_solver.cpp b/src/sat/smt/pb_solver.cpp
index 8340543ec..ff08ab284 100644
--- a/src/sat/smt/pb_solver.cpp
+++ b/src/sat/smt/pb_solver.cpp
@@ -2699,7 +2699,7 @@ namespace pb {
                     }
                 }
                 ++m_stats.m_num_big_strengthenings;
-                constraint* c = add_pb_ge(sat::null_literal, wlits, b, p.learned());
+                add_pb_ge(sat::null_literal, wlits, b, p.learned());
                 p.set_removed();
                 return;
             }
diff --git a/src/smt/theory_array.cpp b/src/smt/theory_array.cpp
index 2d166c5f6..9d3e93839 100644
--- a/src/smt/theory_array.cpp
+++ b/src/smt/theory_array.cpp
@@ -239,7 +239,6 @@ namespace smt {
     // 
     bool theory_array::internalize_term_core(app * n) {
         TRACE("array_bug", tout << mk_bounded_pp(n, m) << "\n";);
-        unsigned num_args = n->get_num_args();
         for (expr* arg : *n)
             ctx.internalize(arg, false);
         // force merge-tf by re-internalizing expression.