tla-ts 0.0.9 → 0.0.10-dev.28c823e4b
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 +29 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +28 -28
- package/dist/deciders.js +43 -43
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +106 -10
- package/dist/index.d.ts +106 -10
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +116 -36
- package/dist/prove.js +116 -36
- package/dist/run.cjs +143 -31
- package/dist/run.js +143 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +129 -104
- package/dist/transfer.js +129 -104
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +3 -1
- package/src/ast.ts +4 -23
- package/src/bags.ts +99 -102
- package/src/builtins.ts +40 -78
- package/src/bundled-modules.ts +1 -8
- package/src/check.ts +599 -388
- package/src/cli/options.ts +11 -6
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -0
- package/src/cli/shared.ts +18 -11
- package/src/cli/tlapm.ts +0 -12
- package/src/cli/tlc-arguments.ts +640 -0
- package/src/cli/tlc-usage.ts +361 -0
- package/src/cli/tlc.ts +538 -220
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +4 -16
- package/src/cli.ts +0 -1
- package/src/codegen.ts +191 -64
- package/src/config.ts +140 -109
- package/src/coverage.ts +837 -0
- package/src/dependencies.ts +6 -40
- package/src/dfid.ts +618 -0
- package/src/environment.ts +240 -118
- package/src/errors.ts +70 -55
- package/src/evaluate.ts +596 -339
- package/src/exit-codes.ts +37 -3
- package/src/fingerprints.ts +10 -10
- package/src/index.ts +3 -0
- package/src/instances.ts +79 -11
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +255 -139
- package/src/levels.ts +8 -17
- package/src/lexer.ts +80 -100
- package/src/liveness-checker.ts +82 -119
- package/src/liveness.ts +112 -64
- package/src/obligations/action.ts +4 -28
- package/src/obligations/anonymize.ts +84 -80
- package/src/obligations/equality.ts +1 -1
- package/src/obligations/expression.ts +2 -19
- package/src/obligations/format.ts +1 -9
- package/src/obligations/generate.ts +1 -11
- package/src/obligations/index.ts +0 -11
- package/src/obligations/levels.ts +4 -8
- package/src/obligations/module.ts +1 -15
- package/src/obligations/normalize.ts +5 -24
- package/src/obligations/operators.ts +1 -2
- package/src/obligations/pragma.ts +1 -10
- package/src/obligations/printer.ts +47 -46
- package/src/obligations/proof.ts +1 -5
- package/src/obligations/regroup.ts +1 -4
- package/src/obligations/simplify.ts +3 -14
- package/src/obligations/source.ts +1 -21
- package/src/obligations/subexpression.ts +5 -11
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +8 -14
- package/src/obligations/tuples.ts +3 -9
- package/src/parallel-worker.ts +29 -39
- package/src/parallel.ts +53 -44
- package/src/parser.ts +565 -282
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +5 -10
- package/src/prover/deciders.ts +0 -4
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +0 -6
- package/src/prover/isabelle/encode.ts +11 -23
- package/src/prover/isabelle/isar/inner-syntax.ts +108 -114
- package/src/prover/isabelle/isar/method.ts +25 -38
- package/src/prover/isabelle/isar/proof.ts +1 -10
- package/src/prover/isabelle/isar/statement.ts +1 -6
- package/src/prover/isabelle/isar/theory.ts +15 -26
- package/src/prover/isabelle/isar/type-check.ts +11 -25
- package/src/prover/isabelle/provers/blast/blast.ts +10 -41
- package/src/prover/isabelle/provers/blast/branch.ts +1 -32
- package/src/prover/isabelle/provers/blast/prove.ts +1 -35
- package/src/prover/isabelle/provers/blast/rules.ts +6 -44
- package/src/prover/isabelle/provers/blast/state.ts +2 -28
- package/src/prover/isabelle/provers/blast/term.ts +9 -36
- package/src/prover/isabelle/provers/clasimp.ts +1 -13
- package/src/prover/isabelle/provers/classical.ts +14 -42
- package/src/prover/isabelle/provers/hypsubst.ts +11 -25
- package/src/prover/isabelle/pure/bicompose.ts +16 -13
- package/src/prover/isabelle/pure/consts.ts +1 -7
- package/src/prover/isabelle/pure/conv.ts +1 -9
- package/src/prover/isabelle/pure/drule.ts +24 -40
- package/src/prover/isabelle/pure/envir.ts +3 -52
- package/src/prover/isabelle/pure/goal.ts +1 -7
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +1 -14
- package/src/prover/isabelle/pure/name.ts +2 -9
- package/src/prover/isabelle/pure/net.ts +3 -59
- package/src/prover/isabelle/pure/object-logic.ts +3 -10
- package/src/prover/isabelle/pure/pattern.ts +2 -19
- package/src/prover/isabelle/pure/raw-simplifier.ts +13 -49
- package/src/prover/isabelle/pure/rewriter.ts +26 -58
- package/src/prover/isabelle/pure/search.ts +3 -10
- package/src/prover/isabelle/pure/seq.ts +1 -10
- package/src/prover/isabelle/pure/simplifier.ts +4 -12
- package/src/prover/isabelle/pure/table.ts +1 -31
- package/src/prover/isabelle/pure/tactic.ts +12 -22
- package/src/prover/isabelle/pure/tactical.ts +6 -12
- package/src/prover/isabelle/pure/term-ord.ts +2 -6
- package/src/prover/isabelle/pure/term.ts +2 -43
- package/src/prover/isabelle/pure/thm.ts +13 -36
- package/src/prover/isabelle/pure/type.ts +2 -15
- package/src/prover/isabelle/pure/unify.ts +20 -30
- package/src/prover/isabelle/pure/variable.ts +3 -7
- package/src/prover/isabelle/tla/classical-setup.ts +9 -19
- package/src/prover/isabelle/tla/context.ts +8 -16
- package/src/prover/isabelle/tla/logic.ts +4 -11
- package/src/prover/isabelle/tla/simpdata.ts +46 -34
- package/src/prover/isabelle/tools/intuitionistic.ts +1 -10
- package/src/prover/ocaml.ts +0 -6
- package/src/prover/prep/action.ts +4 -36
- package/src/prover/prep/enabled-axioms.ts +12 -19
- package/src/prover/prep/fingerprint.ts +0 -16
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +9 -36
- package/src/prover/prep/normalize.ts +4 -28
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +0 -36
- package/src/prover/ptl/decide.ts +7 -12
- package/src/prover/ptl/encode.ts +14 -36
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +12 -26
- package/src/prover/smt/axioms.ts +0 -7
- package/src/prover/smt/context.ts +19 -26
- package/src/prover/smt/data.ts +51 -54
- package/src/prover/smt/encode.ts +14 -35
- package/src/prover/smt/extensionality.ts +0 -10
- package/src/prover/smt/flatten.ts +3 -22
- package/src/prover/smt/format.ts +5 -10
- package/src/prover/smt/instances.ts +0 -10
- package/src/prover/smt/rewrite.ts +66 -101
- package/src/prover/smt/solver/act-cache.ts +0 -15
- package/src/prover/smt/solver/arith-rewriter.ts +3 -48
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +1 -43
- package/src/prover/smt/solver/ast-lt.ts +1 -11
- package/src/prover/smt/solver/ast-util.ts +1 -6
- package/src/prover/smt/solver/ast.ts +1 -143
- package/src/prover/smt/solver/auf-solver.ts +6 -39
- package/src/prover/smt/solver/case-split-queue.ts +1 -9
- package/src/prover/smt/solver/cg-table.ts +1 -18
- package/src/prover/smt/solver/clause.ts +1 -27
- package/src/prover/smt/solver/conflict-resolution.ts +0 -9
- package/src/prover/smt/solver/context.ts +4 -61
- package/src/prover/smt/solver/ctx-simplify.ts +14 -41
- package/src/prover/smt/solver/der.ts +2 -21
- package/src/prover/smt/solver/dyn-ack.ts +1 -11
- package/src/prover/smt/solver/e-matching.ts +3 -34
- package/src/prover/smt/solver/enode.ts +1 -21
- package/src/prover/smt/solver/expr-ref.ts +1 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +0 -5
- package/src/prover/smt/solver/fingerprints.ts +1 -12
- package/src/prover/smt/solver/flat-literals.ts +1 -9
- package/src/prover/smt/solver/goal.ts +2 -14
- package/src/prover/smt/solver/hash.ts +0 -8
- package/src/prover/smt/solver/hashtable.ts +1 -12
- package/src/prover/smt/solver/internalizer.ts +6 -98
- package/src/prover/smt/solver/lbool.ts +1 -2
- package/src/prover/smt/solver/literal.ts +0 -3
- package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
- package/src/prover/smt/solver/lp/constraints.ts +2 -8
- package/src/prover/smt/solver/lp/containers.ts +12 -30
- package/src/prover/smt/solver/lp/core-solver.ts +10 -31
- package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
- package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
- package/src/prover/smt/solver/lp/dependency.ts +1 -4
- package/src/prover/smt/solver/lp/dioph-eq.ts +12 -98
- package/src/prover/smt/solver/lp/explanation.ts +1 -6
- package/src/prover/smt/solver/lp/gomory.ts +9 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
- package/src/prover/smt/solver/lp/hnf.ts +11 -26
- package/src/prover/smt/solver/lp/int-cube.ts +15 -36
- package/src/prover/smt/solver/lp/int-solver.ts +4 -34
- package/src/prover/smt/solver/lp/lar-solver.ts +32 -81
- package/src/prover/smt/solver/lp/lar-term.ts +1 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +20 -45
- package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
- package/src/prover/smt/solver/lp/nex.ts +1 -6
- package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
- package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
- package/src/prover/smt/solver/lp/nla-core.ts +35 -130
- package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
- package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +15 -69
- package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
- package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
- package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
- package/src/prover/smt/solver/lp/nla-order.ts +2 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
- package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
- package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
- package/src/prover/smt/solver/lp/nla-types.ts +1 -11
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
- package/src/prover/smt/solver/lp/nra-solver.ts +5 -52
- package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- package/src/prover/smt/solver/lp/random-updater.ts +1 -8
- package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
- package/src/prover/smt/solver/lp/union-find.ts +1 -6
- package/src/prover/smt/solver/mam-compiler.ts +14 -56
- package/src/prover/smt/solver/mam-interpreter.ts +1 -21
- package/src/prover/smt/solver/maximize-ac-sharing.ts +2 -17
- package/src/prover/smt/solver/model-checker.ts +2 -36
- package/src/prover/smt/solver/model-evaluator.ts +3 -29
- package/src/prover/smt/solver/model-finder.ts +3 -15
- package/src/prover/smt/solver/model-generator.ts +1 -12
- package/src/prover/smt/solver/model-macro-solver.ts +12 -69
- package/src/prover/smt/solver/nlsat/algebraic.ts +55 -151
- package/src/prover/smt/solver/nlsat/atoms.ts +5 -19
- package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
- package/src/prover/smt/solver/nlsat/explain.ts +3 -47
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -50
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -129
- package/src/prover/smt/solver/nlsat/mpbq.ts +3 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +17 -156
- package/src/prover/smt/solver/nlsat/solver.ts +7 -67
- package/src/prover/smt/solver/nlsat/types.ts +1 -8
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -44
- package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
- package/src/prover/smt/solver/nnf.ts +3 -38
- package/src/prover/smt/solver/pattern-inference.ts +2 -15
- package/src/prover/smt/solver/poly-rewriter.ts +3 -23
- package/src/prover/smt/solver/propagate-values.ts +1 -10
- package/src/prover/smt/solver/proto-model.ts +3 -48
- package/src/prover/smt/solver/pull-quant.ts +1 -12
- package/src/prover/smt/solver/qe-lite-der.ts +1 -29
- package/src/prover/smt/solver/qe-lite-fm.ts +2 -25
- package/src/prover/smt/solver/qe-lite.ts +3 -33
- package/src/prover/smt/solver/qi-queue.ts +1 -16
- package/src/prover/smt/solver/quant-tactics.ts +5 -22
- package/src/prover/smt/solver/quantifier-analyzer.ts +17 -37
- package/src/prover/smt/solver/quantifier-manager.ts +1 -8
- package/src/prover/smt/solver/random-gen.ts +1 -2
- package/src/prover/smt/solver/rational.ts +1 -8
- package/src/prover/smt/solver/ref-vector.ts +1 -6
- package/src/prover/smt/solver/relevancy.ts +2 -15
- package/src/prover/smt/solver/rewriter-tpl.ts +3 -147
- package/src/prover/smt/solver/rewriter.ts +3 -85
- package/src/prover/smt/solver/rlimit.ts +2 -20
- package/src/prover/smt/solver/smtlib-parser.ts +2 -37
- package/src/prover/smt/solver/solver.ts +23 -34
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/sticky-generations.ts +0 -5
- package/src/prover/smt/solver/theory-lra-axioms.ts +3 -24
- package/src/prover/smt/solver/theory-lra-bounds.ts +0 -5
- package/src/prover/smt/solver/theory-lra-final-check.ts +4 -22
- package/src/prover/smt/solver/theory-lra-internalize.ts +1 -27
- package/src/prover/smt/solver/theory-lra-model.ts +4 -19
- package/src/prover/smt/solver/theory-lra-propagate.ts +1 -15
- package/src/prover/smt/solver/theory-lra-state.ts +3 -8
- package/src/prover/smt/solver/theory-lra.ts +1 -8
- package/src/prover/smt/solver/var-subst.ts +2 -26
- package/src/prover/smt/table.ts +0 -8
- package/src/prover/tlapm/cache.ts +20 -25
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +12 -17
- package/src/prover/verdict.ts +0 -2
- package/src/prover/zenon/check/check.ts +0 -9
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +0 -5
- package/src/prover/zenon/check/relations.ts +0 -13
- package/src/prover/zenon/check/rewrites.ts +0 -6
- package/src/prover/zenon/check/sets.ts +0 -3
- package/src/prover/zenon/check/terms.ts +0 -17
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +0 -12
- package/src/prover/zenon/encode.ts +1 -8
- package/src/prover/zenon/eqrel.ts +0 -13
- package/src/prover/zenon/equality-rules.ts +0 -4
- package/src/prover/zenon/expr.ts +1 -26
- package/src/prover/zenon/index-table.ts +17 -38
- package/src/prover/zenon/isar-case.ts +9 -19
- package/src/prover/zenon/isar.ts +1 -29
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +0 -9
- package/src/prover/zenon/mltoll.ts +54 -76
- package/src/prover/zenon/node.ts +1 -11
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +2 -7
- package/src/prover/zenon/phrase.ts +1 -11
- package/src/prover/zenon/proof.ts +0 -9
- package/src/prover/zenon/propositional-rules.ts +0 -5
- package/src/prover/zenon/rules.ts +2 -6
- package/src/prover/zenon/search.ts +1 -17
- package/src/prover/zenon/tla/functions.ts +57 -29
- package/src/prover/zenon/tla/llproof.ts +63 -70
- package/src/prover/zenon/tla/records.ts +56 -27
- package/src/prover/zenon/tla/rewrites.ts +12 -19
- package/src/prover/zenon/tla/sets.ts +68 -39
- package/src/prover/zenon/tla/terms.ts +0 -6
- package/src/prover/zenon/tla/tla.ts +59 -58
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +12 -112
- package/src/runtime.ts +22 -22
- package/src/sany/builtins.ts +2 -5
- package/src/sany/generator.ts +149 -252
- package/src/sany/levels.ts +6 -34
- package/src/sany/lexer.ts +41 -61
- package/src/sany/linter.ts +1 -9
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +0 -31
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +29 -63
- package/src/sany/selectors.ts +15 -39
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +13 -63
- package/src/search.ts +495 -155
- package/src/simulate.ts +685 -0
- package/src/spec-description.ts +176 -69
- package/src/standard-definitions.ts +0 -4
- package/src/standard-modules.ts +254 -69
- package/src/state-graph.ts +50 -24
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +2 -3
- package/src/successors.ts +263 -94
- package/src/symmetry.ts +33 -25
- package/src/tableau.ts +27 -24
- package/src/tlc/fingerprint.ts +183 -67
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +110 -44
- package/src/tlc/order.ts +37 -60
- package/src/tlc/random.ts +33 -45
- package/src/tlc/replay.ts +549 -217
- package/src/tlc/summary.ts +36 -47
- package/src/tlc/tlc-operators.ts +76 -41
- package/src/tlc/tlcext-operators.ts +139 -122
- package/src/tlc/trace-spec.ts +269 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typescript/actions.ts +481 -0
- package/src/typescript/collections.ts +600 -0
- package/src/typescript/compile.ts +65 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +152 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +163 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +165 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +780 -337
- package/src/worker.ts +7 -8
package/src/dfid.ts
ADDED
|
@@ -0,0 +1,618 @@
|
|
|
1
|
+
import type { Expression } from "./ast";
|
|
2
|
+
import type { CheckOptions } from "./check";
|
|
3
|
+
import {
|
|
4
|
+
getErrorExitCode,
|
|
5
|
+
getUnexpectedException,
|
|
6
|
+
isStackOverflow,
|
|
7
|
+
TlaEvaluationError,
|
|
8
|
+
TlaIncompleteSuccessorError,
|
|
9
|
+
TlaStackOverflowError,
|
|
10
|
+
TlaTooManyStatesError,
|
|
11
|
+
TlaUnsupportedError,
|
|
12
|
+
} from "./errors";
|
|
13
|
+
import { createTracingEnvironment } from "./evaluate";
|
|
14
|
+
import { EXIT_STATUS, getMessageExitStatus, withLivenessExitCode } from "./exit-codes";
|
|
15
|
+
import { createLivenessChecker } from "./liveness-checker";
|
|
16
|
+
import { getIncompleteSuccessorMessage, prepareSearch, reportAssumptionViolation } from "./search";
|
|
17
|
+
import { getNextActions, type SpecAction } from "./spec-description";
|
|
18
|
+
import { forEachInitialState, forEachSuccessor } from "./successors";
|
|
19
|
+
import {
|
|
20
|
+
formatNestedMessage,
|
|
21
|
+
formatTlcDate,
|
|
22
|
+
getFailureMessage,
|
|
23
|
+
isEvalException,
|
|
24
|
+
isHeadedError,
|
|
25
|
+
MESSAGE_CODE,
|
|
26
|
+
withUnexpectedException,
|
|
27
|
+
} from "./tlc/messages";
|
|
28
|
+
import { getTlcFingerprint } from "./tlc/fingerprint";
|
|
29
|
+
import { replaySuccessors } from "./tlc/replay";
|
|
30
|
+
import { getOptimisticProbability, getActualProbability } from "./tlc/summary";
|
|
31
|
+
import { createModelValue, formatState, getSetBound, type Value } from "./values";
|
|
32
|
+
|
|
33
|
+
export interface DepthFirstOptions extends CheckOptions {
|
|
34
|
+
maxDepth: number;
|
|
35
|
+
onOutput: (output: DepthFirstOutput) => void;
|
|
36
|
+
}
|
|
37
|
+
|
|
38
|
+
export type DepthFirstOutput =
|
|
39
|
+
| { kind: "message"; code: number; isError: boolean; message: string; toolMessage: string }
|
|
40
|
+
| { kind: "behavior"; states: Record<string, Value>[]; isInvariant: boolean }
|
|
41
|
+
| { kind: "nested-expressions"; callStack: Expression[] }
|
|
42
|
+
| { kind: "success"; optimistic: number; actual: number };
|
|
43
|
+
|
|
44
|
+
interface StateEntry {
|
|
45
|
+
state: Value[];
|
|
46
|
+
fingerprint: bigint;
|
|
47
|
+
}
|
|
48
|
+
|
|
49
|
+
interface CheckerState {
|
|
50
|
+
isDone: boolean;
|
|
51
|
+
errorCode: number;
|
|
52
|
+
continuedCode: number;
|
|
53
|
+
isKeepingCallStack: boolean;
|
|
54
|
+
errorEntry: StateEntry | undefined;
|
|
55
|
+
stopCode: number;
|
|
56
|
+
isMoreLevel: boolean;
|
|
57
|
+
}
|
|
58
|
+
|
|
59
|
+
const DONE = 1;
|
|
60
|
+
const LEVELED = 2;
|
|
61
|
+
|
|
62
|
+
const NO_ERROR = 0;
|
|
63
|
+
|
|
64
|
+
const LONG_MAX = (1n << 63n) - 1n;
|
|
65
|
+
|
|
66
|
+
const INITIAL_BUCKETS = 1n << 16n;
|
|
67
|
+
const MAX_LOAD = 20n;
|
|
68
|
+
|
|
69
|
+
const getFingerprintDistance = (fingerprints: bigint[], buckets: bigint) => {
|
|
70
|
+
const values = fingerprints.map((fingerprint) => {
|
|
71
|
+
const low = BigInt.asIntN(32, fingerprint);
|
|
72
|
+
return low < 0n ? low : BigInt.asIntN(64, fingerprint);
|
|
73
|
+
});
|
|
74
|
+
const sorted = values.toSorted((left, right) => (left < right ? -1 : left > right ? 1 : 0));
|
|
75
|
+
const gaps = sorted
|
|
76
|
+
.slice(1)
|
|
77
|
+
.map((value, index) => value - sorted[index])
|
|
78
|
+
.filter((gap) => gap <= LONG_MAX);
|
|
79
|
+
const ranges = new Map<bigint, { min: bigint; max: bigint }>();
|
|
80
|
+
fingerprints.forEach((fingerprint, index) => {
|
|
81
|
+
const bucket = fingerprint & (buckets - 1n);
|
|
82
|
+
const range = ranges.get(bucket);
|
|
83
|
+
const value = values[index];
|
|
84
|
+
if (!range) {
|
|
85
|
+
ranges.set(bucket, { min: value, max: value });
|
|
86
|
+
return;
|
|
87
|
+
}
|
|
88
|
+
range.min = value < range.min ? value : range.min;
|
|
89
|
+
range.max = value > range.max ? value : range.max;
|
|
90
|
+
});
|
|
91
|
+
const wraps = [...ranges.values()]
|
|
92
|
+
.map((range) => range.max - range.min)
|
|
93
|
+
.filter((difference) => difference > LONG_MAX)
|
|
94
|
+
.map((difference) => (difference === LONG_MAX + 1n ? -difference : (1n << 64n) - difference));
|
|
95
|
+
return [...gaps, ...wraps].reduce((min, gap) => (gap < min ? gap : min), LONG_MAX);
|
|
96
|
+
};
|
|
97
|
+
|
|
98
|
+
const getUnexpectedMessage = (cause: string, error: TlaEvaluationError) => {
|
|
99
|
+
const exception = isEvalException(error)
|
|
100
|
+
? "tlc2.tool.EvalException"
|
|
101
|
+
: "java.lang.RuntimeException";
|
|
102
|
+
return cause === ""
|
|
103
|
+
? getUnexpectedException(exception)
|
|
104
|
+
: `TLC threw an unexpected exception.\nThis was probably caused by an error in the spec or model.\nThe error occurred when TLC was ${cause}.\nThe exception was a ${exception}\n: `;
|
|
105
|
+
};
|
|
106
|
+
|
|
107
|
+
// Deviation from TLC: DFIDWorker picks the next initial state and successor with an unseeded generator, so tla-ts picks the first one.
|
|
108
|
+
export const checkDepthFirst = (options: DepthFirstOptions): number => {
|
|
109
|
+
const output = options.onOutput;
|
|
110
|
+
const isTool = options.isTool ?? false;
|
|
111
|
+
const isContinued = options.isContinued ?? false;
|
|
112
|
+
const prepared = prepareSearch(options);
|
|
113
|
+
const config = prepared.config;
|
|
114
|
+
const environment = prepared.environment;
|
|
115
|
+
const runtime = environment.runtime;
|
|
116
|
+
const search = prepared.search;
|
|
117
|
+
if (!search) {
|
|
118
|
+
throw new TlaUnsupportedError("tla-ts can't search a specification without variables");
|
|
119
|
+
}
|
|
120
|
+
const message = (code: number, text: string, toolText = text, isError = true) =>
|
|
121
|
+
output({ kind: "message", code, isError, message: text, toolMessage: toolText });
|
|
122
|
+
const temporalProperties = search.properties.liveness;
|
|
123
|
+
if (temporalProperties.length > 0) {
|
|
124
|
+
options.onProgress?.({
|
|
125
|
+
kind: "liveness-initializing",
|
|
126
|
+
isSymmetric: search.isSymmetric,
|
|
127
|
+
isConstrained: search.isConstrained,
|
|
128
|
+
});
|
|
129
|
+
const branches = withLivenessExitCode(() =>
|
|
130
|
+
withUnexpectedException(() =>
|
|
131
|
+
createLivenessChecker(temporalProperties, search.spec.temporals, environment, {
|
|
132
|
+
getFingerprint: () => 0,
|
|
133
|
+
getSuccessors: () => [],
|
|
134
|
+
}),
|
|
135
|
+
),
|
|
136
|
+
)?.branches;
|
|
137
|
+
if (branches) options.onProgress?.({ kind: "liveness-prepared", branches });
|
|
138
|
+
}
|
|
139
|
+
if ((options.workers ?? 1) !== 1) {
|
|
140
|
+
message(
|
|
141
|
+
MESSAGE_CODE.general,
|
|
142
|
+
"Depth-First Iterative Deepening mode does not support multiple workers (https://github.com/tlaplus/tlaplus/issues/548). Please run TLC with a single worker.",
|
|
143
|
+
);
|
|
144
|
+
return EXIT_STATUS.error;
|
|
145
|
+
}
|
|
146
|
+
if (temporalProperties.length > 0) {
|
|
147
|
+
message(
|
|
148
|
+
MESSAGE_CODE.general,
|
|
149
|
+
"Depth-First Iterative Deepening mode does not support checking liveness properties (https://github.com/tlaplus/tlaplus/issues/548). Please check liveness properties in Breadth-First-Search mode.",
|
|
150
|
+
);
|
|
151
|
+
return EXIT_STATUS.error;
|
|
152
|
+
}
|
|
153
|
+
runtime.generatedStates = -1;
|
|
154
|
+
runtime.distinctStates = -1;
|
|
155
|
+
runtime.initialStates = -1;
|
|
156
|
+
runtime.queueSize = -1;
|
|
157
|
+
runtime.diameter = -1;
|
|
158
|
+
runtime.isStarted = true;
|
|
159
|
+
const assumptionStatus = reportAssumptionViolation(
|
|
160
|
+
prepared.specification.assumptions,
|
|
161
|
+
environment,
|
|
162
|
+
message,
|
|
163
|
+
);
|
|
164
|
+
if (assumptionStatus !== undefined) return assumptionStatus;
|
|
165
|
+
|
|
166
|
+
const nextActions = getNextActions(config, environment, prepared.specification.instanceActions);
|
|
167
|
+
const statuses = new Map<bigint, number>();
|
|
168
|
+
const fingerprintSet = { level: 1, leveled: 0, buckets: INITIAL_BUCKETS };
|
|
169
|
+
const setStatus = (fingerprint: bigint, status: number) => {
|
|
170
|
+
const old = statuses.get(fingerprint);
|
|
171
|
+
if (old !== undefined) {
|
|
172
|
+
statuses.set(fingerprint, old | status);
|
|
173
|
+
return old;
|
|
174
|
+
}
|
|
175
|
+
if (BigInt(statuses.size) >= fingerprintSet.buckets * MAX_LOAD) fingerprintSet.buckets *= 2n;
|
|
176
|
+
statuses.set(fingerprint, (fingerprintSet.level << 2) | fingerprintSet.leveled | status);
|
|
177
|
+
return 0;
|
|
178
|
+
};
|
|
179
|
+
const getStatus = (fingerprint: bigint) => statuses.get(fingerprint) ?? 0;
|
|
180
|
+
const isCompleted = (status: number) =>
|
|
181
|
+
(status & LEVELED) === fingerprintSet.leveled || (status & DONE) === DONE;
|
|
182
|
+
const isLeafStatus = (status: number) => status === 0 || status >>> 2 === fingerprintSet.level;
|
|
183
|
+
|
|
184
|
+
let generatedCount = 0;
|
|
185
|
+
const checker: CheckerState = {
|
|
186
|
+
isDone: false,
|
|
187
|
+
errorCode: NO_ERROR,
|
|
188
|
+
continuedCode: NO_ERROR,
|
|
189
|
+
isKeepingCallStack: false,
|
|
190
|
+
errorEntry: undefined,
|
|
191
|
+
stopCode: 0,
|
|
192
|
+
isMoreLevel: false,
|
|
193
|
+
};
|
|
194
|
+
const setErrorState = (entry: StateEntry, isKeepingCallStack: boolean, code: number) => {
|
|
195
|
+
if (!isContinued && checker.isDone) return false;
|
|
196
|
+
checker.errorEntry = entry;
|
|
197
|
+
checker.errorCode = code;
|
|
198
|
+
checker.isDone = true;
|
|
199
|
+
checker.isKeepingCallStack = isKeepingCallStack;
|
|
200
|
+
checker.stopCode = 2;
|
|
201
|
+
return true;
|
|
202
|
+
};
|
|
203
|
+
const toRecord = (state: (Value | undefined)[]) =>
|
|
204
|
+
search.toRecord(state.map((value) => value ?? createModelValue("null")));
|
|
205
|
+
const printSummary = () => {
|
|
206
|
+
const counts = `${generatedCount} states generated, ${statuses.size} distinct states found`;
|
|
207
|
+
if (isTool) {
|
|
208
|
+
message(
|
|
209
|
+
MESSAGE_CODE.depthFirstProgress,
|
|
210
|
+
`Progress: ${counts}.`,
|
|
211
|
+
`Progress(-1) at ${formatTlcDate(new Date())}: ${counts}, -1 states left on queue.`,
|
|
212
|
+
false,
|
|
213
|
+
);
|
|
214
|
+
}
|
|
215
|
+
message(MESSAGE_CODE.depthFirstStats, `${counts}.`, undefined, false);
|
|
216
|
+
};
|
|
217
|
+
const reportSuccess = () =>
|
|
218
|
+
output({
|
|
219
|
+
kind: "success",
|
|
220
|
+
optimistic: getOptimisticProbability(statuses.size, generatedCount),
|
|
221
|
+
actual:
|
|
222
|
+
statuses.size === 0 && generatedCount === 0
|
|
223
|
+
? 0
|
|
224
|
+
: getActualProbability(
|
|
225
|
+
getFingerprintDistance([...statuses.keys()], fingerprintSet.buckets),
|
|
226
|
+
),
|
|
227
|
+
});
|
|
228
|
+
const levels = new WeakMap<(Value | undefined)[], number>();
|
|
229
|
+
let currentState: Value[] | undefined;
|
|
230
|
+
runtime.getLevel = (state) => levels.get(state) ?? 0;
|
|
231
|
+
runtime.getCurrentState = () => currentState;
|
|
232
|
+
|
|
233
|
+
const initialEntries: StateEntry[] = [];
|
|
234
|
+
let errorState: Value[] | undefined;
|
|
235
|
+
const computeInitialStates = (): number => {
|
|
236
|
+
const generated: (Value | undefined)[][] = [];
|
|
237
|
+
const addGenerated = (state: (Value | undefined)[]) => {
|
|
238
|
+
generated.push(state);
|
|
239
|
+
return false;
|
|
240
|
+
};
|
|
241
|
+
const init = search.spec.init;
|
|
242
|
+
if (init) forEachInitialState(init, environment, addGenerated, search.spec.scope, addGenerated);
|
|
243
|
+
generatedCount = generated.length;
|
|
244
|
+
for (const state of generated) {
|
|
245
|
+
if (!state.every((value) => value !== undefined)) {
|
|
246
|
+
message(
|
|
247
|
+
MESSAGE_CODE.initialStateIncomplete,
|
|
248
|
+
`State is not completely specified by the initial predicate:\n${formatState(toRecord(state))}`,
|
|
249
|
+
);
|
|
250
|
+
return MESSAGE_CODE.initialStateIncomplete;
|
|
251
|
+
}
|
|
252
|
+
errorState = state;
|
|
253
|
+
levels.set(state, 1);
|
|
254
|
+
const isInModel = search.satisfiesConstraints(state);
|
|
255
|
+
const fingerprint = isInModel ? runtime.getFingerprint(state) : 0n;
|
|
256
|
+
const status = isInModel ? setStatus(fingerprint, 0) : 0;
|
|
257
|
+
if (isInModel && status === 0) initialEntries.push({ state, fingerprint });
|
|
258
|
+
if (status !== 0) continue;
|
|
259
|
+
const alias = () =>
|
|
260
|
+
config.alias === undefined
|
|
261
|
+
? search.toRecord(state)
|
|
262
|
+
: search.evaluateAlias(config.alias, state, state, isTool);
|
|
263
|
+
const violated = isContinued
|
|
264
|
+
? search.getViolatedInvariants(state)
|
|
265
|
+
: [search.findViolatedInvariant(state)].filter((invariant) => invariant !== undefined);
|
|
266
|
+
for (const invariant of violated) {
|
|
267
|
+
message(
|
|
268
|
+
MESSAGE_CODE.invariantViolatedInitial,
|
|
269
|
+
`Invariant ${invariant.name} is violated by the initial state:\n${formatState(alias())}`,
|
|
270
|
+
);
|
|
271
|
+
if (!isContinued) return MESSAGE_CODE.invariantViolatedInitial;
|
|
272
|
+
checker.continuedCode = MESSAGE_CODE.invariantViolatedInitial;
|
|
273
|
+
}
|
|
274
|
+
const predicate = search.findFailedInitialPredicate(state);
|
|
275
|
+
if (predicate) {
|
|
276
|
+
message(
|
|
277
|
+
MESSAGE_CODE.propertyViolatedInitial,
|
|
278
|
+
`Property ${predicate.name} is violated by the initial state:\n${formatState(alias())}`,
|
|
279
|
+
);
|
|
280
|
+
return MESSAGE_CODE.propertyViolatedInitial;
|
|
281
|
+
}
|
|
282
|
+
}
|
|
283
|
+
return NO_ERROR;
|
|
284
|
+
};
|
|
285
|
+
|
|
286
|
+
const getActionSuccessors = (action: SpecAction, state: Value[]) => {
|
|
287
|
+
const successors: Value[][] = [];
|
|
288
|
+
try {
|
|
289
|
+
forEachSuccessor(
|
|
290
|
+
action.expression,
|
|
291
|
+
state,
|
|
292
|
+
environment,
|
|
293
|
+
(successor) => {
|
|
294
|
+
if (successors.length === getSetBound()) throw new TlaTooManyStatesError();
|
|
295
|
+
successors.push(successor.state);
|
|
296
|
+
return false;
|
|
297
|
+
},
|
|
298
|
+
action.scope,
|
|
299
|
+
);
|
|
300
|
+
return { successors, incomplete: undefined };
|
|
301
|
+
} catch (error) {
|
|
302
|
+
if (!(error instanceof TlaIncompleteSuccessorError)) throw error;
|
|
303
|
+
return { successors, incomplete: error };
|
|
304
|
+
}
|
|
305
|
+
};
|
|
306
|
+
|
|
307
|
+
const findCheckFailure = (state: Value[], successor: Value[], isNew: boolean) => {
|
|
308
|
+
try {
|
|
309
|
+
const invariant = isNew ? search.findViolatedInvariant(successor, state) : undefined;
|
|
310
|
+
if (invariant) {
|
|
311
|
+
return {
|
|
312
|
+
code: MESSAGE_CODE.invariantViolatedBehavior,
|
|
313
|
+
text: `Invariant ${invariant.name} is violated.`,
|
|
314
|
+
isViolated: true,
|
|
315
|
+
};
|
|
316
|
+
}
|
|
317
|
+
const property = search.findViolatedActionProperty(state, successor);
|
|
318
|
+
return (
|
|
319
|
+
property && {
|
|
320
|
+
code: MESSAGE_CODE.actionPropertyViolatedBehavior,
|
|
321
|
+
text: `Action property ${property.name} is violated.`,
|
|
322
|
+
isViolated: true,
|
|
323
|
+
}
|
|
324
|
+
);
|
|
325
|
+
} catch (error) {
|
|
326
|
+
if (!(error instanceof TlaEvaluationError) || !isHeadedError(error)) throw error;
|
|
327
|
+
return {
|
|
328
|
+
code: getFailureMessage(error, true).code,
|
|
329
|
+
text: error.message.slice(0, error.message.indexOf("\n")),
|
|
330
|
+
isViolated: false,
|
|
331
|
+
};
|
|
332
|
+
}
|
|
333
|
+
};
|
|
334
|
+
const stack: StateEntry[] = [];
|
|
335
|
+
const successorStack: StateEntry[][] = [];
|
|
336
|
+
const printTrace = (
|
|
337
|
+
code: number,
|
|
338
|
+
text: string,
|
|
339
|
+
toolText: string,
|
|
340
|
+
depth: number,
|
|
341
|
+
successor: (Value | undefined)[] | undefined,
|
|
342
|
+
) => {
|
|
343
|
+
message(code, text, toolText);
|
|
344
|
+
message(MESSAGE_CODE.behaviorUpToThisPoint, "The behavior up to this point is:");
|
|
345
|
+
const states = [
|
|
346
|
+
...stack.slice(0, depth + 1).map((entry) => entry.state),
|
|
347
|
+
...(successor ? [successor] : []),
|
|
348
|
+
];
|
|
349
|
+
output({
|
|
350
|
+
kind: "behavior",
|
|
351
|
+
states: states.map(toRecord),
|
|
352
|
+
isInvariant: code === MESSAGE_CODE.invariantViolatedBehavior,
|
|
353
|
+
});
|
|
354
|
+
};
|
|
355
|
+
const expandState = (depth: number, isLeaf: boolean, successors: StateEntry[]) => {
|
|
356
|
+
const entry = stack[depth];
|
|
357
|
+
const state = entry.state;
|
|
358
|
+
let isDeadlocked = true;
|
|
359
|
+
let isAllDone = true;
|
|
360
|
+
let isNoLeaf = true;
|
|
361
|
+
let processedSuccessor: (Value | undefined)[] | undefined;
|
|
362
|
+
const report = (code: number, text: string, isKeepingCallStack: boolean) => {
|
|
363
|
+
if (setErrorState(entry, isKeepingCallStack, code)) {
|
|
364
|
+
printTrace(code, text, text, depth, processedSuccessor);
|
|
365
|
+
}
|
|
366
|
+
return isNoLeaf;
|
|
367
|
+
};
|
|
368
|
+
currentState = state;
|
|
369
|
+
try {
|
|
370
|
+
for (const action of nextActions) {
|
|
371
|
+
const next = getActionSuccessors(action, state);
|
|
372
|
+
const incomplete = next.incomplete;
|
|
373
|
+
const count = next.successors.length + (incomplete ? 1 : 0);
|
|
374
|
+
generatedCount += count;
|
|
375
|
+
isDeadlocked &&= count === 0;
|
|
376
|
+
for (const successor of next.successors) {
|
|
377
|
+
processedSuccessor = successor;
|
|
378
|
+
levels.set(successor, depth + 2);
|
|
379
|
+
const isInModel =
|
|
380
|
+
search.satisfiesConstraints(successor, state) &&
|
|
381
|
+
search.satisfiesActionConstraints(state, successor);
|
|
382
|
+
const fingerprint = isInModel ? runtime.getFingerprint(successor) : 0n;
|
|
383
|
+
const status = isInModel ? setStatus(fingerprint, 0) : 0;
|
|
384
|
+
if (isInModel) {
|
|
385
|
+
isAllDone &&= (status & DONE) === DONE;
|
|
386
|
+
isNoLeaf &&= !isLeafStatus(status);
|
|
387
|
+
if (!isCompleted(status)) {
|
|
388
|
+
if (successors.length === getSetBound()) throw new TlaTooManyStatesError();
|
|
389
|
+
successors.push({ state: successor, fingerprint });
|
|
390
|
+
}
|
|
391
|
+
}
|
|
392
|
+
const failure = findCheckFailure(state, successor, status === 0);
|
|
393
|
+
if (failure?.isViolated && isContinued) {
|
|
394
|
+
printTrace(failure.code, failure.text, failure.text, depth, successor);
|
|
395
|
+
checker.continuedCode = failure.code;
|
|
396
|
+
continue;
|
|
397
|
+
}
|
|
398
|
+
if (failure) return report(failure.code, failure.text, !failure.isViolated);
|
|
399
|
+
}
|
|
400
|
+
if (incomplete) {
|
|
401
|
+
processedSuccessor = incomplete.state;
|
|
402
|
+
return report(
|
|
403
|
+
MESSAGE_CODE.incompleteSuccessor,
|
|
404
|
+
getIncompleteSuccessorMessage(
|
|
405
|
+
incomplete.variables,
|
|
406
|
+
action.name,
|
|
407
|
+
nextActions.length,
|
|
408
|
+
options.version,
|
|
409
|
+
),
|
|
410
|
+
false,
|
|
411
|
+
);
|
|
412
|
+
}
|
|
413
|
+
processedSuccessor = undefined;
|
|
414
|
+
}
|
|
415
|
+
if (isDeadlocked && config.checkDeadlock) {
|
|
416
|
+
return report(MESSAGE_CODE.deadlockReached, "Deadlock reached.", false);
|
|
417
|
+
}
|
|
418
|
+
if (isAllDone || (isLeaf && isNoLeaf)) setStatus(entry.fingerprint, DONE);
|
|
419
|
+
return isNoLeaf;
|
|
420
|
+
} catch (error) {
|
|
421
|
+
const failure = isStackOverflow(error) ? new TlaStackOverflowError() : error;
|
|
422
|
+
if (!(failure instanceof TlaEvaluationError)) throw error;
|
|
423
|
+
const isOverflow = failure instanceof TlaStackOverflowError;
|
|
424
|
+
if (
|
|
425
|
+
setErrorState(
|
|
426
|
+
entry,
|
|
427
|
+
!isOverflow,
|
|
428
|
+
isOverflow ? MESSAGE_CODE.stackOverflow : MESSAGE_CODE.general,
|
|
429
|
+
)
|
|
430
|
+
) {
|
|
431
|
+
const unexpected = getUnexpectedMessage("computing the set of next states", failure);
|
|
432
|
+
printTrace(
|
|
433
|
+
isOverflow ? MESSAGE_CODE.stackOverflow : MESSAGE_CODE.general,
|
|
434
|
+
isOverflow ? failure.message : `${unexpected}${failure.message}`,
|
|
435
|
+
isOverflow
|
|
436
|
+
? failure.message
|
|
437
|
+
: `${unexpected}${formatNestedMessage(failure.message, true)}`,
|
|
438
|
+
depth,
|
|
439
|
+
processedSuccessor,
|
|
440
|
+
);
|
|
441
|
+
}
|
|
442
|
+
throw failure;
|
|
443
|
+
}
|
|
444
|
+
};
|
|
445
|
+
const getNextIndex = (successors: StateEntry[], level: number) => {
|
|
446
|
+
while (successors.length > 0) {
|
|
447
|
+
const status = getStatus(successors[0].fingerprint);
|
|
448
|
+
if (!isCompleted(status) && level < status >>> 2) return 0;
|
|
449
|
+
successors[0] = successors[successors.length - 1];
|
|
450
|
+
successors.pop();
|
|
451
|
+
}
|
|
452
|
+
return -1;
|
|
453
|
+
};
|
|
454
|
+
const searchLevel = (toLevel: number) => {
|
|
455
|
+
const initials = [...initialEntries];
|
|
456
|
+
checker.stopCode = 0;
|
|
457
|
+
checker.isMoreLevel = false;
|
|
458
|
+
let stackLevel = 0;
|
|
459
|
+
try {
|
|
460
|
+
while (checker.stopCode === 0) {
|
|
461
|
+
while (initials.length > 0 && isCompleted(getStatus(initials[0].fingerprint))) {
|
|
462
|
+
initials[0] = initials[initials.length - 1];
|
|
463
|
+
initials.pop();
|
|
464
|
+
}
|
|
465
|
+
if (initials.length === 0) {
|
|
466
|
+
checker.stopCode = 1;
|
|
467
|
+
return;
|
|
468
|
+
}
|
|
469
|
+
stack[0] = initials[0];
|
|
470
|
+
successorStack[0] = [];
|
|
471
|
+
stackLevel = 0;
|
|
472
|
+
const isInitialLeaf = toLevel < 2;
|
|
473
|
+
const isInitialNoLeaf = expandState(0, isInitialLeaf, successorStack[0]);
|
|
474
|
+
checker.isMoreLevel ||= !isInitialNoLeaf;
|
|
475
|
+
stackLevel = 1;
|
|
476
|
+
while (!isInitialLeaf) {
|
|
477
|
+
const index = getNextIndex(successorStack[stackLevel - 1], stackLevel);
|
|
478
|
+
if (index === -1) {
|
|
479
|
+
const entry = stack[stackLevel - 1];
|
|
480
|
+
statuses.set(
|
|
481
|
+
entry.fingerprint,
|
|
482
|
+
(getStatus(entry.fingerprint) & ~LEVELED) | fingerprintSet.leveled,
|
|
483
|
+
);
|
|
484
|
+
if (stackLevel === 1) break;
|
|
485
|
+
stackLevel--;
|
|
486
|
+
continue;
|
|
487
|
+
}
|
|
488
|
+
stack[stackLevel] = successorStack[stackLevel - 1][index];
|
|
489
|
+
successorStack[stackLevel] = [];
|
|
490
|
+
const isLeaf = stackLevel >= toLevel - 1;
|
|
491
|
+
const isNoLeaf = expandState(stackLevel, isLeaf, successorStack[stackLevel]);
|
|
492
|
+
checker.isMoreLevel ||= !isNoLeaf;
|
|
493
|
+
stackLevel++;
|
|
494
|
+
if (isLeaf) break;
|
|
495
|
+
}
|
|
496
|
+
}
|
|
497
|
+
} catch (error) {
|
|
498
|
+
if (!(error instanceof TlaEvaluationError)) throw error;
|
|
499
|
+
checker.stopCode = 2;
|
|
500
|
+
if (setErrorState(stack[stackLevel], true, MESSAGE_CODE.general)) {
|
|
501
|
+
const unexpected = getUnexpectedMessage("", error);
|
|
502
|
+
message(
|
|
503
|
+
MESSAGE_CODE.general,
|
|
504
|
+
`${unexpected}${error.message}`,
|
|
505
|
+
`${unexpected}${formatNestedMessage(error.message, true)}`,
|
|
506
|
+
);
|
|
507
|
+
}
|
|
508
|
+
}
|
|
509
|
+
};
|
|
510
|
+
const replayExpansion = (entry: StateEntry) => {
|
|
511
|
+
const tracing = createTracingEnvironment(environment);
|
|
512
|
+
try {
|
|
513
|
+
const isPassed = nextActions.every((action) => {
|
|
514
|
+
const successors: Value[][] = [];
|
|
515
|
+
replaySuccessors([action], entry.state, tracing, (successor) => successors.push(successor));
|
|
516
|
+
generatedCount += successors.length;
|
|
517
|
+
return successors.every(
|
|
518
|
+
(successor) =>
|
|
519
|
+
successor.every((value) => value !== undefined) &&
|
|
520
|
+
search.checkReplayedSuccessor(
|
|
521
|
+
entry.state,
|
|
522
|
+
successor,
|
|
523
|
+
tracing,
|
|
524
|
+
() => setStatus(runtime.getFingerprint(successor), 0) === 0,
|
|
525
|
+
),
|
|
526
|
+
);
|
|
527
|
+
});
|
|
528
|
+
if (isPassed) return;
|
|
529
|
+
} catch (error) {
|
|
530
|
+
if (!(error instanceof TlaEvaluationError) && !isStackOverflow(error)) throw error;
|
|
531
|
+
}
|
|
532
|
+
output({ kind: "nested-expressions", callStack: tracing.callStack?.expressions ?? [] });
|
|
533
|
+
};
|
|
534
|
+
|
|
535
|
+
const finish = (code: number) => {
|
|
536
|
+
printSummary();
|
|
537
|
+
const status = [code, checker.errorCode, checker.continuedCode].find(
|
|
538
|
+
(candidate) => candidate !== NO_ERROR,
|
|
539
|
+
);
|
|
540
|
+
return status === undefined ? EXIT_STATUS.success : getMessageExitStatus(status);
|
|
541
|
+
};
|
|
542
|
+
const tryInitialStates = () => {
|
|
543
|
+
try {
|
|
544
|
+
return { code: computeInitialStates(), error: undefined };
|
|
545
|
+
} catch (error) {
|
|
546
|
+
const failure = isStackOverflow(error) ? new TlaStackOverflowError() : error;
|
|
547
|
+
if (!(failure instanceof TlaEvaluationError)) throw error;
|
|
548
|
+
return { code: NO_ERROR, error: failure };
|
|
549
|
+
}
|
|
550
|
+
};
|
|
551
|
+
const initialFailure = tryInitialStates();
|
|
552
|
+
if (initialFailure.error) {
|
|
553
|
+
const failure = initialFailure.error;
|
|
554
|
+
const inner =
|
|
555
|
+
isHeadedError(failure) && failure.cause instanceof TlaEvaluationError
|
|
556
|
+
? failure.cause
|
|
557
|
+
: failure;
|
|
558
|
+
const initialState = errorState;
|
|
559
|
+
const prefix = initialState ? "" : getUnexpectedMessage("computing initial states", inner);
|
|
560
|
+
const suffix = initialState
|
|
561
|
+
? `\nWhile working on the initial state:\n${formatState(toRecord(initialState))}`
|
|
562
|
+
: "";
|
|
563
|
+
message(
|
|
564
|
+
initialState ? MESSAGE_CODE.initialState : MESSAGE_CODE.general,
|
|
565
|
+
`${prefix}${inner.message}${suffix}`,
|
|
566
|
+
`${prefix}${formatNestedMessage(inner.message, true)}${suffix}`,
|
|
567
|
+
);
|
|
568
|
+
generatedCount = 0;
|
|
569
|
+
initialEntries.length = 0;
|
|
570
|
+
const isReplayFailed = tryInitialStates().error !== undefined;
|
|
571
|
+
if (isReplayFailed) {
|
|
572
|
+
message(
|
|
573
|
+
MESSAGE_CODE.nestedExpression,
|
|
574
|
+
`The error occurred when TLC was evaluating the nested\nexpressions at the following positions:\ntlc2.tool.impl.FastTool@${(Number(BigInt.asUintN(28, getTlcFingerprint([options.source]))) | 0x1000_0000).toString(16)}`,
|
|
575
|
+
);
|
|
576
|
+
}
|
|
577
|
+
printSummary();
|
|
578
|
+
return isReplayFailed ? EXIT_STATUS.specEvaluationFailure : getErrorExitCode(inner);
|
|
579
|
+
}
|
|
580
|
+
if (initialFailure.code !== NO_ERROR) return getMessageExitStatus(initialFailure.code);
|
|
581
|
+
message(
|
|
582
|
+
MESSAGE_CODE.depthFirstInitGenerated,
|
|
583
|
+
`Finished computing initial states: ${generatedCount} states generated, with ${initialEntries.length} of them distinct.`,
|
|
584
|
+
undefined,
|
|
585
|
+
false,
|
|
586
|
+
);
|
|
587
|
+
if (nextActions.length === 0) {
|
|
588
|
+
reportSuccess();
|
|
589
|
+
return finish(NO_ERROR);
|
|
590
|
+
}
|
|
591
|
+
let isTerminated = false;
|
|
592
|
+
let levelCode: number = MESSAGE_CODE.general;
|
|
593
|
+
for (let level = 2; level <= options.maxDepth; level++) {
|
|
594
|
+
if (isTerminated) {
|
|
595
|
+
const errorEntry = checker.errorEntry;
|
|
596
|
+
if (!errorEntry && checker.continuedCode === NO_ERROR) {
|
|
597
|
+
levelCode = NO_ERROR;
|
|
598
|
+
reportSuccess();
|
|
599
|
+
}
|
|
600
|
+
if (errorEntry && checker.isKeepingCallStack) replayExpansion(errorEntry);
|
|
601
|
+
break;
|
|
602
|
+
}
|
|
603
|
+
message(
|
|
604
|
+
MESSAGE_CODE.depthFirstLevel,
|
|
605
|
+
`Starting level ${level}: ${generatedCount} states generated, ${statuses.size} distinct states found.`,
|
|
606
|
+
undefined,
|
|
607
|
+
false,
|
|
608
|
+
);
|
|
609
|
+
fingerprintSet.level++;
|
|
610
|
+
fingerprintSet.leveled = LEVELED - fingerprintSet.leveled;
|
|
611
|
+
searchLevel(level);
|
|
612
|
+
checker.isDone = false;
|
|
613
|
+
levelCode = checker.isKeepingCallStack ? NO_ERROR : checker.errorCode;
|
|
614
|
+
if (levelCode !== NO_ERROR) return finish(levelCode);
|
|
615
|
+
isTerminated = checker.stopCode === 2 || !checker.isMoreLevel;
|
|
616
|
+
}
|
|
617
|
+
return finish(levelCode);
|
|
618
|
+
};
|