tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.fdc173479
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 +41 -37
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +21 -4
- package/dist/index.d.ts +21 -4
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2681 -425
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +41 -42
- package/dist/run.js +41 -42
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +97 -89
- package/dist/transfer.js +97 -89
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +72 -39
- package/src/bags.ts +50 -29
- package/src/builtins.ts +8 -16
- package/src/check-failure.ts +118 -0
- package/src/check-trace.ts +321 -0
- package/src/check.ts +828 -770
- package/src/cli/options.ts +6 -31
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +224 -212
- package/src/cli/tlc-output.ts +701 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +65 -712
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +28 -20
- package/src/coverage.ts +255 -20
- package/src/dependencies.ts +96 -27
- package/src/dfid.ts +115 -50
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +175 -373
- package/src/errors.ts +40 -5
- package/src/evaluate.ts +429 -139
- package/src/exit-codes.ts +28 -12
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +178 -17
- package/src/java-hash.ts +14 -0
- package/src/java-overrides.ts +2 -2
- package/src/json.ts +4 -7
- package/src/levels.ts +708 -272
- package/src/lexer.ts +17 -5
- package/src/liveness-checker.ts +707 -249
- package/src/liveness.ts +148 -95
- 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 +39 -9
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +27 -18
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +48 -18
- 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 +120 -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 +29 -47
- package/src/parser.ts +757 -326
- package/src/pretty-print.ts +1 -1
- 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 +226 -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 +1 -3
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +19 -30
- 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 +9 -20
- 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 +3 -5
- 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/md5.ts +26 -29
- 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 +1016 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -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 +624 -9
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +319 -0
- package/src/prover/smt/solver/asserted-formulas.ts +240 -56
- package/src/prover/smt/solver/ast-lt.ts +165 -11
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1483 -45
- package/src/prover/smt/solver/auf-solver.ts +25 -18
- package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +598 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +127 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -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 +293 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +598 -128
- package/src/prover/smt/solver/ctx-simplify.ts +29 -14
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +207 -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 +298 -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-bounds.ts +89 -0
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +227 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +901 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1046 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +328 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +734 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +886 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +178 -15
- package/src/prover/smt/solver/goal2nlsat.ts +216 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +34 -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 +111 -39
- 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 +355 -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 +30 -11
- 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 +41 -5
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
- 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 +68 -17
- 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 +167 -85
- 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 +163 -99
- 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 -290
- 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 +310 -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 +106 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +19 -28
- package/src/prover/smt/solver/model-evaluator.ts +190 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +104 -35
- 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 +709 -0
- package/src/prover/smt/solver/mus.ts +50 -0
- package/src/prover/smt/solver/muz/dl-context.ts +382 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +485 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
- package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +427 -229
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
- package/src/prover/smt/solver/nlsat/solver.ts +293 -92
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
- package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +110 -24
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +801 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +301 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +312 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
- package/src/prover/smt/solver/poly-rewriter.ts +259 -57
- package/src/prover/smt/solver/probes.ts +577 -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 +634 -0
- package/src/prover/smt/solver/push-app-ite.ts +37 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +39 -19
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1499 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +829 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +22 -25
- 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 +262 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +82 -14
- package/src/prover/smt/solver/rewriter.ts +505 -60
- package/src/prover/smt/solver/rlimit.ts +45 -5
- 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 +589 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +190 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2107 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +995 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
- package/src/prover/smt/solver/seq-skolem.ts +294 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +124 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +589 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
- package/src/prover/smt/solver/smtlib-script.ts +2136 -0
- package/src/prover/smt/solver/solve-eqs.ts +928 -0
- package/src/prover/smt/solver/solver.ts +128 -23
- 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 +2176 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1210 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +57 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
- package/src/prover/smt/solver/theory-lra-state.ts +7 -23
- package/src/prover/smt/solver/theory-lra.ts +189 -2
- package/src/prover/smt/solver/theory-pb.ts +951 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +852 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory-without-terms.ts +24 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +495 -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 +57 -26
- 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 +16 -23
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +37 -39
- 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 +1 -3
- 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/resolve.ts +1327 -328
- package/src/runtime.ts +25 -2
- package/src/sany/builtins.ts +10 -10
- package/src/sany/generation.ts +384 -0
- package/src/sany/generator-def-entries.ts +297 -0
- package/src/sany/generator-definitions.ts +688 -0
- package/src/sany/generator-expressions.ts +1123 -0
- package/src/sany/generator-proofs.ts +668 -0
- package/src/sany/generator.ts +161 -2625
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +32 -23
- package/src/sany/linter.ts +0 -2
- package/src/sany/modules.ts +4 -2
- package/src/sany/nodes.ts +3 -4
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +46 -44
- package/src/sany/xml.ts +25 -58
- package/src/search.ts +513 -165
- package/src/simulate.ts +340 -251
- package/src/spec-description.ts +48 -55
- package/src/standard-definitions.ts +5 -0
- package/src/standard-modules.ts +72 -54
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +564 -138
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +56 -28
- package/src/symmetry.ts +4 -3
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +10 -0
- package/src/tlc/messages.ts +23 -18
- package/src/tlc/order.ts +14 -3
- package/src/tlc/random.ts +6 -5
- package/src/tlc/replay.ts +152 -58
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +12 -11
- package/src/tlc/tlcext-operators.ts +87 -26
- package/src/tlc/trace-spec.ts +27 -60
- package/src/trace-liveness.ts +529 -0
- package/src/typed-tier.ts +6556 -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/typescript/types.ts +2 -2
- package/src/values.ts +208 -227
- 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
package/src/dependencies.ts
CHANGED
|
@@ -1,4 +1,11 @@
|
|
|
1
|
-
import {
|
|
1
|
+
import {
|
|
2
|
+
getChildren,
|
|
3
|
+
getDefinitionExpressions,
|
|
4
|
+
getReferencedName,
|
|
5
|
+
isLocallyResolved,
|
|
6
|
+
type Definition,
|
|
7
|
+
type Expression,
|
|
8
|
+
} from "./ast";
|
|
2
9
|
import type { Environment } from "./evaluate";
|
|
3
10
|
import { ACTION_LEVEL, CONSTANT_LEVEL, TEMPORAL_LEVEL, VARIABLE_LEVEL } from "./levels";
|
|
4
11
|
|
|
@@ -21,6 +28,9 @@ const READS_IMPURE = 16;
|
|
|
21
28
|
const VARIABLE_LEVEL_FLAGS = 32;
|
|
22
29
|
const ACTION_LEVEL_FLAGS = VARIABLE_LEVEL_FLAGS | 64;
|
|
23
30
|
const TEMPORAL_LEVEL_FLAGS = ACTION_LEVEL_FLAGS | 128;
|
|
31
|
+
const RANDOM = 256;
|
|
32
|
+
const ABOVE_CONSTANT_BOUND = 512;
|
|
33
|
+
const TLC_EVAL = 1024;
|
|
24
34
|
|
|
25
35
|
const ACTION_KINDS = new Set<Expression["kind"]>([
|
|
26
36
|
"Prime",
|
|
@@ -58,12 +68,12 @@ const IMPURE_BUILTINS = new Set([
|
|
|
58
68
|
|
|
59
69
|
const STREAMED_BUILTINS = new Set(["UNION", "\\cup"]);
|
|
60
70
|
|
|
61
|
-
const
|
|
62
|
-
|
|
63
|
-
|
|
64
|
-
|
|
65
|
-
|
|
66
|
-
|
|
71
|
+
const RANDOM_BUILTINS = new Set([
|
|
72
|
+
"RandomSubset",
|
|
73
|
+
"RandomSetOfSubsets",
|
|
74
|
+
"TestRandomSetOfSubsets",
|
|
75
|
+
"RandomSubsetSet",
|
|
76
|
+
]);
|
|
67
77
|
|
|
68
78
|
const isImpureBuiltin = (name: string, environment: DefinitionNames) =>
|
|
69
79
|
IMPURE_BUILTINS.has(name) || environment.builtins.get(name)?.isStateLevel === true;
|
|
@@ -72,6 +82,7 @@ interface Edge {
|
|
|
72
82
|
callee: Definition;
|
|
73
83
|
isOverridden: boolean;
|
|
74
84
|
isLevelCounted: boolean;
|
|
85
|
+
isOperatorArgument: boolean;
|
|
75
86
|
}
|
|
76
87
|
|
|
77
88
|
const collectLocalFacts = (
|
|
@@ -96,20 +107,34 @@ const collectLocalFacts = (
|
|
|
96
107
|
}
|
|
97
108
|
return undefined;
|
|
98
109
|
};
|
|
99
|
-
const
|
|
110
|
+
const contexts = new Map<Expression, number>();
|
|
111
|
+
const visit = (node: Expression, isLevelCounted: boolean, isOperatorArgument: boolean) => {
|
|
100
112
|
const kind = node.kind;
|
|
113
|
+
if (kind === "Selection") {
|
|
114
|
+
const seen = contexts.get(node.expression) ?? 0;
|
|
115
|
+
const context = isLevelCounted ? (isOperatorArgument ? 1 : 2) : isOperatorArgument ? 4 : 8;
|
|
116
|
+
if ((seen & context) !== 0) return;
|
|
117
|
+
contexts.set(node.expression, seen | context);
|
|
118
|
+
}
|
|
119
|
+
// TLC's getLevelBound takes an operator argument for a constant.
|
|
120
|
+
const nonconstantFlags = isOperatorArgument ? NONCONSTANT : NONCONSTANT | ABOVE_CONSTANT_BOUND;
|
|
101
121
|
if (
|
|
102
122
|
NONCONSTANT_KINDS.has(kind) ||
|
|
103
123
|
(kind === "UnboundedQuantifier" && node.isTemporal === true) ||
|
|
104
124
|
(kind === "Apply" && NONCONSTANT_OPERATORS.has(node.operator))
|
|
105
125
|
) {
|
|
106
|
-
row[0] |=
|
|
126
|
+
row[0] |= nonconstantFlags;
|
|
107
127
|
}
|
|
108
128
|
if (NONCONSTANT_KINDS.has(kind)) row[0] |= READS_IMPURE;
|
|
109
129
|
const ownLevelFlags = getOwnLevelFlags(node);
|
|
110
130
|
if (isLevelCounted && ownLevelFlags !== undefined) row[0] |= ownLevelFlags;
|
|
111
131
|
const isInnerLevelCounted = isLevelCounted && ownLevelFlags === undefined;
|
|
112
132
|
const name = getReferencedName(node);
|
|
133
|
+
// TLC's getLevelBound takes a parameter named like a variable for that variable.
|
|
134
|
+
if (name !== undefined && isLocallyResolved(node) && environment.variableIndex.has(name)) {
|
|
135
|
+
if (!isOperatorArgument) row[0] |= ABOVE_CONSTANT_BOUND;
|
|
136
|
+
if (isInnerLevelCounted) row[0] |= VARIABLE_LEVEL_FLAGS;
|
|
137
|
+
}
|
|
113
138
|
if (name !== undefined && !isLocallyResolved(node)) {
|
|
114
139
|
const target = environment.substitutions.get(name) ?? name;
|
|
115
140
|
const definition = environment.definitions.get(target);
|
|
@@ -117,22 +142,34 @@ const collectLocalFacts = (
|
|
|
117
142
|
const variableIndex = environment.variableIndex.get(name);
|
|
118
143
|
if (
|
|
119
144
|
variableIndex !== undefined ||
|
|
120
|
-
environment.builtins.get(
|
|
145
|
+
environment.builtins.get(target)?.isStateLevel ||
|
|
121
146
|
(definition && environment.variableIndex.has(definition.name))
|
|
122
147
|
) {
|
|
123
|
-
row[0] |=
|
|
148
|
+
row[0] |= nonconstantFlags;
|
|
124
149
|
}
|
|
125
150
|
if (variableIndex !== undefined) {
|
|
126
151
|
if (isInnerLevelCounted) row[0] |= VARIABLE_LEVEL_FLAGS;
|
|
127
152
|
if (!isOverridden) row[1 + (variableIndex >>> 5)] |= 1 << (variableIndex & 31);
|
|
128
153
|
}
|
|
129
154
|
if (definition) {
|
|
130
|
-
edges.push({
|
|
155
|
+
edges.push({
|
|
156
|
+
callee: definition,
|
|
157
|
+
isOverridden,
|
|
158
|
+
isLevelCounted: isInnerLevelCounted,
|
|
159
|
+
isOperatorArgument:
|
|
160
|
+
isOperatorArgument ||
|
|
161
|
+
kind === "OperatorReference" ||
|
|
162
|
+
(kind === "Identifier" &&
|
|
163
|
+
definition.kind === "Operator" &&
|
|
164
|
+
definition.params.length > 0),
|
|
165
|
+
});
|
|
131
166
|
} else {
|
|
132
|
-
if (isImpureBuiltin(
|
|
133
|
-
row[0] |= IMPURE | (
|
|
167
|
+
if (isImpureBuiltin(target, environment)) {
|
|
168
|
+
row[0] |= IMPURE | (target === "Assert" ? 0 : REPEATED_EFFECT);
|
|
134
169
|
}
|
|
135
|
-
if (STREAMED_BUILTINS.has(
|
|
170
|
+
if (STREAMED_BUILTINS.has(target)) row[0] |= STREAMED;
|
|
171
|
+
if (RANDOM_BUILTINS.has(target)) row[0] |= RANDOM;
|
|
172
|
+
if (target === "TLCEval") row[0] |= TLC_EVAL;
|
|
136
173
|
if (!isOverridden && isImpureBuiltin(target, environment)) row[0] |= READS_IMPURE;
|
|
137
174
|
const builtin = environment.builtins.get(target);
|
|
138
175
|
if (
|
|
@@ -146,17 +183,14 @@ const collectLocalFacts = (
|
|
|
146
183
|
}
|
|
147
184
|
}
|
|
148
185
|
}
|
|
149
|
-
getChildren(node).forEach((child) =>
|
|
186
|
+
getChildren(node).forEach((child) =>
|
|
187
|
+
visit(child, isInnerLevelCounted, isOperatorArgument || kind === "Lambda"),
|
|
188
|
+
);
|
|
150
189
|
};
|
|
151
|
-
expressions.forEach((expression) => visit(expression, true));
|
|
190
|
+
expressions.forEach((expression) => visit(expression, true, false));
|
|
152
191
|
return { row, edges };
|
|
153
192
|
};
|
|
154
193
|
|
|
155
|
-
const getDefinitionExpressions = (definition: Definition) =>
|
|
156
|
-
definition.kind === "Function"
|
|
157
|
-
? [...definition.bounds.map((bound) => bound.set), definition.body]
|
|
158
|
-
: [definition.body];
|
|
159
|
-
|
|
160
194
|
const closeRows = (local: Uint32Array, words: number, edges: Int32Array[], mask: number) => {
|
|
161
195
|
const count = edges.length;
|
|
162
196
|
const closed = local.slice();
|
|
@@ -224,11 +258,12 @@ const closeRows = (local: Uint32Array, words: number, edges: Int32Array[], mask:
|
|
|
224
258
|
return closed;
|
|
225
259
|
};
|
|
226
260
|
|
|
227
|
-
const PURITY_MASK = IMPURE | REPEATED_EFFECT | STREAMED;
|
|
261
|
+
const PURITY_MASK = IMPURE | REPEATED_EFFECT | STREAMED | RANDOM | TLC_EVAL;
|
|
228
262
|
const READ_MASK = NONCONSTANT | READS_IMPURE;
|
|
263
|
+
const STARTUP_MASK = NONCONSTANT | ABOVE_CONSTANT_BOUND;
|
|
229
264
|
|
|
230
265
|
const isEvaluatedOnce = (definition: Definition, flags: number) =>
|
|
231
|
-
definition.kind === "Operator" && definition.params.length === 0 && (flags &
|
|
266
|
+
definition.kind === "Operator" && definition.params.length === 0 && (flags & STARTUP_MASK) === 0;
|
|
232
267
|
|
|
233
268
|
export const createDefinitionFacts = (environment: DefinitionNames): DefinitionFacts => {
|
|
234
269
|
const definitions = [...new Set(environment.definitions.values())];
|
|
@@ -252,18 +287,32 @@ export const createDefinitionFacts = (environment: DefinitionNames): DefinitionF
|
|
|
252
287
|
new Int32Array(own.filter((edge) => !edge.isOverridden && edge.isLevelCounted).map(getId)),
|
|
253
288
|
);
|
|
254
289
|
const levels = closeRows(local, words, levelEdges, TEMPORAL_LEVEL_FLAGS);
|
|
290
|
+
const startupEdges = edges.map(
|
|
291
|
+
(own) =>
|
|
292
|
+
new Int32Array(
|
|
293
|
+
own.filter((edge) => !edge.isOverridden && !edge.isOperatorArgument).map(getId),
|
|
294
|
+
),
|
|
295
|
+
);
|
|
296
|
+
const startup = closeRows(local, words, startupEdges, ABOVE_CONSTANT_BOUND);
|
|
255
297
|
const purityEdges = edges.map(
|
|
256
298
|
(own) =>
|
|
257
299
|
new Int32Array(
|
|
258
300
|
own
|
|
259
301
|
.map(getId)
|
|
260
|
-
.filter(
|
|
302
|
+
.filter(
|
|
303
|
+
(callee) =>
|
|
304
|
+
!isEvaluatedOnce(
|
|
305
|
+
definitions[callee],
|
|
306
|
+
reads[callee * words] | startup[callee * words],
|
|
307
|
+
),
|
|
308
|
+
),
|
|
261
309
|
),
|
|
262
310
|
);
|
|
263
311
|
const purity = closeRows(localImpurity, words, purityEdges, PURITY_MASK);
|
|
264
312
|
const rows = reads.map((word, position) =>
|
|
265
313
|
position % words === 0
|
|
266
314
|
? (word & READ_MASK) |
|
|
315
|
+
(startup[position] & ABOVE_CONSTANT_BOUND) |
|
|
267
316
|
(levels[position] & TEMPORAL_LEVEL_FLAGS) |
|
|
268
317
|
(purity[position] & PURITY_MASK)
|
|
269
318
|
: word,
|
|
@@ -287,6 +336,7 @@ const getExpressionsRow = (expressions: Expression[], environment: Environment)
|
|
|
287
336
|
const callee = getRow(edge.callee, environment);
|
|
288
337
|
if (!edge.isOverridden) {
|
|
289
338
|
row[0] |= callee[0] & READ_MASK;
|
|
339
|
+
if (!edge.isOperatorArgument) row[0] |= callee[0] & ABOVE_CONSTANT_BOUND;
|
|
290
340
|
if (edge.isLevelCounted) row[0] |= callee[0] & TEMPORAL_LEVEL_FLAGS;
|
|
291
341
|
for (let word = 1; word < words; word++) row[word] |= callee[word];
|
|
292
342
|
}
|
|
@@ -296,9 +346,25 @@ const getExpressionsRow = (expressions: Expression[], environment: Environment)
|
|
|
296
346
|
};
|
|
297
347
|
|
|
298
348
|
export const isConstantLevel = (definition: Definition, environment: Environment) =>
|
|
299
|
-
(getRow(definition, environment)[0] &
|
|
349
|
+
(getRow(definition, environment)[0] & STARTUP_MASK) === 0;
|
|
350
|
+
|
|
351
|
+
export const isEvaluatedAtStartup = (definition: Definition, environment: Environment) =>
|
|
352
|
+
(getRow(definition, environment)[0] & ABOVE_CONSTANT_BOUND) === 0;
|
|
353
|
+
|
|
354
|
+
const EFFECT_FLAGS = {
|
|
355
|
+
any: IMPURE,
|
|
356
|
+
repeated: REPEATED_EFFECT,
|
|
357
|
+
streamed: STREAMED,
|
|
358
|
+
// What a second evaluation shows: output again, or other random draws.
|
|
359
|
+
replayed: REPEATED_EFFECT | RANDOM,
|
|
360
|
+
varying: IMPURE | RANDOM,
|
|
361
|
+
};
|
|
300
362
|
|
|
301
|
-
const
|
|
363
|
+
export const isExpressionImpure = (
|
|
364
|
+
expressions: Expression[],
|
|
365
|
+
environment: Environment,
|
|
366
|
+
effect: keyof typeof EFFECT_FLAGS,
|
|
367
|
+
) => (getExpressionsRow(expressions, environment)[0] & EFFECT_FLAGS[effect]) !== 0;
|
|
302
368
|
|
|
303
369
|
export const isImpureDefinition = (
|
|
304
370
|
definition: Definition,
|
|
@@ -306,6 +372,9 @@ export const isImpureDefinition = (
|
|
|
306
372
|
effect: keyof typeof EFFECT_FLAGS = "any",
|
|
307
373
|
) => (getRow(definition, environment)[0] & EFFECT_FLAGS[effect]) !== 0;
|
|
308
374
|
|
|
375
|
+
export const isTlcEvalReached = (expression: Expression, environment: Environment) =>
|
|
376
|
+
(getExpressionsRow([expression], environment)[0] & TLC_EVAL) !== 0;
|
|
377
|
+
|
|
309
378
|
export const getDefinitionLevel = (definition: Definition, environment: Environment) => {
|
|
310
379
|
const flags = getRow(definition, environment)[0] & TEMPORAL_LEVEL_FLAGS;
|
|
311
380
|
return flags === TEMPORAL_LEVEL_FLAGS
|
package/src/dfid.ts
CHANGED
|
@@ -1,21 +1,25 @@
|
|
|
1
1
|
import type { Expression } from "./ast";
|
|
2
2
|
import type { CheckOptions } from "./check";
|
|
3
|
+
import type { CoverageOutput } from "./coverage";
|
|
3
4
|
import {
|
|
4
5
|
getErrorExitCode,
|
|
5
6
|
getUnexpectedException,
|
|
6
7
|
isStackOverflow,
|
|
7
8
|
TlaEvaluationError,
|
|
8
|
-
TlaIncompleteSuccessorError,
|
|
9
9
|
TlaStackOverflowError,
|
|
10
10
|
TlaTooManyStatesError,
|
|
11
11
|
TlaUnsupportedError,
|
|
12
12
|
} from "./errors";
|
|
13
|
-
import { createTracingEnvironment } from "./evaluate";
|
|
13
|
+
import { createTracingEnvironment, type State } from "./evaluate";
|
|
14
14
|
import { EXIT_STATUS, getMessageExitStatus, withLivenessExitCode } from "./exit-codes";
|
|
15
15
|
import { createLivenessChecker } from "./liveness-checker";
|
|
16
|
-
import {
|
|
17
|
-
|
|
18
|
-
|
|
16
|
+
import {
|
|
17
|
+
addActionCoverage,
|
|
18
|
+
getIncompleteSuccessorMessage,
|
|
19
|
+
prepareSearch,
|
|
20
|
+
reportAssumptionViolation,
|
|
21
|
+
} from "./search";
|
|
22
|
+
import { forEachInitialState, forEachSuccessor, getSuccessors, type Successor } from "./successors";
|
|
19
23
|
import {
|
|
20
24
|
formatNestedMessage,
|
|
21
25
|
formatTlcDate,
|
|
@@ -26,9 +30,10 @@ import {
|
|
|
26
30
|
withUnexpectedException,
|
|
27
31
|
} from "./tlc/messages";
|
|
28
32
|
import { getTlcFingerprint } from "./tlc/fingerprint";
|
|
29
|
-
import {
|
|
33
|
+
import { createJavaRandom } from "./tlc/random";
|
|
34
|
+
import { replayInitialStates, replaySuccessors, walkSuccessors } from "./tlc/replay";
|
|
30
35
|
import { getOptimisticProbability, getActualProbability } from "./tlc/summary";
|
|
31
|
-
import { createModelValue, formatState, getSetBound, type Value } from "./values";
|
|
36
|
+
import { createModelValue, formatState, getSetBound, isSameValue, type Value } from "./values";
|
|
32
37
|
|
|
33
38
|
export interface DepthFirstOptions extends CheckOptions {
|
|
34
39
|
maxDepth: number;
|
|
@@ -39,6 +44,7 @@ export type DepthFirstOutput =
|
|
|
39
44
|
| { kind: "message"; code: number; isError: boolean; message: string; toolMessage: string }
|
|
40
45
|
| { kind: "behavior"; states: Record<string, Value>[]; isInvariant: boolean }
|
|
41
46
|
| { kind: "nested-expressions"; callStack: Expression[] }
|
|
47
|
+
| CoverageOutput
|
|
42
48
|
| { kind: "success"; optimistic: number; actual: number };
|
|
43
49
|
|
|
44
50
|
interface StateEntry {
|
|
@@ -52,7 +58,8 @@ interface CheckerState {
|
|
|
52
58
|
continuedCode: number;
|
|
53
59
|
isKeepingCallStack: boolean;
|
|
54
60
|
errorEntry: StateEntry | undefined;
|
|
55
|
-
stopCode:
|
|
61
|
+
/** DFIDWorker's stopCode: 0 while it searches, 1 once every initial state is done, 2 after an error. */
|
|
62
|
+
stopCode: "searching" | "done" | "error";
|
|
56
63
|
isMoreLevel: boolean;
|
|
57
64
|
}
|
|
58
65
|
|
|
@@ -130,7 +137,7 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
|
|
|
130
137
|
withUnexpectedException(() =>
|
|
131
138
|
createLivenessChecker(temporalProperties, search.spec.temporals, environment, {
|
|
132
139
|
getFingerprint: () => 0,
|
|
133
|
-
|
|
140
|
+
forEachActionSuccessors: () => {},
|
|
134
141
|
}),
|
|
135
142
|
),
|
|
136
143
|
)?.branches;
|
|
@@ -163,7 +170,17 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
|
|
|
163
170
|
);
|
|
164
171
|
if (assumptionStatus !== undefined) return assumptionStatus;
|
|
165
172
|
|
|
166
|
-
const
|
|
173
|
+
const description = prepared.getDescription();
|
|
174
|
+
const nextActions = description.actions;
|
|
175
|
+
const coverage = prepared.coverage;
|
|
176
|
+
const covered = coverage && addActionCoverage(coverage, environment, description);
|
|
177
|
+
// Deviation from TLC: TLCExt#pickSuccessor casts the DFID checker to ModelChecker and fails, so tla-ts asks as model checking does.
|
|
178
|
+
runtime.getSuccessorAction = (state, next) =>
|
|
179
|
+
nextActions.find((action) =>
|
|
180
|
+
getSuccessors(action.expression, state, environment, action.scope).some((successor) =>
|
|
181
|
+
successor.state.every((value, index) => isSameValue(value, next[index])),
|
|
182
|
+
),
|
|
183
|
+
);
|
|
167
184
|
const statuses = new Map<bigint, number>();
|
|
168
185
|
const fingerprintSet = { level: 1, leveled: 0, buckets: INITIAL_BUCKETS };
|
|
169
186
|
const setStatus = (fingerprint: bigint, status: number) => {
|
|
@@ -188,7 +205,7 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
|
|
|
188
205
|
continuedCode: NO_ERROR,
|
|
189
206
|
isKeepingCallStack: false,
|
|
190
207
|
errorEntry: undefined,
|
|
191
|
-
stopCode:
|
|
208
|
+
stopCode: "searching",
|
|
192
209
|
isMoreLevel: false,
|
|
193
210
|
};
|
|
194
211
|
const setErrorState = (entry: StateEntry, isKeepingCallStack: boolean, code: number) => {
|
|
@@ -197,12 +214,14 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
|
|
|
197
214
|
checker.errorCode = code;
|
|
198
215
|
checker.isDone = true;
|
|
199
216
|
checker.isKeepingCallStack = isKeepingCallStack;
|
|
200
|
-
checker.stopCode =
|
|
217
|
+
checker.stopCode = "error";
|
|
201
218
|
return true;
|
|
202
219
|
};
|
|
203
220
|
const toRecord = (state: (Value | undefined)[]) =>
|
|
204
221
|
search.toRecord(state.map((value) => value ?? createModelValue("null")));
|
|
205
222
|
const printSummary = () => {
|
|
223
|
+
const report = nextActions.length > 0 ? prepared.getCoverage() : undefined;
|
|
224
|
+
if (report) output({ kind: "coverage", coverage: report });
|
|
206
225
|
const counts = `${generatedCount} states generated, ${statuses.size} distinct states found`;
|
|
207
226
|
if (isTool) {
|
|
208
227
|
message(
|
|
@@ -239,7 +258,13 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
|
|
|
239
258
|
return false;
|
|
240
259
|
};
|
|
241
260
|
const init = search.spec.init;
|
|
242
|
-
if (
|
|
261
|
+
if (covered) {
|
|
262
|
+
replayInitialStates(covered.inits, environment, addGenerated, (partial) =>
|
|
263
|
+
addGenerated([...partial]),
|
|
264
|
+
);
|
|
265
|
+
} else if (init) {
|
|
266
|
+
forEachInitialState(init, environment, addGenerated, search.spec.scope, addGenerated);
|
|
267
|
+
}
|
|
243
268
|
generatedCount = generated.length;
|
|
244
269
|
for (const state of generated) {
|
|
245
270
|
if (!state.every((value) => value !== undefined)) {
|
|
@@ -260,16 +285,21 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
|
|
|
260
285
|
config.alias === undefined
|
|
261
286
|
? search.toRecord(state)
|
|
262
287
|
: search.evaluateAlias(config.alias, state, state, isTool);
|
|
263
|
-
const
|
|
264
|
-
? search.getViolatedInvariants(state)
|
|
265
|
-
: [search.findViolatedInvariant(state)].filter((invariant) => invariant !== undefined);
|
|
266
|
-
for (const invariant of violated) {
|
|
288
|
+
const reportInvariant = (name: string) =>
|
|
267
289
|
message(
|
|
268
290
|
MESSAGE_CODE.invariantViolatedInitial,
|
|
269
|
-
`Invariant ${
|
|
291
|
+
`Invariant ${name} is violated by the initial state:\n${formatState(alias())}`,
|
|
270
292
|
);
|
|
271
|
-
|
|
272
|
-
|
|
293
|
+
if (isContinued) {
|
|
294
|
+
search.forEachViolatedInvariant(state, (invariant) => {
|
|
295
|
+
reportInvariant(invariant.name);
|
|
296
|
+
checker.continuedCode = MESSAGE_CODE.invariantViolatedInitial;
|
|
297
|
+
});
|
|
298
|
+
}
|
|
299
|
+
const violated = isContinued ? undefined : search.findViolatedInvariant(state);
|
|
300
|
+
if (violated) {
|
|
301
|
+
reportInvariant(violated.name);
|
|
302
|
+
return MESSAGE_CODE.invariantViolatedInitial;
|
|
273
303
|
}
|
|
274
304
|
const predicate = search.findFailedInitialPredicate(state);
|
|
275
305
|
if (predicate) {
|
|
@@ -283,25 +313,56 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
|
|
|
283
313
|
return NO_ERROR;
|
|
284
314
|
};
|
|
285
315
|
|
|
286
|
-
|
|
287
|
-
|
|
288
|
-
|
|
316
|
+
let actionSuccessors: Value[][] = [];
|
|
317
|
+
let incompleteSuccessor: State | undefined;
|
|
318
|
+
let actionSuccessorCount = 0;
|
|
319
|
+
const addActionSuccessor = (successor: Value[]) => {
|
|
320
|
+
actionSuccessorCount++;
|
|
321
|
+
if (incompleteSuccessor) return false;
|
|
322
|
+
if (actionSuccessors.length === getSetBound()) throw new TlaTooManyStatesError();
|
|
323
|
+
actionSuccessors.push(successor);
|
|
324
|
+
return false;
|
|
325
|
+
};
|
|
326
|
+
const visitActionSuccessor = (successor: Successor) => addActionSuccessor(successor.state);
|
|
327
|
+
const addIncompleteSuccessor = (partial: State) => {
|
|
328
|
+
actionSuccessorCount++;
|
|
329
|
+
incompleteSuccessor ??= [...partial];
|
|
330
|
+
return true;
|
|
331
|
+
};
|
|
332
|
+
// TLC's Tool#getNextStates generates every successor of the action before DFIDWorker finds an incomplete one.
|
|
333
|
+
const getActionSuccessors = (index: number, state: Value[]) => {
|
|
334
|
+
const action = nextActions[index];
|
|
335
|
+
const coveredAction = covered?.actions[index];
|
|
336
|
+
actionSuccessors = [];
|
|
337
|
+
incompleteSuccessor = undefined;
|
|
338
|
+
actionSuccessorCount = 0;
|
|
339
|
+
if (coverage && coveredAction) {
|
|
340
|
+
walkSuccessors(
|
|
341
|
+
coveredAction,
|
|
342
|
+
coveredAction.node,
|
|
343
|
+
state,
|
|
344
|
+
environment,
|
|
345
|
+
addActionSuccessor,
|
|
346
|
+
addIncompleteSuccessor,
|
|
347
|
+
);
|
|
348
|
+
coverage.primary[coveredAction.node] += actionSuccessorCount;
|
|
349
|
+
} else {
|
|
289
350
|
forEachSuccessor(
|
|
290
351
|
action.expression,
|
|
291
352
|
state,
|
|
292
353
|
environment,
|
|
293
|
-
|
|
294
|
-
if (successors.length === getSetBound()) throw new TlaTooManyStatesError();
|
|
295
|
-
successors.push(successor.state);
|
|
296
|
-
return false;
|
|
297
|
-
},
|
|
354
|
+
visitActionSuccessor,
|
|
298
355
|
action.scope,
|
|
356
|
+
undefined,
|
|
357
|
+
undefined,
|
|
358
|
+
addIncompleteSuccessor,
|
|
299
359
|
);
|
|
300
|
-
return { successors, incomplete: undefined };
|
|
301
|
-
} catch (error) {
|
|
302
|
-
if (!(error instanceof TlaIncompleteSuccessorError)) throw error;
|
|
303
|
-
return { successors, incomplete: error };
|
|
304
360
|
}
|
|
361
|
+
return {
|
|
362
|
+
successors: actionSuccessors,
|
|
363
|
+
incomplete: incompleteSuccessor,
|
|
364
|
+
count: actionSuccessorCount,
|
|
365
|
+
};
|
|
305
366
|
};
|
|
306
367
|
|
|
307
368
|
const findCheckFailure = (state: Value[], successor: Value[], isNew: boolean) => {
|
|
@@ -367,12 +428,12 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
|
|
|
367
428
|
};
|
|
368
429
|
currentState = state;
|
|
369
430
|
try {
|
|
370
|
-
for (
|
|
371
|
-
const
|
|
431
|
+
for (let index = 0; index < nextActions.length; index++) {
|
|
432
|
+
const action = nextActions[index];
|
|
433
|
+
const next = getActionSuccessors(index, state);
|
|
372
434
|
const incomplete = next.incomplete;
|
|
373
|
-
|
|
374
|
-
|
|
375
|
-
isDeadlocked &&= count === 0;
|
|
435
|
+
generatedCount += next.count;
|
|
436
|
+
isDeadlocked &&= next.count === 0;
|
|
376
437
|
for (const successor of next.successors) {
|
|
377
438
|
processedSuccessor = successor;
|
|
378
439
|
levels.set(successor, depth + 2);
|
|
@@ -398,11 +459,13 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
|
|
|
398
459
|
if (failure) return report(failure.code, failure.text, !failure.isViolated);
|
|
399
460
|
}
|
|
400
461
|
if (incomplete) {
|
|
401
|
-
processedSuccessor = incomplete
|
|
462
|
+
processedSuccessor = incomplete;
|
|
402
463
|
return report(
|
|
403
464
|
MESSAGE_CODE.incompleteSuccessor,
|
|
404
465
|
getIncompleteSuccessorMessage(
|
|
405
|
-
|
|
466
|
+
environment.variables.filter(
|
|
467
|
+
(_variable, position) => incomplete[position] === undefined,
|
|
468
|
+
),
|
|
406
469
|
action.name,
|
|
407
470
|
nextActions.length,
|
|
408
471
|
options.version,
|
|
@@ -442,28 +505,28 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
|
|
|
442
505
|
throw failure;
|
|
443
506
|
}
|
|
444
507
|
};
|
|
445
|
-
const
|
|
508
|
+
const hasNext = (successors: StateEntry[], level: number) => {
|
|
446
509
|
while (successors.length > 0) {
|
|
447
510
|
const status = getStatus(successors[0].fingerprint);
|
|
448
|
-
if (!isCompleted(status) && level < status >>> 2) return
|
|
511
|
+
if (!isCompleted(status) && level < status >>> 2) return true;
|
|
449
512
|
successors[0] = successors[successors.length - 1];
|
|
450
513
|
successors.pop();
|
|
451
514
|
}
|
|
452
|
-
return
|
|
515
|
+
return false;
|
|
453
516
|
};
|
|
454
517
|
const searchLevel = (toLevel: number) => {
|
|
455
518
|
const initials = [...initialEntries];
|
|
456
|
-
checker.stopCode =
|
|
519
|
+
checker.stopCode = "searching";
|
|
457
520
|
checker.isMoreLevel = false;
|
|
458
521
|
let stackLevel = 0;
|
|
459
522
|
try {
|
|
460
|
-
while (checker.stopCode ===
|
|
523
|
+
while (checker.stopCode === "searching") {
|
|
461
524
|
while (initials.length > 0 && isCompleted(getStatus(initials[0].fingerprint))) {
|
|
462
525
|
initials[0] = initials[initials.length - 1];
|
|
463
526
|
initials.pop();
|
|
464
527
|
}
|
|
465
528
|
if (initials.length === 0) {
|
|
466
|
-
checker.stopCode =
|
|
529
|
+
checker.stopCode = "done";
|
|
467
530
|
return;
|
|
468
531
|
}
|
|
469
532
|
stack[0] = initials[0];
|
|
@@ -474,8 +537,7 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
|
|
|
474
537
|
checker.isMoreLevel ||= !isInitialNoLeaf;
|
|
475
538
|
stackLevel = 1;
|
|
476
539
|
while (!isInitialLeaf) {
|
|
477
|
-
|
|
478
|
-
if (index === -1) {
|
|
540
|
+
if (!hasNext(successorStack[stackLevel - 1], stackLevel)) {
|
|
479
541
|
const entry = stack[stackLevel - 1];
|
|
480
542
|
statuses.set(
|
|
481
543
|
entry.fingerprint,
|
|
@@ -485,7 +547,7 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
|
|
|
485
547
|
stackLevel--;
|
|
486
548
|
continue;
|
|
487
549
|
}
|
|
488
|
-
stack[stackLevel] = successorStack[stackLevel - 1][
|
|
550
|
+
stack[stackLevel] = successorStack[stackLevel - 1][0];
|
|
489
551
|
successorStack[stackLevel] = [];
|
|
490
552
|
const isLeaf = stackLevel >= toLevel - 1;
|
|
491
553
|
const isNoLeaf = expandState(stackLevel, isLeaf, successorStack[stackLevel]);
|
|
@@ -496,7 +558,7 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
|
|
|
496
558
|
}
|
|
497
559
|
} catch (error) {
|
|
498
560
|
if (!(error instanceof TlaEvaluationError)) throw error;
|
|
499
|
-
checker.stopCode =
|
|
561
|
+
checker.stopCode = "error";
|
|
500
562
|
if (setErrorState(stack[stackLevel], true, MESSAGE_CODE.general)) {
|
|
501
563
|
const unexpected = getUnexpectedMessage("", error);
|
|
502
564
|
message(
|
|
@@ -608,11 +670,14 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
|
|
|
608
670
|
);
|
|
609
671
|
fingerprintSet.level++;
|
|
610
672
|
fingerprintSet.leveled = LEVELED - fingerprintSet.leveled;
|
|
673
|
+
// TLC starts a new DFIDWorker thread for each level, whose generator for random values starts over from the seed.
|
|
674
|
+
const random = createJavaRandom(runtime.seed);
|
|
675
|
+
runtime.getRandom = () => random;
|
|
611
676
|
searchLevel(level);
|
|
612
677
|
checker.isDone = false;
|
|
613
678
|
levelCode = checker.isKeepingCallStack ? NO_ERROR : checker.errorCode;
|
|
614
679
|
if (levelCode !== NO_ERROR) return finish(levelCode);
|
|
615
|
-
isTerminated = checker.stopCode ===
|
|
680
|
+
isTerminated = checker.stopCode === "error" || !checker.isMoreLevel;
|
|
616
681
|
}
|
|
617
682
|
return finish(levelCode);
|
|
618
683
|
};
|