tla-ts 0.0.9-dev.8298a52 → 0.0.10-dev.28c823e4b
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +7 -0
- package/dist/compile.cjs +3 -3
- package/dist/compile.js +3 -3
- package/dist/deciders.cjs +28 -28
- package/dist/deciders.js +52 -52
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +105 -10
- package/dist/index.d.ts +105 -10
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +116 -36
- package/dist/prove.js +116 -36
- package/dist/run.cjs +143 -31
- package/dist/run.js +143 -31
- package/dist/tlapm.cjs +1 -1
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +129 -104
- package/dist/transfer.js +129 -104
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +4 -23
- package/src/bags.ts +99 -102
- package/src/builtins.ts +40 -78
- package/src/bundled-modules.ts +1 -8
- package/src/check.ts +564 -366
- package/src/cli/options.ts +10 -5
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -0
- package/src/cli/shared.ts +18 -11
- package/src/cli/tlapm.ts +0 -12
- package/src/cli/tlc-arguments.ts +640 -0
- package/src/cli/tlc-usage.ts +361 -0
- package/src/cli/tlc.ts +525 -216
- package/src/cli/typescript.ts +0 -3
- package/src/cli/xml-exporter.ts +4 -16
- package/src/cli.ts +0 -1
- package/src/codegen.ts +191 -64
- package/src/config.ts +140 -109
- package/src/coverage.ts +837 -0
- package/src/dependencies.ts +6 -40
- package/src/dfid.ts +618 -0
- package/src/environment.ts +237 -119
- package/src/errors.ts +56 -56
- package/src/evaluate.ts +543 -341
- package/src/exit-codes.ts +37 -3
- package/src/fingerprints.ts +10 -10
- package/src/index.ts +3 -0
- package/src/instances.ts +38 -31
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +255 -139
- package/src/levels.ts +8 -17
- package/src/lexer.ts +80 -100
- package/src/liveness-checker.ts +77 -117
- package/src/liveness.ts +106 -62
- package/src/obligations/action.ts +4 -28
- package/src/obligations/anonymize.ts +84 -80
- package/src/obligations/equality.ts +1 -1
- package/src/obligations/expression.ts +2 -19
- package/src/obligations/format.ts +1 -9
- package/src/obligations/generate.ts +1 -11
- package/src/obligations/index.ts +0 -11
- package/src/obligations/levels.ts +4 -8
- package/src/obligations/module.ts +1 -15
- package/src/obligations/normalize.ts +5 -24
- package/src/obligations/operators.ts +1 -2
- package/src/obligations/pragma.ts +1 -10
- package/src/obligations/printer.ts +47 -46
- package/src/obligations/proof.ts +1 -5
- package/src/obligations/regroup.ts +1 -4
- package/src/obligations/simplify.ts +3 -14
- package/src/obligations/source.ts +1 -21
- package/src/obligations/subexpression.ts +5 -11
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +8 -14
- package/src/obligations/tuples.ts +3 -9
- package/src/parallel-worker.ts +24 -33
- package/src/parallel.ts +48 -40
- package/src/parser.ts +565 -282
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +5 -10
- package/src/prover/deciders.ts +0 -4
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +0 -6
- package/src/prover/isabelle/encode.ts +11 -23
- package/src/prover/isabelle/isar/inner-syntax.ts +108 -114
- package/src/prover/isabelle/isar/method.ts +25 -38
- package/src/prover/isabelle/isar/proof.ts +1 -10
- package/src/prover/isabelle/isar/statement.ts +1 -6
- package/src/prover/isabelle/isar/theory.ts +15 -26
- package/src/prover/isabelle/isar/type-check.ts +11 -25
- package/src/prover/isabelle/provers/blast/blast.ts +10 -41
- package/src/prover/isabelle/provers/blast/branch.ts +1 -32
- package/src/prover/isabelle/provers/blast/prove.ts +1 -35
- package/src/prover/isabelle/provers/blast/rules.ts +6 -44
- package/src/prover/isabelle/provers/blast/state.ts +2 -28
- package/src/prover/isabelle/provers/blast/term.ts +9 -36
- package/src/prover/isabelle/provers/clasimp.ts +1 -13
- package/src/prover/isabelle/provers/classical.ts +14 -42
- package/src/prover/isabelle/provers/hypsubst.ts +11 -25
- package/src/prover/isabelle/pure/bicompose.ts +16 -13
- package/src/prover/isabelle/pure/consts.ts +1 -7
- package/src/prover/isabelle/pure/conv.ts +1 -9
- package/src/prover/isabelle/pure/drule.ts +24 -40
- package/src/prover/isabelle/pure/envir.ts +3 -52
- package/src/prover/isabelle/pure/goal.ts +1 -7
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +1 -14
- package/src/prover/isabelle/pure/name.ts +2 -9
- package/src/prover/isabelle/pure/net.ts +3 -59
- package/src/prover/isabelle/pure/object-logic.ts +3 -10
- package/src/prover/isabelle/pure/pattern.ts +2 -19
- package/src/prover/isabelle/pure/raw-simplifier.ts +13 -49
- package/src/prover/isabelle/pure/rewriter.ts +26 -58
- package/src/prover/isabelle/pure/search.ts +3 -10
- package/src/prover/isabelle/pure/seq.ts +1 -10
- package/src/prover/isabelle/pure/simplifier.ts +4 -12
- package/src/prover/isabelle/pure/table.ts +1 -31
- package/src/prover/isabelle/pure/tactic.ts +12 -22
- package/src/prover/isabelle/pure/tactical.ts +6 -12
- package/src/prover/isabelle/pure/term-ord.ts +2 -6
- package/src/prover/isabelle/pure/term.ts +2 -43
- package/src/prover/isabelle/pure/thm.ts +13 -36
- package/src/prover/isabelle/pure/type.ts +2 -15
- package/src/prover/isabelle/pure/unify.ts +20 -30
- package/src/prover/isabelle/pure/variable.ts +3 -7
- package/src/prover/isabelle/tla/classical-setup.ts +9 -19
- package/src/prover/isabelle/tla/context.ts +8 -16
- package/src/prover/isabelle/tla/logic.ts +4 -11
- package/src/prover/isabelle/tla/simpdata.ts +46 -34
- package/src/prover/isabelle/tools/intuitionistic.ts +1 -10
- package/src/prover/ocaml.ts +0 -6
- package/src/prover/prep/action.ts +4 -36
- package/src/prover/prep/enabled-axioms.ts +12 -19
- package/src/prover/prep/fingerprint.ts +0 -16
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +9 -36
- package/src/prover/prep/normalize.ts +4 -28
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +0 -36
- package/src/prover/ptl/decide.ts +7 -12
- package/src/prover/ptl/encode.ts +14 -36
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +12 -26
- package/src/prover/smt/axioms.ts +0 -7
- package/src/prover/smt/context.ts +19 -26
- package/src/prover/smt/data.ts +51 -54
- package/src/prover/smt/encode.ts +14 -35
- package/src/prover/smt/extensionality.ts +0 -10
- package/src/prover/smt/flatten.ts +3 -22
- package/src/prover/smt/format.ts +5 -10
- package/src/prover/smt/instances.ts +0 -10
- package/src/prover/smt/rewrite.ts +66 -101
- package/src/prover/smt/solver/act-cache.ts +0 -15
- package/src/prover/smt/solver/arith-rewriter.ts +3 -48
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +1 -43
- package/src/prover/smt/solver/ast-lt.ts +1 -11
- package/src/prover/smt/solver/ast-util.ts +1 -6
- package/src/prover/smt/solver/ast.ts +1 -143
- package/src/prover/smt/solver/auf-solver.ts +6 -39
- package/src/prover/smt/solver/case-split-queue.ts +1 -9
- package/src/prover/smt/solver/cg-table.ts +1 -18
- package/src/prover/smt/solver/clause.ts +1 -27
- package/src/prover/smt/solver/conflict-resolution.ts +0 -9
- package/src/prover/smt/solver/context.ts +4 -61
- package/src/prover/smt/solver/ctx-simplify.ts +14 -41
- package/src/prover/smt/solver/der.ts +2 -21
- package/src/prover/smt/solver/dyn-ack.ts +1 -11
- package/src/prover/smt/solver/e-matching.ts +3 -34
- package/src/prover/smt/solver/enode.ts +1 -21
- package/src/prover/smt/solver/expr-ref.ts +1 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +0 -5
- package/src/prover/smt/solver/fingerprints.ts +1 -12
- package/src/prover/smt/solver/flat-literals.ts +1 -9
- package/src/prover/smt/solver/goal.ts +2 -14
- package/src/prover/smt/solver/hash.ts +0 -8
- package/src/prover/smt/solver/hashtable.ts +1 -12
- package/src/prover/smt/solver/internalizer.ts +6 -98
- package/src/prover/smt/solver/lbool.ts +1 -2
- package/src/prover/smt/solver/literal.ts +0 -3
- package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
- package/src/prover/smt/solver/lp/constraints.ts +2 -8
- package/src/prover/smt/solver/lp/containers.ts +12 -30
- package/src/prover/smt/solver/lp/core-solver.ts +10 -31
- package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
- package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
- package/src/prover/smt/solver/lp/dependency.ts +1 -4
- package/src/prover/smt/solver/lp/dioph-eq.ts +12 -98
- package/src/prover/smt/solver/lp/explanation.ts +1 -6
- package/src/prover/smt/solver/lp/gomory.ts +9 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
- package/src/prover/smt/solver/lp/hnf.ts +11 -26
- package/src/prover/smt/solver/lp/int-cube.ts +15 -36
- package/src/prover/smt/solver/lp/int-solver.ts +4 -34
- package/src/prover/smt/solver/lp/lar-solver.ts +32 -81
- package/src/prover/smt/solver/lp/lar-term.ts +1 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +20 -45
- package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
- package/src/prover/smt/solver/lp/nex.ts +1 -6
- package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
- package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
- package/src/prover/smt/solver/lp/nla-core.ts +35 -130
- package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
- package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +15 -69
- package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
- package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
- package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
- package/src/prover/smt/solver/lp/nla-order.ts +2 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
- package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
- package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
- package/src/prover/smt/solver/lp/nla-types.ts +1 -11
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
- package/src/prover/smt/solver/lp/nra-solver.ts +5 -52
- package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- package/src/prover/smt/solver/lp/random-updater.ts +1 -8
- package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
- package/src/prover/smt/solver/lp/union-find.ts +1 -6
- package/src/prover/smt/solver/mam-compiler.ts +14 -56
- package/src/prover/smt/solver/mam-interpreter.ts +1 -21
- package/src/prover/smt/solver/maximize-ac-sharing.ts +2 -17
- package/src/prover/smt/solver/model-checker.ts +2 -36
- package/src/prover/smt/solver/model-evaluator.ts +3 -29
- package/src/prover/smt/solver/model-finder.ts +3 -15
- package/src/prover/smt/solver/model-generator.ts +1 -12
- package/src/prover/smt/solver/model-macro-solver.ts +12 -69
- package/src/prover/smt/solver/nlsat/algebraic.ts +55 -151
- package/src/prover/smt/solver/nlsat/atoms.ts +5 -19
- package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
- package/src/prover/smt/solver/nlsat/explain.ts +3 -47
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -50
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -129
- package/src/prover/smt/solver/nlsat/mpbq.ts +3 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +17 -156
- package/src/prover/smt/solver/nlsat/solver.ts +7 -67
- package/src/prover/smt/solver/nlsat/types.ts +1 -8
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -44
- package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
- package/src/prover/smt/solver/nnf.ts +3 -38
- package/src/prover/smt/solver/pattern-inference.ts +2 -15
- package/src/prover/smt/solver/poly-rewriter.ts +3 -23
- package/src/prover/smt/solver/propagate-values.ts +1 -10
- package/src/prover/smt/solver/proto-model.ts +3 -48
- package/src/prover/smt/solver/pull-quant.ts +1 -12
- package/src/prover/smt/solver/qe-lite-der.ts +1 -29
- package/src/prover/smt/solver/qe-lite-fm.ts +2 -25
- package/src/prover/smt/solver/qe-lite.ts +3 -33
- package/src/prover/smt/solver/qi-queue.ts +1 -16
- package/src/prover/smt/solver/quant-tactics.ts +5 -22
- package/src/prover/smt/solver/quantifier-analyzer.ts +17 -37
- package/src/prover/smt/solver/quantifier-manager.ts +1 -8
- package/src/prover/smt/solver/random-gen.ts +1 -2
- package/src/prover/smt/solver/rational.ts +1 -8
- package/src/prover/smt/solver/ref-vector.ts +1 -6
- package/src/prover/smt/solver/relevancy.ts +2 -15
- package/src/prover/smt/solver/rewriter-tpl.ts +3 -147
- package/src/prover/smt/solver/rewriter.ts +3 -85
- package/src/prover/smt/solver/rlimit.ts +2 -20
- package/src/prover/smt/solver/smtlib-parser.ts +2 -37
- package/src/prover/smt/solver/solver.ts +1 -16
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/sticky-generations.ts +0 -5
- package/src/prover/smt/solver/theory-lra-axioms.ts +3 -24
- package/src/prover/smt/solver/theory-lra-bounds.ts +0 -5
- package/src/prover/smt/solver/theory-lra-final-check.ts +4 -22
- package/src/prover/smt/solver/theory-lra-internalize.ts +1 -27
- package/src/prover/smt/solver/theory-lra-model.ts +4 -19
- package/src/prover/smt/solver/theory-lra-propagate.ts +1 -15
- package/src/prover/smt/solver/theory-lra-state.ts +3 -8
- package/src/prover/smt/solver/theory-lra.ts +1 -8
- package/src/prover/smt/solver/var-subst.ts +2 -26
- package/src/prover/smt/table.ts +0 -8
- package/src/prover/tlapm/cache.ts +20 -25
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +12 -17
- package/src/prover/verdict.ts +0 -2
- package/src/prover/zenon/check/check.ts +0 -9
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +0 -5
- package/src/prover/zenon/check/relations.ts +0 -13
- package/src/prover/zenon/check/rewrites.ts +0 -6
- package/src/prover/zenon/check/sets.ts +0 -3
- package/src/prover/zenon/check/terms.ts +0 -17
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +0 -12
- package/src/prover/zenon/encode.ts +1 -8
- package/src/prover/zenon/eqrel.ts +0 -13
- package/src/prover/zenon/equality-rules.ts +0 -4
- package/src/prover/zenon/expr.ts +1 -26
- package/src/prover/zenon/index-table.ts +17 -38
- package/src/prover/zenon/isar-case.ts +9 -19
- package/src/prover/zenon/isar.ts +1 -29
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +0 -9
- package/src/prover/zenon/mltoll.ts +54 -76
- package/src/prover/zenon/node.ts +1 -11
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +2 -7
- package/src/prover/zenon/phrase.ts +1 -11
- package/src/prover/zenon/proof.ts +0 -9
- package/src/prover/zenon/propositional-rules.ts +0 -5
- package/src/prover/zenon/rules.ts +2 -6
- package/src/prover/zenon/search.ts +1 -17
- package/src/prover/zenon/tla/functions.ts +57 -29
- package/src/prover/zenon/tla/llproof.ts +63 -70
- package/src/prover/zenon/tla/records.ts +56 -27
- package/src/prover/zenon/tla/rewrites.ts +12 -19
- package/src/prover/zenon/tla/sets.ts +68 -39
- package/src/prover/zenon/tla/terms.ts +0 -6
- package/src/prover/zenon/tla/tla.ts +59 -58
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +12 -112
- package/src/runtime.ts +22 -22
- package/src/sany/builtins.ts +2 -5
- package/src/sany/generator.ts +149 -252
- package/src/sany/levels.ts +6 -34
- package/src/sany/lexer.ts +41 -61
- package/src/sany/linter.ts +1 -9
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +0 -31
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +29 -63
- package/src/sany/selectors.ts +15 -39
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +13 -63
- package/src/search.ts +495 -155
- package/src/simulate.ts +685 -0
- package/src/spec-description.ts +176 -69
- package/src/standard-definitions.ts +0 -4
- package/src/standard-modules.ts +254 -69
- package/src/state-graph.ts +50 -24
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +2 -3
- package/src/successors.ts +260 -91
- package/src/symmetry.ts +33 -25
- package/src/tableau.ts +27 -24
- package/src/tlc/fingerprint.ts +183 -67
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +110 -44
- package/src/tlc/order.ts +37 -60
- package/src/tlc/random.ts +33 -45
- package/src/tlc/replay.ts +549 -217
- package/src/tlc/summary.ts +36 -47
- package/src/tlc/tlc-operators.ts +76 -41
- package/src/tlc/tlcext-operators.ts +139 -122
- package/src/tlc/trace-spec.ts +269 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typescript/actions.ts +8 -21
- package/src/typescript/collections.ts +0 -15
- package/src/typescript/compile.ts +0 -5
- package/src/typescript/context.ts +0 -12
- package/src/typescript/emit.ts +0 -1
- package/src/typescript/expressions.ts +0 -12
- package/src/typescript/formula.ts +4 -12
- package/src/typescript/functions.ts +6 -17
- package/src/typescript/model.ts +10 -11
- package/src/typescript/names.ts +0 -2
- package/src/typescript/program.ts +0 -3
- package/src/typescript/properties.ts +6 -8
- package/src/typescript/scope.ts +0 -5
- package/src/typescript/steps.ts +0 -10
- package/src/typescript/types.ts +1 -8
- package/src/values.ts +749 -330
- package/src/worker.ts +7 -8
package/dist/transfer.cjs
CHANGED
|
@@ -6,89 +6,23 @@
|
|
|
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
|
-
const e=require("./worker.cjs")
|
|
10
|
-
`,t:` `,r:`\r`,f:`\f`},
|
|
11
|
-
`),
|
|
12
|
-
|
|
13
|
-
`?
|
|
14
|
-
`?
|
|
15
|
-
`||e[a]===`\r`?
|
|
16
|
-
\r`.includes(e[t]))n
|
|
17
|
-
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),
|
|
18
|
-
(
|
|
19
|
-
(* This module provides dummy definitions of the operators that are *)
|
|
20
|
-
(
|
|
21
|
-
(* handles specifications that use real numbers will provide its own *)
|
|
22
|
-
(* implementations of these operators. TLC currently does not handle real *)
|
|
23
|
-
(* numbers and produces an error if a specification requires TLC to *)
|
|
24
|
-
(* evaluate the operators defined here or to evaluate any operator defined *)
|
|
25
|
-
(* in the Integers module that is applied to non-integer real numbers. *)
|
|
26
|
-
(* *)
|
|
27
|
-
(* See the book "Specifying Systems" for the real Reals module. *)
|
|
28
|
-
(***************************************************************************)
|
|
29
|
-
EXTENDS Integers
|
|
30
|
-
|
|
31
|
-
Real == "Reals"
|
|
32
|
-
a / b == CHOOSE m \\in Real : m * b = a
|
|
33
|
-
Infinity == CHOOSE i : (i \\notin Real) /\\ (\\A r \\in Real : i > r)
|
|
34
|
-
=============================================================================`,Me=`----------------------------- MODULE RealTime -------------------------------
|
|
35
|
-
(***************************************************************************)
|
|
36
|
-
(* This standard module is described in Chapter 9 of the book "Specifying *)
|
|
37
|
-
(* Systems". The type of specification described there cannot be handled *)
|
|
38
|
-
(* by the TLC model checker. *)
|
|
39
|
-
(***************************************************************************)
|
|
40
|
-
EXTENDS Reals
|
|
41
|
-
VARIABLE now
|
|
42
|
-
|
|
43
|
-
RTBound(A, v, D, E) ==
|
|
44
|
-
LET TNext(t) == t' = IF <<A>>_v \\/ ~(ENABLED <<A>>_v)'
|
|
45
|
-
THEN 0
|
|
46
|
-
ELSE t + (now'-now)
|
|
47
|
-
|
|
48
|
-
Timer(t) == (t=0) /\\ [][TNext(t)]_<<t, v, now>>
|
|
49
|
-
|
|
50
|
-
MaxTime(t) == [](t \\leq E)
|
|
51
|
-
|
|
52
|
-
MinTime(t) == [][A => t \\geq D]_v
|
|
53
|
-
IN \\EE t : Timer(t) /\\ MaxTime(t) /\\ MinTime(t)
|
|
54
|
-
-----------------------------------------------------------------------------
|
|
55
|
-
RTnow(v) == LET NowNext == /\\ now' \\in {r \\in Real : r > now}
|
|
56
|
-
/\\ UNCHANGED v
|
|
57
|
-
IN /\\ now \\in Real
|
|
58
|
-
/\\ [][NowNext]_now
|
|
59
|
-
/\\ \\A r \\in Real : WF_now(NowNext /\\ (now'>r))
|
|
60
|
-
=============================================================================`,Ne=`----------------------------- MODULE Toolbox --------------------------------
|
|
61
|
-
(***************************************************************************)
|
|
62
|
-
(* *)
|
|
63
|
-
(***************************************************************************)
|
|
64
|
-
LOCAL INSTANCE Naturals \\* a + b
|
|
65
|
-
LOCAL INSTANCE FiniteSets \\* Cardinality
|
|
66
|
-
LOCAL INSTANCE TLC \\* TLCGet
|
|
67
|
-
|
|
68
|
-
-----------------------------------------------------------------------------
|
|
69
|
-
|
|
70
|
-
(* Trace Exploration *)
|
|
71
|
-
|
|
72
|
-
_TETrace ==
|
|
73
|
-
CHOOSE f \\in [ (Nat \\ {0}) -> STRING ] : TRUE
|
|
74
|
-
|
|
75
|
-
LOCAL _TETraceLength == Cardinality(DOMAIN _TETrace)
|
|
76
|
-
|
|
77
|
-
\\* When evaluated as part of a TLC ALIAS expression, \`_TEPosition\` should be
|
|
78
|
-
\\* redefined as \`TLCGet("level"), or replace with \`TLCGet(level)\` right away.
|
|
79
|
-
\\* The definition below accounts for several "peculiarities" of the
|
|
80
|
-
\\* Toolbox's trace exploration.
|
|
81
|
-
_TEPosition ==
|
|
82
|
-
IF TLCGet("level") >= _TETraceLength
|
|
83
|
-
THEN _TETraceLength
|
|
84
|
-
ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
|
|
85
|
-
|
|
86
|
-
=============================================================================`,Pe=/* @__PURE__ */ new Map([[`Reals`,je],[`RealTime`,Me],[`Toolbox`,Ne]]),Fe={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},Ie=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},Le=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Re=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),ze=e=>{let t=t=>{let n=h(e,t,Ie);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=h(e,t,Le);if(e.startsWith(`..`,n)&&Le(e[n+2]))return{kind:`Constant`,first:t,last:h(e,n+2,Le)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=Le(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:h(e,t+1,Le)-1,children:[]};if(Re(n))return{kind:`Constant`,first:t,last:h(e,t,Re)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},E=e=>{let t=e.length===0?void 0:ze(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=Fe[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let ee=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),te=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return ee===void 0||te===void 0?void 0:`${ee}${s.divider}\n${o}${s.dividerPad}${te}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},Be=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,D=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,Ve=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),O=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),k=e=>typeof e==`object`&&e.kind===`ModelValue`,He=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),Ue=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:D(e)?`set`:`function`,We=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,Ge={isUsed:!1},Ke=(e,t)=>(Ge.isUsed=!0,e.writtenKeys=t,e),qe=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[tr(e.domain,t)]]),Je=(e,t,n)=>Ke(jn(e,t),n),Ye=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(Ye);e.writtenKeys=void 0,e.range.forEach(Ye)}},Xe=e=>e.every(e=>typeof e==`string`),Ze=(e,t)=>e.length>0&&t.length>0&&Xe(e)!==Xe(t),Qe=(e,t)=>{Ge.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Ze(n,r)?Qt(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=gt(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:gt(t,n);if(r!==0)return r}return 0},$e=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=gt(n[e],r[e]);if(t!==0)return t}return 0},et=e=>k(e)?e.type:void 0,tt=(t,n,r)=>{let i=et(t),a=et(n);if(i===void 0&&a===void 0)return;let o=r?`check equality of`:`compare`;if(k(t)&&k(n)){if(i===void 0||a===void 0||i===a)return;throw new e._(`Attempted to ${o} the differently-typed model values ${F(t)} and ${F(n)}`)}throw i===void 0?new e._(`Attempted to ${o} the typed model value ${F(n)} and the non-model value\n${F(t)}`):new e._(`Attempted to ${o}${r?``:` the`} typed model value ${F(t)} and non-model value\n${F(n)}`)},nt={ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0},rt=e=>{nt.ranks=Object.create(null),nt.size=0,nt.searchRank=void 0,nt.unorderedString=void 0,_t.clear();for(let t of e)ct(t)},it=()=>{nt.searchRank=nt.size},at=()=>nt.unorderedString,ot={is174:!1},st=e=>{ot.is174=e===`1.7.4`},ct=e=>(nt.ranks[e]===void 0&&(nt.ranks[e]=nt.size++),e),lt=e=>nt.ranks[ct(e)],ut=(e,t)=>{if(e===t)return 0;let n=nt.ranks,r=n[e],i=n[t],a=nt.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(nt.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},dt=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),ft=(e,t)=>(dt(e)||dt(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),pt=(t,n,r)=>{if(!dt(t))throw new e._(`Attempted to ${r} the set ${F(j(t)?M(t):t,!0)} with the value:\n${F(n,!0)}`);if(!dt(n))throw new e._(`Attempted to compare overridden value ${F(t,!0)} with non-overridden value:\n${F(n,!0)}`);let i=t.kind===`InfiniteSet`?t.name:void 0,a=n.kind===`InfiniteSet`?n.name:void 0;if(i!==void 0&&i===a)return 0;if(i===`Nat`&&a===`Int`||i===`Int`&&a===`Nat`)return i===`Nat`?-1:1;throw new e._(`Attempted to compare ${F(t,!0)} with the value\n${F(n,!0)}`)},mt={kind:`InfiniteSet`,name:`Any`},ht=t=>{throw new e._(`Attempted to compare ANY with the value\n${F(t)}`)},gt=(t,n)=>{if(t===n)return Ge.isUsed&&Ye(t),t===mt?ht(t):0;if(typeof t==`object`&&typeof n==`object`){let r=t.kind,i=n.kind;if(r===`Function`&&i===`Function`)return Qe(t,n);if(r===`Set`&&i===`Set`)return $e(t,n);if(r===`Interval`&&i===`Interval`){let e=Math.max(0,t.high-t.low+1),r=Math.max(0,n.high-n.low+1);return e!==r||e===0?e-r:t.low-n.low}if(r===`ModelValue`&&i===`ModelValue`)return t.type!==void 0&&n.type!==void 0&&tt(t,n,!1),t.rank-n.rank;if(r===`ModelValue`||i===`ModelValue`)return tt(t,n,!1),r===`ModelValue`?-1:1;if(t===mt||n===mt)return ht(t===mt?n:t);if(D(t)&&D(n)&&ft(t,n))return pt(t,n,`compare`);let a=D(t);if(a!==D(n))throw new e._(`Attempted to compare ${Ue(t)} ${F(t)} with ${Ue(n)} ${F(n)}`);return a?$e(M(t),M(n)):Qe(P(t),P(n))}if(typeof t==`number`&&typeof n==`number`)return t-n;if(typeof t==`string`&&typeof n==`string`)return ut(t,n);if(typeof t==`boolean`&&typeof n==`boolean`)return t<n?-1:1;if(tt(t,n,!1),k(t))return-1;if(k(n))return 1;throw new e._(`Attempted to compare ${Ue(t)} ${F(t)} with ${Ue(n)} ${F(n)}`)},_t=/* @__PURE__ */ new Map,vt=e=>{let t=_t.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:lt(e),hash:xr(Sr(Cr(e),109)),fingerprint:Mr(Nr(e)^60)};return _t.set(e,n),n},yt=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0,isFingerprinted:!1}),bt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,isFingerprinted:!1}),xt={isPresent:!1},St=(e,t)=>(t===`lambda`&&(xt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),Ct=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,wt=e=>St(e,`lambda`),Tt=e=>Be(e)&&e.isCached===!0,Et={isPresent:!1},Dt=e=>(Et.isPresent=!0,e),Ot=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),kt=e=>{Et.isPresent&&typeof e==`object`&&Be(e)&&Ot.has(e.kind)&&(e.isCached=!0)},At=e=>{(xt.isPresent||Et.isPresent)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(At),e.range.forEach(At)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(At):D(e)&&j(e)&&(kt(e),M(e).elements.forEach(At))))},jt=(e,t)=>{if(kt(e),e===t)return Ge.isUsed&&Ye(e),e!==mt||ht(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&tt(e,t,!0),gt(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return Qe(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return $e(e,t)===0;if(k(e)||k(t))return tt(e,t,!0),k(e)&&k(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return jt(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=N(e.domain),r=N(t.domain);if(n||r)return n===r;let i=N(e.range),a=N(t.range);return i||a?i===a:jt(e.domain,t.domain)&&jt(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(N(e))return N(t);if(N(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&jt(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return N(e)?N(t):!N(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>jt(e,t.factors[n]));let n=D(e)&&D(t)&&!(j(e)&&j(t));if(n&&ft(e,t))return pt(e,t,`check equality of`)===0;if(n){if(!dt(e)){let n=M(e);if(!dt(t))return $e(n,M(t))===0}return Rr(e)===Rr(t)}return gt(e,t)===0},Mt=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):Rr(n)===Rr(r);return n},Nt=Mt(!1),Pt=Mt(!0),Ft=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},It=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=jr(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Pt(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Pt(i[e],n))return i[e]}return n.kind===`Set`?Ft(n.elements,t):(Ft(n.domain,t),Ft(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},Lt=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},Rt=e=>{if(!O(e))return;let t=P(e);return{domain:t.domain,range:t.range,low:Lt(t.domain)}},zt=e=>{if(!O(e))return;let t=P(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},Bt=(e,t)=>(tt(t,e,!1),1),Vt=(e,t)=>(tt(t,e,!0),!1),Ht=(e,t)=>(e.type!==void 0&&tt(e,t,!1),k(t)?e.rank-t.rank:-1),Ut=(e,t)=>(e.type!==void 0&&tt(e,t,!0),k(t)&&e.name===t.name),Wt={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},Gt=(e,t,n)=>{let r=Wt[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${F(e)} with ${r.other}:\n${F(t)}`},Kt=(t,n,r)=>{let i=Rt(r);if(!i){if(k(r))return Bt(r,n);throw new e._(`Attempted to compare the function ${F(n)} with the value:\n${F(r)}`)}if(t.range.length!==i.range.length)return t.range.length-i.range.length;let a=()=>qt(t.range,i.range);if(t.low!==void 0&&t.range.length===0)return 0;if(t.low!==void 0&&i.low!==void 0)return t.low===i.low?a():t.low-i.low;let o=t.low??i.low;if(o===void 0)return qt(t.domain,i.domain)||a();let s=t.low===void 0?t.domain:i.domain;for(let n=0;n<s.length;n++){let r=s[n];if(typeof r!=`number`)throw new e._(`Attempted to compare integer with non-integer${t.low===void 0?``:`:`}\n${F(r)}.`);let i=t.low===void 0?r-(o+n):o+n-r;if(i!==0)return i}return a()},qt=(e,t)=>{for(let n=0;n<e.length;n++){let r=Qt(e[n],t[n]);if(r!==0)return r}return 0},Jt=(t,n)=>{let r=P(t);if(t.kind===`Function`&&nr(r)!==void 0){let e=O(n)?nr(n):void 0;return e?r.range.length-e.length||qt(r.range,e):Kt({...r,low:1},t,n)}if(Ct(t)===`record`){let i=zt(n);if(!i){if(k(n))return Bt(n,t);throw new e._(`Attempted to compare record:\n${F(t)}\nwith non-record\n${F(n)}`)}return r.domain.length-i.domain.length||qt(r.domain,i.domain)||qt(r.range,i.range)}return Kt({...r,low:Lt(r.domain)},t,n)},Yt=(e,t)=>dt(e)||dt(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),Xt=(e,t)=>{let n=He(t)?t:M(t);return{elements:M(e).elements,otherElements:M(n).elements}},Zt=(t,n)=>{if(Yt(t,n))return gt(t,n);if(!He(t))return Zt(M(t),n);if(!D(n)){if(k(n))return Bt(n,t);throw new e._(`Attempted to compare the set ${F(t)} with the value:\n${F(n)}`)}let r=Xt(t,n);return r.elements.length-r.otherElements.length||qt(r.elements,r.otherElements)},Qt=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return gt(t,n);if(k(n))return Bt(n,t);throw new e._(Gt(t,n,!1))}return t.kind===`ModelValue`?Ht(t,n):O(t)?Jt(t,n):Zt(t,n)},$t=(e,t)=>e.every((e,n)=>rn(e,t[n])),en=(t,n,r)=>{let i=Rt(r);if(!i){if(k(r))return Vt(r,n);throw new e._(`Attempted to check equality of the function ${F(n)} with the value:\n${F(r)}`)}if(t.range.length!==i.range.length)return!1;if(t.low!==void 0&&i.low!==void 0)return(t.range.length===0||t.low===i.low)&&$t(t.range,i.range);let a=t.low??i.low;return a===void 0?$t(t.domain,i.domain)&&$t(t.range,i.range):(t.low===void 0?t.domain:i.domain).every((t,n)=>{if(typeof t!=`number`)throw new e._(`Attempted to compare an integer with non-integer:\n${F(t)}.`);return t===a+n})&&$t(t.range,i.range)},tn=(t,n)=>{let r=P(t);if(t.kind===`Function`&&nr(r)!==void 0){let e=O(n)?nr(n):void 0;return e?r.range.length===e.length&&$t(r.range,e):en({...r,low:1},t,n)}if(Ct(t)===`record`){let i=zt(n);if(!i){if(k(n))return Vt(n,t);throw new e._(`Attempted to check equality of record:\n${F(t)}\nwith non-record\n${F(n)}`)}return r.domain.length===i.domain.length&&$t(r.domain,i.domain)&&$t(r.range,i.range)}return en({...r,low:Lt(r.domain)},t,n)},nn=(t,n)=>{if(Yt(t,n))return jt(t,n);if(!He(t))return nn(M(t),n);if(!D(n)){if(k(n))return Vt(n,t);throw new e._(`Attempted to check equality of the set ${F(t)} with the value:\n${F(n)}`)}let r=Xt(t,n);return r.elements.length===r.otherElements.length&&$t(r.elements,r.otherElements)},rn=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return t===n;if(k(n))return Vt(n,t);throw new e._(Gt(t,n,!0))}return t.kind===`ModelValue`?Ut(t,n):O(t)?tn(t,n):nn(t,n)},an=e=>{let t=[];for(let n of e){let e=sn(n,t);e.isFound||t.splice(e.index,0,n)}return t},on=(e,t)=>{let n=ir.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},sn=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=on(e,()=>Qt(e,t[r]));if(i===0)return{index:r,isFound:!0};i<0?n.high=r:n.low=r+1}return{index:n.low,isFound:!1}},cn=(e,t)=>t.some(t=>on(t,()=>rn(t,e))),ln=/* @__PURE__ */ new WeakSet,un=e=>{typeof e==`object`&&(e.kind===`Set`&&(ln.add(e),e.elements.forEach(un)),e.kind===`Function`&&(e.domain.forEach(un),e.range.forEach(un)))},dn=(e,t)=>ar(jt,rn,e,t),fn=e=>{for(let t=1;t<e.length;t++)if(gt(e[t-1],e[t])>=0)return!1;return!0},pn=e=>{for(let t=1;t<e.length;t++)kt(e[t]);if(e.length<2||fn(e))return yt(e);let t=[...e].sort(gt),n=[t[0]];for(let e=1;e<t.length;e++)gt(n[n.length-1],t[e])!==0&&n.push(t[e]);return yt(n)},mn=e=>ar(pn,e=>({kind:`MixedSet`,elements:e}),e,void 0),hn=yt([]),gn=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&>(r[a],t)<0;)a++;a<r.length&>(r[a],t)===0||i.push(t)}return i.length===n.length?e:yt(i)},_n=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&>(r[a],t)<0;)a++;a<r.length&>(r[a],t)===0&&i.push(t)}return i.length===n.length?e:yt(i)},vn=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=gt(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=yt(i);if(e.hash!==0&&e.hash!==Er){let t=e.hash,n=0;for(;n<a.length;n++){let e=jr(a[n]);if(e===Er)break;t=t+wr(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Pr(a[e])|0;c.fingerprint=t}return c},yn=e=>{let t=e.length<2?e:[...e].sort((e,t)=>gt(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&>(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return bt(n,r)},bn=e=>{let t=yn(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:Ke(t,e.map(e=>e[0]))},xn=[],Sn=/* @__PURE__ */ new Map,Cn=[],wn=/* @__PURE__ */ new WeakMap,Tn=e=>{let t=xn[e]??Sn.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?Sn.set(e,new WeakRef(n)):xn[e]=n,n},En=e=>{if(Qn(e),e.low===1&&e.high>=1)return Tn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Dn=e=>e.length>0&&(e===xn[e.length]||e===Sn.get(e.length)?.deref()||wn.has(e)),On=e=>{let t=M(e).elements;return Dn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},kn=e=>{let t=Cn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Cn[e]=n,n},A=e=>St(bt(Tn(e.length),e),`tuple`),An=e=>St(yn(e),`record`),jn=(e,t)=>St(bt(e,t),`record`),Mn=e=>D(e)&&!dt(e),Nn=(e,t=!1)=>`UNION(${F(e.base,t)})`,Pn=(t,n=e=>M(e).elements)=>{if(!Mn(t.base))throw new e._(`Attempted to enumerate the nonenumerable set:\n${Nn(t)}`);return n(t.base)},Fn=(t,n,r)=>{if(Mn(t))return t;throw new e._(n===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${F(t)}\nwhen enumerating:\n${Nn(r)}`)},j=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return j(e.base);case`FunctionSet`:return j(e.domain)&&j(e.range)||In(e.domain)===!0||In(e)===!0;case`RecordSet`:return e.sets.every(j)||In(e)===!0;case`ProductSet`:return e.factors.every(j)||In(e)===!0;case`Union`:return j(e.base)&&Gn(e.base).every(j);case`SetOperation`:return e.operator===`\\cup`?j(e.left)&&j(e.right):e.operator===`\\cap`?j(e.left)||j(e.right):j(e.left);default:return!1}},In=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=In(e.domain);return t===void 0?void 0:!t&&In(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=In(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return j(e)?M(e).elements.length===0:void 0;default:return}},Ln=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},Rn=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},zn=e=>{if(typeof e!=`object`||e.kind!==`Subset`||dt(e.base))return;let t=M(e.base).elements;if(t.length<=30)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:Rn(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return yt(n.indices.map(e=>t[e]))},i=2**t.length,a=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<i;return new Proxy([],{get:(e,t,n)=>t===`length`?i:a(t)?r(Number(t)):Reflect.get(e,t,n),has:(e,t)=>a(t)||Reflect.has(e,t)})},Bn=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(yt(r.map(t=>e[t])));while(Rn(r,e.length))}return t},Vn=(t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){let o=t[a];if(dt(o))throw new e._(r(o,a));let s=n(o);if(s.length===0)return[[]];i.push(s)}return i},Hn=(t,n=e=>M(e).elements)=>{if(typeof t!=`object`)throw new e._(`Expected a set but found ${F(t)}`);switch(t.kind){case`Set`:return t.elements;case`MixedSet`:return an(t.elements);case`Interval`:{let e=En(t);return e!==xn[e.length]&&wn.set(e,t),e}case`Subset`:{if(Qn(t.base)===0)return Bn([]);if(!D(t.base))throw new e._(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${E(F(t.base))}`);let n=M(t.base).elements;if(n.length>30)throw new e._(Zn(t));return Bn(n)}case`FunctionSet`:{if(!ot.is174&&N(t))return[];if(dt(t.domain))throw new e._(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${F(t.domain)}\ncannot be enumerated.`);let r=On(t.domain);if((r.length>0||ot.is174)&&dt(t.range))throw new e._(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${F(t.range)}\ncannot be enumerated.`);let i=r.length===0?[]:n(t.range);return Ln(r.map(()=>i)).map(e=>bt(r,e))}case`RecordSet`:{if(!ot.is174&&N(t))return[];let e=Vn(t.sets,n,(e,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${t.names[n]}' field:\n${F(e)}`);return Ln(e).map(e=>An(t.names.map((t,n)=>[t,e[n]])))}case`ProductSet`:{if(!ot.is174&&N(t))return[];let e=Vn(t.factors,n,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${F(e)}`);return Ln(e).map(A)}case`FilteredSet`:if(!D(t.base)||dt(t.base))throw new e._(`Attempted to enumerate { x \\in S : p(x) } when S:\n${F(t.base)}\nis not enumerable`);return M(t.base).elements.filter(t.test);case`Union`:{let e=Pn(t).flatMap((e,n)=>M(Fn(e,n,t)).elements);return M(mn(e)).elements}case`SetOperation`:{if(t.operator===`\\cup`&&(!Mn(t.left)||!Mn(t.right)))throw new e._(`Attempted to enumerate S \\cup T when S:\n${F(t.left)}\nand T:\n${F(t.right)}\nare not both enumerable`);if(t.operator===`\\cap`&&!Mn(t.left)&&!Mn(t.right))throw new e._(`Attempted to enumerate S \\cap T when neither S:\n${F(t.left)}\nnor T:\n${F(t.right)}\nis enumerable`);if(t.operator===`\\`&&!Mn(t.left))throw new e._(`Attempted to enumerate S \\ T when S:\n${F(t.left)}\nis not enumerable.`);if(t.operator===`\\cup`)return ar(e=>vn(M(e.left),M(e.right)).elements,e=>an(Un(e)),t,t);let n=t.operator===`\\`||Mn(t.left),r=n?t.left:t.right,i=n?t.right:t.left;return M(r).elements.filter(e=>or(e,i)===(t.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new e._(`Attempted to enumerate the non-enumerable set ${F(t)}`);default:throw new e._(`Expected a set but found ${F(t)}`)}},M=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return yt(Hn(e));let t=typeof e==`object`&&Be(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=ir.sets;n?.push(e);let r=Hn(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?yt(r):pn(r);return t&&(t.enumerated=i),i},Un=e=>[...M(e.left).elements,...M(e.right).elements],Wn=e=>typeof e==`object`&&e.kind===`SetOperation`&&e.operator===`\\cup`?ar(e=>M(e).elements,e=>an(on(e,()=>Un(e))),e,e):M(e).elements,Gn=e=>{if(typeof e!=`object`||Tt(e))return M(e).elements;let t=ir.sets;t?.push(e);let n=Yn(e);return t?.pop(),n},Kn=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,qn=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(qn);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(qn)&&e.range.every(qn);case`SetOperation`:return e.operator!==`\\cup`&&qn(e.left)&&qn(e.right);case`FilteredSet`:return qn(e.base);case`ProductSet`:return e.factors.every(qn);default:return!1}},Jn=e=>typeof e!=`object`||Tt(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?Jn(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||Jn(e.left)||Jn(e.right):Kn(e)?.some(Jn)??!1,Yn=e=>{if(e.kind===`Union`)return Pn(e,Gn).flatMap((t,n)=>Gn(Fn(t,n,e)));if(e.kind===`FilteredSet`&&!dt(e.base))return Gn(e.base).filter(e.test);if(Kn(e)?.some(Jn))return Hn(e,Gn);if(e.kind!==`SetOperation`)return M(e).elements;if(e.operator===`\\cup`)return!Mn(e.left)||!Mn(e.right)?M(e).elements:[...Gn(e.left),...Gn(e.right)];let t=e.operator===`\\`||Mn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return Mn(n)?Gn(n).filter(t=>or(t,r)===(e.operator===`\\cap`)):M(e).elements},N=t=>{if(typeof t!=`object`||!D(t))throw new e._(`Shouldn't call isEmpty() on value ${F(t)}`);switch(t.kind){case`Set`:case`MixedSet`:return t.elements.length===0;case`Interval`:return t.low>t.high;case`InfiniteSet`:if(t.name===`Any`)throw new e._(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return t.factors.some(N);case`RecordSet`:return t.sets.some(N);case`FunctionSet`:return!N(t.domain)&&N(t.range);case`Union`:return Pn(t).every((e,n)=>N(Fn(e,n,t)));default:return M(t).elements.length===0}},Xn=(t,n,r)=>t.reduce((t,i)=>{let a=t*Qn(i,n);if(a>2147483647)throw new e._(r());return a},1),Zn=e=>`Overflow when computing the number of elements in:\n${F(e)}`,Qn=(t,n)=>{if(typeof t!=`object`)throw new e._(`Attempted to compute the number of elements in the ${Ue(t)} ${F(t)}.`);switch(t.kind){case`ModelValue`:throw new e._(`Attempted to compute the number of elements in the model value ${F(t)}.`);case`Function`:return t.domain.length;case`LazyFunction`:return Qn(t.domain,n);case`Interval`:{let n=Math.max(0,t.high-t.low+1);if(n>2147483647)throw new e._(`Size of interval value exceeds the maximum representable size (32bits): ${t.low}..${t.high}.`);return n}case`InfiniteSet`:case`SequenceSet`:throw new e._(`Attempted to compute the number of elements in the overridden value ${F(t)}.`);case`Subset`:{let r=Qn(t.base,n);if(r>=31)throw new e._(Zn(t));return 2**r}case`FunctionSet`:{if(n!==`1.7.4`){if(N(t.domain))return 1;if(N(t.range))return 0;if(Qn(t.range,n)===1)return 1}let r=Qn(t.domain,n),i=Qn(t.range,n);if(i<=1)return r===0?1:i;let a={value:1};for(let n=0;n<r;n++)if(a.value*=i,a.value>2147483647)throw new e._(Zn(t));return a.value}case`RecordSet`:return n!==`1.7.4`&&N(t)?0:Xn(t.sets,n,()=>Zn(t));case`ProductSet`:return n!==`1.7.4`&&N(t)?0:Xn(t.factors,n,()=>`Overflow when computing the number of elements in ${F(t)}`);default:return kt(t),M(t).elements.length}},$n=e=>`Attempted to check if the set ${F(e)}is finite.`,er=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)throw new e._(`Attempted to check if the ${Ue(t)} ${F(t)} is a finite set.`);switch(t.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new e._(`Attempted to check if the function:\n${F(t)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return er(t.base)&&N(t.base);case`Subset`:return er(t.base);case`FunctionSet`:{let e=er(t.domain);if(e&&N(t.domain))return!0;let n=er(t.range);return n&&N(t.range)?!0:n&&(e||Qn(t.range)===1)}case`RecordSet`:case`ProductSet`:{let e=t.kind===`RecordSet`?t.sets:t.factors,n={isAllFinite:!0};for(let t of e)if(!er(t))n.isAllFinite=!1;else if(N(t))return!0;return n.isAllFinite}case`Union`:if(!Mn(t.base))throw new e._(`Attempted to check if the nonenumerable set:\n${Nn(t)}\nis a finite set.`);return M(t.base).elements.every(er);case`SetOperation`:if(t.operator===`\\cup`)return er(t.left)&&er(t.right);if(t.operator===`\\cap`){if(!er(t.left)&&!er(t.right))throw new e._($n(t));return!0}if(er(t.left))return!0;if(!er(t.right))throw new e._($n(t));return!1;case`FilteredSet`:if(!er(t.base))throw new e._(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${F(t.base)}\nis finite.`);return!0}},tr=(e,t,n=gt)=>{let r={low:0,high:e.length-1};for(;r.low<=r.high;){let i=r.low+r.high>>1,a=n(e[i],t);if(a===0)return i;a<0?r.low=i+1:r.high=i-1}return-1},nr=e=>{if(typeof e!=`object`||!O(e))return;let t=P(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},rr=(e,t)=>{let n=`Attempted to check if the value:\n${F(e)}\nis an element of the`;if(!O(t))return`${n} ${Ue(t)} ${F(t)}`;let r=Ct(t);return r===`record`?`Attempted to check if element:\n${F(e)}\nis in the record:\n${F(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${F(t)}`},ir={sets:void 0},ar=(t,n,r,i)=>{let a=ir.sets,o=ir.callStack,s=a?.length??0,c=o&&{...o,length:o.expressions.length};try{return t(r,i)}catch(t){if(!(t instanceof e._))throw t;return a&&(a.length=s),o&&c&&(o.expressions.length=c.length,o.isFrozen=c.isFrozen,o.fingerprint=c.fingerprint),n(r,i,t)}},or=(e,t)=>{let n=ir.sets;if(n===void 0)return lr(e,t);n.push(t);let r=lr(e,t);return n.pop(),r},sr=(e,t)=>tr(t.elements,e)!==-1,cr=(e,t)=>ln.has(t)?sn(e,t.elements).isFound:cn(e,t.elements),lr=(t,n)=>{if(!D(n))throw new e._(rr(t,n));switch(n.kind){case`Set`:return kt(t),ar(sr,cr,t,n);case`MixedSet`:return cn(t,n.elements);case`Interval`:if(typeof t==`number`)return t>=n.low&&t<=n.high;if(n.low<=n.high&&!k(t))throw new e._(`Attempted to check if the value:\n${F(t)}\nis in the integer interval ${F(n)}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(k(t))return!1;if(!(n.name===`STRING`?typeof t==`string`:typeof t==`number`))throw new e._(`Attempted to check if the value:\n${F(t)}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof t==`number`&&t>=0;case`Subset`:if(!D(t)||dt(t))throw new e._(`Attempted to check if the non-enumerable value\n${E(F(t))}\nis element of\n${E(F(n))}`);return M(t).elements.every(e=>or(e,n.base));case`FunctionSet`:{if(!O(t)){if(k(t))return!1;throw new e._(`Attempted to check if \n${F(t)}\nwhich is not a TLC function value, is in the set of functions:\n${E(F(n))}`)}let r=P(t),i=Lt(r.domain);return(i===void 0?dn(n.domain,yt(r.domain)):dn({kind:`Interval`,low:i,high:i+r.domain.length-1},n.domain))&&r.range.every(e=>or(e,n.range))}case`RecordSet`:{let r=O(t)?P(t):void 0;if(!r||!Xe(r.domain)){if(k(t))return!1;throw new e._(`Attempted to check if non-record\n${F(t)}\nis in the set of records:\n${F(n)}`)}return r.domain.length===n.names.length&&n.names.every((e,t)=>{let i=tr(r.domain,e);return i!==-1&&or(r.range[i],n.sets[t])})}case`ProductSet`:{let r=O(t)?nr(t):void 0;if(r===void 0){if(O(t)&&P(t).domain.every(e=>typeof e==`number`)||k(t))return!1;throw new e._(`Attempted to check if non-tuple\n${F(t)}\nis in the set of tuples:\n${F(n)}`)}return r.length===n.factors.length&&r.every((e,t)=>or(e,n.factors[t]))}case`FilteredSet`:return or(t,n.base)&&n.test(t);case`Union`:if(!Mn(n.base))throw new e._(`Attempted to check if:\n ${F(t)}\nis an element of the non-enumerable set:\n ${Nn(n)}`);return M(n.base).elements.some(e=>or(t,e));case`SetOperation`:return n.operator===`\\cup`?or(t,n.left)||or(t,n.right):or(t,n.left)&&or(t,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=nr(t);if(r===void 0){if(k(t))return!1;throw new e._(`Attempted to check if the value:\n${E(F(t))}\nis an element of ${E(F(n))}.`)}return r.every(e=>or(e,n.base))}default:throw new e._(rr(t,n))}},ur=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?or(e,n):e.range.every((e,r)=>ur(e,t.range[r],n.range)),P=t=>{if(typeof t==`object`&&t.kind===`Function`)return t;if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return t.enumerated;j(t.domain)||Qn(t.domain);let e=On(t.domain);return t.enumerated=St(bt(e,e.map(e=>t.apply(e))),Ct(t)),t.enumerated}throw new e._(`Expected a function but found ${F(t)}`)},dr=(e,t,n)=>{let r=E(F(e)),i=E(F(t)),a=n===`1.7.4`;switch(Ct(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},fr=(e,t)=>{if(!ot.is174)return dr(e,t);let n=E(F(t));return Ct(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},pr=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},mr=t=>new e._(`Attempted to apply function with integer domain to the non-integer argument ${E(F(t))}`),hr=(e,t,n)=>{throw ot.is174||e.length<32?e.forEach(e=>rn(e,t)):tr(e,t,Qt),n},gr=(t,n,r)=>{let i=t.domain;if(typeof n!=typeof i[0]){let a=Ct(t),o=a===`tuple`?`number`:a===`record`?`string`:void 0;if(o!==void 0&&typeof n!==o)throw new e._(r(t,n));if(o===void 0&&!ot.is174&&Dn(i))throw mr(n)}let a=pr(i,n);return a===-1?ar(tr,hr,i,n):a},_r=(t,n,r)=>{if(typeof t==`object`&&t.kind===`LazyFunction`){if(!or(n,t.domain))throw new e._(Ct(t)===`lambda`?dr(t,n):`Attempted to apply a function to ${F(n)}, which is not in its domain`);return t.apply(n)}if(typeof t!=`object`||t.kind!==`Function`)throw new e._(`Attempted to apply ${F(t)}, which is not a function`);let i=r??dr,a=gr(t,n,i);if(a===-1)throw new e._(i(t,n));return t.range[a]},vr=e=>Dn(e)?wn.get(e)??kn(e.length):void 0,yr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=P(e).domain;return vr(t)??yt(t)},br=(t,n,r,i=!1)=>{if(typeof t==`object`&&t.kind===`LazyFunction`&&(i||!j(t.domain))){if(!or(n,t.domain))return t;let e=r(t.apply(n));return St({kind:`LazyFunction`,domain:t.domain,apply:r=>dn(n,r)?e:t.apply(r),source:t.source},Ct(t))}if(!O(t))throw new e._(`Attempted to apply EXCEPT construct to the value ${E(F(t))}.`);let a=P(t),o=gr(a,n,fr);if(o===-1)return a;let s=[...a.range],c=a.range[o],l=r(c);s[o]=l;let u=St(bt(a.domain,s),Ct(a));if(u.writtenKeys=a.writtenKeys,a.hash!==0&&a.hash!==Er){let e=jr(l);if(e!==Er){let t=jr(a.domain[o]);u.hash=c===l?a.hash:a.hash-Tr(t,jr(c))+Tr(t,e)|0}}if(a.fingerprint!==0){let e=a.domain[o];u.fingerprint=c===l?a.fingerprint:a.fingerprint-Fr(e,c)+Fr(e,l)|0}return u},xr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Sr=(e,t)=>Math.imul(e^t,16777619),Cr=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return xr(t)},wr=e=>xr(e+2654435769|0),Tr=(e,t)=>xr(Math.imul(e,668265261)+t|0),Er=795548749,Dr=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=jr(t[e]);if(r===Er)return Er;n=n+wr(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=jr(e.domain[n]),i=jr(e.range[n]);if(r===Er||i===Er)return Er;t=t+Tr(r,i)|0}return t},Or=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)return;if(t.kind===`InfiniteSet`||t.kind===`SequenceSet`)throw new e._(`TLC has found a state in which the value of a variable contains ${F(t)}`);if(D(t)){M(t).elements.forEach(Or);return}let n=P(t);n.domain.forEach(Or),n.range.forEach(Or)},kr=t=>{if(typeof t==`object`&&t.kind!==`ModelValue`)try{jr(t)===Er&&Or(t);return}catch(t){if(!(t instanceof e._))throw t;return t}},Ar=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},jr=e=>typeof e==`number`?xr(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?Cr(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=Dr(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?j(e.domain)?jr(P(e)):Er:j(e)?jr(M(e)):Er,Mr=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Nr=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Mr(t)},Pr=e=>Mr(Lr(e)+2135587861|0),Fr=(e,t)=>Mr(Math.imul(Lr(e),374761393)+Lr(t)|0),Ir=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Pr(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Fr(e.domain[n],e.range[n])|0;return t},Lr=e=>typeof e==`number`?Mr(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?Nr(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Ir(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?Lr(P(e)):j(e)?Lr(M(e)):Nr(Rr(e)),Rr=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):zr(e),zr=t=>{if(t.kind===`ModelValue`)return`@${t.name}`;if(t.kind===`InfiniteSet`)return`<${t.name}>`;if(t.kind===`SequenceSet`)return`<Seq ${Rr(t.base)}>`;if(t.kind===`FilteredSet`&&!j(t))throw new e._(`Attempted to compare the non-enumerable set ${F(t)} with another value`);if(D(t))return j(t)?`{${M(t).elements.map(Rr).join(`,`)}}`:`<${t.kind} ${F(t)}>`;let n=P(t);return`(${n.domain.map((e,t)=>`${Rr(e)}:${Rr(n.range[t])}`).join(`,`)})`},Br=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,Vr=e=>e.reduce((e,t)=>e===0?0:e*Qn(t),1),Hr=e=>{if(e.kind===`Subset`)return Qn(e.base)<=6?M(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return M(e);if(e.kind===`FunctionSet`&&j(e.domain)&&Qn(e.domain)===0)return yt([bt([],[])]);let t=e.kind===`FunctionSet`?Qn(e.range)**Qn(e.domain):Vr(e.kind===`RecordSet`?e.sets:e.factors);return t===0?hn:t<=1999?M(e):void 0},Ur=(t,n)=>{if(n)return Hr(t);if(j(t))try{return Hr(t)}catch(t){if(t instanceof e._)return;throw t}},Wr=(e,t)=>{let n=e=>F(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return Nn(e,t)}},Gr=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Kr=t=>{if(j(t.domain))try{return P(t)}catch(t){if(t instanceof e._)return;throw t}},F=(e,t=!1,n=!1)=>{let r=e=>F(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Br(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(M(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=Ur(e,t);return n?r(n):Wr(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?Kr(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${F(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&ot.is174&&Ct(e)!==`tuple`)return`<< >>`;let a=r=>F(r,t,n&&Ct(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:Ct(e)===`record`||i.domain.every(e=>typeof e==`string`&&Gr(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):qe(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},qr=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${E(F(n))}\n`).join(``)},Jr=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),Yr=(t,n)=>Jr.has(t)?new e._(n):new e.C(n),Xr=(t,n,r,i)=>new e.C(`The ${t} argument of ${n} should be a ${r}, but instead it is:\n${F(i)}`),Zr=e=>typeof e==`object`&&e.kind===`Operator`,I=(e,t,n)=>{let r=e[t];if(r===void 0||Zr(r))throw Yr(n,`${n} expects a value as argument ${t+1}`);return r},Qr=(e,t,n)=>{let r=I(e,t,n);if(typeof r!=`number`)throw Yr(n,`${n} expects an integer but received ${F(r)}`);return r},$r=(e,t,n)=>{let r=I(e,t,n);if(typeof r!=`boolean`)throw Yr(n,`${n} expects a boolean but received ${F(r)}`);return r},ei=(e,t,n)=>{let r=I(e,t,n);if(!D(r))throw Yr(n,`${n} expects a set but received ${F(r)}`);return r},ti=(e,t,n)=>{let r=ei(e,t,n);if(!j(r))throw Yr(n,`${n} cannot enumerate the non-enumerable set ${F(r)}`);return r},ni=(e,t,n)=>M(ti(e,t,n)).elements,ri=(e,t,n)=>{let r=I(e,t,n),i=nr(r);if(!i)throw Yr(n,`${n} expects a sequence but received ${F(r)}`);return i},ii=(e,t,n)=>{let r=I(e,t,n);if(!O(r))throw Yr(n,`${n} expects a function but received ${F(r)}`);return P(r)},ai=(e,t,n)=>{let r=e[t];if(r===void 0||!Zr(r))throw Yr(n,`${n} expects an operator as argument ${t+1}`);return r},oi=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),L=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),si=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),ci=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),li=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(I(n,0,e),I(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),ui=e=>e>2147483647||e<-2147483648,di=t=>new e.C(`Overflow when computing ${t}`),fi={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},pi={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},mi={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},hi={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},gi=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return pi[e.operator];if(e.kind!==`Function`)return fi[e.kind];let t=Ct(e);return t===void 0?`FcnRcdValue`:hi[t]},_i=e=>mi[gi(e)],vi=(t,n)=>new e._(`Attempted to apply the operator overridden by the Java method\n${t},\nbut it produced the following error:\n${n}`),yi=(t,n)=>{let r=r=>(...i)=>{let a=ir.sets?.length??0;try{return r(...i)}catch(r){throw r instanceof e._&&(t.isLazy===!0||!(r instanceof e.C))?(ir.sets&&(ir.sets.length=a),vi(n,r.message)):r}};return{...t,evaluate:r(t.evaluate),evaluateUnary:t.evaluateUnary&&r(t.evaluateUnary),evaluateBinary:t.evaluateBinary&&r(t.evaluateBinary)}},bi=(e,t)=>{if(typeof e!=`number`)throw vi(t,`Cannot cast tlc2.value.impl.${gi(e)} to tlc2.value.impl.IntValue`);return e},xi=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Si=(e,t,n,r)=>{let i=xi(e,n,`IntValue`,2);return li(t,(e,n)=>{let a=bi(e,i),o=bi(n,i),s=r(a,o);if(ui(s))throw di(`${a}${t}${o}`);return s})},Ci=(t,n,r)=>{if(typeof t!=`number`)throw new e.C(`The ${n} argument of ${r} should be an integer, but instead it is:\n${F(t)}`);return t},wi=(e,t,n=e)=>li(e,(e,r)=>t(Ci(e,`first`,n),Ci(r,`second`,n))),Ti=(e,t,n)=>({...ci(e,t,n),isLazy:!0}),Ei=(e,t,n)=>{let r=ai(e,t,n);return()=>r.call([])},Di=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Oi=()=>({bool:hu,condition:(e,t)=>{if(typeof e!=`boolean`)throw Ql(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw $l(t,n,e);return e},apply:_r,expectFunction:fu,tuple:A,set:mn,record:jn,writtenRecord:Je,equal:jt,enumerate:Su,unassigned:(e,t)=>{throw ou(e,t)},primeOutsideAction:e=>{throw cu(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:pu,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>uu(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),ki={value:void 0},Ai={isAllowed:void 0},ji=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Mi=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Ni=e=>`local${e.counter++}`,Pi=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),Ae(e).forEach(e=>Pi(e,t)),t),Fi=(e,t,n)=>{let r=Mi(e,V(t,e.environment)),i=Pi(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Mi(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},Ii=(e,t,n)=>{let r=t.kind===`Forall`,i=JSON.stringify(r?`the body of \\A`:`the body of \\E`),a=`quantifier${e.counter++}`,o=[...n.locals.values()],s={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(n.locals)},c=t.bounds.map(()=>Ni(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${Bi(e,t.set,s)}, ${Mi(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=Ni(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${Bi(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=Ni(e),a=Ni(e),o=Ni(e),s=c[r];return`for (let ${i} = 0, ${a} = ${s}.low, ${o} = ${a} === undefined ? ${s}.length : ${s}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${s}[${i}] : ${a} + ${i}; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; let applied; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},Li=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${Bi(e,r[0],n)}, "the left side of =>") ? bool(${Bi(e,r[1],n)}, "the right side of =>") : true)`;if(T(t))return Fi(e,t,n);let i=Ku(t.operator,e.environment);if(i?.kind!==`Builtin`)return Fi(e,t,n);if(i.name===`DOMAIN`)return`${Mi(e,nu(t))}(${Bi(e,r[0],n)})`;if(i.name===`TLCEval`)return Fi(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Mi(e,ru(t,i))}(${Bi(e,r[0],n)}, ${Bi(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&xd(r[0],a))return`${Mi(e,i.evaluateUnary)}(${Bi(e,r[0],n)})`;let o=r.length===2&&xd(r[0],a)&&xd(r[1],a);return i.evaluateBinary&&o?`${Mi(e,i.evaluateBinary)}(${Bi(e,r[0],n)}, ${Bi(e,r[1],n)})`:Fi(e,t,n)},Ri=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(T(e))return!1;let r=rd(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Ri(e.expression,t,n);case`FieldAccess`:return Ri(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Ri(e,t,n));default:return!1}},zi=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return zi(e.record);case`FunctionApplication`:return[e.function,...e.args].every(zi);default:return!1}},Bi=(e,t,n)=>{let r=(t,r=n)=>Bi(e,t,r);switch(t.kind){case`Number`:return We(t.value)?String(t.value):Fi(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(T(t))return Fi(e,t,n);let i=rd(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Mi(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Mi(e,i.value):Fi(e,t,n)}case`Apply`:return Li(e,t,n);case`And`:case`Or`:{let n=Mi(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${Mi(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Ad(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Ri(t.function,n,e.environment)?r(t.function):zi(t.function)?r(t.function,i):Fi(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Mi(e,t)}))`,o=tu(e.environment.runtime.version),s=o?`, ${Mi(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${Mi(e,eu(t))}(${r(t.record)})`;case`Record`:{let i=Ld(t.fields);if(Rd(i))return Fi(e,t,n);let a=Mi(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${Mi(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:{let i=Mi(e,t);if(n.isPrimed)return`primeOutsideAction(${i})`;let a={context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals};return`(${n.next} === undefined ? primeOutsideAction(${i}) : ${r(t.expression,a)})`}case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?Ii(e,t,n):Fi(e,t,n);default:return Fi(e,t,n)}},Vi=(e,t)=>{if(!Di.has(e.kind)||(Ai.isAllowed??=ji(),!Ai.isAllowed))return;let n={environment:t,references:[],helpers:[],counter:0},r=Bi(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
|
|
87
|
-
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;ki.value??=Oi();let o=ki.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},Hi={general:1e3,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,behaviorUpToThisPoint:2121,backToState:2122,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,finished:2186,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,temporalBranches:2212,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,version:2262,noSpecificationButProperty:2257,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001},Ui={none:0,error:1,warning:3,state:4},Wi={0:``,1:`Error: `,3:`Warning: `,4:`State `},Gi=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===Ui.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
|
|
88
|
-
(Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${Wi[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},Ki=`The configuration file did not specify the initial state predicate.
|
|
9
|
+
const e=require("./worker.cjs");let t=require("node:zlib");const n=/* @__PURE__ */ new Set(/* @__PURE__ */ `ACTION.ACTIONS.ASSUME.ASSUMPTION.AXIOM.BY.CASE.CHOOSE.CONSTANT.CONSTANTS.COROLLARY.DEF.DEFINE.DEFS.DOMAIN.ELSE.ENABLED.EXCEPT.EXTENDS.HAVE.HIDE.IF.IN.INSTANCE.LAMBDA.LEMMA.LET.LOCAL.MODULE.NEW.OBVIOUS.OMITTED.ONLY.OTHER.PICK.PROOF.PROPOSITION.PROVE.QED.RECURSIVE.STATE.SUBSET.SUFFICES.TAKE.TEMPORAL.TEMPORALS.THEN.THEOREM.UNCHANGED.UNION.USE.VARIABLE.VARIABLES.WITH.WITNESS`.split(`.`)),r=/* @__PURE__ */ new Map([[`in`,`\\in`],[`notin`,`\\notin`],[`subseteq`,`\\subseteq`],[`subset`,`\\subset`],[`supseteq`,`\\supseteq`],[`supset`,`\\supset`],[`cup`,`\\cup`],[`union`,`\\cup`],[`cap`,`\\cap`],[`intersect`,`\\cap`],[`X`,`\\X`],[`times`,`\\X`],[`o`,`\\o`],[`circ`,`\\o`],[`div`,`\\div`],[`land`,`/\\`],[`lor`,`\\/`],[`lnot`,`~`],[`neg`,`~`],[`equiv`,`<=>`],[`leq`,`<=`],[`geq`,`>=`],[`A`,`\\A`],[`forall`,`\\A`],[`E`,`\\E`],[`exists`,`\\E`],[`AA`,`\\AA`],[`EE`,`\\EE`],[`cdot`,`\\cdot`],[`sqsubseteq`,`\\sqsubseteq`],[`sqsupseteq`,`\\sqsupseteq`],[`sqsubset`,`\\sqsubset`],[`sqsupset`,`\\sqsupset`],[`sqcap`,`\\sqcap`],[`sqcup`,`\\sqcup`],[`oplus`,`\\oplus`],[`ominus`,`\\ominus`],[`otimes`,`\\otimes`],[`oslash`,`\\oslash`],[`odot`,`\\odot`],[`uplus`,`\\uplus`],[`prec`,`\\prec`],[`preceq`,`\\preceq`],[`succ`,`\\succ`],[`succeq`,`\\succeq`],[`sim`,`\\sim`],[`simeq`,`\\simeq`],[`approx`,`\\approx`],[`cong`,`\\cong`],[`asymp`,`\\asymp`],[`doteq`,`\\doteq`],[`propto`,`\\propto`],[`wr`,`\\wr`],[`star`,`\\star`],[`bullet`,`\\bullet`],[`bigcirc`,`\\bigcirc`],[`ll`,`\\ll`],[`gg`,`\\gg`]]),i=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),a=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),o=/* @__PURE__ */ new Map([[`∃`,`\\E`],[`∀`,`\\A`],[`∷`,`::`],[`≜`,`==`],[`⟨`,`<<`],[`⟩_`,`>>_`],[`⟩`,`>>`],[`→`,`->`],[`←`,`<-`],[`↦`,`|->`],[`⁺`,`^+`],[`¬`,`~`],[`□`,`[]`],[`◇`,`<>`],[`∧`,`/\\`],[`∨`,`\\/`],[`∈`,`\\in`],[`≈`,`\\approx`],[`≔`,`:=`],[`≍`,`\\asymp`],[`◯`,`\\bigcirc`],[`⩴`,`::=`],[`●`,`\\bullet`],[`∩`,`\\cap`],[`⋅`,`\\cdot`],[`∘`,`\\o`],[`≅`,`\\cong`],[`∪`,`\\cup`],[`÷`,`\\div`],[`≐`,`\\doteq`],[`‥`,`..`],[`…`,`...`],[`≡`,`<=>`],[`‼`,`!!`],[`≥`,`>=`],[`≫`,`\\gg`],[`⇔`,`<=>`],[`⇒`,`=>`],[`⫤`,`=|`],[`↝`,`~>`],[`≤`,`<=`],[`≪`,`\\ll`],[`⊣`,`-|`],[`≠`,`#`],[`∉`,`\\notin`],[`⊙`,`\\odot`],[`⊖`,`\\ominus`],[`⊕`,`\\oplus`],[`⊘`,`\\oslash`],[`⊗`,`\\otimes`],[`⇸`,`-+->`],[`≺`,`\\prec`],[`⪯`,`\\preceq`],[`∝`,`\\propto`],[`⁇`,`??`],[`⊨`,`|=`],[`⊢`,`|-`],[`∼`,`\\sim`],[`≃`,`\\simeq`],[`⊓`,`\\sqcap`],[`⊔`,`\\sqcup`],[`⊏`,`\\sqsubset`],[`⊑`,`\\sqsubseteq`],[`⊐`,`\\sqsupset`],[`⊒`,`\\sqsupseteq`],[`⋆`,`\\star`],[`⊂`,`\\subset`],[`⊆`,`\\subseteq`],[`≻`,`\\succ`],[`⪰`,`\\succeq`],[`⊃`,`\\supset`],[`⊇`,`\\supseteq`],[`×`,`\\X`],[`⊎`,`\\uplus`],[`‖`,`||`],[`≀`,`\\wr`]]),s=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),c=e=>e.startsWith(`\\`)?parseInt(e.slice(2),s.get(e[1].toLowerCase())):Number(e),l=/-{4,} *MODULE\b/,u=/* @__PURE__ */ new Uint8Array(128);(/* @__PURE__ */ new Map([[`0123456789`,33],[`abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ`,2],[`_`,4],[`01`,8],[`01234567`,16],[`abcdefABCDEF`,32]])).forEach((e,t)=>{for(let n of t)u[n.charCodeAt(0)]|=e});const d=(e,t)=>e<128&&(u[e]&t)!==0,f=(e,t,n)=>{let r=t;for(;d(e.charCodeAt(r),n);)r++;return r},p=/* @__PURE__ */ new Map;a.forEach(e=>{let t=e.charCodeAt(0),n=p.get(t)??[];n.push(e),p.set(t,n)});const m=(e,t)=>{let n=p.get(e.charCodeAt(t));if(n!==void 0){for(let r=0;r<n.length;r++)if(e.startsWith(n[r],t))return n[r]}},h=(e,t)=>{if(e.charCodeAt(t)<128)return;let n=e.slice(t,t+2);if(o.has(n))return n;let r=e[t];return o.has(r)?r:void 0},g=(e,t)=>{let n=e.charCodeAt(t);if(n===92&&d(e.charCodeAt(t+1),2)){let n=e.slice(t+1,f(e,t+1,2)),i=n.length;for(;i>0&&!r.has(n.slice(0,i));)i--;let a=r.get(n.slice(0,i));return{text:a??`\\`,length:a===void 0?1:i+1}}let a=h(e,t);if(a!==void 0)return{text:o.get(a)??``,length:a.length};let s=m(e,t);return s?{text:i.get(s)??s,length:s.length}:n===92?{text:`\\`,length:1}:void 0},_=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),ee=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>o.has(e)||_.has(e));return n===void 0?void 0:{text:n,length:n.length}},te=(e,t,n)=>{let r=t;for(;r<e.length&&n(e[r]);)r++;return r},v=(e,t,n)=>{let r=e[t+1]===`+`||e[t+1]===`*`,i=r?t+2:f(e,t+1,1);if(i===t+1||e[i]!==`>`)return 0;let a=!r||!n,o=a?f(e,i+1,7):i+1,s=a&&o===i+1&&(e[o]===`*`||e[o]===`-`);return te(e,s?o+1:o,e=>e===`.`)-t},ne=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,y={n:`
|
|
10
|
+
`,t:` `,r:`\r`,f:`\f`},re=(e,t)=>t===9?e+8-e%8:e+1,b=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),ie=(e,t)=>{if(e.charCodeAt(t)!==92)return 0;let n=b.get(e.charAt(t+1).toLowerCase());if(n===void 0)return 0;let r=f(e,t+2,n);return r===t+2?0:r-t},ae=(t,r=!1)=>{let i=l.exec(t);if(!i)throw new e.F(`Expected a module header such as ---- MODULE Name ----`);let a=[],o=/* @__PURE__ */ new Map,s=t.slice(0,i.index).split(`
|
|
11
|
+
`),c=i.index,u=s.length,p=i.index-s[s.length-1].length,m=0,h=-1,ee=0,ne=0,b=()=>{for((h!==p||ee>c)&&(h=p,ee=p,ne=0);ee<c;ee++)ne=re(ne,t.charCodeAt(ee));return re(ne,t.charCodeAt(c))},ae=(e,t,n,r)=>{let i=b();a.push({kind:e,text:t,spelling:r,line:u,column:i,endColumn:i+n-1}),c+=n},oe=e=>{for(let n=0;n<e;n++)t.charCodeAt(c)===10&&(u++,p=c+1),c++},se=n=>new e.F(`${n} at line ${u}, column ${b()}`,void 0,{reason:n,line:u,column:b(),isEnd:c>=t.length});for(;c<t.length;){let e=t.charCodeAt(c);if(e===10||e===32||e===9||e===13){oe(1);continue}if(e===92&&t.charCodeAt(c+1)===42){oe(te(t,c,e=>e!==`
|
|
12
|
+
`&&e!==`\r`)-c);continue}if(e===40&&t.charCodeAt(c+1)===42){let e=0;do{if(c>=t.length)throw se(`Unterminated comment`);t.startsWith(`(*`,c)?(e++,oe(2)):t.startsWith(`*)`,c)?(e--,oe(2)):oe(1)}while(e>0);continue}if(e===45&&t.startsWith(`----`,c)){let e=te(t,c,e=>e===`-`)-c,n=te(t,c+e,e=>e===` `);t.startsWith(`MODULE`,n)&&m++,ae(`Separator`,`----`,e);continue}if(e===61&&t.startsWith(`====`,c)){if(ae(`ModuleEnd`,`====`,te(t,c,e=>e===`=`)-c),m--,m<=0)break;continue}if(e===34){let e=u,n=b(),r=[];for(oe(1);t.charCodeAt(c)!==34;){let e=t.charCodeAt(c);if(c>=t.length||e===10||e===13)throw se(`Unterminated string`);if(e===92){let e=t[c+1];if(e===void 0||!`ntrf\\"`.includes(e))throw se(`Invalid escape in string`);r.push(y[e]??e),oe(2)}else r.push(t[c]),oe(1)}oe(1),a.push({kind:`String`,text:r.join(``),line:e,column:n,endColumn:b()-1});continue}let i=ie(t,c);if(i>0){ae(`Number`,t.slice(c,c+i),i);continue}if(d(e,7)){let r=f(t,c,7),i=t.slice(c,r),a=f(t,c,1);if(a===r){let e=t.charCodeAt(r)===46?f(t,r+1,1):r,n=e>r+1,a=n?t.slice(c,e):i;ae(n?`Decimal`:`Number`,a,a.length);continue}if(!/[A-Za-z]/.test(i)){let n=e===95?`_`:t.slice(c,a);ae(n===`_`?`Operator`:`Number`,n,n.length);continue}if(i.startsWith(`WF_`)||i.startsWith(`SF_`)){ae(`Keyword`,i.slice(0,3),3);continue}let s=o.get(i)??i;o.set(s,s),ae(n.has(i)?`Keyword`:`Identifier`,s,i.length);continue}let s=t[c];if(e>=128&&_.has(s)){ae(`Identifier`,o.get(s)??s,1),o.set(s,s);continue}if(e===60){let e=v(t,c,r);if(e>0){ae(`Step`,t.slice(c,c+e),e);continue}}let l=g(t,c);if(l){let e=t.slice(c,c+l.length);ae(`Operator`,l.text,l.length,e===l.text?void 0:e)}else throw se(`Unexpected character ${JSON.stringify(s)}`)}let ce=b();return a.push({kind:`End`,text:``,line:u,column:ce,endColumn:ce}),a},oe=[[`EOF`],[`BEGIN_PRAGMA`,`--->`],[`_BM1`],[`NUMBER`],[`_BM2`],[`_BM0`],[`SEPARATOR`],[`END_MODULE`],[`ACTION`,`ACTION`,`ACTIONS`],[`ASSUME`,`ASSUME`],[`BOXASSUME`,`[]ASSUME`],[`ASSUMPTION`,`ASSUMPTION`,`AXIOM`],[`CASE`,`CASE`],[`CHOOSE`,`CHOOSE`],[`CONSTANT`,`CONSTANT`,`CONSTANTS`],[`ELSE`,`ELSE`],[`EXCEPT`,`EXCEPT`],[`EXISTS`,`\\E`,`\\exists`,`∃`],[`EXTENDS`,`EXTENDS`],[`FORALL`,`\\A`,`\\forall`,`∀`],[`IF`,`IF`],[`INSTANCE`,`INSTANCE`],[`LET`,`LET`],[`LETIN`,`IN`],[`LOCAL`,`LOCAL`],[`MODULE`,`MODULE`],[`NEW`,`NEW`],[`OTHER`,`OTHER`],[`PROPOSITION`,`PROPOSITION`,`LEMMA`,`COROLLARY`],[`SF`,`SF_`],[`T_EXISTS`,`\\EE`],[`T_FORALL`,`\\AA`],[`THEN`,`THEN`],[`BY`,`BY`],[`ONLY`,`ONLY`],[`DEFINE`,`DEFINE`],[`DF`,`DEF`,`DEFS`],[`THEOREM`,`THEOREM`],[`USE`,`USE`],[`HIDE`,`HIDE`],[`HAVE`,`HAVE`],[`OBVIOUS`,`OBVIOUS`],[`OMITTED`,`OMITTED`],[`LAMBDA`,`LAMBDA`],[`TAKE`,`TAKE`],[`PROOF`,`PROOF`],[`PROVE`,`PROVE`],[`BOXPROVE`,`[]PROVE`],[`QED`,`QED`],[`RECURSIVE`,`RECURSIVE`],[`STATE`,`STATE`],[`TEMPORAL`,`TEMPORAL`,`TEMPORALS`],[`PICK`,`PICK`],[`WITNESS`,`WITNESS`],[`SUFFICES`,`SUFFICES`],[`VARIABLE`,`VARIABLE`,`VARIABLES`],[`WF`,`WF_`],[`WITH`,`WITH`],[`COMMA`,`,`],[`COLON`,`:`],[`COLONCOLON`,`::`,`∷`],[`DOT`,`.`],[`US`,`_`],[`DEF`,`==`,`≜`],[`LBR`,`(`],[`RBR`,`)`],[`DEFBREAK`,`-|-`],[`LSB`,`[`],[`ARSB`,`]_`],[`RSB`,`]`],[`LBC`,`{`],[`RBC`,`}`],[`LAB`,`<<`,`⟨`],[`ARAB`,`>>_`,`⟩_`],[`RAB`,`>>`,`⟩`],[`BANG`,`!`],[`ARROW`,`->`,`→`],[`SUBSTITUTE`,`<-`,`←`],[`MAPTO`,`|->`,`↦`],[`NUMBER_LITERAL`],[`STRING_LITERAL`],[`BAND`],[`BOR`],[`op_57`,`'`],[`op_68`,`^+`,`⁺`],[`op_69`,`^*`],[`op_70`,`^#`],[`op_76`,`-.`],[`op_26`,`\\lnot`,`¬`],[`op_29`,`\\neg`],[`op_58`,`~`],[`CASESEP`,`[]`,`□`],[`op_61`,`<>`,`◇`],[`op_112`,`ENABLED`],[`op_113`,`UNCHANGED`],[`op_114`,`SUBSET`],[`op_115`,`UNION`],[`op_116`,`DOMAIN`],[`op_1`,`//`],[`AND`,`/\\`,`∧`],[`op_3`,`/=`],[`op_4`,`/`],[`OR`,`\\/`,`∨`],...[`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`].map(e=>[`infix`,e]),[`IN`,`\\in`,`∈`],...(/* @__PURE__ */ `\\intersect.\\union.\\land.\\leq.\\ll.\\lor.\\o.\\odot.\\ominus.\\oplus.\\oslash.\\otimes.\\prec.\\preceq.\\propto.\\sim.\\simeq.\\sqcap.\\sqcup.\\sqsubset.\\sqsupset.\\sqsubseteq.\\sqsupseteq.\\star.\\subset.\\subseteq.\\succ.\\succeq.\\supset.\\supseteq.\\uplus.\\wr.\\.~>.=>.=<.=|`.split(`.`)).map(e=>[`infix`,e]),[`EQUALS`,`=`],...[`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`].map(e=>[`infix`,e]),[`op_77`,`-`],...[`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`].map(e=>[`infix`,e]),[`op_119`,`\\X`],[`IDENTIFIER`],[`ProofStepLexeme`],[`ProofImplicitStepLexeme`],[`ProofStepDotLexeme`],[`BareLevelLexeme`],[`UnnumberedStepLexeme`]],se=oe.map(e=>e[0]),ce=new Map(se.map((e,t)=>[e,t]).reverse()),x=t=>{let n=ce.get(t);if(n===void 0)throw new e.y(`Unknown SANY token kind ${t}`);return n},le=new Map(oe.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),S=Math.max(...[...le.keys()].map(e=>e.length)),ue=Array.from({length:S},(e,t)=>S-t),de=/----+ *MODULE/y,fe=[/_\w*[A-Za-z]\w*/y,/[0-9]\w*[A-Za-z]\w*/y,/[WS](?:[a-zA-EG-Z_0-9]\w*)?/y,/[WS]F(?:[A-Za-z0-9]\w*)?/y,/[a-zA-RT-VX-Z]\w*/y,/@|ℕ|ℤ|ℝ/y],C=e=>[/[0-9][A-Za-z0-9]*/,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*/,/[a-zA-RT-VX-Z][A-Za-z0-9]*/].map(t=>RegExp(`${t.source}${e}`,`y`)),w=C(String.raw`\.\/\\`),T=C(String.raw`\.\\\/`),E=String.raw`<(?:[0-9]+|\+|\*)>`,pe=[[`_BM0`,[de]],[`SEPARATOR`,[/----+/y]],[`END_MODULE`,[/====+/y]],[`NUMBER_LITERAL`,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[`STRING_LITERAL`,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[`BAND`,w],[`BOR`,T],[`IDENTIFIER`,fe],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${E}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(E,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${E}(?:\*\.*|-\.*|\.+)`,`y`)]]],me=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[de]]],he=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[de]],[`BAND`,w],[`BOR`,T],[`IDENTIFIER`,fe]],ge=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),_e=(e,t,n)=>e.map(([e,r])=>({kind:x(e),length:Math.max(...r.map(e=>ge(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),ve=(e,t)=>{let n=ue.find(n=>le.has(e.slice(t,t+n))),r=_e(pe,e,t);if(n===void 0)return r;let i={kind:le.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},ye=e=>e+8-e%8,D=e=>{let t=[],n=[],r=1,i=0,a=!1,o=!1;for(let s of e)for(let e=0;e<s.length;e++)i++,o?(o=!1,r++,i=1):a&&(a=!1,s===`
|
|
13
|
+
`?o=!0:(r++,i=1)),s===`\r`?a=!0:s===`
|
|
14
|
+
`?o=!0:s===` `&&(i=ye(i-1)),t.push(r),n.push(i);return{lines:t,columns:n}},be=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,xe=new Set([...le.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),Se=(e,t)=>{let n=0;for(;xe.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,ge(be,e,t)))},Ce=e=>{let t=D(e),n=0,r=`DEFAULT`,i=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),a=()=>i(x(`EOF`),e.length-1,0),o=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?Ee(o,s,e[a],i):t.lines[n]===o?e[a]===`
|
|
15
|
+
`||e[a]===`\r`?Ee(o+1,0,void 0,i):Ee(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},s=()=>{let t=n;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return o(t,e.length,``);n+=r+1;return}let r=0,i=t,a=t;for(;a<e.length;)if(e.startsWith(`(*`,a))r++,a+=2,r>1&&(i=a);else if(e.startsWith(`*)`,a)){if(r--,a+=2,i=a,r===0){n=a;return}}else a++;return n=a,i===e.length?void 0:o(i,a,``)},c=t=>{for(;n<e.length;){let a=_e(t,e,n);if(a.length>0){let e=i(a.kind,n,a.length);return n+=a.length,se[a.kind].startsWith(`_BM`)&&(r=`SPEC`),se[a.kind]===`BEGIN_PRAGMA`&&(r=`PRAGMA`),e}n++}return a()};return()=>{if(r===`DEFAULT`)return c(me);if(r===`PRAGMA`)return c(he);for(;n<e.length;){let t=n;if(`
|
|
16
|
+
\r`.includes(e[t]))n++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=s();if(e!==void 0)return e}else{let r=ve(e,t);if(r.length===0){let n=Se(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),a=r<e.length?n:i.length>1?i:``;return o(t,r,a)}let a=i(r.kind,t,r.length);return n+=r.length,a}}return a()}},we=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
|
|
17
|
+
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),Te=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>we.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),Ee=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${Te(n)}" (${n.charCodeAt(0)}), `}after : "${Te(r)}"`,De=e=>{let t=Ce(e);for(let e=t();typeof e!=`string`&&e.kind!==x(`EOF`);e=t()){let t=e.image.split(``).findIndex(e=>{let t=e.charCodeAt(0);return t>255&&(t&255)<128});if(t===-1)continue;let n=e.image.slice(1,t+1).split(``).reduce((e,t)=>t===` `?ye(e):e+1,e.beginColumn);return Ee(e.beginLine,n,e.image[t],e.image.slice(0,t))}},Oe=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],ke=/* @__PURE__ */ new Set([...Oe,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),Ae=[`TYPE`,`TYPE_CONSTRAINT`],je=/* @__PURE__ */ new Set([...Oe,...Ae]),Me=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],Ne=e=>{let t=0,n=0;do{if(t>=e.length)return;let r=e.slice(t,t+2),i=r===`(*`?1:r===`*)`?-1:0;n+=i,t+=i===0?1:2}while(n>0);return t},Pe=e=>{let t=[],n=0,r=1,i=0,a=(n,a)=>{t.push({kind:`Error`,text:Ee(r,n-i+1,e[n],a),line:r})},o=e=>{t.push({kind:`Error`,text:Ee(r+1,0,void 0,e),line:r})},s=e=>{let t=e.split(`
|
|
18
|
+
`);t.length>1&&(r+=t.length-1,i=n+e.length-t[t.length-1].length),n+=e.length};for(;n<e.length;){let i=e.slice(n),c=/^\s+/.exec(i)?.[0];if(c){s(c);continue}if(i.startsWith(`\\*`)){let e=i.indexOf(`
|
|
19
|
+
`);s(e===-1?i:i.slice(0,e));continue}if(i.startsWith(`(*`)){let e=Ne(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=ie(e,n),d=u>0?i.slice(0,u):/^\d+(?![A-Za-z_])/.exec(i)?.[0];if(d){t.push({kind:`Number`,text:d,line:l}),s(d);continue}let f=/^[A-Za-z0-9_]+/.exec(i)?.[0];if(f){t.push({kind:`Word`,text:f,line:l}),s(f);continue}if(i.startsWith(`"`)){let r=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(i),c=r?.[0]??`"`;if(r?.[2]!==`"`)return s(c),n===e.length?o(`${c}\n`):a(n,c),t;t.push({kind:`String`,text:c,line:l}),s(c);continue}let p=ee(e,n)??g(e,n),m=Me.find(e=>i.startsWith(e));if(m&&m.length>=(p?.length??0))t.push({kind:`Symbol`,text:m,line:l}),s(m);else{if(!p)return a(n,``),t;t.push({kind:`Word`,text:p.text,line:l}),s(e.slice(n,n+p.length))}}return t.push({kind:`End`,text:``,line:r}),t},Fe=(t,n)=>new e._(`TLC found an error in the configuration file at line ${t}\n${n}`),Ie=(e,t)=>Fe(e,`The keyword ${t} appeared twice.`),Le=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),Re=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),ze=(t,n=`master`)=>{let r=n===`1.7.4`?je:ke,i=Pe(t),a=0,o={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],rawConstants:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},s=!1,c=/* @__PURE__ */ new Set,l=()=>{let t=i[Math.min(a++,i.length-1)];if(t.kind===`Error`)throw new e._(`TLC found an error in the configuration file:\n${t.text}`);return t},u=t=>{if(t.kind===`Number`&&t.text.startsWith(`\\`))throw e.it(new e._(`${e.$(`java.lang.NumberFormatException`)}For input string: "${t.text}"`),e.tt.error);if(t.kind===`Number`)return{kind:`Number`,value:Number(t.text)};if(t.kind===`String`&&t.text.includes(`\\`))throw new e._(`TLC found an error in the configuration file:\nescape sequences are not supported in strings at line ${t.line}`);if(t.kind===`String`)return{kind:`String`,value:t.text.slice(1,-1)};if(t.text===`TRUE`||t.text===`FALSE`)return{kind:`Boolean`,value:t.text===`TRUE`};if(t.text===`{`){let e=[],t=l();if(t.text!==`}`)for(;e.push(u(t)),t=l(),t.text===`,`;)t=l();if(t.text!==`}`)throw Fe(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(t.kind!==`End`)return{kind:`ModelValue`,name:t.text};throw Fe(t.line,`It was expecting a value, but did not find it.`)},d=e=>{let t=l();if(t.kind===`End`)throw Fe(t.line,`Expected an identifier after ${e}[.`);let n=l();if(n.text!==`]`)throw Fe(n.line,`It was expecting ], but did not find it.`);return t.text},f=(e,t)=>{let n=e.text,r=l();for(;r.text===`!`;)n=`${n}!${l().text}`,r=l();if(r.text===`<-`){if(r=l(),r.text===`[`){let e=d(`<-`),t=l();if(t.kind===`End`)throw Fe(t.line,`Expected an identifier after <-[mod].`);o.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw Fe(r.line,`Expected an identifier after <-.`);o.substitutions.push({name:n,target:r.text});return}let i=[],a=r.text===`(`;if(a){for(;i.push(u(l())),r=l(),r.text===`,`;);if(r.text!==`)`)throw Fe(t,``);r=l()}if(r.text!==`=`)throw Fe(r.line,`It was expecting = or <-, but did not find it.`);r=l();let s=r.text===`[`?d(`=`):void 0,c=u(s===void 0?r:l());o.constants.push({name:n,value:c,...a&&{args:i},...s!==void 0&&{module:s}})},p=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;let n=a-1;f(t,e),o.rawConstants.push(i.slice(n,a).map(e=>e.text).join(` `))}},m=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;e.push(t.text)}},h=l();for(;h.kind!==`End`;){let e=h.text,t=h.line,n=r.has(e)?Le.get(e):void 0,i=r.has(e)?Re.get(e):void 0,a=()=>{let n=l();if(n.kind===`End`)throw Fe(t,`The keyword ${e} was not followed by an identifier.`);return n};if(n!==void 0){let r=a();if(o[n]!==void 0)throw Ie(t,e);o[n]=r.text,h=l()}else if(i!==void 0)h=m(o[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)h=p(t);else if(e===`CHECK_DEADLOCK`){let n=a();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw Fe(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(s)throw Ie(t,e);s=!0,o.checkDeadlock=n.text===`TRUE`,h=l()}else{if(!r.has(e)||!Ae.includes(e))throw Fe(t,`It was expecting a keyword, but did not find it.`);if(a(),c.has(e))throw Ie(t,e);c.add(e),h=l()}}return o},Be=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},O=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,k={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},Ve=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},He=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Ue=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),We=e=>{let t=t=>{let n=te(e,t,Ve);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l=t(i);for(;l!==void 0&&e[l]!==a;){let n=o(l);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l=t(i)}if(l!==void 0)return c.last=l,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=te(e,t,He);if(e.startsWith(`..`,n)&&He(e[n+2]))return{kind:`Constant`,first:t,last:te(e,n+2,He)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=He(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:te(e,t+1,He)-1,children:[]};if(Ue(n))return{kind:`Constant`,first:t,last:te(e,t,Ue)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},A=e=>{let t=e.length===0?void 0:We(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=k[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},Ge={general:1e3,stackOverflow:1005,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,unchangedVariableChanged:2143,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,initialStateIncomplete:2106,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,noInitialStates:2118,errorState:2120,behaviorUpToThisPoint:2121,backToState:2122,subscriptUndetermined:2139,subscriptMissingVariable:2140,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,simulating:2188,finished:2186,traceSpecWritten:2501,traceSpecFailed:2502,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,coverageStart:2201,coverageEnd:2202,coverageValue:2221,depthFirstStats:2204,depthFirstLevel:2205,depthFirstProgress:2206,depthFirstInitGenerated:2208,simulationProgress:2209,simulationStats:2210,temporalBranches:2212,statePrint1:2216,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,noInitialStatesInModel:2256,version:2262,depthFirstModelChecking:2271,noSpecificationButProperty:2257,fairnessTautology:2258,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,coverageNext:2772,coverageInit:2773,coverageProperty:2774,coverageValueCost:2775,coverageEndOverhead:2777,coverageConstraint:2778,coverageVariable:2779,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001,moduleOverrideStdout:2e4},Ke={none:0,error:1,warning:3,state:4},qe={0:``,1:`Error: `,3:`Warning: `,4:`State `},Je=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${qe[n]}${r}`,Ye=(t,n=!0,r=`master`,i=[],a=[])=>{let o=/* @__PURE__ */ new Set;return{isTool:t,version:r,print:(r,s,c)=>{let l=s===Ke.warning;if(l&&a.includes(r))throw new e.V(r,c);if(l&&!n||s!==Ke.error&&i.includes(r))return;let u=l&&!t&&o.size===0?`
|
|
20
|
+
(Use the -nowarning option to disable this warning.)`:``,d=Je(t,r,s,`${c}${u}`);l&&o.has(d)||(l&&o.add(d),console.log(d))}}},Xe=`The configuration file did not specify the initial state predicate.
|
|
89
21
|
Can also be caused by trying to run TLC on a specification from
|
|
90
|
-
a module imported with a parameterized INSTANCE statement.`,
|
|
91
|
-
%1%`,!0],[
|
|
22
|
+
a module imported with a parameterized INSTANCE statement.`,Ze=[[1005,e.u,!1],[1e3,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable%1% %2% undefined).`,!1],[1e3,`Could not find operator: %1% in module: %2%`,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
|
|
23
|
+
%1%`,!0],[2143,`The variable %1% was changed while it is specified as UNCHANGED at
|
|
24
|
+
%2%`,!1],[2144,`The EXCEPT was applied to non-existing fields of the value at
|
|
25
|
+
%1%`,!1],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
|
|
92
26
|
%1%,
|
|
93
27
|
but it produced the following error:
|
|
94
28
|
%2%`,!1],[2148,`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable %1% occurring in the state formula v.
|
|
@@ -97,8 +31,8 @@ but it produced the following error:
|
|
|
97
31
|
%1%
|
|
98
32
|
is an element of %2%.`,!0],[2157,`Attempted to apply TransitiveClosure to a set containing
|
|
99
33
|
the following value:
|
|
100
|
-
%1%`,!0],[2165,`Choose can only deal with numbers up to %1%`,!1],[2169,`The %1% argument of %2% should be a %3%, but instead it is:
|
|
101
|
-
%4%`,!0],[2176,`Applying %1% to the following value,
|
|
34
|
+
%1%`,!0],[2156,`TLC supports at most %1% model values, but model value %2% exceeds this limit.`,!1],[2156,`tla-ts can't recover a model check from the checkpoint in %1%.`,!1],[2165,`Choose can only deal with numbers up to %1%`,!1],[2169,`The %1% argument of %2% should be a %3%, but instead it is:
|
|
35
|
+
%4%`,!0],[2170,`Argument mismatch in operator application.%1%`,!1],[2171,`Parsing or semantic analysis failed.%1%`,!1],[2172,e.h,!1],[2176,`Applying %1% to the following value,
|
|
102
36
|
which is not %2%:
|
|
103
37
|
%3%`,!0],[2177,`Attempted to apply BagUnion to the following set, whose
|
|
104
38
|
element is not a bag:
|
|
@@ -110,9 +44,11 @@ element is not a bag:
|
|
|
110
44
|
%5%`,!0],[2184,`Attempted to apply %1% to the empty sequence.`,!0],[2115,`No next state actions defined to generate successor states from.`,!1],[2146,`The invariant %1% is not a state predicate (one with no primes or temporal operators).%2%`,!1],[2213,`TLC cannot handle the temporal formula %1%`,!1],[2214,`Temporal formulas containing actions must be of forms <>[]A or []<>A.`,!1],[2215,`TLC expected a %1% value, but did not find one. %2%`,!1],[2222,`The constant parameter %1% is not assigned a value by the configuration file.`,!1],[2223,`In the configuration file, the identifier %1% appears
|
|
111
45
|
on the right-hand side of a <- after already appearing on the
|
|
112
46
|
left-hand side of one.`,!1],[2224,`The configuration file substitutes for %1% with the undefined identifier %2%.`,!1],[2225,`The configuration file substitutes for %1% with %2% of different number of arguments.`,!1],[2226,`In the configuration file, the identifier %1% does not appear in the specification.`,!1],[2227,`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`,!1],[2228,`TLC requires %1% not to take any argument.`,!1],[2228,`TLC requires %1% not to take any argument, but one was given: %2%`,!1],[2229,`The %1% %2% specified in the configuration file
|
|
113
|
-
is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,
|
|
114
|
-
%
|
|
115
|
-
%1%`,!1],[
|
|
47
|
+
is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,Xe,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2236,`The operator %1%, which equals %2%,
|
|
48
|
+
cannot be used as a %3%`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
|
|
49
|
+
%1%`,!1],[2240,`The specification contains more than one conjunct of the form [][Next]_v,
|
|
50
|
+
but TLC can handle only specifications with one next-state relation.`,!1],[2241,`The property %1% is not correctly defined.`,!1],[2242,`The arity of the operator %1% is inconsistent in the configuration file.`,!1],[2244,`TLC can't handle real numbers.
|
|
51
|
+
%1%`,!1],[2245,`In the configuration file, the module name %1% is not a module in the specification.`,!1],[2247,`In computing %1%, TLC expected a %2% expression,
|
|
116
52
|
but instead found %3%.
|
|
117
53
|
%4%`,!1],[2248,`In computing %1%, TLC expected a %2% expression,
|
|
118
54
|
but didn't find one.
|
|
@@ -120,7 +56,7 @@ but didn't find one.
|
|
|
120
56
|
%2%`,!1],[2261,`TLC encountered a temporal formula (%1%) when evaluating a predicate or action.
|
|
121
57
|
%2%`,!1],[2265,`TLC can't handle a number this big.
|
|
122
58
|
%1%`,!1],[2266,`The %1% argument of %2% should be an %3%, but instead it is:
|
|
123
|
-
%4%`,!0],[2280,`In evaluation, the identifier %1% is either undefined or not an operator.
|
|
59
|
+
%4%`,!0],[2272,`The formula %1% at %2% is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. To check that action %1% holds in *every* step of the behavior, define a temporal property: Let A be the formula at %2%; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`,!1],[2273,`The formula %1% at %2% is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. To check that action %1% holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at %2% (compare page 90 of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`,!1],[2274,`The formula %1% at %2% is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. To check that infinitely many %1% steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at %2% (compare page 91 of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`,!1],[2280,`In evaluation, the identifier %1% is either undefined or not an operator.
|
|
124
60
|
%2%`,!1],[2281,`The configuration file substitutes constant %1% with non-constant %2%%3%`,!1],[2283,`The argument of %1% should be a %2%, but instead it is:
|
|
125
61
|
%3%`,!0],[5003,`TLC found an error in the configuration file at line %1%
|
|
126
62
|
The keyword %2% was not followed by an identifier.`,!1],[5004,`TLC found an error in the configuration file at line %1%
|
|
@@ -128,15 +64,27 @@ The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configurat
|
|
|
128
64
|
Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
|
|
129
65
|
It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
|
|
130
66
|
%1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
|
|
131
|
-
`,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]]
|
|
67
|
+
`,!1],[2250,`A state predicate was evaluated to a non-boolean value.`,!1],[2252,`Encountered an action predicate that's not a boolean.`,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]];let Qe;const $e=()=>Qe??=Ze.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),et=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+: ))|\nis an element of a set of \d+-tuples\.$|^In computing ENABLED, TLC encountered a temporal formula \(a (~> b|-\+-> formula)\)\./,tt=e=>et.test(e)?void 0:$e().find(t=>t.pattern.test(e))?.message,nt=t=>t instanceof e.O||tt(t.message)?.isEvalException===!0,rt=/* @__PURE__ */ new Map([[1e3,`
|
|
132
68
|
: `],[2105,`failed.
|
|
133
69
|
`],[2154,`but it produced the following error:
|
|
134
|
-
`],[2213,`:
|
|
135
|
-
`],[2281,` - specifically: `]
|
|
136
|
-
`)
|
|
137
|
-
from outside that declaration's scope.`,ro=(t,n,r,i,a,o)=>{let s=(n,r)=>{let i=(n===void 0?void 0:t.selectorRanges?.[n])??t.location.range;i&&a.errors.push({location:e.B(i),message:r})},c=r.isSuffices===r.isInProof,l=r.statement,u={node:l,isGoal:!0,isSufficesOpen:r.isSuffices};for(let[e,t]of n.slice(1).entries()){let r=e+1,o=u.node;if(t.kind===`Name`){if(n[r-1].kind!==`Name`)return o.kind!==`NewSymbol`&&o.kind!==`AssumeProve`&&eo(o).kind===`Let`?void 0:s(r-1,`A name selector here must be from a LET clause.`);let e=l.kind===`AssumeProve`?[...l.assumptions,l.conclusion]:[l],i=r===1?e.map((e,n)=>({position:n,label:$a(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:o.kind===`Label`?Qa(o.body,t.name):void 0};if(!i?.label)return s(r,`Cannot find label \`${t.name}'.`);if(r===1&&l.kind===`AssumeProve`&&Za(l,i.position)&&c)return s(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${no}`);if(t.args.length!==i.label.params.length)return s(r,`Label \`${t.name}' used with wrong number of arguments.`);u.node=i.label,u.isGoal=!1,u.isSufficesOpen=!1;continue}if(t.kind!==`Operand`)return;let d=to(t.operand);if(u.isSufficesOpen){if(Wa(t.operand,1)!==0)return s(r,o.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);u.isSufficesOpen=!1;continue}if(o.kind===`NewSymbol`)return;if(o.kind!==`AssumeProve`){let e=eo(o);if([`Number`,`Decimal`,`String`].includes(e.kind))return s(r,`Selecting subexpression of expression that has none.`);let n=e.kind===`Identifier`?Ra(e.name,i,a)?.kind:void 0;if(n===`Variable`||n?.startsWith(`New`))return s(r,`Choosing operand \`${d}' of subexpression with no operands.`);let c=Ja(e)?.sets,l=e.kind===`Identifier`?[]:c?c.length>0?c:void 0:e.kind===`Except`?void 0:Ya(e);if(!l)return;let f=Wa(t.operand,l.length);if(f===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);u.node=l[f],u.isGoal=!1;continue}let f=[...o.assumptions,o.conclusion],p=Wa(t.operand,f.length);if(p===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);if(Za(o,p)&&(!u.isGoal||c))return s(r,`Accessing ASSUME/PROVE clause ${no}`);let m=f[p];if(m.kind===`NewSymbol`&&r!==n.length-1)return s(r,`Selected a subexpression of a NEW clause of an ASSUME.`);u.node=m,u.isGoal=!1}o||(u.node.kind===`AssumeProve`&&s(void 0,`Selected ASSUME/PROVE instead of expression.`),u.node.kind===`NewSymbol`&&s(void 0,`Selected a NEW declaration as an expression or operator.`))},io=(t,n)=>{let r=n.isGenerated?void 0:n.hasLabelScope?n.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:n.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return r===void 0||!t.location.range?!1:(n.errors.push({location:e.B(t.location.range),message:r}),!0)},ao=(t,n,r)=>{let i=t.location.range;if(!i||r.isGenerated)return;let a=e.B(i),o=t.params.filter((i,a)=>{let o=Ea(n,i)?.kind===`Parameter`,s=t.paramRanges?.[a];return!o&&s&&r.errors.push({location:e.B(s),message:`Illegal parameter ${i} of label \`${t.name}'.`}),o});o.filter((e,t)=>o.indexOf(e)!==t).forEach(e=>r.errors.push({location:a,message:`Repeated formal parameter ${e} \nin label \`${t.name}'.`})),r.labelParams.filter(e=>!o.includes(e)).forEach(e=>r.errors.push({location:a,message:`Label ${t.name} must contain formal parameter \`${e}'.`}));let s=[...new Set(o.filter(e=>!r.labelParams.includes(e))),...t.params.filter(e=>!o.includes(e))];s.length>0&&r.errors.push({location:a,message:`Label ${t.name} declares extra parameter(s) ${s.map(e=>`${e} `).join(``)}`}),r.labels.has(t.name)&&r.errors.push({location:a,message:`Duplicate label \`${t.name}'.`}),r.labels.add(t.name)},oo=(e,t,n,r)=>{if(!Xa(e))return!1;let i=Ka(e),a=i[0],o=i.length>1&&a.kind===`Name`?Ea(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&ro(e,i,o,t,n,r),o!==void 0},so=(t,n,r,i)=>{let a=t.location;if(vo(t,r,i))return;let o=ya.get(t);if(o!==void 0)return o;if(ba(n))return t.kind===`Apply`?t.args.length:0;let s=Ea(r,n);if(s?.isNonFact){i.errors.push({location:e.B(Ba(t,n)),message:`Step number of non-expression step used as an expression.`});return}if(oo(t,r,i,!1)||Ua(n)&&s)return t.kind===`Apply`?t.args.length:0;if(s&&t.kind!==`OperatorReference`&&(t.resolution=ga),s)return s.arity;let c=La(n,i);if(c)return t.kind===`Identifier`?t.name=c.key:t.operator=c.key,ya.set(t,c.arity),c.arity;let l=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``;if(l!==``&&(Ea(r,l)!==void 0||La(l,i)!==void 0||i.facts.has(l)))return t.kind===`Apply`?t.args.length:0;let u=(t.kind===`Identifier`?void 0:t.spelling)??n,d=e.B(t.kind===`Apply`&&u===`-.`?za(a,`-`):Ba(t,n));if(!Ha(n)||Ua(n)){i.errors.push({location:d,message:`Unknown operator: \`${n}'.`});return}i.errors.push({location:d,message:`Could not find declaration or definition of symbol '${u}'.`});let f=Va(t);f&&a.range&&i.errors.push({location:e.B(a.range),message:`Couldn't resolve ${f} operator symbol \`${u}'.`})},co=(e,t,n)=>(e.forEach(e=>R(e.set,t,n)),e.reduce((e,t)=>Ma(e,Pa(t.pattern),t.pattern.ranges,n),t)),lo=(e,t)=>e.kind===`Identifier`&&e.name===t&&T(e)||Ae(e).some(e=>lo(e,t)),uo=(e,t)=>{e.kind===`FunctionConstruction`&&lo(e.body,t)&&(e.isRecursive=!0),Ae(e).forEach(e=>uo(e,t))},fo=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?Fa(t.bounds):[],labels:/* @__PURE__ */ new Set},o=t.name,s=t.location.range,c=t=>{s&&!a.isGenerated&&a.errors.push({location:e.B(s),message:t})},l=t.kind===`Function`?co(t.bounds,n,a):Na(n,t.params,a),u=Ea(l,o)??Da(o,a,s),d=u?.isPending===!0&&i.has(u);return u?.isPending&&!d?c(`Recursive ${t.kind===`Function`?`function`:`operator`} ${o} defined at wrong LET/IN level.`):u&&!d&&c(t.kind===`Function`?`Function name \`${o}' already defined or declared.`:`Operator ${o} already defined or declared.`),t.kind===`Function`?(R(t.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),uo(t.body,o),t.isSelfReferential=lo(t.body,o)):R(t.body,l,a),u&&d?(u.isPending=!1,u.range=s,!1):t.kind===`Function`?u===void 0:ka(o,Ea(n,o)??Da(o,a,s),{kind:`Definition`,arity:Ca(t),range:s},a)},po=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Ea(e,t.name)?.isPending)return e;let n={name:t.name,arity:Ca(t),params:wa(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>wo(t,e,n),e)};return s(e.reduce((e,t)=>{let a=ba(t.name)?e:s(e,e=>!Sa(t.location,e.location)),o={name:t.name,arity:Ca(t),kind:`Definition`,range:t.location.range,parent:a};if(Ta(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||ba(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return fo(t,a,u,i)?{...o,params:wa(t)}:a},a),()=>!0)},mo=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Ea(t,r)??Da(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},ho=(t,n,r)=>{if(t.kind!==`Identifier`&&t.kind!==`Apply`)return!1;let i=mo(t.kind===`Identifier`?t.name:t.operator,n,r),a=t.kind===`Apply`?t.argumentCounts?.[0]??0:0;if(!i||a===i.arity)return!1;let o=(t.kind===`Apply`?t.argumentRanges?.[0]:void 0)??t.location.range;return o&&r.errors.push({location:e.B(o),message:`The operator ${i.name} requires ${i.arity} arguments.`}),!0},go=(t,n,r)=>{if(ho(t,n,r))return;let i=t.operator,a=Ra(i,n,r),o=so(t,i,n,r);if(o===void 0)return;if(o!==t.args.length){r.errors.push({location:e.B(t.argumentsRange??Ba(t,i)),message:`The operator ${i} requires ${o-(mo(i,n,r)?.arity??0)} arguments.`});return}let s=a&&(a.kind===`Definition`?a.params:[]);if(s===void 0){t.args.forEach(e=>_o(e,n,r));return}let c=(t,n)=>{t&&r.errors.push({location:e.B(t),message:n})};t.args.map((e,a)=>{let o=s[a]??0,l=e.location.range;if(o===0){if(e.kind===`Lambda`&&e.operator!==void 0)c(l,`The operator ${e.operator} requires 1 arguments.`);else if(e.kind===`Lambda`&&l)c(l,`LAMBDA expression used where an expression is required.`);else if(e.kind===`OperatorReference`){let t=so(e,e.operator,n,r);t!==void 0&&c(l,`The operator ${e.operator} requires ${t} arguments.`)}else R(e,n,r);return!0}if(e.kind===`Lambda`){R(e,n,r);let s=e.params.length===o;return!s&&_a.has(e)?c(l,`Expected arity ${o} but found operator of arity ${e.params.length}.`):!s&&l&&e.operator===void 0&&c(t.selectorRanges?.at(-1)??Ba(t,i),`Lambda expression with arity ${e.params.length} used as argument ${a+1} of operator \`${i}', \nbut an operator of arity ${o} is required.`),s}if(e.kind===`Subexpression`)return R(e,n,r),!0;if(e.kind===`Apply`&&e.argumentCounts?.at(-1)===0){let t=e.argumentCounts.findIndex(e=>e>0);return c(e.selectorRanges?.[t],`Selector \`${e.operator.split(`!`)[t]}' should not have argument(s).`),!1}if(e.kind!==`Identifier`&&e.kind!==`OperatorReference`)return c(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${i}', in a position an operator is required.`),!1;let u=e.kind===`Identifier`?e.name:e.operator,d=Ra(u,n,r)?.params??[],f=so(e,u,n,r);return e.kind===`Identifier`&&f!==void 0&&f!==o&&c(Ba(e,u),`Expected arity ${o} but found operator of arity ${f}.`),f===o&&d.every(e=>e===0)}).forEach((e,n)=>{e||c(t.location.range,`Argument number ${n+1} to operator '${i}' \nshould be a ${s[n]}-parameter operator.`)})},_o=(e,t,n)=>{e.kind===`Identifier`?so(e,e.name,t,n):R(e,t,n)},vo=(e,t,n)=>{let r=va.get(e);return r?(r.args.forEach(e=>_o(e,t,n)),n.errors.push(r.error),!0):!1},R=(t,n,r)=>{if(_a.has(t)&&!r.isGenerated){R(t,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>R(e,n,r)),a=e=>({...r,labelParams:[...r.labelParams,...e]});switch(t.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(ho(t,n,r))return;let i=t.name,a=so(t,i,n,r);a!==void 0&&a>0&&r.errors.push({location:e.B(Ba(t,i)),message:`The operator ${i} requires ${a} arguments.`});return}case`OperatorReference`:so(t,t.operator,n,r);return;case`Apply`:go(t,n,r);return;case`Lambda`:R(t.body,Ma(n,t.params,t.paramRanges,r),a(t.params));return;case`And`:case`Or`:i(t.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:R(t.expression,n,r);return;case`If`:i([t.condition,t.consequent,t.alternative]);return;case`Case`:i(t.arms.flatMap(e=>[e.condition,e.body])),t.other&&R(t.other,n,r);return;case`Let`:R(t.body,po(t.definitions,n,r,t.instances),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:R(t.body,co(t.bounds,n,r),a(Fa(t.bounds)));return;case`UnboundedQuantifier`:R(t.body,Ma(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&R(t.set,n,r),R(t.body,Ma(n,Pa(t.pattern),t.pattern.ranges,r),a(Pa(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:R(t.predicate,co([t.bound],n,r),a(Pa(t.bound.pattern)));return;case`SetMap`:R(t.expression,co(t.bounds,n,r),a(Fa(t.bounds)));return;case`FunctionSet`:i([t.domain,t.range]);return;case`Record`:case`RecordSet`:t.fields.forEach((i,a)=>{t.fields.slice(0,a).some(e=>e.name===i.name)&&r.errors.push({location:e.B(i.location.range??za(i.location,i.name)),message:`Non-unique fields in constructor.`}),R(i.value,n,r)});return;case`Except`:R(t.function,n,r),t.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),R(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:i([t.function,...t.args]);return;case`FieldAccess`:R(t.record,n,r);return;case`Product`:i(t.factors);return;case`BoxAction`:case`AngleAction`:i([t.action,t.subscript]);return;case`WeakFairness`:case`StrongFairness`:i([t.subscript,t.action]);return;case`Label`:if(io(t,r))return;R(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),ao(t,n,r);return;case`Subexpression`:if(vo(t,n,r))return;t.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>_o(e,n,r)),oo(t,n,r,!1)}},yo=(t,n,r)=>t.forEach(t=>{if(t.kind===`ModuleFact`||ho(t,n,r)||oo(t,n,r,!0))return;let i=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;t.kind===`Identifier`&&Ea(n,i)?.isNonFact?r.errors.push({location:e.B(Ba(t,i)),message:`Step number of non-fact used as a fact`}):r.facts.has(i)||R(t,n,r)}),bo=(e,t,n)=>(e.set&&R(e.set,t,n),Aa(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),xo=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:bo(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?xo(t,e.scope,e.unit,!0):R(t,e.scope,e.unit),e),{scope:t,unit:n});return R(e.conclusion,i.scope,i.unit),i.scope},So=(e,t,n)=>e.kind===`AssumeProve`?xo(e,t,n):(R(e,t,n),t),Co=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&yo(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>To(t,e,r),t)},wo=(e,t,n)=>{let r=jo(e,t,n);return e.name===void 0?r:Aa(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},To=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=So(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Co(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Co(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return yo(r.facts,t,n),o(t);case`Instance`:return o(wo(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?wo(t,e,i):po([t],e,n),t));case`Have`:case`Case`:return R(r.expression,t,i),Co(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>R(e,t,i)),a(t);case`Take`:return a(Ma(co(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Ma(co(r.bounds,t,i),r.names,r.nameRanges,i);return R(r.body,o,{...i,labelParams:[...i.labelParams,...Fa(r.bounds),...r.names]}),Co(e.proof,a(t),n),a(o)}default:return Co(e.proof,a(t),n),a(t)}},Eo=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:So(e.statement,void 0,t);e.name!==void 0&&ja(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Co(e.proof,n,t),r&&(r.isInProof=!1)},Do={line:0,column:0},Oo=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),ko=(e,t)=>{let n=new Map([...xa,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},Ao=(t,n,r,i,a)=>{let o=t.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(n,r)=>{if(n.arity===0||r.kind!==`Identifier`){R(r,o,a);return}let i=so(r,r.name,o,a);if(i!==void 0&&i!==n.arity)throw new e.O(`An operator must be substituted for symbol '${n.name}', and it must have arity ${n.arity} in the instance of ${t.module} at line ${t.location.line}, column ${t.location.column}`)},c=/* @__PURE__ */ new Map;t.substitutions.forEach(t=>{let r=t.name,i=n.find(e=>e.name===r);if(!i){a.errors.push({location:e.B(t.nameRange),message:`Identifier '${r}' 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 o=t.expression;s(i,o);let l=o.location.range;c.has(r)?l&&a.errors.push({location:e.B(l),message:`Multiple substitutions for symbol '${r}' in substitution.`}):c.set(r,o)});let l=n.filter(e=>!c.has(e.name)),u=e=>!Ea(o,e.name)&&!La(e.name,a);return l.filter(e=>!u(e)).forEach(e=>{let n={kind:`Identifier`,name:e.name,location:t.location};s(e,n),c.set(e.name,n)}),l.filter(u).forEach(n=>{let i=t.location.range,o=n.location.range;i&&o&&a.errors.push({location:e.B(i),message:`Substitution missing for symbol ${n.name} declared at ${e.B(o)} \nand instantiated in module ${r}.`})}),c},jo=(e,t,n)=>{let r=n.getInstance(e);return Ao(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Aa(e,t,r,n),t)},Mo=(e,t,n,r)=>{let i=ko(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Ao(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:Do}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},No=(t,n)=>{let r=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return t.toSorted((e,t)=>Sa(e.location,t.location)?-1:+!!Sa(t.location,e.location)).forEach(t=>{let a=[],o=[];try{t.check(a,o)}catch(t){if(!(t instanceof e.O)||!t.sany&&a.length===0)throw t;a.push(...t.sany?.errors??[])}a.forEach(e=>i(r,e)),o.forEach(e=>i(n,e))}),r},Po=(t,n)=>{let r=ko(t,n.imported),i=/* @__PURE__ */ new Set([...n.facts,...[...t.theorems,...t.assumptions].flatMap(e=>e.name??[])]),a=new Map(t.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),o=new Map([...xa,...n.bound].map(([e,t])=>[e,{...t,position:Do}])),s=/* @__PURE__ */ new Set,c=[],l=(e,t,s,c,l)=>({imported:r,getInstance:n.getInstance,definitions:n.definitions,getKey:n.getKey,location:e,self:t,facts:i,goals:a,bindings:o,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),u=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>ja(e.name,{kind:t,arity:e.arity,range:e.location.range},l(e.location,void 0,n,r,!1))}));return No([...n.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...u(t.constants,`Constant`),...u(t.variables,`Variable`),...t.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=ka(e.name,o.get(e.name),r,l(e.location,void 0,t,n,!1));i&&(o.set(e.name,r),s.add(r)),c.push({declaration:e,binding:i?r:void 0})}})),...t.definitions.map(e=>({location:e.location,check:(n,r)=>{let i=l(e.location,e,n,r,!0);Oo(t,e)?R(e.body,void 0,i):fo(e,void 0,i,s)&&o.set(e.name,{kind:`Definition`,arity:Ca(e),range:e.location.range,position:e.location})}})),...t.instances.map(e=>({location:e.location,check:(t,r)=>{let i=l(e.location,void 0,t,r,!1);Na(void 0,e.params,i),n.instanced.get(e)?.forEach((e,t)=>ja(t,e,i)),e.name!==void 0&&ja(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...t.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=l(e.location,void 0,t,n,e.name!==void 0);R(e.expression,void 0,r),e.name!==void 0&&ja(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...t.theorems.map(e=>({location:e.location,check:(t,n)=>Eo(e,l(e.location,void 0,t,n,e.name!==void 0))})),...t.uses.map(e=>({location:e.location,check:(t,n)=>yo(e.facts,void 0,l(e.location,void 0,t,n,!1))})),{location:t.location.range?.end??t.location,check:t=>c.forEach(n=>{let r=n.declaration.location.range;r&&(!n.binding||n.binding.isPending)&&t.push({location:e.B(r),message:`Symbol ${n.declaration.name} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},Fo=/* @__PURE__ */ new WeakSet,Io=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Ho(e,(e,r)=>Io(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&T(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&T(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Lo=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Ro=/* @__PURE__ */ new WeakMap,zo=e=>Ro.get(e)??e.name,Bo=(e,t)=>(zo(t)!==e.name&&Ro.set(e,zo(t)),e),Vo=(e,t)=>Bo(e.kind===`Function`?{...e,bounds:Lo(e.bounds,e=>t(e,[])),body:t(e.body,Fa(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Ho=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>Vo(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Lo(e.bounds,n),body:t(e.body,Fa(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,Pa(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,Pa(e.bound.pattern))};case`SetMap`:return{...e,bounds:Lo(e.bounds,n),expression:t(e.expression,Fa(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Uo=`LAMBDA`,Wo=e=>`${e}@SUBSTITUTION`,Go=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(Go),Ko=(e,t)=>{if(e.kind!==`Identifier`)return!Go(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=T(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!Go(n.body)},qo=(e,t=/* @__PURE__ */ new Set)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0,r=n===void 0||t.has(n)?[]:[n];return Ho(e,(e,n)=>(r.push(...qo(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Jo=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},Yo=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Xo=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Zo=(e,t)=>e.map(e=>({pattern:Xo(e.pattern,t),set:e.set})),Qo=(e,t)=>e.kind===`Function`?{...e,bounds:Zo(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},$o=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>Bo({...Qo(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Zo(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Xo(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Xo(e.bound.pattern,n),set:e.bound.set}};default:return e}},es=e=>`${e}@ENABLED`,ts=(e,t)=>e.modes.get(t)??e,ns=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!T(e)&&t.instantiation.variables.has(e.name),rs=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>rs(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(ns(e,t,n))return[e.name];let r=T(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?rs(r.body,t,/* @__PURE__ */ new Map):void 0},is=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return ns(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:es(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:ls(e.expression,ts(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[ls(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:ls(e.subscript,ts(t,`Primed`),n),location:r},ls(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=rs(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:es(r),location:e.location},location:e.location},ls({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},as=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:ga}),os=(e,t)=>e.map(e=>as(e.name,t)),ss=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...os(t,r),...i.map(e=>as(e,r))],location:r},location:r}},cs=(e,t)=>e.instantiation.isParameterized(t)?ds(e,t):void 0,ls=(t,n,r)=>{let i=e=>ls(e,n,r),a=n.instantiation,o=a.params,s=e=>!r.has(e)&&!T(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:ls(t.expression,ts(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:ls(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},ts(n,`Enabled`),r)};let c=is(t,n,r);if(c)return c;if(t.kind===`Identifier`&&s(t.name)){let e=a.substitutions.get(t.name),r=n.bindings;if(e&&(r===void 0||!Ko(e,a)))return e;if(e&&r){let n=Wo(t.name);return r.set(n,e),as(n,t.location)}let i=cs(n,t.name);if(i===void 0)return t;if(o.length===0)return{...t,name:i};let s=a.getDefinition(t.name);return s&&Ca(s)>0?ss(i,o,Ca(s),t.location):{kind:`Apply`,operator:i,args:os(o,t.location),location:t.location}}if(t.kind===`Apply`&&s(t.operator)){let r=t.args.map(i),s=a.substitutions.get(t.operator),c=a.substitutions.size>0||o.length>0||Fo.has(t),l=e=>(c&&Fo.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let e=s.kind===`Identifier`?s.name:s.operator;return l({...t,operator:e,args:r,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...t,operator:s.operator,args:[...s.args,...r],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Uo,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:Uo,args:r,resolution:ga},location:t.location};if(s)throw new e.O(`The operator ${t.operator} can only be substituted by an operator at line ${t.location.line}, column ${t.location.column}`);let u=cs(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[...os(o,t.location),...r]}}if(t.kind===`OperatorReference`&&s(t.operator)){let e=cs(n,t.operator);if(e===void 0)return t;let r=a.getDefinition(t.operator);return o.length>0&&r?ss(e,o,Ca(r),t.location):{...t,operator:e}}let l=Jo(n),u=Ho(t,(e,t)=>t.length===0?i(e):ls(e,n,Yo(r,t,l)));return $o(u,r,l)},us=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:as(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},ds=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=Jo(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=Qo(Vo(i,(e,t)=>ls(e,s,Yo(/* @__PURE__ */ new Map,t,a))),a);if(c.kind!==`Operator`||o.size===0)return us(c,r.params,i.location);let l=[...o].map(([e,t])=>({kind:`Operator`,name:e,params:[],body:t,isLocal:!0,isRecursive:!1,location:t.location}));return us({...c,body:{kind:`Let`,definitions:l,body:c.body,location:c.body.location}},r.params,i.location)}):t},fs=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>qo(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>cs(i,e)??e,getQualifiedKey:t=>{let n=cs(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>us(r,e.params,r.location)):t}}},ps=e=>e.kind===`Let`&&e.instances!==void 0||Ae(e).some(ps),ms=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Ho(e,e=>ms(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Sa(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},hs=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,gs=(e,t)=>e.definitions.some(e=>ps(e.body))||e.assumptions.some(e=>ps(e.expression))||e.theorems.some(e=>{let t=hs(e);return t!==void 0&&ps(t)})?{...e,definitions:e.definitions.map(e=>Vo(e,e=>ms(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:ms(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=hs(e);return n===void 0?e:{...e,statement:ms(n,t,[])}})}:e,_s=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),vs={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},ys=(e,t)=>{let n=vs[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},bs=(e,t)=>`${e}${t}`,xs=(e,t,n)=>`${e}${t}${n}`,Ss=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Cs=(e,t,n)=>`${e},${t},${n}`,ws=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Ts=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Es=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Ds=(e,t,n,r)=>({...ws(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Os=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,ks=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,As=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{...Ds(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),js=Ds(`$Set`,0,[2],[1]),Ms=Ds(`$Junction`,0,[3],[1]),Ns=Ds(`$Choose`,0,[2],[1]),Ps=Ds(`$Function`,0,[3],[1]),Fs=Ds(`$FcnApply`,0,[2,2],[1,1]),Is=Ds(`$RcdSelect`,0,[2,0],[1,1]),Ls=Ds(`'`,2,[1],[0]),Rs=Ds(`ENABLED`,1,[2],[0]),zs=Ds(`[]`,3,[3],[0]),Bs=Ds(`$SquareAct`,2,[2,1],[0,0]),Vs=Ds(`$WF`,3,[1,2],[0,0]),Hs=Ds(`$TemporalExists`,3,[3],[0]),Us=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Ws=e=>e.map(e=>({name:e,arity:0})),Gs=(t,n)=>n.location.range?e.R(`${t}.`,n.location.range):new e.O(`${t} at line ${n.location.line}, column ${n.location.column}`),Ks=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),qs=e=>e.kind!==`Let`&&e.kind!==`Label`,Js=t=>{let n=/* @__PURE__ */ new Map,r=(e,n)=>{let r=n.get(e);if(r?.kind===`Formal`)return{kind:`Declared`,name:e,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:h(r.definition,r.scope)};if(t.constants.has(e))return{kind:`Declared`,name:e,level:0,arity:0};if(t.variables.has(e))return{kind:`Declared`,name:e,level:1,arity:0};let i=t.getDefinition(e);if(i){let n=h(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=As.get(e)??_s.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},i=(e,t,n)=>{let r=ws(Math.max(t,...n.map(e=>e.data.level)));return r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(xs(e,n,t))}),t.data.constraints.forEach((e,t)=>Ts(r.constraints,t,e)),Es(r.argConstraints,bs(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Es(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},a=(t,n,r=[],i=[])=>{let a=e=>i.includes(e);if(n.forEach((n,r)=>{if(!(n.operator||n.declared)&&n.data.level>Os(t,r))throw new e.O(`Level error in applying operator ${t.name}:\nThe level of argument ${r+1} exceeds the maximum level allowed by the operator`)}),r.some(e=>e.level>2))throw new e.O(`Level error in applying operator ${t.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let o=e=>{let r=t.formals.findIndex(t=>t.name===e);return r===-1?void 0:n[r]},s=(e,n,r)=>t.conditions.has(Cs(e,n,r)),c=ws(Math.max(t.level,...n.filter((e,n)=>ks(t,n)===1).map(e=>e.data.level),...r.map(e=>e.level)));return t.params.forEach(e=>c.params.add(e)),n.forEach((e,n)=>{ks(t,n)===1&&e.data.params.forEach(e=>c.params.add(e))}),r.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),t.constraints.forEach((e,t)=>Ts(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||Ts(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>Ts(c.constraints,t,e))),n.forEach((e,n)=>e.data.params.forEach(e=>{a(e)||Ts(c.constraints,e,Os(t,n))})),n.forEach((e,t)=>{let r=e.operator;r&&n.forEach((e,n)=>r.formals.forEach((i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>Ts(c.constraints,e,Os(r,a)))}))}),t.argParams.forEach(e=>{let t=Ss(e),n=o(t.operator)?.operator;n&&Ts(c.constraints,t.param,Os(n,t.index))}),[t.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Es(c.argConstraints,t,e))),n.forEach((e,r)=>{let i=e.declared;i&&(Array.from({length:i.arity},(e,n)=>Es(c.argConstraints,bs(i.name,n),t.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&Es(c.argConstraints,bs(i.name,a),e.data.level)})))}),t.argParams.forEach(e=>{let t=Ss(e),n=o(t.operator);n&&Es(c.argConstraints,bs(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a(Ss(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),t.argParams.forEach(e=>{let t=Ss(e),n=o(t.operator);if(n)n.declared&&c.argParams.add(xs(n.declared.name,t.index,t.param));else{let n=o(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(xs(t.operator,t.index,e)))}}),n.forEach((e,t)=>{let r=e.declared;r&&n.forEach((e,n)=>Array.from({length:r.arity},(i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>c.argParams.add(xs(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`){let n=ne(`LAMBDA`,Ws(e.params),e.body,t);return{data:n,operator:n}}let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let i=r(n,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=ws();return e.params.add(n),{data:e,declared:{name:n,arity:i.arity}}}}return{data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=Us(n,Ws(i));return a(e,s(t,o),r.map(e=>m(e,n)),i)},l=(e,t)=>e.kind===`Declared`?i(e.name,e.level,t):a(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw Gs(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw Gs(`Action used where only temporal formula or state predicate allowed`,e);Ks.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&qs(n)&&n.kind!==r)throw Gs(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=h(e,n);t.constraints.forEach((e,t)=>Ts(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Es(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(t,n)=>{try{return ee(t,n)}catch(n){throw!(n instanceof e.O)||n.sany?n:Gs(n.message,t)}},ee=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return ws();case`Identifier`:return l(r(e.name,t),[]);case`Apply`:{let n=s(e.args,t);return d(e,n),l(r(e.operator,t),n)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(Ms,n)}case`Prime`:case`Unchanged`:return c(Ls,[e.expression],t);case`Enabled`:return c(Rs,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(zs,[n])}case`If`:return c(Ms,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(Ms,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=c(Ms,[e.body],t,e.bounds.map(e=>e.set),Fa(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Gs(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?Hs:Ms,[e.body],t,[],e.names);case`Choose`:return c(Ns,[e.body],t,e.set?[e.set]:[],Pa(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(js,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(js,[e.predicate],t,[e.bound.set],Pa(e.bound.pattern));case`SetMap`:return c(js,[e.expression],t,e.bounds.map(e=>e.set),Fa(e.bounds));case`FunctionConstruction`:return c(Ps,[e.body],t,e.bounds.map(e=>e.set),Fa(e.bounds));case`Record`:return c(Ps,e.fields.map(e=>e.value),t);case`RecordSet`:return c(js,e.fields.map(e=>e.value),t);case`Except`:return c(js,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(Fs,[o(e.function,t),e.args.length===1?o(e.args[0],t):{data:c(js,e.args,t)}]);case`Bracket`:return ws();case`FieldAccess`:return a(Is,[o(e.record,t),{data:ws()}]);case`BoxAction`:case`AngleAction`:return c(Bs,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(Vs,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return ws()}},te=(e,t,n=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,r=n,a=t)=>te(e,a,r,i),o=(e,o)=>{let s=r(e,t);s.kind===`Declared`?(n&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,n||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return Ae(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,Us(t,Ws(e.names))),i;default:return Ho(e,(e,r)=>(a(e,n,Us(t,Ws(r))),e)),i}},ne=(e,t,n,r)=>{let i=Us(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=te(n,i),c={...ws(a.level),name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get(bs(e.name,n))??0)),conditions:new Set(t.flatMap((e,n)=>t.flatMap((t,r)=>Array.from({length:e.arity},(e,t)=>t).filter(n=>a.argParams.has(xs(e.name,n,t.name))).map(e=>Cs(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(Ss(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Ss(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},h=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{...ws(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=ne(e.name,i,a,t);return n.set(e,o),o};return{analyze:m,analyzeDefinition:h,toOperand:o}},Ys=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?Ys(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=ws(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Ts(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>Es(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},Xs=(t,n,r,i)=>{let a=Js(n),o=e=>Math.max(0,...e.map(e=>a.analyze(e,/* @__PURE__ */ new Map).level)),s=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?o([t.expression]):t.kind===`Witness`?o(t.expressions):t.kind===`Take`?o(t.bounds.map(e=>e.set)):t.kind===`Pick`?o([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?Ys(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},c=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=e.B(t.statement),r=()=>s(t)===0;return t.body.kind===`Have`||t.body.kind===`Take`||t.body.kind===`Witness`?r()?[]:[{location:n,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:t.body.kind===`Case`?[...r()?[]:[{location:n,message:`Non-constant CASE for temporal goal.`}],...c(t.proof)]:t.body.kind===`Qed`?c(t.proof):[]}):[],l=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=t.body,r=()=>s(t)===3,i=n.kind===`Pick`&&n.bounds.length>0&&r()?n.bounds.filter(e=>o([e.set])!==0).flatMap(t=>t.set.location.range?[{location:e.B(t.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(t.proof),...i,...t.proof?.kind===`Steps`&&r()?c(t.proof):[]]}):[],u=No([...t.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>a.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...t.assumptions.map(e=>({location:e.location,check:()=>a.analyze(e.expression,/* @__PURE__ */ new Map)})),...t.theorems.map(t=>({location:t.location,check:()=>{let n=t.statement.kind===`AssumeProve`?Ys(t.statement,/* @__PURE__ */ new Map,a):a.analyze(t.statement,/* @__PURE__ */ new Map),r=[...l(t.proof),...n.level===3?c(t.proof):[]];if(r.length>0)throw e.L(r)}})),...r],i);if(u.length>0)throw e.L(u,!1,void 0,i)},Zs=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),Qs=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),$s=/* @__PURE__ */ new Set([...Zs,...Qs,`Enabled`]),ec=/* @__PURE__ */ new Set([`~>`,`-+->`]),tc=/* @__PURE__ */ new Set([...ec,`\\cdot`]),nc=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),rc=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),ic=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},ac=(e,t)=>nc.has(e)||t.builtins.get(e)?.isStateLevel===!0,oc=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(Zs.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(Qs.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&ec.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;($s.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&tc.has(e.operator))&&(r[0]|=1),$s.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=ic(e);if(u!==void 0&&!T(e)){let e=t.substitutions.get(u)??u,n=t.definitions.get(e),a=t.constants.has(u),o=t.variableIndex.get(u);if((o!==void 0||t.builtins.get(u)?.isStateLevel)&&(r[0]|=1),o!==void 0&&(l&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:l});else{ac(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),rc.has(u)&&(r[0]|=8),!a&&ac(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=32)}}Ae(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},sc=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],cc=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},lc=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),uc=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=oc(sc(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&14,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=cc(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=cc(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!lc(t[e],l[e*r])))),p=cc(a,r,f,14);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|d[t]&224|p[t]&14:e),words:r}},dc=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?fc(sc(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},fc=(e,t)=>{let n=t.facts.words,r=oc(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=dc(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}lc(e.callee,r[0])||(i[0]|=r[0]&14)}),i},pc=(e,t)=>!(dc(e,t)[0]&1),mc={any:2,repeated:4,streamed:8},hc=(e,t,n=`any`)=>(dc(e,t)[0]&mc[n])!==0,gc=(e,t)=>{let n=dc(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},_c=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},vc=(e,t)=>{let n=fc([e],t);return n[0]&16?void 0:_c(n)},yc=(e,t)=>!!(fc([e],t)[0]&1),bc=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=ir.sets,a=i??[],o=a.length;ir.sets=a;try{return n()}catch(e){throw gd(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,ir.sets=i}},xc=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Sc=e=>!e.includes(void 0),Cc=e=>e.variables.map(()=>void 0),wc=(e,t,n)=>{let r=[...e];return r[t]=n,r},Tc=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},Ec=e=>e.kind===`Identifier`?e.name:void 0,Dc=(e,t,n)=>{if(t.kind===`Label`)return Dc(e,t.body,n);let r=Ec(t);if(r===void 0)return;let i=lu(n,r);if(i?.kind===`Thunk`)return Dc(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=Ku(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?Dc(e,o.body,o.scope):void 0},Oc=(e,t,n)=>{if(t.kind===`Prime`)return Dc(e,t.expression,n);if(t.kind===`Label`)return Oc(e,t.body,n);let r=Ec(t);if(r===void 0)return;let i=lu(n,r);if(i?.kind===`Thunk`)return Oc(e,i.expression,i.scope);if(i)return;let a=Ku(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?Oc(e,a.body,a.scope):void 0},kc=t=>{if(typeof t!=`boolean`)throw new e._(`TLC expected a boolean expression.`);return t},Ac=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),jc=(e,t,n)=>{t===void 0?Sc(n)&&e.onState(n):Sc(n)&&Ac(e)?Nc(e,t,n):t.kind===`Predicate`?Pc(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?Uc(e,t.expression,t.rest,t.scope,n):Mc(e,t,n)&&jc(e,t.rest,n)},Mc=(e,t,n)=>{let r=e.environment,i=H(t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return H(t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?su(t,r.runtime.version):t}})();return!jt(i,a)},Nc=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){Uc(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!Mc(e,r,n):!kc(H(r.expression,xc(e,r.scope,n))))return}e.onState(n)},Pc=(t,n,r,i,a)=>bc(t,n,()=>{switch(n.kind){case`Let`:Pc(t,n.body,r,ld(n.definitions,xc(t,i,a)),a);return;case`Label`:Pc(t,n.body,r,i,a);return;default:if(Vc.has(n.kind))throw new e._(`The state relation is not a boolean expression.`);bc(t,n,()=>Hc(t,n,r,i,a))}}),Fc=(e,t,n,r)=>{kc(t)&&jc(e,n,r)},Ic=(e,t,n,r,i)=>{let a=xc(e,r,i);if(t.kind===`Identifier`){let o=lu(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){Pc(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){Pc(e,o.operator.body,n,o.operator.scope,i);return}let s=o?void 0:e.environment.definitions.get(t.name),c=o?void 0:Ku(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&pc(s,e.environment))){Pc(e,c.body,n,c.scope,i);return}Fc(e,H(t,a),n,i);return}let o=qu(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?Pc(e,o.body,n,ad(o,t.args,a),i):Fc(e,H(t,a),n,i)},Lc=(e,t,n,r,i)=>{let a=n[r];a===void 0?jc(e,t,wc(n,r,i)):jt(a,i)&&jc(e,t,n)},Rc=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),zc=(t,n,r,i,a)=>{let[o,s]=n.args,c=t.isInit?Dc(t,o,i):Oc(t,o,i),l=xc(t,i,a);if(c===void 0){H(n,l)===!0&&jc(t,r,a);return}let u=H(s,l),d=a[c];if(n.operator===`=`){Lc(t,r,a,c,u);return}let f=n.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(d!==void 0)H(n,l)===!0&&jc(t,r,a);else{if(!Mn(f))throw new e._(`The right side of \\IN is not enumerable.`);for(let e of Gn(f))jc(t,r,wc(a,c,e))}},Bc=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Vc=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Hc=(t,n,r,i,a)=>{let o=xc(t,i,a);switch(n.kind){case`Identifier`:Ic(t,n,r,i,a);return;case`Apply`:if(Bc.has(n.operator)&&n.args.length===2){zc(t,n,r,i,a);return}if(n.operator===`=>`&&n.args.length===2){if(kc(H(n.args[0],o))){Pc(t,n.args[1],r,i,a);return}jc(t,r,a);return}Ic(t,n,r,i,a);return;case`And`:{let e=n.operands;if(n.isBulleted||e.length===2){let n=e.slice(1).reduceRight((e,t)=>Rc(`Predicate`,t,i,e),r);Pc(t,e[0],n,i,a);return}let o=e[e.length-1];Pc(t,Tc(n,e.length-1),Rc(`Predicate`,o,i,r),i,a);return}case`Or`:{let e=n.operands;if(n.isBulleted||e.length===2){e.forEach(e=>Pc(t,e,r,i,a));return}Pc(t,Tc(n,e.length-1),r,i,a),Pc(t,e[e.length-1],r,i,a);return}case`Exists`:Du(n.bounds,o,e=>(Pc(t,n.body,r,e,a),!1));return;case`Forall`:{let e=[];if(Du(n.bounds,o,t=>(e.push(t),!1)),e.length===0){jc(t,r,a);return}let i=e.slice(1).reduce((e,t)=>Rc(`Predicate`,n.body,t,e),r);Pc(t,n.body,i,e[0],a);return}case`If`:Pc(t,kc(H(n.condition,o))?n.consequent:n.alternative,r,i,a);return;case`Case`:{let s=n.arms.find(e=>kc(H(e.condition,o)))?.body??n.other;if(s===void 0)throw new e._(`TLC encountered a CASE with no conditions true.`);Pc(t,s,r,i,a);return}case`FunctionApplication`:{let e=Mu(H(n.function,t.isInit?o:pu(o)));if(e){Pc(t,e.body,r,Nu(e,n,o),a);return}break}case`Unchanged`:if(!t.isInit){Uc(t,n.expression,r,i,a);return}break;case`BoxAction`:if(!t.isInit){Pc(t,n.action,r,i,a),Uc(t,n.subscript,r,i,a);return}break;case`AngleAction`:if(!t.isInit){Pc(t,n.action,Rc(`Changed`,n.subscript,i,r),i,a);return}}Fc(t,H(n,o),r,a)},Uc=(e,t,n,r,i)=>bc(e,t,()=>{let a=Dc(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&Lc(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){jc(e,n,i);return}let s=o.reduceRight((e,t)=>Rc(`Unchanged`,t,r,e),n);Uc(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=lu(r,t.name);if(a?.kind===`Thunk`){Uc(e,a.expression,n,a.scope,i);return}let o=a?void 0:Ku(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){Uc(e,o.body,n,o.scope,i);return}}let o=e.environment,s=H(t,{environment:o,scope:r,state:e.current,next:void 0}),c=H(t,{environment:o,scope:r,state:i,next:void 0});jt(s,c)&&jc(e,n,i)}),Wc=(e,t,n,r,i=!1)=>{let a=e.callStack;if(!a)throw Error(`The replay needs an environment that records its call stack`);return{environment:e,callStack:a,isInit:t,isEnabled:i,current:n,onState:r}},Gc=/* @__PURE__ */ Error(`The replay found a successor`),Kc=(e,t,n,r)=>{let i=Wc(r,!1,n,()=>{throw Gc},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Rc(`Changed`,e.subscript,t,void 0);Pc(i,e.action,n,t,Cc(r))}else Pc(i,e,void 0,t,Cc(r));return!1}catch(e){if(e!==Gc)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},qc=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=Wc(t,!0,void 0,n),o=i.reduceRight((e,t)=>Rc(`Predicate`,t.expression,t.scope,e),void 0);Pc(a,r.expression,o,r.scope,Cc(t))},Jc=(e,t,n,r)=>{e.some(e=>Vc.has(e.expression.kind))||e.forEach(e=>{let i=[],a=Wc(n,!1,t,e=>i.push(e));Pc(a,e.expression,void 0,e.scope,Cc(n)),i.forEach(t=>r(t,e))})},Yc=/* @__PURE__ */ new WeakMap,Xc=/* @__PURE__ */ new WeakMap,z=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Zc=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Qc=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,$c=(t,n)=>{let r=new e._(n);return t.isInit?r:e.q(r,e.G.error)},el=(e,t,n,r)=>{let i=Zl(n);return r&&Vc.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${Qc(e)}, TLC expected a boolean expression,\nbut instead found ${F(t)}.\n${i}`},tl=(e,t,n)=>{let r=_i(t),i=B(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${Qc(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
138
|
-
`:``}${i}`},nl=(e,t,n)=>rl(e,t,H(t,n)),rl=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;throw $c(e,el(e,n,t,r))},il=(e,t,n,r)=>r.environment.callStack?H(n,r):(e[t]??=yd(n,r.environment))(r),al=e=>e===`=`||e===`\\in`||e===`\\subseteq`,ol=(e,t,n)=>{let r=n?Yc:Xc,i=r.get(e);if(i)return i;let a=Ll(e,t,n);return r.set(e,a),a},sl=(e,t)=>{if(t.constants.has(e))return;let n=gu(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},cl=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return cl(e.expression,t,!1,r);if(e.kind!==`Identifier`||T(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=sl(e.name,t);if(a&&!r.has(a))return r.add(a),cl(a.body,t,n,r)},ll=(e,t,n)=>cl(e,t,!n),ul=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return ul(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=ld(e.definitions,z(r,t,n));return ul(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=lu(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return ul(a.expression,a.scope,n,r,i);if(a)return;let o=r.environment.variableIndex.get(e.name);if(o!==void 0)return i?void 0:o;let s=sl(e.name,r.environment);if(s)return ul(s.body,void 0,n,r,i)},dl=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||T(e))||!t&&e.kind===`Prime`,fl=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>fl(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[r];let i=sl(e.name,t);if(i)return n.add(e.name),fl(i.body,t,n)},pl=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),ml=(e,t,n)=>pl.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||al(e.operator)&&(dl(e.args[0],n)||ll(e.args[0],t,n)!==void 0)||T(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,hl=/* @__PURE__ */ new Set,gl=(e,t)=>{if(T(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Ho(e,(e,i)=>{let a=r.isReadOnly?gl(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},_l=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||T(e)?void 0:gu(r,t);return i&&!n.has(i)&&(n.add(i),_l(i.body,t,n))?!0:Ae(e).some(e=>_l(e,t,n))},vl=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=ll(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=fl(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return ml(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:ol(e,t,n)}},yl=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(vc(e,t)===void 0||_l(e,t,/* @__PURE__ */ new Set))return!0;let n=gl(e,hl);return!n||n.some(e=>r.has(e))}),o=a===-1?i.length:a;if(o!==0)return{names:n,guards:i.slice(0,o),rest:i.slice(o)}},bl=(e,t,n)=>{let r=e.map(e=>vl(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Ac(t);for(let s=e;s<r.length;s++){if(s>0&&f&&zl(u)){d??=z(t,n,u);for(let e=s;e<r.length;e++){let n=r[e].expression,i=il(a,e,n,d);if(!rl(t,n,i,!1))return}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=z(t,n,u);let r=il(i,s,e.expression,d);if(!rl(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=z(t,n,u);let r=il(i,s,e.value,d),a=u[e.index];if(a===void 0)u=Zc(u,e.index,r),d=void 0;else if(!jt(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let t of e.indices){let e=(r??u)[t];if(e===void 0)r??=u.slice(),r[t]=n[t];else if(!jt(e,n[t]))return}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},xl=e=>(t,n,r,i,a,o)=>{nl(t,e,z(t,n,r))&&o(r,i)},Sl=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=z(r,i,a);if(a[l]!==void 0){nl(r,e,u)&&c(a,o);return}let d=H(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Mn(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${Qc(r)}, the right side of \\IN is not enumerable.`;throw $c(r,`${t}\n${B(e)}`)}let p=Gn(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(Zc(a,l,p[e]),o)}},Cl=/* @__PURE__ */ new WeakMap,wl=e=>{let t=Cl.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(wl),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Cl.set(e,n),n},Tl=(e,t)=>{let n=e.args[0],r=xl(e),i=(e,r,i)=>ul(n,r,i,e,!t)??-1,a=Sl(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=H(e.args[1],z(t,n,o));l(Zc(o,u,d),s)}},El=(e,t,n)=>{let r=B(e);return(i,a,o,s,c,l)=>{let u=z(i,a,o),d=H(e.function,n?u:pu(u)),f=Mu(d);if(f!==void 0){ol(f.body,t,n)(i,Nu(f,e,u),o,s,c,l);return}if(!O(d))throw $c(i,`In computing ${Qc(i)}, a non-function (${_i(d)}) was applied as a function.\n${r}`);let p=H(e,u);if(typeof p!=`boolean`)throw $c(i,`In computing ${Qc(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Dl=(e,t)=>{if(fl(e,t))return bl([wl(e)],t,!1);if(e.kind===`Tuple`)return ol(wl(e),t,!1);let n=wl(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?lu(i,e.name):void 0;l?.kind===`Thunk`&&!l.isReleased?ol(wl(l.expression),t,!1)(r,l.scope,a,o,s,c):nl(r,n,z(r,i,a))&&c(a,o)}},Ol=(e,t,n)=>{let r=e.operator,i=xl(e),a=T(e)?void 0:Ku(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=wd(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=ol(a.body,t,n),o.body(e,i(z(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=z(a,o,s),f=qu(e,d);f?.kind===`Closure`?ol(f.body,t,n)(a,ad(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},kl=(e,t,n)=>{let r=xl(e),i=T(e)?void 0:sl(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=lu(s,e.name);f?.kind===`Thunk`&&!f.isReleased?ol(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=ol(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Al=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||T(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!T(i))return;let a=cl(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},jl=e=>e.kind===`And`?e.operands.flatMap(jl):[e],Ml=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&ml(e,t,!1),Nl=e=>{let t=[];return(n,r,i)=>{let a=z(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!rl(n,i,il(t,r,i,a)))return}}},Pl=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=jl(e),r=n.findIndex(e=>!Ml(e,t)||Al(e,t)),i=r===-1?void 0:Al(n[r],t);return i?{...i,before:r===0?void 0:Nl(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>Pl(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||T(e))return;let r=Ku(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Pl(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(!i||o?.kind!==`Identifier`||!T(o))return;let s=i.before,c=s&&wd(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(z(e,t,n)),n))}},Fl=(e,t,n)=>{let r=lu(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},Il=(e,t,n)=>{let r=e.map(e=>ol(e,t,n)),i=n?[]:e.map(e=>Pl(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&Fl(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},Ll=(t,n,r)=>{let i=e=>ol(e,n,r);switch(t.kind){case`And`:return bl(t.operands,n,r);case`Or`:return Il(t.operands,n,r);case`Exists`:{let e=i(t.body),a=t.bounds[0];if(t.bounds.length===1&&a.pattern.kind===`Name`){let t=a.pattern.name;return(r,i,o,s,c,l)=>{let u=bu(H(a.set,z(r,i,o)),a.set,n.runtime.version);for(let n=0;n<u.length&&!r.isStopped;n++)e(r,uu(i,t,u[n]),o,s,c,l)}}let o=r?void 0:yl(t,n);if(o){let e=bl(o.rest,n,r);return(r,i,a,s,c,l)=>{let u=z(r,i,a),d=t.bounds.map(e=>bu(H(e.set,u),e.set,n.runtime.version));if(d.some(e=>e.length===0))return;let f=(t,n)=>{if(t<0)e(r,n,a,s,c,l);else for(let e of d[t]){if(r.isStopped)return;let i=uu(n,o.names[t],e);if(t===d.length-1){let e=z(r,i,a);if(!o.guards.every(t=>nl(r,t,e)))continue}f(t-1,i)}};f(d.length-1,i)}}return(n,r,i,a,o,s)=>{Du(t.bounds,z(n,r,i),t=>(e(n,t,i,a,o,s),n.isStopped))}}case`Forall`:{let e=i(t.body),a=!r&&vc(t,n)!==void 0&&!_l(t.body,n,/* @__PURE__ */ new Set)?gl(t,hl):void 0;return(n,r,i,o,s,c)=>{let l=[];Du(t.bounds,z(n,r,i),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>lu(r,e)?.kind===`Value`)){u.every(e=>nl(n,t.body,z(n,e,i)))&&c(i,o);return}let d=(r,i,a)=>{r===u.length?c(i,a):r>0&&n.isInit&&zl(i)?u.slice(r).every(e=>nl(n,t.body,z(n,e,i)))&&c(i,a):e(n,u[r],i,a,!0,(e,t)=>d(r+1,e,t))};d(0,i,o)}}case`If`:{let e=i(t.consequent),n=i(t.alternative);return(r,i,a,o,s,c)=>{let l=H(t.condition,z(r,i,a));if(typeof l!=`boolean`)throw $c(r,tl(r,l,t));(l?e:n)(r,i,a,o,s,c)}}case`Case`:{let e=t.arms.map(e=>({condition:e.condition,source:e.body,body:i(e.body)})),n=t.other?i(t.other):void 0;return(r,i,a,o,s,c)=>{let l=z(r,i,a),u=e.find(e=>{let t=H(e.condition,l);if(typeof t==`boolean`)return t;throw $c(r,`In computing ${Qc(r)}, a non-boolean expression${r.isEnabled?``:` `}(${_i(t)}) was used as a guard condition of a CASE.\n${Zl(e.source)}`)})?.body??n;if(!u)throw $c(r,`In computing ${Qc(r)}, TLC encountered a CASE with no conditions true.\n${B(t)}`);u(r,i,a,o,s,c)}}case`Let`:{let e=i(t.body),r=dd(t.definitions,n);return(n,i,a,o,s,c)=>e(n,ld(t.definitions,z(n,i,a),r),a,o,s,c)}case`Unchanged`:return r?()=>{throw new e._(`UNCHANGED appears in an initial predicate at ${Yl(t)}`)}:Dl(t.expression,n);case`AngleAction`:{let e=i(t.action),r=wl(t.subscript),a=(e,t,i)=>{try{return nl(e,r,z(e,t,i))}catch(t){throw e.isEnabled?su(t,n.runtime.version):t}};return(t,n,r,i,o,s)=>e(t,n,r,i,o,(e,r)=>{a(t,n,e)||s(e,r)})}case`BoxAction`:return i({kind:`Or`,operands:[t.action,wl(t.subscript)],location:t.location});case`Label`:return i(t.body);case`Identifier`:return kl(t,n,r);case`FunctionApplication`:return El(t,n,r);case`Apply`:{let e=t.args;if(al(t.operator)){let i=ll(e[0],n,r);if(i!==void 0)return t.operator===`=`?bl([t],n,r):Sl(t,()=>i);if(dl(e[0],r))return Tl(t,r)}if(t.operator===`=>`){let t=i(e[1]);return(n,r,i,a,o,s)=>{let c=H(e[0],z(n,r,i));(typeof c==`boolean`?c:hu(c,`the left side of => at ${Yl(e[0])}`))?t(n,r,i,a,o,s):s(i,a)}}return Ol(t,n,r)}default:return xl(t)}},Rl=e=>e.variables.map(()=>void 0),zl=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Bl=(t,n)=>{let r=n.state;if(!r||!zl(r))throw new e._(`ENABLED needs a complete state at ${Yl(t)}`);let i=n.environment;if(i.callStack)return Kc(t,n.scope,r,i);let a={environment:i,isInit:!1,isEnabled:!0,current:r,isStopped:!1};return ol(t,i,!1)(a,n.scope,Rl(i),void 0,!1,()=>{a.isStopped=!0}),a.isStopped},Vl=(t,n,r,i)=>{let a={environment:n,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};ol(t,n,!0)(a,i,Rl(n),void 0,!1,t=>{if(!a.isStopped){if(!zl(t))throw e.q(new e.v([...t]),e.G.error);a.isStopped=r(t)}})},Hl=(e,t,n)=>{let r=[];return Vl(e,t,e=>(r.push(e),!1),n),r},Ul=(t,n,r,i,a)=>{let o={environment:r,isInit:!1,isEnabled:!1,current:n,isStopped:!1},s={successors:0};return ol(t,r,!1)(o,a,Rl(r),void 0,!1,(t,n)=>{if(!o.isStopped){if(!zl(t)){let i=r.variables.filter((e,n)=>t[n]===void 0);throw new e.y(`Successor state is not completely specified by action ${n??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,t,n,i)}s.successors++,o.isStopped=i({state:t,action:n})}}),s.successors},Wl=(e,t,n,r)=>{let i=[];return Ul(e,t,n,e=>(i.push(e),!1),r),i},Gl=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Kl=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),ql=e=>Kl.has(e.kind)||e.kind===`Apply`&&Gl.has(e.operator),Jl=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&Ve(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Yl=e=>`line ${e.location.line}, column ${e.location.column}`,Xl=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,B=e=>{let t=e.location.range;return t?Xl(t):Yl(e)},Zl=e=>e.kind===`Number`?e.text??String(e.value):B(e),Ql=(t,n)=>new e._(`A non-boolean expression (${_i(n)}) was used as the condition of an IF.\n${B(t)}`),$l=(t,n,r)=>{let i=t.location.range;if(i?.start.line===t.location.line&&i.start.column===t.location.column||!i)return new e._(`A non-boolean expression (${_i(r)}) was used as a formula in a ${t.kind===`And`?`conjunction`:`disjunction`}.\n${Zl(t.operands[n])}`);let a=t.prefixEnds?.[Math.max(n,1)-1]??i.end;return new e._(`Attempted to evaluate an expression of form P ${t.kind===`And`?`/\\`:`\\/`} Q when ${n===0?`P`:`Q`} was\n${_i(r)}.\n${B({...t,location:{...t.location,range:{...i,end:a}}})}`)},eu=t=>{let n=t.field,r=e=>`Attempted to select nonexistent field "${n}" from the record\n${F(e)}\n${B(t)}`,i=e=>`Attempted to apply function:\n${E(F(e))}\nto argument "${n}", which is not in the domain of the function.`;return a=>{if(!O(a))throw new e._(`Attempted to select field "${n}" from a non-record value ${E(F(a))}\n${B(t)}`);let o=Ct(a);if(o===`tuple`)throw mr(n);return _r(a,n,o===`record`?r:i)}},tu=e=>e===`1.7.4`?(t,n)=>dr(t,n,e):void 0,nu=t=>n=>{if(!O(n))throw new e._(`Attempted to apply the operator DOMAIN to a non-function\n(${_i(n)})\n${B(t)}`);return yr(n)},ru=(t,n)=>(r,i)=>{if(!D(r)||dt(r))throw new e._(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${B(t)}`);return n.evaluate([r,i])},iu=t=>e.q(new e._(`TLC can't handle real numbers: ${t.text} at ${Yl(t)}`),e.G.configParseError),au=t=>e.q(new e._(`TLC can't handle a number this big: ${t.text??t.value} at ${Yl(t)}`),e.G.error),ou=(t,n)=>new e.A(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${B(n)}`,t),su=(t,n)=>t instanceof e.A&&n!==`1.7.4`?new e._(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${t.variable} occurring in the state formula v.\n`):t,cu=t=>new e._(`A primed expression appears outside an action at ${Yl(t)}`),lu=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},uu=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),du=(t,n,r)=>{if(n.kind===`Name`)return uu(t,n.name,r);let i=nr(r);if(!i||i.length!==n.names.length)throw new e._(`Cannot bind <<${n.names.join(`, `)}>> to ${F(r)}, which is not a tuple of that length`);return n.names.reduce((e,t,n)=>uu(e,t,i[n]),t)},fu=(t,n)=>{if(O(t))return t;throw new e._(`A non-function (${_i(t)}) was applied as a function.\n${B(n)}`)},pu=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},mu=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),hu=(t,n)=>{if(typeof t!=`boolean`)throw new e._(`Expected ${n} to be a boolean but found ${F(t)}`);return t},gu=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),_u=(e,t)=>{let n=`universally (\\A) or existentially (\\E) quantify over ${t}, because this would require checking an\ninfinite number of cases.`;if(typeof e==`object`&&e.kind===`SequenceSet`)return`In TLA+, Seq(S) represents the set of all finite sequences whose elements come from the set S. Even when S\nis a finite set, the number of possible sequences in Seq(S) is unbounded because sequences can have any\nfinite length (e.g., length 0, 1, 2, and so on). As a result, TLC cannot evaluate expressions that\n${n} Note that for a finite set of sequences s, TLC handles s \\subseteq Seq(S).\nSee https://explain.tlapl.us/seq-unenumerable for additional details.`;if(typeof e==`object`&&e.kind===`InfiniteSet`&&e.name!==`STRING`&&e.name!==`Any`)return`The set ${e.name} contains infinitely many elements. As a result, TLC cannot evaluate expressions that\n${n} Note that TLC handles set membership like T \\subseteq ${e.name} for any finite set T.`},vu=(t,n,r)=>{if(!D(t)||dt(t)){let i=F(t),a=r===`1.7.4`?void 0:_u(t,i);throw new e._(a===void 0?`TLC encountered a non-enumerable quantifier bound\n${i}.\n${Zl(n)}`:`TLC encountered the non-enumerable quantifier bound\n${i}\n${Zl(n)}\n${a}`)}},yu=(e,t,n)=>(vu(e,t,n),typeof e==`object`&&e.kind===`Interval`?En(e):zn(e)??Wn(e)),bu=(e,t,n)=>n===`1.7.4`?(vu(e,t,n),zn(e)??Gn(e)):yu(e,t,n),xu=e=>{if(typeof e==`object`&&e.kind===`Interval`)return Qn(e),e},Su=(e,t,n)=>xu(e)??bu(e,t,n),Cu=(e,t,n)=>xu(e)??yu(e,t,n),wu=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},Tu=(e,t)=>e.map(e=>Su(H(e.set,t),e.set,t.environment.runtime.version)),Eu=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):wu(t[n],t=>i(n-1,du(a,e[n].pattern,t)));return i(e.length-1,n)},Du=(e,t,n)=>Eu(e,Tu(e,t),t.scope,n),Ou=(e,t)=>{let n=e.map(e=>H(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},ku=(e,t,n)=>{if(e.length===1)return du(t,e[0].pattern,n);let r=nr(n)??[];return e.reduce((e,t,n)=>du(e,t.pattern,r[n]),t)},Au=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,ju=e=>Object.assign(e.value,{lambda:e}),Mu=e=>Au(e)?e.lambda:void 0,Nu=(t,n,r)=>{let i=t.value,a=n.args.map(e=>H(e,r)),o=a.length===1?a[0]:A(a),s=(e,t,r)=>`In applying the function\n${E(F(i))},\nthe ${e} is:\n${E(F(t))}${r}.\n${B(n.function)}`,c=t.bounds;if(c.length===1){if(!or(o,i.domain))throw new e._(s(`first argument`,o,`which is not in its domain`));return ku(c,t.scope,o)}let l=nr(o),u=typeof i.domain==`object`&&i.domain.kind===`ProductSet`?i.domain.factors:[];if(l===void 0||l.length<c.length)throw new e._(`Attempted to apply a function to an argument not in its domain.\n${B(n.function)}`);return c.forEach((t,n)=>{let r=l[n],i=`argument number ${n+1}`;if(!or(r,u[n]))throw new e._(s(i,r,`${t.pattern.kind===`Name`?``:`
|
|
139
|
-
`}which is not in its domain`));if(t.pattern.kind===`Tuple`&&nr(r)?.length!==t.pattern.names.length)throw new e._(s(i,r,`which does not match its formal parameter`))}),ku(c,t.scope,A(l.slice(0,c.length)))},Pu=(e,t)=>{let n=t.location.range;if(n)return{parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:Xl(n)}},Fu=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},Iu=(e,t,n)=>{let r={kind:`LazyFunction`,domain:e,source:n,apply:e=>t(e,r)};return r},Lu=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),Ru=(e,t)=>{let n=Ou(e.bounds,t),r=Iu(n,(n,r)=>H(e.body,mu(t,ku(e.bounds,uu(void 0,e.name,r),n))),Fu(Pu(e.bounds,e.body),e.bounds,n));return ju({value:r,bounds:e.bounds,body:e.body,scope:uu(void 0,e.name,r)}),e.bounds.length===1?wt(r):r},zu=(t,n)=>{if(typeof n!=`object`||Ct(n)!==`lambda`||t.kind===`Operator`||t.isSelfReferential||n.kind!==`LazyFunction`||!Ve(n.domain))return n;try{let e=P(n);return bt(e.domain,e.range)}catch(t){if(t instanceof e._)return n;throw t}},Bu=(t,n)=>t.kind===`Operator`&&t.params.length>0?()=>{throw new e._(`Operator ${t.name} requires ${t.params.length} arguments`)}:t.kind===`Function`?t.isSelfReferential?e=>Ru(t,e):yd(Lu(t),n):yd(t.body,n),Vu=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=Bu(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(mu(e,void 0)):e=>a[i]??r(mu(e,void 0));return t.definitionEvaluators.set(e,o),o},Hu=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},Uu=(t,n)=>t.forEach(t=>{if(t.kind===`Operator`&&t.params.length>0)return;let r=t.name;if(n.constants.has(r)||n.substitutions.has(r)||!pc(t,n))return;let i=n.facts.ids.get(t);if(i===void 0||n.startupValues[i]!==void 0)return;let a={environment:n,scope:void 0,state:void 0,next:void 0};try{let e=n.runtime.evaluateAtStartup(()=>zu(t,Bu(t,n)(a)));un(e),n.startupValues[i]=e}catch(t){if(!(t instanceof e._)&&!e.W(t))throw t}}),Wu=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(e.cache!==void 0&&(n||e.isReleased))return e.cache;let r=H(e.expression,mu(t,e.scope));return n&&(!e.isStreamed||qn(r))&&(e.cache=r),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),r},Gu=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),Ku=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Ku(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Gu(r):t.builtins.get(e)},qu=(e,t)=>T(e)?Ju(e.operator,t):Ku(e.operator,t.environment)??Ju(e.operator,t),Ju=(e,t)=>{let n=lu(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Ku(e,t.environment)},Yu=e=>e.kind===`Closure`?e.params.length:e.arity,Xu=(t,n)=>{if(t.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:t.params.map(e=>({name:e,arity:0})),body:t.body,scope:n.scope};let r=t.kind===`OperatorReference`?t.operator:t.kind===`Identifier`?t.name:void 0,i=r===void 0?void 0:Ju(r,n);if(!i)throw new e._(`Expected an operator argument at ${Yl(t)}`);return i},Zu=(e,t,n)=>{if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>uu(e,n.name,t[r]),e.scope);return H(e.body,mu(n,r))},Qu=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Yu(e),call:n=>Zu(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},$u=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Ju(e.name,t);return n!==void 0&&Yu(n)>0},ed=(e,t)=>e.map(e=>$u(e,t)?Qu(Xu(e,t),t):H(e,t)),td=(t,n)=>new e._(`Operator ${t.name} expects ${t.params.length} arguments but received ${n}`),nd=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),rd=(e,t)=>{let n=t.variableIndex.get(e);if(n!==void 0)return{kind:`Variable`,index:n};let r=t.constants.get(e);if(r!==void 0)return{kind:`Value`,value:r};let i=t.substitutions.get(e);if(i!==void 0)return rd(i,t);let a=t.definitions.get(e);if(a)return{kind:`Definition`,definition:a};let o=t.builtins.get(e);if(o&&o.arity===0&&!o.isStateLevel)return{kind:`Value`,value:o.evaluate([])}},id=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&We(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=T(e)?void 0:rd(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=lu(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:nd(e,t)}}return t=>nd(e,t)},ad=(e,t,n,r)=>{if(t.length!==e.params.length)throw td(e,t.length);let i=e.scope;for(let a=0;a<t.length;a++){let o=e.params[a],s=o.arity>0?{kind:`Operator`,operator:Xu(t[a],n)}:(r?.[a]??id(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},od=(e,t,n,r)=>e.kind===`Closure`?H(e.body,mu(n,ad(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>H(e,n))):e.isLazy?e.evaluate(Sd(t,n),n):e.evaluate(ed(t,n),n),sd=/* @__PURE__ */ new WeakMap,cd=e=>{let t=sd.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return sd.set(e,n),n},ld=(e,t,n)=>e.reduce((e,r)=>{let i={name:r.name,binding:{kind:`Value`,value:!1},parent:e};return r.kind===`Function`?(i.binding={kind:`Thunk`,expression:cd(r),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1},i):r.params.length>0||n?.impure.has(r)?(i.binding={kind:`Operator`,operator:{kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:i}},i):(i.binding={kind:`Thunk`,expression:r.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(r)??!1},i)},t.scope),ud=(t,n,r)=>{let i=lu(r.scope,t);if(i?.kind===`Value`)return i.value;if(i?.kind===`Thunk`)return Wu(i,r);if(i?.kind===`Operator`){if(Yu(i.operator)===0)return Zu(i.operator,[],r);throw new e._(`Operator ${t} is used without arguments`)}let a=rd(t,r.environment);if(a?.kind===`Variable`){let e=r.state?.[a.index];if(e===void 0)throw ou(t,n);return e}if(a?.kind===`Value`)return a.value;if(a?.kind===`Definition`)return Vu(a.definition,r.environment)(r);let o=r.environment.builtins.get(t);if(o?.arity===0)return o.evaluate([],r);throw new e._(`Unknown identifier ${t} at ${Yl(n)}`)},dd=(e,t)=>({impure:new Set(e.filter(e=>hc(e,t))),streamed:new Set(e.filter(e=>hc(e,t,`streamed`)))}),fd=e=>[...e.facts.ids.keys()].some(t=>hc(t,e)),pd=e=>[...e.facts.ids.keys()].some(t=>hc(t,e,`repeated`)),md=e=>typeof e==`object`&&e.kind===`FilteredSet`&&`rebind`in e,hd=(e,t,n,r)=>i=>{r.expressions.push(e);let a=ir.sets,o=ir.callStack,s=a??[],c=s.length;ir.sets=s,ir.callStack=r;try{let a=t(i),o=md(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&ql(e)&&r.sources.set(o,e),o}catch(t){let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Jl(e,r.values),a=i&&!Ae(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!O(a)?void 0:a;throw gd(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,ir.sets=a,ir.callStack=o}},gd=(t,n,r)=>{let i=[...new Set(n)].flatMap(e=>{let n=typeof e==`object`?t.sources.get(e):void 0;return n?[n]:[]});if(i.length>0&&r instanceof e._){t.isFrozen||t.expressions.push(...i);let e=t.fingerprint;t.fingerprint={sources:[...i,...e?.sources??[]],reason:e?.reason??r.message}}t.isFrozen=!0},_d=(t,n,r)=>{if(!(r instanceof e._))return;t.isFrozen||t.expressions.push(n),t.isFrozen=!0;let i=t.fingerprint;t.fingerprint={sources:[n,...i?.sources??[]],reason:i?.reason??r.message}},vd=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),V=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Bd(e,t),i=t.callStack,a=i?hd(e,r,t,i):r;return t.evaluators.set(e,a),a},yd=(e,t)=>{if(t.callStack)return V(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=Vi(e,t)??V(e,t);return t.entryEvaluators.set(e,r),r},H=(e,t)=>yd(e,t.environment)(t),bd=(e,t)=>{let n=e.name,r=T(e)?void 0:rd(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw ou(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n={reference:void 0};return r=>(n.reference??=Vu(e,t))(r)}return t=>ud(n,e,t)},xd=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||T(e))return!0;let n=Ku(e.name,t);return n===void 0||Yu(n)===0},Sd=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>H(e,t),expression:e})),Cd=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Sd(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&xd(t[0],n)){let e=V(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&xd(t[0],n)&&xd(t[1],n);if(i&&a){let e=V(t[0],n),r=V(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(ed(t,n),n)},wd=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw td(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:id(e,n));return n=>{let a=e.scope;for(let e=0;e<t.length;e++){let o=i[e],s=o?o(n):{kind:`Operator`,operator:Xu(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Td=(e,t,n)=>{let r=wd(e,t,n),i={body:void 0};return t=>(i.body??=yd(e.body,n),i.body({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},Ed=(t,n)=>{let r=t.args;if(t.operator===`=>`){let e=V(r[0],n),t=V(r[1],n);return n=>!hu(e(n),`the left side of =>`)||hu(t(n),`the right side of =>`)}if(t.operator===`~>`)return()=>{throw new e._(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let i=T(t)?void 0:Ku(t.operator,n);if(i?.kind===`Closure`)return Td(i,r,n);if(i?.kind===`Builtin`&&i.name===`DOMAIN`){let e=V(r[0],n),i=nu(t);return t=>i(e(t))}if(i?.kind===`Builtin`&&i.name===`TLCEval`&&r.length===1){let e=V(r[0],n);return Fo.has(t)||yc(r[0],n)?e:t=>t.scope===void 0?i.evaluate([e(t)]):e(t)}if(i?.kind===`Builtin`&&i.name===`\\subseteq`&&r.length===2){let e=V(r[0],n),a=V(r[1],n),o=ru(t,i);return t=>o(e(t),a(t))}if(i?.kind===`Builtin`)return Cd(i,r,n);if(t.operator===`\\cdot`&&r.length===2)return()=>{throw new e._(n.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let a=r.map(e=>id(e,n));return i=>{let o=Ju(t.operator,i);if(o)return od(o,r,i,a);throw n.definitions.get(t.operator)?.kind===`Function`?new e._(`${t.operator} is a function; apply it with brackets`):new e._(`Unknown operator ${t.operator} at ${Yl(t)}`)}},Dd=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=V(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=V(a.set,t);return s=>wu(Su(o(s),a.set,t.runtime.version),t=>hu(i(mu(s,uu(s.scope,e,t))),r)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>V(e.set,t));return s=>{let c=a.map((e,n)=>Su(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?hu(i(mu(s,a)),r)!==n:wu(c[t],n=>l(t-1,uu(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>Du(o,e,t=>hu(i(mu(e,t)),r)!==n)?!n:n},Od=(e,t)=>{if(e.kind===`Tuple`)return A(e.names.map(e=>{let n=lu(t,e);return n?.kind===`Value`&&n.value}));let n=lu(t,e.name);return n?.kind===`Value`?n.value:void 0},kd=/* @__PURE__ */ new WeakSet,Ad=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&kd.add(e)},jd=/* @__PURE__ */ new WeakMap,Md=e=>{if(jd.has(e))return jd.get(e);let t=/* @__PURE__ */ new Set,n=e=>e.kind!==`Subexpression`&&(e.kind===`Identifier`&&t.add(e.name),(e.kind===`Apply`||e.kind===`OperatorReference`)&&t.add(e.operator),e.kind===`ExceptAt`&&t.add(`@`),Ae(e).every(n)),r=n(e)?[...t]:void 0;return jd.set(e,r),r},Nd=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=lu(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),Pd=(t,n)=>{let r=kd.has(t),i=V(t.body,n),a=t.bounds,o=a[0],s=a.length===1&&o.pattern.kind===`Name`,c=V(o.set,n),l=(e,t)=>{if(s&&o.pattern.kind===`Name`){let n=o.pattern.name,r=On(e),a=bt(r,r.map(e=>i(mu(t,uu(t.scope,n,e)))));return Ve(e)?a:wt(a)}let n=[],r=a.map(e=>Cu(H(e.set,t),e.set,t.environment.runtime.version));return Eu(a,r,t.scope,e=>{let r=a.length===1?Od(o.pattern,e)??!1:A(a.map(t=>Od(t.pattern,e)??!1));return n.push([r,i(mu(t,e))]),!1}),yn(n)},u=Pu(a,t.body),d=Md(t.body),f=(e,n)=>{let r=Nd(n.scope,d),o=mu(n,r),s=ju({value:Iu(e,e=>i(mu(o,ku(a,r,e))),Fu(u,a,e)),bounds:a,body:t.body,scope:r});return a.length===1?wt(s):s},p=n.callStack;return n=>{let i=s?c(n):Ou(a,n);if(t.isRecursive||r||n.isKeepLazy||!j(i))return f(i,n);if(!Ve(i)){if(p)return f(i,n);try{return l(i,n)}catch(t){if(!(t instanceof e._))throw t;return f(i,n)}}if(!p)return l(i,n);try{return l(i,n)}catch(e){throw _d(p,t,e),e}}},Fd=(e,t)=>{let n=kd.has(e);n&&Ad(e.function);let r=V(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>V(e,t))}),value:V(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):A(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(mu(i,uu(i.scope,`@`,e))):br(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i={value:!1};n=o(n,r.path,0,t,e=>(i.value=!0,r.value(e))),i.value||t.environment.runtime.warn(Hi.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${B(e.function)}`)}return n}},Id=(t,n)=>{if(t.kind===`SetFilter`){let e=V(t.predicate,n),r=V(t.bound.set,n),i=t.bound.pattern,a=t.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:Xl(a)},s=(e,t)=>n=>hu(e(mu(t,du(t.scope,i,n))),`a set filter predicate`),c=(e,n,r)=>({kind:`FilteredSet`,base:e,test:s(r,n),source:o,rebind:r=>c(e,{...n,environment:r},V(t.predicate,r))});return t=>{let n=r(t);return Ve(n)?yt(M(n).elements.filter(s(e,t))):c(n,t,e)}}if(t.kind===`SetMap`){let e=V(t.expression,n);return n=>{let r=[];return Du(t.bounds,n,t=>(r.push(e(mu(n,t))),!1)),mn(r)}}let r=t.set;if(!r)return()=>{throw new e._(`TLC cannot evaluate an unbounded CHOOSE at ${Yl(t)}`)};let i=V(t.body,n),a=V(r,n);return n=>{let o=a(n);if(!D(o)||dt(o))throw new e._(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${B(t)}`);let s={value:void 0},c=Cu(o,r,n.environment.runtime.version);if(wu(c,e=>{let r=du(n.scope,t.pattern,e);return hu(i(mu(n,r)),`the body of CHOOSE`)?(s.value=Od(t.pattern,r),!0):!1}),s.value===void 0)throw new e._(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${B(t)}`);return s.value}},Ld=e=>[...e].sort((e,t)=>gt(e.name,t.name)),Rd=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),zd=(e,t)=>{let n=Ld(e),r=Rd(n),i=n.map(e=>V(e.value,t));if(r)return e=>An(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>Je(a,i.map(t=>t(e)),o):e=>jn(a,i.map(t=>t(e)))},Bd=(t,n)=>{let r=e=>V(e,n);switch(t.kind){case`Number`:{let e=t.value;return We(e)?()=>e:()=>{throw au(t)}}case`Decimal`:return()=>{throw iu(t)};case`String`:{let e=t.value;return()=>e}case`Identifier`:return bd(t,n);case`Apply`:return Ed(t,n);case`Bracket`:return()=>{throw new e._(`A bracket without a function or subscript is not an expression at ${Yl(t)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new e._(`An operator cannot be used as a value at ${Yl(t)}`)};case`And`:{let e=t.operands.map(r);return n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw $l(t,r,i);if(!i)return!1}return!0}}case`Or`:{let e=t.operands.map(r);return n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw $l(t,r,i);if(i)return!0}return!1}}case`Prime`:{let e=r(t.expression);return n=>{if(!n.next)throw cu(t);return e({environment:n.environment,scope:n.scope,state:n.next,next:void 0,isKeepLazy:n.isKeepLazy})}}case`Unchanged`:{let e=r({kind:`Prime`,expression:t.expression,location:t.location}),n=r(t.expression);return t=>jt(e(t),n(t))}case`If`:{let e=r(t.condition),n=r(t.consequent),i=r(t.alternative);return r=>{let a=e(r);if(typeof a!=`boolean`)throw Ql(t,a);return a?n(r):i(r)}}case`Case`:{let n=t.arms.map(e=>({source:e.condition,condition:r(e.condition),body:r(e.body)})),i=t.other?r(t.other):void 0;return r=>{for(let t of n){let n=t.condition(r);if(typeof n!=`boolean`)throw new e._(`A non-boolean expression (${_i(n)}) was used as a condition of a CASE. ${Zl(t.source)}`);if(n)return t.body(r)}if(i)return i(r);throw new e._(`Attempted to evaluate a CASE with no conditions true.\n${B(t)}`)}}case`Let`:{let e=r(t.body);return n=>e(mu(n,ld(t.definitions,n)))}case`Forall`:case`Exists`:return Dd(t,n);case`UnboundedQuantifier`:return()=>{throw new e._(`TLC cannot evaluate an unbounded quantifier at ${Yl(t)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Id(t,n);case`SetEnumeration`:{let e=t.elements.map(r);return t=>mn(e.map(e=>e(t)))}case`Tuple`:{let e=t.elements.map(r);return t=>A(e.map(e=>e(t)))}case`FunctionConstruction`:return Pd(t,n);case`FunctionSet`:{let e=r(t.domain),n=r(t.range);return t=>({kind:`FunctionSet`,domain:e(t),range:n(t)})}case`Record`:return zd(t.fields,n);case`RecordSet`:{let e=Ld(t.fields),n=e.map(e=>e.name),i=e.map(e=>r(e.value));return e=>({kind:`RecordSet`,names:n,sets:i.map(t=>t(e))})}case`Except`:return Fd(t,n);case`ExceptAt`:return n=>{let r=lu(n.scope,`@`);if(r?.kind!==`Value`)throw new e._(`@ appears outside an EXCEPT at ${Yl(t)}`);return r.value};case`FunctionApplication`:{Ad(t.function);let e=r(t.function),i=n=>fu(e(pu(n)),t),a=t.args.map(r),o=tu(n.runtime.version);if(a.length===1){let e=a[0];return t=>_r(i(t),e(t),o)}return e=>_r(i(e),A(a.map(t=>t(e))),o)}case`FieldAccess`:{let e=r(t.record),n=eu(t);return t=>n(e(t))}case`Product`:{let e=t.factors.map(r);return t=>({kind:`ProductSet`,factors:e.map(e=>e(t))})}case`BoxAction`:case`AngleAction`:{let e=r(t.action),n=r({kind:`Unchanged`,expression:t.subscript,location:t.location}),i=t.kind===`BoxAction`;return t=>i?hu(e(t),`an action`)||n(t):hu(e(t),`an action`)&&!n(t)}case`Enabled`:{let e=t.expression;return t=>Bl(e,t)}case`Label`:return r(t.body);case`Subexpression`:return()=>{throw new e._(`The subexpression reference at ${Yl(t)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new e._(`TLC cannot evaluate a temporal formula in a state at ${Yl(t)}`)}}},Vd=`tlc2/value/impl/`,Hd={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},Ud={iconstM1:2,iconst0:3,iconst5:8,bipush:16,sipush:17,ldc:18,ldcW:19,dup:89,areturn:176,getstatic:178,invokespecial:183,invokestatic:184,new:187},Wd=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n={offset:0},r=e=>{let t=n.offset;return n.offset+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n.offset)}},Gd=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),Kd=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],qd=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??Gd.get(e[3])}${`[]`.repeat(e[1].length)}`),Jd=(e,t)=>e[e[t].first].text,Yd=(e,t)=>Jd(e,t).replaceAll(`/`,`.`),Xd=t=>{let n=Wd(t);if(n.readUint32()!==3405691582)throw new e.O(`A module override is not a class file`);n.readUint16(),n.readUint16();let r=[],i=n.readUint16(),a=new TextDecoder;for(let e=1;e<i;e++){let t=n.readUint8(),i={tag:t,text:``,value:0,first:0,second:0};r[e]=i,t===Hd.utf8?i.text=a.decode(n.readBytes(n.readUint16())):t===Hd.integer?i.value=n.readInt32():t===Hd.float?n.readUint32():t===Hd.long||t===Hd.double?(n.readBytes(8),e++):t===Hd.class||t===Hd.string||t===Hd.methodType||t===Hd.module||t===Hd.package?i.first=n.readUint16():t===Hd.methodHandle?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=Yd(r,n.readUint16());n.readUint16(),n.readBytes(n.readUint16()*2);for(let e=n.readUint16();e>0;e--){n.readBytes(6);for(let e=n.readUint16();e>0;e--)n.readUint16(),n.readBytes(n.readUint32())}let s=[];for(let e=n.readUint16();e>0;e--){let e=n.readUint16(),t=r[n.readUint16()].text,i=r[n.readUint16()].text,a=i.indexOf(`)`),c=qd(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:Wd(n.readBytes(n.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>Yd(r,d.readUint16())):[],p=Kd.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=qd(i.slice(a+1))[0],ee=f.length===0?``:` throws ${f.join(`,`)}`;s.push({name:t,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${o}.${t}(${c.join(`,`)})${ee}`})}return{pool:r,methods:s}},Zd=(e,t)=>{let n=e[t],r=e[n.second];return{className:Jd(e,n.first),name:e[r.first].text}},Qd=(t,n,r,i)=>{let a=()=>new e.j(`The Java override ${r}.${t.name} computes its value, which tla-ts cannot run`),o=t.code;if(!o)throw a();let s=[],c=()=>{let e=s.pop();if(e===void 0)throw a();return e},l=e=>{let t=n[e];if(t.tag===Hd.integer)return t.value;if(t.tag===Hd.string)return n[t.first].text;throw a()};for(let e=0;e<o.length;){let t=o[e],r=()=>o[e+1]<<8|o[e+2];if(t>=Ud.iconstM1&&t<=Ud.iconst5)s.push(t-Ud.iconst0),e+=1;else if(t===Ud.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===Ud.sipush)s.push(r()<<16>>16),e+=3;else if(t===Ud.ldc)s.push(l(o[e+1])),e+=2;else if(t===Ud.ldcW)s.push(l(r())),e+=3;else if(t===Ud.dup){let t=c();s.push(t,t),e+=1}else if(t===Ud.getstatic){let t=Zd(n,r());if(t.className!==`${Vd}BoolValue`||t.name!==`ValTrue`&&t.name!==`ValFalse`)throw a();s.push({kind:`Identifier`,name:t.name===`ValTrue`?`TRUE`:`FALSE`,location:i}),e+=3}else if(t===Ud.invokestatic){let t=Zd(n,r()),o=c();if(t.className!==`${Vd}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===Ud.new)s.push({className:Jd(n,r()),value:void 0}),e+=3;else if(t===Ud.invokespecial){let t=Zd(n,r()),o=c(),s=c();if(!(t.className===`${Vd}StringValue`&&t.name===`<init>`&&typeof o==`string`&&typeof s==`object`&&`className`in s))throw a();s.value={kind:`String`,value:o,location:i},e+=3}else if(t===Ud.areturn){let e=c();if(typeof e!=`object`)throw a();if(`className`in e){if(!e.value)throw a();return e.value}return e}else throw a()}throw a()},$d=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Xd(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:Qd(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},ef=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),tf=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],nf=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),rf=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs`.split(`.`),af=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),of=/* @__PURE__ */ new Set([`Bags`,`Json`,`Randomization`,`TLCExt`]),sf=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
70
|
+
`],[2171,`Parsing or semantic analysis failed.`],[2213,`:
|
|
71
|
+
`],[2281,` - specifically: `],[2405,`failed.
|
|
72
|
+
`]]),it=(e,t,n)=>{let r=n?rt.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${at(t.slice(a),n)}`},at=(e,t)=>{let n=t?tt(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Ke.none} @!@!@\n${it(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},ot=e=>String(e).padStart(2,`0`),st=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${ot(r%24)}h`:e>36e5?`${ot(r%24)}h ${ot(n)}min`:e>6e4?`${ot(n)}min ${ot(t)}s`:`${ot(t)}s`},ct=e=>`${e.getFullYear()}-${ot(e.getMonth()+1)}-${ot(e.getDate())} ${ot(e.getHours())}:${ot(e.getMinutes())}:${ot(e.getSeconds())}`,lt=/* @__PURE__ */ new WeakMap,ut=(t,n,r)=>{if(!(t instanceof e.b))return t;let i=e.it(new e.b(`${r}\n${t.message}`,t),e.Q(t));return lt.set(i,{code:n,headline:r,inner:t}),i},dt=e=>lt.has(e),ft=e.$(`util.WrongInvocationException`),pt=e.G.slice(0,e.G.indexOf(`
|
|
73
|
+
`)),mt=`${e.G}tlc2.tool.EvalException: `,ht=`${e.G}util.Assert$TLCRuntimeException: `,gt=e=>nt(e)?mt:ht,_t=t=>{try{return t()}catch(t){throw t instanceof e.b?nt(t)?new e.b(`${e.W}${t.message}`):tt(t.message)?t:new e.b(`${e.G}${t.message}`):t}},vt=[mt,ht,e.G,e.W],yt=(t,n)=>{let r=lt.get(t);if(r)return`${r.headline}\n${yt(r.inner,n)}`;let i=t.message;if(t instanceof e.z)return i;let a=vt.find(e=>i.startsWith(e))??``;return`${a}${at(i.slice(a.length),n)}`},bt=(t,n)=>{let r=lt.get(t),i=t.message;if(r)return{code:r.code,message:i,toolMessage:yt(t,!0)};if(t instanceof e.P)return{code:n?Ge.stackOverflow:Ge.general,message:i,toolMessage:i};if(n&&nt(t))return{code:tt(i)?.code??Ge.general,message:i,toolMessage:i};let a=n&&!i.startsWith(pt)&&!(t instanceof e.z),o=t instanceof e.N?ft:e.G,s=a?o:``;return{code:Ge.general,message:`${s}${i}`,toolMessage:`${s}${yt(t,!0)}`}},xt=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,St=1e6;let Ct=St;const wt=()=>Ct,Tt=()=>Math.max(Ct,10),Et=()=>`Attempted to construct a set with too many elements (>${Ct}).`,Dt=(t,n)=>{if(t.length===Tt())throw new e.N(Et());t.push(n)},Ot=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=Tt(),kt=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},j=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,At=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),jt=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),M=e=>typeof e==`object`&&e.kind===`ModelValue`,Mt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),Nt=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:j(e)?`set`:`function`,Pt=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let Ft=!1;const It=(e,t)=>(Ft=!0,e.writtenKeys=t,e),Lt=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,Rt=e=>Lt(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),zt=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):Rt(e),Bt=(e,t,n)=>It(Ir(e,t),n),Vt=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(Vt);e.writtenKeys=void 0,e.range.forEach(Vt)}},Ht=e=>e.every(e=>typeof e==`string`),Ut=(e,t)=>e.length>0&&t.length>0&&Ht(e)!==Ht(t),Wt=(e,t)=>{Ft&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Ut(n,r)?tr(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=gn(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:gn(t,n);if(r!==0)return r}return 0},Gt=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=gn(n[e],r[e]);if(t!==0)return t}return 0},Kt=e=>M(e)?e.type:void 0,qt=(t,n,r)=>{let i=Kt(t),a=Kt(n);if(i===void 0&&a===void 0)return;let o=r?`check equality of`:`compare`;if(M(t)&&M(n)){if(i===void 0||a===void 0||i===a)return;throw new e.b(`Attempted to ${o} the differently-typed model values ${L(t)} and ${L(n)}`)}throw i===void 0?new e.b(`Attempted to ${o} the typed model value ${L(n)} and the non-model value\n${L(t)}`):new e.b(`Attempted to ${o}${r?``:` the`} typed model value ${L(t)} and non-model value\n${L(n)}`)},Jt={ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0},Yt=e=>{Jt.ranks=Object.create(null),Jt.size=0,Jt.searchRank=void 0,Jt.unorderedString=void 0,_n.clear();for(let t of e)on(t)},Xt=()=>{Jt.searchRank=Jt.size},Zt=()=>Jt.unorderedString;let Qt=!1;const $t={isExpanded:!0,isViewPrinted:!1},en=e=>{Qt=e.version===`1.7.4`,Ct=e.maxSetSize??St,$t.isExpanded=e.isLazyValueExpanded??!0,$t.isViewPrinted=e.isViewPrinted??!1},tn=/* @__PURE__ */ new WeakMap,nn=(e,t)=>($t.isViewPrinted&&tn.set(e,t),e),rn=/* @__PURE__ */ new WeakMap,an=(e,t)=>(rn.set(e,t),e),on=e=>(Jt.ranks[e]===void 0&&(Jt.ranks[e]=Jt.size++),e),sn=e=>Jt.ranks[on(e)],cn=(e,t)=>{if(e===t)return 0;let n=Jt.ranks,r=n[e],i=n[t],a=Jt.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(Jt.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},ln=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),un=(e,t)=>(ln(e)||ln(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),dn=(t,n)=>new e.b(ln(t)?`Attempted to compare overridden value ${L(t,!0)} with non-overridden value:\n${L(n)}`:`Attempted to compare ${Nt(t)} ${L(t)} with ${Nt(n)} ${L(n)}`),fn=(t,n,r)=>{if(!ln(t))throw new e.b(`Attempted to ${r} the set ${L(N(t)?P(t):t,!0)} with the value:\n${L(n,!0)}`);if(!ln(n))throw dn(t,n);let i=t.kind===`InfiniteSet`?t.name:void 0,a=n.kind===`InfiniteSet`?n.name:void 0;if(i!==void 0&&i===a)return 0;if(i===`Nat`&&a===`Int`||i===`Int`&&a===`Nat`)return i===`Nat`?-1:1;throw new e.O(`Attempted to compare ${L(t,!0)} with the value\n${L(n,!0)}`)},pn={kind:`InfiniteSet`,name:`Any`},mn=t=>{throw new e.O(`Attempted to compare ANY with the value\n${L(t)}`)},hn=e=>{Ft&&Vt(e),e===pn&&mn(e),typeof e==`object`&&e.kind===`LazyFunction`&&I(e)},gn=(e,t)=>{if(e===t)return hn(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Wt(e,t);if(n===`Set`&&r===`Set`)return Gt(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&qt(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return qt(e,t,!1),n===`ModelValue`?-1:1;if(e===pn||t===pn)return mn(e===pn?t:e);if(j(e)&&j(t)&&un(e,t))return fn(e,t,`compare`);let i=j(e);if(i!==j(t))throw dn(e,t);if(n===`Interval`&&r===`Set`){let n=ai(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-ai(t);if(n!==0)return n}return i?Gt(P(e),P(t)):Wt(I(e),I(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return cn(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(qt(e,t,!1),M(e))return-1;if(M(t))return 1;throw dn(e,t)},_n=/* @__PURE__ */ new Map,vn=32768,yn=t=>{let n=_n.get(t);if(n)return n;if(_n.size===vn)throw new e.x(`TLC supports at most ${vn} model values, but model value ${t} exceeds this limit.`);let r={kind:`ModelValue`,name:t,type:t.length>2&&t[1]===`_`?t[0]:void 0,rank:sn(t),hash:Ii(Li(Ri(t),109)),fingerprint:qi(Ji(t)^60)};return _n.set(t,r),r},bn=()=>[..._n.values()],xn=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),Sn=e=>{let t=xn(e);return t.isNormalized=!0,t},Cn=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let wn=!1;const Tn=(e,t)=>(t===`lambda`&&(wn=!0),t!==void 0&&(e.functionClass=t),e),En=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Dn=e=>Tn(e,`lambda`),On=e=>xt(e)&&e.isCached===!0;let kn=!1;const An=e=>(kn=!0,e),jn=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),Mn=e=>{kn&&typeof e==`object`&&xt(e)&&jn.has(e.kind)&&(e.isCached=!0)},Nn=e=>{(wn||kn)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(Nn),e.range.forEach(Nn)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Nn):j(e)&&N(e)&&(Mn(e),P(e).elements.forEach(Nn))))},Pn=(e,t)=>{if(Mn(e),e===t)return hn(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&qt(e,t,!0),gn(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return Wt(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Gt(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&ai(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==ai(t))return!1;if(M(e)||M(t))return e.kind===`LazyFunction`&&I(e),qt(e,t,!0),M(e)&&M(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Pn(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=F(e.domain),r=F(t.domain);if(n||r)return n===r;let i=F(e.range),a=F(t.range);return i||a?i===a:Pn(e.domain,t.domain)&&Pn(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(F(e))return F(t);if(F(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&Pn(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return F(e)?F(t):!F(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Pn(e,t.factors[n]));let n=j(e)&&j(t)&&!(N(e)&&N(t));if(n&&un(e,t))return fn(e,t,`check equality of`)===0;if(n){if(!ln(e)){let n=P(e);if(!ln(t))return Gt(n,P(t))===0}return $i(e)===$i(t)}return gn(e,t)===0},Fn=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):$i(n)===$i(r);return n},In=Fn(!1),Ln=Fn(!0),Rn=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},zn=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Ki(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Ln(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Ln(i[e],n))return i[e]}return n.kind===`Set`?Rn(n.elements,t):(Rn(n.domain,t),Rn(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},Bn=(e,t)=>t.length===0||En(e)===`tuple`?1:Ni(t)?.low,Vn=e=>{if(!jt(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:Bn(e,t.domain)}},Hn=e=>{if(!jt(e))return;let t=I(e);return Ht(t.domain)?t:void 0},Un=(e,t)=>(qt(t,e,!1),1),Wn=(e,t)=>(qt(t,e,!0),!1),Gn=(e,t)=>(e.type!==void 0&&qt(e,t,!1),M(t)?e.rank-t.rank:-1),Kn=(e,t)=>(e.type!==void 0&&qt(e,t,!0),M(t)&&e.name===t.name),qn={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},Jn=(e,t,n)=>{let r=qn[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${L(e)} with ${r.other}:\n${L(t)}`},Yn=(t,n,r)=>{let i=Vn(r);if(!i){if(M(r))return Un(r,n);throw new e.b(`Attempted to compare the function ${L(n)} with the value:\n${L(r)}`)}if(t.range.length!==i.range.length)return t.range.length-i.range.length;let a=()=>Xn(t.range,i.range);if(t.low!==void 0&&t.range.length===0)return 0;if(t.low!==void 0&&i.low!==void 0)return t.low===i.low?a():t.low-i.low;let o=t.low??i.low;if(o===void 0)return Xn(t.domain,i.domain)||a();let s=t.low===void 0?t.domain:i.domain;for(let n=0;n<s.length;n++){let r=s[n];if(typeof r!=`number`)throw new e.b(`Attempted to compare integer with non-integer${t.low===void 0?``:`:`}\n${L(r)}.`);let i=t.low===void 0?r-(o+n):o+n-r;if(i!==0)return i}return a()},Xn=(e,t)=>{for(let n=0;n<e.length;n++){let r=tr(e[n],t[n]);if(r!==0)return r}return 0},Zn=(t,n)=>{let r=I(t);if(En(t)===`tuple`){let e=jt(n)?ui(n):void 0;return e?r.range.length-e.length||Xn(r.range,e):Yn({...r,low:1},t,n)}if(En(t)===`record`){let i=Hn(n);if(!i){if(M(n))return Un(n,t);throw new e.b(`Attempted to compare record:\n${L(t)}\nwith non-record\n${L(n)}`)}return r.domain.length-i.domain.length||Xn(r.domain,i.domain)||Xn(r.range,i.range)}return Yn({...r,low:Bn(t,r.domain)},t,n)},Qn=(e,t)=>ln(e)||ln(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),$n=(e,t)=>{let n=Mt(t)?t:P(t);return{elements:P(e).elements,otherElements:P(n).elements}},er=(t,n)=>{if(Qn(t,n))return gn(t,n);if(!Mt(t))return er(P(t),n);if(!j(n)){if(M(n))return Un(n,t);throw new e.b(`Attempted to compare the set ${L(t)} with the value:\n${L(n)}`)}let r=$n(t,n);return r.elements.length-r.otherElements.length||Xn(r.elements,r.otherElements)},tr=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return gn(t,n);if(M(n))return Un(n,t);throw new e.b(Jn(t,n,!1))}return t.kind===`ModelValue`?Gn(t,n):jt(t)?Zn(t,n):er(t,n)},nr=(e,t)=>e.every((e,n)=>or(e,t[n])),rr=(t,n,r)=>{let i=Vn(r);if(!i){if(M(r))return Wn(r,n);throw new e.b(`Attempted to check equality of the function ${L(n)} with the value:\n${L(r)}`)}if(t.range.length!==i.range.length)return!1;if(t.low!==void 0&&i.low!==void 0)return(t.range.length===0||t.low===i.low)&&nr(t.range,i.range);let a=t.low??i.low;return a===void 0?nr(t.domain,i.domain)&&nr(t.range,i.range):(t.low===void 0?t.domain:i.domain).every((t,n)=>{if(typeof t!=`number`)throw new e.b(`Attempted to compare an integer with non-integer:\n${L(t)}.`);return t===a+n})&&nr(t.range,i.range)},ir=(t,n)=>{let r=I(t);if(En(t)===`tuple`){let e=jt(n)?ui(n):void 0;return e?r.range.length===e.length&&nr(r.range,e):rr({...r,low:1},t,n)}if(En(t)===`record`){let i=Hn(n);if(!i){if(M(n))return Wn(n,t);throw new e.b(`Attempted to check equality of record:\n${L(t)}\nwith non-record\n${L(n)}`)}return r.domain.length===i.domain.length&&nr(r.domain,i.domain)&&nr(r.range,i.range)}return rr({...r,low:Bn(t,r.domain)},t,n)},ar=(t,n)=>{if(Qn(t,n))return Pn(t,n);if(!Mt(t))return ar(P(t),n);if(!j(n)){if(M(n))return Wn(n,t);throw new e.b(`Attempted to check equality of the set ${L(t)} with the value:\n${L(n)}`)}let r=$n(t,n);return r.elements.length===r.otherElements.length&&nr(r.elements,r.otherElements)},or=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return t===n;if(M(n))return Wn(n,t);throw new e.b(Jn(t,n,!0))}return t.kind===`ModelValue`?Kn(t,n):jt(t)?ir(t,n):ar(t,n)},sr=e=>{let t=[];for(let n of e){let e=lr(n,t);e.isFound||t.splice(e.index,0,n)}return t},cr=(e,t)=>{let n=fi.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},lr=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=cr(e,()=>tr(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},ur=(e,t)=>t.some(t=>cr(t,()=>or(t,e))),dr=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,fr=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(fr)),e.kind===`Function`&&(e.domain.forEach(fr),e.range.forEach(fr)))},pr=e=>{if(!(typeof e!=`object`||On(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:P(e);return;case`FilteredSet`:case`Subset`:return pr(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(pr(e.left),pr(e.right));case`FunctionSet`:return pr(e.domain),pr(e.range);case`RecordSet`:return e.sets.forEach(pr);case`ProductSet`:return e.factors.forEach(pr)}},mr=(e,t)=>pi(Pn,or,e,t),hr=e=>{for(let t=1;t<e.length;t++)if(gn(e[t-1],e[t])>=0)return!1;return!0},gr=e=>{for(let t=0;t<e.length;t++){let n=e[t],r=t>0?e[t-1]:void 0;if(typeof n!=`number`||typeof r==`number`&&r>=n)return!1}return!0},_r=e=>{for(let t=1;t<e.length;t++)Mn(e[t]);if(e.length<2||hr(e))return xn(e);let t=[...e].sort(gn),n=[t[0]];for(let e=1;e<t.length;e++)gn(n[n.length-1],t[e])!==0&&n.push(t[e]);return xn(n)},vr=e=>{if(gr(e))return xn(e);let t=pi(_r,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},yr=xn([]),br=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&gn(r[a],t)<0;)a++;a<r.length&&gn(r[a],t)===0||i.push(t)}return i.length===n.length?e:xn(i)},xr=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&gn(r[a],t)<0;)a++;a<r.length&&gn(r[a],t)===0&&i.push(t)}return i.length===n.length?e:xn(i)},Sr=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=gn(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=xn(i);if(e.hash!==0&&e.hash!==Vi){let t=e.hash,n=0;for(;n<a.length;n++){let e=Ki(a[n]);if(e===Vi)break;t=t+zi(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Yi(a[e])|0;c.fingerprint=t}return c},Cr=e=>{let t=e.length<2?e:[...e].sort((e,t)=>gn(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&gn(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Cn(n,r)},wr=e=>{let t=Cr(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:It(t,e.map(e=>e[0]))},Tr=[],Er=/* @__PURE__ */ new Map,Dr=[],Or=/* @__PURE__ */ new WeakMap,kr=e=>{let t=Tr[e]??Er.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?Er.set(e,new WeakRef(n)):Tr[e]=n,n},Ar=e=>{if(ai(e),e.low===1&&e.high>=1)return kr(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},jr=e=>e.length>0&&(e===Tr[e.length]||e===Er.get(e.length)?.deref())||Or.has(e),Mr=e=>{let t=P(e).elements;return jr(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Nr=e=>{let t=Dr[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Dr[e]=n,n},Pr=e=>Tn(Cn(kr(e.length),e),`tuple`),Fr=e=>Tn(Cr(e),`record`),Ir=(e,t)=>Tn(Cn(e,t),`record`),Lr=e=>j(e)&&!ln(e),Rr=(e,t=!1)=>`UNION(${L(e.base,t)})`,zr=(t,n=e=>P(e).elements)=>{if(!Lr(t.base))throw new e.b(`Attempted to enumerate the nonenumerable set:\n${Rr(t)}`);return n(t.base)},Br=(t,n,r)=>{if(Lr(t))return t;throw new e.b(n===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${L(t)}\nwhen enumerating:\n${Rr(r)}`)},N=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return N(e.base);case`FunctionSet`:return N(e.domain)&&N(e.range)||Vr(e.domain)===!0||Vr(e)===!0;case`RecordSet`:return e.sets.every(N)||Vr(e)===!0;case`ProductSet`:return e.factors.every(N)||Vr(e)===!0;case`Union`:return N(e.base)&&(Mt(e.base)?dr(e.base):Qr(e.base)).every(N);case`SetOperation`:return e.operator===`\\cup`?N(e.left)&&N(e.right):e.operator===`\\cap`?N(e.left)||N(e.right):N(e.left);default:return!1}},Vr=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=Vr(e.domain);return t===void 0?void 0:!t&&Vr(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Vr(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return N(e)?P(e).elements.length===0:void 0;default:return}},Hr=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},Ur=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},Wr=e=>{if(typeof e!=`object`||e.kind!==`Subset`||ln(e.base))return;let t=P(e.base).elements;if(t.length<=20)return;let n=-1,r=[0],i=e=>{for(e<=n&&(n=-1);n<e;)n===-1?r=[]:Ur(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return xn(r.map(e=>t[e]))},a=2**t.length,o=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<a;return new Proxy([],{get:(e,t,n)=>t===`length`?a:o(t)?i(Number(t)):Reflect.get(e,t,n),has:(e,t)=>o(t)||Reflect.has(e,t)})},Gr=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(xn(r.map(t=>e[t])));while(Ur(r,e.length))}return t},Kr=(t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){let o=t[a];if(ln(o))throw new e.b(r(o,a));let s=n(o);if(s.length===0)return[[]];i.push(s)}return i},qr=(t,n=e=>P(e).elements)=>{if(typeof t!=`object`)throw new e.b(`Expected a set but found ${L(t)}`);switch(t.kind){case`Set`:return t.elements;case`MixedSet`:return sr(t.elements);case`Interval`:{let e=Ar(t);return e!==Tr[e.length]&&Or.set(e,t),e}case`Subset`:{if(ai(t.base)===0)return Gr([]);if(!j(t.base))throw new e.b(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${A(L(t.base))}`);let n=P(t.base).elements;if(n.length>30)throw new e.b(ii(t));return Gr(n)}case`FunctionSet`:{if(!Qt&&F(t))return[];if(ln(t.domain))throw new e.b(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${L(t.domain)}\ncannot be enumerated.`);let r=Mr(t.domain);if((r.length>0||Qt)&&ln(t.range))throw new e.b(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${L(t.range)}\ncannot be enumerated.`);let i=r.length===0?[]:n(t.range);return Hr(r.map(()=>i)).map(e=>Cn(r,e))}case`RecordSet`:{if(!Qt&&F(t))return[];let e=Kr(t.sets,n,(e,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${t.names[n]}' field:\n${L(e)}`);return Hr(e).map(e=>Fr(t.names.map((t,n)=>[t,e[n]])))}case`ProductSet`:{if(!Qt&&F(t))return[];let e=Kr(t.factors,n,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${L(e)}`);return Hr(e).map(Pr)}case`FilteredSet`:if(!j(t.base)||ln(t.base))throw new e.b(`Attempted to enumerate { x \\in S : p(x) } when S:\n${L(t.base)}\nis not enumerable`);return P(vr(Qr(t.base).filter(e=>t.test(e,!1)))).elements;case`Union`:{let n=[];return zr(t).forEach((r,i)=>{let a=Br(r,i,t);if(Ot(a))throw new e.N(Et());Qr(a).forEach(e=>Dt(n,e))}),P(vr(n)).elements}case`SetOperation`:{if(t.operator===`\\cap`&&!Lr(t.left)&&!Lr(t.right))throw new e.b(`Attempted to enumerate S \\cap T when neither S:\n${L(t.left)}\nnor T:\n${L(t.right)}\nis enumerable`);if(t.operator===`\\`&&!Lr(t.left))throw new e.b(`Attempted to enumerate S \\ T when S:\n${L(t.left)}\nis not enumerable.`);if(t.operator===`\\cup`)return P(vr(Yr(t))).elements;let n=t.operator===`\\`||Lr(t.left),r=n?t.left:t.right,i=n?t.right:t.left,a=[];return kt(typeof r==`object`&&r.kind===`Interval`?r:Qr(r),e=>{hi(e,i)===(t.operator===`\\cap`)&&Dt(a,e)}),P(vr(a)).elements}case`InfiniteSet`:case`SequenceSet`:throw new e.b(`Attempted to enumerate the non-enumerable set ${L(t)}`);default:throw new e.b(`Expected a set but found ${L(t)}`)}},P=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return xn(qr(e));let t=typeof e==`object`&&xt(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=fi.sets;n?.push(e);let r=qr(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?xn(r):_r(r);return t&&(t.enumerated=i),i},Jr=e=>{if(!(typeof e!=`object`||On(e)))switch(e.kind){case`MixedSet`:P(e);return;case`FilteredSet`:return Lr(e.base)||P(e),Jr(e.base);case`Union`:if(!Mt(e.base)&&Lr(e.base))return Jr(e.base);zr(e).slice(0,1).forEach(t=>Jr(Br(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!Lr(e.left)&&P(e),e.operator!==`\\cup`||Lr(e.left)&&Lr(e.right)||P(e),e.operator!==`\\cap`||Lr(e.left)?Jr(e.left):Jr(e.right),e.operator===`\\cup`&&Jr(e.right)}},Yr=t=>{if(!Lr(t.left)||!Lr(t.right))throw new e.b(`Attempted to enumerate S \\cup T when S:\n${L(t.left)}\nand T:\n${L(t.right)}\nare not both enumerable`);if(Jr(t.left),Jr(t.right),Ot(t.left))throw new e.N(Et());let n=Qr(t.left),r=Ot(t.right)?void 0:Qr(t.right);if(!r||n.length+r.length>Tt())throw new e.N(Et());return[...n,...r]},Xr=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return P(e).elements;let t=cr(e,()=>Yr(e)),n=P(vr(t)).elements;return e.enumerated=xn(n),n},Zr=(e,t)=>{if(typeof e!=`object`||On(e))return P(e).elements.some(t);let n=fi.sets;n?.push(e),Jr(e);let r=ni(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},Qr=e=>{let t=[];return Zr(e,e=>(t.push(e),!1)),t},$r=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,ei=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(ei);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(ei)&&e.range.every(ei);case`SetOperation`:return e.operator!==`\\cup`&&ei(e.left)&&ei(e.right);case`FilteredSet`:return ei(e.base);case`ProductSet`:return e.factors.every(ei);default:return!1}},ti=e=>typeof e!=`object`||On(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?ti(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||ti(e.left)||ti(e.right):$r(e)?.some(ti)??!1,ni=(e,t)=>{if(e.kind===`Union`)return zr(e,Qr).some((n,r)=>Zr(Br(n,r,e),t));if(e.kind===`FilteredSet`&&Lr(e.base))return Zr(e.base,n=>e.test(n,!1)&&t(n));if($r(e)?.some(ti))return qr(e,Qr).some(t);if(e.kind!==`SetOperation`)return P(e).elements.some(t);if(e.operator===`\\cup`)return!Lr(e.left)||!Lr(e.right)?P(e).elements.some(t):Zr(e.left,t)||Zr(e.right,t);let n=e.operator===`\\`||Lr(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return Lr(r)?Zr(r,n=>hi(n,i)===(e.operator===`\\cap`)&&t(n)):P(e).elements.some(t)},F=t=>{if(typeof t!=`object`||!j(t))throw new e.b(`Shouldn't call isEmpty() on value ${L(t)}`);switch(t.kind){case`Set`:case`MixedSet`:return t.elements.length===0;case`Interval`:return t.low>t.high;case`InfiniteSet`:if(t.name===`Any`)throw new e.b(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return t.factors.some(F);case`RecordSet`:return t.sets.some(F);case`FunctionSet`:return!F(t.domain)&&F(t.range);case`Union`:return zr(t).every((e,n)=>F(Br(e,n,t)));default:return P(t).elements.length===0}},ri=(t,n,r)=>t.reduce((t,i)=>{let a=t*ai(i,n);if(a>2147483647)throw new e.b(r());return a},1),ii=e=>`Overflow when computing the number of elements in:\n${L(e)}`,ai=(t,n)=>{if(typeof t!=`object`)throw new e.b(`Attempted to compute the number of elements in the ${Nt(t)} ${L(t)}.`);switch(t.kind){case`ModelValue`:throw new e.b(`Attempted to compute the number of elements in the model value ${L(t)}.`);case`Function`:return t.domain.length;case`LazyFunction`:return ai(t.domain,n);case`Interval`:{let n=Math.max(0,t.high-t.low+1);if(n>2147483647)throw new e.b(`Size of interval value exceeds the maximum representable size (32bits): ${t.low}..${t.high}.`);return n}case`InfiniteSet`:case`SequenceSet`:throw new e.b(`Attempted to compute the number of elements in the overridden value ${L(t)}.`);case`Subset`:{let r=ai(t.base,n);if(r>=31)throw new e.b(ii(t));return 2**r}case`FunctionSet`:{if(n!==`1.7.4`){if(F(t.domain))return 1;if(F(t.range))return 0;if(ai(t.range,n)===1)return 1}let r=ai(t.domain,n),i=ai(t.range,n);if(i<=1)return r===0?1:i;let a=1;for(let n=0;n<r;n++)if(a*=i,a>2147483647)throw new e.b(ii(t));return a}case`RecordSet`:return n!==`1.7.4`&&F(t)?0:ri(t.sets,n,()=>ii(t));case`ProductSet`:return n!==`1.7.4`&&F(t)?0:ri(t.factors,n,()=>`Overflow when computing the number of elements in ${L(t)}`);default:return Mn(t),P(t).elements.length}},oi=e=>`Attempted to check if the set ${L(e)}is finite.`,si=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)throw new e.b(`Attempted to check if the ${Nt(t)} ${L(t)} is a finite set.`);switch(t.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new e.b(`Attempted to check if the function:\n${L(t)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return si(t.base)&&F(t.base);case`Subset`:return si(t.base);case`FunctionSet`:{let e=si(t.domain);if(e&&F(t.domain))return!0;let n=si(t.range);return n&&F(t.range)?!0:n&&(e||ai(t.range)===1)}case`RecordSet`:case`ProductSet`:{let e=t.kind===`RecordSet`?t.sets:t.factors,n=!0;for(let t of e)if(!si(t))n=!1;else if(F(t))return!0;return n}case`Union`:if(!Lr(t.base))throw new e.b(`Attempted to check if the nonenumerable set:\n${Rr(t)}\nis a finite set.`);return P(t.base).elements.every(si);case`SetOperation`:if(t.operator===`\\cup`)return si(t.left)&&si(t.right);if(t.operator===`\\cap`){if(!si(t.left)&&!si(t.right))throw new e.b(oi(t));return!0}if(si(t.left))return!0;if(!si(t.right))throw new e.b(oi(t));return!1;case`FilteredSet`:if(!si(t.base))throw new e.b(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${L(t.base)}\nis finite.`);return!0}},ci=(e,t,n=gn)=>{let r=0,i=e.length-1;for(;r<=i;){let a=r+i>>1,o=n(e[a],t);if(o===0)return a;o<0?r=a+1:i=a-1}return-1},li=(t,n)=>{let r=t.elements;if(r.length>Tt())throw new e.N(Et());let i=Array.from({length:r.length},()=>!1),a=n.filter(e=>{let t=ci(r,e);return!i[t]&&(i[t]=!0,!0)}),o=xn(r);return a.some((e,t)=>e!==r[t])&&(o.writtenElements=a),o},ui=t=>{if(typeof t!=`object`||!jt(t))return;if(t.kind===`LazyFunction`&&(!j(t.domain)||ln(t.domain)))throw new e.b(`To convert a function of form [x \\in S |-> f(x)] to a tuple, the set S must be enumerable.`);let n=I(t);return n.domain.every((e,t)=>e===t+1)?n.range:void 0},di=(e,t)=>{let n=`Attempted to check if the value:\n${L(e)}\nis an element of the`;if(!jt(t))return`${n} ${Nt(t)} ${L(t)}`;let r=En(t);return r===`record`?`Attempted to check if element:\n${L(e)}\nis in the record:\n${L(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${L(t)}`},fi={sets:void 0},pi=(t,n,r,i)=>{let a=fi.sets,o=fi.callStack,s=a?.length??0,c=o&&{...o,length:o.expressions.length};try{return t(r,i)}catch(t){if(!(t instanceof e.b))throw t;return a&&(a.length=s),o&&c&&(o.expressions.length=c.length,o.isFrozen=c.isFrozen,o.fingerprint=c.fingerprint),n(r,i,t)}},mi=e=>(fi.sets??[]).slice(e).some(e=>typeof e==`object`&&fi.callStack?.sources.has(e)===!0),hi=(e,t)=>{let n=fi.sets;if(n===void 0)return bi(e,t);n.push(t);let r=bi(e,t);return n.pop(),r},gi=(e,t)=>{let n=t.elements,r=0,i=n.length-1;for(;r<=i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;if(a===e)return!0;a<e?r=t+1:i=t-1}return!1},_i=(e,t)=>ci(t.elements,e)!==-1,vi=(e,t)=>t.isNormalized?lr(e,t.elements).isFound:ur(e,dr(t)),yi=(t,n)=>{if(t.type!==void 0)throw new e.b(`Attempted to check if the typed model value ${A(L(t))} is an element of\n${A(L(n))}`);return!1},bi=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return gi(e,t)??xi(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return xi(e,t)},xi=(t,n)=>{if(!j(n))throw new e.b(di(t,n));switch(n.kind){case`Set`:return Mn(t),pi(_i,vi,t,n);case`MixedSet`:return ur(t,n.elements);case`Interval`:if(typeof t==`number`)return t>=n.low&&t<=n.high;if(n.low<=n.high&&(!M(t)||t.type!==void 0))throw new e.b(`Attempted to check if the value:\n${L(t)}\nis in the integer interval ${L(n)}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(M(t))return yi(t,n);if(!(n.name===`STRING`?typeof t==`string`:typeof t==`number`))throw new e.O(`Attempted to check if the value:\n${L(t)}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof t==`number`&&t>=0;case`Subset`:if(!j(t)||ln(t))throw new e.b(`Attempted to check if the non-enumerable value\n${A(L(t))}\nis element of\n${A(L(n))}`);return P(t).elements.every(e=>hi(e,n.base));case`FunctionSet`:{if(!jt(t)){if(M(t))return yi(t,n);throw new e.b(`Attempted to check if \n${L(t)}\nwhich is not a TLC function value, is in the set of functions:\n${A(L(n))}`)}let r=I(t),i=Bn(t,r.domain);return(i===void 0?mr(n.domain,xn(r.domain)):mr({kind:`Interval`,low:i,high:i+r.domain.length-1},n.domain))&&r.range.every(e=>hi(e,n.range))}case`RecordSet`:{let r=jt(t)?I(t):void 0;if(!r||!Ht(r.domain)){if(M(t))return yi(t,n);throw new e.b(`Attempted to check if non-record\n${L(t)}\nis in the set of records:\n${L(n)}`)}return r.domain.length===n.names.length&&n.names.every((e,t)=>{let i=ci(r.domain,e);return i!==-1&&hi(r.range[i],n.sets[t])})}case`ProductSet`:{let r=jt(t)?ui(t):void 0;if(r===void 0){let r=jt(t)&&I(t).domain.every(e=>typeof e==`number`);if(M(t))return yi(t,n);if(r)return!1;throw new e.b(`Attempted to check if non-tuple\n${L(t)}\nis in the set of tuples:\n${L(n)}`)}return r.length===n.factors.length&&r.every((e,t)=>hi(e,n.factors[t]))}case`FilteredSet`:try{return hi(t,n.base)&&n.test(t,!0)}catch(r){throw!(r instanceof e.b)||!nt(r)?r:new e.b(`Cannot decide if element:\n${A(L(t))}\n is element of:\n${A(L(n.base))}\nand satisfies the predicate ${n.source?.predicate}`)}case`Union`:{if(!Lr(n.base))throw new e.b(`Attempted to check if:\n ${L(t)}\nis an element of the non-enumerable set:\n ${Rr(n)}`);let r=P(n.base).elements;return r.length>1&&r.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),r.some(e=>hi(t,e))}case`SetOperation`:return n.operator===`\\cup`?hi(t,n.left)||hi(t,n.right):hi(t,n.left)&&hi(t,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=ui(t);if(r===void 0){if(M(t))return yi(t,n);throw new e.O(`Attempted to check if the value:\n${A(L(t))}\nis an element of ${A(L(n))}.`)}return r.every(e=>hi(e,n.base))}default:throw new e.b(di(t,n))}},Si=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?hi(e,n):e.range.every((e,r)=>Si(e,t.range[r],n.range)),I=t=>{if(typeof t==`object`&&t.kind===`Function`)return t;if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return t.enumerated;if(N(t.domain)||ai(t.domain),!j(t.domain))throw new e.b(`The domains of formal parameters must be enumerable.`);let n=Mr(t.domain);return t.enumerated=Tn(Cn(n,n.map(e=>t.apply(e))),En(t)),t.enumerated}throw new e.b(`Expected a function but found ${L(t)}`)},Ci=(e,t,n)=>{let r=A(L(e)),i=A(L(t)),a=n===`1.7.4`;switch(En(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},wi=(e,t)=>{if(!Qt)return Ci(e,t);let n=A(L(t));return En(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Ti=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},Ei=t=>new e.b(`Attempted to apply function with integer domain to the non-integer argument ${A(L(t))}`),Di=(e,t)=>ci(e.domain,t),Oi=(e,t,n)=>{let r=Lt(e);throw Qt||r!==e.domain||r.length<32?r.forEach(e=>or(e,t)):ci(r,t,tr),n},ki=(t,n,r)=>{let i=t.domain;if(typeof n!=typeof i[0]){let a=En(t),o=a===`tuple`?`number`:a===`record`?`string`:void 0;if(o!==void 0&&typeof n!==o)throw new e.b(r(t,n));if(o===void 0&&!Qt&&typeof n!=`number`&&jr(i))throw Ei(n)}let a=Ti(i,n);return a===-1?pi(Di,Oi,t,n):a},Ai=(t,n,r)=>{let i=t.domain,a=ui(r),o=(e,n,r)=>`In applying the function\n${A(L(t))},\nthe ${e} is:\n${A(L(n))}\nwhich ${r}.\n`,s=()=>new e.b(o(`argument list`,r,`does not match its formal parameter`));if(a===void 0)throw s();if(typeof i!=`object`||i.kind!==`ProductSet`)throw new e.b(`Attempted to apply a function to ${L(r)}, which is not in its domain`);if(n.forEach((t,n)=>{if(n>=a.length)throw s();let r=a[n],c=`argument number ${n+1}`;if(!hi(r,i.factors[n]))throw new e.b(o(c,r,t===void 0?`is not in the function's domain ${L(i)}`:`is not in its domain`));if(t!==void 0&&ui(r)?.length!==t)throw new e.b(o(c,r,`does not match its formal parameter`))}),a.length>n.length)throw s()},ji=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!hi(t,e.lambdaDomain),Mi=(t,n,r)=>{if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return Mi(t.enumerated,n,r);let i=t.boundTupleLengths;if(i!==void 0)return Ai(t,i,n),t.apply(n);if(!hi(n,t.domain))throw new e.b(En(t)===`lambda`?Ci(t,n):`Attempted to apply a function to ${L(n)}, which is not in its domain`);return t.apply(n)}if(typeof t!=`object`||t.kind!==`Function`)throw new e.b(`Attempted to apply ${L(t)}, which is not a function`);let i=r??Ci;if(ji(t,n))throw new e.b(i(t,n));let a=ki(t,n,i);if(a===-1)throw new e.b(i(t,n));return t.range[a]},Ni=e=>jr(e)?Or.get(e)??Nr(e.length):void 0,Pi=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=I(e);if(t.functionClass===`lambda`&&t.lambdaDomain)return t.lambdaDomain;let n=Ni(t.domain);if(n)return n;let r=xn(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},Fi=(t,n,r,i=!1)=>{if(typeof t==`object`&&t.kind===`LazyFunction`&&(i||t.enumerated===void 0)){if(!hi(n,t.domain))return t;let e=r(t.apply(n));return Tn({kind:`LazyFunction`,domain:t.domain,apply:r=>mr(n,r)?e:t.apply(r),source:t.source,boundTupleLengths:t.boundTupleLengths},En(t))}if(!jt(t))throw new e.b(`Attempted to apply EXCEPT construct to the value ${A(L(t))}.`);let a=I(t);if(ji(a,n))return a;let o=ki(a,n,wi);if(o===-1)return a;let s=[...a.range],c=a.range[o],l=r(c);s[o]=l;let u=Tn(Cn(a.domain,s),En(a));if(u.writtenKeys=a.writtenKeys,u.lambdaDomain=a.lambdaDomain,a.hash!==0&&a.hash!==Vi){let e=Ki(l);if(e!==Vi){let t=Ki(a.domain[o]);u.hash=c===l?a.hash:a.hash-Bi(t,Ki(c))+Bi(t,e)|0}}if(a.fingerprint!==0){let e=a.domain[o];u.fingerprint=c===l?a.fingerprint:a.fingerprint-Xi(e,c)+Xi(e,l)|0}return u},Ii=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Li=(e,t)=>Math.imul(e^t,16777619),Ri=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Ii(t)},zi=e=>Ii(e+2654435769|0),Bi=(e,t)=>Ii(Math.imul(e,668265261)+t|0),Vi=795548749,Hi=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Ki(t[e]);if(r===Vi)return Vi;n=n+zi(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Ki(e.domain[n]),i=Ki(e.range[n]);if(r===Vi||i===Vi)return Vi;t=t+Bi(r,i)|0}return t},Ui=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)return;if(t.kind===`InfiniteSet`||t.kind===`SequenceSet`)throw new e.b(`TLC has found a state in which the value of a variable contains ${L(t)}`);if(j(t)){P(t).elements.forEach(Ui);return}let n=I(t);n.domain.forEach(Ui),n.range.forEach(Ui)},Wi=t=>{if(typeof t==`object`&&t.kind!==`ModelValue`)try{Ki(t)===Vi&&Ui(t);return}catch(t){if(!(t instanceof e.b))throw t;return t}},Gi=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},Ki=e=>typeof e==`number`?Ii(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?Ri(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=Hi(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?N(e.domain)?Ki(I(e)):Vi:N(e)?Ki(P(e)):Vi,qi=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Ji=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return qi(t)},Yi=e=>qi(Qi(e)+2135587861|0),Xi=(e,t)=>qi(Math.imul(Qi(e),374761393)+Qi(t)|0),Zi=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Yi(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Xi(e.domain[n],e.range[n])|0;return t},Qi=e=>typeof e==`number`?qi(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?Ji(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Zi(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?Qi(I(e)):N(e)?Qi(P(e)):Ji($i(e)),$i=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):ea(e),ea=t=>{if(t.kind===`ModelValue`)return`@${t.name}`;if(t.kind===`InfiniteSet`)return`<${t.name}>`;if(t.kind===`SequenceSet`)return`<Seq ${$i(t.base)}>`;if(t.kind===`FilteredSet`&&!N(t))throw new e.b(`Attempted to compare the non-enumerable set ${L(t)} with another value`);if(j(t))return N(t)?`{${P(t).elements.map($i).join(`,`)}}`:`<${t.kind} ${L(t)}>`;let n=I(t);return`(${n.domain.map((e,t)=>`${$i(e)}:${$i(n.range[t])}`).join(`,`)})`},ta={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},na=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>ta[e])}"`,ra=1999,ia=e=>e.reduce((e,t)=>e===0?0:e*ai(t),1),aa=e=>{if(e.kind===`Subset`)return ai(e.base)<=6?P(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return P(e);if(e.kind===`FunctionSet`){let t=F(e.domain)?0:ai(e.domain);return(t===0?1:ai(e.range)**t)<=ra?P(e):void 0}return ia(e.kind===`RecordSet`?e.sets:e.factors)<=ra?P(e):void 0},oa=(t,n)=>{if(n||t.kind===`Union`||t.kind===`Subset`&&jt(t.base)&&(t.base.kind===`Function`||N(t.base.domain)))return aa(t);if(N(t))try{return aa(t)}catch(t){if(t instanceof e.b)return;throw t}},sa=(e,t)=>{let n=e=>L(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return Rr(e,t)}},ca=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),la=t=>{if(N(t.domain))try{return I(t)}catch(t){if(t instanceof e.b||e.et(t))return;throw t}},ua=e=>{let t=[],n=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:if(e.elements.forEach(n),e.isNormalized)return;e.isNormalized=!0,t.push(e);return;case`MixedSet`:e.elements.forEach(n),P(e);return;case`Function`:e.range.forEach(n);return;case`LazyFunction`:n(e.enumerated??e.domain);return;case`SetOperation`:n(e.left),n(e.right);return;case`FunctionSet`:n(e.domain),n(e.range);return;case`RecordSet`:e.sets.forEach(n);return;case`ProductSet`:e.factors.forEach(n);return;case`Subset`:case`Union`:case`FilteredSet`:case`SequenceSet`:n(e.base);return;default:return}};try{return e.forEach(n),e.map(e=>L(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1})}},L=(e,t=!1,n=!1)=>{let r=e=>L(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return na(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(P(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=$t.isExpanded?oa(e,t):void 0;return n?r(n):sa(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?$t.isExpanded||!e.source?la(e):void 0:e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${L(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Qt&&En(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&En(e)!==`lambda`);if(i.domain.length===0&&En(e)===`record`)return`[]`;if(i.domain.every((e,t)=>e===t+1))return`<<${i.range.map(a).join(`, `)}>>`;let o=n?i.domain.map((e,t)=>[e,i.range[t]]):zt(i);return En(e)===`record`||i.domain.every(e=>typeof e==`string`&&ca(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},da=(t,n)=>{if(t===void 0)return!1;try{return Pn(t,n)}catch(t){if(t instanceof e.b)return!1;throw t}},fa=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,pa=e=>Array.from({length:e.length},(t,n)=>e.charCodeAt(n)).reduce((e,t)=>Math.imul(e,31)+t|0,0),ma=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(fa,(e,a,o=``,s,c,l=``)=>{let u=e=>o.includes(`-`)?e.padEnd(Number(s)):e.padStart(Number(s??0)),d=o.includes(`<`),f=o.replace(`<`,``);if(l===`n`&&e===`%n`)return`
|
|
74
|
+
`;if(l===`%`&&c===void 0&&/^-?$/.test(f))return f===`-`&&s===void 0&&(i=!1),u(`%`);let p=d?r:a===void 0?n++:Number(a.slice(0,-1))-1;r=p;let m=t[p];if(!`sSbBhH`.includes(l)||l===``||!/^-?$/.test(f)||f===`-`&&s===void 0||m===void 0)return i=!1,e;let h=l.toLowerCase(),g=h===`s`?m:h===`b`?`true`:(pa(m)>>>0).toString(16),_=u(c===void 0?g:g.slice(0,Number(c.slice(1))));return l===h?_:_.toUpperCase()});return i?a:void 0},ha=(t,n)=>{let r=n?void 0:tn.get(t);if(r)return r();let i=Object.entries(t),a=rn.get(t),o=a!==void 0&&`_format`in t,s=o?t._format:i.length===1?`%s = %s
|
|
75
|
+
`:`/\\ %s = %s
|
|
76
|
+
`;if(typeof s!=`string`)throw new e.g(`The _format field of the ALIAS ${a} is ${L(s)}, but it must be a string.`);return i.filter(([e])=>!(o&&e===`_format`)).filter(([e,t])=>!n||!da(n[e],t)).map(([t,n])=>{let r=ma(s,[t,A(L(n))]);if(r===void 0)throw new e.g(`The _format field of the ALIAS ${a} is ${L(s)}, but it must format two strings, the name and the value of a field.`);return r}).join(``)},ga=[10454148508367108822n,15747411856486957441n,13848313129918172575n,15427004735118145554n,14338780731064426356n,15931650522396165332n,17670238537108149059n,12816660938095048951n,13192168525635896882n,16119298732711755075n,13564417994159519395n,15831473429641889162n,17671735485712653535n,14582471876431321160n,9288673424107444897n,12345523232675890545n,13774063780198914517n,10636128657019767374n,13227535641082688945n,10085966873248490402n,17056045221983369811n,18027133543548002442n,13033986364717636900n,12663388180492401538n,11007194744055901935n,16251515628090973732n,18046429724439772544n,9876734796024595817n,14949643787442512870n,16960057143726945461n,10590203213448744021n,12248592797044284137n,9558805810925624286n,16993321702164258530n,11754329512098378960n,12074934892440206921n,15696745233288286746n,10531590977001201739n,18107999685377398317n,12149369488538049728n,12923655455904407421n,10507099144397364930n,17322088528956367024n,14653973644796244054n,15165509594857513400n,13554280709034297251n,16228911470502883382n,17115369786458865383n,11179220607102683830n,16708422618246866334n,12295941796329322556n,18336630348474106240n,13989616001589685348n,14822072159597151759n,14264172520427195041n,11642530518213145397n,11877331515501935358n,13913116192159715440n,17054474839259161580n,13461230878584418056n,16058025410470398786n,11100471369705097435n,11133782763824505275n,13192312712502684421n,17456091706045076157n,13237272598629075916n,12914531898895761383n,15801841604014567326n,16446055517513626294n,16780923767715884464n,15104658705803254918n,10882049990920163451n,12728112724252049190n,11720209067562733740n,16476221075563830086n,16602801460297162326n,16206898064012585915n,12158475401238648099n,13742285336487677729n,15543703592025073839n,9615783578189153721n,16710542608962839044n,11960730242263336692n,13328718558362718101n,12971616006464047952n,17057853503483465676n,16180230282101315295n,15483523553568578902n,17773465781871025571n,18047252642493037509n,11580640560664688668n,10121963531818974651n,14218267149826330657n,12715294421139777506n,10584764766358778171n,12666843443693621286n,17403948736867619210n,17907955559063099692n,15179434392748515198n,15413469521140985247n,13455040338347572751n,15419348191054617477n,12340568220039846914n,13236419189535069162n,18074463254581147189n,10818750974828329405n,9859349269386152082n,15035006154709018396n,13627907273947709876n,9549035931546940138n,16199589727945564820n,10285831968679942330n,17737018494601061698n,15477896647372134857n,13595764249822586512n,10556855812148546550n,12421897615105552821n,15477767459253848096n,17421607461439241175n,12409061346569762725n,13621778224251023638n,10680972825126675886n,16494492050207190715n,16801324317763555620n,12664650400804916358n,16134230614391269483n,10027806175083075147n,9259037851175017999n,11803214621941906429n,9537357587847606069n,10517495000576890277n];let _a=ga[0];const va=()=>_a,ya=/* @__PURE__ */ new Int32Array(256),ba=/* @__PURE__ */ new Int32Array(256),xa=/* @__PURE__ */ new Int32Array(256),Sa=/* @__PURE__ */ new Int32Array(256),Ca=/* @__PURE__ */ new Int32Array(256),wa=/* @__PURE__ */ new Int32Array(256),Ta=/* @__PURE__ */ new Int32Array(256),Ea=/* @__PURE__ */ new Int32Array(256);let Da=0,Oa=0,ka=0,Aa=0;const ja=e=>{let t=(e^Aa)&255;Aa=(Aa>>>8|ka<<24)^Ca[t],ka=ka>>>8^ya[t]},Ma=e=>{let t=ga[e];_a=t;let n=[];for(let e=1n<<63n;n.length<72;)n.push(e),e=e>>1n^((e&1n)==0n?0n:t);let r=n.slice(64,72).reverse();for(let e=0;e<256;e++){let t=r.reduce((t,n,r)=>e>>r&1?t^n:t,0n);ya[e]=Number(BigInt.asIntN(32,t>>32n)),Ca[e]=Number(BigInt.asIntN(32,t))}let i=[ya,ba,xa,Sa],a=[Ca,wa,Ta,Ea];for(let e=1;e<4;e++){let t=i[e-1],n=a[e-1];for(let r=0;r<256;r++){let o=n[r]&255;a[e][r]=(n[r]>>>8|t[r]<<24)^Ca[o],i[e][r]=t[r]>>>8^ya[o]}}Da=Number(BigInt.asIntN(32,t>>32n)),Oa=Number(BigInt.asIntN(32,t))};Ma(0);const Na=e=>{let t=Aa^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;Aa=ka^Ea[n]^Ta[r]^wa[i]^Ca[a],ka=Sa[n]^xa[r]^ba[i]^ya[a]},Pa=e=>{if(typeof e==`boolean`)return ja(0),ja(e?116:102),2;if(typeof e==`number`)return ja(1),Na(e),5;if(typeof e==`string`){ja(3),Na(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)Na(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)ja(e.charCodeAt(n));return 5+e.length}return ja(21),Na(sn(e.name)+1),5},Fa=e=>{if(typeof e!=`object`||M(e))Pa(e);else if(jt(e)){let t=I(e);ja(9),Na(t.domain.length);for(let e=0;e<t.domain.length;e++)Fa(t.domain[e]),Fa(t.range[e])}else{let t=P(e).elements;ja(5),Na(t.length);for(let e of t)Fa(e)}},Ia=e=>{let t=ka,n=Aa;ka=Da,Aa=Oa;for(let t of e)Fa(t);let r=BigInt(ka>>>0)<<32n|BigInt(Aa>>>0);return ka=t,Aa=n,r},La=(e,t)=>{let n=new BigInt64Array(e.length),r=new Int32Array(n.buffer),i=ka,a=Aa;return e.forEach((e,n)=>{ka=Da,Aa=Oa;for(let n of t)Fa(e[n]);r[2*n]=Aa,r[2*n+1]=ka}),ka=i,Aa=a,n},Ra=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),za=1024,Ba=e=>({current:-1,expressions:[],ranges:[],firstChild:[],lastChild:[],nextSibling:[],prefixes:[],isPart:[],isPrimed:[],isUnchanged:[],recursive:[],lets:[],roots:[],primary:[],secondary:[],covered:/* @__PURE__ */ new WeakSet,values:/* @__PURE__ */ new WeakMap,registers:new Uint8Array(e*za),relations:[]}),Va=(e,t,n,r,i)=>{let a=e.expressions.length;if(e.expressions.push(t),e.ranges.push(n),e.firstChild.push(-1),e.lastChild.push(-1),e.nextSibling.push(-1),e.prefixes.push(-1),e.isPart.push(i),e.isPrimed.push(!1),e.isUnchanged.push(t?.kind===`Unchanged`),e.recursive.push(-1),e.lets.push(void 0),e.roots.push(r===-1?a:e.roots[r]),e.primary.push(0),e.secondary.push(0),t&&e.covered.add(t),r===-1)return a;let o=e.lastChild[r];return o===-1&&(e.firstChild[r]=a),o!==-1&&(e.nextSibling[o]=a),e.lastChild[r]=a,a},Ha=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,Ua=(e,t,n,r,i)=>{let a=t===`next`?Ha(e,t,r):void 0;if(a!==void 0)return a;let o=Va(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},Wa=(e,t)=>e!==void 0&&t!==void 0&&e.module===t.module&&e.start.line===t.start.line&&e.start.column===t.start.column&&e.end.line===t.end.line&&e.end.column===t.end.column,Ga=(t,n,r)=>{let i=t===void 0?void 0:r.definitions.get(t),a=i?.kind===`Operator`?i.head:void 0,o=n.location.range;return!i||!a?`Action ${o?e.X(o):`Unknown location`}`:Wa(i.body.location.range,o)||!o?`${i.name} ${e.X(a)}`:`${i.name} ${e.X(a)} (${o.start.line} ${o.start.column} ${o.end.line} ${o.end.column})`},Ka=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,qa=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,Ja=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},Ya=e=>Array.from({length:e.length},(t,n)=>e.charCodeAt(n)).reduce((e,t)=>Math.imul(e,31)+t|0,0)&2147483647,Xa=e=>{let t=Array.from({length:11},()=>[]);return e.forEach((e,n)=>{if(n>=Math.floor(t.length*.75)){let e=Array.from({length:t.length*2+1},()=>[]);for(let n=t.length-1;n>=0;n--)t[n].forEach(t=>e[Ya(t.name)%e.length].unshift(t));t=e}t[Ya(e.name)%t.length].unshift(e)}),t.toReversed().flat()},Za=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),Qa=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),$a=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),eo=(e,t,n)=>{let r=new Set(n.map(Ka)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(O(e)){for(let e=r;e;e=e.parent)if(e.name===n)return e.definition&&{definition:e.definition,scope:e.scope};return}let i=t.substitutions.get(n)??n;if(t.variableIndex.has(i)||t.constants.has(i))return;let a=t.definitions.get(i),o=a?.location.range?.module??a?.body.location.range?.module;return a&&!Ra.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=Va(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(Ka(n));let d=t&&s.get(t);if(d&&i.forEach(t=>{e.expressions[t]===d&&(e.lets[t]??=[]).push(u)}),l?.kind===`Operator`&&l.isRecursive){let t=i.findLast(e=>a[e]===l);t!==void 0&&(e.recursive[u]=t)}return a[u]=l,i.push(u),o(),i.pop(),u},u=e=>{let t=e.definition;if(o.includes(t))return;o.push(t);let n=t.kind===`Function`?$a(t.bounds):t.params.map(e=>e.name);m(t.body,Qa(n,e.scope)),t.kind===`Function`&&Za(t.bounds).forEach(t=>m(t,e.scope)),o.pop()},d=e=>e?.definition.kind===`Operator`&&e.definition.params.length>0,f=(e,t,n,r)=>{if(e.kind===`Lambda`)m(e.body,Qa(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:m(e.body,Qa(e.params,t));return;case`Lambda`:m(e.body,Qa(e.params,t));return;case`Let`:{let n=e.definitions.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),Xa(e.definitions).forEach(e=>u({definition:e,scope:n})),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,qa(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,Ja(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,qa(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,Qa($a(e.bounds),t)),r(Za(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,Qa($a(e.bounds),t)),r(Za(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,Qa($a([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,Qa(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,Qa(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}};e.relations.forEach(e=>{i.push(e.node),m(e.expression,void 0),i.pop()})},to=(e,t,n)=>{for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r]){if(e.expressions[r]===n)return r;if(e.isPart[r]){let t=to(e,r,n);if(t!==-1)return t}}return-1},no=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=to(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:to(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},ro=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},io=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},ao=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},oo=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},so=(e,t)=>t.forEach((t,n)=>{let r=Ia([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*za+i;e.registers[o]=Math.max(e.registers[o],oo(a)+1)}),co=(e,t)=>{let n=e.registers.subarray(t*za,(t+1)*za),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*za*za/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*za?a===0?i:za*Math.log(za/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},lo=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},uo=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>lo(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},fo=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},po=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],mo=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},ho=(e,t)=>{let n=e.primary[t.node],r=e.secondary[t.node];return t.kind===`init`?{distinct:n,generated:n+r}:t.kind===`next`?{distinct:r,generated:n}:t.kind===`constraint`?{distinct:r,generated:n+r}:{distinct:0,generated:0}},go=(t,n)=>{let r=[],i=/* @__PURE__ */ new Map,a=e=>{let n=[],r={primary:t.primary[e],secondary:t.secondary[e]};return(r.primary>0||r.secondary>0||po(t,e))&&fo(n,r),mo(t,e).forEach(e=>a(e).forEach(e=>fo(n,e))),i.set(e,n),n},o=(n,i,a,o)=>{let s=t.ranges[n];r.push({location:s?e.X(s):`Unknown location`,depth:i,count:a,cost:o})},s=(e,n)=>o(e,n,t.primary[e],t.secondary[e]),c=(e,n)=>{let r=mo(t,e),l=[];r.forEach(e=>(i.get(e)??a(e)).forEach(e=>fo(l,e)));let u={primary:t.primary[e],secondary:t.secondary[e]},d=po(t,e),f=e=>r.forEach(t=>c(t,e));if(t.isUnchanged[e]){let t=l.filter(e=>e.primary!==0||e.secondary!==0);t.length===0?s(e,n):o(e,n,Math.max(u.primary,uo(t).primary),0);return}if(l.length===0){(u.primary!==0||d)&&s(e,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let t=l[0],r=t.primary===0&&t.secondary===0;if(t.primary<u.primary){s(e,n),f(n+1);return}if(!d&&p&&!r){o(e,n,t.primary,t.secondary);return}if(p&&r){d&&s(e,n),f(d?n+1:n);return}if(u.primary===t.primary&&u.secondary===t.secondary){s(e,n);return}}let m=!p||d;m&&s(e,n),f(m?n+1:n)};return mo(t,n).forEach(e=>{a(e),c(e,0)}),r},_o=[`init`,`next`,`invariant`,`constraint`,`implied`],vo=(e,t)=>!e||!t?e?1:t?-1:0:e.module===t.module?e.start.line-t.start.line||e.start.column-t.start.column||e.end.line-t.end.line||e.end.column-t.end.column:e.module<t.module?-1:1,yo=e=>_o.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>vo(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||vo(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),bo=(t,n,r,i)=>({variables:i.map(i=>{let a=r[i]?.range;return{label:`${n.variables[i]} ${a?e.X(a):`Unknown location`}`,distinct:co(t,i)}}),relations:yo(t).map(e=>({kind:e.kind,label:e.label,...ho(t,e),expressions:go(t,e.node)}))}),xo=(e,t,n)=>{let r=Ha(e,t,n);if(r===void 0)return;let i=e.primary[r],a=e.secondary[r];if(t===`init`)return[[`generated`,i+a],[`distinct`,i]];if(t===`next`)return[[`generated`,i],[`distinct`,a]];let o=e.firstChild[r];return[[`count`,o===-1?i:e.primary[o]]]},So=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),Co=(t,n)=>So.has(t)?new e.b(n):new e.O(n),wo=(t,n,r,i)=>new e.O(`The ${t} argument of ${n} should be a ${r}, but instead it is:\n${L(i)}`),To=(t,n,r=t)=>{if(!j(t)||ln(t))throw new e.O(`Applying ${n} to the following value,\nwhich is not a finite set:\n${L(r)}`);return P(t)},Eo=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||Eo(r))throw Co(n,`${n} expects a value as argument ${t+1}`);return r},Do=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw Co(n,`${n} expects a boolean but received ${L(r)}`);return r},Oo=(e,t,n)=>{let r=e[t];if(r===void 0||!Eo(r))throw Co(n,`${n} expects an operator as argument ${t+1}`);return r},ko=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),z=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),Ao=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),jo=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),Mo=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),No=e=>e>2147483647||e<-2147483648,Po=t=>new e.O(`Overflow when computing ${t}`),Fo={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},Io={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Lo={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},Ro={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},zo=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Io[e.operator];if(e.kind!==`Function`)return Fo[e.kind];let t=En(e);return t===void 0?`FcnRcdValue`:Ro[t]},Bo=e=>Lo[zo(e)],Vo=(e,t)=>`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`,Ho=(t,n)=>new e.b(Vo(t,n)),Uo=(t,n)=>{let r=r=>(...i)=>{let a=fi.sets?.length??0;try{return r(...i)}catch(r){if(!(r instanceof e.b)||r instanceof e.v)throw r;let i=mi(a);throw fi.sets&&(fi.sets.length=a),t.isLazy!==!0&&r instanceof e.O&&!i?r:t.isLazy!==!0&&r instanceof e.k?new e.O(Vo(n,r.message)):Ho(n,r.message)}},i=r(t.evaluate);return{...t,evaluate:(e,r)=>{if(e.length!==t.arity)throw Ho(n,`array is not of length ${t.arity}`);return i(e,r)},evaluateUnary:t.evaluateUnary&&r(t.evaluateUnary),evaluateBinary:t.evaluateBinary&&r(t.evaluateBinary)}},Wo=(e,t)=>{if(typeof e!=`number`)throw Ho(t,`Cannot cast tlc2.value.impl.${zo(e)} to tlc2.value.impl.IntValue`);return e},Go=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Ko=(e,t,n,r)=>{let i=Go(e,n,`IntValue`,2);return Mo(t,(e,n)=>{let a=Wo(n,i),o=Wo(e,i),s=r(o,a);if(No(s))throw Po(`${o}${t}${a}`);return s})},qo=(t,n,r)=>{if(typeof t!=`number`)throw new e.O(`The ${n} argument of ${r} should be an integer, but instead it is:\n${L(t)}`);return t},Jo=(e,t,n=e)=>Mo(e,(e,r)=>t(qo(e,`first`,n),qo(r,`second`,n))),Yo=(e,t,n)=>({...jo(e,t,n),isLazy:!0}),Xo=(e,t,n)=>{let r=Oo(e,t,n);return()=>r.call([])},Zo=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),Qo=()=>({implication:wh,negate:Th,equivalent:Eh,body:Dh,condition:(e,t)=>{if(typeof e!=`boolean`)throw sh(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw ch(t,n,e);return e},apply:Mi,expectFunction:bh,tuple:Pr,set:vr,record:Ir,writtenRecord:Bt,equal:Pn,enumerate:Ph,choiceElements:a_,noChoice:e=>{throw o_(e)},filterPredicate:i_,isReducible:At,finiteElements:e=>P(e).elements,addBounded:Dt,normalizedSet:Sn,isBeyondBound:Ot,cardinality:ai,functionDomain:Mr,sortedFunction:Cn,unassigned:(e,t)=>{throw hh(e,t)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:xh,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>vh(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let $o,es;const ts=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},ns=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),rs=e=>`local${e.counter++}`,is=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),Be(e).forEach(e=>is(e,t)),t),as=(e,t,n)=>{let r=is(t),i=[...n.locals].filter(([e])=>r.has(e));if(i.length===0)return n.context;let a=ns(e,i.map(([e])=>e));return`extend(${n.context}, ${a}, [${i.map(([,e])=>e).join(`, `)}])`},os=(e,t,n)=>`${ns(e,U(t,e.environment))}(${as(e,t,n)})`,ss=(e,t,n)=>{let r=`helper${e.counter++}`,i=[...t.locals.values()],a={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(t.locals)},o=i.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${r}(context, state, next${o}) { let primed; let applied; ${n(a)} }`),`${r}(${t.context}, ${t.state}, ${t.isPrimed?`undefined`:t.next}${o})`},cs=(e,t,n,r)=>{let i=rs(e),a=rs(e),o=rs(e);return`for (let ${i} = 0, ${a} = ${t}.low, ${o} = ${a} === undefined ? ${t}.length : ${t}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${t}[${i}] : ${a} + ${i}; ${r} }`},ls=(e,t,n)=>{let r=t.kind===`Forall`;return ss(e,n,n=>{let i=t.bounds.map(()=>rs(e)),a=t.bounds.map((r,a)=>a>0&&t.bounds[a-1].set===r.set?`const ${i[a]} = ${i[a-1]};`:`const ${i[a]} = enumerate(${gs(e,r.set,n)}, ${ns(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=rs(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${gs(e,t.body,n)}, ${ns(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>cs(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},us=(e,t,n,r,i)=>ss(e,i,i=>{let a=rs(e),o=rs(e),s=ns(e,t),c=`choiceElements(${gs(e,n,i)}, ${s}, ${ns(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${gs(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${cs(e,a,o,l)} return noChoice(${s});`}),ds=(e,t,n,r)=>ss(e,r,r=>{let i=rs(e),a=rs(e),o=rs(e),s=rs(e),c=ns(e,t),l=`if (!isReducible(${i})) return ${ns(e,r_(t,e.environment))}(${i}, ${as(e,t,r)});`,u=gs(e,t.bound.set,r);r.locals.set(n,s);let d=`if (filterPredicate(${gs(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${cs(e,a,s,d)} return normalizedSet(${o});`}),fs=(e,t,n,r)=>ss(e,r,r=>{let i=rs(e),a=rs(e),o=rs(e),s=rs(e),c=rs(e),l=rs(e),u=ns(e,e_(t,e.environment)),d=as(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=gs(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${gs(e,t.body,r)}; if (!${a}) ${s}.push(${l});`;return`const ${i} = ${p}; ${f} const ${a} = isBeyondBound(${i}); const ${o} = ${a} ? ${i} : functionDomain(${i}); if (${a}) cardinality(${i}); const ${s} = []; ${cs(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),ps=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=gs(e,r[0],n),a=gs(e,r[1],n),o=ns(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${gs(e,r[0],n)}, ${ns(e,t)})`;if(t.operator===`<=>`)return`equivalent(${gs(e,r[0],n)}, ${gs(e,r[1],n)}, ${ns(e,t)})`;if(O(t))return os(e,t,n);let i=sg(t.operator,e.environment);if(i?.kind!==`Builtin`)return os(e,t,n);if(i.name===`DOMAIN`)return`${ns(e,dh(t))}(${gs(e,r[0],n)})`;if(i.name===`TLCEval`)return os(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${ns(e,fh(t,i))}(${gs(e,r[0],n)}, ${gs(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Bg(r[0],a))return`${ns(e,i.evaluateUnary)}(${gs(e,r[0],n)})`;let o=r.length===2&&Bg(r[0],a)&&Bg(r[1],a);return i.evaluateBinary&&o?`${ns(e,i.evaluateBinary)}(${gs(e,r[0],n)}, ${gs(e,r[1],n)})`:os(e,t,n)},ms=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(O(e))return!1;let r=vg(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return ms(e.expression,t,n);case`FieldAccess`:return ms(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>ms(e,t,n));default:return!1}},hs=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return hs(e.record);case`FunctionApplication`:return[e.function,...e.args].every(hs);default:return!1}},gs=(e,t,n)=>{let r=(t,r=n)=>gs(e,t,r);switch(t.kind){case`Number`:return Pt(t.value)?String(t.value):os(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(O(t))return os(e,t,n);let i=vg(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=ns(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?ns(e,i.value):os(e,t,n)}case`Apply`:return ps(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=ns(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${ns(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Yg(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${ms(t.function,n,e.environment)?r(t.function):hs(t.function)?r(t.function,i):os(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${ns(e,t)}))`,o=uh(e.environment.runtime.version),s=o?`, ${ns(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${ns(e,lh(t))}(${r(t.record)})`;case`Record`:{let i=c_(t.fields);if(l_(i))return os(e,t,n);let a=ns(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${ns(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:return n.isPrimed?os(e,t,n):r(t.expression,{context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals});case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?ls(e,t,n):os(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?us(e,t,t.set,t.pattern.name,n):os(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!$g(t)?fs(e,t,r.pattern.name,n):os(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?ds(e,t,t.bound.pattern.name,n):os(e,t,n);default:return os(e,t,n)}},_s=(e,t)=>{if(!Zo.has(e.kind)||(es??=ts(),!es))return;let n={environment:t,references:[],helpers:[],counter:0},r=gs(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
|
|
77
|
+
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return $o??=Qo(),Function(...Object.keys($o),...i,a)(...Object.values($o),...n.references)},vs={kind:`Local`},ys=/* @__PURE__ */ new WeakSet,bs=/* @__PURE__ */ new WeakMap,xs=/* @__PURE__ */ new WeakMap,Ss=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Cs=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),ws=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Ts=e=>e.kind===`Operator`?e.params.length:0,Es=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Ds=e=>e.name.includes(`!`),Os=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},ks=(e,t,n)=>{let r=t.bindings.get(e);return r&&ws(r.position,t.location)&&(!n||ws(r.position,n.start))?r:void 0},As=(t,n)=>t!==void 0&&n!==void 0&&e.X(t)===e.X(n),js=(t,n,r,i)=>{if(n===void 0)return!0;if(As(n.range,r.range))return!1;let a=r.range;if(a===void 0||i.isGenerated||n.kind!==`Builtin`&&!n.range)return!0;let o=e.X(a),s=n.range&&e.X(n.range);return n.kind===`Builtin`?i.errors.push({location:o,message:`Symbol ${t} is a built-in operator, and cannot be redefined.`}):r.kind===`Parameter`||n.kind!==r.kind||n.arity!==r.arity?i.errors.push({location:o,message:`Multiply-defined symbol '${t}': this definition or declaration conflicts \nwith the one at ${s}.`}):i.warnings.push({location:o,message:`Multiple declarations or definitions for symbol ${t}. \nThis duplicates the one at ${s}.`}),!1},Ms=(e,t,n,r)=>js(t,Os(e,t)??ks(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Ns=(e,t,n)=>{js(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Ps=(e,t,n,r)=>t.reduce((e,t,i)=>Ms(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Fs=(e,t,n)=>t.reduce((e,t)=>Ms(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Is=e=>e.kind===`Name`?[e.name]:e.names,Ls=e=>e.flatMap(e=>Is(e.pattern)),Rs=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||ws(n.location,t.location))?n:void 0},zs=(e,t)=>{let n=Rs(e,t);return n?{key:t.getKey(n),arity:Ts(n),params:Es(n),kind:`Definition`}:t.imported.get(e)},Bs=(e,t,n)=>Os(t,e)??zs(e,n),Vs=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Hs=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Vs(e.location,e.spelling??t)},Us=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return ws(e.location,e.args[0].location)?`prefix`:`postfix`}},Ws=e=>!/^[\p{L}\d_]/u.test(e),Gs=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Ks=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,qs=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},Js=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?qs(e.name,[],void 0):qs(e.operator,e.args,e.argumentCounts),Ys=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Xs=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Ls(e.bounds),body:e.body,sets:Ys(e.bounds)};case`SetMap`:return{names:Ls(e.bounds),body:e.expression,sets:Ys(e.bounds)};case`SetFilter`:return{names:Is(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Is(e.pattern),body:e.body,sets:e.set?[e.set]:[]};case`UnboundedQuantifier`:case`Lambda`:return{names:e.kind===`Lambda`?e.params:e.names,body:e.body,sets:[]};default:return}},Zs=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},Qs=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,$s=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),ec=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?ec(e.body,t):Be(e).reduce((e,n)=>e??ec(n,t),void 0)},tc=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??tc(i,t,n||$s(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&ec(e.set,t):ec(e,t)},nc=e=>e.kind===`Label`?nc(e.body):e,rc=e=>typeof e==`number`?`argument selector ${e}`:e,ic=`within the scope of a declaration
|
|
78
|
+
from outside that declaration's scope.`,ac=(t,n,r,i,a,o)=>{let s=(n,r)=>{let i=(n===void 0?void 0:t.selectorRanges?.[n])??t.location.range;i&&a.errors.push({location:e.X(i),message:r})},c=r.isSuffices===r.isInProof,l=r.statement,u={node:l,isGoal:!0,isSufficesOpen:r.isSuffices};for(let[e,t]of n.slice(1).entries()){let r=e+1,o=u.node;if(t.kind===`Name`){if(n[r-1].kind!==`Name`)return o.kind!==`NewSymbol`&&o.kind!==`AssumeProve`&&nc(o).kind===`Let`?void 0:s(r-1,`A name selector here must be from a LET clause.`);let e=l.kind===`AssumeProve`?[...l.assumptions,l.conclusion]:[l],i=r===1?e.map((e,n)=>({position:n,label:tc(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:o.kind===`Label`?ec(o.body,t.name):void 0};if(!i?.label)return s(r,`Cannot find label \`${t.name}'.`);if(r===1&&l.kind===`AssumeProve`&&$s(l,i.position)&&c)return s(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${ic}`);if(t.args.length!==i.label.params.length)return s(r,`Label \`${t.name}' used with wrong number of arguments.`);u.node=i.label,u.isGoal=!1,u.isSufficesOpen=!1;continue}if(t.kind!==`Operand`)return;let d=rc(t.operand);if(u.isSufficesOpen){if(Ks(t.operand,1)!==0)return s(r,o.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);u.isSufficesOpen=!1;continue}if(o.kind===`NewSymbol`)return;if(o.kind!==`AssumeProve`){let e=nc(o);if([`Number`,`Decimal`,`String`].includes(e.kind))return s(r,`Selecting subexpression of expression that has none.`);let n=e.kind===`Identifier`?Bs(e.name,i,a)?.kind:void 0;if(n===`Variable`||n?.startsWith(`New`))return s(r,`Choosing operand \`${d}' of subexpression with no operands.`);let c=Xs(e)?.sets,l=e.kind===`Identifier`?[]:c?c.length>0?c:void 0:e.kind===`Except`?void 0:Zs(e);if(!l)return;let f=Ks(t.operand,l.length);if(f===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);u.node=l[f],u.isGoal=!1;continue}let f=[...o.assumptions,o.conclusion],p=Ks(t.operand,f.length);if(p===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);if($s(o,p)&&(!u.isGoal||c))return s(r,`Accessing ASSUME/PROVE clause ${ic}`);let m=f[p];if(m.kind===`NewSymbol`&&r!==n.length-1)return s(r,`Selected a subexpression of a NEW clause of an ASSUME.`);u.node=m,u.isGoal=!1}o||(u.node.kind===`AssumeProve`&&s(void 0,`Selected ASSUME/PROVE instead of expression.`),u.node.kind===`NewSymbol`&&s(void 0,`Selected a NEW declaration as an expression or operator.`))},oc=(t,n)=>{let r=n.isGenerated?void 0:n.hasLabelScope?n.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:n.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return r===void 0||!t.location.range?!1:(n.errors.push({location:e.X(t.location.range),message:r}),!0)},sc=(t,n,r)=>{let i=t.location.range;if(!i||r.isGenerated)return;let a=e.X(i),o=t.params.filter((i,a)=>{let o=Os(n,i)?.kind===`Parameter`,s=t.paramRanges?.[a];return!o&&s&&r.errors.push({location:e.X(s),message:`Illegal parameter ${i} of label \`${t.name}'.`}),o});o.filter((e,t)=>o.indexOf(e)!==t).forEach(e=>r.errors.push({location:a,message:`Repeated formal parameter ${e} \nin label \`${t.name}'.`})),r.labelParams.filter(e=>!o.includes(e)).forEach(e=>r.errors.push({location:a,message:`Label ${t.name} must contain formal parameter \`${e}'.`}));let s=[...new Set(o.filter(e=>!r.labelParams.includes(e))),...t.params.filter(e=>!o.includes(e))];s.length>0&&r.errors.push({location:a,message:`Label ${t.name} declares extra parameter(s) ${s.map(e=>`${e} `).join(``)}`}),r.labels.has(t.name)&&r.errors.push({location:a,message:`Duplicate label \`${t.name}'.`}),r.labels.add(t.name)},cc=(e,t,n,r)=>{if(!Qs(e))return!1;let i=Js(e),a=i[0],o=i.length>1&&a.kind===`Name`?Os(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&ac(e,i,o,t,n,r),o!==void 0},lc=(t,n,r,i)=>{let a=t.location;if(yc(t,r,i))return;let o=xs.get(t);if(o!==void 0)return o;if(Ss(n))return t.kind===`Apply`?t.args.length:0;let s=Os(r,n);if(s?.isNonFact){i.errors.push({location:e.X(Hs(t,n)),message:`Step number of non-expression step used as an expression.`});return}if(cc(t,r,i,!1)||Gs(n)&&s)return t.kind===`Apply`?t.args.length:0;if(s&&t.kind!==`OperatorReference`&&(t.resolution=vs),s)return s.arity;let c=zs(n,i);if(c)return t.kind===`Identifier`?t.name=c.key:t.operator=c.key,xs.set(t,c.arity),c.arity;let l=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``;if(l!==``&&(Os(r,l)!==void 0||zs(l,i)!==void 0||i.facts.has(l)))return t.kind===`Apply`?t.args.length:0;let u=(t.kind===`Identifier`?void 0:t.spelling)??n,d=e.X(t.kind===`Apply`&&u===`-.`?Vs(a,`-`):Hs(t,n));if(!Ws(n)||Gs(n)){i.errors.push({location:d,message:`Unknown operator: \`${n}'.`});return}i.errors.push({location:d,message:`Could not find declaration or definition of symbol '${u}'.`});let f=Us(t);f&&a.range&&i.errors.push({location:e.X(a.range),message:`Couldn't resolve ${f} operator symbol \`${u}'.`})},uc=(e,t,n)=>(e.forEach(e=>B(e.set,t,n)),e.reduce((e,t)=>Ps(e,Is(t.pattern),t.pattern.ranges,n),t)),dc=(e,t)=>e.kind===`Identifier`&&e.name===t&&O(e)||Be(e).some(e=>dc(e,t)),fc=(e,t)=>{e.kind===`FunctionConstruction`&&dc(e.body,t)&&(e.isRecursive=!0),Be(e).forEach(e=>fc(e,t))},pc=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?Ls(t.bounds):[],labels:/* @__PURE__ */ new Set},o=t.name,s=t.location.range,c=t=>{s&&!a.isGenerated&&a.errors.push({location:e.X(s),message:t})},l=t.kind===`Function`?uc(t.bounds,n,a):Fs(n,t.params,a),u=Os(l,o)??ks(o,a,s),d=u?.isPending===!0&&i.has(u);return u?.isPending&&!d?c(`Recursive ${t.kind===`Function`?`function`:`operator`} ${o} defined at wrong LET/IN level.`):u&&!d&&c(t.kind===`Function`?`Function name \`${o}' already defined or declared.`:`Operator ${o} already defined or declared.`),t.kind===`Function`?(B(t.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),fc(t.body,o),t.isSelfReferential=dc(t.body,o)):B(t.body,l,a),u&&d?(u.isPending=!1,u.range=s,!1):t.kind===`Function`?u===void 0:js(o,Os(n,o)??ks(o,a,s),{kind:`Definition`,arity:Ts(t),range:s},a)},mc=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Os(e,t.name)?.isPending)return e;let n={name:t.name,arity:Ts(t),params:Es(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>Tc(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Ss(t.name)?e:s(e,e=>!ws(t.location,e.location)),o={name:t.name,arity:Ts(t),kind:`Definition`,range:t.location.range,parent:a};if(Ds(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Ss(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return pc(t,a,u,i)?{...o,params:Es(t)}:a},a),()=>!0)},hc=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Os(t,r)??ks(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},gc=(t,n,r)=>{if(t.kind!==`Identifier`&&t.kind!==`Apply`)return!1;let i=hc(t.kind===`Identifier`?t.name:t.operator,n,r),a=t.kind===`Apply`?t.argumentCounts?.[0]??0:0;if(!i||a===i.arity)return!1;let o=(t.kind===`Apply`?t.argumentRanges?.[0]:void 0)??t.location.range;return o&&r.errors.push({location:e.X(o),message:`The operator ${i.name} requires ${i.arity} arguments.`}),!0},_c=(t,n,r)=>{if(gc(t,n,r))return;let i=t.operator,a=Bs(i,n,r),o=lc(t,i,n,r);if(o===void 0)return;if(o!==t.args.length){r.errors.push({location:e.X(t.argumentsRange??Hs(t,i)),message:`The operator ${i} requires ${o-(hc(i,n,r)?.arity??0)} arguments.`});return}let s=a&&(a.kind===`Definition`?a.params:[]);if(s===void 0){t.args.forEach(e=>vc(e,n,r));return}let c=(t,n)=>{t&&r.errors.push({location:e.X(t),message:n})};t.args.map((e,a)=>{let o=s[a]??0,l=e.location.range;if(o===0){if(e.kind===`Lambda`&&e.operator!==void 0)c(l,`The operator ${e.operator} requires 1 arguments.`);else if(e.kind===`Lambda`&&l)c(l,`LAMBDA expression used where an expression is required.`);else if(e.kind===`OperatorReference`){let t=lc(e,e.operator,n,r);t!==void 0&&c(l,`The operator ${e.operator} requires ${t} arguments.`)}else B(e,n,r);return!0}if(e.kind===`Lambda`){B(e,n,r);let s=e.params.length===o;return!s&&ys.has(e)?c(l,`Expected arity ${o} but found operator of arity ${e.params.length}.`):!s&&l&&e.operator===void 0&&c(t.selectorRanges?.at(-1)??Hs(t,i),`Lambda expression with arity ${e.params.length} used as argument ${a+1} of operator \`${i}', \nbut an operator of arity ${o} is required.`),s}if(e.kind===`Subexpression`)return B(e,n,r),!0;if(e.kind===`Apply`&&e.argumentCounts?.at(-1)===0){let t=e.argumentCounts.findIndex(e=>e>0);return c(e.selectorRanges?.[t],`Selector \`${e.operator.split(`!`)[t]}' should not have argument(s).`),!1}if(e.kind!==`Identifier`&&e.kind!==`OperatorReference`)return c(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${i}', in a position an operator is required.`),!1;let u=e.kind===`Identifier`?e.name:e.operator,d=Bs(u,n,r)?.params??[],f=lc(e,u,n,r);return e.kind===`Identifier`&&f!==void 0&&f!==o&&c(Hs(e,u),`Expected arity ${o} but found operator of arity ${f}.`),f===o&&d.every(e=>e===0)}).forEach((e,n)=>{e||c(t.location.range,`Argument number ${n+1} to operator '${i}' \nshould be a ${s[n]}-parameter operator.`)})},vc=(e,t,n)=>{e.kind===`Identifier`?lc(e,e.name,t,n):B(e,t,n)},yc=(e,t,n)=>{let r=bs.get(e);return r?(r.args.forEach(e=>vc(e,t,n)),n.errors.push(r.error),!0):!1},B=(t,n,r)=>{if(ys.has(t)&&!r.isGenerated){B(t,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>B(e,n,r)),a=e=>({...r,labelParams:[...r.labelParams,...e]});switch(t.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(gc(t,n,r))return;let i=t.name,a=lc(t,i,n,r);a!==void 0&&a>0&&r.errors.push({location:e.X(Hs(t,i)),message:`The operator ${i} requires ${a} arguments.`});return}case`OperatorReference`:lc(t,t.operator,n,r);return;case`Apply`:_c(t,n,r);return;case`Lambda`:B(t.body,Ps(n,t.params,t.paramRanges,r),a(t.params));return;case`And`:case`Or`:i(t.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:B(t.expression,n,r);return;case`If`:i([t.condition,t.consequent,t.alternative]);return;case`Case`:i(t.arms.flatMap(e=>[e.condition,e.body])),t.other&&B(t.other,n,r);return;case`Let`:B(t.body,mc(t.definitions,n,r,t.instances),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:B(t.body,uc(t.bounds,n,r),a(Ls(t.bounds)));return;case`UnboundedQuantifier`:B(t.body,Ps(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&B(t.set,n,r),B(t.body,Ps(n,Is(t.pattern),t.pattern.ranges,r),a(Is(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:B(t.predicate,uc([t.bound],n,r),a(Is(t.bound.pattern)));return;case`SetMap`:B(t.expression,uc(t.bounds,n,r),a(Ls(t.bounds)));return;case`FunctionSet`:i([t.domain,t.range]);return;case`Record`:case`RecordSet`:t.fields.forEach((i,a)=>{t.fields.slice(0,a).some(e=>e.name===i.name)&&r.errors.push({location:e.X(i.location.range??Vs(i.location,i.name)),message:`Non-unique fields in constructor.`}),B(i.value,n,r)});return;case`Except`:B(t.function,n,r),t.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),B(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:i([t.function,...t.args]);return;case`FieldAccess`:B(t.record,n,r);return;case`Product`:i(t.factors);return;case`BoxAction`:case`AngleAction`:i([t.action,t.subscript]);return;case`WeakFairness`:case`StrongFairness`:i([t.subscript,t.action]);return;case`Label`:if(oc(t,r))return;B(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),sc(t,n,r);return;case`Subexpression`:if(yc(t,n,r))return;t.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>vc(e,n,r)),cc(t,n,r,!1)}},bc=(t,n,r)=>t.forEach(t=>{if(t.kind===`ModuleFact`||gc(t,n,r)||cc(t,n,r,!0))return;let i=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;t.kind===`Identifier`&&Os(n,i)?.isNonFact?r.errors.push({location:e.X(Hs(t,i)),message:`Step number of non-fact used as a fact`}):r.facts.has(i)||B(t,n,r)}),xc=(e,t,n)=>(e.set&&B(e.set,t,n),Ms(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Sc=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:xc(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Sc(t,e.scope,e.unit,!0):B(t,e.scope,e.unit),e),{scope:t,unit:n});return B(e.conclusion,i.scope,i.unit),i.scope},Cc=(e,t,n)=>e.kind===`AssumeProve`?Sc(e,t,n):(B(e,t,n),t),wc=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&bc(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Ec(t,e,r),t)},Tc=(e,t,n)=>{let r=Mc(e,t,n);return e.name===void 0?r:Ms(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Ec=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=Cc(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return wc(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return wc(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return bc(r.facts,t,n),o(t);case`Instance`:return o(Tc(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?Tc(t,e,i):mc([t],e,n),t));case`Have`:case`Case`:return B(r.expression,t,i),wc(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>B(e,t,i)),a(t);case`Take`:return a(Ps(uc(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Ps(uc(r.bounds,t,i),r.names,r.nameRanges,i);return B(r.body,o,{...i,labelParams:[...i.labelParams,...Ls(r.bounds),...r.names]}),wc(e.proof,a(t),n),a(o)}default:return wc(e.proof,a(t),n),a(t)}},Dc=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Cc(e.statement,void 0,t);e.name!==void 0&&Ns(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),wc(e.proof,n,t),r&&(r.isInProof=!1)},Oc={line:0,column:0},kc=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Ac=(e,t)=>{let n=new Map([...Cs,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},jc=(t,n,r,i,a)=>{let o=t.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(n,r)=>{if(n.arity===0||r.kind!==`Identifier`){B(r,o,a);return}let i=lc(r,r.name,o,a);if(i!==void 0&&i!==n.arity)throw new e.F(`An operator must be substituted for symbol '${n.name}', and it must have arity ${n.arity} in the instance of ${t.module} at line ${t.location.line}, column ${t.location.column}`)},c=/* @__PURE__ */ new Map;t.substitutions.forEach(t=>{let r=t.name,i=n.find(e=>e.name===r);if(!i){a.errors.push({location:e.X(t.nameRange),message:`Identifier '${r}' 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 o=t.expression;s(i,o);let l=o.location.range;c.has(r)?l&&a.errors.push({location:e.X(l),message:`Multiple substitutions for symbol '${r}' in substitution.`}):c.set(r,o)});let l=n.filter(e=>!c.has(e.name)),u=e=>!Os(o,e.name)&&!zs(e.name,a);return l.filter(e=>!u(e)).forEach(e=>{let n={kind:`Identifier`,name:e.name,location:t.location};s(e,n),c.set(e.name,n)}),l.filter(u).forEach(n=>{let i=t.location.range,o=n.location.range;i&&o&&a.errors.push({location:e.X(i),message:`Substitution missing for symbol ${n.name} declared at ${e.X(o)} \nand instantiated in module ${r}.`})}),c},Mc=(e,t,n)=>{let r=n.getInstance(e);return jc(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Ms(e,t,r,n),t)},Nc=(e,t,n,r)=>{let i=Ac(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),jc(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:Oc}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Pc=(t,n)=>{let r=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return t.toSorted((e,t)=>ws(e.location,t.location)?-1:+!!ws(t.location,e.location)).forEach(t=>{let a=[],o=[];try{t.check(a,o)}catch(t){if(!(t instanceof e.F)||!t.sany&&a.length===0)throw t;a.push(...t.sany?.errors??[])}a.forEach(e=>i(r,e)),o.forEach(e=>i(n,e))}),r},Fc=(t,n)=>{let r=Ac(t,n.imported),i=/* @__PURE__ */ new Set([...n.facts,...[...t.theorems,...t.assumptions].flatMap(e=>e.name??[])]),a=new Map(t.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),o=new Map([...Cs,...n.bound].map(([e,t])=>[e,{...t,position:Oc}])),s=/* @__PURE__ */ new Set,c=[],l=(e,t,s,c,l)=>({imported:r,getInstance:n.getInstance,definitions:n.definitions,getKey:n.getKey,location:e,self:t,facts:i,goals:a,bindings:o,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),u=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>Ns(e.name,{kind:t,arity:e.arity,range:e.location.range},l(e.location,void 0,n,r,!1))}));return Pc([...n.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...u(t.constants,`Constant`),...u(t.variables,`Variable`),...t.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=js(e.name,o.get(e.name),r,l(e.location,void 0,t,n,!1));i&&(o.set(e.name,r),s.add(r)),c.push({declaration:e,binding:i?r:void 0})}})),...t.definitions.map(e=>({location:e.location,check:(n,r)=>{let i=l(e.location,e,n,r,!0);kc(t,e)?B(e.body,void 0,i):pc(e,void 0,i,s)&&o.set(e.name,{kind:`Definition`,arity:Ts(e),range:e.location.range,position:e.location})}})),...t.instances.map(e=>({location:e.location,check:(t,r)=>{let i=l(e.location,void 0,t,r,!1);Fs(void 0,e.params,i),n.instanced.get(e)?.forEach((e,t)=>Ns(t,e,i)),e.name!==void 0&&Ns(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...t.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=l(e.location,void 0,t,n,e.name!==void 0);B(e.expression,void 0,r),e.name!==void 0&&Ns(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...t.theorems.map(e=>({location:e.location,check:(t,n)=>Dc(e,l(e.location,void 0,t,n,e.name!==void 0))})),...t.uses.map(e=>({location:e.location,check:(t,n)=>bc(e.facts,void 0,l(e.location,void 0,t,n,!1))})),{location:t.location.range?.end??t.location,check:t=>c.forEach(n=>{let r=n.declaration.location.range;r&&(!n.binding||n.binding.isPending)&&t.push({location:e.X(r),message:`Symbol ${n.declaration.name} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},Ic=/* @__PURE__ */ new WeakSet,Lc=/* @__PURE__ */ new WeakMap,Rc=(e,t)=>{if(t.length===0)return e;let n={...e};return Ic.has(e)&&Ic.add(n),Lc.set(n,[...t,...Lc.get(e)??[]]),n},zc=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Gc(e,(e,r)=>zc(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&O(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&O(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Bc=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Vc=/* @__PURE__ */ new WeakMap,Hc=e=>Vc.get(e)??e.name,Uc=(e,t)=>(Hc(t)!==e.name&&Vc.set(e,Hc(t)),e),Wc=(e,t)=>Uc(e.kind===`Function`?{...e,bounds:Bc(e.bounds,e=>t(e,[])),body:t(e.body,Ls(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Gc=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>Wc(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Bc(e.bounds,n),body:t(e.body,Ls(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,Is(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,Is(e.bound.pattern))};case`SetMap`:return{...e,bounds:Bc(e.bounds,n),expression:t(e.expression,Ls(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Kc=`LAMBDA`,qc=e=>`${e}@SUBSTITUTION`,Jc=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(Jc),Yc=(e,t)=>{if(e.kind!==`Identifier`)return!Jc(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=O(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!Jc(n.body)},Xc=(e,t=/* @__PURE__ */ new Set)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0,r=n===void 0||t.has(n)?[]:[n];return Gc(e,(e,n)=>(r.push(...Xc(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Zc=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},Qc=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),$c=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},el=(e,t)=>e.map(e=>({pattern:$c(e.pattern,t),set:e.set})),tl=(e,t)=>e.kind===`Function`?{...e,bounds:el(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},nl=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>Uc({...tl(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:el(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:$c(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:$c(e.bound.pattern,n),set:e.bound.set}};default:return e}},rl=e=>`${e}@ENABLED`,il=(e,t)=>e.modes.get(t)??e,al=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!O(e)&&t.instantiation.variables.has(e.name),ol=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>ol(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(al(e,t,n))return[e.name];let r=O(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?ol(r.body,t,/* @__PURE__ */ new Map):void 0},sl=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return al(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:rl(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:fl(e.expression,il(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[fl(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:fl(e.subscript,il(t,`Primed`),n),location:r},fl(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=ol(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:rl(r),location:e.location},location:e.location},fl({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},cl=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:vs}),ll=(e,t)=>e.map(e=>cl(e.name,t)),ul=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...ll(t,r),...i.map(e=>cl(e,r))],location:r},location:r}},dl=(e,t)=>e.instantiation.isParameterized(t)?ml(e,t):void 0,fl=(t,n,r)=>{let i=e=>fl(e,n,r),a=n.instantiation,o=a.params,s=e=>!r.has(e)&&!O(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:fl(t.expression,il(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:fl(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},il(n,`Enabled`),r)};let c=sl(t,n,r);if(c)return c;if(t.kind===`Identifier`&&s(t.name)){let e=a.substitutions.get(t.name),r=n.bindings;if(e&&(r===void 0||!Yc(e,a)))return Rc(e,[t]);if(e&&r){let n=qc(t.name);return r.set(n,e),cl(n,t.location)}let i=dl(n,t.name);if(i===void 0)return t;if(o.length===0)return{...t,name:i};let s=a.getDefinition(t.name);return s&&Ts(s)>0?ul(i,o,Ts(s),t.location):{kind:`Apply`,operator:i,args:ll(o,t.location),location:t.location}}if(t.kind===`Apply`&&s(t.operator)){let r=t.args.map(i),s=a.substitutions.get(t.operator),c=a.substitutions.size>0||o.length>0||Ic.has(t),l=e=>(c&&Ic.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let e=s.kind===`Identifier`?s.name:s.operator;return l({...t,operator:e,args:r,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...t,operator:s.operator,args:[...s.args,...r],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Kc,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:Kc,args:r,resolution:vs},location:t.location};if(s)throw new e.F(`The operator ${t.operator} can only be substituted by an operator at line ${t.location.line}, column ${t.location.column}`);let u=dl(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[...ll(o,t.location),...r]}}if(t.kind===`OperatorReference`&&s(t.operator)){let e=dl(n,t.operator);if(e===void 0)return t;let r=a.getDefinition(t.operator);return o.length>0&&r?ul(e,o,Ts(r),t.location):{...t,operator:e}}let l=Zc(n),u=Gc(t,(e,t)=>t.length===0?i(e):fl(e,n,Qc(r,t,l)));return nl(u,r,l)},pl=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:cl(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},ml=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=Zc(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=tl(Wc(i,(e,t)=>fl(e,s,Qc(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(([e,t])=>({kind:`Operator`,name:e,params:[],body:t,isLocal:!0,isRecursive:!1,location:t.location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&Lc.set(l,[u,...Lc.get(i.body)??[]]),pl({...c,body:l},r.params,i.location)}):t},hl=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Xc(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>dl(i,e)??e,getQualifiedKey:t=>{let n=dl(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>pl(r,e.params,r.location)):t}}},gl=e=>e.kind===`Let`&&e.instances!==void 0||Be(e).some(gl),_l=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Gc(e,e=>_l(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>ws(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},vl=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,yl=(e,t)=>e.definitions.some(e=>gl(e.body))||e.assumptions.some(e=>gl(e.expression))||e.theorems.some(e=>{let t=vl(e);return t!==void 0&&gl(t)})?{...e,definitions:e.definitions.map(e=>Wc(e,e=>_l(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:_l(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=vl(e);return n===void 0?e:{...e,statement:_l(n,t,[])}})}:e,bl=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),xl={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},Sl=(e,t)=>{let n=xl[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Cl=(e,t)=>`${e}${t}`,wl=(e,t,n)=>`${e}${t}${n}`,Tl=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},El=(e,t,n)=>`${e},${t},${n}`,Dl=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Ol=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),kl=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Al=(e,t,n,r)=>({...Dl(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),jl=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Ml=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Nl=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{...Al(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Pl=Al(`$Set`,0,[2],[1]),Fl=Al(`$Junction`,0,[3],[1]),Il=Al(`$Choose`,0,[2],[1]),Ll=Al(`$Function`,0,[3],[1]),Rl=Al(`$FcnApply`,0,[2,2],[1,1]),zl=Al(`$RcdSelect`,0,[2,0],[1,1]),Bl=Al(`'`,2,[1],[0]),Vl=Al(`ENABLED`,1,[2],[0]),Hl=Al(`[]`,3,[3],[0]),Ul=Al(`$SquareAct`,2,[2,1],[0,0]),Wl=Al(`$WF`,3,[1,2],[0,0]),Gl=Al(`$TemporalExists`,3,[3],[0]),Kl=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),ql=e=>e.map(e=>({name:e,arity:0})),Jl=(t,n)=>n.location.range?e.J(`${t}.`,n.location.range):new e.F(`${t} at line ${n.location.line}, column ${n.location.column}`),Yl=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Xl=e=>e.kind!==`Let`&&e.kind!==`Label`,Zl=t=>{let n=/* @__PURE__ */ new Map,r=(e,n)=>{let r=n.get(e);if(r?.kind===`Formal`)return{kind:`Declared`,name:e,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:ee(r.definition,r.scope)};if(t.constants.has(e))return{kind:`Declared`,name:e,level:0,arity:0};if(t.variables.has(e))return{kind:`Declared`,name:e,level:1,arity:0};let i=t.getDefinition(e);if(i){let n=ee(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Nl.get(e)??bl.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},i=(e,t,n)=>{let r=Dl(Math.max(t,...n.map(e=>e.data.level)));return r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(wl(e,n,t))}),t.data.constraints.forEach((e,t)=>Ol(r.constraints,t,e)),kl(r.argConstraints,Cl(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>kl(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},a=(t,n,r=[],i=[])=>{let a=e=>i.includes(e);if(n.forEach((n,r)=>{if(!(n.operator||n.declared)&&n.data.level>jl(t,r))throw new e.F(`Level error in applying operator ${t.name}:\nThe level of argument ${r+1} exceeds the maximum level allowed by the operator`)}),r.some(e=>e.level>2))throw new e.F(`Level error in applying operator ${t.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let o=e=>{let r=t.formals.findIndex(t=>t.name===e);return r===-1?void 0:n[r]},s=(e,n,r)=>t.conditions.has(El(e,n,r)),c=Dl(Math.max(t.level,...n.filter((e,n)=>Ml(t,n)===1).map(e=>e.data.level),...r.map(e=>e.level)));return t.params.forEach(e=>c.params.add(e)),n.forEach((e,n)=>{Ml(t,n)===1&&e.data.params.forEach(e=>c.params.add(e))}),r.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),t.constraints.forEach((e,t)=>Ol(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||Ol(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>Ol(c.constraints,t,e))),n.forEach((e,n)=>e.data.params.forEach(e=>{a(e)||Ol(c.constraints,e,jl(t,n))})),n.forEach((e,t)=>{let r=e.operator;r&&n.forEach((e,n)=>r.formals.forEach((i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>Ol(c.constraints,e,jl(r,a)))}))}),t.argParams.forEach(e=>{let t=Tl(e),n=o(t.operator)?.operator;n&&Ol(c.constraints,t.param,jl(n,t.index))}),[t.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>kl(c.argConstraints,t,e))),n.forEach((e,r)=>{let i=e.declared;i&&(Array.from({length:i.arity},(e,n)=>kl(c.argConstraints,Cl(i.name,n),t.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&kl(c.argConstraints,Cl(i.name,a),e.data.level)})))}),t.argParams.forEach(e=>{let t=Tl(e),n=o(t.operator);n&&kl(c.argConstraints,Cl(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a(Tl(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),t.argParams.forEach(e=>{let t=Tl(e),n=o(t.operator);if(n)n.declared&&c.argParams.add(wl(n.declared.name,t.index,t.param));else{let n=o(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(wl(t.operator,t.index,e)))}}),n.forEach((e,t)=>{let r=e.declared;r&&n.forEach((e,n)=>Array.from({length:r.arity},(i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>c.argParams.add(wl(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,ql(e.params),e.body,t);return{data:n,operator:n}}let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let i=r(n,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=Dl();return e.params.add(n),{data:e,declared:{name:n,arity:i.arity}}}if(e.kind===`OperatorReference`)return{data:Dl()}}return{data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=Kl(n,ql(i));return a(e,s(t,o),r.map(e=>m(e,n)),i)},l=(e,t)=>e.kind===`Declared`?i(e.name,e.level,t):a(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw Jl(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw Jl(`Action used where only temporal formula or state predicate allowed`,e);Yl.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Xl(n)&&n.kind!==r)throw Jl(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=ee(e,n);t.constraints.forEach((e,t)=>Ol(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>kl(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(t,n)=>{try{return h(t,n)}catch(n){throw!(n instanceof e.F)||n.sany?n:Jl(n.message,t)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Dl();case`Identifier`:return l(r(e.name,t),[]);case`Apply`:{let n=s(e.args,t);return d(e,n),l(r(e.operator,t),n)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(Fl,n)}case`Prime`:case`Unchanged`:return c(Bl,[e.expression],t);case`Enabled`:return c(Vl,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(Hl,[n])}case`If`:return c(Fl,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(Fl,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=c(Fl,[e.body],t,e.bounds.map(e=>e.set),Ls(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Jl(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?Gl:Fl,[e.body],t,[],e.names);case`Choose`:return c(Il,[e.body],t,e.set?[e.set]:[],Is(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(Pl,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(Pl,[e.predicate],t,[e.bound.set],Is(e.bound.pattern));case`SetMap`:return c(Pl,[e.expression],t,e.bounds.map(e=>e.set),Ls(e.bounds));case`FunctionConstruction`:return c(Ll,[e.body],t,e.bounds.map(e=>e.set),Ls(e.bounds));case`Record`:return c(Ll,e.fields.map(e=>e.value),t);case`RecordSet`:return c(Pl,e.fields.map(e=>e.value),t);case`Except`:return c(Pl,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(Rl,[o(e.function,t),e.args.length===1?o(e.args[0],t):{data:c(Pl,e.args,t)}]);case`Bracket`:return Dl();case`FieldAccess`:return a(zl,[o(e.record,t),{data:Dl()}]);case`BoxAction`:case`AngleAction`:return c(Ul,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(Wl,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Dl()}},g=(e,t,n=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,r=n,a=t)=>g(e,a,r,i),o=(e,o)=>{let s=r(e,t);s.kind===`Declared`?(n&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,n||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return Be(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,Kl(t,ql(e.names))),i;default:return Gc(e,(e,r)=>(a(e,n,Kl(t,ql(r))),e)),i}},_=(e,t,n,r)=>{let i=Kl(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...Dl(a.level),name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get(Cl(e.name,n))??0)),conditions:new Set(t.flatMap((e,n)=>t.flatMap((t,r)=>Array.from({length:e.arity},(e,t)=>t).filter(n=>a.argParams.has(wl(e.name,n,t.name))).map(e=>El(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(Tl(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Tl(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},ee=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{...Dl(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,t);return n.set(e,o),o};return{analyze:m,analyzeDefinition:ee,toOperand:o}},Ql=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?Ql(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Dl(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Ol(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>kl(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},$l=(t,n,r,i)=>{let a=Zl(n),o=e=>Math.max(0,...e.map(e=>a.analyze(e,/* @__PURE__ */ new Map).level)),s=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?o([t.expression]):t.kind===`Witness`?o(t.expressions):t.kind===`Take`?o(t.bounds.map(e=>e.set)):t.kind===`Pick`?o([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?Ql(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},c=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=e.X(t.statement),r=()=>s(t)===0;return t.body.kind===`Have`||t.body.kind===`Take`||t.body.kind===`Witness`?r()?[]:[{location:n,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:t.body.kind===`Case`?[...r()?[]:[{location:n,message:`Non-constant CASE for temporal goal.`}],...c(t.proof)]:t.body.kind===`Qed`?c(t.proof):[]}):[],l=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=t.body,r=()=>s(t)===3,i=n.kind===`Pick`&&n.bounds.length>0&&r()?n.bounds.filter(e=>o([e.set])!==0).flatMap(t=>t.set.location.range?[{location:e.X(t.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(t.proof),...i,...t.proof?.kind===`Steps`&&r()?c(t.proof):[]]}):[],u=Pc([...t.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>a.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...t.assumptions.map(e=>({location:e.location,check:()=>a.analyze(e.expression,/* @__PURE__ */ new Map)})),...t.theorems.map(t=>({location:t.location,check:()=>{let n=t.statement.kind===`AssumeProve`?Ql(t.statement,/* @__PURE__ */ new Map,a):a.analyze(t.statement,/* @__PURE__ */ new Map),r=[...l(t.proof),...n.level===3?c(t.proof):[]];if(r.length>0)throw e.q(r)}})),...r],i);if(u.length>0)throw e.q(u,!1,void 0,i)},eu=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),tu=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),nu=/* @__PURE__ */ new Set([...eu,...tu,`Enabled`]),ru=/* @__PURE__ */ new Set([`~>`,`-+->`]),iu=/* @__PURE__ */ new Set([...ru,`\\cdot`]),au=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),ou=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),su=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},cu=(e,t)=>au.has(e)||t.builtins.get(e)?.isStateLevel===!0,lu=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(eu.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(tu.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&ru.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(nu.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&iu.has(e.operator))&&(r[0]|=1),nu.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=su(e);if(u!==void 0&&!O(e)){let e=t.substitutions.get(u)??u,n=t.definitions.get(e),a=t.constants.has(u),o=t.variableIndex.get(u);if((o!==void 0||t.builtins.get(u)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=1),o!==void 0&&(l&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:l});else{cu(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),ou.has(u)&&(r[0]|=8),!a&&cu(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}Be(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},uu=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],du=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},fu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),pu=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=lu(uu(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&14,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=du(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=du(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!fu(t[e],l[e*r])))),p=du(a,r,f,14);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|d[t]&224|p[t]&14:e),words:r}},mu=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?hu(uu(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},hu=(e,t)=>{let n=t.facts.words,r=lu(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=mu(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}fu(e.callee,r[0])||(i[0]|=r[0]&14)}),i},gu=(e,t)=>!(mu(e,t)[0]&1),_u={any:2,repeated:4,streamed:8},vu=(e,t,n=`any`)=>(mu(e,t)[0]&_u[n])!==0,yu=(e,t)=>{let n=mu(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},bu=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},xu=(e,t)=>{let n=hu([e],t);return n[0]&16?void 0:bu(n)},Su=(e,t)=>!!(hu([e],t)[0]&1),Cu=(t,n,r)=>new e.O(`Applying ${t} to the following value,\nwhich is not ${n}:\n${L(r)}`),wu=e=>jt(e)?I(e):void 0,Tu=`a function with a finite domain`,Eu=(e,t,n)=>{let r=R(e,t,n),i=wu(r);if(!i)throw Cu(n,Tu,r);return i},Du=(e,t)=>{let n=R(e,1,t),r=wu(n),i=r&&ju(r,R(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw wo(`second`,t,`bag`,n);return i},Ou=(e,t,n)=>{let r=t[n];if(!r||!Au(r))throw wo(n===0?`first`:`second`,`(+)`,`bag`,R(e,n,`(+)`));return r},ku=(e,t)=>{if(!j(e)||!N(e))throw t();return P(e).elements},Au=e=>e.range.every(e=>typeof e==`number`&&e>0),ju=(e,t)=>{let n=e.domain.findIndex(e=>mr(t,e));return n===-1?void 0:e.range[n]},Mu=t=>{if(typeof t==`number`)return t;let n=`tlc2.value.impl.${zo(t)}`;throw new e.b(`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},Nu=(e,t)=>{let n=Mu(e)+Mu(t);if(No(n))throw Po(`${e}+${t}`);return n},Pu=(e,t,n)=>{let r=Mu(e.range[t]),i=ju(n,e.domain[t]);if(i===void 0)return r;let a=r-Mu(i);if(No(a))throw Po(`${r}-${i}`);return a},Fu=(e,t,n,r=e.length)=>{let i=e.slice(0,r).find(e=>mr(t,e[0]));i?i[1]=Nu(i[1],n):e.push([t,n])},Iu=e=>e.domain.map((t,n)=>[t,e.range[n]]),Lu=Cn([],[]),Ru=t=>[ko(`EmptyBag`,Lu),z(`IsABag`,1,e=>{let t=wu(R(e,0,`IsABag`));return t!==void 0&&Au(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`);return Eu(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Cu(`BagCardinality`,`a bag`,t);return Nu(e,n)},0)}),z(`BagIn`,2,e=>{let t=Du(e,`BagIn`);return t!==void 0&&t>0}),z(`CopiesIn`,2,e=>Du(e,`CopiesIn`)??0),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>wu(R(e,t,`(+)`))),n=Ou(e,t,0),r=Ou(e,t,1),i=Iu(n);return r.domain.forEach((e,t)=>Fu(i,e,r.range[t],n.domain.length)),Cr(i)}),z(`\\ominus`,2,e=>{let t=R(e,0,`(-)`),n=R(e,1,`(-)`),r=wu(t),i=wu(n);if(!r)throw wo(`first`,`(-)`,`bag`,t);if(!i)throw wo(`second`,`(-)`,`bag`,n);return Cr(r.domain.flatMap((e,t)=>{let n=Pu(r,t,i);return n>0?[[e,n]]:[]}))}),z(`BagUnion`,1,t=>{let n=R(t,0,`BagUnion`),r=ku(n,()=>Cu(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??Lu;let i=t=>{let r=wu(t);if(!r)throw new e.O(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${L(n)}`);return r},a=Iu(i(r[0]));return r.slice(1).forEach(e=>{let t=i(e);t.domain.forEach((e,n)=>Fu(a,e,t.range[n]))}),Cr(a)}),z(`\\sqsubseteq`,2,e=>{let t=R(e,0,`\\sqsubseteq`),n=R(e,1,`\\sqsubseteq`),r=wu(t),i=wu(n);if(!r)throw Cu(`\\sqsubseteq`,Tu,t);if(!i)throw Cu(`\\sqsubseteq`,Tu,n);return r.domain.every((e,t)=>{let n=ju(i,e);return Mu(r.range[t])<=(n===void 0?0:Mu(n))})}),Ao(`BagOfAll`,2,e=>{let t=Oo(e,0,`BagOfAll`),n=R(e,1,`BagOfAll`),r=wu(n);if(!r)throw wo(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[];return r.domain.forEach((e,n)=>Fu(i,t.call([e]),r.range[n])),Cr(i)}),z(`SubBag`,1,n=>{let r=R(n,0,`SubBag`);if(!jt(r))throw new e.b(`Attempted to apply the operator DOMAIN to a non-function\n(${Bo(r)})\nline 106, col 58 to line 106, col 65 of module Bags`);let i=I(r),a=P(vr(i.range)).elements,o=a.find(e=>typeof e!=`number`);o!==void 0&&t.get(`>=`)?.evaluateBinary?.(a[0],o);let s=i.range.filter(e=>typeof e==`number`);if(s.some(e=>e<1))throw new e.b(`Attempted to apply a function to ${L(i)}, which is not in its domain`);return _r(i.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:s[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Cn(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>Pi(Eu(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=ku(t,()=>Cu(`BagToSet`,Tu,t));return Cn([...n],n.map(()=>1))})],zu={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},V={none:0,beginObject:1,endObject:2,beginArray:3,endArray:4,true:5,false:6,null:7,singleQuoted:8,doubleQuoted:9,unquoted:10,singleQuotedName:12,doubleQuotedName:13,unquotedName:14,number:16,eof:17},Bu={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},Vu=[{lower:`true`,upper:`TRUE`,token:V.true},{lower:`false`,upper:`FALSE`,token:V.false},{lower:`null`,upper:`NULL`,token:V.null}],Hu=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
|
|
79
|
+
`],[`r`,`\r`],[`f`,`\f`]]),Uu=1024,Wu=t=>{let n=+!!t.startsWith(``),r=n,i=0,a=n,o=!0,s=V.none,c=0,l=[zu.emptyDocument],u=[void 0],d=[0],f=()=>`$${l.map((e,t)=>e===zu.emptyArray||e===zu.nonemptyArray?`[${d[t]}]`:e===zu.emptyDocument||e===zu.nonemptyDocument?``:`.${u[t]??``}`).join(``)}`,p=()=>` at line ${i+1} column ${r-a+1} path ${f()}`,m=t=>new e.b(`com.google.gson.stream.MalformedJsonException: ${t}${p()}
|
|
80
|
+
See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`),h=()=>new e.b(`java.io.EOFException: End of input${p()}`),g=()=>{if(!o)throw m(`Use JsonReader.setStrictness(Strictness.LENIENT) to accept malformed JSON`)},_=e=>`/\\;#=`.includes(e)?(g(),!1):!`{}[]:, \f\r
|
|
81
|
+
`.includes(e),ee=()=>{for(;r<t.length;){let e=t[r++];if(e===`
|
|
82
|
+
`){i++,a=r;return}if(e===`\r`)return}},te=e=>{for(;r+e.length<=t.length;r++)if(t[r]===`
|
|
83
|
+
`)i++,a=r+1;else if(t.startsWith(e,r))return!0;return!1},v=()=>{for(;r<t.length;){let e=t[r++];if(e===`
|
|
84
|
+
`)i++,a=r;else if(e===`/`){if(r===t.length)return e;g();let n=t[r];if(n!==`*`&&n!==`/`)return e;if(r++,n===`/`)ee();else if(te(`*/`))r+=2;else throw m(`Unterminated comment`)}else if(e===`#`)g(),ee();else if(e!==` `&&e!==`\r`&&e!==` `)return e}},ne=()=>{let e=v();if(e===void 0)throw h();return e},y=()=>{let e=Vu.find(e=>t[r]===e.lower[0]||t[r]===e.upper[0]);if(!e)return V.none;let n=e.lower.length;for(let i=0;i<n;i++){let n=t[r+i];if(n!==e.lower[i]&&n!==e.upper[i])return V.none}return r+n<t.length&&_(t[r+n])?V.none:(r+=n,e.token)},re=()=>{let e=Bu.none,n=!1,i=0;for(;r+i<t.length;i++){if(i===Uu)return V.none;let a=t[r+i];if(a===`-`){if(e===Bu.none)e=Bu.sign;else if(e===Bu.exponentE)e=Bu.exponentSign;else return V.none}else if(a===`+`){if(e!==Bu.exponentE)return V.none;e=Bu.exponentSign}else if(a===`e`||a===`E`){if(e!==Bu.digit&&e!==Bu.fractionDigit)return V.none;e=Bu.exponentE}else if(a===`.`){if(e!==Bu.digit)return V.none;e=Bu.decimal}else if(a<`0`||a>`9`){if(_(a))return V.none;break}else if(e===Bu.sign||e===Bu.none)n=a===`0`,e=Bu.digit;else if(e===Bu.digit){if(n)return V.none}else e===Bu.decimal?e=Bu.fractionDigit:(e===Bu.exponentE||e===Bu.exponentSign)&&(e=Bu.exponentDigit)}return i===Uu||e!==Bu.digit&&e!==Bu.fractionDigit&&e!==Bu.exponentDigit?V.none:(c=i,V.number)},b=()=>{let e=l.length-1,n=l[e];if(n===zu.emptyArray)l[e]=zu.nonemptyArray;else if(n===zu.nonemptyArray){let e=ne();if(e===`]`)return V.endArray;if(e===`;`)g();else if(e!==`,`)throw m(`Unterminated array`)}else if(n===zu.emptyObject||n===zu.nonemptyObject){if(l[e]=zu.danglingName,n===zu.nonemptyObject){let e=ne();if(e===`}`)return V.endObject;if(e===`;`)g();else if(e!==`,`)throw m(`Unterminated object`)}let t=ne();if(t===`"`)return V.doubleQuotedName;if(t===`'`)return g(),V.singleQuotedName;if(t===`}`){if(n!==zu.nonemptyObject)return V.endObject;throw m(`Expected name`)}if(g(),r--,_(t))return V.unquotedName;throw m(`Expected name`)}else if(n===zu.danglingName){l[e]=zu.nonemptyObject;let n=ne();if(n===`=`)g(),t[r]===`>`&&r++;else if(n!==`:`)throw m(`Expected ':'`)}else if(n===zu.emptyDocument){if(v()===void 0)return V.eof;r--,t.startsWith(`)]}'
|
|
85
|
+
`,r)&&(r+=5),l[e]=zu.nonemptyDocument}else if(n===zu.nonemptyDocument){if(v()===void 0)return V.eof;g(),r--}let i=v();if(i===void 0){if(n===zu.emptyDocument)return V.eof;throw h()}if(i===`]`&&n===zu.emptyArray)return V.endArray;if(i===`]`||i===`;`||i===`,`){if(n!==zu.emptyArray&&n!==zu.nonemptyArray)throw m(`Unexpected value`);return g(),r--,V.null}if(i===`'`)return g(),V.singleQuoted;if(i===`"`)return V.doubleQuoted;if(i===`[`)return V.beginArray;if(i===`{`)return V.beginObject;r--;let a=y();if(a!==V.none)return a;let o=re();if(o!==V.none)return o;if(!_(t[r]))throw m(`Expected value`);return g(),V.unquoted},ie=()=>(s===V.none&&(s=b()),s),ae=()=>{if(r===t.length)throw m(`Unterminated escape sequence`);let e=t[r++];if(e===`u`){if(r+4>t.length)throw m(`Unterminated escape sequence`);let e=t.slice(r,r+4);if(!/^[\da-fA-F]{4}$/.test(e))throw m(`Malformed Unicode escape \\u${e}`);return r+=4,String.fromCharCode(Number.parseInt(e,16))}let n=Hu.get(e);if(n!==void 0)return n;if(e===`
|
|
86
|
+
`)return i++,a=r,e;if(`'"\\/`.includes(e))return e;throw m(`Invalid escape sequence`)},oe=e=>{let n=``,o=r;for(;r<t.length;){let s=t[r++];if(s===e)return n+t.slice(o,r-1);s===`\\`?(n+=t.slice(o,r-1)+ae(),o=r):s===`
|
|
87
|
+
`&&(i++,a=r)}throw m(`Unterminated string`)},se=()=>{let e=r;for(;r<t.length&&_(t[r]);)r++;return t.slice(e,r)},ce=t=>{if(l.length-1>=255)throw new e.b(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${p()}`);l.push(t),u.push(void 0),d.push(0),s=V.none},x=()=>{l.pop(),u.pop(),d.pop(),d[l.length-1]++,s=V.none},le=()=>{let e=ie();return e!==V.endObject&&e!==V.endArray&&e!==V.eof},S=()=>{let e=ie(),t=e===V.unquotedName?se():oe(e===V.singleQuotedName?`'`:`"`);return s=V.none,u[l.length-1]=t,t},ue=e=>e===V.true||e===V.false?e===V.true:e===V.null?null:e===V.number?(r+=c,{literal:t.slice(r-c,r)}):e===V.unquoted?se():oe(e===V.singleQuoted?`'`:`"`),de=()=>{let e=ie();if(e===V.beginArray){ce(zu.emptyArray);let e=[];for(;le();)e.push(de());return x(),e}if(e===V.beginObject){ce(zu.emptyObject);let e=/* @__PURE__ */ new Map;for(;le();)e.set(S(),de());return x(),e}let t=ue(e);return s=V.none,d[l.length-1]++,t};if(ie()===V.eof)return null;let fe=de();return o=!1,fe!==null&&ie(),fe},Gu=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),Ku=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),qu=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),Ju=e=>{if(!jt(e))return;let t=I(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?Fr(n):void 0},Yu=(t,n)=>{let r=`tlc2.value.impl.${zo(t)}`,i=`tlc2.value.impl.${n}`;return new e.b(`class ${r} cannot be cast to class ${i} (${r} and ${i} are in unnamed module of loader 'app')`)},Xu=t=>new e.b(`Cannot convert value: unsupported value type tlc2.value.impl.${zo(t)}`),Zu=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Qu=e=>`[${e.map(nd).join(`,`)}]`,$u=e=>`{${zt(e).map(e=>`${Zu(typeof e[0]==`string`?e[0]:L(e[0]))}:${nd(e[1])}`).join(`,`)}}`,ed=e=>{let t=I(e),n=ui(t);return n?Qu(n):$u(t)},td=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,nd=e=>typeof e==`string`?Zu(e):typeof e==`object`?e.kind===`ModelValue`?Zu(e.name):zo(e)===`RecordValue`?$u(I(e)):rd(e):String(e),rd=e=>{let t=zo(e);if(t===`TupleValue`)return Qu(I(e).range);if(td(t))return ed(e);if(Lr(e))return Qu(P(e).elements);throw Xu(e)},id=e=>{let t=zo(e);if(t===`RecordValue`)return $u(I(e));if(t===`TupleValue`)return`{${I(e).range.map((e,t)=>`"${t}":${nd(e)}`).join(`,`)}}`;if(td(t))return ed(e);throw Xu(e)},ad=t=>{if(t===null)throw new e.b(`Cannot convert value: unsupported JSON value null`);if(typeof t==`boolean`)return t;if(typeof t==`string`)return on(t);if(Array.isArray(t))return Pr(t.map(ad));if(t instanceof Map)return Fr([...t].map(e=>[on(e[0]),ad(e[1])]));let n=Number(t.literal);if(!/^-?\d+$/.test(t.literal)||No(n))throw new e.b(`Cannot convert value: expected a 32-bit integer JSON number, but found ${t.literal}`);return n||0},od=t=>{if(typeof t!=`string`)throw new e.b(`Cannot cast tlc2.value.impl.${zo(t)} to tlc2.value.impl.StringValue`);return t},sd=(e,t)=>{let n=Mi(e,t);if(typeof n!=`string`)throw Yu(n,`StringValue`);return n},cd=t=>{if(!Ku.has(t.toLowerCase()))throw qu.has(t.toLowerCase())?new e.B(`IOUtils!Serialize does not support the charset ${t}`):new e.b(/^[a-zA-Z\d][\w.:+-]*$/.test(t)?`java.nio.charset.UnsupportedCharsetException: ${t}`:`java.nio.charset.IllegalCharsetNameException: ${t}`)},ld=(t,n,r,i)=>{let a=r.find(e=>!Gu.has(e));if(a!==void 0)throw new e.b(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${a}`);if(r.includes(`READ`))throw new e.b(`java.lang.IllegalArgumentException: READ not allowed`);let o=new Set(r.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:r);if(o.has(`APPEND`)&&o.has(`TRUNCATE_EXISTING`))throw new e.b(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(o.has(`DELETE_ON_CLOSE`))throw new e.B(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let s=t.readFile?.(n);if(s===void 0&&!o.has(`CREATE`)&&!o.has(`CREATE_NEW`))throw new e.b(`java.nio.file.NoSuchFileException: ${n}`);if(s!==void 0&&o.has(`CREATE_NEW`))throw new e.b(`java.nio.file.FileAlreadyExistsException: ${n}`);s===void 0||o.has(`TRUNCATE_EXISTING`)?t.writeFile?.(n,i):t.writeFile?.(n,o.has(`APPEND`)?s+i:i+s.slice(i.length))},ud=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},dd=(t,n)=>{let r=t.readFile?.(n);if(r===void 0)throw new e.b(`${n} (No such file or directory)`);return r},fd=e=>[Uo(jo(`ToJson`,1,e=>on(nd(R(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),Uo(jo(`ToJsonArray`,1,e=>on(rd(R(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),Uo(jo(`ToJsonObject`,1,e=>on(id(R(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),Uo(jo(`JsonSerialize`,2,t=>{let n=od(R(t,0,`JsonSerialize`)),r=R(t,1,`JsonSerialize`);if(!ui(r)&&!Ju(r))throw wo(`second`,`JsonSerialize`,`sequence or record`,r);return ud(e,n),e.writeFile?.(n,nd(r)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Uo(jo(`ndJsonSerialize`,2,t=>{let n=od(R(t,0,`ndJsonSerialize`)),r=R(t,1,`ndJsonSerialize`),i=ui(r);if(!i)throw wo(`second`,`ndJsonSerialize`,`sequence`,r);return ud(e,n),e.writeFile?.(n,i.map(e=>`${nd(e)}\n`).join(``)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Uo(jo(`JsonDeserialize`,1,t=>ad(Wu(dd(e,od(R(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),Uo(jo(`ndJsonDeserialize`,1,t=>Pr(dd(e,od(R(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>ad(Wu(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],pd=(e,t)=>[Uo(Yo(`Serialize`,3,(n,r)=>{let i=Xo(n,2,`Serialize`)(),a=Ju(i);if(!a)throw wo(`third`,`ndJsonSerialize`,`sequence`,i);if(sd(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Xo(n,0,`Serialize`)(),s=ui(o);if(!s)throw wo(`first`,`Serialize`,`sequence`,o);let c=Xo(n,1,`Serialize`)();if(typeof c!=`string`)throw wo(`second`,`ndJsonSerialize`,`sequence`,c);let l=Mi(a,`openOptions`);if(zo(l)!==`TupleValue`)throw Yu(l,`TupleValue`);let u=sd(a,`charset`),d=I(l).range.map(e=>{if(typeof e!=`string`)throw Yu(e,`StringValue`);return e});return cd(u),ld(e,c,d,s.map(e=>`${nd(e)}\n`).join(``)),!0}),`public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`)],md={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},hd=e=>{let n=[],r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=0,o=bn(),s=e=>n.push(e&255),c=e=>{s(e>>8),s(e)},l=e=>{c(e>>16),c(e)},u=e=>e>32767?l(-e):c(e),d=e=>{s(md.string),l(0),l(-1),l(e.length),e.split(``).forEach(e=>s(e.charCodeAt(0)))},f=e=>{s(md.handle),u(e)},p=e=>{if(typeof e==`boolean`){s(md.boolean),s(+!!e);return}if(typeof e==`number`){s(md.integer),l(e);return}if(typeof e==`string`){a++,d(e);return}if(e.kind===`ModelValue`){s(md.modelValue),c(o.indexOf(e));return}if(e.kind===`Interval`){s(md.interval),l(e.low),l(e.high);return}let t=r.get(e);if(t!==void 0){f(t);return}if(r.set(e,a++),j(e)){let t=P(e).elements;s(md.set),l(t.length),t.forEach(p);return}let n=I(e),m=En(e);m===`tuple`?(s(md.tuple),u(n.range.length),n.range.forEach(p)):m===`record`?(s(md.record),l(n.domain.length),n.domain.forEach((e,t)=>{let r=String(e),o=i.get(r);o===void 0?(i.set(r,a++),d(r)):f(o),p(n.range[t])})):(s(md.function),u(n.domain.length),s(1),n.domain.forEach((e,t)=>{p(e),p(n.range[t])}))};return p(e),(0,t.gzipSync)(Uint8Array.from(n))},gd=e=>[Uo(jo(`_TLCTraceSerialize`,2,t=>{let n=od(R(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,hd(R(t,0,`_TLCTraceSerialize`))),!0}),`public static final tlc2.value.IValue tlc2.module._TLCTrace.ioSerialize(tlc2.value.IValue,tlc2.value.impl.StringValue) throws java.io.IOException`)],_d=25214903917n,vd=(1n<<48n)-1n,yd=2147483647,bd=e=>{let t=(BigInt.asUintN(64,e)^_d)&vd,n=e=>(t=t*_d+11n&vd,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^_d)&vd},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=yd)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},xd=[],Sd=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Cd=()=>{for(let e=1277011;xd.length<1341;e++)Sd(e)&&xd.push(e);return xd},wd=e=>{let t=Cd(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},Td=e=>{let t=[],n=e;for(let e=2;e*e<=n;e++)for(;n%e===0;)t.push(e),n/=e;return n>1&&t.push(n),t},Ed=e=>{for(let t=Math.max(e,9);;t++){let e=Td(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},Dd=(e,t,n)=>{if(t<=0)return[];let r=Ed(t),i=BigInt(n.nextInt(t)),a=BigInt(wd(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},Od=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:yd),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},kd=(1n<<63n)-1n-24n,Ad=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(kd*BigInt(n)+i)%t;return r<0n?r+t:r})},jd=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,Md=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Mr(e.domain),n=P(e.range).elements;return{lists:t.map(()=>n),create:e=>Cn(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>P(e).elements),create:t=>Fr(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>P(e).elements),create:Pr}}},Nd=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,Pd=(e,t,n,r)=>{if(F(t))return[];let i=r===`1.7.4`?Od:Dd;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=Nd(t,r)?void 0:Md(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(yd)?Ad(e,t,n):i(e,Number(t),n)).map(e=>a.create(jd(a.lists,e)))}let o=P(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},Fd=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[...To(t.domain,`RandomElement`,t).elements];return Cn(e,e.map(()=>Fd(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return Fr(t.names.map((e,r)=>[e,Fd(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return Pr(t.factors.map(e=>Fd(e,n)));if(typeof t==`object`&&t.kind===`Interval`){let r=Math.max(0,t.high-t.low+1),i=Math.floor(n.nextDouble()*r);if(i>=r)throw new e.b(`Attempted to retrieve out-of-bounds element from the interval value ${L(t)}.`);return t.low+i}let r=To(t,`RandomElement`).elements,i=Math.floor(n.nextDouble()*r.length);if(i>=r.length)throw new e.b(`Index ${i} out of bounds for length ${r.length}`);return r[i]},Id=(e,t,n)=>{if(typeof e!=`number`||e<0)throw wo(t,n,`nonnegative integer`,e);return e},Ld=(e,t,n,r)=>_r(Array.from({length:t},()=>_r(e.filter(()=>r.nextDouble()<n)))),Rd=(e,t)=>{let n=`RandomSetOfSubsets`,r=Id(R(e,0,n),`first`,n),i=Id(R(e,1,n),`second`,n),a=R(e,2,n);if(!j(a)||!N(a))throw wo(`third`,n,`finite set`,a);let o=P(a).elements;if(o.length<31&&r>2**o.length)throw wo(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw wo(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return Ld(o,r,o.length===0?0:i/o.length,t.getRandom())},zd=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,Bd=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,Vd=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(zd.test(t))return Number(t.replace(/[fFdD]$/,``));let n=Bd.exec(t);if(!n)return;let r=n[3]??``,i=`${n[2]}${r}`;if(i===``)return;let a=Number.parseInt(i,16)*2**(Number(n[4])-4*r.length);return n[1]===`-`?-a:a},Hd=e=>z(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=Id(R(t,0,n),`first`,n),i=R(t,1,n);if(typeof i!=`string`)throw wo(`second`,n,`string literal representing a probability`,i);let a=Vd(i);if(a===void 0||a<0||a>1)throw wo(`second`,n,`string literal does not represent a parsable probability`,i);let o=R(t,2,n);if(!j(o)||ln(o)||!si(o))throw wo(`third`,n,`finite set`,o);let s=ai(o);if(32-Math.clz32(r)>s&&r>1<<s)throw wo(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return Ld(P(o).elements,r,a,e.getRandom())}),Ud=t=>[Uo(z(`RandomSubset`,2,n=>{let r=Id(R(n,0,`RandomSubset`),`first`,`RandomSubset`),i=R(n,1,`RandomSubset`);if(!Lr(i)||!si(i))throw wo(`second`,`RandomSubset`,`a finite set`,i);let a=Nd(i,t.version);if(a&&a.reduce((e,t)=>e*P(t).elements.length,1)>Tt())throw new e.b(Et());return _r(Pd(r,i,t.getRandom(),t.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),z(`RandomSetOfSubsets`,3,e=>Rd(e,t)),z(`TestRandomSetOfSubsets`,3,e=>Pr(Array.from({length:5},()=>P(Rd(e,t)).elements.length)))],Wd=(e,t=0n)=>{let n=bd(t),r=bd(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Fr([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,getSuccessorAction:()=>void 0,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Ia,getSimulationValue:void 0,getRandom:()=>{let e=a?void 0:o.getCurrentState();return e===void 0?n:(e!==i&&(r.setSeed(o.getFingerprint(e)^BigInt.asUintN(64,t)),i=e),r)},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return o},Gd=e=>Cr([...e.possibleCounts].map(([e,t])=>[e,t])),Kd=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Gd(e)]]),qd=e=>Fr([[`name`,e??`UnnamedAction`],[`location`,Fr([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),Jd=/* @__PURE__ */ new WeakSet,Yd=(e,t)=>{let n=Fr([[`action`,_r(e)],[`state`,_r(t)]]);return Jd.add(n),n},Xd=(e,t,n)=>{let r=e.map((e,t)=>Pr([t+1,Fr(Object.entries(e))])),i=r.slice(1).map((e,n)=>Pr([r[n],t[n],e])),a=n?[Pr([r[r.length-1],n.action,r[n.start]])]:[];return Yd([...i,...a],r)},Zd=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Kd(e).get(t)},Qd=(t,n,r,i)=>{if(typeof r==`number`&&r>=0)t.registers.set(r,i);else if(r===`exit`)i===!0&&(t.isStopped=!0);else if(r===`pause`){if(i!==!0||!t.pause)return;n(`Press enter to resume model checking.`),t.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))t.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))t.properties.set(r.slice(2),L(i));else throw new e.O(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${L(r)}`)},$d=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:H(e),ef=e=>e.every(e=>e!==void 0),tf=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!O(e);if(i&&t.variableIndex.has(r))return 1;let a=Be(e).map(e=>tf(e,t,n)),o=i?Oh(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(tf(o.body,t,n))),Math.max(0,...a)},nf=(t,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[Yo(`AssertError`,2,t=>{let r=Oo(t,0,`AssertError`).expression;if(r&&r.kind!==`String`)throw new e.b(`In computing AssertError, a non-string expression (${$d(r)}) was used as the err of an AssertError(err, exp).`);let i=Xo(t,0,`AssertError`)();try{Xo(t,1,`AssertError`)()}catch(t){if(t instanceof e.b)return at(t.message,n.isTool)===i;throw t}return!1}),jo(`TLCGetOrDefault`,2,e=>Zd(n,R(e,0,`TLCGetOrDefault`))??R(e,1,`TLCGetOrDefault`)),jo(`Trace`,0,(t,r)=>{let i=r?.environment.variables??[],a=r?.state??i.map(()=>void 0);if(!r||!ef(a)){let t=i.filter((e,t)=>a[t]===void 0);throw new e.b(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${t.length>1?`s`:``} ${t.join(`, `)} undefined).`)}return r.state?Pr(n.getBehavior(a).map(e=>{let t=r.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return Fr(i===void 0?t:[[`_action`,i],...t])})):Pr([Fr([])])}),jo(`CounterExample`,0,()=>n.counterExample??Yd([],[])),z(`ToTrace`,1,t=>{let n=R(t,0,`ToTrace`);if(typeof n!=`object`||!Jd.has(n))throw new e.O(`The argument of ToTrace should be a CounterExample, but instead it is:\n${L(n)}`);let r=P(Mi(n,`state`)).elements.map(e=>ui(e)??[]);return Pr(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,t=>{let n=R(t,0,`TLCModelValue`);if(typeof n!=`string`)throw new e.O(`The argument of ModelValue should be a string, but instead it is:\n${L(n)}`);return yn(n)}),Yo(`TLCDefer`,1,(e,t)=>{let r=Oo(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{W(r,{...t,next:e})}),!0}),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),{...Yo(`PickSuccessor`,1,(r,i)=>{let a=i?.next??(i?.environment.variables??[]).map(()=>void 0);if(!ef(a)||i?.next&&n.isSeen(a))return!0;let o=Oo(r,0,`PickSuccessor`),s=o.call([]);if(typeof s!=`boolean`)throw new e.b(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${Bo(s)}) was used as the condition of an IF.\n${o.expression?$d(o.expression):``}`);if(s||!i?.next||!i.state||!ef(i.state))return!0;let c=n.getSuccessorAction(i.state,a);throw t(Je(n.isTool,Ge.moduleOverrideStdout,Ke.none,`Extend behavior of length ${n.getLevel(i.state)} with a "${c?.name}" step [<Action ${c?.location.range&&e.X(c.location.range)}>]? (Yes/no/explored/states/diff):`)),new e.v}),isActionLevel:!0},Yo(`TLCCache`,2,(e,t)=>{let i=Oo(e,0,`TLCCache`),o=$i(Xo(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=tf(s,t.environment,/* @__PURE__ */ new Set);if(c===2)return i.call([]);let l=c===1;if(l&&t.state&&n.getSimulationValue===void 0)return i.call([]),i.call([]);let u=l&&t.state?a(t.state):r,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=i.call([]);return d.set(o,p),p}),z(`TLCFP`,1,e=>{let t=R(e,0,`TLCFP`),n=Wi(t);if(n)throw n;return Number(BigInt.asIntN(32,Ia([t])))}),Yo(`TLCEvalDefinition`,1,(t,n)=>{let r=Xo(t,0,`TLCEvalDefinition`)();if(typeof r!=`string`)throw new e.O(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${L(r)}`);let i=n?Oh(r,n.environment):void 0,a=i?void 0:n?.environment.builtins.get(r);if(a?.arity===0)return a.evaluate([],n);if(!i||!n)throw new e.O(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${L(r)}`);if(i.kind===`Operator`&&i.params.length>0){let t=i.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new e.O(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${r}(${t.join(`, `)})`)}return i.kind===`Operator`?W(i.body,n):W({kind:`Identifier`,name:r,location:i.location},n)})]},rf=(e,t)=>[jo(`_Track`,2,e=>{let n=String(R(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,R(e,0,`_Track`)===!0?r+1:r),!0}),jo(`_Counts`,0,()=>Gd(t)),jo(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(Gd(t),!0)),!1)}),jo(`_PrintCounts`,0,()=>(e(L(Gd(t),!0)),!0))],af=e=>String(e).padStart(2,`0`),of=e=>`${e.getUTCFullYear()}.${af(e.getUTCMonth()+1)}.${af(e.getUTCDate())}.${af(e.getUTCHours())}${af(e.getUTCMinutes())}${af(e.getUTCSeconds())}`,sf=e=>Cr([...e].map(([e,t])=>[e,Pr([t])])),cf=e=>Tn(wr(e),`record`),lf=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),uf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),df=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),ff=(t,n,r)=>{if(t.version===`1.7.4`?!uf.has(n)||!t.isStarted&&df.has(n):!t.isStarted&&lf.has(n))throw new e.O(`TLCGet(${n}) was undefined.`);let i=t.getSimulationValue?.(n,r);if(i!==void 0)return i;let a=Math.floor((Date.now()-t.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:t.getLevel(r);case`diameter`:return t.diameter;case`generated`:return t.generatedStates;case`distinct`:return t.distinctStates;case`queue`:return t.queueSize;case`duration`:return a;case`stats`:return cf([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,a],[`worker`,0]]);case`config`:return cf([[`mode`,`bfs`],[`deadlock`,t.checkDeadlock],[`worker`,1],[`seed`,String(t.seed)],[`fingerprint`,String(BigInt.asIntN(64,va()))],[`install`,`unknown`]]);case`revision`:{let e=/* @__PURE__ */ new Date;return cf([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,on(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,on(of(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return qd(void 0);case`all`:return sf(t.registers);case`all:named`:return sf(Kd(t))}if(n.startsWith(`s:`)){let r=Kd(t).get(n);if(r===void 0)throw new e.O(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return on(t.properties.get(n.slice(2))??n);throw new e.O(`TLCGet(${n}) was undefined.`)},pf=(t,n,r)=>{if(typeof n==`number`&&n>=0){let r=t.registers.get(n);if(r===void 0)throw new e.O(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new e.O(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${L(n)}`);return ff(t,n,r?.state)},mf=e=>e.length===0?[[]]:e.flatMap((t,n)=>mf([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),hf=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&P(e).elements.forEach(hf),e.kind===`Function`&&e.range.forEach(hf))},gf=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`ModelValue`:case`Function`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return I(e);default:return P(e)}},_f=(t,n)=>[z(`Print`,2,e=>(t(ua([R(e,0,`Print`),R(e,1,`Print`)]).map(A).join(` `)),R(e,1,`Print`))),z(`PrintT`,1,e=>(t(A(ua([R(e,0,`PrintT`)])[0])),!0)),z(`Assert`,2,t=>{if(R(t,0,`Assert`)!==!0)throw new e.O(`The first argument of Assert evaluated to FALSE; the second argument was:\n${A(L(R(t,1,`Assert`)))}`,e.tt.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>Cr([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=R(e,0,`@@`),n=R(e,1,`@@`),r=jt(t)?I(t):void 0,i=jt(n)?I(n):void 0;if(!r)throw wo(`first`,`@@`,`function`,t);if(!i)throw wo(`second`,`@@`,`function`,n);let a=Rt(r),o=Rt(i).filter(e=>!a.some(t=>mr(e[0],t[0])));return wr([...a,...o])}),z(`ToString`,1,e=>on(L(R(e,0,`ToString`),!0))),{...Yo(`TLCEval`,1,(e,t)=>{let n=gf(Xo(e,0,`TLCEval`)());return t===void 0&&hf(n),n}),isStateLevel:!1},z(`Permutations`,1,e=>{let t=To(R(e,0,`Permutations`),`Permutations`).elements;return _r(mf(t).map(e=>Cr(t.map((t,n)=>[t,e[n]]))))}),Ao(`SortSeq`,2,e=>{let t=R(e,0,`SortSeq`),n=ui(t);if(!n)throw wo(`first`,`SortSeq`,`natural number`,t);let r=Oo(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw wo(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t=a.length;for(;t>0&&i(e,a[t-1]);)t--;a.splice(t,0,e)}),Pr(a)}),n.version===`1.7.4`?Uo({...jo(`TLCGet`,1,(e,t)=>pf(n,R(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Uo(Yo(`TLCGet`,1,(e,t)=>pf(n,Xo(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),jo(`TLCSet`,2,e=>(Qd(n,t,R(e,0,`TLCSet`),R(e,1,`TLCSet`)),!0)),ko(`Any`,pn),z(`RandomElement`,1,e=>Fd(R(e,0,`RandomElement`),n.getRandom()))],vf=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),yf=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],bf=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),xf=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs.beginLine.beginColumn.endLine.endColumn.module.name.location.context.parameters._action`.split(`.`),Sf=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),Cf=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
140
88
|
Nat == { }
|
|
141
89
|
a+b == {a, b}
|
|
142
90
|
a-b == CHOOSE n : b + n = a
|
|
@@ -452,9 +400,7 @@ _CheckName(name) ==
|
|
|
452
400
|
=> (PrintT(counts) /\\ FALSE)
|
|
453
401
|
_PrintCounts == PrintT(_Counts)
|
|
454
402
|
=============================================================================
|
|
455
|
-
`]]),cf=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])]]),lf=v(`EOF`),uf=v(`IDENTIFIER`),df=v(`DEFBREAK`),ff=(e,t)=>Array.from({length:v(t)-v(e)+1},(t,n)=>v(e)+n),pf=new Set(ff(`op_57`,`op_119`)),mf=new Set(ff(`op_1`,`op_119`)),hf=new Set(ff(`op_57`,`op_70`)),gf=/* @__PURE__ */ new Set([...ff(`ACTION`,`EXCEPT`),v(`EXTENDS`),...ff(`IF`,`SF`),v(`STATE`),...ff(`THEN`,`WITH`),v(`US`),...ff(`op_112`,`op_116`)]),U=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),_f=new Map([...U(`postfix`,160,160,!0,`[`),...U(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...U(`prefix`,120,120,!1,`-.`),...U(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...U(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...U(`prefix`,40,40,!0,`\\lnot`),...U(`nfix`,100,130,!0,`\\times`),...U(`infix`,140,140,!1,`^`,`^^`),...U(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...U(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...U(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...U(`infix`,100,110,!0,`|`,`||`,`%%`),...U(`infix`,100,110,!1,`%`),...U(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...U(`infix`,90,140,!1,`\\wr`),...U(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...U(`infix`,90,130,!1,`!!`),...U(`infix`,90,90,!1,`...`,`..`),...U(`infix`,80,80,!0,`\\intersect`,`\\union`),...U(`infix`,80,80,!1,`\\`),...U(`infix`,70,70,!1,`<:`,`:>`),...U(`infix`,60,60,!0,`@@`),...U(`infix`,50,140,!0,`\\cdot`),...U(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...U(`infix`,30,30,!0,`\\land`,`\\lor`),...U(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...U(`infix`,10,10,!1,`=>`)]),vf=new Map([..._f,...tf.flatMap(e=>e.slice(1).map(t=>[t,_f.get(e[0])]))]),yf=vf.get(`[`),bf={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},xf=e=>({type:`tokens`,kinds:new Set(e)}),Sf=e=>typeof e==`string`?e.startsWith(`<`)?xf([v(e.slice(1,-1))]):{type:`call`,name:e}:e,W=(...e)=>({type:`sequence`,units:e.map(Sf)}),G=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:W(e))}),Cf=e=>(...t)=>({type:e,body:W(...t)}),K=Cf(`zeroOrMore`),wf=Cf(`oneOrMore`),q=Cf(`optional`),J=e=>({type:`action`,run:t=>e(t)??void 0}),Y=e=>J(t=>{t.expecting=e}),X=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&W(...e.expansion),semantic:e.semantic}),Tf=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Ef=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=Tf(e,n);return n},Df=(...e)=>{let t=e.map(v);return e=>t.includes(Ef(e,1).kind)},Of=(e,t=Ef(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},kf=e=>{let t=Ef(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Af=e=>Df(`CASESEP`)(e)&&Of(e),jf=e=>{let t=Ef(e,1);gf.has(t.kind)&&(t.kind=uf)},Mf=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,Nf=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),Pf=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Ff=e=>e.operatorStacks[e.operatorStacks.length-1],If=(e,t)=>e.low>t.high,Lf=(e,t)=>e.high<t.low,Rf=e=>e.fix===`prefix`?e:vf.get(`${e.name}.`),zf=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===yf?Nf(`FcnAppl`,[n,...r.node.heirs]):Nf(`PostfixExpr`,[n,r.node]),operator:void 0})},Bf=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Nf(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:Nf(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Vf=e=>{let t=Ff(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return zf(t,n),Vf(e);if(i.operator!==void 0){let t=Rf(r.operator);return t!==void 0&&If(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Mf(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${Mf(e,a.node.first,a.node.last)} and expression at location ${Mf(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Lf(a.operator,r.operator)?void 0:If(a.operator,r.operator)?(Bf(t,a.operator),Vf(e)):`Precedence conflict between ops ${a.operator.name} in block ${Mf(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Rf(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Lf(s,r.operator))return;if(!If(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Mf(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Bf(t,s),Vf(e);let c=Mf(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===bf?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},Hf=e=>J(t=>{let n=Ff(t),r=Pf(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:Vf(t)}),Uf=Hf(()=>!1),Wf=Hf(()=>!0),Gf=J(e=>{e.lastOperator=vf.get(e.token.image)}),Kf=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},qf=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?Kf(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Jf=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Of(e,n.first.beginColumn))return n;let t=Jf(e,n);if(t!==void 0)return t}},Yf=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(v),n=(e,...t)=>t.some(t=>e.kind===v(t)),r=e=>e!==void 0&&pf.has(e.kind),i=e.token,a=Tf(e,i);i.next=void 0;let o=Tf(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===uf&&(e=e.next)}else if(e.kind===uf){let t=e.next;!r(t)||hf.has(t.kind)||mf.has(t.kind)&&t.next?.kind!==uf||(e=t.next?.kind===v(`SUBSTITUTE`)?i:mf.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==df&&(e.next={kind:df,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=Tf(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Xf=e=>{let t=Ef(e,1);if(t.kind===v(`LAB`)){let n=1;for(;n!==0;)if(t=Tf(e,t),t.kind===v(`LAB`)&&n++,t.kind===v(`RAB`)&&n--,t.kind===lf)return!1;return Tf(e,t).kind===v(`IN`)}if(t.kind!==uf)return!1;for(t=Tf(e,t);t.kind===v(`COMMA`);){if(t=Tf(e,t),t.kind!==uf)return!1;t=Tf(e,t)}return t.kind===v(`IN`)},Zf=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Qf=e=>e.proofLevels.at(-1)??-1,$f=e=>{let t=Ef(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:Df(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Qf(e)>=0&&Zf(t)>Qf(e):Df(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},ep=(e,t)=>{let n=Zf(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},tp=e=>J(t=>ep(t,t.token)?void 0:`${Mf(t,t.token)}: ${e}`),np=xf([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(v)),rp=xf([...np.kinds,v(`op_76`)]),ip=xf(mf),ap=xf(hf),op=xf([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(v)),sp=()=>K(X({expansion:[G(np,`<op_77>`)],semantic:Of}),G(`PrefixOp`,`InfixOp`),Wf),cp=()=>G(W(X({expansion:[`OpenStart`],semantic:Of}),`OpenExpression`,Uf),W(X({semantic:Of}),`ExtendableExpr`)),lp=()=>G(W(`<MODULE>`,Y(`identifier`),`Identifier`),`Expression`),up=()=>G(W(X({semantic:e=>Df(`ASSUME`,`BOXASSUME`)(e)||Ef(e,2).kind===v(`COLONCOLON`)&&[v(`ASSUME`),v(`BOXASSUME`)].includes(Ef(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),dp=()=>[`JuncItem`,K(X({semantic:kf}),`JuncItem`)],fp=e=>J(t=>{t.expecting=e,jf(t)}),pp=e=>J(t=>{t.isTerminalProof=e}),mp=(e,...t)=>W(...t.slice(0,-1),Y(`==`),`<DEF>`,J(t=>{Yf(t),t.expecting=e}),t[t.length-1]),Z=(e,t,n)=>({message:e,body:W(...t),exit:n}),hp={CompilationUnit:Z(void 0,[J(Yf),q(`Prelude`),`Module`]),Prelude:Z(void 0,[`<BEGIN_PRAGMA>`,K(G(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Z(`Module definition`,[Y(`---- MODULE`),`BeginModule`,Y(`EXTENDS clause or module body`),`Extends`,Y(`Module body`),`Body`,Y(`==== or more Module body`),`EndModule`]),BeginModule:Z(`Begin module`,[Y(`---- MODULE (beginning of module)`),G(`<_BM0>`,`<_BM1>`,`<_BM2>`),fp(`Identifier`),`Identifier`,J(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Z(void 0,[`<END_MODULE>`]),Extends:Z(`Extends`,[q(`<EXTENDS>`,fp(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,fp(`Identifier`),`Identifier`))]),Body:Z(`Module body`,[Y(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),K(G(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,W(X({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,W(X({amount:2}),`Instance`),W(X({amount:2}),`Assumption`),W(X({amount:2}),`Theorem`),W(X({amount:1}),`Module`,J(Yf)),W(X({semantic:e=>Df(`USE`)(e)&&Ef(e,2).kind!==v(`ONLY`)||Df(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Z(`variable declaration`,[`<VARIABLE>`,Y(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,Y(`Identifier`),`Identifier`)]),ParamDeclaration:Z(`Parameter declaration`,[Y(`CONSTANT`),`ParamSubDecl`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y(`,`),K(`<COMMA>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Z(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Z(`Recursive`,[Y(`RECURSIVE`),`<RECURSIVE>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y(`,`),K(`<COMMA>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y("`,' or `)'"))]),ConstantDeclarationItems:Z(`Constant declaration items`,[Y(`Identifier, _ or prefix op`),G(W(`Identifier`,Y(`(, comma, or Module Body`),q(X({amount:2}),`<LBR>`,Y(`_`),`<US>`,Y(`comma or )`),K(`<COMMA>`,Y(`_`),`<US>`,Y(`comma or )`)),`<RBR>`)),W(`NonExpPrefixOp`,Y(`_`),`<US>`),W(`<US>`,Y(`prefix or postfix operator`),G(W(`InfixOp`,Y(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Z(`Definition`,[Y(`LOCAL, Identifier or Operator Symbol`),q(`<LOCAL>`),`<DEFBREAK>`,Y(`LOCAL, Identifier or Operator Symbol`),G(mp(`Expression`,X({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,Y(`[`),`<LSB>`,Y(`Identifier`),`QuantBound`,Y(`COMMA or ]`),K(`<COMMA>`,Y(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),mp(`Expression`,X({expansion:[`<IDENTIFIER>`,ap]}),`PostfixLHS`,`Expression`),mp(`Expression`,X({expansion:[`<IDENTIFIER>`,ip]}),`InfixLHS`,`Expression`),mp(`Expression or Instance`,X({expansion:[`<IDENTIFIER>`,G(`<LBR>`,`<DEF>`)]}),`IdentLHS`,G(`Expression`,`Instantiation`)),mp(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Z(`Identifier tuple`,[`<LAB>`,Y(`Identifier or >>`),q(`Identifier`,Y(`COMMA or >>`),K(`<COMMA>`,Y(`COMMA or >>`),`Identifier`,Y(`COMMA or >>`))),`<RAB>`]),IdentLHS:Z(`Identifier LHS`,[`Identifier`,Y(`( or ==`),q(`<LBR>`,Y(`Identifier Declaration, prefix op, _ or )`),G(`IdentDecl`,`SomeFixDecl`),Y(`COMMA or )`),K(`<COMMA>`,Y(`Identifier Declaration, prefix op or _`),G(`IdentDecl`,`SomeFixDecl`),Y(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Z(`Prefix LHS`,[rp,Y(`Identifier`),`Identifier`]),InfixLHS:Z(`Infix LHS`,[`Identifier`,ip,`Identifier`]),PostfixLHS:Z(`Postfix LHS`,[`Identifier`,ap]),IdentDecl:Z(`Identifier Declation`,[`Identifier`,Y(`( or ...`),q(`<LBR>`,Y(`_`),`<US>`,Y(`COMMA or )`),K(`<COMMA>`,Y(`_`),`<US>`,Y(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Z(`Op. Symbol Declaration`,[G(W(`NonExpPrefixOp`,Y(`_`),`<US>`),W(`<US>`,Y(`infix or postfix operator`),G(W(`InfixOp`,Y(`_`),`<US>`),`PostfixOp`)))]),Instance:Z(`Instance`,[Y(`LOCAL or instance`),q(`<LOCAL>`),`Instantiation`,Y(`COMMA or Module Body`)]),Instantiation:Z(`NonLocalInstance`,[`<INSTANCE>`,fp(`Module identifier`),`Identifier`,Y(`WITH or another definition.`),q(`<WITH>`,Y(``),`Substitution`,Y(``),K(X({amount:3}),`<COMMA>`,Y(``),`Substitution`,Y(``)))]),Substitution:Z(`Substitution`,[G(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),Y(`<-`),`<SUBSTITUTE>`,Y(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Z(void 0,[np,Gf]),NonExpPrefixOp:Z(void 0,[rp,Gf]),InfixOp:Z(`Infix Op`,[ip,Gf]),PostfixOp:Z(void 0,[ap,Gf]),Identifier:Z(void 0,[`<IDENTIFIER>`]),Assumption:Z(`Assumption`,[Y(`ASSUM...`),G(`<ASSUMPTION>`,`<ASSUME>`),q(X({amount:2}),q(`<DEFBREAK>`),`Identifier`,Y(`==`),`<DEF>`),J(e=>{Yf(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Z(`Assume-Prove`,[G(W(`Identifier`,`<COLONCOLON>`,`AssumeProve`),W(G(`<ASSUME>`,`<BOXASSUME>`),Y(`Expression, Declaration, or AssumeProve`),up(),Y("PROVE or `,'"),K(`<COMMA>`,Y(`Expression, Declaration, or AssumeProve`),up(),Y("PROVE or `,'")),G(`<PROVE>`,`<BOXPROVE>`),Y(`Expression`),`Expression`))]),NewSymb:Z(`NEW symbol declaration`,[Y(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),G(W(X({amount:2}),G(W(X({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),Y(`Constant declaration`),G(W(X({amount:2}),`IdentDecl`,q(`<IN>`,J(e=>{let t=Pf(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Mf(e,t.first,t.last)}`:void 0}),Y(`Expression`),`Expression`)),`SomeFixDecl`)),W(X({amount:2}),q(`<NEW>`),`<VARIABLE>`,Y(`Identifier`),`Identifier`),W(X({amount:2}),q(`<NEW>`),G(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),Y(`Declaration`),G(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Z(`Domain binding`,[q(`<IN>`,Y(`Expression`),`Expression`)]),Theorem:Z(`Theorem`,[Y(`THEOREM, PROPOSITION`),G(`<THEOREM>`,`<PROPOSITION>`),Y(`Identifier, Assume-Prove or Expression`),q(X({amount:2}),`Identifier`,Y(`==`),`<DEF>`),J(Yf),G(W(X({amount:3}),X({semantic:Df(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),q(X({semantic:$f}),`Proof`)]),Proof:Z(`Proof`,[J(e=>{e.proofLevels.push(-1)}),G(W(X({semantic:e=>Df(`BY`)(e)||Ef(e,2).kind===v(`BY`)}),`UseOrHideOrBy`),W(X({amount:2}),q(`<PROOF>`),G(`<OBVIOUS>`,`<OMITTED>`)),W(q(X({amount:2}),`<PROOF>`),K(X({semantic:e=>Ef(e,2).kind!==v(`QED`)}),`Step`,Y(`a proof step`)),`QEDStep`)),J(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Z(`UseOrHideOrBy`,[G(W(q(`<PROOF>`),`<BY>`,pp(!0),q(`<ONLY>`)),W(`<USE>`,pp(!1),q(`<ONLY>`)),W(`<HIDE>`,pp(!1))),Y("an expression, `MODULE' or `DEF'"),q(lp(),K(`<COMMA>`,Y(`MODULE or expression`),lp(),J(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),q(`<DF>`,Y(`MODULE or expression`),lp(),K(`<COMMA>`,Y(`MODULE or expression`),lp(),J(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),J(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Z(`QED step`,[Y(`Step number`),op,tp(`QED step's number has bad level.`),Y(`QED`),`<QED>`,q(X({semantic:$f}),`Proof`)]),Step:Z(`Step`,[Y(`Step number`),op,tp(`step's number has bad level.`),Y(`proof step`),G(W(X({semantic:Df(`USE`,`HIDE`)}),`UseOrHideOrBy`),W(X({semantic:Df(`INSTANCE`)}),`Instantiation`),W(X({semantic:Df(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),q(X({semantic:$f}),J(e=>{let t=Pf(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Mf(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Z(`DefStep`,[q(`<DEFINE>`),wf(X({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Z(`HaveStep`,[`<HAVE>`,Y(`expression`),`Expression`]),TakeStep:Z(`TakeStep`,[`<TAKE>`,Y(`identifier`),G(W(X({expansion:[G(W(`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,Y(`comma or step`),K(`<COMMA>`,Y(`identifier or tuple of identifiers`),`QuantBound`,Y(`comma or proof step`))),W(`Identifier`,Y(`comma or proof step`),K(`<COMMA>`,Y(`identifier`),`Identifier`,Y(`comma or proof step`))))]),WitnessStep:Z(`WitnessStep`,[`<WITNESS>`,Y(`expression`),`Expression`,K(`<COMMA>`,Y(`expression`),`Expression`,Y(`comma or colon`))]),PickStep:Z(`PickStep`,[`<PICK>`,Y(`identifier`),G(W(X({expansion:[`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,Y(`comma, or colon`),K(`<COMMA>`,Y(`identifier`),`Identifier`,Y(`comma or colon`))),W(`QuantBound`,Y(`comma or colon`),K(`<COMMA>`,Y(`identifier or tuple of identifiers`),`QuantBound`,Y(`comma or colon`)))),`<COLON>`,Y(`expression`),`Expression`]),CaseStep:Z(`CaseStep`,[`<CASE>`,Y(`expression`),`Expression`]),AssertStep:Z(`AssertStep`,[q(`<SUFFICES>`,Y(`expression or ASSUME/PROVE`)),G(`Expression`,W(X({semantic:Df(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Z(void 0,[G(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Z(void 0,[G(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Z(`String`,[`<STRING_LITERAL>`]),Number:Z(void 0,[`<NUMBER_LITERAL>`,q(X({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Z(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,K(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Z(void 0,[G(W(X({amount:2,expansion:[G(rp,ip,ap),xf([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(v))],semantic:Of}),G(`NonExpPrefixOp`,W(`InfixOp`,J(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Mf(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),W(X({expansion:[`<LAMBDA>`],semantic:Of}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Z(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Z(`Quantified form`,[G(`<EXISTS>`,`<FORALL>`),G(W(X({expansion:[`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,K(`<COMMA>`,`Identifier`)),W(`QuantBound`,K(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Z(`Bound Quantified Expression`,[G(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,K(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Z(`Quant Bound`,[G(`IdentifierTuple`,W(`Identifier`,K(`<COMMA>`,`Identifier`,Y(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Z(`Some { } form`,[`<LBC>`,q(G(W(X({semantic:Xf}),G(`IdentifierTuple`,`Identifier`),Y(`\\in`),`<IN>`,`Expression`,Y(`':', ',' or '}'`),q(G(W(`<COLON>`,`Expression`),wf(`<COMMA>`,`Expression`)))),W(X({expansion:[G(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,K(`<COMMA>`,`Expression`)),W(X({expansion:[G(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,K(`<COMMA>`,`QuantBound`)),W(`Expression`,q(G(W(`<COLON>`,J(e=>{let t=Pf(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,K(`<COMMA>`,`QuantBound`)),wf(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Z(`Some [] Form`,[`<LSB>`,G(W(X({semantic:Xf}),`QuantBound`,K(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({semantic:e=>Ef(e,2).kind===v(`MAPTO`)&&gf.has(Ef(e,1).kind)}),J(e=>{Ef(e,1).kind=uf}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,K(`<COMMA>`,`FieldSet`),`<RSB>`),W(`Expression`,G(W(K(`<COMMA>`,`Expression`),`<RSB>`,J(e=>{let t=e.frames[e.frames.length-1];t.node=Nf(`FcnAppl`,t.heirs),e.lastOperator=yf})),W(`<ARROW>`,`Expression`,`<RSB>`),W(`<EXCEPT>`,`ExceptSpec`,K(`<COMMA>`,`ExceptSpec`),`<RSB>`),W(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Z(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Z(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Z(`Except Spec`,[`<BANG>`,wf(`ExceptComponent`,Y(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Z(`Except Component`,[G(W(`<DOT>`,J(jf),`Identifier`),W(`<LSB>`,`Expression`,K(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Z(`Some << -- >> or >>_ Form`,[`<LAB>`,q(`Expression`,K(`<COMMA>`,`Expression`)),G(`<RAB>`,W(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Z(void 0,[`Identifier`,q(X({amount:2}),`OpArgs`),G(W(`<BANG>`,`NoOpExtension`),J(e=>{e.isFairnessHooked=e.token.kind===v(`RBR`)}))]),ReducedExpression:Z(`restricted form of expression`,[G(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Z(`Fairness Expression`,[J(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),G(`<WF>`,`<SF>`),`ReducedExpression`,q(X({amount:2}),`<LBR>`,`Expression`,`<RBR>`,J(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Z(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Z(`CASE Expression`,[`<CASE>`,`CaseArm`,K(X({semantic:e=>Af(e)&&Ef(e,2).kind!==v(`OTHER`)}),`<CASESEP>`,`CaseArm`),q(X({semantic:Af}),`<CASESEP>`,`OtherArm`)]),CaseArm:Z(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Z(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Z(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Z(`Let Definitions`,[wf(G(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Z(`AND-OR Junction`,[J(e=>{let t=Ef(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),G(W(X({expansion:[`<OR>`]}),...dp()),W(X({expansion:[`<AND>`]}),...dp())),J(e=>{e.junctions.pop()})]),JuncItem:Z(`Junction Item`,[G(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Jf(t,e.heirs[1]);return n&&`Item at ${Mf(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Mf(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Z(`(Un)Bounded Choose`,[`<CHOOSE>`,G(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Z(`Lambda`,[`<LAMBDA>`,Y(`Identifier`),`Identifier`,Y("`,' or `:'"),K(`<COMMA>`,Y(`Identifier`),`Identifier`,Y("`,' or `:'")),`<COLON>`,Y(`Expression`),`Expression`]),Expression:Z(`Expression`,[J(e=>{e.operatorStacks.push([])}),sp(),cp()],(e,t)=>{let n=Ff(t);n.push({node:e.heirs[0],operator:bf});let r=Vf(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Z(`ExtendableExpr`,[G(W(X({expansion:[G(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),Uf,K(G(W(X({expansion:[`PostfixOp`],semantic:Of}),`PostfixOp`,Wf),W(X({expansion:[`<DOT>`],semantic:Of}),`<DOT>`,J(jf),X({semantic:Of}),`Identifier`,J(e=>{let t=Ff(e);t[t.length-1].operator!==void 0&&zf(t,t.length),t[t.length-1]={node:Nf(`RecordComponent`,[t[t.length-1].node,Pf(e,2),Pf(e,1)]),operator:void 0}})),W(X({expansion:[`<LSB>`],semantic:Of}),Y(`function argument`),`SBracketCases`,Hf(e=>e.kind===`FcnAppl`)))),q(G(W(X({expansion:[`InfixOp`],semantic:Of}),`InfixOp`,Wf,sp(),cp()),W(X({expansion:[`<COLONCOLON>`],semantic:Of}),`<COLONCOLON>`,J(e=>{let t=Ff(e);if(!qf(t[t.length-1].node))return`\`::' at ${Mf(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,J(e=>{let t=Ff(e),n=Pf(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Lf(r,e.lastOperator)){let t=Pf(e,3);return`Removing label at ${Mf(e,t.first,t.last)} would change expression parsing.`}t.push({node:Nf(`Label`,[Pf(e,3),Pf(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Z(`Primitive expression`,[G(W(X({expansion:[`String`],semantic:Of}),`String`),W(X({expansion:[`<NUMBER_LITERAL>`],semantic:Of}),`Number`),W(G(`Identifier`,W(G(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),J(e=>Qf(e)<0&&e.proofLevels.length<=1?`${Mf(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Mf(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,W(X({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),q(X({amount:2}),`OpArgs`),K(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:Kf(e.heirs)===void 0?e.heirs.length===1?Nf(`GeneralId`,e.heirs):void 0:Nf(`OpApplication`,e.heirs)}),BangExt:Z(`Bang Extension`,[`<BANG>`,G(W(G(W(X({expansion:[`Identifier`],semantic:e=>Ef(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),q(X({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Z(`StructOp`,[Y("`<<' , `>>' , `:' , `@' , or number"),G(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,W(X({semantic:e=>Ef(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Mf(t,n.first,n.last)}`:void 0}),OpenStart:Z(void 0,[G(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},gp=/* @__PURE__ */ new Map,_p=e=>{let t=gp.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=_p(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,_p(hp[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return gp.set(e,n),n},vp=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},yp=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=Tf(e,e.scanPosition)),e.scanPosition=Tf(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},bp=(e,t)=>{if(t.type===`tokens`)return yp(e,t.kinds);if(t.type===`call`)return bp(e,hp[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||vp(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=bp(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||vp(e,t.semantic)?bp(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=bp(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=bp(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},xp=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=bp(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},Sp=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||_p(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!_p(a).hasSemanticStart?_p(a).first.has(Ef(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):xp(e,i,a)&&(o===void 0||o(e))}),Cp=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,bp(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=Tf(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===lf){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=Tf(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${De(e.token.image)}" `},wp=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??Cp(e)}\n\nResidual stack trace follows:\n${r}`,!1},Tp=(e,t)=>{let n=Tf(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,wp(e))},Ep=(e,t)=>{let n=hp[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Ef(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!Dp(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return wp(e,i);let a=r.node??(r.heirs.length===0?void 0:Nf(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},Dp=(e,t)=>{if(t.type===`tokens`)return Tp(e,t.kinds);if(t.type===`call`)return Ep(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||wp(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||wp(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||Dp(e,t));if(t.type===`choice`){let n=Sp(e,t.alternatives);return n===-1?wp(e):Dp(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!Dp(e,t.body))return!1;if(t.type===`optional`)return Sp(e,[t.body])===-1||Dp(e,t.body);for(;Sp(e,[t.body])===0;)if(!Dp(e,t.body))return!1;return!0},Op=e=>{let t=Te(e),n={kind:lf,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=Dp(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},kp={low:15,high:15},Ap={low:16,high:16},Q=(e,t,n)=>({low:e,high:t,isAssociative:n}),jp=new Map([[`=>`,Q(1,1,!1)],[`<=>`,Q(2,2,!1)],[`~>`,Q(2,2,!1)],[`-+->`,Q(2,2,!1)],[`/\\`,Q(3,3,!0)],[`\\/`,Q(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,Q(5,5,!1)]),[`\\cdot`,Q(5,14,!0)],[`@@`,Q(6,6,!0)],[`:>`,Q(7,7,!1)],[`<:`,Q(7,7,!1)],[`\\cup`,Q(8,8,!0)],[`\\cap`,Q(8,8,!0)],[`\\`,Q(8,8,!1)],[`..`,Q(9,9,!1)],[`...`,Q(9,9,!1)],[`##`,Q(9,13,!0)],[`$`,Q(9,13,!0)],[`$$`,Q(9,13,!0)],[`??`,Q(9,13,!0)],[`!!`,Q(9,13,!1)],[`\\sqcap`,Q(9,13,!0)],[`\\sqcup`,Q(9,13,!0)],[`\\uplus`,Q(9,13,!0)],[`\\wr`,Q(9,14,!1)],[`+`,Q(10,10,!0)],[`++`,Q(10,10,!0)],[`(+)`,Q(10,10,!0)],[`\\oplus`,Q(10,10,!0)],[`%`,Q(10,11,!1)],[`%%`,Q(10,11,!0)],[`|`,Q(10,11,!0)],[`||`,Q(10,11,!0)],[`\\X`,Q(10,13,!1)],[`-`,Q(11,11,!0)],[`--`,Q(11,11,!0)],[`(-)`,Q(11,11,!0)],[`\\ominus`,Q(11,11,!0)],[`*`,Q(13,13,!0)],[`**`,Q(13,13,!0)],[`/`,Q(13,13,!1)],[`//`,Q(13,13,!1)],[`\\div`,Q(13,13,!1)],[`\\o`,Q(13,13,!0)],[`(.)`,Q(13,13,!0)],[`\\odot`,Q(13,13,!0)],[`(/)`,Q(13,13,!1)],[`\\oslash`,Q(13,13,!1)],[`(\\X)`,Q(13,13,!0)],[`\\otimes`,Q(13,13,!0)],[`&`,Q(13,13,!0)],[`&&`,Q(13,13,!0)],[`\\star`,Q(13,13,!0)],[`\\bullet`,Q(13,13,!0)],[`\\bigcirc`,Q(13,13,!0)],[`^`,Q(14,14,!1)],[`^^`,Q(14,14,!1)]]),Mp=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Np=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Pp=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),Fp=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),Ip=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),Lp=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...Mp]),Rp=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),zp=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Bp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Vp=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Hp=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Up=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Wp=/* @__PURE__ */ new Set([``,`*`,`-`]),Gp=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),Kp=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),qp=/* @__PURE__ */ new Set([`NEW`,...Kp.keys()]),Jp=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Yp=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Xp=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Zp=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?jp.has(e.operator):Mp.has(e.operator)),Qp=e=>jp.has(e)||Mp.has(e)||e===`-.`,$p=(e,t,n)=>{switch(e){case`ENABLED`:return{kind:`Enabled`,expression:t,location:n};case`UNCHANGED`:return{kind:`Unchanged`,expression:t,location:n};case`[]`:return{kind:`Always`,expression:t,location:n};case`<>`:return{kind:`Eventually`,expression:t,location:n};case`'`:return{kind:`Prime`,expression:t,location:n};default:return{kind:`Apply`,operator:e,args:[t],location:n}}},em=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
|
|
456
|
-
`)}\n`},tm=(t,n,r=se(t))=>{let i=n===`tlapm`,a=i?r:r.map(re),o={index:0,offsideColumns:[]},c={},l=[],u=/* @__PURE__ */ new Set,d=[],f=[],p=e=>l[l.length-1].has(e),m=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),ee=[],te=[],ne=[],h=(e,t=o.index-1)=>{let n=e===t?ne[e]:void 0;if(n)return n;let r=a[t];ee[e]??=m(a[e]),te[t]??={line:r.line,column:r.endColumn};let i={module:f[0].name,start:ee[e],end:te[t]};return e===t&&(ne[e]=i),i},g=(e,t)=>(e.location.range=h(t),e),ie=(e=0)=>a[Math.min(o.index+e,a.length-1)],_=(e=0)=>{let t=ie(e),n=o.offsideColumns[o.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ae=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),oe={index:0},ce=e=>{let t=a.slice(oe.index,o.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},le=e=>i&&(e.kind===`Keyword`||Xp.has(e.text)),ue=e=>{let t=a.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},v=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Up.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):le(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,de=(t,n=ie(),r)=>{let i=a[a.length-1],o=n.line===i.line&&n.column===i.column;return new e.O(`${t} at line ${n.line}, column ${n.column}`,void 0,fe(t,n,o,r))},fe=(e,t,n,r)=>{if(i&&n){let e=a[a.length-1];return{reason:`Unexpected EOF`,...ce(ue(e)),isEnd:n}}return i&&r?{reason:`Unexpected ${v(r)}`,...ue(r),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},pe=(e,t=ie())=>de(e,t,t),me=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!le(e),y=(e,t=0)=>{let n=_(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},b=()=>{let e=_();if(e.kind===`End`)throw de(`Unexpected end of expression`);return o.index++,e},x=e=>y(e)?(o.index++,!0):!1,S=e=>{if(!y(e))throw pe(`Expected ${JSON.stringify(e)} but found ${ae(_())}`);return b()},he=()=>{let e=_();if(e.kind!==`Identifier`)throw pe(`Expected an identifier but found ${ae(e)}`);if(le(e))throw pe(`Unexpected keyword ${e.text}`);return o.index++,e.text},ge=()=>{let e=o.index;return{name:he(),range:h(e)}},_e=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),ve=()=>{let e=_();return e.kind!==`String`&&(Pp.has(e.text)||jp.has(e.text)||Mp.has(e.text)||e.text===`'`)?(o.index++,e.text):he()},ye={isUsed:!1},be=()=>_().kind===`Identifier`||!me(_())?he():(ye.isUsed=!0,b().text),C=e=>{if(!i)return e();o.offsideColumns.push(-1);let t=e();return o.offsideColumns.pop(),t},w=(e,t=`,`)=>{let n=[e()];for(;x(t);)n.push(e());return n},xe=()=>{if(y(`<<`)){let e={value:1};for(;_(e.value).kind===`Identifier`||y(`,`,e.value);)e.value++;return y(`>>`,e.value)&&y(`\\in`,e.value+1)}let e={value:0};for(;_(e.value).kind===`Identifier`;){if(y(`\\in`,e.value+1))return!0;if(!y(`,`,e.value+1))return!1;e.value+=2}return!1},Se=()=>{if(y(`::`))return!0;if(!y(`(`))return!1;let e={value:1};for(;_(e.value).kind===`Identifier`&&y(`,`,e.value+1);)e.value+=2;return _(e.value).kind===`Identifier`&&y(`)`,e.value+1)&&y(`::`,e.value+2)},Ce=()=>{if(!x(`<<`)){let e=ge();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=_e(w(ge));return S(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},we=()=>w(()=>{let e=w(Ce);S(`\\in`);let t=D();return e.map(e=>({pattern:e,set:t}))}).flat(),Te=()=>{let e=_();if(e.kind===`Identifier`){let t=o.index,n=[b().text];for(;y(`!`)&&_(1).kind===`Identifier`;)b(),n.push(he());return g({kind:`Identifier`,name:n.join(`!`),location:m(e)},t)}if(y(`<<`)||y(`(`))return ze();throw pe(`Expected a subscript but found ${ae(e)}`)},Ee=e=>{let t=_(1),n=_(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&y(`==`,Mp.has(n.text)?3:4))},De=e=>{let t=_(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||y(`,`,1)||y(`)`,1)||t.kind===`Keyword`&&zp.has(t.text)||Ee(e)},Oe=()=>{let e=_(),t=e.kind===`Operator`&&(jp.has(e.text)||Np.has(e.text))&&De(e);if(i&&e.kind!==`String`&&(Np.has(e.text)||Lp.has(e.text)&&e.text!==`'`&&!Mp.has(e.text)||Ip.has(e.text)&&_(-1).text===`(`&&_(-1).line===e.line&&_(-1).endColumn+1===e.column&&_(1).text===`)`&&_(1).line===e.line&&_(1).column===e.endColumn+1)&&De(e))throw de(`incomplete expression`,e);if(t)return o.index++,g({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:m(e)},o.index-1);if(e.kind!==`String`&&Lp.has(e.text)&&De(e)){o.index++;let t=m(e);if(Mp.has(e.text))return g({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return g({kind:`Lambda`,params:[n.name],body:$p(e.text,n,t),operator:e.text,location:m(e)},o.index-1)}if(y(`LAMBDA`)){let t=o.index;b();let n=_e(w(ge));S(`:`);let r=D();return g({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:m(e)},t)}return D()},ke={range:void 0},Ae=()=>C(()=>{let e=o.index;S(`(`);let t=w(Oe);return S(`)`),ke.range=h(e),t}),T=()=>{let e=b();o.offsideColumns.push(e.column);let t=[D()];for(;ie().text===e.text&&ie().column===e.column;)o.index++,t.push(D());return o.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:m(e)}},je=e=>C(()=>{let t=m(e),n=_().kind===`Identifier`,r=y(`|->`,1)&&(n||me(_()));if(r||n&&y(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o.index,n=m(_()),i=e();return n.range=h(t),S(r?`|->`:`:`),{name:i,value:D(),location:n}},a=[i(()=>n?he():b().text),...x(`,`)?w(()=>i(he)):[]];return S(`]`),{kind:e,fields:a,location:t}}if(xe()){let e=we();S(`|->`);let n=D();return S(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let a=D();if(x(`->`)){let e=D();return S(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(x(`EXCEPT`)){let e=w(()=>{S(`!`);let e=[];for(;y(`.`)||y(`[`);)if(x(`.`)){if(!me(_()))throw pe(`Expected a field name but found ${ae(_())}`);e.push({kind:`Field`,name:b().text})}else S(`[`),e.push({kind:`Index`,args:w(()=>D())}),S(`]`);return S(`=`),{path:e,value:D()}});return S(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!y(`]_`)){let e=[a];for(;x(`,`);)e.push(D());return S(`]`),{kind:`Bracket`,args:e,location:t}}return S(`]_`),{kind:`BoxAction`,action:a,subscript:Te(),location:t}}),Me=()=>{let e=o.index,t=g(Be(),e),n=m(b());return g({kind:`Apply`,operator:`\\in`,args:[t,D()],location:n},e)},Ne=e=>C(()=>{let t=m(e);if(x(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(xe()&&(_(1).text===`\\in`||y(`<<`))){let e=o.index,n=Ce();S(`\\in`);let r=D();if(x(`:`)){let e=D();return S(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o.index=e}let n=_().kind===`Identifier`&&y(`\\in`,1)?Me():D();if(x(`:`)){let e=we();return S(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;x(`,`);)r.push(D());return S(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Pe=e=>{let t=m(e),n=C(()=>y(`>>`)||y(`>>_`)?[]:w(()=>D()));if(x(`>>_`)){if(n.length!==1)throw de(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:Te(),location:t}}return S(`>>`),{kind:`Tuple`,elements:n,location:t}},Fe=e=>{let t=m(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&xe()){let e=we();return S(`:`),{kind:n,bounds:e,body:D(),location:t}}let i=_e(w(ge));return S(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:D(),isTemporal:r,location:t}},Ie=e=>{let t=[];do{if(x(`OTHER`))return S(`->`),{kind:`Case`,arms:t,other:D(),location:m(e)};let n=D();S(`->`),t.push({condition:n,body:D()})}while(x(`[]`));return{kind:`Case`,arms:t,other:void 0,location:m(e)}},Le=()=>{let e=_(1);return y(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Rp.has(e.text)||e.kind===`Operator`&&(jp.has(e.text)||Mp.has(e.text)||Np.has(e.text)))},Re=()=>{let e=b();if(e.kind===`Number`)return{kind:`Operand`,operand:s(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return o.index--,{kind:`Bound`,args:Ae()}}return{kind:`Name`,name:e.text,args:y(`(`)?Ae():[]}},ze=e=>{let t=o.index,n=b(),r=m(n);if(i&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=w(he);return S(`:`),{kind:`Lambda`,params:e,body:D(),location:r}}if(n.kind===`Number`){if(i&&/^\\[BOH]/.test(n.text))throw de(`incomplete expression`,n);return{kind:`Number`,value:s(n.text),text:n.text,location:r}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:r};if(n.kind===`String`)return{kind:`String`,value:n.text,location:r};let a=n.kind===`Step`&&tt(n);if(a&&Qe()<0&&Ze.length<=1)throw de(`Step number used outside proof`,n);if(a&&n.text[1]===`+`)throw de(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||a){let s=a?nt(n)??n.text:n.text;if(Se()){let t=_e(x(`(`)?w(ge):[]);t.names.length>0&&S(`)`),S(`::`);let a=D();if(!i&&e!==void 0&&c.last!==void 0&&Zp(a)&&e.high>=c.last.low)throw de(`Removing the label would change expression parsing`,n);return{kind:`Label`,name:s,params:t.names,paramRanges:t.ranges,body:a,location:r}}let l=y(`(`);if(s===`@`&&!l&&!Le())return{kind:`ExceptAt`,location:r};let u=l?Ae():[],d=[l?ke.range:void 0];if(!Le())return l?{kind:`Apply`,operator:s,args:u,argumentsRange:ke.range,location:r}:{kind:`Identifier`,name:s,location:r};let f=[{kind:`Name`,name:s,args:u}],p=[h(t,t)];for(;Le();)b(),p.push(h(o.index,o.index)),ke.range=void 0,f.push(Re()),d.push(ke.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),ee=m.join(`!`),te=f.flatMap(e=>`args`in e?e.args:[]),ne=f.map(e=>`args`in e?e.args.length:0),g=d.at(-1)??h(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:r}:te.length===0?{kind:`Identifier`,name:ee,selectorRanges:p,location:r}:{kind:`Apply`,operator:ee,args:te,...ne.slice(0,-1).some(e=>e>0)&&{argumentCounts:ne},argumentsRange:g,selectorRanges:p,argumentRanges:d,location:r}}if(n.kind===`Operator`&&Qp(n.text)&&y(`(`))return{kind:`Apply`,operator:n.text,spelling:n.spelling,args:Ae(),location:r};if(n.kind===`Operator`&&Qp(n.text)&&!i)return{kind:`Identifier`,name:n.text,spelling:n.spelling,location:r};switch(n.text){case`(`:{let e=C(()=>D());return S(`)`),e}case`[`:return je(n);case`{`:return Ne(n);case`<<`:return Pe(n);case`@`:return{kind:`ExceptAt`,location:r};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Fe(n);case`IF`:{let e=D();S(`THEN`);let t=D();return S(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:D(),location:r}}case`CASE`:return Ie(n);case`LET`:{let e=[],t=[];for(l.push(/* @__PURE__ */ new Set);!x(`IN`);){if(i&&y(`RECURSIVE`))throw de(`Unexpected keyword RECURSIVE`,ce(ie()));if(x(`RECURSIVE`)){Je();continue}let n=k(!1);n.kind===`Instance`?t.push(n):e.push(n)}l.pop();let n=D();return t.length===0?{kind:`Let`,definitions:e,body:n,location:r}:{kind:`Let`,definitions:e,instances:t,body:n,location:r}}case`CHOOSE`:{let e=Ce(),t=x(`\\in`)?D():void 0;return S(`:`),{kind:`Choose`,pattern:e,set:t,body:D(),location:r}}case`WF_`:case`SF_`:{let e=Te(),t=C(()=>{S(`(`);let e=D();return S(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:r}}}throw pe(`Unexpected ${ae(n)}`,n)},E=(e,t,n)=>{c.last=c.preceding={low:t,high:n};let r=D(n+1),a=_(),o=a.text===`'`||Mp.has(a.text)?kp.high:jp.get(a.text)?.high;if(!i&&a.kind===`Operator`&&o!==void 0&&o>=t)throw de(`Precedence conflict between ${e.text} and ${a.text}`,a);return r},Be=()=>{let e=c.preceding;c.preceding=void 0;let t=_(),n=m(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return T();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return b(),{kind:`Apply`,operator:`~`,args:[E(t,4,4)],location:n};case`-`:return b(),{kind:`Apply`,operator:`-.`,args:[E(t,12,12)],location:n};case`[]`:return b(),{kind:`Always`,expression:E(t,4,15),location:n};case`<>`:return b(),{kind:`Eventually`,expression:E(t,4,15),location:n};case`ENABLED`:return b(),{kind:`Enabled`,expression:E(t,4,15),location:n};case`UNCHANGED`:return b(),{kind:`Unchanged`,expression:E(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return b(),{kind:`Apply`,operator:t.text,args:[i?D(9):E(t,10,13)],location:n}}return ze(e)},D=(e=0)=>{let t=o.index,n=Be(),r={left:n.location.range?n:g(n,t),previous:void 0};for(;;){let n=_();if(n.kind!==`Operator`)break;let i=m(n);if(n.text===`'`&&e<=15){b(),c.last=kp,r.left=g({kind:`Prime`,expression:r.left,location:i},t);continue}if(Mp.has(n.text)&&e<=15){b(),c.last=kp,r.left=g({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){b();let e=C(()=>w(()=>D()));C(()=>S(`]`)),c.last=Ap,r.left=g({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&me(_(1))){b();let e=b().text;r.left=g({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let a=jp.get(n.text);if(!a||a.low<e)break;let o=r.previous;if(o){let e=!(o.low>a.high||o.high<a.low),t=o.text===n.text&&a.isAssociative;if(e&&!t&&(o.text!==`\\X`||n.text!==`\\X`))throw de(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(b(),a.low>12&&y(`-`))throw de(`Precedence conflict between ${n.text} and -`,_());c.last=c.preceding=a;let s=D(a.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[h(t).end];r.left=l.kind===e&&o?.text===n.text?{...l,operands:[...l.operands,s],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,s],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&o?.text===`\\X`?{...l,factors:[...l.factors,s]}:{kind:`Product`,factors:[l,s],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,s],location:i};r.left=g(r.left,t),r.previous={...a,text:n.text}}return r.left},Ve=()=>{if(!x(`(`))return[];let e=qe();return S(`)`),e},O=()=>{let e=m(_()),t=D(),n=a[o.index-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:f[0].name,start:e,end:r}}},k=e=>{let t=o.index;return g(Ue(e),t)},He=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),Ue=e=>{let t=_(),n=m(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...O(),isLocal:e,isRecursive:p(t),location:n});if(t.kind===`Identifier`&&_(1).kind===`Operator`&&jp.has(_(1).text)&&_(2).kind===`Identifier`&&y(`==`,3)){let e=ge(),t=b().text,n=ge();return S(`==`),r(t,[He(e),He(n)])}let i=t.kind!==`String`&&Pp.has(t.text),a=t.kind===`Identifier`&&Mp.has(_(1).text)&&y(`==`,2);if(i||a){let e=i?t.text:_(1).text;i&&b();let n=ge();return a&&b(),S(`==`),r(e,[He(n)])}let s=he();if(x(`[`)){let t=C(()=>we());return S(`]`),S(`==`),{kind:`Function`,name:s,bounds:t,body:D(),isLocal:e,isRecursive:p(s),location:n}}let c=o.index,l=Ve();return S(`==`),y(`INSTANCE`)?{...We(s,l,e,n),definitionRange:h(c)}:r(s,l)},We=(e,t,n,r)=>{let i=o.index;return S(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:be(),substitutions:x(`WITH`)?w(()=>{let e=o.index,t=ve(),n=h(e);return S(`<-`),{name:t,nameRange:n,expression:Oe()}}):[],isLocal:n,location:r,instanceRange:h(i)}},Ge=()=>{let e=o.index;return g(Ke(),e)},Ke=()=>{let e=m(_());if(y(`_`)&&_(1).kind===`Operator`)return b(),{name:b().text,arity:x(`_`)?2:1,location:e};if(_().kind===`Operator`&&y(`_`,1)){let t=b().text;return b(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=he();if(!x(`(`))return{name:t,arity:0,location:e};let n=w(()=>S(`_`));return S(`)`),{name:t,arity:n.length,location:e}},qe=()=>w(Ge),Je=()=>{let e=qe();return e.forEach(e=>l[l.length-1].add(e.name)),e},Ye=e=>{let t={value:0,offset:e};do{let e=_(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&Jp.has(e.text)&&t.value++,e.kind===`Operator`&&Yp.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Xe=()=>{let e=_(),t=_(1);return e.kind===`Identifier`?y(`(`,1)||y(`[`,1)?y(`==`,Ye(1)):t.kind===`Operator`&&Mp.has(t.text)?y(`==`,2):t.kind===`Operator`&&jp.has(t.text)?_(2).kind===`Identifier`&&y(`==`,3):y(`==`,1):e.kind!==`String`&&Pp.has(e.text)&&t.kind===`Identifier`&&y(`==`,2)},Ze=[],Qe=()=>Ze[Ze.length-1]??-1,$e=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),et=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},tt=e=>!e.text.endsWith(`.`)&&!Wp.has(et(e)),nt=e=>{let t=et(e);if(Wp.has(t))return;let n=$e(e);if(n>=0)return`<${n}>${t}`;let r=Qe(),i=Ze[Ze.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},rt=e=>{if(e.kind===`Keyword`)return Vp.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Ze.length===0;if(e.text[1]===`+`||Ze.length===0)return!0;let t=Qe();return t>=0&&$e(e)>t},it=e=>{let t=$e(e),n=Ze.length-1,r=Ze[n-1]??-1,i=Ze[n]<0;return i&&(Ze[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Ze[n]===t},at=e=>!u.has(e)&&f.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),ot=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Xp.has(e.name)&&!at(e.name):!1,st=()=>{let e=_();return e.kind===`Step`?tt(e):e.kind===`Keyword`?Gp.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Xe()},ct=()=>{let e=o.index,t=_();return t.kind===`Operator`&&!Fp.has(t.text)&&Qp(t.text)?(o.index++,g({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:m(t)},e)):x(`MODULE`)?g({kind:`ModuleFact`,name:he(),location:m(t)},e):D()},lt=e=>d[d.length-1]?.add(e),ut=e=>{d.push(/* @__PURE__ */ new Set);let t=e();return d.pop(),t},dt=e=>d.some(t=>t.has(e))||f.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),ft=()=>{let e=o.index,t=_(),n=w(()=>{let e=_();if((e.kind!==`Identifier`||le(e))&&e.kind!==`Operator`)throw pe(`Expected a definition name but found ${ae(e)}`,e);return o.index++,e.text},`!`),r=m(t);return g(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},pt=()=>{if(i)return w(ft);let e=w(ct),t=n===`tlc`?e.find(e=>e.kind===`Identifier`&&dt(e.name)):void 0;if(t)throw de(`DEF clause entry should describe a defined operator`,t.location);return e},mt=()=>({facts:st()?w(ct):[],defs:x(`DEF`)||x(`DEFS`)?pt():[]}),ht=()=>{let t=o.index,r=b(),i=r.text===`USE`&&x(`ONLY`),a=h(t),s={kind:r.text===`USE`?`Use`:`Hide`,isOnly:i,...mt(),keyword:a,location:m(r)},c=s.kind===`Hide`&&n===`tlc`?s.facts.filter(e=>!ot(e)):[];if(c.length>0)throw e.L(c.map(n=>({location:e.B(n.location.range??h(t)),message:`The only expression allowed as a fact in a HIDE is
|
|
457
|
-
the name of a theorem, assumption, or step.`})));return g(s,t)},gt=()=>{let e=o.index,t=m(_()),n=x(`NEW`),r=_().kind===`Keyword`?Kp.get(_().text):void 0;if(!n&&r===void 0)throw pe(`Expected a declaration but found ${ae(_())}`);if(r!==void 0&&b(),r===`Variable`){let n=ge();return lt(n.name),g({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let i=Ge();lt(i.name);let a=(r??`Constant`)===`Constant`&&y(`\\in`);if(a&&i.arity>0)throw de(`declared symbol with arguments before \\in`);return a&&b(),g({kind:`NewSymbol`,name:i.name,arity:i.arity,level:r??`Constant`,set:a?D():void 0,nameRange:i.location.range,location:t},e)},_t=()=>{let e=o.index,t=m(S(`ASSUME`)),n=w(()=>y(`ASSUME`)?ut(_t):_().kind===`Keyword`&&qp.has(_().text)?gt():D());return S(`PROVE`),g({kind:`AssumeProve`,assumptions:n,conclusion:D(),location:t},e)},vt=e=>{let t={value:0};for(;_(t.value).kind===`Identifier`&&y(`,`,t.value+1);)t.value+=2;return _(t.value).kind===`Identifier`&&y(e,t.value+1)},yt=(e,t)=>{e.forEach(lt),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(lt))},bt=()=>{let e=_();if(y(`USE`)||y(`HIDE`))return ht();if(y(`INSTANCE`)){let t=o.index;return g(We(void 0,[],!1,m(e)),t)}if(y(`DEFINE`)||Xe()){let t=o.index;x(`DEFINE`);let n=[k(!1)];for(;Xe();)n.push(k(!1));let r={kind:`Define`,definitions:n,location:m(e)};return g(r,t)}if(x(`HAVE`))return{kind:`Have`,expression:D()};if(x(`TAKE`)){let e=xe(),t=_e(e?[]:w(ge)),n=e?we():[];return yt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(x(`WITNESS`))return{kind:`Witness`,expressions:w(()=>D())};if(x(`PICK`)){let e=vt(`:`),t=_e(e?w(ge):[]),n=e?[]:we();return yt(t.names,n),S(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:D()}}return x(`CASE`)?{kind:`Case`,expression:D()}:{kind:`Assert`,isSuffices:x(`SUFFICES`),statement:y(`ASSUME`)?_t():D()}},xt=e=>{let t=_();if(t.kind!==`Step`)throw pe(`Expected a step number but found ${ae(t)}`,t);if(!it(t))throw de(`${e?`QED step`:`step`}'s number has bad level`,t);if($e(t)<0&&nt(t)!==void 0)throw de(`<*> and <+> cannot be used for a named step`,t);return o.index++,{name:nt(t),token:t.text,location:m(t)}},St=()=>{let e=o.index,t=xt(y(`QED`,1)),n=o.index,r=/* @__PURE__ */ new Set;d.push(r);let i=x(`QED`)?{kind:`Qed`}:bt(),a=h(e),s=h(n),c=rt(_());if(c&&!Hp.has(i.kind))throw de(`Proof of a step that does not take a proof`);let l=c?wt():void 0;return d.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(lt),g({...t,body:i,head:a,statement:s,proof:l},e)},Ct=()=>{let e=m(_());if(y(`BY`)||y(`PROOF`)&&y(`BY`,1)){x(`PROOF`),b();let t=h(o.index-1);return{kind:`By`,isOnly:x(`ONLY`),...mt(),keyword:t,location:e}}let t=_(+!!y(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){x(`PROOF`),b();let n=h(o.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}x(`PROOF`);let n=[St()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(St());return{kind:`Steps`,level:Qe(),steps:n,location:e}},wt=()=>{let e=o.index;Ze.push(-1);let t=ut(Ct);return Ze.pop(),g(t,e)},Tt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},Et=e=>{let t=o.index,n=b(),r=_().kind===`Identifier`&&y(`==`,1)?he():void 0;r!==void 0&&(u.add(r),b());let i=ut(()=>({statement:y(`ASSUME`)?_t():D(),proof:rt(_())?wt():void 0})),a=i.statement,s=g({name:r,statement:a,proof:i.proof,location:m(n)},t);e.theorems.push(s),e.units.push({kind:`Theorem`,theorem:s}),r!==void 0&&a.kind!==`AssumeProve`&&Tt(e,g({kind:`Operator`,name:r,params:[],body:a,isLocal:!1,isRecursive:!1,location:m(n)},t))},Dt=()=>{let e=o.index,t=b(),n=_().kind===`Identifier`&&y(`==`,1)?he():void 0;return n!==void 0&&(u.add(n),b()),g({name:n,expression:D(),isAxiom:t.text===`AXIOM`,location:m(t)},e)},Ot=()=>{let e=m(S(`----`));S(`MODULE`);let t=be();S(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(f.push(n),l.push(/* @__PURE__ */ new Set),x(`EXTENDS`)&&w(()=>{let e=o.index;n.extends.push(be()),n.extendsRanges.push(h(e))});;){let t=o.index;oe.index=t;let r=_();if(r.kind===`ModuleEnd`)return e.range={module:f[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},f.pop(),l.pop(),n;if(r.kind===`Separator`){if(y(`MODULE`,1)){let e=Ot();n.modules.push(e),n.units.push({kind:`Module`,module:e}),S(`====`);continue}b()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=m(b()),r=qe();n.constants.push(...r),e.range=h(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=m(b()),r=w(()=>{let e=o.index,t=m(_());return g({name:he(),arity:0,location:t},e)});n.variables.push(...r),e.range=h(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Dt();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&Tt(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(y(`USE`)&&y(`ONLY`,1))throw pe(`Expected a module unit but found ${ae(r)}`);let e=ht();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:b(),n.units.push({kind:`Recursive`,declarations:Je()});continue;case`INSTANCE`:kt(n,g(We(void 0,[],!1,m(r)),t));continue;case`LOCAL`:if(b(),y(`INSTANCE`)){kt(n,g(We(void 0,[],!0,m(r)),t));continue}kt(n,g(Ue(!0),t));continue}r.kind===`Keyword`&&Bp.has(r.text)?Et(n):kt(n,k(!1))}}},kt=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},At=Ot(),jt=ye.isUsed?Op(t):void 0;if(jt!==void 0)throw new e.O(jt);return At},nm=e=>tm(e,`tlc`),rm=(e,t)=>tm(e,`tlc`,t),im=e=>tm(e,`tlapm`),am=e=>tm(e,`sany`),om=10454148508367108822n,sm=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:om);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),cm=Int32Array.from(sm,e=>Number(BigInt.asIntN(32,e>>32n))),lm=Int32Array.from(sm,e=>Number(BigInt.asIntN(32,e))),um=Number(BigInt.asIntN(32,om>>32n)),dm=Number(BigInt.asIntN(32,om));let fm=um,pm=dm;const mm=e=>{let t=(e^pm)&255;pm=(pm>>>8|fm<<24)^lm[t],fm=fm>>>8^cm[t]},hm=(()=>{let e=[cm],t=[lm];for(let n=1;n<4;n++){let r=e[n-1],i=t[n-1],a=/* @__PURE__ */ new Int32Array(256),o=/* @__PURE__ */ new Int32Array(256);for(let e=0;e<256;e++){let t=i[e]&255;o[e]=(i[e]>>>8|r[e]<<24)^lm[t],a[e]=r[e]>>>8^cm[t]}e.push(a),t.push(o)}return{highs:e,lows:t}})(),gm=hm.highs[0],_m=hm.highs[1],vm=hm.highs[2],ym=hm.highs[3],bm=hm.lows[0],xm=hm.lows[1],Sm=hm.lows[2],Cm=hm.lows[3],wm=e=>{let t=pm^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;pm=fm^Cm[n]^Sm[r]^xm[i]^bm[a],fm=ym[n]^vm[r]^_m[i]^gm[a]},Tm=e=>{if(typeof e==`boolean`)return mm(0),mm(e?116:102),2;if(typeof e==`number`)return mm(1),wm(e),5;if(typeof e==`string`){mm(3),wm(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)wm(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)mm(e.charCodeAt(n));return 5+e.length}return mm(21),wm(lt(e.name)+1),5},Em=e=>{if(typeof e!=`object`||k(e))Tm(e);else if(O(e)){let t=P(e);mm(9),wm(t.domain.length);for(let e=0;e<t.domain.length;e++)Em(t.domain[e]),Em(t.range[e])}else{let t=M(e).elements;mm(5),wm(t.length);for(let e of t)Em(e)}},Dm=e=>{let t={high:fm,low:pm};fm=um,pm=dm;for(let t of e)Em(t);let n=BigInt(fm>>>0)<<32n|BigInt(pm>>>0);return fm=t.high,pm=t.low,n},Om=(e,t)=>{let n=new BigInt64Array(e.length),r=new Int32Array(n.buffer),i=fm,a=pm;return e.forEach((e,n)=>{fm=um,pm=dm;for(let n of t)Em(e[n]);r[2*n]=pm,r[2*n+1]=fm}),fm=i,pm=a,n},km=25214903917n,Am=(1n<<48n)-1n,jm=2147483647,Mm=e=>{let t={value:(BigInt.asUintN(64,e)^km)&Am},n=e=>(t.value=t.value*km+11n&Am,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^km)&Am},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=jm)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Nm=[],Pm=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Fm=()=>{for(let e=1277011;Nm.length<1341;e++)Pm(e)&&Nm.push(e);return Nm},Im=e=>{let t=Fm(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},Lm=e=>{let t=[],n={value:e};for(let e=2;e*e<=n.value;e++)for(;n.value%e===0;)t.push(e),n.value/=e;return n.value>1&&t.push(n.value),t},Rm=e=>{for(let t=Math.max(e,9);;t++){let e=Lm(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},zm=(e,t,n)=>{if(t<=0)return[];let r=Rm(t),i={index:BigInt(n.nextInt(t))},a=BigInt(Im(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},Bm=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:jm),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},Vm=(1n<<63n)-1n-24n,Hm=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Vm*BigInt(n)+i)%t;return r<0n?r+t:r})},Um=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,Wm=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=On(e.domain),n=M(e.range).elements;return{lists:t.map(()=>n),create:e=>bt(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>M(e).elements),create:t=>An(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>M(e).elements),create:A}}},Gm=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,Km=(e,t,n,r)=>{if(N(t))return[];let i=r===`1.7.4`?Bm:zm;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=Gm(t,r)?void 0:Wm(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(jm)?Hm(e,t,n):i(e,Number(t),n)).map(e=>a.create(Um(a.lists,e)))}let o=M(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},qm=(t,n)=>{let r=t[Math.floor(n.nextDouble()*t.length)];if(r===void 0)throw new e._(`RandomElement of the empty set`);return r},Jm=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[...On(t.domain)];return bt(e,e.map(()=>Jm(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return An(t.names.map((e,r)=>[e,Jm(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return A(t.factors.map(e=>Jm(e,n)));if(typeof t==`object`&&t.kind===`Interval`){let r=Math.max(0,t.high-t.low+1),i=Math.floor(n.nextDouble()*r);if(i>=r)throw new e._(`RandomElement of the empty set`);return t.low+i}return qm(M(t).elements,n)},Ym=(e,t=0n)=>{let n=Mm(t),r={random:Mm(t),seededState:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>An([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Dm,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.seededState&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.seededState=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},Xm=e=>yn([...e.possibleCounts].map(([e,t])=>[e,t])),Zm=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Xm(e)]]),Qm=`----------------------------- MODULE Bags --------------------------------
|
|
403
|
+
`]]),wf=/* @__PURE__ */ new Map([[`Bags`,/* @__PURE__ */ new Map([[`IsABag`,`public static tlc2.value.IBoolValue tlc2.module.Bags.IsABag(tlc2.value.impl.Value)`],[`BagCardinality`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.BagCardinality(tlc2.value.impl.Value)`],[`BagIn`,`public static tlc2.value.IBoolValue tlc2.module.Bags.BagIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`CopiesIn`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.CopiesIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\oplus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagCup(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\ominus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagDiff(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagUnion`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagUnion(tlc2.value.impl.Value)`],[`\\sqsubseteq`,`public static tlc2.value.IBoolValue tlc2.module.Bags.SqSubseteq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagOfAll`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagOfAll(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagToSet`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagToSet(tlc2.value.impl.Value)`],[`SetToBag`,`public static tlc2.value.impl.Value tlc2.module.Bags.SetToBag(tlc2.value.impl.Value)`]])],[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])],[`TLCExt`,/* @__PURE__ */ new Map([[`AssertError`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`PickSuccessor`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`ToTrace`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.lassoOrdinal(tlc2.value.impl.Value)`],[`CounterExample`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.error(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`Trace`,`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`TLCDefer`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefer(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCNoOp`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcNoOp(tlc2.value.impl.Value)`],[`TLCModelValue`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.tlcModelValue(tlc2.value.impl.Value)`],[`TLCCache`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcEval2(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCFP`,`public static synchronized tlc2.value.impl.IntValue tlc2.module.TLCExt.tlcFingerprint(tlc2.value.impl.Value)`],[`TLCEvalDefinition`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefByName(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCGetOrDefault`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcGetOrDefault(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])]]),Tf=`----------------------------- MODULE Bags --------------------------------
|
|
458
404
|
(**************************************************************************)
|
|
459
405
|
(* A bag, also called a multiset, is a set that can contain multiple *)
|
|
460
406
|
(* copies of the same element. A bag can have infinitely many elements, *)
|
|
@@ -607,7 +553,7 @@ CopiesIn(e, B) ==
|
|
|
607
553
|
7 Dec 98 : Corrected error found by Stephan Merz.
|
|
608
554
|
6 Dec 98 : Modified comments based on suggestions by Lyle Ramshaw.
|
|
609
555
|
5 Dec 98 : Initial version.
|
|
610
|
-
|
|
556
|
+
`,Ef=/* @__PURE__ */ new Map([[`Bags`,Tf],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
|
|
611
557
|
(***************************************************************************)
|
|
612
558
|
(* The two definitions in this standard module are overridden by TLC in *)
|
|
613
559
|
(* the Java class tlc2.module.FiniteSets. Each operator is overridden by *)
|
|
@@ -863,7 +809,52 @@ TestRandomSetOfSubsets(k, n, S) ==
|
|
|
863
809
|
[i \\in 1..5 |-> Cardinality(RandomSetOfSubsets(k, n, S))]
|
|
864
810
|
|
|
865
811
|
=============================================================================
|
|
866
|
-
`],[`RealTime
|
|
812
|
+
`],[`RealTime`,`----------------------------- MODULE RealTime -------------------------------
|
|
813
|
+
(***************************************************************************)
|
|
814
|
+
(* This standard module is described in Chapter 9 of the book "Specifying *)
|
|
815
|
+
(* Systems". The type of specification described there cannot be handled *)
|
|
816
|
+
(* by the TLC model checker. *)
|
|
817
|
+
(***************************************************************************)
|
|
818
|
+
EXTENDS Reals
|
|
819
|
+
VARIABLE now
|
|
820
|
+
|
|
821
|
+
RTBound(A, v, D, E) ==
|
|
822
|
+
LET TNext(t) == t' = IF <<A>>_v \\/ ~(ENABLED <<A>>_v)'
|
|
823
|
+
THEN 0
|
|
824
|
+
ELSE t + (now'-now)
|
|
825
|
+
|
|
826
|
+
Timer(t) == (t=0) /\\ [][TNext(t)]_<<t, v, now>>
|
|
827
|
+
|
|
828
|
+
MaxTime(t) == [](t \\leq E)
|
|
829
|
+
|
|
830
|
+
MinTime(t) == [][A => t \\geq D]_v
|
|
831
|
+
IN \\EE t : Timer(t) /\\ MaxTime(t) /\\ MinTime(t)
|
|
832
|
+
-----------------------------------------------------------------------------
|
|
833
|
+
RTnow(v) == LET NowNext == /\\ now' \\in {r \\in Real : r > now}
|
|
834
|
+
/\\ UNCHANGED v
|
|
835
|
+
IN /\\ now \\in Real
|
|
836
|
+
/\\ [][NowNext]_now
|
|
837
|
+
/\\ \\A r \\in Real : WF_now(NowNext /\\ (now'>r))
|
|
838
|
+
=============================================================================
|
|
839
|
+
`],[`Reals`,`-------------------------------- MODULE Reals -------------------------------
|
|
840
|
+
(***************************************************************************)
|
|
841
|
+
(* This module provides dummy definitions of the operators that are *)
|
|
842
|
+
(* defined by the real Reals module. It is expected that any tool that *)
|
|
843
|
+
(* handles specifications that use real numbers will provide its own *)
|
|
844
|
+
(* implementations of these operators. TLC currently does not handle real *)
|
|
845
|
+
(* numbers and produces an error if a specification requires TLC to *)
|
|
846
|
+
(* evaluate the operators defined here or to evaluate any operator defined *)
|
|
847
|
+
(* in the Integers module that is applied to non-integer real numbers. *)
|
|
848
|
+
(* *)
|
|
849
|
+
(* See the book "Specifying Systems" for the real Reals module. *)
|
|
850
|
+
(***************************************************************************)
|
|
851
|
+
EXTENDS Integers
|
|
852
|
+
|
|
853
|
+
Real == "Reals"
|
|
854
|
+
a / b == CHOOSE m \\in Real : m * b = a
|
|
855
|
+
Infinity == CHOOSE i : (i \\notin Real) /\\ (\\A r \\in Real : i > r)
|
|
856
|
+
=============================================================================
|
|
857
|
+
`],[`Sequences`,`------------------------------ MODULE Sequences -----------------------------
|
|
867
858
|
(***************************************************************************)
|
|
868
859
|
(* Defines operators on finite sequences, where a sequence of length n is *)
|
|
869
860
|
(* represented as a function whose domain is the set 1..n (the set *)
|
|
@@ -1267,7 +1258,34 @@ TLCEvalDefinition(definitionName) ==
|
|
|
1267
1258
|
TRUE \\* TODO
|
|
1268
1259
|
|
|
1269
1260
|
============================================================================
|
|
1270
|
-
`],[`Toolbox
|
|
1261
|
+
`],[`Toolbox`,`----------------------------- MODULE Toolbox --------------------------------
|
|
1262
|
+
(***************************************************************************)
|
|
1263
|
+
(* *)
|
|
1264
|
+
(***************************************************************************)
|
|
1265
|
+
LOCAL INSTANCE Naturals \\* a + b
|
|
1266
|
+
LOCAL INSTANCE FiniteSets \\* Cardinality
|
|
1267
|
+
LOCAL INSTANCE TLC \\* TLCGet
|
|
1268
|
+
|
|
1269
|
+
-----------------------------------------------------------------------------
|
|
1270
|
+
|
|
1271
|
+
(* Trace Exploration *)
|
|
1272
|
+
|
|
1273
|
+
_TETrace ==
|
|
1274
|
+
CHOOSE f \\in [ (Nat \\ {0}) -> STRING ] : TRUE
|
|
1275
|
+
|
|
1276
|
+
LOCAL _TETraceLength == Cardinality(DOMAIN _TETrace)
|
|
1277
|
+
|
|
1278
|
+
\\* When evaluated as part of a TLC ALIAS expression, \`_TEPosition\` should be
|
|
1279
|
+
\\* redefined as \`TLCGet("level"), or replace with \`TLCGet(level)\` right away.
|
|
1280
|
+
\\* The definition below accounts for several "peculiarities" of the
|
|
1281
|
+
\\* Toolbox's trace exploration.
|
|
1282
|
+
_TEPosition ==
|
|
1283
|
+
IF TLCGet("level") >= _TETraceLength
|
|
1284
|
+
THEN _TETraceLength
|
|
1285
|
+
ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
|
|
1286
|
+
|
|
1287
|
+
=============================================================================
|
|
1288
|
+
`],[`_DotTrace`,`------------------------------- MODULE _DotTrace -------------------------------
|
|
1271
1289
|
LOCAL INSTANCE TLC
|
|
1272
1290
|
LOCAL INSTANCE TLCExt
|
|
1273
1291
|
LOCAL INSTANCE GraphViz
|
|
@@ -1667,7 +1685,7 @@ _TLCTrace ==
|
|
|
1667
1685
|
/\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
|
|
1668
1686
|
|
|
1669
1687
|
=============================================================================
|
|
1670
|
-
`]]),
|
|
1688
|
+
`]]),Df=new Map([...[...Ef].filter(([e])=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e)),[`Bags`,Tf.replace(`
|
|
1671
1689
|
LOCAL INSTANCE Naturals
|
|
1672
1690
|
`,`
|
|
1673
1691
|
EXTENDS TLC
|
|
@@ -1759,7 +1777,14 @@ _TEPosition ==
|
|
|
1759
1777
|
ELSE TLCGet("level") + 1
|
|
1760
1778
|
|
|
1761
1779
|
=============================================================================
|
|
1762
|
-
`]]),th=(e=`master`)=>e===`1.7.4`?eh:$m,nh=(t,n,r)=>new e.C(`Applying ${t} to the following value,\nwhich is not ${n}:\n${F(r)}`),rh=e=>O(e)?P(e):void 0,ih=(e,t,n)=>{let r=I(e,t,n),i=rh(r);if(!i)throw nh(n,`a function with a finite domain`,r);return i},ah=(e,t,n)=>{let r=I(e,t,n),i=rh(r);if(!i)throw Xr(t===0?`first`:`second`,n,`bag`,r);return i},oh=(e,t)=>{if(!D(e)||!j(e))throw t();return M(e).elements},sh=e=>e.range.every(e=>typeof e==`number`&&e>0),ch=(e,t)=>{let n=e.domain.findIndex(e=>jt(e,t));return n===-1?void 0:e.range[n]},lh=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,uh=lh(`BagDiff`,`tlc2.value.impl.Value`,2),dh=lh(`SqSubseteq`,`tlc2.value.IBoolValue`,2),fh=lh(`BagUnion`,`tlc2.value.impl.Value`,1),ph=lh(`BagOfAll`,`tlc2.value.impl.Value`,2),mh=lh(`BagCup`,`tlc2.value.impl.Value`,2),hh=lh(`BagCardinality`,`tlc2.value.impl.IntValue`,1),gh=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${gi(e)}`;throw vi(t,`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},_h=(e,t,n)=>{let r=gh(e,n)+gh(t,n);if(ui(r))throw di(`${e}+${t}`);return r},vh=(e,t,n,r)=>{let i=ch(n,e.domain[t]),a=gh(e.range[t],r);return i===void 0?a:a-gh(i,r)|0},yh=(e,t)=>yn(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>jt(e[0],r));a?a[1]=_h(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),bh=bt([],[]),xh=t=>[oi(`EmptyBag`,bh),L(`IsABag`,1,e=>{let t=rh(I(e,0,`IsABag`));return t!==void 0&&sh(t)}),L(`BagCardinality`,1,e=>{let t=I(e,0,`BagCardinality`);return ih(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw nh(`BagCardinality`,`a bag`,t);return _h(e,n,hh)},0)}),L(`BagIn`,2,e=>{let t=I(e,1,`BagIn`),n=ch(ih(e,1,`BagIn`),I(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Xr(`second`,`BagIn`,`bag`,t);return n>0}),L(`CopiesIn`,2,e=>{let t=I(e,1,`CopiesIn`),n=ch(ih(e,1,`CopiesIn`),I(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Xr(`second`,`CopiesIn`,`bag`,t);return n}),L(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=ah(e,t,`(+)`);if(!sh(n))throw Xr(t===0?`first`:`second`,`(+)`,`bag`,I(e,t,`(+)`));return n});return yh(t,mh)}),L(`\\ominus`,2,e=>{let t=ah(e,0,`(-)`),n=ah(e,1,`(-)`);return yn(t.domain.flatMap((e,r)=>{let i=vh(t,r,n,uh);return i>0?[[e,i]]:[]}))}),L(`BagUnion`,1,t=>{let n=I(t,0,`BagUnion`),r=oh(n,()=>nh(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??bh;let i=r.map(t=>{let r=rh(t);if(!r)throw new e.C(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${F(n)}`);return r});return yh(i,fh)}),L(`\\sqsubseteq`,2,e=>{let t=ih(e,0,`\\sqsubseteq`),n=ih(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>vh(t,r,n,dh)<=0)}),si(`BagOfAll`,2,t=>{let n=ai(t,0,`BagOfAll`);if(n.literalBody!==void 0)throw new e.C(`The first argument of BagOfAll should be an operator, but instead it is:\n${F(n.literalBody)}`);let r=I(t,1,`BagOfAll`),i=rh(r);if(!i)throw Xr(`second`,`BagOfAll`,`function with a finite domain`,r);return yh(i.domain.map((e,t)=>bt([n.call([e])],[i.range[t]])),ph)}),L(`SubBag`,1,n=>{let r=I(n,0,`SubBag`);if(!O(r))throw new e._(`DOMAIN expects a function but received ${F(r)}`);let i=P(r),a=pn(i.range).elements,o=a.find(e=>typeof e!=`number`);o!==void 0&&t.get(`>=`)?.evaluateBinary?.(a[0],o);let s=i.range.filter(e=>typeof e==`number`);if(s.some(e=>e<1))throw new e._(`Attempted to apply a function to ${F(i)}, which is not in its domain`);return pn(i.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:s[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>bt(e.map(e=>e[0]),e.map(e=>e[1]))))}),L(`BagToSet`,1,e=>yr(ih(e,0,`BagToSet`))),L(`SetToBag`,1,e=>{let t=I(e,0,`SetToBag`),n=oh(t,()=>nh(`BagToSet`,`a function with a finite domain`,t));return bt([...n],n.map(()=>1))})],Sh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Ch=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,wh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Th=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Eh=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Dh=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Oh=e=>{if(!O(e))return!1;let t=P(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},kh=(e,t)=>vi(e,`Cannot convert value: unsupported value type tlc2.value.impl.${gi(t)}`),Ah=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),jh=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw kh(t,e);return`[${M(e).elements.map(e=>Nh(e,t)).join(`,`)}]`},Mh=(e,t)=>{let n=P(e),r=nr(n);return r?`[${r.map(e=>Nh(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Ah(typeof e==`string`?e:F(e))}:${Nh(n.range[r],t)}`).join(`,`)}}`},Nh=(e,t)=>typeof e==`string`?Ah(e):typeof e==`object`?e.kind===`ModelValue`?Ah(e.name):D(e)?jh(e,t):Mh(e,t):String(e),Ph=e=>{if(D(e))return jh(e,Sh);if(!O(e)||Oh(e))throw kh(Sh,e);return Mh(e,Sh)},Fh=e=>{if(!O(e))throw kh(Ch,e);return Mh(e,Ch)},Ih=e=>{let[,t,n=`0`,r=``,i=`0`]=/^(-?)(\d+)(?:\.(\d*))?(?:[eE]([+-]?\d+))?$/.exec(e)??[],a=BigInt(n+r),o=Number(i)-r.length,s=o>=0?a*10n**BigInt(o):a/10n**BigInt(-o);return Number(BigInt.asIntN(32,t===`-`?-s:s))},Lh=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return ct(e);if(Array.isArray(e))return A(e.map(e=>Lh(e,t)));if(typeof e==`object`&&e)return An(Object.entries(e).map(([e,n])=>[ct(e),Lh(n,t)]));throw vi(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Rh=(e,t)=>{if(e.trim()===``)return Lh(null,t);try{return Lh(JSON.parse(e,(e,t,n)=>typeof t==`number`?Ih(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?vi(t,e.message):e}},zh=(e,t)=>{if(typeof e!=`string`)throw vi(t,`Cannot cast tlc2.value.impl.${gi(e)} to tlc2.value.impl.StringValue`);return e},Bh=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw vi(n,`${t} (No such file or directory)`);return r},Vh=e=>[ci(`ToJson`,1,e=>ct(Nh(I(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),ci(`ToJsonArray`,1,e=>ct(Ph(I(e,0,`ToJsonArray`)))),ci(`ToJsonObject`,1,e=>ct(Fh(I(e,0,`ToJsonObject`)))),ci(`JsonSerialize`,2,t=>{let n=zh(I(t,0,`JsonSerialize`),wh),r=I(t,1,`JsonSerialize`);if(!nr(r)&&!Oh(r))throw Xr(`second`,`JsonSerialize`,`sequence or record`,r);return e.writeFile?.(n,Nh(r,wh)),!0}),ci(`ndJsonSerialize`,2,t=>{let n=zh(I(t,0,`ndJsonSerialize`),Th),r=I(t,1,`ndJsonSerialize`),i=nr(r);if(!i)throw Xr(`second`,`ndJsonSerialize`,`sequence`,r);return e.writeFile?.(n,i.map(e=>`${Nh(e,Th)}\n`).join(``)),!0}),ci(`JsonDeserialize`,1,t=>{let n=zh(I(t,0,`JsonDeserialize`),Eh);return Rh(Bh(e,n,Eh),Eh)}),ci(`ndJsonDeserialize`,1,t=>{let n=zh(I(t,0,`ndJsonDeserialize`),Dh);return A(Bh(e,n,Dh).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Rh(e,Dh)))})],Hh=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,Uh=1e6,Wh=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Xr(t,n,`nonnegative integer`,e);return e},Gh=(e,t,n,r)=>pn(Array.from({length:t},()=>pn(e.filter(()=>r.nextDouble()<n)))),Kh=(e,t)=>{let n=`RandomSetOfSubsets`,r=Wh(I(e,0,n),`first`,n),i=Wh(I(e,1,n),`second`,n),a=I(e,2,n);if(!D(a)||!j(a))throw Xr(`third`,n,`finite set`,a);let o=M(a).elements;if(o.length<31&&r>2**o.length)throw Xr(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw Xr(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return Gh(o,r,o.length===0?0:i/o.length,t.getRandom())},qh=e=>[ci(`RandomSubset`,2,t=>{let n=I(t,0,`RandomSubset`);if(typeof n!=`number`)throw Xr(`first`,`RandomSubset`,`nonnegative integer`,n);if(n<0)throw vi(Hh,String(n));let r=I(t,1,`RandomSubset`);if(!D(r)||!N(r)&&!j(r))throw Xr(`second`,`RandomSubset`,`a finite set`,r);let i=Gm(r,e.version);if(i&&i.reduce((e,t)=>e*M(t).elements.length,1)>Uh)throw vi(Hh,`Attempted to construct a set with too many elements (>${Uh}).`);return pn(Km(n,r,e.getRandom(),e.version))}),ci(`RandomSetOfSubsets`,3,t=>Kh(t,e)),ci(`TestRandomSetOfSubsets`,3,t=>A(Array.from({length:5},()=>M(Kh(t,e)).elements.length)))],Jh=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,Yh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${Jh})`,Xh=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${Jh}) throws java.io.IOException`,Zh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${Jh})`,Qh=e=>An([[`name`,e??`UnnamedAction`],[`location`,An([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),$h=(e,t,n)=>{let r=e.map((e,t)=>A([t+1,An(Object.entries(e))])),i=r.slice(1).map((e,n)=>A([r[n],t[n],e])),a=n?[A([r[r.length-1],n.action,r[n.start]])]:[];return An([[`action`,pn([...i,...a])],[`state`,pn(r)]])},eg=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Zm(e).get(t)},tg=(t,n,r,i)=>{if(typeof r==`number`&&r>=0)t.registers.set(r,i);else if(r===`exit`)i===!0&&(t.isStopped=!0);else if(r===`pause`){if(i!==!0)return;n(`Press enter to resume model checking.`),t.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))t.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))t.properties.set(r.slice(2),F(i));else throw new e.C(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${F(r)}`)},ng=e=>e.every(e=>e!==void 0),rg=(e,t)=>An(t.variables.map((t,n)=>[t,e[n]])),ig=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(e.kind===`Prime`||e.kind===`Unchanged`)return!0;if(r!==void 0&&!T(e)){if(t.variableIndex.has(r))return!0;let e=gu(r,t);if(e&&!n.has(e)&&(n.add(e),ig(e.body,t,n)))return!0}return Ae(e).some(e=>ig(e,t,n))},ag=(t,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[L(`AssertEq`,2,e=>{let n=I(e,0,`AssertEq`),r=I(e,1,`AssertEq`),i=jt(n,r);return i||(t(F(`Assertion failed`,!0)),t(F(n,!0)),t(F(r,!0))),i}),Ti(`AssertError`,2,t=>{let r=ai(t,0,`AssertError`).expression;if(r&&r.kind!==`String`)throw vi(Yh,`In computing AssertError, a non-string expression (line ${r.location.line}, col ${r.location.column}) was used as the err of an AssertError(err, exp).`);let i=Ei(t,0,`AssertError`)();try{Ei(t,1,`AssertError`)()}catch(t){if(t instanceof e._)return ta(t.message,n.isTool)===i;throw t}return!1}),ci(`TLCGetOrDefault`,2,e=>{let t=I(e,0,`TLCGetOrDefault`);return eg(n,t)??I(e,1,`TLCGetOrDefault`)}),{...si(`TLCGetAndSet`,4,e=>{let r=I(e,0,`TLCGetAndSet`),i=eg(n,r)??I(e,3,`TLCGetAndSet`),a=ai(e,1,`TLCGetAndSet`);return tg(n,t,r,a.call([i,I(e,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},ci(`Trace`,0,(e,t)=>{let r=t?.state;if(!t||!r||!ng(r)){let e=(t?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw vi(Xh,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return A(n.getBehavior(r).map(e=>rg(e,t.environment)))}),ci(`CounterExample`,0,()=>n.counterExample??An([[`action`,pn([])],[`state`,pn([])]])),L(`ToTrace`,1,t=>{let n=I(t,0,`ToTrace`);if(!O(n)||!jt(yr(n),pn([`action`,`state`])))throw new e._(`The argument of ToTrace should be a CounterExample, but instead it is:\n${F(n)}`);let r=M(_r(n,`state`)).elements.map(e=>nr(e)??[]);return A(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),L(`TLCModelValue`,1,t=>{let n=I(t,0,`TLCModelValue`);if(typeof n!=`string`)throw new e.C(`The argument of ModelValue should be a string, but instead it is:\n${F(n)}`);return vt(n)}),Ti(`TLCDefer`,1,()=>!0),L(`TLCNoOp`,1,e=>I(e,0,`TLCNoOp`)),Ti(`PickSuccessor`,1,(t,r)=>{let i=r?.next;if(!i||!ng(i))throw vi(Zh,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(n.isSeen(i)||hu(Ei(t,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new e.j(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Ti(`TLCCache`,2,(e,t)=>{let n=ai(e,0,`TLCCache`),i=Rr(Ei(e,1,`TLCCache`)()),o=n.expression;if(!o||!t)return n.call([]);let s=ig(o,t.environment,/* @__PURE__ */ new Set)&&t.state?a(t.state):r,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(i);if(l!==void 0)return l;let u=n.call([]);return c.set(i,u),u}),L(`TLCFP`,1,e=>Number(BigInt.asIntN(32,Dm([I(e,0,`TLCFP`)])))),ci(`TLCEvalDefinition`,1,(t,n)=>{let r=I(t,0,`TLCEvalDefinition`),i=typeof r==`string`&&n?gu(r,n.environment):void 0;if(!i||typeof r!=`string`||!n)throw new e.C(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${F(r)}`);if(i.kind===`Operator`&&i.params.length>0)throw new e.C(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${r}`);return H({kind:`Identifier`,name:r,location:i.location},n)})]},og=(e,t)=>[ci(`_Track`,2,e=>{let n=String(I(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,I(e,0,`_Track`)===!0?r+1:r),!0}),ci(`_Counts`,0,()=>Xm(t)),ci(`_CheckName`,1,n=>{let r=String(I(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(F(Xm(t),!0)),!1)}),ci(`_PrintCounts`,0,()=>(e(F(Xm(t),!0)),!0))],sg=e=>String(e).padStart(2,`0`),cg=e=>`${e.getUTCFullYear()}.${sg(e.getUTCMonth()+1)}.${sg(e.getUTCDate())}.${sg(e.getUTCHours())}${sg(e.getUTCMinutes())}${sg(e.getUTCSeconds())}`,lg=e=>yn([...e].map(([e,t])=>[e,A([t])])),ug=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),dg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),fg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),pg=(t,n,r)=>{if(t.version===`1.7.4`?!dg.has(n)||!t.isStarted&&fg.has(n):!t.isStarted&&ug.has(n))throw new e.C(`TLCGet(${n}) was undefined.`);let i=Math.floor((Date.now()-t.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:t.getLevel(r);case`diameter`:return t.diameter;case`generated`:return t.generatedStates;case`distinct`:return t.distinctStates;case`queue`:return t.queueSize;case`duration`:return i;case`stats`:return An([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,i],[`worker`,0]]);case`config`:return An([[`mode`,`bfs`],[`deadlock`,t.checkDeadlock],[`worker`,1],[`seed`,String(t.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let e=/* @__PURE__ */ new Date;return An([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,ct(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,ct(cg(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return Qh(void 0);case`all`:return lg(t.registers);case`all:named`:return lg(Zm(t))}if(n.startsWith(`s:`)){let r=Zm(t).get(n);if(r===void 0)throw new e.C(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return ct(t.properties.get(n.slice(2))??n);throw new e.C(`TLCGet(${n}) was undefined.`)},mg=(t,n,r)=>{if(typeof n==`number`&&n>=0){let r=t.registers.get(n);if(r===void 0)throw new e.C(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new e.C(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${F(n)}`);return pg(t,n,r?.state)},hg=e=>e.length===0?[[]]:e.flatMap((t,n)=>hg([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),gg=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&M(e).elements.forEach(gg),e.kind===`Function`&&e.range.forEach(gg))},_g=(t,n)=>[L(`Print`,2,e=>(t(`${E(F(I(e,0,`Print`),!0,!0))} ${E(F(I(e,1,`Print`),!0,!0))}`),I(e,1,`Print`))),L(`PrintT`,1,e=>(t(E(F(I(e,0,`PrintT`),!0,!0))),!0)),L(`Assert`,2,t=>{if(I(t,0,`Assert`)!==!0)throw new e.C(`The first argument of Assert evaluated to FALSE; the second argument was:\n${E(F(I(t,1,`Assert`)))}`,e.G.assertViolation);return!0}),L(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),L(`:>`,2,e=>yn([[I(e,0,`:>`),I(e,1,`:>`)]])),L(`@@`,2,e=>{let t=ii(e,0,`@@`),n=ii(e,1,`@@`);return bn([...qe(t),...qe(n)])}),L(`ToString`,1,e=>ct(F(I(e,0,`ToString`),!0))),L(`TLCEval`,1,e=>{let t=I(e,0,`TLCEval`);return gg(t),t}),L(`Permutations`,1,e=>{let t=ni(e,0,`Permutations`);return pn(hg(t).map(e=>yn(t.map((t,n)=>[t,e[n]]))))}),si(`SortSeq`,2,e=>{let t=ai(e,1,`SortSeq`);return A(ri(e,0,`SortSeq`).reduce((e,n)=>{let r=e.findIndex(e=>t.call([n,e])===!0);return r===-1?[...e,n]:[...e.slice(0,r),n,...e.slice(r)]},[]))}),n.version===`1.7.4`?yi({...ci(`TLCGet`,1,(e,t)=>mg(n,I(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):yi(Ti(`TLCGet`,1,(e,t)=>mg(n,Ei(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),ci(`TLCSet`,2,e=>{let r=I(e,0,`TLCSet`);return tg(n,t,r,I(e,1,`TLCSet`)),!0}),oi(`Any`,mt),L(`RandomElement`,1,e=>Jm(ti(e,0,`RandomElement`),n.getRandom()))],vg=(e,t)=>e.every(e=>or(e,t)),yg=pn([!1,!0]),bg=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return vn(bg(e,t,r),bg(e,r,n))},xg=[`\\cup`,`\\cap`,`\\`],Sg=e=>typeof e==`object`&&e.kind===`MixedSet`,Cg=(e,t,n)=>{let r=t.kind===`Interval`?M(t).elements:t.elements;if(e!==`\\cup`){let t=e===`\\cap`;return mn(r.filter(e=>or(e,n)===t))}if(r.length===0)return n;if(!Ve(n))return Dt({kind:`SetOperation`,operator:e,left:t,right:n});let i=M(n).elements.filter(e=>!or(e,t));return mn([...r,...i])},wg=[oi(`TRUE`,!0),oi(`FALSE`,!1),oi(`BOOLEAN`,yg),oi(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),li(`=`,dn),li(`#`,(e,t)=>!dn(e,t)),L(`~`,1,e=>!$r(e,0,`~`)),L(`<=>`,2,e=>$r(e,0,`<=>`)===$r(e,1,`<=>`)),L(`/\\`,2,e=>$r(e,0,`/\\`)&&$r(e,1,`/\\`)),L(`\\/`,2,e=>$r(e,0,`\\/`)||$r(e,1,`\\/`)),L(`=>`,2,e=>!$r(e,0,`=>`)||$r(e,1,`=>`)),L(`\\in`,2,e=>or(I(e,0,`\\in`),I(e,1,`\\in`))),L(`\\notin`,2,e=>!or(I(e,0,`\\notin`),I(e,1,`\\notin`))),L(`\\subseteq`,2,e=>{let t=ei(e,0,`\\subseteq`),n=I(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&j(t.base)?vg(M(t.base).elements,n.base):vg(M(t).elements,n)}),...xg.map(e=>L(e,2,t=>{let n=I(t,0,e),r=I(t,1,e);if(Ve(n)&&Ve(r)&&!Sg(n)&&!Sg(r)){if(e===`\\cup`&&N(n))return r;let t=e===`\\cup`?vn:e===`\\cap`?_n:gn;return ar((e,n)=>t(M(e),M(n)),(t,n)=>Cg(e,t,n),n,r)}return Ve(n)?Cg(e,n,r):e!==`\\`&&Ve(r)?Cg(e,r,n):Dt({kind:`SetOperation`,operator:e,left:n,right:r})})),L(`SUBSET`,1,e=>({kind:`Subset`,base:I(e,0,`SUBSET`)})),L(`UNION`,1,e=>{let t=ei(e,0,`UNION`),n=He(t)?t.elements.filter(He):[];if(!He(t)||n.length!==t.elements.length)return Dt({kind:`Union`,base:t});if(Sg(t)||n.some(Sg)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{or(t,e)||e.elements.push(t)})),mn(e.elements)}return n.length===0?hn:bg(n.map(M),0,n.length)}),L(`DOMAIN`,1,t=>{let n=I(t,0,`DOMAIN`);if(!O(n))throw new e._(`DOMAIN expects a function but received ${F(n)}`);return yr(n)})],Tg=xi(`Integers`,`Neg`,`IntValue`,1),Eg=t=>{let n=xi(t,`DotDot`,`IntervalValue`,2);return[Si(t,`+`,`Plus`,(e,t)=>e+t),Si(t,`-`,`Minus`,(e,t)=>e-t),Si(t,`*`,`Times`,(e,t)=>e*t),Si(t,`^`,`Expt`,(t,n)=>{if(n<0)throw new e.C(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(t===0&&n===0)throw new e.C(`0^0 is undefined.`);return t**n}),Si(t,`\\div`,`Divide`,(n,r)=>{if(r===0)throw new e.C(`The second argument of \\div is 0.`);if(t===`Naturals`){let e=Math.trunc(n/r)|0;return e<0&&Math.imul(e,r)!==n?e-1:e}let i=Math.floor(n/r);if(ui(i))throw di(`${n} \\div ${r}`);return i}),Si(t,`%`,`Mod`,(t,n)=>{if(n<=0)throw new e.C(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(t%n+n)%n}),L(`..`,2,e=>({kind:`Interval`,low:bi(I(e,0,`..`),n),high:bi(I(e,1,`..`),n)}))]},Dg=Eg(`Naturals`),Og=Eg(`Integers`),kg=e=>{let t=Dg.indexOf(e);return t===-1?void 0:Og[t]},Ag=[oi(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Dg,wi(`<`,(e,t)=>e<t),wi(`>`,(e,t)=>e>t),wi(`<=`,(e,t)=>e<=t),wi(`>=`,(e,t)=>e>=t,`>`)],jg=[oi(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Og,wi(`>=`,(e,t)=>e>=t),L(`-.`,1,e=>{let t=bi(I(e,0,`-`),Tg);if(ui(-t))throw di(`-${t}`);return-t})],Mg=(t,n,r)=>{let i=I(t,n,r),a=nr(i);if(!a)throw new e.C(`${r}\n${F(i)}`);return a},Ng=(e,t,n)=>{let r=I(e,t,n);return typeof r==`string`?r:Mg(e,t,n)},Pg=(e,t,n)=>typeof e==`string`?ct(e.slice(t,n)):A(e.slice(t,n)),Fg=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Ig=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Lg=(e,t)=>{let n=cf.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?yi(e,t):e}):t},Rg=t=>Lg(`Sequences`,[L(`Seq`,1,e=>({kind:`SequenceSet`,base:I(e,0,`Seq`)})),L(`Len`,1,e=>Ng(e,0,Fg(``,`Len`)).length),L(`\\o`,2,t=>{let n=Ng(t,0,Ig(`s \\o t`,`sequence`));if(typeof n!=`string`){let e=Mg(t,1,Ig(`t \\o s`,`sequence`));return A([...n,...e])}let r=I(t,1,`\\o`);if(typeof r!=`string`)throw new e.C(`${Ig(`t \\o s`,`string`)}\n${F(r)}`);return ct(n+r)}),L(`Append`,2,e=>A([...Mg(e,0,Ig(t===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),I(e,1,`Append`)])),L(`Head`,1,t=>{let n=Mg(t,0,Fg(``,`Head`));if(n.length===0)throw new e.C(`Attempted to apply Head to the empty sequence.`);return n[0]}),L(`Tail`,1,t=>{let n=Ng(t,0,Fg(``,`Tail`));if(n.length===0)throw new e.C(`Attempted to apply Tail to the empty sequence.`);return Pg(n,1)}),L(`SubSeq`,3,t=>{let n=Ng(t,0,Fg(`first `,`SubSeq`)),r=Qr(t,1,`SubSeq`),i=Qr(t,2,`SubSeq`);if(r>i)return Pg(n,0,0);let a=r<1||r>n.length?{position:`second`,value:r}:i>n.length?{position:`third`,value:i}:void 0;if(a)throw new e.C(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${F(I(t,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return Pg(n,r-1,i)}),si(`SelectSeq`,2,e=>{let t=ai(e,1,`SelectSeq`);return A(Mg(e,0,Fg(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw Xr(`second`,`SelectSeq`,`operator`,n);return n}))})]),zg=t=>Lg(`FiniteSets`,[L(`IsFiniteSet`,1,t=>{let n=I(t,0,`IsFiniteSet`);if(D(n))return er(n);if(typeof n==`object`&&n.kind===`Function`)return!0;throw new e._(typeof n==`object`&&n.kind===`LazyFunction`?`Attempted to check if the function:\n${F(n)}\nis a finite set.`:`Attempted to check if the ${Ue(n)} ${F(n)} is a finite set.`)}),L(`Cardinality`,1,n=>{let r=I(n,0,`Cardinality`);if(!D(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new e.C(`Attempted to compute cardinality of the value\n${F(r)}`);return Qn(r,t)})]),Bg=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),Vg=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:Ag};case`Integers`:return{extends:[`Naturals`],operators:jg};case`Sequences`:return{extends:[],operators:Rg(n.version)};case`FiniteSets`:return{extends:[],operators:zg(n.version)};case`TLC`:return{extends:[],operators:Lg(`TLC`,_g(t,n))};case`Randomization`:return{extends:[],operators:qh(n)};case`_Possible`:return{extends:[],operators:og(t,n)};case`Json`:return{extends:[],operators:Vh(r)};case`Bags`:return{extends:[],operators:xh(i)};case`TLCExt`:return{extends:[],operators:ag(t,n)};default:return}},Hg=`$subexpression`,Ug=(t,n)=>new e.O(`${t} at line ${n.line}, column ${n.column}`),Wg=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Wg(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of Ae(e)){let e=Wg(r,t,n);if(e)return e}},Gg=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Kg=(e,t)=>{let n=e.location,r=Gg(t,e.lets,n);if(e.params.length===0)return r;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw Ug(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:r,location:n}}if(e.args.length!==e.params.length)throw Ug(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Hg,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Hg,args:e.args,location:n,resolution:ga},location:n}},qg=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:ga})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:ga}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:ga};return Kg({...t,params:[...t.params,...r]},a)},Jg=(t,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s={index:0,current:void 0,isFailed:!1},c=(n,i)=>{if(!n)throw Ug(i,a);va.set(r,{args:t.slice(0,s.index).flatMap(e=>`args`in e?e.args:[]),error:{location:e.B(n),message:i}}),s.isFailed=!0},l=e=>{let r=[],i=[];for(;s.index<t.length;){let o=t[s.index];if(o.kind!==`Name`)throw Ug(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=e?e.find(e=>zo(e)===c):n(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s.index++}throw Ug(`Unknown operator ${r.join(`!`)}`,a)},u=e=>{let n=l(e),u=n.definition,d=Ca(u),f=s.index===t.length-1;if(n.args.length!==d&&(!i||n.args.length!==0))return c(r.argumentRanges?.[s.index]??a.range,`The operator ${n.name} requires ${d-n.earlier} arguments.`);if(f)return{definition:u,args:n.args};if(u.kind!==`Operator`)throw Ug(`Cannot select a subexpression of ${u.name}`,a);o.params.push(...u.params),o.args.push(...n.args),s.current=u.body,s.index++},d=()=>{for(;s.index<t.length&&!s.isFailed;){let e=t[s.index];if(e.kind!==`Name`)return;let n=r.selectorRanges?.[s.index],a=s.current&&Wg(s.current,e.name,[]);if(!a)return c(n,`Cannot find label \`${e.name}'.`);let l=a.label.params;if(!i&&e.args.length!==l.length)return c(n,`Label \`${e.name}' used with wrong number of arguments.`);o.lets.push(...a.lets),o.params.push(...l.map(e=>({name:e,arity:0}))),o.args.push(...e.args),s.current=a.label.body,s.index++}},f=e=>{let n=s.current;if(!n)throw Ug(`Subexpression selection failed`,a);if(e.kind===`Colon`)return;if(n.kind===`Label`){s.current=n.body,f(e);return}if(n.kind===`Let`){if(e.kind!==`Operand`||Wa(e.operand,1)!==0)throw Ug(`A LET/IN expression has only one operand`,a);o.lets.push(n.definitions),s.current=n.body;return}let r=Ja(n);if(r&&(e.kind===`Bound`||e.kind===`At`)){o.params.push(...r.names.map(e=>({name:e,arity:0}))),e.kind===`Bound`&&o.args.push(...e.args),s.current=r.body;return}if(n.kind===`Case`&&e.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],i=r[Wa(e.operand,r.length)],o=t[s.index+1];if(!i||o?.kind!==`Operand`)throw Ug(`A subexpression of CASE must have the form !i!j`,a);s.index++;let c=Wa(o.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw Ug(`Nonexistent CASE operand`,a);s.current=l;return}if(e.kind!==`Operand`)throw Ug(`Unexpected subexpression selector`,a);let i=r?r.sets:Ya(n),c=i?.[Wa(e.operand,i.length)];if(!c)throw Ug(`Nonexistent operand specified by the selector`,a);s.current=c},p=u(void 0);if(s.isFailed)return r;if(p)return qg(p.definition,{...o,args:p.args});for(d();s.index<t.length&&!s.isFailed;){let e=t[s.index];if(e.kind===`Name`){for(;s.current?.kind===`Label`;)s.current=s.current.body;if(s.current?.kind!==`Let`)throw Ug(`A name selector here must be from a LET clause`,a);o.lets.push(s.current.definitions);let e=u(s.current.definitions);if(s.isFailed)return r;if(e)return qg(e.definition,{...o,args:[...o.args,...e.args]});d()}else f(e),s.index++}if(s.isFailed)return r;if(!s.current)throw Ug(`Subexpression selection failed`,a);return Kg(o,s.current)},Yg=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return Ga(e,t,n)},Xg=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Ae(e).some(Xg),Zg=(e,t,n,r=!1)=>{if(!Xg(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Ho(e,e=>Zg(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>Qg(e,r,n))}:i}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>Zg(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Ho(e,e=>Zg(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?Yg(a.name,[],void 0,t):a.kind===`Apply`?Yg(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Jg(o,t,a,r);return c!==a&&_a.add(c),c},Qg=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:Zg(e.expression,t,n,!0)}))}),$g=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},e_=(e,t)=>Qg(e,$g(t.definitions),()=>!1),t_=(e,t)=>{let n=$g([...t,...e.definitions]),r=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),i=e=>r.has(e),a=e=>Zg(e,n,i),o=e=>i(e)||!n(e),s=e=>Zg(e,n,o),c=e=>e.map(e=>e.kind===`ModuleFact`?e:s(e)),l=e=>e.map(e=>({...e,set:s(e.set)})),u=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&s(e.set)}:u(e)),conclusion:s(e.conclusion)}:s(e),d=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:c(e.facts)};case`Instance`:return Qg(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?Qg(e,n,o):Vo(e,s))};case`Have`:case`Case`:return{...e,expression:s(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(s)};case`Take`:return{...e,bounds:l(e.bounds)};case`Pick`:return{...e,bounds:l(e.bounds),body:s(e.body)};case`Assert`:return{...e,statement:u(e.statement)};default:return e}},f=e=>e?.kind===`By`?{...e,facts:c(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:d(e.body),proof:f(e.proof)}))}:e,p={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:u(e.statement),proof:f(e.proof)})),uses:e.uses.map(e=>({...e,facts:c(e.facts)}))};return e.definitions.some(e=>Xg(e.body))||e.assumptions.some(e=>Xg(e.expression))?{...p,definitions:e.definitions.map(e=>Vo(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},n_=(e,t)=>e.maxLevels[t]??3,r_=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=Js({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(e,a),a},i=/* @__PURE__ */ new Map,a=e=>{let n=i.get(e);if(n)return n;let a=t(e),o=r(e),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Ts(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Ts(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Es(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Ss(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&Ts(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(Ys(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c};return n=>{let i=/* @__PURE__ */ new Map,o=e.B(n.location.range??{module:n.instancer,start:n.location,end:n.location}),s=e=>i.set(`${o}\n${e}`,{location:o,message:e}),c=t(n.module),l=a(n.module),u=r(n.instancer),d=/* @__PURE__ */ new Map;n.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...c.constants.map(e=>({...e,maximumLevel:0})),...c.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let t=n.substitutions.get(e.name);if(!t)return[];if(e.arity===0){let n=u.analyze(t,d);return[{...e,level:n.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(t,d);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),p=(e,t)=>`Level error in instantiating module '${n.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${t}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&s(p(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${n.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let t=l.constraints.get(e.name);t!==void 0&&e.level>t&&s(p(e.name,t));let r=e.operator;r&&Array.from({length:e.arity},(t,i)=>{let a=l.argConstraints.get(bs(e.name,i));a!==void 0&&n_(r,i)<a&&s(`Level error in instantiating module '${n.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),l.argParams.forEach(e=>{let t=Ss(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=n_(r,t.index);i.level>a&&s(`Level error when instantiating module '${n.module}':\nThe level of the argument ${t.index} of the operator ${t.operator}' \nmust be at most ${a}.`)}),i.size>0)throw e.L([...i.values()])}},i_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],a_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),o_=new Map(tf.flatMap(e=>e.map(t=>[t,e[0]]))),s_=e=>o_.get(e)??e,c_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},l_=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},u_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:c_(e)&2147483647,kind:t,isLocal:n}),d_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:s_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:s_(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},f_=(e,t)=>{let n=[];for(let r=t;;){let t=d_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},p_=e=>({line:e.line,column:e.column}),m_=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text===`.`)continue;else if(a.text===`EXTENDS`){let n=f_(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}return{references:s,end:e.length}};return i(0,t??``).references},h_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,g_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},__=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&h_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&h_(e[n+1],e[n+2])?n+=h_(e[n+2],e[n+3])?3:2:(r.text!==`MODULE`||e[n-1]?.kind!==`Separator`)&&t.push(r.kind===`String`?`"${r.text.replace(/[\\"\n\t\r\f]/g,e=>g_[e])}"`:r.text)}return t},v_=e=>e[2]?.text,y_=e=>{let t=/* @__PURE__ */ new Map,n=[];return e.forEach((r,i)=>{r.kind===`Separator`&&e[i+1]?.text===`MODULE`&&n.push({name:e[i+2].text,start:i});let a=r.kind===`ModuleEnd`?n.pop():void 0;a&&!t.has(a.name)&&t.set(a.name,{start:a.start,end:i+1})}),t},b_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>b_(e.modules,t)).find(Boolean),x_=e=>{let t=e===void 0?[]:se(e),n={module:void 0};return{tokens:t,ranges:y_(t),getModule:()=>n.module??=e===void 0?nm(``):rm(e,t)}},S_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=x_(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:(of.has(i)?t?.(i):void 0)??sf.get(i)??t?.(i)??em(e,i),{tokens:c,ranges:l,getModule:u}=a(s),d=l.get(v_(c)??``)??{start:0,end:0},f={tokens:c,...d,getModule:u};return n.set(i??``,f),l.forEach((e,t)=>{e.start===d.start||r.has(t)||r.set(t,{tokens:c,...e,getModule:()=>b_(f.getModule().modules,t)??f.getModule()})}),f};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},C_=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=f_(t,e+1);i.push({location:p_(t[e]),apply:e=>r.forEach(t=>e.put(u_(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,r)=>{let l=e.start+r,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;i.push({location:p_(u),apply:t=>t.put(u_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&o(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&o(l,`variable`),u.text===`RECURSIVE`&&f_(t,l+1).every(e=>s.has(e))&&o(l,`definition`),a_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(a.push(p_(u)),i.push({location:p_(u),apply:e=>e.put(u_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(u_(t,`theorem`,!1))})});let l=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=s_(e.name);i.push({location:e.location,apply:n=>n.put(u_(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(u_(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(u_(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>Sa(e.location,t.location)?-1:+!!Sa(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=l_();n.set(i??``,o),ef.toReversed().forEach(e=>o.put(u_(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},w_=(t,n)=>{let r=/* @__PURE__ */ new Set,i=e=>{r.add(e)},a=e=>{e.kind===`ModelValue`&&i(e.name),e.kind===`String`&&i(e.value),e.kind===`Set`&&e.elements.forEach(a)};n.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),nf.forEach(i);let o=e=>{let n=t(e);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=m_(o(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},ee=m(e=>e.extends),te=m(e=>e.instances),ne=/* @__PURE__ */ new Set([void 0]),h=/* @__PURE__ */ new Map;__(o(void 0)).forEach((e,t)=>{t===3&&af.forEach(i),i(e)});let g=l(void 0);for(;;){let n=ee(g,/* @__PURE__ */ new Set)??te(g,/* @__PURE__ */ new Set);if(!n)break;let[r,a]=n;if(d.add(`${r.key}>${a}`),h.set(r.unit,[...h.get(r.unit)??[],a]),!ne.has(a)){if(ne.add(a),t(a).tokens.length===0){let n=r.unit??v_(t(void 0).tokens);throw e.I(a,n)}__(o(a)).forEach(i)}}i_.forEach(i);let re=/* @__PURE__ */ new Set,ie=e=>{if(re.has(e))return;re.add(e);let t=h.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(ie),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return ie(void 0),rf.forEach(i),[...r]},T_=(e,t)=>{let n=S_(e,t),r=n.getParsed,i,a=()=>i??=C_(r);return{getStringOrder:e=>w_(r,e),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let{getContext:e,getOwnEntries:t}=a();return e(void 0),e=>t(e).filter(e=>e.kind===`definition`).map(e=>e.name)}}},E_=t=>{switch(t.kind){case`Number`:if(!We(t.value))throw e.q(new e.C(`Integer overflow: ${t.value} is outside TLC's 32-bit range`),e.G.error);return t.value;case`String`:case`Boolean`:return t.value;case`ModelValue`:return vt(t.name);case`Set`:return pn(t.elements.map(E_))}},D_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],O_=(t,n,r)=>{try{return r.parseModule(t)}catch(r){if(!(r instanceof e.O))throw r;let i=Op(t);throw i===void 0?r:e.L([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},k_=t=>new e.O(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),A_=(t,n)=>t.location.range&&n.location.range&&{location:e.B(t.location.range),message:`Multiply-defined module '${t.name}': this definition or declaration conflicts \nwith the one at ${e.B(n.location.range)}.`},j_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,M_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:j_(e),N_=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:as(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),P_=(t,n,r)=>{let i=`{ ${r.map(e=>`<${[...e[0],e[1]].map(e=>F(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:t,arity:n,evaluate:t=>{let n=r.find(n=>{if(n[0].length!==t.length)throw new e._(`Attempted to apply the operator ${i}\nwith wrong number of arguments.`);return n[0].every((e,n)=>{let r=t[n];return(typeof r!=`object`||r.kind!==`Operator`)&&jt(e,r)})});if(n)return n[1];throw new e._(`Attempted to apply operator:\n${i}\nto arguments (${t.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:F(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},F_=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||Ae(e).some(e=>F_(e,t)),I_=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(es(e),n.get(e)??n.size)),n},L_=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),R_=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw iu(e);if(e.kind===`Number`&&!We(e.value))throw au(e);R_(e.kind===`Let`?[...Ae(e),...L_(e.instances??[])]:Ae(e))}),z_=(t,n)=>{let r=n.order??T_(n.source,n.loadModule),i=r.parseModule(n.source),a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Set,l=new Map(wg.map(e=>[e.name,e])),u=/* @__PURE__ */ new Map,d=Ym(t.checkDeadlock,n.seed);d.isWarningEnabled=n.isWarningEnabled??!0,d.isTool=n.isTool??!1,d.version=n.version??`master`;let f=/* @__PURE__ */ new Map,p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,ee=[],te=/* @__PURE__ */ new Map,ne=[],h=[],g=(e,t)=>ne.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),re={value:0},ie=e=>`${e}#${re.value++}`,_=[],ae=[],oe=r_(e=>{let t=m.get(e)??me(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>a.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>a.get(t.visible.get(e)?.key??e)}}),se=/* @__PURE__ */ new Map,ce=/* @__PURE__ */ new Map,le=/* @__PURE__ */ new Map,ue=e=>{let t=u.get(e);if(t)return t;let r=Vg(e,n.print,d,n.files,l);if(!r)return;Bg.get(e)?.forEach(ue);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>ue(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{l.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:_s.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:ys(e,t.name)??i.get(t.name)?.range})}),u.set(e,i),i},v=e=>{if(of.has(e)&&n.loadModule?.(e)!==void 0)return;let t=ue(e),r=Bg.get(e)??[];return t&&g(e,r),t&&r.includes(`Integers`)&&ue(`Integers`),t},de=e=>(R_([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...L_(e.instances)]),e.modules.forEach(de),e);de(i);let fe=(t,i)=>{let a=n.loadModule?.(t)??Pe.get(t)??em(n.source,t);if(a===void 0)throw e.I(t,i);let o=O_(a,t,r);if(o.name!==t)throw e.L([{location:`Unknown location`,message:`File name '${t}' does not match the name '${o.name}' of the top level module it contains.`}],!0);return de(o)},pe=t=>{let n=h.indexOf(t.name);if(n!==-1){let r=[...h.slice(n),t.name].map(e=>`${e}.tla`);throw new e.O(`Circular dependency among .tla files; dependency cycle is: ${r.join(` --> `)}`)}let r=/* @__PURE__ */ new Set,i=[],a=[],o=[];h.push(t.name),ne.push(r);let s=be(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:ae,levelChecks:o});if(ne.pop(),h.pop(),a.length>0)throw e.L(a,!1,void 0,ae);let c=i.find(e=>r.has(e.name)),l=c&&f.get(c.name),u=l&&A_(c,l.module);if(u)throw e.L([u],!1,void 0,ae);if(c)throw k_(c);return o.forEach(e=>e()),{linked:s,closure:r}},me=(e,t)=>{let r=f.get(e);if(r)return g(e,te.get(e)??[]),r;let i=pe(fe(e,t));return(th(d.version).has(e)?Vg(e,n.print,d,n.files,l):void 0)?.operators.forEach(e=>{let t=i.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(l.set(t.key,e),a.delete(t.key))}),f.set(e,i.linked),te.set(e,i.closure),g(e,i.closure),i.linked},y=(e,t,n,r,i)=>{let l=i?void 0:v(e.module);if(l)return b(e,l);let u=i??me(e.module,t.name);u.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let d=D_(u),f=`#${re.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=Mo(e_(e,t),d,t,n);_.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let ee=fs({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,Io(t,p)])),variables:new Set(u.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>o.get(e)===!0,addDefinition:(n,i,l)=>{let u=ie(`${i}@${t.name}`),f=l(u);return a.set(u,f),d.length>0&&c.add(f),e.name!==void 0&&ce.set(u,`${e.name}!${ce.get(n)??i}`),o.set(u,!r),s.set(u,{source:n,prefix:e.params.length}),u},createName:ie});return x(e,u.exported,d,(t,n)=>{let r=e.name===void 0?ee.getKey(t):ee.getQualifiedKey(t);return d.length>0&&se.set(r,{name:n,location:e.location}),e.name!==void 0&&le.set(r,n),r})},b=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),x=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:o.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},S=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:os(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),he=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),ge=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=he(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:os(r,n),location:n}}},_e=(e,t,n,r)=>{let i=e.location,s=r?void 0:v(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=he(n.arity);return S(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??me(e.module,n),l=`#${re.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=D_(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};_.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>F_(f(e),p),ee=d.map(t=>{let n=ge(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),te=[],ne=fs({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:os(e.params,i),location:i,resolution:ga}:as(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>o.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${te.length}`,a=r(i);return te.push(a.kind===`Operator`?{...a,name:i}:N_(a,i)),i},createName:ie}),h=new Set(d.map(e=>e.name)),g=[...c.exported].filter(([e])=>!h.has(e)).map(([t,n])=>{let r=ne.getKey(n.key),a=he(n.arity),o=[...e.params,...a];return S(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...ee,...te,...g]},ve=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),ye=/* @__PURE__ */ new Map,be=(t,r)=>{let s=$d(t,n.loadClass?.(t.name),t===i);ye.set(t.name,s.overrides);let c=s.module,l=_.length,u=new Map([...wg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:Do,errors:[],warnings:[]},te=[f],ne=t=>t.forEach((t,n)=>{let r=h.get(n);if(!r){u.set(n,t),h.set(n,t);return}if(!r.range||!t.range||e.B(r.range)===e.B(t.range))return;let i=e.B(t.range),a=e.B(r.range);M_(r.kind)===M_(t.kind)?f.warnings.push({location:i,message:`Warning: the ${j_(r.kind)} of '${n}' conflicts with \nits ${j_(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${j_(t.kind)} of '${n}' conflicts with \nits ${j_(r.kind)} at ${a}.`})}),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Set,re=/* @__PURE__ */ new Map,ie=[],se=[...c.constants],ce=c.variables.map(e=>e.name),ue=c.variables.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:v(e);if(n){ne(n);return}let i=t??me(e,c.name);se.push(...i.constants.filter(e=>se.every(t=>t.name!==e.name))),i.variables.forEach((e,t)=>{ce.includes(e)||(ce.push(e),ue.push(i.variableLocations[t]))}),ne(i.exported),i.facts.forEach(e=>g.add(e)),i.modules.forEach((e,t)=>re.set(t,e)),ie.push(i)});let de=new Map(u),fe=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],pe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});fe.forEach(e=>h.set(e.name,pe(e)));let S=e=>({key:ge(e),arity:Ca(e),params:wa(e),kind:Oo(c,e)?`Theorem`:`Definition`,range:e.location.range}),he=se.length===0&&ce.length===0,ge=e=>c===i?e.name:`${e.name}@${r.id}`,C=/* @__PURE__ */ new Map,w=()=>new Map([...r.modules,...re]),xe=e=>{let t=c.instances.find(t=>t.module===e.name);return t!==void 0&&Sa(e.location,t.location)},Se=e=>{let t=c.modules.find(t=>t.name===e.module);return t?xe(t)?re.get(t.name):void 0:w().get(e.module)},Ce=e=>({imported:u,getInstance:e=>{let t=Se(e),n=t?void 0:v(e.module);if(n)return{declarations:[],symbols:b(e,n),instancer:c.name};let r=t??me(e.module,c.name),i=D_(r);return{declarations:i,symbols:x(e,r.exported,i,e=>e),instancer:c.name}},bound:de,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:ge,instanced:C,facts:g,reports:te,warnings:r.warnings}),we=e=>[...fe.filter(t=>Sa(t.location,e)).map(e=>[e.name,pe(e)]),...c.definitions.filter(t=>Sa(t.location,e)).map(e=>[e.name,S(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(u)),Te=e=>{let t=w(),n=t.get(e.name),i=n&&A_(e,n.module);if(n&&!i)throw k_(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};te.push(a);let o=be(e,{id:`${r.id}/${e.name}`,symbols:we(e.location),modules:t,nested:r.nested,errors:a.errors,warnings:a.warnings,levelChecks:r.levelChecks});i&&a.errors.push(i),n||re.set(e.name,o),p.has(e.name)||p.set(e.name,o)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=y(e,c,Ce(c),he,w().get(e.module));C.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||h.set(n,t))})}})),...c.modules.map(e=>({location:e.location,link:()=>Te(e)}))].sort((e,t)=>Sa(e.location,t.location)?-1:1).forEach(e=>e.link());let Ee=t_(gs(c,(e,t)=>_e(e,t,c.name,Se(e))),ve(u));r.errors.push(...Po(Ee,Ce(Ee))),Ee.definitions.forEach(e=>{let t=ge(e);a.set(t,e),o.set(t,!he);let n=S(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!Sa(r,e.location))&&(u.set(e.name,n),e.isLocal||h.set(e.name,n))});let De={module:Ee,constants:se,variables:ce,variableLocations:ue,visible:u,exported:h,modules:re,extended:ie,facts:/* @__PURE__ */ new Set([...g,...[...Ee.theorems,...Ee.assumptions].flatMap(e=>e.name??[])])};m.has(c.name)||m.set(c.name,De);let Oe=_.splice(l).map(e=>({location:e.location,check:()=>oe(e)}));return r.levelChecks.push(()=>Xs(Ee,{constants:new Set(se.map(e=>e.name)),variables:new Set(ce),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>le.get(u.get(e)?.key??e)},Oe,ae)),ee.push(De),De},C=pe(i).linked;ae.length>0&&!n.isSanyReported&&n.print(e.V(ae));let w=e=>C.visible.get(e)?.key??e;C.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)});let xe=[],Se=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Se(e,t)),xe.push(...e.module.assumptions))};Se(C,/* @__PURE__ */ new Set);let Ce=C.constants.map(e=>e.name),we=C.variables,Te=e=>e.module===void 0?[e.name,w(e.name)]:e.module===i.name||Ce.includes(e.name)?[]:[(f.get(e.module)??p.get(e.module))?.visible.get(e.name)?.key??e.name],Ee=e=>{let t=a.get(e);return t?.kind===`Operator`?t.params.length:C.constants.find(t=>t.name===e)?.arity??0},De=/* @__PURE__ */ new Map,Oe=/* @__PURE__ */ new Set,ke=(e,t)=>{l.set(e,t),a.delete(e),De.delete(e),Oe.add(e)};t.constants.filter(e=>e.args===void 0).forEach(e=>{let t=E_(e.value);un(t),Te(e).forEach(e=>{let n=Ee(e);n===0?De.set(e,t):ke(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ae=/* @__PURE__ */ new Map;t.constants.forEach(t=>{if(t.args===void 0)return;let n=`${t.module??``}!${t.name}`,r=Ae.get(n)??{name:t.name,module:t.module,rows:[]};if(r.rows.length>0&&r.rows[0][0].length!==t.args.length)throw new e.h(`The arity of the operator ${t.name} is inconsistent in the configuration file.`);r.rows.push([t.args.map(E_),E_(t.value)]),Ae.set(n,r)}),Ae.forEach(e=>Te(e).forEach(t=>ke(t,P_(e.name,Ee(t)||e.rows[0][0].length,e.rows))));let T=new Map(t.substitutions.flatMap(e=>Te(e).map(t=>[t,w(e.target)])));t.substitutions.filter(e=>e.module===void 0).forEach(n=>{let r=n.name,i=n.target;if(!Ce.includes(r)&&!C.visible.has(r))throw new e.h(`In the configuration file, the identifier ${r} does not appear in the specification.`);if(t.substitutions.some(e=>e.name===i))throw new e.h(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let o=w(i),s=a.get(o);if(!(s!==void 0||l.has(o)||De.has(o)||Ce.includes(i)||we.includes(i)))throw new e.h(`The configuration file substitutes for ${r} with the undefined identifier ${i}.`);if(s?.kind===`Operator`&&s.params.length!==(C.constants.find(e=>e.name===r)?.arity??C.visible.get(r)?.arity))throw new e.h(`The configuration file substitutes for ${r} with ${i} of different number of arguments.`)});let je=new Set([...t.constants,...t.substitutions].filter(e=>e.module!==void 0).flatMap(Te)),Me=(e,t)=>{if(je.has(e))return{key:e,prefix:t};let n=s.get(e);return n&&Me(n.source,t+n.prefix)};s.forEach((e,t)=>{let n=Me(e.source,e.prefix),r=a.get(t);if(!n||!r)return;let i=r.kind===`Operator`?r.params:[],o=S(t,n.key,i,i.slice(n.prefix),r.location);a.set(t,o),C.visible.forEach((e,n)=>{e.key===t&&n!==t&&a.set(n,o)})});let Ne=Ce.filter(e=>!De.has(e)&&!T.has(e)&&!Oe.has(e));if(Ne.length>0&&!n.isUnconfigured){let t=r.getDeclarationOrder(`constant`).find(e=>Ne.includes(e))??Ne[0];throw new e.h(`The constant parameter ${t} is not assigned a value by the configuration file.`)}n.isTraceRecorded&&l.forEach((e,t)=>{let n=kg(e);n&&l.set(t,n)});let Fe=I_(we,ee.flatMap(e=>e.module.variables.map(e=>e.name))),Ie=uc({definitions:a,substitutions:T,constants:De,variableIndex:Fe,builtins:l,variables:we}),Le={runtime:d,definitions:a,builtins:l,constants:De,substitutions:T,instanceNames:ce,variables:we,variableIndex:Fe,facts:Ie,startupValues:Array.from({length:Ie.ids.size},()=>void 0),substitutedDefinitions:c,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Re=Js({constants:new Set(De.keys()),variables:/* @__PURE__ */ new Set([...we,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>l.has(e))]),getDefinition:e=>gu(e,Le)}),ze=t=>{try{H(t,{environment:Le,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e._)return t;throw t}};T.forEach((t,n)=>{let r=a.get(t),i=Ce.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&Re.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?ze(r.body):void 0;if(i){let r=Qi(i)?``:` - specifically: ${i.message}`;throw new e.h(`The configuration file substitutes constant ${n} with non-constant ${t}${r}`)}}),d.version!==`1.7.4`&&(d.isStarted=!0);let E=new Set(ee.flatMap(e=>e.module.instances.map(e=>e.module))),Be=r.createDefinitionOrder();return{environment:Le,assumptions:xe,variableLocations:C.variableLocations,instanceActions:se,startupDefinitions:ee.filter(e=>!E.has(e.module.name)||D_(e).length===0).flatMap(e=>Be(e===C?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:C.constants,rootSymbols:C.visible,javaOverrides:ee.flatMap(e=>ye.get(e.module.name)??[])}},B_={kind:`Boolean`,value:!0},V_={kind:`Boolean`,value:!1},H_=e=>e?B_:V_,U_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,W_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),G_=(e,t,n)=>({kind:e,operands:[t,n]}),K_=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?K_(e,t.operands).operands:[t])}),q_=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return q_(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,q_(t)),0)}},J_=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return J_(e.body);case`And`:case`Or`:return e.operands.some(J_)}},Y_=/* @__PURE__ */ new WeakMap,X_={count:0},Z_=e=>{let t=Y_.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${X_.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(Z_).join(`,`)})`;default:return`${e.kind}(${Z_(e.body)})`}})();return Y_.set(e,n),n},Q_=(e,t)=>e===t||Z_(e)===Z_(t),$_=(e,t)=>{let n=Z_(t);return e.some(e=>e===t||Z_(e)===n)},ev=e=>e===`And`?`Or`:`And`,tv=(e,t)=>{switch(e.kind){case`Boolean`:return t?H_(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return tv(e.body,!t);case`And`:case`Or`:return K_(t?ev(e.kind):e.kind,e.operands.map(e=>tv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,tv(e.body,t))}}},nv=e=>{switch(e.kind){case`Boolean`:return H_(!e.value);case`Not`:return e.body;case`And`:case`Or`:return K_(ev(e.kind),e.operands.map(nv));case`Always`:return $(`Eventually`,nv(e.body));case`Eventually`:return $(`Always`,nv(e.body));default:return $(`Not`,e)}},rv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=rv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return H_(t)}return n.length===0?H_(!t):n.length===1?n[0]:K_(e.kind,n)}case`Not`:{let t=rv(e.body);return t.kind===`Boolean`?H_(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=rv(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},iv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,av=t=>{switch(t.kind){case`And`:{let n=[],r={value:1};for(let i of t.operands){let t=av(i);if(t.kind===`And`)n.push(...t.operands);else{if(t.kind===`Or`&&(r.value*=t.operands.length,r.value>2147483647))throw new e._(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);n.push(t)}}if(r.value===1)return{kind:`And`,operands:n};let i=Array.from({length:r.value},()=>[]),a={groups:1,repeat:r.value};for(let e of n){if(e.kind!==`Or`){i.forEach(t=>t.push(e));continue}a.repeat/=e.operands.length;let t={value:0};for(let n=0;n<a.groups;n++)for(let n of e.operands)for(let e=0;e<a.repeat;e++)i[t.value++].push(n);a.groups*=e.operands.length}return{kind:`Or`,operands:i.map(e=>K_(`And`,e))}}case`Or`:{let e=[],n=[];for(let r of t.operands){let t=av(r);for(let r of t.kind===`Or`?t.operands:[t]){let t=iv(r);t?e.push(t):n.push(r)}}if(e.length>0){let t=e.length===1?e[0]:K_(`Or`,e);n.push($(`Always`,$(`Eventually`,t)))}return K_(`Or`,n)}case`Not`:return U_(t.body)?t:av(nv(t.body));default:return t}},ov=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?ov(e.operands[0]):K_(e.kind,e.operands.map(ov));case`Not`:return e.body.kind===`Not`?ov(e.body.body):$(`Not`,ov(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,ov(e.body));default:return e}},sv=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return sv(e.operands[0]);let t=Math.floor(e.operands.length/2);return G_(e.kind,sv(K_(e.kind,e.operands.slice(0,t))),sv(K_(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,sv(e.body));default:return e}},cv=(e,t)=>{e.kind===`Eventually`&&!$_(t,e)&&t.push(e),`body`in e&&cv(e.body,t),`operands`in e&&e.operands.forEach(e=>cv(e,t))},lv=e=>{let t=e.filter(W_),n=e.flatMap(e=>e.kind===`Not`&&W_(e.body)?[e.body]:[]);return!t.some(e=>$_(n,e))},uv=t=>{let n=[...t],r=[];for(;n.length>0;){let t=n.pop();if(!t)break;switch(t.kind){case`Not`:n.push(t.body);break;case`Next`:r.push(t),n.push(t.body);break;case`Always`:case`Eventually`:r.push(t,$(`Next`,t)),n.push(t.body);break;case`And`:case`Or`:n.push(...t.operands),r.push(t);break;case`Action`:throw new e._(`TLC encountered actions while constructing the tableau`);default:r.push(t)}}return r},dv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:$(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},fv=(e,t,n)=>e.flatMap(e=>{let r=dv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),pv=e=>[...new Set(e.map(Z_))].sort().join(`|`),mv=(e,t)=>{let n=new Set(t.map(pv));return[...e.filter(e=>!n.has(pv(e))),...t]},hv=e=>{let t=uv(e),n=fv(t,`Always`,`And`),r=fv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=dv(t,`Eventually`,`Or`);if(n&&!($_(e,n.first)||$_(e,n.second)))return mv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>($_(e,t.first)||$_(e,t.second))&&!$_(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!lv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=dv(t[e],`Always`,`And`);n&&($_(t,n.first)||t.push(n.first),$_(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)$_(t,e.first)&&$_(t,e.second)&&!$_(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!lv(t)?[]:i(t)};return a(e)},gv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>q_(e)<=1)}),_v=e=>{let t=hv([e]).map(gv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=pv(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of hv(n)){let n=pv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(gv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},vv=(e,t)=>!$_(e,t)||$_(e,t.body),yv=(t,n)=>{if(t.kind===`Eventually`&&t.body.kind===`Always`&&q_(t.body.body)<3){n.eventuallyAlways.push(t.body.body);return}let r=iv(t);if(r){let e=q_(r);if(e<=1){n.infinitelyOftenStates.push(r);return}if(e===2){n.infinitelyOftenActions.push(r);return}}if(J_(t))throw new e._(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);n.formulas.push(t)},bv=(e,t)=>{let n=e.findIndex(e=>Q_(e,t));return n===-1?(e.push(t),e.length-1):n},xv=e=>{let t=av(rv(tv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=ov(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])yv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:K_(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Q_(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&sv(e.formula),n=[];t&&cv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>bv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>bv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>bv(i,e))}));return{tableau:t&&_v(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Sv=()=>e.q(new e._(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.G.livenessEvaluationFailure),Cv=/* @__PURE__ */ new Set([`~>`,`-+->`]),wv=/* @__PURE__ */ new WeakSet,Tv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Ev=(t,n)=>new e._(`TLC cannot handle the temporal formula ${B(t)}${n===void 0?``:`:\n${n}`}`),Dv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=lu(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return r.isReleased?0:Dv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?Dv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=gu(e,n);if(t)return gc(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isStateLevel&&!r.isLevelConstant?1:0},o=(e,t)=>r.has(e)?0:T(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Ho(e,(e,a)=>(i.value=Math.max(i.value,Dv(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return Cv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Ov=(t,n)=>{try{return Tu(t,n)}catch(t){if(!(t instanceof e._))throw t;if(!Qi(t))return;throw e.q(new e._(`${e.P}${t.message}`),e.G.error)}},kv=(t,n,r,i,a=/* @__PURE__ */ new Set,o=!1,s)=>{let c=(e,t,n=s,c=a,l)=>kv(e,t,r,i,c,o||l!==void 0&&r.substitutedDefinitions.has(l),n);if(t.kind===`And`)return t.operands.flatMap(e=>c(e,n,B(e)));if(t.kind===`Label`)return c(t.body,n);if(t.kind===`Let`)return c(t.body,Av(t,n,r));if(t.kind===`Identifier`){let i=T(t)?lu(n,t.name):void 0;if(i?.kind===`Thunk`&&!i.isReleased)return c(i.expression,i.scope);let o=r.constants.has(t.name)?void 0:gu(t.name,r);if(!i&&o?.kind===`Operator`&&o.params.length===0&&gc(o,r)>0){if(a.has(o))throw e.z();return c(o.body,void 0,o.name,/* @__PURE__ */ new Set([...a,o]),o)}}let l=Tv(r,n);if(t.kind===`Apply`&&r.runtime.version!==`1.7.4`&&(i||Dv(t,n,r)===3)){let e=qu(t,l),n=T(t)?void 0:gu(t.operator,r);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive&&!o)return c(e.body,ad(e,t.args,l),t.operator,a,n)}let u=i&&t.kind===`Forall`&&t.bounds.every(e=>Dv(e.set,n,r)===0),d=u?Ov(t.bounds,l):void 0;if(u&&d){let e=[];if(Eu(t.bounds,d,n,n=>(e.push(...c(t.body,n,B(t.body))),!1)),e.length===0)throw Sv();return e}return[{expression:t,scope:n,name:s}]},Av=(e,t,n)=>{let r=ld(e.definitions,Tv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&wv.add(e.binding);return r},jv=(t,n,r)=>{let i=r.runtime.version===`1.7.4`,a=(t,n,a)=>{let o=a===0&&!i?Dv(t,n,r):a;if(o===0){let i=H(t,Tv(r,n));if(typeof i!=`boolean`)throw new e._(`TLC expected a boolean value, but did not find one. ${Zl(t)}`);return H_(i)}return o===1?{kind:`State`,expression:t,scope:n}:{kind:`Action`,expression:t,unchanged:void 0,scope:n}},o={depth:0},s=(t,n,r,i)=>{if(o.depth>=100)throw e.z();o.depth++;let s=p(t,n);o.depth--;let c=q_(s);return c>2?s:a(r,i,c)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,a=Tv(r,t),o=T(e)||gu(n,r)===void 0?lu(t,n):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&wv.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:T(e)?Ju(n,a):Ku(n,r);if(c?.kind!==`Closure`)throw Ev(e);let u=e.kind===`Apply`?e.args:[],d=!T(e)&&gu(n,r)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>H(e,a)),s(c.body,ad(c,u,a),e,t)),d)},l=(t,n,r=!1)=>{try{return n()}catch(n){let a=n instanceof e.D||r&&!i;throw!(n instanceof e._)||a?n:Ev(t)}},u=(t,n)=>{let i=Dv(t,n,r);if(!t.bounds.every(e=>Dv(e.set,n,r)===0)){if(i<=2)return a(t,n,i);throw Ev(t)}let o=[],s=t.kind===`Forall`;try{Du(t.bounds,Tv(r,n),e=>(o.push(p(t.body,e)),!1))}catch(r){if(!(r instanceof e._)||r instanceof e.D)throw r;if(i<=2)return a(t,n,i);throw Ev(t,s&&!Qi(r)?r.message:void 0)}return o.length===0?H_(s):d(t,n,K_(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=q_(n);return r>2?n:a(e,t,r)},f=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!T(e)||e.operator===`=>`),p=(e,t)=>{let n=Dv(e,t,r);if(n<=2&&!f(e))return a(e,t,n);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,Av(e,t,r));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,G_(`Or`,$(`Not`,p(n[0],t)),$(`Eventually`,p(n[1],t)))):e.operator===`~`&&!T(e)?d(e,t,$(`Not`,p(n[0],t))):e.operator===`=>`?d(e,t,G_(`Or`,$(`Not`,p(n[0],t)),p(n[1],t))):c(e,t)}case`And`:case`Or`:return d(e,t,K_(e.kind,e.operands.map(e=>p(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&Dv(e.condition,t,r)===0){let n=H(e.condition,Tv(r,t));if(typeof n==`boolean`)return p(n?e.consequent:e.alternative,t)}let n=p(e.condition,t);return d(e,t,G_(`Or`,G_(`And`,n,p(e.consequent,t)),G_(`And`,$(`Not`,n),p(e.alternative,t))))}case`Always`:case`Eventually`:return $(e.kind,p(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=$(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?$(`Always`,$(`Eventually`,G_(`Or`,i,a))):G_(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw Ev(e)}};return p(t,n)},Mv=(t,n,r,i,a)=>{let o=e=>Mv(e,n,r,i,a);switch(t.kind){case`Boolean`:return t.value;case`State`:case`Enabled`:{let e=a.get(t);if(e!==void 0)return e;let r={environment:i,scope:t.scope,state:n,next:void 0},o=t.kind===`State`?hu(H(t.expression,r),`a temporal property predicate`):Bl(t.step,r);return a.set(t,o),o}case`Action`:{if(t.enabled&&a.get(t.enabled)===!1)return!1;let e={environment:i,scope:t.scope,state:n,next:r};return t.unchanged&&hu(H(t.unchanged,e),`a subscript`)?!1:hu(H(t.expression,e),`an action predicate`)}case`Not`:return!o(t.body);case`And`:return t.operands.every(o);case`Or`:return t.operands.some(o);case`Next`:return Mv(t.body,r??n,void 0,i,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new e._(`TLC cannot evaluate a temporal formula in a single step`)}},Nv=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>Nv(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return Mv(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Pv=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),Fv=(e,t)=>{let n=/* @__PURE__ */ new Map;return(/* @__PURE__ */ new Set([...e.keys(),...t.keys()])).forEach(r=>{let i=e.get(r),a=i?t.get(i.name)??i:t.get(r);a&&a.name!==r&&n.set(r,a)}),n},Iv=t=>e.q(new e._(`${e.F}${t}`),e.G.error),Lv=e=>{let t=P(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!k(e)||!k(i))throw Iv(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},Rv=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(Rv);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},zv=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,Bv=(t,n,r)=>{let i=n.definitions.get(t);if(i===void 0&&!n.constants.has(t))throw new e.h(`The symmetry function ${t} specified in the configuration file\nis not defined in the specification.`);if(i?.kind!==`Operator`||i.params.length>0)throw Iv(`The symmetry function ${t} must specify a set of permutations.`);let a=e=>H(e,{environment:n,scope:void 0,state:void 0,next:void 0}),o=a(i.body);if(!D(o)||!j(o))throw Iv(`The symmetry operator must specify a set of functions.`);let s=M(o).elements;if(!s.every(O))throw Iv(`The symmetry values must be function records.`);let c=s.map(Lv),l=i.body.kind===`Apply`?i.body.args:[],u=new Map(r.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),d=e=>{if(e.length===0)return;let t=e.map(e=>{let t=Rv(zv(e)?e.args[0]:e);return u.get(t)??t}),r=e.length>1;n.runtime.warn(Hi.symmetrySetTooSmall,`The set${r?`s`:``} ${t.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(l.length>=s.length){d(l);return}let f=/* @__PURE__ */ new Map;c.forEach(e=>{e.size>0&&f.set(Pv(e),e)});let p=[...f.values()],m={start:0};for(;m.start<f.size;){let e=[...f.values()],t=e.length;p.forEach(n=>e.slice(m.start,t).forEach(e=>{let t=Fv(n,e),r=Pv(t);t.size>0&&!f.has(r)&&f.set(r,t)})),m.start=t}let ee=new Set([...f.values()].flatMap(e=>[...e.values()].map(e=>e.name))),te=new Set(r.map(e=>e.name));if(d(l.filter(e=>{if(!zv(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||te.has(t.name))return!1;let n=a(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>k(e)&&ee.has(e.name))})),f.size!==0)return[...f.values()]},Vv=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=Uv(r,t);if(i===r)continue;let a=e.slice(0,n);a.push(i);for(let r=n+1;r<e.length;r++)a.push(Uv(e[r],t));return a}},Hv=(e,t)=>{let n=[],r=[];for(let i of e){let e=Uv(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(gt);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(gt(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},Uv=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=Hv(e.elements,t);return n?yt(n):e}if(n===`Function`||n===`LazyFunction`&&j(e.domain)){let n=P(e),r=Vv(n.domain,t),i=Vv(n.range,t)??n.range;if(r){let e=yn(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?bt(n.domain,e.range):e}return i===n.range?n:bt(n.domain,i)}if(n===`Interval`||!D(e)||!j(e))return e;let r=M(e),i=Vv(r.elements,t);return i?pn(i):r},Wv=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=Uv(e[o],i),a===0&&(a=gt(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},Gv={line:0,column:0},Kv=e=>({kind:`Identifier`,name:e,location:Gv}),qv=/* @__PURE__ */ new Set([`name`,`property`]),Jv=(t,n,r)=>{let i=gu(n,r);if(!i)throw new e.h(`The ${t} ${n} specified in the configuration file\nis not defined in the specification.`);if(i.kind===`Operator`&&i.params.length>0)throw new e.h(qv.has(t)?`TLC requires ${n} not to take any argument.`:`TLC requires ${t} not to take any argument, but one was given: ${n}`);return i},Yv=(t,n,r)=>{if(pc(n,r)&&n.body.kind!==`Number`&&n.body.kind!==`String`)try{return H(Kv(t),_y(r,void 0,void 0))}catch(t){if(t instanceof e._||e.W(t))return;throw t}},Xv=(t,n,r)=>{let i=Jv(t,n,r);if(Yv(n,i,r)!==void 0)throw new e.h(`The ${t} ${n} cannot be a constant.`);return i},Zv=(t,n,r)=>{let i=r.constants.has(n)?void 0:Jv(t,n,r),a=i?Yv(n,i,r):r.constants.get(n);if(a!==void 0&&a!==!0)throw new e.h(`The ${t} of ${n} is equal to ${F(a)}`);return a===void 0?i:void 0},Qv=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},$v=(e,t,n)=>{let r=e.environment,i=/* @__PURE__ */ new Set;r.runtime.warn=(e,t)=>{i.has(t)||(i.add(t),n?.({kind:`warning`,code:e,text:t}))},n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),Uu(e.startupDefinitions,r),t.invariants.forEach(e=>{Zv(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},ey=(t,n)=>{let r=Js({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>gu(e,n)});return t.flatMap(t=>{let i=Zv(`invariant`,t,n);if(!i)return[];let a=r.analyzeDefinition(i,/* @__PURE__ */ new Map);if(a.level>=2){let n=a.params.size===0?``:`
|
|
1780
|
+
`]]),Of=(e=`master`)=>e===`1.7.4`?Df:Ef,kf=(e,t)=>e.every(e=>hi(e,t)),Af=_r([!1,!0]);fr(Af);const jf=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Sr(jf(e,t,r),jf(e,r,n))},Mf=[`\\cup`,`\\cap`,`\\`],Nf=e=>typeof e==`object`&&e.kind===`MixedSet`,Pf=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,Ff=(e,t,n)=>{t.kind===`Interval`&&ai(t);let r=t.kind===`Interval`?t:dr(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return kt(r,e=>{hi(e,n)===i&&Dt(a,e)}),Pf(t)?Sn(a):vr(a)}if(F(t))return n;if(!At(n))return An({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return kt(r,e=>Dt(i,e)),kt(n.kind===`Interval`?n:P(n).elements,e=>{hi(e,t)||Dt(i,e)}),vr(i)},If=(e,t)=>{let n=(t,n)=>Do([Xo(t,n,e)()],0,e);return{...z(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},Lf=[ko(`TRUE`,!0),ko(`FALSE`,!1),ko(`BOOLEAN`,Af),ko(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Mo(`=`,mr),Mo(`#`,(e,t)=>!mr(e,t)),z(`~`,1,e=>!Do(e,0,`~`)),z(`<=>`,2,e=>Do(e,0,`<=>`)===Do(e,1,`<=>`)),If(`/\\`,(e,t)=>e&&t()),If(`\\/`,(e,t)=>e||t()),If(`=>`,(e,t)=>!e||t()),z(`\\in`,2,e=>hi(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!hi(R(e,0,`\\notin`),R(e,1,`\\notin`))),Mo(`\\subseteq`,(t,n)=>{if(!j(t))throw new e.b(`\\subseteq expects a set but received ${L(t)}`);if(typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&N(t.base))return kf(P(t.base).elements,n.base);if(typeof t==`object`&&t.kind===`Interval`){if(typeof n==`object`&&n.kind===`Interval`&&n.low<=t.low&&n.high>=t.high)return!0;for(let e=t.low;e<=t.high;e++)if(!hi(e,n))return!1;return!0}return!Zr(t,e=>!hi(e,n))}),...Mf.map(t=>z(t,2,n=>{let r=R(n,0,t),i=R(n,1,t),a=t!==`\\cup`&&typeof i==`object`&&i.kind===`Interval`&&typeof r==`object`&&r.kind!==`Interval`;if(At(r)&&At(i)&&!Nf(r)&&!Nf(i)&&!a&&!Ot(r)&&!Ot(i)){if(t===`\\cup`&&F(r))return i;let n=t===`\\cup`?Sr:t===`\\cap`?xr:br;return pi((r,i)=>{let a=P(r),o=P(i),s=n(a,o);if(t===`\\cup`){let t=dr(a),n=br(o,a).elements,r=t===a.elements&&(n.length===0||gn(t[t.length-1],n[0])<0);if(t.length+n.length>Tt())throw new e.N(Et());if(r&&!a.isNormalized)return s;let i=s===a?xn(s.elements):s;return r||(i.writtenElements=[...t,...n]),i}return s===r||(s.isNormalized=Pf(r),a.writtenElements&&!a.isNormalized&&(s.writtenElements=a.writtenElements.filter(e=>hi(e,s)))),s},(e,n)=>Ff(t,e,n),r,i)}return At(r)?Ff(t,r,i):t!==`\\`&&At(i)?Ff(t,i,r):An({kind:`SetOperation`,operator:t,left:r,right:i})})),z(`SUBSET`,1,e=>({kind:`Subset`,base:R(e,0,`SUBSET`)})),z(`UNION`,1,e=>{let t=R(e,0,`UNION`),n=Mt(t)?dr(t):[],r=n.filter(Mt);if(!Mt(t)||r.length!==n.length)return An({kind:`Union`,base:t});let i=r.flatMap(dr),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{hi(t,e)||Dt(e.elements,t)}),vr(e.elements)};return Nf(t)||r.some(Nf)?a():r.length===0?yr:pi(e=>li(jf(e,0,e.length),i),a,r.map(P),void 0)}),z(`DOMAIN`,1,t=>{let n=R(t,0,`DOMAIN`);if(!jt(n))throw new e.b(`DOMAIN expects a function but received ${L(n)}`);return Pi(n)})],Rf=Go(`Integers`,`Neg`,`IntValue`,1),zf=t=>{let n=Go(t,`DotDot`,`IntervalValue`,2);return[Ko(t,`+`,`Plus`,(e,t)=>e+t),Ko(t,`-`,`Minus`,(e,t)=>e-t),Ko(t,`*`,`Times`,(e,t)=>e*t),Ko(t,`^`,`Expt`,(t,n)=>{if(n<0)throw new e.O(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(t===0&&n===0)throw new e.O(`0^0 is undefined.`);return t**n}),Ko(t,`\\div`,`Divide`,(t,n)=>{if(n===0)throw new e.O(`The second argument of \\div is 0.`);let r=Math.floor(t/n);if(No(r))throw Po(`${t} \\div ${n}`);return r}),Ko(t,`%`,`Mod`,(t,n)=>{if(n<=0)throw new e.O(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(t%n+n)%n}),z(`..`,2,e=>{let t=R(e,0,`..`),r=Wo(R(e,1,`..`),n);return{kind:`Interval`,low:Wo(t,n),high:r}})]},Bf=zf(`Naturals`),Vf=zf(`Integers`),Hf=e=>{let t=Bf.indexOf(e);return t===-1?void 0:Vf[t]},Uf=e=>{let t=(t,n=`tlc2.value.IBoolValue`)=>`public static ${n} tlc2.module.${e}.${t}(tlc2.value.impl.Value,tlc2.value.impl.Value)`,n=e===`Integers`;return[Uo(Jo(`<`,(e,t)=>e<t),t(`LT`)),Uo(Jo(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),Uo(Jo(`<=`,(e,t)=>e<=t),t(`LE`)),Uo(Jo(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},Wf=[ko(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Bf,...Uf(`Naturals`)],Gf=[ko(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Vf,...Uf(`Integers`),z(`-.`,1,e=>{let t=Wo(R(e,0,`-`),Rf);if(No(-t))throw Po(`-${t}`);return-t})],Kf=(t,n,r)=>{let i=R(t,n,r),a=ui(i);if(!a)throw new e.O(`${r}\n${L(i)}`);return a},qf=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:Kf(e,t,n)},Jf=(e,t,n)=>{let r=R(e,t,`SubSeq`);if(typeof r!=`number`)throw wo(n,`SubSeq`,`natural number`,r);return r},Yf=(e,t,n)=>typeof e==`string`?on(e.slice(t,n)):Pr(e.slice(t,n)),Xf=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Zf=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Qf=(e,t)=>{let n=wf.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Uo(e,t):e}):t},$f=t=>Qf(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>qf(e,0,Xf(``,`Len`)).length),z(`\\o`,2,t=>{let n=qf(t,0,Zf(`s \\o t`,`sequence`));if(typeof n!=`string`){let e=Kf(t,1,Zf(`t \\o s`,`sequence`));return Pr([...n,...e])}let r=R(t,1,`\\o`);if(typeof r!=`string`)throw new e.O(`${Zf(`t \\o s`,`string`)}\n${L(r)}`);return on(n+r)}),z(`Append`,2,e=>Pr([...Kf(e,0,Zf(t===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(e,1,`Append`)])),z(`Head`,1,t=>{let n=Kf(t,0,Xf(``,`Head`));if(n.length===0)throw new e.O(`Attempted to apply Head to the empty sequence.`);return n[0]}),z(`Tail`,1,t=>{let n=qf(t,0,Xf(``,`Tail`));if(n.length===0)throw new e.O(`Attempted to apply Tail to the empty sequence.`);return Yf(n,1)}),z(`SubSeq`,3,t=>{let n=qf(t,0,Xf(`first `,`SubSeq`)),r=Jf(t,1,`second`),i=Jf(t,2,`third`);if(r>i)return Yf(n,0,0);let a=r<1||r>n.length?{position:`second`,value:r}:i>n.length?{position:`third`,value:i}:void 0;if(a)throw new e.O(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${L(R(t,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return Yf(n,r-1,i)}),Ao(`SelectSeq`,2,t=>{let n=Oo(t,1,`SelectSeq`);return Pr(Kf(t,0,Xf(`first `,`SelectSeq`)).filter(t=>{let r=n.call([t]);if(typeof r!=`boolean`)throw new e.O(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${n.name}>`);return r}))})]),ep=t=>Qf(`FiniteSets`,[z(`IsFiniteSet`,1,t=>{let n=R(t,0,`IsFiniteSet`);if(j(n))return si(n);if(typeof n==`object`&&n.kind===`Function`)return!0;throw new e.b(typeof n==`object`&&n.kind===`LazyFunction`?`Attempted to check if the function:\n${L(n)}\nis a finite set.`:`Attempted to check if the ${Nt(n)} ${L(n)} is a finite set.`)}),z(`Cardinality`,1,n=>{let r=R(n,0,`Cardinality`);if(!j(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new e.O(`Attempted to compute cardinality of the value\n${L(r)}`);return ai(r,t)})]),tp=[Uo(z(`Warshall`,1,t=>{let n=R(t,0,`Warshall`);if(!j(n)||ln(n))throw new e.O(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${L(n)}`);ai(n);let r=[],i=/* @__PURE__ */ new Map,a=e=>{let t=$i(e),n=i.get(t)??r.length;return n===r.length&&(i.set(t,n),r.push(e)),n},o=P(n).elements.map(t=>{let n=ui(t);if(n?.length!==2)throw new e.O(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${L(t)}`);return[a(n[0]),a(n[1])]}),s=r.map(()=>r.map(()=>!1));o.forEach(e=>{s[e[0]][e[1]]=!0});for(let e=0;e<r.length;e++)for(let t=0;t<r.length;t++)if(s[t][e])for(let n=0;n<r.length;n++)s[e][n]&&(s[t][n]=!0);return vr(r.flatMap((e,t)=>r.flatMap((n,r)=>s[t][r]?[Pr([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],np=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return tp;if(e===`AnySet`)return[ko(`ANY`,pn)];if(e===`IOUtils`)return pd(r,a);if(e===`_TLCTrace`)return gd(r);if(!Of(n.version).has(e))return;let o=ip(e,t,n,r,i)?.operators;return e===`Randomization`&&o?[...o,Hd(n)]:o},rp=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),ip=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:Wf};case`Integers`:return{extends:[`Naturals`],operators:Gf};case`Sequences`:return{extends:[],operators:$f(n.version)};case`FiniteSets`:return{extends:[],operators:ep(n.version)};case`TLC`:return{extends:[],operators:Qf(`TLC`,_f(t,n))};case`Randomization`:return{extends:[],operators:Ud(n)};case`_Possible`:return{extends:[],operators:rf(t,n)};case`Json`:return{extends:[],operators:fd(r)};case`Bags`:return{extends:[],operators:Qf(`Bags`,Ru(i))};case`TLCExt`:return{extends:[],operators:Qf(`TLCExt`,nf(t,n))};default:return}},ap=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&Lc.get(t)||[];r.expressions.push(...i,t);let a=fi.sets,o=a??[],s=o.length;fi.sets=o;try{return n()}catch(e){throw Ng(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,fi.sets=a}},op=(e,t,n)=>e.coverage?no(e.coverage,t,n):-1,sp=(e,t,n)=>e.coverage?io(e.coverage,t,n):n(),cp=(e,t,n,r)=>sp(e,t,()=>W(n,r)),lp=(e,t,n,r)=>{let i=cp(e,t,n,r),a=e.coverage;if(a?.covered.has(n))for(let e=t;e!==-1;e=a.prefixes[e])a.primary[e]--;return i},up=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},dp=e=>!e.includes(void 0),fp=e=>e.variables.map(()=>void 0),pp=(e,t,n)=>{let r=[...e];return r[t]=n,r},mp=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},hp=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,gp=e=>e.kind===`Identifier`?e.name:void 0,_p=(e,t,n)=>{if(t.kind===`Label`)return _p(e,t.body,n);let r=gp(t);if(r===void 0)return;let i=_h(n,r);if(i?.kind===`Thunk`)return _p(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=sg(r,e);return o?.kind===`Closure`&&o.params.length===0?_p(e,o.body,o.scope):void 0},vp=(e,t,n)=>{if(t.kind===`Prime`)return _p(e,t.expression,n);if(t.kind===`Label`)return vp(e,t.body,n);let r=gp(t);if(r===void 0)return;let i=_h(n,r);if(i?.kind===`Thunk`)return vp(e,i.expression,i.scope);if(i)return;let a=sg(r,e);return a?.kind===`Closure`&&a.params.length===0?vp(e,a.body,a.scope):void 0},yp=t=>{if(typeof t!=`boolean`)throw new e.b(`TLC expected a boolean expression.`);return t},bp=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),xp=(e,t,n,r)=>{let i=Cp(e,t,n,r);return i&&e.coverage&&!e.isInit&&ro(e.coverage,r),i},Sp=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(ro(r,n),ro(r,r.roots[n])),e.onState(t),!0},Cp=(e,t,n,r)=>t===void 0?dp(n)?Sp(e,n,r):(e.onIncomplete?.(n),!1):dp(n)&&bp(e)?Tp(e,t,n,r):t.kind===`Predicate`?Ep(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?Hp(e,t.expression,t.rest,t.scope,n,t.node):wp(e,t,n)&&xp(e,t.rest,n,t.node),wp=(e,t,n)=>{let r=e.environment,i=cp(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return cp(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?gh(t,r.runtime.version):t}})();try{return!mr(i,a)}catch(t){throw e.callStack&&Ng(e.callStack,[i],t),t}},Tp=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return Hp(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?wp(e,i,n):yp(cp(e,i.node,i.expression,up(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return Sp(e,n,r)},Ep=(e,t,n,r,i,a)=>Dp(e,t,n,r,i,op(e,a,t)),Dp=(t,n,r,i,a,o)=>ap(t,n,()=>{switch(n.kind){case`Let`:{let e=up(t,i,a),s=n.definitions,c=t.coverage?wg(s,e,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):wg(s,e);return Ep(t,n.body,r,c,a,o)}case`Label`:return Ep(t,n.body,r,i,a,o);default:if(Ip.has(n.kind))throw new e.b(`The state relation is not a boolean expression.`);return ap(t,n,()=>Bp(t,n,r,i,a,o))}}),Op=(e,t,n,r,i)=>yp(t)&&xp(e,n,r,i),kp=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),Ap=(e,t,n,r,i,a)=>{let o=up(e,r,i);if(t.kind===`Identifier`){let s=_h(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return Ep(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return Ep(e,s.operator.body,n,s.operator.scope,i,a);let c=s?void 0:e.environment.definitions.get(t.name),l=s?void 0:sg(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&gu(c,e.environment))?Ep(e,l.body,n,l.scope,i,a):Op(e,lp(e,a,t,o),n,i,a)}let s=cg(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=sp(e,a,()=>bg(s,t.args,o));return Ep(e,s.body,n,r,i,a)}let c=kp.has(t.operator)?cp(e,a,t,o):lp(e,a,t,o);return Op(e,c,n,i,a)},jp=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?xp(e,t,pp(n,r,i),a):mr(o,i)&&xp(e,t,n,a)},Mp=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),Np=(e,t,n)=>(e.coverage&&ao(e.coverage,t,n.length+1),n),Pp=(t,n,r,i,a,o)=>{let[s,c]=n.args,l=t.isInit?_p(t.environment,s,i):vp(t.environment,s,i),u=up(t,i,a);if(l===void 0)return cp(t,o,n,u)===!0&&xp(t,r,a,o);let d=cp(t,o,c,u),f=a[l];if(n.operator===`=`)return jp(t,r,a,l,d,o);let p=n.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(typeof p==`object`&&p!==d&&t.callStack?.sources.set(p,c),f!==void 0)return cp(t,o,n,u)===!0&&xp(t,r,a,o);if(!Lr(p))throw new e.b(`The right side of \\IN is not enumerable.`);return Np(t,p,Qr(p)).reduce((e,n)=>xp(t,r,pp(a,l,n),o)||e,!1)},Fp=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Ip=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Lp={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},Rp=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:Lp[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${H(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${H(e)}`:`In computing ENABLED, TLC encountered unbounded quantifier. Make sure that the expression is of form ${e.quantifier===`Forall`?`\\A`:`\\E`} x \\in S: P(x).\n${H(e)}`;if(e.kind===`Choose`&&e.set===void 0)return`In computing ENABLED, TLC encountered unbounded CHOOSE. Make sure that the expression is of form CHOOSE x \\in S: P(x).\n${H(e)}`},zp=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=sp(e,r,()=>Lh(t.bounds,t=>{let r=W(t,n),i=Ph(r,t,a);return Array.isArray(i)&&Np(e,r,i),i}));return zh(t.bounds,o,n.scope,e=>(i.push(e),!1)),i},Bp=(t,n,r,i,a,o)=>{let s=up(t,i,a);switch(n.kind){case`Identifier`:return Ap(t,n,r,i,a,o);case`Apply`:return Fp.has(n.operator)&&n.args.length===2?Pp(t,n,r,i,a,o):n.operator===`=>`&&n.args.length===2?yp(cp(t,o,n.args[0],s))?Ep(t,n.args[1],r,i,a,o):xp(t,r,a,o):Ap(t,n,r,i,a,o);case`And`:{let e=n.operands;if(n.isBulleted||e.length===2){let n=e.slice(1).reduceRight((e,t)=>Mp(`Predicate`,t,i,o,e),r);return Ep(t,e[0],n,i,a,o)}let s=e[e.length-1];return Dp(t,mp(n,e.length-1),Mp(`Predicate`,s,i,o,r),i,a,hp(t,o))}case`Or`:{let e=n.operands;if(n.isBulleted||e.length===2)return e.reduce((e,n)=>Ep(t,n,r,i,a,o)||e,!1);let s=Dp(t,mp(n,e.length-1),r,i,a,hp(t,o)),c=Ep(t,e[e.length-1],r,i,a,o);return s||c}case`Exists`:return zp(t,n,s,o).reduce((e,i)=>Ep(t,n.body,r,i,a,o)||e,!1);case`Forall`:{let e=zp(t,n,s,o);if(e.length===0)return xp(t,r,a,o);let i=e.slice(1).reduce((e,t)=>Mp(`Predicate`,n.body,t,o,e),r);return Ep(t,n.body,i,e[0],a,o)}case`If`:return Ep(t,yp(cp(t,o,n.condition,s))?n.consequent:n.alternative,r,i,a,o);case`Case`:{let c=n.arms.find(e=>yp(cp(t,o,e.condition,s)))?.body??n.other;if(c===void 0)throw new e.b(`TLC encountered a CASE with no conditions true.`);return Ep(t,c,r,i,a,o)}case`FunctionApplication`:{let e=Gh(cp(t,o,n.function,t.isInit?s:xh(s)));if(e){let i=sp(t,o,()=>Kh(e,n,s));return Ep(t,e.body,r,i,a,o)}break}case`Unchanged`:if(!t.isInit)return Hp(t,n.expression,r,i,a,o);break;case`BoxAction`:if(!t.isInit){let e=Ep(t,n.action,r,i,a,o);return Hp(t,n.subscript,r,i,a,o)||e}break;case`AngleAction`:if(!t.isInit)return Ep(t,n.action,Mp(`Changed`,n.subscript,i,o,r),i,a,o)}let c=t.isEnabled?Rp(n):void 0;if(c!==void 0)throw new e.b(c);return Op(t,cp(t,o,n,s),r,a,o)},Vp=(e,t,n)=>e.runtime.warn(Ge.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${H(n)}`),Hp=(e,t,n,r,i,a)=>ap(e,t,()=>{let o=op(e,a,t),s=_p(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;let a=i[s];return a!==void 0&&!mr(a,r)?(Vp(e.environment,s,t),!1):jp(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return xp(e,n,i,o);let c=s.reduceRight((e,t)=>Mp(`Unchanged`,t,r,o,e),n);return Hp(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=_h(r,t.name);if(a?.kind===`Thunk`)return Hp(e,a.expression,n,a.scope,i,o);let s=a?void 0:sg(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return Hp(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=up(e,r,i),s=cg(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return Hp(e,s.body,n,bg(s,t.args,a),i,o)}let c=e.environment,l=cp(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=cp(e,o,t,{environment:c,scope:r,state:i,next:void 0});return mr(l,u)&&xp(e,n,i,o)}),Up=(e,t,n,r,i=!1,a)=>({environment:e,callStack:e.callStack,coverage:e.coverage,isInit:t,isEnabled:i,current:n,onState:r,onIncomplete:a}),Wp=/* @__PURE__ */ Error(`The replay found a successor`),Gp=(e,t,n,r)=>{let i=Up(r,!1,n,()=>{throw Wp},!0),a=i.callStack,o=a?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Mp(`Changed`,e.subscript,t,-1,void 0);Ep(i,e.action,n,t,fp(r),-1)}else Ep(i,e,void 0,t,fp(r),-1);return!1}catch(e){if(e!==Wp)throw e;return a&&(a.expressions.length=o,a.isFrozen=!1),!0}},Kp=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=Up(t,!0,void 0,n,!1,r),s=a.reduceRight((e,t)=>Mp(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);Ep(o,i.expression,s,i.scope,fp(t),i.node??-1)},qp=(e,t,n,r)=>{e.some(e=>Ip.has(e.expression.kind))||e.forEach(e=>{let i=[];Jp(e,-1,t,n,e=>i.push(e)),i.forEach(t=>r(t,e))})},Jp=(e,t,n,r,i,a)=>{let o=Up(r,!1,n,i,!1,a);Ep(o,e.expression,void 0,e.scope,fp(r),t)},Yp=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(_p(t,e,void 0)!==void 0&&e.kind===`Identifier`){n.push(e);return}if(e.kind===`Tuple`){e.elements.forEach(e=>i(e,r));return}if(e.kind!==`Identifier`)return;let a=_h(r,e.name)?void 0:sg(e.name,t);a?.kind===`Closure`&&a.params.length===0&&i(a.body,a.scope)},a=(e,o,s)=>{switch(e.kind){case`Let`:a(e.body,wg(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`FunctionApplication`:a(e.function,o,s);return;case`If`:a(e.consequent,o,s),a(e.alternative,o,s);return;case`Case`:e.arms.forEach(e=>a(e.body,o,s)),e.other&&a(e.other,o,s);return;case`And`:case`Or`:e.operands.forEach(e=>a(e,o,s));return;case`Exists`:case`Forall`:a(e.body,o,s);return;case`Unchanged`:i(e.expression,o);return;case`AngleAction`:a(e.action,o,s);return;case`BoxAction`:a(e.action,o,s),n.push(e.subscript);return;case`Identifier`:case`Apply`:{if(e.kind===`Apply`){if(e.operator===`=>`){e.args.forEach(e=>a(e,o,s));return}if(e.operator===`=`||e.operator===`\\in`){vp(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=_h(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?cg(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:sg(i,t);if(l?.kind!==`Closure`||s.has(l.body)||t.definitions.get(i)?.isRecursive)return;let u=e.kind===`Apply`?e.args:[];if(l.params.length!==u.length)return;s.add(l.body),a(l.body,bg(l,u,r(o)),s),s.delete(l.body)}}};return e.forEach(e=>a(e.expression,e.scope,/* @__PURE__ */ new Set)),n.flatMap(e=>e.location.range??[])},Xp=/* @__PURE__ */ new WeakMap,Zp=/* @__PURE__ */ new WeakMap,Qp=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},$p=(e,t,n)=>{let r=e.slice();return r[t]=n,r},em=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,tm=(t,n)=>{let r=new e.b(n);return t.isInit?r:e.it(r,e.tt.error)},nm=(e,t,n,r)=>{let i=oh(n);return r&&Ip.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${em(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},rm=(e,t,n)=>{let r=Bo(t),i=H(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${em(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
1781
|
+
`:``}${i}`},im=(e,t,n)=>sm(e,t,W(t,n)),am=new Set(Lf.map(e=>e.name)),om=e=>e.kind===`Apply`?am.has(e.operator):e.kind!==`Identifier`&&!Ip.has(e.kind),sm=(t,n,r,i=!0)=>{if(typeof r==`boolean`)return r;let a=nm(t,r,n,i);throw t.isInit&&i&&om(n)?new e.z(a):tm(t,a)},cm=(e,t,n,r)=>r.environment.callStack?W(n,r):(e[t]??=Rg(n,r.environment))(r),lm=e=>e===`=`||e===`\\in`||e===`\\subseteq`,um=(e,t,n)=>{let r=n?Xp:Zp,i=r.get(e);if(i)return i;let a=Wm(e,t,n),o=n?void 0:Um(e,t),s=o?(e,t,n,r,i,s)=>(e.generator?o:a)(e,t,n,r,i,s):a;return r.set(e,s),s},dm=(e,t)=>{if(t.constants.has(e))return;let n=Oh(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},fm=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return fm(e.expression,t,!1,r);if(e.kind!==`Identifier`||O(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=dm(e.name,t);if(a&&!r.has(a))return r.add(a),fm(a.body,t,n,r)},pm=(e,t,n)=>fm(e,t,!n),mm=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return mm(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=wg(e.definitions,Qp(r,t,n));return mm(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=_h(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return mm(a.expression,a.scope,n,r,i);if(a)return;let o=r.environment.variableIndex.get(e.name);if(o!==void 0)return i?void 0:o;let s=dm(e.name,r.environment);if(s)return mm(s.body,void 0,n,r,i)},hm=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||O(e))||!t&&e.kind===`Prime`,gm=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>gm(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[{index:r,expression:e}];let i=dm(e.name,t);if(i)return n.add(e.name),gm(i.body,t,n)},_m=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),vm=(e,t,n)=>_m.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||lm(e.operator)&&(hm(e.args[0],n)||pm(e.args[0],t,n)!==void 0)||O(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,ym=/* @__PURE__ */ new Set,bm=(e,t)=>{if(O(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return Gc(e,(e,i)=>{let a=r?bm(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r=!1,e}),r?n:void 0},xm=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||O(e)?void 0:Oh(r,t);return i&&!n.has(i)&&(n.add(i),xm(i.body,t,n))?!0:Be(e).some(e=>xm(e,t,n))},Sm=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=pm(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=gm(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return vm(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:um(e,t,n)}},Cm=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(xu(e,t)===void 0||xm(e,t,/* @__PURE__ */ new Set))return!0;let n=bm(e,ym);return!n||n.some(e=>r.has(e))}),o=a===-1?i.length:a;if(o!==0)return{names:n,guards:i.slice(0,o),rest:i.slice(o)}},wm=(e,t,n)=>{let r=e.map(e=>Sm(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=bp(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Km(u)){d??=Qp(t,n,u);for(let e=s;e<r.length;e++){let n=r[e],i=t.current,o=i&&n.kind===`Unchanged`?n.variables.find(e=>{let t=u[e.index];return t!==void 0&&!mr(t,i[e.index])}):void 0;if(o){Vp(t.environment,o.index,o.expression);return}let s=n.expression,c=cm(a,e,s,d);if(!sm(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=Qp(t,n,u);let r=cm(i,s,e.expression,d);if(!sm(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=Qp(t,n,u);let r=cm(i,s,e.value,d),a=u[e.index];if(a===void 0)u=$p(u,e.index,r),d=void 0;else if(!mr(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let i of e.variables){let e=(r??u)[i.index];if(e===void 0)r??=u.slice(),r[i.index]=n[i.index];else if(!mr(e,n[i.index])){Vp(t.environment,i.index,i.expression);return}}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},Tm=e=>{let t=Rp(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw tm(n,t);im(n,e,Qp(n,r,i))&&s(i,a)}},Em=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Qp(r,i,a);if(a[l]!==void 0){im(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Lr(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${em(r)}, the right side of \\IN is not enumerable.`;throw tm(r,`${t}\n${H(e)}`)}let p=Qr(f);if(r.generator){for(let e of Pd(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c($p(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c($p(a,l,p[e]),o)}},Dm=/* @__PURE__ */ new WeakMap,Om=e=>{let t=Dm.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Om),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Dm.set(e,n),n},km=(e,t)=>{let n=e.args[0],r=Tm(e),i=(e,r,i)=>mm(n,r,i,e,!t)??-1,a=Em(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=W(e.args[1],Qp(t,n,o));l($p(o,u,d),s)}},Am=(e,t,n)=>{let r=H(e);return(i,a,o,s,c,l)=>{let u=Qp(i,a,o),d=W(e.function,n?u:xh(u)),f=Gh(d);if(f!==void 0){um(f.body,t,n)(i,Kh(f,e,u),o,s,c,l);return}if(!jt(d))throw tm(i,`In computing ${em(i)}, a non-function (${Bo(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw tm(i,`In computing ${em(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},jm=(e,t)=>{if(gm(e,t))return wm([Om(e)],t,!1);if(e.kind===`Tuple`)return um(Om(e),t,!1);let n=Om(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?_h(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){um(Om(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=Qp(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=cg(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){um(Om(n.body),t,!1)(r,bg(n,e.args,u),a,o,s,c);return}}im(r,n,u)&&c(a,o)}},Mm=(e,t,n)=>{let r=e.operator,i=Tm(e),a=O(e)?void 0:sg(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Ug(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=um(a.body,t,n),o(e,i(Qp(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Qp(a,o,s),f=cg(e,d);f?.kind===`Closure`?um(f.body,t,n)(a,bg(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Nm=(e,t,n)=>{let r=Tm(e),i=O(e)?void 0:dm(e.name,t),a;return(o,s,c,l,u,d)=>{let f=_h(s,e.name);f?.kind===`Thunk`&&!f.isReleased?um(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&ng(i,t)!==void 0?r(o,s,c,l,u,d):(a??=um(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},Pm=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||O(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!O(i))return;let a=fm(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},Fm=e=>e.kind===`And`?e.operands.flatMap(Fm):[e],Im=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&vm(e,t,!1),Lm=e=>{let t=[];return(n,r,i)=>{let a=Qp(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!sm(n,i,cm(t,r,i,a)))return}}},Rm=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=Fm(e),r=n.findIndex(e=>!Im(e,t)||Pm(e,t)),i=r===-1?void 0:Pm(n[r],t);return i?{...i,before:r===0?void 0:Lm(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>Rm(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||O(e))return;let r=sg(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Rm(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(!i||o?.kind!==`Identifier`||!O(o))return;let s=i.before,c=s&&Ug(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(Qp(e,t,n)),n))}},zm=(e,t,n)=>{let r=_h(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},Bm=(e,t,n)=>{let r=e.map(e=>um(e,t,n)),i=n?[]:e.map(e=>Rm(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&zm(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},Vm=e=>(t,n,r,i,a,o)=>{let s=t.generator;if(!s)throw Error(`A random choice needs the run's generator`);let c=Math.floor(s.nextDouble()*e.length),l=wd(s);for(let s=0;s<e.length;s++)if(e[(c+s*l)%e.length](t,n,r,i,a,o),t.successors>0||t.isStopped)return},Hm=(e,t)=>{let n=um(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=Qp(r,i,a),u=t.runtime.version,d=Lh(e.bounds,e=>W(e,l)).map((n,r)=>Pd(Mh(n,e.bounds[r].set,u).length,n,t.runtime.getRandom(),u)),f=(t,i)=>{if(t<0)return n(r,i,a,o,s,c),r.successors>0||r.isStopped;let l=e.bounds[t].pattern;return d[t].some(e=>f(t-1,yh(i,l,e)))};f(d.length-1,i)}},Um=(e,t)=>{if(e.kind===`Exists`)return Hm(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>um(e,t,!1));return e.isBulleted?Vm(n):n.reduce((e,t)=>Vm([e,t]))},Wm=(t,n,r)=>{let i=e=>um(e,n,r);switch(t.kind){case`And`:return wm(t.operands,n,r);case`Or`:return Bm(t.operands,n,r);case`Exists`:{let e=i(t.body),a=t.bounds[0];if(t.bounds.length===1&&a.pattern.kind===`Name`){let t=a.pattern.name;return(r,i,o,s,c,l)=>{let u=Mh(W(a.set,Qp(r,i,o)),a.set,n.runtime.version);for(let n=0;n<u.length&&!r.isStopped;n++)e(r,vh(i,t,u[n]),o,s,c,l)}}let o=r?void 0:Cm(t,n);if(o){let e=wm(o.rest,n,r);return(r,i,a,s,c,l)=>{let u=Qp(r,i,a),d=Lh(t.bounds,e=>Mh(W(e,u),e,n.runtime.version));if(d.some(e=>e.length===0))return;let f=(t,n)=>{if(t<0)e(r,n,a,s,c,l);else for(let e of d[t]){if(r.isStopped)return;let i=vh(n,o.names[t],e);if(t===d.length-1){let e=Qp(r,i,a);if(!o.guards.every(t=>im(r,t,e)))continue}f(t-1,i)}};f(d.length-1,i)}}return(n,r,i,a,o,s)=>{Bh(t.bounds,Qp(n,r,i),t=>(e(n,t,i,a,o,s),n.isStopped))}}case`Forall`:{let e=i(t.body),a=!r&&xu(t,n)!==void 0&&!xm(t.body,n,/* @__PURE__ */ new Set)?bm(t,ym):void 0;return(n,r,i,o,s,c)=>{let l=[];Bh(t.bounds,Qp(n,r,i),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>_h(r,e)?.kind===`Value`)){u.every(e=>im(n,t.body,Qp(n,e,i)))&&c(i,o);return}let d=(r,i,a)=>{r===u.length?c(i,a):r>0&&n.isInit&&Km(i)?u.slice(r).every(e=>im(n,t.body,Qp(n,e,i)))&&c(i,a):e(n,u[r],i,a,!0,(e,t)=>d(r+1,e,t))};d(0,i,o)}}case`If`:{let e=i(t.consequent),n=i(t.alternative);return(r,i,a,o,s,c)=>{let l=W(t.condition,Qp(r,i,a));if(typeof l!=`boolean`)throw tm(r,rm(r,l,t));(l?e:n)(r,i,a,o,s,c)}}case`Case`:{let e=t.arms.map(e=>({condition:e.condition,source:e.body,body:i(e.body)})),n=t.other?i(t.other):void 0;return(r,i,a,o,s,c)=>{let l=Qp(r,i,a),u=e.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw tm(r,`In computing ${em(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Bo(t)}) was used as a guard condition of a CASE.\n${oh(e.source)}`)})?.body??n;if(!u)throw tm(r,`In computing ${em(r)}, TLC encountered a CASE with no conditions true.\n${H(t)}`);u(r,i,a,o,s,c)}}case`Let`:{let e=i(t.body),r=Eg(t.definitions,n);return(n,i,a,o,s,c)=>e(n,wg(t.definitions,Qp(n,i,a),r),a,o,s,c)}case`Unchanged`:return r?()=>{throw new e.b(`UNCHANGED appears in an initial predicate at ${rh(t)}`)}:jm(t.expression,n);case`AngleAction`:{let e=i(t.action),r={kind:`Unchanged`,expression:t.subscript,location:t.subscript.location},a=(e,t,i)=>{try{return im(e,r,Qp(e,t,i))}catch(t){throw e.isEnabled?gh(t,n.runtime.version):t}};return(t,n,r,i,o,s)=>e(t,n,r,i,o,(e,r)=>{a(t,n,e)||s(e,r)})}case`BoxAction`:return Bm([t.action,Om(t.subscript)],n,r);case`Label`:return i(t.body);case`Identifier`:return Nm(t,n,r);case`FunctionApplication`:return Am(t,n,r);case`Apply`:{let e=t.args;if(lm(t.operator)){let i=pm(e[0],n,r);if(i!==void 0)return t.operator===`=`?wm([t],n,r):Em(t,()=>i);if(hm(e[0],r))return km(t,r)}if(t.operator===`=>`){let n=i(e[1]);return(r,i,a,o,s,c)=>{let l=W(e[0],Qp(r,i,a));if(typeof l!=`boolean`){let e=Bo(l),n=H(t);throw tm(r,r.isInit?`In computing initial states of a predicate of form P => Q, P was ${e}\n.${n}`:r.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${e}.\n${n}`:`In computing next states of a predicate of the form P => Q, P was\n${e}.\n${n}`)}l?n(r,i,a,o,s,c):c(a,o)}}return Mm(t,n,r)}default:return Tm(t)}},Gm=e=>e.variables.map(()=>void 0),Km=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},qm=(t,n)=>{let r=n.state;if(!r||!Km(r))throw new e.b(`ENABLED needs a complete state at ${rh(t)}`);let i=n.environment;if(i.callStack)return Gp(t,n.scope,r,i);let a={environment:i,isInit:!1,isEnabled:!0,current:r,isStopped:!1,generator:void 0,successors:0};return um(t,i,!1)(a,n.scope,Gm(i),void 0,!1,()=>{a.isStopped=!0}),a.isStopped},Jm=(t,n,r,i,a)=>{let o={environment:n,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};um(t,n,!0)(o,i,Gm(n),void 0,!1,t=>{if(!o.isStopped){if(!Km(t)){if(a){o.isStopped=a([...t]);return}throw e.it(new e.S([...t]),e.tt.error)}o.isStopped=r(t)}})},Ym=(e,t,n)=>{let r=[];return Jm(e,t,e=>(r.push(e),!1),n),r},Xm=(t,n,r,i,a,o,s)=>{let c={environment:r,isInit:!1,isEnabled:!1,current:n,isStopped:!1,generator:o,successors:0,onUnsatisfied:s};return um(t,r,!1)(c,a,Gm(r),void 0,!1,(t,n)=>{if(!c.isStopped){if(!Km(t)){let i=r.variables.filter((e,n)=>t[n]===void 0);throw new e.C(`Successor state is not completely specified by action ${n??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,t,n,i)}c.successors++,c.isStopped=i({state:t,action:n})}}),c.successors},Zm=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return um(e,n,!1)(i,r,Gm(n),void 0,!1,e=>{Km(e)||(i.isStopped=!0)}),i.isStopped},Qm=(e,t,n,r)=>{let i=[];return Xm(e,t,n,e=>(i.push(e),!1),r),i},$m=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),eh=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),th=e=>eh.has(e.kind)||e.kind===`Apply`&&$m.has(e.operator),nh=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&At(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},rh=e=>`line ${e.location.line}, column ${e.location.column}`,H=t=>{let n=t.location.range;return n?e.X(n):rh(t)},ih={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},ah=(t,n)=>new e.b(`TLC encountered a temporal formula (${t}) when evaluating a predicate or action.\n${H(n)}`),oh=e=>e.kind===`Number`?e.text??String(e.value):H(e),sh=(t,n)=>new e.b(`A non-boolean expression (${Bo(n)}) was used as the condition of an IF.\n${H(t)}`),ch=(t,n,r)=>{let i=t.location.range;if(i?.start.line===t.location.line&&i.start.column===t.location.column||!i)return new e.b(`A non-boolean expression (${Bo(r)}) was used as a formula in a ${t.kind===`And`?`conjunction`:`disjunction`}.\n${oh(t.operands[n])}`);let a=t.prefixEnds?.[Math.max(n,1)-1]??i.end;return new e.b(`Attempted to evaluate an expression of form P ${t.kind===`And`?`/\\`:`\\/`} Q when ${n===0?`P`:`Q`} was\n${Bo(r)}.\n${H({...t,location:{...t.location,range:{...i,end:a}}})}`)},lh=t=>{let n=t.field,r=e=>`Attempted to select nonexistent field "${n}" from the record\n${A(L(e))}\n${H(t)}`,i=e=>`Attempted to apply function:\n${A(L(e))}\nto argument "${n}", which is not in the domain of the function.`;return a=>{if(!jt(a))throw new e.b(`Attempted to select field "${n}" from a non-record value ${A(L(a))}\n${H(t)}`);let o=En(a);if(o===`tuple`)throw Ei(n);return Mi(a.kind===`LazyFunction`?I(a):a,n,o===`record`?r:i)}},uh=e=>e===`1.7.4`?(t,n)=>Ci(t,n,e):void 0,dh=t=>n=>{if(!jt(n))throw new e.b(`Attempted to apply the operator DOMAIN to a non-function\n(${Bo(n)})\n${H(t)}`);return Pi(n)},fh=(t,n)=>(r,i)=>{if(!j(r)||ln(r))throw new e.b(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${H(t)}`);return n.evaluateBinary?n.evaluateBinary(r,i):n.evaluate([r,i])},ph=t=>e.it(new e.b(`TLC can't handle real numbers.\n${t.text}`),e.tt.configParseError),mh=t=>e.it(new e.b(`TLC can't handle a number this big.\n${t.text??t.value}`),e.tt.error),hh=(t,n)=>new e.R(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${H(n)}`,t),gh=(t,n)=>t instanceof e.R&&n!==`1.7.4`?new e.b(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${t.variable} occurring in the state formula v.\n`):t,_h=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},vh=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),yh=(t,n,r)=>{if(n.kind===`Name`)return vh(t,n.name,r);let i=ui(r);if(!i||i.length!==n.names.length){let t=n.ranges?.[0];throw new e.b(`Argument mismatch in operator application.${t?e.X(t):``}`)}return n.names.reduce((e,t,n)=>vh(e,t,i[n]),t)},bh=(t,n)=>{if(jt(t))return t;throw new e.b(`A non-function (${Bo(t)}) was applied as a function.\n${H(n)}`)},xh=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},Sh=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),Ch=(t,n)=>{if(typeof t!=`boolean`)throw new e.b(`Expected ${n} to be a boolean but found ${L(t)}`);return t},wh=(t,n,r)=>{if(typeof t!=`boolean`)throw new e.b(`Attempted to evaluate an expression of form P => Q when ${r} was\n${Bo(t)}.\n${H(n)}`);return t},Th=(t,n)=>{if(typeof t!=`boolean`)throw new e.b(`Attempted to apply the operator ~ to a non-boolean\n(${Bo(t)})\n${H(n)}`);return!t},Eh=(t,n,r)=>{if(typeof t!=`boolean`||typeof n!=`boolean`)throw new e.b(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${H(r)}`);return t===n},Dh=(t,n)=>{if(typeof t!=`boolean`)throw new e.b(`TLC expected a boolean value, but did not find one. ${oh(n)}`);return t},Oh=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),kh=(e,t)=>{let n=`universally (\\A) or existentially (\\E) quantify over ${t}, because this would require checking an\ninfinite number of cases.`;if(typeof e==`object`&&e.kind===`SequenceSet`)return`In TLA+, Seq(S) represents the set of all finite sequences whose elements come from the set S. Even when S\nis a finite set, the number of possible sequences in Seq(S) is unbounded because sequences can have any\nfinite length (e.g., length 0, 1, 2, and so on). As a result, TLC cannot evaluate expressions that\n${n} Note that for a finite set of sequences s, TLC handles s \\subseteq Seq(S).\nSee https://explain.tlapl.us/seq-unenumerable for additional details.`;if(typeof e==`object`&&e.kind===`InfiniteSet`&&e.name!==`STRING`&&e.name!==`Any`)return`The set ${e.name} contains infinitely many elements. As a result, TLC cannot evaluate expressions that\n${n} Note that TLC handles set membership like T \\subseteq ${e.name} for any finite set T.`},Ah=(t,n,r)=>{if(!j(t)||ln(t)){let i=L(t),a=r===`1.7.4`?void 0:kh(t,i);throw new e.b(a===void 0?`TLC encountered a non-enumerable quantifier bound\n${i}.\n${oh(n)}`:`TLC encountered the non-enumerable quantifier bound\n${i}\n${oh(n)}\n${a}`)}},jh=(e,t,n)=>(Ah(e,t,n),typeof e==`object`&&e.kind===`Interval`?Ar(e):Wr(e)??Xr(e)),Mh=(e,t,n)=>n===`1.7.4`?(Ah(e,t,n),Wr(e)??Qr(e)):jh(e,t,n),Nh=e=>{if(typeof e==`object`&&e.kind===`Interval`)return ai(e),e},Ph=(e,t,n)=>Nh(e)??Mh(e,t,n),Fh=(e,t,n)=>Nh(e)??jh(e,t,n),Ih=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},Lh=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set)),n),[]),Rh=(e,t)=>Lh(e,e=>Ph(W(e,t),e,t.environment.runtime.version)),zh=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Ih(t[n],t=>i(n-1,yh(a,e[n].pattern,t)));return i(e.length-1,n)},Bh=(e,t,n)=>zh(e,Rh(e,t),t.scope,n),Vh=(e,t)=>{let n=Lh(e,e=>W(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Hh=(e,t,n)=>{if(e.length===1)return yh(t,e[0].pattern,n);let r=ui(n)??[];return e.reduce((e,t,n)=>yh(e,t.pattern,r[n]),t)},Uh=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Wh=e=>Object.assign(e.value,{lambda:e}),Gh=e=>Uh(e)?e.lambda:void 0,Kh=(t,n,r)=>{let i=t.value,a=n.args.map(e=>W(e,r)),o=a.length===1?a[0]:Pr(a),s=(e,t,r)=>`In applying the function\n${A(L(i))},\nthe ${e} is:\n${A(L(t))}${r}.\n${H(n.function)}`,c=t.bounds;if(c.length===1){if(!hi(o,i.domain))throw new e.b(s(`first argument`,o,`which is not in its domain`));return Hh(c,t.scope,o)}let l=ui(o),u=typeof i.domain==`object`&&i.domain.kind===`ProductSet`?i.domain.factors:[],d=()=>new e.b(`In applying the function\n${A(L(i))},\nthe argument list is:\n${A(L(o))}\nwhich does not match its formal parameter.\n`);if(l===void 0||(c.forEach((t,n)=>{if(n>=l.length)throw d();let r=l[n],i=`argument number ${n+1}`;if(!hi(r,u[n]))throw new e.b(s(i,r,`${t.pattern.kind===`Name`?``:`
|
|
1782
|
+
`}which is not in its domain`));if(t.pattern.kind===`Tuple`&&ui(r)?.length!==t.pattern.names.length)throw new e.b(s(i,r,`which does not match its formal parameter`))}),l.length>c.length))throw d();return Hh(c,t.scope,o)},qh=(t,n)=>{let r=n.location.range;if(r)return{parameters:t.flatMap((e,n)=>n>0&&t[n-1].set===e.set?[]:[{index:n,name:e.pattern.kind===`Name`?e.pattern.name:`<<${e.pattern.names.join(`, `)}>>`}]),body:e.X(r)}},Jh=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},Yh=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},Xh=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),Zh=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),Qh=(e,t)=>{let n=Vh(e.bounds,t),r=Yh(n,(n,r)=>W(e.body,Sh(t,Hh(e.bounds,vh(void 0,e.name,r),n))),Jh(qh(e.bounds,e.body),e.bounds,n),Xh(e.bounds));Wh({value:r,bounds:e.bounds,body:e.body,scope:vh(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=Qh(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?Dn(i):i},$h=(t,n)=>{if(typeof n!=`object`||En(n)!==`lambda`||t.kind===`Operator`||t.isSelfReferential||n.kind!==`LazyFunction`||!At(n.domain))return n;try{let e=I(n);return Cn(e.domain,e.range)}catch(t){if(t instanceof e.b)return n;throw t}},eg=(t,n)=>t.kind===`Operator`&&t.params.length>0?()=>{throw new e.b(`Operator ${t.name} requires ${t.params.length} arguments`)}:t.kind===`Function`?t.isSelfReferential?e=>Qh(t,e):Rg(Zh(t),n):Rg(t.body,n),tg=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=eg(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(Sh(e,void 0)):e=>a[i]??r(Sh(e,void 0));return t.definitionEvaluators.set(e,o),o},ng=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},rg=(t,n)=>t.forEach(t=>{if(t.kind===`Operator`&&t.params.length>0)return;let r=t.name;if(n.constants.has(r)||n.substitutions.has(r)||!gu(t,n))return;let i=n.facts.ids.get(t);if(i===void 0||n.startupValues[i]!==void 0)return;let a={environment:n,scope:void 0,state:void 0,next:void 0};try{let e=n.runtime.evaluateAtStartup(()=>$h(t,eg(t,n)(a)));fr(e),n.startupValues[i]=e}catch(t){if(!(t instanceof e.b)&&!e.et(t))throw t}}),ig=(t,n)=>{if(n===void 0||t===n)return!0;try{return n.every((e,n)=>e===void 0||t?.[n]!==void 0&&Pn(t[n],e))}catch(t){if(t instanceof e.b)return!1;throw t}},ag=(e,t)=>{let n=e.cache;if(n!==void 0&&ig(t.state,e.state)&&ig(t.next,e.next))return n;let r=t.environment.coverage,i=r?.current===-1?void 0:r?.values.get(e),a=r&&i!==void 0?io(r,i,()=>W(e.expression,Sh(t,e.scope))):W(e.expression,Sh(t,e.scope));return(!e.isStreamed||ei(a))&&(e.cache=a,e.state=t.state,e.next=t.next),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),a},og=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),sg=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return sg(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?og(r):t.builtins.get(e)},cg=(e,t)=>O(e)?lg(e.operator,t):sg(e.operator,t.environment)??lg(e.operator,t),lg=(e,t)=>{let n=_h(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return sg(e,t.environment)},ug=e=>e.kind===`Closure`?e.params.length:e.arity,dg=(t,n)=>{if(t.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:t.params.map(e=>({name:e,arity:0})),body:t.body,scope:n.scope};let r=t.kind===`OperatorReference`?t.operator:t.kind===`Identifier`?t.name:void 0,i=r===void 0?void 0:lg(r,n);if(!i)throw new e.b(`Expected an operator argument at ${rh(t)}`);return i},fg=(e,t,n)=>{if(e.kind===`Builtin`&&e.isLazy)return e.evaluate(t.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>e})),n);if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>vh(e,n.name,t[r]),e.scope);return W(e.body,Sh(n,r))},pg=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:ug(e),call:n=>fg(e,n,t)},mg=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=lg(e.name,t);return n!==void 0&&ug(n)>0},hg=(e,t)=>e.map(e=>mg(e,t)?pg(dg(e,t),t):W(e,t)),gg=(t,n)=>new e.b(`Operator ${t.name} expects ${t.params.length} arguments but received ${n}`),_g=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),vg=(e,t)=>{let n=t.variableIndex.get(e);if(n!==void 0)return{kind:`Variable`,index:n};let r=t.constants.get(e);if(r!==void 0)return{kind:`Value`,value:r};let i=t.substitutions.get(e);if(i!==void 0)return vg(i,t);let a=t.definitions.get(e);if(a)return{kind:`Definition`,definition:a};let o=t.builtins.get(e);if(o&&o.arity===0&&!o.isStateLevel)return{kind:`Value`,value:o.evaluate([])}},yg=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Pt(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=_g(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=O(e)?void 0:vg(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0&&!t.callStack)return t=>{let n=_h(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:_g(e,t)}}return t=>_g(e,t)},bg=(e,t,n,r)=>{if(t.length!==e.params.length)throw gg(e,t.length);let i=e.scope;for(let a=0;a<t.length;a++){let o=e.params[a],s=o.arity>0?{kind:`Operator`,operator:dg(t[a],n)}:(r?.[a]??yg(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},xg=(e,t,n,r)=>e.kind===`Closure`?W(e.body,Sh(n,bg(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(Vg(t,n),n):e.evaluate(hg(t,n),n),Sg=/* @__PURE__ */ new WeakMap,Cg=e=>{let t=Sg.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return Sg.set(e,n),n},wg=(e,t,n)=>{let r=e.map(e=>({name:e.name,binding:{kind:`Value`,value:!1},parent:void 0})),i=r.reduce((e,t)=>(t.parent=e,t),t.scope);e.forEach((e,a)=>{r[a].binding=e.kind===`Function`?{kind:`Thunk`,expression:Cg(e),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1}:e.params.length>0||n?.impure.has(e)?{kind:`Operator`,operator:{kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:i}}:{kind:`Thunk`,expression:e.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(e)??!1}});let a=t.environment.coverage;return a&&a.current!==-1&&r.forEach(e=>{e.binding.kind===`Thunk`&&a.values.set(e.binding,a.current)}),i},Tg=(t,n,r)=>{let i=_h(r.scope,t);if(i?.kind===`Value`)return i.value;if(i?.kind===`Thunk`)return ag(i,r);if(i?.kind===`Operator`){if(ug(i.operator)===0)return fg(i.operator,[],r);throw new e.b(`Operator ${t} is used without arguments`)}let a=vg(t,r.environment);if(a?.kind===`Variable`){let e=r.state?.[a.index];if(e===void 0)throw hh(t,n);return e}if(a?.kind===`Value`)return a.value;if(a?.kind===`Definition`)return tg(a.definition,r.environment)(r);let o=r.environment.builtins.get(t);if(o?.arity===0)return o.evaluate([],r);throw new e.b(`Unknown identifier ${t} at ${rh(n)}`)},Eg=(e,t)=>({impure:new Set(e.filter(e=>vu(e,t))),streamed:new Set(e.filter(e=>vu(e,t,`streamed`)))}),Dg=e=>[...e.facts.ids.keys()].some(t=>vu(t,e)),Og=e=>[...e.facts.ids.keys()].some(t=>vu(t,e,`repeated`)),kg=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,Ag=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),jg=e=>t=>{let n=e(t);return Pn(n,e(Ag(t)))},Mg=(t,n,r,i)=>a=>{i.expressions.push(t);let o=fi.sets,s=fi.callStack,c=o??[],l=c.length;fi.sets=c,fi.callStack=i;try{let e=n(a),o=kg(e)?e.rebind(r):e;return i.values.set(t,o),typeof o==`object`&&o.kind!==`FilteredSet`&&th(t)&&i.sources.set(o,t),o}catch(n){n instanceof e.N&&!i.isFrozen&&(i.expressions.length=0,i.isFrozen=!0);let r=n instanceof Error?i.failures.get(n):void 0;n instanceof Error&&i.failures.set(n,t);let a=nh(t,i.values),o=a&&!Be(t).some(e=>e===r)?i.values.get(a):void 0,s=t.kind===`FunctionApplication`&&o!==void 0&&!jt(o)?void 0:o;throw Ng(i,[s,...c.slice(l).filter(e=>e!==s)],n),n}finally{i.isFrozen||i.expressions.pop(),c.length=l,fi.sets=o,fi.callStack=s}},Ng=(t,n,r)=>{let i=[...new Set(n)].flatMap(e=>{let n=typeof e==`object`?t.sources.get(e):void 0;return n?[n]:[]});if(i.length>0&&r instanceof e.b){t.isFrozen||t.expressions.push(...i);let e=t.fingerprint;t.fingerprint={sources:[...i,...e?.sources??[]],reason:e?.reason??r.message}}t.isFrozen=!0},Pg=(t,n,r)=>{if(!(r instanceof e.b))return;t.isFrozen||t.expressions.push(n),t.isFrozen=!0;let i=t.fingerprint;t.fingerprint={sources:[n,...i?.sources??[]],reason:i?.reason??r.message}},Fg=e=>({...e,coverage:void 0,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),Ig=(e,t,n,r)=>i=>{if(r.expressions.at(-1)===e)return n(i);r.expressions.push(...t);try{return n(i)}finally{r.isFrozen||(r.expressions.length-=t.length)}},Lg=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=no(n,i,e);ro(n,a),n.current=a;try{let i=t(r);return typeof i==`object`&&e.kind===`SetEnumeration`&&n.values.set(i,a),i}finally{n.current=i}},U=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=d_(e,t),i=t.callStack,a=i&&Lc.get(e),o=i?Mg(e,r,t,i):r,s=i&&a?Ig(e,a,o,i):o,c=t.coverage,l=c?Lg(e,s,c):s;return t.evaluators.set(e,l),l},Rg=(e,t)=>{if(t.callStack||t.coverage)return U(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=_s(e,t)??U(e,t);return t.entryEvaluators.set(e,r),r},W=(e,t)=>Rg(e,t.environment)(t),zg=(e,t)=>{let n=e.name,r=O(e)?void 0:vg(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw hh(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n;return r=>(n??=tg(e,t))(r)}return t=>Tg(n,e,t)},Bg=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||O(e))return!0;let n=sg(e.name,t);return n===void 0||ug(n)===0},Vg=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),Hg=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Vg(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Bg(t[0],n)){let e=U(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Bg(t[0],n)&&Bg(t[1],n);if(i&&a){let e=U(t[0],n),r=U(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(hg(t,n),n)},Ug=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw gg(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:yg(e,n));return n=>{let a=e.scope;for(let e=0;e<t.length;e++){let o=i[e],s=o?o(n):{kind:`Operator`,operator:dg(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Wg=(e,t,n)=>{let r=Ug(e,t,n),i;return t=>(i??=Rg(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},Gg=(t,n)=>{let r=t.args;if(t.operator===`=>`){let e=U(r[0],n),i=U(r[1],n);return n=>!wh(e(n),t,`P`)||wh(i(n),t,`Q`)}if(t.operator===`~`&&r.length===1){let e=U(r[0],n);return n=>Th(e(n),t)}if(t.operator===`<=>`){let e=U(r[0],n),i=U(r[1],n);return n=>Eh(e(n),i(n),t)}if(t.operator===`~>`||t.operator===`-+->`)return()=>{throw ah(t.operator===`~>`?`a ~> b`:`a -+-> formula`,t)};let i=O(t)?void 0:sg(t.operator,n);if(i?.kind===`Closure`)return Wg(i,r,n);if(i?.kind===`Builtin`&&i.name===`DOMAIN`){let e=U(r[0],n),i=dh(t);return t=>i(e(t))}if(i?.kind===`Builtin`&&i.name===`TLCEval`&&r.length===1){let e=!Ic.has(t)&&!Su(r[0],n);return t=>i.evaluate(Vg(r,t),e&&t.scope===void 0?void 0:t)}if(i?.kind===`Builtin`&&i.name===`\\subseteq`&&r.length===2){let e=U(r[0],n),a=U(r[1],n),o=fh(t,i);return t=>o(e(t),a(t))}if(i?.kind===`Builtin`)return Hg(i,r,n);if(t.operator===`\\cdot`&&r.length===2)return()=>{throw new e.b(n.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let a=r.map(e=>yg(e,n));return i=>{let o=lg(t.operator,i);if(o)return xg(o,r,i,a);throw n.definitions.get(t.operator)?.kind===`Function`?new e.b(`${t.operator} is a function; apply it with brackets`):new e.b(`Unknown operator ${t.operator} at ${rh(t)}`)}},Kg=(e,t)=>{let n=e.kind===`Forall`,r=U(e.body,t),i=e.bounds[0];if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=U(i.set,t);return s=>Ih(Ph(o(s),i.set,t.runtime.version),t=>Dh(r(Sh(s,vh(s.scope,a,t))),e)!==n)?!n:n}let a=e.bounds;if(a.every(e=>e.pattern.kind===`Name`)){let i=a.map(e=>e.pattern.kind===`Name`?e.pattern.name:``);return o=>{let s=Lh(a,e=>Ph(U(e,t)(o),e,t.runtime.version)),c=(t,a)=>t<0?Dh(r(Sh(o,a)),e)!==n:Ih(s[t],e=>c(t-1,vh(a,i[t],e)));return c(a.length-1,o.scope)?!n:n}}return t=>Bh(a,t,i=>Dh(r(Sh(t,i)),e)!==n)?!n:n},qg=(e,t)=>{if(e.kind===`Tuple`)return Pr(e.names.map(e=>{let n=_h(t,e);return n?.kind===`Value`&&n.value}));let n=_h(t,e.name);return n?.kind===`Value`?n.value:void 0},Jg=/* @__PURE__ */ new WeakSet,Yg=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&Jg.add(e)},Xg=/* @__PURE__ */ new WeakMap,Zg=e=>{if(Xg.has(e))return Xg.get(e);let t=/* @__PURE__ */ new Set,n=e=>e.kind!==`Subexpression`&&(e.kind===`Identifier`&&t.add(e.name),(e.kind===`Apply`||e.kind===`OperatorReference`)&&t.add(e.operator),e.kind===`ExceptAt`&&t.add(`@`),Be(e).every(n)),r=n(e)?[...t]:void 0;return Xg.set(e,r),r},Qg=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=_h(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),$g=e=>Jg.has(e),e_=(t,n)=>{let r=$g(t),i=U(t.body,n),a=t.bounds,o=a[0],s=a.length===1&&o.pattern.kind===`Name`,c=(e,t)=>{if(s&&o.pattern.kind===`Name`){let n=o.pattern.name,r=e=>i(Sh(t,vh(t.scope,n,e)));if(Ot(e))return ai(e),kt(e,r),f(e,t);let a=Mr(e),s=Cn(a,a.map(r));return At(e)?s:(s.lambdaDomain=e,Dn(s))}let n=[],r=Lh(a,e=>Fh(W(e,t),e,t.environment.runtime.version));return zh(a,r,t.scope,e=>{let r=a.length===1?qg(o.pattern,e)??!1:Pr(a.map(t=>qg(t.pattern,e)??!1));return n.push([r,i(Sh(t,e))]),!1}),Cr(n)},l=qh(a,t.body),u=Xh(a),d=Zg(t.body),f=(e,n)=>{let r=Qg(n.scope,d),o=Sh(n,r),s=Wh({value:Yh(e,e=>i(Sh(o,Hh(a,r,e))),Jh(l,a,e),u),bounds:a,body:t.body,scope:r});return a.length===1?Dn(s):s},p=n.callStack;return{build:(n,i)=>{if(t.isRecursive||r||i.isKeepLazy||!N(n))return f(n,i);if(!(a.length===1?At(n):typeof n==`object`&&n.kind===`ProductSet`&&n.factors.every(At))){if(p)return f(n,i);try{return c(n,i)}catch(t){if(!(t instanceof e.b))throw t;return f(n,i)}}if(!p)return c(n,i);try{return c(n,i)}catch(e){throw Pg(p,t,e),e}},createLazy:f}},t_=(e,t)=>{let n=e_(e,t).build,r=e.bounds;if(r.length===1&&r[0].pattern.kind===`Name`){let e=U(r[0].set,t);return t=>n(e(t),t)}return e=>n(Vh(r,e),e)},n_=(e,t)=>{let n=Jg.has(e);n&&Yg(e.function);let r=U(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>U(e,t))}),value:U(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Pr(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Sh(i,vh(i.scope,`@`,e))):Fi(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i=!1;n=o(n,r.path,0,t,e=>(i=!0,r.value(e))),i||t.environment.runtime.warn(Ge.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${H(e.function)}`)}return n}},r_=(t,n)=>{let r=U(t.predicate,n),i=t.bound.pattern,a=t.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:e.X(a)},s=oh(t.predicate),c=n.coverage,l=(e,t,n)=>{if(!c||e===-1)return n();t||c.secondary[e]++;let r=io(c,t?-1:e,n);return!t&&r===!0&&c.secondary[e]++,r},u=(n,r,a,c)=>({kind:`FilteredSet`,base:n,test:(t,n)=>{if(i.kind===`Tuple`&&ui(t)?.length!==i.names.length)throw new e.b(`Attempted to check if the value:\n${A(L(t))}\nis an element of a set of ${i.names.length}-tuples.`);let o=l(c,n,()=>a(Sh(r,yh(r.scope,i,t))));if(typeof o!=`boolean`)throw new e.b(`${n?`The evaluation of predicate`:`Evaluating predicate`} ${s} yielded non-Boolean value.`);return o},source:o,rebind:e=>u(n,{...r,environment:e},U(t.predicate,e),-1)});return(e,t,n=-1)=>u(e,t,r,n)},i_=(t,n)=>{if(typeof t!=`boolean`)throw new e.b(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${Bo(t)}.\n${oh(n.predicate)}`);return t},a_=(t,n,r,i)=>{if(!j(t)||ln(t))throw new e.b(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${H(n)}`);return pr(t),Fh(t,r,i)},o_=t=>new e.b(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${H(t)}`),s_=(t,n)=>{if(t.kind===`SetFilter`){let e=U(t.predicate,n),r=U(t.bound.set,n),i=r_(t,n),a=t.bound.pattern,o=n.coverage;return n=>{let s=r(n);if(!At(s))return i(s,n,o?.current);let c=[],l=r=>{let i=e(Sh(n,yh(n.scope,a,r)));i_(i,t)&&Dt(c,r)},u=s.kind===`Interval`?s:P(s).elements;return kt(u,l),o&&o.current!==-1&&(o.secondary[o.current]+=(Array.isArray(u)?u.length:u.high-u.low+1)+c.length),Sn(c)}}if(t.kind===`SetMap`){let e=U(t.expression,n);return n=>{let r=[];return Bh(t.bounds,n,t=>(Dt(r,e(Sh(n,t))),!1)),vr(r)}}let r=t.set;if(!r)return()=>{throw new e.b(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${H(t)}`)};let i=U(t.body,n),a=U(r,n);return n=>{let o=a_(a(n),t,r,n.environment.runtime.version),s,c=t.pattern;if(Ih(o,r=>{if(c.kind===`Tuple`&&ui(r)?.length!==c.names.length)throw new e.b(`Attempted to compute the value of an expression of form\nCHOOSE <<x1, ... , xN>> \\in S: P, but S was not a set\nof N-tuples.\n${H(t)}`);let a=yh(n.scope,c,r);return Dh(i(Sh(n,a)),t)?(s=qg(c,a),!0):!1}),s===void 0)throw o_(t);return s}},c_=e=>[...e].sort((e,t)=>gn(e.name,t.name)),l_=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),u_=(e,t)=>{let n=c_(e),r=l_(n),i=n.map(e=>U(e.value,t));if(r)return e=>Fr(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>Bt(a,i.map(t=>t(e)),o):e=>Ir(a,i.map(t=>t(e)))},d_=(t,n)=>{let r=e=>U(e,n);switch(t.kind){case`Number`:{let e=t.value;return Pt(e)?()=>e:()=>{throw mh(t)}}case`Decimal`:return()=>{throw ph(t)};case`String`:{let e=t.value;return()=>e}case`Identifier`:return zg(t,n);case`Apply`:return Gg(t,n);case`Bracket`:return()=>{throw new e.b(`A bracket without a function or subscript is not an expression at ${rh(t)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new e.b(`An operator cannot be used as a value at ${rh(t)}`)};case`And`:{let e=t.operands.map(r);return n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw ch(t,r,i);if(!i)return!1}return!0}}case`Or`:{let e=t.operands.map(r);return n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw ch(t,r,i);if(i)return!0}return!1}}case`Prime`:{let e=r(t.expression);return t=>e(Ag(t))}case`Unchanged`:return jg(r(t.expression));case`If`:{let e=r(t.condition),n=r(t.consequent),i=r(t.alternative);return r=>{let a=e(r);if(typeof a!=`boolean`)throw sh(t,a);return a?n(r):i(r)}}case`Case`:{let n=t.arms.map(e=>({source:e.condition,condition:r(e.condition),body:r(e.body)})),i=t.other?r(t.other):void 0;return r=>{for(let t of n){let n=t.condition(r);if(typeof n!=`boolean`)throw new e.b(`A non-boolean expression (${Bo(n)}) was used as a condition of a CASE. ${oh(t.source)}`);if(n)return t.body(r)}if(i)return i(r);throw new e.b(`Attempted to evaluate a CASE with no conditions true.\n${H(t)}`)}}case`Let`:{let e=r(t.body);return n=>e(Sh(n,wg(t.definitions,n)))}case`Forall`:case`Exists`:return Kg(t,n);case`UnboundedQuantifier`:return()=>{let n=t.quantifier===`Forall`?`\\A`:`\\E`;throw t.isTemporal?ah(t.quantifier===`Forall`?`\\AA`:`\\EE`,t):new e.b(`TLC attempted to evaluate an unbounded ${n}.\nMake sure that the expression is of form ${n} x \\in S: P(x).\n${H(t)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return s_(t,n);case`SetEnumeration`:{let e=t.elements.map(r);return t=>vr(e.map(e=>e(t)))}case`Tuple`:{let e=t.elements.map(r);return t=>Pr(e.map(e=>e(t)))}case`FunctionConstruction`:return t_(t,n);case`FunctionSet`:{let e=r(t.domain),n=r(t.range);return t=>({kind:`FunctionSet`,domain:e(t),range:n(t)})}case`Record`:return u_(t.fields,n);case`RecordSet`:{let e=c_(t.fields),n=e.map(e=>e.name),i=e.map(e=>r(e.value));return e=>({kind:`RecordSet`,names:n,sets:i.map(t=>t(e))})}case`Except`:return n_(t,n);case`ExceptAt`:return n=>{let r=_h(n.scope,`@`);if(r?.kind!==`Value`)throw new e.b(`@ appears outside an EXCEPT at ${rh(t)}`);return r.value};case`FunctionApplication`:{Yg(t.function);let e=r(t.function),i=n=>bh(e(xh(n)),t),a=t.args.map(r),o=uh(n.runtime.version);if(a.length===1){let e=a[0];return t=>Mi(i(t),e(t),o)}return e=>Mi(i(e),Pr(a.map(t=>t(e))),o)}case`FieldAccess`:{let e=r(t.record),n=lh(t);return t=>n(e(t))}case`Product`:{let e=t.factors.map(r);return t=>({kind:`ProductSet`,factors:e.map(e=>e(t))})}case`BoxAction`:case`AngleAction`:{let n=r(t.action),i=jg(r(t.subscript)),a=t.kind===`BoxAction`,o=a?`[A]_e`:`<A>_e`;return r=>{let s=n(r);if(typeof s!=`boolean`)throw new e.b(`Attempted to evaluate an expression of form ${o}, but A was not a boolean.\n${H(t)}`);return a?s||i(r):s&&!i(r)}}case`Enabled`:{let e=t.expression;return t=>qm(e,t)}case`Label`:return r(t.body);case`Subexpression`:return()=>{throw new e.b(`The subexpression reference at ${rh(t)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw ah(ih[t.kind],t)}}},f_=`tlc2/value/impl/`,p_={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},m_={iconstM1:2,iconst0:3,iconst5:8,bipush:16,sipush:17,ldc:18,ldcW:19,dup:89,areturn:176,getstatic:178,invokespecial:183,invokestatic:184,new:187},h_=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n=0,r=e=>{let t=n;return n+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n)}},g_=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),__=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],v_=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??g_.get(e[3])}${`[]`.repeat(e[1].length)}`),y_=(e,t)=>e[e[t].first].text,b_=(e,t)=>y_(e,t).replaceAll(`/`,`.`),x_=t=>{let n=h_(t);if(n.readUint32()!==3405691582)throw new e.F(`A module override is not a class file`);n.readUint16(),n.readUint16();let r=[],i=n.readUint16(),a=new TextDecoder;for(let e=1;e<i;e++){let t=n.readUint8(),i={tag:t,text:``,value:0,first:0,second:0};r[e]=i,t===p_.utf8?i.text=a.decode(n.readBytes(n.readUint16())):t===p_.integer?i.value=n.readInt32():t===p_.float?n.readUint32():t===p_.long||t===p_.double?(n.readBytes(8),e++):t===p_.class||t===p_.string||t===p_.methodType||t===p_.module||t===p_.package?i.first=n.readUint16():t===p_.methodHandle?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=b_(r,n.readUint16());n.readUint16(),n.readBytes(n.readUint16()*2);for(let e=n.readUint16();e>0;e--){n.readBytes(6);for(let e=n.readUint16();e>0;e--)n.readUint16(),n.readBytes(n.readUint32())}let s=[];for(let e=n.readUint16();e>0;e--){let e=n.readUint16(),t=r[n.readUint16()].text,i=r[n.readUint16()].text,a=i.indexOf(`)`),c=v_(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:h_(n.readBytes(n.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>b_(r,d.readUint16())):[],p=__.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=v_(i.slice(a+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;s.push({name:t,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${o}.${t}(${c.join(`,`)})${h}`})}return{pool:r,methods:s}},S_=(e,t)=>{let n=e[t],r=e[n.second];return{className:y_(e,n.first),name:e[r.first].text}},C_=(t,n,r,i)=>{let a=()=>new e.B(`The Java override ${r}.${t.name} computes its value, which tla-ts cannot run`),o=t.code;if(!o)throw a();let s=[],c=()=>{let e=s.pop();if(e===void 0)throw a();return e},l=e=>{let t=n[e];if(t.tag===p_.integer)return t.value;if(t.tag===p_.string)return n[t.first].text;throw a()};for(let e=0;e<o.length;){let t=o[e],r=()=>o[e+1]<<8|o[e+2];if(t>=m_.iconstM1&&t<=m_.iconst5)s.push(t-m_.iconst0),e+=1;else if(t===m_.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===m_.sipush)s.push(r()<<16>>16),e+=3;else if(t===m_.ldc)s.push(l(o[e+1])),e+=2;else if(t===m_.ldcW)s.push(l(r())),e+=3;else if(t===m_.dup){let t=c();s.push(t,t),e+=1}else if(t===m_.getstatic){let t=S_(n,r());if(t.className!==`${f_}BoolValue`||t.name!==`ValTrue`&&t.name!==`ValFalse`)throw a();s.push({kind:`Identifier`,name:t.name===`ValTrue`?`TRUE`:`FALSE`,location:i}),e+=3}else if(t===m_.invokestatic){let t=S_(n,r()),o=c();if(t.className!==`${f_}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===m_.new)s.push({className:y_(n,r()),value:void 0}),e+=3;else if(t===m_.invokespecial){let t=S_(n,r()),o=c(),s=c();if(!(t.className===`${f_}StringValue`&&t.name===`<init>`&&typeof o==`string`&&typeof s==`object`&&`className`in s))throw a();s.value={kind:`String`,value:o,location:i},e+=3}else if(t===m_.areturn){let e=c();if(typeof e!=`object`)throw a();if(`className`in e){if(!e.value)throw a();return e.value}return e}else throw a()}throw a()},w_=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=x_(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:C_(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},T_=x(`EOF`),E_=x(`IDENTIFIER`),D_=x(`DEFBREAK`),O_=(e,t)=>Array.from({length:x(t)-x(e)+1},(t,n)=>x(e)+n),k_=new Set(O_(`op_57`,`op_119`)),A_=new Set(O_(`op_1`,`op_119`)),j_=new Set(O_(`op_57`,`op_70`)),M_=/* @__PURE__ */ new Set([...O_(`ACTION`,`EXCEPT`),x(`EXTENDS`),...O_(`IF`,`SF`),x(`STATE`),...O_(`THEN`,`WITH`),x(`US`),...O_(`op_112`,`op_116`)]),N_=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),P_=new Map([...N_(`postfix`,160,160,!0,`[`),...N_(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...N_(`prefix`,120,120,!1,`-.`),...N_(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...N_(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...N_(`prefix`,40,40,!0,`\\lnot`),...N_(`nfix`,100,130,!0,`\\times`),...N_(`infix`,140,140,!1,`^`,`^^`),...N_(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...N_(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...N_(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...N_(`infix`,100,110,!0,`|`,`||`,`%%`),...N_(`infix`,100,110,!1,`%`),...N_(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...N_(`infix`,90,140,!1,`\\wr`),...N_(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...N_(`infix`,90,130,!1,`!!`),...N_(`infix`,90,90,!1,`...`,`..`),...N_(`infix`,80,80,!0,`\\intersect`,`\\union`),...N_(`infix`,80,80,!1,`\\`),...N_(`infix`,70,70,!1,`<:`,`:>`),...N_(`infix`,60,60,!0,`@@`),...N_(`infix`,50,140,!0,`\\cdot`),...N_(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...N_(`infix`,30,30,!0,`\\land`,`\\lor`),...N_(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...N_(`infix`,10,10,!1,`=>`)]),F_=new Map([...P_,...yf.flatMap(e=>e.slice(1).map(t=>[t,P_.get(e[0])]))]),I_=F_.get(`[`),L_={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},R_=e=>({type:`tokens`,kinds:new Set(e)}),z_=e=>typeof e==`string`?e.startsWith(`<`)?R_([x(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(z_)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),B_=e=>(...t)=>({type:e,body:G(...t)}),q=B_(`zeroOrMore`),V_=B_(`oneOrMore`),J=B_(`optional`),Y=e=>({type:`action`,run:t=>e(t)??void 0}),X=e=>Y(t=>{t.expecting=e}),Z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&G(...e.expansion),semantic:e.semantic}),H_=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),U_=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=H_(e,n);return n},W_=(...e)=>{let t=e.map(x);return e=>t.includes(U_(e,1).kind)},G_=(e,t=U_(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},K_=e=>{let t=U_(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},q_=e=>W_(`CASESEP`)(e)&&G_(e),J_=e=>{let t=U_(e,1);M_.has(t.kind)&&(t.kind=E_)},Y_=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,X_=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),Z_=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Q_=e=>e.operatorStacks[e.operatorStacks.length-1],$_=(e,t)=>e.low>t.high,ev=(e,t)=>e.high<t.low,tv=e=>e.fix===`prefix`?e:F_.get(`${e.name}.`),nv=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===I_?X_(`FcnAppl`,[n,...r.node.heirs]):X_(`PostfixExpr`,[n,r.node]),operator:void 0})},rv=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:X_(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:X_(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},iv=e=>{let t=Q_(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return nv(t,n),iv(e);if(i.operator!==void 0){let t=tv(r.operator);return t!==void 0&&$_(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Y_(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${Y_(e,a.node.first,a.node.last)} and expression at location ${Y_(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return ev(a.operator,r.operator)?void 0:$_(a.operator,r.operator)?(rv(t,a.operator),iv(e)):`Precedence conflict between ops ${a.operator.name} in block ${Y_(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=tv(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(ev(s,r.operator))return;if(!$_(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Y_(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return rv(t,s),iv(e);let c=Y_(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===L_?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},av=e=>Y(t=>{let n=Q_(t),r=Z_(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:iv(t)}),ov=av(()=>!1),sv=av(()=>!0),cv=Y(e=>{e.lastOperator=F_.get(e.token.image)}),lv=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},uv=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?lv(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},dv=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!G_(e,n.first.beginColumn))return n;let t=dv(e,n);if(t!==void 0)return t}},fv=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(x),n=(e,...t)=>t.some(t=>e.kind===x(t)),r=e=>e!==void 0&&k_.has(e.kind),i=e.token,a=H_(e,i);i.next=void 0;let o=H_(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===E_&&(e=e.next)}else if(e.kind===E_){let t=e.next;!r(t)||j_.has(t.kind)||A_.has(t.kind)&&t.next?.kind!==E_||(e=t.next?.kind===x(`SUBSTITUTE`)?i:A_.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==D_&&(e.next={kind:D_,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=H_(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},pv=e=>{let t=U_(e,1);if(t.kind===x(`LAB`)){let n=1;for(;n!==0;)if(t=H_(e,t),t.kind===x(`LAB`)&&n++,t.kind===x(`RAB`)&&n--,t.kind===T_)return!1;return H_(e,t).kind===x(`IN`)}if(t.kind!==E_)return!1;for(t=H_(e,t);t.kind===x(`COMMA`);){if(t=H_(e,t),t.kind!==E_)return!1;t=H_(e,t)}return t.kind===x(`IN`)},mv=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),hv=e=>e.proofLevels.at(-1)??-1,gv=e=>{let t=U_(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:W_(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||hv(e)>=0&&mv(t)>hv(e):W_(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},_v=(e,t)=>{let n=mv(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},vv=e=>Y(t=>_v(t,t.token)?void 0:`${Y_(t,t.token)}: ${e}`),yv=R_([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(x)),bv=R_([...yv.kinds,x(`op_76`)]),xv=R_(A_),Sv=R_(j_),Cv=R_([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(x)),wv=()=>q(Z({expansion:[K(yv,`<op_77>`)],semantic:G_}),K(`PrefixOp`,`InfixOp`),sv),Tv=()=>K(G(Z({expansion:[`OpenStart`],semantic:G_}),`OpenExpression`,ov),G(Z({semantic:G_}),`ExtendableExpr`)),Ev=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),Dv=()=>K(G(Z({semantic:e=>W_(`ASSUME`,`BOXASSUME`)(e)||U_(e,2).kind===x(`COLONCOLON`)&&[x(`ASSUME`),x(`BOXASSUME`)].includes(U_(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Ov=()=>[`JuncItem`,q(Z({semantic:K_}),`JuncItem`)],kv=e=>Y(t=>{t.expecting=e,J_(t)}),Av=e=>Y(t=>{t.isTerminalProof=e}),jv=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{fv(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),Mv={CompilationUnit:Q(void 0,[Y(fv),J(`Prelude`),`Module`]),Prelude:Q(void 0,[`<BEGIN_PRAGMA>`,q(K(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Q(`Module definition`,[X(`---- MODULE`),`BeginModule`,X(`EXTENDS clause or module body`),`Extends`,X(`Module body`),`Body`,X(`==== or more Module body`),`EndModule`]),BeginModule:Q(`Begin module`,[X(`---- MODULE (beginning of module)`),K(`<_BM0>`,`<_BM1>`,`<_BM2>`),kv(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,kv(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,kv(`Identifier`),`Identifier`))]),Body:Q(`Module body`,[X(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),q(K(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,G(Z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,G(Z({amount:2}),`Instance`),G(Z({amount:2}),`Assumption`),G(Z({amount:2}),`Theorem`),G(Z({amount:1}),`Module`,Y(fv)),G(Z({semantic:e=>W_(`USE`)(e)&&U_(e,2).kind!==x(`ONLY`)||W_(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Q(`variable declaration`,[`<VARIABLE>`,X(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,X(`Identifier`),`Identifier`)]),ParamDeclaration:Q(`Parameter declaration`,[X(`CONSTANT`),`ParamSubDecl`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Q(`Recursive`,[X(`RECURSIVE`),`<RECURSIVE>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X("`,' or `)'"))]),ConstantDeclarationItems:Q(`Constant declaration items`,[X(`Identifier, _ or prefix op`),K(G(`Identifier`,X(`(, comma, or Module Body`),J(Z({amount:2}),`<LBR>`,X(`_`),`<US>`,X(`comma or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`comma or )`)),`<RBR>`)),G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`prefix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Q(`Definition`,[X(`LOCAL, Identifier or Operator Symbol`),J(`<LOCAL>`),`<DEFBREAK>`,X(`LOCAL, Identifier or Operator Symbol`),K(jv(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),jv(`Expression`,Z({expansion:[`<IDENTIFIER>`,Sv]}),`PostfixLHS`,`Expression`),jv(`Expression`,Z({expansion:[`<IDENTIFIER>`,xv]}),`InfixLHS`,`Expression`),jv(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),jv(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Q(`Identifier tuple`,[`<LAB>`,X(`Identifier or >>`),J(`Identifier`,X(`COMMA or >>`),q(`<COMMA>`,X(`COMMA or >>`),`Identifier`,X(`COMMA or >>`))),`<RAB>`]),IdentLHS:Q(`Identifier LHS`,[`Identifier`,X(`( or ==`),J(`<LBR>`,X(`Identifier Declaration, prefix op, _ or )`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`),q(`<COMMA>`,X(`Identifier Declaration, prefix op or _`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Q(`Prefix LHS`,[bv,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,xv,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,Sv]),IdentDecl:Q(`Identifier Declation`,[`Identifier`,X(`( or ...`),J(`<LBR>`,X(`_`),`<US>`,X(`COMMA or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Q(`Op. Symbol Declaration`,[K(G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`infix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),Instance:Q(`Instance`,[X(`LOCAL or instance`),J(`<LOCAL>`),`Instantiation`,X(`COMMA or Module Body`)]),Instantiation:Q(`NonLocalInstance`,[`<INSTANCE>`,kv(`Module identifier`),`Identifier`,X(`WITH or another definition.`),J(`<WITH>`,X(``),`Substitution`,X(``),q(Z({amount:3}),`<COMMA>`,X(``),`Substitution`,X(``)))]),Substitution:Q(`Substitution`,[K(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),X(`<-`),`<SUBSTITUTE>`,X(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Q(void 0,[yv,cv]),NonExpPrefixOp:Q(void 0,[bv,cv]),InfixOp:Q(`Infix Op`,[xv,cv]),PostfixOp:Q(void 0,[Sv,cv]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{fv(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),Dv(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),Dv(),X("PROVE or `,'")),K(`<PROVE>`,`<BOXPROVE>`),X(`Expression`),`Expression`))]),NewSymb:Q(`NEW symbol declaration`,[X(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),K(G(Z({amount:2}),K(G(Z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),X(`Constant declaration`),K(G(Z({amount:2}),`IdentDecl`,J(`<IN>`,Y(e=>{let t=Z_(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Y_(e,t.first,t.last)}`:void 0}),X(`Expression`),`Expression`)),`SomeFixDecl`)),G(Z({amount:2}),J(`<NEW>`),`<VARIABLE>`,X(`Identifier`),`Identifier`),G(Z({amount:2}),J(`<NEW>`),K(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),X(`Declaration`),K(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Q(`Domain binding`,[J(`<IN>`,X(`Expression`),`Expression`)]),Theorem:Q(`Theorem`,[X(`THEOREM, PROPOSITION`),K(`<THEOREM>`,`<PROPOSITION>`),X(`Identifier, Assume-Prove or Expression`),J(Z({amount:2}),`Identifier`,X(`==`),`<DEF>`),Y(fv),K(G(Z({amount:3}),Z({semantic:W_(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:gv}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>W_(`BY`)(e)||U_(e,2).kind===x(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>U_(e,2).kind!==x(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,Av(!0),J(`<ONLY>`)),G(`<USE>`,Av(!1),J(`<ONLY>`)),G(`<HIDE>`,Av(!1))),X("an expression, `MODULE' or `DEF'"),J(Ev(),q(`<COMMA>`,X(`MODULE or expression`),Ev(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),Ev(),q(`<COMMA>`,X(`MODULE or expression`),Ev(),Y(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),Y(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Q(`QED step`,[X(`Step number`),Cv,vv(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:gv}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),Cv,vv(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:W_(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:W_(`INSTANCE`)}),`Instantiation`),G(Z({semantic:W_(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:gv}),Y(e=>{let t=Z_(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Y_(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),V_(Z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Q(`HaveStep`,[`<HAVE>`,X(`expression`),`Expression`]),TakeStep:Q(`TakeStep`,[`<TAKE>`,X(`identifier`),K(G(Z({expansion:[K(G(`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,X(`comma or step`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or proof step`))),G(`Identifier`,X(`comma or proof step`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or proof step`))))]),WitnessStep:Q(`WitnessStep`,[`<WITNESS>`,X(`expression`),`Expression`,q(`<COMMA>`,X(`expression`),`Expression`,X(`comma or colon`))]),PickStep:Q(`PickStep`,[`<PICK>`,X(`identifier`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,X(`comma, or colon`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or colon`))),G(`QuantBound`,X(`comma or colon`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or colon`)))),`<COLON>`,X(`expression`),`Expression`]),CaseStep:Q(`CaseStep`,[`<CASE>`,X(`expression`),`Expression`]),AssertStep:Q(`AssertStep`,[J(`<SUFFICES>`,X(`expression or ASSUME/PROVE`)),K(`Expression`,G(Z({semantic:W_(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Q(void 0,[K(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Q(void 0,[K(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Q(`String`,[`<STRING_LITERAL>`]),Number:Q(void 0,[`<NUMBER_LITERAL>`,J(Z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,q(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Q(void 0,[K(G(Z({amount:2,expansion:[K(bv,xv,Sv),R_([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(x))],semantic:G_}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Y_(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:G_}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Q(`Quantified form`,[K(`<EXISTS>`,`<FORALL>`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,q(`<COMMA>`,`Identifier`)),G(`QuantBound`,q(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Q(`Bound Quantified Expression`,[K(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,q(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Q(`Quant Bound`,[K(`IdentifierTuple`,G(`Identifier`,q(`<COMMA>`,`Identifier`,X(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Q(`Some { } form`,[`<LBC>`,J(K(G(Z({semantic:pv}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),V_(`<COMMA>`,`Expression`)))),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,q(`<COMMA>`,`Expression`)),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,q(`<COMMA>`,`QuantBound`)),G(`Expression`,J(K(G(`<COLON>`,Y(e=>{let t=Z_(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,q(`<COMMA>`,`QuantBound`)),V_(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:pv}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>U_(e,2).kind===x(`MAPTO`)&&M_.has(U_(e,1).kind)}),Y(e=>{U_(e,1).kind=E_}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,q(`<COMMA>`,`FieldSet`),`<RSB>`),G(`Expression`,K(G(q(`<COMMA>`,`Expression`),`<RSB>`,Y(e=>{let t=e.frames[e.frames.length-1];t.node=X_(`FcnAppl`,t.heirs),e.lastOperator=I_})),G(`<ARROW>`,`Expression`,`<RSB>`),G(`<EXCEPT>`,`ExceptSpec`,q(`<COMMA>`,`ExceptSpec`),`<RSB>`),G(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Q(`Except Spec`,[`<BANG>`,V_(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(J_),`Identifier`,Y(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===x(`RBR`)}))]),ReducedExpression:Q(`restricted form of expression`,[K(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Q(`Fairness Expression`,[Y(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),K(`<WF>`,`<SF>`),`ReducedExpression`,J(Z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,Y(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Q(`CASE Expression`,[`<CASE>`,`CaseArm`,q(Z({semantic:e=>q_(e)&&U_(e,2).kind!==x(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:q_}),`<CASESEP>`,`OtherArm`)]),CaseArm:Q(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Q(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Q(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Q(`Let Definitions`,[V_(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=U_(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...Ov()),G(Z({expansion:[`<AND>`]}),...Ov())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=dv(t,e.heirs[1]);return n&&`Item at ${Y_(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Y_(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Q(`(Un)Bounded Choose`,[`<CHOOSE>`,K(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Q(`Lambda`,[`<LAMBDA>`,X(`Identifier`),`Identifier`,X("`,' or `:'"),q(`<COMMA>`,X(`Identifier`),`Identifier`,X("`,' or `:'")),`<COLON>`,X(`Expression`),`Expression`]),Expression:Q(`Expression`,[Y(e=>{e.operatorStacks.push([])}),wv(),Tv()],(e,t)=>{let n=Q_(t);n.push({node:e.heirs[0],operator:L_});let r=iv(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Q(`ExtendableExpr`,[K(G(Z({expansion:[K(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),ov,q(K(G(Z({expansion:[`PostfixOp`],semantic:G_}),`PostfixOp`,sv),G(Z({expansion:[`<DOT>`],semantic:G_}),`<DOT>`,Y(J_),Z({semantic:G_}),`Identifier`,Y(e=>{let t=Q_(e);t[t.length-1].operator!==void 0&&nv(t,t.length),t[t.length-1]={node:X_(`RecordComponent`,[t[t.length-1].node,Z_(e,2),Z_(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:G_}),X(`function argument`),`SBracketCases`,av(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:G_}),`InfixOp`,sv,wv(),Tv()),G(Z({expansion:[`<COLONCOLON>`],semantic:G_}),`<COLONCOLON>`,Y(e=>{let t=Q_(e);if(!uv(t[t.length-1].node))return`\`::' at ${Y_(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=Q_(e),n=Z_(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!ev(r,e.lastOperator)){let t=Z_(e,3);return`Removing label at ${Y_(e,t.first,t.last)} would change expression parsing.`}t.push({node:X_(`Label`,[Z_(e,3),Z_(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:G_}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:G_}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>hv(e)<0&&e.proofLevels.length<=1?`${Y_(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Y_(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,G(Z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),J(Z({amount:2}),`OpArgs`),q(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:lv(e.heirs)===void 0?e.heirs.length===1?X_(`GeneralId`,e.heirs):void 0:X_(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>U_(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),J(Z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Q(`StructOp`,[X("`<<' , `>>' , `:' , `@' , or number"),K(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,G(Z({semantic:e=>U_(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Y_(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},Nv=/* @__PURE__ */ new Map,Pv=e=>{let t=Nv.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=Pv(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,Pv(Mv[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return Nv.set(e,n),n},Fv=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},Iv=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=H_(e,e.scanPosition)),e.scanPosition=H_(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},Lv=(e,t)=>{if(t.type===`tokens`)return Iv(e,t.kinds);if(t.type===`call`)return Lv(e,Mv[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||Fv(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=Lv(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||Fv(e,t.semantic)?Lv(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=Lv(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=Lv(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},Rv=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=Lv(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},zv=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||Pv(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!Pv(a).hasSemanticStart?Pv(a).first.has(U_(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):Rv(e,i,a)&&(o===void 0||o(e))}),Bv=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,Lv(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=H_(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===T_){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=H_(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Te(e.token.image)}" `},Vv=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??Bv(e)}\n\nResidual stack trace follows:\n${r}`,!1},Hv=(e,t)=>{let n=H_(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,Vv(e))},Uv=(e,t)=>{let n=Mv[t];n.message!==void 0&&(e.messages.push({name:n.message,token:U_(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!Wv(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return Vv(e,i);let a=r.node??(r.heirs.length===0?void 0:X_(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},Wv=(e,t)=>{if(t.type===`tokens`)return Hv(e,t.kinds);if(t.type===`call`)return Uv(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||Vv(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||Vv(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||Wv(e,t));if(t.type===`choice`){let n=zv(e,t.alternatives);return n===-1?Vv(e):Wv(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!Wv(e,t.body))return!1;if(t.type===`optional`)return zv(e,[t.body])===-1||Wv(e,t.body);for(;zv(e,[t.body])===0;)if(!Wv(e,t.body))return!1;return!0},Gv=e=>{let t=Ce(e),n={kind:T_,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],pushedErrors:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=Wv(r,{type:`call`,name:`CompilationUnit`});if(r.lexicalError!==void 0)return r.lexicalError;let a=[...r.pushedErrors,...i||r.report===void 0?[]:[`***Parse Error***\n${r.report}`]];return a.length===0?void 0:a.join(`
|
|
1783
|
+
`)},Kv={low:15,high:15},qv={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),Jv=new Map([[`=>`,$(1,1,!1)],[`<=>`,$(2,2,!1)],[`~>`,$(2,2,!1)],[`-+->`,$(2,2,!1)],[`/\\`,$(3,3,!0)],[`\\/`,$(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,$(5,5,!1)]),[`\\cdot`,$(5,14,!0)],[`@@`,$(6,6,!0)],[`:>`,$(7,7,!1)],[`<:`,$(7,7,!1)],[`\\cup`,$(8,8,!0)],[`\\cap`,$(8,8,!0)],[`\\`,$(8,8,!1)],[`..`,$(9,9,!1)],[`...`,$(9,9,!1)],[`##`,$(9,13,!0)],[`$`,$(9,13,!0)],[`$$`,$(9,13,!0)],[`??`,$(9,13,!0)],[`!!`,$(9,13,!1)],[`\\sqcap`,$(9,13,!0)],[`\\sqcup`,$(9,13,!0)],[`\\uplus`,$(9,13,!0)],[`\\wr`,$(9,14,!1)],[`+`,$(10,10,!0)],[`++`,$(10,10,!0)],[`(+)`,$(10,10,!0)],[`\\oplus`,$(10,10,!0)],[`%`,$(10,11,!1)],[`%%`,$(10,11,!0)],[`|`,$(10,11,!0)],[`||`,$(10,11,!0)],[`\\X`,$(10,13,!1)],[`-`,$(11,11,!0)],[`--`,$(11,11,!0)],[`(-)`,$(11,11,!0)],[`\\ominus`,$(11,11,!0)],[`*`,$(13,13,!0)],[`**`,$(13,13,!0)],[`/`,$(13,13,!1)],[`//`,$(13,13,!1)],[`\\div`,$(13,13,!1)],[`\\o`,$(13,13,!0)],[`(.)`,$(13,13,!0)],[`\\odot`,$(13,13,!0)],[`(/)`,$(13,13,!1)],[`\\oslash`,$(13,13,!1)],[`(\\X)`,$(13,13,!0)],[`\\otimes`,$(13,13,!0)],[`&`,$(13,13,!0)],[`&&`,$(13,13,!0)],[`\\star`,$(13,13,!0)],[`\\bullet`,$(13,13,!0)],[`\\bigcirc`,$(13,13,!0)],[`^`,$(14,14,!1)],[`^^`,$(14,14,!1)]]),Yv=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Xv=/* @__PURE__ */ new Set([...Yv,`'`]),Zv=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Qv=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),$v=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),ey=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),ty=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...Xv]),ny=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),ry=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),iy=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),ay=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),oy=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),sy=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),cy=/* @__PURE__ */ new Set([``,`*`,`-`]),ly={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},uy=(e,t)=>e.line-t.line||e.column-t.column,dy=(e,t)=>({start:uy(e.start,t.start)<=0?e.start:t.start,stop:uy(e.stop,t.stop)>=0?e.stop:t.stop}),fy=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),py=(t,n,r=`Proof.Parser`)=>new e.F(t,void 0,{reason:t,line:n.start.line,column:n.start.column,isEnd:!1,proof:{stop:n.stop,exception:r}}),my=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),hy=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),gy=/* @__PURE__ */ new Set([`NEW`,...hy.keys()]),_y=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),vy=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),yy=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),by=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Jv.has(e.operator):Yv.has(e.operator)),xy=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,Sy=e=>Jv.has(e)||Yv.has(e)||e===`-.`,Cy=(e,t,n)=>{switch(e){case`ENABLED`:return{kind:`Enabled`,expression:t,location:n};case`UNCHANGED`:return{kind:`Unchanged`,expression:t,location:n};case`[]`:return{kind:`Always`,expression:t,location:n};case`<>`:return{kind:`Eventually`,expression:t,location:n};case`'`:return{kind:`Prime`,expression:t,location:n};default:return{kind:`Apply`,operator:e,args:[t],location:n}}},wy=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.replace(/\r?\n$/,``).split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
|
|
1784
|
+
`)}\n`},Ty=(t,n,r=ae(t,n===`tlapm`))=>{let i=n===`tlapm`,a=i?r:r.map(ne),o=0,s=[],l,u,d=[],f=/* @__PURE__ */ new Set,p=[],m=[],h=e=>d[d.length-1].has(e),g=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),_=[],ee=[],te=[],v=(e,t=o-1)=>{let n=e===t?te[e]:void 0;if(n)return n;let r=a[t];_[e]??=g(a[e]),ee[t]??={line:r.line,column:r.endColumn};let i={module:m[0].name,start:_[e],end:ee[t]};return e===t&&(te[e]=i),i},y=(e,t)=>(e.location.range=v(t),e),re=(e=0)=>a[Math.min(o+e,a.length-1)],b=(e=0)=>{let t=re(e),n=s[s.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ie=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),oe=0,se=e=>{let t=a.slice(oe,o).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ce=e=>i&&(e.kind===`Keyword`||yy.has(e.text)),x=e=>{let t=a.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},le=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:sy.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:ce(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,S=(t,n=re(),r)=>{let i=a[a.length-1],o=n.line===i.line&&n.column===i.column;return new e.F(`${t} at line ${n.line}, column ${n.column}`,void 0,ue(t,n,o,r))},ue=(e,t,n,r)=>{if(i&&n){let e=a[a.length-1];return{reason:`Unexpected EOF`,...se(x(e)),isEnd:n}}return i&&r?{reason:`Unexpected ${le(r)}`,...x(r),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},de=(e,t=re())=>S(e,t,t),fe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ce(e),C=(e,t=0)=>{let n=b(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},w=()=>{let e=b();if(e.kind===`End`)throw S(`Unexpected end of expression`);return o++,e},T=e=>C(e)?(o++,!0):!1,E=e=>{if(!C(e))throw de(`Expected ${JSON.stringify(e)} but found ${ie(b())}`);return w()},pe=()=>{let e=b();if(e.kind!==`Identifier`)throw de(`Expected an identifier but found ${ie(e)}`);if(ce(e))throw de(`Unexpected keyword ${e.text}`);return o++,e.text},me=()=>{let e=o;return{name:pe(),range:v(e)}},he=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),ge=()=>{let e=b();return e.kind!==`String`&&(Qv.has(e.text)||Jv.has(e.text)||Xv.has(e.text))?(o++,e.text):pe()},_e=!1,ve=()=>b().kind===`Identifier`||!fe(b())?pe():(_e=!0,w().text),ye=e=>{if(!i)return e();s.push(-1);let t=e();return s.pop(),t},D=(e,t=`,`)=>{let n=[e()];for(;T(t);)n.push(e());return n},be=()=>{if(C(`<<`)){let e=1;for(;b(e).kind===`Identifier`||C(`,`,e);)e++;return C(`>>`,e)&&C(`\\in`,e+1)}let e=0;for(;b(e).kind===`Identifier`;){if(C(`\\in`,e+1))return!0;if(!C(`,`,e+1))return!1;e+=2}return!1},xe=()=>{if(C(`::`))return!0;if(!C(`(`))return!1;let e=1;for(;b(e).kind===`Identifier`&&C(`,`,e+1);)e+=2;return b(e).kind===`Identifier`&&C(`)`,e+1)&&C(`::`,e+2)},Se=()=>{if(!T(`<<`)){let e=me();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=he(C(`>>`)?[]:D(me));return E(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Ce=()=>D(()=>{let e=D(Se);E(`\\in`);let t=k();return e.map(e=>({pattern:e,set:t}))}).flat(),we=()=>{let e=b();if(i&&yy.has(e.text)){let t=o;w();let n={kind:`Identifier`,name:e.text,location:g(e)};return{subscript:y(n,t),lastArgs:[]}}let t=i&&(e.kind===`Number`||e.kind===`String`||C(`@`));if(e.kind===`Identifier`){let t=o,n=[],r=[],a=e=>(r.push(v(o,o)),n.push(pe()),e&&C(`(`)?ke():[]),s=[a(!i)];for(;C(`!`)&&b(1).kind===`Identifier`;)w(),s.push(a(!0));let c=s.slice(0,-1),l=g(e);l.range={...v(t),end:r[r.length-1].end};let u=n.join(`!`);return{subscript:c.every(e=>e.length===0)?{kind:`Identifier`,name:u,location:l}:{kind:`Apply`,operator:u,args:c.flat(),argumentCounts:[...c.map(e=>e.length),0],argumentsRange:l.range,selectorRanges:r,location:l},lastArgs:s[s.length-1]}}if(C(`<<`)||C(`(`)||C(`{`)||C(`[`)||t){let e=o,t=ze();return{subscript:t.location.range?t:y(t,e),lastArgs:[]}}throw de(`Expected a subscript but found ${ie(e)}`)},Te=e=>{let t=b(1),n=b(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&C(`==`,Xv.has(n.text)?3:4))},Ee=e=>{let t=b(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||C(`,`,1)||C(`)`,1)||t.kind===`Keyword`&&ry.has(t.text)||Te(e)},De=()=>{let e=b(),t=e.kind===`Operator`&&(Jv.has(e.text)||Zv.has(e.text))&&Ee(e);if(i&&e.kind!==`String`&&(Zv.has(e.text)||ty.has(e.text)&&e.text!==`'`&&!Yv.has(e.text)||ey.has(e.text)&&b(-1).text===`(`&&b(-1).line===e.line&&b(-1).endColumn+1===e.column&&b(1).text===`)`&&b(1).line===e.line&&b(1).column===e.endColumn+1)&&Ee(e))throw S(`incomplete expression`,e);if(t&&!i&&e.text===`\\X`&&e.spelling!==`×`)throw S(`\\X may not be used as an infix operator`,e);if(t)return o++,y({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:g(e)},o-1);if(e.kind!==`String`&&ty.has(e.text)&&Ee(e)){o++;let t=g(e);if(Yv.has(e.text))return y({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o-1);let n={kind:`Identifier`,name:`argument`,location:t};return y({kind:`Lambda`,params:[n.name],body:Cy(e.text,n,t),operator:e.text,location:g(e)},o-1)}if(C(`LAMBDA`)){let t=o;w();let n=he(D(me));E(`:`);let r=k();return y({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:g(e)},t)}return k()},Oe,ke=()=>ye(()=>{let e=o;E(`(`);let t=D(De);return E(`)`),Oe=v(e),t}),Ae=()=>{let e=w();s.push(e.column);let t=[k()];for(;xy(re())&&re().text===e.text&&re().column===e.column;)o++,t.push(k());return s.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:g(e)}},je=e=>ye(()=>{let t=g(e),n=b().kind===`Identifier`,r=C(`|->`,1)&&(n||fe(b()));if(r||n&&C(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o,n=g(b()),i=e();return n.range=v(t),E(r?`|->`:`:`),{name:i,value:k(),location:n}},a=[i(()=>n?pe():w().text),...T(`,`)?D(()=>i(pe)):[]];return E(`]`),{kind:e,fields:a,location:t}}if(be()){let e=o,n=Ce();if(!i||C(`|->`)){E(`|->`);let e=k();return E(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}o=e}let a=k();if(T(`->`)){let e=k();return E(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(T(`EXCEPT`)){let e=D(()=>{E(`!`);let e=[];for(;C(`.`)||C(`[`);)if(T(`.`)){if(!fe(b()))throw de(`Expected a field name but found ${ie(b())}`);if(!i&&C(`@`))throw de(`@ used in !.@`);e.push({kind:`Field`,name:w().text})}else E(`[`),e.push({kind:`Index`,args:D(()=>k())}),E(`]`);return E(`=`),{path:e,value:k()}});return E(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!C(`]_`)){let e=[a];for(;T(`,`);)e.push(k());return E(`]`),{kind:`Bracket`,args:e,location:t}}return E(`]_`),{kind:`BoxAction`,action:a,subscript:we().subscript,location:t}}),Me=()=>{let e=o,t=y(O(),e),n=g(w());return y({kind:`Apply`,operator:`\\in`,args:[t,k()],location:n},e)},Ne=e=>ye(()=>{let t=g(e);if(T(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(be()&&(b(1).text===`\\in`||C(`<<`))){let e=o,n=Se();E(`\\in`);let r=k();if(T(`:`)){let e=k();return E(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o=e}let n=b().kind===`Identifier`&&C(`\\in`,1)?Me():k();if(T(`:`)){let e=Ce();return E(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;T(`,`);)r.push(k());return E(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Pe=e=>{let t=g(e),n=ye(()=>C(`>>`)||C(`>>_`)?[]:D(()=>k()));if(T(`>>_`)){if(n.length!==1)throw S(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:we().subscript,location:t}}return E(`>>`),{kind:`Tuple`,elements:n,location:t}},Fe=e=>{let t=g(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&be()){let e=Ce();return E(`:`),{kind:n,bounds:e,body:k(),location:t}}let i=he(D(me));return E(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:k(),isTemporal:r,location:t}},Ie=e=>{let t=[];do{let n=o;if(T(`OTHER`))return E(`->`),{kind:`Case`,arms:t,other:k(),otherRange:v(n),location:g(e)};let r=k();E(`->`),t.push({condition:r,body:k()})}while(T(`[]`));return{kind:`Case`,arms:t,other:void 0,location:g(e)}},Le=()=>{let e=b(1);return C(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||ny.has(e.text)||e.kind===`Operator`&&(Jv.has(e.text)||Xv.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&Qv.has(e.text))},Re=()=>{let e=w();if(e.kind===`Number`)return{kind:`Operand`,operand:c(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return o--,{kind:`Bound`,args:ke()}}return{kind:`Name`,name:e.text,args:C(`(`)?ke():[]}},ze=e=>{let t=o,r=w(),a=g(r);if(i&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=D(pe);return E(`:`),{kind:`Lambda`,params:e,body:k(),location:a}}if(r.kind===`Number`){if(i&&/^\\[BOH]/.test(r.text))throw S(`incomplete expression`,r);return{kind:`Number`,value:c(r.text),text:r.text,location:a}}if(r.kind===`Decimal`)return{kind:`Decimal`,text:r.text,location:a};if(r.kind===`String`)return{kind:`String`,value:r.text,location:a};let s=r.kind===`Step`&&nt(r);if(!i&&s&&$e()<0&&Qe.length<=1)throw S(`Step number used outside proof`,r);if(s&&r.text[1]===`+`)throw S(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||s){let n=s?rt(r)??r.text:r.text;if(xe()){let o=he(T(`(`)?D(me):[]);o.names.length>0&&E(`)`),E(`::`);let s=v(t),c=k();if(!i&&e!==void 0&&l!==void 0&&by(c)&&e.high>=l.low)throw S(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:n,params:o.names,paramRanges:o.ranges,head:s,body:c,location:a}}let c=C(`(`);if(n===`@`&&!c&&!Le())return{kind:`ExceptAt`,location:a};let u=c?ke():[],d=[c?Oe:void 0];if(!Le())return c?{kind:`Apply`,operator:n,args:u,argumentsRange:Oe,location:a}:{kind:`Identifier`,name:n,location:a};let f=[{kind:`Name`,name:n,args:u}],p=[v(t,t)];for(;Le();)w(),p.push(v(o,o)),Oe=void 0,f.push(Re()),d.push(Oe);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),g=f.flatMap(e=>`args`in e?e.args:[]),_=f.map(e=>`args`in e?e.args.length:0),ee=d.at(-1)??v(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:a}:g.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:a}:{kind:`Apply`,operator:h,args:g,..._.slice(0,-1).some(e=>e>0)&&{argumentCounts:_},argumentsRange:ee,selectorRanges:p,argumentRanges:d,location:a}}if(r.kind===`Operator`&&Sy(r.text)&&C(`(`)){let e=ke();return n===`tlc`&&r.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:a}:{kind:`Apply`,operator:r.text,spelling:r.spelling,args:e,location:a}}if(r.kind===`Operator`&&Sy(r.text)&&!i)return{kind:`Identifier`,name:r.text,spelling:r.spelling,location:a};switch(r.text){case`(`:{let e=ye(()=>k());return E(`)`),e}case`[`:return je(r);case`{`:return Ne(r);case`<<`:return Pe(r);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Fe(r);case`IF`:{let e=k();E(`THEN`);let t=k();return E(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:k(),location:a}}case`CASE`:return Ie(r);case`LET`:{let e=[],t=[];for(d.push(/* @__PURE__ */ new Set);!T(`IN`);){if(i&&C(`RECURSIVE`))throw S(`Unexpected keyword RECURSIVE`,se(re()));if(T(`RECURSIVE`)){Ye();continue}let n=Ue(!i&&T(`LOCAL`));n.kind===`Instance`?t.push(n):e.push(n)}d.pop();let n=k();return t.length===0?{kind:`Let`,definitions:e,body:n,location:a}:{kind:`Let`,definitions:e,instances:t,body:n,location:a}}case`CHOOSE`:{let e=Se(),t=T(`\\in`)?k():void 0;return E(`:`),{kind:`Choose`,pattern:e,set:t,body:k(),location:a}}case`WF_`:case`SF_`:{let e=we(),t=!C(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:ye(()=>{E(`(`);let e=k();return E(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:a}}}throw de(`Unexpected ${ie(r)}`,r)},Be=(e,t,n)=>{l=u={low:t,high:n};let r=k(i?Math.min(n+1,Kv.low):n+1),a=b(),o=Xv.has(a.text)?Kv.high:Jv.get(a.text)?.high;if(!i&&a.kind===`Operator`&&o!==void 0&&o>=t)throw S(`Precedence conflict between ${e.text} and ${a.text}`,a);return r},O=()=>{let e=u;u=void 0;let t=b(),n=g(t);if(t.kind===`Operator`&&xy(t))return Ae();if(i&&Jv.has(t.text)&&C(`(`,1)){let e=o,r=ye(()=>{w(),w();let r=k();if(!T(`,`))return;let i=k();E(`)`);let a={kind:`Apply`,operator:t.text,args:[r,i],location:n};return y(a,e)});if(r!==void 0)return r;o=e}if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return w(),{kind:`Apply`,operator:`~`,args:[Be(t,4,4)],location:n};case`-`:case`-.`:if(t.text===`-.`&&!i)break;return w(),{kind:`Apply`,operator:`-.`,args:[Be(t,12,12)],location:n};case`[]`:return w(),{kind:`Always`,expression:Be(t,4,15),location:n};case`<>`:return w(),{kind:`Eventually`,expression:Be(t,4,15),location:n};case`ENABLED`:return w(),{kind:`Enabled`,expression:Be(t,4,15),location:n};case`UNCHANGED`:return w(),{kind:`Unchanged`,expression:Be(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return w(),{kind:`Apply`,operator:t.text,args:[i?k(9):Be(t,10,13)],location:n}}return ze(e)},k=(e=0)=>{let t=o,n=O(),r=n.location.range?n:y(n,t),a;for(;;){let n=b();if(n.kind!==`Operator`)break;let o=g(n);if(n.text===`'`&&e<=15){w(),l=Kv,r=y({kind:`Prime`,expression:r,location:o},t);continue}if(Yv.has(n.text)&&e<=15){w(),l=Kv,r=y({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r],location:o},t);continue}if(n.text===`[`){w();let e=ye(()=>D(()=>k()));ye(()=>E(`]`)),l=qv,r=y({kind:`FunctionApplication`,function:r,args:e,location:o},t);continue}if(n.text===`.`&&fe(b(1))){w();let e=w().text;r=y({kind:`FieldAccess`,record:r,field:e,location:o},t);continue}let s=Jv.get(n.text);if(!s||s.low<e)break;if(a){let e=!(a.low>s.high||a.high<s.low),t=a.text===n.text&&s.isAssociative;if(e&&!t&&(a.text!==`\\X`||n.text!==`\\X`))throw S(`Precedence conflict between ${a.text} and ${n.text}`,n)}if(w(),!i&&s.low>12&&C(`-`))throw S(`Precedence conflict between ${n.text} and -`,b());l=u=s;let c=k(s.high+1);if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,i=[v(t).end];r=r.kind===e&&a?.text===n.text?{...r,operands:[...r.operands,c],prefixEnds:[...r.prefixEnds??[],...i]}:{kind:e,operands:[r,c],prefixEnds:i,location:o}}else r=n.text===`\\X`?r.kind===`Product`&&a?.text===`\\X`?{...r,factors:[...r.factors,c]}:{kind:`Product`,factors:[r,c],location:o}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r,c],location:o};r=y(r,t),a={...s,text:n.text}}return r},Ve=()=>{if(!T(`(`))return[];let e=Je();return E(`)`),e},He=()=>{let e=g(b()),t=k(),n=a[o-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:m[0].name,start:e,end:r}}},Ue=e=>{let t=o;return y(A(e),t)},We=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),A=e=>{let t=b(),n=o,r=g(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:v(n,o-2),...He(),isLocal:e,isRecursive:h(t),location:r});if(t.kind===`Identifier`&&b(1).kind===`Operator`&&Jv.has(b(1).text)&&b(2).kind===`Identifier`&&C(`==`,3)){let e=me(),t=w().text,n=me();return E(`==`),i(t,[We(e),We(n)])}let a=t.kind!==`String`&&Qv.has(t.text),s=t.kind===`Identifier`&&Xv.has(b(1).text)&&C(`==`,2);if(a||s){let e=a?t.text:b(1).text;a&&w();let n=me();return s&&w(),E(`==`),i(e,[We(n)])}let c=pe();if(T(`[`)){let t=ye(()=>Ce());return E(`]`),E(`==`),{kind:`Function`,name:c,bounds:t,body:k(),isLocal:e,isRecursive:h(c),location:r}}let l=o,u=Ve();return E(`==`),C(`INSTANCE`)?{...Ge(c,u,e,r),definitionRange:v(l)}:i(c,u)},Ge=(e,t,n,r)=>{let i=o;return E(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ve(),substitutions:T(`WITH`)?D(()=>{let e=o,t=ge(),n=v(e);return E(`<-`),{name:t,nameRange:n,expression:De()}}):[],isLocal:n,location:r,instanceRange:v(i)}},Ke=()=>{let e=o;return y(qe(),e)},qe=()=>{let e=g(b());if(C(`_`)&&b(1).kind===`Operator`)return w(),{name:w().text,arity:T(`_`)?2:1,location:e};if(b().kind!==`String`&&(Qv.has(b().text)||i&&b().kind===`Operator`)&&C(`_`,1)){let t=w().text;return w(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=pe();if(!T(`(`))return{name:t,arity:0,location:e};let n=D(()=>E(`_`));return E(`)`),{name:t,arity:n.length,location:e}},Je=()=>D(Ke),Ye=()=>{let e=Je();return e.forEach(e=>d[d.length-1].add(e.name)),e},Xe=e=>{let t=0,n=e;do{let e=b(n);if(e.kind===`End`)return n;e.kind===`Operator`&&_y.has(e.text)&&t++,e.kind===`Operator`&&vy.has(e.text)&&t--,n++}while(t>0);return n},Ze=()=>{let e=b(),t=b(1);return e.kind===`Identifier`?C(`(`,1)||C(`[`,1)?C(`==`,Xe(1)):t.kind===`Operator`&&Xv.has(t.text)?C(`==`,2):t.kind===`Operator`&&Jv.has(t.text)?b(2).kind===`Identifier`&&C(`==`,3):C(`==`,1):e.kind!==`String`&&Qv.has(e.text)&&t.kind===`Identifier`&&C(`==`,2)},Qe=[],$e=()=>Qe[Qe.length-1]??-1,et=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),tt=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},nt=e=>!e.text.endsWith(`.`)&&!cy.has(tt(e)),rt=e=>{let t=tt(e);if(cy.has(t))return;let n=et(e);if(n>=0)return`<${n}>${t}`;let r=$e(),i=Qe[Qe.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},it=e=>{if(e.kind===`Keyword`)return ay.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Qe.length===0;if(e.text[1]===`+`||Qe.length===0)return!0;let t=$e();return t>=0&&et(e)>t},at=e=>{let t=et(e),n=Qe.length-1,r=Qe[n-1]??-1,i=Qe[n]<0;return i&&(Qe[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Qe[n]===t},ot=e=>!f.has(e)&&m.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),st=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!yy.has(e.name)&&!ot(e.name):!1,ct=()=>{let e=b();return e.kind===`Step`?nt(e):e.kind===`Keyword`?my.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Ze()},lt=()=>{let e=o,t=b();return t.kind===`Operator`&&!$v.has(t.text)&&Sy(t.text)?(o++,y({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:g(t)},e)):T(`MODULE`)?y({kind:`ModuleFact`,name:pe(),location:g(t)},e):k()},ut=e=>p[p.length-1]?.add(e),dt=e=>{p.push(/* @__PURE__ */ new Set);let t=e();return p.pop(),t},ft=e=>p.some(t=>t.has(e))||m.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),pt=()=>{let e=o,t=b(),n=D(()=>{let e=b();if((e.kind!==`Identifier`||ce(e))&&e.kind!==`Operator`)throw de(`Expected a definition name but found ${ie(e)}`,e);return o++,e.text},`!`),r=g(t);return y(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},mt=()=>{if(i)return D(pt);let e=D(lt),t=n===`tlc`?e.find(e=>e.kind===`Identifier`&&ft(e.name)):void 0;if(t)throw S(`DEF clause entry should describe a defined operator`,t.location);return e},ht=()=>{let e=ct()?D(lt):[],t=T(`DEF`)||T(`DEFS`);if(i&&e.length===0&&!t)throw de(`Expected a fact`);return{facts:e,defs:t?mt():[]}},gt=()=>{let t=o,r=w(),i=r.text===`USE`&&T(`ONLY`),a=v(t),s={kind:r.text===`USE`?`Use`:`Hide`,isOnly:i,...ht(),keyword:a,location:g(r)},c=s.kind===`Hide`&&n===`tlc`?s.facts.filter(e=>!st(e)):[];if(c.length>0)throw e.q(c.map(n=>({location:e.X(n.location.range??v(t)),message:`The only expression allowed as a fact in a HIDE is
|
|
1785
|
+
the name of a theorem, assumption, or step.`})));return y(s,t)},_t=()=>{let e=o,t=g(b()),n=T(`NEW`),r=i?o:e,a=i?g(b()):t,s=b().kind===`Keyword`?hy.get(b().text):void 0;if(!n&&s===void 0)throw de(`Expected a declaration but found ${ie(b())}`);if(s!==void 0&&w(),s===`Variable`){let e=me();return ut(e.name),y({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:a},r)}let c=Ke();ut(c.name);let l=(s??`Constant`)===`Constant`&&C(`\\in`);if(l&&c.arity>0)throw S(`declared symbol with arguments before \\in`);return l&&w(),y({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?k():void 0,nameRange:c.location.range,location:a},r)},vt=()=>{let e=o,t=g(E(`ASSUME`)),n=D(()=>(b().kind===`Identifier`&&C(`::`,1)&&C(`ASSUME`,2)&&(w(),w()),C(`ASSUME`)?dt(vt):b().kind===`Keyword`&&gy.has(b().text)?_t():k()));return E(`PROVE`),y({kind:`AssumeProve`,assumptions:n,conclusion:k(),location:t},e)},yt=e=>{let t=0;for(;b(t).kind===`Identifier`&&C(`,`,t+1);)t+=2;return b(t).kind===`Identifier`&&C(e,t+1)},bt=(e,t)=>{e.forEach(ut),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(ut))},xt=()=>{let e=b();if(C(`USE`)||C(`HIDE`))return gt();if(C(`INSTANCE`)){let t=o;return y(Ge(void 0,[],!1,g(e)),t)}if(C(`DEFINE`)||Ze()){let t=o;T(`DEFINE`);let n=[Ue(!1)];for(;Ze();)n.push(Ue(!1));let r={kind:`Define`,definitions:n,location:g(e)};return y(r,t)}if(T(`HAVE`))return{kind:`Have`,expression:k()};if(T(`TAKE`)){let e=be(),t=he(e?[]:D(me)),n=e?Ce():[];return bt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(T(`WITNESS`))return{kind:`Witness`,expressions:D(()=>k())};if(T(`PICK`)){let e=yt(`:`),t=he(e?D(me):[]),n=e?[]:Ce();return bt(t.names,n),E(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:k()}}return T(`CASE`)?{kind:`Case`,expression:k()}:{kind:`Assert`,isSuffices:T(`SUFFICES`),statement:C(`ASSUME`)?vt():k()}},St=e=>{let t=b();if(t.kind!==`Step`)throw de(`Expected a step number but found ${ie(t)}`,t);if(!at(t))throw S(`${e?`QED step`:`step`}'s number has bad level`,t);if(n!==`sany`&&et(t)<0&&rt(t)!==void 0)throw S(`<*> and <+> cannot be used for a named step`,t);return o++,{name:rt(t),token:t.text,location:g(t)}},Ct=()=>{let e=o,t=St(C(`QED`,1)),n=o,r=/* @__PURE__ */ new Set;p.push(r);let i=T(`QED`)?{kind:`Qed`}:xt(),a=v(e),s=v(n),c=it(b());if(c&&!oy.has(i.kind))throw S(`Proof of a step that does not take a proof`);let l=c?Et():void 0;return p.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(ut),y({...t,body:i,head:a,statement:s,proof:l},e)},wt=e=>{if(T(`BY`)){let t=v(o-1);return{kind:`By`,isOnly:T(`ONLY`),...ht(),keyword:t,location:e}}let t=b();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;w();let n=v(o-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Tt=()=>{let e=g(b());T(`PROOF`);let t=wt(e);if(t)return t;let n=[Ct()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(Ct());return{kind:`Steps`,level:$e(),steps:n,location:e}},Et=()=>{let e=o;Qe.push(-1);let t=dt(Tt);return Qe.pop(),y(t,e)},Dt=()=>b().kind===`Step`||b().kind===`Keyword`&&ay.has(b().text),Ot=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return fy(e);let n=t.defs[t.defs.length-1]?.location.range;return dy(fy({...e,end:e.start}),fy(n??t.keyword))},kt=()=>{let e=o,t=g(b()),n=T(`PROOF`),r=wt(t);if(r){let t=y(r,e);return{kind:`Leaf`,proof:t,span:fy(t.keyword),first:e,end:o-1}}let i=b();if(i.kind!==`Step`)throw de(`Expected a step number but found ${ie(i)}`);let a=o;w();let s=o,c=T(`QED`)?{kind:`Qed`}:xt(),l=v(a);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:v(s),span:Ot(l,c),first:e,start:a,end:o-1}},j=(e,t,n,r)=>{let i=e[t];if(!i)return{proof:void 0,span:r,next:t,end:void 0};if(i.kind===`Leaf`)return{proof:i.proof,span:i.span,next:t+1,end:i.end};let o=At(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={...g(a[i.first]),range:v(i.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},At=(e,t,n,r,i)=>{let a=e[t];if(!a)throw py(`Unexpected end of (sub)proof at level ${n} before QED step`,r);if(a.kind===`Leaf`)throw py(`Expecting a proof step but found a${ly[a.proof.kind]} leaf proof`,a.span);if(!i&&a.isProof)throw py(`PROOF keyword found in step that does not begin subproof`,a.span);let o=a.token.text[1];if(o===`+`&&!i)throw py(`<+> used but no subproof expected`,a.span);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:et(a.token);if(s<n||!i&&s>n)return;let c=oy.has(a.body.kind)?j(e,t+1,s+1,a.span):{proof:void 0,span:a.span,next:t+1,end:void 0},l=c.end??a.end,u={name:rt(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{...g(a.token),range:v(a.start,l)}},d=dy(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=At(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:dy(d,f.span)}},jt=()=>{if(!Dt())return;let e=[];for(;Dt();)e.push(kt());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=j(e,0,0,t.span),r=e[n.next];if(r)throw py(`extra step(s) after finished proof`,r.span,`Proof.Parser.toplevel`);return n.proof},M=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},Mt=()=>{if(b().kind!==`Identifier`||!C(`==`,1))return;let e=pe();return f.add(e),w(),e},Nt=e=>{let t=o,n=w(),r=Mt(),a=dt(()=>{let e=C(`ASSUME`)?vt():k();return i?{statement:e,proof:jt()}:{statement:e,proof:it(b())?Et():void 0}}),s=a.statement,c=y({name:r,statement:s,proof:a.proof,location:g(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&s.kind!==`AssumeProve`&&M(e,y({kind:`Operator`,name:r,params:[],body:s,isLocal:!1,isRecursive:!1,location:g(n)},t))},Pt=()=>{let e=o,t=w(),n=Mt();return y({name:n,expression:k(),isAxiom:t.text===`AXIOM`,location:g(t)},e)},Ft=()=>{let e=g(E(`----`));E(`MODULE`);let t=ve();E(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(m.push(n),d.push(/* @__PURE__ */ new Set),T(`EXTENDS`)&&D(()=>{let e=o;n.extends.push(ve()),n.extendsRanges.push(v(e))});;){let t=o;oe=t;let r=b();if(r.kind===`ModuleEnd`)return e.range={module:m[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},m.pop(),d.pop(),n;if(r.kind===`Separator`){if(C(`MODULE`,1)){let e=Ft();n.modules.push(e),n.units.push({kind:`Module`,module:e}),E(`====`);continue}w()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=g(w()),r=Je();n.constants.push(...r),e.range=v(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=g(w()),r=D(()=>{let e=o,t=g(b());return y({name:pe(),arity:0,location:t},e)});n.variables.push(...r),e.range=v(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Pt();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&M(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(C(`USE`)&&C(`ONLY`,1))throw de(`Expected a module unit but found ${ie(r)}`);let e=gt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=g(w()),r=Ye();e.range=v(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:It(n,y(Ge(void 0,[],!1,g(r)),t));continue;case`LOCAL`:if(w(),C(`INSTANCE`)){It(n,y(Ge(void 0,[],!0,g(r)),t));continue}It(n,y(A(!0),t));continue}r.kind===`Keyword`&&iy.has(r.text)?Nt(n):It(n,Ue(!1))}}},It=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},Lt=Ft(),Rt=_e?Gv(t):void 0;if(Rt!==void 0)throw new e.F(Rt);return Lt},Ey=e=>Ty(e,`tlc`),Dy=(e,t)=>Ty(e,`tlc`,t),Oy=e=>Ty(e,`tlapm`),ky=e=>Ty(e,`sany`),Ay=`$subexpression`,jy=(t,n)=>new e.F(`${t} at line ${n.line}, column ${n.column}`),My=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return My(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of Be(e)){let e=My(r,t,n);if(e)return e}},Ny=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Py=(e,t)=>{let n=e.location,r=Ny(t,e.lets,n);if(e.params.length===0)return r;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw jy(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:r,location:n}}if(e.args.length!==e.params.length)throw jy(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Ay,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Ay,args:e.args,location:n,resolution:vs},location:n}},Fy=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:vs})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:vs}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:vs};return Py({...t,params:[...t.params,...r]},a)},Iy=(t,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s=0,c,l=!1,u=(n,i)=>{if(!n)throw jy(i,a);bs.set(r,{args:t.slice(0,s).flatMap(e=>`args`in e?e.args:[]),error:{location:e.X(n),message:i}}),l=!0},d=e=>{let r=[],i=[];for(;s<t.length;){let o=t[s];if(o.kind!==`Name`)throw jy(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=e?e.find(e=>Hc(e)===c):n(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s++}throw jy(`Unknown operator ${r.join(`!`)}`,a)},f=e=>{let n=d(e),l=n.definition,f=Ts(l),p=s===t.length-1;if(n.args.length!==f&&(!i||n.args.length!==0))return u(r.argumentRanges?.[s]??a.range,`The operator ${n.name} requires ${f-n.earlier} arguments.`);if(p)return{definition:l,args:n.args};if(l.kind!==`Operator`)throw jy(`Cannot select a subexpression of ${l.name}`,a);o.params.push(...l.params),o.args.push(...n.args),c=l.body,s++},p=()=>{for(;s<t.length&&!l;){let e=t[s];if(e.kind!==`Name`)return;let n=r.selectorRanges?.[s],a=c&&My(c,e.name,[]);if(!a)return u(n,`Cannot find label \`${e.name}'.`);let l=a.label.params;if(!i&&e.args.length!==l.length)return u(n,`Label \`${e.name}' used with wrong number of arguments.`);o.lets.push(...a.lets),o.params.push(...l.map(e=>({name:e,arity:0}))),o.args.push(...e.args),c=a.label.body,s++}},m=e=>{if(!c)throw jy(`Subexpression selection failed`,a);if(e.kind===`Colon`)return;if(c.kind===`Label`){c=c.body,m(e);return}if(c.kind===`Let`){if(e.kind!==`Operand`||Ks(e.operand,1)!==0)throw jy(`A LET/IN expression has only one operand`,a);o.lets.push(c.definitions),c=c.body;return}let n=Xs(c);if(n&&(e.kind===`Bound`||e.kind===`At`)){o.params.push(...n.names.map(e=>({name:e,arity:0}))),e.kind===`Bound`&&o.args.push(...e.args),c=n.body;return}if(c.kind===`Case`&&e.kind===`Operand`){let n=[...c.arms,...c.other?[{condition:void 0,body:c.other}]:[]],r=n[Ks(e.operand,n.length)],i=t[s+1];if(!r||i?.kind!==`Operand`)throw jy(`A subexpression of CASE must have the form !i!j`,a);s++;let o=Ks(i.operand,2),l=o===0?r.condition:o===1?r.body:void 0;if(!l)throw jy(`Nonexistent CASE operand`,a);c=l;return}if(e.kind!==`Operand`)throw jy(`Unexpected subexpression selector`,a);let r=n?n.sets:Zs(c),i=r?.[Ks(e.operand,r.length)];if(!i)throw jy(`Nonexistent operand specified by the selector`,a);c=i},h=f(void 0);if(l)return r;if(h)return Fy(h.definition,{...o,args:h.args});for(p();s<t.length&&!l;){let e=t[s];if(e.kind===`Name`){for(;c?.kind===`Label`;)c=c.body;if(c?.kind!==`Let`)throw jy(`A name selector here must be from a LET clause`,a);o.lets.push(c.definitions);let e=f(c.definitions);if(l)return r;if(e)return Fy(e.definition,{...o,args:[...o.args,...e.args]});p()}else m(e),s++}if(l)return r;if(!c)throw jy(`Subexpression selection failed`,a);return Py(o,c)},Ly=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return qs(e,t,n)},Ry=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Be(e).some(Ry),zy=(e,t,n,r=!1)=>{if(!Ry(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Gc(e,e=>zy(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>By(e,r,n))}:i}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>zy(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Gc(e,e=>zy(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?Ly(a.name,[],void 0,t):a.kind===`Apply`?Ly(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Iy(o,t,a,r);return c!==a&&ys.add(c),c},By=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:zy(e.expression,t,n,!0)}))}),Vy=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Hy=(e,t)=>By(e,Vy(t.definitions),()=>!1),Uy=(e,t)=>{let n=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),r=e.theorems.flatMap(e=>{let t=e.statement;if(e.name===void 0||t.kind!==`AssumeProve`)return[];let n=t.assumptions.filter(e=>e.kind!==`NewSymbol`&&e.kind!==`AssumeProve`);return n.length===t.assumptions.length?[{kind:`Operator`,name:e.name,params:[],body:{kind:`Tuple`,elements:[...n,t.conclusion],location:t.location},isLocal:!0,isRecursive:!1,location:e.location}]:[]}),i=Vy([...t,...e.definitions]),a=e=>n.has(e),o=Vy([...t,...e.definitions,...r]),s=e=>zy(e,o,e=>a(e)&&r.every(t=>t.name!==e)),c=e=>a(e)||!i(e),l=e=>zy(e,i,c),u=e=>e.map(e=>e.kind===`ModuleFact`?e:l(e)),d=e=>e.map(e=>({...e,set:l(e.set)})),f=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&l(e.set)}:f(e)),conclusion:l(e.conclusion)}:l(e),p=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:u(e.facts)};case`Instance`:return By(e,i,c);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?By(e,i,c):Wc(e,l))};case`Have`:case`Case`:return{...e,expression:l(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(l)};case`Take`:return{...e,bounds:d(e.bounds)};case`Pick`:return{...e,bounds:d(e.bounds),body:l(e.body)};case`Assert`:return{...e,statement:f(e.statement)};default:return e}},m=e=>e?.kind===`By`?{...e,facts:u(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:p(e.body),proof:m(e.proof)}))}:e,h={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:f(e.statement),proof:m(e.proof)})),uses:e.uses.map(e=>({...e,facts:u(e.facts)}))};return e.definitions.some(e=>Ry(e.body))||e.assumptions.some(e=>Ry(e.expression))?{...h,definitions:e.definitions.map(e=>Wc(e,s)),assumptions:e.assumptions.map(e=>({...e,expression:s(e.expression)}))}:h},Wy=(e,t)=>e.maxLevels[t]??3,Gy=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=Zl({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(e,a),a},i=/* @__PURE__ */ new Map,a=e=>{let n=i.get(e);if(n)return n;let a=t(e),o=r(e),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Ol(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Ol(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>kl(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Tl(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&Ol(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(Ql(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c};return n=>{let i=/* @__PURE__ */ new Map,o=e.X(n.location.range??{module:n.instancer,start:n.location,end:n.location}),s=e=>i.set(`${o}\n${e}`,{location:o,message:e}),c=t(n.module),l=a(n.module),u=r(n.instancer),d=/* @__PURE__ */ new Map;n.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...c.constants.map(e=>({...e,maximumLevel:0})),...c.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let t=n.substitutions.get(e.name);if(!t)return[];if(e.arity===0){let n=u.analyze(t,d);return[{...e,level:n.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(t,d);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),p=(e,t)=>`Level error in instantiating module '${n.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${t}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&s(p(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${n.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let t=l.constraints.get(e.name);t!==void 0&&e.level>t&&s(p(e.name,t));let r=e.operator;r&&Array.from({length:e.arity},(t,i)=>{let a=l.argConstraints.get(Cl(e.name,i));a!==void 0&&Wy(r,i)<a&&s(`Level error in instantiating module '${n.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),l.argParams.forEach(e=>{let t=Tl(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=Wy(r,t.index);i.level>a&&s(`Level error when instantiating module '${n.module}':\nThe level of the argument ${t.index} of the operator ${t.operator}' \nmust be at most ${a}.`)}),i.size>0)throw e.q([...i.values()])}},Ky=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],qy=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Jy=new Map(yf.flatMap(e=>e.map(t=>[t,e[0]]))),Yy=e=>Jy.get(e)??e,Xy=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},Zy=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},Qy=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:Xy(e)&2147483647,kind:t,isLocal:n}),$y=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:Yy(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:Yy(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},eb=(e,t)=>{let n=[];for(let r=t;;){let t=$y(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},tb=e=>({line:e.line,column:e.column}),nb=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text!==`.`){if(a.text===`EXTENDS`){let n=eb(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}}return{references:s,end:e.length}};return i(0,t??``).references},rb=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,ib={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},ab=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&rb(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&rb(e[n+1],e[n+2])?n+=rb(e[n+2],e[n+3])?3:2:(r.text!==`MODULE`||e[n-1]?.kind!==`Separator`)&&t.push(r.kind===`String`?`"${r.text.replace(/[\\"\n\t\r\f]/g,e=>ib[e])}"`:r.text)}return t},ob=e=>e[2]?.text,sb=e=>{let t=/* @__PURE__ */ new Map,n=[];return e.forEach((r,i)=>{r.kind===`Separator`&&e[i+1]?.text===`MODULE`&&n.push({name:e[i+2].text,start:i});let a=r.kind===`ModuleEnd`?n.pop():void 0;a&&!t.has(a.name)&&t.set(a.name,{start:a.start,end:i+1})}),t},cb=(e,t)=>e.find(e=>e.name===t)??e.map(e=>cb(e.modules,t)).find(Boolean),lb=e=>{let t=e===void 0?[]:ae(e),n;return{tokens:t,ranges:sb(t),getModule:()=>n??=e===void 0?Ey(``):Dy(e,t)}},ub=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=lb(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:t?.(i)??Cf.get(i)??Ef.get(i)??wy(e,i),c=a(s),l=c.tokens,u=c.ranges.get(ob(l)??``)??{start:0,end:0},d={tokens:l,...u,getModule:c.getModule};return n.set(i??``,d),c.ranges.forEach((e,t)=>{e.start===u.start||r.has(t)||r.set(t,{tokens:l,...e,getModule:()=>cb(d.getModule().modules,t)??d.getModule()})}),d};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},db=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=eb(t,e+1);i.push({location:tb(t[e]),apply:e=>r.forEach(t=>e.put(Qy(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c=new Set(n.units.flatMap(e=>e.kind===`Constants`||e.kind===`Variables`?[`${e.location.line}:${e.location.column}`]:[])),l=0;t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r;if(n.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l++,l===2){let e=t[u+2].text;i.push({location:tb(n),apply:t=>t.put(Qy(e,`module`,!1))})}return}if(n.kind===`ModuleEnd`&&l--,l!==1||n.kind!==`Keyword`)return;let d=c.has(`${n.line}:${n.column}`);d&&(n.text===`CONSTANT`||n.text===`CONSTANTS`)&&o(u,`constant`),d&&(n.text===`VARIABLE`||n.text===`VARIABLES`)&&o(u,`variable`),n.text===`RECURSIVE`&&eb(t,u+1).every(e=>s.has(e))&&o(u,`definition`),qy.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(tb(n)),i.push({location:tb(n),apply:e=>e.put(Qy(t[u+1].text,`theorem`,!1))}))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(Qy(t,`theorem`,!1))})});let u=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(u(e.location))return;let t=Yy(e.name);i.push({location:e.location,apply:n=>n.put(Qy(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(Qy(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(Qy(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>ws(e.location,t.location)?-1:+!!ws(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=Zy();n.set(i??``,o),vf.toReversed().forEach(e=>o.put(Qy(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},fb=(t,n)=>{let r=/* @__PURE__ */ new Set,i=e=>{r.add(e)},a=e=>{e.kind===`ModelValue`&&i(e.name),e.kind===`String`&&i(e.value),e.kind===`Set`&&e.elements.forEach(a)};n.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),bf.forEach(i);let o=e=>{let n=t(e);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=nb(o(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),g=m(e=>e.instances),_=/* @__PURE__ */ new Set([void 0]),ee=/* @__PURE__ */ new Map;ab(o(void 0)).forEach((e,t)=>{t===3&&Sf.forEach(i),i(e)});let te=l(void 0);for(;;){let n=h(te,/* @__PURE__ */ new Set)??g(te,/* @__PURE__ */ new Set);if(!n)break;let[r,a]=n;if(d.add(`${r.key}>${a}`),ee.set(r.unit,[...ee.get(r.unit)??[],a]),!_.has(a)){if(_.add(a),t(a).tokens.length===0){let n=r.unit??ob(t(void 0).tokens);throw e.K(a,n)}ab(o(a)).forEach(i)}}Ky.forEach(i);let v=/* @__PURE__ */ new Set,ne=e=>{if(v.has(e))return;v.add(e);let t=ee.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(ne),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return ne(void 0),xf.forEach(i),[...r]},pb=(e,t)=>{let n=ub(e,t),r=n.getParsed,i,a=()=>i??=db(r);return{getStringOrder:e=>fb(r,e),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},mb=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),hb=t=>{switch(t.kind){case`Number`:if(!Pt(t.value))throw e.it(new e.O(`TLC can't handle a number this big.\n${t.value}`),e.tt.error);return t.value;case`String`:case`Boolean`:return t.value;case`ModelValue`:return yn(t.name);case`Set`:return P({kind:`MixedSet`,elements:t.elements.map(hb)})}},gb=t=>{try{return hb(t)}catch(t){throw!(t instanceof e.b)||t instanceof e.O||t instanceof e.x?t:e.it(new e.b(`${e.G}${t.message}`),e.tt.error)}},_b=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],vb=(t,n,r)=>{try{return r.parseModule(t)}catch(r){if(!(r instanceof e.F))throw r;let i=Gv(t);throw i===void 0?r:e.q([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},yb=t=>new e.F(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),bb=(t,n)=>t.location.range&&n.location.range&&{location:e.X(t.location.range),message:`Multiply-defined module '${t.name}': this definition or declaration conflicts \nwith the one at ${e.X(n.location.range)}.`},xb=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,Sb=e=>e===`Theorem`?`ThmOrAssumpDefNode`:xb(e),Cb=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:cl(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),wb=(t,n,r)=>{let i=`{ ${r.map(e=>`<${[...e[0],e[1]].map(e=>L(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:t,arity:n,evaluate:t=>{let n=r.find(n=>{if(n[0].length!==t.length)throw new e.b(`Attempted to apply the operator ${i}\nwith wrong number of arguments.`);return n[0].every((e,n)=>{let r=t[n];return(typeof r!=`object`||r.kind!==`Operator`)&&Pn(e,r)})});if(n)return n[1];throw new e.b(`Attempted to apply operator:\n${i}\nto arguments (${t.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:L(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},Tb=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||Be(e).some(e=>Tb(e,t)),Eb=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(rl(e),n.get(e)??n.size)),n},Db=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Ob=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw ph(e);if(e.kind===`Number`&&!Pt(e.value))throw mh(e);Ob(e.kind===`Let`?[...Be(e),...Db(e.instances??[])]:Be(e))}),kb=(t,n)=>{let r=n.order??pb(n.source,n.loadModule),i=r.parseModule(n.source),a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Set,l=/* @__PURE__ */ new Set,u=new Map(Lf.map(e=>[e.name,e])),d=/* @__PURE__ */ new Map,f=Wd(t.checkDeadlock,n.seed);f.isWarningEnabled=n.isWarningEnabled??!0,f.isTool=n.isTool??!1,f.version=n.version??`master`;let p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,h=[],g=/* @__PURE__ */ new Map,_=[],ee=[],te=(e,t)=>_.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),v=0,ne=e=>`${e}#${v++}`,y=[],re=[],b=Gy(e=>{let t=m.get(e)??ue(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>a.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>a.get(t.visible.get(e)?.key??e)}}),ie=/* @__PURE__ */ new Map,ae=/* @__PURE__ */ new Map,oe=/* @__PURE__ */ new Map,se=e=>{let t=d.get(e);if(t)return t;let r=ip(e,n.print,f,n.files,u);if(!r)return;rp.get(e)?.forEach(se);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>se(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{u.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:bl.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Sl(e,t.name)??i.get(t.name)?.range})}),d.set(e,i),i},ce=e=>{let t=rp.get(e)??[];if(e===`TLCExt`||[e,...t].some(e=>n.loadModule?.(e)!==void 0))return;let r=se(e);return r&&te(e,t),r&&t.includes(`Integers`)&&se(`Integers`),r},x=e=>(Ob([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...Db(e.instances)]),e.modules.forEach(x),e);x(i);let le=(t,i)=>{let a=n.loadModule?.(t)??Of(f.version).get(t)??wy(n.source,t);if(a===void 0)throw e.K(t,i);let o=vb(a,t,r);if(o.name!==t)throw e.q([{location:`Unknown location`,message:`File name '${t}' does not match the name '${o.name}' of the top level module it contains.`}],!0);return x(o)},S=t=>{let n=ee.indexOf(t.name);if(n!==-1){let r=[...ee.slice(n),t.name].map(e=>`${e}.tla`);throw new e.F(`Circular dependency among .tla files; dependency cycle is: ${r.join(` --> `)}`)}let r=/* @__PURE__ */ new Set,i=[],a=[],o=[];ee.push(t.name),_.push(r);let s=ge(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:re,levelChecks:o});if(_.pop(),ee.pop(),a.length>0)throw e.q(a,!1,void 0,re);let c=i.find(e=>r.has(e.name)),l=c&&p.get(c.name),u=l&&bb(c,l.module);if(u)throw e.q([u],!1,void 0,re);if(c)throw yb(c);return o.forEach(e=>e()),{linked:s,closure:r}},ue=(t,r)=>{let i=p.get(t);if(i)return te(t,g.get(t)??[]),i;let o=S(le(t,r)),s=/* @__PURE__ */ new Map;return np(t,n.print,f,n.files,u,(t,n,r)=>{let i=s.get(t),a=n.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(i?.kind!==`Operator`||!r||a.length!==n.length)throw new e.b(`No definition of ${t} to fall back to`);let o={kind:`Closure`,name:i.name,params:i.params,body:i.body,scope:void 0};return W(i.body,{environment:r.environment,scope:bg(o,a,r),state:r.state,next:r.next,isKeepLazy:r.isKeepLazy})})?.forEach(e=>{let n=o.linked.visible.get(e.name);if(n?.kind!==`Definition`||n.arity!==e.arity&&mb.has(t))return;let r=a.get(n.key);r&&s.set(e.name,r),u.set(n.key,e),a.delete(n.key)}),p.set(t,o.linked),g.set(t,o.closure),te(t,o.closure),o.linked},de=(e,t,n,r,i)=>{let u=i?void 0:ce(e.module);if(u)return fe(e,u);let d=i??ue(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=_b(d),p=`#${v++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=Nc(Hy(e,t),f,t,n);y.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>l.add(e));let _=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,ee=hl({params:g,substitutions:new Map([...h].map(([e,t])=>[e,zc(t,m)])),variables:new Set(d.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>o.get(e)===!0,addDefinition:(n,i,l)=>{let u=ne(`${i}@${t.name}`),d=l(u);return a.set(u,d),f.length>0&&c.add(d),e.name!==void 0&&ae.set(u,`${e.name}!${ae.get(n)??i}`),o.set(u,!r),s.set(u,{source:n,prefix:e.params.length}),u},createName:ne,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return C(e,d.exported,f,(t,n)=>{let r=e.name===void 0?ee.getKey(t):ee.getQualifiedKey(t);return f.length>0&&ie.set(r,{name:n,location:e.location}),e.name!==void 0&&oe.set(r,n),r})},fe=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),C=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:o.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},w=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:ll(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),T=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),E=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=T(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:ll(r,n),location:n}}},pe=(e,t,n,r)=>{let i=e.location,s=r?void 0:ce(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=T(n.arity);return w(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??ue(e.module,n),l=`#${v++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=_b(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};y.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>Tb(f(e),p),h=d.map(t=>{let n=E(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),g=[],_=hl({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:ll(e.params,i),location:i,resolution:vs}:cl(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>o.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:Cb(a,i)),i},createName:ne}),ee=new Set(d.map(e=>e.name)),te=[...c.exported].filter(([e])=>!ee.has(e)).map(([t,n])=>{let r=_.getKey(n.key),a=T(n.arity),o=[...e.params,...a];return w(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...g,...te]},me=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),he=/* @__PURE__ */ new Map,ge=(t,r)=>{let s=w_(t,n.loadClass?.(t.name),t===i);he.set(t.name,s.overrides);let c=s.module,l=y.length,u=new Map([...Lf.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:Oc,errors:[],warnings:[]},p=[f],g=t=>t.forEach((t,n)=>{let r=_.get(n);if(!r){u.set(n,t),_.set(n,t);return}if(!r.range||!t.range||e.X(r.range)===e.X(t.range))return;let i=e.X(t.range),a=e.X(r.range);Sb(r.kind)===Sb(t.kind)?f.warnings.push({location:i,message:`Warning: the ${xb(r.kind)} of '${n}' conflicts with \nits ${xb(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${xb(t.kind)} of '${n}' conflicts with \nits ${xb(r.kind)} at ${a}.`})}),_=/* @__PURE__ */ new Map,ee=/* @__PURE__ */ new Set,te=/* @__PURE__ */ new Map,v=[],ne=[...c.constants],ie=c.variables.filter((e,t)=>c.variables.findIndex(t=>t.name===e.name)===t),ae=ie.map(e=>e.name),se=ie.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:ce(e);if(n){g(n);return}let i=t??ue(e,c.name);ne.push(...i.constants.filter(e=>ne.every(t=>t.name!==e.name)&&!ae.includes(e.name))),i.variables.forEach((e,t)=>{ae.includes(e)||ne.some(t=>t.name===e)||(ae.push(e),se.push(i.variableLocations[t]))}),g(i.exported),i.facts.forEach(e=>ee.add(e)),i.modules.forEach((e,t)=>te.set(t,e)),v.push(i)});let x=new Map(u),le=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],S=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});le.forEach(e=>_.set(e.name,S(e)));let w=e=>({key:E(e),arity:Ts(e),params:Es(e),kind:kc(c,e)?`Theorem`:`Definition`,range:e.location.range}),T=ne.length===0&&ae.length===0,E=e=>c===i?e.name:`${e.name}@${r.id}`,_e=/* @__PURE__ */ new Map,ve=()=>new Map([...r.modules,...te]),ye=e=>{let t=c.modules.find(t=>t.name===e.module);return t?ws(t.location,e.location)?te.get(t.name):void 0:ve().get(e.module)},D=e=>({imported:u,getInstance:e=>{let t=ye(e),n=t?void 0:ce(e.module);if(n)return{declarations:[],symbols:fe(e,n),instancer:c.name};let r=t??ue(e.module,c.name),i=_b(r);return{declarations:i,symbols:C(e,r.exported,i,e=>e),instancer:c.name}},bound:x,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:E,instanced:_e,facts:ee,reports:p,warnings:r.warnings}),be=e=>[...le.filter(t=>ws(t.location,e)).map(e=>[e.name,S(e)]),...c.definitions.filter(t=>ws(t.location,e)).map(e=>[e.name,w(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(u)),xe=e=>{let t=ve(),n=t.get(e.name),i=n&&bb(e,n.module);if(n&&!i)throw yb(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};p.push(a);let o=ge(e,{id:`${r.id}/${e.name}`,symbols:be(e.location),modules:t,nested:r.nested,errors:a.errors,warnings:a.warnings,levelChecks:r.levelChecks});i&&a.errors.push(i),n||te.set(e.name,o)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=de(e,c,D(c),T,ve().get(e.module));_e.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||_.set(n,t))})}})),...c.modules.map(e=>({location:e.location,link:()=>xe(e)}))].sort((e,t)=>ws(e.location,t.location)?-1:1).forEach(e=>e.link());let Se=Uy(yl(c,(e,t)=>pe(e,t,c.name,ye(e))),me(u));r.errors.push(...Fc(Se,D(Se))),Se.definitions.forEach(e=>{let t=E(e);a.set(t,e),o.set(t,!T);let n=w(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!ws(r,e.location))&&(u.set(e.name,n),e.isLocal||_.set(e.name,n))});let Ce={module:Se,constants:ne,variables:ae,variableLocations:se,visible:u,exported:_,modules:te,extended:v,facts:/* @__PURE__ */ new Set([...ee,...[...Se.theorems,...Se.assumptions].flatMap(e=>e.name??[])])};m.has(c.name)||m.set(c.name,Ce);let we=y.splice(l).map(e=>({location:e.location,check:()=>b(e)}));return r.levelChecks.push(()=>$l(Se,{constants:new Set(ne.map(e=>e.name)),variables:new Set(ae),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>oe.get(u.get(e)?.key??e)},we,re)),h.push(Ce),Ce},_e=S(i).linked,ve=n.traceFile,ye=ve===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:ve}}],D=[...n.moduleOperators??[],...ye].map(e=>{let t=ue(e.module,i.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});h.push(...h.splice(h.indexOf(_e),1)),re.length>0&&!n.isSanyReported&&n.print(e.Z(re));let be=e=>_e.visible.get(e)?.key??e;_e.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)}),D.forEach(e=>{let t=e.key===void 0?void 0:a.get(e.key);e.kind!==`postcondition`&&t&&a.set(e.operator,t)});let xe=[],Se=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Se(e,t)),xe.push(...e.module.assumptions))};Se(_e,/* @__PURE__ */ new Set);let Ce=_e.constants.map(e=>e.name),we=_e.variables,Te=new Map([...d,...[...p].map(([e,t])=>[e,t.visible]),[i.name,_e.visible]]),Ee=e=>{let t=Te.get(e.module??``)?.get(e.name);return t?.kind===`Definition`?t:void 0},De=e=>{if(e.module===void 0)return[e.name,be(e.name)];let t=Ee(e);return t?[t.key]:[]},Oe=e=>e.module===i.name?[]:De(e),ke=e=>{let t=a.get(e);return t?.kind===`Operator`?t.params.length:_e.constants.find(t=>t.name===e)?.arity??u.get(e)?.arity??0},Ae=/* @__PURE__ */ new Map,je=/* @__PURE__ */ new Set,Me=(e,t)=>{u.set(e,t),a.delete(e),Ae.delete(e),je.add(e)};t.constants.filter(e=>e.args===void 0).forEach(e=>{let t=gb(e.value);fr(t),Oe(e).forEach(e=>{let n=ke(e);n===0?Ae.set(e,t):Me(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ne=/* @__PURE__ */ new Map;t.constants.forEach(t=>{if(t.args===void 0)return;let n=`${t.module??``}!${t.name}`,r=Ne.get(n)??{name:t.name,module:t.module,rows:[]};if(r.rows.length>0&&r.rows[0][0].length!==t.args.length)throw new e._(`The arity of the operator ${t.name} is inconsistent in the configuration file.`);r.rows.push([t.args.map(hb),hb(t.value)]),Ne.set(n,r)}),Ne.forEach(e=>Oe(e).forEach(t=>Me(t,wb(e.name,ke(t),e.rows))));let Pe=new Map(t.substitutions.flatMap(e=>De(e).map(t=>[t,be(e.target)])));[...Pe.keys()].forEach(e=>Ae.delete(e));let Fe=(t,n,r)=>{let i=be(n),o=a.get(i);if(!(o!==void 0||u.has(i)||Ae.has(i)||Ce.includes(n)||we.includes(n)))throw new e._(`The configuration file substitutes for ${t} with the undefined identifier ${n}.`);if(o?.kind===`Operator`&&o.params.length!==r)throw new e._(`The configuration file substitutes for ${t} with ${n} of different number of arguments.`)};t.substitutions.filter(e=>e.module===void 0).forEach(n=>{let r=n.name,i=n.target;if(!Ce.includes(r)&&!_e.visible.has(r))throw new e._(`In the configuration file, the identifier ${r} does not appear in the specification.`);if(t.substitutions.some(e=>e.name===i))throw new e._(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);Fe(r,i,_e.constants.find(e=>e.name===r)?.arity??_e.visible.get(r)?.arity)});let Ie=t.substitutions.filter(e=>e.module!==void 0);[...Te.keys()].forEach(t=>{let n=Ie.filter(e=>e.module===t);n.forEach(t=>{let r=Ee(t);if(r){if(n.some(e=>e.name===t.target))throw new e._(`In the configuration file, the identifier ${t.target} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);Fe(t.name,t.target,r.arity)}});let r=n.find(e=>!Ee(e));if(r)throw new e._(`In the configuration file, the identifier ${r.name} does not appear in the specification.`)});let Le=Ie.find(e=>!Te.has(e.module??``));if(Le)throw new e._(`In the configuration file, the module name ${Le.module} is not a module in the specification.`);let Re=new Set([...t.constants,...t.substitutions].filter(e=>e.module!==void 0).flatMap(Oe)),ze=(e,t)=>{if(Re.has(e))return{key:e,prefix:t};let n=s.get(e);return n&&ze(n.source,t+n.prefix)};s.forEach((e,t)=>{let n=ze(e.source,e.prefix),r=a.get(t);if(!n||!r)return;let i=r.kind===`Operator`?r.params:[],o=w(t,n.key,i,i.slice(n.prefix),r.location);a.set(t,o),_e.visible.forEach((e,n)=>{e.key===t&&n!==t&&a.set(n,o)})}),D.forEach(e=>ue(e.module,i.name).constants.forEach(t=>{let n=e.constants?.[t.name];n!==void 0&&Ae.set(t.name,n)}));let Be=Ce.filter(e=>!Ae.has(e)&&!Pe.has(e)&&!je.has(e));if(Be.length>0){let t=r.getDeclarationOrder(`constant`).find(e=>Be.includes(e))??Be[0];throw new e._(`The constant parameter ${t} is not assigned a value by the configuration file.`)}ve!==void 0&&u.forEach((e,t)=>{let n=Hf(e);n&&u.set(t,n)});let O=Eb(we,h.flatMap(e=>e.module.variables.map(e=>e.name))),k=pu({definitions:a,substitutions:Pe,constants:Ae,variableIndex:O,builtins:u,variables:we}),Ve={runtime:f,definitions:a,builtins:u,constants:Ae,substitutions:Pe,instanceNames:ae,variables:we,variableIndex:O,facts:k,startupValues:Array.from({length:k.ids.size},()=>void 0),substitutedDefinitions:c,instanceParams:l,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},He=Zl({constants:new Set(Ae.keys()),variables:/* @__PURE__ */ new Set([...we,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>u.has(e))]),getDefinition:e=>Oh(e,Ve)}),Ue=t=>{try{W(t,{environment:Ve,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e.b)return t;throw t}};Pe.forEach((t,n)=>{let r=a.get(t),i=Ce.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&He.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?Ue(r.body):void 0;if(i){let r=nt(i)?``:` - specifically: ${i.message}`;throw new e._(`The configuration file substitutes constant ${n} with non-constant ${t}${r}`)}}),f.version!==`1.7.4`&&(f.isStarted=!0);let We=new Set(h.flatMap(e=>e.module.instances.map(e=>e.module))),A=r.createDefinitionOrder();return{environment:Ve,assumptions:xe,variableLocations:_e.variableLocations,instanceActions:ie,startupDefinitions:h.filter(e=>!We.has(e.module.name)||_b(e).length===0).flatMap(e=>A(e===_e?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:h.flatMap(e=>he.get(e.module.name)??[]),moduleOperators:D,rootName:i.name}},Ab={kind:`Boolean`,value:!0},jb={kind:`Boolean`,value:!1},Mb=e=>e?Ab:jb,Nb=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,Pb=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,Fb=(e,t)=>({kind:e,body:t}),Ib=(e,t,n)=>({kind:e,operands:[t,n]}),Lb=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?Lb(e,t.operands).operands:[t])}),Rb=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return Rb(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,Rb(t)),0)}},zb=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return zb(e.body);case`And`:case`Or`:return e.operands.some(zb)}},Bb=/* @__PURE__ */ new WeakMap;let Vb=0;const Hb=e=>{let t=Bb.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${Vb++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(Hb).join(`,`)})`;default:return`${e.kind}(${Hb(e.body)})`}})();return Bb.set(e,n),n},Ub=(e,t)=>e===t||Hb(e)===Hb(t),Wb=(e,t)=>{let n=Hb(t);return e.some(e=>e===t||Hb(e)===n)},Gb=e=>e===`And`?`Or`:`And`,Kb=(e,t)=>{switch(e.kind){case`Boolean`:return t?Mb(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?Fb(`Not`,e):e;case`Not`:return Kb(e.body,!t);case`And`:case`Or`:return Lb(t?Gb(e.kind):e.kind,e.operands.map(e=>Kb(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return Fb(n,Kb(e.body,t))}}},qb=e=>{switch(e.kind){case`Boolean`:return Mb(!e.value);case`Not`:return e.body;case`And`:case`Or`:return Lb(Gb(e.kind),e.operands.map(qb));case`Always`:return Fb(`Eventually`,qb(e.body));case`Eventually`:return Fb(`Always`,qb(e.body));default:return Fb(`Not`,e)}},Jb=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Jb(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return Mb(t)}return n.length===0?Mb(!t):n.length===1?n[0]:Lb(e.kind,n)}case`Not`:{let t=Jb(e.body);return t.kind===`Boolean`?Mb(!t.value):Fb(`Not`,t)}case`Always`:case`Eventually`:{let t=Jb(e.body);return Fb(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Yb=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Xb=t=>{switch(t.kind){case`And`:{let n=[],r=1;for(let i of t.operands){let t=Xb(i);if(t.kind===`And`)n.push(...t.operands);else{if(t.kind===`Or`&&(r*=t.operands.length,r>2147483647))throw new e.b(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);n.push(t)}}if(r===1)return{kind:`And`,operands:n};let i=Array.from({length:r},()=>[]),a=1,o=r;for(let e of n){if(e.kind!==`Or`){i.forEach(t=>t.push(e));continue}o/=e.operands.length;let t=0;for(let n=0;n<a;n++)for(let n of e.operands)for(let e=0;e<o;e++)i[t++].push(n);a*=e.operands.length}return{kind:`Or`,operands:i.map(e=>Lb(`And`,e))}}case`Or`:{let e=[],n=[];for(let r of t.operands){let t=Xb(r);for(let r of t.kind===`Or`?t.operands:[t]){let t=Yb(r);t?e.push(t):n.push(r)}}if(e.length>0){let t=e.length===1?e[0]:Lb(`Or`,e);n.push(Fb(`Always`,Fb(`Eventually`,t)))}return Lb(`Or`,n)}case`Not`:return Nb(t.body)?t:Xb(qb(t.body));default:return t}},Zb=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Zb(e.operands[0]):Lb(e.kind,e.operands.map(Zb));case`Not`:return e.body.kind===`Not`?Zb(e.body.body):Fb(`Not`,Zb(e.body));case`Always`:case`Eventually`:case`Next`:return Fb(e.kind,Zb(e.body));default:return e}},Qb=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Qb(e.operands[0]);let t=Math.floor(e.operands.length/2);return Ib(e.kind,Qb(Lb(e.kind,e.operands.slice(0,t))),Qb(Lb(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return Fb(e.kind,Qb(e.body));default:return e}},$b=(e,t)=>{e.kind===`Eventually`&&!Wb(t,e)&&t.push(e),`body`in e&&$b(e.body,t),`operands`in e&&e.operands.forEach(e=>$b(e,t))},ex=e=>{let t=e.filter(Pb),n=e.flatMap(e=>e.kind===`Not`&&Pb(e.body)?[e.body]:[]);return!t.some(e=>Wb(n,e))},tx=t=>{let n=[...t],r=[];for(;n.length>0;){let t=n.pop();if(!t)break;switch(t.kind){case`Not`:n.push(t.body);break;case`Next`:r.push(t),n.push(t.body);break;case`Always`:case`Eventually`:r.push(t,Fb(`Next`,t)),n.push(t.body);break;case`And`:case`Or`:n.push(...t.operands),r.push(t);break;case`Action`:throw new e.b(`TLC encountered actions while constructing the tableau`);default:r.push(t)}}return r},nx=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:Fb(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},rx=(e,t,n)=>e.flatMap(e=>{let r=nx(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),ix=e=>[...new Set(e.map(Hb))].sort().join(`|`),ax=(e,t)=>{let n=new Set(t.map(ix));return[...e.filter(e=>!n.has(ix(e))),...t]},ox=e=>{let t=tx(e),n=rx(t,`Always`,`And`),r=rx(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=nx(t,`Eventually`,`Or`);if(n&&!(Wb(e,n.first)||Wb(e,n.second)))return ax(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Wb(e,t.first)||Wb(e,t.second))&&!Wb(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!ex(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=nx(t[e],`Always`,`And`);n&&(Wb(t,n.first)||t.push(n.first),Wb(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)Wb(t,e.first)&&Wb(t,e.second)&&!Wb(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!ex(t)?[]:i(t)};return a(e)},sx=e=>({particle:e,successors:[],statePredicates:e.filter(e=>Rb(e)<=1)}),cx=e=>{let t=ox([e]).map(sx),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=ix(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of ox(n)){let n=ix(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(sx(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},lx=(e,t)=>!Wb(e,t)||Wb(e,t.body),ux=(t,n)=>{if(t.kind===`Eventually`&&t.body.kind===`Always`&&Rb(t.body.body)<3){n.eventuallyAlways.push(t.body.body);return}let r=Yb(t);if(r){let e=Rb(r);if(e<=1){n.infinitelyOftenStates.push(r);return}if(e===2){n.infinitelyOftenActions.push(r);return}}if(zb(t))throw new e.b(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);n.formulas.push(t)},dx=(e,t)=>{let n=e.findIndex(e=>Ub(e,t));return n===-1?(e.push(t),e.length-1):n},fx=e=>{let t=Xb(Jb(Kb(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Zb(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])ux(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:Lb(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Ub(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Qb(e.formula),n=[];t&&$b(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>dx(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>dx(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>dx(i,e))}));return{tableau:t&&cx(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},px=()=>e.it(new e.b(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.tt.livenessEvaluationFailure),mx=/* @__PURE__ */ new Set([`~>`,`-+->`]),hx=/* @__PURE__ */ new WeakSet,gx=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),_x=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),vx=(t,n)=>new e.b(`TLC cannot handle the temporal formula ${H(t)}${n===void 0?``:`:\n${n}`}`),yx=(e,t,n,r=/* @__PURE__ */ new Set,i=/* @__PURE__ */ new Set)=>{let a=(e,t,r)=>{if(i.has(e))return 0;i.add(e);let a=yx(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=_h(t,e);if(!n)return;if(n.kind===`Value`)return 0;if(n.kind===`Thunk`)return n.isReleased?0:a(n,n.expression,n.scope);let r=n.operator;return r.kind===`Closure`?a(r,r.body,r.scope):0},s=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=Oh(e,n);if(t)return yu(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isActionLevel?2:r.isStateLevel&&!r.isLevelConstant?1:0},c=(e,t)=>r.has(e)?0:O(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return Gc(e,(e,o)=>(a=Math.max(a,yx(e,t,n,o.length===0?r:/* @__PURE__ */ new Set([...r,...o]),i)),e)),a};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:l(e);case`Identifier`:return c(e.name,e);case`OperatorReference`:return c(e.operator,e);case`Apply`:{if(mx.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=O(e)?void 0:sg(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,bg(o,e.args,_x(n,t)))}default:return l(e)}},bx=(t,n)=>{try{return Rh(t,n)}catch(t){if(!(t instanceof e.b))throw t;if(!nt(t))return;throw e.it(new e.b(`${e.W}${t.message}`),e.tt.error)}},xx=(t,n,r,i,a=/* @__PURE__ */ new Set,o=!1,s,c=[])=>{let l=(e,t,n=s,l=a,u)=>xx(e,t,r,i,l,o||u!==void 0&&r.substitutedDefinitions.has(u),n,u?.kind===`Operator`&&u.params.length===0?[...c,u.name]:c);if(t.kind===`And`)return t.operands.flatMap(e=>l(e,n,H(e)));if(t.kind===`Label`)return l(t.body,n);if(t.kind===`Let`)return l(t.body,Sx(t,n,r));if(t.kind===`Identifier`){let i=O(t)?_h(n,t.name):void 0;if(i?.kind===`Thunk`&&!i.isReleased)return l(i.expression,i.scope,hx.has(i)?t.name:s);let c=r.constants.has(t.name)?void 0:Oh(t.name,r);if(!i&&c?.kind===`Operator`&&c.params.length===0&&(yu(c,r)>0||ng(c,r)===void 0)){if(a.has(c))throw e.Y();return l(c.body,void 0,!o&&r.instanceNames.get(t.name)||c.name,/* @__PURE__ */ new Set([...a,c]),c)}}let u=_x(r,n);if(t.kind===`Apply`&&r.runtime.version!==`1.7.4`&&(i||yx(t,n,r)===3)){let e=cg(t,u),n=O(t)?void 0:Oh(t.operator,r),i=e?.kind===`Closure`&&e.params.every(e=>r.instanceParams.has(e));if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive&&(!o||i))return l(e.body,bg(e,t.args,u),o&&n?n.name:t.operator,a,n)}let d=i&&t.kind===`Forall`&&t.bounds.every(e=>yx(e.set,n,r)===0),f=d?bx(t.bounds,u):void 0;if(d&&f){let e=[];if(zh(t.bounds,f,n,n=>(e.push(...l(t.body,n,H(t.body))),!1)),e.length===0)throw px();return e}return[{expression:t,scope:n,name:s,path:c}]},Sx=(e,t,n)=>{let r=wg(e.definitions,_x(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&hx.add(e.binding);return r},Cx=(t,n,r)=>{let i=r.runtime.version===`1.7.4`,a=(t,n,a)=>{let o=a===0&&!i?yx(t,n,r):a;if(o===0){let i=W(t,_x(r,n));if(typeof i!=`boolean`)throw new e.b(`TLC expected a boolean value, but did not find one. ${oh(t)}`);return Mb(i)}return o===1?{kind:`State`,expression:t,scope:n}:t.kind===`AngleAction`?{kind:`Action`,expression:t.action,subscript:t.subscript,scope:n}:{kind:`Action`,expression:t,subscript:void 0,scope:n}},o=0,s=(t,n,i,s)=>{if(o>=100)throw e.Y();o++;let c=p(t,n);o--;let l=Rb(c),u=l===0&&yx(i,s,r)>2;return l>2||u?c:a(i,s,l)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,a=_x(r,t),o=O(e)||Oh(n,r)===void 0?_h(t,n):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&hx.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:O(e)?lg(n,a):sg(n,r),u=e.kind===`Apply`?e.args:[],f=c?.kind===`Builtin`&&u.length===2?gx.get(c.name):void 0;if(f){let n=u.map(e=>p(e,t));return d(e,t,Lb(f,n))}if(c?.kind!==`Closure`)throw vx(e);let m=!O(e)&&Oh(n,r)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),s(c.body,bg(c,u,a),e,t)),m)},l=(t,n,r=!1)=>{try{return n()}catch(n){let a=n instanceof e.P||r&&!i;throw!(n instanceof e.b)||a?n:vx(t)}},u=(t,n)=>{let i=yx(t,n,r),o=[],s=t.kind===`Forall`;try{Bh(t.bounds,_x(r,n),e=>(o.push(p(t.body,e)),!1))}catch(r){if(!(r instanceof e.b)||r instanceof e.P)throw r;if(i<=2)return a(t,n,i);throw vx(t,s&&!nt(r)?r.message:void 0)}return o.length===0?Mb(s):d(t,n,Lb(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=Rb(n);return r>2?n:a(e,t,r)},f=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!O(e)||e.operator===`=>`),p=(e,t)=>{let n=yx(e,t,r);if(n<=2&&!f(e))return a(e,t,n);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,Sx(e,t,r));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?Fb(`Always`,Ib(`Or`,Fb(`Not`,p(n[0],t)),Fb(`Eventually`,p(n[1],t)))):e.operator===`~`&&!O(e)?d(e,t,Fb(`Not`,p(n[0],t))):e.operator===`=>`?d(e,t,Ib(`Or`,Fb(`Not`,p(n[0],t)),p(n[1],t))):c(e,t)}case`And`:case`Or`:return d(e,t,Lb(e.kind,e.operands.map(e=>p(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&yx(e.condition,t,r)===0){let n=W(e.condition,_x(r,t));if(typeof n==`boolean`)return p(n?e.consequent:e.alternative,t)}let n=p(e.condition,t);return d(e,t,Ib(`Or`,Ib(`And`,n,p(e.consequent,t)),Ib(`And`,Fb(`Not`,n),p(e.alternative,t))))}case`Always`:case`Eventually`:return Fb(e.kind,p(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=Fb(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?Fb(`Always`,Fb(`Eventually`,Ib(`Or`,i,a))):Ib(`Or`,Fb(`Eventually`,Fb(`Always`,i)),Fb(`Always`,Fb(`Eventually`,a)))}default:throw vx(e)}};return p(t,n)},wx=(t,n,r,i,a)=>{let o=e=>wx(e,n,r,i,a);switch(t.kind){case`Boolean`:return t.value;case`State`:case`Enabled`:{let r=a.get(t);if(r!==void 0)return r;let o={environment:i,scope:t.scope,state:n,next:void 0},s=t.kind===`State`?W(t.expression,o):qm(t.step,o);if(typeof s!=`boolean`)throw new e.b(`A state predicate was evaluated to a non-boolean value.`);return a.set(t,s),s}case`Action`:{if(t.enabled&&a.get(t.enabled)===!1)return!1;let o=t.scope,s=t.subscript;if(s&&mr(W(s,{environment:i,scope:o,state:n,next:void 0}),W(s,{environment:i,scope:o,state:r,next:void 0})))return!1;let c=W(t.expression,{environment:i,scope:o,state:n,next:r});if(typeof c!=`boolean`)throw new e.b(`Encountered an action predicate that's not a boolean.`);return c}case`Not`:return!o(t.body);case`And`:return t.operands.every(o);case`Or`:return t.operands.some(o);case`Next`:return wx(t.body,r??n,void 0,i,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new e.b(`TLC cannot evaluate a temporal formula in a single step`)}},Tx=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>Tx(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return wx(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Ex=`UnnamedAction`,Dx={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},Ox=e=>{let t=e.range??Dx;return Fr([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},kx=(e,t)=>{let n=[[`name`,e.name],[`location`,Ox(e.location)]];return e.parameters.length>0&&n.push([`context`,Fr(e.parameters)],[`parameters`,Pr(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),Fr(n)},Ax=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),jx=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Mx=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,Nx=e=>e.kind===`Apply`?e.args:[],Px=(e,t,n)=>{let r=Mx(e);if(r===void 0)return;if(O(e)){let e=_h(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=sg(r,n);return i?.kind===`Closure`?i:void 0},Fx=(t,n)=>{try{return W(t,jx(n,void 0)),!0}catch(t){if(t instanceof e.y)return!1;throw t}},Ix=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&gu(e,t)&&Fx(e.body,t),Lx=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&Ix(e,t),Rx=(e,t)=>{let n=Oh(e.name,t);return n?.body===e.body&&Lx(n,t)},zx=(e,t)=>{if(e.kind!==`Identifier`||!O(e))return;let n=_h(t,e.name);return n?.kind===`Thunk`?n:void 0},Bx=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:wg(e.definitions,jx(n,t))};let r=zx(e,t);return r&&{expression:r.expression,scope:r.scope}},Vx=(e,t)=>(e?.params??[]).flatMap(e=>{let n=_h(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Hx=(t,n)=>{try{return t()}catch(t){if(t instanceof e.y)return n();throw t}},Ux=(e,t,n,r,i)=>{let a=Nx(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return r&&a.length===0?[{...e,parameters:[],expression:r.body,scope:r.scope}]:r?a.some(e=>yx(e,n,i)!==0)?o():Hx(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,jx(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},Wx=(t,n,r,i,a)=>{let o=()=>({name:r?.name??Ex,location:t.location,parameters:Vx(r,n),expression:t,scope:n});if(Ip.has(t.kind))throw e.it(new e.b(`${e.G}The next state relation is not a boolean expression.\n${oh(t)}`),e.tt.error);switch(t.kind){case`Let`:return Wx(t.body,wg(t.definitions,jx(i,n)),r,i,a);case`Label`:return Wx(t.body,n,r,i,a);case`Or`:return t.operands.flatMap(e=>Wx(e,n,r,i,a));case`Exists`:return Hx(()=>{let e=[];return Bh(t.bounds,jx(i,n),n=>(e.push(...Wx(t.body,n,r,i,a)),!1)),e.length===0?[o()]:e},()=>[o()])}let s=O(t)?void 0:a.get(Mx(t)??``),c=Px(t,n,i);if(s)return Ux(s,t,n,c,i);if(!c)return[o()];let l=Nx(t),u=O(t)?c.name:i.instanceNames.get(Mx(t)??``)??c.name,d=()=>[{name:u,location:t.location,parameters:[],expression:t,scope:n}];return Rx(c,i)||l.some(e=>yx(e,n,i)!==0)?d():Hx(()=>{let e=l.reduce((e,t,r)=>({name:c.params[r].name,binding:{kind:`Value`,value:W(t,jx(i,n))},parent:e}),c.scope);return Wx(c.body,e,{...c,name:u},i,a)},d)},Gx=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>Gx(e,t,n,r,i,o),s=(e,t,n)=>Ax(e,Rc(t,a),n),c=Bx(e,t,n);if(c){o(c.expression,c.scope);return}let l=Px(e,t,n);if(l&&Rx(l,n))return;let u=l?[...a,...Lc.get(l.body)??[]]:a;if(l&&l.params.length===0){if(yx(l.body,l.scope,n)===1){r.inits.push(s(l.name,l.body,l.scope));return}o(l.body,l.scope,u);return}if(l&&e.kind===`Apply`&&l.params.length===e.args.length){o(l.body,bg(l,e.args,jx(n,t)),u);return}if(e.kind===`And`){e.operands.forEach(e=>o(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t,frames:a});return}r.temporals.push(s(Ex,e,t));return}let d=yx(e,t,n);d<=1?r.inits.push(s(Ex,e,t)):d===3&&r.temporals.push(s(Ex,e,t))},Kx=(e,t,n,r,i)=>{let a=(t,n)=>Kx(e,t,n,r,i),o=Bx(t,n,r);if(o){a(o.expression,o.scope);return}let s=Px(t,n,r);if(s&&Rx(s,r))return;if(s&&s.params.length===Nx(t).length){a(s.body,t.kind===`Apply`?bg(s,t.args,jx(r,n)):s.scope);return}if(t.kind===`Forall`&&Hx(()=>(Bh(t.bounds,jx(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(Ax(e,a)):yx(a,n,r)<2?i.invariants.push(Ax(e,a)):i.impliedTemporals.push(Ax(e,t));return}let c=yx(t,n,r);c<=1?i.impliedInits.push(Ax(e,t)):c===3&&i.impliedTemporals.push(Ax(e,t))},qx=(e,t)=>{let n=Oh(e,t);return n?.kind===`Operator`&&!Lx(n,t)?n:void 0},Jx=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:qx(e.specification,t);a&&(Gx(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:Ex,location:e.frames[0].location,parameters:[],expression:Rc(e.expression,e.frames),scope:e.scope}]:Wx(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:sg(e.init,t);o?.kind===`Closure`&&r.inits.push(Ax(e.init??``,o.body));let s=e.next===void 0?void 0:sg(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Wx(s.body,s.scope,s,t,n)),r},Yx=(e,t,n)=>{let r=[],i=(e,t)=>{if(e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`)return!1;if(e.kind===`Tuple`)return e.elements.every(e=>i(e,t));if(e.kind===`Label`)return i(e.body,t);let a=Bx(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&O(e)?_h(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!O(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=Px(e,t,n);if(!s||s.params.length!==Nx(e).length)return!0;let c=Oh(s.name,n);return c?.body===s.body&&Ix(c,n)?!0:i(s.body,e.kind===`Apply`?bg(s,e.args,jx(n,t)):s.scope)};return i(e,t)?r:void 0},Xx=(e,t,n)=>Jx(e,t,n).inits,Zx=(e,t,n)=>Jx(e,t,n).actions,Qx=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>L(e[1])).join(`,`)})`,$x=(t,n,r=!1)=>`${t.name===Ex?r?`Initial predicate`:`Action`:t.name}${n===`1.7.4`?``:Qx(t)} ${e.X(t.location.range??Dx)}`,eS=e=>`${e.name}${Qx(e)}`,tS=(e,t,n,r)=>{let i=Jx(e,t,r);e.invariants.forEach(e=>{let n=qx(e,t);n&&i.invariants.push(Ax(e,n.body))}),e.properties.forEach(e=>{let n=qx(e,t);n&&Kx(e,n.body,void 0,t,i)});let a=t.coverage,o=(e,t)=>_r(e.map(e=>{let n=a&&t&&xo(a,t,e.expression);return kx(e,n&&Fr(n))})),s=e=>_r(e.flatMap(e=>{let n=qx(e,t);return n?[Fr([[`name`,n.name],[`location`,Ox(n.location)]])]:[]}));return Fr([[`inits`,o(i.inits,`init`)],[`actions`,o(i.actions,`next`)],[`temporals`,o(i.temporals)],[`invariants`,o(i.invariants,`invariant`)],[`impliedinits`,o(i.impliedInits,`implied`)],[`impliedactions`,o(i.impliedActions,`implied`)],[`impliedtemporals`,o(i.impliedTemporals)],[`variables`,_r(t.variables.map((e,t)=>Fr([[`name`,e],[`location`,Ox(n[t])],...a?[[`coverage`,Fr([[`distinct`,co(a,t)]])]]:[]])))],[`actionconstraints`,s(e.actionConstraints)],[`constraints`,s(e.constraints)]])},nS=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),rS=(e,t)=>{let n=/* @__PURE__ */ new Map;return(/* @__PURE__ */ new Set([...e.keys(),...t.keys()])).forEach(r=>{let i=e.get(r),a=i?t.get(i.name)??i:t.get(r);a&&a.name!==r&&n.set(r,a)}),n},iS=t=>e.it(new e.b(`${e.G}${t}`),e.tt.error),aS=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!M(e)||!M(i))throw iS(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},oS=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${sS(t)}`:n},sS=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Number`)return e.text??String(e.value);if(e.kind===`SetEnumeration`)return`{${e.elements.map(sS).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${oS(e.pattern,e.set)}:${sS(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(sS).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${sS(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>oS(e.pattern,e.set)).join(`,`)}|->${sS(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(sS);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},cS=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,lS=(t,n,r)=>{let i=n.definitions.get(t);if(i===void 0&&!n.constants.has(t))throw new e._(`The symmetry function ${t} specified in the configuration file\nis not defined in the specification.`);if(i?.kind!==`Operator`||i.params.length>0)throw iS(`The symmetry function ${t} must specify a set of permutations.`);let a=e=>W(e,{environment:n,scope:void 0,state:void 0,next:void 0}),o=a(i.body);if(!j(o)||!N(o))throw iS(`The symmetry operator must specify a set of functions.`);let s=P(o).elements;if(!s.every(jt))throw iS(`The symmetry values must be function records.`);let c=i.body,l=c.kind===`Apply`?c.args:c.kind===`SetEnumeration`?c.elements:[],u=new Map(r.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),d=e=>{if(e.length===0)return;let t=e.map(e=>{let t=sS(cS(e)?e.args[0]:e);return u.get(t)??t}),r=e.length>1;n.runtime.warn(Ge.symmetrySetTooSmall,`The set${r?`s`:``} ${t.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(l.length>=s.length){d(l);return}let f=/* @__PURE__ */ new Map;s.map(aS).forEach(e=>{e.size>0&&f.set(nS(e),e)});let p=[...f.values()],m=0;for(;m<f.size;){let e=[...f.values()],t=e.length;p.forEach(n=>e.slice(m,t).forEach(e=>{let t=rS(n,e),r=nS(t);t.size>0&&!f.has(r)&&f.set(r,t)})),m=t}let h=new Set([...f.values()].flatMap(e=>[...e.values()].map(e=>e.name))),g=new Set(r.map(e=>e.name));if(d(l.filter(e=>{if(!cS(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||g.has(t.name))return!1;let n=a(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>M(e)&&h.has(e.name))})),f.size!==0)return[...f.values()]},uS=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=fS(r,t);if(i===r)continue;let a=e.slice(0,n);a.push(i);for(let r=n+1;r<e.length;r++)a.push(fS(e[r],t));return a}},dS=(e,t)=>{let n=[],r=[];for(let i of e){let e=fS(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(gn);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(gn(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},fS=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=dS(e.elements,t);return n?xn(n):e}if(n===`Function`||n===`LazyFunction`&&N(e.domain)){let n=I(e),r=uS(n.domain,t),i=uS(n.range,t)??n.range;if(r){let e=Cr(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Cn(n.domain,e.range):e}return i===n.range?n:Cn(n.domain,i)}if(n===`Interval`||!j(e)||!N(e))return e;let r=P(e),i=uS(r.elements,t);return i?_r(i):r},pS=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=fS(e[o],i),a===0&&(a=gn(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},mS={line:0,column:0},hS=e=>({kind:`Identifier`,name:e,location:mS}),gS=/* @__PURE__ */ new Set([`name`,`property`]),_S=(t,n,r)=>{let i=Oh(n,r);if(!i)throw new e._(`The ${t} ${n} specified in the configuration file\nis not defined in the specification.`);if(i.kind===`Operator`&&i.params.length>0)throw new e._(gS.has(t)?`TLC requires ${n} not to take any argument.`:`TLC requires ${t} not to take any argument, but one was given: ${n}`);return i},vS=e=>e.body.kind===`Number`||e.body.kind===`String`,yS=(t,n,r)=>{if(r.constants.has(t))return r.constants.get(t);if(gu(n,r)&&!vS(n))try{return W(hS(t),US(r,void 0,void 0))}catch(t){if(t instanceof e.b||e.et(t))return;throw t}},bS=(t,n,r)=>{if(r.constants.has(n))throw new e._(`The ${t} ${n} cannot be a constant.`);let i=_S(t,n,r);if(yS(n,i,r)!==void 0)throw new e._(`The ${t} ${n} cannot be a constant.`);return i},xS=(t,n,r)=>{let i=r.constants.has(n)?void 0:_S(t,n,r),a=i?yS(n,i,r):r.constants.get(n);if(a!==void 0&&a!==!0)throw new e._(`The ${t} of ${n} is equal to ${L(a)}`);return a===void 0?i:void 0},SS=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},CS=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),rg(e.startupDefinitions,r),t.invariants.forEach(e=>{xS(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},wS=(t,n)=>{let r=Zl({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>n.definitions.get(e)});return t.flatMap(t=>{let i=xS(`invariant`,t,n);if(!i)return[];let a=r.analyzeDefinition(i,/* @__PURE__ */ new Map);if(a.level>=2){let n=a.params.size===0?``:`
|
|
1763
1786
|
Note that a bug can cause TLC to incorrectly report this error.
|
|
1764
1787
|
If you believe your TLA+ or PlusCal specification to be correct,
|
|
1765
|
-
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw e.q(new e.h(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${n}`),e.G.safetyEvaluationFailure)}return[{name:t,expression:Kv(t),scope:void 0}]})},ty=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>ty(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=gu(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return ty(n.body,t)}return[e]},ny=(t,n,r)=>{let i=t.expression;if(i.kind!==`Identifier`||Dv(i,t.scope,n)>0)return!1;let a=H(i,_y(n,void 0,void 0,t.scope));if(a===!1)throw new e.h(`The spec is trivially false because ${i.name} is false.`);if(a!==!0)throw new e.h(`The operator ${i.name}, which equals ${F(a)},\ncannot be used as a ${r}`);return!0},ry=(t,n)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return Xv(t,e,n),Kv(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}if(t.init!==void 0||t.next!==void 0)throw new e.h(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let r=[],i=[],a=[],o=Jv(`name`,t.specification,n),s=Yv(t.specification,o,n);if(s!==void 0)throw new e.h(`The value of ${t.specification} is equal to ${F(s)}`);if(kv(o.body,void 0,n,!1).forEach(o=>{let s=o.expression;if(ny(o,n,`spec`))return;if(s.kind===`UnboundedQuantifier`&&s.isTemporal)throw e.q(new e.h(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.G.error);if(s.kind===`Always`&&s.expression.kind===`BoxAction`){i.push({expression:s.expression.action,scope:o.scope});return}if(s.kind===`Always`&&Dv(s.expression,o.scope,n)<2)throw e.q(new e._(`TLC cannot handle the temporal formula ${B(s.expression)}`),e.G.error);let c=Dv(s,o.scope,n);if(c===3)a.push(o);else{if(c===2)throw new e.h(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);r.push(o)}}),i.length>1)throw new e.h(`The specification ${t.specification} must contain at most one [][Next]_vars`);let c=[...r,...i],l=e=>`$specification${e}`,u=c.reduce((e,t,n)=>t.scope===void 0?e:{name:l(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),d=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:l(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:r.length===0?void 0:{kind:`And`,operands:r.map(d),location:Gv},next:i.length===0?void 0:d(i[0],r.length),scope:u,temporals:a}},iy=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=Zv(`property`,t,n);if(!a)return;Dv(a.body,void 0,n)===1&&r?.({kind:`state-level-property`,name:t});let o=n.runtime.version!==`1.7.4`;kv(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(ny(r,n,`property`))return;let o=r.name??t;if(a.kind===`Always`&&a.expression.kind===`BoxAction`){i.actionProperties.push({name:o,box:a.expression,action:a.expression.action,subscript:a.expression.subscript,scope:r.scope});return}if(a.kind===`Always`&&Dv(a.expression,r.scope,n)<=1){let e=a.expression,t=e.kind===`Identifier`&&!T(e)?gu(e.name,n):void 0;i.invariants.push({name:t?.name??(e.kind===`Identifier`?e.name:o),expression:e,scope:r.scope});return}let s=Dv(a,r.scope,n);if(s<2)i.initialPredicates.push({name:o,expression:a,scope:r.scope});else{if(s===2)throw new e.h(`The property ${t} is an action-level formula`);i.liveness.push({name:t,expression:a,scope:r.scope})}})}),i},ay=(e,t,n)=>t.flatMap(t=>Zv(e,t,n)?[{name:t,expression:Kv(t),scope:void 0}]:[]),oy=(e,t)=>{let n=gu(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},sy=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e.h(`_POSSIBLE lists ${r} more than once`);Xv(`possible`,r,n);let a=Kv(r);if(Dv(a,void 0,n)===3)throw new e.h(`The possible of ${r} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:r,expression:a,scope:void 0}}),cy=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||T(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},ly=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=gu(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},uy=(e,t)=>e.flatMap(e=>ty(e.expression,t).map(n=>{let r=e.scope===void 0?vc(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:cy(n,r,t),predicate:ly(e.expression,t)}})),dy=(e,t,n)=>{let r=e.variables;if(!n||!r)return!1;for(let e=0;e<r.length;e++)if(t[r[e]]!==n[r[e]])return!1;return!0},fy=/[\u0100-\uffff]/,py=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),my=e=>e.kind===`String`?fy.test(e.value):e.kind===`Set`&&e.elements.some(my),hy=e=>e.kind===`String`&&fy.test(e.value)||e.kind===`Apply`&&py.has(e.operator)||Ae(e).some(hy),gy=(e,t)=>e.constants.some(e=>my(e.value)||(e.args??[]).some(my))||[...t.definitions.values()].some(e=>hy(e.body)||e.kind===`Function`&&e.bounds.some(e=>hy(e.set))),_y=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),vy=(e,t,n)=>hu(H(e,t),n),yy=(t,n,r=by)=>{let i=H(t,n);if(typeof i!=`boolean`)throw new e._(r(t,n.environment));return i},by=(e,t)=>{let n=e.kind===`Identifier`?gu(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${i&&r.kind!==`Number`?Xl(i):Zl(r)}`},xy=(e,t)=>yy(e.expression,t,(n,r)=>(yy(e.predicate,t),by(n,r))),Sy=()=>{},Cy=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=vy(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),wy=(t,n,r)=>{try{return vy(t,_y(n,void 0,void 0),r)?void 0:{message:void 0}}catch(t){if(t instanceof e._)return{message:t.message};throw t}},Ty=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=wy(n.expression,t,`an assumption`);if(e)return{name:B(n.expression),trace:[],message:e.message}}},Ey=(t,n,r,i)=>{let a=ey(t.invariants,n),o=ry(t,n),s=iy(t,n,i),c=uy([...a,...s.invariants],n),l=[...new Map(c.map(e=>[e.predicate,e])).values()],u=c.length>0||s.actionProperties.length>0||s.liveness.length>0;if(o.init===void 0&&(u||s.initialPredicates.length>0||n.variables.length>0))throw new e.h(n.runtime.version===`1.7.4`?Ki:`The configuration file did not specify the initial state predicate.`);if(o.next===void 0&&u)throw new e.h(`The configuration file did not specify the next state predicate.`);let d=uy(ay(`constraint`,t.constraints,n),n),f=ay(`action constraint`,t.actionConstraints,n);t.rlReward!==void 0&&Jv(`rlreward`,t.rlReward,n),t.periodic!==void 0&&Jv(`periodic`,t.periodic,n);let p=sy(t.possible,n);if(n.variables.length===0)return;let m=t.symmetry===void 0?void 0:Bv(t.symmetry,n,t.substitutions);t.view!==void 0&&Jv(`view function`,t.view,n);let ee=t.view===void 0?void 0:{name:t.view,expression:Kv(t.view),scope:void 0},te=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Gv};return{...e,unchanged:t}}),ne=e=>Dv(e.expression,void 0,n)>=2,h=p.filter(e=>!ne(e)),g=p.filter(ne),re=n.runtime,ie={indices:void 0},_=()=>{if(ie.indices)return ie.indices;let e=r(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return ie.indices=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),ie.indices},ae=(e,t)=>H(e,_y(n,t,void 0)),oe=e=>{let t=_(),n=m===void 0?e:Wv(e,m,t);return Dm(ee===void 0?t.map(e=>n[e]):[ae(ee.expression,n)])},se=/* @__PURE__ */ new WeakSet,ce=(t,r,i)=>{let a=i&&!se.has(i)?i:void 0;if(dy(t,r,a))return!1;try{let e=_y(n,r,void 0,t.scope),i=t.membership;return a&&i?!ur(r[i.variable],a[i.variable],H(i.set,e)):!xy(t,e)}catch(n){throw i?oa(e.q(n,e.G.safetyEvaluationFailure),Hi.invariantEvaluationFailed,`Evaluating invariant ${t.name} failed.`):n}},le=gy(t,n);re.getFingerprint=oe;let ue=()=>{let e=p.find(e=>!re.possibleCounts.get(e.name));if(!e)return;let t=oy(e.name,n),r=t?` at ${Xl(t)}`:``;return{name:e.name,code:Hi.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:E(F(Xm(re),!0))}};return{properties:s,spec:o,isSymmetric:m!==void 0,isConstrained:d.length>0||f.length>0,getTlcOrder:_,getStoredFingerprints:(e,t)=>ee!==void 0||le?BigInt64Array.from(e,oe):Om(t,_()),getFingerprintState:e=>{if(le)return[String(oe(e))];let t=m===void 0?e:Wv(e,m,_());return ee===void 0?t:[ae(ee.expression,t)]},findViolatedInvariant:(e,t)=>{let n=c.find(n=>ce(n,e,t));return n&&se.add(e),n},getViolatedInvariants:e=>{let t=l.filter(t=>c.some(n=>n.predicate===t.predicate&&ce(n,e,void 0)));return t.length>0&&se.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>yy(n,_y(t,e,void 0,r));d.every(e=>r(e.predicate,e.scope))&&n();let i=l.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=s.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(d.every(e=>yy(e.predicate,_y(n,t,void 0,e.scope)))&&f.every(r=>yy(r.expression,_y(n,e,t,r.scope))))||r())||l.every(e=>yy(e.predicate,_y(n,t,void 0,e.scope))))&&te.every(r=>yy(r.box,_y(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>d.every(r=>dy(r,e,t)||xy(r,_y(n,e,void 0))),findFailedInitialPredicate:e=>s.initialPredicates.find(t=>!yy(t.expression,_y(n,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>te.find(r=>{try{return!yy(r.action,_y(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${B(r.box)}`)&&!vy(r.unchanged,_y(n,e,t,r.scope),`a subscript`)}catch(e){throw oa(Dy(e),Hi.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(t,r)=>f.every(i=>yy(i.expression,_y(n,t,r),t=>`${e.F}${by(t,n)}`)),trackStatePossible:h.length===0?Sy:e=>Cy(h,re,_y(n,e,void 0)),trackActionPossible:g.length===0?Sy:(e,t)=>Cy(g,re,_y(n,e,t)),findUnwitnessedPossible:ue,findPostconditionViolation:(r=!1)=>{let i=t.postconditions.find(e=>{let t=gu(e,n);return t!==void 0&&Hu(t,n)!==void 0});if(i!==void 0){if(r)return;throw e.q(new e._(`${e.F}The post condition ${i} cannot be a constant.`),e.G.error)}let a=ue();if(a)return a;for(let e of t.postconditions){let t=wy(Kv(e),n,`a postcondition`);if(!t)continue;let r=oy(e,n),i=r?` at ${Xl(r)}`:``;return t.message===void 0?{name:e,code:Hi.postconditionFalse,message:`Postcondition ${e}${i} is false.`}:{name:e,code:Hi.postconditionFailed,message:`Evaluating postcondition ${e}${i} failed.\n${t.message}`}}}}},Dy=t=>t instanceof e.C?e.q(t,t.exitCode):t,Oy=(e,t)=>e*((t-e)/2**64),ky=e=>e.includes(`.`)?e:`${e}.0`,Ay=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return ky(String(e));let[n,r]=e.toExponential().split(`e`);return`${ky(n)}E${r.replace(`+`,``)}`},jy=e=>e!==void 0&&e>=`0`&&e<=`9`,My=e=>{if(e===0)return`0.0`;let t=Ay(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;jy(t[n.next]);)n.result+=t[n.next++],n.digits++;if(n.next===t.length)return n.result;if(t[n.next]!==`.`)return t;if(n.next++,n.digits>=2)for(;jy(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;jy(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(jy(t[n.next])&&Number(t[n.next])>=5&&(n.result=Ny(n.result));jy(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},Ny=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Ny(r)}.`:n===`9`?`${Ny(r)}0`:`${r}${Number(n)+1}`},Py=e=>{let t={value:0};for(;10n**BigInt(t.value+1)<e*10n;)t.value++;let n=10n**BigInt(t.value+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t.value+1}`)},Fy=(e,t,n)=>{if(Oy(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a={narrow:1/0,wide:9223372036854775807n};for(let e=1;e<r.length;e++){let t=i[2*e+1],n=i[2*e-1];if(t<0!=n<0)continue;let o=t-n;if(o<=1048576){let t=o*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a.narrow=Math.min(a.narrow,t)}else{let t=r[e]-r[e-1];t<a.wide&&(a.wide=t)}}if(a.narrow===1/0)return a.wide;let o=BigInt(a.narrow);return o<a.wide?o:a.wide},Iy=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a={count:0},o=n.find(t=>(a.count+=e[t],a.count>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},Ly=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Ry=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^jr(e[t]),16777619),r=Math.imul(r^Lr(e[t]),1540483477);t[0]=Ly(n)||1,t[1]=Ly(r)},zy=()=>{let e={slots:/* @__PURE__ */ new Int32Array(8192),used:0},t=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},n=()=>{let n=e.slots,r=new Int32Array(n.length*2);for(let e=0;e<n.length;e+=2){if(n[e]===0)continue;let i=t(r,n[e],n[e+1]);r[i*2]=n[e],r[i*2+1]=n[e+1]}e.slots=r};return{insert:(r,i)=>{e.used*4>=e.slots.length&&n();let a=t(e.slots,r,i);return e.slots[a*2]!==r&&(e.slots[a*2]=r,e.slots[a*2+1]=i,e.used++,!0)}}},By=(e,t)=>{let n=e.length-1;for(let r=Number(t>>32n)&n;;r=r+1&n){let n=Atomics.load(e,r);if(n===t)return!1;if(n!==0n)continue;let i=Atomics.compareExchange(e,r,0n,t);if(i===0n)return!0;if(i===t)return!1}},Vy=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),Hy=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return By(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},Uy=e=>Atomics.load(e.used,0)*2>=e.slots.length,Wy=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&By(t,n);return{slots:t,used:e.used}},Gy=[void 0,`lambda`,`tuple`,`record`],Ky=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=vr(e.domain);return t?(r(7),r(Gy.indexOf(Ct(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(Gy.indexOf(Ct(e))),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},qy=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return vt(t.strings[n[r.index++]]);if(e===5)return yt(i(n[r.index++]));let a=Gy[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=On({kind:`Interval`,low:e,high:e+t-1});return St(bt(o,i(t)),a)}let o=n[r.index++],s=i(o);return St(bt(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return gu}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return Z_}}),Object.defineProperty(exports,"At",{enumerable:!0,get:function(){return qr}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return em}}),Object.defineProperty(exports,"Bt",{enumerable:!0,get:function(){return rt}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Mv}}),Object.defineProperty(exports,"Ct",{enumerable:!0,get:function(){return fa}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return K_}}),Object.defineProperty(exports,"Dt",{enumerable:!0,get:function(){return An}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return jv}}),Object.defineProperty(exports,"Et",{enumerable:!0,get:function(){return vt}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return $h}}),Object.defineProperty(exports,"Ft",{enumerable:!0,get:function(){return at}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return tf}}),Object.defineProperty(exports,"Gt",{enumerable:!0,get:function(){return Oe}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return am}}),Object.defineProperty(exports,"Ht",{enumerable:!0,get:function(){return P}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return eh}}),Object.defineProperty(exports,"It",{enumerable:!0,get:function(){return jr}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return vd}}),Object.defineProperty(exports,"Jt",{enumerable:!0,get:function(){return ee}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return ld}}),Object.defineProperty(exports,"Kt",{enumerable:!0,get:function(){return ke}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return $m}}),Object.defineProperty(exports,"Lt",{enumerable:!0,get:function(){return O}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return z_}}),Object.defineProperty(exports,"Mt",{enumerable:!0,get:function(){return it}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return T_}}),Object.defineProperty(exports,"Nt",{enumerable:!0,get:function(){return kr}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return $}}),Object.defineProperty(exports,"Ot",{enumerable:!0,get:function(){return pn}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return Qh}}),Object.defineProperty(exports,"Pt",{enumerable:!0,get:function(){return Ar}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return Xl}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return th}}),Object.defineProperty(exports,"Rt",{enumerable:!0,get:function(){return Nt}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return Sv}}),Object.defineProperty(exports,"St",{enumerable:!0,get:function(){return sa}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Dv}}),Object.defineProperty(exports,"Tt",{enumerable:!0,get:function(){return It}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return im}}),Object.defineProperty(exports,"Ut",{enumerable:!0,get:function(){return Ae}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return nm}}),Object.defineProperty(exports,"Vt",{enumerable:!0,get:function(){return st}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return Op}}),Object.defineProperty(exports,"Wt",{enumerable:!0,get:function(){return T}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return H}}),Object.defineProperty(exports,"Xt",{enumerable:!0,get:function(){return re}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return B}}),Object.defineProperty(exports,"Yt",{enumerable:!0,get:function(){return ne}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return Du}}),Object.defineProperty(exports,"Zt",{enumerable:!0,get:function(){return se}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return Xv}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return ra}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return Wy}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return Ul}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return $v}}),Object.defineProperty(exports,"bt",{enumerable:!0,get:function(){return da}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return Ry}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return qc}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return Fy}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return Hi}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return pd}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return Oy}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return Ui}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return Ty}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return ia}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return Ey}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return ta}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return Vy}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return Vl}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return vv}}),Object.defineProperty(exports,"jt",{enumerable:!0,get:function(){return F}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return xv}}),Object.defineProperty(exports,"kt",{enumerable:!0,get:function(){return A}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return My}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return Jc}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return Kv}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return ea}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return Ky}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return lu}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return Hy}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return Hl}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return Iy}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return Gi}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return ad}}),Object.defineProperty(exports,"qt",{enumerable:!0,get:function(){return w}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return zy}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return Ku}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return Uy}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return Wl}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return qy}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return fd}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return Py}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return pc}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return _y}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return Zi}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Nv}}),Object.defineProperty(exports,"wt",{enumerable:!0,get:function(){return Sr}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return Dy}}),Object.defineProperty(exports,"xt",{enumerable:!0,get:function(){return Qi}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return Qv}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return ha}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return Dm}}),Object.defineProperty(exports,"zt",{enumerable:!0,get:function(){return At}});
|
|
1788
|
+
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw e.it(new e._(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${n}`),e.tt.safetyEvaluationFailure)}return[{name:t,expression:hS(t),scope:void 0}]})},TS=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>TS(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Oh(e.name,t);if(n?.kind===`Operator`&&n.params.length===0&&ng(n,t)===void 0)return TS(n.body,t)}return[e]},ES=(t,n,r)=>{let i=t.expression;if(i.kind!==`Identifier`||yx(i,t.scope,n)>0)return!1;let a=W(i,US(n,void 0,void 0,t.scope));if(a===!1)throw new e._(`The spec is trivially false because ${i.name} is false.`);if(a!==!0)throw new e._(`The operator ${i.name}, which equals ${L(a)},\ncannot be used as a ${r}`);return!0},DS=(t,n,r,i,a)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return bS(t,e,n),hS(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[],isPropertyFairness:!1}}if(t.init!==void 0||t.next!==void 0)throw new e._(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let o=[],s=[],c=[],l=n.constants.has(t.specification)?n.constants.get(t.specification):yS(t.specification,_S(`name`,t.specification,n),n);if(l!==void 0)throw new e._(`The value of ${t.specification} is equal to ${L(l)}`);let u=_S(`name`,t.specification,n),d=t.properties.length===1?t.properties[0]:void 0,f=!1;xx(u.body,void 0,n,!1).forEach(t=>{let l=t.expression;if(ES(t,n,`spec`))return;let u=l.kind===`Identifier`&&!O(l)?n.variableIndex.get(l.name):void 0;if(l.kind===`Identifier`&&u!==void 0){let t=r[u].range;throw new e._(`The operator ${l.name}, which equals ${t?e.X(t):l.name},\ncannot be used as a spec`)}if(l.kind===`UnboundedQuantifier`&&l.isTemporal)throw e.it(new e._(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.tt.error);if(l.kind===`Always`&&l.expression.kind===`BoxAction`){let r=Yx(l.expression.subscript,t.scope,n);if(r===void 0&&a?.({kind:`warning`,code:Ge.subscriptUndetermined,text:`TLC could not determine if the subscript of the next-state relation contains
|
|
1789
|
+
all state variables. Proceed with fingers crossed.`}),i().filter(e=>r!==void 0&&!r.includes(e)).forEach(e=>a?.({kind:`warning`,code:Ge.subscriptMissingVariable,text:`The subscript of the next-state relation specified by the specification\ndoes not seem to contain the state variable ${e}`})),s.length>0)throw new e._(`The specification contains more than one conjunct of the form [][Next]_v,
|
|
1790
|
+
but TLC can handle only specifications with one next-state relation.`);s.push({expression:l.expression.action,scope:t.scope});return}if(l.kind===`Always`&&l.expression.kind!==`Let`&&l.expression.kind!==`Label`&&yx(l.expression,t.scope,n)<2)throw e.it(new e.b(`TLC cannot handle the temporal formula ${H(l.expression)}`),e.tt.error);let p=yx(l,t.scope,n);if(p===3)d!==void 0&&t.path.includes(d)||(f=!0),c.push(t);else{if(p===2)throw new e._(`TLC cannot handle this conjunct of the spec:\n${H(l)}`);o.push(t)}});let p=[...o,...s],m=e=>`$specification${e}`,h=p.reduce((e,t,n)=>t.scope===void 0?e:{name:m(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),g=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:m(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:o.length===0?void 0:{kind:`And`,operands:o.map(g),location:mS},next:s.length===0?void 0:g(s[0],o.length),scope:h,temporals:c,isPropertyFairness:c.length>0&&!f}},OS=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=xS(`property`,t,n);if(!a)return;yx(a.body,void 0,n)===1&&r?.({kind:`state-level-property`,name:t});let o=n.runtime.version!==`1.7.4`;xx(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(ES(r,n,`property`))return;let o=r.name??t;if(a.kind===`Always`&&a.expression.kind===`BoxAction`){i.actionProperties.push({name:o,box:a.expression,action:a.expression.action,subscript:a.expression.subscript,scope:r.scope});return}if(a.kind===`Always`&&yx(a.expression,r.scope,n)<=1){let e=a.expression,t=e.kind===`Identifier`&&!O(e)?Oh(e.name,n):void 0;i.invariants.push({name:t?.name??(e.kind===`Identifier`?e.name:o),expression:e,scope:r.scope});return}let s=yx(a,r.scope,n);if(s<2)i.initialPredicates.push({name:o,expression:a,scope:r.scope});else{if(s===2){let t=H(a),n=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,r=a.kind===`BoxAction`?`To check that action ${o} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${t} (compare page 90 of ${n}).`:a.kind===`AngleAction`?`To check that infinitely many ${o} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${t} (compare page 91 of ${n}).`:`To check that action ${o} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${t}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${n}).`;throw new e._(`The formula ${o} at ${t} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${r}`)}i.liveness.push({name:t,expression:a,scope:r.scope})}})}),i},kS=(e,t,n)=>t.flatMap(t=>xS(e,t,n)?[{name:t,expression:hS(t),scope:void 0}]:[]),AS=(e,t)=>{let n=Oh(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},jS=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e._(`_POSSIBLE lists ${r} more than once`);bS(`possible`,r,n);let a=hS(r);if(yx(a,void 0,n)===3)throw new e._(`The possible of ${r} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:r,expression:a,scope:void 0}}),MS=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||O(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},NS=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=Oh(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},PS=(e,t)=>e.flatMap(e=>TS(e.expression,t).map(n=>{let r=e.scope===void 0?xu(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:MS(n,r,t),predicate:NS(e.expression,t)}})),FS=(e,t,n)=>{let r=e.variables;if(!n||!r)return!1;for(let e=0;e<r.length;e++)if(t[r[e]]!==n[r[e]])return!1;return!0},IS=/[\u0100-\uffff]/,LS=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),RS=e=>e.kind===`String`?IS.test(e.value):e.kind===`Set`&&e.elements.some(RS),zS=e=>e.kind===`String`&&IS.test(e.value)||e.kind===`Apply`&&LS.has(e.operator)||Be(e).some(zS),BS=(e,t)=>e.constants.some(e=>RS(e.value)||(e.args??[]).some(RS))||[...t.definitions.values()].some(e=>zS(e.body)||e.kind===`Function`&&e.bounds.some(e=>zS(e.set))),VS=e=>{if(!jt(e))return;let t=Rt(I(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},HS=(e,t,n,r)=>{let i=n===1?`the next-state action`:`action ${t} of the next-state relation`,a=r===`1.7.4`?`assigned`:`defined`;return`Successor state is not completely specified by ${i}. The following variable${e.length>1?`s are`:` is`} not ${a}: ${e.join(`, `)}.\n`},US=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),WS=(e,t,n)=>Ch(W(e,t),n),GS=(t,n,r=qS)=>{let i=W(t,n);if(typeof i!=`boolean`)throw new e.b(r(t,n.environment));return i},KS=(t,n,r)=>{let i=n.kind===`Identifier`?Oh(n.name,r):void 0,a=i?.kind===`Operator`?i.body:n,o=i?.kind===`Operator`?i.bodyRange:void 0;return`TLC expected a ${t} value, but did not find one. ${o&&a.kind!==`Number`?e.X(o):oh(a)}`},qS=(e,t)=>KS(`boolean`,e,t),JS=(e,t)=>GS(e.expression,t,(n,r)=>(GS(e.predicate,t),qS(n,r))),YS=()=>{},XS=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=WS(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),ZS=(t,n)=>{try{return t(US(n,void 0,void 0))?void 0:{message:void 0}}catch(t){if(t instanceof e.b)return{message:t.message};throw t}},QS=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=ZS(e=>Dh(W(n.expression,e),n.expression),t);if(e)return{name:oh(n.expression),trace:[],message:e.message}}},$S=e=>{let t=typeof e.config==`string`?ze(e.config,e.version):e.config,n=pb(e.source,e.loadModule);Yt(n.getStringOrder(t)),en(e),Ma(e.fingerprintPolynomial??0);let r=kb(t,{source:e.source,loadModule:e.loadModule,order:n,loadClass:e.loadClass,print:e.onPrint??console.log,files:{readFile:e.readFile,writeFile:e.writeFile,makeDirectory:e.makeDirectory},seed:e.seed,isTool:e.isTool,traceFile:e.traceSpec?.traceFile,isSanyReported:e.isSanyReported,isWarningEnabled:e.isWarningEnabled,version:e.version,moduleOperators:e.moduleOperators});CS(r,t,e.onProgress);let i=r.environment;return i.runtime.getSpecification=()=>tS(t,i,r.variableLocations,r.instanceActions),{config:t,specification:r,environment:i,search:nC(t,i,r.variableLocations,()=>n.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators)}},eC=(t,n,r)=>{let i=QS(t,n);if(!i)return;if(i.message===void 0){let t=`Assumption ${i.name} is false.`;return r(Ge.assumptionFalse,t,t),e.tt.assumptionViolation}let a=`Evaluating assumption ${i.name} failed.\n${i.message}`;return r(Ge.assumptionEvaluationError,a,it(Ge.assumptionEvaluationError,a,!0)),e.tt.assumptionViolation},tC=t=>e.it(new e.b(`${e.G}Could not find operator: ${t.operator} in module: ${t.module}`),e.tt.error),nC=(t,n,r,i,a,o=[])=>{let s=e=>o.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw tC(e);return{name:e.operator,key:e.key}}),c=wS(t.invariants,n),l=DS(t,n,r,i,a),u=OS(t,n,a),d=t.properties[0],f=d&&Oh(d,n)?.location.range,p=t.specification,m=p&&Oh(p,n)?.location.range;l.isPropertyFairness&&f&&m&&a?.({kind:`warning`,code:Ge.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${d} at ${e.X(f)} equals\nthe fairness constraints of the behavior specification ${p} at ${e.X(m)}.\nTherefore, checking whether ${p} => ${d} using TLC will never result in a violation of ${d}.`});let h=PS([...c,...u.invariants],n),g=[...new Map(h.map(e=>[e.predicate,e])).values()],_=h.length>0||u.actionProperties.length>0||u.liveness.length>0;if(l.init===void 0&&(_||u.initialPredicates.length>0||n.variables.length>0))throw new e._(n.runtime.version===`1.7.4`?Xe:`The configuration file did not specify the initial state predicate.`);if(l.next===void 0&&_)throw new e._(`The configuration file did not specify the next state predicate.`);let ee=kS(`constraint`,[...t.constraints,...s(`constraint`).map(e=>e.name)],n),te=PS(ee,n),v=kS(`action constraint`,t.actionConstraints,n),ne=n.coverage,y=(e,t,r=!0)=>t.flatMap(t=>{if(!ne)return[];let i=r?NS(t.expression,n):t.expression,a=Ga(r?t.name:void 0,i,n),o=Ua(ne,e,a,i,t.scope);return[{expression:i,scope:t.scope,node:o}]}),re=[...y(`invariant`,c),...y(`invariant`,u.invariants,!1)],b=y(`constraint`,v),ie=y(`constraint`,ee),ae=y(`implied`,u.initialPredicates,!1),oe=y(`implied`,u.actionProperties.map(e=>({...e,expression:e.box})),!1),se=(e,t,r,i)=>{try{return io(e,t.node,()=>W(t.expression,US(n,r,i,t.scope)))}catch{return}},ce=(e,t,n)=>ne!==void 0&&e.every(e=>se(ne,e,t,n)===!0),x=(e,t,n)=>{if(ne){for(let r of e){let e=se(ne,r,t,n);if(typeof e!=`boolean`)return;if(!e)return ne.primary[r.node]++,!1;ne.secondary[r.node]++}return!0}};t.rlReward!==void 0&&_S(`rlreward`,t.rlReward,n),t.periodic!==void 0&&_S(`periodic`,t.periodic,n);let le=jS(t.possible,n);if(n.variables.length===0)return;let S=t.symmetry===void 0?void 0:lS(t.symmetry,n,t.substitutions),ue=t.view===void 0?void 0:bS(`view function`,t.view,n),de=t.view??s(`view`)[0]?.name,fe=de===void 0?void 0:{name:de,expression:hS(de),scope:void 0},C=u.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:mS};return{...e,unchanged:t}}),w=e=>yx(e.expression,void 0,n)>=2,T=le.filter(e=>!w(e)),E=le.filter(w),pe=n.runtime,me,he=()=>{if(me)return me;let e=i(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return me=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),me},ge=(e,t)=>W(e,US(n,t,void 0)),_e=e=>{let t=he(),n=S===void 0?e:pS(e,S,t);return Ia(fe===void 0?t.map(e=>n[e]):[ge(fe.expression,n)])},ve=/* @__PURE__ */ new WeakSet,ye=(t,r,i)=>{let a=i&&!ve.has(i)?i:void 0;if(FS(t,r,a))return!1;try{let e=US(n,r,void 0,t.scope),i=t.membership;return a&&i?!Si(r[i.variable],a[i.variable],W(i.set,e)):!JS(t,e)}catch(n){throw i?ut(e.it(n,e.tt.safetyEvaluationFailure),Ge.invariantEvaluationFailed,`Evaluating invariant ${t.name} failed.`):n}},D=BS(t,n);pe.getFingerprint=_e;let be=()=>{let t=le.find(e=>!pe.possibleCounts.get(e.name));if(!t)return;let r=AS(t.name,n),i=r?` at ${e.X(r)}`:``;return{name:t.name,code:Ge.possibleUnwitnessed,message:`The _POSSIBLE predicate ${t.name}${i} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:A(L(Gd(pe),!0))}},xe=ue?.body.kind===`Tuple`?ue.body.elements:[],Se=xe.flatMap(e=>e.kind===`Identifier`&&n.variables.includes(e.name)?[e.name]:[]),Ce=ue?.body.kind===`Tuple`&&Se.length===xe.length&&new Set(Se).size===Se.length,we=(e,t)=>Ce?he().filter(e=>Se.includes(n.variables[e])).map(e=>`/\\ ${n.variables[e]} = ${A(L(t[e]))}\n`).join(``):A(L(ge(e,t))),Te=(t,r,i)=>GS(t.expression,US(n,r,i),t=>`${e.G}${qS(t,n)}`),Ee=e=>{let t=Object.fromEntries(he().map(t=>[n.variables[t],e[t]]));return fe===void 0?t:nn(t,()=>we(fe.expression,e))};return{properties:u,spec:l,toRecord:Ee,evaluateAlias:(t,r,i,a)=>{try{bS(`alias`,t,n);let e=W(hS(t),US(n,r,i)),a=VS(e);return a===void 0?Ee(r):an(a,t)}catch(t){if(!(t instanceof e._||t instanceof e.b))throw t;return{...Ee(r),_ALIASEvalError:at(t.message,a)}}},isSymmetric:S!==void 0,isConstrained:te.length>0||v.length>0,getTlcOrder:he,getStoredFingerprints:(e,t)=>fe!==void 0||D?BigInt64Array.from(e,_e):La(t,he()),getFingerprintState:e=>{if(D)return[String(_e(e))];let t=S===void 0?e:pS(e,S,he());return fe===void 0?t:[ge(fe.expression,t)]},findViolatedInvariant:(e,t)=>{if(ce(re,e))return;let n=h.find(n=>ye(n,e,t));return n&&ve.add(e),n},getViolatedInvariants:e=>{let t=g.filter(t=>h.some(n=>n.predicate===t.predicate&&ye(n,e,void 0)));return t.length>0&&ve.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>GS(n,US(t,e,void 0,r));te.every(e=>r(e.predicate,e.scope))&&n();let i=g.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=u.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(te.every(e=>GS(e.predicate,US(n,t,void 0,e.scope)))&&v.every(r=>GS(r.expression,US(n,e,t,r.scope))))||r())||g.every(e=>GS(e.predicate,US(n,t,void 0,e.scope))))&&C.every(r=>GS(r.box,US(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>x(ie,e)??te.every(r=>FS(r,e,t)||JS(r,US(n,e,void 0))),findFailedInitialPredicate:e=>ce(ae,e)?void 0:u.initialPredicates.find(t=>!GS(t.expression,US(n,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>ce(oe,e,t)?void 0:C.find(r=>{try{return!GS(r.action,US(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${H(r.box)}`)&&!WS(r.unchanged,US(n,e,t,r.scope),`a subscript`)}catch(e){throw ut(rC(e),Ge.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>x(b,e,t)??v.every(n=>Te(n,e,t)),getExcludingConstraints:(t,r)=>[...te.filter(e=>!JS(e,US(n,r,void 0))),...v.filter(e=>!Te(e,t,r))].map(t=>{let r=AS(t.name,n);return r?e.X(r):t.name}),trackStatePossible:T.length===0?YS:e=>XS(T,pe,US(n,e,void 0)),trackActionPossible:E.length===0?YS:(e,t)=>XS(E,pe,US(n,e,t)),findUnwitnessedPossible:be,getReward:(r,i,a)=>{if(t.rlReward===void 0)return a;let o=hS(t.rlReward),s=W(o,US(n,r,i));if(typeof s!=`number`)throw new e.b(KS(`integer`,o,n));return s},findPostconditionViolation:(r=!1)=>{let i=s(`postcondition`),a=t.postconditions.map(e=>{let t=Oh(e,n);return t?t.kind===`Operator`&&t.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!vS(t)&&ng(t,n)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(a!==void 0){if(r)return;throw e.it(new e.b(a),e.tt.configParseError)}let o=(t,r)=>{let i=ZS(e=>GS(hS(r),e),n);if(!i)return;let a=Oh(r,n)?.body,o=AS(r,n),s=o?` at ${a?.kind===`Number`?oh(a):e.X(o)}`:``;return i.message===void 0?{name:t,code:Ge.postconditionFalse,message:`Postcondition ${t}${s} is false.`}:{name:t,code:Ge.postconditionFailed,message:`Evaluating postcondition ${t}${s} failed.\n${i.message}`}};for(let e of i){let t=o(e.name,e.key);if(t)return t}let c=be();if(c)return c;for(let e of t.postconditions){let t=o(e,e);if(t)return t}}}},rC=t=>t instanceof e.O?e.it(t,t.exitCode):t,iC=(e,t)=>e*((t-e)/2**64),aC=e=>e.includes(`.`)?e:`${e}.0`,oC=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return aC(String(e));let[n,r]=e.toExponential().split(`e`);return`${aC(n)}E${r.replace(`+`,``)}`},sC=e=>e!==void 0&&e>=`0`&&e<=`9`,cC=e=>{if(e===0)return`0.0`;let t=oC(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;sC(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;sC(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;sC(t[n])&&r<2;)i+=t[n++],r++;for(sC(t[n])&&Number(t[n])>=5&&(i=lC(i));sC(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},lC=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${lC(r)}.`:n===`9`?`${lC(r)}0`:`${r}${Number(n)+1}`},uC=e=>{let t=0;for(;10n**BigInt(t+1)<e*10n;)t++;let n=10n**BigInt(t+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t+1}`)},dC=(e,t,n)=>{if(iC(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a=1/0,o=9223372036854775807n;for(let e=1;e<r.length;e++){let t=i[2*e+1],n=i[2*e-1];if(t<0!=n<0)continue;let s=t-n;if(s<=1048576){let t=s*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a=Math.min(a,t)}else{let t=r[e]-r[e-1];t<o&&(o=t)}}if(a===1/0)return o;let s=BigInt(a);return s<o?s:o},fC=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a=0,o=n.find(t=>(a+=e[t],a>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},pC=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},mC=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Ki(e[t]),16777619),r=Math.imul(r^Qi(e[t]),1540483477);t[0]=pC(n)||1,t[1]=pC(r)},hC=()=>{let e=/* @__PURE__ */ new Int32Array(8192),t=0,n=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},r=()=>{let t=e,r=new Int32Array(t.length*2);for(let e=0;e<t.length;e+=2){if(t[e]===0)continue;let i=n(r,t[e],t[e+1]);r[i*2]=t[e],r[i*2+1]=t[e+1]}e=r};return{insert:(i,a)=>{t*4>=e.length&&r();let o=n(e,i,a);return e[o*2]!==i&&(e[o*2]=i,e[o*2+1]=a,t++,!0)}}},gC=(e,t)=>{let n=e.length-1;for(let r=Number(t>>32n)&n;;r=r+1&n){let n=Atomics.load(e,r);if(n===t)return!1;if(n!==0n)continue;let i=Atomics.compareExchange(e,r,0n,t);if(i===0n)return!0;if(i===t)return!1}},_C=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),vC=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return gC(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},yC=e=>Atomics.load(e.used,0)*2>=e.slots.length,bC=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&gC(t,n);return{slots:t,used:e.used}},xC=[void 0,`lambda`,`tuple`,`record`],SC=()=>{let e=/* @__PURE__ */ new Int32Array(1024),t=0,n=0,r=[],i=/* @__PURE__ */ new Map,a=n=>{if(t===e.length){let t=new Int32Array(e.length*2);t.set(e),e=t}e[t++]=n},o=e=>{let t=i.get(e);if(t!==void 0)return a(t);i.set(e,r.length),a(r.length),r.push(e)},s=e=>{if(typeof e==`boolean`)return a(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(a(2),a(e),!0);if(typeof e==`string`)return a(3),o(e),!0;if(e.kind===`ModelValue`)return a(4),o(e.name),!0;if(e.kind===`Set`)return a(5),a(e.elements.length),e.elements.every(s);if(e.kind===`Function`){let t=Ni(e.domain);return t?(a(7),a(xC.indexOf(En(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(xC.indexOf(En(e))),a(e.domain.length),e.domain.every(s)&&e.range.every(s))}return!1};return{encode:e=>{let r=t;return e.every(s)?(n++,!0):(t=r,!1)},finish:()=>({words:e.slice(0,t),strings:r,count:n})}},CC=e=>t=>{let n=t.words,r=0,i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r++];if(e===3)return t.strings[n[r++]];if(e===4)return yn(t.strings[n[r++]]);if(e===5)return xn(i(n[r++]));let a=xC[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=Mr({kind:`Interval`,low:e,high:e+t-1});return Tn(Cn(o,i(t)),a)}let o=n[r++],s=i(o);return Tn(Cn(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return Qm}}),Object.defineProperty(exports,"$t",{enumerable:!0,get:function(){return ze}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return wx}}),Object.defineProperty(exports,"At",{enumerable:!0,get:function(){return Gi}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return wy}}),Object.defineProperty(exports,"Bt",{enumerable:!0,get:function(){return Ke}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return $x}}),Object.defineProperty(exports,"Ct",{enumerable:!0,get:function(){return zn}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return tS}}),Object.defineProperty(exports,"Dt",{enumerable:!0,get:function(){return L}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Zx}}),Object.defineProperty(exports,"Et",{enumerable:!0,get:function(){return ha}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return fx}}),Object.defineProperty(exports,"Ft",{enumerable:!0,get:function(){return In}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return Fg}}),Object.defineProperty(exports,"Gt",{enumerable:!0,get:function(){return st}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return ky}}),Object.defineProperty(exports,"Ht",{enumerable:!0,get:function(){return it}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return Hb}}),Object.defineProperty(exports,"It",{enumerable:!0,get:function(){return Nn}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return Og}}),Object.defineProperty(exports,"Jt",{enumerable:!0,get:function(){return gt}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return H}}),Object.defineProperty(exports,"Kt",{enumerable:!0,get:function(){return tt}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return lx}}),Object.defineProperty(exports,"Lt",{enumerable:!0,get:function(){return Yt}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return Cx}}),Object.defineProperty(exports,"Mt",{enumerable:!0,get:function(){return wt}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return Lb}}),Object.defineProperty(exports,"Nt",{enumerable:!0,get:function(){return Zt}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return kx}}),Object.defineProperty(exports,"Ot",{enumerable:!0,get:function(){return Xt}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return Fb}}),Object.defineProperty(exports,"Pt",{enumerable:!0,get:function(){return Ki}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return Ym}}),Object.defineProperty(exports,"Qt",{enumerable:!0,get:function(){return Be}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return kb}}),Object.defineProperty(exports,"Rt",{enumerable:!0,get:function(){return en}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return rC}}),Object.defineProperty(exports,"St",{enumerable:!0,get:function(){return Li}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Xx}}),Object.defineProperty(exports,"Tt",{enumerable:!0,get:function(){return Fr}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return Oy}}),Object.defineProperty(exports,"Ut",{enumerable:!0,get:function(){return at}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return Ey}}),Object.defineProperty(exports,"Vt",{enumerable:!0,get:function(){return Ye}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return Gv}}),Object.defineProperty(exports,"Wt",{enumerable:!0,get:function(){return ct}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return Jm}}),Object.defineProperty(exports,"Xt",{enumerable:!0,get:function(){return dt}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return Dg}}),Object.defineProperty(exports,"Yt",{enumerable:!0,get:function(){return nt}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return Xm}}),Object.defineProperty(exports,"Zt",{enumerable:!0,get:function(){return _t}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return HS}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return Ba}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return bC}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return Df}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return SS}}),Object.defineProperty(exports,"bt",{enumerable:!0,get:function(){return Ia}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return mC}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return yf}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return dC}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return bd}}),Object.defineProperty(exports,"en",{enumerable:!0,get:function(){return De}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return Zm}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return iC}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return wd}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return QS}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return so}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return nC}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return eo}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return _C}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return Jp}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return Tx}}),Object.defineProperty(exports,"jt",{enumerable:!0,get:function(){return bn}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return px}}),Object.defineProperty(exports,"kt",{enumerable:!0,get:function(){return Wi}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return cC}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return qd}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return tC}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return Ua}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return SC}}),Object.defineProperty(exports,"nn",{enumerable:!0,get:function(){return ne}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return Kp}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return vC}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return Ef}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return fC}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return ws}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return Oh}}),Object.defineProperty(exports,"qt",{enumerable:!0,get:function(){return bt}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return hC}}),Object.defineProperty(exports,"rn",{enumerable:!0,get:function(){return ae}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return qp}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return yC}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return Of}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return CC}}),Object.defineProperty(exports,"tn",{enumerable:!0,get:function(){return ye}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return Yp}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return uC}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return Xd}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return $S}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return Ga}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return eS}}),Object.defineProperty(exports,"wt",{enumerable:!0,get:function(){return yn}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return CS}}),Object.defineProperty(exports,"xt",{enumerable:!0,get:function(){return Ma}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return eC}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return bo}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return pb}}),Object.defineProperty(exports,"zt",{enumerable:!0,get:function(){return Ge}});
|