mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-07 09:55:19 +00:00
Code Activity

fix compiler warnings

Browse source
This commit is contained in:
Nuno Lopes 2021-02-19 10:33:41 +00:00
parent a22fb8a96e
commit 5e034e495f
6 changed files with 3 additions and 7 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
src/api/api_opt.cpp
View file

@ -436,7 +436,6 @@ extern "C" {
} }
static void optimize_on_model(opt::on_model_t& o, model_ref& m) { static void optimize_on_model(opt::on_model_t& o, model_ref& m) {
Z3_context c = (Z3_context) o.c;
auto model_eh = (void(*)(void*)) o.on_model; auto model_eh = (void(*)(void*)) o.on_model;
Z3_model_ref * m_ref = (Z3_model_ref*) o.m; Z3_model_ref * m_ref = (Z3_model_ref*) o.m;
m_ref->m_model = m.get(); m_ref->m_model = m.get();

2
src/ast/rewriter/seq_axioms.cpp
View file

@ -26,8 +26,8 @@ Revision History:
namespace seq { namespace seq {
axioms::axioms(th_rewriter& r): axioms::axioms(th_rewriter& r):
m_rewrite(r),
m(r.m()), m(r.m()),
m_rewrite(r),
a(m), a(m),
seq(m), seq(m),
m_sk(m, r), m_sk(m, r),

1
src/muz/rel/udoc_relation.cpp
View file

@ -262,7 +262,6 @@ namespace datalog {
return true; return true;
} }
uint64_t n, sz; uint64_t n, sz;
ast_manager& m = get_ast_manager();
if (dl.is_numeral(e, n) && dl.try_get_size(e->get_sort(), sz)) { if (dl.is_numeral(e, n) && dl.try_get_size(e->get_sort(), sz)) {
num_bits = 0; num_bits = 0;
while (sz > 0) ++num_bits, sz = sz/2; while (sz > 0) ++num_bits, sz = sz/2;

2
src/nlsat/nlsat_interval_set.cpp
View file

@ -80,7 +80,7 @@ namespace nlsat {
TRACE("nlsat_interval", tout << "lower: "; am.display_decimal(tout, i.m_lower); tout << ", upper: "; am.display_decimal(tout, i.m_upper); TRACE("nlsat_interval", tout << "lower: "; am.display_decimal(tout, i.m_lower); tout << ", upper: "; am.display_decimal(tout, i.m_upper);
tout << "\ns: " << s << "\n";); tout << "\ns: " << s << "\n";);
SASSERT(s <= 0); SASSERT(s <= 0);
SASSERT(!is_zero(s) || !i.m_lower_open && !i.m_upper_open); SASSERT(!is_zero(s) || (!i.m_lower_open && !i.m_upper_open));
} }
return true; return true;
} }

3
src/sat/smt/q_mbi.cpp
View file

@ -513,8 +513,7 @@ namespace q {
bool mbqi::first_offset(unsigned_vector& offsets, app_ref_vector const& vars) { bool mbqi::first_offset(unsigned_vector& offsets, app_ref_vector const& vars) {
offsets.reset(); offsets.reset();
for (app* _ : vars) offsets.resize(vars.size(), 0);
offsets.push_back(0);
for (unsigned i = 0; i < vars.size(); ++i) for (unsigned i = 0; i < vars.size(); ++i)
if (!next_offset(offsets, vars, i, 0)) if (!next_offset(offsets, vars, i, 0))
return false; return false;

1
src/sat/smt/recfun_solver.cpp
View file

@ -269,7 +269,6 @@ namespace recfun {
bool solver::post_visit(expr* e, bool sign, bool root) { bool solver::post_visit(expr* e, bool sign, bool root) {
euf::enode* n = expr2enode(e); euf::enode* n = expr2enode(e);
app* a = to_app(e);
SASSERT(!n || !n->is_attached_to(get_id())); SASSERT(!n || !n->is_attached_to(get_id()));
if (!n) if (!n)
n = mk_enode(e, false); n = mk_enode(e, false);