3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-12 12:08:18 +00:00

fix debug build

This commit is contained in:
Nuno Lopes 2022-06-17 14:35:33 +01:00
parent 73a24ca0a9
commit d9fcfdab34
8 changed files with 12 additions and 10 deletions

View file

@ -1401,6 +1401,7 @@ std::ostream& operator<<(std::ostream& out, sort_ref_vector const& e) {
#ifdef Z3DEBUG #ifdef Z3DEBUG
#include <iostream>
void pp(expr const * n, ast_manager & m) { void pp(expr const * n, ast_manager & m) {
std::cout << mk_ismt2_pp(const_cast<expr*>(n), m) << std::endl; std::cout << mk_ismt2_pp(const_cast<expr*>(n), m) << std::endl;
} }

View file

@ -445,8 +445,6 @@ void static_features::post_process(expr * e, bool form_ctx, bool or_and_ctx, boo
} }
unsigned depth = 0; unsigned depth = 0;
unsigned form_depth = 0;
unsigned or_and_depth = 0;
unsigned ite_depth = 0; unsigned ite_depth = 0;
auto [form_ctx_new, or_and_ctx_new, ite_ctx_new] = new_ctx(e); auto [form_ctx_new, or_and_ctx_new, ite_ctx_new] = new_ctx(e);
@ -533,8 +531,6 @@ void static_features::process_root(expr * e) {
if (num_args == 2) if (num_args == 2)
m_num_bin_clauses++; m_num_bin_clauses++;
unsigned depth = 0; unsigned depth = 0;
unsigned form_depth = 0;
unsigned or_and_depth = 0;
for (unsigned i = 0; i < num_args; i++) { for (unsigned i = 0; i < num_args; i++) {
expr * arg = to_app(e)->get_arg(i); expr * arg = to_app(e)->get_arg(i);
if (m.is_not(arg)) if (m.is_not(arg))

View file

@ -1883,6 +1883,7 @@ namespace nlsat {
}; };
#ifdef Z3DEBUG #ifdef Z3DEBUG
#include <iostream>
void pp(nlsat::explain::imp & ex, unsigned num, nlsat::literal const * ls) { void pp(nlsat::explain::imp & ex, unsigned num, nlsat::literal const * ls) {
ex.display(std::cout, num, ls); ex.display(std::cout, num, ls);
} }

View file

@ -387,8 +387,7 @@ namespace qe {
for (unsigned i = vars.size(); i-- > 0;) { for (unsigned i = vars.size(); i-- > 0;) {
new_result.reset(); new_result.reset();
ex.project(vars[i], result.size(), result.data(), new_result); ex.project(vars[i], result.size(), result.data(), new_result);
TRACE("qe", display_project(tout, vars[i], result, new_result);); TRACE("qe", display_project(tout, vars[i], result, new_result););
TRACE("qe", display_project(std::cout, vars[i], result, new_result););
result.swap(new_result); result.swap(new_result);
} }
negate_clause(result); negate_clause(result);

View file

@ -726,6 +726,7 @@ unsigned asserted_formulas::get_total_size() const {
#ifdef Z3DEBUG #ifdef Z3DEBUG
#include <iostream>
void pp(asserted_formulas & f) { void pp(asserted_formulas & f) {
f.display(std::cout); f.display(std::cout);
} }

View file

@ -1756,14 +1756,14 @@ namespace smtfd {
expr_ref val0 = (*m_model)(a); expr_ref val0 = (*m_model)(a);
expr_ref val1 = (*m_model)(abs(a)); expr_ref val1 = (*m_model)(abs(a));
if (is_ground(a) && val0 != val1 && val0->get_sort() == val1->get_sort()) { if (is_ground(a) && val0 != val1 && val0->get_sort() == val1->get_sort()) {
std::cout << mk_bounded_pp(a, m, 2) << " := " << val0 << " " << val1 << "\n"; //std::cout << mk_bounded_pp(a, m, 2) << " := " << val0 << " " << val1 << "\n";
found_bad = true; found_bad = true;
} }
} }
if (found_bad) { if (found_bad) {
std::cout << "core: " << core << "\n"; //std::cout << "core: " << core << "\n";
std::cout << *m_model.get() << "\n"; //std::cout << *m_model.get() << "\n";
exit(0); UNREACHABLE();
}); });
if (!has_q) { if (!has_q) {

View file

@ -1046,6 +1046,7 @@ void params::set_sym(char const * k, symbol const & v) {
} }
#ifdef Z3DEBUG #ifdef Z3DEBUG
#include <iostream>
void pp(params_ref const & p) { void pp(params_ref const & p) {
std::cout << p << std::endl; std::cout << p << std::endl;
} }

View file

@ -24,6 +24,9 @@ Revision History:
#include "util/util.h" #include "util/util.h"
#include "util/vector.h" #include "util/vector.h"
#include<iomanip> #include<iomanip>
#ifdef Z3DEBUG
# include <iostream>
#endif
small_object_allocator::small_object_allocator(char const * id) { small_object_allocator::small_object_allocator(char const * id) {
for (unsigned i = 0; i < NUM_SLOTS; i++) { for (unsigned i = 0; i < NUM_SLOTS; i++) {