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,306 @@
|
|
|
1
|
+
import { mkArrayApp, mkAsArray } from "../array-decl-plugin";
|
|
2
|
+
import {
|
|
3
|
+
type AstManager,
|
|
4
|
+
OP_ARRAY_DEFAULT,
|
|
5
|
+
OP_ARRAY_EXT,
|
|
6
|
+
OP_AS_ARRAY,
|
|
7
|
+
OP_CONST_ARRAY,
|
|
8
|
+
OP_SELECT,
|
|
9
|
+
OP_STORE,
|
|
10
|
+
} from "../ast";
|
|
11
|
+
import { L_FALSE, L_UNDEF } from "../lbool";
|
|
12
|
+
import { getCompositeHash } from "../hash";
|
|
13
|
+
import { ObjMap } from "../hashtable";
|
|
14
|
+
import { FuncInterp, type ProtoModel } from "../proto-model";
|
|
15
|
+
import { CR_CONTINUE, CR_DONE, CR_GIVEUP } from "../sat/solver";
|
|
16
|
+
import { hasLargeDomain } from "../theory-array";
|
|
17
|
+
import { ArrayAxioms } from "./array-axioms";
|
|
18
|
+
import { type Enode, getClass, type ThEq } from "./egraph";
|
|
19
|
+
import { addDependency, type Dependencies } from "./th-solver";
|
|
20
|
+
|
|
21
|
+
const getSelectKey = (select: Enode) =>
|
|
22
|
+
select.args
|
|
23
|
+
.slice(1)
|
|
24
|
+
.map((arg) => arg.root.owner)
|
|
25
|
+
.join(",");
|
|
26
|
+
|
|
27
|
+
// select_set: a ptr_hashtable of selects that hashes and compares them by the roots of their
|
|
28
|
+
// indices, and iterates them in its slot order.
|
|
29
|
+
class SelectSet {
|
|
30
|
+
private firsts = new Map<number, Enode>();
|
|
31
|
+
private keys = new Map<string, number>();
|
|
32
|
+
private table: ObjMap<Enode>;
|
|
33
|
+
|
|
34
|
+
constructor(manager: AstManager) {
|
|
35
|
+
this.table = new ObjMap((key) =>
|
|
36
|
+
getCompositeHash(
|
|
37
|
+
(this.firsts.get(key) as Enode).args.slice(1).map((arg) => manager.ids[arg.root.owner]),
|
|
38
|
+
0,
|
|
39
|
+
),
|
|
40
|
+
);
|
|
41
|
+
}
|
|
42
|
+
|
|
43
|
+
has(select: Enode) {
|
|
44
|
+
return this.keys.has(getSelectKey(select));
|
|
45
|
+
}
|
|
46
|
+
|
|
47
|
+
insert(select: Enode) {
|
|
48
|
+
const key = getSelectKey(select);
|
|
49
|
+
const existing = this.keys.get(key);
|
|
50
|
+
if (existing !== undefined) {
|
|
51
|
+
this.table.set(existing, select);
|
|
52
|
+
return;
|
|
53
|
+
}
|
|
54
|
+
this.keys.set(key, select.owner);
|
|
55
|
+
this.firsts.set(select.owner, select);
|
|
56
|
+
this.table.set(select.owner, select);
|
|
57
|
+
}
|
|
58
|
+
|
|
59
|
+
values() {
|
|
60
|
+
return this.table.values();
|
|
61
|
+
}
|
|
62
|
+
}
|
|
63
|
+
|
|
64
|
+
export class ArraySolver extends ArrayAxioms {
|
|
65
|
+
private defaults: (Enode | null)[] = [];
|
|
66
|
+
private elseValues: (number | null)[] = [];
|
|
67
|
+
private parents: number[] = [];
|
|
68
|
+
private selects = new Map<Enode, SelectSet>();
|
|
69
|
+
|
|
70
|
+
override check() {
|
|
71
|
+
this.forcePush();
|
|
72
|
+
const turn = [false, false];
|
|
73
|
+
turn[this.random() % 2] = true;
|
|
74
|
+
for (let index = 0; index < 2; index++) {
|
|
75
|
+
if (turn[index] && this.addDelayedAxioms()) return CR_CONTINUE;
|
|
76
|
+
if (!turn[index] && this.addInterfaceEqualities()) return CR_CONTINUE;
|
|
77
|
+
}
|
|
78
|
+
if (this.delayQhead < this.axiomTrail.length) return CR_CONTINUE;
|
|
79
|
+
if (!this.checkLambdas()) return CR_GIVEUP;
|
|
80
|
+
const constArrays = this.checkConstArrays();
|
|
81
|
+
if (constArrays === L_FALSE) return CR_CONTINUE;
|
|
82
|
+
if (constArrays === L_UNDEF) return CR_GIVEUP;
|
|
83
|
+
return CR_DONE;
|
|
84
|
+
}
|
|
85
|
+
|
|
86
|
+
override newEqEh(eq: ThEq) {
|
|
87
|
+
this.forcePush();
|
|
88
|
+
this.find.merge(eq.v1, eq.v2);
|
|
89
|
+
}
|
|
90
|
+
|
|
91
|
+
override useDiseqs() {
|
|
92
|
+
return true;
|
|
93
|
+
}
|
|
94
|
+
|
|
95
|
+
override newDiseqEh(eq: ThEq) {
|
|
96
|
+
this.forcePush();
|
|
97
|
+
const first = this.var2enodeOf(eq.v1);
|
|
98
|
+
if (this.isArray(first.owner))
|
|
99
|
+
this.pushAxiom(this.extensionalityAxiom(first, this.var2enodeOf(eq.v2)));
|
|
100
|
+
}
|
|
101
|
+
|
|
102
|
+
override includeFuncInterp(decl: number) {
|
|
103
|
+
return this.manager.funcDecls[decl].op === OP_ARRAY_EXT;
|
|
104
|
+
}
|
|
105
|
+
|
|
106
|
+
override initModel() {
|
|
107
|
+
this.collectDefaults();
|
|
108
|
+
this.collectSelects();
|
|
109
|
+
}
|
|
110
|
+
|
|
111
|
+
override addDep(node: Enode, deps: Dependencies) {
|
|
112
|
+
if (!this.isArray(node.owner)) {
|
|
113
|
+
deps.set(node, null);
|
|
114
|
+
return true;
|
|
115
|
+
}
|
|
116
|
+
for (const parent of node.root.parents)
|
|
117
|
+
if (this.isOp(parent.owner, OP_ARRAY_DEFAULT)) addDependency(deps, node, parent);
|
|
118
|
+
for (const select of this.getSelectSet(node).values()) {
|
|
119
|
+
addDependency(deps, node, select);
|
|
120
|
+
for (let index = 1; index < select.numArgs; index++)
|
|
121
|
+
addDependency(deps, node, select.getArg(index));
|
|
122
|
+
}
|
|
123
|
+
for (const member of getClass(node))
|
|
124
|
+
if (this.isOp(member.owner, OP_CONST_ARRAY)) addDependency(deps, node, member.getArg(0));
|
|
125
|
+
const defaultNode = this.getDefault(node.getThVar(this.id));
|
|
126
|
+
if (defaultNode !== null) addDependency(deps, node, defaultNode);
|
|
127
|
+
if (!deps.has(node)) deps.set(node, null);
|
|
128
|
+
return true;
|
|
129
|
+
}
|
|
130
|
+
|
|
131
|
+
override addValue(inputNode: Enode, model: ProtoModel, values: (number | undefined)[]) {
|
|
132
|
+
const manager = this.manager;
|
|
133
|
+
const sort = manager.sorts[inputNode.owner];
|
|
134
|
+
const node = inputNode.root;
|
|
135
|
+
if (this.isOp(node.owner, OP_AS_ARRAY)) {
|
|
136
|
+
values[node.owner] = node.owner;
|
|
137
|
+
return;
|
|
138
|
+
}
|
|
139
|
+
const thVar = node.getThVar(this.id);
|
|
140
|
+
const defaultNode = this.getDefault(thVar);
|
|
141
|
+
if (this.isOp(node.owner, OP_CONST_ARRAY)) {
|
|
142
|
+
const value = values[(defaultNode as Enode).root.owner] as number;
|
|
143
|
+
values[node.owner] = mkArrayApp(
|
|
144
|
+
manager,
|
|
145
|
+
OP_CONST_ARRAY,
|
|
146
|
+
[value],
|
|
147
|
+
[manager.sorts[node.owner]],
|
|
148
|
+
);
|
|
149
|
+
return;
|
|
150
|
+
}
|
|
151
|
+
const parameters = manager.getSortParameters(sort);
|
|
152
|
+
const domain = parameters.slice(0, -1);
|
|
153
|
+
const range = parameters[parameters.length - 1];
|
|
154
|
+
const decl = manager.mkFreshFuncDecl(null, domain, range);
|
|
155
|
+
const interp = new FuncInterp(manager, domain.length);
|
|
156
|
+
model.registerFunc(decl, interp);
|
|
157
|
+
const defaultValue = defaultNode === null ? undefined : values[defaultNode.root.owner];
|
|
158
|
+
if (defaultValue !== undefined && interp.elseExpr === null) interp.setElse(defaultValue);
|
|
159
|
+
const elseValue = this.getElse(thVar);
|
|
160
|
+
if (interp.elseExpr === null && elseValue !== null) interp.setElse(elseValue);
|
|
161
|
+
if (interp.elseExpr === null) {
|
|
162
|
+
let mostFrequent: number | undefined;
|
|
163
|
+
let maxOccurrences = 0;
|
|
164
|
+
const occurrences = new Map<number, number>();
|
|
165
|
+
for (const parent of node.root.parents) {
|
|
166
|
+
if (!this.isOp(parent.owner, OP_SELECT) || parent.getArg(0).root !== node.root) continue;
|
|
167
|
+
const value = values[parent.root.owner];
|
|
168
|
+
if (value === undefined) continue;
|
|
169
|
+
const count = (occurrences.get(value) ?? 0) + 1;
|
|
170
|
+
occurrences.set(value, count);
|
|
171
|
+
if (count > maxOccurrences) {
|
|
172
|
+
mostFrequent = value;
|
|
173
|
+
maxOccurrences = count;
|
|
174
|
+
}
|
|
175
|
+
}
|
|
176
|
+
if (mostFrequent !== undefined) interp.setElse(mostFrequent);
|
|
177
|
+
}
|
|
178
|
+
if (this.getElse(thVar) === null && interp.elseExpr !== null)
|
|
179
|
+
this.setElse(thVar, interp.elseExpr);
|
|
180
|
+
if (this.getElse(thVar) === null) {
|
|
181
|
+
const someValue = model.getSomeValue(range);
|
|
182
|
+
interp.setElse(someValue);
|
|
183
|
+
this.setElse(thVar, someValue);
|
|
184
|
+
}
|
|
185
|
+
for (const select of this.getSelectSet(node).values()) {
|
|
186
|
+
const value = values[select.root.owner];
|
|
187
|
+
if (value === undefined || value === interp.elseExpr) continue;
|
|
188
|
+
interp.insertEntry(
|
|
189
|
+
select.args.slice(1).map((arg) => values[arg.root.owner] as number),
|
|
190
|
+
value,
|
|
191
|
+
);
|
|
192
|
+
}
|
|
193
|
+
values[node.owner] = mkAsArray(manager, decl);
|
|
194
|
+
}
|
|
195
|
+
|
|
196
|
+
protected mustHaveDifferentModelValues(first: number, second: number) {
|
|
197
|
+
const firstExpr = this.var2expr(first);
|
|
198
|
+
if (!this.isArray(firstExpr)) return true;
|
|
199
|
+
const firstElse = this.getDefault(first);
|
|
200
|
+
const secondElse = this.getDefault(second);
|
|
201
|
+
return (
|
|
202
|
+
firstElse !== null &&
|
|
203
|
+
secondElse !== null &&
|
|
204
|
+
firstElse.root !== secondElse.root &&
|
|
205
|
+
hasLargeDomain(this.manager, firstExpr)
|
|
206
|
+
);
|
|
207
|
+
}
|
|
208
|
+
|
|
209
|
+
private collectSelects() {
|
|
210
|
+
this.selects.clear();
|
|
211
|
+
for (let thVar = 0; thVar < this.numVars; thVar++) {
|
|
212
|
+
const root = this.var2enodeOf(thVar).root;
|
|
213
|
+
if (this.getRepresentative(thVar) !== thVar) continue;
|
|
214
|
+
for (const parent of root.parents)
|
|
215
|
+
if (parent.isCgr && this.isOp(parent.owner, OP_SELECT) && parent.getArg(0).root === root)
|
|
216
|
+
this.getSelectSet(root).insert(parent);
|
|
217
|
+
}
|
|
218
|
+
const todo: [Enode, Enode][] = [];
|
|
219
|
+
for (const [root, set] of Array.from(this.selects))
|
|
220
|
+
for (const select of Array.from(set.values()))
|
|
221
|
+
this.propagateSelectToStoreParents(root, select, todo);
|
|
222
|
+
for (let qhead = 0; qhead < todo.length; qhead++)
|
|
223
|
+
this.propagateSelectToStoreParents(todo[qhead][0], todo[qhead][1], todo);
|
|
224
|
+
}
|
|
225
|
+
|
|
226
|
+
private propagateSelectToStoreParents(root: Enode, select: Enode, todo: [Enode, Enode][]) {
|
|
227
|
+
for (const parent of root.parents) {
|
|
228
|
+
if (!this.isOp(parent.owner, OP_STORE) || parent.getArg(0).root !== root) continue;
|
|
229
|
+
const parentSet = this.getSelectSet(parent);
|
|
230
|
+
if (parentSet.has(select)) continue;
|
|
231
|
+
let index = 1;
|
|
232
|
+
while (index < select.numArgs && select.getArg(index).root === parent.getArg(index).root)
|
|
233
|
+
index++;
|
|
234
|
+
if (index < select.numArgs) {
|
|
235
|
+
parentSet.insert(select);
|
|
236
|
+
todo.push([parent.root, select]);
|
|
237
|
+
}
|
|
238
|
+
}
|
|
239
|
+
}
|
|
240
|
+
|
|
241
|
+
private getSelectSet(node: Enode) {
|
|
242
|
+
const root = node.root;
|
|
243
|
+
const existing = this.selects.get(root);
|
|
244
|
+
if (existing !== undefined) return existing;
|
|
245
|
+
const created = new SelectSet(this.manager);
|
|
246
|
+
this.selects.set(root, created);
|
|
247
|
+
return created;
|
|
248
|
+
}
|
|
249
|
+
|
|
250
|
+
protected collectDefaults() {
|
|
251
|
+
const numVars = this.numVars;
|
|
252
|
+
this.defaults = Array.from({ length: numVars }, () => null);
|
|
253
|
+
this.elseValues = Array.from({ length: numVars }, () => null);
|
|
254
|
+
this.parents = Array.from({ length: numVars }, () => -1);
|
|
255
|
+
for (let thVar = 0; thVar < numVars; thVar++) {
|
|
256
|
+
const node = this.var2enodeOf(thVar);
|
|
257
|
+
this.mgMerge(thVar, this.getRepresentative(thVar));
|
|
258
|
+
if (this.isOp(node.owner, OP_CONST_ARRAY)) this.setDefault(thVar, node.getArg(0));
|
|
259
|
+
else if (this.isOp(node.owner, OP_STORE))
|
|
260
|
+
this.mgMerge(thVar, this.getRepresentative(node.getArg(0).getThVar(this.id)));
|
|
261
|
+
else if (this.isOp(node.owner, OP_ARRAY_DEFAULT))
|
|
262
|
+
this.setDefault(node.getArg(0).getThVar(this.id), node);
|
|
263
|
+
}
|
|
264
|
+
}
|
|
265
|
+
|
|
266
|
+
private setDefault(thVar: number, node: Enode) {
|
|
267
|
+
const root = this.mgFind(thVar);
|
|
268
|
+
this.defaults[root] ??= node;
|
|
269
|
+
}
|
|
270
|
+
|
|
271
|
+
private getDefault(thVar: number) {
|
|
272
|
+
return this.defaults[this.mgFind(thVar)];
|
|
273
|
+
}
|
|
274
|
+
|
|
275
|
+
private setElse(thVar: number, value: number) {
|
|
276
|
+
this.elseValues[this.mgFind(thVar)] = value;
|
|
277
|
+
}
|
|
278
|
+
|
|
279
|
+
private getElse(thVar: number) {
|
|
280
|
+
return this.elseValues[this.mgFind(thVar)];
|
|
281
|
+
}
|
|
282
|
+
|
|
283
|
+
private mgFind(thVar: number) {
|
|
284
|
+
let root = thVar;
|
|
285
|
+
while (this.parents[root] >= 0) root = this.parents[root];
|
|
286
|
+
let current = thVar;
|
|
287
|
+
while (this.parents[current] >= 0) {
|
|
288
|
+
const next = this.parents[current];
|
|
289
|
+
this.parents[current] = root;
|
|
290
|
+
current = next;
|
|
291
|
+
}
|
|
292
|
+
return root;
|
|
293
|
+
}
|
|
294
|
+
|
|
295
|
+
private mgMerge(inputFirst: number, inputSecond: number) {
|
|
296
|
+
const first = this.mgFind(inputFirst);
|
|
297
|
+
const second = this.mgFind(inputSecond);
|
|
298
|
+
if (first === second) return;
|
|
299
|
+
const isSwapped = this.parents[first] > this.parents[second];
|
|
300
|
+
const root = isSwapped ? second : first;
|
|
301
|
+
const child = isSwapped ? first : second;
|
|
302
|
+
this.parents[root] += this.parents[child];
|
|
303
|
+
this.parents[child] = root;
|
|
304
|
+
this.defaults[root] ??= this.defaults[child];
|
|
305
|
+
}
|
|
306
|
+
}
|
|
@@ -0,0 +1,162 @@
|
|
|
1
|
+
import type { BvInternalize } from "./bv-internalize";
|
|
2
|
+
|
|
3
|
+
const UINT_MAX = 0xffffffff;
|
|
4
|
+
|
|
5
|
+
// dyn_ack_params: dack.factor, dack.threshold and dack.gc.
|
|
6
|
+
const DACK_FACTOR = 0.1;
|
|
7
|
+
const DACK_THRESHOLD = 10;
|
|
8
|
+
const DACK_GC = 2000;
|
|
9
|
+
const PROPAGATE_HIGH_WATERMARK = 10000;
|
|
10
|
+
|
|
11
|
+
interface Vv {
|
|
12
|
+
v1: number;
|
|
13
|
+
v2: number;
|
|
14
|
+
count: number;
|
|
15
|
+
glue: number;
|
|
16
|
+
next: Vv;
|
|
17
|
+
prev: Vv;
|
|
18
|
+
}
|
|
19
|
+
|
|
20
|
+
const mkVv = (v1: number, v2: number) => {
|
|
21
|
+
const vv = { v1, v2, count: 0, glue: UINT_MAX } as Vv;
|
|
22
|
+
vv.next = vv;
|
|
23
|
+
vv.prev = vv;
|
|
24
|
+
return vv;
|
|
25
|
+
};
|
|
26
|
+
|
|
27
|
+
export class BvAckerman {
|
|
28
|
+
private table = new Map<string, Vv>();
|
|
29
|
+
private queue: Vv | null = null;
|
|
30
|
+
private gcThreshold = 100;
|
|
31
|
+
private propagateLowWatermark = DACK_THRESHOLD;
|
|
32
|
+
private numPropagationsSinceLastGc = 0;
|
|
33
|
+
private diffLevels: boolean[] = [];
|
|
34
|
+
|
|
35
|
+
constructor(private solver: BvInternalize) {}
|
|
36
|
+
|
|
37
|
+
private pushToFront(elem: Vv) {
|
|
38
|
+
const queue = this.queue;
|
|
39
|
+
if (queue === null) {
|
|
40
|
+
this.queue = elem;
|
|
41
|
+
elem.next = elem;
|
|
42
|
+
elem.prev = elem;
|
|
43
|
+
return;
|
|
44
|
+
}
|
|
45
|
+
if (queue === elem) return;
|
|
46
|
+
elem.prev.next = elem.next;
|
|
47
|
+
elem.next.prev = elem.prev;
|
|
48
|
+
queue.prev.next = elem;
|
|
49
|
+
elem.prev = queue.prev;
|
|
50
|
+
elem.next = queue;
|
|
51
|
+
queue.prev = elem;
|
|
52
|
+
this.queue = elem;
|
|
53
|
+
}
|
|
54
|
+
|
|
55
|
+
private removeFromQueue(elem: Vv) {
|
|
56
|
+
const queue = this.queue as Vv;
|
|
57
|
+
if (queue.next === queue) {
|
|
58
|
+
this.queue = null;
|
|
59
|
+
return;
|
|
60
|
+
}
|
|
61
|
+
if (queue === elem) this.queue = elem.next;
|
|
62
|
+
elem.prev.next = elem.next;
|
|
63
|
+
elem.next.prev = elem.prev;
|
|
64
|
+
}
|
|
65
|
+
|
|
66
|
+
private remove(vv: Vv) {
|
|
67
|
+
this.removeFromQueue(vv);
|
|
68
|
+
this.table.delete(`${vv.v1},${vv.v2}`);
|
|
69
|
+
}
|
|
70
|
+
|
|
71
|
+
private insertIfNotThere(v1: number, v2: number) {
|
|
72
|
+
const key = `${v1},${v2}`;
|
|
73
|
+
const existing = this.table.get(key);
|
|
74
|
+
if (existing !== undefined) return { vv: existing, isNew: false };
|
|
75
|
+
const vv = mkVv(v1, v2);
|
|
76
|
+
this.table.set(key, vv);
|
|
77
|
+
return { vv, isNew: true };
|
|
78
|
+
}
|
|
79
|
+
|
|
80
|
+
usedEqEh(inputV1: number, inputV2: number) {
|
|
81
|
+
if (inputV1 === inputV2) return;
|
|
82
|
+
const v1 = Math.min(inputV1, inputV2);
|
|
83
|
+
const v2 = Math.max(inputV1, inputV2);
|
|
84
|
+
const inserted = this.insertIfNotThere(v1, v2);
|
|
85
|
+
const other = inserted.vv;
|
|
86
|
+
other.count++;
|
|
87
|
+
this.updateGlue(other);
|
|
88
|
+
this.pushToFront(other);
|
|
89
|
+
let isGc = inserted.isNew;
|
|
90
|
+
if (other.glue === 0) {
|
|
91
|
+
isGc = false;
|
|
92
|
+
this.remove(other);
|
|
93
|
+
this.addCc(v1, v2);
|
|
94
|
+
} else if (other.count > 2 * PROPAGATE_HIGH_WATERMARK) this.propagate();
|
|
95
|
+
if (isGc) this.gc();
|
|
96
|
+
}
|
|
97
|
+
|
|
98
|
+
private updateGlue(vv: Vv) {
|
|
99
|
+
const s = this.solver.s;
|
|
100
|
+
const firstBits = this.solver.bits[vv.v1];
|
|
101
|
+
const secondBits = this.solver.bits[vv.v2];
|
|
102
|
+
const size = firstBits.length;
|
|
103
|
+
const diffLevels = this.diffLevels;
|
|
104
|
+
while (diffLevels.length <= s.scopeLvl) diffLevels.push(false);
|
|
105
|
+
let glue = 0;
|
|
106
|
+
const maxGlue = vv.glue;
|
|
107
|
+
let index = 0;
|
|
108
|
+
for (; index < size && index < maxGlue; index++) {
|
|
109
|
+
const first = firstBits[index];
|
|
110
|
+
const second = secondBits[index];
|
|
111
|
+
if (first === second) continue;
|
|
112
|
+
const firstLvl = s.lvl(first);
|
|
113
|
+
const secondLvl = s.lvl(second);
|
|
114
|
+
if (!diffLevels[firstLvl]) {
|
|
115
|
+
diffLevels[firstLvl] = true;
|
|
116
|
+
glue++;
|
|
117
|
+
}
|
|
118
|
+
if (!diffLevels[secondLvl]) {
|
|
119
|
+
diffLevels[secondLvl] = true;
|
|
120
|
+
glue++;
|
|
121
|
+
}
|
|
122
|
+
}
|
|
123
|
+
while (index-- > 0) {
|
|
124
|
+
const first = firstBits[index];
|
|
125
|
+
const second = secondBits[index];
|
|
126
|
+
if (first === second) continue;
|
|
127
|
+
diffLevels[s.lvl(first)] = false;
|
|
128
|
+
diffLevels[s.lvl(second)] = false;
|
|
129
|
+
}
|
|
130
|
+
if (glue < maxGlue) vv.glue = glue;
|
|
131
|
+
}
|
|
132
|
+
|
|
133
|
+
private gc() {
|
|
134
|
+
this.numPropagationsSinceLastGc++;
|
|
135
|
+
if (this.numPropagationsSinceLastGc <= DACK_GC) return;
|
|
136
|
+
this.numPropagationsSinceLastGc = 0;
|
|
137
|
+
if (this.table.size > this.gcThreshold) this.propagate();
|
|
138
|
+
while (this.table.size > this.gcThreshold) this.remove((this.queue as Vv).prev);
|
|
139
|
+
this.gcThreshold = Math.trunc((this.gcThreshold * 110) / 100) + 1;
|
|
140
|
+
}
|
|
141
|
+
|
|
142
|
+
propagate() {
|
|
143
|
+
let current = this.queue;
|
|
144
|
+
const numProp = Math.min(Math.trunc(this.solver.s.conflicts * DACK_FACTOR), this.table.size);
|
|
145
|
+
for (let index = 0; index < numProp; index++) {
|
|
146
|
+
const vv = current as Vv;
|
|
147
|
+
current = vv.next;
|
|
148
|
+
if (vv.count < this.propagateLowWatermark && vv.glue !== 0) continue;
|
|
149
|
+
this.addCc(vv.v1, vv.v2);
|
|
150
|
+
this.remove(vv);
|
|
151
|
+
}
|
|
152
|
+
}
|
|
153
|
+
|
|
154
|
+
private addCc(v1: number, v2: number) {
|
|
155
|
+
const solver = this.solver;
|
|
156
|
+
if (v2 >= solver.numVars) return;
|
|
157
|
+
const manager = solver.manager;
|
|
158
|
+
const sort = manager.sorts[solver.var2expr(v1)];
|
|
159
|
+
if (sort !== manager.sorts[solver.var2expr(v2)] || !manager.isBvSort(sort)) return;
|
|
160
|
+
solver.assertAckerman(v1, v2);
|
|
161
|
+
}
|
|
162
|
+
}
|