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

Reduce log output

Browse source
This commit is contained in:
Jakob Rath 2022-09-23 16:04:51 +02:00
parent 8ed6938cbe
commit 0a0953ae78
4 changed files with 12 additions and 10 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/math/polysat/boolean.cpp
View file

@ -67,7 +67,7 @@ namespace polysat {
}
void bool_var_manager::eval(sat::literal lit, unsigned lvl) {
LOG("Eval literal " << lit << " @ " << lvl);
LOG_V("Eval literal " << lit << " @ " << lvl);
assign(kind_t::value_propagation, lit, lvl, nullptr);
SASSERT(is_value_propagation(lit));
}

2
src/math/polysat/boolean.h
View file

@ -83,7 +83,7 @@ namespace polysat {
case kind_t::assumption: return out << "assumption";
default: UNREACHABLE(); return out;
}
}
}
};
struct bool_justification_pp {

12
src/math/polysat/solver.cpp
View file

@ -394,7 +394,7 @@ namespace polysat {
void solver::add_pwatch(constraint* c, pvar v) {
SASSERT(m_locked_wlist != v); // the propagate loop will not discover the new size
LOG("Watching v" << v << " in constraint " << show_deref(c));
LOG_V("Watching v" << v << " in constraint " << show_deref(c));
m_pwatch[v].push_back(c);
}
@ -855,8 +855,10 @@ namespace polysat {
}
void solver::backjump(unsigned new_level) {
LOG_H3("Backjumping to level " << new_level << " from level " << m_level);
pop_levels(m_level - new_level);
if (m_level != new_level) {
LOG_H3("Backjumping to level " << new_level << " from level " << m_level);
pop_levels(m_level - new_level);
}
}
// Add lemma to storage
@ -916,14 +918,14 @@ namespace polysat {
}
void solver::push() {
LOG("Push user scope");
LOG_H3("Push user scope");
push_level();
m_base_levels.push_back(m_level);
}
void solver::pop(unsigned num_scopes) {
unsigned const base_level = m_base_levels[m_base_levels.size() - num_scopes];
LOG("Pop " << num_scopes << " user scopes");
LOG_H3("Pop " << num_scopes << " user scopes");
pop_levels(m_level - base_level + 1);
if (m_level < m_conflict.level())
m_conflict.reset();

6
src/math/polysat/ule_constraint.cpp
View file

@ -128,9 +128,9 @@ namespace polysat {
signed_constraint sc(this, is_positive);
LOG_H3("Narrowing " << sc);
LOG("Assignment: " << assignments_pp(s));
LOG("Substituted LHS: " << lhs() << " := " << p);
LOG("Substituted RHS: " << rhs() << " := " << q);
LOG_V("Assignment: " << assignments_pp(s));
LOG_V("Substituted LHS: " << lhs() << " := " << p);
LOG_V("Substituted RHS: " << rhs() << " := " << q);
if (is_always_false(is_positive, p, q)) {
s.set_conflict(sc);