tla-ts 0.0.10-dev.28c823e4b → 0.0.10-dev.37a75eb5b
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 +4 -1
- package/dist/index.d.ts +4 -1
- 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 +43 -42
- package/dist/run.js +45 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +43 -40
- package/dist/transfer.js +42 -39
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -36
- package/src/bags.ts +47 -28
- package/src/builtins.ts +4 -13
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +268 -0
- package/src/check.ts +476 -590
- 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 +686 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +60 -708
- 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 +25 -18
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +73 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +14 -7
- 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/json.ts +4 -7
- package/src/levels.ts +42 -44
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +597 -240
- package/src/liveness.ts +94 -86
- 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 +29 -47
- package/src/parser.ts +652 -220
- 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 +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 +93 -15
- 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 +536 -117
- 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 +907 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +335 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -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 +267 -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 +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -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 +177 -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 +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 +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 +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 +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 -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 +410 -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 +1407 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +315 -97
- 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 +464 -246
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2410 -683
- 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 +40 -19
- 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 +792 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -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 +311 -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 +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 +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 +44 -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 +90 -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 +1704 -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 +1995 -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/resolve.ts +127 -108
- package/src/runtime.ts +6 -0
- package/src/sany/generation.ts +382 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1092 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +155 -2625
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +17 -16
- package/src/sany/linter.ts +0 -2
- 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 +243 -52
- package/src/simulate.ts +160 -133
- package/src/spec-description.ts +33 -48
- package/src/standard-definitions.ts +4 -0
- package/src/standard-modules.ts +16 -32
- package/src/state-graph.ts +2 -9
- package/src/subexpressions.ts +3 -1
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +6 -8
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +12 -0
- package/src/tlc/messages.ts +20 -15
- package/src/tlc/order.ts +16 -12
- package/src/tlc/random.ts +4 -4
- package/src/tlc/replay.ts +8 -15
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +2 -3
- package/src/tlc/tlcext-operators.ts +61 -16
- package/src/tlc/trace-spec.ts +26 -47
- 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 +63 -158
- 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/check.ts
CHANGED
|
@@ -9,10 +9,8 @@ import {
|
|
|
9
9
|
getCoverageReport,
|
|
10
10
|
type CoverageReport,
|
|
11
11
|
} from "./coverage";
|
|
12
|
-
import { createEnvironment } from "./environment";
|
|
13
12
|
import {
|
|
14
13
|
createStackOverflowError,
|
|
15
|
-
getErrorExitCode,
|
|
16
14
|
isStackOverflow,
|
|
17
15
|
TlaEvaluationError,
|
|
18
16
|
TlaIllegalStateError,
|
|
@@ -24,21 +22,33 @@ import {
|
|
|
24
22
|
formatRange,
|
|
25
23
|
} from "./errors";
|
|
26
24
|
import {
|
|
27
|
-
createTracingEnvironment,
|
|
28
25
|
describeRange,
|
|
29
26
|
getDefinition,
|
|
30
|
-
isImpure,
|
|
31
27
|
type CallStack,
|
|
32
28
|
type Environment,
|
|
33
29
|
type FingerprintFailure,
|
|
34
30
|
} from "./evaluate";
|
|
31
|
+
import { EXIT_STATUS, setExitCode, withLivenessExitCode } from "./exit-codes";
|
|
35
32
|
import {
|
|
36
|
-
|
|
37
|
-
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
|
|
41
|
-
|
|
33
|
+
fingerprintReplayed,
|
|
34
|
+
getFailureExitCode,
|
|
35
|
+
getReplayFailure,
|
|
36
|
+
type FailureOptions,
|
|
37
|
+
} from "./check-failure";
|
|
38
|
+
import {
|
|
39
|
+
createTraceBuilder,
|
|
40
|
+
type Behavior,
|
|
41
|
+
type SearchPosition,
|
|
42
|
+
type TracedStep,
|
|
43
|
+
} from "./check-trace";
|
|
44
|
+
import {
|
|
45
|
+
createStateTable,
|
|
46
|
+
findStateIndex,
|
|
47
|
+
getStateHash,
|
|
48
|
+
isSameState,
|
|
49
|
+
markSeenState,
|
|
50
|
+
type StateTable,
|
|
51
|
+
} from "./fingerprints";
|
|
42
52
|
import type { JavaOverride } from "./java-overrides";
|
|
43
53
|
import {
|
|
44
54
|
createLivenessChecker,
|
|
@@ -47,6 +57,7 @@ import {
|
|
|
47
57
|
type LiveSuccessor,
|
|
48
58
|
} from "./liveness-checker";
|
|
49
59
|
import {
|
|
60
|
+
createCheckEnvironment,
|
|
50
61
|
createMissingOperatorError,
|
|
51
62
|
createSearch,
|
|
52
63
|
getIncompleteSuccessorMessage,
|
|
@@ -58,11 +69,11 @@ import {
|
|
|
58
69
|
import {
|
|
59
70
|
getActionLabel,
|
|
60
71
|
getActionSignature,
|
|
61
|
-
|
|
62
|
-
getNextActions,
|
|
72
|
+
getSpecDescription,
|
|
63
73
|
getSpecificationValue,
|
|
64
74
|
toActionValue,
|
|
65
75
|
type SpecAction,
|
|
76
|
+
type SpecDescription,
|
|
66
77
|
} from "./spec-description";
|
|
67
78
|
import {
|
|
68
79
|
createStateWriter,
|
|
@@ -79,7 +90,6 @@ import {
|
|
|
79
90
|
type Successor,
|
|
80
91
|
} from "./successors";
|
|
81
92
|
import {
|
|
82
|
-
getCodedMessage,
|
|
83
93
|
getFailureMessage,
|
|
84
94
|
getWrappedException,
|
|
85
95
|
isEvalException,
|
|
@@ -90,9 +100,7 @@ import {
|
|
|
90
100
|
} from "./tlc/messages";
|
|
91
101
|
import { createTautologyError } from "./liveness";
|
|
92
102
|
import { KEY_SEPARATOR } from "./resolve";
|
|
93
|
-
import { setFingerprintPolynomial } from "./tlc/fingerprint";
|
|
94
103
|
import { writeTraceSpec } from "./tlc/trace-spec";
|
|
95
|
-
import { createTlcOrder } from "./tlc/order";
|
|
96
104
|
import {
|
|
97
105
|
getPrimedRanges,
|
|
98
106
|
replayInitialStates,
|
|
@@ -102,19 +110,15 @@ import {
|
|
|
102
110
|
import { getFingerprintDistance, OUT_DEGREE_BUCKETS } from "./tlc/summary";
|
|
103
111
|
import { createActionRecord, createCounterExample } from "./tlc/tlcext-operators";
|
|
104
112
|
import type { TlcVersion } from "./tlc/version";
|
|
113
|
+
import { runTypedSearch, type TypedResult } from "./typed-tier";
|
|
105
114
|
import {
|
|
106
|
-
combineHash,
|
|
107
115
|
createCanonicalizer,
|
|
108
116
|
createModelValue,
|
|
109
117
|
formatState,
|
|
110
118
|
getFingerprintError,
|
|
111
|
-
getHeldValues,
|
|
112
119
|
getModelValues,
|
|
113
|
-
getValueHash,
|
|
114
120
|
isSameValue,
|
|
115
121
|
markFingerprinted,
|
|
116
|
-
setStringOrder,
|
|
117
|
-
setValueOptions,
|
|
118
122
|
type Value,
|
|
119
123
|
} from "./values";
|
|
120
124
|
|
|
@@ -146,6 +150,8 @@ export interface CheckOptions {
|
|
|
146
150
|
isTool?: boolean;
|
|
147
151
|
/** TLC's -continue: reports each violation through onProgress and goes on. */
|
|
148
152
|
isContinued?: boolean;
|
|
153
|
+
/** Skips fingerprintDistance, which takes fingerprinting every state again after the search. */
|
|
154
|
+
isFingerprintDistanceSkipped?: boolean;
|
|
149
155
|
moduleOperators?: ModuleOperator[];
|
|
150
156
|
/** TLC's trace exploration spec, and the binary trace TLC records for it unless -noTEBin. */
|
|
151
157
|
traceSpec?: TraceSpecOptions;
|
|
@@ -200,7 +206,7 @@ export type CheckProgress =
|
|
|
200
206
|
branches: number;
|
|
201
207
|
/** Whether TLC checks the complete state graph. */
|
|
202
208
|
isComplete: boolean;
|
|
203
|
-
/** How many states of
|
|
209
|
+
/** How many states the graphs of all branches have together. */
|
|
204
210
|
states: number;
|
|
205
211
|
statistics: SearchStatistics;
|
|
206
212
|
}
|
|
@@ -284,12 +290,6 @@ export interface EvaluationFailure {
|
|
|
284
290
|
isWithoutStatistics?: boolean;
|
|
285
291
|
}
|
|
286
292
|
|
|
287
|
-
interface ReplayFailure {
|
|
288
|
-
callStack: Expression[];
|
|
289
|
-
fingerprint: FingerprintFailure | undefined;
|
|
290
|
-
replayError?: TlaEvaluationError;
|
|
291
|
-
}
|
|
292
|
-
|
|
293
293
|
export interface InitialStates {
|
|
294
294
|
generated: number;
|
|
295
295
|
distinct: number;
|
|
@@ -323,73 +323,18 @@ interface CoveredAction extends SpecAction {
|
|
|
323
323
|
node: number;
|
|
324
324
|
}
|
|
325
325
|
|
|
326
|
-
interface Behavior {
|
|
327
|
-
trace: TraceStep[];
|
|
328
|
-
traceOutput?: OutputLine[];
|
|
329
|
-
}
|
|
330
|
-
|
|
331
|
-
interface TraceOptions {
|
|
332
|
-
loopStart?: number;
|
|
333
|
-
known?: number;
|
|
334
|
-
}
|
|
335
|
-
|
|
336
326
|
interface ReportedViolation extends Omit<Violation, "loopStart"> {
|
|
337
327
|
loopStart?: number;
|
|
338
328
|
}
|
|
339
329
|
|
|
340
|
-
interface RebuiltState {
|
|
341
|
-
state: Value[];
|
|
342
|
-
level: number;
|
|
343
|
-
}
|
|
344
|
-
|
|
345
|
-
interface SearchPosition {
|
|
346
|
-
index: number;
|
|
347
|
-
isExpanding: boolean;
|
|
348
|
-
candidate: Value[] | undefined;
|
|
349
|
-
candidateLevel: number;
|
|
350
|
-
livenessSource: number;
|
|
351
|
-
rebuilt: RebuiltState | undefined;
|
|
352
|
-
}
|
|
353
|
-
|
|
354
|
-
interface FailureOptions {
|
|
355
|
-
initialState?: Value[];
|
|
356
|
-
isInitial?: boolean;
|
|
357
|
-
outDegrees?: number[];
|
|
358
|
-
callStack?: Expression[];
|
|
359
|
-
fingerprint?: FingerprintFailure;
|
|
360
|
-
replayError?: TlaEvaluationError;
|
|
361
|
-
isNextState?: boolean;
|
|
362
|
-
isCallStackFirst?: boolean;
|
|
363
|
-
traceFailure?: FailureMessage;
|
|
364
|
-
isLiveCallStack?: boolean;
|
|
365
|
-
}
|
|
366
|
-
|
|
367
330
|
const appendTraceOutput = <Traced extends Behavior>(behavior: Traced, lines: OutputLine[]) => ({
|
|
368
331
|
...behavior,
|
|
369
332
|
traceOutput: [...(behavior.traceOutput ?? []), ...lines],
|
|
370
333
|
});
|
|
371
334
|
|
|
372
|
-
const INITIAL_RECOVERY_FAILURE = "Failed to recover the initial state from its fingerprint.";
|
|
373
|
-
const NEXT_RECOVERY_FAILURE = "Failed to recover the next state from its fingerprint.";
|
|
374
|
-
|
|
375
335
|
const STOP_REPLAY = new Error("The replay stopped");
|
|
376
336
|
const STOP_WALK = new Error("The walk stopped");
|
|
377
337
|
|
|
378
|
-
const getInitialExitCode = (error: TlaEvaluationError) => {
|
|
379
|
-
const coded = getCodedMessage(error.message);
|
|
380
|
-
return coded &&
|
|
381
|
-
!coded.isEvalException &&
|
|
382
|
-
getMessageExitStatus(coded.code) === EXIT_STATUS.configParseError
|
|
383
|
-
? EXIT_STATUS.configParseError
|
|
384
|
-
: getErrorExitCode(error);
|
|
385
|
-
};
|
|
386
|
-
|
|
387
|
-
const getReplayExitCode = (error: TlaEvaluationError): number => {
|
|
388
|
-
const inner = error.cause;
|
|
389
|
-
if (inner instanceof TlaEvaluationError) return getReplayExitCode(inner);
|
|
390
|
-
return error instanceof TlaModuleError ? error.exitCode : EXIT_STATUS.specEvaluationFailure;
|
|
391
|
-
};
|
|
392
|
-
|
|
393
338
|
export const checkSequentially = (options: CheckOptions): CheckResult => {
|
|
394
339
|
const stateWriter =
|
|
395
340
|
options.dump && createStateWriter(options.dump, options.writeFile, options.version);
|
|
@@ -428,29 +373,8 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
428
373
|
capturedLines = outer;
|
|
429
374
|
}
|
|
430
375
|
};
|
|
431
|
-
const
|
|
432
|
-
|
|
433
|
-
setValueOptions(options);
|
|
434
|
-
setFingerprintPolynomial(options.fingerprintPolynomial ?? 0);
|
|
435
|
-
const specification = createEnvironment(config, {
|
|
436
|
-
source: options.source,
|
|
437
|
-
loadModule: options.loadModule,
|
|
438
|
-
order,
|
|
439
|
-
loadClass: options.loadClass,
|
|
440
|
-
print,
|
|
441
|
-
files: {
|
|
442
|
-
readFile: options.readFile,
|
|
443
|
-
writeFile: options.writeFile,
|
|
444
|
-
makeDirectory: options.makeDirectory,
|
|
445
|
-
},
|
|
446
|
-
seed: options.seed,
|
|
447
|
-
isTool: options.isTool,
|
|
448
|
-
traceFile: options.traceSpec?.traceFile,
|
|
449
|
-
isSanyReported: options.isSanyReported,
|
|
450
|
-
isWarningEnabled: options.isWarningEnabled,
|
|
451
|
-
version: options.version,
|
|
452
|
-
moduleOperators: options.moduleOperators,
|
|
453
|
-
});
|
|
376
|
+
const created = createCheckEnvironment(config, options, print);
|
|
377
|
+
const specification = created.specification;
|
|
454
378
|
reportStartup(specification, config, options.onProgress);
|
|
455
379
|
const coverage =
|
|
456
380
|
options.coverage === undefined
|
|
@@ -468,13 +392,11 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
468
392
|
const runtime = environment.runtime;
|
|
469
393
|
const is174 = runtime.version === "1.7.4";
|
|
470
394
|
runtime.pause = options.onPause ?? (() => {});
|
|
395
|
+
let description: SpecDescription | undefined;
|
|
396
|
+
const getDescription = () =>
|
|
397
|
+
(description ??= getSpecDescription(config, environment, specification.instanceActions));
|
|
471
398
|
runtime.getSpecification = () =>
|
|
472
|
-
getSpecificationValue(
|
|
473
|
-
config,
|
|
474
|
-
environment,
|
|
475
|
-
specification.variableLocations,
|
|
476
|
-
specification.instanceActions,
|
|
477
|
-
);
|
|
399
|
+
getSpecificationValue(getDescription(), config, environment, specification.variableLocations);
|
|
478
400
|
let searchDepth = 0;
|
|
479
401
|
let computedInitialStates: InitialStates | undefined;
|
|
480
402
|
const getTraceSpec = (trace: TraceStep[], loopStart: number | undefined) =>
|
|
@@ -493,6 +415,15 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
493
415
|
key.startsWith(`${name}${KEY_SEPARATOR}`),
|
|
494
416
|
),
|
|
495
417
|
});
|
|
418
|
+
const getCoverage = () =>
|
|
419
|
+
coverage?.relations.some((relation) => relation.kind === "next")
|
|
420
|
+
? getCoverageReport(
|
|
421
|
+
coverage,
|
|
422
|
+
environment,
|
|
423
|
+
specification.variableLocations,
|
|
424
|
+
search?.getTlcOrder() ?? [],
|
|
425
|
+
)
|
|
426
|
+
: undefined;
|
|
496
427
|
const createResult = (
|
|
497
428
|
status: CheckStatus,
|
|
498
429
|
violation?: ReportedViolation,
|
|
@@ -513,14 +444,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
513
444
|
initialStates: computedInitialStates,
|
|
514
445
|
outDegrees: undefined,
|
|
515
446
|
fingerprintDistance: undefined,
|
|
516
|
-
coverage:
|
|
517
|
-
? getCoverageReport(
|
|
518
|
-
coverage,
|
|
519
|
-
environment,
|
|
520
|
-
specification.variableLocations,
|
|
521
|
-
search?.getTlcOrder() ?? [],
|
|
522
|
-
)
|
|
523
|
-
: undefined,
|
|
447
|
+
coverage: getCoverage(),
|
|
524
448
|
...(traceSpec !== undefined && { traceSpec }),
|
|
525
449
|
};
|
|
526
450
|
};
|
|
@@ -539,23 +463,30 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
539
463
|
const createSuccess = (): CheckResult => ({
|
|
540
464
|
...createResult("success"),
|
|
541
465
|
outDegrees: [...outDegrees],
|
|
542
|
-
fingerprintDistance:
|
|
543
|
-
|
|
544
|
-
runtime.generatedStates,
|
|
545
|
-
|
|
546
|
-
|
|
547
|
-
|
|
548
|
-
|
|
549
|
-
|
|
466
|
+
fingerprintDistance: options.isFingerprintDistanceSkipped
|
|
467
|
+
? undefined
|
|
468
|
+
: getFingerprintDistance(runtime.distinctStates, runtime.generatedStates, (visit) =>
|
|
469
|
+
visit(
|
|
470
|
+
search
|
|
471
|
+
? search.getStoredFingerprints(
|
|
472
|
+
exploredStates.length === 0 ? states : states.concat(exploredStates),
|
|
473
|
+
exploredStates.length === 0
|
|
474
|
+
? fingerprintStates
|
|
475
|
+
: fingerprintStates.concat(exploredFingerprintStates),
|
|
476
|
+
)
|
|
477
|
+
: BigInt64Array.from(states, runtime.getFingerprint),
|
|
478
|
+
),
|
|
479
|
+
),
|
|
550
480
|
});
|
|
551
481
|
|
|
552
482
|
const search = createSearch(
|
|
553
483
|
config,
|
|
554
484
|
environment,
|
|
555
485
|
specification.variableLocations,
|
|
556
|
-
() => order.getDeclarationOrder("variable"),
|
|
486
|
+
() => created.order.getDeclarationOrder("variable"),
|
|
557
487
|
options.onProgress,
|
|
558
488
|
specification.moduleOperators,
|
|
489
|
+
specification.runtimeInvariants,
|
|
559
490
|
);
|
|
560
491
|
const findViolatedAssumption = () =>
|
|
561
492
|
findAssumptionViolation(specification.assumptions, environment);
|
|
@@ -575,13 +506,10 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
575
506
|
config.postconditions.length > 0 ||
|
|
576
507
|
config.possible.length > 0 ||
|
|
577
508
|
specification.moduleOperators.some((operator) => operator.kind === "postcondition");
|
|
578
|
-
const
|
|
579
|
-
|
|
580
|
-
{ state: Record<string, Value>; action: SpecAction | undefined }
|
|
581
|
-
>();
|
|
582
|
-
const getStepState = (step: TraceStep) => traceSteps.get(step)?.state ?? step.state;
|
|
509
|
+
const tracedSteps = new WeakMap<TraceStep, TracedStep>();
|
|
510
|
+
const getStepState = (step: TraceStep) => tracedSteps.get(step)?.state ?? step.state;
|
|
583
511
|
const getStepAction = (step: TraceStep) => {
|
|
584
|
-
const action =
|
|
512
|
+
const action = tracedSteps.get(step)?.action;
|
|
585
513
|
return action ? toActionValue(action) : createActionRecord(step.action);
|
|
586
514
|
};
|
|
587
515
|
const checkTracePostconditions = (
|
|
@@ -633,17 +561,8 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
633
561
|
};
|
|
634
562
|
const spec = search.spec;
|
|
635
563
|
const getFingerprintState = search.getFingerprintState;
|
|
636
|
-
let specNextActions: SpecAction[] | undefined;
|
|
637
|
-
const getSpecNextActions = () =>
|
|
638
|
-
(specNextActions ??= getNextActions(config, environment, specification.instanceActions));
|
|
639
564
|
// Tool's constructor splits the next-state relation into actions before TLC checks anything.
|
|
640
|
-
|
|
641
|
-
runtime.getSuccessorAction = (state, next) =>
|
|
642
|
-
getSpecNextActions().find((action) =>
|
|
643
|
-
getSuccessors(action.expression, state, environment, action.scope).some((successor) =>
|
|
644
|
-
successor.state.every((value, index) => isSameValue(value, next[index])),
|
|
645
|
-
),
|
|
646
|
-
);
|
|
565
|
+
const nextActions = getDescription().actions;
|
|
647
566
|
const addCoverageRelations = (kind: "init" | "next", actions: SpecAction[]) =>
|
|
648
567
|
actions.map((action): CoveredAction => ({
|
|
649
568
|
...action,
|
|
@@ -657,11 +576,8 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
657
576
|
)
|
|
658
577
|
: -1,
|
|
659
578
|
}));
|
|
660
|
-
const coverageInits = addCoverageRelations(
|
|
661
|
-
|
|
662
|
-
coverage ? getInitActions(config, environment, specification.instanceActions) : [],
|
|
663
|
-
);
|
|
664
|
-
const coverageActions = addCoverageRelations("next", coverage ? getSpecNextActions() : []);
|
|
579
|
+
const coverageInits = addCoverageRelations("init", coverage ? getDescription().inits : []);
|
|
580
|
+
const coverageActions = addCoverageRelations("next", coverage ? nextActions : []);
|
|
665
581
|
if (coverage) buildCoverage(coverage, environment, getPrimedRanges(coverageActions, environment));
|
|
666
582
|
const walkCoveredSuccessors = (
|
|
667
583
|
action: CoveredAction,
|
|
@@ -696,64 +612,39 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
696
612
|
);
|
|
697
613
|
return successors;
|
|
698
614
|
};
|
|
615
|
+
// TLC generates the successors of each action again, which its coverage counts.
|
|
616
|
+
const findSuccessorAction = (state: Value[], isMatch: (successor: Successor) => boolean) =>
|
|
617
|
+
coverage
|
|
618
|
+
? coverageActions.find((item) => getCoveredSuccessors(item, state).some(isMatch))
|
|
619
|
+
: nextActions.find((item) =>
|
|
620
|
+
getSuccessors(item.expression, state, environment, item.scope).some(isMatch),
|
|
621
|
+
);
|
|
622
|
+
runtime.getSuccessorAction = (state, next) =>
|
|
623
|
+
findSuccessorAction(state, (successor) =>
|
|
624
|
+
successor.state.every((value, index) => isSameValue(value, next[index])),
|
|
625
|
+
);
|
|
626
|
+
const rejectIncompleteInitialState = (partial: (Value | undefined)[]) => {
|
|
627
|
+
throw setExitCode(new TlaIllegalStateError([...partial]), EXIT_STATUS.error);
|
|
628
|
+
};
|
|
699
629
|
const getCoveredInitialStates = () => {
|
|
700
630
|
const initialStates: Value[][] = [];
|
|
701
631
|
replayInitialStates(
|
|
702
632
|
coverageInits,
|
|
703
633
|
environment,
|
|
704
634
|
(state) => initialStates.push(state),
|
|
705
|
-
|
|
706
|
-
throw setExitCode(new TlaIllegalStateError([...partial]), EXIT_STATUS.error);
|
|
707
|
-
},
|
|
635
|
+
rejectIncompleteInitialState,
|
|
708
636
|
);
|
|
709
637
|
return initialStates;
|
|
710
638
|
};
|
|
711
|
-
const getReplayFailure = (replay: (tracing: Environment) => void): ReplayFailure | undefined => {
|
|
712
|
-
const tracing = createTracingEnvironment(environment);
|
|
713
|
-
const callStack = tracing.callStack;
|
|
714
|
-
try {
|
|
715
|
-
replay(tracing);
|
|
716
|
-
return undefined;
|
|
717
|
-
} catch (error) {
|
|
718
|
-
if (isStackOverflow(error)) return { callStack: [], fingerprint: undefined };
|
|
719
|
-
if (!(error instanceof TlaEvaluationError) || !callStack) return undefined;
|
|
720
|
-
return {
|
|
721
|
-
callStack: callStack.expressions,
|
|
722
|
-
fingerprint: callStack.fingerprint,
|
|
723
|
-
replayError: error,
|
|
724
|
-
};
|
|
725
|
-
}
|
|
726
|
-
};
|
|
727
|
-
const findFailedSources = (value: Value, sources: CallStack["sources"]): Expression[] => {
|
|
728
|
-
if (typeof value !== "object") return [];
|
|
729
|
-
const source = sources.get(value);
|
|
730
|
-
const failed = getHeldValues(value).find((held) => getFingerprintError(held) !== undefined);
|
|
731
|
-
return [
|
|
732
|
-
...(source ? [source] : []),
|
|
733
|
-
...(failed === undefined ? [] : findFailedSources(failed, sources)),
|
|
734
|
-
];
|
|
735
|
-
};
|
|
736
|
-
const fingerprintReplayed = (state: Value[], callStack: CallStack | undefined) => {
|
|
737
|
-
for (const value of getFingerprintState(state)) {
|
|
738
|
-
const error = getFingerprintError(value);
|
|
739
|
-
if (!error) continue;
|
|
740
|
-
const sources = callStack ? findFailedSources(value, callStack.sources) : [];
|
|
741
|
-
if (callStack && sources.length > 0) {
|
|
742
|
-
callStack.expressions.length = 0;
|
|
743
|
-
callStack.isFrozen = true;
|
|
744
|
-
callStack.fingerprint = { sources, reason: error.message };
|
|
745
|
-
}
|
|
746
|
-
throw error;
|
|
747
|
-
}
|
|
748
|
-
state.forEach(markFingerprinted);
|
|
749
|
-
};
|
|
750
639
|
const createReplayedStates = () => {
|
|
751
640
|
const replayed = unstoredFingerprint ? [unstoredFingerprint] : [];
|
|
752
641
|
return (state: Value[], callStack: CallStack | undefined) => {
|
|
753
|
-
fingerprintReplayed(state, callStack);
|
|
642
|
+
fingerprintReplayed(state, getFingerprintState(state), callStack);
|
|
754
643
|
const fingerprintState = getFingerprintState(state);
|
|
644
|
+
const hash = getStateHash(fingerprintState);
|
|
755
645
|
const isSeen =
|
|
756
|
-
findStateIndex(
|
|
646
|
+
findStateIndex(seenStates, hash, fingerprintState) !== -1 ||
|
|
647
|
+
isExplored(hash, fingerprintState) ||
|
|
757
648
|
replayed.some((seen) => isSameState(seen, fingerprintState));
|
|
758
649
|
if (isSeen) return false;
|
|
759
650
|
replayed.push(fingerprintState);
|
|
@@ -765,48 +656,44 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
765
656
|
let replayedCount = 0;
|
|
766
657
|
const deferred: unknown[] = [];
|
|
767
658
|
const addReplayed = createReplayedStates();
|
|
768
|
-
return getReplayFailure((tracing) => {
|
|
769
|
-
replayInitialStates(
|
|
770
|
-
|
|
771
|
-
|
|
772
|
-
|
|
773
|
-
|
|
774
|
-
|
|
775
|
-
|
|
776
|
-
|
|
777
|
-
|
|
778
|
-
|
|
779
|
-
|
|
780
|
-
|
|
781
|
-
|
|
782
|
-
};
|
|
783
|
-
|
|
784
|
-
|
|
785
|
-
|
|
786
|
-
|
|
787
|
-
|
|
788
|
-
|
|
789
|
-
state: traced,
|
|
790
|
-
});
|
|
791
|
-
throw STOP_REPLAY;
|
|
792
|
-
}
|
|
793
|
-
} catch (error) {
|
|
794
|
-
const isFingerprintFailure =
|
|
795
|
-
error instanceof TlaEvaluationError && tracing.callStack?.fingerprint !== undefined;
|
|
796
|
-
if (!isFingerprintFailure && !isStackOverflow(error)) throw error;
|
|
797
|
-
deferred.push(error);
|
|
659
|
+
return getReplayFailure(environment, (tracing) => {
|
|
660
|
+
replayInitialStates(getDescription().inits, tracing, (state) => {
|
|
661
|
+
reportInitialStatesProgress(replayedCount, (progress) => capturedLines?.push(progress));
|
|
662
|
+
replayedCount++;
|
|
663
|
+
runtime.generatedStates = replayedCount;
|
|
664
|
+
if (deferred.length > 0) return;
|
|
665
|
+
try {
|
|
666
|
+
const addFingerprint = () => {
|
|
667
|
+
if (!addReplayed(state, tracing.callStack)) return;
|
|
668
|
+
runtime.queueSize++;
|
|
669
|
+
liveness?.addInitialState(states.length, state, tracing);
|
|
670
|
+
};
|
|
671
|
+
const violation = search.checkReplayedInitialState(state, tracing, addFingerprint);
|
|
672
|
+
if (violation) {
|
|
673
|
+
const traced = traces.toTrace([{ action: undefined, state }], []).trace[0].state;
|
|
674
|
+
capturedLines?.push({
|
|
675
|
+
kind: "initial-state-violation",
|
|
676
|
+
...violation,
|
|
677
|
+
state: traced,
|
|
678
|
+
});
|
|
679
|
+
throw STOP_REPLAY;
|
|
798
680
|
}
|
|
799
|
-
}
|
|
800
|
-
|
|
681
|
+
} catch (error) {
|
|
682
|
+
const isFingerprintFailure =
|
|
683
|
+
error instanceof TlaEvaluationError && tracing.callStack?.fingerprint !== undefined;
|
|
684
|
+
if (!isFingerprintFailure && !isStackOverflow(error)) throw error;
|
|
685
|
+
deferred.push(error);
|
|
686
|
+
}
|
|
687
|
+
});
|
|
801
688
|
if (deferred.length > 0) throw deferred[0];
|
|
802
689
|
});
|
|
803
690
|
};
|
|
804
691
|
const replayNext = (index: number) =>
|
|
805
|
-
getReplayFailure((tracing) => {
|
|
692
|
+
getReplayFailure(environment, (tracing) => {
|
|
806
693
|
const state = states[index];
|
|
807
694
|
const source = stateWriter && getGraphState(state, depths[index]);
|
|
808
695
|
const addReplayed = createReplayedStates();
|
|
809
|
-
replaySuccessors(
|
|
696
|
+
replaySuccessors(nextActions, state, tracing, (next, action) => {
|
|
810
697
|
const addFingerprint = () => {
|
|
811
698
|
const isUnseen = addReplayed(next, tracing.callStack);
|
|
812
699
|
if (source) {
|
|
@@ -824,7 +711,6 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
824
711
|
}
|
|
825
712
|
});
|
|
826
713
|
});
|
|
827
|
-
const isReducing = config.view !== undefined || config.symmetry !== undefined;
|
|
828
714
|
const tlcFingerprints: number[] = [];
|
|
829
715
|
if (search.properties.liveness.length > 0) {
|
|
830
716
|
options.onProgress?.({
|
|
@@ -845,24 +731,38 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
845
731
|
if (spec.next === undefined) return successors;
|
|
846
732
|
const livenessSource = current.livenessSource;
|
|
847
733
|
current.livenessSource = source;
|
|
734
|
+
const addSuccessor = (successor: Value[]) => {
|
|
735
|
+
canonicalizeState(successor);
|
|
736
|
+
const isInModel =
|
|
737
|
+
search.satisfiesConstraints(successor, state) &&
|
|
738
|
+
search.satisfiesActionConstraints(state, successor);
|
|
739
|
+
if (!isInModel) return;
|
|
740
|
+
const fingerprintState = getFingerprintState(successor);
|
|
741
|
+
const hash = getStateHash(fingerprintState);
|
|
742
|
+
const index = findStateIndex(seenStates, hash, fingerprintState);
|
|
743
|
+
successors.push({
|
|
744
|
+
index: index === -1 ? getPendingIndex(hash, fingerprintState) : index,
|
|
745
|
+
state: successor,
|
|
746
|
+
});
|
|
747
|
+
};
|
|
848
748
|
try {
|
|
849
|
-
|
|
850
|
-
|
|
851
|
-
|
|
852
|
-
|
|
853
|
-
|
|
854
|
-
|
|
855
|
-
|
|
856
|
-
|
|
857
|
-
|
|
858
|
-
|
|
859
|
-
|
|
860
|
-
|
|
861
|
-
|
|
862
|
-
|
|
863
|
-
|
|
864
|
-
|
|
865
|
-
|
|
749
|
+
// TLC's coverage counts the successors of each action the graph generates again.
|
|
750
|
+
if (coverage) {
|
|
751
|
+
coverageActions.forEach((action) =>
|
|
752
|
+
walkCoveredSuccessors(action, state, addSuccessor),
|
|
753
|
+
);
|
|
754
|
+
} else {
|
|
755
|
+
forEachSuccessor(
|
|
756
|
+
spec.next,
|
|
757
|
+
state,
|
|
758
|
+
environment,
|
|
759
|
+
(successor) => {
|
|
760
|
+
addSuccessor(successor.state);
|
|
761
|
+
return false;
|
|
762
|
+
},
|
|
763
|
+
spec.scope,
|
|
764
|
+
);
|
|
765
|
+
}
|
|
866
766
|
} finally {
|
|
867
767
|
current.livenessSource = livenessSource;
|
|
868
768
|
}
|
|
@@ -880,202 +780,31 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
880
780
|
const parents: number[] = [];
|
|
881
781
|
const actions: (string | undefined)[] = [];
|
|
882
782
|
const depths: number[] = [];
|
|
883
|
-
|
|
884
|
-
const
|
|
783
|
+
const seenStates = createStateTable(fingerprintStates);
|
|
784
|
+
const exploredStates: Value[][] = [];
|
|
785
|
+
const exploredFingerprintStates: Value[][] = [];
|
|
786
|
+
let exploredTable: StateTable | undefined;
|
|
787
|
+
const isExplored = (hash: number, fingerprintState: Value[]) =>
|
|
788
|
+
exploredTable !== undefined && findStateIndex(exploredTable, hash, fingerprintState) !== -1;
|
|
789
|
+
const pendingFingerprintStates: Value[][] = [];
|
|
790
|
+
let pendingStates: StateTable | undefined;
|
|
791
|
+
const getPendingIndex = (hash: number, fingerprintState: Value[]) => {
|
|
792
|
+
pendingStates ??= createStateTable(pendingFingerprintStates);
|
|
793
|
+
const found = findStateIndex(pendingStates, hash, fingerprintState);
|
|
794
|
+
const position = found === -1 ? pendingFingerprintStates.length : found;
|
|
795
|
+
if (found === -1) {
|
|
796
|
+
markSeenState(pendingStates, hash, position);
|
|
797
|
+
pendingFingerprintStates.push(fingerprintState);
|
|
798
|
+
}
|
|
799
|
+
return -2 - position;
|
|
800
|
+
};
|
|
885
801
|
const canonicalizeState = createCanonicalizer();
|
|
886
802
|
|
|
887
803
|
const toRecord = search.toRecord;
|
|
888
|
-
const getAliasState = (
|
|
889
|
-
alias: string,
|
|
890
|
-
steps: Successor[],
|
|
891
|
-
position: number,
|
|
892
|
-
loopStart: number | undefined,
|
|
893
|
-
) => {
|
|
894
|
-
const searchLevel = runtime.getLevel;
|
|
895
|
-
const searchBehavior = runtime.getBehavior;
|
|
896
|
-
runtime.getLevel = () => position + 1;
|
|
897
|
-
runtime.getBehavior = () => steps.slice(0, position + 1).map((step) => step.state);
|
|
898
|
-
try {
|
|
899
|
-
return evaluateAlias(
|
|
900
|
-
alias,
|
|
901
|
-
steps[position].state,
|
|
902
|
-
(steps[position + 1] ?? steps[loopStart ?? position]).state,
|
|
903
|
-
);
|
|
904
|
-
} finally {
|
|
905
|
-
runtime.getLevel = searchLevel;
|
|
906
|
-
runtime.getBehavior = searchBehavior;
|
|
907
|
-
}
|
|
908
|
-
};
|
|
909
|
-
const evaluateAlias = (alias: string, state: Value[], next: Value[] | undefined) =>
|
|
910
|
-
search.evaluateAlias(alias, state, next, options.isTool ?? false);
|
|
911
|
-
const findStepAction = (index: number, previous: Value[], state: Value[], isHeld: boolean) => {
|
|
912
|
-
const actions = getSpecNextActions();
|
|
913
|
-
const expanding = { ...current };
|
|
914
|
-
Object.assign(current, {
|
|
915
|
-
index,
|
|
916
|
-
isExpanding: true,
|
|
917
|
-
candidate: undefined,
|
|
918
|
-
rebuilt: { state: previous, level: depths[index] },
|
|
919
|
-
});
|
|
920
|
-
const getKey = isHeld ? (values: Value[]) => values : getFingerprintState;
|
|
921
|
-
const key = getKey(state);
|
|
922
|
-
try {
|
|
923
|
-
return coverage
|
|
924
|
-
? coverageActions.find((item) =>
|
|
925
|
-
getCoveredSuccessors(item, previous).some((successor) =>
|
|
926
|
-
isSameState(getKey(successor.state), key),
|
|
927
|
-
),
|
|
928
|
-
)
|
|
929
|
-
: actions.find((item) =>
|
|
930
|
-
getSuccessors(item.expression, previous, environment, item.scope).some((successor) =>
|
|
931
|
-
isSameState(getKey(successor.state), key),
|
|
932
|
-
),
|
|
933
|
-
);
|
|
934
|
-
} finally {
|
|
935
|
-
Object.assign(current, expanding);
|
|
936
|
-
}
|
|
937
|
-
};
|
|
938
|
-
const toTrace = (
|
|
939
|
-
steps: Successor[],
|
|
940
|
-
path: number[],
|
|
941
|
-
traceOptions: TraceOptions = {},
|
|
942
|
-
): Behavior => {
|
|
943
|
-
const alias = config.alias;
|
|
944
|
-
const known = traceOptions.known ?? 1;
|
|
945
|
-
const initialOutput = steps.length > 1 ? captureOutput(getSpecInitialStates).lines : [];
|
|
946
|
-
const stepActions = steps.map((step, position) =>
|
|
947
|
-
position === 0 || step.action === "Stuttering"
|
|
948
|
-
? { result: undefined, lines: [] }
|
|
949
|
-
: captureOutput(() =>
|
|
950
|
-
findStepAction(
|
|
951
|
-
path[position - 1],
|
|
952
|
-
steps[position - 1].state,
|
|
953
|
-
step.state,
|
|
954
|
-
known === 2 && position === steps.length - 1,
|
|
955
|
-
),
|
|
956
|
-
),
|
|
957
|
-
);
|
|
958
|
-
const outputs = stepActions.map((step) => step.lines);
|
|
959
|
-
const loopStart = traceOptions.loopStart;
|
|
960
|
-
const rebuilt = is174 && loopStart !== undefined ? loopStart + 1 : steps.length - known;
|
|
961
|
-
if (coverage && steps.length > 1) {
|
|
962
|
-
const isRebuiltAgain = known > 0 && !is174;
|
|
963
|
-
if (rebuilt > 0 && isRebuiltAgain) captureOutput(getSpecInitialStates);
|
|
964
|
-
if (isRebuiltAgain) {
|
|
965
|
-
steps.slice(1).forEach((step, position) => {
|
|
966
|
-
if (step.action === "Stuttering") return;
|
|
967
|
-
captureOutput(() =>
|
|
968
|
-
findStepAction(
|
|
969
|
-
path[position],
|
|
970
|
-
steps[position].state,
|
|
971
|
-
step.state,
|
|
972
|
-
known === 2 && position === steps.length - 2,
|
|
973
|
-
),
|
|
974
|
-
);
|
|
975
|
-
});
|
|
976
|
-
}
|
|
977
|
-
}
|
|
978
|
-
const prefixOutput = rebuilt > 0 ? [initialOutput, ...outputs.slice(1, rebuilt)].flat() : [];
|
|
979
|
-
return {
|
|
980
|
-
trace: steps.map((step, position) => {
|
|
981
|
-
const action = stepActions[position].result;
|
|
982
|
-
const traceStep: TraceStep = {
|
|
983
|
-
action: step.action,
|
|
984
|
-
label: action && getActionLabel(action, options.version),
|
|
985
|
-
state:
|
|
986
|
-
alias === undefined
|
|
987
|
-
? toRecord(step.state)
|
|
988
|
-
: getAliasState(alias, steps, position, loopStart),
|
|
989
|
-
output: position === 0 ? prefixOutput : position < rebuilt ? [] : outputs[position],
|
|
990
|
-
};
|
|
991
|
-
if (alias !== undefined || action) {
|
|
992
|
-
traceSteps.set(traceStep, { state: toRecord(step.state), action });
|
|
993
|
-
}
|
|
994
|
-
return traceStep;
|
|
995
|
-
}),
|
|
996
|
-
traceOutput: known > 0 && !is174 ? [initialOutput, ...outputs].flat() : [],
|
|
997
|
-
};
|
|
998
|
-
};
|
|
999
804
|
const getSpecInitialStates = () => {
|
|
1000
805
|
if (coverage) return getCoveredInitialStates();
|
|
1001
806
|
return spec.init === undefined ? [] : getInitialStates(spec.init, environment, spec.scope);
|
|
1002
807
|
};
|
|
1003
|
-
const findTraceSuccessor = (state: Value[], isMatch: (successor: Successor) => boolean) =>
|
|
1004
|
-
captureOutput(() => {
|
|
1005
|
-
for (const action of getSpecNextActions()) {
|
|
1006
|
-
const successor = getSuccessors(action.expression, state, environment, action.scope).find(
|
|
1007
|
-
isMatch,
|
|
1008
|
-
);
|
|
1009
|
-
if (successor) return { ...successor, action: successor.action ?? action.name };
|
|
1010
|
-
}
|
|
1011
|
-
return undefined;
|
|
1012
|
-
}).result;
|
|
1013
|
-
const hasFingerprint = (state: Value[], index: number) =>
|
|
1014
|
-
isSameState(getFingerprintState(state), fingerprintStates[index]);
|
|
1015
|
-
const findSuccessorWithFingerprint = (state: Value[], index: number) =>
|
|
1016
|
-
findTraceSuccessor(state, (successor) => hasFingerprint(successor.state, index));
|
|
1017
|
-
const getPathStates = (path: number[], nextFailure: string) => {
|
|
1018
|
-
const initial = captureOutput(() =>
|
|
1019
|
-
isReducing || isImpure(environment)
|
|
1020
|
-
? getSpecInitialStates().find((state) => hasFingerprint(state, path[0]))
|
|
1021
|
-
: states[path[0]],
|
|
1022
|
-
).result;
|
|
1023
|
-
if (!initial) throw new TlaEvaluationError(INITIAL_RECOVERY_FAILURE);
|
|
1024
|
-
const steps: Successor[] = [{ state: initial, action: undefined }];
|
|
1025
|
-
for (let position = 1; position < path.length; position++) {
|
|
1026
|
-
const previous = steps[position - 1].state;
|
|
1027
|
-
if (path[position - 1] === path[position]) {
|
|
1028
|
-
steps.push({ state: previous, action: "Stuttering" });
|
|
1029
|
-
continue;
|
|
1030
|
-
}
|
|
1031
|
-
const rebuilt = current.rebuilt;
|
|
1032
|
-
current.rebuilt = { state: previous, level: depths[path[position - 1]] };
|
|
1033
|
-
const successor = findSuccessorWithFingerprint(previous, path[position]);
|
|
1034
|
-
current.rebuilt = rebuilt;
|
|
1035
|
-
if (!successor) throw new TlaEvaluationError(nextFailure);
|
|
1036
|
-
steps.push(successor);
|
|
1037
|
-
}
|
|
1038
|
-
return steps;
|
|
1039
|
-
};
|
|
1040
|
-
const getTrace = (index: number, lastSuccessor?: Successor) => {
|
|
1041
|
-
const path: number[] = [];
|
|
1042
|
-
for (let position = index; position !== -1; position = parents[position]) {
|
|
1043
|
-
path.unshift(position);
|
|
1044
|
-
}
|
|
1045
|
-
const steps =
|
|
1046
|
-
isReducing && path.length > 1
|
|
1047
|
-
? getPathStates(path, INITIAL_RECOVERY_FAILURE)
|
|
1048
|
-
: path.map((position) => ({ state: states[position], action: actions[position] }));
|
|
1049
|
-
if (!lastSuccessor) return toTrace(steps, path);
|
|
1050
|
-
const action = isReducing
|
|
1051
|
-
? findTraceSuccessor(states[index], (successor) =>
|
|
1052
|
-
isSameState(successor.state, lastSuccessor.state),
|
|
1053
|
-
)?.action
|
|
1054
|
-
: lastSuccessor.action;
|
|
1055
|
-
return toTrace([...steps, { state: lastSuccessor.state, action }], path, { known: 2 });
|
|
1056
|
-
};
|
|
1057
|
-
// Deviation from TLC: TLCTrace#printTrace prints a lone initial state without the alias.
|
|
1058
|
-
const getStateTrace = (index: number): Behavior =>
|
|
1059
|
-
parents[index] === -1
|
|
1060
|
-
? {
|
|
1061
|
-
trace: [
|
|
1062
|
-
{
|
|
1063
|
-
action: undefined,
|
|
1064
|
-
label: undefined,
|
|
1065
|
-
state:
|
|
1066
|
-
config.alias === undefined
|
|
1067
|
-
? toRecord(states[index])
|
|
1068
|
-
: getAliasState(
|
|
1069
|
-
config.alias,
|
|
1070
|
-
[{ state: states[index], action: undefined }],
|
|
1071
|
-
0,
|
|
1072
|
-
undefined,
|
|
1073
|
-
),
|
|
1074
|
-
},
|
|
1075
|
-
],
|
|
1076
|
-
traceOutput: is174 ? [] : captureOutput(getSpecInitialStates).lines,
|
|
1077
|
-
}
|
|
1078
|
-
: getTrace(index);
|
|
1079
808
|
const isUnfingerprintable = (state: Value[]) => {
|
|
1080
809
|
try {
|
|
1081
810
|
return getFingerprintState(state).some((value) => getFingerprintError(value) !== undefined);
|
|
@@ -1084,31 +813,6 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1084
813
|
return true;
|
|
1085
814
|
}
|
|
1086
815
|
};
|
|
1087
|
-
const getFailedTrace = (index: number, successor: Successor): Behavior => ({
|
|
1088
|
-
trace: getTrace(index, successor).trace,
|
|
1089
|
-
});
|
|
1090
|
-
const getFailureExitCode = (error: TlaEvaluationError, failureOptions: FailureOptions) => {
|
|
1091
|
-
if (
|
|
1092
|
-
failureOptions.isInitial &&
|
|
1093
|
-
!failureOptions.callStack &&
|
|
1094
|
-
!failureOptions.fingerprint &&
|
|
1095
|
-
is174
|
|
1096
|
-
) {
|
|
1097
|
-
return EXIT_STATUS.success;
|
|
1098
|
-
}
|
|
1099
|
-
if (!failureOptions.callStack) {
|
|
1100
|
-
return failureOptions.isInitial ? getInitialExitCode(error) : getErrorExitCode(error);
|
|
1101
|
-
}
|
|
1102
|
-
if (failureOptions.isCallStackFirst) return getErrorExitCode(error);
|
|
1103
|
-
if (failureOptions.isLiveCallStack) {
|
|
1104
|
-
return (
|
|
1105
|
-
getExitCode(error) ?? (error instanceof TlaModuleError ? error.exitCode : EXIT_STATUS.error)
|
|
1106
|
-
);
|
|
1107
|
-
}
|
|
1108
|
-
return failureOptions.isInitial || failureOptions.fingerprint
|
|
1109
|
-
? EXIT_STATUS.specEvaluationFailure
|
|
1110
|
-
: getReplayExitCode(failureOptions.replayError ?? error);
|
|
1111
|
-
};
|
|
1112
816
|
const createFailureResult = (
|
|
1113
817
|
failed: unknown,
|
|
1114
818
|
behavior: Behavior,
|
|
@@ -1124,7 +828,10 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1124
828
|
const traceOutput = [...(behavior.traceOutput ?? []), ...(checked?.lines ?? [])];
|
|
1125
829
|
return {
|
|
1126
830
|
...createResult("error", undefined, {
|
|
1127
|
-
...getFailureMessage(
|
|
831
|
+
...getFailureMessage(
|
|
832
|
+
error,
|
|
833
|
+
failureOptions.phase !== undefined && failureOptions.phase !== "initial",
|
|
834
|
+
),
|
|
1128
835
|
...behavior,
|
|
1129
836
|
...(traceOutput.length > 0 && { traceOutput }),
|
|
1130
837
|
...(postcondition && { postcondition }),
|
|
@@ -1132,9 +839,9 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1132
839
|
failureOptions.initialState && !(error instanceof TlaModuleError)
|
|
1133
840
|
? toRecord(failureOptions.initialState)
|
|
1134
841
|
: undefined,
|
|
1135
|
-
exitCode: getFailureExitCode(error, failureOptions),
|
|
842
|
+
exitCode: getFailureExitCode(error, failureOptions, is174),
|
|
1136
843
|
callStack: failureOptions.callStack,
|
|
1137
|
-
...(failureOptions.
|
|
844
|
+
...(failureOptions.phase === "liveness" && { isCallStackFirst: true }),
|
|
1138
845
|
...(failureOptions.fingerprint && { fingerprint: failureOptions.fingerprint }),
|
|
1139
846
|
...(failureOptions.traceFailure && { traceFailure: failureOptions.traceFailure }),
|
|
1140
847
|
}),
|
|
@@ -1143,9 +850,10 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1143
850
|
};
|
|
1144
851
|
const reportIncompleteSuccessor = (index: number, error: TlaIncompleteSuccessorError) => {
|
|
1145
852
|
runtime.generatedStates++;
|
|
1146
|
-
const actions = getSpecNextActions();
|
|
1147
853
|
const named =
|
|
1148
|
-
|
|
854
|
+
nextActions.length === 1
|
|
855
|
+
? nextActions
|
|
856
|
+
: nextActions.filter((item) => item.name === error.action);
|
|
1149
857
|
const action =
|
|
1150
858
|
named.length === 1
|
|
1151
859
|
? named[0]
|
|
@@ -1157,12 +865,12 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1157
865
|
const message = getIncompleteSuccessorMessage(
|
|
1158
866
|
error.variables,
|
|
1159
867
|
error.action,
|
|
1160
|
-
|
|
868
|
+
nextActions.length,
|
|
1161
869
|
options.version,
|
|
1162
870
|
);
|
|
1163
871
|
const undefinedValue = createModelValue("null");
|
|
1164
872
|
const partial = error.state.map((value) => value ?? undefinedValue);
|
|
1165
|
-
const failure = createFailureResult(error, getStateTrace(index));
|
|
873
|
+
const failure = createFailureResult(error, traces.getStateTrace(index));
|
|
1166
874
|
return withOutDegrees({
|
|
1167
875
|
...failure,
|
|
1168
876
|
failure: failure.failure && {
|
|
@@ -1182,68 +890,15 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1182
890
|
},
|
|
1183
891
|
});
|
|
1184
892
|
};
|
|
1185
|
-
const getPathSteps = (path: number[], loopStart?: number) => {
|
|
1186
|
-
const steps = getPathStates(path, NEXT_RECOVERY_FAILURE);
|
|
1187
|
-
const lastState = steps[steps.length - 1].state;
|
|
1188
|
-
const isClosed =
|
|
1189
|
-
!isReducing ||
|
|
1190
|
-
loopStart === undefined ||
|
|
1191
|
-
loopStart === path.length - 1 ||
|
|
1192
|
-
findSuccessorWithFingerprint(lastState, path[loopStart]) !== undefined;
|
|
1193
|
-
if (!isClosed) throw new TlaEvaluationError(NEXT_RECOVERY_FAILURE);
|
|
1194
|
-
return steps;
|
|
1195
|
-
};
|
|
1196
|
-
const getStateHash = (state: Value[]) => {
|
|
1197
|
-
let hash = 0x811c9dc5;
|
|
1198
|
-
for (let index = 0; index < state.length; index++)
|
|
1199
|
-
hash = combineHash(hash, getValueHash(state[index]));
|
|
1200
|
-
return hash & 0x3fffffff;
|
|
1201
|
-
};
|
|
1202
893
|
const fingerprintModelState = (state: Value[]) => {
|
|
1203
894
|
for (const value of state) {
|
|
1204
895
|
const error = getFingerprintError(value);
|
|
1205
896
|
if (error) throw error;
|
|
1206
897
|
}
|
|
1207
898
|
};
|
|
1208
|
-
const isSameState = (stored: Value[], state: Value[]) => {
|
|
1209
|
-
for (let position = 0; position < state.length; position++) {
|
|
1210
|
-
if (!isSameValue(stored[position], state[position])) return false;
|
|
1211
|
-
}
|
|
1212
|
-
return true;
|
|
1213
|
-
};
|
|
1214
|
-
const getSlot = (hash: number) => (Math.imul(hash, 0x9e3779b1) >>> seenStates.shift) << 1;
|
|
1215
|
-
const findStateIndex = (hash: number, state: Value[]) => {
|
|
1216
|
-
const mask = seenStates.slots.length - 1;
|
|
1217
|
-
for (let slot = getSlot(hash); ; slot = (slot + 2) & mask) {
|
|
1218
|
-
const entry = seenStates.slots[slot + 1];
|
|
1219
|
-
if (entry === 0) return -1;
|
|
1220
|
-
if (seenStates.slots[slot] === hash && isSameState(fingerprintStates[entry - 1], state)) {
|
|
1221
|
-
return entry - 1;
|
|
1222
|
-
}
|
|
1223
|
-
}
|
|
1224
|
-
};
|
|
1225
|
-
const insertSeen = (hash: number, entry: number) => {
|
|
1226
|
-
const mask = seenStates.slots.length - 1;
|
|
1227
|
-
let slot = getSlot(hash);
|
|
1228
|
-
while (seenStates.slots[slot + 1] !== 0) slot = (slot + 2) & mask;
|
|
1229
|
-
seenStates.slots[slot] = hash;
|
|
1230
|
-
seenStates.slots[slot + 1] = entry;
|
|
1231
|
-
};
|
|
1232
|
-
const markSeen = (hash: number, index: number) => {
|
|
1233
|
-
seenStates.size++;
|
|
1234
|
-
if (seenStates.size * 4 > seenStates.slots.length) {
|
|
1235
|
-
const slots = seenStates.slots;
|
|
1236
|
-
seenStates.slots = new Int32Array(slots.length * 2);
|
|
1237
|
-
seenStates.shift--;
|
|
1238
|
-
for (let slot = 0; slot < slots.length; slot += 2) {
|
|
1239
|
-
if (slots[slot + 1] !== 0) insertSeen(slots[slot], slots[slot + 1]);
|
|
1240
|
-
}
|
|
1241
|
-
}
|
|
1242
|
-
insertSeen(hash, index + 1);
|
|
1243
|
-
};
|
|
1244
899
|
let unstoredFingerprint: Value[] | undefined;
|
|
1245
900
|
const countDistinctState = (depth: number) => {
|
|
1246
|
-
runtime.distinctStates = states.length + 1;
|
|
901
|
+
runtime.distinctStates = states.length + exploredStates.length + 1;
|
|
1247
902
|
searchDepth = Math.max(searchDepth, depth);
|
|
1248
903
|
runtime.diameter = Math.max(runtime.diameter, depth);
|
|
1249
904
|
};
|
|
@@ -1269,11 +924,42 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1269
924
|
livenessSource: -1,
|
|
1270
925
|
rebuilt: undefined,
|
|
1271
926
|
};
|
|
927
|
+
const traces = createTraceBuilder({
|
|
928
|
+
config,
|
|
929
|
+
options,
|
|
930
|
+
environment,
|
|
931
|
+
search,
|
|
932
|
+
nextActions,
|
|
933
|
+
current,
|
|
934
|
+
states,
|
|
935
|
+
fingerprintStates,
|
|
936
|
+
parents,
|
|
937
|
+
actions,
|
|
938
|
+
depths,
|
|
939
|
+
tracedSteps,
|
|
940
|
+
captureOutput,
|
|
941
|
+
getInitialStates: getSpecInitialStates,
|
|
942
|
+
findSuccessorAction,
|
|
943
|
+
});
|
|
1272
944
|
const getPath = (index: number): Value[][] =>
|
|
1273
945
|
index === -1 ? [] : [...getPath(parents[index]), states[index]];
|
|
946
|
+
// TLC adds a successor's fingerprint to its set before it checks the invariants of the successor.
|
|
1274
947
|
runtime.isSeen = (state) => {
|
|
1275
948
|
const fingerprintState = getFingerprintState(state);
|
|
1276
|
-
|
|
949
|
+
const hash = getStateHash(fingerprintState);
|
|
950
|
+
return (
|
|
951
|
+
findStateIndex(seenStates, hash, fingerprintState) !== -1 ||
|
|
952
|
+
isExplored(hash, fingerprintState) ||
|
|
953
|
+
(unstoredFingerprint !== undefined && isSameState(unstoredFingerprint, fingerprintState))
|
|
954
|
+
);
|
|
955
|
+
};
|
|
956
|
+
runtime.markExplored = (state) => {
|
|
957
|
+
const fingerprintState = getFingerprintState(state);
|
|
958
|
+
exploredTable ??= createStateTable(exploredFingerprintStates);
|
|
959
|
+
markSeenState(exploredTable, getStateHash(fingerprintState), exploredStates.length);
|
|
960
|
+
exploredStates.push(state);
|
|
961
|
+
exploredFingerprintStates.push(fingerprintState);
|
|
962
|
+
runtime.distinctStates++;
|
|
1277
963
|
};
|
|
1278
964
|
runtime.getBehavior = (state) => {
|
|
1279
965
|
const index = state === current.candidate ? -1 : states.indexOf(state);
|
|
@@ -1309,7 +995,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1309
995
|
formatState(
|
|
1310
996
|
config.alias === undefined
|
|
1311
997
|
? toRecord(state)
|
|
1312
|
-
: evaluateAlias(config.alias, state, undefined),
|
|
998
|
+
: search.evaluateAlias(config.alias, state, undefined, options.isTool ?? false),
|
|
1313
999
|
),
|
|
1314
1000
|
getText: () => formatState(toRecord(state)),
|
|
1315
1001
|
});
|
|
@@ -1328,7 +1014,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1328
1014
|
fingerprintModelState(fingerprintState);
|
|
1329
1015
|
state.forEach(markFingerprinted);
|
|
1330
1016
|
}
|
|
1331
|
-
const isSeen = isInModel && findStateIndex(hash, fingerprintState) !== -1;
|
|
1017
|
+
const isSeen = isInModel && findStateIndex(seenStates, hash, fingerprintState) !== -1;
|
|
1332
1018
|
if (isSeen) return undefined;
|
|
1333
1019
|
unstoredFingerprint = isInModel ? fingerprintState : undefined;
|
|
1334
1020
|
if (isInModel) {
|
|
@@ -1341,7 +1027,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1341
1027
|
search.getViolatedInvariants(state).forEach((invariant) =>
|
|
1342
1028
|
reportContinuedViolation("invariant-violation", {
|
|
1343
1029
|
name: invariant.name,
|
|
1344
|
-
...toTrace([{ action: undefined, state }], []),
|
|
1030
|
+
...traces.toTrace([{ action: undefined, state }], []),
|
|
1345
1031
|
}),
|
|
1346
1032
|
);
|
|
1347
1033
|
}
|
|
@@ -1349,21 +1035,44 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1349
1035
|
if (violated) {
|
|
1350
1036
|
return reportViolation("invariant-violation", {
|
|
1351
1037
|
name: violated.name,
|
|
1352
|
-
...toTrace([{ action: undefined, state }], []),
|
|
1038
|
+
...traces.toTrace([{ action: undefined, state }], []),
|
|
1353
1039
|
});
|
|
1354
1040
|
}
|
|
1355
1041
|
const failedPredicate = search.findFailedInitialPredicate(state);
|
|
1356
1042
|
if (failedPredicate) {
|
|
1357
1043
|
return reportViolation("liveness-violation", {
|
|
1358
1044
|
name: failedPredicate.name,
|
|
1359
|
-
...toTrace([{ action: undefined, state }], []),
|
|
1045
|
+
...traces.toTrace([{ action: undefined, state }], []),
|
|
1360
1046
|
});
|
|
1361
1047
|
}
|
|
1362
1048
|
if (!isInModel) return undefined;
|
|
1363
|
-
|
|
1049
|
+
markSeenState(seenStates, hash, states.length);
|
|
1364
1050
|
addState(state, fingerprintState, -1, undefined);
|
|
1365
1051
|
return undefined;
|
|
1366
1052
|
};
|
|
1053
|
+
// Looks a successor up, where the constraints keep it in the model, as the search does before it
|
|
1054
|
+
// checks the successor.
|
|
1055
|
+
const lookUpSuccessor = (state: Value[], successor: Successor) => {
|
|
1056
|
+
const fingerprintState = getFingerprintState(successor.state);
|
|
1057
|
+
const hash = getStateHash(fingerprintState);
|
|
1058
|
+
const foundIndex = findStateIndex(seenStates, hash, fingerprintState);
|
|
1059
|
+
const isStateInModel = search.satisfiesConstraints(successor.state, state);
|
|
1060
|
+
if (isStateInModel) search.trackStatePossible(successor.state);
|
|
1061
|
+
const isInModel = isStateInModel && search.satisfiesActionConstraints(state, successor.state);
|
|
1062
|
+
if (isInModel) {
|
|
1063
|
+
search.trackActionPossible(state, successor.state);
|
|
1064
|
+
fingerprintModelState(fingerprintState);
|
|
1065
|
+
successor.state.forEach(markFingerprinted);
|
|
1066
|
+
}
|
|
1067
|
+
const existing = isInModel ? foundIndex : -1;
|
|
1068
|
+
return {
|
|
1069
|
+
fingerprintState,
|
|
1070
|
+
hash,
|
|
1071
|
+
isInModel,
|
|
1072
|
+
existing,
|
|
1073
|
+
isSeen: existing !== -1 || (isInModel && isExplored(hash, fingerprintState)),
|
|
1074
|
+
};
|
|
1075
|
+
};
|
|
1367
1076
|
const visitSuccessor = (
|
|
1368
1077
|
index: number,
|
|
1369
1078
|
successor: Successor,
|
|
@@ -1376,27 +1085,16 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1376
1085
|
current.candidate = successor.state;
|
|
1377
1086
|
current.candidateLevel = depths[index] + 1;
|
|
1378
1087
|
if (isCanonicalizedFirst) canonicalizeState(successor.state);
|
|
1379
|
-
const
|
|
1380
|
-
|
|
1381
|
-
const foundIndex = findStateIndex(hash, fingerprintState);
|
|
1382
|
-
const isStateInModel = search.satisfiesConstraints(successor.state, state);
|
|
1383
|
-
if (isStateInModel) search.trackStatePossible(successor.state);
|
|
1384
|
-
const isInModel = isStateInModel && search.satisfiesActionConstraints(state, successor.state);
|
|
1385
|
-
if (isInModel) {
|
|
1386
|
-
search.trackActionPossible(state, successor.state);
|
|
1387
|
-
fingerprintModelState(fingerprintState);
|
|
1388
|
-
successor.state.forEach(markFingerprinted);
|
|
1389
|
-
}
|
|
1390
|
-
const existing = isInModel ? foundIndex : -1;
|
|
1391
|
-
if (source && isInModel) {
|
|
1088
|
+
const found = lookUpSuccessor(state, successor);
|
|
1089
|
+
if (source && found.isInModel) {
|
|
1392
1090
|
stateWriter?.writeSuccessor(
|
|
1393
1091
|
source,
|
|
1394
1092
|
getGraphState(successor.state, depths[index] + 1),
|
|
1395
|
-
|
|
1093
|
+
found.isSeen,
|
|
1396
1094
|
action && getGraphAction(action),
|
|
1397
1095
|
);
|
|
1398
1096
|
}
|
|
1399
|
-
if (source && !isInModel && options.dump?.constrained) {
|
|
1097
|
+
if (source && !found.isInModel && options.dump?.constrained) {
|
|
1400
1098
|
const excluded = getGraphState(successor.state, depths[index] + 1);
|
|
1401
1099
|
search
|
|
1402
1100
|
.getExcludingConstraints(state, successor.state)
|
|
@@ -1409,23 +1107,29 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1409
1107
|
),
|
|
1410
1108
|
);
|
|
1411
1109
|
}
|
|
1412
|
-
if (existing !== -1 && liveness) {
|
|
1413
|
-
const stored = states[existing];
|
|
1110
|
+
if (found.existing !== -1 && liveness) {
|
|
1111
|
+
const stored = states[found.existing];
|
|
1414
1112
|
const isStored = stored.every((value, position) => value === successor.state[position]);
|
|
1415
|
-
liveSuccessors.push({ index: existing, state: isStored ? stored : successor.state });
|
|
1113
|
+
liveSuccessors.push({ index: found.existing, state: isStored ? stored : successor.state });
|
|
1114
|
+
}
|
|
1115
|
+
if (found.isSeen && found.existing === -1 && liveness) {
|
|
1116
|
+
liveSuccessors.push({
|
|
1117
|
+
index: getPendingIndex(found.hash, found.fingerprintState),
|
|
1118
|
+
state: successor.state,
|
|
1119
|
+
});
|
|
1416
1120
|
}
|
|
1417
|
-
const isNew = isInModel &&
|
|
1121
|
+
const isNew = found.isInModel && !found.isSeen;
|
|
1418
1122
|
if (isNew && liveness) liveSuccessors.push({ index: states.length, state: successor.state });
|
|
1419
|
-
unstoredFingerprint = isNew ? fingerprintState : undefined;
|
|
1123
|
+
unstoredFingerprint = isNew ? found.fingerprintState : undefined;
|
|
1420
1124
|
if (isNew) {
|
|
1421
1125
|
countDistinctState(depths[index] + 1);
|
|
1422
1126
|
newStateCount++;
|
|
1423
1127
|
if (coverage) coverage.secondary[coveredNode]++;
|
|
1424
1128
|
}
|
|
1425
|
-
if (
|
|
1129
|
+
if (!found.isSeen) {
|
|
1426
1130
|
try {
|
|
1427
1131
|
const violated = search.findViolatedInvariant(successor.state, state);
|
|
1428
|
-
const violation = violated && { name: violated.name, ...getTrace(index, successor) };
|
|
1132
|
+
const violation = violated && { name: violated.name, ...traces.getTrace(index, successor) };
|
|
1429
1133
|
if (violation && !options.isContinued) {
|
|
1430
1134
|
return withOutDegrees(reportViolation("invariant-violation", violation));
|
|
1431
1135
|
}
|
|
@@ -1435,7 +1139,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1435
1139
|
const replay = captureOutput(() => replayNext(index));
|
|
1436
1140
|
return createFailureResult(
|
|
1437
1141
|
error,
|
|
1438
|
-
appendTraceOutput(getFailedTrace(index, successor), replay.lines),
|
|
1142
|
+
appendTraceOutput(traces.getFailedTrace(index, successor), replay.lines),
|
|
1439
1143
|
replay.result ?? { outDegrees: getFailureOutDegrees() },
|
|
1440
1144
|
);
|
|
1441
1145
|
}
|
|
@@ -1443,7 +1147,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1443
1147
|
const violatedProperty = search.findViolatedActionProperty(state, successor.state);
|
|
1444
1148
|
const propertyViolation = violatedProperty && {
|
|
1445
1149
|
name: violatedProperty.name,
|
|
1446
|
-
...getTrace(index, successor),
|
|
1150
|
+
...traces.getTrace(index, successor),
|
|
1447
1151
|
};
|
|
1448
1152
|
if (propertyViolation && !options.isContinued) {
|
|
1449
1153
|
return withOutDegrees(reportViolation("liveness-violation", propertyViolation));
|
|
@@ -1452,8 +1156,12 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1452
1156
|
if (!isNew) return undefined;
|
|
1453
1157
|
if (coverage) countCoverageVariables(coverage, successor.state);
|
|
1454
1158
|
if (!isCanonicalizedFirst) canonicalizeState(successor.state);
|
|
1455
|
-
|
|
1456
|
-
|
|
1159
|
+
markSeenState(seenStates, found.hash, states.length);
|
|
1160
|
+
if (pendingStates) {
|
|
1161
|
+
const pending = findStateIndex(pendingStates, found.hash, found.fingerprintState);
|
|
1162
|
+
if (pending !== -1) liveness?.storeState(-2 - pending, states.length);
|
|
1163
|
+
}
|
|
1164
|
+
addState(successor.state, found.fingerprintState, index, successor.action);
|
|
1457
1165
|
runtime.queueSize++;
|
|
1458
1166
|
return undefined;
|
|
1459
1167
|
};
|
|
@@ -1466,6 +1174,58 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1466
1174
|
const assumptionViolation = findViolatedAssumption();
|
|
1467
1175
|
if (assumptionViolation) return createResult("assumption-violation", assumptionViolation);
|
|
1468
1176
|
options.onProgress?.({ kind: "initial-states-started" });
|
|
1177
|
+
const typedChecks =
|
|
1178
|
+
!options.isContinued &&
|
|
1179
|
+
options.dump === undefined &&
|
|
1180
|
+
// A set of small integers on the tier is a 31-bit mask, which a lower bound could overflow.
|
|
1181
|
+
options.maxSetSize === undefined &&
|
|
1182
|
+
!hasPostconditions
|
|
1183
|
+
? search.getTypedChecks(liveness?.solutions)
|
|
1184
|
+
: undefined;
|
|
1185
|
+
const typed =
|
|
1186
|
+
typedChecks &&
|
|
1187
|
+
runTypedSearch(environment, {
|
|
1188
|
+
...typedChecks,
|
|
1189
|
+
isDeadlockChecked: config.checkDeadlock,
|
|
1190
|
+
isFingerprinted: !options.isFingerprintDistanceSkipped,
|
|
1191
|
+
livenessCheck: options.livenessCheck ?? "default",
|
|
1192
|
+
});
|
|
1193
|
+
if (typed && !typed.deadlock && !typed.violation && !typed.lasso) {
|
|
1194
|
+
for (let count = 2; count < typed.initialStates.generated; count *= 2) {
|
|
1195
|
+
reportInitialStatesProgress(count, options.onProgress);
|
|
1196
|
+
}
|
|
1197
|
+
options.onProgress?.({ kind: "initial-states-computed", initialStates: typed.initialStates });
|
|
1198
|
+
const statistics = {
|
|
1199
|
+
...createResult("success"),
|
|
1200
|
+
generatedStates: typed.generatedStates,
|
|
1201
|
+
distinctStates: typed.distinctStates,
|
|
1202
|
+
queuedStates: 0,
|
|
1203
|
+
depth: typed.generatedStates === 0 ? 0 : Math.max(typed.depth, 1),
|
|
1204
|
+
initialStates: typed.initialStates,
|
|
1205
|
+
};
|
|
1206
|
+
if (liveness && options.livenessCheck !== "off") {
|
|
1207
|
+
options.onProgress?.({
|
|
1208
|
+
kind: "liveness-started",
|
|
1209
|
+
branches: liveness.branches,
|
|
1210
|
+
isComplete: true,
|
|
1211
|
+
// The tier stores and expands every successor, so the graph of each branch has every state.
|
|
1212
|
+
states: liveness.branches * typed.distinctStates,
|
|
1213
|
+
statistics,
|
|
1214
|
+
});
|
|
1215
|
+
options.onProgress?.({ kind: "liveness-finished" });
|
|
1216
|
+
}
|
|
1217
|
+
return {
|
|
1218
|
+
...statistics,
|
|
1219
|
+
outDegrees: typed.outDegrees,
|
|
1220
|
+
fingerprintDistance: options.isFingerprintDistanceSkipped
|
|
1221
|
+
? undefined
|
|
1222
|
+
: getFingerprintDistance(
|
|
1223
|
+
typed.distinctStates,
|
|
1224
|
+
typed.generatedStates,
|
|
1225
|
+
typed.forEachFingerprintRun,
|
|
1226
|
+
),
|
|
1227
|
+
};
|
|
1228
|
+
}
|
|
1469
1229
|
if (spec.init !== undefined) {
|
|
1470
1230
|
let overflowState: Value[] | undefined;
|
|
1471
1231
|
const reportInitialFailure = (error: unknown, state: Value[]) => {
|
|
@@ -1473,7 +1233,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1473
1233
|
return createFailureResult(
|
|
1474
1234
|
error,
|
|
1475
1235
|
{ trace: [], traceOutput: replay.lines },
|
|
1476
|
-
{ initialState: state, ...replay.result,
|
|
1236
|
+
{ initialState: state, ...replay.result, phase: "initial" },
|
|
1477
1237
|
);
|
|
1478
1238
|
};
|
|
1479
1239
|
try {
|
|
@@ -1500,9 +1260,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1500
1260
|
(state) => {
|
|
1501
1261
|
if (onInitialState(state)) throw STOP_WALK;
|
|
1502
1262
|
},
|
|
1503
|
-
|
|
1504
|
-
throw setExitCode(new TlaIllegalStateError([...partial]), EXIT_STATUS.error);
|
|
1505
|
-
},
|
|
1263
|
+
rejectIncompleteInitialState,
|
|
1506
1264
|
);
|
|
1507
1265
|
} catch (error) {
|
|
1508
1266
|
if (error !== STOP_WALK) throw error;
|
|
@@ -1529,7 +1287,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1529
1287
|
return createFailureResult(
|
|
1530
1288
|
error,
|
|
1531
1289
|
{ trace: [], traceOutput: replay.lines },
|
|
1532
|
-
{ ...replay.result,
|
|
1290
|
+
{ ...replay.result, phase: "initial" },
|
|
1533
1291
|
);
|
|
1534
1292
|
}
|
|
1535
1293
|
}
|
|
@@ -1589,7 +1347,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1589
1347
|
);
|
|
1590
1348
|
}
|
|
1591
1349
|
let isStopped = false;
|
|
1592
|
-
return
|
|
1350
|
+
return nextActions.reduce((count, action) => {
|
|
1593
1351
|
if (isStopped) return count;
|
|
1594
1352
|
return (
|
|
1595
1353
|
count +
|
|
@@ -1610,7 +1368,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1610
1368
|
};
|
|
1611
1369
|
const getLiveCallStack = (index: number, liveSuccessors: LiveSuccessor[]) => {
|
|
1612
1370
|
if (!liveness || is174) return undefined;
|
|
1613
|
-
const replay = getReplayFailure((tracing) =>
|
|
1371
|
+
const replay = getReplayFailure(environment, (tracing) =>
|
|
1614
1372
|
liveness.addState(index, states[index], liveSuccessors, tracing),
|
|
1615
1373
|
);
|
|
1616
1374
|
return replay?.callStack.length && !replay.fingerprint ? replay.callStack : undefined;
|
|
@@ -1627,14 +1385,14 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1627
1385
|
const replayFailedNext = (index: number, liveSuccessors: LiveSuccessor[]) => {
|
|
1628
1386
|
const live = captureOutput(() => addFailedLiveState(index, liveSuccessors));
|
|
1629
1387
|
if (live.result) {
|
|
1630
|
-
const result = { callStack: live.result
|
|
1388
|
+
const result: FailureOptions = { phase: "behavior-graph", callStack: live.result };
|
|
1631
1389
|
return { result, lines: live.lines };
|
|
1632
1390
|
}
|
|
1633
1391
|
const replay = captureOutput(() => replayNext(index));
|
|
1634
1392
|
return { result: replay.result, lines: [...live.lines, ...replay.lines] };
|
|
1635
1393
|
};
|
|
1636
1394
|
const reportNextStateOverflow = (index: number) =>
|
|
1637
|
-
createFailureResult(createStackOverflowError(), getStateTrace(index), {
|
|
1395
|
+
createFailureResult(createStackOverflowError(), traces.getStateTrace(index), { phase: "next" });
|
|
1638
1396
|
const reportNextStateFailure = (
|
|
1639
1397
|
error: unknown,
|
|
1640
1398
|
index: number,
|
|
@@ -1644,8 +1402,8 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1644
1402
|
const replay = replayFailedNext(index, liveSuccessors);
|
|
1645
1403
|
return createFailureResult(
|
|
1646
1404
|
withNextStateExitCode(error),
|
|
1647
|
-
appendTraceOutput(getStateTrace(index), replay.lines),
|
|
1648
|
-
{
|
|
1405
|
+
appendTraceOutput(traces.getStateTrace(index), replay.lines),
|
|
1406
|
+
{ phase: "next", ...replay.result },
|
|
1649
1407
|
);
|
|
1650
1408
|
};
|
|
1651
1409
|
const expandState = (index: number, liveSuccessors: LiveSuccessor[]) => {
|
|
@@ -1676,7 +1434,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1676
1434
|
outcome = createFailureResult(
|
|
1677
1435
|
new TlaEvaluationError(`${getWrappedException(error)}${error.message}`, error),
|
|
1678
1436
|
appendTraceOutput({ trace: [] }, replay.lines),
|
|
1679
|
-
{
|
|
1437
|
+
{ phase: "next", ...replay.result },
|
|
1680
1438
|
);
|
|
1681
1439
|
return true;
|
|
1682
1440
|
}
|
|
@@ -1693,10 +1451,10 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1693
1451
|
outcome = createFailureResult(
|
|
1694
1452
|
error,
|
|
1695
1453
|
appendTraceOutput(
|
|
1696
|
-
traceFailure ? getStateTrace(index) : getFailedTrace(index, successor),
|
|
1454
|
+
traceFailure ? traces.getStateTrace(index) : traces.getFailedTrace(index, successor),
|
|
1697
1455
|
replay.lines,
|
|
1698
1456
|
),
|
|
1699
|
-
{
|
|
1457
|
+
{ phase: "next", ...replay.result, traceFailure },
|
|
1700
1458
|
);
|
|
1701
1459
|
}
|
|
1702
1460
|
return outcome !== undefined;
|
|
@@ -1708,6 +1466,8 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1708
1466
|
return {
|
|
1709
1467
|
...result,
|
|
1710
1468
|
violation: appendTraceOutput(result.violation, live.lines),
|
|
1469
|
+
// TLC adds the state to the behavior graph before it reports the coverage.
|
|
1470
|
+
coverage: getCoverage(),
|
|
1711
1471
|
...(live.result && { liveCallStack: live.result }),
|
|
1712
1472
|
};
|
|
1713
1473
|
}
|
|
@@ -1718,7 +1478,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1718
1478
|
}
|
|
1719
1479
|
const accepted = liveness?.addState(index, state, liveSuccessors);
|
|
1720
1480
|
if (!liveness || !accepted) return undefined;
|
|
1721
|
-
const steps = getPathSteps(accepted);
|
|
1481
|
+
const steps = traces.getPathSteps(accepted);
|
|
1722
1482
|
const properties = getViolatedProperties(
|
|
1723
1483
|
liveness,
|
|
1724
1484
|
steps.map((step) => step.state),
|
|
@@ -1727,11 +1487,14 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1727
1487
|
return reportViolation("property-violation", {
|
|
1728
1488
|
name: properties[0],
|
|
1729
1489
|
properties,
|
|
1730
|
-
...toTrace(steps, accepted, { known: 0 }),
|
|
1490
|
+
...traces.toTrace(steps, accepted, { known: 0 }),
|
|
1731
1491
|
});
|
|
1732
1492
|
};
|
|
1733
1493
|
if (successorCount === 0 && config.checkDeadlock) {
|
|
1734
|
-
const deadlock = reportViolation("deadlock", {
|
|
1494
|
+
const deadlock = reportViolation("deadlock", {
|
|
1495
|
+
name: "deadlock",
|
|
1496
|
+
...traces.getStateTrace(index),
|
|
1497
|
+
});
|
|
1735
1498
|
const live = captureOutput(() => {
|
|
1736
1499
|
try {
|
|
1737
1500
|
return { additional: addLiveState()?.violation };
|
|
@@ -1764,14 +1527,13 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1764
1527
|
{ outDegrees: getFailureOutDegrees() },
|
|
1765
1528
|
);
|
|
1766
1529
|
}
|
|
1767
|
-
const replay = getReplayFailure((tracing) =>
|
|
1530
|
+
const replay = getReplayFailure(environment, (tracing) =>
|
|
1768
1531
|
liveness?.addState(index, state, liveSuccessors, tracing),
|
|
1769
1532
|
);
|
|
1770
|
-
return createFailureResult(error, getStateTrace(index), {
|
|
1533
|
+
return createFailureResult(error, traces.getStateTrace(index), {
|
|
1771
1534
|
outDegrees: getFailureOutDegrees(),
|
|
1772
1535
|
callStack: replay?.callStack.length ? replay.callStack : undefined,
|
|
1773
|
-
|
|
1774
|
-
isCallStackFirst: true,
|
|
1536
|
+
phase: "liveness",
|
|
1775
1537
|
});
|
|
1776
1538
|
}
|
|
1777
1539
|
};
|
|
@@ -1795,8 +1557,8 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1795
1557
|
const reportLasso = (checker: LivenessChecker, lasso: Lasso) => {
|
|
1796
1558
|
const path = [...lasso.prefix, ...lasso.cycle];
|
|
1797
1559
|
const loopStart = lasso.prefix.length;
|
|
1798
|
-
const steps = getPathSteps(path, loopStart);
|
|
1799
|
-
const trace = toTrace(steps, path, { loopStart, known: 0 }).trace;
|
|
1560
|
+
const steps = traces.getPathSteps(path, loopStart);
|
|
1561
|
+
const trace = traces.toTrace(steps, path, { loopStart, known: 0 }).trace;
|
|
1800
1562
|
const properties = getViolatedProperties(
|
|
1801
1563
|
checker,
|
|
1802
1564
|
steps.map((step) => step.state),
|
|
@@ -1808,7 +1570,9 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1808
1570
|
const loop =
|
|
1809
1571
|
cycleStart === cycleEnd
|
|
1810
1572
|
? { result: undefined, lines: [] }
|
|
1811
|
-
: captureOutput(() =>
|
|
1573
|
+
: captureOutput(() =>
|
|
1574
|
+
traces.findStepAction(cycleEnd, lastState, states[cycleStart], false),
|
|
1575
|
+
);
|
|
1812
1576
|
const isStutteringWarned = cycleStart === cycleEnd && lasso.isCycleConstrained;
|
|
1813
1577
|
return reportViolation(
|
|
1814
1578
|
"liveness-violation",
|
|
@@ -1826,36 +1590,147 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1826
1590
|
? getStepAction(trace[trace.length - 1])
|
|
1827
1591
|
: loop.result
|
|
1828
1592
|
? toActionValue(loop.result)
|
|
1829
|
-
: createActionRecord(
|
|
1593
|
+
: createActionRecord(
|
|
1594
|
+
traces.findSuccessorWithFingerprint(lastState, cycleStart)?.action,
|
|
1595
|
+
),
|
|
1830
1596
|
);
|
|
1831
1597
|
};
|
|
1832
1598
|
const isPeriodic = liveness !== undefined && (options.livenessCheck ?? "default") === "default";
|
|
1833
1599
|
const startedAt = performance.now();
|
|
1834
1600
|
const periodic = {
|
|
1835
1601
|
at: startedAt + PERIODIC_START,
|
|
1836
|
-
size
|
|
1602
|
+
// The size of each branch's graph when TLC last checked it, which starts at 1.
|
|
1603
|
+
sizes: liveness?.getStateCounts().map(() => 1) ?? [],
|
|
1837
1604
|
time: 0,
|
|
1838
1605
|
coverageCount: Math.trunc(options.coverage ?? 0),
|
|
1839
1606
|
};
|
|
1840
|
-
|
|
1607
|
+
// TLC counts the states of the graphs of all branches, which can differ.
|
|
1608
|
+
const getGraphStates = (checker: LivenessChecker) =>
|
|
1609
|
+
checker.getStateCounts().reduce((sum, count) => sum + count, 0);
|
|
1610
|
+
const findPeriodicViolation = (checker: LivenessChecker) => {
|
|
1841
1611
|
const now = performance.now();
|
|
1842
|
-
const
|
|
1612
|
+
const counts = checker.getStateCounts();
|
|
1613
|
+
const isGrown = counts.some(
|
|
1614
|
+
(count, branch) =>
|
|
1615
|
+
(count - periodic.sizes[branch]) / periodic.sizes[branch] > LIVENESS_GROWTH,
|
|
1616
|
+
);
|
|
1843
1617
|
if (!isGrown || periodic.time > (now - startedAt) * LIVENESS_RATIO) return undefined;
|
|
1844
|
-
periodic.
|
|
1845
|
-
if (!liveness) return undefined;
|
|
1618
|
+
periodic.sizes = counts;
|
|
1846
1619
|
options.onProgress?.({
|
|
1847
1620
|
kind: "liveness-started",
|
|
1848
|
-
branches:
|
|
1621
|
+
branches: checker.branches,
|
|
1849
1622
|
isComplete: false,
|
|
1850
|
-
states:
|
|
1623
|
+
states: getGraphStates(checker),
|
|
1851
1624
|
statistics: createResult("success"),
|
|
1852
1625
|
});
|
|
1853
|
-
const lasso =
|
|
1626
|
+
const lasso = checker.findViolation();
|
|
1854
1627
|
if (!lasso) options.onProgress?.({ kind: "liveness-finished" });
|
|
1855
1628
|
periodic.time += performance.now() - now;
|
|
1856
1629
|
return lasso;
|
|
1857
1630
|
};
|
|
1858
|
-
|
|
1631
|
+
const adoptTypedSearch = (searched: TypedResult) => {
|
|
1632
|
+
runtime.generatedStates = searched.generatedStates;
|
|
1633
|
+
runtime.distinctStates = searched.distinctStates;
|
|
1634
|
+
runtime.queueSize = searched.queuedStates;
|
|
1635
|
+
runtime.diameter = searched.depth;
|
|
1636
|
+
searchDepth = searched.depth;
|
|
1637
|
+
outDegrees.splice(0, outDegrees.length, ...searched.outDegrees);
|
|
1638
|
+
newStateCount = 0;
|
|
1639
|
+
};
|
|
1640
|
+
// The tier found a state without successors, or a successor that violates an invariant or an
|
|
1641
|
+
// action property. The interpreter rebuilds the tier's path to it and reports it, as it would after
|
|
1642
|
+
// its own search.
|
|
1643
|
+
const path = typed?.deadlock ?? typed?.violation;
|
|
1644
|
+
const initialIndex = path ? states.findIndex((state) => path.isPathState(0, state)) : -1;
|
|
1645
|
+
if (typed && path && initialIndex !== -1) {
|
|
1646
|
+
const steps: { successor: Successor; action: SpecAction | undefined }[] = [];
|
|
1647
|
+
const getLastState = () => steps.at(-1)?.successor.state ?? states[initialIndex];
|
|
1648
|
+
for (let position = 1; position === steps.length + 1 && position < path.length; position++) {
|
|
1649
|
+
// The interpreter expands only the states it stores, which it has canonicalized.
|
|
1650
|
+
canonicalizeState(getLastState());
|
|
1651
|
+
forEachActionSuccessor(getLastState(), undefined, (successor, action) => {
|
|
1652
|
+
if (!path.isPathState(position, successor.state)) return false;
|
|
1653
|
+
steps.push({ successor, action });
|
|
1654
|
+
return true;
|
|
1655
|
+
});
|
|
1656
|
+
}
|
|
1657
|
+
const isRebuilt = steps.length === path.length - 1;
|
|
1658
|
+
const violating = typed.violation && isRebuilt ? steps.pop() : undefined;
|
|
1659
|
+
if (violating && isCanonicalizedFirst) canonicalizeState(violating.successor.state);
|
|
1660
|
+
const violatedInvariant =
|
|
1661
|
+
violating && search.findViolatedInvariant(violating.successor.state, getLastState());
|
|
1662
|
+
const violatedProperty =
|
|
1663
|
+
violating &&
|
|
1664
|
+
!violatedInvariant &&
|
|
1665
|
+
search.findViolatedActionProperty(getLastState(), violating.successor.state);
|
|
1666
|
+
const violated = violatedInvariant ?? violatedProperty;
|
|
1667
|
+
const isDeadlocked =
|
|
1668
|
+
typed.deadlock !== undefined &&
|
|
1669
|
+
isRebuilt &&
|
|
1670
|
+
forEachActionSuccessor(getLastState(), undefined, () => true) === 0;
|
|
1671
|
+
if (isDeadlocked || violated) {
|
|
1672
|
+
const parent = { index: initialIndex };
|
|
1673
|
+
for (const step of steps) {
|
|
1674
|
+
visitSuccessor(parent.index, step.successor, [], undefined, step.action);
|
|
1675
|
+
parent.index = states.length - 1;
|
|
1676
|
+
}
|
|
1677
|
+
adoptTypedSearch(typed);
|
|
1678
|
+
Object.assign(current, { index: parent.index, candidate: undefined, isExpanding: true });
|
|
1679
|
+
if (violating && violated) {
|
|
1680
|
+
lookUpSuccessor(states[parent.index], violating.successor);
|
|
1681
|
+
current.candidate = violating.successor.state;
|
|
1682
|
+
current.candidateLevel = depths[parent.index] + 1;
|
|
1683
|
+
return withOutDegrees(
|
|
1684
|
+
reportViolation(violatedInvariant ? "invariant-violation" : "liveness-violation", {
|
|
1685
|
+
name: violated.name,
|
|
1686
|
+
...traces.getTrace(parent.index, violating.successor),
|
|
1687
|
+
}),
|
|
1688
|
+
);
|
|
1689
|
+
}
|
|
1690
|
+
const result = expandState(parent.index, []);
|
|
1691
|
+
if (result) return result;
|
|
1692
|
+
}
|
|
1693
|
+
}
|
|
1694
|
+
// The tier found a behavior that violates a temporal property after its whole search. The
|
|
1695
|
+
// interpreter stores the paths to the lasso's states and reports it, as it would after its own.
|
|
1696
|
+
const lassoSteps = new Map<number, { successor: Successor; action: SpecAction | undefined }>();
|
|
1697
|
+
for (const entry of typed?.lasso?.states ?? []) {
|
|
1698
|
+
const initial = entry.parent === -1 ? states.find(entry.isState) : undefined;
|
|
1699
|
+
if (initial) {
|
|
1700
|
+
lassoSteps.set(entry.index, {
|
|
1701
|
+
successor: { state: initial, action: undefined },
|
|
1702
|
+
action: undefined,
|
|
1703
|
+
});
|
|
1704
|
+
}
|
|
1705
|
+
const parent = lassoSteps.get(entry.parent)?.successor.state;
|
|
1706
|
+
if (!parent) continue;
|
|
1707
|
+
// The interpreter expands only the states it stores, which it has canonicalized.
|
|
1708
|
+
canonicalizeState(parent);
|
|
1709
|
+
forEachActionSuccessor(parent, undefined, (successor, action) => {
|
|
1710
|
+
if (!entry.isState(successor.state)) return false;
|
|
1711
|
+
lassoSteps.set(entry.index, { successor, action });
|
|
1712
|
+
return true;
|
|
1713
|
+
});
|
|
1714
|
+
}
|
|
1715
|
+
const lassoIndexes = new Map<number, number>();
|
|
1716
|
+
const typedLasso =
|
|
1717
|
+
typed?.lasso && lassoSteps.size === typed.lasso.states.length ? typed.lasso : undefined;
|
|
1718
|
+
typedLasso?.states.forEach((entry) => {
|
|
1719
|
+
const step = lassoSteps.get(entry.index);
|
|
1720
|
+
const parent = lassoIndexes.get(entry.parent);
|
|
1721
|
+
if (step && parent !== undefined)
|
|
1722
|
+
visitSuccessor(parent, step.successor, [], undefined, step.action);
|
|
1723
|
+
lassoIndexes.set(
|
|
1724
|
+
entry.index,
|
|
1725
|
+
parent === undefined ? states.findIndex(entry.isState) : states.length - 1,
|
|
1726
|
+
);
|
|
1727
|
+
});
|
|
1728
|
+
if (typed && typedLasso) adoptTypedSearch(typed);
|
|
1729
|
+
for (
|
|
1730
|
+
let index = typedLasso ? states.length : 0;
|
|
1731
|
+
index < states.length && !runtime.isStopped;
|
|
1732
|
+
index++
|
|
1733
|
+
) {
|
|
1859
1734
|
current.index = index;
|
|
1860
1735
|
current.candidate = undefined;
|
|
1861
1736
|
runtime.queueSize = states.length - index - 1;
|
|
@@ -1874,7 +1749,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1874
1749
|
newStateCount = 0;
|
|
1875
1750
|
if ((isPeriodic || options.onProgress) && performance.now() >= periodic.at) {
|
|
1876
1751
|
periodic.at = performance.now() + PROGRESS_INTERVAL;
|
|
1877
|
-
const lasso = isPeriodic ? findPeriodicViolation(
|
|
1752
|
+
const lasso = isPeriodic && liveness ? findPeriodicViolation(liveness) : undefined;
|
|
1878
1753
|
if (liveness && lasso) return reportLasso(liveness, lasso);
|
|
1879
1754
|
const isCoverageDue = options.coverage !== undefined && periodic.coverageCount === 0;
|
|
1880
1755
|
periodic.coverageCount = isCoverageDue
|
|
@@ -1896,11 +1771,22 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1896
1771
|
kind: "liveness-started",
|
|
1897
1772
|
branches: finalLiveness.branches,
|
|
1898
1773
|
isComplete: true,
|
|
1899
|
-
|
|
1774
|
+
// The tier that found the lasso stored and expanded every successor, so each graph has every state.
|
|
1775
|
+
states: typedLasso
|
|
1776
|
+
? finalLiveness.branches * runtime.distinctStates
|
|
1777
|
+
: getGraphStates(finalLiveness),
|
|
1900
1778
|
statistics: createResult("success"),
|
|
1901
1779
|
});
|
|
1902
1780
|
}
|
|
1903
|
-
const
|
|
1781
|
+
const getLassoIndexes = (indexes: number[]) =>
|
|
1782
|
+
indexes.map((index) => lassoIndexes.get(index) ?? -1);
|
|
1783
|
+
const lasso = typedLasso
|
|
1784
|
+
? {
|
|
1785
|
+
prefix: getLassoIndexes(typedLasso.prefix),
|
|
1786
|
+
cycle: getLassoIndexes(typedLasso.cycle),
|
|
1787
|
+
isCycleConstrained: typedLasso.isCycleConstrained,
|
|
1788
|
+
}
|
|
1789
|
+
: finalLiveness?.findViolation();
|
|
1904
1790
|
if (finalLiveness && lasso) return reportLasso(finalLiveness, lasso);
|
|
1905
1791
|
|
|
1906
1792
|
if (finalLiveness) options.onProgress?.({ kind: "liveness-finished" });
|