tla-ts 0.0.9 → 0.0.10-dev.06b481ee0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +30 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +48 -44
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +122 -12
- package/dist/index.d.ts +122 -12
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2746 -410
- package/dist/prove.js +2745 -409
- package/dist/run.cjs +144 -31
- package/dist/run.js +144 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +134 -104
- package/dist/transfer.js +134 -104
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +3 -1
- package/src/ast.ts +56 -60
- package/src/bags.ts +128 -110
- package/src/builtins.ts +31 -77
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +118 -0
- package/src/check-trace.ts +320 -0
- package/src/check.ts +1156 -888
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +100 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +433 -82
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +701 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +330 -659
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +217 -82
- package/src/config.ts +140 -109
- package/src/coverage.ts +1019 -0
- package/src/dependencies.ts +101 -66
- package/src/dfid.ts +683 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +263 -370
- package/src/errors.ts +107 -57
- package/src/evaluate.ts +898 -369
- package/src/exit-codes.ts +63 -13
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +137 -22
- package/src/java-hash.ts +21 -0
- package/src/java-overrides.ts +6 -21
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +231 -154
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +743 -322
- package/src/liveness.ts +230 -133
- package/src/obligations/action.ts +17 -44
- package/src/obligations/anonymize.ts +120 -95
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +37 -26
- package/src/obligations/format.ts +0 -10
- package/src/obligations/generate.ts +66 -64
- package/src/obligations/index.ts +39 -20
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +31 -41
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +94 -63
- package/src/obligations/proof.ts +3 -6
- package/src/obligations/regroup.ts +0 -5
- package/src/obligations/simplify.ts +57 -63
- package/src/obligations/source.ts +121 -95
- package/src/obligations/subexpression.ts +49 -28
- package/src/obligations/substitution.ts +1 -5
- package/src/obligations/temporal.ts +12 -20
- package/src/obligations/tuples.ts +2 -10
- package/src/parallel-worker.ts +36 -60
- package/src/parallel.ts +64 -73
- package/src/parser.ts +1184 -531
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +8 -13
- package/src/prover/deciders.ts +12 -13
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +3 -31
- package/src/prover/isabelle/encode.ts +82 -64
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
- package/src/prover/isabelle/isar/method.ts +510 -226
- package/src/prover/isabelle/isar/proof.ts +570 -23
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +488 -88
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +99 -38
- package/src/prover/isabelle/provers/blast/blast.ts +16 -105
- package/src/prover/isabelle/provers/blast/branch.ts +0 -33
- package/src/prover/isabelle/provers/blast/prove.ts +0 -36
- package/src/prover/isabelle/provers/blast/rules.ts +5 -45
- package/src/prover/isabelle/provers/blast/state.ts +1 -29
- package/src/prover/isabelle/provers/blast/term.ts +8 -37
- package/src/prover/isabelle/provers/clasimp.ts +1 -15
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +29 -54
- package/src/prover/isabelle/pure/bicompose.ts +24 -39
- package/src/prover/isabelle/pure/consts.ts +0 -8
- package/src/prover/isabelle/pure/conv.ts +2 -18
- package/src/prover/isabelle/pure/drule.ts +95 -45
- package/src/prover/isabelle/pure/envir.ts +2 -53
- package/src/prover/isabelle/pure/goal.ts +1 -9
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +1 -16
- package/src/prover/isabelle/pure/name.ts +1 -10
- package/src/prover/isabelle/pure/net.ts +2 -60
- package/src/prover/isabelle/pure/object-logic.ts +15 -16
- package/src/prover/isabelle/pure/pattern.ts +1 -20
- package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
- package/src/prover/isabelle/pure/rewriter.ts +34 -77
- package/src/prover/isabelle/pure/search.ts +2 -11
- package/src/prover/isabelle/pure/seq.ts +0 -11
- package/src/prover/isabelle/pure/simplifier.ts +27 -16
- package/src/prover/isabelle/pure/table.ts +2 -33
- package/src/prover/isabelle/pure/tactic.ts +11 -23
- package/src/prover/isabelle/pure/tactical.ts +47 -48
- package/src/prover/isabelle/pure/term-ord.ts +1 -7
- package/src/prover/isabelle/pure/term.ts +4 -47
- package/src/prover/isabelle/pure/thm.ts +26 -48
- package/src/prover/isabelle/pure/type.ts +1 -16
- package/src/prover/isabelle/pure/unify.ts +19 -31
- package/src/prover/isabelle/pure/variable.ts +2 -8
- package/src/prover/isabelle/tla/classical-setup.ts +17 -25
- package/src/prover/isabelle/tla/context.ts +65 -26
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +53 -32
- package/src/prover/isabelle/tla/simpdata.ts +45 -44
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
- package/src/prover/ocaml.ts +4 -7
- package/src/prover/prep/action.ts +33 -66
- package/src/prover/prep/enabled-axioms.ts +22 -20
- package/src/prover/prep/fingerprint.ts +2 -21
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +26 -31
- package/src/prover/prep/methods.ts +189 -86
- package/src/prover/prep/normalize.ts +42 -37
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +398 -133
- package/src/prover/ptl/decide.ts +96 -56
- package/src/prover/ptl/encode.ts +15 -38
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +40 -28
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -15
- package/src/prover/smt/context.ts +60 -32
- package/src/prover/smt/data.ts +517 -401
- package/src/prover/smt/encode.ts +155 -85
- package/src/prover/smt/extensionality.ts +5 -13
- package/src/prover/smt/flatten.ts +7 -28
- package/src/prover/smt/format.ts +33 -14
- package/src/prover/smt/instances.ts +7 -11
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -658
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -16
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +626 -56
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +319 -0
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +241 -99
- package/src/prover/smt/solver/ast-lt.ts +165 -21
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1480 -184
- package/src/prover/smt/solver/auf-solver.ts +30 -56
- package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +598 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +127 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -10
- package/src/prover/smt/solver/cg-table.ts +39 -42
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -27
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +600 -187
- package/src/prover/smt/solver/ctx-simplify.ts +34 -52
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
- package/src/prover/smt/solver/der.ts +39 -30
- package/src/prover/smt/solver/diff-neq.ts +205 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -11
- package/src/prover/smt/solver/e-matching.ts +9 -41
- package/src/prover/smt/solver/elim-bounds.ts +89 -0
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
- package/src/prover/smt/solver/enode.ts +100 -23
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +901 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1046 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +328 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
- package/src/prover/smt/solver/expr2polynomial.ts +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +734 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -26
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -9
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +179 -28
- package/src/prover/smt/solver/goal2nlsat.ts +216 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -9
- package/src/prover/smt/solver/hashtable.ts +30 -23
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +113 -133
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -2
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -4
- package/src/prover/smt/solver/logic-tactics.ts +355 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
- package/src/prover/smt/solver/lp/constraints.ts +1 -8
- package/src/prover/smt/solver/lp/containers.ts +18 -31
- package/src/prover/smt/solver/lp/core-solver.ts +35 -37
- package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
- package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
- package/src/prover/smt/solver/lp/dependency.ts +0 -5
- package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
- package/src/prover/smt/solver/lp/explanation.ts +0 -6
- package/src/prover/smt/solver/lp/gomory.ts +8 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
- package/src/prover/smt/solver/lp/hnf.ts +10 -28
- package/src/prover/smt/solver/lp/int-cube.ts +17 -39
- package/src/prover/smt/solver/lp/int-solver.ts +3 -35
- package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
- package/src/prover/smt/solver/lp/nex.ts +2 -7
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
- package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
- package/src/prover/smt/solver/lp/nla-core.ts +92 -136
- package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
- package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
- package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
- package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
- package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
- package/src/prover/smt/solver/lp/nla-order.ts +0 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -12
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
- package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
- package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
- package/src/prover/smt/solver/lp/pdd.ts +730 -358
- package/src/prover/smt/solver/lp/random-updater.ts +0 -9
- package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
- package/src/prover/smt/solver/lp/union-find.ts +5 -5
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +129 -139
- package/src/prover/smt/solver/mam-interpreter.ts +0 -21
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +310 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +106 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +20 -63
- package/src/prover/smt/solver/model-evaluator.ts +192 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +104 -46
- package/src/prover/smt/solver/model-macro-solver.ts +60 -114
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +709 -0
- package/src/prover/smt/solver/mus.ts +50 -0
- package/src/prover/smt/solver/muz/dl-context.ts +382 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
- package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +429 -275
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
- package/src/prover/smt/solver/nlsat/solver.ts +297 -156
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
- package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +112 -61
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +801 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +301 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +312 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +21 -26
- package/src/prover/smt/solver/pb-rewriter.ts +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +261 -79
- package/src/prover/smt/solver/probes.ts +577 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -30
- package/src/prover/smt/solver/proto-model.ts +650 -66
- package/src/prover/smt/solver/pull-quant.ts +28 -23
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/push-app-ite.ts +37 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -31
- package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
- package/src/prover/smt/solver/qe-lite.ts +41 -51
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1499 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -16
- package/src/prover/smt/solver/qsat.ts +829 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +17 -74
- package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
- package/src/prover/smt/solver/quantifier-manager.ts +22 -32
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -2
- package/src/prover/smt/solver/rational.ts +45 -8
- package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -6
- package/src/prover/smt/solver/relevancy.ts +2 -16
- package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
- package/src/prover/smt/solver/rewriter.ts +507 -144
- package/src/prover/smt/solver/rlimit.ts +46 -24
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2107 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +995 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
- package/src/prover/smt/solver/seq-skolem.ts +294 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +124 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +589 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
- package/src/prover/smt/solver/smtlib-script.ts +2134 -0
- package/src/prover/smt/solver/solve-eqs.ts +928 -0
- package/src/prover/smt/solver/solver.ts +135 -40
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -6
- package/src/prover/smt/solver/tactic.ts +2141 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1210 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
- package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
- package/src/prover/smt/solver/theory-lra-state.ts +7 -28
- package/src/prover/smt/solver/theory-lra.ts +189 -9
- package/src/prover/smt/solver/theory-pb.ts +951 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +852 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory-without-terms.ts +24 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
- package/src/prover/smt/solver/var-subst.ts +37 -39
- package/src/prover/smt/table.ts +3 -10
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +74 -48
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +21 -20
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -2
- package/src/prover/zenon/check/check.ts +1 -11
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +1 -6
- package/src/prover/zenon/check/relations.ts +2 -14
- package/src/prover/zenon/check/rewrites.ts +2 -21
- package/src/prover/zenon/check/sets.ts +40 -61
- package/src/prover/zenon/check/terms.ts +1 -19
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +10 -19
- package/src/prover/zenon/encode.ts +0 -9
- package/src/prover/zenon/eqrel.ts +2 -15
- package/src/prover/zenon/equality-rules.ts +24 -6
- package/src/prover/zenon/expr.ts +29 -28
- package/src/prover/zenon/index-table.ts +33 -61
- package/src/prover/zenon/isar-case.ts +9 -21
- package/src/prover/zenon/isar.ts +37 -67
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -22
- package/src/prover/zenon/mltoll.ts +66 -106
- package/src/prover/zenon/node.ts +20 -15
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +9 -13
- package/src/prover/zenon/phrase.ts +2 -14
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +3 -8
- package/src/prover/zenon/search.ts +11 -35
- package/src/prover/zenon/tla/functions.ts +59 -33
- package/src/prover/zenon/tla/llproof.ts +67 -78
- package/src/prover/zenon/tla/records.ts +57 -35
- package/src/prover/zenon/tla/rewrites.ts +12 -21
- package/src/prover/zenon/tla/sets.ts +88 -59
- package/src/prover/zenon/tla/terms.ts +0 -8
- package/src/prover/zenon/tla/tla.ts +66 -66
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +1132 -430
- package/src/runtime.ts +33 -23
- package/src/sany/builtins.ts +11 -14
- package/src/sany/generation.ts +383 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +688 -0
- package/src/sany/generator-expressions.ts +1108 -0
- package/src/sany/generator-proofs.ts +665 -0
- package/src/sany/generator.ts +192 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +61 -80
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +5 -7
- package/src/sany/nodes.ts +6 -44
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +60 -82
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +37 -120
- package/src/search.ts +913 -227
- package/src/simulate.ts +765 -0
- package/src/spec-description.ts +198 -104
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +302 -99
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +578 -166
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +299 -108
- package/src/symmetry.ts +37 -28
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +122 -6
- package/src/tlc/messages.ts +127 -56
- package/src/tlc/order.ts +53 -72
- package/src/tlc/random.ts +38 -49
- package/src/tlc/replay.ts +579 -230
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +83 -47
- package/src/tlc/tlcext-operators.ts +205 -127
- package/src/tlc/trace-spec.ts +235 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/trace-liveness.ts +529 -0
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6556 -0
- package/src/typescript/actions.ts +479 -0
- package/src/typescript/collections.ts +614 -0
- package/src/typescript/compile.ts +63 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +154 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +162 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +167 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +945 -526
- package/src/worker.ts +7 -8
- package/src/prover/isabelle/isar/statement.ts +0 -57
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -1,19 +1,41 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
1
|
+
import { mkArrayApp } from "./array-decl-plugin";
|
|
2
|
+
import { ArrayRewriter } from "./array-rewriter";
|
|
3
|
+
import { mkRecFunApp } from "./recfun-rewriter";
|
|
4
|
+
import { mkDatatypeAppCore, mkDatatypeEqCore } from "./datatype-rewriter";
|
|
3
5
|
import { ArithRewriter, KERNEL_ARITH_OPTIONS, TACTIC_ARITH_OPTIONS } from "./arith-rewriter";
|
|
6
|
+
import { type BvRewriterOptions, BvRewriter, DEFAULT_BV_OPTIONS } from "./bv-rewriter";
|
|
7
|
+
import { isAssociativeBvOp } from "./bv-decl-plugin";
|
|
4
8
|
import type { ArithRewriterOptions } from "./poly-rewriter";
|
|
5
9
|
import { isAstLess } from "./ast-lt";
|
|
6
10
|
import { Der } from "./der";
|
|
11
|
+
import { type Dependency, joinDependencies } from "./goal";
|
|
12
|
+
import { mkFpaAppCore, mkFpaEqCore } from "./fpa-rewriter";
|
|
13
|
+
import { mkPbAppCore } from "./pb-rewriter";
|
|
14
|
+
import { SeqRewriter } from "./seq-rewriter";
|
|
7
15
|
import {
|
|
8
|
-
AstManager,
|
|
16
|
+
type AstManager,
|
|
9
17
|
FAMILY_ARITH,
|
|
18
|
+
FAMILY_ARRAY,
|
|
10
19
|
FAMILY_BASIC,
|
|
20
|
+
FAMILY_BV,
|
|
21
|
+
FAMILY_CHAR,
|
|
22
|
+
FAMILY_DATATYPE,
|
|
23
|
+
FAMILY_FPA,
|
|
24
|
+
FAMILY_PB,
|
|
25
|
+
FAMILY_RECFUN,
|
|
26
|
+
FAMILY_SEQ,
|
|
11
27
|
KIND_APP,
|
|
12
28
|
KIND_QUANTIFIER,
|
|
13
29
|
KIND_VAR,
|
|
14
30
|
OP_ABS,
|
|
15
31
|
OP_ADD,
|
|
16
32
|
OP_AND,
|
|
33
|
+
OP_BADD,
|
|
34
|
+
OP_BAND,
|
|
35
|
+
OP_BCOMP,
|
|
36
|
+
OP_BMUL,
|
|
37
|
+
OP_BOR,
|
|
38
|
+
OP_BXOR,
|
|
17
39
|
OP_DISTINCT,
|
|
18
40
|
OP_DIV,
|
|
19
41
|
OP_EQ,
|
|
@@ -22,53 +44,69 @@ import {
|
|
|
22
44
|
OP_IDIV,
|
|
23
45
|
OP_IMPLIES,
|
|
24
46
|
OP_IS_INT,
|
|
47
|
+
OP_POWER,
|
|
48
|
+
OP_SIN,
|
|
49
|
+
OP_COS,
|
|
50
|
+
OP_TAN,
|
|
51
|
+
OP_ASIN,
|
|
52
|
+
OP_ACOS,
|
|
53
|
+
OP_ATAN,
|
|
54
|
+
OP_SINH,
|
|
55
|
+
OP_COSH,
|
|
56
|
+
OP_TANH,
|
|
25
57
|
OP_ITE,
|
|
26
58
|
OP_LE,
|
|
27
59
|
OP_LT,
|
|
28
60
|
OP_MOD,
|
|
61
|
+
OP_REM,
|
|
29
62
|
OP_MUL,
|
|
30
63
|
OP_NOT,
|
|
31
64
|
OP_OR,
|
|
32
65
|
OP_SUB,
|
|
33
66
|
OP_TO_INT,
|
|
34
67
|
OP_TO_REAL,
|
|
68
|
+
OP_UBV2INT,
|
|
35
69
|
OP_UMINUS,
|
|
36
70
|
OP_UNINTERPRETED,
|
|
37
71
|
OP_XOR,
|
|
38
72
|
SORT_BOOL,
|
|
39
73
|
isArithSort,
|
|
74
|
+
OP_CONST_ARRAY,
|
|
75
|
+
QUANTIFIER_FORALL,
|
|
76
|
+
QUANTIFIER_LAMBDA,
|
|
40
77
|
} from "./ast";
|
|
41
78
|
import { getRewriteDepth, type Rewrite, RewriterTpl } from "./rewriter-tpl";
|
|
42
79
|
import { sortByKey } from "./sort";
|
|
43
80
|
import { UnusedVarsEliminator } from "./var-subst";
|
|
44
81
|
|
|
45
|
-
interface RewriterOptions {
|
|
46
|
-
// Replaces (and a b) with (not (or (not a) (not b))), as Z3's asserted_formulas does after NNF.
|
|
82
|
+
export interface RewriterOptions {
|
|
47
83
|
readonly isEliminatingAnd: boolean;
|
|
48
84
|
readonly arith: ArithRewriterOptions;
|
|
49
|
-
// rewrite_patterns: the patterns of a quantifier are rewritten like its body. The kernel's rewriters
|
|
50
|
-
// set it, and the tactics' leave it off.
|
|
51
85
|
readonly isRewritingPatterns: boolean;
|
|
52
|
-
// pull_cheap_ite: a binary predicate or a function of an ite with values distributes over the ite.
|
|
53
86
|
readonly isPullingCheapIte?: boolean;
|
|
87
|
+
readonly isPushingIteBv?: boolean;
|
|
88
|
+
readonly isKeepingDistinct?: boolean;
|
|
89
|
+
readonly blastDistinctThreshold?: number;
|
|
90
|
+
readonly bv?: BvRewriterOptions;
|
|
91
|
+
readonly isFlatAndOr?: boolean;
|
|
92
|
+
readonly localCtxLimit?: number;
|
|
93
|
+
readonly isCoalescingChars?: boolean;
|
|
94
|
+
readonly isSortingStore?: boolean;
|
|
95
|
+
readonly isExpandingSelects?: boolean;
|
|
54
96
|
}
|
|
55
97
|
|
|
56
|
-
// The parameters that asserted_formulas gives the kernel's rewriters.
|
|
57
98
|
export const KERNEL_REWRITER_OPTIONS: RewriterOptions = {
|
|
58
99
|
isEliminatingAnd: false,
|
|
59
100
|
arith: KERNEL_ARITH_OPTIONS,
|
|
60
101
|
isRewritingPatterns: true,
|
|
61
102
|
};
|
|
62
103
|
|
|
63
|
-
// th_rewriter's defaults, which the tactics and the model use.
|
|
64
104
|
export const TACTIC_REWRITER_OPTIONS: RewriterOptions = {
|
|
65
105
|
isEliminatingAnd: false,
|
|
66
106
|
arith: TACTIC_ARITH_OPTIONS,
|
|
67
107
|
isRewritingPatterns: false,
|
|
68
108
|
};
|
|
69
109
|
|
|
70
|
-
// A term that reduceTo is rewriting: the depth left for its arguments, its next argument, and where
|
|
71
|
-
// its arguments' results start.
|
|
72
110
|
interface ReduceFrame {
|
|
73
111
|
expr: number;
|
|
74
112
|
depth: number;
|
|
@@ -76,15 +114,18 @@ interface ReduceFrame {
|
|
|
76
114
|
spos: number;
|
|
77
115
|
}
|
|
78
116
|
|
|
79
|
-
// rewriter_tpl with th_rewriter_cfg.
|
|
80
117
|
export class Rewriter extends RewriterTpl {
|
|
81
118
|
private arith: ArithRewriter;
|
|
119
|
+
private bv: BvRewriter;
|
|
120
|
+
private array: ArrayRewriter;
|
|
121
|
+
private seq: SeqRewriter;
|
|
82
122
|
private substitution = new Map<number, number>();
|
|
123
|
+
private substitutionDependencies = new Map<number, Dependency | undefined>();
|
|
124
|
+
usedDependencies: Dependency | undefined;
|
|
83
125
|
private unusedVarsEliminator: UnusedVarsEliminator;
|
|
84
126
|
private der: Der;
|
|
85
|
-
// try_ite_value writes the result of reduce_app, which is the m_r of the rewriter that applies
|
|
86
|
-
// this one, as it goes: the first write releases what m_r held.
|
|
87
127
|
releaseResult = () => this.setLastResult(-1);
|
|
128
|
+
private localCtxCost = 0;
|
|
88
129
|
|
|
89
130
|
constructor(
|
|
90
131
|
manager: AstManager,
|
|
@@ -93,20 +134,38 @@ export class Rewriter extends RewriterTpl {
|
|
|
93
134
|
) {
|
|
94
135
|
super(manager);
|
|
95
136
|
this.arith = new ArithRewriter(manager, options.arith);
|
|
137
|
+
const bvOptions = options.bv ?? { ...DEFAULT_BV_OPTIONS, isHiDiv0: manager.isHiDiv0 };
|
|
138
|
+
this.bv = new BvRewriter(manager, options.arith, bvOptions, {
|
|
139
|
+
mkEq: (left, right) => this.mkEq(left, right),
|
|
140
|
+
mkIte: (condition, thenExpr, elseExpr) => {
|
|
141
|
+
const result = this.mkIte(condition, thenExpr, elseExpr);
|
|
142
|
+
return typeof result === "number" ? result : result.expr;
|
|
143
|
+
},
|
|
144
|
+
});
|
|
145
|
+
this.array = new ArrayRewriter(manager, options.isSortingStore, options.isExpandingSelects);
|
|
146
|
+
this.seq = new SeqRewriter(manager, options.isCoalescingChars ?? true, this);
|
|
96
147
|
this.unusedVarsEliminator = new UnusedVarsEliminator(manager);
|
|
97
148
|
this.der = new Der(manager);
|
|
98
149
|
}
|
|
99
150
|
|
|
100
|
-
// ~imp: the members of th_rewriter_cfg go before the caches of rewriter_tpl.
|
|
101
151
|
release() {
|
|
102
152
|
this.unusedVarsEliminator.release();
|
|
103
153
|
this.der.release();
|
|
154
|
+
this.seq.release();
|
|
104
155
|
super.release();
|
|
105
156
|
}
|
|
106
157
|
|
|
107
|
-
//
|
|
108
|
-
|
|
109
|
-
|
|
158
|
+
// A rewrite that the spent resource limit stops answers its input instead of failing.
|
|
159
|
+
rewrite(expr: number) {
|
|
160
|
+
try {
|
|
161
|
+
return super.rewrite(expr);
|
|
162
|
+
} catch (error) {
|
|
163
|
+
if (this.manager.limit.inc()) throw error;
|
|
164
|
+
this.manager.incRef(expr);
|
|
165
|
+
return expr;
|
|
166
|
+
}
|
|
167
|
+
}
|
|
168
|
+
|
|
110
169
|
private reduceTo(expr: number, depth: number): number {
|
|
111
170
|
const manager = this.manager;
|
|
112
171
|
const frames: ReduceFrame[] = [];
|
|
@@ -134,28 +193,46 @@ export class Rewriter extends RewriterTpl {
|
|
|
134
193
|
return results[0];
|
|
135
194
|
}
|
|
136
195
|
|
|
137
|
-
// updt_params with elim_and, which asserted_formulas turns on after NNF. The caller resets the
|
|
138
|
-
// rewriter.
|
|
139
196
|
setEliminatingAnd(isEliminatingAnd: boolean) {
|
|
140
197
|
this.options = { ...this.options, isEliminatingAnd };
|
|
141
198
|
}
|
|
142
199
|
|
|
143
|
-
|
|
144
|
-
|
|
145
|
-
|
|
200
|
+
setEq2Ineq(isEq2Ineq: boolean) {
|
|
201
|
+
this.arith.isEq2Ineq = isEq2Ineq;
|
|
202
|
+
}
|
|
203
|
+
|
|
204
|
+
// The caller may extend the substitution between rewrites without a reset.
|
|
205
|
+
setSubstitution(
|
|
206
|
+
substitution: Map<number, number>,
|
|
207
|
+
dependencies = new Map<number, Dependency | undefined>(),
|
|
208
|
+
) {
|
|
146
209
|
this.substitution = substitution;
|
|
210
|
+
this.substitutionDependencies = dependencies;
|
|
147
211
|
this.reset();
|
|
148
212
|
}
|
|
149
213
|
|
|
150
214
|
getSubst(expr: number) {
|
|
151
|
-
|
|
215
|
+
const replacement = this.substitution.size === 0 ? undefined : this.substitution.get(expr);
|
|
216
|
+
if (replacement !== undefined)
|
|
217
|
+
this.usedDependencies = joinDependencies(
|
|
218
|
+
this.usedDependencies,
|
|
219
|
+
this.substitutionDependencies.get(expr),
|
|
220
|
+
);
|
|
221
|
+
return replacement;
|
|
152
222
|
}
|
|
153
223
|
|
|
154
|
-
// flat_assoc: th_rewriter flattens and, or and + into an enclosing application of the same
|
|
155
|
-
// operator.
|
|
156
224
|
isFlatAssoc(decl: number) {
|
|
157
225
|
const op = this.manager.funcDecls[decl].op;
|
|
158
|
-
return
|
|
226
|
+
return (
|
|
227
|
+
this.options.arith.isFlat !== false &&
|
|
228
|
+
(op === OP_AND ||
|
|
229
|
+
op === OP_OR ||
|
|
230
|
+
op === OP_ADD ||
|
|
231
|
+
op === OP_BADD ||
|
|
232
|
+
op === OP_BOR ||
|
|
233
|
+
op === OP_BAND ||
|
|
234
|
+
op === OP_BXOR)
|
|
235
|
+
);
|
|
159
236
|
}
|
|
160
237
|
|
|
161
238
|
isRewritingPatterns() {
|
|
@@ -164,7 +241,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
164
241
|
|
|
165
242
|
reduceApp(decl: number, args: number[], sort: number) {
|
|
166
243
|
const manager = this.manager;
|
|
167
|
-
// An uninterpreted application only reduces by pull_ite, which needs two arguments.
|
|
168
244
|
if (
|
|
169
245
|
manager.funcDecls[decl].op === OP_UNINTERPRETED &&
|
|
170
246
|
(args.length !== 2 || this.options.isPullingCheapIte !== true)
|
|
@@ -181,41 +257,54 @@ export class Rewriter extends RewriterTpl {
|
|
|
181
257
|
return this.manager.withTemporaries(() => this.reduceQuantifierCore(expr, body, patterns));
|
|
182
258
|
}
|
|
183
259
|
|
|
184
|
-
// th_rewriter_cfg::reduce_quantifier: a bound Boolean variable among the conjuncts of a universal
|
|
185
|
-
// body or the disjuncts of an existential one decides the quantifier. Otherwise it merges a
|
|
186
|
-
// directly nested quantifier of the same kind when neither has patterns, eliminates unused
|
|
187
|
-
// variables, and applies der to pattern-free quantifiers.
|
|
188
260
|
private reduceQuantifierCore(expr: number, body: number, newPatterns: number[]) {
|
|
189
261
|
const manager = this.manager;
|
|
190
262
|
const data = manager.getQuantifier(expr);
|
|
263
|
+
const isLambda = data.kind === QUANTIFIER_LAMBDA;
|
|
191
264
|
const isNegated = manager.isNot(body);
|
|
192
265
|
const junction = isNegated ? manager.getArg(body, 0) : body;
|
|
193
266
|
if (
|
|
194
|
-
|
|
267
|
+
!isLambda &&
|
|
268
|
+
manager.getOp(junction) ===
|
|
269
|
+
((data.kind === QUANTIFIER_FORALL) !== isNegated ? OP_AND : OP_OR) &&
|
|
195
270
|
manager.someArg(junction, (arg) => {
|
|
196
271
|
const atom = manager.isNot(arg) ? manager.getArg(arg, 0) : arg;
|
|
197
272
|
return manager.kinds[atom] === KIND_VAR && manager.values[atom] < data.sorts.length;
|
|
198
273
|
})
|
|
199
274
|
)
|
|
200
|
-
return data.
|
|
275
|
+
return data.kind === QUANTIFIER_FORALL ? manager.falseExpr : manager.trueExpr;
|
|
201
276
|
const nested =
|
|
202
277
|
manager.kinds[body] === KIND_QUANTIFIER ? manager.getQuantifier(body) : undefined;
|
|
203
|
-
|
|
204
|
-
const patterns = newPatterns.filter((pattern, index) => newPatterns.indexOf(pattern) === index);
|
|
205
|
-
const merged =
|
|
278
|
+
const isMerging =
|
|
206
279
|
nested !== undefined &&
|
|
207
|
-
nested.
|
|
208
|
-
|
|
209
|
-
|
|
210
|
-
|
|
211
|
-
|
|
212
|
-
|
|
213
|
-
|
|
214
|
-
|
|
215
|
-
|
|
216
|
-
|
|
217
|
-
|
|
218
|
-
|
|
280
|
+
nested.kind === data.kind &&
|
|
281
|
+
!isLambda &&
|
|
282
|
+
data.patterns.length + data.noPatterns.length === 0 &&
|
|
283
|
+
nested.patterns.length + nested.noPatterns.length === 0;
|
|
284
|
+
if (!isMerging && isLambda && manager.isGroundApp(body))
|
|
285
|
+
return mkArrayApp(manager, OP_CONST_ARRAY, [body], [manager.sorts[expr]]);
|
|
286
|
+
if (!isMerging && isLambda) {
|
|
287
|
+
const reduced = this.array.mkLambdaCore(expr, body);
|
|
288
|
+
if (reduced !== -1) return reduced;
|
|
289
|
+
}
|
|
290
|
+
const patterns = newPatterns.filter((pattern, index) => newPatterns.indexOf(pattern) === index);
|
|
291
|
+
const merged = isMerging
|
|
292
|
+
? manager.mkQuantifier({
|
|
293
|
+
...data,
|
|
294
|
+
sorts: [...data.sorts, ...nested.sorts],
|
|
295
|
+
names: [...data.names, ...nested.names],
|
|
296
|
+
body: nested.body,
|
|
297
|
+
patterns: [],
|
|
298
|
+
weight: Math.min(data.weight, nested.weight),
|
|
299
|
+
})
|
|
300
|
+
: manager.mkQuantifier({
|
|
301
|
+
...data,
|
|
302
|
+
body,
|
|
303
|
+
patterns: this.substitutePatterns(patterns),
|
|
304
|
+
noPatterns: data.noPatterns.filter(
|
|
305
|
+
(noPattern, index) => data.noPatterns.indexOf(noPattern) === index,
|
|
306
|
+
),
|
|
307
|
+
});
|
|
219
308
|
const reduced = this.unusedVarsEliminator.apply(merged);
|
|
220
309
|
manager.releaseLater(reduced);
|
|
221
310
|
if (
|
|
@@ -232,8 +321,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
232
321
|
return rewritten;
|
|
233
322
|
}
|
|
234
323
|
|
|
235
|
-
// th_rewriter_cfg::apply_subst: the substitution replaces terms in the patterns without rewriting
|
|
236
|
-
// them, like expr_safe_replace.
|
|
237
324
|
private substitutePatterns(patterns: number[]) {
|
|
238
325
|
const manager = this.manager;
|
|
239
326
|
if (this.substitution.size === 0) return patterns;
|
|
@@ -255,7 +342,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
255
342
|
return patterns.map((pattern) => manager.mkPattern(manager.mapArgs(pattern, replace)));
|
|
256
343
|
}
|
|
257
344
|
|
|
258
|
-
// th_rewriter::mk_app: one reduction, without rewriting what it returns.
|
|
259
345
|
mkApp(decl: number, args: number[], sort: number) {
|
|
260
346
|
const reduced = this.reduceAppTop(decl, args, sort);
|
|
261
347
|
return reduced === -1
|
|
@@ -265,7 +351,34 @@ export class Rewriter extends RewriterTpl {
|
|
|
265
351
|
: reduced.expr;
|
|
266
352
|
}
|
|
267
353
|
|
|
268
|
-
//
|
|
354
|
+
// bool_rewriter::mk_app, for a Boolean operator: an equality is not passed to the theories.
|
|
355
|
+
mkBoolApp(decl: number, args: number[], sort: number) {
|
|
356
|
+
const op = this.manager.funcDecls[decl].op;
|
|
357
|
+
const reduced =
|
|
358
|
+
op === OP_EQ
|
|
359
|
+
? this.mkEqCore(args[0], args[1])
|
|
360
|
+
: op === OP_DISTINCT
|
|
361
|
+
? this.mkDistinct(args)
|
|
362
|
+
: op === OP_AND
|
|
363
|
+
? this.mkAndCore(args)
|
|
364
|
+
: op === OP_OR
|
|
365
|
+
? this.mkOr(args)
|
|
366
|
+
: op === OP_NOT
|
|
367
|
+
? this.mkNot(args[0])
|
|
368
|
+
: op === OP_ITE
|
|
369
|
+
? this.mkIte(args[0], args[1], args[2])
|
|
370
|
+
: op === OP_IMPLIES
|
|
371
|
+
? this.mkOr([this.mkNot(args[0]), args[1]])
|
|
372
|
+
: op === OP_XOR
|
|
373
|
+
? this.mkEq(this.mkNot(args[0]), args[1])
|
|
374
|
+
: undefined;
|
|
375
|
+
return reduced === undefined || reduced === -1
|
|
376
|
+
? this.manager.mkApp(decl, args, sort)
|
|
377
|
+
: typeof reduced === "number"
|
|
378
|
+
? reduced
|
|
379
|
+
: reduced.expr;
|
|
380
|
+
}
|
|
381
|
+
|
|
269
382
|
mkAppCore(decl: number, args: number[], sort: number): number {
|
|
270
383
|
const reduced = this.reduceAppTop(decl, args, sort);
|
|
271
384
|
return reduced === -1
|
|
@@ -275,11 +388,25 @@ export class Rewriter extends RewriterTpl {
|
|
|
275
388
|
: this.reduceTo(reduced.expr, getRewriteDepth(reduced));
|
|
276
389
|
}
|
|
277
390
|
|
|
278
|
-
// th_rewriter_cfg::reduce_app: reduce_app_core, then pull_ite with pull_cheap_ite. -1 is BR_FAILED.
|
|
279
391
|
private reduceAppTop(decl: number, args: number[], sort: number) {
|
|
280
392
|
const manager = this.manager;
|
|
281
|
-
const
|
|
282
|
-
if (typeof
|
|
393
|
+
const core = this.reduceAppCore(decl, args);
|
|
394
|
+
if (typeof core !== "number") return core;
|
|
395
|
+
const reduced =
|
|
396
|
+
this.options.isPushingIteBv !== true
|
|
397
|
+
? core
|
|
398
|
+
: core === -1
|
|
399
|
+
? decl === OP_ITE
|
|
400
|
+
? (this.pushIte(args[0], args[1], args[2]) ?? -1)
|
|
401
|
+
: -1
|
|
402
|
+
: this.isIte(core)
|
|
403
|
+
? (this.pushIte(
|
|
404
|
+
manager.getArg(core, 0),
|
|
405
|
+
manager.getArg(core, 1),
|
|
406
|
+
manager.getArg(core, 2),
|
|
407
|
+
) ?? core)
|
|
408
|
+
: core;
|
|
409
|
+
if (this.options.isPullingCheapIte !== true) return reduced;
|
|
283
410
|
if (reduced === -1)
|
|
284
411
|
return (args.length === 2 ? this.pullIte(decl, args[0], args[1], sort) : undefined) ?? -1;
|
|
285
412
|
return manager.kinds[reduced] === KIND_APP && manager.getNumArgs(reduced) === 2
|
|
@@ -292,13 +419,65 @@ export class Rewriter extends RewriterTpl {
|
|
|
292
419
|
: reduced;
|
|
293
420
|
}
|
|
294
421
|
|
|
295
|
-
|
|
296
|
-
|
|
422
|
+
private pushIte(condition: number, thenExpr: number, elseExpr: number) {
|
|
423
|
+
const manager = this.manager;
|
|
424
|
+
const isBvApp = (expr: number) =>
|
|
425
|
+
manager.kinds[expr] === KIND_APP && manager.getFamily(expr) === FAMILY_BV;
|
|
426
|
+
const isThenApp = isBvApp(thenExpr);
|
|
427
|
+
if (!isThenApp && !isBvApp(elseExpr)) return undefined;
|
|
428
|
+
const app = isThenApp ? thenExpr : elseExpr;
|
|
429
|
+
const unified = this.unify(app, isThenApp ? elseExpr : thenExpr);
|
|
430
|
+
if (unified === undefined) return undefined;
|
|
431
|
+
const [newThen, newElse] = isThenApp ? unified.args : [unified.args[1], unified.args[0]];
|
|
432
|
+
const ite = manager.mkApp(OP_ITE, [condition, newThen, newElse], manager.sorts[newThen]);
|
|
433
|
+
const decl = manager.decls[app];
|
|
434
|
+
return manager.mkApp(
|
|
435
|
+
decl,
|
|
436
|
+
unified.isCommonFirst ? [unified.common, ite] : [ite, unified.common],
|
|
437
|
+
manager.funcDecls[decl].range,
|
|
438
|
+
);
|
|
439
|
+
}
|
|
440
|
+
|
|
441
|
+
private unify(app: number, other: number) {
|
|
442
|
+
const manager = this.manager;
|
|
443
|
+
if (manager.getNumArgs(app) !== 2) return undefined;
|
|
444
|
+
const first = manager.getArg(app, 0);
|
|
445
|
+
const second = manager.getArg(app, 1);
|
|
446
|
+
const op = manager.getOp(app);
|
|
447
|
+
const getNeutral = () =>
|
|
448
|
+
op === OP_BADD || op === OP_BMUL
|
|
449
|
+
? manager.mkBvNumeral(op === OP_BADD ? 0n : 1n, manager.getBvSize(manager.sorts[app]))
|
|
450
|
+
: undefined;
|
|
451
|
+
if (other === second || other === first) {
|
|
452
|
+
const neutral = getNeutral();
|
|
453
|
+
return neutral === undefined
|
|
454
|
+
? undefined
|
|
455
|
+
: other === second
|
|
456
|
+
? { args: [first, neutral], common: second, isCommonFirst: false }
|
|
457
|
+
: { args: [second, neutral], common: first, isCommonFirst: true };
|
|
458
|
+
}
|
|
459
|
+
if (manager.kinds[other] !== KIND_APP || manager.decls[other] !== manager.decls[app])
|
|
460
|
+
return undefined;
|
|
461
|
+
if (manager.getNumArgs(other) !== 2) return undefined;
|
|
462
|
+
const otherFirst = manager.getArg(other, 0);
|
|
463
|
+
const otherSecond = manager.getArg(other, 1);
|
|
464
|
+
if (second === otherSecond)
|
|
465
|
+
return { args: [first, otherFirst], common: second, isCommonFirst: false };
|
|
466
|
+
if (first === otherFirst)
|
|
467
|
+
return { args: [second, otherSecond], common: first, isCommonFirst: true };
|
|
468
|
+
if (!isAssociativeBvOp(op) && op !== OP_BCOMP) return undefined;
|
|
469
|
+
if (first === otherSecond)
|
|
470
|
+
return { args: [second, otherFirst], common: first, isCommonFirst: true };
|
|
471
|
+
if (second === otherFirst)
|
|
472
|
+
return { args: [first, otherSecond], common: second, isCommonFirst: false };
|
|
473
|
+
return undefined;
|
|
474
|
+
}
|
|
475
|
+
|
|
297
476
|
private pullIte(decl: number, first: number, second: number, sort: number): Rewrite | undefined {
|
|
298
477
|
const manager = this.manager;
|
|
299
478
|
if (sort === SORT_BOOL && manager.sorts[first] !== SORT_BOOL) {
|
|
300
479
|
if (this.isIte(first)) {
|
|
301
|
-
if (manager.
|
|
480
|
+
if (manager.isValue(second) && manager.getRefCount(first) === 1)
|
|
302
481
|
return this.pullIteCore(decl, first, second, sort, false);
|
|
303
482
|
if (this.isIte(second) && manager.getArg(first, 0) === manager.getArg(second, 0)) {
|
|
304
483
|
const branches = [1, 2].map((index) =>
|
|
@@ -314,20 +493,19 @@ export class Rewriter extends RewriterTpl {
|
|
|
314
493
|
};
|
|
315
494
|
}
|
|
316
495
|
}
|
|
317
|
-
if (this.isIte(second) && manager.
|
|
496
|
+
if (this.isIte(second) && manager.isValue(first) && manager.getRefCount(second) === 1)
|
|
318
497
|
return this.pullIteCore(decl, second, first, sort, true);
|
|
319
498
|
}
|
|
320
499
|
const family = manager.funcDecls[decl].family;
|
|
321
|
-
if (family !== FAMILY_BASIC && family !== FAMILY_ARITH
|
|
322
|
-
|
|
500
|
+
if (family !== FAMILY_BASIC && family !== FAMILY_ARITH && family !== FAMILY_BV)
|
|
501
|
+
return undefined;
|
|
502
|
+
if (manager.isValue(first) && this.isIteValueTree(second))
|
|
323
503
|
return this.pullIteCore(decl, second, first, sort, true);
|
|
324
|
-
if (manager.
|
|
504
|
+
if (manager.isValue(second) && this.isIteValueTree(first))
|
|
325
505
|
return this.pullIteCore(decl, first, second, sort, false);
|
|
326
506
|
return undefined;
|
|
327
507
|
}
|
|
328
508
|
|
|
329
|
-
// pull_ite_core: the value comes first when isSwapped. An equality of a branch and the value is
|
|
330
|
-
// decided when the branch is a value.
|
|
331
509
|
private pullIteCore(
|
|
332
510
|
decl: number,
|
|
333
511
|
ite: number,
|
|
@@ -340,7 +518,7 @@ export class Rewriter extends RewriterTpl {
|
|
|
340
518
|
manager.funcDecls[decl].op === OP_EQ
|
|
341
519
|
? branch === value
|
|
342
520
|
? manager.trueExpr
|
|
343
|
-
:
|
|
521
|
+
: manager.areDistinct(branch, value)
|
|
344
522
|
? manager.falseExpr
|
|
345
523
|
: manager.mkEq(branch, value)
|
|
346
524
|
: manager.mkApp(decl, isSwapped ? [value, branch] : [branch, value], sort),
|
|
@@ -348,7 +526,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
348
526
|
return { expr: manager.mkApp(OP_ITE, [manager.getArg(ite, 0), ...branches], sort), depth: 2 };
|
|
349
527
|
}
|
|
350
528
|
|
|
351
|
-
// is_ite_value_tree: an unshared ite whose leaves are values, through unshared ites.
|
|
352
529
|
private isIteValueTree(expr: number) {
|
|
353
530
|
const manager = this.manager;
|
|
354
531
|
if (!this.isIte(expr) || manager.getRefCount(expr) !== 1) return false;
|
|
@@ -356,21 +533,65 @@ export class Rewriter extends RewriterTpl {
|
|
|
356
533
|
for (let ite = todo.pop(); ite !== undefined; ite = todo.pop()) {
|
|
357
534
|
for (const branch of [manager.getArg(ite, 1), manager.getArg(ite, 2)]) {
|
|
358
535
|
if (this.isIte(branch) && manager.getRefCount(branch) === 1) todo.push(branch);
|
|
359
|
-
else if (!manager.
|
|
536
|
+
else if (!manager.isValue(branch)) return false;
|
|
360
537
|
}
|
|
361
538
|
}
|
|
362
539
|
return true;
|
|
363
540
|
}
|
|
364
541
|
|
|
365
|
-
|
|
542
|
+
private reduceEq(left: number, right: number) {
|
|
543
|
+
const manager = this.manager;
|
|
544
|
+
const sort = manager.sorts[left];
|
|
545
|
+
const theoryResult = isArithSort(sort)
|
|
546
|
+
? this.arith.mkEq(left, right)
|
|
547
|
+
: manager.isBvSort(sort)
|
|
548
|
+
? this.bv.mkEqCore(left, right)
|
|
549
|
+
: manager.isDatatypeSort(sort)
|
|
550
|
+
? mkDatatypeEqCore(manager, left, right)
|
|
551
|
+
: manager.isArraySort(sort)
|
|
552
|
+
? this.array.mkEqCore(left, right)
|
|
553
|
+
: manager.getSortFamily(sort) === FAMILY_FPA
|
|
554
|
+
? mkFpaEqCore(manager, left, right)
|
|
555
|
+
: manager.getSortFamily(sort) === FAMILY_SEQ
|
|
556
|
+
? this.seq.mkEqCore(left, right)
|
|
557
|
+
: undefined;
|
|
558
|
+
if (theoryResult !== undefined) return theoryResult;
|
|
559
|
+
if (manager.getOp(left) === OP_UBV2INT || manager.getOp(right) === OP_UBV2INT) {
|
|
560
|
+
const bv2intResult = this.bv.mkEqBv2int(left, right);
|
|
561
|
+
if (bv2intResult !== undefined) return bv2intResult;
|
|
562
|
+
}
|
|
563
|
+
return this.applyTamagotchi(left, right) ?? this.applyTamagotchi(right, left);
|
|
564
|
+
}
|
|
565
|
+
|
|
566
|
+
private applyTamagotchi(eq: number, other: number): Rewrite | undefined {
|
|
567
|
+
const manager = this.manager;
|
|
568
|
+
const eqBit = this.bv.getEqBit(eq);
|
|
569
|
+
if (eqBit === undefined) return undefined;
|
|
570
|
+
const bit = manager.mkBvNumeral(eqBit.bit, 1);
|
|
571
|
+
const otherBit = manager.mkBvNumeral(1n - eqBit.bit, 1);
|
|
572
|
+
const ite = manager.mkApp(OP_ITE, [other, bit, otherBit], manager.sorts[bit]);
|
|
573
|
+
return { expr: manager.mkEq(eqBit.term, ite), depth: 2 };
|
|
574
|
+
}
|
|
575
|
+
|
|
366
576
|
reduceAppCore(decl: number, args: number[]): number | Rewrite {
|
|
367
577
|
const manager = this.manager;
|
|
368
|
-
const
|
|
578
|
+
const funcDecl = manager.funcDecls[decl];
|
|
579
|
+
if (funcDecl.family === FAMILY_BV) return this.bv.mkAppCore(decl, args) ?? -1;
|
|
580
|
+
if (funcDecl.family === FAMILY_ARRAY) return this.array.mkAppCore(funcDecl.op, args) ?? -1;
|
|
581
|
+
if (funcDecl.family === FAMILY_DATATYPE) return mkDatatypeAppCore(manager, decl, args) ?? -1;
|
|
582
|
+
if (funcDecl.family === FAMILY_FPA) return mkFpaAppCore(manager, decl, args) ?? -1;
|
|
583
|
+
if (funcDecl.family === FAMILY_PB) return mkPbAppCore(manager, decl, args);
|
|
584
|
+
if (funcDecl.family === FAMILY_SEQ || funcDecl.family === FAMILY_CHAR)
|
|
585
|
+
return this.seq.mkAppCore(decl, args) ?? -1;
|
|
586
|
+
if (funcDecl.family === FAMILY_RECFUN) return mkRecFunApp(manager, decl, args) ?? -1;
|
|
587
|
+
const op = funcDecl.op;
|
|
369
588
|
switch (op) {
|
|
370
589
|
case OP_AND:
|
|
371
|
-
return
|
|
590
|
+
return (
|
|
591
|
+
(manager.isReUsed ? this.seq.mkBoolApp(true, args) : undefined) ?? this.mkAndCore(args)
|
|
592
|
+
);
|
|
372
593
|
case OP_OR:
|
|
373
|
-
return this.mkOr(args);
|
|
594
|
+
return (manager.isReUsed ? this.seq.mkBoolApp(false, args) : undefined) ?? this.mkOr(args);
|
|
374
595
|
case OP_NOT:
|
|
375
596
|
return this.mkNot(args[0]);
|
|
376
597
|
case OP_IMPLIES:
|
|
@@ -379,14 +600,25 @@ export class Rewriter extends RewriterTpl {
|
|
|
379
600
|
return this.mkEq(this.mkNot(args[0]), args[1]);
|
|
380
601
|
case OP_EQ:
|
|
381
602
|
return (
|
|
382
|
-
|
|
603
|
+
this.reduceEq(args[0], args[1]) ??
|
|
604
|
+
(manager.isSeqUsed && manager.getFamily(args[0]) === FAMILY_SEQ
|
|
605
|
+
? this.seq.mkEqCore(args[0], args[1])
|
|
606
|
+
: undefined) ??
|
|
383
607
|
this.mkEqCore(args[0], args[1]) ??
|
|
384
608
|
-1
|
|
385
609
|
);
|
|
386
610
|
case OP_DISTINCT:
|
|
387
|
-
return
|
|
611
|
+
return (
|
|
612
|
+
(args.length > 0 && manager.isBvSort(manager.sorts[args[0]])
|
|
613
|
+
? this.bv.mkDistinct(args)
|
|
614
|
+
: undefined) ?? this.mkDistinct(args)
|
|
615
|
+
);
|
|
388
616
|
case OP_ITE:
|
|
389
|
-
return
|
|
617
|
+
return (
|
|
618
|
+
(manager.isBvSort(manager.sorts[args[1]])
|
|
619
|
+
? this.bv.mkIteCore(args[0], args[1], args[2])
|
|
620
|
+
: undefined) ?? this.mkIte(args[0], args[1], args[2])
|
|
621
|
+
);
|
|
390
622
|
case OP_LE:
|
|
391
623
|
return this.arith.mkLe(args[0], args[1]) ?? -1;
|
|
392
624
|
case OP_GE:
|
|
@@ -396,7 +628,7 @@ export class Rewriter extends RewriterTpl {
|
|
|
396
628
|
case OP_GT:
|
|
397
629
|
return this.arith.mkGt(args[0], args[1]);
|
|
398
630
|
case OP_ADD:
|
|
399
|
-
return this.arith.
|
|
631
|
+
return this.arith.mkAddCore(args) ?? -1;
|
|
400
632
|
case OP_SUB:
|
|
401
633
|
return this.arith.mkSub(args);
|
|
402
634
|
case OP_UMINUS:
|
|
@@ -407,6 +639,8 @@ export class Rewriter extends RewriterTpl {
|
|
|
407
639
|
return this.arith.mkIdiv(args[0], args[1]) ?? -1;
|
|
408
640
|
case OP_MOD:
|
|
409
641
|
return this.arith.mkMod(args[0], args[1]) ?? -1;
|
|
642
|
+
case OP_REM:
|
|
643
|
+
return this.arith.mkRem(args[0], args[1]) ?? -1;
|
|
410
644
|
case OP_ABS:
|
|
411
645
|
return this.arith.mkAbs(args[0]);
|
|
412
646
|
case OP_DIV:
|
|
@@ -417,12 +651,29 @@ export class Rewriter extends RewriterTpl {
|
|
|
417
651
|
return this.arith.mkToInt(args[0]) ?? -1;
|
|
418
652
|
case OP_IS_INT:
|
|
419
653
|
return this.arith.mkIsInt(args[0]);
|
|
654
|
+
case OP_POWER:
|
|
655
|
+
return this.arith.mkPower(args[0], args[1]) ?? -1;
|
|
656
|
+
case OP_SIN:
|
|
657
|
+
return this.arith.mkSin(args[0]) ?? -1;
|
|
658
|
+
case OP_COS:
|
|
659
|
+
return this.arith.mkCos(args[0]) ?? -1;
|
|
660
|
+
case OP_TAN:
|
|
661
|
+
return this.arith.mkTan(args[0]) ?? -1;
|
|
662
|
+
case OP_ASIN:
|
|
663
|
+
return this.arith.mkAsin(args[0]) ?? -1;
|
|
664
|
+
case OP_ACOS:
|
|
665
|
+
return this.arith.mkAcos(args[0]) ?? -1;
|
|
666
|
+
case OP_ATAN:
|
|
667
|
+
return this.arith.mkAtan(args[0]) ?? -1;
|
|
668
|
+
case OP_SINH:
|
|
669
|
+
case OP_COSH:
|
|
670
|
+
case OP_TANH:
|
|
671
|
+
return this.arith.mkHyperbolic(op, args[0]) ?? -1;
|
|
420
672
|
default:
|
|
421
673
|
return -1;
|
|
422
674
|
}
|
|
423
675
|
}
|
|
424
676
|
|
|
425
|
-
// bool_rewriter::mk_not: (not (= a b)) of Booleans is (= (not a) b).
|
|
426
677
|
mkNot(arg: number): number {
|
|
427
678
|
const manager = this.manager;
|
|
428
679
|
if (manager.isNot(arg)) return manager.getArg(arg, 0);
|
|
@@ -431,12 +682,10 @@ export class Rewriter extends RewriterTpl {
|
|
|
431
682
|
return manager.mkNot(arg);
|
|
432
683
|
}
|
|
433
684
|
|
|
434
|
-
// bool_rewriter::mk_flat_or_core and mk_nflat_or_core: lifts the disjuncts of nested disjunctions
|
|
435
|
-
// one level, drops false and duplicates, and detects true or a complementary pair. With
|
|
436
|
-
// sort_disjunctions, a disjunction that changed or is out of ast_lt's order is stably sorted by id.
|
|
437
685
|
mkOr(args: number[]): number {
|
|
438
686
|
const manager = this.manager;
|
|
439
|
-
const isNested =
|
|
687
|
+
const isNested =
|
|
688
|
+
this.options.isFlatAndOr !== false && args.some((arg) => manager.getOp(arg) === OP_OR);
|
|
440
689
|
const flatArgs = isNested ? this.flattenArgs(args, OP_OR) : args;
|
|
441
690
|
const literals = manager.flatLiterals;
|
|
442
691
|
literals.clear();
|
|
@@ -446,25 +695,163 @@ export class Rewriter extends RewriterTpl {
|
|
|
446
695
|
if (literals.add(arg)) return manager.trueExpr;
|
|
447
696
|
}
|
|
448
697
|
const result = literals.list;
|
|
698
|
+
const limit = this.options.localCtxLimit;
|
|
699
|
+
if (result.length > 1 && limit !== undefined && this.localCtxCost <= limit) {
|
|
700
|
+
const simplified = manager.withTemporaries(() => this.simplifyLocalCtx([...result]));
|
|
701
|
+
if (simplified !== -1) {
|
|
702
|
+
manager.releaseLater(simplified);
|
|
703
|
+
return simplified;
|
|
704
|
+
}
|
|
705
|
+
}
|
|
449
706
|
const isOutOfOrder = result.some(
|
|
450
707
|
(arg, index) => index > 0 && isAstLess(manager, arg, result[index - 1]),
|
|
451
708
|
);
|
|
452
|
-
// Dropping false or a duplicate disjunct also sets mk_nflat_or_core's s.
|
|
453
709
|
if (isNested || result.length !== flatArgs.length || isOutOfOrder)
|
|
454
710
|
sortByKey(result, (arg) => manager.ids[arg]);
|
|
455
711
|
return manager.mkOr(result);
|
|
456
712
|
}
|
|
457
713
|
|
|
458
|
-
|
|
459
|
-
|
|
714
|
+
private simplifyNestedNotOr(args: number[], negatives: Set<number>, positives: Set<number>) {
|
|
715
|
+
const manager = this.manager;
|
|
716
|
+
this.localCtxCost += args.length;
|
|
717
|
+
const kept: number[] = [];
|
|
718
|
+
let isSimplified = false;
|
|
719
|
+
for (const arg of args) {
|
|
720
|
+
if (negatives.has(arg)) return manager.falseExpr;
|
|
721
|
+
if (positives.has(arg)) {
|
|
722
|
+
isSimplified = true;
|
|
723
|
+
continue;
|
|
724
|
+
}
|
|
725
|
+
if (manager.isNot(arg)) {
|
|
726
|
+
const atom = manager.getArg(arg, 0);
|
|
727
|
+
if (negatives.has(atom)) {
|
|
728
|
+
isSimplified = true;
|
|
729
|
+
continue;
|
|
730
|
+
}
|
|
731
|
+
if (positives.has(atom)) return manager.falseExpr;
|
|
732
|
+
}
|
|
733
|
+
kept.push(arg);
|
|
734
|
+
}
|
|
735
|
+
if (!isSimplified) return -1;
|
|
736
|
+
if (kept.length === 0) return manager.trueExpr;
|
|
737
|
+
return kept.length === 1 ? this.mkNot(kept[0]) : manager.mkNot(manager.mkOr(kept));
|
|
738
|
+
}
|
|
739
|
+
|
|
740
|
+
private simplifyLiteral(arg: number, negatives: Set<number>, positives: Set<number>) {
|
|
741
|
+
const manager = this.manager;
|
|
742
|
+
const isNegated = manager.isNot(arg);
|
|
743
|
+
const atom = isNegated ? manager.getArg(arg, 0) : arg;
|
|
744
|
+
if (negatives.has(atom)) return isNegated ? manager.falseExpr : manager.trueExpr;
|
|
745
|
+
if (positives.has(atom)) return isNegated ? manager.trueExpr : manager.falseExpr;
|
|
746
|
+
return arg;
|
|
747
|
+
}
|
|
748
|
+
|
|
749
|
+
private mkNestedIte(condition: number, thenExpr: number, elseExpr: number) {
|
|
750
|
+
const manager = this.manager;
|
|
751
|
+
if (manager.isTrue(condition)) return thenExpr;
|
|
752
|
+
if (manager.isFalse(condition)) return elseExpr;
|
|
753
|
+
if (thenExpr === elseExpr) return thenExpr;
|
|
754
|
+
if (manager.sorts[thenExpr] === SORT_BOOL) {
|
|
755
|
+
if (manager.isTrue(thenExpr))
|
|
756
|
+
return manager.isFalse(elseExpr) ? condition : manager.mkOr([condition, elseExpr]);
|
|
757
|
+
if (manager.isFalse(thenExpr))
|
|
758
|
+
return manager.isTrue(elseExpr)
|
|
759
|
+
? this.mkNot(condition)
|
|
760
|
+
: manager.mkNot(manager.mkOr([condition, this.mkNot(elseExpr)]));
|
|
761
|
+
if (manager.isTrue(elseExpr)) return manager.mkOr([this.mkNot(condition), thenExpr]);
|
|
762
|
+
if (manager.isFalse(elseExpr) || condition === elseExpr)
|
|
763
|
+
return manager.mkNot(manager.mkOr([this.mkNot(condition), this.mkNot(thenExpr)]));
|
|
764
|
+
if (condition === thenExpr) return manager.mkOr([condition, elseExpr]);
|
|
765
|
+
if (
|
|
766
|
+
(manager.isNot(thenExpr) && manager.getArg(thenExpr, 0) === elseExpr) ||
|
|
767
|
+
(manager.isNot(elseExpr) && manager.getArg(elseExpr, 0) === thenExpr)
|
|
768
|
+
)
|
|
769
|
+
return this.mkEq(condition, thenExpr);
|
|
770
|
+
}
|
|
771
|
+
return manager.mkApp(OP_ITE, [condition, thenExpr, elseExpr], manager.sorts[thenExpr]);
|
|
772
|
+
}
|
|
773
|
+
|
|
774
|
+
private simplifyNestedEqIte(form: number, negatives: Set<number>, positives: Set<number>) {
|
|
775
|
+
const manager = this.manager;
|
|
776
|
+
this.localCtxCost += 3;
|
|
777
|
+
const isNegated = manager.isNot(form);
|
|
778
|
+
const atom = isNegated ? manager.getArg(form, 0) : form;
|
|
779
|
+
const op = manager.getOp(atom);
|
|
780
|
+
if (op !== OP_EQ && op !== OP_ITE) return -1;
|
|
781
|
+
const args = manager.getArgs(atom);
|
|
782
|
+
const simplified = args.map((arg) => this.simplifyLiteral(arg, negatives, positives));
|
|
783
|
+
if (simplified.every((arg, index) => arg === args[index])) return -1;
|
|
784
|
+
const result =
|
|
785
|
+
op === OP_EQ
|
|
786
|
+
? this.mkEq(simplified[0], simplified[1])
|
|
787
|
+
: this.mkNestedIte(simplified[0], simplified[1], simplified[2]);
|
|
788
|
+
return isNegated ? this.mkNot(result) : result;
|
|
789
|
+
}
|
|
790
|
+
|
|
791
|
+
private simplifyLocalCtx(initialArgs: number[]) {
|
|
792
|
+
const manager = this.manager;
|
|
793
|
+
let args = initialArgs;
|
|
794
|
+
let isSimplified = false;
|
|
795
|
+
let isModified = false;
|
|
796
|
+
let isForward = true;
|
|
797
|
+
for (;;) {
|
|
798
|
+
const negatives = new Set<number>();
|
|
799
|
+
const positives = new Set<number>();
|
|
800
|
+
const kept: number[] = [];
|
|
801
|
+
const push = (arg: number) => {
|
|
802
|
+
const isNegated = manager.isNot(arg);
|
|
803
|
+
const marks = isNegated ? negatives : positives;
|
|
804
|
+
const atom = isNegated ? manager.getArg(arg, 0) : arg;
|
|
805
|
+
if (marks.has(atom)) return;
|
|
806
|
+
marks.add(atom);
|
|
807
|
+
kept.push(arg);
|
|
808
|
+
};
|
|
809
|
+
this.localCtxCost += 2 * args.length;
|
|
810
|
+
const order = isForward ? args : [...args].reverse();
|
|
811
|
+
for (const original of order) {
|
|
812
|
+
let arg = original;
|
|
813
|
+
if (manager.isNot(arg) && manager.getOp(manager.getArg(arg, 0)) === OP_OR) {
|
|
814
|
+
const nested = this.simplifyNestedNotOr(
|
|
815
|
+
manager.getArgs(manager.getArg(arg, 0)),
|
|
816
|
+
negatives,
|
|
817
|
+
positives,
|
|
818
|
+
);
|
|
819
|
+
if (nested !== -1) {
|
|
820
|
+
isModified = true;
|
|
821
|
+
isSimplified = true;
|
|
822
|
+
arg = nested;
|
|
823
|
+
}
|
|
824
|
+
}
|
|
825
|
+
const nested = this.simplifyNestedEqIte(arg, negatives, positives);
|
|
826
|
+
if (nested !== -1) {
|
|
827
|
+
isModified = true;
|
|
828
|
+
isSimplified = true;
|
|
829
|
+
arg = nested;
|
|
830
|
+
}
|
|
831
|
+
if (manager.isFalse(arg)) continue;
|
|
832
|
+
if (manager.isTrue(arg)) return arg;
|
|
833
|
+
if (this.options.isFlatAndOr !== false && manager.getOp(arg) === OP_OR)
|
|
834
|
+
for (const inner of manager.getArgs(arg)) push(inner);
|
|
835
|
+
else push(arg);
|
|
836
|
+
}
|
|
837
|
+
if (!isForward) {
|
|
838
|
+
if (!isModified) return isSimplified ? manager.mkOr(args) : -1;
|
|
839
|
+
kept.reverse();
|
|
840
|
+
isModified = false;
|
|
841
|
+
}
|
|
842
|
+
isForward = !isForward;
|
|
843
|
+
args = kept;
|
|
844
|
+
}
|
|
845
|
+
}
|
|
846
|
+
|
|
460
847
|
private mkAndCore(args: number[]): number | Rewrite {
|
|
461
848
|
const manager = this.manager;
|
|
462
849
|
if (this.options.isEliminatingAnd) return this.mkAndAsOr(args);
|
|
463
|
-
if (!args.some((arg) => manager.getOp(arg) === OP_AND))
|
|
850
|
+
if (this.options.isFlatAndOr === false || !args.some((arg) => manager.getOp(arg) === OP_AND))
|
|
851
|
+
return this.mkNflatAnd(args);
|
|
464
852
|
return { expr: this.mkNflatAnd(this.flattenArgs(args, OP_AND)), depth: 1 };
|
|
465
853
|
}
|
|
466
854
|
|
|
467
|
-
// The arguments with those that apply op replaced by their own arguments, one level deep.
|
|
468
855
|
private flattenArgs(args: number[], op: number) {
|
|
469
856
|
const manager = this.manager;
|
|
470
857
|
const flatArgs: number[] = [];
|
|
@@ -474,14 +861,11 @@ export class Rewriter extends RewriterTpl {
|
|
|
474
861
|
return flatArgs;
|
|
475
862
|
}
|
|
476
863
|
|
|
477
|
-
// bool_rewriter::mk_and, which takes the result of mk_and_core as it is.
|
|
478
864
|
mkAnd(args: number[]): number {
|
|
479
865
|
const result = this.mkAndCore(args);
|
|
480
866
|
return typeof result === "number" ? result : result.expr;
|
|
481
867
|
}
|
|
482
868
|
|
|
483
|
-
// bool_rewriter::mk_nflat_and_core: drops true and duplicates, and detects false or a complementary
|
|
484
|
-
// pair.
|
|
485
869
|
private mkNflatAnd(args: number[]) {
|
|
486
870
|
const manager = this.manager;
|
|
487
871
|
const literals = manager.flatLiterals;
|
|
@@ -495,8 +879,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
495
879
|
return result.length === 1 ? result[0] : manager.mkAnd(result);
|
|
496
880
|
}
|
|
497
881
|
|
|
498
|
-
// bool_rewriter::mk_and_as_or: the negation of the disjunction of the negated conjuncts. Each
|
|
499
|
-
// negation is built with its own temporaries, and the negations outlive the disjunction.
|
|
500
882
|
private mkAndAsOr(args: number[]) {
|
|
501
883
|
const manager = this.manager;
|
|
502
884
|
const negations = args.map((arg) => manager.withTemporaries(() => this.mkNot(arg)));
|
|
@@ -506,14 +888,12 @@ export class Rewriter extends RewriterTpl {
|
|
|
506
888
|
return result;
|
|
507
889
|
}
|
|
508
890
|
|
|
509
|
-
// try_ite_eq: (ite c t e) = t is c when e is a value distinct from t, and likewise for e. The main
|
|
510
|
-
// loop rewrites the result again.
|
|
511
891
|
private tryIteEq(ite: number, other: number): Rewrite | undefined {
|
|
512
892
|
const manager = this.manager;
|
|
513
893
|
if (!this.isIte(ite)) return undefined;
|
|
514
|
-
if (manager.getArg(ite, 1) === other &&
|
|
894
|
+
if (manager.getArg(ite, 1) === other && manager.areDistinct(manager.getArg(ite, 2), other))
|
|
515
895
|
return { expr: manager.getArg(ite, 0), depth: 1 };
|
|
516
|
-
if (manager.getArg(ite, 2) === other &&
|
|
896
|
+
if (manager.getArg(ite, 2) === other && manager.areDistinct(manager.getArg(ite, 1), other))
|
|
517
897
|
return { expr: manager.mkNot(manager.getArg(ite, 0)), depth: 1 };
|
|
518
898
|
return undefined;
|
|
519
899
|
}
|
|
@@ -522,16 +902,10 @@ export class Rewriter extends RewriterTpl {
|
|
|
522
902
|
return this.manager.getOp(expr) === OP_ITE;
|
|
523
903
|
}
|
|
524
904
|
|
|
525
|
-
private areDistinct(first: number, second: number) {
|
|
526
|
-
const manager = this.manager;
|
|
527
|
-
return first !== second && manager.isUniqueValue(first) && manager.isUniqueValue(second);
|
|
528
|
-
}
|
|
529
|
-
|
|
530
|
-
// The ite_extra_rules of mk_eq_core: an ite against a value, or two ites of values.
|
|
531
905
|
private mkIteValueEq(left: number, right: number): number | Rewrite | undefined {
|
|
532
906
|
const manager = this.manager;
|
|
533
|
-
if (this.isIte(left) && manager.
|
|
534
|
-
if (this.isIte(right) && manager.
|
|
907
|
+
if (this.isIte(left) && manager.isValue(right)) return this.tryIteValue(left, right);
|
|
908
|
+
if (this.isIte(right) && manager.isValue(left)) return this.tryIteValue(right, left);
|
|
535
909
|
if (
|
|
536
910
|
!this.isIte(left) ||
|
|
537
911
|
!this.isIte(right) ||
|
|
@@ -540,7 +914,7 @@ export class Rewriter extends RewriterTpl {
|
|
|
540
914
|
manager.getArg(left, 2),
|
|
541
915
|
manager.getArg(right, 1),
|
|
542
916
|
manager.getArg(right, 2),
|
|
543
|
-
].every((arg) => manager.
|
|
917
|
+
].every((arg) => manager.isValue(arg))
|
|
544
918
|
)
|
|
545
919
|
return undefined;
|
|
546
920
|
const mkOr = (args: number[]) => manager.mkApp(OP_OR, args, SORT_BOOL);
|
|
@@ -569,35 +943,30 @@ export class Rewriter extends RewriterTpl {
|
|
|
569
943
|
return { expr: manager.mkApp(OP_AND, clauses, SORT_BOOL), depth: Infinity };
|
|
570
944
|
}
|
|
571
945
|
|
|
572
|
-
// try_ite_value: (ite c t e) = v for a value v. It builds its results without rewriting them, and
|
|
573
|
-
// the main loop rewrites them again.
|
|
574
946
|
private tryIteValue(ite: number, value: number): number | Rewrite | undefined {
|
|
575
947
|
const manager = this.manager;
|
|
576
948
|
const condition = manager.getArg(ite, 0);
|
|
577
949
|
const thenExpr = manager.getArg(ite, 1);
|
|
578
950
|
const elseExpr = manager.getArg(ite, 2);
|
|
579
|
-
// An equality of a branch is the first write to the result.
|
|
580
951
|
const write = (result: number) => {
|
|
581
952
|
this.releaseResult();
|
|
582
953
|
return result;
|
|
583
954
|
};
|
|
584
|
-
// Z3 rewrites the equality of a branch only below depth 500.
|
|
585
955
|
const mkBranchEq = (branch: number) =>
|
|
586
956
|
write(manager.depths[branch] < 500 ? this.mkEq(branch, value) : manager.mkEq(branch, value));
|
|
587
|
-
// mk_eq_plain.
|
|
588
957
|
const mkPlainEq = (branch: number) =>
|
|
589
958
|
branch === value
|
|
590
959
|
? manager.trueExpr
|
|
591
|
-
:
|
|
960
|
+
: manager.areDistinct(branch, value)
|
|
592
961
|
? manager.falseExpr
|
|
593
962
|
: manager.mkEq(branch, value);
|
|
594
963
|
const mkAnd = (first: number, second: number) =>
|
|
595
964
|
manager.mkApp(OP_AND, [first, second], SORT_BOOL);
|
|
596
965
|
const mkOr = (first: number, second: number) =>
|
|
597
966
|
manager.mkApp(OP_OR, [first, second], SORT_BOOL);
|
|
598
|
-
if (
|
|
967
|
+
if (manager.areDistinct(value, elseExpr))
|
|
599
968
|
return { expr: mkAnd(mkBranchEq(thenExpr), condition), depth: 2 };
|
|
600
|
-
if (
|
|
969
|
+
if (manager.areDistinct(value, thenExpr))
|
|
601
970
|
return { expr: mkAnd(mkBranchEq(elseExpr), manager.mkNot(condition)), depth: 2 };
|
|
602
971
|
if (value === thenExpr)
|
|
603
972
|
return value === elseExpr
|
|
@@ -607,8 +976,8 @@ export class Rewriter extends RewriterTpl {
|
|
|
607
976
|
return { expr: mkOr(write(this.mkEq(thenExpr, value)), manager.mkNot(condition)), depth: 2 };
|
|
608
977
|
const isValueIte = (expr: number) =>
|
|
609
978
|
this.isIte(expr) &&
|
|
610
|
-
manager.
|
|
611
|
-
manager.
|
|
979
|
+
manager.isValue(manager.getArg(expr, 1)) &&
|
|
980
|
+
manager.isValue(manager.getArg(expr, 2));
|
|
612
981
|
const getExpr = (result: number | Rewrite) =>
|
|
613
982
|
typeof result === "number" ? result : result.expr;
|
|
614
983
|
const thenEq = isValueIte(thenExpr) ? this.tryIteValue(thenExpr, value) : undefined;
|
|
@@ -621,12 +990,10 @@ export class Rewriter extends RewriterTpl {
|
|
|
621
990
|
const branches = [mkPlainEq(thenExpr), getExpr(elseEq)];
|
|
622
991
|
return { expr: manager.mkApp(OP_ITE, [condition, ...branches], SORT_BOOL), depth: 2 };
|
|
623
992
|
}
|
|
624
|
-
// simplify_eq_ite's result is written even when it is null.
|
|
625
993
|
this.releaseResult();
|
|
626
994
|
return this.isDisjointFrom(ite, value) ? manager.falseExpr : undefined;
|
|
627
995
|
}
|
|
628
996
|
|
|
629
|
-
// simplify_eq_ite: whether every leaf of a tree of ites is a value distinct from the value.
|
|
630
997
|
private isDisjointFrom(ite: number, value: number) {
|
|
631
998
|
const manager = this.manager;
|
|
632
999
|
const visited = new Set<number>();
|
|
@@ -635,14 +1002,13 @@ export class Rewriter extends RewriterTpl {
|
|
|
635
1002
|
const expr = todo.pop() ?? ite;
|
|
636
1003
|
if (visited.has(expr)) continue;
|
|
637
1004
|
visited.add(expr);
|
|
638
|
-
if (
|
|
1005
|
+
if (manager.isValue(expr) && manager.areDistinct(expr, value)) continue;
|
|
639
1006
|
if (!this.isIte(expr)) return false;
|
|
640
1007
|
todo.push(manager.getArg(expr, 1), manager.getArg(expr, 2));
|
|
641
1008
|
}
|
|
642
1009
|
return true;
|
|
643
1010
|
}
|
|
644
1011
|
|
|
645
|
-
// bool_rewriter::mk_eq, which does not rewrite the result of mk_eq_core again.
|
|
646
1012
|
mkEq(left: number, right: number): number {
|
|
647
1013
|
const result = this.mkEqCore(left, right);
|
|
648
1014
|
return result === undefined
|
|
@@ -652,12 +1018,10 @@ export class Rewriter extends RewriterTpl {
|
|
|
652
1018
|
: result.expr;
|
|
653
1019
|
}
|
|
654
1020
|
|
|
655
|
-
// bool_rewriter::mk_eq_core, after arith_rewriter::mk_eq_core folds numerals.
|
|
656
1021
|
private mkEqCore(inputLeft: number, inputRight: number): number | Rewrite | undefined {
|
|
657
1022
|
const manager = this.manager;
|
|
658
1023
|
if (inputLeft === inputRight) return manager.trueExpr;
|
|
659
|
-
if (manager.
|
|
660
|
-
return manager.falseExpr;
|
|
1024
|
+
if (manager.areDistinct(inputLeft, inputRight)) return manager.falseExpr;
|
|
661
1025
|
const iteEq = this.tryIteEq(inputLeft, inputRight) ?? this.tryIteEq(inputRight, inputLeft);
|
|
662
1026
|
if (iteEq !== undefined) return iteEq;
|
|
663
1027
|
const iteValueEq = this.mkIteValueEq(inputLeft, inputRight);
|
|
@@ -677,7 +1041,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
677
1041
|
if (manager.isNot(lhs))
|
|
678
1042
|
return { expr: manager.mkNot(manager.mkEq(manager.getArg(lhs, 0), rhs)), depth: 2 };
|
|
679
1043
|
if (isUnfolded) return { expr: manager.mkEq(lhs, rhs), depth: 1 };
|
|
680
|
-
// (= (= a b) (= a (not b))) is false.
|
|
681
1044
|
if (manager.getOp(lhs) === OP_EQ && manager.getOp(rhs) === OP_EQ) {
|
|
682
1045
|
const isNegationOf = (expr: number, other: number) =>
|
|
683
1046
|
manager.isNot(expr) && manager.getArg(expr, 0) === other;
|
|
@@ -694,34 +1057,44 @@ export class Rewriter extends RewriterTpl {
|
|
|
694
1057
|
return undefined;
|
|
695
1058
|
}
|
|
696
1059
|
|
|
697
|
-
//
|
|
698
|
-
// again, since mk_eq may dispatch to other rewriters. Z3 keeps a longer distinct, which tlapm does
|
|
699
|
-
// not send, and this port expands it into disequalities.
|
|
1060
|
+
// Z3 keeps a distinct of more than two arguments, which tlapm does not send, where this expands it into disequalities.
|
|
700
1061
|
private mkDistinct(args: number[]): number | Rewrite {
|
|
1062
|
+
const manager = this.manager;
|
|
1063
|
+
if (args.length <= 1) return manager.trueExpr;
|
|
701
1064
|
if (args.length === 2) return { expr: this.mkNot(this.mkEq(args[0], args[1])), depth: 2 };
|
|
1065
|
+
if (new Set(args).size < args.length) return manager.falseExpr;
|
|
1066
|
+
const firstNonValue = args.findIndex((arg) => !manager.isUniqueValue(arg));
|
|
1067
|
+
const isAllDifferent = args.every(
|
|
1068
|
+
(arg, index) =>
|
|
1069
|
+
firstNonValue === -1 ||
|
|
1070
|
+
index < firstNonValue ||
|
|
1071
|
+
args.slice(0, index).every((previous) => manager.areDistinct(arg, previous)),
|
|
1072
|
+
);
|
|
1073
|
+
if (isAllDifferent) return manager.trueExpr;
|
|
1074
|
+
if (manager.sorts[args[0]] === SORT_BOOL) return manager.falseExpr;
|
|
1075
|
+
if (
|
|
1076
|
+
this.options.isKeepingDistinct === true ||
|
|
1077
|
+
args.length >= (this.options.blastDistinctThreshold ?? Infinity)
|
|
1078
|
+
)
|
|
1079
|
+
return -1;
|
|
702
1080
|
const pairs: number[] = [];
|
|
703
1081
|
for (let left = 0; left < args.length; left++)
|
|
704
1082
|
for (let right = left + 1; right < args.length; right++)
|
|
705
|
-
pairs.push(
|
|
706
|
-
return
|
|
1083
|
+
pairs.push(manager.mkNot(manager.mkEq(args[left], args[right])));
|
|
1084
|
+
return { expr: manager.mkAnd(pairs), depth: 3 };
|
|
707
1085
|
}
|
|
708
1086
|
|
|
709
|
-
|
|
710
|
-
// only the condition or a branch in sequence, and a result that it builds from new terms comes as a
|
|
711
|
-
// Rewrite for the main loop.
|
|
712
|
-
private mkIte(inputCondition: number, inputThen: number, inputElse: number): number | Rewrite {
|
|
1087
|
+
mkIte(inputCondition: number, inputThen: number, inputElse: number): number | Rewrite {
|
|
713
1088
|
const manager = this.manager;
|
|
714
1089
|
const isNegated = manager.isNot(inputCondition);
|
|
715
1090
|
const condition = isNegated ? manager.getArg(inputCondition, 0) : inputCondition;
|
|
716
1091
|
const elseCandidate = isNegated ? inputThen : inputElse;
|
|
717
1092
|
const thenCandidate = isNegated ? inputElse : inputThen;
|
|
718
|
-
// (ite c (ite c t1 t2) t3) is (ite c t1 t3).
|
|
719
1093
|
const thenExpr =
|
|
720
1094
|
this.isIte(thenCandidate) && manager.getArg(thenCandidate, 0) === condition
|
|
721
1095
|
? manager.getArg(thenCandidate, 1)
|
|
722
1096
|
: thenCandidate;
|
|
723
1097
|
const sort = manager.sorts[thenExpr];
|
|
724
|
-
// (ite c t1 (ite c2 t1 t2)) is (ite (or c c2) t1 t2).
|
|
725
1098
|
if (this.isIte(elseCandidate) && manager.getArg(elseCandidate, 1) === thenExpr) {
|
|
726
1099
|
const disjunction = manager.mkApp(
|
|
727
1100
|
OP_OR,
|
|
@@ -737,7 +1110,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
737
1110
|
depth: 3,
|
|
738
1111
|
};
|
|
739
1112
|
}
|
|
740
|
-
// (ite c t1 (ite c t2 t3)) is (ite c t1 t3).
|
|
741
1113
|
const elseExpr =
|
|
742
1114
|
this.isIte(elseCandidate) && manager.getArg(elseCandidate, 0) === condition
|
|
743
1115
|
? manager.getArg(elseCandidate, 2)
|
|
@@ -756,7 +1128,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
756
1128
|
if (manager.isFalse(elseExpr) || elseExpr === condition)
|
|
757
1129
|
return { expr: this.mkAnd([condition, thenExpr]), depth: 1 };
|
|
758
1130
|
if (thenExpr === condition) return this.mkOr([condition, elseExpr]);
|
|
759
|
-
// is_complement_core: one branch is the negation of the other.
|
|
760
1131
|
if (
|
|
761
1132
|
(manager.isNot(thenExpr) && manager.getArg(thenExpr, 0) === elseExpr) ||
|
|
762
1133
|
(manager.isNot(elseExpr) && manager.getArg(elseExpr, 0) === thenExpr)
|
|
@@ -765,7 +1136,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
765
1136
|
}
|
|
766
1137
|
const isElseIte = this.isIte(elseExpr);
|
|
767
1138
|
if (this.isIte(thenExpr)) {
|
|
768
|
-
// (ite c1 (ite c2 t1 t2) t1) is (ite (and c1 (not c2)) t2 t1).
|
|
769
1139
|
if (elseExpr === manager.getArg(thenExpr, 1)) {
|
|
770
1140
|
const conjunction = this.mkAnd([condition, this.mkNot(manager.getArg(thenExpr, 0))]);
|
|
771
1141
|
return {
|
|
@@ -773,7 +1143,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
773
1143
|
depth: 2,
|
|
774
1144
|
};
|
|
775
1145
|
}
|
|
776
|
-
// (ite c1 (ite c2 t1 t2) t2) is (ite (and c1 c2) t1 t2).
|
|
777
1146
|
if (elseExpr === manager.getArg(thenExpr, 2)) {
|
|
778
1147
|
const conjunction = this.mkAnd([condition, manager.getArg(thenExpr, 0)]);
|
|
779
1148
|
return {
|
|
@@ -781,8 +1150,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
781
1150
|
depth: 2,
|
|
782
1151
|
};
|
|
783
1152
|
}
|
|
784
|
-
// (ite c1 (ite c2 t1 t2) (ite c3 t1 t2)) is (ite (or (and c1 c2) (and (not c1) c3)) t1 t2),
|
|
785
|
-
// and with (ite c3 t2 t1) the last conjunct is (not c3).
|
|
786
1153
|
const isSameBranches =
|
|
787
1154
|
isElseIte &&
|
|
788
1155
|
manager.getArg(thenExpr, 1) === manager.getArg(elseExpr, 1) &&
|
|
@@ -810,7 +1177,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
810
1177
|
}
|
|
811
1178
|
}
|
|
812
1179
|
if (isElseIte) {
|
|
813
|
-
// (ite c1 t1 (ite c2 t1 t2)) is (ite (or c1 c2) t1 t2).
|
|
814
1180
|
if (thenExpr === manager.getArg(elseExpr, 1)) {
|
|
815
1181
|
const disjunction = this.mkOr([condition, manager.getArg(elseExpr, 0)]);
|
|
816
1182
|
return {
|
|
@@ -818,7 +1184,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
818
1184
|
depth: 1,
|
|
819
1185
|
};
|
|
820
1186
|
}
|
|
821
|
-
// (ite c1 t1 (ite c2 t2 t1)) is (ite (or c1 (not c2)) t1 t2).
|
|
822
1187
|
if (thenExpr === manager.getArg(elseExpr, 2)) {
|
|
823
1188
|
const disjunction = this.mkOr([condition, this.mkNot(manager.getArg(elseExpr, 0))]);
|
|
824
1189
|
return {
|
|
@@ -830,8 +1195,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
830
1195
|
return manager.mkApp(OP_ITE, [condition, thenExpr, elseExpr], sort);
|
|
831
1196
|
}
|
|
832
1197
|
|
|
833
|
-
// poly_rewriter::mk_add and mk_sub with a result: arith_rewriter's sum or difference, which is
|
|
834
|
-
// not rewritten again.
|
|
835
1198
|
mkAdd(args: number[]) {
|
|
836
1199
|
return this.arith.mkAdd(args) ?? this.arith.mkAddApp(args);
|
|
837
1200
|
}
|