tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.d618a2d79
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -1
- package/dist/compile.cjs +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +37 -0
- package/dist/index.d.ts +37 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2683 -427
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +47 -44
- package/dist/run.js +47 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +44 -41
- package/dist/transfer.js +44 -41
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -41
- package/src/bags.ts +2 -5
- package/src/builtins.ts +5 -21
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +268 -0
- package/src/check.ts +474 -718
- package/src/cli/options.ts +6 -31
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +8 -7
- package/src/cli/shared.ts +1 -5
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +244 -238
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +3 -5
- package/src/cli/tlc.ts +49 -702
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +3 -10
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +55 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +31 -106
- package/src/exit-codes.ts +2 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -9
- package/src/json-reader.ts +1 -2
- package/src/json.ts +8 -18
- package/src/levels.ts +46 -57
- package/src/lexer.ts +76 -85
- package/src/liveness-checker.ts +616 -306
- package/src/liveness.ts +104 -120
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +38 -8
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +26 -14
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +118 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +10 -30
- package/src/parallel.ts +50 -80
- package/src/parser.ts +722 -385
- package/src/pcal/ast.ts +53 -65
- package/src/pcal/parse.ts +144 -191
- package/src/pcal/tokenize.ts +91 -115
- package/src/pcal/translate.ts +83 -98
- package/src/pcal/validate.ts +48 -50
- package/src/pretty-print.ts +7 -7
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +0 -2
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +17 -28
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +6 -17
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +14 -13
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -6
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +87 -16
- package/src/prover/smt/solver/ast-lt.ts +166 -12
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1427 -41
- package/src/prover/smt/solver/auf-solver.ts +2 -6
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +110 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +516 -115
- package/src/prover/smt/solver/ctx-simplify.ts +20 -10
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +206 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +908 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +335 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +175 -15
- package/src/prover/smt/solver/goal2nlsat.ts +189 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +110 -38
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +67 -16
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +9 -5
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
- package/src/prover/smt/solver/lp/pdd.ts +2 -2
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +18 -27
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +56 -29
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
- package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +63 -23
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
- package/src/prover/smt/solver/nlsat/solver.ts +236 -45
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
- package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +202 -57
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +8 -16
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +38 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2127 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +1986 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -1
- package/src/prover/smt/solver/theory-pb.ts +934 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +50 -19
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +28 -2
- package/src/prover/zenon/index-table.ts +11 -21
- package/src/prover/zenon/isar-case.ts +0 -2
- package/src/prover/zenon/isar.ts +35 -37
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- package/src/prover/zenon/phrase.ts +0 -2
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/randomization.ts +1 -4
- package/src/resolve.ts +67 -143
- package/src/runtime.ts +15 -18
- package/src/sany/builtins.ts +1 -3
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +160 -2683
- package/src/sany/levels.ts +5 -11
- package/src/sany/lexer.ts +57 -60
- package/src/sany/linter.ts +0 -3
- package/src/sany/nodes.ts +6 -13
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +35 -38
- package/src/sany/xml.ts +23 -55
- package/src/search.ts +206 -44
- package/src/simulate.ts +202 -184
- package/src/spec-description.ts +56 -82
- package/src/standard-definitions.ts +4 -3
- package/src/standard-modules.ts +17 -44
- package/src/state-graph.ts +3 -17
- package/src/subexpressions.ts +38 -47
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +20 -43
- package/src/symmetry.ts +6 -21
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +96 -30
- package/src/tlc/jar-data.ts +0 -1
- package/src/tlc/messages.ts +22 -36
- package/src/tlc/order.ts +22 -47
- package/src/tlc/random.ts +22 -34
- package/src/tlc/replay.ts +21 -48
- package/src/tlc/summary.ts +64 -58
- package/src/tlc/tlc-operators.ts +6 -17
- package/src/tlc/tlcext-operators.ts +54 -26
- package/src/tlc/trace-spec.ts +26 -51
- package/src/tlc/value-stream.ts +9 -13
- package/src/tlc/version.ts +0 -1
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/values.ts +136 -338
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
package/src/simulate.ts
CHANGED
|
@@ -11,15 +11,9 @@ import {
|
|
|
11
11
|
UNEXPECTED_EXCEPTION,
|
|
12
12
|
} from "./errors";
|
|
13
13
|
import { EXIT_STATUS, getMessageExitStatus, withLivenessExitCode } from "./exit-codes";
|
|
14
|
-
import { createLivenessChecker } from "./liveness-checker";
|
|
14
|
+
import { createLivenessChecker, type LivenessChecker } from "./liveness-checker";
|
|
15
15
|
import { getIncompleteSuccessorMessage, prepareSearch, reportAssumptionViolation } from "./search";
|
|
16
|
-
import {
|
|
17
|
-
getActionLabel,
|
|
18
|
-
getInitActions,
|
|
19
|
-
getNextActions,
|
|
20
|
-
toActionValue,
|
|
21
|
-
type SpecAction,
|
|
22
|
-
} from "./spec-description";
|
|
16
|
+
import { getActionLabel, toActionValue, type SpecAction } from "./spec-description";
|
|
23
17
|
import { forEachInitialState, forEachSuccessor } from "./successors";
|
|
24
18
|
import {
|
|
25
19
|
formatInnerMessage,
|
|
@@ -32,7 +26,7 @@ import {
|
|
|
32
26
|
MESSAGE_CODE,
|
|
33
27
|
withUnexpectedException,
|
|
34
28
|
} from "./tlc/messages";
|
|
35
|
-
import { createJavaRandom, nextPrime } from "./tlc/random";
|
|
29
|
+
import { createJavaRandom, nextPrime, type JavaRandom } from "./tlc/random";
|
|
36
30
|
import { createCounterExample } from "./tlc/tlcext-operators";
|
|
37
31
|
import {
|
|
38
32
|
createModelValue,
|
|
@@ -100,8 +94,131 @@ const RL_REWARD = -10;
|
|
|
100
94
|
const isSameState = (left: Value[], right: Value[]) =>
|
|
101
95
|
left.every((value, index) => isSameValue(value, right[index]));
|
|
102
96
|
|
|
97
|
+
const getTrace = (last: TraceNode) => {
|
|
98
|
+
const trace: TraceNode[] = [];
|
|
99
|
+
for (let node: TraceNode | undefined = last; node; node = node.predecessor) {
|
|
100
|
+
const predecessor = node.predecessor;
|
|
101
|
+
if (predecessor && isSameState(node.state, predecessor.state)) continue;
|
|
102
|
+
trace.unshift(node);
|
|
103
|
+
}
|
|
104
|
+
trace.forEach((node, index) => {
|
|
105
|
+
node.predecessor = trace[index - 1];
|
|
106
|
+
node.level = index + 1;
|
|
107
|
+
});
|
|
108
|
+
return trace;
|
|
109
|
+
};
|
|
110
|
+
|
|
111
|
+
const findTemporalViolation = (
|
|
112
|
+
trace: TraceNode[],
|
|
113
|
+
getFingerprint: (state: Value[]) => bigint,
|
|
114
|
+
createChecker: (successors: number[][], states: Value[][]) => LivenessChecker | undefined,
|
|
115
|
+
) => {
|
|
116
|
+
const fingerprints = trace.map((node) => getFingerprint(node.state));
|
|
117
|
+
const indices = new Map<bigint, number>();
|
|
118
|
+
const states: Value[][] = [];
|
|
119
|
+
const successors: number[][] = [];
|
|
120
|
+
fingerprints.forEach((fingerprint, position) => {
|
|
121
|
+
if (!indices.has(fingerprint)) {
|
|
122
|
+
indices.set(fingerprint, states.length);
|
|
123
|
+
states.push(trace[position].state);
|
|
124
|
+
successors.push([]);
|
|
125
|
+
}
|
|
126
|
+
if (position === 0) return;
|
|
127
|
+
const source = indices.get(fingerprints[position - 1]) ?? 0;
|
|
128
|
+
const target = indices.get(fingerprint) ?? 0;
|
|
129
|
+
if (source !== target && !successors[source].includes(target)) {
|
|
130
|
+
successors[source].push(target);
|
|
131
|
+
}
|
|
132
|
+
});
|
|
133
|
+
const checker = createChecker(successors, states);
|
|
134
|
+
if (!checker) return undefined;
|
|
135
|
+
checker.addInitialState(0, states[0]);
|
|
136
|
+
states.forEach((state, index) =>
|
|
137
|
+
checker.addState(
|
|
138
|
+
index,
|
|
139
|
+
state,
|
|
140
|
+
successors[index].map((successor) => ({ index: successor, state: states[successor] })),
|
|
141
|
+
),
|
|
142
|
+
);
|
|
143
|
+
const lasso = checker.findViolation();
|
|
144
|
+
if (!lasso) return undefined;
|
|
145
|
+
const getLength = (path: number[]) =>
|
|
146
|
+
path.filter((index, position) => position === 0 || index !== path[position - 1]).length;
|
|
147
|
+
const path = [...lasso.prefix, ...lasso.cycle];
|
|
148
|
+
const length = getLength(path);
|
|
149
|
+
const cyclePosition = getLength(path.slice(0, lasso.prefix.length + 1));
|
|
150
|
+
const isStuttering =
|
|
151
|
+
fingerprints[length - 1] === getFingerprint(states[path[lasso.prefix.length]]);
|
|
152
|
+
return {
|
|
153
|
+
length,
|
|
154
|
+
loopStart: isStuttering ? length - 1 : cyclePosition - 1,
|
|
155
|
+
properties: checker.getViolatedProperties(
|
|
156
|
+
trace.slice(0, length).map((node) => node.state),
|
|
157
|
+
cyclePosition - 1,
|
|
158
|
+
),
|
|
159
|
+
};
|
|
160
|
+
};
|
|
161
|
+
|
|
162
|
+
const createScheduler = (
|
|
163
|
+
scheduler: SimulationOptions["scheduler"],
|
|
164
|
+
nextActions: SpecAction[],
|
|
165
|
+
random: JavaRandom,
|
|
166
|
+
getFingerprint: (state: Value[]) => bigint,
|
|
167
|
+
getReward: (state: Value[] | undefined, next: Value[], fallback: number) => number,
|
|
168
|
+
) => {
|
|
169
|
+
const qualities = nextActions.map(() => new Map<bigint | SpecAction, number>());
|
|
170
|
+
const getQualityKey = (node: TraceNode) =>
|
|
171
|
+
scheduler === "rlaction" ? node.action : getFingerprint(node.state);
|
|
172
|
+
const getRewardOf = (node: TraceNode) =>
|
|
173
|
+
getReward(node.predecessor?.state, node.state, RL_REWARD);
|
|
174
|
+
return {
|
|
175
|
+
getNextActionIndex: (node: TraceNode) => {
|
|
176
|
+
if (scheduler === "random") {
|
|
177
|
+
return Math.floor(random.nextDouble() * nextActions.length);
|
|
178
|
+
}
|
|
179
|
+
const key = getQualityKey(node);
|
|
180
|
+
qualities.forEach((quality) => {
|
|
181
|
+
if (!quality.has(key)) quality.set(key, 0);
|
|
182
|
+
});
|
|
183
|
+
const weights = qualities.map((quality) => Math.exp(quality.get(key) ?? 0));
|
|
184
|
+
const total = weights.reduce((sum, weight) => sum + weight, 0);
|
|
185
|
+
const ranked = weights
|
|
186
|
+
.map((weight, index) => ({ index, weight: weight / total }))
|
|
187
|
+
.sort((left, right) => right.weight - left.weight);
|
|
188
|
+
const threshold = random.nextDouble();
|
|
189
|
+
let cumulativeWeight = 0;
|
|
190
|
+
const chosen = ranked.find((item, position) => {
|
|
191
|
+
cumulativeWeight = position === 0 ? item.weight : cumulativeWeight + item.weight;
|
|
192
|
+
return cumulativeWeight >= threshold;
|
|
193
|
+
});
|
|
194
|
+
return (chosen ?? ranked[ranked.length - 1]).index;
|
|
195
|
+
},
|
|
196
|
+
markDisabled: (index: number, node: TraceNode) => {
|
|
197
|
+
if (scheduler === "random") return;
|
|
198
|
+
// TLC's rlaction scheduler stores the reward, then overwrites it as the rl scheduler does.
|
|
199
|
+
if (scheduler === "rlaction") getRewardOf(node);
|
|
200
|
+
qualities[index].set(getQualityKey(node), -Number.MAX_VALUE);
|
|
201
|
+
},
|
|
202
|
+
learnTrace: (last: TraceNode) => {
|
|
203
|
+
for (let node = last; node.predecessor; node = node.predecessor) {
|
|
204
|
+
const key = getQualityKey(node);
|
|
205
|
+
const maxQuality = qualities.reduce(
|
|
206
|
+
(max, quality) => Math.max(max, quality.get(key) ?? -Number.MAX_VALUE),
|
|
207
|
+
-Number.MAX_VALUE,
|
|
208
|
+
);
|
|
209
|
+
const quality = qualities[nextActions.indexOf(node.action)];
|
|
210
|
+
const predecessorKey = getQualityKey(node.predecessor);
|
|
211
|
+
quality.set(
|
|
212
|
+
predecessorKey,
|
|
213
|
+
(1 - RL_ALPHA) * (quality.get(predecessorKey) ?? 0) +
|
|
214
|
+
RL_ALPHA * (getRewardOf(node) + RL_GAMMA * maxQuality),
|
|
215
|
+
);
|
|
216
|
+
}
|
|
217
|
+
},
|
|
218
|
+
};
|
|
219
|
+
};
|
|
220
|
+
|
|
103
221
|
export const simulate = (options: SimulationOptions): number => {
|
|
104
|
-
const isTool = options.isTool ?? false;
|
|
105
222
|
const output = options.onSimulation;
|
|
106
223
|
const prepared = prepareSearch(options);
|
|
107
224
|
const config = prepared.config;
|
|
@@ -111,8 +228,7 @@ export const simulate = (options: SimulationOptions): number => {
|
|
|
111
228
|
const search = prepared.search;
|
|
112
229
|
const seed = options.seed ?? 0n;
|
|
113
230
|
const traceDepth = options.traceDepth === -1 ? INFINITE_DEPTH : options.traceDepth;
|
|
114
|
-
|
|
115
|
-
// seeded with the next long of it.
|
|
231
|
+
const traceLimit = options.traceCount ?? (1n << 63n) - 1n;
|
|
116
232
|
const random = createJavaRandom(seed);
|
|
117
233
|
for (let index = 0n; index < options.aril; index++) random.nextDouble();
|
|
118
234
|
const workerRandom = createJavaRandom(random.nextLong());
|
|
@@ -124,13 +240,17 @@ export const simulate = (options: SimulationOptions): number => {
|
|
|
124
240
|
seed,
|
|
125
241
|
aril: options.aril,
|
|
126
242
|
};
|
|
127
|
-
const
|
|
243
|
+
const reportMessage = (code: number, text: string, toolText = text, isError = true) =>
|
|
128
244
|
output({ kind: "message", code, isError, message: text, toolMessage: toolText });
|
|
129
245
|
const printSummary = () => output({ kind: "summary", statistics: { ...statistics } });
|
|
130
246
|
const nodes = new WeakMap<(Value | undefined)[], TraceNode>();
|
|
131
|
-
const
|
|
132
|
-
const
|
|
133
|
-
const
|
|
247
|
+
const description = prepared.getDescription();
|
|
248
|
+
const initActions = description.inits;
|
|
249
|
+
const nextActions = description.actions;
|
|
250
|
+
let traceCount = 0;
|
|
251
|
+
let currentTrace = 0;
|
|
252
|
+
let evaluatedAction: SpecAction | undefined;
|
|
253
|
+
runtime.getSuccessorAction = () => evaluatedAction;
|
|
134
254
|
runtime.getLevel = (state) => nodes.get(state)?.level ?? 0;
|
|
135
255
|
runtime.getBehavior = (state) => {
|
|
136
256
|
const node = nodes.get(state);
|
|
@@ -140,7 +260,7 @@ export const simulate = (options: SimulationOptions): number => {
|
|
|
140
260
|
const node = state && nodes.get(state);
|
|
141
261
|
switch (key) {
|
|
142
262
|
case "diameter":
|
|
143
|
-
return
|
|
263
|
+
return currentTrace === 0 ? 0 : traceCount + 1;
|
|
144
264
|
case "generated":
|
|
145
265
|
case "distinct":
|
|
146
266
|
case "queue":
|
|
@@ -151,7 +271,7 @@ export const simulate = (options: SimulationOptions): number => {
|
|
|
151
271
|
return createRecord([
|
|
152
272
|
["mode", options.isGenerating ? "generate" : "simulate"],
|
|
153
273
|
["depth", traceDepth === INFINITE_DEPTH ? -1 : traceDepth],
|
|
154
|
-
["traces", Number(BigInt.asIntN(32,
|
|
274
|
+
["traces", Number(BigInt.asIntN(32, traceLimit))],
|
|
155
275
|
["deadlock", config.checkDeadlock],
|
|
156
276
|
["seed", String(seed)],
|
|
157
277
|
["aril", String(options.aril)],
|
|
@@ -172,7 +292,7 @@ export const simulate = (options: SimulationOptions): number => {
|
|
|
172
292
|
"behavior",
|
|
173
293
|
createRecord([
|
|
174
294
|
["actions", createRecord([...actions])],
|
|
175
|
-
["id",
|
|
295
|
+
["id", currentTrace],
|
|
176
296
|
]),
|
|
177
297
|
],
|
|
178
298
|
["worker", 0],
|
|
@@ -195,7 +315,7 @@ export const simulate = (options: SimulationOptions): number => {
|
|
|
195
315
|
const postcondition = search.findPostconditionViolation(isAfterViolation);
|
|
196
316
|
if (!postcondition) return undefined;
|
|
197
317
|
if (postcondition.counts !== undefined) (options.onPrint ?? console.log)(postcondition.counts);
|
|
198
|
-
|
|
318
|
+
reportMessage(
|
|
199
319
|
postcondition.code,
|
|
200
320
|
postcondition.message,
|
|
201
321
|
formatInnerMessage(postcondition.code, postcondition.message, true),
|
|
@@ -219,7 +339,7 @@ export const simulate = (options: SimulationOptions): number => {
|
|
|
219
339
|
const assumptionStatus = reportAssumptionViolation(
|
|
220
340
|
specification.assumptions,
|
|
221
341
|
environment,
|
|
222
|
-
|
|
342
|
+
reportMessage,
|
|
223
343
|
);
|
|
224
344
|
if (assumptionStatus !== undefined) return assumptionStatus;
|
|
225
345
|
const initAction = initActions[initActions.length - 1];
|
|
@@ -228,23 +348,8 @@ export const simulate = (options: SimulationOptions): number => {
|
|
|
228
348
|
nodes.set(state, node);
|
|
229
349
|
return node;
|
|
230
350
|
};
|
|
231
|
-
const getTrace = (last: TraceNode) => {
|
|
232
|
-
const trace: TraceNode[] = [];
|
|
233
|
-
for (let node: TraceNode | undefined = last; node; node = node.predecessor) {
|
|
234
|
-
const predecessor = node.predecessor;
|
|
235
|
-
if (predecessor && isSameState(node.state, predecessor.state)) continue;
|
|
236
|
-
trace.unshift(node);
|
|
237
|
-
}
|
|
238
|
-
trace.forEach((node, index) => {
|
|
239
|
-
node.predecessor = trace[index - 1];
|
|
240
|
-
node.level = index + 1;
|
|
241
|
-
});
|
|
242
|
-
return trace;
|
|
243
|
-
};
|
|
244
351
|
const toRecord = (state: (Value | undefined)[]) =>
|
|
245
352
|
search.toRecord(state.map((value) => value ?? createModelValue("null")));
|
|
246
|
-
// Simulator.printBehavior evaluates the alias of each state with its successor, the last state
|
|
247
|
-
// with itself.
|
|
248
353
|
const toTraceSteps = (trace: TraceNode[]): TraceStep[] =>
|
|
249
354
|
trace.map((node, index) => ({
|
|
250
355
|
action: node.action.name,
|
|
@@ -256,7 +361,7 @@ export const simulate = (options: SimulationOptions): number => {
|
|
|
256
361
|
config.alias,
|
|
257
362
|
node.state,
|
|
258
363
|
(trace[index + 1] ?? node).state,
|
|
259
|
-
isTool,
|
|
364
|
+
options.isTool ?? false,
|
|
260
365
|
),
|
|
261
366
|
}));
|
|
262
367
|
const getCounterExample = (trace: TraceNode[]) =>
|
|
@@ -273,7 +378,7 @@ export const simulate = (options: SimulationOptions): number => {
|
|
|
273
378
|
const reportInitialException = (error: unknown, state: Value[] | undefined) => {
|
|
274
379
|
const failure = toEvaluationError(error);
|
|
275
380
|
if (!state) {
|
|
276
|
-
|
|
381
|
+
reportMessage(
|
|
277
382
|
MESSAGE_CODE.general,
|
|
278
383
|
`${getUnexpectedPrefix(failure)}${failure.message}`,
|
|
279
384
|
`${getUnexpectedPrefix(failure)}${formatNestedMessage(failure.message, true)}`,
|
|
@@ -283,7 +388,7 @@ export const simulate = (options: SimulationOptions): number => {
|
|
|
283
388
|
}
|
|
284
389
|
const text = getFailureMessage(failure, false);
|
|
285
390
|
const initial = `While working on the initial state:\n${formatState(toRecord(state))}`;
|
|
286
|
-
|
|
391
|
+
reportMessage(
|
|
287
392
|
MESSAGE_CODE.initialState,
|
|
288
393
|
`${text.message}\n${initial}`,
|
|
289
394
|
`${text.toolMessage}\n${initial}`,
|
|
@@ -303,7 +408,7 @@ export const simulate = (options: SimulationOptions): number => {
|
|
|
303
408
|
return reportInitialException(error, undefined);
|
|
304
409
|
}
|
|
305
410
|
statistics.generatedStates = generated.length;
|
|
306
|
-
|
|
411
|
+
reportMessage(
|
|
307
412
|
MESSAGE_CODE.computingInitProgress,
|
|
308
413
|
`Computed ${generated.length} initial states...`,
|
|
309
414
|
undefined,
|
|
@@ -311,7 +416,7 @@ export const simulate = (options: SimulationOptions): number => {
|
|
|
311
416
|
);
|
|
312
417
|
for (const state of generated) {
|
|
313
418
|
if (!isComplete(state)) {
|
|
314
|
-
|
|
419
|
+
reportMessage(
|
|
315
420
|
MESSAGE_CODE.initialStateIncomplete,
|
|
316
421
|
`State is not completely specified by the initial predicate:\n${formatState(toRecord(state))}`,
|
|
317
422
|
);
|
|
@@ -322,7 +427,7 @@ export const simulate = (options: SimulationOptions): number => {
|
|
|
322
427
|
const violated = search.findViolatedInvariant(state);
|
|
323
428
|
if (violated) {
|
|
324
429
|
const alias = toTraceSteps([node])[0].state;
|
|
325
|
-
|
|
430
|
+
reportMessage(
|
|
326
431
|
MESSAGE_CODE.invariantViolatedInitial,
|
|
327
432
|
`Invariant ${violated.name} is violated by the initial state:\n${formatState(alias)}`,
|
|
328
433
|
);
|
|
@@ -330,12 +435,11 @@ export const simulate = (options: SimulationOptions): number => {
|
|
|
330
435
|
reportPostcondition(true);
|
|
331
436
|
return EXIT_STATUS.safetyViolation;
|
|
332
437
|
}
|
|
333
|
-
//
|
|
334
|
-
// does, after the invariants.
|
|
438
|
+
// Deviation from TLC: its simulator checks no implied init, tla-ts checks them after invariants.
|
|
335
439
|
const predicate = search.findFailedInitialPredicate(state);
|
|
336
440
|
if (predicate) {
|
|
337
441
|
const alias = toTraceSteps([node])[0].state;
|
|
338
|
-
|
|
442
|
+
reportMessage(
|
|
339
443
|
MESSAGE_CODE.propertyViolatedInitial,
|
|
340
444
|
`Property ${predicate.name} is violated by the initial state:\n${formatState(alias)}`,
|
|
341
445
|
);
|
|
@@ -352,82 +456,26 @@ export const simulate = (options: SimulationOptions): number => {
|
|
|
352
456
|
}
|
|
353
457
|
}
|
|
354
458
|
if (generated.length === 0) {
|
|
355
|
-
|
|
459
|
+
reportMessage(
|
|
356
460
|
MESSAGE_CODE.noInitialStates,
|
|
357
461
|
"There is no state satisfying the initial state predicate.",
|
|
358
462
|
);
|
|
359
463
|
return EXIT_STATUS.error;
|
|
360
464
|
}
|
|
361
465
|
if (initialStates.length === 0) {
|
|
362
|
-
|
|
466
|
+
reportMessage(
|
|
363
467
|
MESSAGE_CODE.noInitialStatesInModel,
|
|
364
468
|
"There is no state satisfying the initial state predicate and the state-constraint(s).",
|
|
365
469
|
);
|
|
366
470
|
return EXIT_STATUS.error;
|
|
367
471
|
}
|
|
368
|
-
|
|
472
|
+
reportMessage(
|
|
369
473
|
MESSAGE_CODE.initGenerated1,
|
|
370
474
|
`Finished computing initial states: ${initialStates.length} distinct state generated at ${formatTlcDate(new Date())}.`,
|
|
371
475
|
undefined,
|
|
372
476
|
false,
|
|
373
477
|
);
|
|
374
478
|
|
|
375
|
-
const findTemporalViolation = (last: TraceNode): Violation | undefined => {
|
|
376
|
-
if (temporalProperties.length === 0) return undefined;
|
|
377
|
-
const trace = getTrace(last);
|
|
378
|
-
const fingerprints = trace.map((node) => runtime.getFingerprint(node.state));
|
|
379
|
-
const indices = new Map<bigint, number>();
|
|
380
|
-
const states: Value[][] = [];
|
|
381
|
-
const successors: number[][] = [];
|
|
382
|
-
fingerprints.forEach((fingerprint, position) => {
|
|
383
|
-
if (!indices.has(fingerprint)) {
|
|
384
|
-
indices.set(fingerprint, states.length);
|
|
385
|
-
states.push(trace[position].state);
|
|
386
|
-
successors.push([]);
|
|
387
|
-
}
|
|
388
|
-
if (position === 0) return;
|
|
389
|
-
const source = indices.get(fingerprints[position - 1]) ?? 0;
|
|
390
|
-
const target = indices.get(fingerprint) ?? 0;
|
|
391
|
-
if (source !== target && !successors[source].includes(target)) {
|
|
392
|
-
successors[source].push(target);
|
|
393
|
-
}
|
|
394
|
-
});
|
|
395
|
-
const checker = createTemporalChecker(successors, states);
|
|
396
|
-
if (!checker) return undefined;
|
|
397
|
-
checker.addInitialState(0, states[0]);
|
|
398
|
-
states.forEach((state, index) =>
|
|
399
|
-
checker.addState(
|
|
400
|
-
index,
|
|
401
|
-
state,
|
|
402
|
-
successors[index].map((successor) => ({ index: successor, state: states[successor] })),
|
|
403
|
-
),
|
|
404
|
-
);
|
|
405
|
-
const lasso = checker.findViolation();
|
|
406
|
-
if (!lasso) return undefined;
|
|
407
|
-
// StateTraceResolver recovers the states of the counterexample by their position in the
|
|
408
|
-
// behavior, so TLC prints as many states of the behavior as the counterexample has.
|
|
409
|
-
const getLength = (path: number[]) =>
|
|
410
|
-
path.filter((index, position) => position === 0 || index !== path[position - 1]).length;
|
|
411
|
-
const path = [...lasso.prefix, ...lasso.cycle];
|
|
412
|
-
const length = getLength(path);
|
|
413
|
-
const cyclePosition = getLength(path.slice(0, lasso.prefix.length + 1));
|
|
414
|
-
const printed = trace.slice(0, length);
|
|
415
|
-
const isStuttering =
|
|
416
|
-
fingerprints[length - 1] === runtime.getFingerprint(states[path[lasso.prefix.length]]);
|
|
417
|
-
const loopStart = isStuttering ? length - 1 : cyclePosition - 1;
|
|
418
|
-
const properties = checker.getViolatedProperties(
|
|
419
|
-
printed.map((node) => node.state),
|
|
420
|
-
cyclePosition - 1,
|
|
421
|
-
);
|
|
422
|
-
const back = trace[length];
|
|
423
|
-
return {
|
|
424
|
-
name: properties[0],
|
|
425
|
-
properties,
|
|
426
|
-
trace: toTraceSteps(printed),
|
|
427
|
-
loopStart,
|
|
428
|
-
loopLabel: back && getActionLabel(back.action, options.version, back.level === 1),
|
|
429
|
-
};
|
|
430
|
-
};
|
|
431
479
|
const toWorkerError = (code: number, text: string, node: TraceNode): WorkerError => ({
|
|
432
480
|
code,
|
|
433
481
|
message: text,
|
|
@@ -438,8 +486,9 @@ export const simulate = (options: SimulationOptions): number => {
|
|
|
438
486
|
});
|
|
439
487
|
const getSuccessors = (current: TraceNode, action: SpecAction) => {
|
|
440
488
|
const successors: TraceNode[] = [];
|
|
441
|
-
|
|
489
|
+
let failure: WorkerError | undefined;
|
|
442
490
|
runtime.deferred = undefined;
|
|
491
|
+
evaluatedAction = action;
|
|
443
492
|
try {
|
|
444
493
|
forEachSuccessor(
|
|
445
494
|
action.expression,
|
|
@@ -453,7 +502,7 @@ export const simulate = (options: SimulationOptions): number => {
|
|
|
453
502
|
try {
|
|
454
503
|
const violated = search.findViolatedInvariant(node.state, current.state);
|
|
455
504
|
if (violated) {
|
|
456
|
-
failure
|
|
505
|
+
failure = toWorkerError(
|
|
457
506
|
MESSAGE_CODE.invariantViolatedBehavior,
|
|
458
507
|
`Invariant ${violated.name} is violated.`,
|
|
459
508
|
node,
|
|
@@ -462,7 +511,7 @@ export const simulate = (options: SimulationOptions): number => {
|
|
|
462
511
|
}
|
|
463
512
|
const property = search.findViolatedActionProperty(current.state, node.state);
|
|
464
513
|
if (property) {
|
|
465
|
-
failure
|
|
514
|
+
failure = toWorkerError(
|
|
466
515
|
MESSAGE_CODE.actionPropertyViolatedBehavior,
|
|
467
516
|
`Action property ${property.name} is violated.`,
|
|
468
517
|
node,
|
|
@@ -472,7 +521,7 @@ export const simulate = (options: SimulationOptions): number => {
|
|
|
472
521
|
} catch (error) {
|
|
473
522
|
if (!(error instanceof TlaEvaluationError) || !isHeadedError(error)) throw error;
|
|
474
523
|
const text = getFailureMessage(error, true);
|
|
475
|
-
failure
|
|
524
|
+
failure = {
|
|
476
525
|
...toWorkerError(text.code, text.message, node),
|
|
477
526
|
toolMessage: text.toolMessage,
|
|
478
527
|
};
|
|
@@ -504,96 +553,68 @@ export const simulate = (options: SimulationOptions): number => {
|
|
|
504
553
|
);
|
|
505
554
|
return { successors, error: toWorkerError(MESSAGE_CODE.incompleteSuccessor, text, node) };
|
|
506
555
|
}
|
|
507
|
-
return { successors, error: failure
|
|
556
|
+
return { successors, error: failure };
|
|
508
557
|
};
|
|
509
|
-
|
|
510
|
-
const
|
|
511
|
-
|
|
512
|
-
|
|
513
|
-
|
|
514
|
-
|
|
515
|
-
|
|
516
|
-
|
|
517
|
-
|
|
518
|
-
|
|
519
|
-
const
|
|
520
|
-
|
|
521
|
-
|
|
522
|
-
|
|
523
|
-
|
|
524
|
-
|
|
525
|
-
|
|
526
|
-
.
|
|
527
|
-
.
|
|
528
|
-
|
|
529
|
-
|
|
530
|
-
const chosen = ranked.find((item, position) => {
|
|
531
|
-
cumulative.weight = position === 0 ? item.weight : cumulative.weight + item.weight;
|
|
532
|
-
return cumulative.weight >= random;
|
|
533
|
-
});
|
|
534
|
-
return (chosen ?? ranked[ranked.length - 1]).index;
|
|
535
|
-
};
|
|
536
|
-
const markDisabled = (index: number, node: TraceNode) => {
|
|
537
|
-
if (options.scheduler === "random") return;
|
|
538
|
-
// TLC's rlaction scheduler stores the reward, then overwrites it as the rl scheduler does.
|
|
539
|
-
if (options.scheduler === "rlaction") getRewardOf(node);
|
|
540
|
-
qualities[index].set(getQualityKey(node), -Number.MAX_VALUE);
|
|
541
|
-
};
|
|
542
|
-
const learnTrace = (last: TraceNode) => {
|
|
543
|
-
for (let node = last; node.predecessor; node = node.predecessor) {
|
|
544
|
-
const key = getQualityKey(node);
|
|
545
|
-
const maxQuality = qualities.reduce(
|
|
546
|
-
(max, quality) => Math.max(max, quality.get(key) ?? -Number.MAX_VALUE),
|
|
547
|
-
-Number.MAX_VALUE,
|
|
548
|
-
);
|
|
549
|
-
const quality = qualities[nextActions.indexOf(node.action)];
|
|
550
|
-
const predecessorKey = getQualityKey(node.predecessor);
|
|
551
|
-
quality.set(
|
|
552
|
-
predecessorKey,
|
|
553
|
-
(1 - RL_ALPHA) * (quality.get(predecessorKey) ?? 0) +
|
|
554
|
-
RL_ALPHA * (getRewardOf(node) + RL_GAMMA * maxQuality),
|
|
555
|
-
);
|
|
556
|
-
}
|
|
558
|
+
let currentNode = initialStates[0];
|
|
559
|
+
const scheduler = createScheduler(
|
|
560
|
+
options.scheduler,
|
|
561
|
+
nextActions,
|
|
562
|
+
workerRandom,
|
|
563
|
+
runtime.getFingerprint,
|
|
564
|
+
search.getReward,
|
|
565
|
+
);
|
|
566
|
+
const getTemporalViolation = (last: TraceNode): Violation | undefined => {
|
|
567
|
+
if (temporalProperties.length === 0) return undefined;
|
|
568
|
+
const trace = getTrace(last);
|
|
569
|
+
const found = findTemporalViolation(trace, runtime.getFingerprint, createTemporalChecker);
|
|
570
|
+
if (!found) return undefined;
|
|
571
|
+
const back = trace[found.length];
|
|
572
|
+
return {
|
|
573
|
+
name: found.properties[0],
|
|
574
|
+
properties: found.properties,
|
|
575
|
+
trace: toTraceSteps(trace.slice(0, found.length)),
|
|
576
|
+
loopStart: found.loopStart,
|
|
577
|
+
loopLabel: back && getActionLabel(back.action, options.version, back.level === 1),
|
|
578
|
+
};
|
|
557
579
|
};
|
|
558
580
|
const simulateTrace = (): WorkerError | "stopped" | undefined => {
|
|
559
|
-
|
|
581
|
+
currentNode = initialStates[Math.floor(workerRandom.nextDouble() * initialStates.length)];
|
|
560
582
|
for (let depth = 0; depth < traceDepth; depth++) {
|
|
561
583
|
if (runtime.isStopped) return "stopped";
|
|
562
|
-
|
|
584
|
+
let actionIndex = scheduler.getNextActionIndex(currentNode);
|
|
563
585
|
const prime = nextPrime(workerRandom);
|
|
564
|
-
|
|
586
|
+
let successors: TraceNode[] = [];
|
|
565
587
|
for (let attempt = 0; attempt < nextActions.length; attempt++) {
|
|
566
|
-
const result = getSuccessors(
|
|
588
|
+
const result = getSuccessors(currentNode, nextActions[actionIndex]);
|
|
567
589
|
if (result.error) return result.error;
|
|
568
|
-
|
|
569
|
-
if (
|
|
570
|
-
markDisabled(
|
|
571
|
-
|
|
590
|
+
successors = result.successors;
|
|
591
|
+
if (successors.length > 0) break;
|
|
592
|
+
scheduler.markDisabled(actionIndex, currentNode);
|
|
593
|
+
actionIndex = (actionIndex + prime) % nextActions.length;
|
|
572
594
|
}
|
|
573
|
-
if (
|
|
595
|
+
if (successors.length === 0) {
|
|
574
596
|
if (config.checkDeadlock) {
|
|
575
|
-
return toWorkerError(MESSAGE_CODE.deadlockReached, "Deadlock reached.",
|
|
597
|
+
return toWorkerError(MESSAGE_CODE.deadlockReached, "Deadlock reached.", currentNode);
|
|
576
598
|
}
|
|
577
599
|
break;
|
|
578
600
|
}
|
|
579
|
-
|
|
580
|
-
|
|
581
|
-
current.node.deferred?.(current.node.state);
|
|
601
|
+
currentNode = successors[Math.floor(workerRandom.nextDouble() * successors.length)];
|
|
602
|
+
currentNode.deferred?.(currentNode.state);
|
|
582
603
|
}
|
|
583
604
|
if (runtime.isStopped) return "stopped";
|
|
584
|
-
const violation =
|
|
605
|
+
const violation = getTemporalViolation(currentNode);
|
|
585
606
|
if (violation) {
|
|
586
607
|
return {
|
|
587
|
-
...toWorkerError(MESSAGE_CODE.temporalPropertyViolated, "",
|
|
608
|
+
...toWorkerError(MESSAGE_CODE.temporalPropertyViolated, "", currentNode),
|
|
588
609
|
isException: true,
|
|
589
610
|
violation,
|
|
590
611
|
};
|
|
591
612
|
}
|
|
592
|
-
const length = Math.min(traceDepth,
|
|
613
|
+
const length = Math.min(traceDepth, currentNode.level);
|
|
593
614
|
const delta = length - statistics.levelMean;
|
|
594
615
|
statistics.levelMean += Math.trunc(delta / Math.max(statistics.traces, 1));
|
|
595
616
|
statistics.levelM2 += delta * (length - statistics.levelMean);
|
|
596
|
-
if (options.scheduler === "rl") learnTrace(
|
|
617
|
+
if (options.scheduler === "rl") scheduler.learnTrace(currentNode);
|
|
597
618
|
return undefined;
|
|
598
619
|
};
|
|
599
620
|
const toException = (error: unknown, node: TraceNode): WorkerError => {
|
|
@@ -624,24 +645,22 @@ export const simulate = (options: SimulationOptions): number => {
|
|
|
624
645
|
runtime.getRandom = () => enumerableRandom;
|
|
625
646
|
const errors: WorkerError[] = [];
|
|
626
647
|
const isContinued = options.isContinued ?? false;
|
|
627
|
-
const traceLimit = options.traceCount ?? (1n << 63n) - 1n;
|
|
628
648
|
while (true) {
|
|
629
649
|
statistics.traces++;
|
|
630
|
-
|
|
650
|
+
currentTrace = statistics.traces;
|
|
631
651
|
const outcome = (() => {
|
|
632
652
|
try {
|
|
633
653
|
return simulateTrace();
|
|
634
654
|
} catch (error) {
|
|
635
|
-
return toException(error,
|
|
655
|
+
return toException(error, currentNode);
|
|
636
656
|
}
|
|
637
657
|
})();
|
|
638
658
|
if (outcome === "stopped") break;
|
|
639
|
-
|
|
659
|
+
traceCount++;
|
|
640
660
|
if (outcome) errors.push(outcome);
|
|
641
661
|
if (outcome?.isException) break;
|
|
642
|
-
if (BigInt(
|
|
643
|
-
//
|
|
644
|
-
// Without a bound on them, it starts the next before the Simulator stops it.
|
|
662
|
+
if (BigInt(traceCount) >= traceLimit) break;
|
|
663
|
+
// TLC's worker starts one more behavior before the Simulator stops it, unless traces are bounded.
|
|
645
664
|
const isStopping = outcome !== undefined && (!isContinued || FATAL_CODES.has(outcome.code));
|
|
646
665
|
if (isStopping && options.traceCount === undefined) {
|
|
647
666
|
statistics.traces++;
|
|
@@ -662,11 +681,10 @@ export const simulate = (options: SimulationOptions): number => {
|
|
|
662
681
|
printSummary();
|
|
663
682
|
return;
|
|
664
683
|
}
|
|
665
|
-
|
|
666
|
-
const nodes = getTrace(error.node);
|
|
684
|
+
reportMessage(error.code, error.message, error.toolMessage);
|
|
667
685
|
output({
|
|
668
686
|
kind: "behavior",
|
|
669
|
-
trace: toTraceSteps(
|
|
687
|
+
trace: toTraceSteps(getTrace(error.node)),
|
|
670
688
|
isLastStateOnly: traceDepth === INFINITE_DEPTH,
|
|
671
689
|
});
|
|
672
690
|
if (error.isSummarized) printSummary();
|