tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6
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 +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +109 -10
- package/dist/index.d.ts +109 -10
- 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 +146 -31
- package/dist/run.js +146 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +132 -104
- package/dist/transfer.js +132 -104
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +3 -1
- package/src/ast.ts +45 -59
- package/src/bags.ts +99 -102
- package/src/builtins.ts +28 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +797 -782
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -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 +687 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +323 -658
- 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 +196 -74
- package/src/config.ts +140 -109
- package/src/coverage.ts +830 -0
- package/src/dependencies.ts +36 -54
- package/src/dfid.ts +618 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +178 -339
- package/src/errors.ts +100 -57
- package/src/evaluate.ts +598 -340
- package/src/exit-codes.ts +38 -3
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +126 -21
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +46 -58
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +590 -311
- package/src/liveness.ts +180 -124
- 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 +38 -19
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +30 -37
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +89 -58
- 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 +119 -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 +30 -60
- package/src/parallel.ts +59 -73
- package/src/parser.ts +1082 -399
- 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 +224 -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 +0 -14
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +27 -52
- 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 +31 -74
- 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 +1 -44
- 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 +0 -2
- 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 +1026 -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 +615 -53
- 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 +309 -0
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +87 -58
- package/src/prover/smt/solver/ast-lt.ts +166 -22
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1424 -180
- package/src/prover/smt/solver/auf-solver.ts +7 -44
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -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 +110 -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 +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +519 -175
- package/src/prover/smt/solver/ctx-simplify.ts +33 -50
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -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 +81 -0
- package/src/prover/smt/solver/der.ts +39 -30
- package/src/prover/smt/solver/diff-neq.ts +206 -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 +260 -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-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -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 +907 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -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 +335 -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 +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -26
- package/src/prover/smt/solver/fix-dl-var.ts +148 -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 +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +176 -28
- package/src/prover/smt/solver/goal2nlsat.ts +189 -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 +26 -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 +112 -132
- 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 +345 -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 +11 -30
- package/src/prover/smt/solver/lp/core-solver.ts +23 -29
- package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
- 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 +69 -82
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
- package/src/prover/smt/solver/lp/nex.ts +0 -6
- 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 +91 -135
- 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 +22 -72
- 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 +123 -112
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- 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 +309 -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 +105 -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 +19 -62
- package/src/prover/smt/solver/model-evaluator.ts +190 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +56 -40
- 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 +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -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 +496 -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 +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -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 +218 -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 +177 -160
- package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +65 -69
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
- package/src/prover/smt/solver/nlsat/solver.ts +241 -110
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
- package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +107 -60
- 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 +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -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 +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +204 -79
- package/src/prover/smt/solver/probes.ts +512 -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/qe-arith-plugin.ts +1098 -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 +39 -49
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -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 +814 -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 +8 -23
- 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 +261 -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 +52 -129
- package/src/prover/smt/solver/rewriter.ts +477 -120
- package/src/prover/smt/solver/rlimit.ts +39 -21
- 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 +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -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 +2127 -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 +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1301 -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 +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -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 +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -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 +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +119 -39
- 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 +1986 -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 +1200 -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 +59 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
- package/src/prover/smt/solver/theory-lra-state.ts +6 -27
- package/src/prover/smt/solver/theory-lra.ts +188 -8
- package/src/prover/smt/solver/theory-pb.ts +934 -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 +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -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 +67 -41
- 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 +0 -6
- package/src/prover/zenon/expr.ts +8 -28
- package/src/prover/zenon/index-table.ts +26 -59
- package/src/prover/zenon/isar-case.ts +8 -20
- package/src/prover/zenon/isar.ts +35 -65
- 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 +1 -13
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +2 -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 +67 -185
- package/src/runtime.ts +26 -22
- package/src/sany/builtins.ts +2 -5
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +191 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +58 -77
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +5 -43
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +49 -76
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +35 -117
- package/src/search.ts +671 -169
- package/src/simulate.ts +712 -0
- package/src/spec-description.ts +192 -100
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +264 -95
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +267 -100
- package/src/symmetry.ts +35 -27
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +125 -54
- package/src/tlc/order.ts +39 -69
- package/src/tlc/random.ts +37 -49
- package/src/tlc/replay.ts +553 -228
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +78 -44
- package/src/tlc/tlcext-operators.ts +171 -122
- package/src/tlc/trace-spec.ts +249 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6535 -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 +832 -484
- 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,68 @@ 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;
|
|
54
95
|
}
|
|
55
96
|
|
|
56
|
-
// The parameters that asserted_formulas gives the kernel's rewriters.
|
|
57
97
|
export const KERNEL_REWRITER_OPTIONS: RewriterOptions = {
|
|
58
98
|
isEliminatingAnd: false,
|
|
59
99
|
arith: KERNEL_ARITH_OPTIONS,
|
|
60
100
|
isRewritingPatterns: true,
|
|
61
101
|
};
|
|
62
102
|
|
|
63
|
-
// th_rewriter's defaults, which the tactics and the model use.
|
|
64
103
|
export const TACTIC_REWRITER_OPTIONS: RewriterOptions = {
|
|
65
104
|
isEliminatingAnd: false,
|
|
66
105
|
arith: TACTIC_ARITH_OPTIONS,
|
|
67
106
|
isRewritingPatterns: false,
|
|
68
107
|
};
|
|
69
108
|
|
|
70
|
-
// A term that reduceTo is rewriting: the depth left for its arguments, its next argument, and where
|
|
71
|
-
// its arguments' results start.
|
|
72
109
|
interface ReduceFrame {
|
|
73
110
|
expr: number;
|
|
74
111
|
depth: number;
|
|
@@ -76,15 +113,18 @@ interface ReduceFrame {
|
|
|
76
113
|
spos: number;
|
|
77
114
|
}
|
|
78
115
|
|
|
79
|
-
// rewriter_tpl with th_rewriter_cfg.
|
|
80
116
|
export class Rewriter extends RewriterTpl {
|
|
81
117
|
private arith: ArithRewriter;
|
|
118
|
+
private bv: BvRewriter;
|
|
119
|
+
private array: ArrayRewriter;
|
|
120
|
+
private seq: SeqRewriter;
|
|
82
121
|
private substitution = new Map<number, number>();
|
|
122
|
+
private substitutionDependencies = new Map<number, Dependency | undefined>();
|
|
123
|
+
usedDependencies: Dependency | undefined;
|
|
83
124
|
private unusedVarsEliminator: UnusedVarsEliminator;
|
|
84
125
|
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
126
|
releaseResult = () => this.setLastResult(-1);
|
|
127
|
+
private localCtxCost = 0;
|
|
88
128
|
|
|
89
129
|
constructor(
|
|
90
130
|
manager: AstManager,
|
|
@@ -93,20 +133,27 @@ export class Rewriter extends RewriterTpl {
|
|
|
93
133
|
) {
|
|
94
134
|
super(manager);
|
|
95
135
|
this.arith = new ArithRewriter(manager, options.arith);
|
|
136
|
+
const bvOptions = options.bv ?? { ...DEFAULT_BV_OPTIONS, isHiDiv0: manager.isHiDiv0 };
|
|
137
|
+
this.bv = new BvRewriter(manager, options.arith, bvOptions, {
|
|
138
|
+
mkEq: (left, right) => this.mkEq(left, right),
|
|
139
|
+
mkIte: (condition, thenExpr, elseExpr) => {
|
|
140
|
+
const result = this.mkIte(condition, thenExpr, elseExpr);
|
|
141
|
+
return typeof result === "number" ? result : result.expr;
|
|
142
|
+
},
|
|
143
|
+
});
|
|
144
|
+
this.array = new ArrayRewriter(manager, options.isSortingStore);
|
|
145
|
+
this.seq = new SeqRewriter(manager, options.isCoalescingChars ?? true, this);
|
|
96
146
|
this.unusedVarsEliminator = new UnusedVarsEliminator(manager);
|
|
97
147
|
this.der = new Der(manager);
|
|
98
148
|
}
|
|
99
149
|
|
|
100
|
-
// ~imp: the members of th_rewriter_cfg go before the caches of rewriter_tpl.
|
|
101
150
|
release() {
|
|
102
151
|
this.unusedVarsEliminator.release();
|
|
103
152
|
this.der.release();
|
|
153
|
+
this.seq.release();
|
|
104
154
|
super.release();
|
|
105
155
|
}
|
|
106
156
|
|
|
107
|
-
// Rewrites the top depth levels of a term, outside the main loop. Like rewriter_tpl, it keeps its
|
|
108
|
-
// frames on an explicit stack, so a deep term or a long chain of rewrites cannot overflow the call
|
|
109
|
-
// stack.
|
|
110
157
|
private reduceTo(expr: number, depth: number): number {
|
|
111
158
|
const manager = this.manager;
|
|
112
159
|
const frames: ReduceFrame[] = [];
|
|
@@ -134,28 +181,46 @@ export class Rewriter extends RewriterTpl {
|
|
|
134
181
|
return results[0];
|
|
135
182
|
}
|
|
136
183
|
|
|
137
|
-
// updt_params with elim_and, which asserted_formulas turns on after NNF. The caller resets the
|
|
138
|
-
// rewriter.
|
|
139
184
|
setEliminatingAnd(isEliminatingAnd: boolean) {
|
|
140
185
|
this.options = { ...this.options, isEliminatingAnd };
|
|
141
186
|
}
|
|
142
187
|
|
|
143
|
-
|
|
144
|
-
|
|
145
|
-
|
|
188
|
+
setEq2Ineq(isEq2Ineq: boolean) {
|
|
189
|
+
this.arith.isEq2Ineq = isEq2Ineq;
|
|
190
|
+
}
|
|
191
|
+
|
|
192
|
+
// The caller may extend the substitution between rewrites without a reset.
|
|
193
|
+
setSubstitution(
|
|
194
|
+
substitution: Map<number, number>,
|
|
195
|
+
dependencies = new Map<number, Dependency | undefined>(),
|
|
196
|
+
) {
|
|
146
197
|
this.substitution = substitution;
|
|
198
|
+
this.substitutionDependencies = dependencies;
|
|
147
199
|
this.reset();
|
|
148
200
|
}
|
|
149
201
|
|
|
150
202
|
getSubst(expr: number) {
|
|
151
|
-
|
|
203
|
+
const replacement = this.substitution.size === 0 ? undefined : this.substitution.get(expr);
|
|
204
|
+
if (replacement !== undefined)
|
|
205
|
+
this.usedDependencies = joinDependencies(
|
|
206
|
+
this.usedDependencies,
|
|
207
|
+
this.substitutionDependencies.get(expr),
|
|
208
|
+
);
|
|
209
|
+
return replacement;
|
|
152
210
|
}
|
|
153
211
|
|
|
154
|
-
// flat_assoc: th_rewriter flattens and, or and + into an enclosing application of the same
|
|
155
|
-
// operator.
|
|
156
212
|
isFlatAssoc(decl: number) {
|
|
157
213
|
const op = this.manager.funcDecls[decl].op;
|
|
158
|
-
return
|
|
214
|
+
return (
|
|
215
|
+
this.options.arith.isFlat !== false &&
|
|
216
|
+
(op === OP_AND ||
|
|
217
|
+
op === OP_OR ||
|
|
218
|
+
op === OP_ADD ||
|
|
219
|
+
op === OP_BADD ||
|
|
220
|
+
op === OP_BOR ||
|
|
221
|
+
op === OP_BAND ||
|
|
222
|
+
op === OP_BXOR)
|
|
223
|
+
);
|
|
159
224
|
}
|
|
160
225
|
|
|
161
226
|
isRewritingPatterns() {
|
|
@@ -164,7 +229,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
164
229
|
|
|
165
230
|
reduceApp(decl: number, args: number[], sort: number) {
|
|
166
231
|
const manager = this.manager;
|
|
167
|
-
// An uninterpreted application only reduces by pull_ite, which needs two arguments.
|
|
168
232
|
if (
|
|
169
233
|
manager.funcDecls[decl].op === OP_UNINTERPRETED &&
|
|
170
234
|
(args.length !== 2 || this.options.isPullingCheapIte !== true)
|
|
@@ -181,41 +245,54 @@ export class Rewriter extends RewriterTpl {
|
|
|
181
245
|
return this.manager.withTemporaries(() => this.reduceQuantifierCore(expr, body, patterns));
|
|
182
246
|
}
|
|
183
247
|
|
|
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
248
|
private reduceQuantifierCore(expr: number, body: number, newPatterns: number[]) {
|
|
189
249
|
const manager = this.manager;
|
|
190
250
|
const data = manager.getQuantifier(expr);
|
|
251
|
+
const isLambda = data.kind === QUANTIFIER_LAMBDA;
|
|
191
252
|
const isNegated = manager.isNot(body);
|
|
192
253
|
const junction = isNegated ? manager.getArg(body, 0) : body;
|
|
193
254
|
if (
|
|
194
|
-
|
|
255
|
+
!isLambda &&
|
|
256
|
+
manager.getOp(junction) ===
|
|
257
|
+
((data.kind === QUANTIFIER_FORALL) !== isNegated ? OP_AND : OP_OR) &&
|
|
195
258
|
manager.someArg(junction, (arg) => {
|
|
196
259
|
const atom = manager.isNot(arg) ? manager.getArg(arg, 0) : arg;
|
|
197
260
|
return manager.kinds[atom] === KIND_VAR && manager.values[atom] < data.sorts.length;
|
|
198
261
|
})
|
|
199
262
|
)
|
|
200
|
-
return data.
|
|
263
|
+
return data.kind === QUANTIFIER_FORALL ? manager.falseExpr : manager.trueExpr;
|
|
201
264
|
const nested =
|
|
202
265
|
manager.kinds[body] === KIND_QUANTIFIER ? manager.getQuantifier(body) : undefined;
|
|
203
|
-
|
|
204
|
-
const patterns = newPatterns.filter((pattern, index) => newPatterns.indexOf(pattern) === index);
|
|
205
|
-
const merged =
|
|
266
|
+
const isMerging =
|
|
206
267
|
nested !== undefined &&
|
|
207
|
-
nested.
|
|
208
|
-
|
|
209
|
-
|
|
210
|
-
|
|
211
|
-
|
|
212
|
-
|
|
213
|
-
|
|
214
|
-
|
|
215
|
-
|
|
216
|
-
|
|
217
|
-
|
|
218
|
-
|
|
268
|
+
nested.kind === data.kind &&
|
|
269
|
+
!isLambda &&
|
|
270
|
+
data.patterns.length + data.noPatterns.length === 0 &&
|
|
271
|
+
nested.patterns.length + nested.noPatterns.length === 0;
|
|
272
|
+
if (!isMerging && isLambda && manager.isGroundApp(body))
|
|
273
|
+
return mkArrayApp(manager, OP_CONST_ARRAY, [body], [manager.sorts[expr]]);
|
|
274
|
+
if (!isMerging && isLambda) {
|
|
275
|
+
const reduced = this.array.mkLambdaCore(expr, body);
|
|
276
|
+
if (reduced !== -1) return reduced;
|
|
277
|
+
}
|
|
278
|
+
const patterns = newPatterns.filter((pattern, index) => newPatterns.indexOf(pattern) === index);
|
|
279
|
+
const merged = isMerging
|
|
280
|
+
? manager.mkQuantifier({
|
|
281
|
+
...data,
|
|
282
|
+
sorts: [...data.sorts, ...nested.sorts],
|
|
283
|
+
names: [...data.names, ...nested.names],
|
|
284
|
+
body: nested.body,
|
|
285
|
+
patterns: [],
|
|
286
|
+
weight: Math.min(data.weight, nested.weight),
|
|
287
|
+
})
|
|
288
|
+
: manager.mkQuantifier({
|
|
289
|
+
...data,
|
|
290
|
+
body,
|
|
291
|
+
patterns: this.substitutePatterns(patterns),
|
|
292
|
+
noPatterns: data.noPatterns.filter(
|
|
293
|
+
(noPattern, index) => data.noPatterns.indexOf(noPattern) === index,
|
|
294
|
+
),
|
|
295
|
+
});
|
|
219
296
|
const reduced = this.unusedVarsEliminator.apply(merged);
|
|
220
297
|
manager.releaseLater(reduced);
|
|
221
298
|
if (
|
|
@@ -232,8 +309,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
232
309
|
return rewritten;
|
|
233
310
|
}
|
|
234
311
|
|
|
235
|
-
// th_rewriter_cfg::apply_subst: the substitution replaces terms in the patterns without rewriting
|
|
236
|
-
// them, like expr_safe_replace.
|
|
237
312
|
private substitutePatterns(patterns: number[]) {
|
|
238
313
|
const manager = this.manager;
|
|
239
314
|
if (this.substitution.size === 0) return patterns;
|
|
@@ -255,7 +330,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
255
330
|
return patterns.map((pattern) => manager.mkPattern(manager.mapArgs(pattern, replace)));
|
|
256
331
|
}
|
|
257
332
|
|
|
258
|
-
// th_rewriter::mk_app: one reduction, without rewriting what it returns.
|
|
259
333
|
mkApp(decl: number, args: number[], sort: number) {
|
|
260
334
|
const reduced = this.reduceAppTop(decl, args, sort);
|
|
261
335
|
return reduced === -1
|
|
@@ -265,7 +339,34 @@ export class Rewriter extends RewriterTpl {
|
|
|
265
339
|
: reduced.expr;
|
|
266
340
|
}
|
|
267
341
|
|
|
268
|
-
//
|
|
342
|
+
// bool_rewriter::mk_app, for a Boolean operator: an equality is not passed to the theories.
|
|
343
|
+
mkBoolApp(decl: number, args: number[], sort: number) {
|
|
344
|
+
const op = this.manager.funcDecls[decl].op;
|
|
345
|
+
const reduced =
|
|
346
|
+
op === OP_EQ
|
|
347
|
+
? this.mkEqCore(args[0], args[1])
|
|
348
|
+
: op === OP_DISTINCT
|
|
349
|
+
? this.mkDistinct(args)
|
|
350
|
+
: op === OP_AND
|
|
351
|
+
? this.mkAndCore(args)
|
|
352
|
+
: op === OP_OR
|
|
353
|
+
? this.mkOr(args)
|
|
354
|
+
: op === OP_NOT
|
|
355
|
+
? this.mkNot(args[0])
|
|
356
|
+
: op === OP_ITE
|
|
357
|
+
? this.mkIte(args[0], args[1], args[2])
|
|
358
|
+
: op === OP_IMPLIES
|
|
359
|
+
? this.mkOr([this.mkNot(args[0]), args[1]])
|
|
360
|
+
: op === OP_XOR
|
|
361
|
+
? this.mkEq(this.mkNot(args[0]), args[1])
|
|
362
|
+
: undefined;
|
|
363
|
+
return reduced === undefined || reduced === -1
|
|
364
|
+
? this.manager.mkApp(decl, args, sort)
|
|
365
|
+
: typeof reduced === "number"
|
|
366
|
+
? reduced
|
|
367
|
+
: reduced.expr;
|
|
368
|
+
}
|
|
369
|
+
|
|
269
370
|
mkAppCore(decl: number, args: number[], sort: number): number {
|
|
270
371
|
const reduced = this.reduceAppTop(decl, args, sort);
|
|
271
372
|
return reduced === -1
|
|
@@ -275,11 +376,25 @@ export class Rewriter extends RewriterTpl {
|
|
|
275
376
|
: this.reduceTo(reduced.expr, getRewriteDepth(reduced));
|
|
276
377
|
}
|
|
277
378
|
|
|
278
|
-
// th_rewriter_cfg::reduce_app: reduce_app_core, then pull_ite with pull_cheap_ite. -1 is BR_FAILED.
|
|
279
379
|
private reduceAppTop(decl: number, args: number[], sort: number) {
|
|
280
380
|
const manager = this.manager;
|
|
281
|
-
const
|
|
282
|
-
if (typeof
|
|
381
|
+
const core = this.reduceAppCore(decl, args);
|
|
382
|
+
if (typeof core !== "number") return core;
|
|
383
|
+
const reduced =
|
|
384
|
+
this.options.isPushingIteBv !== true
|
|
385
|
+
? core
|
|
386
|
+
: core === -1
|
|
387
|
+
? decl === OP_ITE
|
|
388
|
+
? (this.pushIte(args[0], args[1], args[2]) ?? -1)
|
|
389
|
+
: -1
|
|
390
|
+
: this.isIte(core)
|
|
391
|
+
? (this.pushIte(
|
|
392
|
+
manager.getArg(core, 0),
|
|
393
|
+
manager.getArg(core, 1),
|
|
394
|
+
manager.getArg(core, 2),
|
|
395
|
+
) ?? core)
|
|
396
|
+
: core;
|
|
397
|
+
if (this.options.isPullingCheapIte !== true) return reduced;
|
|
283
398
|
if (reduced === -1)
|
|
284
399
|
return (args.length === 2 ? this.pullIte(decl, args[0], args[1], sort) : undefined) ?? -1;
|
|
285
400
|
return manager.kinds[reduced] === KIND_APP && manager.getNumArgs(reduced) === 2
|
|
@@ -292,8 +407,60 @@ export class Rewriter extends RewriterTpl {
|
|
|
292
407
|
: reduced;
|
|
293
408
|
}
|
|
294
409
|
|
|
295
|
-
|
|
296
|
-
|
|
410
|
+
private pushIte(condition: number, thenExpr: number, elseExpr: number) {
|
|
411
|
+
const manager = this.manager;
|
|
412
|
+
const isBvApp = (expr: number) =>
|
|
413
|
+
manager.kinds[expr] === KIND_APP && manager.getFamily(expr) === FAMILY_BV;
|
|
414
|
+
const isThenApp = isBvApp(thenExpr);
|
|
415
|
+
if (!isThenApp && !isBvApp(elseExpr)) return undefined;
|
|
416
|
+
const app = isThenApp ? thenExpr : elseExpr;
|
|
417
|
+
const unified = this.unify(app, isThenApp ? elseExpr : thenExpr);
|
|
418
|
+
if (unified === undefined) return undefined;
|
|
419
|
+
const [newThen, newElse] = isThenApp ? unified.args : [unified.args[1], unified.args[0]];
|
|
420
|
+
const ite = manager.mkApp(OP_ITE, [condition, newThen, newElse], manager.sorts[newThen]);
|
|
421
|
+
const decl = manager.decls[app];
|
|
422
|
+
return manager.mkApp(
|
|
423
|
+
decl,
|
|
424
|
+
unified.isCommonFirst ? [unified.common, ite] : [ite, unified.common],
|
|
425
|
+
manager.funcDecls[decl].range,
|
|
426
|
+
);
|
|
427
|
+
}
|
|
428
|
+
|
|
429
|
+
private unify(app: number, other: number) {
|
|
430
|
+
const manager = this.manager;
|
|
431
|
+
if (manager.getNumArgs(app) !== 2) return undefined;
|
|
432
|
+
const first = manager.getArg(app, 0);
|
|
433
|
+
const second = manager.getArg(app, 1);
|
|
434
|
+
const op = manager.getOp(app);
|
|
435
|
+
const getNeutral = () =>
|
|
436
|
+
op === OP_BADD || op === OP_BMUL
|
|
437
|
+
? manager.mkBvNumeral(op === OP_BADD ? 0n : 1n, manager.getBvSize(manager.sorts[app]))
|
|
438
|
+
: undefined;
|
|
439
|
+
if (other === second || other === first) {
|
|
440
|
+
const neutral = getNeutral();
|
|
441
|
+
return neutral === undefined
|
|
442
|
+
? undefined
|
|
443
|
+
: other === second
|
|
444
|
+
? { args: [first, neutral], common: second, isCommonFirst: false }
|
|
445
|
+
: { args: [second, neutral], common: first, isCommonFirst: true };
|
|
446
|
+
}
|
|
447
|
+
if (manager.kinds[other] !== KIND_APP || manager.decls[other] !== manager.decls[app])
|
|
448
|
+
return undefined;
|
|
449
|
+
if (manager.getNumArgs(other) !== 2) return undefined;
|
|
450
|
+
const otherFirst = manager.getArg(other, 0);
|
|
451
|
+
const otherSecond = manager.getArg(other, 1);
|
|
452
|
+
if (second === otherSecond)
|
|
453
|
+
return { args: [first, otherFirst], common: second, isCommonFirst: false };
|
|
454
|
+
if (first === otherFirst)
|
|
455
|
+
return { args: [second, otherSecond], common: first, isCommonFirst: true };
|
|
456
|
+
if (!isAssociativeBvOp(op) && op !== OP_BCOMP) return undefined;
|
|
457
|
+
if (first === otherSecond)
|
|
458
|
+
return { args: [second, otherFirst], common: first, isCommonFirst: true };
|
|
459
|
+
if (second === otherFirst)
|
|
460
|
+
return { args: [first, otherSecond], common: second, isCommonFirst: false };
|
|
461
|
+
return undefined;
|
|
462
|
+
}
|
|
463
|
+
|
|
297
464
|
private pullIte(decl: number, first: number, second: number, sort: number): Rewrite | undefined {
|
|
298
465
|
const manager = this.manager;
|
|
299
466
|
if (sort === SORT_BOOL && manager.sorts[first] !== SORT_BOOL) {
|
|
@@ -318,7 +485,8 @@ export class Rewriter extends RewriterTpl {
|
|
|
318
485
|
return this.pullIteCore(decl, second, first, sort, true);
|
|
319
486
|
}
|
|
320
487
|
const family = manager.funcDecls[decl].family;
|
|
321
|
-
if (family !== FAMILY_BASIC && family !== FAMILY_ARITH
|
|
488
|
+
if (family !== FAMILY_BASIC && family !== FAMILY_ARITH && family !== FAMILY_BV)
|
|
489
|
+
return undefined;
|
|
322
490
|
if (manager.isUniqueValue(first) && this.isIteValueTree(second))
|
|
323
491
|
return this.pullIteCore(decl, second, first, sort, true);
|
|
324
492
|
if (manager.isUniqueValue(second) && this.isIteValueTree(first))
|
|
@@ -326,8 +494,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
326
494
|
return undefined;
|
|
327
495
|
}
|
|
328
496
|
|
|
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
497
|
private pullIteCore(
|
|
332
498
|
decl: number,
|
|
333
499
|
ite: number,
|
|
@@ -348,7 +514,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
348
514
|
return { expr: manager.mkApp(OP_ITE, [manager.getArg(ite, 0), ...branches], sort), depth: 2 };
|
|
349
515
|
}
|
|
350
516
|
|
|
351
|
-
// is_ite_value_tree: an unshared ite whose leaves are values, through unshared ites.
|
|
352
517
|
private isIteValueTree(expr: number) {
|
|
353
518
|
const manager = this.manager;
|
|
354
519
|
if (!this.isIte(expr) || manager.getRefCount(expr) !== 1) return false;
|
|
@@ -362,15 +527,59 @@ export class Rewriter extends RewriterTpl {
|
|
|
362
527
|
return true;
|
|
363
528
|
}
|
|
364
529
|
|
|
365
|
-
|
|
530
|
+
private reduceEq(left: number, right: number) {
|
|
531
|
+
const manager = this.manager;
|
|
532
|
+
const sort = manager.sorts[left];
|
|
533
|
+
const theoryResult = isArithSort(sort)
|
|
534
|
+
? this.arith.mkEq(left, right)
|
|
535
|
+
: manager.isBvSort(sort)
|
|
536
|
+
? this.bv.mkEqCore(left, right)
|
|
537
|
+
: manager.isDatatypeSort(sort)
|
|
538
|
+
? mkDatatypeEqCore(manager, left, right)
|
|
539
|
+
: manager.isArraySort(sort)
|
|
540
|
+
? this.array.mkEqCore(left, right)
|
|
541
|
+
: manager.getSortFamily(sort) === FAMILY_FPA
|
|
542
|
+
? mkFpaEqCore(manager, left, right)
|
|
543
|
+
: manager.getSortFamily(sort) === FAMILY_SEQ
|
|
544
|
+
? this.seq.mkEqCore(left, right)
|
|
545
|
+
: undefined;
|
|
546
|
+
if (theoryResult !== undefined) return theoryResult;
|
|
547
|
+
if (manager.getOp(left) === OP_UBV2INT || manager.getOp(right) === OP_UBV2INT) {
|
|
548
|
+
const bv2intResult = this.bv.mkEqBv2int(left, right);
|
|
549
|
+
if (bv2intResult !== undefined) return bv2intResult;
|
|
550
|
+
}
|
|
551
|
+
return this.applyTamagotchi(left, right) ?? this.applyTamagotchi(right, left);
|
|
552
|
+
}
|
|
553
|
+
|
|
554
|
+
private applyTamagotchi(eq: number, other: number): Rewrite | undefined {
|
|
555
|
+
const manager = this.manager;
|
|
556
|
+
const eqBit = this.bv.getEqBit(eq);
|
|
557
|
+
if (eqBit === undefined) return undefined;
|
|
558
|
+
const bit = manager.mkBvNumeral(eqBit.bit, 1);
|
|
559
|
+
const otherBit = manager.mkBvNumeral(1n - eqBit.bit, 1);
|
|
560
|
+
const ite = manager.mkApp(OP_ITE, [other, bit, otherBit], manager.sorts[bit]);
|
|
561
|
+
return { expr: manager.mkEq(eqBit.term, ite), depth: 2 };
|
|
562
|
+
}
|
|
563
|
+
|
|
366
564
|
reduceAppCore(decl: number, args: number[]): number | Rewrite {
|
|
367
565
|
const manager = this.manager;
|
|
368
|
-
const
|
|
566
|
+
const funcDecl = manager.funcDecls[decl];
|
|
567
|
+
if (funcDecl.family === FAMILY_BV) return this.bv.mkAppCore(decl, args) ?? -1;
|
|
568
|
+
if (funcDecl.family === FAMILY_ARRAY) return this.array.mkAppCore(funcDecl.op, args) ?? -1;
|
|
569
|
+
if (funcDecl.family === FAMILY_DATATYPE) return mkDatatypeAppCore(manager, decl, args) ?? -1;
|
|
570
|
+
if (funcDecl.family === FAMILY_FPA) return mkFpaAppCore(manager, decl, args) ?? -1;
|
|
571
|
+
if (funcDecl.family === FAMILY_PB) return mkPbAppCore(manager, decl, args);
|
|
572
|
+
if (funcDecl.family === FAMILY_SEQ || funcDecl.family === FAMILY_CHAR)
|
|
573
|
+
return this.seq.mkAppCore(decl, args) ?? -1;
|
|
574
|
+
if (funcDecl.family === FAMILY_RECFUN) return mkRecFunApp(manager, decl, args) ?? -1;
|
|
575
|
+
const op = funcDecl.op;
|
|
369
576
|
switch (op) {
|
|
370
577
|
case OP_AND:
|
|
371
|
-
return
|
|
578
|
+
return (
|
|
579
|
+
(manager.isReUsed ? this.seq.mkBoolApp(true, args) : undefined) ?? this.mkAndCore(args)
|
|
580
|
+
);
|
|
372
581
|
case OP_OR:
|
|
373
|
-
return this.mkOr(args);
|
|
582
|
+
return (manager.isReUsed ? this.seq.mkBoolApp(false, args) : undefined) ?? this.mkOr(args);
|
|
374
583
|
case OP_NOT:
|
|
375
584
|
return this.mkNot(args[0]);
|
|
376
585
|
case OP_IMPLIES:
|
|
@@ -379,14 +588,25 @@ export class Rewriter extends RewriterTpl {
|
|
|
379
588
|
return this.mkEq(this.mkNot(args[0]), args[1]);
|
|
380
589
|
case OP_EQ:
|
|
381
590
|
return (
|
|
382
|
-
|
|
591
|
+
this.reduceEq(args[0], args[1]) ??
|
|
592
|
+
(manager.isSeqUsed && manager.getFamily(args[0]) === FAMILY_SEQ
|
|
593
|
+
? this.seq.mkEqCore(args[0], args[1])
|
|
594
|
+
: undefined) ??
|
|
383
595
|
this.mkEqCore(args[0], args[1]) ??
|
|
384
596
|
-1
|
|
385
597
|
);
|
|
386
598
|
case OP_DISTINCT:
|
|
387
|
-
return
|
|
599
|
+
return (
|
|
600
|
+
(args.length > 0 && manager.isBvSort(manager.sorts[args[0]])
|
|
601
|
+
? this.bv.mkDistinct(args)
|
|
602
|
+
: undefined) ?? this.mkDistinct(args)
|
|
603
|
+
);
|
|
388
604
|
case OP_ITE:
|
|
389
|
-
return
|
|
605
|
+
return (
|
|
606
|
+
(manager.isBvSort(manager.sorts[args[1]])
|
|
607
|
+
? this.bv.mkIteCore(args[0], args[1], args[2])
|
|
608
|
+
: undefined) ?? this.mkIte(args[0], args[1], args[2])
|
|
609
|
+
);
|
|
390
610
|
case OP_LE:
|
|
391
611
|
return this.arith.mkLe(args[0], args[1]) ?? -1;
|
|
392
612
|
case OP_GE:
|
|
@@ -396,7 +616,7 @@ export class Rewriter extends RewriterTpl {
|
|
|
396
616
|
case OP_GT:
|
|
397
617
|
return this.arith.mkGt(args[0], args[1]);
|
|
398
618
|
case OP_ADD:
|
|
399
|
-
return this.arith.
|
|
619
|
+
return this.arith.mkAddCore(args) ?? -1;
|
|
400
620
|
case OP_SUB:
|
|
401
621
|
return this.arith.mkSub(args);
|
|
402
622
|
case OP_UMINUS:
|
|
@@ -407,6 +627,8 @@ export class Rewriter extends RewriterTpl {
|
|
|
407
627
|
return this.arith.mkIdiv(args[0], args[1]) ?? -1;
|
|
408
628
|
case OP_MOD:
|
|
409
629
|
return this.arith.mkMod(args[0], args[1]) ?? -1;
|
|
630
|
+
case OP_REM:
|
|
631
|
+
return this.arith.mkRem(args[0], args[1]) ?? -1;
|
|
410
632
|
case OP_ABS:
|
|
411
633
|
return this.arith.mkAbs(args[0]);
|
|
412
634
|
case OP_DIV:
|
|
@@ -417,12 +639,29 @@ export class Rewriter extends RewriterTpl {
|
|
|
417
639
|
return this.arith.mkToInt(args[0]) ?? -1;
|
|
418
640
|
case OP_IS_INT:
|
|
419
641
|
return this.arith.mkIsInt(args[0]);
|
|
642
|
+
case OP_POWER:
|
|
643
|
+
return this.arith.mkPower(args[0], args[1]) ?? -1;
|
|
644
|
+
case OP_SIN:
|
|
645
|
+
return this.arith.mkSin(args[0]) ?? -1;
|
|
646
|
+
case OP_COS:
|
|
647
|
+
return this.arith.mkCos(args[0]) ?? -1;
|
|
648
|
+
case OP_TAN:
|
|
649
|
+
return this.arith.mkTan(args[0]) ?? -1;
|
|
650
|
+
case OP_ASIN:
|
|
651
|
+
return this.arith.mkAsin(args[0]) ?? -1;
|
|
652
|
+
case OP_ACOS:
|
|
653
|
+
return this.arith.mkAcos(args[0]) ?? -1;
|
|
654
|
+
case OP_ATAN:
|
|
655
|
+
return this.arith.mkAtan(args[0]) ?? -1;
|
|
656
|
+
case OP_SINH:
|
|
657
|
+
case OP_COSH:
|
|
658
|
+
case OP_TANH:
|
|
659
|
+
return this.arith.mkHyperbolic(op, args[0]) ?? -1;
|
|
420
660
|
default:
|
|
421
661
|
return -1;
|
|
422
662
|
}
|
|
423
663
|
}
|
|
424
664
|
|
|
425
|
-
// bool_rewriter::mk_not: (not (= a b)) of Booleans is (= (not a) b).
|
|
426
665
|
mkNot(arg: number): number {
|
|
427
666
|
const manager = this.manager;
|
|
428
667
|
if (manager.isNot(arg)) return manager.getArg(arg, 0);
|
|
@@ -431,12 +670,10 @@ export class Rewriter extends RewriterTpl {
|
|
|
431
670
|
return manager.mkNot(arg);
|
|
432
671
|
}
|
|
433
672
|
|
|
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
673
|
mkOr(args: number[]): number {
|
|
438
674
|
const manager = this.manager;
|
|
439
|
-
const isNested =
|
|
675
|
+
const isNested =
|
|
676
|
+
this.options.isFlatAndOr !== false && args.some((arg) => manager.getOp(arg) === OP_OR);
|
|
440
677
|
const flatArgs = isNested ? this.flattenArgs(args, OP_OR) : args;
|
|
441
678
|
const literals = manager.flatLiterals;
|
|
442
679
|
literals.clear();
|
|
@@ -446,25 +683,163 @@ export class Rewriter extends RewriterTpl {
|
|
|
446
683
|
if (literals.add(arg)) return manager.trueExpr;
|
|
447
684
|
}
|
|
448
685
|
const result = literals.list;
|
|
686
|
+
const limit = this.options.localCtxLimit;
|
|
687
|
+
if (result.length > 1 && limit !== undefined && this.localCtxCost <= limit) {
|
|
688
|
+
const simplified = manager.withTemporaries(() => this.simplifyLocalCtx([...result]));
|
|
689
|
+
if (simplified !== -1) {
|
|
690
|
+
manager.releaseLater(simplified);
|
|
691
|
+
return simplified;
|
|
692
|
+
}
|
|
693
|
+
}
|
|
449
694
|
const isOutOfOrder = result.some(
|
|
450
695
|
(arg, index) => index > 0 && isAstLess(manager, arg, result[index - 1]),
|
|
451
696
|
);
|
|
452
|
-
// Dropping false or a duplicate disjunct also sets mk_nflat_or_core's s.
|
|
453
697
|
if (isNested || result.length !== flatArgs.length || isOutOfOrder)
|
|
454
698
|
sortByKey(result, (arg) => manager.ids[arg]);
|
|
455
699
|
return manager.mkOr(result);
|
|
456
700
|
}
|
|
457
701
|
|
|
458
|
-
|
|
459
|
-
|
|
702
|
+
private simplifyNestedNotOr(args: number[], negatives: Set<number>, positives: Set<number>) {
|
|
703
|
+
const manager = this.manager;
|
|
704
|
+
this.localCtxCost += args.length;
|
|
705
|
+
const kept: number[] = [];
|
|
706
|
+
let isSimplified = false;
|
|
707
|
+
for (const arg of args) {
|
|
708
|
+
if (negatives.has(arg)) return manager.falseExpr;
|
|
709
|
+
if (positives.has(arg)) {
|
|
710
|
+
isSimplified = true;
|
|
711
|
+
continue;
|
|
712
|
+
}
|
|
713
|
+
if (manager.isNot(arg)) {
|
|
714
|
+
const atom = manager.getArg(arg, 0);
|
|
715
|
+
if (negatives.has(atom)) {
|
|
716
|
+
isSimplified = true;
|
|
717
|
+
continue;
|
|
718
|
+
}
|
|
719
|
+
if (positives.has(atom)) return manager.falseExpr;
|
|
720
|
+
}
|
|
721
|
+
kept.push(arg);
|
|
722
|
+
}
|
|
723
|
+
if (!isSimplified) return -1;
|
|
724
|
+
if (kept.length === 0) return manager.trueExpr;
|
|
725
|
+
return kept.length === 1 ? this.mkNot(kept[0]) : manager.mkNot(manager.mkOr(kept));
|
|
726
|
+
}
|
|
727
|
+
|
|
728
|
+
private simplifyLiteral(arg: number, negatives: Set<number>, positives: Set<number>) {
|
|
729
|
+
const manager = this.manager;
|
|
730
|
+
const isNegated = manager.isNot(arg);
|
|
731
|
+
const atom = isNegated ? manager.getArg(arg, 0) : arg;
|
|
732
|
+
if (negatives.has(atom)) return isNegated ? manager.falseExpr : manager.trueExpr;
|
|
733
|
+
if (positives.has(atom)) return isNegated ? manager.trueExpr : manager.falseExpr;
|
|
734
|
+
return arg;
|
|
735
|
+
}
|
|
736
|
+
|
|
737
|
+
private mkNestedIte(condition: number, thenExpr: number, elseExpr: number) {
|
|
738
|
+
const manager = this.manager;
|
|
739
|
+
if (manager.isTrue(condition)) return thenExpr;
|
|
740
|
+
if (manager.isFalse(condition)) return elseExpr;
|
|
741
|
+
if (thenExpr === elseExpr) return thenExpr;
|
|
742
|
+
if (manager.sorts[thenExpr] === SORT_BOOL) {
|
|
743
|
+
if (manager.isTrue(thenExpr))
|
|
744
|
+
return manager.isFalse(elseExpr) ? condition : manager.mkOr([condition, elseExpr]);
|
|
745
|
+
if (manager.isFalse(thenExpr))
|
|
746
|
+
return manager.isTrue(elseExpr)
|
|
747
|
+
? this.mkNot(condition)
|
|
748
|
+
: manager.mkNot(manager.mkOr([condition, this.mkNot(elseExpr)]));
|
|
749
|
+
if (manager.isTrue(elseExpr)) return manager.mkOr([this.mkNot(condition), thenExpr]);
|
|
750
|
+
if (manager.isFalse(elseExpr) || condition === elseExpr)
|
|
751
|
+
return manager.mkNot(manager.mkOr([this.mkNot(condition), this.mkNot(thenExpr)]));
|
|
752
|
+
if (condition === thenExpr) return manager.mkOr([condition, elseExpr]);
|
|
753
|
+
if (
|
|
754
|
+
(manager.isNot(thenExpr) && manager.getArg(thenExpr, 0) === elseExpr) ||
|
|
755
|
+
(manager.isNot(elseExpr) && manager.getArg(elseExpr, 0) === thenExpr)
|
|
756
|
+
)
|
|
757
|
+
return this.mkEq(condition, thenExpr);
|
|
758
|
+
}
|
|
759
|
+
return manager.mkApp(OP_ITE, [condition, thenExpr, elseExpr], manager.sorts[thenExpr]);
|
|
760
|
+
}
|
|
761
|
+
|
|
762
|
+
private simplifyNestedEqIte(form: number, negatives: Set<number>, positives: Set<number>) {
|
|
763
|
+
const manager = this.manager;
|
|
764
|
+
this.localCtxCost += 3;
|
|
765
|
+
const isNegated = manager.isNot(form);
|
|
766
|
+
const atom = isNegated ? manager.getArg(form, 0) : form;
|
|
767
|
+
const op = manager.getOp(atom);
|
|
768
|
+
if (op !== OP_EQ && op !== OP_ITE) return -1;
|
|
769
|
+
const args = manager.getArgs(atom);
|
|
770
|
+
const simplified = args.map((arg) => this.simplifyLiteral(arg, negatives, positives));
|
|
771
|
+
if (simplified.every((arg, index) => arg === args[index])) return -1;
|
|
772
|
+
const result =
|
|
773
|
+
op === OP_EQ
|
|
774
|
+
? this.mkEq(simplified[0], simplified[1])
|
|
775
|
+
: this.mkNestedIte(simplified[0], simplified[1], simplified[2]);
|
|
776
|
+
return isNegated ? this.mkNot(result) : result;
|
|
777
|
+
}
|
|
778
|
+
|
|
779
|
+
private simplifyLocalCtx(initialArgs: number[]) {
|
|
780
|
+
const manager = this.manager;
|
|
781
|
+
let args = initialArgs;
|
|
782
|
+
let isSimplified = false;
|
|
783
|
+
let isModified = false;
|
|
784
|
+
let isForward = true;
|
|
785
|
+
for (;;) {
|
|
786
|
+
const negatives = new Set<number>();
|
|
787
|
+
const positives = new Set<number>();
|
|
788
|
+
const kept: number[] = [];
|
|
789
|
+
const push = (arg: number) => {
|
|
790
|
+
const isNegated = manager.isNot(arg);
|
|
791
|
+
const marks = isNegated ? negatives : positives;
|
|
792
|
+
const atom = isNegated ? manager.getArg(arg, 0) : arg;
|
|
793
|
+
if (marks.has(atom)) return;
|
|
794
|
+
marks.add(atom);
|
|
795
|
+
kept.push(arg);
|
|
796
|
+
};
|
|
797
|
+
this.localCtxCost += 2 * args.length;
|
|
798
|
+
const order = isForward ? args : [...args].reverse();
|
|
799
|
+
for (const original of order) {
|
|
800
|
+
let arg = original;
|
|
801
|
+
if (manager.isNot(arg) && manager.getOp(manager.getArg(arg, 0)) === OP_OR) {
|
|
802
|
+
const nested = this.simplifyNestedNotOr(
|
|
803
|
+
manager.getArgs(manager.getArg(arg, 0)),
|
|
804
|
+
negatives,
|
|
805
|
+
positives,
|
|
806
|
+
);
|
|
807
|
+
if (nested !== -1) {
|
|
808
|
+
isModified = true;
|
|
809
|
+
isSimplified = true;
|
|
810
|
+
arg = nested;
|
|
811
|
+
}
|
|
812
|
+
}
|
|
813
|
+
const nested = this.simplifyNestedEqIte(arg, negatives, positives);
|
|
814
|
+
if (nested !== -1) {
|
|
815
|
+
isModified = true;
|
|
816
|
+
isSimplified = true;
|
|
817
|
+
arg = nested;
|
|
818
|
+
}
|
|
819
|
+
if (manager.isFalse(arg)) continue;
|
|
820
|
+
if (manager.isTrue(arg)) return arg;
|
|
821
|
+
if (this.options.isFlatAndOr !== false && manager.getOp(arg) === OP_OR)
|
|
822
|
+
for (const inner of manager.getArgs(arg)) push(inner);
|
|
823
|
+
else push(arg);
|
|
824
|
+
}
|
|
825
|
+
if (!isForward) {
|
|
826
|
+
if (!isModified) return isSimplified ? manager.mkOr(args) : -1;
|
|
827
|
+
kept.reverse();
|
|
828
|
+
isModified = false;
|
|
829
|
+
}
|
|
830
|
+
isForward = !isForward;
|
|
831
|
+
args = kept;
|
|
832
|
+
}
|
|
833
|
+
}
|
|
834
|
+
|
|
460
835
|
private mkAndCore(args: number[]): number | Rewrite {
|
|
461
836
|
const manager = this.manager;
|
|
462
837
|
if (this.options.isEliminatingAnd) return this.mkAndAsOr(args);
|
|
463
|
-
if (!args.some((arg) => manager.getOp(arg) === OP_AND))
|
|
838
|
+
if (this.options.isFlatAndOr === false || !args.some((arg) => manager.getOp(arg) === OP_AND))
|
|
839
|
+
return this.mkNflatAnd(args);
|
|
464
840
|
return { expr: this.mkNflatAnd(this.flattenArgs(args, OP_AND)), depth: 1 };
|
|
465
841
|
}
|
|
466
842
|
|
|
467
|
-
// The arguments with those that apply op replaced by their own arguments, one level deep.
|
|
468
843
|
private flattenArgs(args: number[], op: number) {
|
|
469
844
|
const manager = this.manager;
|
|
470
845
|
const flatArgs: number[] = [];
|
|
@@ -474,14 +849,11 @@ export class Rewriter extends RewriterTpl {
|
|
|
474
849
|
return flatArgs;
|
|
475
850
|
}
|
|
476
851
|
|
|
477
|
-
// bool_rewriter::mk_and, which takes the result of mk_and_core as it is.
|
|
478
852
|
mkAnd(args: number[]): number {
|
|
479
853
|
const result = this.mkAndCore(args);
|
|
480
854
|
return typeof result === "number" ? result : result.expr;
|
|
481
855
|
}
|
|
482
856
|
|
|
483
|
-
// bool_rewriter::mk_nflat_and_core: drops true and duplicates, and detects false or a complementary
|
|
484
|
-
// pair.
|
|
485
857
|
private mkNflatAnd(args: number[]) {
|
|
486
858
|
const manager = this.manager;
|
|
487
859
|
const literals = manager.flatLiterals;
|
|
@@ -495,8 +867,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
495
867
|
return result.length === 1 ? result[0] : manager.mkAnd(result);
|
|
496
868
|
}
|
|
497
869
|
|
|
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
870
|
private mkAndAsOr(args: number[]) {
|
|
501
871
|
const manager = this.manager;
|
|
502
872
|
const negations = args.map((arg) => manager.withTemporaries(() => this.mkNot(arg)));
|
|
@@ -506,8 +876,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
506
876
|
return result;
|
|
507
877
|
}
|
|
508
878
|
|
|
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
879
|
private tryIteEq(ite: number, other: number): Rewrite | undefined {
|
|
512
880
|
const manager = this.manager;
|
|
513
881
|
if (!this.isIte(ite)) return undefined;
|
|
@@ -527,7 +895,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
527
895
|
return first !== second && manager.isUniqueValue(first) && manager.isUniqueValue(second);
|
|
528
896
|
}
|
|
529
897
|
|
|
530
|
-
// The ite_extra_rules of mk_eq_core: an ite against a value, or two ites of values.
|
|
531
898
|
private mkIteValueEq(left: number, right: number): number | Rewrite | undefined {
|
|
532
899
|
const manager = this.manager;
|
|
533
900
|
if (this.isIte(left) && manager.isUniqueValue(right)) return this.tryIteValue(left, right);
|
|
@@ -569,22 +936,17 @@ export class Rewriter extends RewriterTpl {
|
|
|
569
936
|
return { expr: manager.mkApp(OP_AND, clauses, SORT_BOOL), depth: Infinity };
|
|
570
937
|
}
|
|
571
938
|
|
|
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
939
|
private tryIteValue(ite: number, value: number): number | Rewrite | undefined {
|
|
575
940
|
const manager = this.manager;
|
|
576
941
|
const condition = manager.getArg(ite, 0);
|
|
577
942
|
const thenExpr = manager.getArg(ite, 1);
|
|
578
943
|
const elseExpr = manager.getArg(ite, 2);
|
|
579
|
-
// An equality of a branch is the first write to the result.
|
|
580
944
|
const write = (result: number) => {
|
|
581
945
|
this.releaseResult();
|
|
582
946
|
return result;
|
|
583
947
|
};
|
|
584
|
-
// Z3 rewrites the equality of a branch only below depth 500.
|
|
585
948
|
const mkBranchEq = (branch: number) =>
|
|
586
949
|
write(manager.depths[branch] < 500 ? this.mkEq(branch, value) : manager.mkEq(branch, value));
|
|
587
|
-
// mk_eq_plain.
|
|
588
950
|
const mkPlainEq = (branch: number) =>
|
|
589
951
|
branch === value
|
|
590
952
|
? manager.trueExpr
|
|
@@ -621,12 +983,10 @@ export class Rewriter extends RewriterTpl {
|
|
|
621
983
|
const branches = [mkPlainEq(thenExpr), getExpr(elseEq)];
|
|
622
984
|
return { expr: manager.mkApp(OP_ITE, [condition, ...branches], SORT_BOOL), depth: 2 };
|
|
623
985
|
}
|
|
624
|
-
// simplify_eq_ite's result is written even when it is null.
|
|
625
986
|
this.releaseResult();
|
|
626
987
|
return this.isDisjointFrom(ite, value) ? manager.falseExpr : undefined;
|
|
627
988
|
}
|
|
628
989
|
|
|
629
|
-
// simplify_eq_ite: whether every leaf of a tree of ites is a value distinct from the value.
|
|
630
990
|
private isDisjointFrom(ite: number, value: number) {
|
|
631
991
|
const manager = this.manager;
|
|
632
992
|
const visited = new Set<number>();
|
|
@@ -642,7 +1002,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
642
1002
|
return true;
|
|
643
1003
|
}
|
|
644
1004
|
|
|
645
|
-
// bool_rewriter::mk_eq, which does not rewrite the result of mk_eq_core again.
|
|
646
1005
|
mkEq(left: number, right: number): number {
|
|
647
1006
|
const result = this.mkEqCore(left, right);
|
|
648
1007
|
return result === undefined
|
|
@@ -652,7 +1011,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
652
1011
|
: result.expr;
|
|
653
1012
|
}
|
|
654
1013
|
|
|
655
|
-
// bool_rewriter::mk_eq_core, after arith_rewriter::mk_eq_core folds numerals.
|
|
656
1014
|
private mkEqCore(inputLeft: number, inputRight: number): number | Rewrite | undefined {
|
|
657
1015
|
const manager = this.manager;
|
|
658
1016
|
if (inputLeft === inputRight) return manager.trueExpr;
|
|
@@ -677,7 +1035,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
677
1035
|
if (manager.isNot(lhs))
|
|
678
1036
|
return { expr: manager.mkNot(manager.mkEq(manager.getArg(lhs, 0), rhs)), depth: 2 };
|
|
679
1037
|
if (isUnfolded) return { expr: manager.mkEq(lhs, rhs), depth: 1 };
|
|
680
|
-
// (= (= a b) (= a (not b))) is false.
|
|
681
1038
|
if (manager.getOp(lhs) === OP_EQ && manager.getOp(rhs) === OP_EQ) {
|
|
682
1039
|
const isNegationOf = (expr: number, other: number) =>
|
|
683
1040
|
manager.isNot(expr) && manager.getArg(expr, 0) === other;
|
|
@@ -694,34 +1051,44 @@ export class Rewriter extends RewriterTpl {
|
|
|
694
1051
|
return undefined;
|
|
695
1052
|
}
|
|
696
1053
|
|
|
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.
|
|
1054
|
+
// Z3 keeps a distinct of more than two arguments, which tlapm does not send, where this expands it into disequalities.
|
|
700
1055
|
private mkDistinct(args: number[]): number | Rewrite {
|
|
1056
|
+
const manager = this.manager;
|
|
1057
|
+
if (args.length <= 1) return manager.trueExpr;
|
|
701
1058
|
if (args.length === 2) return { expr: this.mkNot(this.mkEq(args[0], args[1])), depth: 2 };
|
|
1059
|
+
if (new Set(args).size < args.length) return manager.falseExpr;
|
|
1060
|
+
const firstNonValue = args.findIndex((arg) => !manager.isUniqueValue(arg));
|
|
1061
|
+
const isAllDifferent = args.every(
|
|
1062
|
+
(arg, index) =>
|
|
1063
|
+
firstNonValue === -1 ||
|
|
1064
|
+
index < firstNonValue ||
|
|
1065
|
+
args.slice(0, index).every((previous) => manager.areDistinct(arg, previous)),
|
|
1066
|
+
);
|
|
1067
|
+
if (isAllDifferent) return manager.trueExpr;
|
|
1068
|
+
if (manager.sorts[args[0]] === SORT_BOOL) return manager.falseExpr;
|
|
1069
|
+
if (
|
|
1070
|
+
this.options.isKeepingDistinct === true ||
|
|
1071
|
+
args.length >= (this.options.blastDistinctThreshold ?? Infinity)
|
|
1072
|
+
)
|
|
1073
|
+
return -1;
|
|
702
1074
|
const pairs: number[] = [];
|
|
703
1075
|
for (let left = 0; left < args.length; left++)
|
|
704
1076
|
for (let right = left + 1; right < args.length; right++)
|
|
705
|
-
pairs.push(
|
|
706
|
-
return
|
|
1077
|
+
pairs.push(manager.mkNot(manager.mkEq(args[left], args[right])));
|
|
1078
|
+
return { expr: manager.mkAnd(pairs), depth: 3 };
|
|
707
1079
|
}
|
|
708
1080
|
|
|
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 {
|
|
1081
|
+
mkIte(inputCondition: number, inputThen: number, inputElse: number): number | Rewrite {
|
|
713
1082
|
const manager = this.manager;
|
|
714
1083
|
const isNegated = manager.isNot(inputCondition);
|
|
715
1084
|
const condition = isNegated ? manager.getArg(inputCondition, 0) : inputCondition;
|
|
716
1085
|
const elseCandidate = isNegated ? inputThen : inputElse;
|
|
717
1086
|
const thenCandidate = isNegated ? inputElse : inputThen;
|
|
718
|
-
// (ite c (ite c t1 t2) t3) is (ite c t1 t3).
|
|
719
1087
|
const thenExpr =
|
|
720
1088
|
this.isIte(thenCandidate) && manager.getArg(thenCandidate, 0) === condition
|
|
721
1089
|
? manager.getArg(thenCandidate, 1)
|
|
722
1090
|
: thenCandidate;
|
|
723
1091
|
const sort = manager.sorts[thenExpr];
|
|
724
|
-
// (ite c t1 (ite c2 t1 t2)) is (ite (or c c2) t1 t2).
|
|
725
1092
|
if (this.isIte(elseCandidate) && manager.getArg(elseCandidate, 1) === thenExpr) {
|
|
726
1093
|
const disjunction = manager.mkApp(
|
|
727
1094
|
OP_OR,
|
|
@@ -737,7 +1104,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
737
1104
|
depth: 3,
|
|
738
1105
|
};
|
|
739
1106
|
}
|
|
740
|
-
// (ite c t1 (ite c t2 t3)) is (ite c t1 t3).
|
|
741
1107
|
const elseExpr =
|
|
742
1108
|
this.isIte(elseCandidate) && manager.getArg(elseCandidate, 0) === condition
|
|
743
1109
|
? manager.getArg(elseCandidate, 2)
|
|
@@ -756,7 +1122,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
756
1122
|
if (manager.isFalse(elseExpr) || elseExpr === condition)
|
|
757
1123
|
return { expr: this.mkAnd([condition, thenExpr]), depth: 1 };
|
|
758
1124
|
if (thenExpr === condition) return this.mkOr([condition, elseExpr]);
|
|
759
|
-
// is_complement_core: one branch is the negation of the other.
|
|
760
1125
|
if (
|
|
761
1126
|
(manager.isNot(thenExpr) && manager.getArg(thenExpr, 0) === elseExpr) ||
|
|
762
1127
|
(manager.isNot(elseExpr) && manager.getArg(elseExpr, 0) === thenExpr)
|
|
@@ -765,7 +1130,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
765
1130
|
}
|
|
766
1131
|
const isElseIte = this.isIte(elseExpr);
|
|
767
1132
|
if (this.isIte(thenExpr)) {
|
|
768
|
-
// (ite c1 (ite c2 t1 t2) t1) is (ite (and c1 (not c2)) t2 t1).
|
|
769
1133
|
if (elseExpr === manager.getArg(thenExpr, 1)) {
|
|
770
1134
|
const conjunction = this.mkAnd([condition, this.mkNot(manager.getArg(thenExpr, 0))]);
|
|
771
1135
|
return {
|
|
@@ -773,7 +1137,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
773
1137
|
depth: 2,
|
|
774
1138
|
};
|
|
775
1139
|
}
|
|
776
|
-
// (ite c1 (ite c2 t1 t2) t2) is (ite (and c1 c2) t1 t2).
|
|
777
1140
|
if (elseExpr === manager.getArg(thenExpr, 2)) {
|
|
778
1141
|
const conjunction = this.mkAnd([condition, manager.getArg(thenExpr, 0)]);
|
|
779
1142
|
return {
|
|
@@ -781,8 +1144,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
781
1144
|
depth: 2,
|
|
782
1145
|
};
|
|
783
1146
|
}
|
|
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
1147
|
const isSameBranches =
|
|
787
1148
|
isElseIte &&
|
|
788
1149
|
manager.getArg(thenExpr, 1) === manager.getArg(elseExpr, 1) &&
|
|
@@ -810,7 +1171,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
810
1171
|
}
|
|
811
1172
|
}
|
|
812
1173
|
if (isElseIte) {
|
|
813
|
-
// (ite c1 t1 (ite c2 t1 t2)) is (ite (or c1 c2) t1 t2).
|
|
814
1174
|
if (thenExpr === manager.getArg(elseExpr, 1)) {
|
|
815
1175
|
const disjunction = this.mkOr([condition, manager.getArg(elseExpr, 0)]);
|
|
816
1176
|
return {
|
|
@@ -818,7 +1178,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
818
1178
|
depth: 1,
|
|
819
1179
|
};
|
|
820
1180
|
}
|
|
821
|
-
// (ite c1 t1 (ite c2 t2 t1)) is (ite (or c1 (not c2)) t1 t2).
|
|
822
1181
|
if (thenExpr === manager.getArg(elseExpr, 2)) {
|
|
823
1182
|
const disjunction = this.mkOr([condition, this.mkNot(manager.getArg(elseExpr, 0))]);
|
|
824
1183
|
return {
|
|
@@ -830,8 +1189,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
830
1189
|
return manager.mkApp(OP_ITE, [condition, thenExpr, elseExpr], sort);
|
|
831
1190
|
}
|
|
832
1191
|
|
|
833
|
-
// poly_rewriter::mk_add and mk_sub with a result: arith_rewriter's sum or difference, which is
|
|
834
|
-
// not rewritten again.
|
|
835
1192
|
mkAdd(args: number[]) {
|
|
836
1193
|
return this.arith.mkAdd(args) ?? this.arith.mkAddApp(args);
|
|
837
1194
|
}
|