mirror of
https://github.com/Z3Prover/z3
synced 2025-05-11 09:44:43 +00:00
104 lines
3.4 KiB
C++
104 lines
3.4 KiB
C++
/*++
|
|
Copyright (c) 2021 Microsoft Corporation
|
|
|
|
Module Name:
|
|
|
|
Conflict explanation using forbidden intervals as described in
|
|
"Solving bitvectors with MCSAT: explanations from bits and pieces"
|
|
by S. Graham-Lengrand, D. Jovanovic, B. Dutertre.
|
|
|
|
Author:
|
|
|
|
Nikolaj Bjorner (nbjorner) 2021-03-19
|
|
Jakob Rath 2021-04-06
|
|
|
|
--*/
|
|
#pragma once
|
|
#include "math/polysat/conflict.h"
|
|
|
|
namespace polysat {
|
|
|
|
class solver;
|
|
|
|
struct fi_record {
|
|
eval_interval interval;
|
|
vector<signed_constraint> side_cond;
|
|
signed_constraint src;
|
|
rational coeff;
|
|
|
|
/** Create invalid fi_record */
|
|
fi_record(): interval(eval_interval::full()) {}
|
|
|
|
struct less {
|
|
bool operator()(fi_record const& a, fi_record const& b) const {
|
|
return a.interval.lo_val() < b.interval.lo_val();
|
|
}
|
|
};
|
|
};
|
|
|
|
class forbidden_intervals {
|
|
solver& s;
|
|
|
|
void push_eq(bool is_trivial, pdd const& p, vector<signed_constraint>& side_cond);
|
|
eval_interval to_interval(signed_constraint const& c, bool is_trivial, rational& coeff,
|
|
rational & lo_val, pdd & lo, rational & hi_val, pdd & hi);
|
|
|
|
|
|
std::tuple<bool, rational, pdd, pdd> linear_decompose(pvar v, pdd const& p, vector<signed_constraint>& out_side_cond);
|
|
|
|
bool match_linear1(signed_constraint const& c,
|
|
rational const& a1, pdd const& b1, pdd const& e1,
|
|
rational const& a2, pdd const& b2, pdd const& e2,
|
|
fi_record& fi);
|
|
|
|
bool match_linear2(signed_constraint const& c,
|
|
rational const & a1, pdd const& b1, pdd const& e1,
|
|
rational const & a2, pdd const& b2, pdd const& e2,
|
|
fi_record& fi);
|
|
|
|
bool match_linear3(signed_constraint const& c,
|
|
rational const & a1, pdd const& b1, pdd const& e1,
|
|
rational const & a2, pdd const& b2, pdd const& e2,
|
|
fi_record& fi);
|
|
|
|
bool match_linear4(signed_constraint const& c,
|
|
rational const & a1, pdd const& b1, pdd const& e1,
|
|
rational const & a2, pdd const& b2, pdd const& e2,
|
|
fi_record& fi);
|
|
|
|
void add_non_unit_side_conds(fi_record& fi, pdd const& b1, pdd const& e1, pdd const& b2, pdd const& e2);
|
|
|
|
bool match_zero(signed_constraint const& c,
|
|
rational const & a1, pdd const& b1, pdd const& e1,
|
|
rational const & a2, pdd const& b2, pdd const& e2,
|
|
fi_record& fi);
|
|
|
|
bool match_non_zero(signed_constraint const& c,
|
|
rational const & a1, pdd const& b1, pdd const& e1,
|
|
fi_record& fi);
|
|
|
|
bool match_non_max(signed_constraint const& c,
|
|
rational const & a2, pdd const& b2, pdd const& e2,
|
|
fi_record& fi);
|
|
|
|
bool get_interval_ule(signed_constraint const& c, pvar v, fi_record& fi);
|
|
|
|
bool get_interval_umul_ovfl(signed_constraint const& c, pvar v, fi_record& fi);
|
|
|
|
struct backtrack {
|
|
bool released = false;
|
|
vector<signed_constraint>& side_cond;
|
|
unsigned sz;
|
|
backtrack(vector<signed_constraint>& s):side_cond(s), sz(s.size()) {}
|
|
~backtrack() {
|
|
if (!released)
|
|
side_cond.shrink(sz);
|
|
}
|
|
};
|
|
|
|
|
|
public:
|
|
forbidden_intervals(solver& s) :s(s) {}
|
|
bool get_interval(signed_constraint const& c, pvar v, fi_record& fi);
|
|
};
|
|
}
|