mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-29 20:05:51 +00:00
Code Activity

address compiler warnings, and user question #6544

Browse source
This commit is contained in:
Nikolaj Bjorner 2023-01-19 19:02:43 -08:00
parent 523a3f34b0
commit d11e5c8ca6
16 changed files with 11 additions and 57 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/sat/smt/arith_diagnostics.cpp
View file

@ -83,9 +83,7 @@ namespace arith {
}
void solver::explain_assumptions(lp::explanation const& e) {
unsigned i = 0;
for (auto const & ev : e) {
++i;
auto idx = ev.ci();
if (UINT_MAX == idx)
continue;

7
src/sat/smt/pb_solver.cpp
View file

@ -2791,7 +2791,6 @@ namespace pb {
bool solver::subsumes(card& c1, card& c2, literal_vector & comp) {
if (c2.lit() != sat::null_literal) return false;
unsigned c2_exclusive = 0;
unsigned common = 0;
comp.reset();
for (literal l : c2) {
@ -2801,9 +2800,6 @@ namespace pb {
else if (is_visited(~l)) {
comp.push_back(l);
}
else {
++c2_exclusive;
}
}
unsigned c1_exclusive = c1.size() - common - comp.size();
@ -3405,16 +3401,13 @@ namespace pb {
unsigned slack = 0;
unsigned max_level = 0;
unsigned num_max_level = 0;
for (wliteral wl : m_wlits) {
if (value(wl.second) != l_false) ++slack;
unsigned level = lvl(wl.second);
if (level > max_level) {
max_level = level;
num_max_level = 1;
}
else if (max_level == level) {
++num_max_level;
}
}
if (m_overflow)

2
src/sat/smt/q_eval.cpp
View file

@ -124,11 +124,9 @@ namespace q {
std::swap(t, s);
}
unsigned sz = evidence.size();
unsigned count = 0;
for (euf::enode* t1 : euf::enode_class(tn)) {
if (!t1->is_cgr())
continue;
++count;
expr* t2 = t1->get_expr();
if ((c = compare_rec(n, binding, s, t2, evidence), c != l_undef)) {
evidence.push_back(euf::enode_pair(t1, tn));

2
src/sat/smt/q_mam.cpp
View file

@ -3797,7 +3797,6 @@ namespace q {
}
void rematch(bool use_irrelevant) override {
unsigned lbl = 0;
for (auto * t : m_trees) {
if (t) {
m_interpreter.init(t);
@ -3807,7 +3806,6 @@ namespace q {
m_interpreter.execute_core(t, curr);
}
}
++lbl;
}
}

2
src/sat/smt/tseitin_theory_checker.cpp
View file

@ -190,7 +190,7 @@ namespace tseitin {
complement_mark(arg);
if (is_marked(x) && is_complement(y))
return true;
if (is_marked(y) & is_complement(x))
if (is_marked(y) && is_complement(x))
return true;
}