mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-23 09:05:31 +00:00
Code Activity

deal with warnings reported in https://launchpadlibrarian.net/522361319/buildlog_ubuntu-groovy-s390x.z3_4.8.10-1ubuntu4ppa1_BUILDING.txt.gz

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2021-02-11 13:49:47 -08:00
parent 2e648e2f02
commit 25f53c0467
11 changed files with 6 additions and 18 deletions
Download patch file Download diff file Expand all files Collapse all files

1
src/smt/dyn_ack.cpp
View file

@ -71,7 +71,6 @@ namespace smt {
proof * mk_proof(conflict_resolution & cr) override {
ast_manager & m = cr.get_manager();
context & ctx = cr.get_context();
unsigned num_args = m_app1->get_num_args();
proof_ref_vector prs(m);
expr_ref_vector lits(m);

1
src/smt/theory_arith_eq.h
View file

@ -319,6 +319,7 @@ namespace smt {
void theory_arith<Ext>::propagate_eq_to_core(theory_var x, theory_var y, antecedents& antecedents) {
// Ignore equality if variables are already known to be equal.
ast_manager& m = get_manager();
(void)m;
if (is_equal(x, y))
return;
// I doesn't make sense to propagate an equality (to the core) of variables of different sort.

2
src/smt/theory_seq.cpp
View file

@ -1494,7 +1494,7 @@ bool theory_seq::internalize_term(app* term) {
else {
e = ctx.mk_enode(term, false, m.is_bool(term), true);
}
theory_var v = mk_var(e);
mk_var(e);
if (!ctx.relevancy()) {
relevant_eh(term);
}

6
src/smt/theory_str.cpp
View file

@ -307,7 +307,6 @@ namespace smt {
}
void theory_str::refresh_theory_var(expr * e) {
ast_manager & m = get_manager();
enode * en = ensure_enode(e);
theory_var v = mk_var(en); (void)v;
TRACE("str", tout << "refresh " << mk_pp(e, get_manager()) << ": v#" << v << std::endl;);
@ -318,7 +317,6 @@ namespace smt {
theory_var theory_str::mk_var(enode* n) {
TRACE("str", tout << "mk_var for " << mk_pp(n->get_owner(), get_manager()) << std::endl;);
ast_manager & m = get_manager();
if (!(n->get_owner()->get_sort() == u.str.mk_string_sort())) {
return null_theory_var;
}
@ -6543,7 +6541,6 @@ namespace smt {
}
void theory_str::handle_equality(expr * lhs, expr * rhs) {
ast_manager & m = get_manager();
// both terms must be of sort String
sort * lhs_sort = lhs->get_sort();
sort * rhs_sort = rhs->get_sort();
@ -7117,7 +7114,6 @@ namespace smt {
}
void theory_str::recursive_check_variable_scope(expr * ex) {
ast_manager & m = get_manager();
if (is_app(ex)) {
app * a = to_app(ex);
@ -9205,8 +9201,6 @@ namespace smt {
}
bool theory_str::flatten(expr* ex, expr_ref_vector & flat) {
ast_manager & m = get_manager();
// TRACE("str", tout << "ex " << mk_pp(ex, m) << " target " << target << " length " << length << " sublen " << mk_pp(sublen, m) << " extra " << mk_pp(extra, m) << std::endl;);
sort * ex_sort = ex->get_sort();
sort * str_sort = u.str.mk_string_sort();