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