tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.c92e6a4ea
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 +2 -1
- package/dist/compile.cjs +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +37 -0
- package/dist/index.d.ts +37 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2683 -427
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +45 -44
- package/dist/run.js +45 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +44 -41
- package/dist/transfer.js +45 -42
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -41
- package/src/bags.ts +2 -5
- package/src/builtins.ts +5 -21
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +268 -0
- package/src/check.ts +578 -757
- package/src/cli/options.ts +6 -31
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +27 -62
- package/src/cli/shared.ts +1 -5
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +246 -240
- package/src/cli/tlc-output.ts +686 -0
- package/src/cli/tlc-usage.ts +3 -5
- package/src/cli/tlc.ts +59 -707
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +3 -10
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +73 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +34 -107
- package/src/exit-codes.ts +3 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -9
- package/src/json-reader.ts +1 -2
- package/src/json.ts +8 -18
- package/src/levels.ts +46 -57
- package/src/lexer.ts +76 -85
- package/src/liveness-checker.ts +634 -306
- package/src/liveness.ts +104 -120
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +38 -8
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +26 -14
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +118 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +17 -31
- package/src/parallel.ts +55 -80
- package/src/parser.ts +722 -385
- package/src/pcal/ast.ts +53 -65
- package/src/pcal/parse.ts +144 -191
- package/src/pcal/tokenize.ts +91 -115
- package/src/pcal/translate.ts +83 -98
- package/src/pcal/validate.ts +48 -50
- package/src/pretty-print.ts +7 -7
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- 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 +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +0 -2
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +17 -28
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +6 -17
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +14 -13
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -618
- 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 -1
- 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 +613 -6
- 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/asserted-formulas.ts +87 -16
- package/src/prover/smt/solver/ast-lt.ts +166 -12
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1427 -41
- package/src/prover/smt/solver/auf-solver.ts +2 -6
- 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 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +516 -115
- package/src/prover/smt/solver/ctx-simplify.ts +20 -10
- 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 +38 -10
- 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 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- 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 -3
- 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 +908 -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 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- 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 -15
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- 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 +175 -15
- 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 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- 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 +110 -38
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- 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 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +67 -16
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +165 -83
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -289
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- 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 -6
- 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 +18 -27
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +56 -29
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- 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 +125 -12
- package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +63 -23
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
- package/src/prover/smt/solver/nlsat/solver.ts +236 -45
- 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 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
- package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- 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 +19 -11
- 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 +202 -57
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- 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 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- 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 -1
- 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 +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +8 -16
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- 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 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +38 -2
- 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 +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 +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 +3126 -316
- 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 +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- 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 +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -1
- 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 +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +50 -19
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +28 -2
- package/src/prover/zenon/index-table.ts +11 -21
- package/src/prover/zenon/isar-case.ts +0 -2
- package/src/prover/zenon/isar.ts +35 -37
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- package/src/prover/zenon/phrase.ts +0 -2
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/randomization.ts +1 -4
- package/src/resolve.ts +67 -143
- package/src/runtime.ts +17 -18
- package/src/sany/builtins.ts +1 -3
- 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 +160 -2683
- package/src/sany/levels.ts +5 -11
- package/src/sany/lexer.ts +57 -60
- package/src/sany/linter.ts +0 -3
- package/src/sany/nodes.ts +6 -13
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +35 -38
- package/src/sany/xml.ts +23 -55
- package/src/search.ts +244 -53
- package/src/simulate.ts +202 -184
- package/src/spec-description.ts +56 -82
- package/src/standard-definitions.ts +4 -3
- package/src/standard-modules.ts +17 -44
- package/src/state-graph.ts +3 -17
- package/src/subexpressions.ts +38 -47
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +20 -43
- package/src/symmetry.ts +6 -21
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +96 -30
- package/src/tlc/jar-data.ts +0 -1
- package/src/tlc/messages.ts +22 -36
- package/src/tlc/order.ts +36 -50
- package/src/tlc/random.ts +22 -34
- package/src/tlc/replay.ts +21 -48
- package/src/tlc/summary.ts +64 -58
- package/src/tlc/tlc-operators.ts +6 -17
- package/src/tlc/tlcext-operators.ts +70 -29
- package/src/tlc/trace-spec.ts +26 -51
- package/src/tlc/value-stream.ts +9 -13
- package/src/tlc/version.ts +0 -1
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/values.ts +136 -338
- package/src/prover/isabelle/isar/statement.ts +0 -52
- 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
|
@@ -0,0 +1,141 @@
|
|
|
1
|
+
import {
|
|
2
|
+
type AstManager,
|
|
3
|
+
FAMILY_ARITH,
|
|
4
|
+
OP_AND,
|
|
5
|
+
OP_EQ,
|
|
6
|
+
OP_GE,
|
|
7
|
+
OP_GT,
|
|
8
|
+
OP_LE,
|
|
9
|
+
OP_LT,
|
|
10
|
+
OP_MUL,
|
|
11
|
+
OP_OR,
|
|
12
|
+
OP_POWER,
|
|
13
|
+
SORT_BOOL,
|
|
14
|
+
SORT_INT,
|
|
15
|
+
SORT_REAL,
|
|
16
|
+
} from "./ast";
|
|
17
|
+
import { runSimplifier } from "./dependent-expr-state";
|
|
18
|
+
import { Expr2Polynomial } from "./expr2polynomial";
|
|
19
|
+
import type { Goal } from "./goal";
|
|
20
|
+
import { getLcm, Rational } from "./rational";
|
|
21
|
+
import { PolynomialManager } from "./nlsat/polynomial";
|
|
22
|
+
import type { Rewrite } from "./rewriter-tpl";
|
|
23
|
+
import { RewriterTpl } from "./rewriter-tpl";
|
|
24
|
+
|
|
25
|
+
const FLIPPED = new Map([
|
|
26
|
+
[OP_LT, OP_GT],
|
|
27
|
+
[OP_LE, OP_GE],
|
|
28
|
+
[OP_GT, OP_LT],
|
|
29
|
+
[OP_GE, OP_LE],
|
|
30
|
+
]);
|
|
31
|
+
|
|
32
|
+
class FactorRewriter extends RewriterTpl {
|
|
33
|
+
readonly expr2poly: Expr2Polynomial;
|
|
34
|
+
|
|
35
|
+
constructor(
|
|
36
|
+
manager: AstManager,
|
|
37
|
+
private isSplittingFactors: boolean,
|
|
38
|
+
) {
|
|
39
|
+
super(manager);
|
|
40
|
+
this.expr2poly = new Expr2Polynomial(manager, new PolynomialManager());
|
|
41
|
+
}
|
|
42
|
+
|
|
43
|
+
private mkZeroFor(expr: number) {
|
|
44
|
+
const sort = this.manager.sorts[expr] === SORT_INT ? SORT_INT : SORT_REAL;
|
|
45
|
+
return this.manager.mkNumeralOfSort(Rational.of(0n), sort);
|
|
46
|
+
}
|
|
47
|
+
|
|
48
|
+
private mkMul(args: number[]) {
|
|
49
|
+
return args.length === 1
|
|
50
|
+
? args[0]
|
|
51
|
+
: this.manager.mkApp(OP_MUL, args, this.manager.sorts[args[0]]);
|
|
52
|
+
}
|
|
53
|
+
|
|
54
|
+
private factor(op: number, lhs: number, rhs: number): number {
|
|
55
|
+
const manager = this.manager;
|
|
56
|
+
const pm = this.expr2poly.pm;
|
|
57
|
+
const first = this.expr2poly.toPolynomial(lhs);
|
|
58
|
+
const second = this.expr2poly.toPolynomial(rhs);
|
|
59
|
+
const lcm = getLcm(first.denominator, second.denominator);
|
|
60
|
+
const polynomial = pm.addmul(
|
|
61
|
+
lcm / first.denominator,
|
|
62
|
+
first.polynomial,
|
|
63
|
+
-(lcm / second.denominator),
|
|
64
|
+
second.polynomial,
|
|
65
|
+
);
|
|
66
|
+
if (pm.isConst(polynomial)) return -1;
|
|
67
|
+
const factors = pm.factor(polynomial);
|
|
68
|
+
if (factors.factors.length === 1 && factors.degrees[0] === 1) return -1;
|
|
69
|
+
const terms = factors.factors.map((factor) => this.expr2poly.toExpr(factor, true));
|
|
70
|
+
if (op === OP_EQ) {
|
|
71
|
+
if (!this.isSplittingFactors)
|
|
72
|
+
return manager.mkEq(this.mkMul(terms), this.mkZeroFor(terms[terms.length - 1]));
|
|
73
|
+
const eqs = terms.map((term) => manager.mkEq(term, this.mkZeroFor(term)));
|
|
74
|
+
return eqs.length === 1 ? eqs[0] : manager.mkApp(OP_OR, eqs, SORT_BOOL);
|
|
75
|
+
}
|
|
76
|
+
const kind = factors.constant < 0n ? (FLIPPED.get(op) as number) : op;
|
|
77
|
+
if (!this.isSplittingFactors) {
|
|
78
|
+
const args = terms.map((term, index) =>
|
|
79
|
+
factors.degrees[index] % 2 === 0
|
|
80
|
+
? manager.mkApp(
|
|
81
|
+
OP_POWER,
|
|
82
|
+
[term, manager.mkNumeralOfSort(Rational.of(2n), manager.sorts[term])],
|
|
83
|
+
SORT_REAL,
|
|
84
|
+
)
|
|
85
|
+
: term,
|
|
86
|
+
);
|
|
87
|
+
const product = this.mkMul(args);
|
|
88
|
+
return manager.mkApp(kind, [product, this.mkZeroFor(product)], SORT_BOOL);
|
|
89
|
+
}
|
|
90
|
+
const isStrict = kind === OP_LT || kind === OP_GT;
|
|
91
|
+
const args: number[] = [];
|
|
92
|
+
const oddFactors: number[] = [];
|
|
93
|
+
for (const [index, term] of terms.entries()) {
|
|
94
|
+
if (factors.degrees[index] % 2 !== 0) {
|
|
95
|
+
oddFactors.push(term);
|
|
96
|
+
continue;
|
|
97
|
+
}
|
|
98
|
+
const eq = manager.mkEq(term, this.mkZeroFor(term));
|
|
99
|
+
args.push(isStrict ? manager.mkNot(eq) : eq);
|
|
100
|
+
}
|
|
101
|
+
if (oddFactors.length === 0) {
|
|
102
|
+
if (kind === OP_LT) return manager.falseExpr;
|
|
103
|
+
if (kind === OP_GE) return manager.trueExpr;
|
|
104
|
+
} else {
|
|
105
|
+
const product = this.mkMul(oddFactors);
|
|
106
|
+
args.push(manager.mkApp(kind, [product, this.mkZeroFor(oddFactors[0])], SORT_BOOL));
|
|
107
|
+
}
|
|
108
|
+
if (args.length === 1) return args[0];
|
|
109
|
+
return manager.mkApp(isStrict ? OP_AND : OP_OR, args, SORT_BOOL);
|
|
110
|
+
}
|
|
111
|
+
|
|
112
|
+
reduceApp(decl: number, args: number[]): number | Rewrite {
|
|
113
|
+
const manager = this.manager;
|
|
114
|
+
if (args.length !== 2) return -1;
|
|
115
|
+
const funcDecl = manager.funcDecls[decl];
|
|
116
|
+
const isArith = (expr: number) => manager.getFamily(expr) === FAMILY_ARITH;
|
|
117
|
+
const isFactoring =
|
|
118
|
+
(funcDecl.op === OP_EQ &&
|
|
119
|
+
(isArith(args[0]) || isArith(args[1])) &&
|
|
120
|
+
!manager.isBool(args[0])) ||
|
|
121
|
+
(funcDecl.family === FAMILY_ARITH && FLIPPED.has(funcDecl.op));
|
|
122
|
+
if (!isFactoring) return -1;
|
|
123
|
+
const outer = manager.beginTemporaries();
|
|
124
|
+
const result = this.factor(funcDecl.op, args[0], args[1]);
|
|
125
|
+
if (result !== -1) manager.incRef(result);
|
|
126
|
+
manager.endTemporaries(outer);
|
|
127
|
+
return result;
|
|
128
|
+
}
|
|
129
|
+
}
|
|
130
|
+
|
|
131
|
+
export const factor = (manager: AstManager, goal: Goal, isSplittingFactors: boolean) =>
|
|
132
|
+
runSimplifier(goal, false, (state) => {
|
|
133
|
+
const rewriter = new FactorRewriter(manager, isSplittingFactors);
|
|
134
|
+
return {
|
|
135
|
+
reduce: () => state.rewriteEach((form) => rewriter.rewrite(form)),
|
|
136
|
+
release: () => {
|
|
137
|
+
rewriter.expr2poly.release();
|
|
138
|
+
rewriter.release();
|
|
139
|
+
},
|
|
140
|
+
};
|
|
141
|
+
});
|
|
@@ -0,0 +1,265 @@
|
|
|
1
|
+
import { SmtCanceledError } from "../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
type AstManager,
|
|
4
|
+
KIND_APP,
|
|
5
|
+
KIND_QUANTIFIER,
|
|
6
|
+
OP_ADD,
|
|
7
|
+
OP_AND,
|
|
8
|
+
OP_EQ,
|
|
9
|
+
OP_IMPLIES,
|
|
10
|
+
OP_UBV2INT,
|
|
11
|
+
OP_ULEQ,
|
|
12
|
+
SORT_BOOL,
|
|
13
|
+
SORT_INT,
|
|
14
|
+
} from "./ast";
|
|
15
|
+
import { BoundManager } from "./bound-manager";
|
|
16
|
+
import { mkBvApp } from "./bv-decl-plugin";
|
|
17
|
+
import { Bv2IntContext, Bv2IntRewriter } from "./bv2int-rewriter";
|
|
18
|
+
import { card2bv } from "./card2bv";
|
|
19
|
+
import { runEnum2Bv } from "./dt2bv-tactic";
|
|
20
|
+
import { ExprSafeReplace } from "./expr-safe-replace";
|
|
21
|
+
import { type Definition, Goal } from "./goal";
|
|
22
|
+
import { ObjMap } from "./hashtable";
|
|
23
|
+
import { L_FALSE, L_TRUE } from "./lbool";
|
|
24
|
+
import { RefVector } from "./ref-vector";
|
|
25
|
+
import { Rewriter } from "./rewriter";
|
|
26
|
+
import { convertModel, getRewriterOptions } from "./tactic";
|
|
27
|
+
import { UINT_MAX } from "./sat/clause";
|
|
28
|
+
import type { SatParams } from "./sat/config";
|
|
29
|
+
import { IncSatSolver } from "./sat/inc-sat-solver";
|
|
30
|
+
import { SubstReplacer } from "./solve-eqs";
|
|
31
|
+
|
|
32
|
+
const getNumBits = (value: bigint) => {
|
|
33
|
+
let bound = 1n;
|
|
34
|
+
let numBits = 1;
|
|
35
|
+
while (bound <= value) {
|
|
36
|
+
numBits++;
|
|
37
|
+
bound *= 2n;
|
|
38
|
+
}
|
|
39
|
+
return numBits;
|
|
40
|
+
};
|
|
41
|
+
|
|
42
|
+
const collectBounds = (manager: AstManager, bounds: BoundManager, form: number) => {
|
|
43
|
+
if (manager.getOp(form) !== OP_AND) {
|
|
44
|
+
bounds.add(form);
|
|
45
|
+
return;
|
|
46
|
+
}
|
|
47
|
+
for (const arg of manager.getArgs(form)) collectBounds(manager, bounds, arg);
|
|
48
|
+
};
|
|
49
|
+
|
|
50
|
+
// bounded_int2bv_simplifier: an integer constant between two bounds becomes an unsigned
|
|
51
|
+
// bit-vector plus the lower bound.
|
|
52
|
+
const runBoundedInt2Bv = (manager: AstManager, goal: Goal) => {
|
|
53
|
+
const bounds = new BoundManager(manager);
|
|
54
|
+
for (const form of goal.forms.items) collectBounds(manager, bounds, form);
|
|
55
|
+
const substitution = new ObjMap<number>((expr) => manager.hashes[expr]);
|
|
56
|
+
const trail = new RefVector(manager);
|
|
57
|
+
const sideConditions = new RefVector(manager);
|
|
58
|
+
const definitions: Definition[] = [];
|
|
59
|
+
for (const expr of bounds.boundedVars) {
|
|
60
|
+
const lower = bounds.lowers.get(expr);
|
|
61
|
+
const upper = bounds.uppers.get(expr);
|
|
62
|
+
if (
|
|
63
|
+
lower === undefined ||
|
|
64
|
+
upper === undefined ||
|
|
65
|
+
lower.value.compare(upper.value) > 0 ||
|
|
66
|
+
lower.isStrict ||
|
|
67
|
+
upper.isStrict ||
|
|
68
|
+
manager.sorts[expr] !== SORT_INT
|
|
69
|
+
)
|
|
70
|
+
continue;
|
|
71
|
+
const domainSize = upper.value.sub(lower.value).num + 1n;
|
|
72
|
+
const numBits = getNumBits(domainSize);
|
|
73
|
+
const bits = manager.mkFreshConst("b", manager.mkBvSort(numBits));
|
|
74
|
+
trail.push(bits);
|
|
75
|
+
const offset = lower.value;
|
|
76
|
+
const unsigned = mkBvApp(manager, OP_UBV2INT, [bits]);
|
|
77
|
+
const replacement = offset.isZero()
|
|
78
|
+
? unsigned
|
|
79
|
+
: manager.mkApp(OP_ADD, [unsigned, manager.mkNumeral(offset.num)], SORT_INT);
|
|
80
|
+
trail.push(replacement);
|
|
81
|
+
definitions.push(
|
|
82
|
+
{ decl: manager.decls[bits], def: -1 },
|
|
83
|
+
{ decl: manager.decls[expr], def: replacement },
|
|
84
|
+
);
|
|
85
|
+
if (!offset.isZero() && (domainSize & (domainSize - 1n)) !== 0n)
|
|
86
|
+
sideConditions.push(
|
|
87
|
+
mkBvApp(manager, OP_ULEQ, [bits, manager.mkBvNumeral(domainSize - 1n, numBits)]),
|
|
88
|
+
);
|
|
89
|
+
substitution.set(expr, replacement);
|
|
90
|
+
}
|
|
91
|
+
if (substitution.size > 0) {
|
|
92
|
+
const replacer = new SubstReplacer(manager, substitution);
|
|
93
|
+
const context = new Bv2IntContext(manager, UINT_MAX);
|
|
94
|
+
const rewriter = new Bv2IntRewriter(manager, context);
|
|
95
|
+
for (let index = 0; index < goal.forms.size; index++) {
|
|
96
|
+
const form = goal.forms.items[index];
|
|
97
|
+
const replaced = replacer.rewrite(form);
|
|
98
|
+
const result = rewriter.rewrite(replaced);
|
|
99
|
+
manager.decRef(replaced);
|
|
100
|
+
if (result !== form) goal.update(index, result);
|
|
101
|
+
manager.decRef(result);
|
|
102
|
+
}
|
|
103
|
+
rewriter.release();
|
|
104
|
+
context.release();
|
|
105
|
+
replacer.release();
|
|
106
|
+
}
|
|
107
|
+
for (const condition of sideConditions.items) goal.assert(condition);
|
|
108
|
+
if (definitions.length > 0) goal.addDefinitions(definitions);
|
|
109
|
+
sideConditions.reset();
|
|
110
|
+
trail.reset();
|
|
111
|
+
};
|
|
112
|
+
|
|
113
|
+
const runFdSimplifier = (manager: AstManager, forms: readonly number[]) => {
|
|
114
|
+
const fmls = new Goal(manager);
|
|
115
|
+
for (const form of forms) fmls.assert(form);
|
|
116
|
+
runBoundedInt2Bv(manager, fmls);
|
|
117
|
+
card2bv(manager, fmls, getRewriterOptions(manager, new Map()));
|
|
118
|
+
runEnum2Bv(manager, fmls);
|
|
119
|
+
return fmls;
|
|
120
|
+
};
|
|
121
|
+
|
|
122
|
+
// The sole uninterpreted constant of a term, which stands for it in the SAT solver.
|
|
123
|
+
const getRepresentative = (manager: AstManager, expr: number) => {
|
|
124
|
+
const visited = new Set<number>();
|
|
125
|
+
const todo = [expr];
|
|
126
|
+
let result = -1;
|
|
127
|
+
for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
|
|
128
|
+
if (visited.has(current)) continue;
|
|
129
|
+
visited.add(current);
|
|
130
|
+
if (manager.isUninterpretedConst(current)) {
|
|
131
|
+
if (result !== -1 && result !== current) return -1;
|
|
132
|
+
result = current;
|
|
133
|
+
} else if (manager.kinds[current] === KIND_QUANTIFIER)
|
|
134
|
+
todo.push(manager.getQuantifier(current).body);
|
|
135
|
+
else if (manager.kinds[current] === KIND_APP) manager.pushArgs(current, todo);
|
|
136
|
+
}
|
|
137
|
+
return result;
|
|
138
|
+
};
|
|
139
|
+
|
|
140
|
+
// simplifier_solver::get_consequences over the fd solver: a variable the simplifier defines is
|
|
141
|
+
// queried through the constant of its definition, and its value is decoded from that constant's.
|
|
142
|
+
export const getFdConsequences = (
|
|
143
|
+
manager: AstManager,
|
|
144
|
+
params: SatParams,
|
|
145
|
+
forms: readonly number[],
|
|
146
|
+
assumptions: readonly number[],
|
|
147
|
+
vars: readonly number[],
|
|
148
|
+
) => {
|
|
149
|
+
const fmls = runFdSimplifier(manager, forms);
|
|
150
|
+
const trail = new RefVector(manager);
|
|
151
|
+
const definitions = new ExprSafeReplace(manager);
|
|
152
|
+
for (const converter of fmls.converters)
|
|
153
|
+
if ("definitions" in converter)
|
|
154
|
+
for (const definition of converter.definitions) {
|
|
155
|
+
const decl = manager.funcDecls[definition.decl];
|
|
156
|
+
if (definition.def !== -1 && decl.domain.length === 0)
|
|
157
|
+
definitions.insert(manager.mkApp(definition.decl, [], decl.range), definition.def);
|
|
158
|
+
}
|
|
159
|
+
const rewriter = new Rewriter(manager, getRewriterOptions(manager, new Map()));
|
|
160
|
+
const rewrite = (expr: number) => {
|
|
161
|
+
const result = rewriter.rewrite(expr);
|
|
162
|
+
trail.pushOwned(result);
|
|
163
|
+
return result;
|
|
164
|
+
};
|
|
165
|
+
const flush = (expr: number) => {
|
|
166
|
+
const replaced = definitions.apply(expr);
|
|
167
|
+
trail.pushOwned(replaced);
|
|
168
|
+
return rewrite(replaced);
|
|
169
|
+
};
|
|
170
|
+
const asms1 = assumptions.map(flush);
|
|
171
|
+
const vars1 = vars.map(flush);
|
|
172
|
+
const queryVars = vars1.map((expr) => {
|
|
173
|
+
const representative = getRepresentative(manager, expr);
|
|
174
|
+
return representative === -1 ? expr : representative;
|
|
175
|
+
});
|
|
176
|
+
const solver = new IncSatSolver(manager, params);
|
|
177
|
+
try {
|
|
178
|
+
for (const form of fmls.forms.items) solver.assertExpr(form);
|
|
179
|
+
if (fmls.isInconsistent) solver.assertExpr(manager.falseExpr);
|
|
180
|
+
const found = solver.getConsequences(asms1, queryVars);
|
|
181
|
+
const coreReplace = new ExprSafeReplace(manager);
|
|
182
|
+
asms1.forEach((assumption, index) => coreReplace.insert(assumption, assumptions[index]));
|
|
183
|
+
const consequences = new RefVector(manager);
|
|
184
|
+
for (const consequence of found.consequences) {
|
|
185
|
+
const premise = manager.getArg(consequence, 0);
|
|
186
|
+
const conclusion = manager.getArg(consequence, 1);
|
|
187
|
+
const [query, value] = (() => {
|
|
188
|
+
if (manager.decls[conclusion] === OP_EQ) {
|
|
189
|
+
const lhs = manager.getArg(conclusion, 0);
|
|
190
|
+
const rhs = manager.getArg(conclusion, 1);
|
|
191
|
+
for (const queryVar of queryVars) {
|
|
192
|
+
if (lhs === queryVar) return [lhs, rhs];
|
|
193
|
+
if (rhs === queryVar) return [rhs, lhs];
|
|
194
|
+
}
|
|
195
|
+
return [-1, -1];
|
|
196
|
+
}
|
|
197
|
+
if (manager.isUninterpretedConst(conclusion)) return [conclusion, manager.trueExpr];
|
|
198
|
+
if (
|
|
199
|
+
manager.isNot(conclusion) &&
|
|
200
|
+
manager.isUninterpretedConst(manager.getArg(conclusion, 0))
|
|
201
|
+
)
|
|
202
|
+
return [manager.getArg(conclusion, 0), manager.falseExpr];
|
|
203
|
+
return [-1, -1];
|
|
204
|
+
})();
|
|
205
|
+
const index = queryVars.findIndex(
|
|
206
|
+
(queryVar, position) => queryVar === query && vars[position] !== vars1[position],
|
|
207
|
+
);
|
|
208
|
+
const decoded = (() => {
|
|
209
|
+
if (query === -1 || index === -1) return consequence;
|
|
210
|
+
const substitution = new ExprSafeReplace(manager);
|
|
211
|
+
substitution.insert(query, value);
|
|
212
|
+
const replaced = substitution.apply(vars1[index]);
|
|
213
|
+
trail.pushOwned(replaced);
|
|
214
|
+
substitution.release();
|
|
215
|
+
return manager.mkApp(
|
|
216
|
+
OP_IMPLIES,
|
|
217
|
+
[premise, manager.mkEq(vars[index], rewrite(replaced))],
|
|
218
|
+
SORT_BOOL,
|
|
219
|
+
);
|
|
220
|
+
})();
|
|
221
|
+
consequences.pushOwned(coreReplace.apply(decoded));
|
|
222
|
+
}
|
|
223
|
+
coreReplace.release();
|
|
224
|
+
const model = found.result === L_TRUE ? solver.getModel() : null;
|
|
225
|
+
model?.incRef();
|
|
226
|
+
return {
|
|
227
|
+
result: found.result,
|
|
228
|
+
consequences,
|
|
229
|
+
model: model === null ? undefined : convertModel(fmls, model),
|
|
230
|
+
};
|
|
231
|
+
} finally {
|
|
232
|
+
solver.release();
|
|
233
|
+
rewriter.release();
|
|
234
|
+
definitions.release();
|
|
235
|
+
trail.reset();
|
|
236
|
+
}
|
|
237
|
+
};
|
|
238
|
+
|
|
239
|
+
// qffd without parallel.enable: solver2tactic over simplifier_solver(inc_sat_solver, fd_simplifier).
|
|
240
|
+
export const createFdTactic = (manager: AstManager, params: SatParams) => (goal: Goal) => {
|
|
241
|
+
const fmls = runFdSimplifier(manager, goal.forms.items);
|
|
242
|
+
const solver = new IncSatSolver(manager, params, false);
|
|
243
|
+
try {
|
|
244
|
+
for (const form of fmls.forms.items) solver.assertExpr(form);
|
|
245
|
+
const result = fmls.isInconsistent ? L_FALSE : solver.check();
|
|
246
|
+
goal.reset();
|
|
247
|
+
if (result === L_TRUE) {
|
|
248
|
+
const model = solver.getModel();
|
|
249
|
+
model?.incRef();
|
|
250
|
+
if (model !== null) {
|
|
251
|
+
goal.converters = [...goal.converters, ...fmls.converters];
|
|
252
|
+
goal.model = model;
|
|
253
|
+
}
|
|
254
|
+
} else if (result === L_FALSE) goal.assert(manager.falseExpr);
|
|
255
|
+
else {
|
|
256
|
+
if (!manager.limit.inc()) throw new SmtCanceledError();
|
|
257
|
+
for (const form of solver.getAssertions()) goal.assert(form);
|
|
258
|
+
goal.converters = [...goal.converters, ...fmls.converters, ...solver.getConverters()];
|
|
259
|
+
}
|
|
260
|
+
goal.depth++;
|
|
261
|
+
return [goal];
|
|
262
|
+
} finally {
|
|
263
|
+
solver.release();
|
|
264
|
+
}
|
|
265
|
+
};
|
|
@@ -1,11 +1,10 @@
|
|
|
1
|
-
// Ported from Z3 (src/smt/fingerprints.cpp), MIT license, see z3-license.txt.
|
|
2
1
|
import type { AstManager } from "./ast";
|
|
3
2
|
import type { Enode } from "./enode";
|
|
4
3
|
import { getCompositeHash } from "./hash";
|
|
5
4
|
import { shrink } from "./array";
|
|
6
5
|
|
|
7
6
|
export class FingerprintSet {
|
|
8
|
-
private
|
|
7
|
+
private datas: number[] = [];
|
|
9
8
|
private hashes: number[] = [];
|
|
10
9
|
private roots: Enode[][] = [];
|
|
11
10
|
private slots = new Int32Array(1024).fill(-1);
|
|
@@ -15,37 +14,38 @@ export class FingerprintSet {
|
|
|
15
14
|
|
|
16
15
|
constructor(private manager: AstManager) {}
|
|
17
16
|
|
|
18
|
-
|
|
17
|
+
// The hash comes from the bindings themselves, and the set is searched with the bindings and
|
|
18
|
+
// then with their roots.
|
|
19
|
+
insert(data: number, dataHash: number, bindings: Enode[]) {
|
|
19
20
|
const manager = this.manager;
|
|
20
21
|
const bindingHashes = this.bindingHashes;
|
|
21
22
|
shrink(bindingHashes, 0);
|
|
22
23
|
for (const binding of bindings) bindingHashes.push(manager.hashes[binding.owner]);
|
|
23
|
-
const hash = getCompositeHash(bindingHashes,
|
|
24
|
-
if (this.find(
|
|
24
|
+
const hash = getCompositeHash(bindingHashes, dataHash);
|
|
25
|
+
if (this.find(data, hash, bindings) === -1) return null;
|
|
25
26
|
const bindingRoots = this.bindingRoots;
|
|
26
27
|
shrink(bindingRoots, 0);
|
|
27
28
|
for (const binding of bindings) bindingRoots.push(binding.root);
|
|
28
|
-
const slot = this.find(
|
|
29
|
+
const slot = this.find(data, hash, bindingRoots);
|
|
29
30
|
if (slot === -1) return null;
|
|
30
31
|
const roots = bindingRoots.slice();
|
|
31
|
-
this.
|
|
32
|
+
this.datas.push(data);
|
|
32
33
|
this.hashes.push(hash);
|
|
33
34
|
this.roots.push(roots);
|
|
34
|
-
if (2 * this.
|
|
35
|
-
this.slots[slot] = this.quantifiers.length - 1;
|
|
35
|
+
if (2 * this.datas.length <= this.slots.length) this.slots[slot] = this.datas.length - 1;
|
|
36
36
|
else {
|
|
37
37
|
this.slots = new Int32Array(2 * this.slots.length).fill(-1);
|
|
38
|
-
for (let index = 0; index < this.
|
|
38
|
+
for (let index = 0; index < this.datas.length; index++) this.place(index);
|
|
39
39
|
}
|
|
40
40
|
return roots;
|
|
41
41
|
}
|
|
42
42
|
|
|
43
|
-
private find(
|
|
43
|
+
private find(data: number, hash: number, args: Enode[]) {
|
|
44
44
|
const mask = this.slots.length - 1;
|
|
45
45
|
let slot = hash & mask;
|
|
46
46
|
for (; this.slots[slot] !== -1; slot = (slot + 1) & mask) {
|
|
47
47
|
const index = this.slots[slot];
|
|
48
|
-
if (this.hashes[index] !== hash || this.
|
|
48
|
+
if (this.hashes[index] !== hash || this.datas[index] !== data) continue;
|
|
49
49
|
const existing = this.roots[index];
|
|
50
50
|
let position = 0;
|
|
51
51
|
while (position < args.length && existing[position] === args[position]) position++;
|
|
@@ -62,18 +62,18 @@ export class FingerprintSet {
|
|
|
62
62
|
}
|
|
63
63
|
|
|
64
64
|
push() {
|
|
65
|
-
this.scopes.push(this.
|
|
65
|
+
this.scopes.push(this.datas.length);
|
|
66
66
|
}
|
|
67
67
|
|
|
68
68
|
pop(numScopes: number) {
|
|
69
69
|
const limit = this.scopes[this.scopes.length - numScopes];
|
|
70
70
|
const mask = this.slots.length - 1;
|
|
71
|
-
for (let index = this.
|
|
71
|
+
for (let index = this.datas.length - 1; index >= limit; index--) {
|
|
72
72
|
let slot = this.hashes[index] & mask;
|
|
73
73
|
while (this.slots[slot] !== index) slot = (slot + 1) & mask;
|
|
74
74
|
this.slots[slot] = -1;
|
|
75
75
|
}
|
|
76
|
-
shrink(this.
|
|
76
|
+
shrink(this.datas, limit);
|
|
77
77
|
shrink(this.hashes, limit);
|
|
78
78
|
shrink(this.roots, limit);
|
|
79
79
|
shrink(this.scopes, this.scopes.length - numScopes);
|
|
@@ -0,0 +1,148 @@
|
|
|
1
|
+
import {
|
|
2
|
+
type AstManager,
|
|
3
|
+
FAMILY_ARITH,
|
|
4
|
+
FAMILY_USER,
|
|
5
|
+
KIND_APP,
|
|
6
|
+
OP_ADD,
|
|
7
|
+
OP_EQ,
|
|
8
|
+
isArithSort,
|
|
9
|
+
} from "./ast";
|
|
10
|
+
import type { Goal } from "./goal";
|
|
11
|
+
import { ObjMap } from "./hashtable";
|
|
12
|
+
import { Rational } from "./rational";
|
|
13
|
+
import { Rewriter, type RewriterOptions } from "./rewriter";
|
|
14
|
+
|
|
15
|
+
class TargetFinder {
|
|
16
|
+
private visited = new Set<number>();
|
|
17
|
+
private todo: number[] = [];
|
|
18
|
+
readonly occs: ObjMap<number>;
|
|
19
|
+
readonly nonNestedOccs: ObjMap<number>;
|
|
20
|
+
|
|
21
|
+
constructor(private manager: AstManager) {
|
|
22
|
+
this.occs = new ObjMap((expr) => manager.hashes[expr]);
|
|
23
|
+
this.nonNestedOccs = new ObjMap((expr) => manager.hashes[expr]);
|
|
24
|
+
}
|
|
25
|
+
|
|
26
|
+
private isUninterp(expr: number) {
|
|
27
|
+
const manager = this.manager;
|
|
28
|
+
return manager.kinds[expr] === KIND_APP && manager.getFamily(expr) === FAMILY_USER;
|
|
29
|
+
}
|
|
30
|
+
|
|
31
|
+
private isArith(expr: number) {
|
|
32
|
+
return isArithSort(this.manager.sorts[expr]);
|
|
33
|
+
}
|
|
34
|
+
|
|
35
|
+
private visit(expr: number, isNested: boolean) {
|
|
36
|
+
if (this.isUninterp(expr) && this.manager.getNumArgs(expr) === 0 && this.isArith(expr)) {
|
|
37
|
+
this.occs.set(expr, (this.occs.get(expr) ?? 0) + 1);
|
|
38
|
+
if (!isNested) this.nonNestedOccs.set(expr, (this.nonNestedOccs.get(expr) ?? 0) + 1);
|
|
39
|
+
}
|
|
40
|
+
if (this.visited.has(expr)) return;
|
|
41
|
+
this.visited.add(expr);
|
|
42
|
+
this.todo.push(expr);
|
|
43
|
+
}
|
|
44
|
+
|
|
45
|
+
private processApp(expr: number) {
|
|
46
|
+
if (!this.isUninterp(expr) && !this.isArith(expr)) return false;
|
|
47
|
+
for (const arg of this.manager.getArgs(expr)) this.visit(arg, false);
|
|
48
|
+
return true;
|
|
49
|
+
}
|
|
50
|
+
|
|
51
|
+
private processAtom(first: number, second: number, isNested: boolean) {
|
|
52
|
+
const manager = this.manager;
|
|
53
|
+
if (this.isUninterp(first) && this.isUninterp(second)) {
|
|
54
|
+
this.visit(first, isNested);
|
|
55
|
+
this.visit(second, isNested);
|
|
56
|
+
return true;
|
|
57
|
+
}
|
|
58
|
+
const [lhs, rhs] = manager.isNumeral(first) ? [second, first] : [first, second];
|
|
59
|
+
if (!manager.isNumeral(rhs) || manager.getOp(lhs) !== OP_ADD || manager.getNumArgs(lhs) !== 2)
|
|
60
|
+
return false;
|
|
61
|
+
const term = manager.getArg(lhs, 0);
|
|
62
|
+
const subtracted = manager.getTimesMinusOneArg(manager.getArg(lhs, 1));
|
|
63
|
+
if (subtracted === undefined || !this.isUninterp(term) || !this.isUninterp(subtracted))
|
|
64
|
+
return false;
|
|
65
|
+
this.visit(term, isNested);
|
|
66
|
+
this.visit(subtracted, isNested);
|
|
67
|
+
return true;
|
|
68
|
+
}
|
|
69
|
+
|
|
70
|
+
private processArith(expr: number, isNested: boolean) {
|
|
71
|
+
const manager = this.manager;
|
|
72
|
+
const args = manager.getArgs(expr);
|
|
73
|
+
if (!this.isArith(expr) && args.length === 2)
|
|
74
|
+
return this.processAtom(args[0], args[1], isNested);
|
|
75
|
+
if (
|
|
76
|
+
manager.getOp(expr) !== OP_ADD ||
|
|
77
|
+
args.length !== 2 ||
|
|
78
|
+
!this.isUninterp(args[1]) ||
|
|
79
|
+
!manager.isNumeral(args[0])
|
|
80
|
+
)
|
|
81
|
+
return false;
|
|
82
|
+
this.visit(args[1], isNested);
|
|
83
|
+
return true;
|
|
84
|
+
}
|
|
85
|
+
|
|
86
|
+
private isArithApp(expr: number) {
|
|
87
|
+
const manager = this.manager;
|
|
88
|
+
return manager.kinds[expr] === KIND_APP && manager.getFamily(expr) === FAMILY_ARITH;
|
|
89
|
+
}
|
|
90
|
+
|
|
91
|
+
// Constants visited at the top stay on the work list until a later formula drains it.
|
|
92
|
+
process(form: number) {
|
|
93
|
+
const manager = this.manager;
|
|
94
|
+
if (this.visited.has(form)) return true;
|
|
95
|
+
let expr = form;
|
|
96
|
+
while (manager.isNot(expr)) expr = manager.getArg(expr, 0);
|
|
97
|
+
if (this.isArithApp(expr)) return this.processArith(expr, false);
|
|
98
|
+
this.todo.push(expr);
|
|
99
|
+
this.visited.add(expr);
|
|
100
|
+
while (this.todo.length > 0) {
|
|
101
|
+
const current = this.todo.pop() as number;
|
|
102
|
+
const isProcessed =
|
|
103
|
+
manager.kinds[current] !== KIND_APP
|
|
104
|
+
? false
|
|
105
|
+
: manager.getOp(current) === OP_EQ && this.isArith(manager.getArg(current, 0))
|
|
106
|
+
? this.processAtom(manager.getArg(current, 0), manager.getArg(current, 1), true)
|
|
107
|
+
: manager.getOp(current) !== OP_EQ && this.isArithApp(current)
|
|
108
|
+
? this.processArith(current, true)
|
|
109
|
+
: this.processApp(current);
|
|
110
|
+
if (!isProcessed) return false;
|
|
111
|
+
}
|
|
112
|
+
return true;
|
|
113
|
+
}
|
|
114
|
+
}
|
|
115
|
+
|
|
116
|
+
const getMostOccs = (occs: ObjMap<number>) => {
|
|
117
|
+
let best = 0;
|
|
118
|
+
let found = -1;
|
|
119
|
+
for (const [expr, count] of occs.entries())
|
|
120
|
+
if (count > best) {
|
|
121
|
+
best = count;
|
|
122
|
+
found = expr;
|
|
123
|
+
}
|
|
124
|
+
return { found, best };
|
|
125
|
+
};
|
|
126
|
+
|
|
127
|
+
export const fixDlVar = (manager: AstManager, goal: Goal, options: RewriterOptions) => {
|
|
128
|
+
const finder = new TargetFinder(manager);
|
|
129
|
+
if (!goal.forms.items.every((form) => finder.process(form))) return;
|
|
130
|
+
const nonNested = getMostOccs(finder.nonNestedOccs);
|
|
131
|
+
const all = getMostOccs(finder.occs);
|
|
132
|
+
const variable = all.best > 10 * nonNested.best ? all.found : nonNested.found;
|
|
133
|
+
if (variable === -1) return;
|
|
134
|
+
const zero = manager.mkNumeralOfSort(Rational.zero, manager.sorts[variable]);
|
|
135
|
+
manager.incRef(zero);
|
|
136
|
+
goal.addDefinitions([{ decl: manager.decls[variable], def: zero }]);
|
|
137
|
+
const rewriter = new Rewriter(manager, options);
|
|
138
|
+
rewriter.setSubstitution(new Map([[variable, zero]]));
|
|
139
|
+
const size = goal.forms.size;
|
|
140
|
+
for (let index = 0; index < size && !goal.isInconsistent; index++) {
|
|
141
|
+
const rewritten = rewriter.rewrite(goal.forms.items[index]);
|
|
142
|
+
goal.update(index, rewritten, goal.getDependency(index));
|
|
143
|
+
manager.decRef(rewritten);
|
|
144
|
+
}
|
|
145
|
+
rewriter.release();
|
|
146
|
+
manager.decRef(zero);
|
|
147
|
+
goal.depth++;
|
|
148
|
+
};
|