tla-ts 0.0.4-dev.702eb98 → 0.0.4-dev.7714e32
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 +32 -6
- package/dist/cli.cjs +1 -1
- package/dist/cli.js +1 -1
- package/dist/deciders.cjs +27 -27
- package/dist/deciders.js +34 -34
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +12 -14
- package/dist/index.d.ts +12 -14
- 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 +516 -25
- package/dist/prove.js +518 -27
- package/dist/run.cjs +45 -0
- package/dist/run.js +45 -0
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +76 -86
- package/dist/transfer.js +73 -83
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +1 -1
- package/src/ast.ts +2 -2
- package/src/bags.ts +22 -23
- package/src/builtins.ts +16 -8
- package/src/check.ts +131 -1154
- package/src/{cli-options.ts → cli/options.ts} +54 -9
- package/src/cli/run.ts +63 -0
- package/src/cli/shared.ts +106 -0
- package/src/cli/tlapm.ts +374 -0
- package/src/{run-cli.ts → cli/tlc.ts} +112 -761
- package/src/cli/xml-exporter.ts +221 -0
- package/src/cli.ts +1 -1
- package/src/codegen.ts +17 -15
- package/src/config.ts +5 -5
- package/src/dependencies.ts +4 -6
- package/src/environment.ts +55 -60
- package/src/errors.ts +12 -36
- package/src/evaluate.ts +81 -101
- package/src/exit-codes.ts +1 -1
- package/src/fingerprints.ts +3 -3
- package/src/index.ts +2 -2
- package/src/instances.ts +56 -46
- package/src/java-overrides.ts +79 -41
- package/src/json.ts +31 -36
- package/src/levels.ts +10 -13
- package/src/{live-check.ts → liveness-checker.ts} +169 -142
- package/src/liveness.ts +38 -34
- package/src/obligations/action.ts +58 -105
- package/src/obligations/{anon.ts → anonymize.ts} +44 -52
- package/src/obligations/equality.ts +260 -0
- package/src/obligations/expression.ts +42 -530
- package/src/obligations/format.ts +7 -8
- package/src/obligations/generate.ts +93 -783
- package/src/obligations/index.ts +23 -23
- package/src/obligations/levels.ts +38 -44
- package/src/obligations/module.ts +106 -729
- package/src/obligations/normalize.ts +554 -0
- package/src/obligations/operators.ts +176 -0
- package/src/obligations/pragma.ts +35 -29
- package/src/obligations/printer.ts +98 -209
- package/src/obligations/proof.ts +0 -1
- package/src/obligations/regroup.ts +100 -0
- package/src/obligations/simplify.ts +668 -0
- package/src/obligations/source.ts +92 -192
- package/src/obligations/{deref.ts → subexpression.ts} +82 -113
- package/src/obligations/substitution.ts +261 -0
- package/src/obligations/temporal.ts +32 -30
- package/src/obligations/tuples.ts +37 -53
- package/src/parallel-worker.ts +37 -33
- package/src/parallel.ts +30 -24
- package/src/parser.ts +67 -74
- package/src/{pcal-ast.ts → pcal/ast.ts} +2 -17
- package/src/{pcal-parse.ts → pcal/parse.ts} +28 -64
- package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +10 -39
- package/src/{pcal-translate.ts → pcal/translate.ts} +30 -109
- package/src/{pcal-validate.ts → pcal/validate.ts} +10 -20
- package/src/{prove → prover}/decide-pool.ts +14 -19
- package/src/{prove → prover}/deciders.ts +7 -1
- package/src/{obligations/pickle.ts → prover/first-order.ts} +79 -4
- package/src/{prove → prover}/isabelle/decide.ts +3 -6
- package/src/{prove → prover}/isabelle/encode.ts +106 -138
- package/src/{prove → prover}/isabelle/isar/inner-syntax.ts +1 -1
- package/src/{prove → prover}/isabelle/isar/method.ts +3 -3
- package/src/{prove → prover}/isabelle/isar/type-check.ts +1 -1
- package/src/{prove → prover}/isabelle/provers/blast/blast.ts +1 -1
- package/src/{prove → prover}/isabelle/provers/blast/branch.ts +1 -1
- package/src/{prove → prover}/isabelle/provers/blast/term.ts +3 -4
- package/src/{prove → prover}/isabelle/provers/clasimp.ts +1 -1
- package/src/{prove → prover}/isabelle/provers/classical.ts +3 -3
- package/src/{prove → prover}/isabelle/provers/hypsubst.ts +1 -9
- package/src/{prove → prover}/isabelle/pure/conv.ts +1 -1
- package/src/{prove → prover}/isabelle/pure/drule.ts +2 -2
- package/src/{prove → prover}/isabelle/pure/envir.ts +3 -35
- package/src/{prove → prover}/isabelle/pure/logic.ts +4 -76
- package/src/{prove → prover}/isabelle/pure/name.ts +1 -13
- package/src/{prove → prover}/isabelle/pure/net.ts +2 -49
- package/src/{prove → prover}/isabelle/pure/pattern.ts +3 -22
- package/src/{prove → prover}/isabelle/pure/raw-simplifier.ts +3 -18
- package/src/{prove → prover}/isabelle/pure/seq.ts +0 -23
- package/src/{prove → prover}/isabelle/pure/simplifier.ts +2 -8
- package/src/{prove → prover}/isabelle/pure/table.ts +1 -8
- package/src/{prove → prover}/isabelle/pure/tactic.ts +5 -113
- package/src/{prove → prover}/isabelle/pure/tactical.ts +1 -84
- package/src/{prove → prover}/isabelle/pure/term-ord.ts +1 -55
- package/src/{prove → prover}/isabelle/pure/term.ts +8 -128
- package/src/{prove → prover}/isabelle/pure/thm.ts +4 -27
- package/src/{prove → prover}/isabelle/pure/type.ts +0 -12
- package/src/{prove → prover}/isabelle/pure/unify.ts +1 -1
- package/src/{prove → prover}/isabelle/tla/classical-setup.ts +1 -1
- package/src/{prove → prover}/ocaml.ts +1 -1
- package/src/{prove → prover}/prep/action.ts +54 -66
- package/src/{prove → prover}/prep/enabled-axioms.ts +2 -2
- package/src/{prove → prover}/prep/fingerprint.ts +3 -3
- package/src/{prove → prover}/prep/level-comparison.ts +15 -38
- package/src/{prove → prover}/prep/md5.ts +2 -9
- package/src/{prove/prep/pragma.ts → prover/prep/methods.ts} +4 -4
- package/src/prover/prep/normalize.ts +309 -0
- package/src/{prove → prover}/prove-worker.ts +4 -11
- package/src/prover/prove.ts +492 -0
- package/src/{prove → prover}/ptl/encode.ts +19 -31
- package/src/{prove → prover}/smt/axioms.ts +78 -79
- package/src/{prove → prover}/smt/data.ts +16 -45
- package/src/{prove → prover}/smt/encode.ts +134 -28
- package/src/{prove → prover}/smt/extensionality.ts +14 -12
- package/src/{prove → prover}/smt/flatten.ts +3 -18
- package/src/{prove → prover}/smt/format.ts +14 -3
- package/src/{prove → prover}/smt/instances.ts +4 -5
- package/src/{prove → prover}/smt/rewrite.ts +41 -59
- package/src/{prove → prover}/smt/solver/ast-util.ts +0 -56
- package/src/{prove → prover}/smt/solver/case-split-queue.ts +1 -1
- package/src/{prove → prover}/smt/solver/enode.ts +1 -1
- package/src/{prove → prover}/smt/solver/lp/dep-intervals.ts +0 -14
- package/src/{prove → prover}/smt/solver/model-macro-solver.ts +1 -1
- package/src/{prove → prover}/smt/solver/nlsat/algebraic.ts +3 -3
- package/src/{prove → prover}/smt/solver/nlsat/atoms.ts +1 -1
- package/src/{prove → prover}/smt/solver/nlsat/explain.ts +1 -1
- package/src/{prove → prover}/smt/solver/nlsat/interval-set.ts +1 -1
- package/src/{prove → prover}/smt/solver/nlsat/levelwise.ts +4 -7
- package/src/{prove → prover}/smt/solver/nlsat/polynomial.ts +4 -4
- package/src/{prove → prover}/smt/solver/nlsat/upolynomial.ts +2 -2
- package/src/{prove → prover}/smt/solver/pattern-inference.ts +1 -1
- package/src/{prove → prover}/smt/solver/relevancy.ts +2 -2
- package/src/{prove → prover}/smt/solver/rewriter.ts +1 -1
- package/src/{prove → prover}/smt/solver/solver.ts +2 -2
- package/src/prover/tlapm/cache.ts +236 -0
- package/src/prover/tlapm/ocaml-marshal.ts +166 -0
- package/src/{prove → prover}/tlapm/tlapm.ts +1 -2
- package/src/prover/verdict.ts +13 -0
- package/src/{prove → prover}/zenon/decide.ts +5 -11
- package/src/{prove → prover}/zenon/encode.ts +40 -106
- package/src/{prove → prover}/zenon/eqrel.ts +1 -1
- package/src/{prove → prover}/zenon/equality-rules.ts +1 -1
- package/src/{prove → prover}/zenon/expr.ts +2 -2
- package/src/{prove → prover}/zenon/index-table.ts +1 -1
- package/src/{prove → prover}/zenon/isar.ts +1 -1
- package/src/{prove → prover}/zenon/llproof.ts +1 -1
- package/src/{prove → prover}/zenon/mltoll.ts +1 -1
- package/src/{prove → prover}/zenon/node.ts +1 -1
- package/src/{prove → prover}/zenon/search.ts +1 -1
- package/src/{prove → prover}/zenon/tla/terms.ts +1 -20
- package/src/{prove → prover}/zenon/tla/tla.ts +1 -1
- package/src/randomization.ts +19 -24
- package/src/resolve.ts +15 -22
- package/src/runtime.ts +8 -8
- package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
- package/src/{sany-generator.ts → sany/generator.ts} +38 -55
- package/src/{sany-levels.ts → sany/levels.ts} +45 -48
- package/src/{sany-lexer.ts → sany/lexer.ts} +2 -3
- package/src/{sany-linter.ts → sany/linter.ts} +1 -1
- package/src/{sany-modules.ts → sany/modules.ts} +2 -2
- package/src/{sany-nodes.ts → sany/nodes.ts} +2 -2
- package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
- package/src/{sany-report.ts → sany/report.ts} +16 -17
- package/src/{sany-selectors.ts → sany/selectors.ts} +3 -5
- package/src/{sany-source.ts → sany/source.ts} +6 -7
- package/src/{sany-xml.ts → sany/xml.ts} +5 -6
- package/src/search.ts +969 -0
- package/src/spec-description.ts +26 -20
- package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
- package/src/standard-modules.ts +16 -20
- package/src/state-graph.ts +9 -8
- package/src/substitution-levels.ts +2 -2
- package/src/successors.ts +16 -19
- package/src/symmetry.ts +1 -1
- package/src/tableau.ts +6 -7
- package/src/tlc/fingerprint.ts +214 -0
- package/src/{tlc-messages.ts → tlc/messages.ts} +119 -7
- package/src/{tlc-order.ts → tlc/order.ts} +7 -7
- package/src/{tlc-random.ts → tlc/random.ts} +3 -213
- package/src/{tlc-replay.ts → tlc/replay.ts} +40 -36
- package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
- package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +30 -25
- package/src/transfer.ts +32 -32
- package/src/values.ts +72 -67
- package/src/worker.ts +1 -4
- package/dist/run-cli.cjs +0 -38
- package/dist/run-cli.js +0 -38
- package/src/canonical.ts +0 -40
- package/src/obligations/ctx.ts +0 -64
- package/src/prove/prep/defs.ts +0 -27
- package/src/prove/prep/elab.ts +0 -156
- package/src/prove/prep/enabled.ts +0 -43
- package/src/prove/prep/flatten.ts +0 -70
- package/src/prove/prep/trivial.ts +0 -22
- package/src/prove/prove.ts +0 -417
- package/src/prove/smt/axiomatize.ts +0 -69
- package/src/prove/smt/simplify.ts +0 -57
- package/src/prove/verdict.ts +0 -13
- package/src/standard-ranges.ts +0 -116
- package/src/value-sources.ts +0 -29
- /package/src/{prove → prover}/isabelle/LICENSE +0 -0
- /package/src/{prove → prover}/isabelle/LICENSE-tlapm +0 -0
- /package/src/{prove → prover}/isabelle/isar/proof.ts +0 -0
- /package/src/{prove → prover}/isabelle/isar/statement.ts +0 -0
- /package/src/{prove → prover}/isabelle/isar/theory.ts +0 -0
- /package/src/{prove → prover}/isabelle/provers/blast/prove.ts +0 -0
- /package/src/{prove → prover}/isabelle/provers/blast/rules.ts +0 -0
- /package/src/{prove → prover}/isabelle/provers/blast/state.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/bicompose.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/consts.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/goal.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/interrupt.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/list.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/object-logic.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/rewriter.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/search.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/variable.ts +0 -0
- /package/src/{prove → prover}/isabelle/tla/context.ts +0 -0
- /package/src/{prove → prover}/isabelle/tla/logic-data.ts +0 -0
- /package/src/{prove → prover}/isabelle/tla/logic.ts +0 -0
- /package/src/{prove → prover}/isabelle/tla/simpdata.ts +0 -0
- /package/src/{prove → prover}/isabelle/tools/intuitionistic.ts +0 -0
- /package/src/{prove → prover}/ptl/decide.ts +0 -0
- /package/src/{prove → prover}/ptl/sat.ts +0 -0
- /package/src/{prove → prover}/ptl/tableau.ts +0 -0
- /package/src/{prove → prover}/smt/context.ts +0 -0
- /package/src/{prove → prover}/smt/solver/act-cache.ts +0 -0
- /package/src/{prove → prover}/smt/solver/arith-rewriter.ts +0 -0
- /package/src/{prove → prover}/smt/solver/array.ts +0 -0
- /package/src/{prove → prover}/smt/solver/asserted-formulas.ts +0 -0
- /package/src/{prove → prover}/smt/solver/ast-lt.ts +0 -0
- /package/src/{prove → prover}/smt/solver/ast.ts +0 -0
- /package/src/{prove → prover}/smt/solver/auf-solver.ts +0 -0
- /package/src/{prove → prover}/smt/solver/cg-table.ts +0 -0
- /package/src/{prove → prover}/smt/solver/clause.ts +0 -0
- /package/src/{prove → prover}/smt/solver/conflict-resolution.ts +0 -0
- /package/src/{prove → prover}/smt/solver/context.ts +0 -0
- /package/src/{prove → prover}/smt/solver/ctx-simplify.ts +0 -0
- /package/src/{prove → prover}/smt/solver/der.ts +0 -0
- /package/src/{prove → prover}/smt/solver/dyn-ack.ts +0 -0
- /package/src/{prove → prover}/smt/solver/e-matching.ts +0 -0
- /package/src/{prove → prover}/smt/solver/expr-ref.ts +0 -0
- /package/src/{prove → prover}/smt/solver/expr-safe-replace.ts +0 -0
- /package/src/{prove → prover}/smt/solver/fingerprints.ts +0 -0
- /package/src/{prove → prover}/smt/solver/flat-literals.ts +0 -0
- /package/src/{prove → prover}/smt/solver/goal.ts +0 -0
- /package/src/{prove → prover}/smt/solver/hash.ts +0 -0
- /package/src/{prove → prover}/smt/solver/hashtable.ts +0 -0
- /package/src/{prove → prover}/smt/solver/internalizer.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lbool.ts +0 -0
- /package/src/{prove → prover}/smt/solver/literal.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/bound-propagator.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/constraints.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/containers.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/core-solver.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/cross-nested.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/dependency.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/dioph-eq.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/explanation.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/gomory.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/hnf-cutter.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/hnf.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/int-cube.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/int-solver.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/lar-solver.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/lar-term.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/lp-settings.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/maximize-term.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nex-creator.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nex.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-backoff.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-basics.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-core.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-divisions.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-emonics.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-factorization.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-grobner.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-horner.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-intervals.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-monomial-bounds.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-monotone.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-order.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-patcher.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-tangents.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-throttle.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-types.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-var-eqs.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nra-solver.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/numeric-pair.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/pdd-interval.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/pdd-simplifier.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/pdd-solver.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/pdd.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/random-updater.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/static-matrix.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/union-find.ts +0 -0
- /package/src/{prove → prover}/smt/solver/mam-compiler.ts +0 -0
- /package/src/{prove → prover}/smt/solver/mam-interpreter.ts +0 -0
- /package/src/{prove → prover}/smt/solver/maximize-ac-sharing.ts +0 -0
- /package/src/{prove → prover}/smt/solver/model-checker.ts +0 -0
- /package/src/{prove → prover}/smt/solver/model-evaluator.ts +0 -0
- /package/src/{prove → prover}/smt/solver/model-finder.ts +0 -0
- /package/src/{prove → prover}/smt/solver/model-generator.ts +0 -0
- /package/src/{prove → prover}/smt/solver/nlsat/evaluator.ts +0 -0
- /package/src/{prove → prover}/smt/solver/nlsat/mpbq.ts +0 -0
- /package/src/{prove → prover}/smt/solver/nlsat/solver.ts +0 -0
- /package/src/{prove → prover}/smt/solver/nlsat/types.ts +0 -0
- /package/src/{prove → prover}/smt/solver/nlsat/upolynomial-factorization.ts +0 -0
- /package/src/{prove → prover}/smt/solver/nnf.ts +0 -0
- /package/src/{prove → prover}/smt/solver/poly-rewriter.ts +0 -0
- /package/src/{prove → prover}/smt/solver/propagate-values.ts +0 -0
- /package/src/{prove → prover}/smt/solver/proto-model.ts +0 -0
- /package/src/{prove → prover}/smt/solver/pull-quant.ts +0 -0
- /package/src/{prove → prover}/smt/solver/qe-lite-der.ts +0 -0
- /package/src/{prove → prover}/smt/solver/qe-lite-fm.ts +0 -0
- /package/src/{prove → prover}/smt/solver/qe-lite.ts +0 -0
- /package/src/{prove → prover}/smt/solver/qi-queue.ts +0 -0
- /package/src/{prove → prover}/smt/solver/quant-tactics.ts +0 -0
- /package/src/{prove → prover}/smt/solver/quantifier-analyzer.ts +0 -0
- /package/src/{prove → prover}/smt/solver/quantifier-manager.ts +0 -0
- /package/src/{prove → prover}/smt/solver/random-gen.ts +0 -0
- /package/src/{prove → prover}/smt/solver/rational.ts +0 -0
- /package/src/{prove → prover}/smt/solver/ref-vector.ts +0 -0
- /package/src/{prove → prover}/smt/solver/rewriter-tpl.ts +0 -0
- /package/src/{prove → prover}/smt/solver/rlimit.ts +0 -0
- /package/src/{prove → prover}/smt/solver/smtlib-parser.ts +0 -0
- /package/src/{prove → prover}/smt/solver/sort.ts +0 -0
- /package/src/{prove → prover}/smt/solver/sticky-generations.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra-axioms.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra-bounds.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra-final-check.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra-internalize.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra-model.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra-propagate.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra-state.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra.ts +0 -0
- /package/src/{prove → prover}/smt/solver/var-subst.ts +0 -0
- /package/src/{prove → prover}/smt/solver/z3-license.txt +0 -0
- /package/src/{prove → prover}/smt/table.ts +0 -0
- /package/src/{prove → prover}/tlaps-module.ts +0 -0
- /package/src/{prove → prover}/zenon/LICENSE +0 -0
- /package/src/{prove → prover}/zenon/check/check.ts +0 -0
- /package/src/{prove → prover}/zenon/check/definitions.ts +0 -0
- /package/src/{prove → prover}/zenon/check/equality.ts +0 -0
- /package/src/{prove → prover}/zenon/check/functions.ts +0 -0
- /package/src/{prove → prover}/zenon/check/keys.ts +0 -0
- /package/src/{prove → prover}/zenon/check/propositional.ts +0 -0
- /package/src/{prove → prover}/zenon/check/records.ts +0 -0
- /package/src/{prove → prover}/zenon/check/relations.ts +0 -0
- /package/src/{prove → prover}/zenon/check/rewrites.ts +0 -0
- /package/src/{prove → prover}/zenon/check/sets.ts +0 -0
- /package/src/{prove → prover}/zenon/check/terms.ts +0 -0
- /package/src/{prove → prover}/zenon/check/tla.ts +0 -0
- /package/src/{prove → prover}/zenon/isar-case.ts +0 -0
- /package/src/{prove → prover}/zenon/limits.ts +0 -0
- /package/src/{prove → prover}/zenon/ocaml.ts +0 -0
- /package/src/{prove → prover}/zenon/parse.ts +0 -0
- /package/src/{prove → prover}/zenon/phrase.ts +0 -0
- /package/src/{prove → prover}/zenon/proof.ts +0 -0
- /package/src/{prove → prover}/zenon/propositional-rules.ts +0 -0
- /package/src/{prove → prover}/zenon/rules.ts +0 -0
- /package/src/{prove → prover}/zenon/tla/functions.ts +0 -0
- /package/src/{prove → prover}/zenon/tla/llproof.ts +0 -0
- /package/src/{prove → prover}/zenon/tla/records.ts +0 -0
- /package/src/{prove → prover}/zenon/tla/rewrites.ts +0 -0
- /package/src/{prove → prover}/zenon/tla/sets.ts +0 -0
- /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
- /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
- /package/src/{tlc-version.ts → tlc/version.ts} +0 -0
package/dist/run.js
ADDED
|
@@ -0,0 +1,45 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* @license tla-ts
|
|
3
|
+
*
|
|
4
|
+
* Copyright (c) Aiden Bai
|
|
5
|
+
*
|
|
6
|
+
* This source code is licensed under the MIT license found in the
|
|
7
|
+
* LICENSE file in the root directory of this source tree.
|
|
8
|
+
*/
|
|
9
|
+
import{t as e}from"./tlapm.js";import{B as t,C as n,D as r,G as i,N as a,T as o,U as s,V as c,a as l,b as u,g as d,h as f,k as p,m,o as h,s as g,x as _}from"./worker.js";import{B as v,G as y,H as b,K as x,Kt as S,L as C,R as w,U as ee,Ut as T,V as E,X as D,Xt as te,Zt as ne,_t as O,f as k,ft as A,gt as re,ht as ie,jt as ae,l as j,mt as oe,p as M,pt as N,qt as se,u as ce,vt as le,yt as ue,z as de}from"./transfer.js";import{a as fe,c as pe,d as me,f as he,h as ge,i as P,l as _e,m as ve,n as ye,o as be,p as xe,s as Se,t as Ce,u as we}from"./prove.js";import{basename as Te,delimiter as Ee,dirname as De,isAbsolute as Oe,join as ke,resolve as Ae}from"node:path";import{cpSync as je,existsSync as F,globSync as I,mkdirSync as Me,readFileSync as Ne,readSync as Pe,readdirSync as Fe,realpathSync as Ie,renameSync as Le,rmSync as Re,statSync as ze,writeFileSync as Be}from"node:fs";import{pathToFileURL as Ve}from"node:url";import{arch as He,availableParallelism as Ue,release as We,tmpdir as Ge,type as Ke}from"node:os";import{getHeapStatistics as qe}from"node:v8";const Je=`META-INF/MANIFEST.MF`,Ye=async e=>{if(e===void 0||!F(e))return`master`;let t=await import(`fflate`),n=t.unzipSync(Ne(e),{filter:e=>e.name===Je})[Je];return(n&&/^X-Git-Tag: *(\S*)/m.exec(t.strFromU8(n))?.[1])===`v1.7.4`?`1.7.4`:`master`},Xe=/[*?[{]/,Ze=e=>e.flatMap(e=>Xe.test(e)?I(e).sort().map(e=>({path:e,isGlobbed:!0})):[{path:e,isGlobbed:!1}]),Qe=(e,t)=>e.map(e=>ke(e,`${t}.tla`)).find(F),$e=e=>t=>{let n=Qe(e,t);return n===void 0?void 0:Ne(n,`utf8`)},et=(e,t,n)=>console.error(`File does not exist: ${e}/${t} while looking in these directories: ${e}, ${n.join(`, `)}, classpath:/tla2sany/StandardModules, classpath:/`),tt=e=>`jar:file:${Ve(Ae(e)).pathname}!/tla2sany/StandardModules/`,nt=(e,t)=>{if(e instanceof m||e instanceof d){let n=ue(e.message),r=n&&!n.isEvalException?n.code:A.general;return t.print(r,N.error,ie(r,e.message,t.isTool))}console.error(`${e.name}: ${e.message}`)},rt=async(e,n=oe(!1))=>{try{return await e()}catch(e){if(!(e instanceof f))throw e;return nt(e,n),t(e)}},it=(e,t,n)=>console.error(`File does not exist: ${Oe(e)?e:`${process.cwd()}/${e}`} while looking in these directories: ${[...t,...n===void 0?[]:[tt(n)]].join(`, `)}`),at=e=>e.endsWith(`/`)?e:`${e}/`,ot=(e,t)=>n=>{let r=e(n);return r===void 0&&!C.has(n)&&t(`${n}.tla`),r},st=e=>e.classPath?.split(Ee).find(e=>e.endsWith(`.jar`));var ct=`0.0.4-dev.7714e32`;const lt=2224400062,L={int8:0,int16:1,int32:2,shared8:4,shared16:5,shared32:6,block32:8,string8:9,string32:10,doubleLittle:12},ut={smallInt:64,smallString:32,smallBlock:128},R=(e,...t)=>({tag:e,fields:t}),dt=e=>typeof e==`object`&&`tag`in e,ft=(e,t)=>{let r=new DataView(e.buffer,e.byteOffset,e.byteLength);if(e.length<t+20||r.getUint32(t)!==lt)throw new n(`corrupted fingerprint file`);let i=t+20+r.getUint32(t+4),a=[],o={position:t+20},s=e=>{let t=o.position;if(o.position+=e,o.position>i)throw new n(`corrupted fingerprint file`);return t},c=new TextDecoder,l=t=>{let n=s(t),r=c.decode(e.subarray(n,n+t));return a.push(r),r},u=(e,t)=>{let n=R(e);t>0&&a.push(n);for(let e=0;e<t;e++)n.fields.push(f());return n},d=e=>a[a.length-e],f=()=>{let t=e[s(1)];if(t>=ut.smallBlock)return u(t&15,t>>4&7);if(t>=ut.smallInt)return t&63;if(t>=ut.smallString)return l(t&31);switch(t){case L.int8:return r.getInt8(s(1));case L.int16:return r.getInt16(s(2));case L.int32:return r.getInt32(s(4));case L.shared8:return d(r.getUint8(s(1)));case L.shared16:return d(r.getUint16(s(2)));case L.shared32:return d(r.getUint32(s(4)));case L.block32:{let e=r.getUint32(s(4));return u(e&255,e>>>10)}case L.string8:return l(r.getUint8(s(1)));case L.string32:return l(r.getUint32(s(4)));case L.doubleLittle:{let e={float:r.getFloat64(s(8),!0)};return a.push(e),e}}throw new n(`corrupted fingerprint file`)};return{value:f(),next:i}},pt=e=>{let t=[],n={objects:0,words32:0,words64:0},r=(e,n)=>{for(let r=(n-1)*8;r>=0;r-=8)t.push(e>>>r&255)},i=new TextEncoder,a=e=>{if(typeof e==`number`)return e>=0&&e<64?t.push(ut.smallInt+e):e>=-128&&e<128?t.push(L.int8,e&255):e>=-32768&&e<32768?(t.push(L.int16),r(e,2)):(t.push(L.int32),r(e,4));if(n.objects++,typeof e==`string`){let a=i.encode(e);a.length<32?t.push(ut.smallString+a.length):a.length<256?t.push(L.string8,a.length):(t.push(L.string32),r(a.length,4)),t.push(...a),n.words32+=1+Math.floor((a.length+4)/4),n.words64+=1+Math.floor((a.length+8)/8);return}if(!dt(e)){let r=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(8));r.setFloat64(0,e.float,!0),t.push(L.doubleLittle,...new Uint8Array(r.buffer)),n.words32+=3,n.words64+=2;return}let o=e.fields.length;o===0?n.objects--:(n.words32+=1+o,n.words64+=1+o),e.tag<16&&o<8?t.push(ut.smallBlock+e.tag+(o<<4)):(t.push(L.block32),r(o*1024+e.tag,4)),e.fields.forEach(a)};a(e);let o=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(20));return[lt,t.length,n.objects,n.words32,n.words64].forEach((e,t)=>o.setUint32(t*4,e)),new Uint8Array([...new Uint8Array(o.buffer),...t])},mt=20210223,ht={zenon:{field:1,tag:1},isabelle:{field:2,tag:0},smt:{field:10,tag:8},z3:{field:11,tag:9},ls4:{field:17,tag:16}},gt=[`false`,`timeout`],_t=`tla-ts ${ct}`,vt=/* @__PURE__ */ new Map([[ht.zenon.field,3],[ht.isabelle.field,4]]),yt=(e,t)=>e!==void 0&&dt(e)?e.fields[t]:void 0,bt=e=>e!==void 0&&typeof e==`object`&&`float`in e?e.float:1/0,xt=e=>{let t=new TextEncoder().encode(e),n=(e,t)=>e<<t|e>>>32-t,r=Array.from({length:Math.ceil(t.length/4)},(e,n)=>t[n*4]|t[n*4+1]<<8|t[n*4+2]<<16|t[n*4+3]<<24).reduce((e,t)=>{let r=Math.imul(n(Math.imul(t,3432918353),15),461845907);return Math.imul(n(e^r,13),5)+3864292196|0},0),i=Math.imul(r^t.length^(r^t.length)>>>16,2246822507),a=Math.imul(i^i>>>13,3266489909);return(a^a>>>16)&1073741823},St=e=>e!==void 0&&dt(e)?[[e.fields[0],e.fields[1]],...St(e.fields[2])]:[],Ct=(e,t,r)=>{let i=Ne(t),a=ft(i,0),o=ft(i,a.next).value;if(a.value!==mt||!dt(o)||o.tag!==0)throw new n(`corrupted fingerprint file`);let s=yt(yt(o,0),1),c=(e,t)=>{let n=vt.get(t);return!r||n===void 0||yt(yt(e,0),n)===_t};e.clear(),(s!==void 0&&dt(s)?s.fields:[]).flatMap(e=>St(e).toReversed()).forEach(([t,r])=>{if(typeof t!=`string`||!dt(r))throw new n(`corrupted fingerprint file`);e.set(t,r.fields.map((e,t)=>c(e,t)?e:0))})},wt=(e,t)=>{let n=yt(t,0),r=yt(n,0),i=yt(yt(n,1),0);if(r===void 0||r===1)return;let a=bt(yt(e===`isabelle`?yt(i,0):i,0)),o=e===`isabelle`?yt(i,1):void 0,s=yt(yt(r,0),0);return{method:{prover:e,timeLimitMs:a*1e3,...typeof o==`string`&&{tactic:o}},isProved:r===0,isReused:!1,...s!==void 0&&{reason:typeof s==`number`?gt[s]:String(yt(s,0))}}},Tt=e=>{let t=/* @__PURE__ */ new Date,n=e.method,r={float:n.rlimit??n.timeLimitMs/1e3},i=n.prover===`zenon`?R(0,r,5):n.prover===`isabelle`?R(0,R(0,r),n.tactic??`auto`):R(0,r),a=gt.indexOf(e.reason??``),o=e.reason===void 0?0:R(0,a===-1?R(0,e.reason):a);return R(0,R(0,R(0,e.isProved?0:R(0,o),R(ht[n.prover].tag,i)),R(0,t.getFullYear(),t.getMonth(),t.getDate(),t.getHours(),t.getMinutes(),t.getSeconds()),_t,_t,_t))},Et=e=>{let t=2**Math.max(9,Math.ceil(Math.log2(e.size/2))),n=Array.from({length:t},()=>0);return e.forEach((e,r)=>{let i=xt(r)&t-1;n[i]=R(0,r,R(0,...e),n[i])}),R(0,R(0,e.size,R(0,...n),0,512))},Dt=e=>String(e).padStart(2,`0`),Ot=(e,t)=>{let n=/* @__PURE__ */ new Date,r=`${e}.history`,i=ke(r,`${n.getFullYear()}-${Dt(n.getMonth()+1)}-${Dt(n.getDate())}_${Dt(n.getHours())}_${Dt(n.getMinutes())}_${Dt(n.getSeconds())}`);Me(i,{recursive:!0}),[e,...t].filter(e=>F(e)).forEach(e=>je(e,ke(i,Te(e)),{preserveTimestamps:!0})),Fe(r).map(e=>ke(r,e)).sort((e,t)=>ze(t).mtimeMs-ze(e).mtimeMs).slice(10).forEach(e=>Re(e,{recursive:!0,force:!0}))},kt=e=>{let t=/* @__PURE__ */ new Map,n=/* @__PURE__ */ new Map,r=new Map([...e].map(([e,r])=>{let i=new Map(Object.entries(ht).flatMap(([e,n])=>{let i=wt(e,yt(r[n.field],0));return i?(t.set(i,r[n.field]),[[e,i]]):[]}));return n.set(i,r),[e,i]}));return{results:r,save:i=>{e.clear(),r.forEach((r,i)=>{let a=[...n.get(r)??Array(23).fill(0)];r.forEach((e,n)=>{a[ht[n].field]=t.get(e)??Tt(e)}),e.set(i,a)}),Be(`${i}.tmp`,Buffer.concat([pt(mt),pt(Et(e))])),Le(`${i}.tmp`,i)}}},At=(e,t)=>{let n=new Map(t.map(e=>{let[t,...n]=e.flag.split(` `);return[t,e.getArity??(()=>n.length)]}));return{usage:e.replace(`{options}`,t.map(e=>`[${e.flag}]${e.isRepeatable?`...`:``}`).join(` `)),parse:e=>{let t=[],r=[],i=[],a=[];for(let o=0;o<e.length;o++){let s=n.get(e[o]);if(s===void 0){(e[o].startsWith(`-`)?i:r).push(e[o]);continue}let c=s(e.slice(o+1)),l={name:e[o],values:e.slice(o+1,o+1+c)};t.push(l),l.values.length<c&&a.push(l),o+=c}return{options:t,positionals:r,unknown:i,incomplete:a[0],has:e=>t.some(t=>t.name===e),get:e=>t.findLast(t=>t.name===e)?.values}}}},jt=At(`tla-ts <Spec.tla|Spec.cfg|glob>... {options}`,[{flag:`-config <Spec.cfg>`},{flag:`-deadlock`},{flag:`-dump [<format>] <file>`,getArity:e=>e.length>1&&e[0].startsWith(`dot`)?2:1},{flag:`-fp <num>`},{flag:`-lncheck <final|default>`},{flag:`-metadir <directory>`},{flag:`-nowarning`},{flag:`-seed <num>`},{flag:`-tool`},{flag:`-workers <count|auto>`}]),Mt=At(`tla-ts tlapm {options} <Module.tla|glob>...`,[{flag:`-N`},{flag:`--summary`},{flag:`--strict`},{flag:`--toolbox <start> <end>`},{flag:`--line <num>`},{flag:`--printallobs`},{flag:`--threads <num>`},{flag:`--version`},{flag:`-I <directory>`,isRepeatable:!0},{flag:`-k`},{flag:`--noproving`},{flag:`--nofp`},{flag:`--nofpl <start> <end>`},{flag:`--safefp`},{flag:`--cleanfp`},{flag:`--usefp <file>`},{flag:`--cache-dir <directory>`}]),Nt=[`Usage: ${jt.usage}`,` ${Mt.usage}`,` tla-ts [<JVM option>]... tlc2.TLC <TLC option>... <Spec>`,` (-cp tla2tools.jar or -Dtla-ts.tlc=1.7.4 picks the TLC to reproduce)`,` tla-ts [<JVM option>]... tla2sany.xml.XMLExporter [-I <directory>]... [-o] [-t] [-r] [-u] <Module.tla>`].join(`
|
|
10
|
+
`),Pt=/* @__PURE__ */ new Set([`--toolbox`,`--line`,`--threads`,`--nofpl`]),Ft=t=>[`.`,...e().map(e=>ke(De(De(Ie(e))),`lib/tlapm/stdlib`)).filter(e=>F(e)).slice(0,1),...t.options.flatMap(e=>e.name===`-I`?e.values:[]).toReversed()],It=e=>console.error(`@!!BEGIN\n${e.map(e=>`@!!${e}\n`).join(``)}@!!END\n`),Lt=(e,t,n)=>It([`type:obligation`,`id:${e.id}`,`loc:${e.location}`,`status:${t}`,...n]),Rt=`9ed0376`,zt=e=>/^[+,\-./0-9:=@A-Z_a-z]+$/.test(e)?e:`'${e.replaceAll(`'`,`'\\''`)}'`,Bt={failed:10,incomplete:11,emptyTarget:12},Vt=(e,t,n)=>{let r=e.summary;n||(r.absent.forEach(e=>console.error(`Missing proof at ${xe(e)}`)),r.omitted.forEach(e=>console.error(`Omitted proof at ${xe(e)}`)));let i=r.absent.length+r.omitted.length>0;i&&console.error(`${he(e.location)}[ERROR]: Proof incomplete in module ${JSON.stringify(e.name)}: ${r.absent.length} missing, ${r.omitted.length} omitted proof step(s).`);let a=t&&e.obligations.length===0;return a&&console.error(`${he(e.location)}[ERROR]: No proof obligation found for the selected target.`),[...i?[Bt.incomplete]:[],...a?[Bt.emptyTarget]:[]]},Ht=e=>{try{return e()}catch(e){if(!(e instanceof n))throw e;console.error(` tlapm ending abnormally with ${e.exception}\n`);return}},Ut=(e,t)=>{let n=t.method.timeLimitMs,r=t.timeUsedMs===void 0?``:`; time-used: ${(t.timeUsedMs/1e3).toFixed(1)} (${Math.round(100*t.timeUsedMs/n)}%)`,i=n===0?``:`time-limit: ${n===1/0?`inf`:Number((n/1e3).toPrecision(6))}${r}`,a=[t.method.tactic,i].filter(Boolean).join(`; `),o=(t.method.prover===`smt`||t.method.prover===`z3`)&&t.reason===`false`&&t.verdict?`(* SMT failed with status = ${t.verdict}\n *)\n`:``;Lt(e,t.isProved?`proved`:`failed`,[`prover:${t.method.prover}`,...a===``?[]:[`meth:${a}`],...t.reason===void 0?[]:[`reason:${t.reason}`],`already:${t.isReused}`,...t.isProved?[]:[`obl:${t.isReused?``:`\n${o}`}${ye(e,t.isReused)}`]])},Wt=(e,t)=>Lt(e,`failed`,[`prover:fail`,`meth:time-limit: inf`,`reason:${t}`,`already:false`,`obl:${e.text}`]),Gt=async(e,t,n,r)=>{let i=kt(r.fingerprints),a=await P(e.obligations,{workers:r.workers,results:i.results,isFingerprinted:r.isFingerprinted,isProving:r.isProving,onReport:(e,t)=>{if(r.isToolbox){if(e.obligation.status===`trivial`)return Lt(t,`trivial`,[`prover:tlapm`,`already:false`]);if(t.kind.kind===`Error`)return Wt(t,`user error`);e.attempts.forEach(e=>Ut(t,e))}}});if(Be(t,Ce(e.name,a,e.obligations)),console.log(`(* created new ${JSON.stringify(t)} *)`),i.save(n),console.log(`(* fingerprints written in ${JSON.stringify(n)} *)`),!r.isProving)return!1;let o=a.flatMap((t,n)=>`reason`in t.obligation?[{report:t,obligation:e.obligations[n]}]:[]);r.isToolbox&&o.filter(e=>e.report.attempts.length===0&&e.obligation.kind.kind!==`Error`).forEach(e=>Wt(e.obligation,`unexpected error`)),o.toReversed().forEach(e=>console.error(`${he(e.obligation.locus)}${me(we(`[ERROR]: @[<v2>Could not prove or check:@,%a@]`,_e(e.obligation.sequent)),35)}`));let s=`${e.obligations.length} obligation${e.obligations.length>1?`s`:``}`;return console.error(o.length===0?`${he(e.location)}[INFO]: All ${s} proved.`:`${he(e.location)}[ERROR]: ${o.length}/${s} failed.\nThere were backend errors processing module \`${JSON.stringify(e.name)}\`.`),o.length>0},Kt=async e=>{let t=Mt.parse(e),r=!t.has(`-N`)&&!t.has(`--summary`),i=t.unknown[0]??(r&&t.has(`--printallobs`)?`--printallobs`:void 0);if(i!==void 0)return console.error(`Error: tla-ts tlapm does not support the tlapm option ${i}.`),1;if(t.incomplete)return console.error(`Error: option '${t.incomplete.name}' needs an argument.`),1;let a=t.options.find(e=>Pt.has(e.name)&&e.values.some(e=>!/^-?\d+$/.test(e)));if(a)return console.error(`Error: option '${a.name}' expects an integer.`),1;if(t.has(`--version`))return console.log(Rt),s.success;let o=Ze(t.positionals).map(e=>e.path),c=o.map(e=>e.endsWith(`.tla`)?e:`${e}.tla`);if(c.length===0)return console.error(Nt),1;let l=t.has(`--toolbox`)||t.has(`--line`);l&&console.log(`\n\\* TLAPM version ${Rt}\n\\* launched at ${O(/* @__PURE__ */ new Date)} with command line:\n\\* ${[`tla-ts`,`tlapm`,...e].map(zt).join(` `)}\n`);let u=t.options.reduce((e,t)=>{let[n,r]=t.values.map(Number);return t.name===`--toolbox`?{start:n,end:r===0?1/0:r}:t.name===`--line`?n===0?be:{start:n,end:n}:e},be),d=c.reduce((e,t)=>e.includes(De(t))?e:[De(t),...e],Ft(t)),f=/* @__PURE__ */ new Set,p=Ht(()=>{let e=c.findIndex(e=>!F(e));if(e!==-1){let t=o[e];throw console.error(`File "<unknown>":\nError: File ${JSON.stringify(t)} not found`),new n(`File ${t} not found`,{failure:`Module.Parser.parse_file`})}return pe(c.map(e=>({file:`./${e}`,source:Ne(e,`utf8`)})),e=>{f.add(e);let t=d.map(t=>`${t}/${e}.tla`).find(e=>F(e));return t===void 0?e===`TLAPS`?{file:`TLAPS.tla`,source:fe}:void 0:{file:t,source:Ne(t,`utf8`)}},{lines:u,onWarning:e=>{if(e.channel===`stdout`)return console.log(e.text);let t=e.channel===`toolbox`||e.channel===`toolboxOnly`;if(l&&t)return It([`type:warning`,`msg:${e.text}`]);e.channel!==`toolboxOnly`&&console.error(e.text)}})});if(!p)return 3;let m=t.get(`--cache-dir`)?.[0]??process.env.TLAPM_CACHE_DIR??`.tlacache`,h=t.get(`--nofpl`)?.map(Number)??[0,0],g={isToolbox:l,isProving:!t.has(`--noproving`),workers:Math.max(1,Number(t.get(`--threads`)?.[0]??Ue())),isFingerprinted:e=>!t.has(`--nofp`)&&!(e.locus&&e.locus.startLine>=h[0]&&e.locus.endLine<=h[1]),fingerprints:/* @__PURE__ */ new Map},_=[];for(let[e,n]of p.entries()){let i=`${m}/${n.name}.tlaps`,a=`${i}/fingerprints`,o=t.get(`--usefp`)?.[0]??a;if(Me(i,{recursive:!0}),t.has(`--cleanfp`)&&F(a)&&(Re(a),console.log(`(* fingerprints file ${JSON.stringify(a)} removed *)`)),!t.has(`--cleanfp`)&&F(o)&&n.summary.total!==0&&(console.log(t.has(`--nofp`)?`(* will not use fingerprints (because of option \`--nofp\`), but will now load fingerprints from the file \`${o}\`, in order to overwrite with the new fingerprints, and then save the results at the end. *)`:`(* loading fingerprints in ${JSON.stringify(o)} *)`),Ct(g.fingerprints,o,t.has(`--safefp`))),t.has(`--summary`)&&console.log(Se(n)),l&&(n.obligations.forEach(e=>Lt(e,`to be proved`,t.has(`--printallobs`)?[`obl:${e.text}`]:[])),It([`type:obligationsnumber`,`count:${n.obligations.length}`])),t.has(`--strict`)&&_.push(...Vt(n,u.start>0||u.end<1/0,t.has(`--summary`))),!r)continue;Ot(a,[...f,...p.slice(0,e+1).map(e=>e.name)].map(e=>`${e}.tla`));let s=await Gt(n,`${i}/${n.name}.thy`,a,g);if(s&&t.has(`--strict`)&&_.push(Bt.failed),s&&!t.has(`--strict`)&&!l)return console.error(` tlapm ending abnormally with Failure("backend errors: there are unproved obligations")
|
|
11
|
+
Raised at Stdlib.failwith in file "stdlib.ml", line 29, characters 17-33
|
|
12
|
+
Called from Tlapm_lib.process_module in file "src/tlapm_lib.ml", lines 492-493, characters 12-37
|
|
13
|
+
Called from Tlapm_lib.main.f in file "src/tlapm_lib.ml", line 640, characters 23-43
|
|
14
|
+
Called from Stdlib__List.fold_left in file "list.ml", line 125, characters 24-34
|
|
15
|
+
Called from Tlapm_lib.main in file "src/tlapm_lib.ml", line 643, characters 13-40
|
|
16
|
+
Called from Tlapm_lib.init in file "src/tlapm_lib.ml", line 659, characters 8-59
|
|
17
|
+
`),3}return Object.values(Bt).find(e=>_.includes(e))??s.success},qt={builtin:1,number:2,string:3,ident:4,added:5},Jt=()=>({labelFlag:!1,labelRoot:`Lbl_`,fairnessOption:``,checkTermination:!1,specOption:!1,myspecOption:!1,inputVersionNumber:1903}),Yt=e=>{let t={result:0,digitsAfterDecimal:0,isAfterDecimal:!1};for(let n of e)if(n===`.`)t.isAfterDecimal=!0;else if(n<`0`||n>`9`||(t.result=10*t.result+Number(n),t.isAfterDecimal&&(t.digitsAfterDecimal+=1),t.digitsAfterDecimal>3))return-1;return t.result*10**Math.max(0,3-t.digitsAfterDecimal)},Xt=[`unfair`,`wf`,`sf`],z=()=>({col:0,line:0,macroCol:0,macroLine:-1,lbl:``}),Zt=e=>e.macroLine<0?`line ${e.line}, column ${e.col}`:`line ${e.line}, column ${e.col} of macro called at line ${e.macroLine}, column ${e.macroCol}`,Qt=e=>{if(e.kind!==`LabeledStmt`)throw new g(`ClassCastException: ${e.kind}`);return e},$t=(e,t)=>{if(t<0||t>=e.length)throw new g(`ArrayIndexOutOfBoundsException: ${t}`);return e[t]},en=(e,t,n)=>({string:e,column:t,type:n}),tn=e=>e.type===qt.string?e.string.length+2:e.string.length,nn=(e=[])=>({tokens:e,anchorTokens:void 0,anchorTokCol:void 0}),rn=e=>{for(;e.tokens.length>0&&e.tokens[0].length===0;)e.tokens.shift();for(;e.tokens.length>0&&e.tokens[e.tokens.length-1].length===0;)e.tokens.pop();let t=Math.min(999999,...e.tokens.filter(e=>e.length>0).map(e=>e[0].column));e.tokens.forEach(e=>e.forEach(e=>{e.column-=t}));let n=[],r=[];e.tokens.forEach((t,i)=>{if(r.push(0),n.push(void 0),t.length===0)return;let a=t[0].column,o=e.tokens.slice(0,i).findLast(e=>e.length>0&&e[0].column<=a);if(o===void 0)return;let s=o.findIndex((e,t)=>t>0&&e.column>a),c=o[(s===-1?o.length:s)-1];n[i]=c,r[i]=c.column}),e.anchorTokens=n,e.anchorTokCol=r},an=e=>{let t=nn(e);return rn(t),t},on=e=>{let t=e.anchorTokens,n=e.anchorTokCol;if(t===void 0||n===void 0)throw new g(`NullPointerException: TLAExpr.renormalize`);e.tokens.forEach((e,r)=>{let i=t[r];if(i===void 0)return;let a=i.column-n[r];if(n[r]=i.column,a<0)throw new h(`TLAExpr.renormalize() found anchor has moved to left.`);e.forEach(e=>{e.column+=a})})},sn=e=>an(e.tokens.map(e=>e.map(e=>({...e})))),cn=(e,t,n)=>{let r=t.tokens.length;e.tokens.splice(0,0,...t.tokens.slice(0,r-1));let i=t.tokens[r-1],a=e.tokens[r-1],o=i[i.length-1],s=o.column+tn(o)+n;a.forEach(e=>{e.column+=s}),a.splice(0,0,...i);let c=[...t.anchorTokens??[]],l=[...t.anchorTokCol??[]];for(let t=r;t<e.tokens.length;t++)c.push(e.anchorTokens?.[t-r+1]),l.push(e.anchorTokCol?.[t-r+1]??0);e.anchorTokens=c,e.anchorTokCol=l,on(e)},ln=e=>e.tokens.length===1&&e.tokens[0].length===1,un=(e,t)=>$t($t(e.tokens,t.line),t.item),dn=(e,t,n)=>{if(e.tokens.length<=t.line)throw new l(`TLAExpr.StepCoord called with line too big`);if(e.tokens[t.line].length<=t.item)throw new l(`TLAExpr.StepCoord called with col too big`);let r={line:t.line,item:t.item};for(let t=0;t<n;t++)if(r.item+=1,e.tokens[r.line].length===r.item){for(r.item=0,r.line+=1;r.line<e.tokens.length&&e.tokens[r.line].length===0;)r.line+=1;if(r.line===e.tokens.length)return}return r},fn=(e,t,n)=>{for(let r=e.tokens.length===0?void 0:{...n};r!==void 0;){let n=un(e,r),i=n.type===qt.string;if(!i&&n.string===t)return r;let a=!i&&(n.string===`[`||n.string===`,`)?dn(e,r,2):void 0,o=a===void 0?void 0:un(e,a),s=o!==void 0&&o.type!==qt.string&&[`:`,`|->`,`↦`].includes(o.string),c=i?1:n.string===`.`?2:s?3:1;r=dn(e,r,c)}},pn=(e,t,n,r)=>{let i=un(e,n);if(ln(e)){let n=sn(t);e.tokens=n.tokens,e.anchorTokens=n.anchorTokens,e.anchorTokCol=n.anchorTokCol;return}let a=e.tokens[n.line],o=n.item+1<a.length?a[n.item+1].column-(i.column+tn(i)):0,s=a.splice(n.item+1),c={lineIndex:n.line,indent:+!!r+i.column,isInserting:!r},l=()=>e.tokens[c.lineIndex];if(ln(t)){let e=t.tokens[0][0];i.string=e.string,i.type=e.type}else{r&&(i.string=`(`,i.type=qt.builtin);let n=sn(t);if(n.tokens.forEach((t,r)=>{if(t.forEach(e=>{e.column+=c.indent,c.isInserting?(i.string=e.string,i.type=e.type,c.isInserting=!1):l().push(e)}),r+1>=n.tokens.length)return;c.indent=0,c.lineIndex+=1;let a=c.lineIndex;e.tokens.splice(a,0,[]);let o=e.anchorTokens??[],s=e.anchorTokCol??[];e.anchorTokens=e.tokens.map((e,t)=>t<a?o[t]:t===a?n.anchorTokens?.[r+1]:o[t-1]),e.anchorTokCol=e.tokens.map((e,t)=>t<a?s[t]:t===a?n.anchorTokCol?.[r+1]??0:s[t-1])}),r){let e=l()[l().length-1];l().push(en(`)`,e.column+tn(e),qt.builtin))}}let u=l(),d={line:c.lineIndex,item:u.length-1};if(s.length>0){let e=u[u.length-1],t=e.column+tn(e)+o-s[0].column;s.forEach(e=>{e.column+=t,u.push(e)})}return on(e),dn(e,d,1)},mn=(e,t,n,r=!0)=>{let i=n.map(t=>fn(e,t,{line:0,item:0}));for(;;){let a=i.reduce((e,t,n)=>t!==void 0&&(e===void 0||t.line<e.position.line||t.line===e.position.line&&t.item<e.position.item)?{index:n,position:t}:e,void 0);if(a===void 0)return;let o=dn(e,a.position,1),s=pn(e,t[a.index],a.position,r);i[a.index]=s===void 0?void 0:fn(e,n[a.index],s),i.forEach((e,t)=>{if(t!==a.index&&e!==void 0&&s!==void 0){if(o===void 0)throw new g(`NullPointerException: TLAExpr.substituteForAll`);e.line===a.position.line&&(e.item+=s.item-o.item),e.line+=s.line-o.line}})}},hn=(e,t,n)=>{let r=sn(e);return mn(r,t,n),r},gn=(e,t,n)=>e.map(e=>hn(e,t,n)),_n=(e,t)=>{let n=e=>t===`1.7.4`?``:`(col${e.column}) `,r=e.tokens.map(e=>e.map(e=>e.type===qt.string?`"\\"", "${e.string}", "\\""`:e.string===`\\/`?`"${n(e)}\\\\/"`:e.string.startsWith(`\\`)?`"\\${e.string}"`:e.string===`/\\`?`"${n(e)}/\\\\"`:`"${e.string}"`)),i=r.findIndex(e=>e.length>0);return`<< ${r.map((e,t)=>{let n=i!==-1&&t>i;return e.map((e,t)=>n||t>0?`, ${e}`:e).join(``)}).join(`
|
|
18
|
+
`)} >>`},vn=(e,t,n)=>{let r=e=>_n(e,n),i=[0],a={value:0},o=e=>(i[a.value+1]=i[a.value]+e.length,a.value+=1,e),s=()=>(--a.value,``),c=()=>`\n${` `.repeat(i[a.value])}`,l=t<1500,u=e=>`${o(`<<`)}${e.map((e,t)=>`${t>0?`, ${c()}`:``}${`kind`in e?m(e):r(e)}`).join(``)}>>${s()}`,d=e=>`${o(`<<`)}${e.map(e=>`"${e}"`).join(`, `)}>>${s()}`,f=e=>`${o(`<< `)}${e.map((e,t)=>`${t>0?`, ${c()}`:``}${u(e)}`).join(``)} >>${s()}`,p=e=>e?`"="`:`"\\\\in"`,m=e=>{switch(e.kind){case`Uniprocess`:return`${o(``)}[type |-> "uniprocess", ${c()} name |-> "${e.name}", ${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` defs |-> `)}${r(e.defs)},${s()}${c()}${o(` prcds |-> `)}${u(e.prcds)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`Multiprocess`:return`${o(``)}[type |-> "multiprocess", ${c()} name |-> "${e.name}", ${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` defs |-> `)}${r(e.defs)},${s()}${c()}${o(` prcds |-> `)}${u(e.prcds)},${s()}${c()}${o(` procs |-> `)}${u(e.procs)}]${s()}${s()}`;case`Procedure`:return l?`${o(``)}[name |-> "${e.name}", ${c()}${o(` params |-> `)}${u(e.params)},${s()}${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`:`${o(``)}[name |-> "${e.name}", ${c()}minusLabels |-> ${d(e.minusLabels)}, plusLabels |->${d(e.plusLabels)}, proceduresCalled |->${d(e.proceduresCalled)},${c()}${o(` params |-> `)}${u(e.params)},${s()}${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`Process`:return l?`${o(``)}[name |-> "${e.name}", ${c()} eqOrIn |-> ${p(e.isEq)},${c()} id |-> ${r(e.id)},${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`:`${o(``)}[name |-> "${e.name}",${c()} fairness |-> "${Xt[e.fairness]}", minusLabels |-> ${d(e.minusLabels)}, plusLabels |->${d(e.plusLabels)}, proceduresCalled |->${d(e.proceduresCalled)},${c()} eqOrIn |-> ${p(e.isEq)},${c()} id |-> ${r(e.id)},${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`VarDecl`:return`${o(``)}[var |-> "${e.var}", eqOrIn |-> ${p(e.isEq)}, val |-> ${r(e.val)}]${s()}`;case`PVarDecl`:return`${o(``)}[var |-> "${e.var}", eqOrIn |-> "=", val |-> ${r(e.val)}]${s()}`;case`LabeledStmt`:return`${o(``)}[label |-> "${e.label}",${c()}${o(` stmts |-> `)}${u(e.stmts)}]${s()}${s()}`;case`While`:return`${o(``)}[type |-> "while", ${c()} test |-> ${r(e.test)},${c()}${o(` labDo |-> `)}${u(e.labDo)},${s()}${c()}${o(` unlabDo |-> `)}${u(e.unlabDo)}]${s()}${s()}`;case`Assign`:return`${o(``)}[type |-> "assignment",${c()}${o(` ass |-> `)}${u(e.ass)}]${s()}${s()}`;case`SingleAssign`:return`${o(``)}[lhs |-> ${m(e.lhs)},${c()} rhs |-> ${r(e.rhs)}]${s()}`;case`Lhs`:return`[var |-> "${e.var}", sub |-> ${r(e.sub)}]`;case`If`:return`${o(``)}[type |-> "if", ${c()} test |-> ${r(e.test)},${c()}${o(` then |-> `)}${u(e.Then)},${s()}${c()}${o(` else |-> `)}${u(e.Else)}]${s()}${s()}`;case`Either`:return`${o(``)}[type |-> "either", ${c()}${o(` ors |-> `)}${f(e.ors)}]${s()}${s()}`;case`With`:return`${o(``)}[type |-> "with", ${c()} var |-> "${e.var}",${c()} eqOrIn |-> ${p(e.isEq)},${c()} exp |-> ${r(e.exp)},${c()}${o(` do |-> `)}${u(e.Do)}]${s()}${s()}`;case`When`:return`${o(``)}[type |-> "when", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`PrintS`:return`${o(``)}[type |-> "print", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`Assert`:return`${o(``)}[type |-> "assert", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`Skip`:return`[type |-> "skip"]`;case`LabelIf`:return`${o(``)}[type |-> "labelIf",${c()} test |-> ${r(e.test)},${c()}${o(` unlabThen |-> `)}${u(e.unlabThen)},${s()}${c()}${o(` labThen |-> `)}${u(e.labThen)},${s()}${c()}${o(` unlabElse |-> `)}${u(e.unlabElse)},${s()}${c()}${o(` labElse |-> `)}${u(e.labElse)}]${s()}${c()}${s()}`;case`LabelEither`:return`${o(``)}[type |-> "labelEither",${c()}${o(` clauses |-> `)}${u(e.clauses)}]${s()}${c()}${s()}`;case`Clause`:return`${o(``)}${o(`[unlabOr |-> `)}${u(e.unlabOr)},${s()}${c()}${o(` labOr |-> `)}${u(e.labOr)}]${s()}${c()}${s()}`;case`Call`:return`${o(``)}[type |-> "call",${c()} returnTo |-> "${e.returnTo}",${c()} to |-> "${e.to}",${c()}${o(` args |-> `)}${u(e.args)}]${s()}${s()}`;case`Return`:return`[type |-> "return", from |-> "${e.from??`null`}"]`;case`CallReturn`:return`${o(``)}[type |-> "callReturn",${c()} from |-> "${e.from??`null`}",${c()} to |-> "${e.to}",${c()}${o(`args |-> `)}${u(e.args)}]${c()}${s()}${s()}`;case`CallGoto`:return`${o(``)}[type |-> "callGoto",${c()} after |-> "${e.after}",${c()} to |-> "${e.to}",${c()}${o(`args |-> `)}${u(e.args)}]${c()}${s()}${s()}`;case`Goto`:return`[type |-> "goto", to |-> "${e.to}"]`;case`Macro`:return`${o(``)}[name |-> "${e.name}", ${c()}${o(` params |-> `)}${o(`<<`)}${e.params.join(`, ${c()}`)}>>${s()},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`MacroCall`:return`${o(``)}[type |-> "macrocall",${c()} name |-> "${e.name}",${c()}${o(` args |-> `)}${u(e.args)}]${s()}${s()}`}};return m(e)},yn=(e,t,n)=>({lines:e,currentLine:t<e.length?Array.from(e[t]):void 0,line:t,column:n,vcolumn:t<e.length?Array.from(e[t].slice(0,n)).length:0}),bn=e=>{if(e.currentLine===void 0)return` `;if(e.currentLine.length===e.column)return e.line+=1,e.column=0,e.vcolumn=0,e.currentLine=e.line>=e.lines.length?void 0:Array.from(e.lines[e.line]),`
|
|
19
|
+
`;let t=e.currentLine[e.column];return e.column+=1,e.vcolumn+=1,t},xn=e=>{if(e.column>0)--e.column,--e.vcolumn;else{if(e.line===0)throw new l(`PcalCharReader.backspace trying to move past beginning of reader`);--e.line,e.currentLine=Array.from(e.lines[e.line]),e.column=Math.max(e.currentLine.length-1,0),e.vcolumn=e.column}},Sn=e=>{for(;;){let t=bn(e);if(t===` `)return` `;if(t!==` `&&t!==`
|
|
20
|
+
`)break}return xn(e),`${(e.currentLine??[]).slice(e.column).join(``)}\n`},Cn=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`⟨`]),wn=/* @__PURE__ */ new Set([`>>_`,`⟩_`,`]_`,`)`,`}`,`]`,`>>`,`⟩`]),Tn=/* @__PURE__ */ new Set([...Cn,...wn,...`_ ASSUME ASSUMPTION AXIOM BOOLEAN CASE CONSTANT CONSTANTS EXCEPT EXTENDS FALSE IF INSTANCE LOCAL MODULE OTHER STRING THEOREM TRUE VARIABLE VARIABLES WITH WF_ SF_`.split(` `),...`\\A ∀ \\forall \\E ∃ \\exists \\AA \\EE ~ ¬ \\lnot \\neg <> ◇ CHOOSE ENABLED UNCHANGED SUBSET UNION DOMAIN ' ^+ ⁺ ^* ^#`.split(` `),...`=> ⇒ \\cdot ⋅ <=> ⇔ \\equiv ≡ ~> ↝ -+-> ⇸ \\subseteq ⊆ \\subset ⊂ \\supset ⊃ \\supseteq ⊇ \\ll ≪ \\gg ≫ \\ \\cap \\intersect ∩ \\cup \\union ∪ /\\ ∧ \\/ ∨ \\land \\lor \\X × - + * / ^ | || ‖ & && ++ -- ** // ^^ |- ⊢ |= ⊨ -| ⊣ =| ⫤ <: :> := ≔ ::= ⩴`.split(` `),...`(+) ⊕ (-) ⊖ \\oplus \\ominus (.) ⊙ \\odot (/) ⊘ \\oslash (\\X) ⊗ \\otimes \\uplus ⊎ \\sqcap ⊓ \\sqcup ⊔ \\div ÷ \\star ⋆ \\o ∘ \\circ \\bigcirc ◯ \\bullet ●`.split(` `),...`\\in ∈ \\notin ∉ = # /= ≠ < > =< <= ≤ >= ≥ \\prec ≺ \\succ ≻ \\preceq ⪯ \\succeq ⪰ \\sim ∼ \\simeq ≃ \\approx ≈ \\doteq ≐ \\asymp ≍ \\sqsubset ⊏ \\sqsupset ⊐ \\sqsubseteq ⊑ \\sqsupseteq ⊒ \\propto ∝`.split(` `),...`: -> → |-> ↦ <- ← == ≜ ELSE THEN LET IN [] □ .. ‥ ... … $ $$ ? ?? ⁇ % %% ## @@ !! ‼ \\times \\leq \\geq \\mod \\wr ≀ ≅ ! ; , . -. @`.split(` `)]),En=e=>/^[A-Za-z_]$/.test(e),Dn=e=>/^[0-9]$/.test(e),On=e=>e===` `||e===`\f`||e===`\r`,kn=new Set([...Tn].filter(e=>!En(e[0])&&!(e[0]===`\\`&&En(e[1]??``))).flatMap(e=>Array.from(e,(t,n)=>e.slice(0,e.length-n)))),An=/* @__PURE__ */ new Set("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ ~!@#$%^&*()_-+={}[]|:;<,>.?/`'0123456789"),jn=new Set(`; do then := ≔ begin variable variables || ‖ end else elsif if either or while with call return goto print assert skip procedure define process fair`.split(` `)),B={...qt,dashes:6,endModule:7},Mn=()=>({delimiter:``,delimiterLine:0,delimiterCol:0,commentDepth:0}),Nn=(e,t,n,r)=>{let i={lines:[],line:[],token:``,state:`start`,column:t.vcolumn,nextColumn:t.vcolumn,nextChar:bn(t),parenDepth:0,isInQuantifier:!1,isExprEnd:!1,previousToken:` `},a=()=>{i.nextColumn=t.vcolumn,i.nextChar=bn(t)},o=()=>{i.token+=i.nextChar,a()},s=()=>{i.state=`start`,i.column=i.nextColumn},c=()=>{i.lines.push(i.line),i.line=[],i.column=0},u=e=>{throw new h(`${e} \`${i.token}' found at\n line ${t.line+1}, column ${i.column+1}`)},d=()=>{i.isExprEnd=!0,e.delimiter=i.token,e.delimiterCol=i.column,e.delimiterLine=t.line-+(i.nextChar===`
|
|
21
|
+
`)},f=e=>{if(!n){d(),i.token=``;return}e>B.ident&&u(`Illegal token in an expression`);let t=i.token;e!==B.string&&(jn.has(t)&&!(e===B.ident&&[`.`,`[`,`,`].includes(i.previousToken))||(t===`,`&&!i.isInQuantifier&&!r||t===`)`||t===`}`)&&i.parenDepth===0)?(i.parenDepth!==0&&u(`Expression with an unmatched (, [, {, or << followed by`),i.isInQuantifier&&u("Expression with \\A or \\E but no following `:` followed by"),d(),i.line.length>0&&c()):(e===B.builtin&&Cn.has(t)&&(i.parenDepth+=1),e===B.builtin&&wn.has(t)&&(--i.parenDepth,i.parenDepth<0&&u(`Extra (unmatching)`)),i.previousToken=e===B.string?` `:t,[`\\A`,`∀`,`\\E`,`∃`].includes(t)&&i.parenDepth===0&&(i.isInQuantifier=!0),i.isInQuantifier&&t===`:`&&i.parenDepth===0&&(i.isInQuantifier=!1),(t!==``||e===B.string)&&i.line.push(en(t,i.column,e)),i.token=``)},p=e=>{f(e),s()},m=e=>{o(),i.state=e},g=e=>{a(),i.state=e},_=n=>{switch(i.state){case`start`:if(On(n))return a(),s();if(En(n))return m(`id`);if(n===`ℕ`||n===`ℤ`||n===`ℝ`)return o(),p(B.ident);if(Dn(n))return m(`numOrId`);if(n===`\\`)return m(`bs`);if(n===`-`)return m(`dash1`);if(n===`=`)return m(`eq1`);if(n===`(`)return g(`leftParen`);if(n===`"`)return g(`string`);if(n===`
|
|
22
|
+
`)return a(),c(),s();if(kn.has(n))return m(`builtIn`);if(n===` `){i.state=`done`;return}return o(),u(`Illegal lexeme`);case`id`:return i.token===`WF_`||i.token===`SF_`?p(B.builtin):En(n)||Dn(n)?o():p(Tn.has(i.token)?B.builtin:B.ident);case`numOrId`:return Dn(n)?o():En(n)?m(`id`):p(B.number);case`bs`:if([`b`,`B`,`o`,`O`,`h`,`H`].includes(n))return m(`numOrBi`);if(En(n)){i.state=`bsBuiltIn`;return}if(n===`*`){a(),i.token=``,i.state=`lineComment`;return}i.state=`builtIn`;return;case`numOrBi`:i.state=Dn(n)?`num`:`bsBuiltIn`;return;case`num`:if(Dn(n))return o();if(!En(n))return p(B.number);o(),i.token.startsWith(`\\`)&&u(`Illegal lexeme`),i.state=`id`;return;case`bsBuiltIn`:return En(n)&&n!==`_`?o():Tn.has(i.token)?p(B.builtin):u(`Illegal lexeme `);case`builtIn`:if(kn.has(i.token+n))return o();if(!Tn.has(i.token)){for(xn(t);!Tn.has(i.token);)xn(t),i.token.length===0&&u(`Illegal lexeme`),i.token=Array.from(i.token).slice(0,-1).join(``);a()}return p(B.builtin);case`dash1`:case`dash2`:if(n===`-`)return m(i.state===`dash1`?`dash2`:`dash3`);i.state=`builtIn`;return;case`dash3`:return n!==`-`&&u(`Illegal lexeme`),m(`dashes`);case`dashes`:return n===`-`?o():p(B.dashes);case`eq1`:case`eq2`:if(n===`=`)return m(i.state===`eq1`?`eq2`:`eq3`);i.state=`builtIn`;return;case`eq3`:return n!==`=`&&u(`Illegal lexeme`),m(`eqs`);case`eqs`:return n===`=`?o():p(B.endModule);case`leftParen`:if(n===`*`)return e.commentDepth=1,g(`comment`);i.token=`(`,i.state=`builtIn`;return;case`string`:if(n===`\\`)return m(`escString`);if(n===`"`)return a(),p(B.string);o(),An.has(n)||u(`Illegal character in string`);return;case`escString`:o(),[`"`,`\\`,`t`,`n`,`f`,`r`].includes(n)||u(`Illegal character following \\ in string`),i.state=`string`;return;case`lineComment`:return n===`(`?g(`lineComParen`):n===`*`&&e.commentDepth>0?g(`lineComStar`):n===`
|
|
23
|
+
`||n===` `?(i.token=``,e.commentDepth=0,s()):e.commentDepth===0?o():a();case`lineComParen`:if(n===`*`)return e.commentDepth+=1,g(`lineComment`);e.commentDepth===0&&(i.token+=`(`),i.state=`lineComment`;return;case`lineComStar`:if(n===`)`){if(--e.commentDepth,e.commentDepth<0)throw new l(`Failure of assertion: case LINE_COM_STAR`);return g(`lineComment`)}e.commentDepth===0&&(i.token+=`*`),i.state=`lineComment`;return;case`comment`:case`orComment`:{let t=i.state===`comment`;if(n===`*`)return g(t?`commentStar`:`orCommentStar`);if(n===`(`)return g(t?`commentParen`:`orCommentParen`);if(n===`
|
|
24
|
+
`){i.token=``,a(),c(),i.state=`orComment`;return}if(n===` `)throw new h(t?`Input ended in the middle of a comment`:`Input ended in the middle of a multi-line comment`);return e.commentDepth===1?o():a()}case`commentStar`:case`orCommentStar`:{let t=i.state===`commentStar`?`comment`:`orComment`;if(n!==`)`){e.commentDepth===1&&(i.token+=`*`),i.state=t;return}if(a(),--e.commentDepth,t===`orComment`&&e.commentDepth<0)throw new l(`Assertion failure`);if(e.commentDepth!==0){i.state=t;return}return i.token=``,s()}case`commentParen`:case`orCommentParen`:{let t=i.state===`commentParen`?`comment`:`orComment`;if(n===`*`)return e.commentDepth+=1,g(t);e.commentDepth===1&&(i.token+=`(`),i.state=t;return}}};for(;i.state!==`done`&&!i.isExprEnd;)_(i.nextChar);return i.nextChar!==`
|
|
25
|
+
`&&xn(t),an(i.lines)},Pn=(e,t,n)=>Nn(e,t,!0,n),Fn=(e,t)=>(Nn(e,t,!1,!1),e.delimiter),In=(e,t)=>({params:e,tokenizer:Mn(),lookahead:{tokens:Array.from({length:10},()=>``),columns:Array.from({length:10},()=>0),lines:Array.from({length:10},()=>0)},lastToken:{column:0,line:0,text:``},isInMacro:!1,log:t}),Ln=()=>an([[en(`defaultInitValue`,0,0)]]),Rn=(e,t)=>[...e,...t.filter((n,r)=>!e.includes(n)&&t.indexOf(n)===r)],zn=(e,t)=>!t.some(t=>e.includes(t)),Bn=(e,t)=>{t.splice(0,t.length,...e)},Vn=(e,t,n)=>{let r=e.params,i=e.lookahead,a=e.lastToken,o={lookaheadSize:0,addedLabels:[],addedLabelsLocs:[],nextLabelNum:1,allLabels:/* @__PURE__ */ new Set,hasLabel:!1,hasDefaultInitialization:!1,currentProcedure:void 0,procedures:[],cSyntax:!1,plusLabels:[],minusLabels:[],proceduresCalled:[],gotoUsed:!1,gotoDoneUsed:!1,omitPC:r.inputVersionNumber>=1500},s=e=>{throw new h(`${e}\n line ${a.line}, column ${a.column}`)},c=()=>{if(o.lookaheadSize===0)return Sn(t),a.column=t.vcolumn+1,a.line=t.line+1,a.text=Fn(e.tokenizer,t),a.text;a.column=i.columns[0]+1,a.line=i.lines[0]+1;let n=i.tokens[0];for(let e=1;e<o.lookaheadSize;e++)i.tokens[e-1]=i.tokens[e],i.columns[e-1]=i.columns[e],i.lines[e-1]=i.lines[e];return--o.lookaheadSize,a.text=n,n},u=n=>{for(;o.lookaheadSize<n;){let n=o.lookaheadSize;if(Sn(t)===` `)throw new h(`Premature end of file, perhaps because of unclosed comment, near\n line ${i.lines[n]+1}, column ${i.columns[n]+1}`);i.columns[n]=t.vcolumn,i.lines[n]=t.line,i.tokens[n]=Fn(e.tokenizer,t),o.lookaheadSize+=1}return i.tokens[n-1]},d=n=>{if(n<o.lookaheadSize)throw new l(`ParseAlgorithm.PeekPastAlgToken called to peek after a token
|
|
26
|
+
it has already peeked at`);for(;n>o.lookaheadSize;)i.tokens[o.lookaheadSize]=Fn(e.tokenizer,t),o.lookaheadSize+=1;return Sn(t)},f=(n=!1)=>{if(o.lookaheadSize!==0)throw new l(`ParseAlgorithm: GetExpr called after lookahead`);let r=Pn(e.tokenizer,t,n);return i.tokens[0]=e.tokenizer.delimiter,i.columns[0]=e.tokenizer.delimiterCol,i.lines[0]=e.tokenizer.delimiterLine,o.lookaheadSize=1,r},p=(e,t)=>{if(e===`;`){let e=u(1);if(`end begin else elsif or do macro procedure process fair define } {`.split(` `).includes(e))return;if(`if either while with call return goto print assert skip`.split(` `).includes(e))throw new h(`Missing \`;' before line ${i.lines[0]+1}, column ${i.columns[0]+1}`)}let n=c();n!==e&&n!==t&&s(`Expected "${e}" but found "${n}"`)},m=e=>{let t=c();t!==e&&s(`Expected "${e}" but found "${t}"`)},_=()=>{let e=c();return e===`=`?!0:e===`\\in`||e===`∈`?!1:s(`Expected "=" or "\\in" but found "${e}"`)},v=()=>p(u(1)===`,`?`,`:`;`),y=()=>p(o.cSyntax?`{`:`begin`),b=e=>{o.cSyntax?p(`}`):(p(`end`),p(e))},x=()=>{u(1)===`variables`?m(`variables`):p(`variable`)},S=()=>{let e={...z(),kind:`VarDecl`,var:c(),col:a.column,line:a.line,isEq:!0,val:Ln()};if(![`=`,`\\in`,`∈`].includes(u(1)))return o.hasDefaultInitialization=!0,e;if(e.isEq=_(),e.val=f(),e.val.tokens.length===0)throw new g(`NullPointerException`);return e},C=()=>{x();let e=[],t=[`begin`,`{`,`procedure`,`process`,`fair`,`define`,`macro`];for(;!t.includes(u(1));)e.push(S()),v();return e},w=()=>{let e={...z(),kind:`PVarDecl`,var:c(),col:a.column,line:a.line,val:Ln()};if(u(1)!==`=`)return o.hasDefaultInitialization=!0,e;if(p(`=`),e.val=f(),e.val.tokens.length===0)throw new g(`NullPointerException`);return e},ee=()=>{x();let e=[];for(;u(1)!==`begin`&&u(1)!==`{`;)e.push(w()),v();return e},T=()=>{if(`while if assert print else elsif either or end with when await skip call return goto`.split(` `).includes(u(1)))return!1;let e=Sn(t);return e.length>0&&e[0]===`:`&&!(e.length>1&&e[1]===`=`)},E=()=>{if(!T())return``;let t=c();e.isInMacro&&s(`A label may not appear in a macro.`),t===`Done`&&s("Cannot use `Done' as a label."),t===`Error`&&s("Cannot use `Error' as a label."),p(`:`),o.hasLabel=!0,o.allLabels.add(t);let n=u(1);return n!==`+`&&n!==`-`||(p(n),(n===`+`?o.plusLabels:o.minusLabels).push(t),o.omitPC=!1),t},D=()=>{let e=[],t=e=>!o.cSyntax&&[`end`,`else`,`elsif`,`or`].includes(e)||o.cSyntax&&e===`}`;for(;!t(u(1));)e.push(...ne());return o.cSyntax&&e.length===0&&s(`Empty statement list`),e},te=e=>{m(`{`);let t=D();if(p(`}`),p(`;`),e!==``){if(t[0].lbl!==``)throw new h(`Duplicate labeling of statement`,t[0]);t[0].lbl=e}return t},ne=()=>{let e=E();if(o.cSyntax&&u(1)===`{`)return te(e);let t=O();return t.lbl=e,[t]},O=()=>{let e=u(1);if(e===`if`)return A(0);if(e===`either`)return re();if(e===`with`)return ie(0);if(e===`when`||e===`await`){m(e);let t=a.column,n=a.line,r=f();if(r.tokens.length===0)throw new g(`NullPointerException`);return p(`;`),{...z(),kind:`When`,col:t,line:n,exp:r}}if(e===`print`||e===`assert`){m(e);let t=a.column,n=a.line,r=f();return r.tokens.length===0&&s(`Empty expression in ${e} statement at `),p(`;`),{...z(),kind:e===`print`?`PrintS`:`Assert`,col:t,line:n,exp:r}}if(e===`skip`){m(`skip`);let e={...z(),kind:`Skip`,col:a.column,line:a.line};return p(`;`),e}if(e===`call`)return N();if(e===`return`){m(`return`);let e={...z(),kind:`Return`,col:a.column,line:a.line,from:o.currentProcedure};return p(`;`),e}if(e===`goto`){m(`goto`);let e=a.column,t=a.line,n=c();return o.gotoUsed=!0,(n===`Done`||n===`"Done"`)&&(o.gotoDoneUsed=!0),p(`;`),{...z(),kind:`Goto`,col:e,line:t,to:n}}return e===`while`?k():d(1)[0]===`(`?se():j()},k=()=>{m(`while`);let e=a.column,t=a.line;o.cSyntax&&p(`(`);let n=f();o.cSyntax&&p(`)`),n.tokens.length===0&&s(`Empty while test at `),o.cSyntax||p(`do`);let r=o.cSyntax?ne():D();return o.cSyntax||(p(`end`),p(`while`),p(`;`)),r.length===0&&s(`Missing body of while statement at`),{...z(),kind:`While`,col:e,line:t,test:n,unlabDo:r,labDo:[]}},A=e=>{m(e===0?`if`:`elsif`);let t={...z(),kind:`LabelIf`,col:a.column,line:a.line,test:nn(),unlabThen:[],labThen:[],unlabElse:[],labElse:[]};o.cSyntax&&p(`(`),t.test=f(),o.cSyntax&&p(`)`),t.test.tokens.length===0&&s(`Empty if test at `),o.cSyntax||p(`then`),t.unlabThen=o.cSyntax?ne():D();let n=u(1);return n===`else`&&(m(`else`),t.unlabElse=o.cSyntax?ne():D()),!o.cSyntax&&n===`elsif`&&(t.unlabElse=[A(e+1)]),!o.cSyntax&&![`else`,`elsif`,`end`].includes(n)&&s(`Expecting "else", "elsif", or "end"`),!o.cSyntax&&e===0&&(p(`end`),p(`if`),p(`;`)),t.unlabElse.length===0&&$t(t.unlabThen,t.unlabThen.length-1),t},re=()=>{m(`either`);let e={...z(),kind:`LabelEither`,col:a.column,line:a.line,clauses:[]};for(;;){let t={...z(),kind:`Clause`,unlabOr:o.cSyntax?ne():D(),labOr:[]};if(t.unlabOr.length===0)throw new h("`either' statement with empty `or' clause",e);if(e.clauses.push(t),u(1)!==`or`)break;m(`or`)}if(o.cSyntax||(m(`end`),p(`either`),p(`;`)),e.clauses.length===1)throw new h("`either' statement has no `or'",e);return e},ie=e=>{e===0&&(p(`with`),o.cSyntax&&p(`(`));let t={...z(),kind:`With`,col:a.column,line:a.line,var:c(),isEq:!0,exp:nn(),Do:[]};t.isEq=_(),t.exp=f(),o.cSyntax&&u(1)===`)`||v(),t.exp.tokens.length===0&&s(`Empty with expression at `);let n=!o.cSyntax&&u(1)===`do`,r=o.cSyntax&&u(1)===`)`;if(n&&p(`do`),r&&m(`)`),t.Do=n?D():r?ne():[ie(e+1)],n&&(p(`end`),p(`with`),p(`;`)),t.Do.length===0)throw new h(`Missing body of with statement`,t);return t},ae=()=>{let e=i.columns[0]+1,t=i.lines[0]+1,n={...z(),kind:`Lhs`,col:e,line:t,var:c(),sub:f()};p(`:=`,`≔`);let r=f();return r.tokens.length===0&&s(`Empty right-hand side of assignment at `),{...z(),kind:`SingleAssign`,col:e,line:t,lhs:n,rhs:r}},j=()=>{let e={...z(),kind:`Assign`,col:i.columns[0]+1,line:i.lines[0]+1,ass:[ae()]};for(;u(1)===`||`||u(1)===`‖`;){c();try{e.ass.push(ae())}catch(e){if(!(e instanceof h))throw e;s(`Bad assignment statement at `)}}return p(`;`),e},oe=()=>{let e=[];if(d(0)[0]!==`)`)for(;;){let t=f();if(e.push(t),t.tokens.length===0&&s(`Empty argument in call statement at `),u(1)===`)`)break;p(`,`)}return p(`)`),p(`;`),e},M=()=>{m(`call`);let e={...z(),kind:`Call`,col:a.column,line:a.line,returnTo:``,to:c(),args:[]};return p(`(`),e.args=oe(),o.proceduresCalled.includes(e.to)||o.proceduresCalled.push(e.to),e},N=()=>{let e=M();if(u(1)===`return`)return m(`return`),p(`;`),{...z(),kind:`CallReturn`,col:e.col,line:e.line,to:e.to,from:o.currentProcedure,args:e.args};if(u(1)!==`goto`)return e;m(`goto`);let t={...z(),kind:`CallGoto`,col:e.col,line:e.line,to:e.to,after:c(),args:e.args};return o.gotoUsed=!0,(t.to===`Done`||t.to===`"Done"`)&&(o.gotoDoneUsed=!0),p(`;`),t},se=()=>{let e={...z(),kind:`MacroCall`,name:c(),col:a.column,line:a.line,args:[]};return m(`(`),e.args=oe(),e},ce=t=>{e.isInMacro=!0,m(`macro`);let n={...z(),kind:`Macro`,col:a.column,line:a.line,name:c(),params:[],body:[]};for(p(`(`);u(1)!==`)`;)n.params.length>0&&p(`,`),n.params.push(c());return m(`)`),y(),n.body=D(),b(`macro`),u(1)===`;`&&c(),be(n.body,t),e.isInMacro=!1,n},le=()=>{p(`procedure`);let e={...z(),kind:`Procedure`,col:a.column,line:a.line,name:c(),minusLabels:[],plusLabels:[],proceduresCalled:[],params:[],decls:[],body:[]};for(o.currentProcedure=e.name,o.plusLabels=[],o.minusLabels=[],o.proceduresCalled=[],p(`(`);u(1)!==`)`;)e.params.length>0&&p(`,`),e.params.push(w());return m(`)`),u(1)!==`begin`&&u(1)!==`{`&&(e.decls=ee()),y(),e.body=D(),b(`procedure`),u(1)===`;`&&c(),o.currentProcedure=void 0,e.plusLabels=o.plusLabels,e.minusLabels=o.minusLabels,e.proceduresCalled=o.proceduresCalled,e},ue=()=>{p(`process`);let e=a.column,t=a.line;o.cSyntax&&p(`(`);let n=c(),r=_(),i=f();o.plusLabels=[],o.minusLabels=[],o.proceduresCalled=[],o.cSyntax&&p(`)`),i.tokens.length===0&&s(`Empty process id at `);let l=u(1)===`begin`||u(1)===`{`?[]:C();y();let d=D();return b(`process`),u(1)===`;`&&c(),{...z(),kind:`Process`,col:e,line:t,name:n,fairness:0,minusLabels:o.minusLabels,plusLabels:o.plusLabels,proceduresCalled:o.proceduresCalled,isEq:r,id:i,decls:l,body:d}},de=()=>{let e=`${r.labelRoot}${o.nextLabelNum}`;return o.nextLabelNum+=1,o.allLabels.has(e)?de():e},fe=e=>{e.lbl===``&&(e.lbl=de(),o.addedLabels.push(e.lbl),o.addedLabelsLocs.push(Zt(e)))},pe=(e,t,n,r,i)=>{Bn(r,i);let a={isNextLabeled:t,hasLabel:!1},s=e=>{fe(e),a.hasLabel=!0,i.length=0};return e.forEach(e=>{if(e.lbl!==``&&(a.hasLabel=!0,i.length=0,n))throw new h("Label in `with' statement",e);if(a.isNextLabeled){if(n)throw new h("Statement follows `call' or `return' inside a `with' statement.",e);s(e),a.isNextLabeled=!1}switch(e.kind){case`LabelIf`:{let t=[],r=[],o=pe(e.unlabThen,!1,n,i,t);a.isNextLabeled=pe(e.unlabElse,!1,n,i,r)||o,Bn(Rn(t,r),i);return}case`LabelEither`:{let t=[];e.clauses.forEach(e=>{let r=[];a.isNextLabeled=pe(e.unlabOr,!1,n,i,r)||a.isNextLabeled,Bn(Rn(r,t),t)}),Bn(t,i);return}case`While`:if(n)throw new h("`while' inside a `with' statement",e);s(e),pe(e.unlabDo,!1,!1,i,[]),a.isNextLabeled=!1;return;case`With`:{let t=[];a.isNextLabeled=pe(e.Do,!1,!0,n?[...r]:[],t),Bn(t,i),!n&&!zn(r,i)&&s(e);return}}let t=e.kind===`Call`||e.kind===`CallGoto`,c=e.kind===`Return`||e.kind===`CallReturn`,l=e.kind===`Assign`?Rn([],e.ass.map(e=>e.lhs.var)):t||c?[`stack`,...c||e.to===o.currentProcedure?o.procedures.flatMap(e=>[...e.params,...e.decls].map(e=>e.var)):[]]:[];if(a.isNextLabeled=t||c||e.kind===`Goto`,zn(i,l))Bn(Rn(i,l),i);else{if(n)throw new h(e.kind===`Assign`?"Second assignment to same variable inside a `with' statement":"Call or return makes second assignment to a variable inside a `with' statement",e);s(e),Bn(l,i)}}),a.hasLabel||a.isNextLabeled},me=e=>{let t=e=>{let t=e.findIndex(e=>e.lbl!==``),n=t===-1?e:e.slice(0,t);return me(n),{unlabeled:n,labeled:he(t===-1?[]:e.slice(t))}};e.forEach(e=>{switch(e.kind){case`LabelIf`:{let n=t(e.unlabThen);e.unlabThen=n.unlabeled,e.labThen=n.labeled;let r=t(e.unlabElse);e.unlabElse=r.unlabeled,e.labElse=r.labeled;return}case`LabelEither`:e.clauses.forEach(e=>{let n=t(e.unlabOr);e.unlabOr=n.unlabeled,e.labOr=n.labeled});return;case`While`:{let n=t(e.unlabDo);e.unlabDo=n.unlabeled,e.labDo=n.labeled}}})},he=e=>{let t=[];return e.forEach(e=>{if(e.lbl===``&&t.length>0)t[t.length-1].stmts.push(e);else{if(e.lbl===``)throw new l(`Failure of assertion: Missing Label in MakeLabeledStmtSeq`);t.push({...z(),kind:`LabeledStmt`,col:e.col,line:e.line,macroCol:e.macroCol,macroLine:e.macroLine,label:e.lbl,stmts:[e]})}}),t.forEach(e=>me(e.stmts)),t},ge=(e,t)=>{let n=e[t];switch(n.kind){case`LabelIf`:{let r=P(n.unlabThen);n.labThen.forEach(e=>P(e.stmts));let i=P(n.unlabElse);return n.labElse.forEach(e=>P(e.stmts)),n.labThen.length>0||n.labElse.length>0||r===2||i===2?2:(e[t]={...z(),kind:`If`,test:n.test,Then:n.unlabThen,Else:n.unlabElse},+(r+i>0))}case`LabelEither`:{let r=n.clauses.reduce((e,t)=>{let n=Math.max(e,P(t.unlabOr));return t.labOr.forEach(e=>P(e.stmts)),t.labOr.length>0?2:n},0);return r===2?2:(e[t]={...z(),kind:`Either`,ors:n.clauses.map(e=>e.unlabOr)},r)}case`With`:{let e=P(n.Do);if(e===2)throw new h(`with statement at ${Zt(n)} contains a labeled statement`);return e}case`While`:if(t!==0)throw new l("ParseAlgorithm.ClassifyStmtSeq encountered `while' not at beginning of StmtSeq.");return P(n.unlabDo),n.labDo.forEach(e=>P(e.stmts)),0;case`Call`:return e[t+1]?.kind===`Return`?0:1;case`Return`:case`CallReturn`:if(o.currentProcedure===void 0)throw new h(`return statement not in a procedure at ${Zt(n)}`);return 1;case`Goto`:case`CallGoto`:return 1;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`MacroCall`:return 0;default:throw new l(`ParseAlgorithm.ClassifyStmtSeq encountered the unexpected statement type ${n.kind}`)}},P=e=>{for(let t=0;t<e.length;t++){let n=ge(e,t);if(n!==0){if(t===e.length-1)return n;throw new l(`Translator discovered later than it should have that\n Statement at ${Zt(e[t+1])} must have a label`)}}return 0},_e=e=>{pe(e,!0,!1,[],[]);let t=he(e);return t.forEach(e=>P(e.stmts)),t},ve=(e,t,n,r,i)=>{let a=e=>hn(e,t,n),o=e=>e.map(e=>ve(e,t,n,r,i)),s=e=>e.map(e=>({...z(),kind:`LabeledStmt`,label:e.label,stmts:e.stmts.map(e=>ve(e,t,n,-1,0))})),c={...z(),col:e.col,line:e.line,macroCol:r>0?i:e.macroCol,macroLine:r>0?r:e.macroLine};switch(e.kind){case`Assign`:return{...c,kind:`Assign`,ass:e.ass.map(e=>ye(e,t,n,r,i))};case`If`:return{...c,kind:`If`,test:a(e.test),Then:o(e.Then),Else:o(e.Else)};case`Either`:return{...c,kind:`Either`,ors:e.ors.map(o)};case`With`:return{...c,kind:`With`,var:e.var,isEq:e.isEq,exp:a(e.exp),Do:o(e.Do)};case`When`:case`Assert`:case`PrintS`:return{...c,kind:e.kind,exp:a(e.exp)};case`Skip`:return{...c,kind:`Skip`,macroCol:r>0?i:0,macroLine:r>0?r:-1};case`While`:return{...c,kind:`While`,test:a(e.test),unlabDo:o(e.unlabDo),labDo:s(e.labDo)};case`LabelIf`:return{...c,kind:`LabelIf`,test:a(e.test),unlabThen:o(e.unlabThen),labThen:s(e.labThen),unlabElse:o(e.unlabElse),labElse:s(e.labElse)};case`LabelEither`:return{...c,kind:`LabelEither`,clauses:e.clauses.map(e=>({...z(),kind:`Clause`,labOr:s(e.labOr),unlabOr:o(e.unlabOr)}))};case`Call`:return{...c,kind:`Call`,to:e.to,returnTo:e.returnTo,args:gn(e.args,t,n)};case`Return`:return{...c,kind:`Return`,from:e.from};case`CallReturn`:return{...c,kind:`CallReturn`,to:e.to,from:e.from,args:gn(e.args,t,n)};case`CallGoto`:return{...c,kind:`CallGoto`,to:e.to,after:e.after,args:gn(e.args,t,n)};case`Goto`:return{...c,kind:`Goto`,to:e.to};default:throw new l(`Found unexpected statement type in macro at${Zt(e)}`)}},ye=(e,t,n,r,i)=>{let a=hn(e.rhs,t,n),o={...z(),kind:`Lhs`,var:e.lhs.var,sub:e.lhs.sub.tokens.length===0?e.lhs.sub:hn(e.lhs.sub,t,n)},s={...z(),kind:`SingleAssign`,col:e.col,line:e.line,macroCol:r>0?i:e.macroCol,macroLine:r>0?r:e.macroLine,lhs:o,rhs:a},c=n.indexOf(o.var);if(c===-1)return s;let l=t[c],u=un(l,{line:0,item:0});if(u.type!==qt.ident)throw new h(`Macro expansion substitutes \`${u.string}' for assignment variable\n at ${Zt(s)}`);if(o.var=u.string,dn(l,{line:0,item:0},1)===void 0)return s;let d=sn(l);return d.tokens[0].splice(0,1),rn(d),o.sub.tokens.length===0?o.sub=d:cn(o.sub,d,0),s},be=(e,t)=>{let n=e.flatMap(e=>{switch(e.kind){case`LabelIf`:return be(e.unlabThen,t),be(e.unlabElse,t),[e];case`LabelEither`:return e.clauses.forEach(e=>be(e.unlabOr,t)),[e];case`With`:return be(e.Do,t),[e];case`While`:return be(e.unlabDo,t),[e];case`MacroCall`:return xe(e,t);default:return[e]}});e.splice(0,e.length,...n)},xe=(e,t)=>{let n=t.findLast(t=>t.name===e.name);if(n===void 0)throw new h(`Macro ${e.name} undefined,\n at ${Zt(e)}`);if(n.params.length!==e.args.length)throw new h(`Macro ${e.name} called with wrong number of arguments at \n ${Zt(e)}`);let r=n.body.map(t=>ve(t,e.args,n.params,e.line,e.col));return r.length>0&&(r[0].lbl=e.lbl),r},Se=e=>{e.forEach((t,n)=>{if(e.slice(n+1).some(e=>e.name===t.name))throw new h(`Multiple definitions of macro name \`${t.name}'`)})},Ce=e=>{if(e.length===0)return;let t=()=>{o.omitPC=!1},n=e[0];if(e.length>1||n.kind!==`LabeledStmt`)return t();if(n.stmts.length===0)return;let r=n.stmts[0];if(n.stmts.length>1||r.kind!==`While`||!ln(r.test)||r.test.tokens[0][0].string!==`TRUE`)return t();r.labDo.length>0&&(o.omitPC=!1),r.unlabDo.some(e=>[`LabelIf`,`LabelEither`,`LabeledStmt`].includes(e.kind))&&(o.omitPC=!1)},we=()=>{let e=o.addedLabels.length>1?`Missing labels at the following locations:`:`Missing label at the following location:`;throw new h([e,...o.addedLabelsLocs].join(`
|
|
27
|
+
`))},Te=e=>o.procedures.forEach(t=>{o.currentProcedure=t.name,be(t.body,e),t.body=_e(t.body)}),Ee=()=>{n&&c()!==`algorithm`&&s("`--fair' not followed by `algorithm'");let t=c();o.cSyntax=u(1)===`{`,o.cSyntax&&m(`{`);let i=u(1)===`variable`||u(1)===`variables`?C():[],a={value:nn()};u(1)===`define`&&(m(`define`),o.cSyntax&&p(`{`),a.value=f(!0),b(`define`),p(`;`));let l=[];for(;u(1)===`macro`;)l.push(ce(l));for(;u(1)===`procedure`;)o.procedures.push(le()),o.omitPC=!1;if(u(1)===`fair`&&(u(2)===`process`||u(2)===`+`&&u(3)===`process`)||u(1)===`process`){let n=[];for(;u(1)===`fair`||u(1)===`process`;){let e=u(1)===`fair`;e&&m(`fair`);let t=e&&u(1)===`+`;t&&m(`+`);let i=t||!e&&r.fairnessOption===`sf`?2:e||r.fairnessOption===`wf`?1:0;n.push({...ue(),fairness:i})}return b(`algorithm`),Se(l),n.forEach(e=>{be(e.body,l),e.body=_e(e.body),Ce(e.body)}),Te(l),o.addedLabels.length>0&&(r.labelFlag||we(),e.log(`Labels added.`)),(o.gotoDoneUsed||o.gotoUsed)&&(o.omitPC=!1),{...z(),kind:`Multiprocess`,name:t,decls:i,defs:a.value,macros:l,prcds:o.procedures,procs:n}}r.inputVersionNumber===1500&&u(1)===`fair`&&(p(`fair`),u(1)===`+`&&p(`+`),r.fairnessOption=`wf`),n&&([``,`wf`,`wfNext`].includes(r.fairnessOption)||e.log(`Warning: Option \`${r.fairnessOption}' specified for --fair algorithm.`),r.fairnessOption=`wf`),y();let d=D();Se(l),be(d,l),Te(l),o.cSyntax&&p(`}`),b(`algorithm`);let h=_e(d);return o.addedLabels.length>0&&(o.hasLabel&&!r.labelFlag&&we(),e.log(`Labels added.`)),(o.gotoUsed||o.gotoDoneUsed)&&(o.omitPC=!1),Ce(h),{...z(),kind:`Uniprocess`,name:t,decls:i,defs:a.value,macros:l,prcds:o.procedures,body:h}};try{return{ast:Ee(),omitPC:o.omitPC,hasDefaultInitialization:o.hasDefaultInitialization}}catch(e){if(!(e instanceof g))throw e;return s(`Unknown error at or before`)}},V={global:0,label:1,procedure:2,process:3,processVar:4,procedureVar:5,parameter:6},Hn=[`Global variable`,`Label`,`Procedure`,`Process`,`Process variable`,`Procedure variable`,`Parameter`],Un=/* @__PURE__ */ new Set([V.global,V.processVar,V.procedureVar,V.parameter]),Wn=(e,t,n,r)=>e.symbols.find(e=>e.id===n&&e.context===r&&e.type===t),Gn=(e,t,n)=>e.symbols.find(e=>e.id===t&&e.context===n),Kn=(e,t)=>{let n=e.procedures.findIndex(e=>e.name===t);return n===-1?e.procedures.length:n},qn=(e,t,n,r)=>!(t===V.procedureVar||t===V.processVar||t===V.parameter?Wn(e,V.global,n,``)!==void 0||Gn(e,n,r)!==void 0:Wn(e,t,n,r)!==void 0)&&(e.symbols.push({type:t,id:n,context:r,useThis:n}),!0),Jn=(e,t,n,r)=>Wn(e,t,n,r)?.useThis??n,Yn=(e,t,n)=>{let r=Gn(e,t,n);return r===void 0?t:Un.has(r.type)?r.useThis:t},Xn=e=>{let t={symbols:[],procedures:[],processNames:[],errorReport:``},n=(e,n)=>{qn(t,V.label,e.label,n)||(t.errorReport+=`\nLabel ${e.label} redefined at line ${e.line}, column ${e.col}`),e.stmts.forEach(e=>r(e,n))},r=(e,t)=>{let i=e=>e.forEach(e=>r(e,t)),a=e=>e.forEach(e=>n(e,t));switch(e.kind){case`While`:i(e.unlabDo),a(e.labDo);return;case`If`:i(e.Then),i(e.Else);return;case`With`:i(e.Do);return;case`LabelIf`:i(e.unlabThen),a(e.labThen),i(e.unlabElse),a(e.labElse);return;case`Either`:e.ors.forEach(i);return;case`LabelEither`:e.clauses.forEach(e=>{i(e.unlabOr),a(e.labOr)});return;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`Call`:case`Return`:case`CallReturn`:case`CallGoto`:case`Goto`:return;default:throw new l(`Unexpected AST type ${e.kind}`)}},i=(e,n,r=n===``?V.global:V.processVar)=>{qn(t,r,e.var,n)||(t.errorReport+=`\n${Hn[r]} ${e.var} redefined at line ${e.line}, column ${e.col}`)};if(qn(t,V.global,`pc`,``),e.prcds.length>0&&qn(t,V.global,`stack`,``),e.decls.forEach(e=>i(e,``)),e.prcds.forEach(e=>{let r=Kn(t,e.name)<t.procedures.length;r&&(t.errorReport+=`\nProcedure ${e.name} redefined at line ${e.line}, column ${e.col}`),r||t.procedures.push({name:e.name,params:e.params,decls:e.decls,initialPC:e.body.length===0?void 0:Qt(e.body[0]).label}),qn(t,V.procedure,e.name,``),e.decls.forEach(t=>i(t,e.name,V.procedureVar)),e.params.forEach(t=>i(t,e.name,V.parameter)),e.body.forEach(t=>n(Qt(t),e.name))}),e.kind===`Multiprocess`&&e.procs.forEach(e=>{let r=t.processNames.includes(e.name);r&&(t.errorReport+=`\nProcess ${e.name} redefined at line ${e.line}, column ${e.col}`),r||t.processNames.push(e.name),qn(t,V.process,e.name,``),e.decls.forEach(t=>i(t,e.name)),e.body.forEach(t=>n(Qt(t),e.name))}),e.kind===`Uniprocess`&&e.body.forEach(e=>n(Qt(e),``)),t.errorReport.length>0)throw new h(t.errorReport);return t},Zn=e=>{let t=t=>e.symbols.filter(e=>e.useThis===t).length>1,n={isAny:!1};for(let r=0;r<=7;r+=1)e.symbols.forEach(e=>{if(e.type===r){e.useThis=e.id;for(let n=1;r>0&&t(e.useThis);n+=1)e.useThis+=n===1?`_`:e.context[n-2]??String(r);e.id!==e.useThis&&(n.isAny=!0)}});return n.isAny},Qn=e=>{let t=e.symbols.filter(e=>e.id===`defaultInitValue`).map(e=>`${Hn[e.type]} name`);if(t.length>0)throw new h(`Cannot use \`defaultInitValue' as ${t.join(` or `)}`)},$n=(e,t,n)=>{let r=(e,n)=>{let r=[],i=[];e.tokens.forEach(e=>e.forEach(e=>{if(e.type!==qt.ident)return;let a=Yn(t,e.string,n);r.includes(e.string)||a===e.string||(r.push(e.string),i.push(an([[nr(a)]])))})),i.length>0&&mn(e,i,r,!1)},i=(e,n)=>{e.var=Yn(t,e.var,n),r(e.val,n)},a=(e,n)=>e.forEach((r,i)=>{e[i]=Jn(t,V.label,r,n)}),o=(e,n)=>e===void 0?void 0:Jn(t,V.procedure,e,n),s=(e,n)=>{e.label=Jn(t,V.label,e.label,n),e.stmts.forEach(e=>c(e,n))},c=(e,n)=>{let i=e=>e.forEach(e=>c(e,n)),a=e=>e.forEach(e=>s(e,n)),u=e=>e.forEach(e=>r(e,n));switch(e.kind){case`LabeledStmt`:s(e,n);return;case`While`:i(e.unlabDo),a(e.labDo),r(e.test,n);return;case`Assign`:e.ass.forEach(e=>{e.lhs.var=Yn(t,e.lhs.var,n),r(e.lhs.sub,n),r(e.rhs,n)});return;case`If`:i(e.Then),i(e.Else),r(e.test,n);return;case`With`:r(e.exp,n),i(e.Do);return;case`When`:case`PrintS`:case`Assert`:r(e.exp,n);return;case`Skip`:return;case`LabelIf`:r(e.test,n),i(e.unlabThen),a(e.labThen),i(e.unlabElse),a(e.labElse);return;case`Call`:e.returnTo=Jn(t,V.procedure,e.returnTo,n),e.to=Jn(t,V.procedure,e.to,n),u(e.args);return;case`Return`:e.from=o(e.from,n);return;case`CallReturn`:e.from=o(e.from,n),e.to=Jn(t,V.procedure,e.to,n),u(e.args);return;case`CallGoto`:e.after=Jn(t,V.procedure,e.after,n),e.to=Jn(t,V.procedure,e.to,n),u(e.args);return;case`Goto`:if(Wn(t,V.label,e.to,n)===void 0&&e.to!==`Done`)throw new h(`goto to non-existent label \`${e.to}' at line ${e.line}, column ${e.col}`);e.to=Jn(t,V.label,e.to,n);return;case`Either`:e.ors.forEach(i);return;case`LabelEither`:e.clauses.forEach(e=>{i(e.unlabOr),a(e.labOr)});return;default:throw new l(`Unexpected AST type${e.kind}`)}},u=e=>{e.decls.forEach(t=>i(t,e.name)),e.params.forEach(t=>i(t,e.name)),e.body.forEach(t=>s(Qt(t),e.name));let n=$t(t.procedures,Kn(t,e.name));a(e.plusLabels,e.name),a(e.minusLabels,e.name),n.initialPC!==void 0&&(n.initialPC=Jn(t,V.label,n.initialPC,e.name)),e.name=Jn(t,V.procedure,e.name,``),n.name=e.name},d=e=>{e.decls.forEach(t=>i(t,e.name)),e.body.forEach(t=>s(Qt(t),e.name)),a(e.plusLabels,e.name),a(e.minusLabels,e.name),e.name=Jn(t,V.process,e.name,``)};e.decls.forEach(e=>i(e,``)),e.kind===`Multiprocess`&&((e,t)=>{e.forEach(u);let r=e.map(e=>e.name),i=e.map(e=>r.map(t=>e.proceduresCalled.includes(t)));r.forEach((e,t)=>i.forEach(e=>e.forEach((n,r)=>{e[r]=n||e[t]&&i[t][r]}))),e.forEach((e,t)=>{e.proceduresCalled=r.filter((e,n)=>i[t][n])});for(let e of t){d(e);let t=e.proceduresCalled;for(let e=0;e<t.length;e+=1){let a=r.indexOf(t[e]);if(a===-1){n(`\nUnrecoverable error:\n -- Could not find procedure name \`${t[e]}'.\n`);return}r.forEach((e,n)=>{i[a][n]&&!t.includes(e)&&t.push(e)})}}})(e.prcds,e.procs),e.kind===`Uniprocess`&&(e.prcds.forEach(u),e.body.forEach(e=>s(Qt(e),``)))},er=e=>en(e,0,qt.string),tr=e=>en(e,0,qt.added),H=e=>en(e,0,qt.builtin),nr=e=>en(e,0,qt.ident),rr=(e,t)=>{let n=[];return e.forEach(e=>{let r=n.at(-1),i=r===void 0?0:r.column+tn(r)+t;n.push(en(e.string,i,e.type))}),an([n])},ir=e=>e.tokens.forEach((t,n)=>{let r={column:n===0||n===e.tokens.length-1?1:6};t.forEach(e=>{if(e.column=r.column,r.column+=tn(e),e.type===qt.builtin)switch(e.string){case`|->`:case`↦`:e.column=Math.max(16,e.column+1),r.column=e.column+5;return;case`[`:case`<<`:r.column+=1;return;case`]`:case`>>`:e.column+=1,r.column+=1;return;case`\\o`:e.column+=1,r.column+=2}})}),ar=(e,t,n,r=0,i=0)=>({...z(),kind:`SingleAssign`,line:r,col:i,lhs:{...z(),kind:`Lhs`,var:e,sub:t},rhs:n}),or=(e,t=0,n=0)=>({...z(),kind:`Assign`,line:t,col:n,ass:e}),sr=(e,t,n=0,r=0)=>or([ar(e,an([]),t,n,r)],n,r),cr=e=>{if(e.tokens.length>1)return!1;let t=$t(e.tokens,0);return t.length===1?t[0].string===`TRUE`:t.length===3&&t[0].string===`(`&&t[1].string===`TRUE`&&t[2].string===`)`},lr=e=>({...z(),kind:`When`,exp:rr([tr(`pc`),H(`=`),er(e)],1)}),ur=e=>sr(`pc`,an([[er(e??`null`)]])),dr=e=>[nr(`Head`),H(`(`),tr(`stack`),H(`)`),H(`.`),nr(e)],fr=()=>[nr(`Tail`),H(`(`),tr(`stack`),H(`)`)],pr=e=>an([dr(e)]),mr=(e,t,n,r)=>{let i=[[H(`<<`),H(`[`),nr(`procedure`),H(`|->`),er(e),H(`,`)],[nr(`pc`),H(`|->`),...t]];n.forEach(e=>{i[i.length-1].push(H(`,`)),i.push([nr(e.var),H(`|->`),nr(e.var)])}),i[i.length-1].push(H(`]`),H(`>>`)),i.push(r);let a=nn(i);return ir(a),rn(a),a},hr=(e,t,n)=>{if(t.params.length!==n.args.length)throw new h(`Procedure ${n.to} called with wrong number of arguments`,n);return t.params.forEach((t,r)=>e.ass.push(ar(t.var,an([]),n.args[r],n.line,n.col))),[e,...t.decls.map(e=>sr(e.var,e.val,n.line,n.col)),ur(t.initialPC)]},gr=(e,t,n)=>{let r={procedure:void 0},i=(e,n)=>{let r=Kn(t,e.to);if(r===t.procedures.length)throw new h(`Call of non-existent procedure ${e.to}`,e);let i=t.procedures[r],a=mr(e.to,[er(n)],[...i.decls,...i.params],[H(`\\o`),tr(`stack`)]);return hr(sr(`stack`,a,e.line,e.col),i,e)},a=e=>{e.from??=r.procedure;let n=e.from;if(n===void 0)throw new h("`return' statement not in procedure",e);let i=Kn(t,n);if(i>=t.procedures.length)throw new h(`Error in procedure (perhaps name used elsewhere)`,e);let a=t.procedures[i],o=(t,n)=>or([ar(t,nn(),n,e.line,e.col)],e.line,e.col);return[o(`pc`,pr(`pc`)),...a.decls.map(e=>o(e.var,pr(e.var))),...a.params.map(e=>o(e.var,pr(e.var))),o(`stack`,an([fr()]))]},o=e=>{let n=e.from;if(n===void 0)throw new h(`\`return' statement following \`call' at ${Zt(e)} not in a procedure`);let r=$t(t.procedures,Kn(t,n)),i=Kn(t,e.to);if(i===t.procedures.length)throw new h(`Call of non-existent procedure ${e.to}`,e);let a=t.procedures[i],o=or([],e.line,e.col);if(n!==e.to){r.decls.forEach(t=>o.ass.push(ar(t.var,nn(),pr(t.var),e.line,e.col)));let t=mr(e.to,dr(`pc`),[...a.decls,...a.params],[H(`\\o`),...fr()]);o.ass.push(ar(`stack`,an([]),t,e.line,e.col))}return hr(o,a,e)},s=(e,t)=>{if(e.length===0)return{stmts:[],labeledStmts:[],needsGoto:!n};let r={stmts:e,labeledStmts:[],needsGoto:!1},c=e[e.length-1];switch(c.kind){case`LabelIf`:case`LabelEither`:{let n=c.kind===`LabelIf`?f(c,t):p(c,t);e.pop(),e.push(n.stmt),r.labeledStmts=n.labeledStmts;break}case`Goto`:e.pop(),e.push(ur(c.to));break;case`Call`:e.pop(),e.push(...i(c,t));break;case`Return`:e.pop(),e.push(...a(c));break;case`CallReturn`:e.pop(),e.push(...o(c));break;case`CallGoto`:e.pop(),e.push(...i({...z(),kind:`Call`,returnTo:``,to:c.to,args:c.args,line:c.line,col:c.col},c.after));break;case`If`:{let e=s(c.Then,t),i=s(c.Else,t);r.labeledStmts.push(...e.labeledStmts,...i.labeledStmts),c.Then=e.stmts,c.Else=i.stmts,n||(r.needsGoto=e.needsGoto&&i.needsGoto,r.needsGoto||(e.needsGoto&&c.Then.push(ur(t)),i.needsGoto&&c.Else.push(ur(t))));break}case`Either`:{let e=c.ors.map((e,n)=>{let i=s(e,t);return c.ors[n]=i.stmts,r.labeledStmts.push(...i.labeledStmts),i});r.needsGoto=e.every(e=>e.needsGoto),!n&&!r.needsGoto&&e.forEach((e,n)=>{e.needsGoto&&c.ors[n].push(ur(t))});break}case`With`:{let e=s(c.Do,t);c.Do=e.stmts,r.labeledStmts.push(...e.labeledStmts),r.needsGoto=e.needsGoto;break}default:r.needsGoto=!0}return n&&(r.needsGoto=!1),r},c=(e,t)=>{let n=s(e,t);return n.needsGoto&&n.stmts.push(ur(t)),n},l=(e,t)=>{let r=e.stmts.at(0);if(r?.kind===`While`)return d(e,r,t);let i=c([...e.stmts],t),a=[];return n||(i.stmts.unshift(lr(e.label)),a.push({...z(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:i.stmts})),a.push(...i.labeledStmts),a},u=(e,t)=>e.flatMap((n,r)=>l(n,r<e.length-1?e[r+1].label:t)),d=(e,t,r)=>{let i=t.labDo.length===0?e.label:t.labDo[0].label,a=c([...t.unlabDo],i),o=c(e.stmts.slice(1),r),s=cr(t.test),l=s?a.stmts:[{...z(),kind:`If`,test:t.test,Then:a.stmts,Else:o.stmts}];return[{...z(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:[...n?[]:[lr(e.label)],...l]},...u(t.labDo,e.label),...a.labeledStmts,...s?[]:o.labeledStmts]},f=(e,t)=>{let n=c(e.unlabThen,e.labThen.length===0?t:e.labThen[0].label),r=c(e.unlabElse,e.labElse.length===0?t:e.labElse[0].label),i=u(e.labThen,t);return i.push(...u(e.labElse,t)),i.push(...n.labeledStmts,...r.labeledStmts),{stmt:{...z(),kind:`If`,col:e.col,line:e.line,test:e.test,Then:n.stmts,Else:r.stmts},labeledStmts:i}},p=(e,t)=>{let n=[],r=[];return e.clauses.forEach(e=>{let i=c(e.unlabOr,e.labOr.length>0?e.labOr[0].label:t);n.push(i.stmts),r.push(...i.labeledStmts),r.push(...u(e.labOr,t))}),{stmt:{...z(),kind:`Either`,col:e.col,line:e.line,ors:n},labeledStmts:r}},m=(e,t)=>u(e.map(Qt),t),g=e=>{r.procedure=e.name;let n=m(e.body,Jn(t,V.label,`Error`,``));return r.procedure=void 0,{...z(),kind:`Procedure`,col:e.col,line:e.line,name:e.name,minusLabels:[],plusLabels:[],proceduresCalled:[],params:e.params,decls:e.decls,body:n}},_=e=>({...z(),kind:`Process`,col:e.col,line:e.line,name:e.name,fairness:0,minusLabels:[],plusLabels:[],proceduresCalled:[],isEq:e.isEq,id:e.id,decls:e.decls,body:m(e.body,`Done`)}),v=e.prcds.map(g);return e.kind===`Uniprocess`?{...z(),kind:`Uniprocess`,col:e.col,line:e.line,name:e.name,decls:e.decls,defs:e.defs,macros:[],prcds:v,body:m(e.body,`Done`)}:{...z(),kind:`Multiprocess`,col:e.col,line:e.line,name:e.name,decls:e.decls,defs:e.defs,macros:[],prcds:v,procs:e.procs.map(_)}},_r=(e,t)=>{let n=t?[]:[`pc`];if(n.push(...e.decls.map(e=>e.var)),e.prcds.length>0&&n.push(`stack`),e.prcds.forEach(e=>{n.push(...e.params.map(e=>e.var)),n.push(...e.decls.map(e=>e.var))}),e.kind===`Multiprocess`&&e.procs.forEach(e=>n.push(...e.decls.map(e=>e.var))),n.length===0)throw new h(`The algorithm has no variables.`);let r=(e,t)=>{let r=n.indexOf(t);return r===-1?0:(e[r]+=1,e[r])},i=(e,t)=>t.forEach((t,n)=>{e[n]=Math.max(e[n],t)}),a=e=>[...e].sort((e,t)=>e.lhs.var<t.lhs.var?-1:+(e.lhs.var>t.lhs.var)),o=(e,t)=>{let o=[...t];e.ass=a(e.ass),new Set(e.ass.map(e=>e.lhs.var)).forEach(t=>{let i=e.ass.filter(e=>e.lhs.var===t);if(!n.includes(t))throw new h(`Assignment to undeclared variable ${t}`,i[0]);let a=i.some(e=>e.lhs.sub.tokens.length===0);if(r(o,t)>1||i.length>1&&a)throw new h(`Multiple assignment to ${t}`,e)}),i(t,o)},s=(e,t)=>{switch(e.kind){case`Assign`:o(e,t);return;case`If`:{let n=[...t],r=[...t];e.Then.forEach(e=>s(e,n)),e.Else.forEach(e=>s(e,r)),i(t,n),i(t,r);return}case`Either`:{let n=[...t];e.ors.forEach(e=>{let r=[...t];e.forEach(e=>s(e,r)),i(n,r)}),i(t,n);return}case`With`:e.Do.forEach(e=>s(e,t));return;case`When`:case`PrintS`:case`Assert`:case`Skip`:return;default:throw new l(`Unexpected AST type ${e.kind}`)}},c=e=>e.forEach(e=>{let t=n.map(()=>0);Qt(e).stmts.forEach(e=>s(e,t))});e.prcds.forEach(e=>c(e.body)),(e.kind===`Uniprocess`?[e.body]:e.procs.map(e=>e.body)).forEach(c)},vr=(e,t,n,r)=>{let i=Xn(e);Zn(i)&&r(`Warning: symbols were renamed.`),$n(e,i,r),_r(gr(e,i,t),t),n&&Qn(i)},yr=`[ \\t\\n\\x0B\\f\\r]`,br=RegExp(`\\\\\\* BEGIN TRANSLATION${yr}+\\(${yr}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([pP]([lL][uU][sS])?[cC][aA][lL]\\))${yr}*(=${yr}*"(?<pcal>[0-9A-Fa-f]*)"|\\\\in${yr}*STRING)${yr}*\\/\\\\${yr}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([tT][lL][aA]\\+?\\))${yr}*(=${yr}*"(?<tla>[0-9A-Fa-f]*)"|\\\\in${yr}*STRING)${yr}*\\)`),xr=e=>process.getBuiltinModule(`node:zlib`).crc32(Buffer.from(e,`utf8`)).toString(16),Sr=(e,t)=>e.log(`\nUnrecoverable error:\n -- ${t}.\n`),Cr=(e,t)=>Sr(e,t.node===void 0||t.node.line===0?t.message:`${t.message}\n at ${Zt(t.node)}`),wr=e=>e.map(e=>`${Array.from(e).reduce((e,t)=>t===` `?e+` `.repeat(8-e.length%8):e+t,``)} `),Tr=(e,t,n,r)=>{for(let i=Math.max(t,0);i<e.length;i++){let t=e[i],a=t.indexOf(n);if(a===-1)continue;let o=a+n.length,s=t.slice(o).search(/[^ ]/);if(s!==-1&&o+s===t.indexOf(r))return i}return-1},Er=(e,t)=>{for(;t.line<e.length;){let n=e[t.line];for(;t.column<n.length&&n[t.column]===` `;)t.column+=1;if(t.column<n.length)return n;t.line+=1,t.column=0}return``},Dr=(e,t,n)=>{let r=Array.from(e.slice(t)).findIndex(e=>n.includes(e));return r===-1?e.length:t+e.slice(t,t+r).length},Or=e=>/^[\p{L}\p{Nd}_]$/u.test(e),kr=(e,t,n)=>{for(;t.line<e.length;){let r=Er(e,t);if(r.slice(t.column).startsWith(n)){let e=t.column+n.length;if(e>=r.length||!/^[\p{L}_]$/u.test(r[e]))return t.column=Dr(r,e,` `),!0}t.column=Dr(r,t.column,` `)}return!1},Ar=(e,t)=>Sr(e,`Command-line error: ${t}`),jr=(e,t)=>{let n=e.params,r={isFirst:!0,isExplicitNof:!1},i=t=>(r.isFirst&&=(n.fairnessOption=``,!1),n.fairnessOption===``?(n.fairnessOption=t,!0):(Ar(e,`Can only have one of -wf, -sf, -wfNext, and -nof options`),!1));for(let a=0;a<t.length;a++){let o=t[a],s=t[a+1];switch(o){case`-spec`:case`spec`:case`-myspec`:case`myspec`:{let t=o.endsWith(`myspec`);if(n[t?`myspecOption`:`specOption`]=!0,n.specOption&&n.myspecOption){Ar(e,`
|
|
28
|
+
Can have at most one of the options -spec, -myspec, -spec2, -myspec2, writeAST`);return}if(s===void 0){Ar(e,`Specification name must follow \`-${t?`myspec`:`spec`}' option`);return}a+=1;continue}case`-termination`:case`termination`:n.checkTermination=!0;continue;case`-noold`:case`-nocfg`:case`-noDoneDisjunct`:case`noDoneDisjunct`:continue;case`-wf`:case`wf`:case`-sf`:case`sf`:case`-wfNext`:case`wfNext`:case`-nof`:case`nof`:if(!i(o.replace(/^-/,``)))return;o.endsWith(`nof`)&&(r.isExplicitNof=!0);continue;case`-label`:case`label`:n.labelFlag=!0;continue;case`-labelRoot`:case`labelRoot`:if(s===void 0){Ar(e,"Label root must follow `-labelRoot' option");return}if(!/^[a-zA-Z][a-zA-Z0-9_]*$/.test(s)){Ar(e,`Label root must be a valid PlusCal identifier (must start with a letter and contain only letters, numbers, and underscores)`);return}n.labelRoot=s,a+=1;continue;case`-version`:case`version`:{if(s===void 0){Ar(e,"Version number must follow `-version' option");return}let t=Yt(s);if(t<0||t>1903){Sr(e,t<0?`Illegal version ${s} specified.`:`Specified version ${s} later than current version 1.12`),Ar(e,`Bad version number`);return}n.inputVersionNumber=t,a+=1;continue}case`-lineWidth`:if(!/^[+-]?\d+$/.test(s??``)||Number(s)<60){Ar(e,"Integer value at least 60 must follow `-lineWidth' option");return}a+=1;continue;default:Ar(e,`Unknown or illegal option in options statement: ${o}`);return}}n.checkTermination&&n.fairnessOption===``&&!r.isExplicitNof&&(n.fairnessOption=`wf`)},Mr=(e,t,n)=>{if(Er(t,n),n.column+=7,!Er(t,n).slice(n.column).startsWith(`(`)){Sr(e,"`PlusCal options' not followed by '('");return}n.column+=1;let r=[];for(;;){let e=Er(t,n);if(n.line>=t.length||e[n.column]===`)`)break;if(e[n.column]===`,`){n.column+=1;continue}let i=Dr(e,n.column,` ,)`);r.push(e.slice(n.column,i)),n.column=i}n.line>=t.length?Sr(e,`No closing ')' found in options statement`):jr(e,r)},Nr=(e,t,n)=>{let r={depth:0,isDone:!1,isInString:!1};for(let i=t;!r.isDone&&i<e.length;i++){let a=e[i],o=i===t?n:0,s=[a.slice(0,o)];r.isInString=!1;for(let e=o;!r.isDone&&e<a.length;e++){let t=a[e],n=a.slice(e,e+2);if(n===`(*`&&!r.isInString)r.depth+=1,s.push(` `),e+=1;else if(n===`*)`&&!r.isInString&&r.depth===0)s.push(n),r.isDone=!0;else if(n===`*)`&&!r.isInString)--r.depth,s.push(` `),e+=1;else if(r.depth>0)s.push(` `);else if(r.isInString&&t===`\\`&&n.length===2)s.push(n),e+=1;else{if(!r.isInString&&n===`\\*`){s.push(` `);break}t===`"`&&(r.isInString=!r.isInString),s.push(t)}}if(r.isInString)return new h(`Unterminated string in line ${i+1}`);e[i]=s.join(``)}},Pr=(e,t)=>{let n=10*2**Math.max(0,Math.ceil(Math.log2(t/10)));throw new g(`java.lang.ArrayIndexOutOfBoundsException: Index ${e} out of bounds for length ${n}`)},Fr=(e,t,n)=>{if(!t.some(e=>e.indexOf(`algorithm`)>0))return/* @__PURE__ */ new Set([`NO_PLUSCAL_EXISTS`]);let r=wr(t),i={line:0,column:0};for(;kr(r,i,`PlusCal`);){let t=Er(r,i).slice(i.column),n=Array.from(t).findIndex(e=>!Or(e));if(t.startsWith(`options`)&&(n===-1?t.length:n)===7){Mr(e,r,i);break}}let a={line:0,column:-1,isFound:!1,isFair:!1};for(;a.line<r.length;a.line++){let e=r[a.line];if(/^=+$/.test(e))break;let t=e.indexOf(`--algorithm`),n=e.indexOf(`--fair`);if(t!==-1){a.column=t+11,a.isFound=!0;break}if(n!==-1){a.column=n+6,a.isFound=!0,a.isFair=!0;break}}let o=/* @__PURE__ */ new Set,s=Tr(r,0,`BEGIN`,`TRANSLATION`);s===-1&&o.add(`NO_TRANSLATION_EXISTS`);let c=Tr(r,s+1,`END`,`TRANSLATION`);if(c===-1&&o.add(`NO_TRANSLATION_EXISTS`),s===-1&&c===-1)return o;if(!a.isFound)return o.add(`NO_PLUSCAL_EXISTS`),o;let l=Nr(r,a.line,a.column);if(l!==void 0)return Cr(e,l),/* @__PURE__ */ new Set([`ERROR_ENCOUNTERED`]);let u={ast:void 0};try{let t=Vn(e,yn(r,a.line,a.column),a.isFair);u.ast=t.ast,vr(t.ast,t.omitPC,t.hasDefaultInitialization,e.log)}catch(t){if(!(t instanceof h))throw t;Cr(e,t)}s===-1&&Pr(-1,r.length);let d=br.exec(r[s]);if(d===null)return o.add(`NO_PCAL_CHECKSUMS_EXIST`),o;let f=d.groups?.pcal,p=a.isFair&&n!==`1.7.4`?`fair`:u.ast===void 0?void 0:vn(u.ast,e.params.inputVersionNumber,n);f!==void 0&&(p===void 0||f!==xr(p))&&o.add(`PCAL_DIVERGENCE_EXISTS`);let m=d.groups?.tla;if(m!==void 0){if(c===-1)throw new g(`java.lang.IllegalArgumentException: fromIndex(${s+1}) > toIndex(-1)`);let e=t.slice(s+1,c).join(``);m!==xr(e)&&o.add(`TLA_DIVERGENCE_EXISTS`)}return o.size===0?/* @__PURE__ */ new Set([`NO_DIVERGENCE`]):o},Ir=[[`STRING`,0,0,[],[]],[`FALSE`,0,0,[],[]],[`TRUE`,0,0,[],[]],[`BOOLEAN`,0,0,[],[]],[`=`,2,0,[2,2],[1,1]],[`/=`,2,0,[2,2],[1,1]],[`.`,2,0,void 0,void 0],[`'`,1,2,[1],[0]],[`\\lnot`,1,0,[3],[1]],[`\\neg`,1,0,void 0,void 0],[`\\land`,2,0,[3,3],[1,1]],[`\\lor`,2,0,[3,3],[1,1]],[`\\equiv`,2,0,[3,3],[1,1]],[`=>`,2,0,[3,3],[1,1]],[`SUBSET`,1,0,[2],[1]],[`UNION`,1,0,[2],[1]],[`DOMAIN`,1,0,[2],[1]],[`\\subseteq`,2,0,[2,2],[1,1]],[`\\in`,2,0,[2,2],[1,1]],[`\\notin`,2,0,[2,2],[1,1]],[`\\`,2,0,[2,2],[1,1]],[`\\intersect`,2,0,[2,2],[1,1]],[`\\union`,2,0,[2,2],[1,1]],[`\\times`,2,0,[2,2],[1,1]],[`~>`,2,3,[3,3],[0,0]],[`[]`,1,3,[3],[0]],[`<>`,1,3,[3],[0]],[`ENABLED`,1,1,[2],[0]],[`UNCHANGED`,1,2,[1],[0]],[`\\cdot`,2,2,[2,2],[0,0]],[`-+->`,2,3,[3,3],[0,0]],[`$AngleAct`,2,2,[2,1],[0,0]],[`$BoundedChoose`,-1,0,[2],[1]],[`$BoundedExists`,-1,0,[3],[1]],[`$BoundedForall`,-1,0,[3],[1]],[`$CartesianProd`,-1,0,[2],[1]],[`$Case`,-1,0,[3],[1]],[`$ConjList`,-1,0,[3],[1]],[`$DisjList`,-1,0,[3],[1]],[`$Except`,-1,0,[2],[1]],[`$FcnApply`,2,0,[2,2],[1,1]],[`$FcnConstructor`,-1,0,[3],[1]],[`$IfThenElse`,3,0,[3,3,3],[1,1,1]],[`$NonRecursiveFcnSpec`,1,0,[3],[1]],[`$Pair`,2,0,[3,3],[1,1]],[`$RcdConstructor`,-1,0,[3],[1]],[`$RcdSelect`,2,0,[2,0],[1,1]],[`$RecursiveFcnSpec`,1,0,[3],[1]],[`$Seq`,-1,0,[2],[1]],[`$SetEnumerate`,-1,0,[2],[1]],[`$SetOfAll`,-1,0,[2],[1]],[`$SetOfFcns`,-1,0,[2],[1]],[`$SetOfRcds`,-1,0,[2],[1]],[`$SF`,2,3,[1,2],[0,0]],[`$SquareAct`,2,2,[2,1],[0,0]],[`$SubsetOf`,1,0,[2],[1]],[`$TemporalExists`,1,3,[3],[0]],[`$TemporalForall`,1,3,[3],[0]],[`$TemporalWhile`,2,3,[3,3],[0,0]],[`$Tuple`,-1,0,[2],[1]],[`$UnboundedChoose`,1,0,[2],[1]],[`$UnboundedExists`,1,0,[3],[1]],[`$UnboundedForall`,1,0,[3],[1]],[`$WF`,2,3,[1,2],[0,0]],[`$Nop`,1,0,[3],[1]],[`$Qed`,0,0,[],[]],[`$Pfcase`,1,0,[3],[1]],[`$Have`,1,0,[3],[1]],[`$Take`,1,0,[3],[1]],[`$Pick`,1,0,[3],[1]],[`$Witness`,-1,0,[2],[1]],[`$Suffices`,1,0,[3],[1]]],Lr={file:`--TLA+ BUILTINS--`,beginLine:0,beginColumn:0,endLine:0,endColumn:0},U=e=>({id:e,levelChecked:0,level:0,levelParams:/* @__PURE__ */ new Set,allParams:/* @__PURE__ */ new Set,nonLeibnizParams:/* @__PURE__ */ new Set,argLevelParams:/* @__PURE__ */ new Map,levelCorrect:!0,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map}),Rr=e=>Ir.map(([t,n,r,i,a])=>{let o=e(),s=n<0?void 0:Array.from({length:n},(t,n)=>({...U(e()),kind:`FormalParam`,name:`Formal_${n}`,arity:0,location:void 0})),c=i!==void 0&&a!==void 0,l=a?.map(e=>e>0);return{...U(o),levelChecked:c?99:0,level:r,kind:`OpDef`,defKind:`BuiltIn`,name:t,arity:n,params:s,body:void 0,isLocal:!1,location:Lr,module:void 0,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:n<0?(a??[]).slice(0,1):a??[],isLeibnizArg:c?l:void 0,isLeibniz:l?.every(Boolean)??!0,opLevelCond:void 0,maxLevels:n<0?(i??[]).slice(0,1):i??[],minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0}}),zr=(e,t)=>{let n=JSON.stringify(t);e.some(e=>JSON.stringify(e)===n)||e.push(t)},Br=e=>e===void 0?`Unknown location`:typeof e==`string`?`In module ${e}`:e.beginLine===0&&e.beginColumn===0&&e.endLine===0&&e.endColumn===0?`In module ${e.file}`:`line ${e.beginLine}, col ${e.beginColumn} to line ${e.endLine}, col ${e.endColumn} of module ${e.file}`,Vr=e=>e?.kind===`OpAppl`&&e.isAbsent===!0,Hr=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},Ur=()=>({buckets:Array.from({length:11},()=>[]),count:0,threshold:8}),Wr=(e,t)=>(e&2147483647)%t,Gr=e=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let r=e.buckets.length-1;r>=0;r--)e.buckets[r].forEach(e=>n[Wr(e.hash,t)].unshift(e));e.buckets=n,e.threshold=Math.floor(t*.75)},Kr=(e,t,n=t)=>e.buckets[Wr(Hr(n),e.buckets.length)].find(e=>e.key===t)?.value,qr=(e,t,n,r=t)=>{let i=Hr(r),a=e.buckets[Wr(i,e.buckets.length)].find(e=>e.key===t);a?a.value=n:(e.count>=e.threshold&&Gr(e),e.buckets[Wr(i,e.buckets.length)].unshift({hash:i,key:t,value:n}),e.count++)},Jr=e=>e.buckets.toReversed().flatMap(e=>e.map(e=>e.value)),Yr=`\0module `,W=()=>({table:Ur(),symbols:[]}),Xr=e=>e.kind===`Module`?Yr+e.name:e.name,Zr=(e,t)=>{qr(e.table,Xr(t),t,t.name),e.symbols.push(t)},Qr=e=>e.kind===`ThmOrAssumpDef`?e.params.length:e.kind===`Module`?0:e.arity,$r=(e,t)=>Kr(e.table,t),ei=(e,t)=>Kr(e.table,Yr+t,t),ti=e=>e.context.symbols.filter(e=>e.kind===`OpDef`&&e.defKind===`UserDefined`),ni=(e,t)=>Jr(e.context.table).filter(e=>e.kind===`OpDecl`&&e.declKind===t).toReversed(),ri=e=>e.context.symbols.filter(e=>e.kind===`ThmOrAssumpDef`),ii=/* @__PURE__ */ new Map([[`$Qed`,`QED step`],[`$Pfcase`,`CASE`],[`$Have`,`HAVE`],[`$Take`,`TAKE`],[`$Pick`,`PICK`],[`$Witness`,`WITNESS`],[`$Suffices`,`SUFFICES`]]),ai=e=>{let t=e.split(`!`);return t.some(e=>e.length===0)?[e]:t},oi=e=>{switch(e.kind){case`Identifier`:return ai(e.name).map(e=>({op:`Name`,name:e,args:void 0}));case`Apply`:{let t=ai(e.operator),n=e.argumentCounts??t.map((n,r)=>r===t.length-1?e.args.length:0),r={value:0};return t.map((t,i)=>{let a=e.args.slice(r.value,r.value+n[i]);return r.value+=n[i],{op:`Name`,name:t,args:a.length>0?a:void 0}})}case`Subexpression`:return e.selectors.map(e=>{switch(e.kind){case`Name`:return{op:`Name`,name:e.name,args:e.args.length>0?e.args:void 0};case`Operand`:return{op:e.operand,name:String(e.operand),args:void 0};case`Bound`:return{op:`Null`,name:`!(...)`,args:e.args};case`At`:return{op:`@`,name:`@`,args:void 0};case`Colon`:return{op:`:`,name:`:`,args:void 0}}})}},si=e=>{let t=e[e.length-1];return t.op!==`Name`||t.args===void 0},ci=e=>typeof e.op==`number`?`argument selector ${e.name}`:e.name,li=(e,t)=>typeof e==`number`?e>0&&e<=t?e:-1:e===`<<`?t>0?1:-1:e===`>>`&&t===2?2:-1,ui=e=>e.kind===`OpDecl`||e.kind===`FormalParam`||e.kind===`OpDef`&&(e.defKind===`BuiltIn`||e.defKind===`NumberedProofStep`),di=e=>e.kind===`FormalParam`||e.kind===`OpDecl`||e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`||e.kind===`Module`,fi=e=>(e.bounded?.length??0)>0?(e.bounded??[]).flat():e.unbounded??[],pi=(e,t)=>e===void 0?t:{...e,endLine:t.endLine,endColumn:t.endColumn},mi=e=>(t,n,r,i,a)=>{let o=[],s=[],c=[],l=e=>t[e].location??a,u={name:void 0,nameLocation:void 0,node:void 0,index:0,mode:`FindingOpName`,previousMode:void 0,letInContext:void 0,definitionArityFound:0,definitionArgs:[],isInSuffices:!1},d=e=>e.args??[];for(;u.index<t.length;){let f=t[u.index];if((f.op!==`Name`&&f.op!==`Null`||n!==0)&&f.args!==void 0)return e.addError(l(u.index),`Selector \`${f.name}' should not have argument(s).`);switch(u.mode){case`FindingOpName`:{let f,p,m=[];for(;f===void 0&&u.index<t.length;){let n=t[u.index];if(p=n.op===`Name`?u.name===void 0?e.resolveSynonym(n.name):`${u.name}!${e.resolveSynonym(n.name)}`:void 0,u.name===void 0&&n.op!==`Name`)return e.addError(l(u.index),`Need name or step number here, not \`${n.name}'.`);p!==void 0&&(f=u.letInContext===void 0?e.resolveSymbol(p):$r(u.letInContext,p)),f===void 0&&(p!==void 0&&(u.name=p,u.nameLocation=pi(u.nameLocation,l(u.index))),m.push(...d(n)),u.index++)}if(f===void 0&&e.version===`1.7.4`){let n=t.length-1;return e.addError(l(n),`Unknown operator: \`${ci(t[n])}'.`)}if(f===void 0)return e.addError(u.nameLocation??a,`Unknown operator: \`${u.name}'.`);if(f.kind===`Module`)return e.addError(l(u.index),`Module name (${t[u.index].name}) not allowed here.`);if(u.node=f,u.nameLocation=pi(u.nameLocation,l(u.index)),u.name=p,ui(f)&&t.length!==1)return e.addError(l(u.index),`Cannot take subexpression of \`${u.name}'.`);let h=Qr(f);if(n===0){if(m.push(...d(t[u.index])),u.definitionArityFound+m.length!==h)return e.addError(t[u.index].argsLocation??a,`The operator ${u.name} requires ${h-u.definitionArityFound} arguments.`);m.forEach((t,n)=>u.definitionArgs.push(e.generateArgument(f,n+u.definitionArityFound,t,l(u.index))))}if(u.definitionArityFound=h,f.kind===`OpDef`&&f.defKind===`ModuleInstance`){if(u.index===t.length-1&&!(i||r))return e.addError(l(u.index),`Operator name ${u.name} is incomplete.`)}else{let n=f.kind===`OpDef`&&f.defKind===`UserDefined`||f.kind===`ThmOrAssumpDef`?f:void 0;if(f.kind===`OpDef`&&f.defKind===`UserDefined`&&!f.isDefined&&t.length!==1)return e.addError(l(u.index),`Subexpression of \`${u.name}' used inside the operator's definition.`);if(u.index!==t.length-1&&n!==void 0){s.push(...n.params??[]),u.name=void 0,u.nameLocation=void 0,u.mode=t[u.index+1].op===`Name`?`FollowingLabels`:`FindingSubExpr`,c.push(...u.definitionArgs),u.definitionArityFound=0,u.definitionArgs=[];let e=n.body;for(;e?.kind===`SubstIn`;)o.push(e),e=e.body;for(;e?.kind===`APSubstIn`;)o.push(e),e=e.body;u.mode===`FindingSubExpr`&&(u.node=e)}}u.previousMode=`FindingOpName`;break}case`FollowingLabels`:{let r=u.node,i=r?.kind===`OpDef`||r?.kind===`ThmOrAssumpDef`||r?.kind===`Label`?r.labels.get(f.name):void 0;if(i===void 0)return e.addError(l(u.index),`Cannot find label \`${f.name}'.`);if(u.node=i,e.isOutOfLabelScope(i))return e.addError(l(u.index),`Accessing subexpression labeled \`${f.name}' of ASSUME/PROVE clause within the scope of a declaration\n from outside that declaration's scope.`);if(n===0){if(i.params.length!==d(f).length)return e.addError(l(u.index),`Label \`${f.name}' used with wrong number of arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...i.params),u.index<t.length-1&&t[u.index+1].op!==`Name`&&(u.mode=`FindingSubExpr`),u.mode===`FindingSubExpr`&&(u.node=i.body),u.previousMode=`FollowingLabels`;break}case`FindingSubExpr`:{let n=u.node,r=()=>e.addError(l(u.index),`Nonexistent operand specified by \`${ci(f)}'.`);if(f.op===`:`){if(!(u.previousMode!==`FindingSubExpr`&&(u.index===t.length-1&&u.previousMode===`FindingOpName`||u.index<t.length-1&&t[u.index+1].op===`Name`)))return e.addError(l(u.index),`\`!:' can be used only after a name and either at the end after an
|
|
29
|
+
operator name or before an operator name.`)}else if(n===void 0)return e.addError(l(u.index),`Subexpression selection failed, probably due to an error in the selected expression.`);else if(n.kind===`LetIn`){if(li(f.op,1)!==1)return e.addError(l(u.index),`A LET/IN expression has only one operand.`);u.node=n.body}else if(n.kind===`OpAppl`){let i=n.operator,a=n.operands,o=i.kind===`FormalParam`||i.kind===`OpDecl`&&i.declKind===2||i.kind===`OpDef`&&i.defKind===`UserDefined`,p=()=>e.addError(l(u.index),`Internal error: Expecting $Pair and didn't find it.`),m=e=>e?.kind===`OpAppl`&&e.operator.name===`$Pair`,h=li(f.op,a.length);if(o){let e=li(f.op,i.arity);if(e===-1)return r();u.node=a[e-1]}else if(i.kind===`OpDef`&&i.defKind===`BuiltIn`){if(i.name===`$RcdConstructor`||i.name===`$SetOfRcds`){if(h===-1)return r();let e=a[h-1];if(!m(e))return p();u.node=e.operands[1]}else if(i.name===`$Case`){if(u.index===t.length-1)return e.addError(l(u.index),`Subexpression of CASE must have form !i!j.`);if(h===-1)return r();let n=a[h-1];if(!m(n))return p();u.index++;let i=li(t[u.index].op,2);if(i===-1)return e.addError(l(u.index),`Second selector for CASE subexpression must specify one of two operands.`);if(u.node=n.operands[i-1],u.node===void 0)return e.addError(l(u.index),`Selecting OTHER in a CASE statement.`)}else if(i.name===`$Except`){if(h>1)return e.addError(l(u.index),`Selecting subexpression of an EXCEPT not yet implemented.`);if(h===-1)return r();u.node=a[h-1]}else if((n.bounded?.length??0)===0&&(n.unbounded?.length??0)===0){if(h===-1)return r();u.node=a[h-1]}else if(f.op===`Null`||f.op===`@`){let t=fi(n);if(s.push(...t),f.op===`Null`){if(d(f).length!==t.length)return e.addError(l(u.index),`Selector with ${d(f).length} argument(s) used for quantifier with ${t.length} bound identifier(s).`);c.push(...d(f).map(e.generateExpression))}u.node=a[0]}else{let e=li(f.op,n.ranges.length);if(e===-1)return r();u.node=n.ranges[e-1]}}else return e.addError(l(u.index),`Choosing operand \`${f.name}' of subexpression with no operands.`)}else if(n.kind===`AssumeProve`){if(n.isSuffices&&!u.isInSuffices){if(li(f.op,1)!==1)return e.addError(l(u.index),`Accessing non-existent subexpression of a SUFFICES`);u.isInSuffices=!0}else{u.isInSuffices=!1;let i=li(f.op,1+n.assumptions.length);if(i===-1)return r();if(e.isOutOfClauseScope(n,i))return e.addError(l(u.index),`Accessing ASSUME/PROVE clause within the scope of a declaration
|
|
30
|
+
from outside that declaration's scope.`);if(i<=n.assumptions.length){if(u.node=n.assumptions[i-1],u.node.kind===`NewSymb`&&u.index!==t.length-1)return e.addError(l(u.index),`Selected a subexpression of a NEW clause of an ASSUME.`)}else u.node=n.goal}}else if(n.kind===`OpArg`){let t=n.op;if(t.kind!==`OpDef`||t.name!==`LAMBDA`)return e.addError(l(u.index),`Trying to select subexpression of an operator argument.`);if(f.op!==`Null`&&f.op!==`@`)return e.addError(l(u.index),`Cannot use !${f.name} to select subexpression of a LAMBDA.`);if(f.op===`Null`){if(t.arity!==d(f).length)return e.addError(l(u.index),`Selector with ${d(f).length} arguments used for LAMBDA expression taking ${t.arity} arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...t.params??[]),u.node=t.body}else if(n.kind===`Label`)u.node=n.body,u.index--;else return e.addError(l(u.index),`Selecting subexpression of expression that has none.`);if(u.node===void 0)return e.addError(l(u.index),`An unexpected null node specified by '${f.name}'.\nThis is probably due to a previous error.`);if(u.index!==t.length-1){let n=t[u.index+1];if(n.op===`Name`){for(;u.node?.kind===`Label`;)u.node=u.node.body;if(u.node?.kind!==`LetIn`)return e.addError(l(u.index),`A name selector here must be from a LET clause.`);u.letInContext=u.node.context,u.mode=`FindingOpName`}else if(n.op===`:`)return e.addError(l(u.index),`!: should not follow an operand selector.`)}u.previousMode=`FindingSubExpr`;break}}u.index++}let f=u.node;if(f===void 0)return e.addError(a,`Subexpression selection failed, probably due to an error in the selected expression.`);if(f.kind===`AssumeProve`||f.kind===`NewSymb`)return r?f:e.addError(a,f.kind===`AssumeProve`?`Selected ASSUME/PROVE instead of expression.`:`Selected a NEW declaration as an expression or operator.`);if(n<0){let t=f.kind===`OpDef`&&(f.defKind===`UserDefined`||f.defKind===`NumberedProofStep`||f.defKind===`ModuleInstance`&&i)||f.kind===`ThmOrAssumpDef`;return u.previousMode!==`FindingOpName`||!t?e.addError(a,`DEF clause entry should describe a defined operator.`):f.kind===`OpDef`&&f.step!==void 0&&f.step.kind!==`DefStep`?e.addError(a,`DEF clause entry refers to a non-definition step.`):f}if(f.kind===`OpDef`&&f.defKind===`NumberedProofStep`)return e.addError(a,r?`Step number of non-fact used as a fact`:`Step number of non-expression step used as an expression.`);if(n>0){let t=s.length+(f.kind===`OpArg`?Qr(f.op):u.previousMode===`FindingOpName`&&di(f)?Qr(f):0);if(n!==t)return e.addError(a,`Expected arity ${n} but found operator of arity ${t}.`)}let p=f;if(u.previousMode===`FindingOpName`&&s.length+o.length>0){if(p.kind!==`OpDef`&&p.kind!==`ThmOrAssumpDef`)return e.addError(t[t.length-1].location??a,`Internal Error: Found unexpected node kind after FindingOpName`);c.push(...u.definitionArgs);let n=(p.params??[]).map(t=>{let n=e.createFormalParam(t.name,t.arity,t.location);return s.push(n),t.arity===0?e.createOpAppl(n,[],a):e.createOpArg(n,a)});p=e.createOpAppl(p,n,a)}if(p.kind===`OpArg`){if(n===0)return e.addError(a,`Selected operator argument when expression expected.`);if(s.length+o.length>0){let t=p.op;s.push(...Array.from({length:Qr(t)},(t,n)=>e.createFormalParam(`NewParam${n}`,0,void 0))),p=e.createOpAppl(t,u.definitionArgs,a)}}if(!r){if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`AssumeProve`||p.kind===`Label`&&p.isAssumeProve)return e.addError(a,`ASSUME/PROVE used where an expression is required.`);if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`OpAppl`){let t=ii.get(p.body.operator.name);if(t!==void 0)return e.addError(a,`${t} proof step selected instead of expression.`)}}if(p.kind===`FormalParam`||p.kind===`OpDecl`||p.kind===`ThmOrAssumpDef`||p.kind===`OpDef`&&(p.defKind===`UserDefined`||p.defKind===`BuiltIn`))return n>0?e.createOpArg(p,a):e.createOpAppl(p,u.definitionArgs,a);if(p.kind===`OpArg`)return p;if(p.kind===`OpDef`||p.kind===`Module`)return(r||i)&&p.kind===`OpDef`?p:e.addError(a,`Module instantiation selected instead of expression.`);let m=o.reduceRight((t,n)=>e.copySubstIn(n,t),p),h=s.length>0?e.createLambda(s,m,a):void 0;return n>0?h===void 0||s.length!==n?e.addError(a,`Expected operator argument with arity ${n} but found one of arity ${s.length}.`):e.createOpArg(h,a):s.length===c.length?h===void 0?e.createOpAppl(e.getBuiltin(`$Nop`),[m],a):e.createOpAppl(h,c,a):e.addError(a,`Expected ${s.length} arguments but found ${c.length}.`)},hi=/* @__PURE__ */ new Map([[`(`,`)`],[`[`,`]`],[`{`,`}`],[`<<`,`>>`]]),gi=(e,t)=>`${e}:${t}`,_i=(e,t)=>{let n=ne(t).filter(e=>e.kind!==`End`).map(te),r=[0,0];for(let e=0;e<t.length;e++)t[e]===`
|
|
31
|
+
`&&r.push(e+1);return{name:e,source:t,tokens:n,lineOffsets:r,tokenIndexes:new Map(n.map((e,t)=>[gi(e.line,e.column),t]))}},G=(e,t,n)=>e.tokens[t]!==void 0&&e.tokens[t].text===n&&e.tokens[t].kind!==`String`,vi=(e,t,n)=>{let r=0,i=e.tokens.length;for(;r<i;){let a=r+i>>>1,o=e.tokens[a];o.line<t.line||o.line===t.line&&(n?o.column<=t.column:o.column<t.column)?r=a+1:i=a}return r},yi=(e,t)=>e.tokenIndexes.get(gi(t.line,t.column))??Math.min(vi(e,t,!1),e.tokens.length-1),bi=(e,t)=>Math.max(vi(e,t,!0)-1,0),xi=(e,t)=>{let n=e.tokens[t].text,r=hi.get(n);if(r===void 0)return t;let i=0;for(let a=t;a<e.tokens.length;a++)if(G(e,a,n))i++;else if(G(e,a,r)&&(i--,i===0))return a;return t},Si=(e,t)=>({start:yi(e,t.start),end:bi(e,t.end)}),K=(e,t)=>{let n=t.location.range;if(n)return Si(e,n);let r=yi(e,t.location);return{start:r,end:xi(e,r)}},Ci=(e,t)=>{let n=t.start-1,r=t.end+1;return G(e,n,`(`)&&G(e,r,`)`)&&xi(e,n)===r?Ci(e,{start:n,end:r}):t},wi=(e,t)=>{let n=t.start-1,r=t.end+1;return G(e,n,`(`)&&xi(e,n)===r&&(G(e,n-1,`(`)||G(e,n-1,`,`))?wi(e,{start:n,end:r}):t},q=(e,t)=>({file:e.name,beginLine:e.tokens[t.start].line,beginColumn:e.tokens[t.start].column,endLine:e.tokens[t.end].line,endColumn:e.tokens[t.end].endColumn}),J=(e,t)=>q(e,{start:t,end:t}),Ti=(e,t,n)=>{let r=0,i=e.lineOffsets[t];for(;i<e.source.length;){if(r=e.source[i]===` `?se(r):r+1,r>=n)return i;i++}return i},Ei=(e,t)=>{let n=e.tokens[t],r=Ti(e,n.line,n.column);return e.source.slice(r,Ti(e,n.line,n.endColumn)+1)},Di=(e,t)=>{let n=e.tokens[t],r=e.tokens[t+1];return n?.kind===`Operator`&&n.text===`[]`&&r?.kind===`Keyword`&&(r.text===`ASSUME`||r.text===`PROVE`)&&r.line===n.line&&r.column===n.endColumn+1},Oi=e=>{let t=_i(``,e),n=t.tokens.reduce((e,n,r)=>{if(!Di(t,r))return e;let i=Ti(t,n.line,n.column);return`${e.slice(0,i)} ${e.slice(i+2)}`},e);if(n!==e&&y(e)!==void 0)throw new r(`SANY rejects a []ASSUME or []PROVE outside an ASSUME/PROVE`);return n},ki=(e,t)=>{let n=e.tokens[t-1],r=e.tokens[t],i=n===void 0?0:Ti(e,n.line,n.endColumn)+1,a=e.source.slice(i,Ti(e,r.line,r.column)),o=[],s=0;for(;s<a.length;)if(a.startsWith(`\\*`,s)){let e=a.indexOf(`
|
|
32
|
+
`,s),t=e===-1?a.length:e+1;o.push(a.slice(s,t)),s=t}else if(a.startsWith(`(*`,s)){let e=1,t=s,n=s+2;for(;e>0&&n<a.length;){let r=a.startsWith(`(*`,n),i=a.startsWith(`*)`,n);r||i?(e+=r?1:-1,n+=2,o.push(a.slice(t,n)),t=n):n++}t<n&&o.push(a.slice(t,n)),s=n}else s++;return o},Ai=(e,t,n,r)=>{let i=[];for(let a=t;a<n&&i.length<r.length;a++){let t=e.tokens[a];t.kind===`Identifier`&&t.text===r[i.length]&&i.push(a)}return i},ji=(e,t,n,r)=>{for(let i=t;i<=n;i++)if(G(e,i,r))return i;return-1},Mi=new Map(x.flatMap(([e,...t])=>t.map(t=>[t,e]))),Ni=e=>e.split(`!`).map(e=>Mi.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),Pi={Constant:{declKind:24,level:0},Variable:{declKind:25,level:1},State:{declKind:26,level:1},Action:{declKind:27,level:2},Temporal:{declKind:28,level:3}},Fi=e=>/^[A-Za-z0-9_]+$/.test(e),Ii=e=>e!==`!!`&&e.includes(`!`),Li=e=>e.contexts[e.contexts.length-1],Ri=(e,t)=>{for(let n=e.contexts.length-1;n>=0;n--){let r=$r(e.contexts[n],t);if(r)return r}},zi=e=>e.kind===`OpDecl`?`${e.kind}${e.declKind}`:e.kind===`OpDef`?e.defKind:e.kind,Bi=e=>e.kind===`OpDef`||e.kind===`FormalParam`?`definition`:`declaration`,Vi=(e,t)=>{if(e.kind===`OpDef`&&t.kind===`OpDef`){let n=e.source??e;return n===(t.source??t)?n.module===void 0||Hi(n.module):!1}if(e.kind===`ThmOrAssumpDef`&&t.kind===`ThmOrAssumpDef`){let n=e.source??e;return n===(t.source??t)&&Hi(n.module)}return!1},Hi=e=>ni(e,2).length===0&&ni(e,3).length===0,Ui=e=>[...e.kind===`Let`?e.instances??[]:[],...T(e).flatMap(Ui)],Wi=e=>e.kind===`AssumeProve`?[...e.assumptions,e.conclusion].flatMap(e=>e.kind===`NewSymbol`?[]:Wi(e)):Ui(e),Gi=(e,t)=>{let n=/* @__PURE__ */ new Set;for(let r of e.units)if(r.kind===`Module`&&n.add(r.module.name),r.kind===`Instance`&&r.instance.module===t)return n.has(t);return!1},Ki=e=>BigInt(e.startsWith(`\\`)?`0${e.slice(1).replace(/^h/i,`x`)}`:e).toString(),qi=e=>{let t=[],n=[],r=/* @__PURE__ */ new Map,i=(a,o)=>{let s=a===e,c=(e,t)=>e.forEach(e=>{t.push(e),r.has(e)||r.set(e,a.name)}),l=e=>!o.has(e);c(a.extends.filter(l),t),c(a.units.flatMap(e=>e.kind===`Instance`?[e.instance]:e.kind===`Definition`?Ui(e.definition.body):e.kind===`Theorem`&&s?Wi(e.theorem.statement):e.kind===`Assumption`&&s?Ui(e.assumption.expression):[]).map(e=>e.module).filter(e=>l(e)&&!Gi(a,e)),n);let u=new Map(o);a.modules.forEach(e=>{let t=new Map(u),n=/* @__PURE__ */ new Set,r=e=>{n.has(e)||(n.add(e),e.extends.forEach(e=>{let n=t.get(e);n!==void 0&&(n.modules.forEach(e=>{t.has(e.name)||t.set(e.name,e)}),r(n))}))};r(e),i(e,t),u.set(e.name,e)})};return i(e,/* @__PURE__ */ new Map),{extendees:t,instancees:n,importers:r}},Ji=/* @__PURE__ */ new Set([`Identifier`,`Subexpression`,`OperatorReference`,`Lambda`]),Yi=e=>{let t=e.kind===`Apply`?oi(e):void 0;return Ji.has(e.kind)||t!==void 0&&si(t)},Xi=/* @__PURE__ */ new Map([[`Identifier`,`N_GeneralId`],[`Subexpression`,`N_GeneralId`],[`Number`,`N_Number`],[`Decimal`,`N_Real`],[`SetEnumeration`,`N_SetEnumerate`],[`SetFilter`,`N_SubsetOf`],[`SetMap`,`N_SetOfAll`],[`Tuple`,`N_Tuple`],[`FunctionApplication`,`N_FcnAppl`],[`FunctionConstruction`,`N_FcnConst`],[`FunctionSet`,`N_SetOfFcns`],[`Record`,`N_RcdConstructor`],[`RecordSet`,`N_SetOfRcds`],[`FieldAccess`,`N_RecordComponent`],[`Except`,`N_Except`],[`Prime`,`N_PostfixExpr`],[`Always`,`N_PrefixExpr`],[`Eventually`,`N_PrefixExpr`],[`Enabled`,`N_PrefixExpr`],[`Unchanged`,`N_PrefixExpr`],[`Forall`,`N_BoundedQuant`],[`Exists`,`N_BoundedQuant`],[`UnboundedQuantifier`,`N_UnboundedQuant`],[`Choose`,`N_UnBoundedOrBoundedChoose`],[`If`,`N_IfThenElse`],[`Case`,`N_Case`],[`Let`,`N_LetIn`],[`BoxAction`,`N_ActionExpr`],[`AngleAction`,`N_ActionExpr`],[`WeakFairness`,`N_FairnessExpr`],[`StrongFairness`,`N_FairnessExpr`]]),Zi=/* @__PURE__ */ new Set([`N_GeneralId`,`N_OpApplication`,`N_PrefixExpr`,`N_InfixExpr`,`N_PostfixExpr`,`N_FcnAppl`,`N_RecordComponent`]),Qi=/* @__PURE__ */ new Set([`'`,`^+`,`^*`,`^#`]),$i=(e,t)=>Qi.has(t)?`N_GenPostfixOp`:e.kind===`Lambda`||t===`~`||t===`-.`?`N_GenNonExpPrefixOp`:`N_GenInfixOp`,ea=(e,t,n={})=>{let i=[],a=(e,t)=>zr(i,{location:e,text:t,isWarning:!1}),s=(e,t)=>zr(i,{location:e,text:t,isWarning:!0}),c={value:n.version===`1.7.4`?-1:0},l=()=>++c.value,u={id:0},d=(e,t)=>{let r=Ri(e,t.name);if(r===t)return;if(r===void 0){Zr(Li(e),t);return}let i=t.kind===`FormalParam`||zi(r)!==zi(t)||Qr(r)!==Qr(t);r.kind===`OpDef`&&r.defKind===`BuiltIn`&&!(i&&n.version===`1.7.4`)?a(t.location,`Symbol ${t.name} is a built-in operator, and cannot be redefined.`):i?a(t.location,`Multiply-defined symbol '${t.name}': this definition or declaration conflicts \nwith the one at ${Br(r.location)}.`):Vi(t,r)||s(t.location,`Multiple declarations or definitions for symbol ${t.name}. \nThis duplicates the one at ${Br(r.location)}.`)};n.version!==`1.7.4`&&Rr(l);let f=Rr(l);l();let m=new Map(f.map(e=>[e.name,e])),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Map,v=(e,t)=>{let i=e===n.rootFileName&&n.rootFilePath||`${e}.tla`,a=t=>new o(`Could not parse module ${e} from file ${i}`,e,t),s=n.version===`1.7.4`?S(t):void 0;if(s!==void 0)throw a(s);try{return ee(Oi(t))}catch(e){throw e instanceof r?a(y(t)??`***Parse Error***\n${e.message}`):e}},b=(e,t,r)=>{let i=g.get(e);if(i)return i;if(t===void 0)throw new _(e,r,n.version!==`1.7.4`);n.onParse?.(e);let a=v(e,t);if(a.name!==e)throw new o(`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`,void 0);let s={file:_i(a.name,t),module:a};return g.set(e,s),s},x=[],C=/* @__PURE__ */ new Set,w=[],T=(e,n,r)=>{let i=w.indexOf(e);if(i!==-1)throw new o(`Circular dependency among .tla files; dependency cycle is:\n\n ${[...w.slice(i),e].map(e=>`${e}.tla`).join(` --> `)}`,void 0);if(C.has(e))return;C.add(e),w.push(e);let a=k(e,b(e,n,r).module);[...a.extendees,...a.instancees].forEach(n=>T(n,t(n),e)),w.pop(),x.push(e)},E=/* @__PURE__ */ new Set,D=(e,t)=>E.has(`${e} ${t}`),te=(e,t,n)=>{let r=g.get(e);if(!r||n.has(e))return;n.add(e);let i=k(e,r.module),a=i[t].find(t=>!D(e,t));if(a!==void 0)return{name:a,importer:e,namingModule:i.importers.get(a)??e};for(let r of[...i.extendees,...i.instancees]){let i=D(e,r)?te(r,t,n):void 0;if(i)return i}},ne=n=>{b(n,e);let r=()=>te(n,`extendees`,/* @__PURE__ */ new Set)??te(n,`instancees`,/* @__PURE__ */ new Set);for(let e=r();e!==void 0;e=r())g.has(e.name)||b(e.name,t(e.name),e.namingModule),E.add(`${e.importer} ${e.name}`)},O=n.rootFileName??v(``,e).name,k=(e,t)=>{let r=qi(t);return e!==O||n.rootExtendees===void 0||(r.extendees.splice(t.extends.length,0,...n.rootExtendees),n.rootExtendees.forEach(t=>{r.importers.has(t)||r.importers.set(t,e)})),r};ne(O),T(O,e);let A=(e,t,i,o)=>{let c={curLevel:0,unresolvedCount:[0],unresolvedSum:0,recursiveSectionCount:0},f=[],g=[],_=[],v=[],y=/* @__PURE__ */ new WeakSet,b=()=>v.push({labels:/* @__PURE__ */ new Map,params:[]}),x=()=>v.pop()?.labels??/* @__PURE__ */ new Map,S={depth:0,isDeclared:[],goal:void 0,goalClause:0},C=/* @__PURE__ */ new WeakMap,w=/* @__PURE__ */ new WeakMap,ee=e=>{let t=e.kind===`AssumeProve`?C.get(e):void 0;t&&(t.isInProof=!1)},T=e=>q(t,K(t,e)),E=e=>e.range?Si(t,e.range):{start:yi(t,e),end:yi(t,e)},D={kind:`Module`,id:l(),name:e.name,location:q(t,E(e.location)),extendees:[],context:Li(o),topLevel:[],definitions:[],opDefsInRecursiveSection:[],isLevelChecked:!1,levelCorrect:!0,argLevelParams:/* @__PURE__ */ new Map,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map,records:[]};i&&i.definitions.push(D);let te=e=>{for(let t=o.contexts.length-1;t>=0;t--){let n=ei(o.contexts[t],e);if(n?.kind===`Module`)return n}return h.get(e)},ne=e=>{let t=te(e);if(t===void 0)throw new r(`Could not find module ${e}`);return t},O=(e,t)=>{o.contexts.push(e);let n=t();return o.contexts.pop(),n},k=(e,t,n,r)=>{let i={...U(l()),kind:`FormalParam`,name:e,arity:t,location:n};return r&&d(o,i),i},re=e=>({...U(l()),kind:`OpDef`,defKind:`UserDefined`,arity:e.params?.length??0,params:[],body:void 0,isLocal:!1,module:D,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:(e.params??[]).map(()=>0),isLeibnizArg:(e.params??[]).map(()=>!0),isLeibniz:!0,opLevelCond:void 0,maxLevels:(e.params??[]).map(()=>3),minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0,...e}),ie=e=>{e.letInLevel=c.curLevel,c.unresolvedSum>0&&(e.recursiveSection=c.recursiveSectionCount,e.inRecursiveSection=c.unresolvedCount[c.curLevel]>0,D.opDefsInRecursiveSection.push(e))},ae=(e,t,n,r={},i=l())=>({...U(i),kind:`OpAppl`,operator:e,operands:t,unbounded:r.unbounded,bounded:r.bounded,tupleOrs:r.tupleOrs,ranges:r.ranges??[],location:n}),j=()=>({...ae(oe(`$Nop`),[],Lr,{},u.id),isNull:!0}),oe=e=>{let t=m.get(e);if(!t)throw new p(`SANY has no builtin operator ${e}`);return t},M=(e,t,n,r={})=>ae(oe(e),t,n,r),N=(e,t)=>({...U(l()),kind:`String`,value:e,location:t}),se=(e,t)=>({...U(l()),kind:`OpArg`,op:e,location:t}),ce=(e,t)=>{let n=Ri(o,Ni(e));if(n===void 0||n.kind===`Module`)throw new r(`Unknown operator: \`${e}' at line ${t.beginLine}, column ${t.beginColumn} of module ${t.file}`);return n},le=(e,t,n)=>{if(e.kind!==`OpDef`||e.defKind!==`UserDefined`)return;let r=e.params??[];r.length===t.length?r.forEach((r,i)=>{let o=t[i];r.arity===0&&o.kind===`OpArg`&&a(n,`Operator used in argument number ${i+1} has incorrect number of arguments.`);let s=o.kind===`OpArg`&&Qr(o.op)===r.arity&&!(o.op.kind===`OpDef`&&(o.op.params??[]).some(e=>e.arity>0));r.arity>0&&!s&&a(n,`Argument number ${i+1} to operator '${e.name}' \nshould be a ${r.arity}-parameter operator.`)}):a(n,`Wrong number of arguments (${t.length}) given to operator '${e.name}', \nwhich requires ${r.length} arguments.`)},ue=mi({version:n.version,resolveSymbol:e=>Ri(o,e),resolveSynonym:Ni,generateExpression:e=>I(e),generateArgument:(e,t,n,r)=>be(e,t,n,r),createOpAppl:(e,t,n)=>{let r=ae(e,t,n);return le(e,t,n),r},createOpArg:se,createFormalParam:(e,t,n)=>k(e,t,n,!1),createLambda:(e,n,r)=>re({name:`LAMBDA`,params:e,body:n,location:r,preComments:ki(t,yi(t,{line:r.beginLine,column:r.beginColumn}))}),copySubstIn:(e,t)=>Ue(`SubstIn`,e.substs,t,e.instantiatedModule,e.location,e.instantiatingModule),getBuiltin:oe,addError:(e,t)=>(a(e,t),j()),isOutOfLabelScope:e=>{let t=w.get(e);return t!==void 0&&t.scope.isDeclaredBefore[t.clause]&&t.scope.isSuffices===t.scope.isInProof},isOutOfClauseScope:(e,t)=>{let n=C.get(e);return n!==void 0&&n.isDeclaredBefore[t-1]&&(!n.hasGoal||n.isSuffices===n.isInProof)}}),de=(e,n)=>{let r={value:n.start};return e.map(e=>{let i=e.op===`Name`?e.name:e.op===`Null`?`(`:String(e.op),a=ji(t,r.value,n.end,i);if(a===-1)return e;if(e.op===`Null`){let n=xi(t,a);return r.value=n+1,{...e,location:q(t,{start:a,end:n})}}r.value=a+1;let o=J(t,a);if(e.args===void 0||!G(t,a+1,`(`))return{...e,location:o};let s=xi(t,a+1);return r.value=s+1,{...e,location:o,argsLocation:q(t,{start:a+1,end:s})}})},fe=(e,n,i,a)=>{let o=oi(e);if(o===void 0)throw new r(`Expected a name, found ${e.kind}`);return ue(de(o,K(t,e)),n,i,a,T(e))},pe=e=>{let t=fe(e,0,!1,!1);if(t.kind!==`OpAppl`)throw new r(`Expected an expression`);return t},me=e=>{if(e.kind!==`OpAppl`)return;let t=f.find(t=>t.name===e.operator.name);t&&(t.node.operator=oe(`$RecursiveFcnSpec`))},he=e=>e.reduce((e,t)=>{let n=e[e.length-1];return n!==void 0&&n[0].set===t.set&&t.pattern.kind===`Name`&&n[0].pattern.kind===`Name`?n.push(t):e.push([t]),e},[]),ge=(e,t)=>Me(e,t,he(e).map(e=>I(e[0].set))),P=(e,t)=>{let n=v.at(-1);n?.params.push(e);let r=I(t);return n?.params.pop(),r},_e=e=>{let n=K(t,e),r=Ai(t,n.start,n.end,e.params);return O(W(),()=>{let i=e.params.map((e,n)=>k(e,0,J(t,r[n]),!0)),a=P(i,e.body);return re({name:`LAMBDA`,params:i,body:a,location:q(t,n),preComments:ki(t,n.start)})})},ve=e=>e.kind===`OperatorReference`?e.operator:e.kind===`Lambda`&&e.body.kind===`Apply`?e.body.operator:t.tokens[yi(t,e.location)].text,ye=(e,t)=>{let n=T(e);if(e.kind===`Lambda`)return e.location.range===void 0?se(ce(ve(e),n),n):se(_e(e),n);if(!Yi(e))return a(n,`Arity ${t.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${t.name}'.`),j();if(e.kind===`OperatorReference`)return se(ce(e.operator,n),n);let i=fe(e,t.arity,!1,!1);if(i.kind===`OpArg`||i.kind===`OpAppl`&&i.isNull===!0)return i;throw new r(`Expected an operator argument at line ${n.beginLine}, column ${n.beginColumn}`)},be=(e,n,i,s)=>{let c=e.kind===`OpDef`&&(e.defKind===`UserDefined`||e.defKind===`ModuleInstance`)?e.params?.[n]?.arity??0:0;if(c===0)return I(i);let l=K(t,i),u=q(t,l),d=`${n+1} (counting from 1)`,f=wi(t,l);if(f!==l||!Yi(i))return a(q(t,f),`An expression appears as argument number ${d} to operator '${e.name}', in a position an operator is required.`),j();if(i.kind===`Identifier`||i.kind===`Subexpression`||i.kind===`Apply`){let e=fe(i,c,!1,!1);if(e.kind===`OpArg`||e.kind===`OpAppl`)return e;throw new r(`Expected an operator argument at ${Br(u)}`)}if(i.kind===`Lambda`&&i.location.range!==void 0){let t=_e(i),r=Qr(t);return r===c?se(t,u):(a(s,`Lambda expression with arity ${r} used as argument ${n+1} of operator \`${e.name}', \nbut an operator of arity ${c} is required.`),j())}let p=ve(i),m=Ri(o,Ni(p));if(m===void 0)return a(u,`Could not find declaration or definition of symbol '${p}'.`),j();let h=Qr(m);return h===c?se(m,u):(a(s,`Operator with incorrect arity passed as argument. \nOperator '${m.name}' of arity ${h} is argument number ${d} to operator \`${Br(e.location)}', \nbut an operator of arity ${c} was expected.`),j())},xe=e=>{let n=T(e);if(e.isBulleted)return M(e.kind===`And`?`$ConjList`:`$DisjList`,e.operands.map(I),n);let r=K(t,e),i=e.kind===`And`?`\\land`:`\\lor`,[a,...o]=e.operands;return o.reduce((e,n,a)=>{let s=Ci(t,K(t,n)),c=a===o.length-1?r.end:s.end;return M(i,[e,I(n)],q(t,{start:r.start,end:c}))},I(a))},Se=e=>{let n=K(t,e),r=e.arms.map((r,i)=>{let a=Ci(t,K(t,r.condition)),o=i===e.arms.length-1&&e.other===void 0,s=Ci(t,K(t,r.body)),c=[I(r.condition),I(r.body)];return M(`$Pair`,c,q(t,{start:a.start,end:o?n.end:s.end}))}),i=e.other;if(i){let e=Ci(t,K(t,i)),a=Ce(e.start,`OTHER`);r.push(M(`$Pair`,[void 0,I(i)],q(t,{start:a,end:n.end})))}return M(`$Case`,r,q(t,n))},Ce=(e,n)=>{for(let r=e;r>=0;r--)if(G(t,r,n))return r;return e},we=e=>{let n=K(t,e),r=q(t,n),i=[I(e.function)],a=M(`$Except`,i,r),o=K(t,e.function),s={value:ji(t,o.end+1,n.end,`EXCEPT`)+1};return e.updates.forEach(e=>{let r=ji(t,s.value,n.end,`!`),o=Ci(t,K(t,e.value)),c=q(t,{start:r,end:o.end}),l={value:r+1},u=e.path.map(e=>{if(e.kind===`Field`){let n=Te(l.value,e.name);return l.value=n+1,N(e.name,J(t,n))}let r=ji(t,l.value,n.end,`[`),i=xi(t,r);return l.value=i+1,e.args.length===1?I(e.args[0]):M(`$Tuple`,e.args.map(I),q(t,{start:r,end:i}))}),d=M(`$Seq`,u,c),f=M(`$Pair`,[d],c);_.push(f),g.push(a),f.operands.push(I(e.value)),_.pop(),g.pop(),i.push(f),s.value=o.end+1}),a},Te=(e,n)=>{for(let r=e;r<t.tokens.length;r++)if(t.tokens[r].text===n&&t.tokens[r].kind!==`String`)return r;return e},Ee=(e,n)=>{let r=K(t,n),i={value:r.start+1},o=n.fields.map((e,r)=>{let o=Te(i.value,e.name),s=Ci(t,K(t,e.value));return i.value=s.end+1,n.fields.slice(0,r).some(t=>t.name===e.name)&&a(J(t,o),`Non-unique fields in constructor.`),M(`$Pair`,[N(e.name,J(t,o)),I(e.value)],q(t,{start:o,end:s.end}))}),s=M(e,o,q(t,r));return D.records.push(s),s},De=e=>({line:t.tokens[e].line,column:t.tokens[e].column}),Oe=e=>{let n=[],r=e;for(;t.tokens[r]?.kind===`Identifier`;){let e=G(t,r+1,`(`)?xi(t,r+1):r,i=t.tokens.slice(r+1,e).filter(e=>e.text===`_`).length;if(n.push({name:t.tokens[r].text,arity:i,location:{...De(r),range:{module:t.name,start:De(r),end:De(e)}}}),!G(t,e+1,`,`))break;r=e+2}return n},ke=e=>{let n=[...e.definitions.map(e=>({unit:{kind:`Definition`,definition:e},span:Fe(e)})),...(e.instances??[]).map(e=>({unit:{kind:`Instance`,instance:e},span:Fe(e)}))],r=K(t,e).start,i=Ci(t,K(t,e.body)).start,a=[];for(let e=r+1;e<i;e++){let r=n.some(t=>t.span.start<=e&&e<=t.span.end);G(t,e,`RECURSIVE`)&&!r&&a.push({unit:{kind:`Recursive`,declarations:Oe(e+1)},span:{start:e,end:e}})}return[...n,...a].toSorted((e,t)=>e.span.start-t.span.start).map(e=>e.unit)},Ae=e=>{let t=W();return O(t,()=>{c.curLevel++,c.unresolvedCount[c.curLevel]=0;let n=[],r=[];ke(e).forEach(e=>{e.kind===`Recursive`?Be(e.declarations):e.kind===`Instance`?We(e.instance,n,r):e.definition.kind===`Function`?Re(e.definition,n):Ie(e.definition,n)}),Ve(),c.curLevel=Math.max(c.curLevel-1,0);let i=I(e.body);return{...U(l()),kind:`LetIn`,opDefs:n,instances:r,body:i,context:t,location:T(e)}})},je=e=>{let n=K(t,e),r=q(t,n);return O(W(),()=>{let i=e.pattern,a=i.kind===`Name`?[i.name]:i.names;if(e.set===void 0){let o=Ai(t,n.start,n.end,a),s=a.map((e,r)=>k(e,0,J(t,i.kind===`Name`?n.start:o[r]),!0)),c=P(s,e.body);return M(`$UnboundedChoose`,[c],r,{unbounded:s})}let o=I(e.set),s=K(t,e.set),c=Ai(t,n.start,s.start,a),l=a.map((e,n)=>k(e,0,J(t,c[n]),!0)),u=P(l,e.body);return M(`$BoundedChoose`,[u],r,{bounded:[l],tupleOrs:[i.kind===`Tuple`],ranges:[o]})})},F=e=>{if(Fi(e.operator)||Ii(e.operator)||e.args.length>2||Ri(o,Ni(e.operator))!==void 0)return;let n=K(t,e);if(t.tokens[n.start].text===e.operator&&G(t,n.start+1,`(`))return;let r=Ci(t,K(t,e.args[0])),i=e.args.length===1&&r.start!==n.start,a=i?n.start:r.end+1,s=Ei(t,a);return{index:a,name:i&&s===`-`?`-.`:s,fixity:i?`prefix`:e.args.length===2?`infix`:`postfix`}},I=e=>{let n=T(e);switch(e.kind){case`Number`:return{...U(l()),kind:`Numeral`,value:Ki(e.text??String(e.value)),location:n};case`Decimal`:{let[t,r]=e.text.split(`.`),i=BigInt(t+r),a=i<=9223372036854775807n;return{...U(l()),kind:`Decimal`,mantissa:i.toString(),exponent:String(a?-r.length:r.length),integralPart:t,fractionalPart:r,location:n}}case`String`:return N(e.value,n);case`Identifier`:{let t=pe(e);return me(t),t}case`Apply`:{let r=F(e);if(r!==void 0)return a(J(t,r.index),`Could not find declaration or definition of symbol '${r.name}'.`),a(n,`Couldn't resolve ${r.fixity} operator symbol \`${r.name}'.`),{...j(),isAbsent:!0};let i=pe(e);return(Ii(e.operator)||Fi(e.operator))&&me(i),i}case`Bracket`:return a(J(t,K(t,e).start),"Unsupported expression type `['."),{...j(),isAbsent:!0};case`OperatorReference`:case`Lambda`:{let r=t.tokens[K(t,e).start].text;return a(n,r===`LAMBDA`?`LAMBDA expression used where an expression is required.`:`Unsupported expression type \`${$i(e,r)}'.`),{...j(),isAbsent:!0}}case`And`:case`Or`:return xe(e);case`Prime`:return M(`'`,[I(e.expression)],n);case`Unchanged`:return M(`UNCHANGED`,[I(e.expression)],n);case`Enabled`:return M(`ENABLED`,[I(e.expression)],n);case`Always`:return M(`[]`,[I(e.expression)],n);case`Eventually`:return M(`<>`,[I(e.expression)],n);case`If`:return M(`$IfThenElse`,[I(e.condition),I(e.consequent),I(e.alternative)],n);case`Case`:return Se(e);case`Let`:return Ae(e);case`Forall`:case`Exists`:{let r=K(t,e);return O(W(),()=>{let t=ge(e.bounds,r.start),i=P(t.bounded.flat(),e.body);return M(e.kind===`Forall`?`$BoundedForall`:`$BoundedExists`,[i],n,t)})}case`UnboundedQuantifier`:{let r=K(t,e),i=K(t,e.body),a=Ai(t,r.start,i.start,e.names),o=e.isTemporal?e.quantifier===`Forall`?`$TemporalForall`:`$TemporalExists`:e.quantifier===`Forall`?`$UnboundedForall`:`$UnboundedExists`;return O(W(),()=>{let r=e.names.map((e,n)=>k(e,0,J(t,a[n]),!0)),i=P(r,e.body);return M(o,[i],n,{unbounded:r})})}case`Choose`:return je(e);case`SetEnumeration`:return M(`$SetEnumerate`,e.elements.map(I),n);case`Tuple`:return M(`$Tuple`,e.elements.map(I),n);case`SetFilter`:{let r=I(e.bound.set),i=K(t,e);return O(W(),()=>{let t=Me([e.bound],i.start,[r]),a=P(t.bounded.flat(),e.predicate);return M(`$SubsetOf`,[a],n,t)})}case`SetMap`:{let r=K(t,e.expression);return O(W(),()=>{let t=ge(e.bounds,r.end+1),i=P(t.bounded.flat(),e.expression);return M(`$SetOfAll`,[i],n,t)})}case`FunctionConstruction`:{let r=K(t,e);return O(W(),()=>{let t=ge(e.bounds,r.start),i=P(t.bounded.flat(),e.body);return M(`$FcnConstructor`,[i],n,t)})}case`FunctionSet`:return M(`$SetOfFcns`,[I(e.domain),I(e.range)],n);case`Record`:return Ee(`$RcdConstructor`,e);case`RecordSet`:return Ee(`$SetOfRcds`,e);case`Except`:return we(e);case`ExceptAt`:{let e=g[g.length-1],t=_[_.length-1];return e===void 0||t===void 0?(a(n,`@ used where its meaning is not defined.`),j()):{...U(l()),kind:`At`,except:e,component:t,location:t.location}}case`FunctionApplication`:{let t=I(e.function);if(Vr(t))return t;me(t);let r=e.args.length===1?I(e.args[0]):M(`$Tuple`,e.args.map(I),n);return M(`$FcnApply`,[t,r],n)}case`FieldAccess`:{let r=I(e.record),i=K(t,e);return M(`$RcdSelect`,[r,N(e.field,J(t,i.end))],n)}case`Product`:return M(`$CartesianProd`,e.factors.map(I),n);case`BoxAction`:case`AngleAction`:return M(e.kind===`BoxAction`?`$SquareAct`:`$AngleAct`,[I(e.action),I(e.subscript)],n);case`WeakFairness`:case`StrongFairness`:return M(e.kind===`WeakFairness`?`$WF`:`$SF`,[I(e.subscript),I(e.action)],n);case`Label`:return Ne(e);case`Subexpression`:return pe(e)}},Me=(e,n,r)=>{let i=he(e),a={value:n};return{bounded:i.map(e=>{let n=K(t,e[0].set),r=e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),i=Ai(t,a.value,n.start,r);return a.value=n.end+1,r.map((e,n)=>k(e,0,J(t,i[n]),!0))}),tupleOrs:i.map(e=>e[0].pattern.kind===`Tuple`),ranges:r}},Ne=e=>{let n=T(e),r=v.at(-1);if(r===void 0)return a(n,`Label not in definition or proof step.`),j();if(S.isDeclared.slice(2,S.depth+1).some(Boolean))return a(n,`Label not allowed within scope of declaration in nested ASSUME/PROVE.`),j();if(g.length>0&&_.length>0)return a(n,`Labels inside EXCEPT clauses are not yet implemented.`),j();b();let i=I(e.body),s=x(),c=Ai(t,K(t,e).start,K(t,e.body).start,e.params),u=e.params.map((n,r)=>{let i=Ri(o,n);if(i?.kind===`FormalParam`)return i;let s=J(t,c[r]);return a(s,`Illegal parameter ${n} of label \`${e.name}'.`),k(n,0,s,!1)}),d={...U(l()),kind:`Label`,name:e.name,params:u,body:i,labels:s,isAssumeProve:!1,location:n},f=/* @__PURE__ */ new Set;if(u.forEach(e=>{f.has(e)&&a(n,`Repeated formal parameter ${e.name} \nin label \`${d.name}'.`),f.add(e)}),r.params.flat().forEach(e=>{f.delete(e)||a(n,`Label ${d.name} must contain formal parameter \`${e.name}'.`)}),f.size>0){let e=[...f].map(e=>`${e.name} `).join(``);a(n,`Label ${d.name} declares extra parameter(s) ${e}`)}r.labels.has(d.name)?a(n,`Duplicate label \`${d.name}'.`):r.labels.set(d.name,d);let p=S.goal;return p&&w.set(d,{scope:p,clause:S.goalClause}),d},Pe=(e,n,r)=>{let i={value:n.start};return e.params.map(e=>{let n=e.location?yi(t,e.location):Te(i.value,e.name),a=dt(n,e.arity);return i.value=a.end+1,k(Ni(e.name),e.arity,q(t,a),r)})},Fe=e=>{let n=E(e.location);return e.isLocal&&!G(t,n.start,`LOCAL`)&&G(t,n.start-1,`LOCAL`)?{start:n.start-1,end:n.end}:n},Ie=(e,n)=>{let r=Fe(e),i=q(t,r),s=Ni(e.name),l={start:e.isLocal?r.start+1:r.start,end:r.end},u=O(W(),()=>{let t=Pe(e,l,!0),n=Ri(o,s);if(n?.kind===`OpDef`&&n.inRecursive&&!n.isDefined){let e=n.params?.length===t.length&&(t.length===0||t[t.length-1].arity===0);n.letInLevel===c.curLevel?e||a(i,`Definition of ${n.name} has different arity than its RECURSIVE declaration.`):a(i,`Recursive operator ${s} defined at wrong LET/IN level.`)}else n!==void 0&&a(i,`Operator ${s} already defined or declared.`);return b(),{params:t,body:I(e.body),existing:n}}),f=x(),p=u.existing,m=u.params,h=ki(t,r.start);if(p?.kind===`OpDef`&&p.inRecursive&&!p.isDefined&&p.letInLevel===c.curLevel){p.params=m,p.weights=m.map(()=>0),p.maxLevels=m.map(()=>3),p.isLeibnizArg=m.map(()=>!0),p.labels=f,Le(p,u.body,i,h),D.definitions.push(p),n?.push(p);return}let g=re({name:s,params:m,body:u.body,isLocal:e.isLocal,location:i,preComments:h,labels:f});d(o,g),ie(g),D.definitions.push(g),n?.push(g)},Le=(e,t,n,r)=>{e.isDefined=!0,e.body=t,e.location=n,e.preComments=r,e.inRecursive&&(c.unresolvedCount[c.curLevel]--,c.unresolvedSum--)},Re=(e,n)=>{let r=Fe(e),i=q(t,r),s=W(),l=e.isLocal?r.start+1:r.start,u=O(s,()=>ge(e.bounds,l+1)),p=Ri(o,e.name),m=O(s,()=>k(e.name,0,i,p===void 0)),h=M(`$NonRecursiveFcnSpec`,[],i,{unbounded:[m],...u}),g=p?.kind===`OpDef`&&p.inRecursive&&!p.isDefined,_=g&&p.letInLevel===c.curLevel;_?p.arity!==0&&a(i,`Function ${p.name} has operator arguments in its RECURSIVE declaration.`):g?a(i,`Recursive function ${e.name} defined at wrong LET/IN level.`):p!==void 0&&a(i,`Function name \`${e.name}' already defined or declared.`);let v=ki(t,r.start),y=p===void 0?re({name:e.name,params:[],body:h,isLocal:e.isLocal,location:i,preComments:v}):p.kind===`OpDef`&&(_||!g)?p:void 0;_?p.arity===0&&Le(p,h,i,v):p===void 0&&y!==void 0&&(d(o,y),ie(y)),y!==void 0&&(D.definitions.push(y),n?.push(y)),f.unshift({name:e.name,node:h}),b();let S=()=>P(u.bounded.flat(),e.body),C=y===void 0?S():O(s,S),w=x();y!==void 0&&(y.labels=w),f.shift(),h.operands=[C],h.operator.name===`$NonRecursiveFcnSpec`&&(h.unbounded=void 0)},ze=[],Be=e=>{c.unresolvedSum===0&&c.recursiveSectionCount++,c.unresolvedCount[c.curLevel]+=e.length,c.unresolvedSum+=e.length,e.forEach(e=>{let n=ft(e);l();let r=Array.from({length:e.arity},()=>k(``,0,void 0,!1)),i=re({name:Ni(e.name),params:r,location:q(t,n),isDefined:!1,inRecursive:!0,inRecursiveSection:!0,recursiveSection:c.recursiveSectionCount,letInLevel:c.curLevel});d(o,i),ze.push(i),D.opDefsInRecursiveSection.push(i)})},Ve=()=>{c.unresolvedCount[c.curLevel]!==0&&(ze.filter(e=>e.letInLevel===c.curLevel&&!e.isDefined).forEach(e=>a(e.location,`Symbol ${e.name} declared in RECURSIVE statement but not defined.`)),c.unresolvedSum-=c.unresolvedCount[c.curLevel])},He=(e,r,i)=>{l();let s=Jr(r.table).filter(e=>e.kind===`OpDecl`),c=s.flatMap(e=>{let t=Ri(o,e.name);return t===void 0?[]:[{op:e,expr:e.declKind===3||e.declKind===2&&e.arity===0?ae(t,[],i):se(t,i),isImplicit:!0}]}),u=(e,t)=>{let n=t.kind===`OpArg`?Qr(t.op):0,r=e.arity>0&&t.kind===`OpAppl`&&t.isNull===!0;n!==e.arity&&!r&&a(t.location,`An operator must be substituted for symbol '${e.name}', and it must have arity ${e.arity}.`)},d=Fe(e),f={value:ji(t,d.start,d.end,`WITH`)+1};return e.substitutions.forEach(e=>{let n=ji(t,f.value,d.end,e.name);n!==-1&&(f.value=K(t,e.expression).end+1);let o=$r(r,Ni(e.name));if(o?.kind!==`OpDecl`){a(n===-1?i:J(t,n),`Identifier '${n===-1?e.name:Ei(t,n)}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`);return}let s=o.arity===0?I(e.expression):ye(e.expression,o);u(o,s);let l=c.find(e=>e.op.name===o.name);l&&!l.isImplicit?a(T(e.expression),`Multiple substitutions for symbol '${o.name}' in substitution.`):l?(l.expr=s,l.isImplicit=!1):c.push({op:o,expr:s,isImplicit:!1})}),c.filter(e=>e.isImplicit&&n.version!==`1.7.4`).forEach(e=>u(e.op,e.expr)),s.filter(e=>!c.some(t=>t.op.name===e.name)).forEach(e=>a(i,`Substitution missing for symbol ${e.name} declared at ${Br(e.location)} \nand instantiated in module ${D.name}.`)),c},Ue=(e,t,n,r,i,o=D)=>(Vr(n)&&a(i,e===`SubstIn`?`Substitution error, probably due to error
|
|
33
|
+
in module being instantiated.`:`Substitution error, probably due to error in module being instantiated.`),{...U(l()),kind:e,substs:t,body:n,instantiatingModule:o,instantiatedModule:r,location:i}),We=(e,r,i)=>{let a=Fe(e),s=q(t,a),c=ki(t,a.start),u=e.name??``,f=W(),p=e.isLocal?a.start+1:a.start;e.params.length>0&&o.contexts.push(f);let m=Pe(e,{start:p,end:a.end},e.params.length>0),h=ne(e.module),g=h.context,_=He(e,g,s);e.params.length>0&&o.contexts.pop(),Jr(g.table).forEach(t=>{if(t.kind!==`OpDef`||t.isLocal||t.defKind!==`UserDefined`&&t.defKind!==`ModuleInstance`)return;let n=[...m,...t.params??[]],i=`${u}!${t.name}`,a=t.defKind===`UserDefined`?re({name:i,params:n,body:_.length>0&&t.body?Ue(`SubstIn`,_,t.body,h,s):t.body,isLocal:e.isLocal,location:s,source:t.source??t,preComments:c,labels:t.labels}):re({defKind:`ModuleInstance`,name:i,params:n,isLocal:e.isLocal,location:s,module:t.module,source:t.source??t,preComments:c});d(o,a),t.defKind===`UserDefined`&&ie(a),(r??D.definitions).push(a)}),Jr(g.table).forEach(t=>{if(t.kind!==`ThmOrAssumpDef`||t.isLocal)return;let n=_.length>0?Ue(`APSubstIn`,_,t.body,h,s):t.body,i={...U(l()),kind:`ThmOrAssumpDef`,name:`${u}!${t.name}`,isTheorem:t.isTheorem,body:n,params:[...m,...t.params],isLocal:e.isLocal,location:s,module:D,source:t.source??t,labels:t.labels,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]};d(o,i),(r??D.definitions).push(i)});let v={...U(l()),kind:`Instance`,name:u,isLocal:e.isLocal,params:m,module:h,substs:_,location:s};(i??D.topLevel).push(v);let y=re({defKind:`ModuleInstance`,name:u,params:m,isLocal:e.isLocal,location:s,preComments:c});d(o,y),n.version!==`1.7.4`&&r?.push(y)},Ge=(e,n=!0,r)=>{let i=Fe(e),a=r??q(t,i),s=ki(t,i.start),c=ne(e.module),u=c.context,f=He(e,u,a),p=e.isLocal,m=Hi(c);Jr(u.table).forEach(e=>{if(e.kind!==`OpDef`||e.defKind!==`UserDefined`||e.isLocal)return;let t=(t,n)=>{let r=re({name:e.name,params:e.params,body:n,isLocal:p,location:a,module:t,source:e.source??e,preComments:s,labels:e.labels});return d(o,r),r},n=()=>(d(o,e),e),r=e.module===void 0||Hi(e.module),i=m||r?p?t(e.module,e.body):n():t(D,e.body&&Ue(`SubstIn`,f,e.body,c,a));D.definitions.push(i),ie(i)}),Jr(u.table).forEach(e=>{if(e.kind!==`ThmOrAssumpDef`||e.isLocal)return;let t=(t,n)=>{let r={...e,...U(l()),body:n,isLocal:p,location:a,module:t,source:e.source??e};return d(o,r),r},r=m?p?t(e.module,e.body):(d(o,e),e):Hi(e.module)?p?t(D,e.body):e:t(D,Ue(`APSubstIn`,f,e.body,c,a));n&&D.definitions.push(r)});let h={...U(l()),kind:`Instance`,name:void 0,isLocal:p,params:[],module:c,substs:f,location:a};return n&&D.topLevel.push(h),h},Ke=e=>{let n=te(e.name)??(e.name===D.name?D:void 0);return n===void 0?(a(J(t,yi(t,e.location)+1),`Module \`${e.name}' used without being extended or instantiated.`),[]):[n]},qe=e=>e.flatMap(e=>{if(e.kind===`ModuleFact`)return Ke(e);let t=oi(e);if(t===void 0||!si(t))return[I(e)];let n=fe(e,0,!0,!1);if(n.kind===`ThmOrAssumpDef`)throw new r(`Expected a fact`);return[n]}),Je=e=>G(t,e.start,`(`)&&xi(t,e.start)===e.end,Ye=e=>Ci(t,K(t,e)),Xe=(e,n)=>Ye(e.args[0]).start===n.start?e.args.length===2?`N_InfixExpr`:`N_PostfixExpr`:t.tokens[n.start].kind===`Identifier`?`N_OpApplication`:`N_PrefixExpr`,Ze=(e,n)=>Je(n)?`N_ParenExpr`:e.kind===`String`?Ei(t,n.start):e.kind===`Apply`?Xe(e,n):Xi.get(e.kind),Qe=(e,t)=>{if(e.kind===`String`&&!Je(t))return!1;if(e.kind===`Identifier`&&!e.name.includes(`!`))return!0;let n=Ze(e,t);return n===void 0||Zi.has(n)?void 0:!0},$e=(e,n)=>{let r=(e,t=Ye(e))=>({last:t,lastKind:Ze(e,t)});if(Je(n))return{hasChildlessFirstChild:!1,...r(e,{start:n.start+1,end:n.end-1})};switch(e.kind){case`If`:case`BoxAction`:case`AngleAction`:return{hasChildlessFirstChild:!1,...r(e.kind===`If`?e.condition:e.action)};case`Tuple`:case`SetEnumeration`:{let i=e.elements[0];return i===void 0?{hasChildlessFirstChild:!1,last:{start:n.end,end:n.end},lastKind:t.tokens[n.end].text}:{hasChildlessFirstChild:!1,...r(i)}}case`Always`:case`Eventually`:case`Enabled`:case`Unchanged`:return{hasChildlessFirstChild:!0,...r(e.expression,{start:n.start+1,end:n.end})};case`Prime`:return{hasChildlessFirstChild:Qe(e.expression,Ye(e.expression)),last:{start:n.end,end:n.end},lastKind:`N_GenPostfixOp`};case`FunctionApplication`:case`FieldAccess`:{let n=e.kind===`FunctionApplication`?e.function:e.record,r=Ye(n),i=r.end+1;return{hasChildlessFirstChild:Qe(n,r),last:{start:i,end:i},lastKind:t.tokens[i].text}}case`Apply`:{let t=Xe(e,n);if(t===`N_OpApplication`)return e.operator.includes(`!`)?void 0:{hasChildlessFirstChild:!0,last:{start:n.start+1,end:n.end},lastKind:`N_OpArgs`};if(t===`N_PrefixExpr`)return{hasChildlessFirstChild:!0,...r(e.args[0],{start:n.start+1,end:n.end})};let i=Ye(e.args[0]),a=i.end+1;return{hasChildlessFirstChild:Qe(e.args[0],i),last:{start:a,end:a},lastKind:t===`N_InfixExpr`?`N_GenInfixOp`:`N_GenPostfixOp`}}}},et=e=>{let n=Ci(t,K(t,e));if((e.kind===`Identifier`||e.kind===`Subexpression`||e.kind===`OperatorReference`)&&!Je(n))return!1;let r=$e(e,n);if(r?.hasChildlessFirstChild===void 0||r.lastKind===void 0)return!1;let i=q(t,r.last);return r.hasChildlessFirstChild&&a(q(t,n),`Was expecting a GeneralId.`),r.lastKind===`N_OpArgs`?a(i,"Selector `!(...)' should not have argument(s)."):(a(i,`Unexpected token found.`),a(i,`Need name or step number here, not \`${r.lastKind}'.`)),a(q(t,n),`DEF clause entry should describe a defined operator.`),!0},tt=e=>e.flatMap(e=>{if(e.kind===`ModuleFact`)return Ke(e);if(et(e))return[];let t=fe(e.kind===`OperatorReference`?{kind:`Identifier`,name:e.operator,location:e.location}:e,-1,!1,!0);return t.kind===`OpDef`||t.kind===`ThmOrAssumpDef`&&!t.name.startsWith(`<`)?[t]:(a(T(e),`DEF clause entry should describe a defined operator.`),[])}),nt=(e,t)=>{e.isOnly||e.facts.length+e.defs.length>0||a(t,`Empty BY, USE, or HIDE`)},rt=e=>{let n=q(t,E(e.location));nt(e,n);let r=qe(e.facts),i=tt(e.defs);return r.length+i.length===0&&a(n,`Empty USE or HIDE statement.`),e.kind===`Hide`&&r.filter(e=>e.kind===`OpAppl`&&e.operator.kind!==`ThmOrAssumpDef`).forEach(e=>a(e.location,`The only expression allowed as a fact in a HIDE is
|
|
34
|
+
the name of a theorem, assumption, or step.`)),{...U(l()),kind:`UseOrHide`,facts:r,defs:i,isOnly:e.isOnly,isHide:e.kind===`Hide`,location:n}},it=e=>{let n=E(e.location),r=e.set&&I(e.set),i=Te(n.start,e.name),a=Pi[e.level],s={...U(l()),levelChecked:1,level:a.level,kind:`OpDecl`,name:Ni(e.name),arity:e.arity,declKind:a.declKind,location:q(t,dt(i,e.arity)),module:D};return d(o,s),{...U(l()),kind:`NewSymb`,declaration:s,set:r,location:q(t,n)}},at=(e,n,r)=>{let i=E(e.location),s=Di(t,i.start-1),c=K(t,e.conclusion).start,u=t.tokens.findLastIndex((e,t)=>t<c&&e.kind===`Keyword`&&e.text===`PROVE`),d=q(t,{start:s?i.start-1:i.start,end:i.start});s!==Di(t,u-1)&&a(d,s?`[]ASSUME matched by PROVE instead of []PROVE`:`ASSUME matched by []PROVE instead of PROVE`);let f=l();n>1&&o.contexts.push(W()),s&&o.contexts.some(e=>y.has(e))&&a(d,`[]ASSUME used within the scope of an ordinary ASSUME's assumptions`),s||y.add(Li(o));let p={isDeclaredBefore:[!1],hasGoal:r!==void 0,isSuffices:r?.isSuffices??!1,isInProof:!0};S.depth=n,S.isDeclared[n]=!1,n===1&&(S.goal=r&&p,S.goalClause=0);let m=e.assumptions.map((e,t)=>{let r=e.kind===`NewSymbol`,i=e.kind===`AssumeProve`?at(e,n+1):r?it(e):I(e);return S.depth=n,r&&(S.isDeclared[n]=!0),p.isDeclaredBefore.push(p.isDeclaredBefore[t]||r),n===1&&S.goalClause++,i}),h=I(e.conclusion);n>1&&o.contexts.pop(),S.depth=n-1,n===1&&(S.goal=void 0);let g={...U(f),kind:`AssumeProve`,assumptions:m,goal:h,isSuffices:p.isSuffices,isBoxed:s,location:q(t,{start:s?i.start-1:i.start,end:i.end})};return C.set(g,p),g},ot=(e,t,n,r,i,a=!0)=>({...U(e),kind:`ThmOrAssumpDef`,name:t,isTheorem:a,body:n,params:[],isLocal:!1,location:r,module:D,source:void 0,labels:i,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]}),st=e=>{let n=q(t,E(e.location));e.kind===`By`&&nt(e,n);let r=e.kind===`By`?qe(e.facts):[],i=e.kind===`By`?tt(e.defs):[];return e.kind===`By`&&l(),e.kind===`By`&&r.length+i.length===0&&a(n,`Empty BY`),{...U(l()),kind:`LeafProof`,facts:r,defs:i,isOmitted:e.kind===`Omitted`,isOnly:e.kind===`By`&&e.isOnly,location:n}},ct=(e,n)=>{let r=e.body,i=q(t,n);switch(r.kind){case`Have`:return{node:M(`$Have`,[I(r.expression)],i),isPick:!1};case`Case`:return{node:M(`$Pfcase`,[I(r.expression)],i),isPick:!1};case`Witness`:return{node:M(`$Witness`,r.expressions.map(I),i),isPick:!1};case`Qed`:return{node:M(`$Qed`,[],i),isPick:!1};case`Take`:case`Pick`:{let e=r.kind===`Pick`,a=e?`$Pick`:`$Take`;e&&o.contexts.push(W());let s=e=>r.kind===`Pick`?[P(e,r.body)]:[];if(r.bounds.length>0){let t=ge(r.bounds,n.start),o=s(t.bounded.flat());return{node:M(a,o,i,t),isPick:e}}let c=Ai(t,n.start,n.end+1,r.names),l=r.names.map((e,n)=>k(e,0,J(t,c[n]),!0)),u=s(l);return{node:M(a,u,i,{unbounded:l}),isPick:e}}}},lt=e=>{if((e.kind===`And`||e.kind===`Or`)&&!e.isBulleted)return!0;if(e.kind!==`Apply`||e.args.length!==2)return!1;let n=Ci(t,K(t,e.args[0])),r=K(t,e).start;return n.start===r&&!G(t,n.end+1,`(`)},L=e=>{if(e.kind!==`Steps`)return st(e);let n=W();o.contexts.push(n);let i=[],a=[],s={previousRight:void 0},c=(e,n,a)=>{if(e.kind===`Define`){let n=e.definitions.map(e=>{let t=[];e.kind===`Instance`?We(e,t,i):e.kind===`Function`?Re(e,t):Ie(e,t);let n=t[e.kind===`Instance`?t.length-1:0];if(n?.kind!==`OpDef`)throw new r(`A DEFINE step defines no operator`);return n});return{...U(l()),kind:`DefStep`,defs:n,location:q(t,a)}}if(e.kind===`Use`||e.kind===`Hide`)return{...rt(e),location:q(t,n)};if(e.kind===`Instance`)return Ge(e,!1,q(t,a))},u=e.steps.map(e=>{let n=E(e.location),i=Si(t,e.head),u={start:i.start+1,end:i.end},f=e.body;e.name!==void 0&&b();let p=e.name===void 0?void 0:l();f.kind!==`Assert`&&(s.previousRight=void 0);let m=c(f,n,u);if(m!==void 0)return e.name!==void 0&&d(o,re({defKind:`NumberedProofStep`,name:e.name,location:q(t,n),labels:x(),step:m})),m;let h=f.kind===`Assert`&&f.statement.kind===`AssumeProve`;h&&(s.previousRight=void 0);let g=f.kind===`Assert`&&f.isSuffices,_=W(),v=f.kind===`Assert`?{node:(n=>{if(n.kind===`AssumeProve`){let t=O(_,()=>at(n,1,e.name===void 0?void 0:{isSuffices:g}));return t.isSuffices=g,t}if(g){let e=I(n);return M(`$Suffices`,[e],q(t,u))}let r=s.previousRight,i=r!==void 0&&n.kind===`Apply`&<(n)&&n.args[0].kind===`ExceptAt`,a=i?I(n.args[1]):void 0,o=i?ae(ce(n.operator,T(n)),[M(`$Nop`,[r],T(n.args[0])),a],T(n)):I(n),c=o.kind===`OpAppl`?o.operands[1]:void 0;return s.previousRight=lt(n)?c:void 0,o})(f.statement),isPick:!1}:ct(e,u);if(v===void 0)throw new r(`Unexpected proof step ${f.kind}`);let y=v.isPick?o.contexts.pop():void 0,S=e.name===void 0||p===void 0?void 0:ot(p,e.name,v.node,J(t,yi(t,e.location)),x());S&&d(o,S);let C=h&&!g;C&&o.contexts.push(_);let w=e.proof&&L(e.proof);return C&&o.contexts.pop(),ee(v.node),h&&g&&(a.push(_),o.contexts.push(_)),y?.symbols.forEach(e=>d(o,e)),{...U(l()),kind:`Theorem`,definition:S,body:v.node,proof:w,isSuffices:g,location:q(t,n)}});return a.forEach(()=>{o.contexts.pop()?.symbols.forEach(e=>Zr(n,e))}),o.contexts.pop(),{...U(l()),kind:`NonLeafProof`,steps:u,instances:i,proofLevel:e.level,location:q(t,E(e.location))}},ut=e=>{let n=q(t,E(e.location)),r=e.statement,i=W();e.name!==void 0&&b();let a=e.name===void 0?void 0:l();r.kind===`AssumeProve`&&o.contexts.push(i);let s=r.kind===`AssumeProve`?at(r,1,e.name===void 0?void 0:{isSuffices:!1}):I(r),c=e.name===void 0||a===void 0?void 0:ot(a,e.name,s,n,x());c&&(r.kind===`AssumeProve`&&o.contexts.pop(),d(o,c),D.definitions.push(c),r.kind===`AssumeProve`&&o.contexts.push(i));let u=e.proof&&L(e.proof);r.kind===`AssumeProve`&&o.contexts.pop(),ee(s);let f={...U(l()),kind:`Theorem`,definition:c,body:s,proof:u,isSuffices:!1,location:n};D.topLevel.push(f)},R=e=>{let n=E(e.location),r=q(t,n);e.name!==void 0&&b();let i=I(e.expression),a=e.name===void 0?void 0:ot(l(),e.name,i,r,x(),!1);a&&(d(o,a),D.definitions.push(a));let s={...U(l()),kind:`Assume`,definition:a,body:i,location:r};D.topLevel.push(s)},dt=(e,n)=>n===0?{start:e,end:e}:G(t,e,`_`)?{start:e,end:G(t,e+2,`_`)?e+2:e+1}:G(t,e+1,`(`)?{start:e,end:xi(t,e+1)}:{start:e,end:G(t,e+1,`_`)?e+1:e},ft=e=>dt(E(e.location).start,e.arity),pt=(e,n)=>{let r=ft(e);e.name===`@`&&n===3&&a(q(t,r),`Attempted to declare '@' as a variable.`);let i={...U(l()),levelChecked:1,level:+(n===3),kind:`OpDecl`,name:Ni(e.name),arity:e.arity,declKind:n,location:q(t,r),module:D};return n===2&&(i.levelParams.add(i),i.allParams.add(i)),d(o,i),i};e.extends.forEach(e=>{let t=ne(e);D.extendees.push(t);let n=Li(o);t.context.symbols.forEach(e=>{if(e.kind!==`Module`&&e.kind!==`FormalParam`&&e.kind!==`OpDecl`&&e.isLocal)return;let t=e.kind===`Module`?ei(n,e.name):$r(n,e.name);t===void 0?Zr(n,e):t!==e&&t.kind!==e.kind?a(e.location,`The ${Bi(e)} of '${e.name}' conflicts with \nits ${Bi(t)} at ${Br(t.location)}.`):t!==e&&!Vi(t,e)&&s(e.location,`Warning: the ${Bi(t)} of '${e.name}' conflicts with \nits ${Bi(t)} at ${Br(t.location)}.`)}),D.topLevel.push(...t.topLevel)});let mt=(e,n)=>{c.unresolvedSum!==0&&a(q(t,E(e)),`${n} may not appear within a recursive definition section.`)};return e.units.forEach(e=>{switch(e.kind){case`Variables`:mt(e.location,`A VARIABLE declaration`),e.declarations.forEach(e=>pt(e,3));break;case`Constants`:mt(e.location,`A declaration`),e.declarations.forEach(e=>pt(e,2));break;case`Recursive`:Be(e.declarations);break;case`Definition`:e.definition.kind===`Function`?Re(e.definition,void 0):Ie(e.definition,void 0);break;case`Instance`:e.instance.name===void 0?Ge(e.instance):We(e.instance,void 0,void 0);break;case`Assumption`:mt(e.assumption.location,`An ASSUME`),R(e.assumption);break;case`Theorem`:mt(e.theorem.location,`A THEOREM`),ut(e.theorem);break;case`Use`:mt(e.use.location,`A USE or HIDE`),D.topLevel.push(rt(e.use));break;case`Module`:{mt(e.module.location,`A MODULE `);let n={contexts:[...o.contexts,W()]},r=A(e.module,t,D,n),i=te(r.name);i===void 0?Zr(Li(o),r):i!==r&&a(r.location,`Multiply-defined module '${r.name}': this definition or declaration conflicts \nwith the one at ${Br(i.location)}.`);break}}}),Ve(),D},re=x.map(e=>{n.onAnalyze?.(e),u.id=Array.from({length:4},l)[1];let t=b(e,void 0),r=W();f.toReversed().forEach(e=>Zr(r,e));let a=A(t.module,t.file,void 0,{contexts:[r]});return h.set(e,a),n.onModule?.(a,i),a});return{root:re[re.length-1],modules:re,messages:i}},ta=(e,t,n,r)=>zr(e.messages,{location:t,text:n,isWarning:!1,...r!==void 0&&!e.isTlc174&&{code:r}}),Y=(e,t)=>{for(let n of t)e.add(n)},na=(e,t,n)=>`${e.id}:${t}:${n.id}`,ra=(e,t,n,r)=>{e.set(na(t,n,r),{op:t,index:n,param:r})},ia=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(t)&&e.set(r,t)})},aa=(e,t,n)=>{e.set(t,Math.min(n,e.get(t)??3))},oa=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(r)&&aa(e,r,t)})},sa=(e,t)=>`${e.id}:${t}`,ca=(e,t,n,r)=>{let i=sa(t,n),a=e.get(i)?.level??0;e.set(i,{param:t,position:n,level:Math.max(r,a)})},la=(e,t,n=()=>!0)=>{t.forEach(t=>{n(t)&&ca(e,t.param,t.position,t.level)})},ua=(e,t)=>{e.levelParams=t.levelParams,e.allParams=t.allParams,e.levelConstraints=t.levelConstraints,e.argLevelConstraints=t.argLevelConstraints,e.argLevelParams=t.argLevelParams},da=(e,t)=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),oa(e.levelConstraints,t.levelConstraints),la(e.argLevelConstraints,t.argLevelConstraints),ia(e.argLevelParams,t.argLevelParams)},fa=(e,t)=>t.includes(e.op)||t.includes(e.param),pa=e=>e.kind===`OpDecl`||e.kind===`FormalParam`,ma=e=>e.kind!==`Module`,ha=e=>e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`,ga=(e,t)=>e.kind===`OpDef`&&e.arity<0?0:t,_a=(e,t)=>e.kind===`OpDef`?e.weights[ga(e,t)]??0:0,va=(e,t)=>e.maxLevels[ga(e,t)]??3,ya=(e,t,n)=>e.minMaxLevel?.[t]?.[n]??0,ba=(e,t)=>e.kind===`OpDef`?e.isLeibnizArg?.[ga(e,t)]??!0:e.isLeibnizArg[t]??!0,xa=(e,t,n,r)=>e.opLevelCond?.[t]?.[n]?.[r]??!1,Sa=e=>[...e.unbounded??[],...(e.bounded??[]).flat()],Ca=(e,t)=>t.find(t=>t.op===e)?.expr,wa=(e,t,n)=>{let r=Ca(e,t);return r===void 0?/* @__PURE__ */ new Set([e]):n?r.allParams:r.levelParams},Ta=(e,t)=>{let n=/* @__PURE__ */ new Map;return e.forEach((e,r)=>{let i=Ca(e.op,t);if(i===void 0){n.set(r,e);return}if(i.kind!==`OpArg`||!pa(i.op))return;let a=i.op;wa(e.param,t,!1).forEach(t=>ra(n,a,e.index,t))}),n},Ea=(e,t,n,r,i)=>{let a=/* @__PURE__ */ new Map;return e.levelConstraints.forEach((e,r)=>{let i=n||r.kind!==`OpDecl`?e:r.declKind===2?0:r.declKind===3?1:e;wa(r,t,!1).forEach(e=>aa(a,e,i))}),e.argLevelParams.forEach(e=>{let n=Ca(e.op,t);if(n?.kind!==`OpArg`||n.op.kind!==`OpDef`)return;X(n.op,r,i);let o=va(n.op,e.index);wa(e.param,t,!1).forEach(e=>aa(a,e,o))}),a},Da=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map;return e.argLevelConstraints.forEach(e=>{let n=Ca(e.param,t);n===void 0?ca(i,e.param,e.position,e.level):n.kind===`OpArg`&&pa(n.op)&&ca(i,n.op,e.position,e.level)}),e.argLevelParams.forEach(e=>{let a=Ca(e.param,t);if(a===void 0)return;let o=Ca(e.op,t),s=o===void 0?e.op:o.kind===`OpArg`?o.op:void 0;s!==void 0&&pa(s)&&(X(a,n,r),ca(i,s,e.index,a.level))}),i},Oa=(e,t)=>ni(e,3).length>0||(La(e,t),ti(e).some(e=>(e.body?.level??0)!==0))?!1:e.topLevel.every(e=>e.kind!==`Theorem`||e.level===0),ka=(e,t,n)=>{e.minMaxLevel=t.map(e=>Array.from({length:e.arity},(t,r)=>n.argLevelConstraints.get(sa(e,r))?.level??0)),e.opLevelCond=t.map(e=>t.map(t=>Array.from({length:e.arity},(r,i)=>n.argLevelParams.has(na(e,i,t))))),Y(e.levelParams,n.levelParams),Y(e.allParams,n.allParams),Y(e.nonLeibnizParams,n.nonLeibnizParams),t.forEach((t,n)=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.has(t)&&(e.nonLeibnizParams.delete(t),e.isLeibnizArg&&(e.isLeibnizArg[n]=!1),e.isLeibniz=!1)}),e.levelConstraints=new Map(n.levelConstraints),t.forEach(t=>e.levelConstraints.delete(t)),e.argLevelConstraints=new Map(n.argLevelConstraints),t.forEach(t=>{for(let n=0;n<t.arity;n++)e.argLevelConstraints.delete(sa(t,n))}),ia(e.argLevelParams,n.argLevelParams,e=>!t.some(t=>t===e.op)||!t.some(t=>t===e.param))},Aa=(e,t,n,r,i)=>{e.operands.forEach((a,o)=>{if(a===void 0||(a.level>va(t,o)&&(n&&X(a,r,i)&&ta(i,e.location,`Level error in applying operator ${t.name}:\nThe level of argument ${o+1} exceeds the maximum level allowed by the operator.`),e.levelCorrect=!1),a.kind!==`OpArg`||!ha(a.op)))return;let s=a.op;X(s,r,i);let c=Qr(s);for(let l=0;l<c;l++){let c=ya(t,o,l);va(s,l)>=c||(n&&X(a,r,i)&&ta(i,e.location,`Level error in applying operator ${t.name}:\nThe permitted level of argument ${l+1} of the operator argument ${o+1} \nmust be at least ${c}.`),e.levelCorrect=!1)}e.operands.forEach((n,l)=>{for(let u=0;u<c;u++)n===void 0||!xa(t,o,l,u)||n.level<=va(s,u)||(X(a,r,i)&&X(n,r,i)&&ta(i,e.location,`Level error in applying operator ${t.name}:\nThe level of argument ${l+1} exceeds the maximum level allowed by the operator.`,`HIGHER_ORDER_OPERATOR_COPARAMETER_LEVEL_CONSTRAINTS_EXCEEDED`),e.levelCorrect=!1)})}),e.ranges.forEach((n,a)=>{let o=X(n,r,i);n.level<=2||(o&&ta(i,e.location,`Level error in applying operator ${t.name}:\nThe level of the range for the bounded variable ${Br(e.bounded?.[a]?.[0]?.location)} \nexceeds the maximum level allowed by the operator.`),e.levelCorrect=!1)})},ja=(e,t,n,r,i)=>{let a=t.params??[],o=t=>e.operands.find((e,n)=>a[n]===t);oa(e.levelConstraints,t.levelConstraints),e.operands.forEach(t=>{t!==void 0&&oa(e.levelConstraints,t.levelConstraints,e=>!n.has(e))}),e.ranges.forEach(t=>oa(e.levelConstraints,t.levelConstraints)),e.operands.forEach((n,r)=>{let i=va(t,r);n?.levelParams.forEach(t=>aa(e.levelConstraints,t,i))}),e.operands.forEach((n,a)=>{if(n?.kind!==`OpArg`||!ha(n.op))return;let o=n.op;X(o,r,i);let s=Qr(o);e.operands.forEach((n,r)=>{for(let i=0;i<s;i++){if(!xa(t,a,r,i))continue;let s=va(o,i);n?.levelParams.forEach(t=>aa(e.levelConstraints,t,s)),!o.isLeibniz&&!ba(o,i)&&n&&Y(e.nonLeibnizParams,n.allParams)}})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n?.kind===`OpArg`&&ha(n.op)&&(X(n.op,r,i),aa(e.levelConstraints,t.param,va(n.op,t.index)))}),la(e.argLevelConstraints,t.argLevelConstraints),e.operands.forEach(t=>{t&&la(e.argLevelConstraints,t.argLevelConstraints)}),e.ranges.forEach(t=>la(e.argLevelConstraints,t.argLevelConstraints)),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!pa(n.op))return;let i=n.op;for(let n=0;n<i.arity;n++)ca(e.argLevelConstraints,i,n,ya(t,r,n));e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&xa(t,r,a,o)&&ca(e.argLevelConstraints,i,o,n.level)})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n!==void 0&&(X(n,r,i),ca(e.argLevelConstraints,t.op,t.index,n.level))}),e.operands.forEach(t=>{t!==void 0&&ia(e.argLevelParams,t.argLevelParams,e=>!n.has(e.param))}),e.ranges.forEach(t=>ia(e.argLevelParams,t.argLevelParams)),t.argLevelParams.forEach((t,n)=>{let a=o(t.op);if(a===void 0){let a=o(t.param);a===void 0?e.argLevelParams.set(n,t):(X(a,r,i),a.levelParams.forEach(n=>ra(e.argLevelParams,t.op,t.index,n)))}else a.kind===`OpArg`&&pa(a.op)&&ra(e.argLevelParams,a.op,t.index,t.param)}),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!pa(n.op))return;let i=n.op;e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&xa(t,r,a,o)&&n.levelParams.forEach(t=>ra(e.argLevelParams,i,o,t))})})},Ma=/* @__PURE__ */ new Map([[`\\land`,`\\land`],[`\\lor`,`\\lor`],[`=>`,`=>`],[`\\equiv`,`\\equiv`],[`$ConjList`,`Conjunction list`],[`$DisjList`,`Disjunction list`]]),Na=(e,t)=>{let n=(n,r)=>{ta(t,n,r),t.isTlc174||(e.levelCorrect=!1)},r=e.operator.name,i=e.operands[0];if((r===`[]`||r===`<>`)&&i?.level===2&&i.kind===`OpAppl`){let t=r===`[]`;i.operator.name!==(t?`$SquareAct`:`$AngleAct`)&&n(e.location,t?`[] followed by action not of form [A]_v.`:`<> followed by action not of form <<A>>_v.`)}r!==`~>`&&r!==`-+->`||i?.level!==2&&e.operands[1]?.level!==2||n(e.location,`Action used where only temporal formula or state predicate allowed.`);let a=Ma.get(r);a!==void 0&&e.operands.some(e=>e?.level===3)&&e.operands.some(e=>e?.level===2)&&n(e.location,`${a} has both temporal formula and action as arguments.`),e.level===3&&(r===`$BoundedExists`||r===`$BoundedForall`)&&e.ranges.forEach(e=>{e.level===2&&n(e.location,`Action-level bound of quantified temporal formula.`)})},Pa=(e,t,n)=>{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.operands.filter(e=>e!==void 0);r.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),e.ranges.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)});let i=e.operator;if(ha(i)){let r=X(i,t,n);Aa(e,i,r,t,n),e.level=e.operands.reduce((e,t,n)=>t!==void 0&&_a(i,n)===1?Math.max(e,t.level):e,i.level),e.ranges.forEach(t=>{e.level=Math.max(e.level,t.level)}),Y(e.levelParams,i.levelParams),Y(e.allParams,i.allParams),Y(e.nonLeibnizParams,i.nonLeibnizParams),e.operands.forEach((t,n)=>{t!==void 0&&(_a(i,n)===1&&Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams),ba(i,n)||Y(e.nonLeibnizParams,t.allParams))}),e.ranges.forEach(t=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams)});let a=new Set(Sa(e));a.forEach(t=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.delete(t)}),ja(e,i,a,t,n)}else X(i,t,n),e.level=r.reduce((e,t)=>Math.max(e,t.level),i.kind===`Module`?0:i.level),e.levelParams=/* @__PURE__ */ new Set([i]),e.allParams.add(i),r.forEach((t,n)=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams),oa(e.levelConstraints,t.levelConstraints),ca(e.argLevelConstraints,i,n,t.level),la(e.argLevelConstraints,t.argLevelConstraints),t.levelParams.forEach(t=>ra(e.argLevelParams,i,n,t)),ia(e.argLevelParams,t.argLevelParams)});return Na(e,n),e.levelCorrect},Fa=(e,t,n)=>{if(e.levelChecked>=t||!e.inRecursiveSection&&e.levelChecked>0)return e.levelCorrect;e.levelChecked=t;let r=e.body;if(r===void 0)return e.levelCorrect=e.step===void 0||X(e.step,t,n),e.levelCorrect;e.levelCorrect=X(r,t,n),e.level=Math.max(e.level,r.level);let i=e.params??[];return i.forEach((t,n)=>{let i=r.levelConstraints.get(t);i!==void 0&&(e.maxLevels[n]=Math.min(e.maxLevels[n],i)),r.levelParams.has(t)&&(e.weights[n]=Math.max(e.weights[n],1))}),ka(e,i,r),e.levelCorrect},Ia=(e,t,n)=>(e.levelChecked>=t||(e.levelChecked=t,e.maxLevels=e.params.map(()=>3),e.isLeibnizArg=e.params.map((t,n)=>n===e.params.length-1),e.params.length>0&&(e.isLeibniz=!0),e.levelCorrect=X(e.body,t,n),e.level=e.body.level,e.params.forEach((t,n)=>{let r=e.body.levelConstraints.get(t);r!==void 0&&(e.maxLevels[n]=r)}),ka(e,e.params,e.body)),e.levelCorrect),La=(e,t)=>{if(e.isLevelChecked)return e.levelCorrect;e.isLevelChecked=!0;let n=e.opDefsInRecursiveSection,r=0;for(;r<n.length;){let e=n[r].recursiveSection,i=r;for(;i<n.length&&n[i].recursiveSection===e;){let e=n[i];e.inRecursive?(e.levelChecked=1,e.maxLevels=e.maxLevels.map(()=>2),e.weights=e.weights.map(()=>1)):e.levelChecked=0,i++}let a=n.slice(r,i),o=/* @__PURE__ */ new Set,s=/* @__PURE__ */ new Set,c=0;a.forEach(e=>{e.inRecursive&&(e.levelChecked=0),Fa(e,1,t),e.inRecursive&&(e.maxLevels.forEach((n,r)=>{n>=2||ta(t,e.location,`Argument ${r+1} of recursive operator ${e.name} is primed`)}),c=Math.max(c,e.level),Y(o,e.levelParams),Y(s,e.allParams))}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=2),e.level=Math.max(e.level,c),Y(e.levelParams,o),Y(e.allParams,s)}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=1),Fa(e,2,t)}),r=i}e.levelCorrect=!0;let i=t=>{t||(e.levelCorrect=!1)};e.definitions.filter(e=>e.kind===`Module`).forEach(e=>i(La(e,t)));let a=ti(e);return a.forEach(e=>i(Fa(e,1,t))),ri(e).forEach(e=>i(Ia(e,1,t))),e.topLevel.forEach(e=>i(X(e,1,t))),Oa(e,t)||ni(e,2).forEach(t=>aa(e.levelConstraints,t,0)),a.forEach(t=>{oa(e.levelConstraints,t.levelConstraints),la(e.argLevelConstraints,t.argLevelConstraints),ia(e.argLevelParams,t.argLevelParams,e=>!fa(e,t.params??[]))}),e.topLevel.forEach(t=>{oa(e.levelConstraints,t.levelConstraints),la(e.argLevelConstraints,t.argLevelConstraints),ia(e.argLevelParams,t.argLevelParams)}),e.levelCorrect},Ra=(e,t,n,r)=>(e.levelChecked>=n||(e.levelChecked=n,t.forEach(t=>{ma(t)&&(t.kind!==`OpDef`||t.defKind!==`ModuleInstance`)&&(e.levelCorrect=X(t,n,r)&&e.levelCorrect,e.level=Math.max(e.level,t.level),da(e,t),Y(e.nonLeibnizParams,t.nonLeibnizParams))})),e.levelCorrect),za=(e,t)=>{e?.kind===`NonLeafProof`&&e.steps.forEach(e=>{if(e.kind!==`Theorem`||e.body.kind!==`OpAppl`)return;let n=e.body.operator.name;n===`$Take`||n===`$Witness`||n===`$Have`?e.body.level!==0&&ta(t,e.body.location,`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`):n===`$Pfcase`?(e.body.level!==0&&ta(t,e.body.location,`Non-constant CASE for temporal goal.`),za(e.proof,t)):n===`$Qed`&&za(e.proof,t)})},Ba=(e,t,n)=>{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelParams=/* @__PURE__ */ new Set,e.levelCorrect=!0;let r=e.module;La(r,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{X(r.expr,t,n)||(e.levelCorrect=!1)});let i=Oa(r,n);e.substs.forEach(a=>{!i&&a.expr.level>a.op.level&&(X(a.expr,t,n)&&ta(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the expression or operator substituted for '${a.op.name}' \nmust be at most ${a.op.level}.`),e.levelCorrect=!1),a.expr.kind!==`OpArg`||a.expr.op.kind!==`OpDef`||a.expr.op.defKind!==`UserDefined`&&a.expr.op.defKind!==`BuiltIn`||a.expr.op.isLeibniz||ta(n,e.location,`Error in instantiating module '${r.name}':\n A non-Leibniz operator substituted for '${a.op.name}'.`)}),e.substs.forEach(i=>{let a=r.levelConstraints.get(i.op);if(a!==void 0&&i.expr.level>a&&(X(i.expr,t,n)&&ta(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the expression or operator substituted for '${i.op.name}' \nmust be at most ${a}.`),e.levelCorrect=!1),i.op.arity<=0||i.expr.kind!==`OpArg`||i.expr.op.kind!==`OpDef`)return;let o=i.expr.op,s=X(o,t,n);for(let t=0;t<i.op.arity;t++){let a=r.argLevelConstraints.get(sa(i.op,t))?.level;a===void 0||va(o,t)>=a||(s&&ta(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the argument ${t+1} of the operator ${o.name} \nmust be at least ${a}.`),e.levelCorrect=!1)}}),r.argLevelParams.forEach(i=>{e.substs.forEach(a=>{e.substs.forEach(o=>{if(i.op!==a.op||i.param!==o.op||a.expr.kind!==`OpArg`)return;let s=a.expr.op,c=X(s,t,n);if(s.kind!==`OpDef`)return;let l=va(s,i.index);o.expr.level<=l||(c&&X(o.expr,t,n)&&ta(n,e.location,`Level error when instantiating module '${r.name}':\nThe level of the argument ${i.index} of the operator ${a.op.name}' \nmust be at most ${l}.`),e.levelCorrect=!1)})})});let a=t=>!e.params.some(e=>e===t);return oa(e.levelConstraints,Ea(r,e.substs,i,t,n),a),e.substs.forEach(t=>oa(e.levelConstraints,t.expr.levelConstraints,a)),la(e.argLevelConstraints,Da(r,e.substs,t,n),e=>a(e.param)),e.substs.forEach(t=>la(e.argLevelConstraints,t.expr.argLevelConstraints,e=>a(e.param))),ia(e.argLevelParams,Ta(r.argLevelParams,e.substs),t=>!fa(t,e.params)),e.substs.forEach(t=>ia(e.argLevelParams,t.expr.argLevelParams,t=>!fa(t,e.params))),e.levelCorrect},X=(e,t,n)=>{if(!ma(e))return La(e,n);switch(e.kind){case`OpAppl`:return Pa(e,t,n);case`OpDef`:return Fa(e,t,n);case`ThmOrAssumpDef`:return Ia(e,t,n);case`FormalParam`:return e.levelChecked===0&&(e.levelChecked=t,e.levelParams.add(e),e.allParams.add(e)),!0;case`OpDecl`:return!0;case`Numeral`:case`String`:case`Decimal`:return e.levelChecked<t&&(e.levelChecked=t),!0;case`OpArg`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t;let r=e.op;return e.levelCorrect=X(r,t,n),r.kind===`Module`||(e.level=r.level,ua(e,r)),e.levelCorrect}case`LetIn`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.opDefs.filter(e=>e.kind!==`OpDef`||e.defKind!==`ModuleInstance`);return r.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),X(e.body,t,n)||(e.levelCorrect=!1),e.instances.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),e.level=e.body.level,e.levelParams=new Set(e.body.levelParams),e.allParams=new Set(e.body.allParams),oa(e.levelConstraints,e.body.levelConstraints),r.forEach(t=>oa(e.levelConstraints,t.levelConstraints)),la(e.argLevelConstraints,e.body.argLevelConstraints),r.forEach(t=>la(e.argLevelConstraints,t.argLevelConstraints)),ia(e.argLevelParams,e.body.argLevelParams),r.forEach(t=>{let n=t.kind===`OpDef`?t.params??[]:[];ia(e.argLevelParams,t.argLevelParams,e=>!fa(e,n))}),e.instances.forEach(t=>ia(e.argLevelParams,t.argLevelParams)),e.levelCorrect}case`Label`:{if(e.levelChecked>=t)return!0;e.levelChecked=t,e.params.forEach(e=>X(e,t,n));let r=X(e.body,t,n);return e.level=e.body.level,ua(e,e.body),r}case`At`:{if(e.levelChecked>=t)return!0;e.levelChecked=t;let r=e.except.operands,i=r[0];if(i===void 0)return!0;X(i,t,n),e.level=i.level;let a=[i];for(let i of r.slice(1))if(i!==void 0){if(X(i,t,n),i===e.component)break;e.level=Math.max(e.level,i.level),a.push(i)}return a.forEach(t=>da(e,t)),!0}case`SubstIn`:case`APSubstIn`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.body;X(r,t,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{X(r.expr,t,n)||(e.levelCorrect=!1)}),e.level=e.substs.reduce((e,t)=>r.levelParams.has(t.op)?Math.max(e,t.expr.level):e,r.level),r.levelParams.forEach(t=>Y(e.levelParams,wa(t,e.substs,!1))),e.kind===`APSubstIn`?r.allParams.forEach(t=>Y(e.allParams,wa(t,e.substs,!0))):(e.allParams=new Set(r.allParams),e.nonLeibnizParams=new Set(r.nonLeibnizParams),e.substs.forEach(t=>{e.allParams.has(t.op)&&(e.allParams.delete(t.op),Y(e.allParams,t.expr.allParams),Y(e.nonLeibnizParams,t.expr.nonLeibnizParams),e.nonLeibnizParams.has(t.op)&&(e.nonLeibnizParams.delete(t.op),Y(e.nonLeibnizParams,t.expr.allParams)))}));let i=Oa(e.instantiatedModule,n);return e.levelConstraints=Ea(r,e.substs,i,t,n),e.argLevelConstraints=Da(r,e.substs,t,n),e.argLevelParams=Ta(r.argLevelParams,e.substs),e.levelCorrect}case`Instance`:return Ba(e,t,n);case`Assume`:{if(e.levelChecked>=t)return!0;e.levelChecked=t;let r=X(e.body,t,n),i=!e.definition||X(e.definition,t,n);return e.level=e.body.level,ua(e,e.body),e.level!==0&&ta(n,e.location,`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${e.level}.`),r&&i}case`Theorem`:{if(e.levelChecked>=t)return!0;let r=Ra(e,[e.definition??e.body,...e.proof?[e.proof]:[]],t,n),i=e.body;return i.kind===`OpAppl`&&i.operator.name===`$Pick`&&i.level===3&&i.ranges.forEach(e=>{e.level!==0&&ta(n,e.location,`Non-constant bound of temporal PICK.`)}),i.level===3&&za(e.proof,n),r}case`LeafProof`:case`UseOrHide`:return Ra(e,e.facts,t,n);case`NonLeafProof`:return Ra(e,[...e.steps,...e.instances],t,n);case`DefStep`:return Ra(e,e.defs,t,n);case`NewSymb`:return e.levelChecked>=t||(e.levelChecked=t,e.level=e.declaration.level,e.set===void 0)||(e.levelCorrect=X(e.set,t,n),e.level=Math.max(e.level,e.set.level),e.level===3&&(e.levelCorrect=!1,ta(n,e.location,`Level error:
|
|
35
|
+
Temporal formula used as set.`)),ua(e,e.set)),e.levelCorrect;case`AssumeProve`:return e.levelChecked>=t||(e.levelChecked=t,e.levelCorrect=!0,e.assumptions.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),X(e.goal,t,n),e.level=e.assumptions.reduce((e,t)=>Math.max(e,t.level),e.goal.level),[e.goal,...e.assumptions].forEach(t=>da(e,t)),e.levelCorrect&&e.levelParams.forEach(t=>{t.kind===`OpDecl`&&t.declKind===2&&aa(e.levelConstraints,t,2)})),e.levelCorrect}},Va=e=>{switch(e.kind){case`OpAppl`:return[...e.ranges,...e.operands];case`OpDef`:case`ThmOrAssumpDef`:case`Label`:return[e.body];case`LetIn`:return[...e.opDefs,...e.instances,e.body];case`SubstIn`:case`APSubstIn`:return[e.body,...e.substs.map(e=>e.expr)];case`Instance`:return e.substs.map(e=>e.expr);case`AssumeProve`:return[...e.assumptions,e.goal];case`NewSymb`:return[e.set];default:return[]}},Ha=/* @__PURE__ */ new Map([[`Integers`,`Int`],[`Naturals`,`Nat`],[`Reals`,`Reals`]]),Ua=e=>{let t=/* @__PURE__ */ new Set,n=e=>{if(e===void 0||t.has(e))return!1;if(t.add(e),e.kind===`OpAppl`){let t=e.operator;if(t.kind===`OpDecl`||t.kind===`FormalParam`)return!0;if(t.kind===`OpDef`){if(t.name===`BOOLEAN`)return!0;let e=t.module?.name;if(e!==void 0&&Ha.get(e)===t.name||n(t))return!0}}return Va(e).some(n)};return n(e)},Wa=e=>e.operands.filter(e=>e?.kind===`OpAppl`),Ga=e=>{let t=e.operands[0];return t?.kind===`String`?t:void 0},Ka=(e,t)=>{if(e===t)return!0;if(e.operands.length!==t.operands.length)return!1;let n=new Set(Wa(t).map(e=>Ga(e)?.value));return Wa(e).every(e=>n.has(Ga(e)?.value))},qa=(e,t=/* @__PURE__ */ new Set)=>(e.extendees.forEach(e=>{t.has(e)||(t.add(e),qa(e,t))}),t),Ja=e=>{let t=[...[...qa(e)].flatMap(e=>e.records),...e.records];return e.records.flatMap(n=>t.filter(e=>Ka(e,n)).flatMap(Wa).some(Ua)?[]:Wa(n).flatMap(t=>{let n=Ga(t),r=n&&$r(e.context,n.value);return n===void 0||r===void 0?[]:[{location:n.location,text:`The field name "${n.value}" in the record constructor is identical to the existing definition or declaration\nnamed ${n.value}, located at ${Br(r.location)}.\nThe field in the record will not take the value of the ${n.value} definition or declaration.\nIn TLA+, field names in records are strings, regardless of any similarly named declarations or definitions.\nTherefore, DOMAIN [${n.value} |-> ...] = {"${n.value}"} holds true.`,isWarning:!0}]}))},Ya=e=>`${Br(e.location)}\n\n${e.text}`,Xa=e=>{let t=e.filter(e=>!e.isWarning),n=e.filter(e=>e.isWarning);return[t.length>0?`*** Errors: ${t.length}\n\n`:``,...t.map(e=>`${Ya(e)}\n\n\n`),n.length>0?`*** Warnings: ${n.length}\n\n`:``,...n.map(e=>`${Ya(e)}\n\n\n`)].join(``)},Za=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),Qa=e=>{let t=/* @__PURE__ */ new Set,n=[],r=e=>{t.add(e.name),n.push(...e.extends),e.modules.forEach(r)};return r(e),n.filter(e=>!t.has(e))},$a=e=>{try{return ee(Oi(e))}catch(e){if(e instanceof r)return;throw e}},eo=(e,t)=>t===`1.7.4`&&S(e)!==void 0?void 0:$a(e)?.name,to=(e,t,n={})=>{let r=Te(e,`.tla`),i=de(n.version),a=n.fileName??r,s=F(e)?Ne(e,`utf8`):i.get(r),c=[],l=e=>{c.push(e),n.onPrint?.(e)},u=e=>l(`${e}\n`),d=n.version===`1.7.4`,f=d&&n.isXmlExport,p=e=>{n.isXmlExport||u(e)},m=n.describeFile,h=/* @__PURE__ */ new Map([[r,F(e)?`file`:`standard`]]),_={value:!1},v=[],y={isReported:!1,isAborted:!1},b=In(Jt(),u),x=/* @__PURE__ */ new Map,S=[],C=()=>S.splice(0).forEach(e=>e.isError?n.onPrintError?.(`${e.text}\n`):u(e.text)),w=e=>{let t=x.get(e),r=t?.module.location.range;if(t===void 0||r===void 0)return;let i=t.text.split(/\r\n|\r|\n/),a=Fr(b,i.slice(r.start.line-1,r.end.line),n.version),o=a.has(`TLA_DIVERGENCE_EXISTS`),s=a.has(`PCAL_DIVERGENCE_EXISTS`),c=o===s?void 0:`The ${o?`TLA+ translation`:`PlusCal algorithm`} in module ${e} has changed since its last translation.`;if(d){let t=o&&s?`The PlusCal algorithm and its TLA+ translation in module ${e} filename since the last translation.`:c;t===void 0?a.has(`ERROR_ENCOUNTERED`)&&S.push({text:`A unexpected problem was encountered attempting to validate the specification for ${e}`,isError:!0}):S.push({text:`!! WARNING: ${t}`,isError:!1});return}let l=o&&s?`Both the PlusCal algorithm and its TLA+ translation in module ${e} have changed since the last translation.`:c??(a.has(`ERROR_ENCOUNTERED`)?`An unexpected problem was encountered attempting to validate the specification for ${e}`:void 0);if(l===void 0)return;let u=!a.has(`ERROR_ENCOUNTERED`)||o||s;v.some(e=>e.text===l)||v.push({location:e,text:l,isWarning:u})},ee=(e,t)=>{if(n.isXmlExport||x.has(e))return;let r=$a(t);if(r===void 0||r.name!==e)return;let i=[...x.values()].filter(t=>Qa(t.module).includes(e));x.set(e,{text:t,module:r}),i.forEach(()=>w(e)),Qa(r).filter(t=>t!==e&&x.has(t)).forEach(w)},T=()=>{if(C(),y.isReported)return;y.isReported=!0;let e=v.filter(e=>e.isWarning);e.length>0&&(p(`Warnings (${e.length}) during syntax parsing of ${a}:\n\n`),e.forEach(e=>p(`${Ya(e)}\n\n\n`))),e.length!==v.length&&(u(Xa(v)),_.value=!0,y.isAborted=!0)},D=e=>{let n=i.get(e),r=t(e),a=r===void 0&&n===void 0&&s!==void 0&&!d?E(s,e):void 0,o=r??a;return h.set(e,r===void 0?a===void 0?`standard`:`root file`:`file`),o!==void 0&&ee(e,o),o??n},te=(()=>{try{if(s===void 0)throw new o(`Cannot find source file for module ${a}`,void 0);return ee(r,s),ea(s,D,{rootFileName:r,rootFilePath:n.isXmlExport?`${a.replace(/\.tla$/,``)}.tla`:void 0,version:n.version,rootExtendees:n.rootExtendees,onParse:e=>{m&&u(`Parsing file ${m(e,h.get(e)??`file`)}`),e===r&&w(r),C()},onAnalyze:e=>{T(),(m||f)&&!y.isAborted&&u(`Semantic processing of module ${e}`)},onModule:(e,t)=>{if(y.isAborted||(t.every(e=>e.isWarning)&&La(e,{messages:t,isTlc174:d}),t.length===0))return;if(t.some(e=>!e.isWarning)&&(_.value=!0),d)return u(`Semantic errors:\n\n${Xa(t)}`);let n=t.filter(e=>e.isWarning);n.length>0&&(p(`*** Warnings: ${n.length}\n`),n.forEach(e=>p(`${Ya(e)}\n\n\n`)));let r=t.filter(e=>!e.isWarning);r.length!==0&&(u(`Semantic errors:\n\n*** Errors: ${r.length}\n`),r.forEach(e=>u(`${Ya(e)}\n\n`)))}})}catch(e){if(_.value=!0,e instanceof g){u(`\nFatal errors while parsing TLA+ spec in file ${a}\n`),u(e.message),u(Xa(v));return}if(!(e instanceof o))throw e;let t={location:e.location,text:e.message,isWarning:!1},n=d&&e.parseError?.includes(` and token "" `);if(e.parseError!==void 0&&!n&&!f&&u(e.parseError),u(`\nFatal errors while parsing TLA+ spec in file ${a}\n`),n){u(`java.lang.NullPointerException: Cannot invoke "String.length()" because "str" is null`);return}if(d){u(`tla2sany.semantic.AbortException`),l(`*** Abort messages: 1\n\n${Ya(t)}\n\n\n`);return}u(Ya(t)),u(Xa(y.isReported?[t]:[...v,t]))}})();if(te!==void 0&&T(),te!==void 0&&!_.value&&!n.isXmlExport&&!d){let e=te.modules.filter(e=>!Za.has(e.name));m&&e.forEach(e=>u(`Linting of module ${e.name}`)),e.flatMap(Ja).forEach(e=>u(`${Ya(e)}\n\n\n`))}return{text:c.join(``),isFailed:_.value,specification:y.isAborted?void 0:te}},no={success:s.success,"assumption-violation":s.assumptionViolation,deadlock:s.deadlock,"invariant-violation":s.safetyViolation,"property-violation":s.safetyViolation,"liveness-violation":s.livenessViolation,"postcondition-violation":s.assumptionViolation,error:s.error},ro=e=>/^[+-]?\d+$/.test(e)&&BigInt.asIntN(64,BigInt(e))===BigInt(e),io=e=>e?e[0]===`auto`?Ue():Math.max(1,Number.parseInt(e[0],10)||1):1,ao=[`constrained`,`stuttering`,`strict`],oo=(e,t)=>e.endsWith(t)?e:`${e}${t}`,so=e=>{if(e.length===1)return{path:oo(e[0],`.dump`)};let t=e[0].toLowerCase();return{path:oo(e[1],`.dot`),dot:!0,colorize:t.includes(`colorize`),actionLabels:t.includes(`actionlabels`),snapshot:t.includes(`snapshot`)}},co=(e,t)=>e.print(A.computingInitProgress,N.none,`Computed ${t} initial states...`),lo=(e,t)=>e===`invariant-violation`?{code:A.invariantViolatedInitial,text:`Invariant ${t} is violated by the initial state:`}:{code:A.propertyViolatedInitial,text:`Property ${t} is violated by the initial state:`},uo=(e,t)=>t?.forEach(t=>{if(typeof t==`string`)return console.log(t);if(t.kind===`initial-states-progress`)return co(e,t.count);let n=lo(t.status,t.name);e.print(n.code,N.error,`${n.text}\n${ae(t.state)}`)}),fo=(e,t,n={code:A.behaviorUpToThisPoint,text:`The behavior up to this point is:`},r=!1)=>{t.length>0&&e.print(n.code,N.error,n.text),t.forEach((t,n)=>{(n>0||r)&&uo(e,t.output),e.print(A.statePrint2,N.state,`${n+1}: <${t.label??t.action??`Initial predicate`}>\n${ae(t.state)}`)})},po={code:A.counterExample,text:`The following behavior constitutes a counter-example:
|
|
36
|
+
`},mo=(e,t)=>t===`1.7.4`||e.length===0?`Temporal properties were violated.
|
|
37
|
+
`:e.length===1?`Temporal property ${e[0]} was violated.\n`:`Temporal properties ${e.slice(0,-1).join(`, `)}${e.length>2?`,`:``} and ${e[e.length-1]} were violated.\n`,ho=e=>e.filter((t,n)=>t!==e[n-1]).map((e,t)=>`${t}) ${D(e)}\n`).toReversed().join(``),go=e=>{if(e.length===0)return` The error call stack is empty.
|
|
38
|
+
`;let t=[];return e.forEach((n,r)=>{let i=n.location.range;n!==e[r-1]&&i&&t.push(`${t.length}. Line ${i.start.line}, column ${i.start.column} to line ${i.end.line}, column ${i.end.column} in ${i.module}\n`)}),`${t.join(``)}\n`},_o=(e,t)=>{let n=t.generated,r=t.distinct,i=O(/* @__PURE__ */ new Date);n===r?e.print(A.initGenerated1,N.none,`Finished computing initial states: ${r} distinct state${r===1?``:`s`} generated at ${i}.`):e.print(A.initGenerated2,N.none,`Finished computing initial states: ${n} state${n===1?``:`s`} generated, with ${r} of them distinct at ${i}.`)},vo=(e,t,n)=>{let r=Math.max(Date.now()-(n??0),1)/6e4,i=e=>e.toLocaleString(`en-US`),a=(e,t)=>n===void 0?``:` (${i(Math.floor(e/r))} ${t}/min)`;e.print(A.progress,N.none,`Progress(${Math.max(t.depth,1)}) at ${O(/* @__PURE__ */ new Date)}: ${i(t.generatedStates)} states generated${a(t.generatedStates,`s`)}, ${i(t.distinctStates)} distinct states found${a(t.distinctStates,`ds`)}, ${i(t.queuedStates)} states left on queue.`)},yo=(e,t)=>ke(e,`${t}.class`),bo=(e,t,n,r)=>{let i=e.print;switch(t.kind){case`parsed`:n.isParsed=!0,e.isTool&&i(A.sanyFinished,N.none,`SANY finished.`),i(A.starting,N.none,`Starting... (${O(/* @__PURE__ */ new Date)})`);return;case`constant-level-invariant`:if(e.version===`1.7.4`)return;i(A.constantLevelInvariant,N.warning,`The invariant ${t.name} is a constant-level formula (i.e., it contains no variables, primes, or temporal operators) and evaluates to TRUE. To assert constant-level formulas in your spec, use ASSUME ConstInv. If you optionally want to give the assumption a name, write ASSUME YourAssumption == ConstInv instead. See https://explain.tlapl.us/assumptions-and-invariants for additional details.`);return;case`state-level-property`:if(e.version===`1.7.4`)return;i(A.stateLevelProperty,N.warning,`The formula ${t.name} is a state-level formula, but it was used as a PROPERTY (or PROPERTIES), where a temporal formula is typically expected. State-level formulas used as PROPERTY or PROPERTIES are only checked in the initial state. To verify that the formula ${t.name} holds in all states of every behavior, use INVARIANT ${t.name} instead. Alternatively, applying the "always" temporal operator ([]) to the state-level formula ${t.name} changes it into a temporal formula, asserting that ${t.name} holds in all states of every behavior. See https://explain.tlapl.us/invariants-and-properties for additional details.`);return;case`liveness-initializing`:t.isSymmetric&&i(A.livenessSymmetry,N.warning,`Declaring symmetry during liveness checking is dangerous. It might cause TLC to miss violations of the stated liveness properties. Please check liveness without symmetry defined.`),t.isConstrained&&e.version===`1.7.4`&&i(A.livenessConstraints,N.warning,`Declaring state or action constraints during liveness checking is dangerous: Please read section 14.3.5 on page 247 of Specifying Systems (https://lamport.azurewebsites.net/tla/book.html) and optionally the discussion at https://discuss.tlapl.us/msg00994.html for more details.`);return;case`liveness-prepared`:i(A.temporalBranches,N.none,`Implied-temporal checking--satisfiability problem has ${t.branches} branches.`);return;case`java-override`:{let e=Ve(Ae(yo(r,t.module))).href;i(t.isMatched?A.javaOverrideLoaded:A.javaOverrideMismatch,t.isMatched?N.none:N.warning,`${t.isMatched?`Loading`:`Failed to match`} ${t.operator} operator override from ${e.replace(`file:///`,`file:/`)} with signature: <Java Method: ${t.signature}>.`);return}case`initial-states-started`:i(A.computingInit,N.none,`Computing initial states...`);return;case`initial-states-progress`:co(e,t.count);return;case`initial-states-computed`:_o(e,t.initialStates);return;case`progress`:vo(e,t.statistics,n.startTime);return;case`liveness-started`:{n.livenessStartTime=Date.now(),t.isComplete&&vo(e,t.statistics);let r=t.branches>1?`${t.branches} branches of `:``,a=t.branches*t.states;i(A.checkingTemporal,N.none,`Checking ${r}temporal properties for the ${t.isComplete?`complete`:`current`} state space with ${a} total distinct states at (${O(/* @__PURE__ */ new Date)})`);return}case`liveness-finished`:xo(e,n);return;case`warning`:i(t.code,N.warning,t.text)}},xo=(e,t)=>{t.livenessStartTime!==void 0&&(e.print(A.checkingTemporalEnd,N.none,`Finished checking temporal properties in ${le(Date.now()-t.livenessStartTime)} at ${O(/* @__PURE__ */ new Date)}`),t.livenessStartTime=void 0)},So=(e,t,n)=>{let r=n.print,i=t.name,a=t.loopStart,o=a===void 0&&t.trace.length===1&&(e===`invariant-violation`||e===`liveness-violation`),s={code:A.temporalPropertyViolated,text:mo(t.properties??[i],n.version)},c={success:void 0,error:void 0,"assumption-violation":t.message?{code:A.assumptionEvaluationError,text:ie(A.assumptionEvaluationError,`Evaluating assumption ${i} failed.\n${t.message}`,n.isTool)}:{code:A.assumptionFalse,text:`Assumption ${i} is false.`},deadlock:{code:A.deadlockReached,text:`Deadlock reached.`},"invariant-violation":o?lo(`invariant-violation`,i):{code:A.invariantViolatedBehavior,text:`Invariant ${i} is violated.`},"property-violation":s,"liveness-violation":a===void 0?o?lo(`liveness-violation`,i):{code:A.actionPropertyViolatedBehavior,text:`Action property ${i} is violated.`}:s,"postcondition-violation":{code:t.postcondition?.code??A.general,text:t.message??`Postcondition ${i} is false.`}}[e],l=e===`property-violation`,u=a!==void 0&&!l,d=l||u,f=d&&n.version!==`1.7.4`;if(f&&uo(n,t.trace[0]?.output),t.counts&&console.log(t.counts),c){let e=o?`${c.text}\n${ae(t.trace[0].state)}`:c.text;r(c.code,N.error,e)}if(o||(d||uo(n,t.trace[0]?.output),fo(n,t.trace,d?po:void 0,d&&!f),uo(n,t.traceOutput)),u){let e=t.loopLabel;a===t.trace.length-1?r(A.statePrint3,N.state,`${a+2}: Stuttering`):n.isTool?r(A.backToState,N.state,`${a+1}: Back to state${e?`: <${e}>\n`:``}`):console.log(`Back to state ${a+1}${e?`: <${e}>\n`:``}`)}t.warning&&n.version!==`1.7.4`&&r(t.warning.code,N.warning,t.warning.text);let p=t.unwitnessed??(e===`postcondition-violation`?void 0:t.postcondition);return p?.counts&&console.log(p.counts),p&&r(p.code,N.error,p.message),!o&&e!==`assumption-violation`},Co=(e,t)=>e.print(A.nestedExpression,N.error,`The error occurred when TLC was evaluating the nested\nexpressions at the following positions:\n${go(t)}`),wo=(e,t,n)=>{let r=t.print;if(e.failure){let n=e.failure,o=t.isTool?n.toolMessage:n.message,c=()=>{let e=n.fingerprint;if(e){let i=n.callStack?.length&&t.version!==`1.7.4`?go(n.callStack):ho(e.sources);r(A.fingerprintFailed,N.error,`TLC was unable to fingerprint.\n\nFingerprint Stack Trace:\n${i}\nReason:\n${re(e.reason,t.isTool)}`)}else n.callStack&&Co(t,n.callStack)};n.isCallStackFirst&&c();let l=n.initialState&&(()=>{try{return`While working on the initial state:\n${ae(n.initialState)}`}catch(e){throw e instanceof d?i(new d(`${a}${e.message}`),s.error):e}})();r(l?A.initialState:n.code,N.error,l?`${o}\n${l}`:o),uo(t,n.trace[0]?.output),fo(t,n.trace);let u=n.traceFailure;u&&r(u.code,N.error,t.isTool?u.toolMessage:u.message),uo(t,n.traceOutput);let f=n.postcondition;f?.counts&&console.log(f.counts),f&&r(f.code,N.error,f.message),n.isCallStackFirst||c()}else if(e.violation){if(!So(e.status,e.violation,t))return;let n=e.additionalViolation;n&&So(`property-violation`,n,t),e.liveCallStack&&Co(t,e.liveCallStack)}else{xo(t,n);let i=k(e.distinctStates,e.generatedStates),a=e.fingerprintDistance===void 0?[]:[` based on the actual fingerprints: val = ${j(ce(e.fingerprintDistance))}`];r(A.success,N.none,[`Model checking completed. No error has been found.`,` Estimates of the probability that TLC did not check all reachable states`,` because two distinct states had the same fingerprint:`,` calculated (optimistic): val = ${j(i)}`,...a].join(`
|
|
39
|
+
`))}if(e.failure?.isWithoutStatistics)return;e.status!==`success`&&xo(t,n),t.isTool&&vo(t,e,n.startTime),r(A.stats,N.none,`${e.generatedStates} states generated, ${e.distinctStates} distinct states found, ${e.queuedStates} states left on queue.`);let o=t.version===`1.7.4`,c=o?e.outDegrees??e.violationOutDegrees:e.outDegrees;(!o||c)&&r(A.searchDepth,N.none,`The depth of the complete state graph search is ${o?Math.max(e.depth,1):e.depth}.`);let l=c&&M(c);l&&r(A.stateGraphOutdegree,N.none,l)},To=e=>v([e]).toString(),Eo=(e,t,n,r,i)=>{let a=n.temporaryDirectory??Ge(),o=F(a)?Ie(a):Ae(a),s=ke(o,`tlc-${To(Ae(e))}`),c=st(n);return(n,a)=>{let l=`${n}.tla`;if(a===`file`)return Ie(Qe(t,n)??e);if(i===`1.7.4`)return ke(o,l);if(a===`root file`){let t=r===void 0?o:Ae(r),i=Ie(e);return`${ke(t,To(`${i} ${n}`),l)} (${i})`}let u=ke(s,l);return c===void 0?u:`${u} (${tt(c)}${l})`}},Do=e=>e.print(A.version,N.none,`TLC2 Version ${ct} (rev: tla-ts)`),Oo=(e,t)=>(Do(e),e.print(A.commandLineError,N.error,`${t}\nUsage: java tlc2.TLC [-help] [-option] inputfile`),1),ko=(e,t,n)=>e.print(A.modelChecking,N.none,`Running breadth-first search Model-Checking with fp 0 and seed ${BigInt(t)} with ${n} worker${n===1?``:`s`} on ${Ue()} cores with ${Math.floor(qe().heap_size_limit/1024/1024)}MB heap and 0MB offheap memory [pid: ${process.pid}] (${Ke()} ${We()} ${He()}, Node.js ${process.versions.node} ${process.arch.endsWith(`64`)?64:32}bit, MemFPSet, MemStateQueue).`),Ao=(e,t)=>{let n=[...e.unknown,...e.options.map(e=>e.name)],r=(e,t=e)=>n.some(n=>n===e||n.toLowerCase()===t.toLowerCase()),i=r(`-generateSpecTE`)||!r(`-noGenerateSpecTE`,`-noTE`)&&!r(`-tool`)&&!r(`-continue`);return t!==`1.7.4`&&i&&!r(`-noGenerateSpecTEBin`,`-noTEBin`)},jo=async(e,n,i,a)=>{let l=n.has(`-seed`)?n.get(`-seed`)?.[0]:`0`;if(l===void 0)return Oo(a,`Error: seed required.`);if(!ro(l))return Oo(a,`Error: An integer for seed required. But encountered ${l}`);let u=n.has(`-lncheck`)?n.get(`-lncheck`)?.[0]?.toLowerCase():`default`;if(u===void 0)return Oo(a,`Error: expect a strategy such as final for -lncheck option.`);let d=n.get(`-dump`);if(d?.length===0)return Oo(a,`Error: A file name for dumping states required.`);let p=d?.length===2&&ao.find(e=>d[0].toLowerCase().includes(e));if(p)return console.error(`Error: tla-ts does not support the -dump format ${p}.`),1;let h=n.get(`-fp`)?.[0];if(h!==void 0&&Number(h)!==0)return console.error(`Error: tla-ts fingerprints states as TLC does with -fp 0, not -fp ${h}.`),1;let g=io(n.get(`-workers`)),_=a.version;Do(a),ko(a,l,g);let v=n.get(`-config`)?.[0]??(n.has(`-config`)?void 0:e.replace(/\.tla$/,`.cfg`));if(!v||!F(v))return a.print(A.configFileError,N.error,`TLC encountered the following error when trying to read the configuration file ${v??``}:\nFile not found.`),s.configParseError;let y=Te(e,`.tla`),x={startTime:Date.now(),livenessStartTime:void 0,isParsed:!1},S=()=>{let e=Date.now()-x.startTime;a.print(A.finished,N.none,`Finished in ${a.isTool?`${e}ms`:le(e)} at (${O(/* @__PURE__ */ new Date)})`)},ee=()=>a.print(A.parsingFailed,N.error,`Parsing or semantic analysis failed.`),T=e=>(e instanceof r?ee():nt(e,a),S(),t(e)),E=(()=>{try{return ge(Ne(v,`utf8`),_)}catch(e){if(!(e instanceof m))throw e;return e}})();if(E instanceof m&&_===`1.7.4`)return a.print(A.general,N.error,`${c(`tlc2.tool.ConfigFileException`)}${re(E.message,a.isTool)}`),S(),s.error;if(E instanceof m)return T(E);n.has(`-deadlock`)&&(E.checkDeadlock=!1);let D=De(e),te=[D,...i.libraries],ne=$e(te),k=Ao(n,_);a.isTool&&a.print(A.startingSany,N.none,`Starting SANY...`);let ie=Oe(e),ae=ie?y:e.replace(/\.tla$/,``),j=st(i),oe=_===`1.7.4`?Po(e,i,j):void 0;if(oe?!F(e)&&!C.has(y)&&oe(`${y}.tla`):!F(e)&&!w.has(y)&&et(ie?D:process.cwd(),ie?`${y}.tla`:`./${ae}.tla`,[...ie||D===`.`?[]:[D],...i.libraries]),to(e,oe?ot(ne,oe):ne,{fileName:ae,describeFile:Eo(e,te,i,n.get(`-metadir`)?.[0],_),version:_,rootExtendees:k?[`_TLCTrace`]:void 0,onPrint:e=>process.stdout.write(e),onPrintError:e=>process.stderr.write(e)}).isFailed)return bo(a,{kind:`parsed`},x,D),ee(),S(),s.specParseError;try{let t=Ne(e,`utf8`),r=b(t).name;if(r!==y)throw new o(`File name '${y}' does not match the name '${r}' of the top level module it contains.`,void 0);let i=await ve({workers:g,livenessCheck:[`final`,`seqfinal`,`off`].includes(u)?`final`:`default`,seed:BigInt(l),dump:d&&so(d),isTool:a.isTool,isTraceRecorded:k,isSanyReported:!0,isWarningEnabled:!n.has(`-nowarning`),version:_,onProgress:e=>bo(a,e,x,D),source:t,config:E,onPause:()=>Pe(0,Buffer.alloc(1)),loadModule:ne,loadClass:e=>{let t=yo(D,e);return F(t)?Ne(t):void 0},readFile:e=>F(e)?Ne(e,`utf8`):void 0,writeFile:(e,t)=>{Me(De(Ae(e)),{recursive:!0}),Be(e,t)}});return wo(i,a,x),S(),i.failure?.exitCode??no[i.status]}catch(e){if(!(e instanceof f))throw e;return e instanceof r&&console.log(Mo(e,y)),x.isParsed||bo(a,{kind:`parsed`},x,D),T(e)}},Mo=(e,t)=>{let n=e instanceof o;if(!n&&!e.failure)return`Semantic errors:\n\n*** Errors: 1\n\n${e.message}\n\n`;let r=n?e.location===void 0?`Unknown location\n\n${e.message}`:`In module ${e.location}\n\n${e.message}`:`In module ${t}\n\nCould not parse module ${t} from file ${t}.tla`;return`${e.failure?`***Parse Error***\n${e.message}\n\n`:``}\nFatal errors while parsing TLA+ spec in file ${t}\n\n${r}\n*** Errors: 1\n\n${r}\n\n\n`},No=async(e,t)=>{let n=jt.parse(e),r=Ze(n.positionals),i=n.has(`-config`),a=r.map(e=>({...e,path:e.isGlobbed||/\.(tla|cfg)$/.test(e.path)?e.path.replace(/\.cfg$/,`.tla`):`${e.path}.tla`})).filter(e=>e.path.endsWith(`.tla`)&&(!e.isGlobbed||i||F(e.path.replace(/\.tla$/,`.cfg`)))).map(e=>e.path);if(a.length===0)return console.error(Nt),1;if(i&&a.length>1)return console.error(`Error: -config applies to one specification, but several were given.`),1;let o=[...new Set(a.map(e=>F(e)||Oe(e)?e:t.libraries.map(t=>ke(t,e)).find(F)??e))],c=[];for(let[e,r]of o.entries()){e>0&&console.log(``),o.length>1&&console.log(`Checking ${Te(r)} with ${Te(r,`.tla`)}.cfg`);let i=oe(n.has(`-tool`),!n.has(`-nowarning`),t.tlcVersion??`master`);c.push(await rt(()=>jo(r,n,t,i),i))}return c.find(e=>e!==s.success)??s.success},Po=(e,t,n)=>{let r=e.slice(0,e.lastIndexOf(`/`)+1),i=(!Oe(e)&&r!==``?[r]:t.libraries).map(at),a=i.length>0?i[i.length-1]:Oe(e)?r:``;return e=>it(`${a}${e}`,i,n)},Fo={uncaughtException:1,argsParsingFailure:1,specParsingFailure:2,unrepresentableCharacter:7},Io=e=>`java.lang.IllegalArgumentException: unsupported kind: ${e} in xml export`,Z=(e,t=[])=>({tag:e,children:t}),Q=(e,t)=>({tag:e,text:String(t),children:[]}),Lo={"&":`&`,"<":`<`,">":`>`,"\r":` `},Ro=e=>e.replace(/[&<>\r]|[\u{10000}-\u{10FFFF}]/gu,e=>e.length===2?`&#${e.codePointAt(0)};`:Lo[e]),zo=/[^\t\n\r\u0020-\uD7FF\uE000-\uFFFD\u{10000}-\u{10FFFF}]/u,Bo=e=>{let t=(e.cdata??e.text)?.match(zo)?.[0];if(t!==void 0)return{tag:e.tag,character:t};for(let t of e.children){let e=Bo(t);if(e)return e}},Vo=(e,t,n,r)=>{let i=` `.repeat(t*n);if(e.cdata){let t=e.cdata.replaceAll(`]]>`,`]]]]><![CDATA[>`);r.push(`${i}<${e.tag}><![CDATA[${t}]]></${e.tag}>`)}else if(e.text)r.push(`${i}<${e.tag}>${Ro(e.text)}</${e.tag}>`);else if(e.children.length===0)r.push(`${i}<${e.tag}/>`);else{r.push(`${i}<${e.tag}>`);for(let i of e.children)Vo(i,t+1,n,r);r.push(`${i}</${e.tag}>`)}},Ho=e=>Z(`location`,[Z(`column`,[Q(`begin`,e.beginColumn),Q(`end`,e.endColumn)]),Z(`line`,[Q(`begin`,e.beginLine),Q(`end`,e.endLine)]),Q(`filename`,e.file)]),Uo=e=>{switch(e.kind){case`FormalParam`:return`FormalParamNodeRef`;case`OpDecl`:return`OpDeclNodeRef`;case`Module`:return`ModuleNodeRef`;case`Theorem`:return`TheoremNodeRef`;case`Assume`:return`AssumeNodeRef`;case`ThmOrAssumpDef`:return e.isTheorem?`TheoremDefRef`:`AssumeDefRef`;case`OpDef`:return e.defKind===`UserDefined`?`UserDefinedOpKindRef`:e.defKind===`BuiltIn`?`BuiltInKindRef`:`ModuleInstanceKindRef`}},$={main:{at:`xml.XMLExporter.main(XMLExporter.java:145)`},constant:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1228)`},variable:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1236)`},definition:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1244)`},topLevel:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1268)`},body:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1392)`,nullType:`ExprNode`,nullValue:`"this.body"`},param:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1397)`},builtInParam:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1413)`},theoremDefinitionBody:{at:`semantic.ThmOrAssumpDefNode.getSymbolElement(ThmOrAssumpDefNode.java:663)`,nullType:`LevelNode`,nullValue:`"this.body"`},theoremDefinition:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:439)`},theorem:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:444)`,nullType:`LevelNode`,nullValue:`the return value of "tla2sany.semantic.TheoremNode.getTheorem()"`},proof:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:447)`},assumeDefinition:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:249)`},assume:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:254)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeNode.getAssume()"`},operator:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1315)`},operand:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1326)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.operands[i]"`},unbound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1337)`},bound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1347)`},range:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1349)`,nullType:`ExprNode`,nullValue:`"this.ranges[i]"`},letBody:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:301)`,nullType:`ExprNode`,nullValue:`"this.body"`},letDefinition:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:303)`},labelBody:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:341)`,nullType:`LevelNode`,nullValue:`"this.body"`},labelParam:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:343)`},argument:{at:`semantic.OpArgNode.getLevelElement(OpArgNode.java:150)`},exceptObject:{at:`semantic.AtNode.getLevelElement(AtNode.java:180)`},exceptComponents:{at:`semantic.AtNode.getLevelElement(AtNode.java:181)`},substOperator:{at:`semantic.Subst.export(Subst.java:258)`},substExpression:{at:`semantic.Subst.export(Subst.java:259)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.expr"`},instanceSubst:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:447)`},instanceParam:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:452)`},useFact:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:175)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},useDefinition:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:176)`},newDeclaration:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:202)`},newSet:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:204)`},assumption:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:404)`,nullType:`SemanticNode`,nullValue:`"assumes[i]"`},goal:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:406)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeProveNode.getProve()"`},byFact:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:154)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},byDefinition:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:155)`},step:{at:`semantic.NonLeafProofNode.getLevelElement(NonLeafProofNode.java:228)`,nullType:`LevelNode`,nullValue:`"this.steps[i]"`},defStep:{at:`semantic.DefStepNode.getLevelElement(DefStepNode.java:99)`}},Wo={SubstIn:{subst:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:530)`},body:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:533)`,nullType:`ExprNode`,nullValue:`"this.body"`},from:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:536)`},to:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:540)`}},APSubstIn:{subst:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:460)`},body:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:463)`,nullType:`LevelNode`,nullValue:`"this.body"`},from:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:466)`},to:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:470)`}}},Go={at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1424)`},Ko=Br(`--TLA+ BUILTINS--`),qo=(e,t)=>{let[n,r,i]=e===`Theorem`?[`TheoremNode.export(TheoremNode.java:456)`,70,`TheoremNode.exportDefinition(TheoremNode.java:404)`]:e===`Assume`?[`AssumeNode.export(AssumeNode.java:263)`,80,`AssumeNode.exportDefinition(AssumeNode.java:207)`]:[e===`ThmOrAssumpDef`?`ThmOrAssumpDefNode.export(ThmOrAssumpDefNode.java:671)`:`SymbolNode.export(SymbolNode.java:177)`,60,`SymbolNode.exportDefinition(SymbolNode.java:138)`];return[{at:`semantic.${n}`},{at:`xml.SymbolContext.put(SymbolContext.java:${r})`},{at:`semantic.${i}`,failedFor:t}]},Jo=(e,t=16)=>e>t*.75?Jo(e,t*2):t,Yo=(e,t)=>(e^e>>>16)&t-1,Xo=e=>{let t=e.split(/\r?\n/);for(;t.at(-1)===``;)t.pop();return t},Zo=e=>e.replace(/^[\0-\x20]+|[\0-\x20]+$/g,``),Qo=/[\t-\r\x1C-\x20\u1680\u2000-\u2006\u2008-\u200A\u2028\u2029\u205F\u3000]+$/,$o=e=>{let t=e.indexOf(`(**`),n=e.lastIndexOf(`**)`);if(t<0||n<=t)return e;let r=Xo(e),i=r.findIndex(e=>e.includes(`(**`)),a=r.findLastIndex(e=>e.includes(`**)`));return i<0||i>=a?e:r.slice(i+1,a).map(e=>{let t=e.indexOf(`(*`),n=e.indexOf(`*)`);return t<0||n<=t?e:e.slice(t+3,Math.max(t+3,n)).replace(Qo,``)}).join(`
|
|
40
|
+
`)},es=e=>{let t=Xo(e),n=e=>Zo(e).startsWith(`\\*`);return t.filter(n).length<Math.floor(t.length/2)?e:t.map(e=>{if(!n(e))return e;let t=e.indexOf(`\\*`)+2;return e.slice(e[t]===` `?t+1:t)}).join(`
|
|
41
|
+
`)},ts=(e,t,n)=>{let r=n.version===`1.7.4`,a=/* @__PURE__ */ new Set,o=/* @__PURE__ */ new Map,s={isSet:!1},c=[],l=(e,t)=>{if(!r)return t();c.push(...e);let n=t();return c.length-=e.length,n},d=(e,t)=>{let n=[...c,...t].reverse(),r=[e,...n.map(e=>`\tat tla2sany.${e.at}`)].join(`
|
|
42
|
+
`),a=n.filter(e=>e.failedFor!==void 0).map(e=>`failed for node.toString(): ${e.failedFor}\n with error \n${r}\n`).join(``);return i(new u(r,a),Fo.uncaughtException)},f=e=>d(`java.lang.NullPointerException: Cannot invoke "tla2sany.semantic.${e.nullType}.export(org.w3c.dom.Document, tla2sany.xml.SymbolContext)" because ${e.nullValue} is null`,[e]),m=(e,t)=>(a.has(e.id)||(a.add(e.id),o.set(e.id,l([...t?[t]:[],...qo(e.kind,Br(e.location))],()=>v(e)))),Z(Uo(e),[Q(`UID`,e.id)])),h=(e,t,n)=>{let r=t.levelChecked===0?[]:[Q(`level`,t.level)],i=n?[Ho(n),...r]:r;return{...e,children:[...i,...e.children]}},g=(e,t,n)=>Z(`params`,e.map((e,r)=>Z(`leibnizparam`,[m(e,n),...t?.[r]?[Z(`leibniz`)]:[]]))),_=e=>{let t=e.map(e=>e.trimEnd()).filter(e=>e.length>0).join(`
|
|
43
|
+
`),r=n.isUncommented?es($o(t)):t;return e.length>0?[{tag:`pre-comments`,cdata:r,children:[]}]:[]},v=e=>{switch(e.kind){case`FormalParam`:return h(Z(`FormalParamNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity)]),e,e.location);case`OpDecl`:return h(Z(`OpDeclNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Q(`kind`,e.declKind)]),e,e.location);case`OpDef`:{if(e.defKind===`NumberedProofStep`)throw r?d(Io(37),[Go]):i(new p(Io(37)),Fo.uncaughtException);if(e.defKind===`ModuleInstance`)return h(Z(`ModuleInstanceKind`,[Q(`uniquename`,e.name),...e.isLocal&&!r?[Z(`local`)]:[]]),e,e.location);let t=e.params??[];if(e.defKind===`BuiltIn`)return h(Z(`BuiltInKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),...e.params?[g(t,e.isLeibnizArg,$.builtInParam)]:[]]),e,e.location);let n=e.body,a=e.module;if(n===void 0&&r)throw f($.body);if(n===void 0||a===void 0)throw Error(`The definition of ${e.name} has no body`);return h(r?Z(`UserDefinedOpKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Z(`body`,[C(n,$.body)]),...e.params?[g(t,e.isLeibnizArg,$.param)]:[],...e.inRecursive?[Z(`recursive`)]:[]]):Z(`UserDefinedOpKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Z(`originalOperator`,[m(e.source??e)]),Z(`originallyDefinedInModule`,[m(a)]),Z(`body`,[C(n,$.body)]),g(t,e.isLeibnizArg,$.param),..._(e.preComments),...e.inRecursive?[Z(`recursive`)]:[],...e.recursiveSection>=0?[Q(`recursiveSection`,e.recursiveSection)]:[],...e.isLocal?[Z(`local`)]:[]]),e,e.location)}case`ThmOrAssumpDef`:return h(Z(e.isTheorem?`TheoremDefNode`:`AssumeDef`,[Q(`uniquename`,e.name),C(e.body,$.theoremDefinitionBody)]),e,e.location);case`Module`:return Z(`ModuleNode`,[Ho(e.location),...y(e)]);case`Theorem`:return h(Z(`TheoremNode`,[...e.definition?[Z(`definition`,[m(e.definition,$.theoremDefinition)])]:[],Z(`body`,[C(e.body,$.theorem)]),...e.proof?[C(e.proof,$.proof)]:[],...e.isSuffices?[Z(`suffices`)]:[]]),e,e.location);case`Assume`:return Z(`AssumeNode`,[Ho(e.location),...e.body.levelChecked===0?[]:[Q(`level`,e.body.level)],...e.definition?[Z(`definition`,[m(e.definition,$.assumeDefinition)])]:[],Z(`body`,[C(e.body,$.assume)])])}},y=e=>{let t=t=>!n.isRestricted||t.module===e;return[Q(`uniquename`,e.name),...r?[]:[Z(`extends`,[...new Set(e.extendees.map(e=>e.name))].toSorted().map(e=>Q(`uniquename`,e)))],...ni(e,2).filter(t).map(e=>m(e,$.constant)),...ni(e,3).filter(t).map(e=>m(e,$.variable)),...ti(e).filter(t).map(e=>m(e,$.definition)),...e.topLevel.map(e=>e.kind===`Instance`||e.kind===`UseOrHide`?C(e,$.topLevel):m(e,$.topLevel)),...e.definitions.filter(e=>!r&&e.kind===`Module`).map(e=>m(e))]},b=(e,t)=>l([t],()=>Z(`Subst`,[m(e.op,$.substOperator),C(e.expr,$.substExpression)])),x=e=>{if(e.isNull&&r)throw d(Io(0),[$.operator,...qo(`OpDef`,Ko),Go]);let t=e.operands[e.operands.length-1];e.operator.name===`$Case`&&e.operands.length>1&&t?.kind===`OpAppl`&&t.operator.name===`$Pair`&&t.operands[0]===void 0&&(s.isSet=!0);let n=m(e.operator,$.operator),i=e.operands.map((e,t)=>e===void 0||t===0&&s.isSet&&Vr(e)?r?Q(`StringNode`,`$Other`):Z(`StringNode`,[Q(`StringValue`,`$Other`)]):C(e,$.operand)),a=e.tupleOrs,o=e.unbounded===void 0&&e.bounded===void 0?[]:[Z(`boundSymbols`,[...(e.unbounded??[]).map((e,t)=>Z(`unbound`,[m(e,$.unbound),...a?.[t]?[Z(`tuple`)]:[]])),...(e.bounded??[]).map((t,n)=>Z(`bound`,[...t.map(e=>m(e,$.bound)),...a?.[n]?[Z(`tuple`)]:[],C(e.ranges[n],$.range)]))])];return Z(`OpApplNode`,[Z(`operator`,[n]),Z(`operands`,i),...o])},S=(e,t)=>e.kind===`Module`||e.kind===`OpDef`?m(e,t):C(e,t),C=(e,t)=>{if(!r)return w(e);if(e.kind===`OpAppl`&&e.isAbsent&&`nullType`in t)throw f(t);let n=[t,{at:`semantic.SemanticNode.export(SemanticNode.java:379)`,failedFor:Br(e.location)},{at:`semantic.LevelNode.getSemanticElement(LevelNode.java:333)`}];return l(n,()=>w(e))},w=e=>{switch(e.kind){case`OpAppl`:return h(x(e),e,e.location);case`Numeral`:return h(Z(`NumeralNode`,[Q(`IntValue`,e.value)]),e,e.location);case`String`:return h(Z(`StringNode`,[Q(`StringValue`,e.value)]),e,e.location);case`Decimal`:return h(Z(`DecimalNode`,[Q(`mantissa`,e.mantissa),Q(`exponent`,e.exponent),...r?[]:[Q(`integralPart`,e.integralPart),Q(`fractionalPart`,e.fractionalPart)]]),e,e.location);case`LetIn`:{let t=C(e.body,$.letBody);return h(Z(`LetInNode`,[Z(`body`,[t]),Z(`opDefs`,e.opDefs.map(e=>m(e,$.letDefinition)))]),e,e.location)}case`Label`:return h(Z(`LabelNode`,[Q(`uniquename`,e.name),Q(`arity`,e.params.length),Z(`body`,[C(e.body,$.labelBody)]),Z(`params`,e.params.map(e=>m(e,$.labelParam)))]),e,e.location);case`OpArg`:return h(Z(`OpArgNode`,[Z(`argument`,[m(e.op,$.argument)])]),e,e.location);case`At`:{let t=e.except.operands[0],n=e.component.operands[0];if(t===void 0||n===void 0)throw Error(`An @ refers to an incomplete EXCEPT`);return h(Z(`AtNode`,[C(t,$.exceptObject),C(n,$.exceptComponents)]),e,e.location)}case`SubstIn`:case`APSubstIn`:{let t=Wo[e.kind],n=e.substs.map(e=>b(e,t.subst)),r=C(e.body,t.body);return h(Z(e.kind===`SubstIn`?`SubstInNode`:`APSubstInNode`,[Z(`substs`,n),Z(`body`,[r]),Z(`instFrom`,[m(e.instantiatingModule,t.from)]),Z(`instTo`,[m(e.instantiatedModule,t.to)])]),e,e.location)}case`Instance`:{let t=e.substs.map(e=>b(e,$.instanceSubst)),n=e.params.map(e=>m(e,$.instanceParam));return Z(`InstanceNode`,[Ho(e.location),Q(`level`,0),...e.name===void 0?[]:[Q(`uniquename`,e.name)],Q(`module`,e.module.name),Z(`substs`,t),Z(`params`,n),...e.isLocal&&!r?[Z(`local`)]:[]])}case`UseOrHide`:return h(Z(`UseOrHideNode`,[Z(`facts`,e.facts.map(e=>S(e,$.useFact))),Z(`defs`,e.defs.map(e=>m(e,$.useDefinition))),...e.isOnly?[Z(`only`)]:[],...e.isHide?[Z(`hide`)]:[]]),e,e.location);case`NewSymb`:return h(Z(`NewSymbNode`,[m(e.declaration,$.newDeclaration),...e.set&&!(r&&Vr(e.set))?[C(e.set,$.newSet)]:[]]),e,e.location);case`AssumeProve`:return h(Z(`AssumeProveNode`,[Z(`assumes`,e.assumptions.map(e=>C(e,$.assumption))),Z(`prove`,[C(e.goal,$.goal)]),...e.isSuffices?[Z(`suffices`)]:[],...e.isBoxed?[Z(`boxed`)]:[]]),e,e.location);case`LeafProof`:{let t=e.facts.length===0&&e.defs.length===0,n=e.isOmitted?Z(`omitted`):t?Z(`obvious`):Z(`by`,[Z(`facts`,e.facts.map(e=>S(e,$.byFact))),Z(`defs`,e.defs.map(e=>m(e,$.byDefinition))),...e.isOnly?[Z(`only`)]:[]]);return h(n,e,e.location)}case`NonLeafProof`:return h(Z(`steps`,[...r?[]:[Q(`proofLevel`,e.proofLevel)],...e.steps.map(e=>e.kind===`Theorem`?m(e,$.step):C(e,$.step))]),e,e.location);case`DefStep`:return h(Z(`DefStepNode`,e.defs.map(e=>m(e,$.defStep))),e,e.location)}},ee=(n.isRestricted?[t]:e).map(e=>m(e,$.main)),T=Jo(o.size),E=Z(`context`,[...o.entries()].toSorted(([e],[t])=>Yo(e,T)-Yo(t,T)).map(([e,t])=>Z(`entry`,[Q(`UID`,e),t])));return Z(`modules`,[Q(`RootModule`,t.name),E,...ee])},ns=(e,t={version:`master`,isRestricted:!1,isUncommented:!1,isTerse:!1})=>{let n=ts(e.modules,e.root,t),r=Bo(n);if(r){let e=r.character.codePointAt(0)??0;throw i(new p(`The spec contains the character U+${e.toString(16).toUpperCase().padStart(4,`0`)} in the ${r.tag} element. XML 1.0 cannot represent that character in character data, not even as a numeric character reference, so the spec cannot be exported until the character is removed from it.`),Fo.unrepresentableCharacter)}let a=[`<?xml version="1.0" encoding="UTF-8" standalone="no"?>`];return Vo(n,0,t.isTerse?0:2,a),t.isTerse?a.join(``):`${a.join(`
|
|
44
|
+
`)}\n`},rs=(()=>{let e=e=>`\x1b[1m${e}\x1b[0m`,t=[[`-I`,`Include; use given directory path to resolve module dependencies.`],[`-help`,`Print this usage information.`],[`-o`,`Offline mode; skip XML schema validation step.`],[`-r`,`Restrict mode; include only declarations and definitions of the specified module, excluding extended or instantiated modules.`],[`-t`,`Terse; format XML output without tabs or newlines.`],[`-u`,`Uncomment; process boxed comments and single-line comments (\\*) in pre-comments to extract their content.`]],n=[`Only one root TLA+ file can be parsed per run.`,`Multiple directory search paths can be given by providing multiple -I arguments.`,`XML schema validation does not require network access.`];return[``,e(`NAME`),``,` tla2sany.xml.XMLExporter - Emit SANY's parse tree as XML - Version 2.2 created 08 July 2020`,``,``,e(`SYNOPSIS`),``,`\t${e(`tla2sany.xml.XMLExporter`)} [${e(`-Iortu`)}] [${e(`-help`)}] FILE`,``,e(`DESCRIPTION`),``,` Given a TLA+ file, parse that file with SANY then translate the module's semantic parse tree to XML, including all the modules depended on. The XML is printed to stdout and its output format is given by an XML Schema file (.xsd) found at https://proofs.tlapl.us/doc/web/sany.xsd.`,``,e(`OPTIONS`),``,...t.map(([t,n])=>`\t${e(t)}\n\t\t${n}`),``,e(`TIPS`),``,...n.flatMap(e=>[`\t${e}`,``]),``].join(`
|
|
45
|
+
`)})(),is=e=>(process.stderr.write(`ERROR: ${e}\n${rs}`),Fo.argsParsingFailure),as=(e,n)=>{try{return process.stdout.write(ns(e,n)),s.success}catch(e){if(!(e instanceof p))throw e;let n=t(e),r=e instanceof u?e.unwound:``;return console.error(n===Fo.uncaughtException?`${r}Exception in thread "main" ${e.message}`:`ERROR: ${e.message}`),n}},os=(e,t)=>{let n={flags:/* @__PURE__ */ new Set,includes:[],error:void 0},r={index:-1};for(let i=0;i<e.length-1;i++)if(t.has(e[i]))n.flags.add(e[i]),r.index=i;else if(e[i]===`-I`){if(i++,i>e.length-2)return{...n,error:`missing-include`};n.includes.push(e[i]),r.index=i}return r.index===e.length-2?n:{...n,error:`several-files`}},ss=e=>{if(e.length===0)return is(`at least one .tla file must be given`);let t=os(e,/* @__PURE__ */ new Set([`-o`,`-t`,`-r`,`-u`]));if(t.error===`missing-include`)return is(`the -I flag must be followed by a directory and at least one .tla file`);if(t.error===`several-files`)return is(`Only one TLA file to check allowed!`);let n=e[e.length-1];if(n===`-help`)return process.stdout.write(rs),s.success;let r=n.endsWith(`.tla`)?n:`${n}.tla`,i=[`.`,...t.includes],a=i.map(e=>Ae(e,r)).find(F);a===void 0&&!w.has(r.slice(0,-4))&&et(process.cwd(),`./${r}`,t.includes);let o=to(a??r,$e(i),{fileName:n,isXmlExport:!0});return process.stderr.write(o.text),o.isFailed||o.specification===void 0?(console.error(`ERROR: Failed to parse module.`),Fo.specParsingFailure):as(o.specification,{version:`master`,isRestricted:t.flags.has(`-r`),isUncommented:t.flags.has(`-u`),isTerse:t.flags.has(`-t`)})},cs=(e,t)=>(console.error(`Exception in thread "main" ${e}\n\tat tla2sany.xml.XMLExporter.main(XMLExporter.java:${t})`),Fo.uncaughtException),ls=(e,t)=>{if(e.length===0)return cs(`java.lang.IllegalArgumentException: at least one .tla file must be given`,59);let n=os(e,/* @__PURE__ */ new Set([`-o`]));if(n.error===`missing-include`)return cs(`java.lang.IllegalArgumentException: the -I flag must be followed by a directory and at least one .tla file`,71);if(n.error===`several-files`)return cs(`java.lang.IllegalArgumentException: Only one TLA file to check allowed!`,83);let r=e[e.length-1],i=`${r.replace(/\.tla$/i,``)}.tla`,a=(n.includes.length===0?[`/`]:n.includes).map(at),o=[`.`,...a],c=e=>it(`${a[a.length-1]}${e}`,a,t),l=o.map(e=>Ae(e,i)).find(F);if(l===void 0&&!C.has(Te(i,`.tla`)))return c(i),s.success;let u=to(l??i,ot($e(o),c),{fileName:r,isXmlExport:!0,version:`1.7.4`});return process.stderr.write(u.text),u.specification===void 0?cs(`tla2sany.xml.XMLExportingException: spec ${(l&&eo(Ne(l,`utf8`),`1.7.4`))??`null`} is malformed - does not have a root module`,110):as(u.specification,{version:`1.7.4`,isRestricted:!1,isUncommented:!1,isTerse:!0})},us=[`tlc2.TLC`,`tla2sany.xml.XMLExporter`],ds=e=>{let t={libraries:[]};for(let n=0;n<e.length;n++){let r=e[n];if(r===`-cp`||r===`-classpath`||r===`--class-path`)n++,t.classPath=e[n];else if(r===`-jar`)return t.classPath=e[n+1],{mainClass:`tlc2.TLC`,args:e.slice(n+2),java:t};else if(r.startsWith(`-DTLA-Library=`))t.libraries.push(...r.slice(14).split(Ee));else if(r.startsWith(`-Djava.io.tmpdir=`))t.temporaryDirectory=r.slice(17);else if(r.startsWith(`-Dtla-ts.tlc=`))t.tlcVersion=r.slice(13)===`1.7.4`?`1.7.4`:`master`;else if(!r.startsWith(`-D`)&&!r.startsWith(`-X`))return n>0||us.includes(r)?{mainClass:r,args:e.slice(n+1),java:t}:void 0}},fs=async e=>{if(e[0]===`tlapm`)return rt(()=>Kt(e.slice(1)));let t=ds(e);return t===void 0?No(e,{libraries:[]}):(t.java.tlcVersion??=await Ye(st(t.java)),t.mainClass===`tlc2.TLC`?No(t.args,t.java):t.mainClass===`tla2sany.xml.XMLExporter`?rt(()=>t.java.tlcVersion===`1.7.4`?ls(t.args,st(t.java)):ss(t.args)):(console.error(`Error: tla-ts runs the Java classes ${us.join(` and `)}, not ${t.mainClass}.`),1))},ps=async()=>{process.exitCode=await fs(process.argv.slice(2))};export{ps as runCli};
|
package/dist/tlapm.cjs
CHANGED
|
@@ -6,5 +6,5 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
|
|
10
|
-
`).slice(1).flatMap(e=>{let t=e.indexOf(`@!!END`);if(t===-1)return[];let n=/* @__PURE__ */ new Map;return e.slice(0,t).split(/\n(?=@!!)/).forEach(e=>{let t=e.indexOf(`:`);n.set(e.slice(3,t),e.slice(t+1).replace(/\n$/,``))}),[n]}),
|
|
9
|
+
var e=Object.defineProperty,t=(t,n)=>{let r={};for(var i in t)e(r,i,{get:t[i],enumerable:!0});return n||e(r,Symbol.toStringTag,{value:`Module`}),r};const n=require("./worker.cjs");var r=/* @__PURE__ */ t({getTlapmPaths:()=>c,proveWithTlapm:()=>d});const i=process.getBuiltinModule(`node:child_process`),a=process.getBuiltinModule(`node:fs`),o=process.getBuiltinModule(`node:os`),s=process.getBuiltinModule(`node:path`),c=()=>(process.env.PATH??``).split(s.delimiter).map(e=>s.join(e,`tlapm`)).filter(e=>a.existsSync(e)),l=e=>e.split(`@!!BEGIN
|
|
10
|
+
`).slice(1).flatMap(e=>{let t=e.indexOf(`@!!END`);if(t===-1)return[];let n=/* @__PURE__ */ new Map;return e.slice(0,t).split(/\n(?=@!!)/).forEach(e=>{let t=e.indexOf(`:`);n.set(e.slice(3,t),e.slice(t+1).replace(/\n$/,``))}),[n]}),u=e=>{let t=e.get(`status`);if(t===`proved`)return{status:t,prover:e.get(`prover`)??``};if(t===`trivial`)return{status:t};if(t===`failed`||t===`interrupted`)return{status:`failed`,reason:e.get(`reason`)||t}},d=async(e,t,r)=>{let d=c()[0];if(d===void 0)throw new n.k(`The tlapm backend needs tlapm on your PATH.`);let f=a.mkdtempSync(s.join(o.tmpdir(),`tla-ts-`));t.forEach((e,t)=>a.writeFileSync(s.join(f,`${t}.tla`),e));let p=/* @__PURE__ */ new Map,m=i.spawn(d,[`--toolbox`,`0`,`0`,`--cache-dir`,s.join(f,`.tlacache`),`${e}.tla`],{cwd:f,stdio:[`ignore`,`ignore`,`pipe`]}),h=()=>m.kill();r.signal?.addEventListener(`abort`,h);let g={text:``,parsed:0};return m.stderr.on(`data`,e=>{g.text+=e.toString(`utf8`);let t=l(g.text);t.slice(g.parsed).forEach(e=>{let t=u(e),n=Number(e.get(`id`));e.get(`type`)===`obligation`&&t&&(p.set(n,t),r.onResult?.(n,t))}),g.parsed=t.length}),await new Promise(e=>m.on(`close`,e)),r.signal?.removeEventListener(`abort`,h),a.rmSync(f,{recursive:!0,force:!0}),r.signal?.throwIfAborted(),p};Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return r}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return c}});
|
package/dist/tlapm.js
CHANGED
|
@@ -6,5 +6,5 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
import{k as e}from"./worker.js";
|
|
10
|
-
`).slice(1).flatMap(e=>{let t=e.indexOf(`@!!END`);if(t===-1)return[];let n=/* @__PURE__ */ new Map;return e.slice(0,t).split(/\n(?=@!!)/).forEach(e=>{let t=e.indexOf(`:`);n.set(e.slice(3,t),e.slice(t+1).replace(/\n$/,``))}),[n]}),
|
|
9
|
+
import{k as e}from"./worker.js";var t=Object.defineProperty,n=/* @__PURE__ */ ((e,n)=>{let r={};for(var i in e)t(r,i,{get:e[i],enumerable:!0});return n||t(r,Symbol.toStringTag,{value:`Module`}),r})({getTlapmPaths:()=>s,proveWithTlapm:()=>u});const r=process.getBuiltinModule(`node:child_process`),i=process.getBuiltinModule(`node:fs`),a=process.getBuiltinModule(`node:os`),o=process.getBuiltinModule(`node:path`),s=()=>(process.env.PATH??``).split(o.delimiter).map(e=>o.join(e,`tlapm`)).filter(e=>i.existsSync(e)),c=e=>e.split(`@!!BEGIN
|
|
10
|
+
`).slice(1).flatMap(e=>{let t=e.indexOf(`@!!END`);if(t===-1)return[];let n=/* @__PURE__ */ new Map;return e.slice(0,t).split(/\n(?=@!!)/).forEach(e=>{let t=e.indexOf(`:`);n.set(e.slice(3,t),e.slice(t+1).replace(/\n$/,``))}),[n]}),l=e=>{let t=e.get(`status`);if(t===`proved`)return{status:t,prover:e.get(`prover`)??``};if(t===`trivial`)return{status:t};if(t===`failed`||t===`interrupted`)return{status:`failed`,reason:e.get(`reason`)||t}},u=async(t,n,u)=>{let d=s()[0];if(d===void 0)throw new e(`The tlapm backend needs tlapm on your PATH.`);let f=i.mkdtempSync(o.join(a.tmpdir(),`tla-ts-`));n.forEach((e,t)=>i.writeFileSync(o.join(f,`${t}.tla`),e));let p=/* @__PURE__ */ new Map,m=r.spawn(d,[`--toolbox`,`0`,`0`,`--cache-dir`,o.join(f,`.tlacache`),`${t}.tla`],{cwd:f,stdio:[`ignore`,`ignore`,`pipe`]}),h=()=>m.kill();u.signal?.addEventListener(`abort`,h);let g={text:``,parsed:0};return m.stderr.on(`data`,e=>{g.text+=e.toString(`utf8`);let t=c(g.text);t.slice(g.parsed).forEach(e=>{let t=l(e),n=Number(e.get(`id`));e.get(`type`)===`obligation`&&t&&(p.set(n,t),u.onResult?.(n,t))}),g.parsed=t.length}),await new Promise(e=>m.on(`close`,e)),u.signal?.removeEventListener(`abort`,h),i.rmSync(f,{recursive:!0,force:!0}),u.signal?.throwIfAborted(),p};export{n,s as t};
|