mirror of
https://github.com/Z3Prover/z3
synced 2025-04-24 01:25:31 +00:00
smtfd solver that uses lazy iteration around fd to produce theory lemmas
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
parent
e881c4af3f
commit
c476c4a86a
4 changed files with 1029 additions and 0 deletions
|
@ -2244,6 +2244,10 @@ br_status bv_rewriter::mk_bv_mul(unsigned num_args, expr * const * args, expr_re
|
|||
br_status bv_rewriter::mk_bit2bool(expr * n, int idx, expr_ref & result) {
|
||||
rational v, bit;
|
||||
unsigned sz = 0;
|
||||
if (m_util.is_mkbv(n)) {
|
||||
result = to_app(n)->get_arg(idx);
|
||||
return BR_DONE;
|
||||
}
|
||||
if (!is_numeral(n, v, sz))
|
||||
return BR_FAILED;
|
||||
if (idx < 0 || idx >= static_cast<int>(sz))
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue