mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-24 01:25:31 +00:00
Code Activity

fix warnings for unused variables

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2016-05-17 13:54:22 -07:00
parent ec565ae7a0
commit 96e157e201
38 changed files with 180 additions and 184 deletions
Download patch file Download diff file Expand all files Collapse all files

3
src/nlsat/nlsat_explain.cpp
View file

@ -1165,8 +1165,7 @@ namespace nlsat {
if (max_var(new_lit) < max) {
// The conflicting core may have redundant literals.
// We should check whether new_lit is true in the current model, and discard it if that is the case
lbool val = m_solver.value(new_lit);
SASSERT(val != l_undef);
VERIFY(m_solver.value(new_lit) != l_undef);
if (m_solver.value(new_lit) == l_false)
add_literal(new_lit);
new_lit = true_literal;

16
src/nlsat/nlsat_interval_set.cpp
View file

@ -102,14 +102,14 @@ namespace nlsat {
// Check if the intervals are valid, ordered, and are disjoint.
bool check_interval_set(anum_manager & am, unsigned sz, interval const * ints) {
for (unsigned i = 0; i < sz; i++) {
interval const & curr = ints[i];
SASSERT(check_interval(am, curr));
if (i < sz - 1) {
interval const & next = ints[i+1];
SASSERT(check_no_overlap(am, curr, next));
}
}
DEBUG_CODE(
for (unsigned i = 0; i < sz; i++) {
interval const & curr = ints[i];
SASSERT(check_interval(am, curr));
if (i < sz - 1) {
SASSERT(check_no_overlap(am, curr, ints[i+1]));
}
});
return true;
}

35
src/nlsat/nlsat_solver.cpp
View file

@ -1728,27 +1728,28 @@ namespace nlsat {
// -----------------------
bool check_watches() const {
for (var x = 0; x < num_vars(); x++) {
clause_vector const & cs = m_watches[x];
unsigned sz = cs.size();
for (unsigned i = 0; i < sz; i++) {
clause const & c = *(cs[i]);
SASSERT(max_var(c) == x);
}
}
DEBUG_CODE(
for (var x = 0; x < num_vars(); x++) {
clause_vector const & cs = m_watches[x];
unsigned sz = cs.size();
for (unsigned i = 0; i < sz; i++) {
SASSERT(max_var(*(cs[i])) == x);
}
});
return true;
}
bool check_bwatches() const {
for (bool_var b = 0; b < m_bwatches.size(); b++) {
clause_vector const & cs = m_bwatches[b];
unsigned sz = cs.size();
for (unsigned i = 0; i < sz; i++) {
clause const & c = *(cs[i]);
SASSERT(max_var(c) == null_var);
SASSERT(max_bvar(c) == b);
}
}
DEBUG_CODE(
for (bool_var b = 0; b < m_bwatches.size(); b++) {
clause_vector const & cs = m_bwatches[b];
unsigned sz = cs.size();
for (unsigned i = 0; i < sz; i++) {
clause const & c = *(cs[i]);
SASSERT(max_var(c) == null_var);
SASSERT(max_bvar(c) == b);
}
});
return true;
}