tla-ts 0.0.8-dev.d9bffda → 0.0.9-dev.0493be549
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 +30 -0
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +28 -28
- package/dist/deciders.js +43 -43
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +80 -10
- package/dist/index.d.ts +80 -10
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +116 -36
- package/dist/prove.js +116 -36
- package/dist/run.cjs +143 -31
- package/dist/run.js +143 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +128 -103
- package/dist/transfer.js +128 -103
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +3 -1
- package/src/ast.ts +7 -21
- package/src/bags.ts +99 -99
- package/src/builtins.ts +44 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check.ts +605 -311
- package/src/cli/options.ts +12 -6
- package/src/cli/run.ts +2 -2
- package/src/cli/runtime-invariants.ts +135 -0
- package/src/cli/shared.ts +20 -9
- package/src/cli/tlapm.ts +0 -12
- package/src/cli/tlc-arguments.ts +646 -0
- package/src/cli/tlc-usage.ts +362 -0
- package/src/cli/tlc.ts +545 -218
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +4 -16
- package/src/cli.ts +0 -1
- package/src/codegen.ts +191 -64
- package/src/config.ts +140 -109
- package/src/coverage.ts +837 -0
- package/src/dependencies.ts +6 -40
- package/src/dfid.ts +618 -0
- package/src/environment.ts +240 -118
- package/src/errors.ts +70 -55
- package/src/evaluate.ts +632 -298
- package/src/exit-codes.ts +37 -3
- package/src/fingerprints.ts +10 -10
- package/src/index.ts +3 -0
- package/src/instances.ts +79 -11
- package/src/java-overrides.ts +2 -12
- package/src/json-reader.ts +456 -0
- package/src/json.ts +262 -139
- package/src/levels.ts +2 -3
- package/src/lexer.ts +17 -26
- package/src/liveness-checker.ts +10 -18
- package/src/liveness.ts +121 -49
- 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 +31 -38
- package/src/parallel.ts +41 -17
- package/src/parser.ts +436 -90
- package/src/pcal/ast.ts +7 -28
- package/src/pcal/parse.ts +11 -39
- package/src/pcal/tokenize.ts +4 -20
- package/src/pcal/translate.ts +10 -42
- package/src/pcal/validate.ts +3 -21
- package/src/pretty-print.ts +1 -2
- package/src/prover/decide-pool.ts +5 -10
- package/src/prover/deciders.ts +0 -4
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +0 -6
- package/src/prover/isabelle/encode.ts +11 -23
- package/src/prover/isabelle/isar/inner-syntax.ts +108 -114
- package/src/prover/isabelle/isar/method.ts +25 -38
- package/src/prover/isabelle/isar/proof.ts +1 -10
- package/src/prover/isabelle/isar/statement.ts +1 -6
- package/src/prover/isabelle/isar/theory.ts +15 -26
- package/src/prover/isabelle/isar/type-check.ts +11 -25
- package/src/prover/isabelle/provers/blast/blast.ts +10 -41
- package/src/prover/isabelle/provers/blast/branch.ts +1 -32
- package/src/prover/isabelle/provers/blast/prove.ts +1 -35
- package/src/prover/isabelle/provers/blast/rules.ts +6 -44
- package/src/prover/isabelle/provers/blast/state.ts +2 -28
- package/src/prover/isabelle/provers/blast/term.ts +9 -36
- package/src/prover/isabelle/provers/clasimp.ts +1 -13
- package/src/prover/isabelle/provers/classical.ts +14 -42
- package/src/prover/isabelle/provers/hypsubst.ts +11 -25
- package/src/prover/isabelle/pure/bicompose.ts +16 -13
- package/src/prover/isabelle/pure/consts.ts +1 -7
- package/src/prover/isabelle/pure/conv.ts +1 -9
- package/src/prover/isabelle/pure/drule.ts +24 -40
- package/src/prover/isabelle/pure/envir.ts +3 -52
- package/src/prover/isabelle/pure/goal.ts +1 -7
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +1 -14
- package/src/prover/isabelle/pure/name.ts +2 -9
- package/src/prover/isabelle/pure/net.ts +3 -59
- package/src/prover/isabelle/pure/object-logic.ts +3 -10
- package/src/prover/isabelle/pure/pattern.ts +2 -19
- package/src/prover/isabelle/pure/raw-simplifier.ts +13 -49
- package/src/prover/isabelle/pure/rewriter.ts +26 -58
- package/src/prover/isabelle/pure/search.ts +3 -10
- package/src/prover/isabelle/pure/seq.ts +1 -10
- package/src/prover/isabelle/pure/simplifier.ts +4 -12
- package/src/prover/isabelle/pure/table.ts +1 -31
- package/src/prover/isabelle/pure/tactic.ts +12 -22
- package/src/prover/isabelle/pure/tactical.ts +6 -12
- package/src/prover/isabelle/pure/term-ord.ts +2 -6
- package/src/prover/isabelle/pure/term.ts +2 -43
- package/src/prover/isabelle/pure/thm.ts +13 -36
- package/src/prover/isabelle/pure/type.ts +2 -15
- package/src/prover/isabelle/pure/unify.ts +20 -30
- package/src/prover/isabelle/pure/variable.ts +3 -7
- package/src/prover/isabelle/tla/classical-setup.ts +9 -19
- package/src/prover/isabelle/tla/context.ts +8 -16
- package/src/prover/isabelle/tla/logic.ts +4 -11
- package/src/prover/isabelle/tla/simpdata.ts +46 -34
- package/src/prover/isabelle/tools/intuitionistic.ts +1 -10
- package/src/prover/ocaml.ts +0 -6
- package/src/prover/prep/action.ts +4 -36
- package/src/prover/prep/enabled-axioms.ts +12 -19
- package/src/prover/prep/fingerprint.ts +0 -16
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +9 -36
- package/src/prover/prep/normalize.ts +4 -28
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +0 -36
- package/src/prover/ptl/decide.ts +7 -12
- package/src/prover/ptl/encode.ts +14 -36
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +12 -26
- package/src/prover/smt/axioms.ts +0 -7
- package/src/prover/smt/context.ts +19 -26
- package/src/prover/smt/data.ts +51 -54
- package/src/prover/smt/encode.ts +14 -35
- package/src/prover/smt/extensionality.ts +0 -10
- package/src/prover/smt/flatten.ts +3 -22
- package/src/prover/smt/format.ts +5 -10
- package/src/prover/smt/instances.ts +0 -10
- package/src/prover/smt/rewrite.ts +66 -101
- package/src/prover/smt/solver/act-cache.ts +0 -15
- package/src/prover/smt/solver/arith-rewriter.ts +3 -48
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +1 -43
- package/src/prover/smt/solver/ast-lt.ts +1 -11
- package/src/prover/smt/solver/ast-util.ts +1 -6
- package/src/prover/smt/solver/ast.ts +1 -143
- package/src/prover/smt/solver/auf-solver.ts +6 -39
- package/src/prover/smt/solver/case-split-queue.ts +1 -9
- package/src/prover/smt/solver/cg-table.ts +1 -18
- package/src/prover/smt/solver/clause.ts +1 -27
- package/src/prover/smt/solver/conflict-resolution.ts +0 -9
- package/src/prover/smt/solver/context.ts +4 -61
- package/src/prover/smt/solver/ctx-simplify.ts +14 -41
- package/src/prover/smt/solver/der.ts +2 -21
- package/src/prover/smt/solver/dyn-ack.ts +1 -11
- package/src/prover/smt/solver/e-matching.ts +3 -34
- package/src/prover/smt/solver/enode.ts +1 -21
- package/src/prover/smt/solver/expr-ref.ts +1 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +0 -5
- package/src/prover/smt/solver/fingerprints.ts +1 -12
- package/src/prover/smt/solver/flat-literals.ts +1 -9
- package/src/prover/smt/solver/goal.ts +2 -14
- package/src/prover/smt/solver/hash.ts +0 -8
- package/src/prover/smt/solver/hashtable.ts +1 -12
- package/src/prover/smt/solver/internalizer.ts +6 -98
- package/src/prover/smt/solver/lbool.ts +1 -2
- package/src/prover/smt/solver/literal.ts +0 -3
- package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
- package/src/prover/smt/solver/lp/constraints.ts +2 -8
- package/src/prover/smt/solver/lp/containers.ts +12 -30
- package/src/prover/smt/solver/lp/core-solver.ts +10 -31
- package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
- package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
- package/src/prover/smt/solver/lp/dependency.ts +1 -4
- package/src/prover/smt/solver/lp/dioph-eq.ts +12 -98
- package/src/prover/smt/solver/lp/explanation.ts +1 -6
- package/src/prover/smt/solver/lp/gomory.ts +9 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
- package/src/prover/smt/solver/lp/hnf.ts +11 -26
- package/src/prover/smt/solver/lp/int-cube.ts +15 -36
- package/src/prover/smt/solver/lp/int-solver.ts +4 -34
- package/src/prover/smt/solver/lp/lar-solver.ts +32 -81
- package/src/prover/smt/solver/lp/lar-term.ts +1 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +20 -45
- package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
- package/src/prover/smt/solver/lp/nex.ts +1 -6
- package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
- package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
- package/src/prover/smt/solver/lp/nla-core.ts +35 -130
- package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
- package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +15 -69
- package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
- package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
- package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
- package/src/prover/smt/solver/lp/nla-order.ts +2 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
- package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
- package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
- package/src/prover/smt/solver/lp/nla-types.ts +1 -11
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
- package/src/prover/smt/solver/lp/nra-solver.ts +5 -52
- package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- package/src/prover/smt/solver/lp/random-updater.ts +1 -8
- package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
- package/src/prover/smt/solver/lp/union-find.ts +1 -6
- package/src/prover/smt/solver/mam-compiler.ts +14 -56
- package/src/prover/smt/solver/mam-interpreter.ts +1 -21
- package/src/prover/smt/solver/maximize-ac-sharing.ts +2 -17
- package/src/prover/smt/solver/model-checker.ts +2 -36
- package/src/prover/smt/solver/model-evaluator.ts +3 -29
- package/src/prover/smt/solver/model-finder.ts +3 -15
- package/src/prover/smt/solver/model-generator.ts +1 -12
- package/src/prover/smt/solver/model-macro-solver.ts +12 -69
- package/src/prover/smt/solver/nlsat/algebraic.ts +55 -151
- package/src/prover/smt/solver/nlsat/atoms.ts +5 -19
- package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
- package/src/prover/smt/solver/nlsat/explain.ts +3 -47
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -50
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -129
- package/src/prover/smt/solver/nlsat/mpbq.ts +3 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +17 -156
- package/src/prover/smt/solver/nlsat/solver.ts +7 -67
- package/src/prover/smt/solver/nlsat/types.ts +1 -8
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -44
- package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
- package/src/prover/smt/solver/nnf.ts +3 -38
- package/src/prover/smt/solver/pattern-inference.ts +2 -15
- package/src/prover/smt/solver/poly-rewriter.ts +3 -23
- package/src/prover/smt/solver/propagate-values.ts +1 -10
- package/src/prover/smt/solver/proto-model.ts +3 -48
- package/src/prover/smt/solver/pull-quant.ts +1 -12
- package/src/prover/smt/solver/qe-lite-der.ts +1 -29
- package/src/prover/smt/solver/qe-lite-fm.ts +2 -25
- package/src/prover/smt/solver/qe-lite.ts +3 -33
- package/src/prover/smt/solver/qi-queue.ts +1 -16
- package/src/prover/smt/solver/quant-tactics.ts +5 -22
- package/src/prover/smt/solver/quantifier-analyzer.ts +17 -37
- package/src/prover/smt/solver/quantifier-manager.ts +1 -8
- package/src/prover/smt/solver/random-gen.ts +1 -2
- package/src/prover/smt/solver/rational.ts +1 -8
- package/src/prover/smt/solver/ref-vector.ts +1 -6
- package/src/prover/smt/solver/relevancy.ts +2 -15
- package/src/prover/smt/solver/rewriter-tpl.ts +3 -147
- package/src/prover/smt/solver/rewriter.ts +3 -85
- package/src/prover/smt/solver/rlimit.ts +2 -20
- package/src/prover/smt/solver/smtlib-parser.ts +2 -37
- package/src/prover/smt/solver/solver.ts +23 -34
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/sticky-generations.ts +0 -5
- package/src/prover/smt/solver/theory-lra-axioms.ts +3 -24
- package/src/prover/smt/solver/theory-lra-bounds.ts +0 -5
- package/src/prover/smt/solver/theory-lra-final-check.ts +4 -22
- package/src/prover/smt/solver/theory-lra-internalize.ts +1 -27
- package/src/prover/smt/solver/theory-lra-model.ts +4 -19
- package/src/prover/smt/solver/theory-lra-propagate.ts +1 -15
- package/src/prover/smt/solver/theory-lra-state.ts +3 -8
- package/src/prover/smt/solver/theory-lra.ts +1 -8
- package/src/prover/smt/solver/var-subst.ts +2 -26
- package/src/prover/smt/table.ts +0 -8
- package/src/prover/tlapm/cache.ts +20 -25
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +12 -17
- package/src/prover/verdict.ts +0 -2
- package/src/prover/zenon/check/check.ts +0 -9
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +0 -5
- package/src/prover/zenon/check/relations.ts +0 -13
- package/src/prover/zenon/check/rewrites.ts +0 -6
- package/src/prover/zenon/check/sets.ts +0 -3
- package/src/prover/zenon/check/terms.ts +0 -17
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +0 -12
- package/src/prover/zenon/encode.ts +1 -8
- package/src/prover/zenon/eqrel.ts +0 -13
- package/src/prover/zenon/equality-rules.ts +0 -4
- package/src/prover/zenon/expr.ts +1 -26
- package/src/prover/zenon/index-table.ts +17 -38
- package/src/prover/zenon/isar-case.ts +9 -19
- package/src/prover/zenon/isar.ts +1 -29
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +0 -9
- package/src/prover/zenon/mltoll.ts +54 -76
- package/src/prover/zenon/node.ts +1 -11
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +2 -7
- package/src/prover/zenon/phrase.ts +1 -11
- package/src/prover/zenon/proof.ts +0 -9
- package/src/prover/zenon/propositional-rules.ts +0 -5
- package/src/prover/zenon/rules.ts +2 -6
- package/src/prover/zenon/search.ts +1 -17
- package/src/prover/zenon/tla/functions.ts +57 -29
- package/src/prover/zenon/tla/llproof.ts +63 -70
- package/src/prover/zenon/tla/records.ts +56 -27
- package/src/prover/zenon/tla/rewrites.ts +12 -19
- package/src/prover/zenon/tla/sets.ts +68 -39
- package/src/prover/zenon/tla/terms.ts +0 -6
- package/src/prover/zenon/tla/tla.ts +59 -58
- package/src/randomization.ts +84 -35
- package/src/resolve.ts +18 -60
- package/src/runtime.ts +11 -4
- package/src/sany/builtins.ts +3 -4
- package/src/sany/generator.ts +128 -176
- package/src/sany/levels.ts +6 -30
- package/src/sany/lexer.ts +7 -23
- package/src/sany/linter.ts +31 -29
- 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 +533 -174
- package/src/simulate.ts +694 -0
- package/src/spec-description.ts +166 -48
- package/src/standard-definitions.ts +2 -3
- package/src/standard-modules.ts +264 -68
- package/src/state-graph.ts +51 -18
- package/src/subexpressions.ts +31 -5
- package/src/substitution-levels.ts +2 -3
- package/src/successors.ts +267 -77
- package/src/symmetry.ts +31 -8
- package/src/tableau.ts +27 -24
- package/src/tlc/fingerprint.ts +183 -61
- package/src/tlc/jar-data.ts +113 -6
- package/src/tlc/messages.ts +122 -37
- package/src/tlc/order.ts +33 -38
- package/src/tlc/random.ts +16 -16
- package/src/tlc/replay.ts +563 -211
- package/src/tlc/summary.ts +2 -4
- package/src/tlc/tlc-operators.ts +81 -36
- package/src/tlc/tlcext-operators.ts +138 -117
- package/src/tlc/trace-spec.ts +273 -0
- package/src/tlc/value-stream.ts +143 -0
- package/src/tlc/version.ts +2 -4
- package/src/transfer.ts +22 -25
- package/src/typescript/actions.ts +481 -0
- package/src/typescript/collections.ts +600 -0
- package/src/typescript/compile.ts +65 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +152 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +163 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +165 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +832 -255
- package/src/worker.ts +7 -8
package/dist/transfer.js
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
|
-
import{
|
|
10
|
-
`,t:` `,r:`\r`,f:`\f`},
|
|
11
|
-
`),
|
|
12
|
-
|
|
9
|
+
import{$ as e,B as t,C as n,F as r,G as i,J as a,K as o,N as s,O as c,P as l,Q as u,R as d,S as f,V as p,W as m,X as h,Y as ee,Z as te,_ as g,b as _,et as ne,g as v,h as re,it as y,k as ie,q as ae,tt as b,u as oe,v as se,x as ce,y as le,z as ue}from"./worker.js";import{gzipSync as de}from"node:zlib";const x=/* @__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(`.`)),S=/* @__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`]]),C=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),w=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),fe=/* @__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`]]),pe=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),me=e=>e.startsWith(`\\`)?parseInt(e.slice(2),pe.get(e[1].toLowerCase())):Number(e),he=/-{4,} *MODULE\b/,ge=/* @__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)ge[n.charCodeAt(0)]|=e});const _e=(e,t)=>e<128&&(ge[e]&t)!==0,ve=(e,t,n)=>{let r=t;for(;_e(e.charCodeAt(r),n);)r++;return r},ye=/* @__PURE__ */ new Map;w.forEach(e=>{let t=e.charCodeAt(0),n=ye.get(t)??[];n.push(e),ye.set(t,n)});const T=(e,t)=>{let n=ye.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]}},be=(e,t)=>{if(e.charCodeAt(t)<128)return;let n=e.slice(t,t+2);if(fe.has(n))return n;let r=e[t];return fe.has(r)?r:void 0},xe=(e,t)=>{let n=e.charCodeAt(t);if(n===92&&_e(e.charCodeAt(t+1),2)){let n=e.slice(t+1,ve(e,t+1,2)),r={value:n.length};for(;r.value>0&&!S.has(n.slice(0,r.value));)r.value--;let i=S.get(n.slice(0,r.value));return{text:i??`\\`,length:i===void 0?1:r.value+1}}let r=be(e,t);if(r!==void 0)return{text:fe.get(r)??``,length:r.length};let i=T(e,t);return i?{text:C.get(i)??i,length:i.length}:n===92?{text:`\\`,length:1}:void 0},Se=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),Ce=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>fe.has(e)||Se.has(e));return n===void 0?void 0:{text:n,length:n.length}},E=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},we=(e,t,n)=>{let r=e[t+1]===`+`||e[t+1]===`*`,i=r?t+2:ve(e,t+1,1);if(i===t+1||e[i]!==`>`)return 0;let a=!r||!n,o=a?ve(e,i+1,7):i+1,s=a&&o===i+1&&(e[o]===`*`||e[o]===`-`);return E(e,s?o+1:o,e=>e===`.`)-t},Te=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,Ee={n:`
|
|
10
|
+
`,t:` `,r:`\r`,f:`\f`},De=(e,t)=>t===9?e+8-e%8:e+1,Oe=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),ke=(e,t)=>{if(e.charCodeAt(t)!==92)return 0;let n=Oe.get(e.charAt(t+1).toLowerCase());if(n===void 0)return 0;let r=ve(e,t+2,n);return r===t+2?0:r-t},Ae=(e,t=!1)=>{let n=he.exec(e);if(!n)throw new r(`Expected a module header such as ---- MODULE Name ----`);let i=[],a=/* @__PURE__ */ new Map,o=e.slice(0,n.index).split(`
|
|
11
|
+
`),s={index:n.index,line:o.length,lineStart:n.index-o[o.length-1].length,moduleDepth:0},c={lineStart:-1,position:0,width:0},l=()=>{for((c.lineStart!==s.lineStart||c.position>s.index)&&(c.lineStart=s.lineStart,c.position=s.lineStart,c.width=0);c.position<s.index;c.position++)c.width=De(c.width,e.charCodeAt(c.position));return De(c.width,e.charCodeAt(s.index))},u=(e,t,n,r)=>{let a=l();i.push({kind:e,text:t,spelling:r,line:s.line,column:a,endColumn:a+n-1}),s.index+=n},d=t=>{for(let n=0;n<t;n++)e.charCodeAt(s.index)===10&&(s.line++,s.lineStart=s.index+1),s.index++},f=t=>new r(`${t} at line ${s.line}, column ${l()}`,void 0,{reason:t,line:s.line,column:l(),isEnd:s.index>=e.length});for(;s.index<e.length;){let n=e.charCodeAt(s.index);if(n===10||n===32||n===9||n===13){d(1);continue}if(n===92&&e.charCodeAt(s.index+1)===42){d(E(e,s.index,e=>e!==`
|
|
12
|
+
`&&e!==`\r`)-s.index);continue}if(n===40&&e.charCodeAt(s.index+1)===42){let t={value:0};do{if(s.index>=e.length)throw f(`Unterminated comment`);e.startsWith(`(*`,s.index)?(t.value++,d(2)):e.startsWith(`*)`,s.index)?(t.value--,d(2)):d(1)}while(t.value>0);continue}if(n===45&&e.startsWith(`----`,s.index)){let t=E(e,s.index,e=>e===`-`)-s.index,n=E(e,s.index+t,e=>e===` `);e.startsWith(`MODULE`,n)&&s.moduleDepth++,u(`Separator`,`----`,t);continue}if(n===61&&e.startsWith(`====`,s.index)){if(u(`ModuleEnd`,`====`,E(e,s.index,e=>e===`=`)-s.index),s.moduleDepth--,s.moduleDepth<=0)break;continue}if(n===34){let t=s.line,n=l(),r=[];for(d(1);e.charCodeAt(s.index)!==34;){let t=e.charCodeAt(s.index);if(s.index>=e.length||t===10||t===13)throw f(`Unterminated string`);if(t===92){let t=e[s.index+1];if(t===void 0||!`ntrf\\"`.includes(t))throw f(`Invalid escape in string`);r.push(Ee[t]??t),d(2)}else r.push(e[s.index]),d(1)}d(1),i.push({kind:`String`,text:r.join(``),line:t,column:n,endColumn:l()-1});continue}let r=ke(e,s.index);if(r>0){u(`Number`,e.slice(s.index,s.index+r),r);continue}if(_e(n,7)){let t=ve(e,s.index,7),r=e.slice(s.index,t),i=ve(e,s.index,1);if(i===t){let n=e.charCodeAt(t)===46?ve(e,t+1,1):t,i=n>t+1,a=i?e.slice(s.index,n):r;u(i?`Decimal`:`Number`,a,a.length);continue}if(!/[A-Za-z]/.test(r)){let t=n===95?`_`:e.slice(s.index,i);u(t===`_`?`Operator`:`Number`,t,t.length);continue}if(r.startsWith(`WF_`)||r.startsWith(`SF_`)){u(`Keyword`,r.slice(0,3),3);continue}let o=a.get(r)??r;a.set(o,o),u(x.has(r)?`Keyword`:`Identifier`,o,r.length);continue}let o=e[s.index];if(n>=128&&Se.has(o)){u(`Identifier`,a.get(o)??o,1),a.set(o,o);continue}if(n===60){let n=we(e,s.index,t);if(n>0){u(`Step`,e.slice(s.index,s.index+n),n);continue}}let c=xe(e,s.index);if(c){let t=e.slice(s.index,s.index+c.length);u(`Operator`,c.text,c.length,t===c.text?void 0:t)}else throw f(`Unexpected character ${JSON.stringify(o)}`)}let p=l();return i.push({kind:`End`,text:``,line:s.line,column:p,endColumn:p}),i},je=[[`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`]],Me=je.map(e=>e[0]),Ne=new Map(Me.map((e,t)=>[e,t]).reverse()),D=e=>{let t=Ne.get(e);if(t===void 0)throw new le(`Unknown SANY token kind ${e}`);return t},Pe=new Map(je.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),Fe=Math.max(...[...Pe.keys()].map(e=>e.length)),Ie=Array.from({length:Fe},(e,t)=>Fe-t),Le=/----+ *MODULE/y,Re=[/_\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],ze=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`)),Be=ze(String.raw`\.\/\\`),Ve=ze(String.raw`\.\\\/`),O=String.raw`<(?:[0-9]+|\+|\*)>`,He=[[`_BM0`,[Le]],[`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`,Be],[`BOR`,Ve],[`IDENTIFIER`,Re],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${O}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(O,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${O}(?:\*\.*|-\.*|\.+)`,`y`)]]],Ue=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[Le]]],We=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[Le]],[`BAND`,Be],[`BOR`,Ve],[`IDENTIFIER`,Re]],Ge=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),Ke=(e,t,n)=>e.map(([e,r])=>({kind:D(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}),qe=(e,t)=>{let n=Ie.find(n=>Pe.has(e.slice(t,t+n))),r=Ke(He,e,t);if(n===void 0)return r;let i={kind:Pe.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},Je=e=>e+8-e%8,Ye=e=>{let t=[],n=[],r={line:1,column:0,isAfterCr:!1,isAfterLf:!1};for(let i of e)for(let e=0;e<i.length;e++)r.column++,r.isAfterLf?(r.isAfterLf=!1,r.line++,r.column=1):r.isAfterCr&&(r.isAfterCr=!1,i===`
|
|
13
13
|
`?r.isAfterLf=!0:(r.line++,r.column=1)),i===`\r`?r.isAfterCr=!0:i===`
|
|
14
|
-
`?r.isAfterLf=!0:i===` `&&(r.column=
|
|
15
|
-
`||e[a]===`\r`?
|
|
16
|
-
\r`.includes(e[t]))n.offset++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=o();if(e!==void 0)return e}else{let i=
|
|
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
|
-
=============================================================================`,Ze=`----------------------------- 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
|
-
=============================================================================`,Qe=`----------------------------- 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
|
-
=============================================================================`,$e=/* @__PURE__ */ new Map([[`Reals`,Xe],[`RealTime`,Ze],[`Toolbox`,Qe]]),et={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:` `}},tt=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},nt=e=>e!==void 0&&/^\p{Nd}$/u.test(e),rt=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),it=e=>{let t=t=>{let n=he(e,t,tt);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=he(e,t,nt);if(e.startsWith(`..`,n)&&nt(e[n+2]))return{kind:`Constant`,first:t,last:he(e,n+2,nt)-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=nt(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:he(e,t+1,nt)-1,children:[]};if(rt(n))return{kind:`Constant`,first:t,last:he(e,t,rt)-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)},at=e=>{let t=e.length===0?void 0:it(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=et[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),ee=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||ee===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${ee}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},ot=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,k=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,st=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),A=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),j=e=>typeof e==`object`&&e.kind===`ModelValue`,ct=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),lt=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:k(e)?`set`:`function`,ut=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,dt={isUsed:!1},ft=(e,t)=>(dt.isUsed=!0,e.writtenKeys=t,e),pt=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[_r(e.domain,t)]]),mt=(e,t,n)=>ft(Yn(e,t),n),ht=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(ht);e.writtenKeys=void 0,e.range.forEach(ht)}},gt=e=>e.every(e=>typeof e==`string`),_t=(e,t)=>e.length>0&&t.length>0&>(e)!==gt(t),vt=(e,t)=>{dt.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return _t(n,r)?vn(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Ft(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:Ft(t,n);if(r!==0)return r}return 0},yt=(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=Ft(n[e],r[e]);if(t!==0)return t}return 0},bt=e=>j(e)?e.type:void 0,xt=(e,t,n)=>{let r=bt(e),i=bt(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(j(e)&&j(t)){if(r===void 0||i===void 0||r===i)return;throw new h(`Attempted to ${a} the differently-typed model values ${L(e)} and ${L(t)}`)}throw r===void 0?new h(`Attempted to ${a} the typed model value ${L(t)} and the non-model value\n${L(e)}`):new h(`Attempted to ${a}${n?``:` the`} typed model value ${L(e)} and non-model value\n${L(t)}`)},St={ranks:Object.create(null),size:0},Ct=e=>{St.ranks=Object.create(null),St.size=0,It.clear();for(let t of e)Et(t)},wt={is174:!1},Tt=e=>{wt.is174=e===`1.7.4`},Et=e=>(St.ranks[e]===void 0&&(St.ranks[e]=St.size++),e),Dt=()=>St.size,Ot=e=>St.ranks[Et(e)],kt=(e,t)=>{if(e===t)return 0;let n=St.ranks,r=n[e],i=n[t];return r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},At=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),jt=(e,t)=>(At(e)||At(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Mt=(e,t,n)=>{if(!At(e))throw new h(`Attempted to ${n} the set ${L(N(e)?P(e):e,!0)} with the value:\n${L(t,!0)}`);if(!At(t))throw new h(`Attempted to compare overridden value ${L(e,!0)} with non-overridden value:\n${L(t,!0)}`);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new h(`Attempted to compare ${L(e,!0)} with the value\n${L(t,!0)}`)},Nt={kind:`InfiniteSet`,name:`Any`},Pt=e=>{throw new h(`Attempted to compare ANY with the value\n${L(e)}`)},Ft=(e,t)=>{if(e===t)return dt.isUsed&&ht(e),e===Nt?Pt(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return vt(e,t);if(n===`Set`&&r===`Set`)return yt(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&&xt(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return xt(e,t,!1),n===`ModelValue`?-1:1;if(e===Nt||t===Nt)return Pt(e===Nt?t:e);if(k(e)&&k(t)&&jt(e,t))return Mt(e,t,`compare`);let i=k(e);if(i!==k(t))throw new h(`Attempted to compare ${lt(e)} ${L(e)} with ${lt(t)} ${L(t)}`);return i?yt(P(e),P(t)):vt(I(e),I(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return kt(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(xt(e,t,!1),j(e))return-1;if(j(t))return 1;throw new h(`Attempted to compare ${lt(e)} ${L(e)} with ${lt(t)} ${L(t)}`)},It=/* @__PURE__ */ new Map,Lt=e=>{let t=It.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Ot(e),hash:Lr(Rr(zr(e),109)),fingerprint:Jr(Yr(e)^60)};return It.set(e,n),n},Rt=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0,isFingerprinted:!1}),zt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,isFingerprinted:!1}),Bt={isPresent:!1},Vt=(e,t)=>(t===`lambda`&&(Bt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),Ht=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Ut=e=>Vt(e,`lambda`),Wt=e=>ot(e)&&e.isCached===!0,Gt={isPresent:!1},Kt=e=>(Gt.isPresent=!0,e),qt=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),Jt=e=>{Gt.isPresent&&typeof e==`object`&&ot(e)&&qt.has(e.kind)&&(e.isCached=!0)},Yt=e=>{(Bt.isPresent||Gt.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(Yt),e.range.forEach(Yt)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Yt):k(e)&&N(e)&&(Jt(e),P(e).elements.forEach(Yt))))},Xt=(e,t)=>{if(Jt(e),e===t)return dt.isUsed&&ht(e),e!==Nt||Pt(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&xt(e,t,!0),Ft(e,t)===0);if((e.kind===`Set`||e.kind===`Function`)&&(t.kind===`Set`||t.kind===`Function`)&&e.hash!==0&&t.hash!==0&&e.hash!==t.hash)return!1;if(e.kind===`Function`&&t.kind===`Function`)return vt(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return yt(e,t)===0;if(j(e)||j(t))return xt(e,t,!0),j(e)&&j(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Xt(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:Xt(e.domain,t.domain)&&Xt(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]&&Xt(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)=>Xt(e,t.factors[n]));let n=k(e)&&k(t)&&!(N(e)&&N(t));if(n&&jt(e,t))return Mt(e,t,`check equality of`)===0;if(n){if(!At(e)){let n=P(e);if(!At(t))return yt(n,P(t))===0}return ei(e)===ei(t)}return Ft(e,t)===0},Zt=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):ei(n)===ei(r);return n},Qt=Zt(!1),$t=Zt(!0),en=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},tn=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=qr(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||$t(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||$t(i[e],n))return i[e]}return n.kind===`Set`?en(n.elements,t):(en(n.domain,t),en(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}},nn=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},rn=e=>{if(!A(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:nn(t.domain)}},an=e=>{if(!A(e))return;let t=I(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},on=(e,t)=>(xt(t,e,!1),1),sn=(e,t)=>(xt(t,e,!0),!1),cn=(e,t)=>(e.type!==void 0&&xt(e,t,!1),j(t)?e.rank-t.rank:-1),ln=(e,t)=>(e.type!==void 0&&xt(e,t,!0),j(t)&&e.name===t.name),un={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`}},dn=(e,t,n)=>{let r=un[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)}`},fn=(e,t,n)=>{let r=rn(n);if(!r){if(j(n))return on(n,t);throw new h(`Attempted to compare the function ${L(t)} with the value:\n${L(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>pn(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return pn(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new h(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${L(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},pn=(e,t)=>{for(let n=0;n<e.length;n++){let r=vn(e[n],t[n]);if(r!==0)return r}return 0},mn=(e,t)=>{let n=I(e);if(e.kind===`Function`&&vr(n)!==void 0){let r=A(t)?vr(t):void 0;return r?n.range.length-r.length||pn(n.range,r):fn({...n,low:1},e,t)}if(Ht(e)===`record`){let r=an(t);if(!r){if(j(t))return on(t,e);throw new h(`Attempted to compare record:\n${L(e)}\nwith non-record\n${L(t)}`)}return n.domain.length-r.domain.length||pn(n.domain,r.domain)||pn(n.range,r.range)}return fn({...n,low:nn(n.domain)},e,t)},hn=(e,t)=>At(e)||At(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),gn=(e,t)=>{let n=ct(t)?t:P(t);return{elements:P(e).elements,otherElements:P(n).elements}},_n=(e,t)=>{if(hn(e,t))return Ft(e,t);if(!ct(e))return _n(P(e),t);if(!k(t)){if(j(t))return on(t,e);throw new h(`Attempted to compare the set ${L(e)} with the value:\n${L(t)}`)}let n=gn(e,t);return n.elements.length-n.otherElements.length||pn(n.elements,n.otherElements)},vn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return Ft(e,t);if(j(t))return on(t,e);throw new h(dn(e,t,!1))}return e.kind===`ModelValue`?cn(e,t):A(e)?mn(e,t):_n(e,t)},yn=(e,t)=>e.every((e,n)=>Cn(e,t[n])),bn=(e,t,n)=>{let r=rn(n);if(!r){if(j(n))return sn(n,t);throw new h(`Attempted to check equality of the function ${L(t)} with the value:\n${L(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&yn(e.range,r.range);let i=e.low??r.low;return i===void 0?yn(e.domain,r.domain)&&yn(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new h(`Attempted to compare an integer with non-integer:\n${L(e)}.`);return e===i+t})&&yn(e.range,r.range)},xn=(e,t)=>{let n=I(e);if(e.kind===`Function`&&vr(n)!==void 0){let r=A(t)?vr(t):void 0;return r?n.range.length===r.length&&yn(n.range,r):bn({...n,low:1},e,t)}if(Ht(e)===`record`){let r=an(t);if(!r){if(j(t))return sn(t,e);throw new h(`Attempted to check equality of record:\n${L(e)}\nwith non-record\n${L(t)}`)}return n.domain.length===r.domain.length&&yn(n.domain,r.domain)&&yn(n.range,r.range)}return bn({...n,low:nn(n.domain)},e,t)},Sn=(e,t)=>{if(hn(e,t))return Xt(e,t);if(!ct(e))return Sn(P(e),t);if(!k(t)){if(j(t))return sn(t,e);throw new h(`Attempted to check equality of the set ${L(e)} with the value:\n${L(t)}`)}let n=gn(e,t);return n.elements.length===n.otherElements.length&&yn(n.elements,n.otherElements)},Cn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(j(t))return sn(t,e);throw new h(dn(e,t,!0))}return e.kind===`ModelValue`?ln(e,t):A(e)?xn(e,t):Sn(e,t)},wn=e=>{let t=[];for(let n of e){let e=En(n,t);e.isFound||t.splice(e.index,0,n)}return t},Tn=(e,t)=>{let n=br.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},En=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=Tn(e,()=>vn(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}},Dn=(e,t)=>t.some(t=>Tn(t,()=>Cn(t,e))),On=/* @__PURE__ */ new WeakSet,kn=e=>{typeof e==`object`&&(e.kind===`Set`&&(On.add(e),e.elements.forEach(kn)),e.kind===`Function`&&(e.domain.forEach(kn),e.range.forEach(kn)))},An=(e,t)=>xr(Xt,Cn,e,t),jn=e=>{for(let t=1;t<e.length;t++)if(Ft(e[t-1],e[t])>=0)return!1;return!0},Mn=e=>{for(let t=1;t<e.length;t++)Jt(e[t]);if(e.length<2||jn(e))return Rt(e);let t=[...e].sort(Ft),n=[t[0]];for(let e=1;e<t.length;e++)Ft(n[n.length-1],t[e])!==0&&n.push(t[e]);return Rt(n)},Nn=e=>xr(Mn,e=>({kind:`MixedSet`,elements:e}),e,void 0),Pn=Rt([]),Fn=(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&&Ft(r[a],t)<0;)a++;a<r.length&&Ft(r[a],t)===0||i.push(t)}return i.length===n.length?e:Rt(i)},In=(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&&Ft(r[a],t)<0;)a++;a<r.length&&Ft(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Rt(i)},Ln=(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=Ft(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=Rt(i);if(e.hash!==0&&e.hash!==Hr){let t=e.hash,n=0;for(;n<a.length;n++){let e=qr(a[n]);if(e===Hr)break;t=t+Br(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+Xr(a[e])|0;c.fingerprint=t}return c},Rn=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Ft(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Ft(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return zt(n,r)},zn=e=>{let t=Rn(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:ft(t,e.map(e=>e[0]))},Bn=[],Vn=[],Hn=/* @__PURE__ */ new WeakMap,Un=e=>{let t=Bn[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Bn[e]=n,n},Wn=e=>{if(mr(e),e.low===1&&e.high>=1)return Un(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Gn=e=>e.length>0&&(e===Bn[e.length]||Hn.has(e)),Kn=e=>{let t=P(e).elements;return Gn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},qn=e=>{let t=Vn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Vn[e]=n,n},M=e=>Vt(zt(Un(e.length),e),`tuple`),Jn=e=>Vt(Rn(e),`record`),Yn=(e,t)=>Vt(zt(e,t),`record`),Xn=e=>k(e)&&!At(e),Zn=(e,t=!1)=>`UNION(${L(e.base,t)})`,Qn=(e,t=e=>P(e).elements)=>{if(!Xn(e.base))throw new h(`Attempted to enumerate the nonenumerable set:\n${Zn(e)}`);return t(e.base)},$n=(e,t,n)=>{if(Xn(e))return e;throw new h(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${L(e)}\nwhen enumerating:\n${Zn(n)}`)},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)||er(e.domain)===!0||er(e)===!0;case`RecordSet`:return e.sets.every(N)||er(e)===!0;case`ProductSet`:return e.factors.every(N)||er(e)===!0;case`Union`:return N(e.base)&&sr(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}},er=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=er(e.domain);return t===void 0?void 0:!t&&er(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=er(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}},tr=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},nr=(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},rr=e=>{if(typeof e!=`object`||e.kind!==`Subset`||At(e.base))return;let t=P(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=[]:nr(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return Rt(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)})},ir=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Rt(r.map(t=>e[t])));while(nr(r,e.length))}return t},ar=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(At(a))throw new h(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},or=(e,t=e=>P(e).elements)=>{if(typeof e!=`object`)throw new h(`Expected a set but found ${L(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return wn(e.elements);case`Interval`:{let t=Wn(e);return t!==Bn[t.length]&&Hn.set(t,e),t}case`Subset`:{if(mr(e.base)===0)return ir([]);if(!k(e.base))throw new h(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${at(L(e.base))}`);let t=P(e.base).elements;if(t.length>30)throw new h(pr(e));return ir(t)}case`FunctionSet`:{if(!wt.is174&&F(e))return[];if(At(e.domain))throw new h(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${L(e.domain)}\ncannot be enumerated.`);let n=Kn(e.domain);if((n.length>0||wt.is174)&&At(e.range))throw new h(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${L(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return tr(n.map(()=>r)).map(e=>zt(n,e))}case`RecordSet`:{if(!wt.is174&&F(e))return[];let n=ar(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${L(t)}`);return tr(n).map(t=>Jn(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!wt.is174&&F(e))return[];let n=ar(e.factors,t,(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 tr(n).map(M)}case`FilteredSet`:if(!k(e.base)||At(e.base))throw new h(`Attempted to enumerate { x \\in S : p(x) } when S:\n${L(e.base)}\nis not enumerable`);return P(e.base).elements.filter(e.test);case`Union`:{let t=Qn(e).flatMap((t,n)=>P($n(t,n,e)).elements);return P(Nn(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!Xn(e.left)||!Xn(e.right)))throw new h(`Attempted to enumerate S \\cup T when S:\n${L(e.left)}\nand T:\n${L(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&!Xn(e.left)&&!Xn(e.right))throw new h(`Attempted to enumerate S \\cap T when neither S:\n${L(e.left)}\nnor T:\n${L(e.right)}\nis enumerable`);if(e.operator===`\\`&&!Xn(e.left))throw new h(`Attempted to enumerate S \\ T when S:\n${L(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Ln(P(e.left),P(e.right)).elements;let t=e.operator===`\\`||Xn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return P(n).elements.filter(t=>Sr(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new h(`Attempted to enumerate the non-enumerable set ${L(e)}`);default:throw new h(`Expected a set but found ${L(e)}`)}},P=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Rt(or(e));let t=typeof e==`object`&&ot(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=br.sets;n?.push(e);let r=or(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`)?Rt(r):Mn(r);return t&&(t.enumerated=i),i},sr=e=>{if(typeof e!=`object`||Wt(e))return P(e).elements;let t=br.sets;t?.push(e);let n=dr(e);return t?.pop(),n},cr=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,lr=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(lr);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(lr)&&e.range.every(lr);case`SetOperation`:return e.operator!==`\\cup`&&lr(e.left)&&lr(e.right);case`FilteredSet`:return lr(e.base);case`ProductSet`:return e.factors.every(lr);default:return!1}},ur=e=>typeof e!=`object`||Wt(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?ur(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||ur(e.left)||ur(e.right):cr(e)?.some(ur)??!1,dr=e=>{if(e.kind===`Union`)return Qn(e,sr).flatMap((t,n)=>sr($n(t,n,e)));if(e.kind===`FilteredSet`&&!At(e.base))return sr(e.base).filter(e.test);if(cr(e)?.some(ur))return or(e,sr);if(e.kind!==`SetOperation`)return P(e).elements;if(e.operator===`\\cup`)return!Xn(e.left)||!Xn(e.right)?P(e).elements:[...sr(e.left),...sr(e.right)];let t=e.operator===`\\`||Xn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return Xn(n)?sr(n).filter(t=>Sr(t,r)===(e.operator===`\\cap`)):P(e).elements},F=e=>{if(typeof e!=`object`||!k(e))throw new h(`Shouldn't call isEmpty() on value ${L(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new h(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(F);case`RecordSet`:return e.sets.some(F);case`FunctionSet`:return!F(e.domain)&&F(e.range);case`Union`:return Qn(e).every((t,n)=>F($n(t,n,e)));default:return P(e).elements.length===0}},fr=(e,t,n)=>e.reduce((e,r)=>{let i=e*mr(r,t);if(i>2147483647)throw new h(n());return i},1),pr=e=>`Overflow when computing the number of elements in:\n${L(e)}`,mr=(e,t)=>{if(typeof e!=`object`)throw new h(`Attempted to compute the number of elements in the ${lt(e)} ${L(e)}.`);switch(e.kind){case`ModelValue`:throw new h(`Attempted to compute the number of elements in the model value ${L(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return mr(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new h(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new h(`Attempted to compute the number of elements in the overridden value ${L(e)}.`);case`Subset`:{let n=mr(e.base,t);if(n>=31)throw new h(pr(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(F(e.domain))return 1;if(F(e.range))return 0;if(mr(e.range,t)===1)return 1}let n=mr(e.domain,t),r=mr(e.range,t);if(r<=1)return n===0?1:r;let i={value:1};for(let t=0;t<n;t++)if(i.value*=r,i.value>2147483647)throw new h(pr(e));return i.value}case`RecordSet`:return t!==`1.7.4`&&F(e)?0:fr(e.sets,t,()=>pr(e));case`ProductSet`:return t!==`1.7.4`&&F(e)?0:fr(e.factors,t,()=>`Overflow when computing the number of elements in ${L(e)}`);default:return Jt(e),P(e).elements.length}},hr=e=>`Attempted to check if the set ${L(e)}is finite.`,gr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new h(`Attempted to check if the ${lt(e)} ${L(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new h(`Attempted to check if the function:\n${L(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return gr(e.base)&&F(e.base);case`Subset`:return gr(e.base);case`FunctionSet`:{let t=gr(e.domain);if(t&&F(e.domain))return!0;let n=gr(e.range);return n&&F(e.range)?!0:n&&(t||mr(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n={isAllFinite:!0};for(let e of t)if(!gr(e))n.isAllFinite=!1;else if(F(e))return!0;return n.isAllFinite}case`Union`:if(!Xn(e.base))throw new h(`Attempted to check if the nonenumerable set:\n${Zn(e)}\nis a finite set.`);return P(e.base).elements.every(gr);case`SetOperation`:if(e.operator===`\\cup`)return gr(e.left)&&gr(e.right);if(e.operator===`\\cap`){if(!gr(e.left)&&!gr(e.right))throw new h(hr(e));return!0}if(gr(e.left))return!0;if(!gr(e.right))throw new h(hr(e));return!1;case`FilteredSet`:if(!gr(e.base))throw new h(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${L(e.base)}\nis finite.`);return!0}},_r=(e,t,n=Ft)=>{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},vr=e=>{if(typeof e!=`object`||!A(e))return;let t=I(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},yr=(e,t)=>{let n=`Attempted to check if the value:\n${L(e)}\nis an element of the`;if(!A(t))return`${n} ${lt(t)} ${L(t)}`;let r=Ht(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)}`},br={sets:void 0},xr=(e,t,n,r)=>{let i=br.sets,a=br.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof h))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},Sr=(e,t)=>{let n=br.sets;if(n===void 0)return Tr(e,t);n.push(t);let r=Tr(e,t);return n.pop(),r},Cr=(e,t)=>_r(t.elements,e)!==-1,wr=(e,t)=>On.has(t)?En(e,t.elements).isFound:Dn(e,t.elements),Tr=(e,t)=>{if(!k(t))throw new h(yr(e,t));switch(t.kind){case`Set`:return Jt(e),xr(Cr,wr,e,t);case`MixedSet`:return Dn(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!j(e))throw new h(`Attempted to check if the value:\n${L(e)}\nis in the integer interval ${L(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(j(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new h(`Attempted to check if the value:\n${L(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!k(e)||At(e))throw new h(`Attempted to check if the non-enumerable value\n${at(L(e))}\nis element of\n${at(L(t))}`);return P(e).elements.every(e=>Sr(e,t.base));case`FunctionSet`:{if(!A(e)){if(j(e))return!1;throw new h(`Attempted to check if \n${L(e)}\nwhich is not a TLC function value, is in the set of functions:\n${at(L(t))}`)}let n=I(e),r=nn(n.domain);return(r===void 0?An(t.domain,Rt(n.domain)):An({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>Sr(e,t.range))}case`RecordSet`:{let n=A(e)?I(e):void 0;if(!n||!gt(n.domain)){if(j(e))return!1;throw new h(`Attempted to check if non-record\n${L(e)}\nis in the set of records:\n${L(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=_r(n.domain,e);return i!==-1&&Sr(n.range[i],t.sets[r])})}case`ProductSet`:{let n=A(e)?vr(e):void 0;if(n===void 0){if(A(e)&&I(e).domain.every(e=>typeof e==`number`)||j(e))return!1;throw new h(`Attempted to check if non-tuple\n${L(e)}\nis in the set of tuples:\n${L(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>Sr(e,t.factors[n]))}case`FilteredSet`:return Sr(e,t.base)&&t.test(e);case`Union`:if(!Xn(t.base))throw new h(`Attempted to check if:\n ${L(e)}\nis an element of the non-enumerable set:\n ${Zn(t)}`);return P(t.base).elements.some(t=>Sr(e,t));case`SetOperation`:return t.operator===`\\cup`?Sr(e,t.left)||Sr(e,t.right):Sr(e,t.left)&&Sr(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=vr(e);if(n===void 0){if(j(e))return!1;throw new h(`Attempted to check if the value:\n${at(L(e))}\nis an element of ${at(L(t))}.`)}return n.every(e=>Sr(e,t.base))}default:throw new h(yr(e,t))}},Er=(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?Sr(e,n):e.range.every((e,r)=>Er(e,t.range[r],n.range)),I=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return e.enumerated;N(e.domain)||mr(e.domain);let t=Kn(e.domain);return e.enumerated=Vt(zt(t,t.map(t=>e.apply(t))),Ht(e)),e.enumerated}throw new h(`Expected a function but found ${L(e)}`)},Dr=(e,t,n)=>{let r=at(L(e)),i=at(L(t)),a=n===`1.7.4`;switch(Ht(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.`}},Or=(e,t)=>{if(!wt.is174)return Dr(e,t);let n=at(L(t));return Ht(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},kr=(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},Ar=e=>new h(`Attempted to apply function with integer domain to the non-integer argument ${at(L(e))}`),jr=(e,t,n)=>{throw wt.is174||e.length<32?e.forEach(e=>Cn(e,t)):_r(e,t,vn),n},Mr=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=Ht(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new h(n(e,t));if(a===void 0&&!wt.is174&&Gn(r))throw Ar(t)}let i=kr(r,t);return i===-1?xr(_r,jr,r,t):i},Nr=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!Sr(t,e.domain))throw new h(Ht(e)===`lambda`?Dr(e,t):`Attempted to apply a function to ${L(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new h(`Attempted to apply ${L(e)}, which is not a function`);let r=n??Dr,i=Mr(e,t,r);if(i===-1)throw new h(r(e,t));return e.range[i]},Pr=e=>Gn(e)?Hn.get(e)??qn(e.length):void 0,Fr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=I(e).domain;return Pr(t)??Rt(t)},Ir=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!N(e.domain))){if(!Sr(t,e.domain))return e;let r=n(e.apply(t));return Vt({kind:`LazyFunction`,domain:e.domain,apply:n=>An(t,n)?r:e.apply(n),source:e.source},Ht(e))}if(!A(e))throw new h(`Attempted to apply EXCEPT construct to the value ${at(L(e))}.`);let i=I(e),a=Mr(i,t,Or);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Vt(zt(i.domain,o),Ht(i));if(l.writtenKeys=i.writtenKeys,i.hash!==0&&i.hash!==Hr){let e=qr(c);if(e!==Hr){let t=qr(i.domain[a]);l.hash=s===c?i.hash:i.hash-Vr(t,qr(s))+Vr(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Zr(e,s)+Zr(e,c)|0}return l},Lr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Rr=(e,t)=>Math.imul(e^t,16777619),zr=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Lr(t)},Br=e=>Lr(e+2654435769|0),Vr=(e,t)=>Lr(Math.imul(e,668265261)+t|0),Hr=795548749,Ur=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=qr(t[e]);if(r===Hr)return Hr;n=n+Br(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=qr(e.domain[n]),i=qr(e.range[n]);if(r===Hr||i===Hr)return Hr;t=t+Vr(r,i)|0}return t},Wr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new h(`TLC has found a state in which the value of a variable contains ${L(e)}`);if(k(e)){P(e).elements.forEach(Wr);return}let t=I(e);t.domain.forEach(Wr),t.range.forEach(Wr)},Gr=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{qr(e)===Hr&&Wr(e);return}catch(e){if(!(e instanceof h))throw e;return e}},Kr=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[]}},qr=e=>typeof e==`number`?Lr(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?zr(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=Ur(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?N(e.domain)?qr(I(e)):Hr:N(e)?qr(P(e)):Hr,Jr=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Yr=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Jr(t)},Xr=e=>Jr($r(e)+2135587861|0),Zr=(e,t)=>Jr(Math.imul($r(e),374761393)+$r(t)|0),Qr=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Xr(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Zr(e.domain[n],e.range[n])|0;return t},$r=e=>typeof e==`number`?Jr(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?Yr(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Qr(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?$r(I(e)):N(e)?$r(P(e)):Yr(ei(e)),ei=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):ti(e),ti=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${ei(e.base)}>`;if(e.kind===`FilteredSet`&&!N(e))throw new h(`Attempted to compare the non-enumerable set ${L(e)} with another value`);if(k(e))return N(e)?`{${P(e).elements.map(ei).join(`,`)}}`:`<${e.kind} ${L(e)}>`;let t=I(e);return`(${t.domain.map((e,n)=>`${ei(e)}:${ei(t.range[n])}`).join(`,`)})`},ni=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,ri=e=>e.reduce((e,t)=>e===0?0:e*mr(t),1),ii=e=>{if(e.kind===`Subset`)return mr(e.base)<=6?P(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return P(e);if(e.kind===`FunctionSet`&&N(e.domain)&&mr(e.domain)===0)return Rt([zt([],[])]);let t=e.kind===`FunctionSet`?mr(e.range)**mr(e.domain):ri(e.kind===`RecordSet`?e.sets:e.factors);return t===0?Pn:t<=1999?P(e):void 0},ai=(e,t)=>{if(t)return ii(e);if(N(e))try{return ii(e)}catch(e){if(e instanceof h)return;throw e}},oi=(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 Zn(e,t)}},si=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),ci=e=>{if(N(e.domain))try{return I(e)}catch(e){if(e instanceof h)return;throw e}},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 ni(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=ai(e,t);return n?r(n):oi(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?ci(e):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&&wt.is174&&Ht(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&Ht(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:Ht(e)===`record`||i.domain.every(e=>typeof e==`string`&&si(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):pt(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},li=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${at(L(n))}\n`).join(``)},ui=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),di=(e,t)=>ui.has(e)?new h(t):new n(t),fi=(e,t,r,i)=>new n(`The ${e} argument of ${t} should be a ${r}, but instead it is:\n${L(i)}`),pi=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||pi(r))throw di(n,`${n} expects a value as argument ${t+1}`);return r},mi=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`number`)throw di(n,`${n} expects an integer but received ${L(r)}`);return r},hi=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw di(n,`${n} expects a boolean but received ${L(r)}`);return r},gi=(e,t,n)=>{let r=R(e,t,n);if(!k(r))throw di(n,`${n} expects a set but received ${L(r)}`);return r},_i=(e,t,n)=>{let r=gi(e,t,n);if(!N(r))throw di(n,`${n} cannot enumerate the non-enumerable set ${L(r)}`);return r},vi=(e,t,n)=>P(_i(e,t,n)).elements,yi=(e,t,n)=>{let r=R(e,t,n),i=vr(r);if(!i)throw di(n,`${n} expects a sequence but received ${L(r)}`);return i},bi=(e,t,n)=>{let r=R(e,t,n);if(!A(r))throw di(n,`${n} expects a function but received ${L(r)}`);return I(r)},xi=(e,t,n)=>{let r=e[t];if(r===void 0||!pi(r))throw di(n,`${n} expects an operator as argument ${t+1}`);return r},Si=(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}),Ci=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),wi=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),Ti=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Ei=e=>e>2147483647||e<-2147483648,Di=e=>new n(`Overflow when computing ${e}`),Oi={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`},ki={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Ai={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`},ji={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Mi=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return ki[e.operator];if(e.kind!==`Function`)return Oi[e.kind];let t=Ht(e);return t===void 0?`FcnRcdValue`:ji[t]},Ni=e=>Ai[Mi(e)],Pi=(e,t)=>new h(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Fi=(e,t)=>{let r=r=>(...i)=>{let a=br.sets?.length??0;try{return r(...i)}catch(r){throw r instanceof h&&(e.isLazy===!0||!(r instanceof n))?(br.sets&&(br.sets.length=a),Pi(t,r.message)):r}};return{...e,evaluate:r(e.evaluate),evaluateUnary:e.evaluateUnary&&r(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&r(e.evaluateBinary)}},Ii=(e,t)=>{if(typeof e!=`number`)throw Pi(t,`Cannot cast tlc2.value.impl.${Mi(e)} to tlc2.value.impl.IntValue`);return e},Li=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Ri=(e,t,n,r)=>{let i=Li(e,n,`IntValue`,2);return Ti(t,(e,n)=>{let a=Ii(e,i),o=Ii(n,i),s=r(a,o);if(Ei(s))throw Di(`${a}${t}${o}`);return s})},zi=(e,t,r)=>{if(typeof e!=`number`)throw new n(`The ${t} argument of ${r} should be an integer, but instead it is:\n${L(e)}`);return e},Bi=(e,t,n=e)=>Ti(e,(e,r)=>t(zi(e,`first`,n),zi(r,`second`,n))),Vi=(e,t,n)=>({...wi(e,t,n),isLazy:!0}),Hi=(e,t,n)=>{let r=xi(e,t,n);return()=>r.call([])},Ui=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Wi=()=>({bool:ju,condition:(e,t)=>{if(typeof e!=`boolean`)throw mu(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw hu(t,n,e);return e},apply:Nr,expectFunction:Ou,tuple:M,set:Nn,record:Yn,writtenRecord:mt,equal:Xt,enumerate:Ru,unassigned:(e,t)=>{throw Su(e,t)},primeOutsideAction:e=>{throw wu(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:ku,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>Eu(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),Gi={value:void 0},Ki={isAllowed:void 0},qi=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Ji=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Yi=e=>`local${e.counter++}`,Xi=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),Ye(e).forEach(e=>Xi(e,t)),t),Zi=(e,t,n)=>{let r=Ji(e,V(t,e.environment)),i=Xi(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Ji(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},Qi=(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(()=>Yi(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${na(e,t.set,s)}, ${Ji(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=Yi(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${na(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=Yi(e),a=Yi(e),o=Yi(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})`},$i=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${na(e,r[0],n)}, "the left side of =>") ? bool(${na(e,r[1],n)}, "the right side of =>") : true)`;if(O(t))return Zi(e,t,n);let i=cd(t.operator,e.environment);if(i?.kind!==`Builtin`)return Zi(e,t,n);if(i.name===`DOMAIN`)return`${Ji(e,vu(t))}(${na(e,r[0],n)})`;if(i.name===`TLCEval`)return Zi(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Ji(e,yu(t,i))}(${na(e,r[0],n)}, ${na(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Fd(r[0],a))return`${Ji(e,i.evaluateUnary)}(${na(e,r[0],n)})`;let o=r.length===2&&Fd(r[0],a)&&Fd(r[1],a);return i.evaluateBinary&&o?`${Ji(e,i.evaluateBinary)}(${na(e,r[0],n)}, ${na(e,r[1],n)})`:Zi(e,t,n)},ea=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(O(e))return!1;let r=yd(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return ea(e.expression,t,n);case`FieldAccess`:return ea(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>ea(e,t,n));default:return!1}},ta=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return ta(e.record);case`FunctionApplication`:return[e.function,...e.args].every(ta);default:return!1}},na=(e,t,n)=>{let r=(t,r=n)=>na(e,t,r);switch(t.kind){case`Number`:return ut(t.value)?String(t.value):Zi(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 Zi(e,t,n);let i=yd(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Ji(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Ji(e,i.value):Zi(e,t,n)}case`Apply`:return $i(e,t,n);case`And`:case`Or`:{let n=Ji(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)}, ${Ji(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Wd(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${ea(t.function,n,e.environment)?r(t.function):ta(t.function)?r(t.function,i):Zi(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Ji(e,t)}))`,o=_u(e.environment.runtime.version),s=o?`, ${Ji(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`${Ji(e,gu(t))}(${r(t.record)})`;case`Record`:{let i=Jd(t.fields);if(Yd(i))return Zi(e,t,n);let a=Ji(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}, ${Ji(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=Ji(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`)?Qi(e,t,n):Zi(e,t,n);default:return Zi(e,t,n)}},ra=(e,t)=>{if(!Ui.has(e.kind)||(Ki.isAllowed??=qi(),!Ki.isAllowed))return;let n={environment:t,references:[],helpers:[],counter:0},r=na(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}; };`;Gi.value??=Wi();let o=Gi.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},ia={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},aa={none:0,error:1,warning:3,state:4},oa={0:``,1:`Error: `,3:`Warning: `,4:`State `},sa=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===aa.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} @!@!@`:`${oa[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},ca=`The configuration file did not specify the initial state predicate.
|
|
14
|
+
`?r.isAfterLf=!0:i===` `&&(r.column=Je(r.column-1)),t.push(r.line),n.push(r.column);return{lines:t,columns:n}},Xe=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,Ze=new Set([...Pe.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),Qe=(e,t)=>{let n=0;for(;Ze.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,Ge(Xe,e,t)))},$e=e=>{let t=Ye(e),n={offset:0,mode:`DEFAULT`},r=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),i=()=>r(D(`EOF`),e.length-1,0),a=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?nt(o,s,e[a],i):t.lines[n]===o?e[a]===`
|
|
15
|
+
`||e[a]===`\r`?nt(o+1,0,void 0,i):nt(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},o=()=>{let t=n.offset;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return a(t,e.length,``);n.offset+=r+1;return}let r=0,i=t,o=t;for(;o<e.length;)if(e.startsWith(`(*`,o))r++,o+=2,r>1&&(i=o);else if(e.startsWith(`*)`,o)){if(r--,o+=2,i=o,r===0){n.offset=o;return}}else o++;return n.offset=o,i===e.length?void 0:a(i,o,``)},s=t=>{for(;n.offset<e.length;){let i=Ke(t,e,n.offset);if(i.length>0){let e=r(i.kind,n.offset,i.length);return n.offset+=i.length,Me[i.kind].startsWith(`_BM`)&&(n.mode=`SPEC`),Me[i.kind]===`BEGIN_PRAGMA`&&(n.mode=`PRAGMA`),e}n.offset++}return i()};return()=>{if(n.mode===`DEFAULT`)return s(Ue);if(n.mode===`PRAGMA`)return s(We);for(;n.offset<e.length;){let t=n.offset;if(`
|
|
16
|
+
\r`.includes(e[t]))n.offset++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=o();if(e!==void 0)return e}else{let i=qe(e,t);if(i.length===0){let n=Qe(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),o=r<e.length?n:i.length>1?i:``;return a(t,r,o)}let o=r(i.kind,t,i.length);return n.offset+=i.length,o}}return i()}},et=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
|
|
17
|
+
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),tt=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>et.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),nt=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${tt(n)}" (${n.charCodeAt(0)}), `}after : "${tt(r)}"`,rt=e=>{let t=$e(e);for(let e=t();typeof e!=`string`&&e.kind!==D(`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===` `?Je(e):e+1,e.beginColumn);return nt(e.beginLine,n,e.image[t],e.image.slice(0,t))}},it=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],at=/* @__PURE__ */ new Set([...it,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),ot=[`TYPE`,`TYPE_CONSTRAINT`],st=/* @__PURE__ */ new Set([...it,...ot]),ct=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],lt=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},ut=e=>{let t=[],n=0,r=1,i=0,a=(n,a)=>{t.push({kind:`Error`,text:nt(r,n-i+1,e[n],a),line:r})},o=e=>{t.push({kind:`Error`,text:nt(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=lt(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=ke(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=Ce(e,n)??xe(e,n),m=ct.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},dt=(e,t)=>new g(`TLC found an error in the configuration file at line ${e}\n${t}`),ft=(e,t)=>dt(e,`The keyword ${t} appeared twice.`),pt=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),mt=/* @__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`]]),ht=(t,n=`master`)=>{let r=n===`1.7.4`?st:at,i=ut(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 e=i[Math.min(a++,i.length-1)];if(e.kind===`Error`)throw new g(`TLC found an error in the configuration file:\n${e.text}`);return e},u=t=>{if(t.kind===`Number`&&t.text.startsWith(`\\`))throw y(new g(`${e(`java.lang.NumberFormatException`)}For input string: "${t.text}"`),b.error);if(t.kind===`Number`)return{kind:`Number`,value:Number(t.text)};if(t.kind===`String`&&t.text.includes(`\\`))throw new g(`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 dt(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 dt(t.line,`It was expecting a value, but did not find it.`)},d=e=>{let t=l();if(t.kind===`End`)throw dt(t.line,`Expected an identifier after ${e}[.`);let n=l();if(n.text!==`]`)throw dt(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 dt(t.line,`Expected an identifier after <-[mod].`);o.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw dt(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 dt(t,``);r=l()}if(r.text!==`=`)throw dt(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)?pt.get(e):void 0,i=r.has(e)?mt.get(e):void 0,a=()=>{let n=l();if(n.kind===`End`)throw dt(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 ft(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 dt(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(s)throw ft(t,e);s=!0,o.checkDeadlock=n.text===`TRUE`,h=l()}else{if(!r.has(e)||!ot.includes(e))throw dt(t,`It was expecting a keyword, but did not find it.`);if(a(),c.has(e))throw ft(t,e);c.add(e),h=l()}}return o},gt=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:[])}},k=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,_t={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:` `}},vt=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},yt=e=>e!==void 0&&/^\p{Nd}$/u.test(e),bt=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),xt=e=>{let t=t=>{let n=E(e,t,vt);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=E(e,t,yt);if(e.startsWith(`..`,n)&&yt(e[n+2]))return{kind:`Constant`,first:t,last:E(e,n+2,yt)-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=yt(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:E(e,t+1,yt)-1,children:[]};if(bt(n))return{kind:`Constant`,first:t,last:E(e,t,bt)-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:xt(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=_t[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),ee=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||ee===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${ee}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},St={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},Ct={none:0,error:1,warning:3,state:4},wt={0:``,1:`Error: `,3:`Warning: `,4:`State `},Tt=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${wt[n]}${r}`,Et=(e,t=!0,n=`master`,r=[],i=[])=>{let a=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,o,s)=>{let c=o===Ct.warning;if(c&&i.includes(n))throw new p(n,s);if(c&&!t||o!==Ct.error&&r.includes(n))return;let l=c&&!e&&a.size===0?`
|
|
20
|
+
(Use the -nowarning option to disable this warning.)`:``,u=Tt(e,n,o,`${s}${l}`);c&&a.has(u)||(c&&a.add(u),console.log(u))}}},Dt=`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.`,Ot=[[1005,oe,!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,re,!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,Dt,!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]],kt={value:void 0},At=()=>kt.value??=Ot.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),jt=/^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)\)\./,Mt=e=>jt.test(e)?void 0:At().find(t=>t.pattern.test(e))?.message,Nt=e=>e instanceof c||Mt(e.message)?.isEvalException===!0,Pt=/* @__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.`,bo=(e,t,n,r,i,a)=>{let o=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:b(r),message:n})},s=n.isSuffices===n.isInProof,c=n.statement,l={node:c,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,u=l.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return u.kind!==`NewSymbol`&&u.kind!==`AssumeProve`&&_o(u).kind===`Let`?void 0:o(a-1,`A name selector here must be from a LET clause.`);let e=c.kind===`AssumeProve`?[...c.assumptions,c.conclusion]:[c],r=a===1?e.map((e,t)=>({position:t,label:go(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?ho(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&mo(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${yo}`);if(n.args.length!==r.label.params.length)return o(a,`Label \`${n.name}' used with wrong number of arguments.`);l.node=r.label,l.isGoal=!1,l.isSufficesOpen=!1;continue}if(n.kind!==`Operand`)return;let d=vo(n.operand);if(l.isSufficesOpen){if(oo(n.operand,1)!==0)return o(a,u.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);l.isSufficesOpen=!1;continue}if(u.kind===`NewSymbol`)return;if(u.kind!==`AssumeProve`){let e=_o(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?eo(e.name,r,i)?.kind:void 0;if(t===`Variable`||t?.startsWith(`New`))return o(a,`Choosing operand \`${d}' of subexpression with no operands.`);let s=uo(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:fo(e);if(!c)return;let f=oo(n.operand,c.length);if(f===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);l.node=c[f],l.isGoal=!1;continue}let f=[...u.assumptions,u.conclusion],p=oo(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(mo(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${yo}`);let m=f[p];if(m.kind===`NewSymbol`&&a!==t.length-1)return o(a,`Selected a subexpression of a NEW clause of an ASSUME.`);l.node=m,l.isGoal=!1}a||(l.node.kind===`AssumeProve`&&o(void 0,`Selected ASSUME/PROVE instead of expression.`),l.node.kind===`NewSymbol`&&o(void 0,`Selected a NEW declaration as an expression or operator.`))},xo=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:b(e.location.range),message:n}),!0)},So=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=b(r),a=e.params.filter((r,i)=>{let a=Ha(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:b(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},Co=(e,t,n,r)=>{if(!po(e))return!1;let i=co(e),a=i[0],o=i.length>1&&a.kind===`Name`?Ha(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&bo(e,i,o,t,n,r),o!==void 0},wo=(e,t,n,r)=>{let i=e.location;if(Po(e,n,r))return;let a=Fa.get(e);if(a!==void 0)return a;if(Ia(t))return e.kind===`Apply`?e.args.length:0;let o=Ha(n,t);if(o?.isNonFact){r.errors.push({location:b(no(e,t)),message:`Step number of non-expression step used as an expression.`});return}if(Co(e,n,r,!1)||ao(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=Ma),o)return o.arity;let s=$a(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Fa.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(Ha(n,c)!==void 0||$a(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=(e.kind===`Identifier`?void 0:e.spelling)??t,u=b(e.kind===`Apply`&&l===`-.`?to(i,`-`):no(e,t));if(!io(t)||ao(t)){r.errors.push({location:u,message:`Unknown operator: \`${t}'.`});return}r.errors.push({location:u,message:`Could not find declaration or definition of symbol '${l}'.`});let d=ro(e);d&&i.range&&r.errors.push({location:b(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},To=(e,t,n)=>(e.forEach(e=>B(e.set,t,n)),e.reduce((e,t)=>Ja(e,Xa(t.pattern),t.pattern.ranges,n),t)),Eo=(e,t)=>e.kind===`Identifier`&&e.name===t&&O(e)||Ye(e).some(e=>Eo(e,t)),Do=(e,t)=>{e.kind===`FunctionConstruction`&&Eo(e.body,t)&&(e.isRecursive=!0),Ye(e).forEach(e=>Do(e,t))},Oo=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?Za(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:b(o),message:e})},c=e.kind===`Function`?To(e.bounds,t,i):Ya(t,e.params,i),l=Ha(c,a)??Ua(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${a} defined at wrong LET/IN level.`):l&&!u&&s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${a} already defined or declared.`),e.kind===`Function`?(B(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),Do(e.body,a),e.isSelfReferential=Eo(e.body,a)):B(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:Ga(a,Ha(t,a)??Ua(a,i,o),{kind:`Definition`,arity:za(e),range:o},i)},ko=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Ha(e,t.name)?.isPending)return e;let n={name:t.name,arity:za(t),params:Ba(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)=>Bo(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Ia(t.name)?e:s(e,e=>!Ra(t.location,e.location)),o={name:t.name,arity:za(t),kind:`Definition`,range:t.location.range,parent:a};if(Va(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Ia(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return Oo(t,a,u,i)?{...o,params:Ba(t)}:a},a),()=>!0)},Ao=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Ha(t,r)??Ua(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},jo=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=Ao(e.kind===`Identifier`?e.name:e.operator,t,n),i=e.kind===`Apply`?e.argumentCounts?.[0]??0:0;if(!r||i===r.arity)return!1;let a=(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??e.location.range;return a&&n.errors.push({location:b(a),message:`The operator ${r.name} requires ${r.arity} arguments.`}),!0},Mo=(e,t,n)=>{if(jo(e,t,n))return;let r=e.operator,i=eo(r,t,n),a=wo(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:b(e.argumentsRange??no(e,r)),message:`The operator ${r} requires ${a-(Ao(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>No(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:b(e),message:t})};e.args.map((i,a)=>{let c=o[a]??0,l=i.location.range;if(c===0){if(i.kind===`Lambda`&&i.operator!==void 0)s(l,`The operator ${i.operator} requires 1 arguments.`);else if(i.kind===`Lambda`&&l)s(l,`LAMBDA expression used where an expression is required.`);else if(i.kind===`OperatorReference`){let e=wo(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else B(i,t,n);return!0}if(i.kind===`Lambda`){B(i,t,n);let o=i.params.length===c;return!o&&Na.has(i)?s(l,`Expected arity ${c} but found operator of arity ${i.params.length}.`):!o&&l&&i.operator===void 0&&s(e.selectorRanges?.at(-1)??no(e,r),`Lambda expression with arity ${i.params.length} used as argument ${a+1} of operator \`${r}', \nbut an operator of arity ${c} is required.`),o}if(i.kind===`Subexpression`)return B(i,t,n),!0;if(i.kind===`Apply`&&i.argumentCounts?.at(-1)===0){let e=i.argumentCounts.findIndex(e=>e>0);return s(i.selectorRanges?.[e],`Selector \`${i.operator.split(`!`)[e]}' should not have argument(s).`),!1}if(i.kind!==`Identifier`&&i.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=i.kind===`Identifier`?i.name:i.operator,d=eo(u,t,n)?.params??[],f=wo(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(no(i,u),`Expected arity ${c} but found operator of arity ${f}.`),f===c&&d.every(e=>e===0)}).forEach((t,n)=>{t||s(e.location.range,`Argument number ${n+1} to operator '${r}' \nshould be a ${o[n]}-parameter operator.`)})},No=(e,t,n)=>{e.kind===`Identifier`?wo(e,e.name,t,n):B(e,t,n)},Po=(e,t,n)=>{let r=Pa.get(e);return r?(r.args.forEach(e=>No(e,t,n)),n.errors.push(r.error),!0):!1},B=(e,t,n)=>{if(Na.has(e)&&!n.isGenerated){B(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>B(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(jo(e,t,n))return;let r=e.name,i=wo(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:b(no(e,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:wo(e,e.operator,t,n);return;case`Apply`:Mo(e,t,n);return;case`Lambda`:B(e.body,Ja(t,e.params,e.paramRanges,n),i(e.params));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:B(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&B(e.other,t,n);return;case`Let`:B(e.body,ko(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:B(e.body,To(e.bounds,t,n),i(Za(e.bounds)));return;case`UnboundedQuantifier`:B(e.body,Ja(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&B(e.set,t,n),B(e.body,Ja(t,Xa(e.pattern),e.pattern.ranges,n),i(Xa(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:B(e.predicate,To([e.bound],t,n),i(Xa(e.bound.pattern)));return;case`SetMap`:B(e.expression,To(e.bounds,t,n),i(Za(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:b(r.location.range??to(r.location,r.name)),message:`Non-unique fields in constructor.`}),B(r.value,t,n)});return;case`Except`:B(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),B(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:B(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(xo(e,n))return;B(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),So(e,t,n);return;case`Subexpression`:if(Po(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>No(e,t,n)),Co(e,t,n,!1)}},Fo=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||jo(e,t,n)||Co(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&Ha(t,r)?.isNonFact?n.errors.push({location:b(no(e,r)),message:`Step number of non-fact used as a fact`}):n.facts.has(r)||B(e,t,n)}),Io=(e,t,n)=>(e.set&&B(e.set,t,n),Ka(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Lo=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Io(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Lo(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},Ro=(e,t,n)=>e.kind===`AssumeProve`?Lo(e,t,n):(B(e,t,n),t),zo=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Fo(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Vo(t,e,r),t)},Bo=(e,t,n)=>{let r=qo(e,t,n);return e.name===void 0?r:Ka(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Vo=(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=Ro(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return zo(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return zo(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 Fo(r.facts,t,n),o(t);case`Instance`:return o(Bo(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?Bo(t,e,i):ko([t],e,n),t));case`Have`:case`Case`:return B(r.expression,t,i),zo(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>B(e,t,i)),a(t);case`Take`:return a(Ja(To(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Ja(To(r.bounds,t,i),r.names,r.nameRanges,i);return B(r.body,o,{...i,labelParams:[...i.labelParams,...Za(r.bounds),...r.names]}),zo(e.proof,a(t),n),a(o)}default:return zo(e.proof,a(t),n),a(t)}},Ho=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Ro(e.statement,void 0,t);e.name!==void 0&&qa(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),zo(e.proof,n,t),r&&(r.isInProof=!1)},Uo={line:0,column:0},Wo=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Go=(e,t)=>{let n=new Map([...La,...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},Ko=(e,t,n,r,i)=>{let a=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),r),o=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){B(n,a,i);return}let r=wo(n,n.name,a,i);if(r!==void 0&&r!==t.arity)throw new l(`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},s=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){i.errors.push({location:b(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let a=e.expression;o(r,a);let c=a.location.range;s.has(n)?c&&i.errors.push({location:b(c),message:`Multiple substitutions for symbol '${n}' in substitution.`}):s.set(n,a)});let c=t.filter(e=>!s.has(e.name)),u=e=>!Ha(a,e.name)&&!$a(e.name,i);return c.filter(e=>!u(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};o(t,n),s.set(t.name,n)}),c.filter(u).forEach(t=>{let r=e.location.range,a=t.location.range;r&&a&&i.errors.push({location:b(r),message:`Substitution missing for symbol ${t.name} declared at ${b(a)} \nand instantiated in module ${n}.`})}),s},qo=(e,t,n)=>{let r=n.getInstance(e);return Ko(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Ka(e,t,r,n),t)},Jo=(e,t,n,r)=>{let i=Go(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Ko(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:Uo}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Yo=(e,t)=>{let n=[],r=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>Ra(e.location,t.location)?-1:+!!Ra(t.location,e.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof l)||!e.sany&&i.length===0)throw e;i.push(...e.sany?.errors??[])}i.forEach(e=>r(n,e)),a.forEach(e=>r(t,e))}),n},Xo=(e,t)=>{let n=Go(e,t.imported),r=/* @__PURE__ */ new Set([...t.facts,...[...e.theorems,...e.assumptions].flatMap(e=>e.name??[])]),i=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),a=new Map([...La,...t.bound].map(([e,t])=>[e,{...t,position:Uo}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c,l)=>({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),l=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>qa(e.name,{kind:t,arity:e.arity,range:e.location.range},c(e.location,void 0,n,r,!1))}));return Yo([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.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=Ga(e.name,a.get(e.name),r,c(e.location,void 0,t,n,!1));i&&(a.set(e.name,r),o.add(r)),s.push({declaration:e,binding:i?r:void 0})}})),...e.definitions.map(t=>({location:t.location,check:(n,r)=>{let i=c(t.location,t,n,r,!0);Wo(e,t)?B(t.body,void 0,i):Oo(t,void 0,i,o)&&a.set(t.name,{kind:`Definition`,arity:za(t),range:t.location.range,position:t.location})}})),...e.instances.map(e=>({location:e.location,check:(n,r)=>{let i=c(e.location,void 0,n,r,!1);Ya(void 0,e.params,i),t.instanced.get(e)?.forEach((e,t)=>qa(t,e,i)),e.name!==void 0&&qa(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...e.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=c(e.location,void 0,t,n,e.name!==void 0);B(e.expression,void 0,r),e.name!==void 0&&qa(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>Ho(e,c(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>Fo(e.facts,void 0,c(e.location,void 0,t,n,!1))})),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:b(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},Zo=/* @__PURE__ */ new WeakSet,Qo=/* @__PURE__ */ new WeakSet,$o=(e,t,n=/* @__PURE__ */ new Set)=>{let r=as(e,(e,r)=>$o(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,operator:t.get(r.operator)??r.operator}:r},es=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),ts=/* @__PURE__ */ new WeakMap,ns=e=>ts.get(e)??e.name,rs=(e,t)=>(ns(t)!==e.name&&ts.set(e,ns(t)),e),is=(e,t)=>rs(e.kind===`Function`?{...e,bounds:es(e.bounds,e=>t(e,[])),body:t(e.body,Za(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),as=(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=>is(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:es(e.bounds,n),body:t(e.body,Za(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,Xa(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,Xa(e.bound.pattern))};case`SetMap`:return{...e,bounds:es(e.bounds,n),expression:t(e.expression,Za(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)}}},os=`LAMBDA`,ss=(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 as(e,(e,n)=>(r.push(...ss(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},cs=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}},ls=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),us=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},ds=(e,t)=>e.map(e=>({pattern:us(e.pattern,t),set:e.set})),fs=(e,t)=>e.kind===`Function`?{...e,bounds:ds(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},ps=(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=>rs({...fs(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:ds(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:us(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:us(e.bound.pattern,n),set:e.bound.set}};default:return e}},ms=e=>`${e}@ENABLED`,hs=(e,t)=>e.modes.get(t)??e,gs=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!O(e)&&t.instantiation.variables.has(e.name),_s=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>_s(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(gs(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?_s(r.body,t,/* @__PURE__ */ new Map):void 0},vs=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return gs(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:ms(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Cs(e.expression,hs(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Cs(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Cs(e.subscript,hs(t,`Primed`),n),location:r},Cs(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=_s(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:ms(r),location:e.location},location:e.location},Cs({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},ys=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:Ma}),bs=(e,t)=>e.map(e=>ys(e.name,t)),xs=(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:[...bs(t,r),...i.map(e=>ys(e,r))],location:r},location:r}},Ss=(e,t)=>e.instantiation.isParameterized(t)?Ts(e,t):void 0,Cs=(e,t,n)=>{let r=e=>Cs(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!O(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Cs(e.expression,hs(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:Cs(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},hs(t,`Enabled`),n)};let s=vs(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return Zo.add(n),n;let r=Ss(t,e.name);if(r===void 0)return e;if(a.length===0)return{...e,name:r};let o=i.getDefinition(e.name);return o&&za(o)>0?xs(r,a,za(o),e.location):{kind:`Apply`,operator:r,args:bs(a,e.location),location:e.location}}if(e.kind===`Apply`&&o(e.operator)){let n=e.args.map(r),o=i.substitutions.get(e.operator),s=i.substitutions.size>0||a.length>0||Qo.has(e),c=e=>(s&&Qo.add(e),e);if(o?.kind===`Identifier`||o?.kind===`OperatorReference`){let t=o.kind===`Identifier`?o.name:o.operator;return c({...e,operator:t,args:n,resolution:o.kind===`Identifier`?o.resolution:void 0})}if(o?.kind===`Apply`)return c({...e,operator:o.operator,args:[...o.args,...n],resolution:o.resolution});if(o?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:os,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:os,args:n,resolution:Ma},location:e.location};if(o)throw new l(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=Ss(t,e.operator);return u===void 0?c({...e,args:n}):{...e,operator:u,args:[...bs(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=Ss(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?xs(n,a,za(r),e.location):{...e,operator:n}}let c=cs(t),u=as(e,(e,i)=>i.length===0?r(e):Cs(e,t,ls(n,i,c)));return ps(u,n,c)},ws=(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:ys(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Ts=(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=cs(e),o=fs(is(i,(t,n)=>Cs(t,e,ls(/* @__PURE__ */ new Map,n,a))),a);return ws(o,r.params,i.location)}):t},Es=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>ss(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=>Ss(i,e)??e,getQualifiedKey:t=>{let n=Ss(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>ws(r,e.params,r.location)):t}}},Ds=e=>e.kind===`Let`&&e.instances!==void 0||Ye(e).some(Ds),Os=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=as(e,e=>Os(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Ra(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}},ks=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,As=(e,t)=>e.definitions.some(e=>Ds(e.body))||e.assumptions.some(e=>Ds(e.expression))||e.theorems.some(e=>{let t=ks(e);return t!==void 0&&Ds(t)})?{...e,definitions:e.definitions.map(e=>is(e,e=>Os(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Os(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=ks(e);return n===void 0?e:{...e,statement:Os(n,t,[])}})}:e,js=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}])),Ms={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]}},Ns=(e,t)=>{let n=Ms[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Ps=(e,t)=>`${e}${t}`,Fs=(e,t,n)=>`${e}${t}${n}`,Is=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Ls=(e,t,n)=>`${e},${t},${n}`,Rs=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),zs=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Bs=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Vs=(e,t,n,r)=>({...Rs(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Hs=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Us=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Ws=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,{...Vs(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Gs=Vs(`$Set`,0,[2],[1]),Ks=Vs(`$Junction`,0,[3],[1]),qs=Vs(`$Choose`,0,[2],[1]),Js=Vs(`$Function`,0,[3],[1]),Ys=Vs(`$FcnApply`,0,[2,2],[1,1]),Xs=Vs(`$RcdSelect`,0,[2,0],[1,1]),Zs=Vs(`'`,2,[1],[0]),Qs=Vs(`ENABLED`,1,[2],[0]),$s=Vs(`[]`,3,[3],[0]),ec=Vs(`$SquareAct`,2,[2,1],[0,0]),tc=Vs(`$WF`,3,[1,2],[0,0]),nc=Vs(`$TemporalExists`,3,[3],[0]),rc=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),ic=e=>e.map(e=>({name:e,arity:0})),ac=(e,t)=>t.location.range?s(`${e}.`,t.location.range):new l(`${e} at line ${t.location.line}, column ${t.location.column}`),oc=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),sc=e=>e.kind!==`Let`&&e.kind!==`Label`,cc=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:_(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=_(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Ws.get(t)??js.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=Rs(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(Fs(e,n,t))}),t.data.constraints.forEach((e,t)=>zs(r.constraints,t,e)),Bs(r.argConstraints,Ps(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Bs(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);if(t.forEach((t,n)=>{if(!(t.operator||t.declared)&&t.data.level>Hs(e,n))throw new l(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new l(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(Ls(t,n,r)),s=Rs(Math.max(e.level,...t.filter((t,n)=>Us(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>s.params.add(e)),t.forEach((t,n)=>{Us(e,n)===1&&t.data.params.forEach(e=>s.params.add(e))}),n.forEach(e=>e.params.forEach(e=>s.params.add(e))),r.forEach(e=>s.params.delete(e)),e.constraints.forEach((e,t)=>zs(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||zs(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>zs(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||zs(s.constraints,t,Hs(e,n))})),t.forEach((e,n)=>{let r=e.operator;r&&t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>zs(s.constraints,e,Hs(r,a)))}))}),e.argParams.forEach(e=>{let t=Is(e),n=a(t.operator)?.operator;n&&zs(s.constraints,t.param,Hs(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Bs(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>Bs(s.argConstraints,Ps(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&Bs(s.argConstraints,Ps(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=Is(e),n=a(t.operator);n&&Bs(s.argConstraints,Ps(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Is(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=Is(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(Fs(n.declared.name,t.index,t.param));else{let n=a(t.param);if(!n){s.argParams.add(e);return}n.data.params.forEach(e=>s.argParams.add(Fs(t.operator,t.index,e)))}}),t.forEach((e,n)=>{let r=e.declared;r&&t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>s.argParams.add(Fs(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=g(`LAMBDA`,ic(e.params),e.body,t);return{data:n,operator:n}}let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,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=Rs();return e.params.add(r),{data:e,declared:{name:r,arity:i.arity}}}}return{data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),s=(e,t,n,r=[],a=[])=>{let s=rc(n,ic(a));return i(e,o(t,s),r.map(e=>m(e,n)),a)},c=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw ac(`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 ac(`Action used where only temporal formula or state predicate allowed`,e);oc.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&sc(n)&&n.kind!==r)throw ac(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=_(e,n);t.constraints.forEach((e,t)=>zs(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Bs(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof l)||t.sany?t:ac(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Rs();case`Identifier`:return c(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return d(e,r),c(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t);return u(n,e),i(Ks,n)}case`Prime`:case`Unchanged`:return s(Zs,[e.expression],t);case`Enabled`:return s(Qs,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i($s,[n])}case`If`:return s(Ks,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(Ks,[...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=s(Ks,[e.body],t,e.bounds.map(e=>e.set),Za(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw ac(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?nc:Ks,[e.body],t,[],e.names);case`Choose`:return s(qs,[e.body],t,e.set?[e.set]:[],Xa(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(Gs,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(Gs,[e.predicate],t,[e.bound.set],Xa(e.bound.pattern));case`SetMap`:return s(Gs,[e.expression],t,e.bounds.map(e=>e.set),Za(e.bounds));case`FunctionConstruction`:return s(Js,[e.body],t,e.bounds.map(e=>e.set),Za(e.bounds));case`Record`:return s(Js,e.fields.map(e=>e.value),t);case`RecordSet`:return s(Gs,e.fields.map(e=>e.value),t);case`Except`:return s(Gs,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(Ys,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(Gs,e.args,t)}]);case`Bracket`:return Rs();case`FieldAccess`:return i(Xs,[a(e.record,t),{data:Rs()}]);case`BoxAction`:case`AngleAction`:return s(ec,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(tc,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Rs()}},ee=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>ee(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||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 Ye(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,rc(t,ic(e.names))),i;default:return as(e,(e,n)=>(a(e,r,rc(t,ic(n))),e)),i}},g=(e,t,n,r)=>{let i=rc(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=ee(n,i),c={...Rs(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(Ps(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(Fs(e.name,n,t.name))).map(e=>Ls(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(Is(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Is(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},_=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...Rs(),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=g(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:_,toOperand:a}},lc=(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`?lc(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Rs(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>zs(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>Bs(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},uc=(e,t,n,r)=>{let i=cc(t),o=e=>Math.max(0,...e.map(e=>i.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`?lc(t.statement,/* @__PURE__ */ new Map,i).level:o([t.statement]):0},c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=b(e.statement),n=()=>s(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...c(e.proof)]:e.body.kind===`Qed`?c(e.proof):[]}):[],l=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>s(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>o([e.set])!==0).flatMap(e=>e.set.location.range?[{location:b(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(e.proof),...r,...e.proof?.kind===`Steps`&&n()?c(e.proof):[]]}):[],u=Yo([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>i.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?lc(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...l(e.proof),...t.level===3?c(e.proof):[]];if(n.length>0)throw a(n)}})),...n],r);if(u.length>0)throw a(u,!1,void 0,r)},dc=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),fc=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),pc=/* @__PURE__ */ new Set([...dc,...fc,`Enabled`]),mc=/* @__PURE__ */ new Set([`~>`,`-+->`]),hc=/* @__PURE__ */ new Set([...mc,`\\cdot`]),gc=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),_c=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),vc=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},yc=(e,t)=>gc.has(e)||t.builtins.get(e)?.isStateLevel===!0,bc=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(dc.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(fc.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&mc.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(pc.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&hc.has(e.operator))&&(r[0]|=1),pc.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=vc(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)&&(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{yc(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),_c.has(u)&&(r[0]|=8),!a&&yc(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=32)}}Ye(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},xc=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],Sc=(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},Cc=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),wc=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=bc(xc(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=Sc(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=Sc(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!Cc(t[e],l[e*r])))),p=Sc(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}},Tc=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?Ec(xc(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},Ec=(e,t)=>{let n=t.facts.words,r=bc(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=Tc(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]}Cc(e.callee,r[0])||(i[0]|=r[0]&14)}),i},Dc=(e,t)=>!(Tc(e,t)[0]&1),Oc={any:2,repeated:4,streamed:8},kc=(e,t,n=`any`)=>(Tc(e,t)[0]&Oc[n])!==0,Ac=(e,t)=>{let n=Tc(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},jc=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},Mc=(e,t)=>{let n=Ec([e],t);return n[0]&16?void 0:jc(n)},Nc=(e,t)=>!!(Ec([e],t)[0]&1),Pc=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=br.sets,a=i??[],o=a.length;br.sets=a;try{return n()}catch(e){throw Ad(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,br.sets=i}},Fc=(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},Ic=e=>!e.includes(void 0),Lc=e=>e.variables.map(()=>void 0),Rc=(e,t,n)=>{let r=[...e];return r[t]=n,r},zc=(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}},Bc=e=>e.kind===`Identifier`?e.name:void 0,Vc=(e,t,n)=>{if(t.kind===`Label`)return Vc(e,t.body,n);let r=Bc(t);if(r===void 0)return;let i=Tu(n,r);if(i?.kind===`Thunk`)return Vc(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=cd(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?Vc(e,o.body,o.scope):void 0},Hc=(e,t,n)=>{if(t.kind===`Prime`)return Vc(e,t.expression,n);if(t.kind===`Label`)return Hc(e,t.body,n);let r=Bc(t);if(r===void 0)return;let i=Tu(n,r);if(i?.kind===`Thunk`)return Hc(e,i.expression,i.scope);if(i)return;let a=cd(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?Hc(e,a.body,a.scope):void 0},Uc=e=>{if(typeof e!=`boolean`)throw new h(`TLC expected a boolean expression.`);return e},Wc=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Gc=(e,t,n)=>{t===void 0?Ic(n)&&e.onState(n):Ic(n)&&Wc(e)?qc(e,t,n):t.kind===`Predicate`?Jc(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?rl(e,t.expression,t.rest,t.scope,n):Kc(e,t,n)&&Gc(e,t.rest,n)},Kc=(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?Cu(t,r.runtime.version):t}})();return!Xt(i,a)},qc=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){rl(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!Kc(e,r,n):!Uc(H(r.expression,Fc(e,r.scope,n))))return}e.onState(n)},Jc=(e,t,n,r,i)=>Pc(e,t,()=>{switch(t.kind){case`Let`:Jc(e,t.body,n,Cd(t.definitions,Fc(e,r,i)),i);return;case`Label`:Jc(e,t.body,n,r,i);return;default:if(tl.has(t.kind))throw new h(`The state relation is not a boolean expression.`);Pc(e,t,()=>nl(e,t,n,r,i))}}),Yc=(e,t,n,r)=>{Uc(t)&&Gc(e,n,r)},Xc=(e,t,n,r,i)=>{let a=Fc(e,r,i);if(t.kind===`Identifier`){let o=Tu(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){Jc(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){Jc(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:cd(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&Dc(s,e.environment))){Jc(e,c.body,n,c.scope,i);return}Yc(e,H(t,a),n,i);return}let o=ld(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?Jc(e,o.body,n,xd(o,t.args,a),i):Yc(e,H(t,a),n,i)},Zc=(e,t,n,r,i)=>{let a=n[r];a===void 0?Gc(e,t,Rc(n,r,i)):Xt(a,i)&&Gc(e,t,n)},Qc=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),$c=(e,t,n,r,i)=>{let[a,o]=t.args,s=e.isInit?Vc(e,a,r):Hc(e,a,r),c=Fc(e,r,i);if(s===void 0){H(t,c)===!0&&Gc(e,n,i);return}let l=H(o,c),u=i[s];if(t.operator===`=`){Zc(e,n,i,s,l);return}let d=t.operator===`\\subseteq`?{kind:`Subset`,base:l}:l;if(u!==void 0)H(t,c)===!0&&Gc(e,n,i);else{if(!Xn(d))throw new h(`The right side of \\IN is not enumerable.`);for(let t of sr(d))Gc(e,n,Rc(i,s,t))}},el=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),tl=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),nl=(e,t,n,r,i)=>{let a=Fc(e,r,i);switch(t.kind){case`Identifier`:Xc(e,t,n,r,i);return;case`Apply`:if(el.has(t.operator)&&t.args.length===2){$c(e,t,n,r,i);return}if(t.operator===`=>`&&t.args.length===2){if(Uc(H(t.args[0],a))){Jc(e,t.args[1],n,r,i);return}Gc(e,n,i);return}Xc(e,t,n,r,i);return;case`And`:{let a=t.operands;if(t.isBulleted||a.length===2){let t=a.slice(1).reduceRight((e,t)=>Qc(`Predicate`,t,r,e),n);Jc(e,a[0],t,r,i);return}let o=a[a.length-1];Jc(e,zc(t,a.length-1),Qc(`Predicate`,o,r,n),r,i);return}case`Or`:{let a=t.operands;if(t.isBulleted||a.length===2){a.forEach(t=>Jc(e,t,n,r,i));return}Jc(e,zc(t,a.length-1),n,r,i),Jc(e,a[a.length-1],n,r,i);return}case`Exists`:Uu(t.bounds,a,r=>(Jc(e,t.body,n,r,i),!1));return;case`Forall`:{let r=[];if(Uu(t.bounds,a,e=>(r.push(e),!1)),r.length===0){Gc(e,n,i);return}let o=r.slice(1).reduce((e,n)=>Qc(`Predicate`,t.body,n,e),n);Jc(e,t.body,o,r[0],i);return}case`If`:Jc(e,Uc(H(t.condition,a))?t.consequent:t.alternative,n,r,i);return;case`Case`:{let o=t.arms.find(e=>Uc(H(e.condition,a)))?.body??t.other;if(o===void 0)throw new h(`TLC encountered a CASE with no conditions true.`);Jc(e,o,n,r,i);return}case`FunctionApplication`:{let r=Ju(H(t.function,e.isInit?a:ku(a)));if(r){Jc(e,r.body,n,Yu(r,t,a),i);return}break}case`Unchanged`:if(!e.isInit){rl(e,t.expression,n,r,i);return}break;case`BoxAction`:if(!e.isInit){Jc(e,t.action,n,r,i),rl(e,t.subscript,n,r,i);return}break;case`AngleAction`:if(!e.isInit){Jc(e,t.action,Qc(`Changed`,t.subscript,r,n),r,i);return}}Yc(e,H(t,a),n,i)},rl=(e,t,n,r,i)=>Pc(e,t,()=>{let a=Vc(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&Zc(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){Gc(e,n,i);return}let s=o.reduceRight((e,t)=>Qc(`Unchanged`,t,r,e),n);rl(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=Tu(r,t.name);if(a?.kind===`Thunk`){rl(e,a.expression,n,a.scope,i);return}let o=a?void 0:cd(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){rl(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});Xt(s,c)&&Gc(e,n,i)}),il=(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}},al=/* @__PURE__ */ Error(`The replay found a successor`),ol=(e,t,n,r)=>{let i=il(r,!1,n,()=>{throw al},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Qc(`Changed`,e.subscript,t,void 0);Jc(i,e.action,n,t,Lc(r))}else Jc(i,e,void 0,t,Lc(r));return!1}catch(e){if(e!==al)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},sl=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=il(t,!0,void 0,n),o=i.reduceRight((e,t)=>Qc(`Predicate`,t.expression,t.scope,e),void 0);Jc(a,r.expression,o,r.scope,Lc(t))},cl=(e,t,n,r)=>{e.some(e=>tl.has(e.expression.kind))||e.forEach(e=>{let i=[],a=il(n,!1,t,e=>i.push(e));Jc(a,e.expression,void 0,e.scope,Lc(n)),i.forEach(t=>r(t,e))})},ll=/* @__PURE__ */ new WeakMap,ul=/* @__PURE__ */ new WeakMap,dl=(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},fl=(e,t,n)=>{let r=e.slice();return r[t]=n,r},pl=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,ml=(e,t)=>{let n=new h(t);return e.isInit?n:o(n,m.error)},hl=(e,t,n,r)=>{let i=pu(n);return r&&tl.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 ${pl(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},gl=(e,t,n)=>{let r=Ni(t),i=fu(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 ${pl(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
138
|
-
`:``}${i}`},_l=(e,t,n)=>vl(e,t,H(t,n)),vl=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;throw ml(e,hl(e,n,t,r))},yl=(e,t,n,r)=>r.environment.callStack?H(n,r):(e[t]??=Nd(n,r.environment))(r),bl=e=>e===`=`||e===`\\in`||e===`\\subseteq`,xl=(e,t,n)=>{let r=n?ll:ul,i=r.get(e);if(i)return i;let a=Ql(e,t,n);return r.set(e,a),a},Sl=(e,t)=>{if(t.constants.has(e))return;let n=Mu(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`||O(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)},wl=(e,t,n)=>Cl(e,t,!n),Tl=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return Tl(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Cd(e.definitions,dl(r,t,n));return Tl(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Tu(t,e.name);if(a?.kind===`Thunk`)return Tl(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 Tl(s.body,void 0,n,r,i)},El=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||O(e))||!t&&e.kind===`Prime`,Dl=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Dl(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),Dl(i.body,t,n)},Ol=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),kl=(e,t,n)=>Ol.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||bl(e.operator)&&(El(e.args[0],n)||wl(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,Al=/* @__PURE__ */ new Set,jl=(e,t)=>{if(O(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return as(e,(e,i)=>{let a=r.isReadOnly?jl(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},Ml=(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:Mu(r,t);return i&&!n.has(i)&&(n.add(i),Ml(i.body,t,n))?!0:Ye(e).some(e=>Ml(e,t,n))},Nl=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=wl(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=Dl(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return kl(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:xl(e,t,n)}},Pl=(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(Mc(e,t)===void 0||Ml(e,t,/* @__PURE__ */ new Set))return!0;let n=jl(e,Al);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)}},Fl=(e,t,n)=>{let r=e.map(e=>Nl(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Wc(t);for(let s=e;s<r.length;s++){if(s>0&&f&&eu(u)){d??=dl(t,n,u);for(let e=s;e<r.length;e++){let n=r[e].expression,i=yl(a,e,n,d);if(!vl(t,n,i,!1))return}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=dl(t,n,u);let r=yl(i,s,e.expression,d);if(!vl(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=dl(t,n,u);let r=yl(i,s,e.value,d),a=u[e.index];if(a===void 0)u=fl(u,e.index,r),d=void 0;else if(!Xt(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(!Xt(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)},Il=e=>(t,n,r,i,a,o)=>{_l(t,e,dl(t,n,r))&&o(r,i)},Ll=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=dl(r,i,a);if(a[l]!==void 0){_l(r,e,u)&&c(a,o);return}let d=H(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Xn(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${pl(r)}, the right side of \\IN is not enumerable.`;throw ml(r,`${t}\n${fu(e)}`)}let p=sr(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(fl(a,l,p[e]),o)}},Rl=/* @__PURE__ */ new WeakMap,zl=e=>{let t=Rl.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(zl),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Rl.set(e,n),n},Bl=(e,t)=>{let n=e.args[0],r=Il(e),i=(e,r,i)=>Tl(n,r,i,e,!t)??-1,a=Ll(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],dl(t,n,o));l(fl(o,u,d),s)}},Vl=(e,t,n)=>{let r=fu(e);return(i,a,o,s,c,l)=>{let u=dl(i,a,o),d=H(e.function,n?u:ku(u)),f=Ju(d);if(f!==void 0){xl(f.body,t,n)(i,Yu(f,e,u),o,s,c,l);return}if(!A(d))throw ml(i,`In computing ${pl(i)}, a non-function (${Ni(d)}) was applied as a function.\n${r}`);let p=H(e,u);if(typeof p!=`boolean`)throw ml(i,`In computing ${pl(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Hl=(e,t)=>{if(Dl(e,t))return Fl([zl(e)],t,!1);if(e.kind===`Tuple`)return xl(zl(e),t,!1);let n=zl(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Tu(i,e.name):void 0;l?.kind===`Thunk`?xl(zl(l.expression),t,!1)(r,l.scope,a,o,s,c):_l(r,n,dl(r,i,a))&&c(a,o)}},Ul=(e,t,n)=>{let r=e.operator,i=Il(e),a=O(e)?void 0:cd(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Rd(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=xl(a.body,t,n),o.body(e,i(dl(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=dl(a,o,s),f=ld(e,d);f?.kind===`Closure`?xl(f.body,t,n)(a,xd(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Wl=(e,t,n)=>{let r=Il(e),i=O(e)?void 0:Sl(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=Tu(s,e.name);f?.kind===`Thunk`?xl(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=xl(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Gl=(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=Cl(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},Kl=e=>e.kind===`And`?e.operands.flatMap(Kl):[e],ql=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&kl(e,t,!1),Jl=e=>{let t=[];return(n,r,i)=>{let a=dl(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!vl(n,i,yl(t,r,i,a)))return}}},Yl=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=Kl(e),r=n.findIndex(e=>!ql(e,t)||Gl(e,t)),i=r===-1?void 0:Gl(n[r],t);return i?{...i,before:r===0?void 0:Jl(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>Yl(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=cd(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Yl(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&&Rd(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(dl(e,t,n)),n))}},Xl=(e,t,n)=>{let r=Tu(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},Zl=(e,t,n)=>{let r=e.map(e=>xl(e,t,n)),i=n?[]:e.map(e=>Yl(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&&Xl(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)}}},Ql=(e,t,n)=>{let r=e=>xl(e,t,n);switch(e.kind){case`And`:return Fl(e.operands,t,n);case`Or`:return Zl(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(n,r,o,s,c,l)=>{let u=Iu(H(a.set,dl(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,Eu(r,e,u[t]),o,s,c,l)}}let o=n?void 0:Pl(e,t);if(o){let r=Fl(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=dl(n,i,a),d=e.bounds.map(e=>Iu(H(e.set,u),e.set,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=Eu(t,o.names[e],r);if(e===d.length-1){let e=dl(n,i,a);if(!o.guards.every(t=>_l(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{Uu(e.bounds,dl(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Mc(e,t)!==void 0&&!Ml(e.body,t,/* @__PURE__ */ new Set)?jl(e,Al):void 0;return(t,n,r,o,s,c)=>{let l=[];Uu(e.bounds,dl(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Tu(n,e)?.kind===`Value`)){u.every(n=>_l(t,e.body,dl(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&eu(r)?u.slice(n).every(n=>_l(t,e.body,dl(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=H(e.condition,dl(r,i,a));if(typeof l!=`boolean`)throw ml(r,gl(r,l,e));(l?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,source:e.body,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=dl(r,i,a),u=t.find(e=>{let t=H(e.condition,l);if(typeof t==`boolean`)return t;throw ml(r,`In computing ${pl(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Ni(t)}) was used as a guard condition of a CASE.\n${pu(e.source)}`)})?.body??n;if(!u)throw ml(r,`In computing ${pl(r)}, TLC encountered a CASE with no conditions true.\n${fu(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=Td(e.definitions,t);return(t,r,a,o,s,c)=>n(t,Cd(e.definitions,dl(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new h(`UNCHANGED appears in an initial predicate at ${uu(e)}`)}:Hl(e.expression,t);case`AngleAction`:{let n=r(e.action),i=zl(e.subscript),a=(e,n,r)=>{try{return _l(e,i,dl(e,n,r))}catch(n){throw e.isEnabled?Cu(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,zl(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Wl(e,t,n);case`FunctionApplication`:return Vl(e,t,n);case`Apply`:{let i=e.args;if(bl(e.operator)){let r=wl(i[0],t,n);if(r!==void 0)return e.operator===`=`?Fl([e],t,n):Ll(e,()=>r);if(El(i[0],n))return Bl(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=H(i[0],dl(t,n,r));(typeof c==`boolean`?c:ju(c,`the left side of => at ${uu(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return Ul(e,t,n)}default:return Il(e)}},$l=e=>e.variables.map(()=>void 0),eu=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},tu=(e,t)=>{let n=t.state;if(!n||!eu(n))throw new h(`ENABLED needs a complete state at ${uu(e)}`);let r=t.environment;if(r.callStack)return ol(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return xl(e,r,!1)(i,t.scope,$l(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},nu=(e,t,n,r)=>{let i={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};xl(e,t,!0)(i,r,$l(t),void 0,!1,e=>{if(!i.isStopped){if(!eu(e))throw o(new te([...e]),m.error);i.isStopped=n(e)}})},ru=(e,t,n)=>{let r=[];return nu(e,t,e=>(r.push(e),!1),n),r},iu=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return xl(e,n,!1)(a,i,$l(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!eu(e)){let r=n.variables.filter((t,n)=>e[n]===void 0);throw new y(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)}o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},au=(e,t,n,r)=>{let i=[];return iu(e,t,n,e=>(i.push(e),!1),r),i},ou=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),su=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),cu=e=>su.has(e.kind)||e.kind===`Apply`&&ou.has(e.operator),lu=(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&&st(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},uu=e=>`line ${e.location.line}, column ${e.location.column}`,du=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,fu=e=>{let t=e.location.range;return t?du(t):uu(e)},pu=e=>e.kind===`Number`?e.text??String(e.value):fu(e),mu=(e,t)=>new h(`A non-boolean expression (${Ni(t)}) was used as the condition of an IF.\n${fu(e)}`),hu=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new h(`A non-boolean expression (${Ni(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${pu(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new h(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${Ni(n)}.\n${fu({...e,location:{...e.location,range:{...r,end:i}}})}`)},gu=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${L(n)}\n${fu(e)}`,r=e=>`Attempted to apply function:\n${at(L(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!A(i))throw new h(`Attempted to select field "${t}" from a non-record value ${at(L(i))}\n${fu(e)}`);let a=Ht(i);if(a===`tuple`)throw Ar(t);return Nr(i,t,a===`record`?n:r)}},_u=e=>e===`1.7.4`?(t,n)=>Dr(t,n,e):void 0,vu=e=>t=>{if(!A(t))throw new h(`Attempted to apply the operator DOMAIN to a non-function\n(${Ni(t)})\n${fu(e)}`);return Fr(t)},yu=(e,t)=>(n,r)=>{if(!k(n)||At(n))throw new h(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${fu(e)}`);return t.evaluate([n,r])},bu=e=>o(new h(`TLC can't handle real numbers: ${e.text} at ${uu(e)}`),m.configParseError),xu=e=>o(new h(`TLC can't handle a number this big: ${e.text??e.value} at ${uu(e)}`),m.error),Su=(e,t)=>new _(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${fu(t)}`,e),Cu=(e,t)=>e instanceof _&&t!==`1.7.4`?new h(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,wu=e=>new h(`A primed expression appears outside an action at ${uu(e)}`),Tu=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},Eu=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Du=(e,t,n)=>{if(t.kind===`Name`)return Eu(e,t.name,n);let r=vr(n);if(!r||r.length!==t.names.length)throw new h(`Cannot bind <<${t.names.join(`, `)}>> to ${L(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>Eu(e,t,r[n]),e)},Ou=(e,t)=>{if(A(e))return e;throw new h(`A non-function (${Ni(e)}) was applied as a function.\n${fu(t)}`)},ku=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},Au=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),ju=(e,t)=>{if(typeof e!=`boolean`)throw new h(`Expected ${t} to be a boolean but found ${L(e)}`);return e},Mu=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),Nu=(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.`},Pu=(e,t,n)=>{if(!k(e)||At(e)){let r=L(e),i=n===`1.7.4`?void 0:Nu(e,r);throw new h(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${pu(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${pu(t)}\n${i}`)}},Fu=(e,t,n)=>(Pu(e,t,n),typeof e==`object`&&e.kind===`Interval`?Wn(e):rr(e)??P(e).elements),Iu=(e,t,n)=>n===`1.7.4`?(Pu(e,t,n),rr(e)??sr(e)):Fu(e,t,n),Lu=e=>{if(typeof e==`object`&&e.kind===`Interval`)return mr(e),e},Ru=(e,t,n)=>Lu(e)??Iu(e,t,n),zu=(e,t,n)=>Lu(e)??Fu(e,t,n),Bu=(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},Vu=(e,t)=>e.map(e=>Ru(H(e.set,t),e.set,t.environment.runtime.version)),Hu=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Bu(t[n],t=>i(n-1,Du(a,e[n].pattern,t)));return i(e.length-1,n)},Uu=(e,t,n)=>Hu(e,Vu(e,t),t.scope,n),Wu=(e,t)=>{let n=e.map(e=>H(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Gu=(e,t,n)=>{if(e.length===1)return Du(t,e[0].pattern,n);let r=vr(n)??[];return e.reduce((e,t,n)=>Du(e,t.pattern,r[n]),t)},Ku=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,qu=e=>Object.assign(e.value,{lambda:e}),Ju=e=>Ku(e)?e.lambda:void 0,Yu=(e,t,n)=>{let r=e.value,i=t.args.map(e=>H(e,n)),a=i.length===1?i[0]:M(i),o=(e,n,i)=>`In applying the function\n${at(L(r))},\nthe ${e} is:\n${at(L(n))}${i}.\n${fu(t.function)}`,s=e.bounds;if(s.length===1){if(!Sr(a,r.domain))throw new h(o(`first argument`,a,`which is not in its domain`));return Gu(s,e.scope,a)}let c=vr(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0||c.length<s.length)throw new h(`Attempted to apply a function to an argument not in its domain.\n${fu(t.function)}`);return s.forEach((e,t)=>{let n=c[t],r=`argument number ${t+1}`;if(!Sr(n,l[t]))throw new h(o(r,n,`${e.pattern.kind===`Name`?``:`
|
|
139
|
-
`}which is not in its domain`));if(e.pattern.kind===`Tuple`&&vr(n)?.length!==e.pattern.names.length)throw new h(o(r,n,`which does not match its formal parameter`))}),Gu(s,e.scope,M(c.slice(0,s.length)))},Xu=(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:du(n)}},Zu=(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}},Qu=(e,t,n)=>{let r={kind:`LazyFunction`,domain:e,source:n,apply:e=>t(e,r)};return r},$u=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),ed=(e,t)=>{let n=Wu(e.bounds,t),r=Qu(n,(n,r)=>H(e.body,Au(t,Gu(e.bounds,Eu(void 0,e.name,r),n))),Zu(Xu(e.bounds,e.body),e.bounds,n));return qu({value:r,bounds:e.bounds,body:e.body,scope:Eu(void 0,e.name,r)}),e.bounds.length===1?Ut(r):r},td=(e,t)=>{if(typeof t!=`object`||Ht(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!st(t.domain))return t;try{let e=I(t);return zt(e.domain,e.range)}catch(e){if(e instanceof h)return t;throw e}},nd=(e,t)=>e.kind===`Operator`&&e.params.length>0?()=>{throw new h(`Operator ${e.name} requires ${e.params.length} arguments`)}:e.kind===`Function`?e.isSelfReferential?t=>ed(e,t):Nd($u(e),t):Nd(e.body,t),rd=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=nd(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(Au(e,void 0)):e=>a[i]??r(Au(e,void 0));return t.definitionEvaluators.set(e,o),o},id=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},ad=(e,t)=>e.forEach(e=>{if(e.kind===`Operator`&&e.params.length>0)return;let n=e.name;if(t.constants.has(n)||t.substitutions.has(n)||!Dc(e,t))return;let r=t.facts.ids.get(e);if(r===void 0||t.startupValues[r]!==void 0)return;let i={environment:t,scope:void 0,state:void 0,next:void 0};try{let n=t.runtime.evaluateAtStartup(()=>td(e,nd(e,t)(i)));kn(n),t.startupValues[r]=n}catch(e){if(!(e instanceof h)&&!f(e))throw e}}),od=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=H(e.expression,Au(t,e.scope));return n&&(!e.isStreamed||lr(r))&&(e.cache=r),r},sd=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),cd=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return cd(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?sd(r):t.builtins.get(e)},ld=(e,t)=>O(e)?ud(e.operator,t):cd(e.operator,t.environment)??ud(e.operator,t),ud=(e,t)=>{let n=Tu(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return cd(e,t.environment)},dd=e=>e.kind===`Closure`?e.params.length:e.arity,fd=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:e.params.map(e=>({name:e,arity:0})),body:e.body,scope:t.scope};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0,r=n===void 0?void 0:ud(n,t);if(!r)throw new h(`Expected an operator argument at ${uu(e)}`);return r},pd=(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)=>Eu(e,n.name,t[r]),e.scope);return H(e.body,Au(n,r))},md=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:dd(e),call:n=>pd(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},hd=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=ud(e.name,t);return n!==void 0&&dd(n)>0},gd=(e,t)=>e.map(e=>hd(e,t)?md(fd(e,t),t):H(e,t)),_d=(e,t)=>new h(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),vd=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),yd=(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 yd(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([])}},bd=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&ut(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=O(e)?void 0:yd(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=Tu(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:vd(e,t)}}return t=>vd(e,t)},xd=(e,t,n,r)=>{if(t.length!==e.params.length)throw _d(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:fd(t[a],n)}:(r?.[a]??bd(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},Sd=(e,t,n,r)=>e.kind===`Closure`?H(e.body,Au(n,xd(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>H(e,n))):e.isLazy?e.evaluate(Id(t,n),n):e.evaluate(gd(t,n),n),Cd=(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:{kind:`FunctionConstruction`,bounds:r.bounds,body:r.body,location:r.location,isRecursive:!0},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),wd=(e,t,n)=>{let r=Tu(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return od(r,n);if(r?.kind===`Operator`){if(dd(r.operator)===0)return pd(r.operator,[],n);throw new h(`Operator ${e} is used without arguments`)}let i=yd(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Su(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return rd(i.definition,n.environment)(n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new h(`Unknown identifier ${e} at ${uu(t)}`)},Td=(e,t)=>({impure:new Set(e.filter(e=>kc(e,t))),streamed:new Set(e.filter(e=>kc(e,t,`streamed`)))}),Ed=e=>[...e.facts.ids.keys()].some(t=>kc(t,e)),Dd=e=>[...e.facts.ids.keys()].some(t=>kc(t,e,`repeated`)),Od=e=>typeof e==`object`&&e.kind===`FilteredSet`&&`rebind`in e,kd=(e,t,n,r)=>i=>{r.expressions.push(e);let a=br.sets,o=br.callStack,s=a??[],c=s.length;br.sets=s,br.callStack=r;try{let a=t(i),o=Od(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&cu(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=lu(e,r.values),a=i&&!Ye(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!A(a)?void 0:a;throw Ad(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,br.sets=a,br.callStack=o}},Ad=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof h){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},jd=(e,t,n)=>{if(!(n instanceof h))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},Md=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=Zd(e,t),i=t.callStack,a=i?kd(e,r,t,i):r;return t.evaluators.set(e,a),a},Nd=(e,t)=>{if(t.callStack)return V(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=ra(e,t)??V(e,t);return t.entryEvaluators.set(e,r),r},H=(e,t)=>Nd(e,t.environment)(t),Pd=(e,t)=>{let n=e.name,r=O(e)?void 0:yd(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Su(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??=rd(e,t))(r)}return t=>wd(n,e,t)},Fd=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||O(e))return!0;let n=cd(e.name,t);return n===void 0||dd(n)===0},Id=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>H(e,t),expression:e})),Ld=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Id(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Fd(t[0],n)){let e=V(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Fd(t[0],n)&&Fd(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(gd(t,n),n)},Rd=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw _d(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:bd(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:fd(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},zd=(e,t,n)=>{let r=Rd(e,t,n),i={body:void 0};return t=>(i.body??=Nd(e.body,n),i.body({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},Bd=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=V(n[0],t),r=V(n[1],t);return t=>!ju(e(t),`the left side of =>`)||ju(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new h(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=O(e)?void 0:cd(e.operator,t);if(r?.kind===`Closure`)return zd(r,n,t);if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=V(n[0],t),i=vu(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=V(n[0],t);return Qo.has(e)||Nc(n[0],t)?i:e=>e.scope===void 0?r.evaluate([i(e)]):i(e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=V(n[0],t),a=V(n[1],t),o=yu(e,r);return e=>o(i(e),a(e))}if(r?.kind===`Builtin`)return Ld(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new h(t.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 i=n.map(e=>bd(e,t));return r=>{let a=ud(e.operator,r);if(a)return Sd(a,n,r,i);throw t.definitions.get(e.operator)?.kind===`Function`?new h(`${e.operator} is a function; apply it with brackets`):new h(`Unknown operator ${e.operator} at ${uu(e)}`)}},Vd=(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=>Bu(Ru(o(s),a.set,t.runtime.version),t=>ju(i(Au(s,Eu(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)=>Ru(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?ju(i(Au(s,a)),r)!==n:Bu(c[t],n=>l(t-1,Eu(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>Uu(o,e,t=>ju(i(Au(e,t)),r)!==n)?!n:n},Hd=(e,t)=>{if(e.kind===`Tuple`)return M(e.names.map(e=>{let n=Tu(t,e);return n?.kind===`Value`&&n.value}));let n=Tu(t,e.name);return n?.kind===`Value`?n.value:void 0},Ud=/* @__PURE__ */ new WeakSet,Wd=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&Ud.add(e)},Gd=(e,t)=>{let n=Ud.has(e),r=V(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=V(a.set,t),c=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=Kn(e),o=zt(i,i.map(e=>r(Au(t,Eu(t.scope,n,e)))));return st(e)?o:Ut(o)}let n=[],s=i.map(e=>zu(H(e.set,t),e.set,t.environment.runtime.version));return Hu(i,s,t.scope,e=>{let o=i.length===1?Hd(a.pattern,e)??!1:M(i.map(t=>Hd(t.pattern,e)??!1));return n.push([o,r(Au(t,e))]),!1}),Rn(n)},l=Xu(i,e.body),u=(t,n)=>{let a=n.scope,o=qu({value:Qu(t,e=>r(Au(n,Gu(i,a,e))),Zu(l,i,t)),bounds:i,body:e.body,scope:a});return i.length===1?Ut(o):o},d=t.callStack;return t=>{let r=o?s(t):Wu(i,t);if(e.isRecursive||n||t.isKeepLazy||!N(r))return u(r,t);if(!st(r)){if(d)return u(r,t);try{return c(r,t)}catch(e){if(!(e instanceof h))throw e;return u(r,t)}}if(!d)return c(r,t);try{return c(r,t)}catch(t){throw jd(d,e,t),t}}},Kd=(e,t)=>{let n=Ud.has(e);n&&Wd(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):M(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Au(i,Eu(i.scope,`@`,e))):Ir(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(ia.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${fu(e.function)}`)}return n}},qd=(e,t)=>{if(e.kind===`SetFilter`){let n=V(e.predicate,t),r=V(e.bound.set,t),i=e.bound.pattern,a=e.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:du(a)},s=(e,t)=>n=>ju(e(Au(t,Du(t.scope,i,n))),`a set filter predicate`),c=(t,n,r)=>({kind:`FilteredSet`,base:t,test:s(r,n),source:o,rebind:r=>c(t,{...n,environment:r},V(e.predicate,r))});return e=>{let t=r(e);return st(t)?Rt(P(t).elements.filter(s(n,e))):c(t,e,n)}}if(e.kind===`SetMap`){let n=V(e.expression,t);return t=>{let r=[];return Uu(e.bounds,t,e=>(r.push(n(Au(t,e))),!1)),Nn(r)}}let n=e.set;if(!n)return()=>{throw new h(`TLC cannot evaluate an unbounded CHOOSE at ${uu(e)}`)};let r=V(e.body,t),i=V(n,t);return t=>{let a=i(t);if(!k(a)||At(a))throw new h(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${fu(e)}`);let o={value:void 0},s=zu(a,n,t.environment.runtime.version);if(Bu(s,n=>{let i=Du(t.scope,e.pattern,n);return ju(r(Au(t,i)),`the body of CHOOSE`)?(o.value=Hd(e.pattern,i),!0):!1}),o.value===void 0)throw new h(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${fu(e)}`);return o.value}},Jd=e=>[...e].sort((e,t)=>Ft(e.name,t.name)),Yd=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),Xd=(e,t)=>{let n=Jd(e),r=Yd(n),i=n.map(e=>V(e.value,t));if(r)return e=>Jn(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=>mt(a,i.map(t=>t(e)),o):e=>Yn(a,i.map(t=>t(e)))},Zd=(e,t)=>{let n=e=>V(e,t);switch(e.kind){case`Number`:{let t=e.value;return ut(t)?()=>t:()=>{throw xu(e)}}case`Decimal`:return()=>{throw bu(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return Pd(e,t);case`Apply`:return Bd(e,t);case`Bracket`:return()=>{throw new h(`A bracket without a function or subscript is not an expression at ${uu(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new h(`An operator cannot be used as a value at ${uu(e)}`)};case`And`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw hu(e,r,i);if(!i)return!1}return!0}}case`Or`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw hu(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw wu(e);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0,isKeepLazy:n.isKeepLazy})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>Xt(t(e),r(e))}case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw mu(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new h(`A non-boolean expression (${Ni(t)}) was used as a condition of a CASE. ${pu(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new h(`Attempted to evaluate a CASE with no conditions true.\n${fu(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(Au(n,Cd(e.definitions,n)))}case`Forall`:case`Exists`:return Vd(e,t);case`UnboundedQuantifier`:return()=>{throw new h(`TLC cannot evaluate an unbounded quantifier at ${uu(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return qd(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Nn(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>M(t.map(t=>t(e)))}case`FunctionConstruction`:return Gd(e,t);case`FunctionSet`:{let t=n(e.domain),r=n(e.range);return e=>({kind:`FunctionSet`,domain:t(e),range:r(e)})}case`Record`:return Xd(e.fields,t);case`RecordSet`:{let t=Jd(e.fields),r=t.map(e=>e.name),i=t.map(e=>n(e.value));return e=>({kind:`RecordSet`,names:r,sets:i.map(t=>t(e))})}case`Except`:return Kd(e,t);case`ExceptAt`:return t=>{let n=Tu(t.scope,`@`);if(n?.kind!==`Value`)throw new h(`@ appears outside an EXCEPT at ${uu(e)}`);return n.value};case`FunctionApplication`:{Wd(e.function);let r=n(e.function),i=t=>Ou(r(ku(t)),e),a=e.args.map(n),o=_u(t.runtime.version);if(a.length===1){let e=a[0];return t=>Nr(i(t),e(t),o)}return e=>Nr(i(e),M(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=gu(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=n({kind:`Unchanged`,expression:e.subscript,location:e.location}),i=e.kind===`BoxAction`;return e=>i?ju(t(e),`an action`)||r(e):ju(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>tu(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new h(`The subexpression reference at ${uu(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new h(`TLC cannot evaluate a temporal formula in a state at ${uu(e)}`)}}},Qd=`tlc2/value/impl/`,$d={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},ef={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},tf=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)}},nf=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),rf=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],af=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??nf.get(e[3])}${`[]`.repeat(e[1].length)}`),of=(e,t)=>e[e[t].first].text,sf=(e,t)=>of(e,t).replaceAll(`/`,`.`),cf=e=>{let t=tf(e);if(t.readUint32()!==3405691582)throw new l(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],r=t.readUint16(),i=new TextDecoder;for(let e=1;e<r;e++){let r=t.readUint8(),a={tag:r,text:``,value:0,first:0,second:0};n[e]=a,r===$d.utf8?a.text=i.decode(t.readBytes(t.readUint16())):r===$d.integer?a.value=t.readInt32():r===$d.float?t.readUint32():r===$d.long||r===$d.double?(t.readBytes(8),e++):r===$d.class||r===$d.string||r===$d.methodType||r===$d.module||r===$d.package?a.first=t.readUint16():r===$d.methodHandle?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16();let a=sf(n,t.readUint16());t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let o=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,s=i.indexOf(`)`),c=af(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:tf(t.readBytes(t.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()},()=>sf(n,d.readUint16())):[],p=rf.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=af(i.slice(s+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;o.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${a}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:o}},lf=(e,t)=>{let n=e[t],r=e[n.second];return{className:of(e,n.first),name:e[r.first].text}},uf=(t,n,r,i)=>{let a=()=>new e(`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===$d.integer)return t.value;if(t.tag===$d.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>=ef.iconstM1&&t<=ef.iconst5)s.push(t-ef.iconst0),e+=1;else if(t===ef.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===ef.sipush)s.push(r()<<16>>16),e+=3;else if(t===ef.ldc)s.push(l(o[e+1])),e+=2;else if(t===ef.ldcW)s.push(l(r())),e+=3;else if(t===ef.dup){let t=c();s.push(t,t),e+=1}else if(t===ef.getstatic){let t=lf(n,r());if(t.className!==`${Qd}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===ef.invokestatic){let t=lf(n,r()),o=c();if(t.className!==`${Qd}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===ef.new)s.push({className:of(n,r()),value:void 0}),e+=3;else if(t===ef.invokespecial){let t=lf(n,r()),o=c(),s=c();if(!(t.className===`${Qd}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===ef.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()},df=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=cf(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:uf(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)}))}},ff=/* @__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(`,`),pf=[[`\\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`,`≀`],[`^+`,`⁺`]],mf=/* @__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(`,`),hf=/* @__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(`.`),gf=/* @__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(`.`),_f=/* @__PURE__ */ new Set([`Bags`,`Json`,`Randomization`,`TLCExt`]),vf=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
70
|
+
`],[2171,`Parsing or semantic analysis failed.`],[2213,`:
|
|
71
|
+
`],[2281,` - specifically: `],[2405,`failed.
|
|
72
|
+
`]]),Ft=(e,t,n)=>{let r=n?Pt.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)}${It(t.slice(a),n)}`},It=(e,t)=>{let n=t?Mt(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Ct.none} @!@!@\n${Ft(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},Lt=e=>String(e).padStart(2,`0`),Rt=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 ${Lt(r%24)}h`:e>36e5?`${Lt(r%24)}h ${Lt(n)}min`:e>6e4?`${Lt(n)}min ${Lt(t)}s`:`${Lt(t)}s`},zt=e=>`${e.getFullYear()}-${Lt(e.getMonth()+1)}-${Lt(e.getDate())} ${Lt(e.getHours())}:${Lt(e.getMinutes())}:${Lt(e.getSeconds())}`,Bt=/* @__PURE__ */ new WeakMap,Vt=(e,t,n)=>{if(!(e instanceof _))return e;let r=y(new _(`${n}\n${e.message}`,e),u(e));return Bt.set(r,{code:t,headline:n,inner:e}),r},Ht=e=>Bt.has(e),Ut=e(`util.WrongInvocationException`),Wt=i.slice(0,i.indexOf(`
|
|
73
|
+
`)),Gt=`${i}tlc2.tool.EvalException: `,Kt=`${i}util.Assert$TLCRuntimeException: `,qt=e=>Nt(e)?Gt:Kt,Jt=e=>{try{return e()}catch(e){throw e instanceof _?Nt(e)?new _(`${m}${e.message}`):Mt(e.message)?e:new _(`${i}${e.message}`):e}},Yt=[Gt,Kt,i,m],Xt=(e,t)=>{let n=Bt.get(e);if(n)return`${n.headline}\n${Xt(n.inner,t)}`;let r=e.message;if(e instanceof ue)return r;let i=Yt.find(e=>r.startsWith(e))??``;return`${i}${It(r.slice(i.length),t)}`},Zt=(e,t)=>{let n=Bt.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:Xt(e,!0)};if(e instanceof l)return{code:t?St.stackOverflow:St.general,message:r,toolMessage:r};if(t&&Nt(e))return{code:Mt(r)?.code??St.general,message:r,toolMessage:r};let a=t&&!r.startsWith(Wt)&&!(e instanceof ue),o=e instanceof s?Ut:i,c=a?o:``;return{code:St.general,message:`${c}${r}`,toolMessage:`${c}${Xt(e,!0)}`}},Qt=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,$t=1e6,en={size:$t},tn=()=>en.size,nn=()=>Math.max(en.size,10),rn=()=>`Attempted to construct a set with too many elements (>${en.size}).`,an=(e,t)=>{if(e.length===nn())throw new s(rn());e.push(t)},on=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=nn(),sn=(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`,cn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),ln=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),un=e=>typeof e==`object`&&e.kind===`ModelValue`,dn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),fn=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:j(e)?`set`:`function`,pn=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,mn={isUsed:!1},hn=(e,t)=>(mn.isUsed=!0,e.writtenKeys=t,e),gn=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,_n=e=>gn(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),vn=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):_n(e),yn=(e,t,n)=>hn(mi(e,t),n),bn=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(bn);e.writtenKeys=void 0,e.range.forEach(bn)}},xn=e=>e.every(e=>typeof e==`string`),Sn=(e,t)=>e.length>0&&t.length>0&&xn(e)!==xn(t),Cn=(e,t)=>{mn.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Sn(n,r)?Nr(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Jn(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:Jn(t,n);if(r!==0)return r}return 0},wn=(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=Jn(n[e],r[e]);if(t!==0)return t}return 0},Tn=e=>un(e)?e.type:void 0,En=(e,t,n)=>{let r=Tn(e),i=Tn(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(un(e)&&un(t)){if(r===void 0||i===void 0||r===i)return;throw new _(`Attempted to ${a} the differently-typed model values ${I(e)} and ${I(t)}`)}throw r===void 0?new _(`Attempted to ${a} the typed model value ${I(t)} and the non-model value\n${I(e)}`):new _(`Attempted to ${a}${n?``:` the`} typed model value ${I(e)} and non-model value\n${I(t)}`)},Dn={ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0},On=e=>{Dn.ranks=Object.create(null),Dn.size=0,Dn.searchRank=void 0,Dn.unorderedString=void 0,Yn.clear();for(let t of e)Rn(t)},kn=()=>{Dn.searchRank=Dn.size},An=()=>Dn.unorderedString,jn={is174:!1},Mn={isExpanded:!0,isViewPrinted:!1},Nn=e=>{jn.is174=e.version===`1.7.4`,en.size=e.maxSetSize??$t,Mn.isExpanded=e.isLazyValueExpanded??!0,Mn.isViewPrinted=e.isViewPrinted??!1},Pn=/* @__PURE__ */ new WeakMap,Fn=(e,t)=>(Mn.isViewPrinted&&Pn.set(e,t),e),In=/* @__PURE__ */ new WeakMap,Ln=(e,t)=>(In.set(e,t),e),Rn=e=>(Dn.ranks[e]===void 0&&(Dn.ranks[e]=Dn.size++),e),zn=e=>Dn.ranks[Rn(e)],Bn=(e,t)=>{if(e===t)return 0;let n=Dn.ranks,r=n[e],i=n[t],a=Dn.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(Dn.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},Vn=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Hn=(e,t)=>(Vn(e)||Vn(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Un=(e,t)=>new _(Vn(e)?`Attempted to compare overridden value ${I(e,!0)} with non-overridden value:\n${I(t)}`:`Attempted to compare ${fn(e)} ${I(e)} with ${fn(t)} ${I(t)}`),Wn=(e,t,n)=>{if(!Vn(e))throw new _(`Attempted to ${n} the set ${I(M(e)?N(e):e,!0)} with the value:\n${I(t,!0)}`);if(!Vn(t))throw Un(e,t);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new c(`Attempted to compare ${I(e,!0)} with the value\n${I(t,!0)}`)},Gn={kind:`InfiniteSet`,name:`Any`},Kn=e=>{throw new c(`Attempted to compare ANY with the value\n${I(e)}`)},qn=e=>{mn.isUsed&&bn(e),e===Gn&&Kn(e),typeof e==`object`&&e.kind===`LazyFunction`&&F(e)},Jn=(e,t)=>{if(e===t)return qn(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Cn(e,t);if(n===`Set`&&r===`Set`)return wn(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&&En(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return En(e,t,!1),n===`ModelValue`?-1:1;if(e===Gn||t===Gn)return Kn(e===Gn?t:e);if(j(e)&&j(t)&&Hn(e,t))return Wn(e,t,`compare`);let i=j(e);if(i!==j(t))throw Un(e,t);if(n===`Interval`&&r===`Set`){let n=Li(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-Li(t);if(n!==0)return n}return i?wn(N(e),N(t)):Cn(F(e),F(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Bn(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(En(e,t,!1),un(e))return-1;if(un(t))return 1;throw Un(e,t)},Yn=/* @__PURE__ */ new Map,Xn=32768,Zn=e=>{let t=Yn.get(e);if(t)return t;if(Yn.size===Xn)throw new ce(`TLC supports at most ${Xn} model values, but model value ${e} exceeds this limit.`);let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:zn(e),hash:ma(ha(ga(e),109)),fingerprint:Ta(Ea(e)^60)};return Yn.set(e,n),n},Qn=()=>[...Yn.values()],$n=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),er=e=>{let t=$n(e);return t.isNormalized=!0,t},tr=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1}),nr={isPresent:!1},rr=(e,t)=>(t===`lambda`&&(nr.isPresent=!0),t!==void 0&&(e.functionClass=t),e),ir=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,ar=e=>rr(e,`lambda`),or=e=>Qt(e)&&e.isCached===!0,sr={isPresent:!1},cr=e=>(sr.isPresent=!0,e),lr=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),ur=e=>{sr.isPresent&&typeof e==`object`&&Qt(e)&&lr.has(e.kind)&&(e.isCached=!0)},dr=e=>{(nr.isPresent||sr.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(dr),e.range.forEach(dr)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(dr):j(e)&&M(e)&&(ur(e),N(e).elements.forEach(dr))))},fr=(e,t)=>{if(ur(e),e===t)return qn(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&En(e,t,!0),Jn(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return Cn(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return wn(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&Li(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==Li(t))return!1;if(un(e)||un(t))return e.kind===`LazyFunction`&&F(e),En(e,t,!0),un(e)&&un(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return fr(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=P(e.domain),r=P(t.domain);if(n||r)return n===r;let i=P(e.range),a=P(t.range);return i||a?i===a:fr(e.domain,t.domain)&&fr(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(P(e))return P(t);if(P(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]&&fr(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return P(e)?P(t):!P(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>fr(e,t.factors[n]));let n=j(e)&&j(t)&&!(M(e)&&M(t));if(n&&Hn(e,t))return Wn(e,t,`check equality of`)===0;if(n){if(!Vn(e)){let n=N(e);if(!Vn(t))return wn(n,N(t))===0}return ja(e)===ja(t)}return Jn(e,t)===0},pr=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):ja(n)===ja(r);return n},mr=pr(!1),hr=pr(!0),gr=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},_r=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=wa(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||hr(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||hr(i[e],n))return i[e]}return n.kind===`Set`?gr(n.elements,t):(gr(n.domain,t),gr(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}},vr=(e,t)=>t.length===0||ir(e)===`tuple`?1:da(t)?.low,yr=e=>{if(!ln(e))return;let t=F(e);return{domain:t.domain,range:t.range,low:vr(e,t.domain)}},br=e=>{if(!ln(e))return;let t=F(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},xr=(e,t)=>(En(t,e,!1),1),Sr=(e,t)=>(En(t,e,!0),!1),Cr=(e,t)=>(e.type!==void 0&&En(e,t,!1),un(t)?e.rank-t.rank:-1),wr=(e,t)=>(e.type!==void 0&&En(e,t,!0),un(t)&&e.name===t.name),Tr={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`}},Er=(e,t,n)=>{let r=Tr[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${I(e)} with ${r.other}:\n${I(t)}`},Dr=(e,t,n)=>{let r=yr(n);if(!r){if(un(n))return xr(n,t);throw new _(`Attempted to compare the function ${I(t)} with the value:\n${I(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>Or(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return Or(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new _(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${I(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},Or=(e,t)=>{for(let n=0;n<e.length;n++){let r=Nr(e[n],t[n]);if(r!==0)return r}return 0},kr=(e,t)=>{let n=F(e);if(ir(e)===`tuple`){let r=ln(t)?Hi(t):void 0;return r?n.range.length-r.length||Or(n.range,r):Dr({...n,low:1},e,t)}if(ir(e)===`record`){let r=br(t);if(!r){if(un(t))return xr(t,e);throw new _(`Attempted to compare record:\n${I(e)}\nwith non-record\n${I(t)}`)}return n.domain.length-r.domain.length||Or(n.domain,r.domain)||Or(n.range,r.range)}return Dr({...n,low:vr(e,n.domain)},e,t)},Ar=(e,t)=>Vn(e)||Vn(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),jr=(e,t)=>{let n=dn(t)?t:N(t);return{elements:N(e).elements,otherElements:N(n).elements}},Mr=(e,t)=>{if(Ar(e,t))return Jn(e,t);if(!dn(e))return Mr(N(e),t);if(!j(t)){if(un(t))return xr(t,e);throw new _(`Attempted to compare the set ${I(e)} with the value:\n${I(t)}`)}let n=jr(e,t);return n.elements.length-n.otherElements.length||Or(n.elements,n.otherElements)},Nr=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return Jn(e,t);if(un(t))return xr(t,e);throw new _(Er(e,t,!1))}return e.kind===`ModelValue`?Cr(e,t):ln(e)?kr(e,t):Mr(e,t)},Pr=(e,t)=>e.every((e,n)=>Rr(e,t[n])),Fr=(e,t,n)=>{let r=yr(n);if(!r){if(un(n))return Sr(n,t);throw new _(`Attempted to check equality of the function ${I(t)} with the value:\n${I(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&Pr(e.range,r.range);let i=e.low??r.low;return i===void 0?Pr(e.domain,r.domain)&&Pr(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new _(`Attempted to compare an integer with non-integer:\n${I(e)}.`);return e===i+t})&&Pr(e.range,r.range)},Ir=(e,t)=>{let n=F(e);if(ir(e)===`tuple`){let r=ln(t)?Hi(t):void 0;return r?n.range.length===r.length&&Pr(n.range,r):Fr({...n,low:1},e,t)}if(ir(e)===`record`){let r=br(t);if(!r){if(un(t))return Sr(t,e);throw new _(`Attempted to check equality of record:\n${I(e)}\nwith non-record\n${I(t)}`)}return n.domain.length===r.domain.length&&Pr(n.domain,r.domain)&&Pr(n.range,r.range)}return Fr({...n,low:vr(e,n.domain)},e,t)},Lr=(e,t)=>{if(Ar(e,t))return fr(e,t);if(!dn(e))return Lr(N(e),t);if(!j(t)){if(un(t))return Sr(t,e);throw new _(`Attempted to check equality of the set ${I(e)} with the value:\n${I(t)}`)}let n=jr(e,t);return n.elements.length===n.otherElements.length&&Pr(n.elements,n.otherElements)},Rr=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(un(t))return Sr(t,e);throw new _(Er(e,t,!0))}return e.kind===`ModelValue`?wr(e,t):ln(e)?Ir(e,t):Lr(e,t)},zr=e=>{let t=[];for(let n of e){let e=Vr(n,t);e.isFound||t.splice(e.index,0,n)}return t},Br=(e,t)=>{let n=Wi.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Vr=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=Br(e,()=>Nr(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}},Hr=(e,t)=>t.some(t=>Br(t,()=>Rr(t,e))),Ur=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,Wr=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(Wr)),e.kind===`Function`&&(e.domain.forEach(Wr),e.range.forEach(Wr)))},Gr=e=>{if(!(typeof e!=`object`||or(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:N(e);return;case`FilteredSet`:case`Subset`:return Gr(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(Gr(e.left),Gr(e.right));case`FunctionSet`:return Gr(e.domain),Gr(e.range);case`RecordSet`:return e.sets.forEach(Gr);case`ProductSet`:return e.factors.forEach(Gr)}},Kr=(e,t)=>Gi(fr,Rr,e,t),qr=e=>{for(let t=1;t<e.length;t++)if(Jn(e[t-1],e[t])>=0)return!1;return!0},Jr=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},Yr=e=>{for(let t=1;t<e.length;t++)ur(e[t]);if(e.length<2||qr(e))return $n(e);let t=[...e].sort(Jn),n=[t[0]];for(let e=1;e<t.length;e++)Jn(n[n.length-1],t[e])!==0&&n.push(t[e]);return $n(n)},Xr=e=>{if(Jr(e))return $n(e);let t=Gi(Yr,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},Zr=$n([]),Qr=(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&&Jn(r[a],t)<0;)a++;a<r.length&&Jn(r[a],t)===0||i.push(t)}return i.length===n.length?e:$n(i)},$r=(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&&Jn(r[a],t)<0;)a++;a<r.length&&Jn(r[a],t)===0&&i.push(t)}return i.length===n.length?e:$n(i)},ei=(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=Jn(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=$n(i);if(e.hash!==0&&e.hash!==ya){let t=e.hash,n=0;for(;n<a.length;n++){let e=wa(a[n]);if(e===ya)break;t=t+_a(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+Da(a[e])|0;c.fingerprint=t}return c},ti=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Jn(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Jn(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return tr(n,r)},ni=e=>{let t=ti(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:hn(t,e.map(e=>e[0]))},ri=[],ii=/* @__PURE__ */ new Map,ai=[],oi=/* @__PURE__ */ new WeakMap,si=e=>{let t=ri[e]??ii.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?ii.set(e,new WeakRef(n)):ri[e]=n,n},ci=e=>{if(Li(e),e.low===1&&e.high>=1)return si(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},li=e=>e.length>0&&(e===ri[e.length]||e===ii.get(e.length)?.deref())||oi.has(e),ui=e=>{let t=N(e).elements;return li(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},di=e=>{let t=ai[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return ai[e]=n,n},fi=e=>rr(tr(si(e.length),e),`tuple`),pi=e=>rr(ti(e),`record`),mi=(e,t)=>rr(tr(e,t),`record`),hi=e=>j(e)&&!Vn(e),gi=(e,t=!1)=>`UNION(${I(e.base,t)})`,_i=(e,t=e=>N(e).elements)=>{if(!hi(e.base))throw new _(`Attempted to enumerate the nonenumerable set:\n${gi(e)}`);return t(e.base)},vi=(e,t,n)=>{if(hi(e))return e;throw new _(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${I(e)}\nwhen enumerating:\n${gi(n)}`)},M=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 M(e.base);case`FunctionSet`:return M(e.domain)&&M(e.range)||yi(e.domain)===!0||yi(e)===!0;case`RecordSet`:return e.sets.every(M)||yi(e)===!0;case`ProductSet`:return e.factors.every(M)||yi(e)===!0;case`Union`:return M(e.base)&&(dn(e.base)?Ur(e.base):Ai(e.base)).every(M);case`SetOperation`:return e.operator===`\\cup`?M(e.left)&&M(e.right):e.operator===`\\cap`?M(e.left)||M(e.right):M(e.left);default:return!1}},yi=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=yi(e.domain);return t===void 0?void 0:!t&&yi(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=yi(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return M(e)?N(e).elements.length===0:void 0;default:return}},bi=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},xi=(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},Si=e=>{if(typeof e!=`object`||e.kind!==`Subset`||Vn(e.base))return;let t=N(e.base).elements;if(t.length<=20)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:xi(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return $n(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)})},Ci=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push($n(r.map(t=>e[t])));while(xi(r,e.length))}return t},wi=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(Vn(a))throw new _(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},Ti=(e,t=e=>N(e).elements)=>{if(typeof e!=`object`)throw new _(`Expected a set but found ${I(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return zr(e.elements);case`Interval`:{let t=ci(e);return t!==ri[t.length]&&oi.set(t,e),t}case`Subset`:{if(Li(e.base)===0)return Ci([]);if(!j(e.base))throw new _(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${A(I(e.base))}`);let t=N(e.base).elements;if(t.length>30)throw new _(Ii(e));return Ci(t)}case`FunctionSet`:{if(!jn.is174&&P(e))return[];if(Vn(e.domain))throw new _(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${I(e.domain)}\ncannot be enumerated.`);let n=ui(e.domain);if((n.length>0||jn.is174)&&Vn(e.range))throw new _(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${I(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return bi(n.map(()=>r)).map(e=>tr(n,e))}case`RecordSet`:{if(!jn.is174&&P(e))return[];let n=wi(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${I(t)}`);return bi(n).map(t=>pi(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!jn.is174&&P(e))return[];let n=wi(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${I(e)}`);return bi(n).map(fi)}case`FilteredSet`:if(!j(e.base)||Vn(e.base))throw new _(`Attempted to enumerate { x \\in S : p(x) } when S:\n${I(e.base)}\nis not enumerable`);return N(Xr(Ai(e.base).filter(t=>e.test(t,!1)))).elements;case`Union`:{let t=[];return _i(e).forEach((n,r)=>{let i=vi(n,r,e);if(on(i))throw new s(rn());Ai(i).forEach(e=>an(t,e))}),N(Xr(t)).elements}case`SetOperation`:{if(e.operator===`\\cap`&&!hi(e.left)&&!hi(e.right))throw new _(`Attempted to enumerate S \\cap T when neither S:\n${I(e.left)}\nnor T:\n${I(e.right)}\nis enumerable`);if(e.operator===`\\`&&!hi(e.left))throw new _(`Attempted to enumerate S \\ T when S:\n${I(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return N(Xr(Di(e))).elements;let t=e.operator===`\\`||hi(e.left),n=t?e.left:e.right,r=t?e.right:e.left,i=[];return sn(typeof n==`object`&&n.kind===`Interval`?n:Ai(n),t=>{qi(t,r)===(e.operator===`\\cap`)&&an(i,t)}),N(Xr(i)).elements}case`InfiniteSet`:case`SequenceSet`:throw new _(`Attempted to enumerate the non-enumerable set ${I(e)}`);default:throw new _(`Expected a set but found ${I(e)}`)}},N=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return $n(Ti(e));let t=typeof e==`object`&&Qt(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=Wi.sets;n?.push(e);let r=Ti(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`)?$n(r):Yr(r);return t&&(t.enumerated=i),i},Ei=e=>{if(!(typeof e!=`object`||or(e)))switch(e.kind){case`MixedSet`:N(e);return;case`FilteredSet`:return hi(e.base)||N(e),Ei(e.base);case`Union`:if(!dn(e.base)&&hi(e.base))return Ei(e.base);_i(e).slice(0,1).forEach(t=>Ei(vi(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!hi(e.left)&&N(e),e.operator!==`\\cup`||hi(e.left)&&hi(e.right)||N(e),e.operator!==`\\cap`||hi(e.left)?Ei(e.left):Ei(e.right),e.operator===`\\cup`&&Ei(e.right)}},Di=e=>{if(!hi(e.left)||!hi(e.right))throw new _(`Attempted to enumerate S \\cup T when S:\n${I(e.left)}\nand T:\n${I(e.right)}\nare not both enumerable`);if(Ei(e.left),Ei(e.right),on(e.left))throw new s(rn());let t=Ai(e.left),n=on(e.right)?void 0:Ai(e.right);if(!n||t.length+n.length>nn())throw new s(rn());return[...t,...n]},Oi=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return N(e).elements;let t=Br(e,()=>Di(e)),n=N(Xr(t)).elements;return e.enumerated=$n(n),n},ki=(e,t)=>{if(typeof e!=`object`||or(e))return N(e).elements.some(t);let n=Wi.sets;n?.push(e),Ei(e);let r=Pi(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},Ai=e=>{let t=[];return ki(e,e=>(t.push(e),!1)),t},ji=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,Mi=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(Mi);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(Mi)&&e.range.every(Mi);case`SetOperation`:return e.operator!==`\\cup`&&Mi(e.left)&&Mi(e.right);case`FilteredSet`:return Mi(e.base);case`ProductSet`:return e.factors.every(Mi);default:return!1}},Ni=e=>typeof e!=`object`||or(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?Ni(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||Ni(e.left)||Ni(e.right):ji(e)?.some(Ni)??!1,Pi=(e,t)=>{if(e.kind===`Union`)return _i(e,Ai).some((n,r)=>ki(vi(n,r,e),t));if(e.kind===`FilteredSet`&&hi(e.base))return ki(e.base,n=>e.test(n,!1)&&t(n));if(ji(e)?.some(Ni))return Ti(e,Ai).some(t);if(e.kind!==`SetOperation`)return N(e).elements.some(t);if(e.operator===`\\cup`)return!hi(e.left)||!hi(e.right)?N(e).elements.some(t):ki(e.left,t)||ki(e.right,t);let n=e.operator===`\\`||hi(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return hi(r)?ki(r,n=>qi(n,i)===(e.operator===`\\cap`)&&t(n)):N(e).elements.some(t)},P=e=>{if(typeof e!=`object`||!j(e))throw new _(`Shouldn't call isEmpty() on value ${I(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new _(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(P);case`RecordSet`:return e.sets.some(P);case`FunctionSet`:return!P(e.domain)&&P(e.range);case`Union`:return _i(e).every((t,n)=>P(vi(t,n,e)));default:return N(e).elements.length===0}},Fi=(e,t,n)=>e.reduce((e,r)=>{let i=e*Li(r,t);if(i>2147483647)throw new _(n());return i},1),Ii=e=>`Overflow when computing the number of elements in:\n${I(e)}`,Li=(e,t)=>{if(typeof e!=`object`)throw new _(`Attempted to compute the number of elements in the ${fn(e)} ${I(e)}.`);switch(e.kind){case`ModelValue`:throw new _(`Attempted to compute the number of elements in the model value ${I(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return Li(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new _(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new _(`Attempted to compute the number of elements in the overridden value ${I(e)}.`);case`Subset`:{let n=Li(e.base,t);if(n>=31)throw new _(Ii(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(P(e.domain))return 1;if(P(e.range))return 0;if(Li(e.range,t)===1)return 1}let n=Li(e.domain,t),r=Li(e.range,t);if(r<=1)return n===0?1:r;let i={value:1};for(let t=0;t<n;t++)if(i.value*=r,i.value>2147483647)throw new _(Ii(e));return i.value}case`RecordSet`:return t!==`1.7.4`&&P(e)?0:Fi(e.sets,t,()=>Ii(e));case`ProductSet`:return t!==`1.7.4`&&P(e)?0:Fi(e.factors,t,()=>`Overflow when computing the number of elements in ${I(e)}`);default:return ur(e),N(e).elements.length}},Ri=e=>`Attempted to check if the set ${I(e)}is finite.`,zi=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new _(`Attempted to check if the ${fn(e)} ${I(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new _(`Attempted to check if the function:\n${I(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return zi(e.base)&&P(e.base);case`Subset`:return zi(e.base);case`FunctionSet`:{let t=zi(e.domain);if(t&&P(e.domain))return!0;let n=zi(e.range);return n&&P(e.range)?!0:n&&(t||Li(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n={isAllFinite:!0};for(let e of t)if(!zi(e))n.isAllFinite=!1;else if(P(e))return!0;return n.isAllFinite}case`Union`:if(!hi(e.base))throw new _(`Attempted to check if the nonenumerable set:\n${gi(e)}\nis a finite set.`);return N(e.base).elements.every(zi);case`SetOperation`:if(e.operator===`\\cup`)return zi(e.left)&&zi(e.right);if(e.operator===`\\cap`){if(!zi(e.left)&&!zi(e.right))throw new _(Ri(e));return!0}if(zi(e.left))return!0;if(!zi(e.right))throw new _(Ri(e));return!1;case`FilteredSet`:if(!zi(e.base))throw new _(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${I(e.base)}\nis finite.`);return!0}},Bi=(e,t,n=Jn)=>{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},Vi=(e,t)=>{let n=e.elements;if(n.length>nn())throw new s(rn());let r=Array.from({length:n.length},()=>!1),i=t.filter(e=>{let t=Bi(n,e);return!r[t]&&(r[t]=!0,!0)}),a=$n(n);return i.some((e,t)=>e!==n[t])&&(a.writtenElements=i),a},Hi=e=>{if(typeof e!=`object`||!ln(e))return;if(e.kind===`LazyFunction`&&(!j(e.domain)||Vn(e.domain)))throw new _(`To convert a function of form [x \\in S |-> f(x)] to a tuple, the set S must be enumerable.`);let t=F(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Ui=(e,t)=>{let n=`Attempted to check if the value:\n${I(e)}\nis an element of the`;if(!ln(t))return`${n} ${fn(t)} ${I(t)}`;let r=ir(t);return r===`record`?`Attempted to check if element:\n${I(e)}\nis in the record:\n${I(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${I(t)}`},Wi={sets:void 0},Gi=(e,t,n,r)=>{let i=Wi.sets,a=Wi.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof _))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},Ki=e=>(Wi.sets??[]).slice(e).some(e=>typeof e==`object`&&Wi.callStack?.sources.has(e)===!0),qi=(e,t)=>{let n=Wi.sets;if(n===void 0)return Qi(e,t);n.push(t);let r=Qi(e,t);return n.pop(),r},Ji=(e,t)=>{let n=t.elements,r={low:0,high:n.length-1};for(;r.low<=r.high;){let t=r.low+r.high>>1,i=n[t];if(typeof i!=`number`)return;if(i===e)return!0;i<e?r.low=t+1:r.high=t-1}return!1},Yi=(e,t)=>Bi(t.elements,e)!==-1,Xi=(e,t)=>t.isNormalized?Vr(e,t.elements).isFound:Hr(e,Ur(t)),Zi=(e,t)=>{if(e.type!==void 0)throw new _(`Attempted to check if the typed model value ${A(I(e))} is an element of\n${A(I(t))}`);return!1},Qi=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return Ji(e,t)??$i(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return $i(e,t)},$i=(e,t)=>{if(!j(t))throw new _(Ui(e,t));switch(t.kind){case`Set`:return ur(e),Gi(Yi,Xi,e,t);case`MixedSet`:return Hr(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&(!un(e)||e.type!==void 0))throw new _(`Attempted to check if the value:\n${I(e)}\nis in the integer interval ${I(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(un(e))return Zi(e,t);if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new c(`Attempted to check if the value:\n${I(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!j(e)||Vn(e))throw new _(`Attempted to check if the non-enumerable value\n${A(I(e))}\nis element of\n${A(I(t))}`);return N(e).elements.every(e=>qi(e,t.base));case`FunctionSet`:{if(!ln(e)){if(un(e))return Zi(e,t);throw new _(`Attempted to check if \n${I(e)}\nwhich is not a TLC function value, is in the set of functions:\n${A(I(t))}`)}let n=F(e),r=vr(e,n.domain);return(r===void 0?Kr(t.domain,$n(n.domain)):Kr({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>qi(e,t.range))}case`RecordSet`:{let n=ln(e)?F(e):void 0;if(!n||!xn(n.domain)){if(un(e))return Zi(e,t);throw new _(`Attempted to check if non-record\n${I(e)}\nis in the set of records:\n${I(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=Bi(n.domain,e);return i!==-1&&qi(n.range[i],t.sets[r])})}case`ProductSet`:{let n=ln(e)?Hi(e):void 0;if(n===void 0){let n=ln(e)&&F(e).domain.every(e=>typeof e==`number`);if(un(e))return Zi(e,t);if(n)return!1;throw new _(`Attempted to check if non-tuple\n${I(e)}\nis in the set of tuples:\n${I(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>qi(e,t.factors[n]))}case`FilteredSet`:try{return qi(e,t.base)&&t.test(e,!0)}catch(n){throw!(n instanceof _)||!Nt(n)?n:new _(`Cannot decide if element:\n${A(I(e))}\n is element of:\n${A(I(t.base))}\nand satisfies the predicate ${t.source?.predicate}`)}case`Union`:{if(!hi(t.base))throw new _(`Attempted to check if:\n ${I(e)}\nis an element of the non-enumerable set:\n ${gi(t)}`);let n=N(t.base).elements;return n.length>1&&n.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),n.some(t=>qi(e,t))}case`SetOperation`:return t.operator===`\\cup`?qi(e,t.left)||qi(e,t.right):qi(e,t.left)&&qi(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Hi(e);if(n===void 0){if(un(e))return Zi(e,t);throw new c(`Attempted to check if the value:\n${A(I(e))}\nis an element of ${A(I(t))}.`)}return n.every(e=>qi(e,t.base))}default:throw new _(Ui(e,t))}},ea=(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?qi(e,n):e.range.every((e,r)=>ea(e,t.range[r],n.range)),F=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return e.enumerated;if(M(e.domain)||Li(e.domain),!j(e.domain))throw new _(`The domains of formal parameters must be enumerable.`);let t=ui(e.domain);return e.enumerated=rr(tr(t,t.map(t=>e.apply(t))),ir(e)),e.enumerated}throw new _(`Expected a function but found ${I(e)}`)},ta=(e,t,n)=>{let r=A(I(e)),i=A(I(t)),a=n===`1.7.4`;switch(ir(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.`}},na=(e,t)=>{if(!jn.is174)return ta(e,t);let n=A(I(t));return ir(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},ra=(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},ia=e=>new _(`Attempted to apply function with integer domain to the non-integer argument ${A(I(e))}`),aa=(e,t)=>Bi(e.domain,t),oa=(e,t,n)=>{let r=gn(e);throw jn.is174||r!==e.domain||r.length<32?r.forEach(e=>Rr(e,t)):Bi(r,t,Nr),n},sa=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=ir(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new _(n(e,t));if(a===void 0&&!jn.is174&&typeof t!=`number`&&li(r))throw ia(t)}let i=ra(r,t);return i===-1?Gi(aa,oa,e,t):i},ca=(e,t,n)=>{let r=e.domain,i=Hi(n),a=(t,n,r)=>`In applying the function\n${A(I(e))},\nthe ${t} is:\n${A(I(n))}\nwhich ${r}.\n`,o=()=>new _(a(`argument list`,n,`does not match its formal parameter`));if(i===void 0)throw o();if(typeof r!=`object`||r.kind!==`ProductSet`)throw new _(`Attempted to apply a function to ${I(n)}, which is not in its domain`);if(t.forEach((e,t)=>{if(t>=i.length)throw o();let n=i[t],s=`argument number ${t+1}`;if(!qi(n,r.factors[t]))throw new _(a(s,n,e===void 0?`is not in the function's domain ${I(r)}`:`is not in its domain`));if(e!==void 0&&Hi(n)?.length!==e)throw new _(a(s,n,`does not match its formal parameter`))}),i.length>t.length)throw o()},la=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!qi(t,e.lambdaDomain),ua=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return ua(e.enumerated,t,n);let r=e.boundTupleLengths;if(r!==void 0)return ca(e,r,t),e.apply(t);if(!qi(t,e.domain))throw new _(ir(e)===`lambda`?ta(e,t):`Attempted to apply a function to ${I(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new _(`Attempted to apply ${I(e)}, which is not a function`);let r=n??ta;if(la(e,t))throw new _(r(e,t));let i=sa(e,t,r);if(i===-1)throw new _(r(e,t));return e.range[i]},da=e=>li(e)?oi.get(e)??di(e.length):void 0,fa=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=F(e);if(t.functionClass===`lambda`&&t.lambdaDomain)return t.lambdaDomain;let n=da(t.domain);if(n)return n;let r=$n(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},pa=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||e.enumerated===void 0)){if(!qi(t,e.domain))return e;let r=n(e.apply(t));return rr({kind:`LazyFunction`,domain:e.domain,apply:n=>Kr(t,n)?r:e.apply(n),source:e.source,boundTupleLengths:e.boundTupleLengths},ir(e))}if(!ln(e))throw new _(`Attempted to apply EXCEPT construct to the value ${A(I(e))}.`);let i=F(e);if(la(i,t))return i;let a=sa(i,t,na);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=rr(tr(i.domain,o),ir(i));if(l.writtenKeys=i.writtenKeys,l.lambdaDomain=i.lambdaDomain,i.hash!==0&&i.hash!==ya){let e=wa(c);if(e!==ya){let t=wa(i.domain[a]);l.hash=s===c?i.hash:i.hash-va(t,wa(s))+va(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Oa(e,s)+Oa(e,c)|0}return l},ma=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},ha=(e,t)=>Math.imul(e^t,16777619),ga=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return ma(t)},_a=e=>ma(e+2654435769|0),va=(e,t)=>ma(Math.imul(e,668265261)+t|0),ya=795548749,ba=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=wa(t[e]);if(r===ya)return ya;n=n+_a(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=wa(e.domain[n]),i=wa(e.range[n]);if(r===ya||i===ya)return ya;t=t+va(r,i)|0}return t},xa=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new _(`TLC has found a state in which the value of a variable contains ${I(e)}`);if(j(e)){N(e).elements.forEach(xa);return}let t=F(e);t.domain.forEach(xa),t.range.forEach(xa)},Sa=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{wa(e)===ya&&xa(e);return}catch(e){if(!(e instanceof _))throw e;return e}},Ca=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[]}},wa=e=>typeof e==`number`?ma(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?ga(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=ba(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?M(e.domain)?wa(F(e)):ya:M(e)?wa(N(e)):ya,Ta=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Ea=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Ta(t)},Da=e=>Ta(Aa(e)+2135587861|0),Oa=(e,t)=>Ta(Math.imul(Aa(e),374761393)+Aa(t)|0),ka=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Da(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Oa(e.domain[n],e.range[n])|0;return t},Aa=e=>typeof e==`number`?Ta(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?Ea(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=ka(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?Aa(F(e)):M(e)?Aa(N(e)):Ea(ja(e)),ja=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):Ma(e),Ma=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${ja(e.base)}>`;if(e.kind===`FilteredSet`&&!M(e))throw new _(`Attempted to compare the non-enumerable set ${I(e)} with another value`);if(j(e))return M(e)?`{${N(e).elements.map(ja).join(`,`)}}`:`<${e.kind} ${I(e)}>`;let t=F(e);return`(${t.domain.map((e,n)=>`${ja(e)}:${ja(t.range[n])}`).join(`,`)})`},Na={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},Pa=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>Na[e])}"`,Fa=1999,Ia=e=>e.reduce((e,t)=>e===0?0:e*Li(t),1),La=e=>{if(e.kind===`Subset`)return Li(e.base)<=6?N(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return N(e);if(e.kind===`FunctionSet`){let t=P(e.domain)?0:Li(e.domain);return(t===0?1:Li(e.range)**t)<=Fa?N(e):void 0}return Ia(e.kind===`RecordSet`?e.sets:e.factors)<=Fa?N(e):void 0},Ra=(e,t)=>{if(t||e.kind===`Union`||e.kind===`Subset`&&ln(e.base)&&(e.base.kind===`Function`||M(e.base.domain)))return La(e);if(M(e))try{return La(e)}catch(e){if(e instanceof _)return;throw e}},za=(e,t)=>{let n=e=>I(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 gi(e,t)}},Ba=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Va=e=>{if(M(e.domain))try{return F(e)}catch(e){if(e instanceof _||ne(e))return;throw e}},Ha=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),N(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=>I(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1})}},I=(e,t=!1,n=!1)=>{let r=e=>I(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Pa(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(N(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=Mn.isExpanded?Ra(e,t):void 0;return n?r(n):za(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?Mn.isExpanded||!e.source?Va(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 ${I(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&jn.is174&&ir(e)!==`tuple`)return`<< >>`;let a=r=>I(r,t,n&&ir(e)!==`lambda`);if(i.domain.length===0&&ir(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]]):vn(i);return ir(e)===`record`||i.domain.every(e=>typeof e==`string`&&Ba(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},Ua=(e,t)=>{if(e===void 0)return!1;try{return fr(e,t)}catch(e){if(e instanceof _)return!1;throw e}},Wa=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,Ga=e=>Array.from({length:e.length},(t,n)=>e.charCodeAt(n)).reduce((e,t)=>Math.imul(e,31)+t|0,0),Ka=(e,t)=>{let n={next:0,last:-1},r={value:!0},i=e.replace(Wa,(e,i,a=``,o,s,c=``)=>{let l=e=>a.includes(`-`)?e.padEnd(Number(o)):e.padStart(Number(o??0)),u=a.includes(`<`),d=a.replace(`<`,``);if(c===`n`&&e===`%n`)return`
|
|
74
|
+
`;if(c===`%`&&s===void 0&&/^-?$/.test(d))return d===`-`&&o===void 0&&(r.value=!1),l(`%`);let f=u?n.last:i===void 0?n.next++:Number(i.slice(0,-1))-1;n.last=f;let p=t[f];if(!`sSbBhH`.includes(c)||c===``||!/^-?$/.test(d)||d===`-`&&o===void 0||p===void 0)return r.value=!1,e;let m=c.toLowerCase(),h=m===`s`?p:m===`b`?`true`:(Ga(p)>>>0).toString(16),ee=l(s===void 0?h:h.slice(0,Number(s.slice(1))));return c===m?ee:ee.toUpperCase()});return r.value?i:void 0},qa=(e,t)=>{let n=t?void 0:Pn.get(e);if(n)return n();let r=Object.entries(e),i=In.get(e),a=i!==void 0&&`_format`in e,o=a?e._format:r.length===1?`%s = %s
|
|
75
|
+
`:`/\\ %s = %s
|
|
76
|
+
`;if(typeof o!=`string`)throw new v(`The _format field of the ALIAS ${i} is ${I(o)}, but it must be a string.`);return r.filter(([e])=>!(a&&e===`_format`)).filter(([e,n])=>!t||!Ua(t[e],n)).map(([e,t])=>{let n=Ka(o,[e,A(I(t))]);if(n===void 0)throw new v(`The _format field of the ALIAS ${i} is ${I(o)}, but it must format two strings, the name and the value of a field.`);return n}).join(``)},Ja=[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],Ya={polynomial:Ja[0]},Xa=()=>Ya.polynomial,Za=/* @__PURE__ */ new Int32Array(256),Qa=/* @__PURE__ */ new Int32Array(256),$a=/* @__PURE__ */ new Int32Array(256),eo=/* @__PURE__ */ new Int32Array(256),to=/* @__PURE__ */ new Int32Array(256),no=/* @__PURE__ */ new Int32Array(256),ro=/* @__PURE__ */ new Int32Array(256),io=/* @__PURE__ */ new Int32Array(256),ao={high:0,low:0};let oo=0,so=0;const co=e=>{let t=(e^so)&255;so=(so>>>8|oo<<24)^to[t],oo=oo>>>8^Za[t]},lo=e=>{let t=Ja[e];Ya.polynomial=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);Za[e]=Number(BigInt.asIntN(32,t>>32n)),to[e]=Number(BigInt.asIntN(32,t))}let i=[Za,Qa,$a,eo],a=[to,no,ro,io];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)^to[o],i[e][r]=t[r]>>>8^Za[o]}}ao.high=Number(BigInt.asIntN(32,t>>32n)),ao.low=Number(BigInt.asIntN(32,t))};lo(0);const uo=e=>{let t=so^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;so=oo^io[n]^ro[r]^no[i]^to[a],oo=eo[n]^$a[r]^Qa[i]^Za[a]},fo=e=>{if(typeof e==`boolean`)return co(0),co(e?116:102),2;if(typeof e==`number`)return co(1),uo(e),5;if(typeof e==`string`){co(3),uo(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)uo(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++)co(e.charCodeAt(n));return 5+e.length}return co(21),uo(zn(e.name)+1),5},po=e=>{if(typeof e!=`object`||un(e))fo(e);else if(ln(e)){let t=F(e);co(9),uo(t.domain.length);for(let e=0;e<t.domain.length;e++)po(t.domain[e]),po(t.range[e])}else{let t=N(e).elements;co(5),uo(t.length);for(let e of t)po(e)}},mo=e=>{let t={high:oo,low:so};oo=ao.high,so=ao.low;for(let t of e)po(t);let n=BigInt(oo>>>0)<<32n|BigInt(so>>>0);return oo=t.high,so=t.low,n},ho=(e,t)=>{let n=new BigInt64Array(e.length),r=new Int32Array(n.buffer),i=oo,a=so;return e.forEach((e,n)=>{oo=ao.high,so=ao.low;for(let n of t)po(e[n]);r[2*n]=so,r[2*n+1]=oo}),oo=i,so=a,n},go=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),_o=1024,vo=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*_o),relations:[]}),yo=(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},bo=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,xo=(e,t,n,r,i)=>{let a=t===`next`?bo(e,t,r):void 0;if(a!==void 0)return a;let o=yo(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},So=(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,Co=(e,t,n)=>{let r=e===void 0?void 0:n.definitions.get(e),i=r?.kind===`Operator`?r.head:void 0,a=t.location.range;return!r||!i?`Action ${a?h(a):`Unknown location`}`:So(r.body.location.range,a)||!a?`${r.name} ${h(i)}`:`${r.name} ${h(i)} (${a.start.line} ${a.start.column} ${a.end.line} ${a.end.column})`},wo=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,To=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,Eo=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},Do=e=>Array.from({length:e.length},(t,n)=>e.charCodeAt(n)).reduce((e,t)=>Math.imul(e,31)+t|0,0)&2147483647,Oo=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[Do(t.name)%e.length].unshift(t));t=e}t[Do(e.name)%t.length].unshift(e)}),t.toReversed().flat()},ko=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),Ao=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),jo=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),Mo=(e,t,n)=>{let r=new Set(n.map(wo)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(k(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&&!go.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=yo(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(wo(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`?jo(t.bounds):t.params.map(e=>e.name);m(t.body,Ao(n,e.scope)),t.kind===`Function`&&ko(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,Ao(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,Ao(e.params,t));return;case`Lambda`:m(e.body,Ao(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)}),Oo(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,To(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,Eo(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,To(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,Ao(jo(e.bounds),t)),r(ko(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,Ao(jo(e.bounds),t)),r(ko(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,Ao(jo([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,Ao(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,Ao(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()})},No=(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=No(e,r,n);if(t!==-1)return t}}return-1},Po=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=No(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:No(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},Fo=(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}},Lo=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},Ro=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},zo=(e,t)=>t.forEach((t,n)=>{let r=mo([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*_o+i;e.registers[o]=Math.max(e.registers[o],Ro(a)+1)}),Bo=(e,t)=>{let n=e.registers.subarray(t*_o,(t+1)*_o),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*_o*_o/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*_o?a===0?i:_o*Math.log(_o/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},Vo=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},Ho=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>Vo(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},Uo=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},Wo=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],Go=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},Ko=(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}},qo=(e,t)=>{let n=[],r=/* @__PURE__ */ new Map,i=t=>{let n=[],a={primary:e.primary[t],secondary:e.secondary[t]};return(a.primary>0||a.secondary>0||Wo(e,t))&&Uo(n,a),Go(e,t).forEach(e=>i(e).forEach(e=>Uo(n,e))),r.set(t,n),n},a=(t,r,i,a)=>{let o=e.ranges[t];n.push({location:o?h(o):`Unknown location`,depth:r,count:i,cost:a})},o=(t,n)=>a(t,n,e.primary[t],e.secondary[t]),s=(t,n)=>{let c=Go(e,t),l=[];c.forEach(e=>(r.get(e)??i(e)).forEach(e=>Uo(l,e)));let u={primary:e.primary[t],secondary:e.secondary[t]},d=Wo(e,t),f=e=>c.forEach(t=>s(t,e));if(e.isUnchanged[t]){let e=l.filter(e=>e.primary!==0||e.secondary!==0);e.length===0?o(t,n):a(t,n,Math.max(u.primary,Ho(e).primary),0);return}if(l.length===0){(u.primary!==0||d)&&o(t,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let e=l[0],r=e.primary===0&&e.secondary===0;if(e.primary<u.primary){o(t,n),f(n+1);return}if(!d&&p&&!r){a(t,n,e.primary,e.secondary);return}if(p&&r){d&&o(t,n),f(d?n+1:n);return}if(u.primary===e.primary&&u.secondary===e.secondary){o(t,n);return}}let m=!p||d;m&&o(t,n),f(m?n+1:n)};return Go(e,t).forEach(e=>{i(e),s(e,0)}),n},Jo=[`init`,`next`,`invariant`,`constraint`,`implied`],Yo=(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,Xo=e=>Jo.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>Yo(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||Yo(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),Zo=(e,t,n,r)=>({variables:r.map(r=>{let i=n[r]?.range;return{label:`${t.variables[r]} ${i?h(i):`Unknown location`}`,distinct:Bo(e,r)}}),relations:Xo(e).map(t=>({kind:t.kind,label:t.label,...Ko(e,t),expressions:qo(e,t.node)}))}),Qo=(e,t,n)=>{let r=bo(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]]]},$o=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),es=(e,t)=>$o.has(e)?new _(t):new c(t),ts=(e,t,n,r)=>new c(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${I(r)}`),ns=(e,t,n=e)=>{if(!j(e)||Vn(e))throw new c(`Applying ${t} to the following value,\nwhich is not a finite set:\n${I(n)}`);return N(e)},rs=e=>typeof e==`object`&&e.kind===`Operator`,L=(e,t,n)=>{let r=e[t];if(r===void 0||rs(r))throw es(n,`${n} expects a value as argument ${t+1}`);return r},is=(e,t,n)=>{let r=L(e,t,n);if(typeof r!=`boolean`)throw es(n,`${n} expects a boolean but received ${I(r)}`);return r},as=(e,t,n)=>{let r=e[t];if(r===void 0||!rs(r))throw es(n,`${n} expects an operator as argument ${t+1}`);return r},os=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),R=(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}),ss=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),cs=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),ls=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(L(n,0,e),L(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),us=e=>e>2147483647||e<-2147483648,ds=e=>new c(`Overflow when computing ${e}`),fs={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`},ps={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},ms={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`},hs={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},gs=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return ps[e.operator];if(e.kind!==`Function`)return fs[e.kind];let t=ir(e);return t===void 0?`FcnRcdValue`:hs[t]},_s=e=>ms[gs(e)],vs=(e,t)=>`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`,ys=(e,t)=>new _(vs(e,t)),bs=(e,t)=>{let n=n=>(...r)=>{let i=Wi.sets?.length??0;try{return n(...r)}catch(n){if(!(n instanceof _)||n instanceof se)throw n;let r=Ki(i);throw Wi.sets&&(Wi.sets.length=i),e.isLazy!==!0&&n instanceof c&&!r?n:e.isLazy!==!0&&n instanceof ie?new c(vs(t,n.message)):ys(t,n.message)}},r=n(e.evaluate);return{...e,evaluate:(n,i)=>{if(n.length!==e.arity)throw ys(t,`array is not of length ${e.arity}`);return r(n,i)},evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},xs=(e,t)=>{if(typeof e!=`number`)throw ys(t,`Cannot cast tlc2.value.impl.${gs(e)} to tlc2.value.impl.IntValue`);return e},Ss=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Cs=(e,t,n,r)=>{let i=Ss(e,n,`IntValue`,2);return ls(t,(e,n)=>{let a=xs(n,i),o=xs(e,i),s=r(o,a);if(us(s))throw ds(`${o}${t}${a}`);return s})},ws=(e,t,n)=>{if(typeof e!=`number`)throw new c(`The ${t} argument of ${n} should be an integer, but instead it is:\n${I(e)}`);return e},Ts=(e,t,n=e)=>ls(e,(e,r)=>t(ws(e,`first`,n),ws(r,`second`,n))),Es=(e,t,n)=>({...cs(e,t,n),isLazy:!0}),Ds=(e,t,n)=>{let r=as(e,t,n);return()=>r.call([])},Os=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),ks=()=>({implication:ng,negate:rg,equivalent:ig,body:ag,condition:(e,t)=>{if(typeof e!=`boolean`)throw zh(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw Bh(t,n,e);return e},apply:ua,expectFunction:Qh,tuple:fi,set:Xr,record:mi,writtenRecord:yn,equal:fr,enumerate:fg,choiceElements:L_,noChoice:e=>{throw R_(e)},filterPredicate:I_,isReducible:cn,finiteElements:e=>N(e).elements,addBounded:an,normalizedSet:er,isBeyondBound:on,cardinality:Li,functionDomain:ui,sortedFunction:tr,unassigned:(e,t)=>{throw qh(e,t)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:$h,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>Xh(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let As,js;const Ms=()=>{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}`),Ps=e=>`local${e.counter++}`,Fs=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),gt(e).forEach(e=>Fs(e,t)),t),Is=(e,t,n)=>{let r=Fs(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(`, `)}])`},Ls=(e,t,n)=>`${Ns(e,H(t,e.environment))}(${Is(e,t,n)})`,Rs=(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})`},zs=(e,t,n,r)=>{let i=Ps(e),a=Ps(e),o=Ps(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} }`},Bs=(e,t,n)=>{let r=t.kind===`Forall`;return Rs(e,n,n=>{let i=t.bounds.map(()=>Ps(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(${qs(e,r.set,n)}, ${Ns(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=Ps(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${qs(e,t.body,n)}, ${Ns(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>zs(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},Vs=(e,t,n,r,i)=>Rs(e,i,i=>{let a=Ps(e),o=Ps(e),s=Ns(e,t),c=`choiceElements(${qs(e,n,i)}, ${s}, ${Ns(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${qs(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${zs(e,a,o,l)} return noChoice(${s});`}),Hs=(e,t,n,r)=>Rs(e,r,r=>{let i=Ps(e),a=Ps(e),o=Ps(e),s=Ps(e),c=Ns(e,t),l=`if (!isReducible(${i})) return ${Ns(e,F_(t,e.environment))}(${i}, ${Is(e,t,r)});`,u=qs(e,t.bound.set,r);r.locals.set(n,s);let d=`if (filterPredicate(${qs(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${zs(e,a,s,d)} return normalizedSet(${o});`}),Us=(e,t,n,r)=>Rs(e,r,r=>{let i=Ps(e),a=Ps(e),o=Ps(e),s=Ps(e),c=Ps(e),l=Ps(e),u=Ns(e,M_(t,e.environment)),d=Is(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=qs(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${qs(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} = []; ${zs(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),Ws=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=qs(e,r[0],n),a=qs(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(${qs(e,r[0],n)}, ${Ns(e,t)})`;if(t.operator===`<=>`)return`equivalent(${qs(e,r[0],n)}, ${qs(e,r[1],n)}, ${Ns(e,t)})`;if(k(t))return Ls(e,t,n);let i=zg(t.operator,e.environment);if(i?.kind!==`Builtin`)return Ls(e,t,n);if(i.name===`DOMAIN`)return`${Ns(e,Uh(t))}(${qs(e,r[0],n)})`;if(i.name===`TLCEval`)return Ls(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Ns(e,Wh(t,i))}(${qs(e,r[0],n)}, ${qs(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&v_(r[0],a))return`${Ns(e,i.evaluateUnary)}(${qs(e,r[0],n)})`;let o=r.length===2&&v_(r[0],a)&&v_(r[1],a);return i.evaluateBinary&&o?`${Ns(e,i.evaluateBinary)}(${qs(e,r[0],n)}, ${qs(e,r[1],n)})`:Ls(e,t,n)},Gs=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(k(e))return!1;let r=Xg(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Gs(e.expression,t,n);case`FieldAccess`:return Gs(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Gs(e,t,n));default:return!1}},Ks=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Ks(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Ks);default:return!1}},qs=(e,t,n)=>{let r=(t,r=n)=>qs(e,t,r);switch(t.kind){case`Number`:return pn(t.value)?String(t.value):Ls(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(k(t))return Ls(e,t,n);let i=Xg(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):Ls(e,t,n)}case`Apply`:return Ws(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`:{D_(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Gs(t.function,n,e.environment)?r(t.function):Ks(t.function)?r(t.function,i):Ls(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Ns(e,t)}))`,o=Hh(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,Vh(t))}(${r(t.record)})`;case`Record`:{let i=B_(t.fields);if(V_(i))return Ls(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?Ls(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`)?Bs(e,t,n):Ls(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?Vs(e,t,t.set,t.pattern.name,n):Ls(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!j_(t)?Us(e,t,r.pattern.name,n):Ls(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?Hs(e,t,t.bound.pattern.name,n):Ls(e,t,n);default:return Ls(e,t,n)}},Js=(e,t)=>{if(!Os.has(e.kind)||(js??=Ms(),!js))return;let n={environment:t,references:[],helpers:[],counter:0},r=qs(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 As??=ks(),Function(...Object.keys(As),...i,a)(...Object.values(As),...n.references)},Ys={kind:`Local`},Xs=/* @__PURE__ */ new WeakSet,Zs=/* @__PURE__ */ new WeakMap,Qs=/* @__PURE__ */ new WeakMap,$s=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ec=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),tc=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,nc=e=>e.kind===`Operator`?e.params.length:0,rc=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],ic=e=>e.name.includes(`!`),ac=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},oc=(e,t,n)=>{let r=t.bindings.get(e);return r&&tc(r.position,t.location)&&(!n||tc(r.position,n.start))?r:void 0},sc=(e,t)=>e!==void 0&&t!==void 0&&h(e)===h(t),cc=(e,t,n,r)=>{if(t===void 0)return!0;if(sc(t.range,n.range))return!1;let i=n.range;if(i===void 0||r.isGenerated||t.kind!==`Builtin`&&!t.range)return!0;let a=h(i),o=t.range&&h(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${e} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${e}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${e}. \nThis duplicates the one at ${o}.`}),!1},lc=(e,t,n,r)=>cc(t,ac(e,t)??oc(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,uc=(e,t,n)=>{cc(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},dc=(e,t,n,r)=>t.reduce((e,t,i)=>lc(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),fc=(e,t,n)=>t.reduce((e,t)=>lc(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),pc=e=>e.kind===`Name`?[e.name]:e.names,mc=e=>e.flatMap(e=>pc(e.pattern)),hc=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||tc(n.location,t.location))?n:void 0},gc=(e,t)=>{let n=hc(e,t);return n?{key:t.getKey(n),arity:nc(n),params:rc(n),kind:`Definition`}:t.imported.get(e)},_c=(e,t,n)=>ac(t,e)??gc(e,n),vc=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),yc=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:vc(e.location,e.spelling??t)},bc=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return tc(e.location,e.args[0].location)?`prefix`:`postfix`}},xc=e=>!/^[\p{L}\d_]/u.test(e),Sc=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Cc=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,wc=(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])}})},Tc=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?wc(e.name,[],void 0):wc(e.operator,e.args,e.argumentCounts),Ec=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Dc=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:mc(e.bounds),body:e.body,sets:Ec(e.bounds)};case`SetMap`:return{names:mc(e.bounds),body:e.expression,sets:Ec(e.bounds)};case`SetFilter`:return{names:pc(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:pc(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}},Oc=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}},kc=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Ac=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),jc=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?jc(e.body,t):gt(e).reduce((e,n)=>e??jc(n,t),void 0)},Mc=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??Mc(i,t,n||Ac(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&jc(e.set,t):jc(e,t)},Nc=e=>e.kind===`Label`?Nc(e.body):e,Pc=e=>typeof e==`number`?`argument selector ${e}`:e,Fc=`within the scope of a declaration
|
|
78
|
+
from outside that declaration's scope.`,Ic=(e,t,n,r,i,a)=>{let o=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:h(r),message:n})},s=n.isSuffices===n.isInProof,c=n.statement,l={node:c,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,u=l.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return u.kind!==`NewSymbol`&&u.kind!==`AssumeProve`&&Nc(u).kind===`Let`?void 0:o(a-1,`A name selector here must be from a LET clause.`);let e=c.kind===`AssumeProve`?[...c.assumptions,c.conclusion]:[c],r=a===1?e.map((e,t)=>({position:t,label:Mc(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?jc(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&Ac(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${Fc}`);if(n.args.length!==r.label.params.length)return o(a,`Label \`${n.name}' used with wrong number of arguments.`);l.node=r.label,l.isGoal=!1,l.isSufficesOpen=!1;continue}if(n.kind!==`Operand`)return;let d=Pc(n.operand);if(l.isSufficesOpen){if(Cc(n.operand,1)!==0)return o(a,u.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);l.isSufficesOpen=!1;continue}if(u.kind===`NewSymbol`)return;if(u.kind!==`AssumeProve`){let e=Nc(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?_c(e.name,r,i)?.kind:void 0;if(t===`Variable`||t?.startsWith(`New`))return o(a,`Choosing operand \`${d}' of subexpression with no operands.`);let s=Dc(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:Oc(e);if(!c)return;let f=Cc(n.operand,c.length);if(f===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);l.node=c[f],l.isGoal=!1;continue}let f=[...u.assumptions,u.conclusion],p=Cc(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(Ac(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${Fc}`);let m=f[p];if(m.kind===`NewSymbol`&&a!==t.length-1)return o(a,`Selected a subexpression of a NEW clause of an ASSUME.`);l.node=m,l.isGoal=!1}a||(l.node.kind===`AssumeProve`&&o(void 0,`Selected ASSUME/PROVE instead of expression.`),l.node.kind===`NewSymbol`&&o(void 0,`Selected a NEW declaration as an expression or operator.`))},Lc=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:h(e.location.range),message:n}),!0)},Rc=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=h(r),a=e.params.filter((r,i)=>{let a=ac(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:h(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},zc=(e,t,n,r)=>{if(!kc(e))return!1;let i=Tc(e),a=i[0],o=i.length>1&&a.kind===`Name`?ac(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&Ic(e,i,o,t,n,r),o!==void 0},Bc=(e,t,n,r)=>{let i=e.location;if(Xc(e,n,r))return;let a=Qs.get(e);if(a!==void 0)return a;if($s(t))return e.kind===`Apply`?e.args.length:0;let o=ac(n,t);if(o?.isNonFact){r.errors.push({location:h(yc(e,t)),message:`Step number of non-expression step used as an expression.`});return}if(zc(e,n,r,!1)||Sc(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=Ys),o)return o.arity;let s=gc(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Qs.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(ac(n,c)!==void 0||gc(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=(e.kind===`Identifier`?void 0:e.spelling)??t,u=h(e.kind===`Apply`&&l===`-.`?vc(i,`-`):yc(e,t));if(!xc(t)||Sc(t)){r.errors.push({location:u,message:`Unknown operator: \`${t}'.`});return}r.errors.push({location:u,message:`Could not find declaration or definition of symbol '${l}'.`});let d=bc(e);d&&i.range&&r.errors.push({location:h(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},Vc=(e,t,n)=>(e.forEach(e=>z(e.set,t,n)),e.reduce((e,t)=>dc(e,pc(t.pattern),t.pattern.ranges,n),t)),Hc=(e,t)=>e.kind===`Identifier`&&e.name===t&&k(e)||gt(e).some(e=>Hc(e,t)),Uc=(e,t)=>{e.kind===`FunctionConstruction`&&Hc(e.body,t)&&(e.isRecursive=!0),gt(e).forEach(e=>Uc(e,t))},Wc=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?mc(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:h(o),message:e})},c=e.kind===`Function`?Vc(e.bounds,t,i):fc(t,e.params,i),l=ac(c,a)??oc(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${a} defined at wrong LET/IN level.`):l&&!u&&s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${a} already defined or declared.`),e.kind===`Function`?(z(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),Uc(e.body,a),e.isSelfReferential=Hc(e.body,a)):z(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:cc(a,ac(t,a)??oc(a,i,o),{kind:`Definition`,arity:nc(e),range:o},i)},Gc=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(ac(e,t.name)?.isPending)return e;let n={name:t.name,arity:nc(t),params:rc(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)=>nl(t,e,n),e)};return s(e.reduce((e,t)=>{let a=$s(t.name)?e:s(e,e=>!tc(t.location,e.location)),o={name:t.name,arity:nc(t),kind:`Definition`,range:t.location.range,parent:a};if(ic(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||$s(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return Wc(t,a,u,i)?{...o,params:rc(t)}:a},a),()=>!0)},Kc=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:ac(t,r)??oc(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},qc=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=Kc(e.kind===`Identifier`?e.name:e.operator,t,n),i=e.kind===`Apply`?e.argumentCounts?.[0]??0:0;if(!r||i===r.arity)return!1;let a=(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??e.location.range;return a&&n.errors.push({location:h(a),message:`The operator ${r.name} requires ${r.arity} arguments.`}),!0},Jc=(e,t,n)=>{if(qc(e,t,n))return;let r=e.operator,i=_c(r,t,n),a=Bc(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:h(e.argumentsRange??yc(e,r)),message:`The operator ${r} requires ${a-(Kc(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>Yc(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:h(e),message:t})};e.args.map((i,a)=>{let c=o[a]??0,l=i.location.range;if(c===0){if(i.kind===`Lambda`&&i.operator!==void 0)s(l,`The operator ${i.operator} requires 1 arguments.`);else if(i.kind===`Lambda`&&l)s(l,`LAMBDA expression used where an expression is required.`);else if(i.kind===`OperatorReference`){let e=Bc(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else z(i,t,n);return!0}if(i.kind===`Lambda`){z(i,t,n);let o=i.params.length===c;return!o&&Xs.has(i)?s(l,`Expected arity ${c} but found operator of arity ${i.params.length}.`):!o&&l&&i.operator===void 0&&s(e.selectorRanges?.at(-1)??yc(e,r),`Lambda expression with arity ${i.params.length} used as argument ${a+1} of operator \`${r}', \nbut an operator of arity ${c} is required.`),o}if(i.kind===`Subexpression`)return z(i,t,n),!0;if(i.kind===`Apply`&&i.argumentCounts?.at(-1)===0){let e=i.argumentCounts.findIndex(e=>e>0);return s(i.selectorRanges?.[e],`Selector \`${i.operator.split(`!`)[e]}' should not have argument(s).`),!1}if(i.kind!==`Identifier`&&i.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=i.kind===`Identifier`?i.name:i.operator,d=_c(u,t,n)?.params??[],f=Bc(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(yc(i,u),`Expected arity ${c} but found operator of arity ${f}.`),f===c&&d.every(e=>e===0)}).forEach((t,n)=>{t||s(e.location.range,`Argument number ${n+1} to operator '${r}' \nshould be a ${o[n]}-parameter operator.`)})},Yc=(e,t,n)=>{e.kind===`Identifier`?Bc(e,e.name,t,n):z(e,t,n)},Xc=(e,t,n)=>{let r=Zs.get(e);return r?(r.args.forEach(e=>Yc(e,t,n)),n.errors.push(r.error),!0):!1},z=(e,t,n)=>{if(Xs.has(e)&&!n.isGenerated){z(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>z(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(qc(e,t,n))return;let r=e.name,i=Bc(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:h(yc(e,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:Bc(e,e.operator,t,n);return;case`Apply`:Jc(e,t,n);return;case`Lambda`:z(e.body,dc(t,e.params,e.paramRanges,n),i(e.params));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:z(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&z(e.other,t,n);return;case`Let`:z(e.body,Gc(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:z(e.body,Vc(e.bounds,t,n),i(mc(e.bounds)));return;case`UnboundedQuantifier`:z(e.body,dc(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&z(e.set,t,n),z(e.body,dc(t,pc(e.pattern),e.pattern.ranges,n),i(pc(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:z(e.predicate,Vc([e.bound],t,n),i(pc(e.bound.pattern)));return;case`SetMap`:z(e.expression,Vc(e.bounds,t,n),i(mc(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:h(r.location.range??vc(r.location,r.name)),message:`Non-unique fields in constructor.`}),z(r.value,t,n)});return;case`Except`:z(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),z(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:z(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(Lc(e,n))return;z(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),Rc(e,t,n);return;case`Subexpression`:if(Xc(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Yc(e,t,n)),zc(e,t,n,!1)}},Zc=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||qc(e,t,n)||zc(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&ac(t,r)?.isNonFact?n.errors.push({location:h(yc(e,r)),message:`Step number of non-fact used as a fact`}):n.facts.has(r)||z(e,t,n)}),Qc=(e,t,n)=>(e.set&&z(e.set,t,n),lc(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),$c=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Qc(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?$c(t,e.scope,e.unit,!0):z(t,e.scope,e.unit),e),{scope:t,unit:n});return z(e.conclusion,i.scope,i.unit),i.scope},el=(e,t,n)=>e.kind===`AssumeProve`?$c(e,t,n):(z(e,t,n),t),tl=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Zc(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>rl(t,e,r),t)},nl=(e,t,n)=>{let r=ll(e,t,n);return e.name===void 0?r:lc(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},rl=(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=el(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return tl(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return tl(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 Zc(r.facts,t,n),o(t);case`Instance`:return o(nl(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?nl(t,e,i):Gc([t],e,n),t));case`Have`:case`Case`:return z(r.expression,t,i),tl(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>z(e,t,i)),a(t);case`Take`:return a(dc(Vc(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=dc(Vc(r.bounds,t,i),r.names,r.nameRanges,i);return z(r.body,o,{...i,labelParams:[...i.labelParams,...mc(r.bounds),...r.names]}),tl(e.proof,a(t),n),a(o)}default:return tl(e.proof,a(t),n),a(t)}},il=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:el(e.statement,void 0,t);e.name!==void 0&&uc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),tl(e.proof,n,t),r&&(r.isInProof=!1)},al={line:0,column:0},ol=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),sl=(e,t)=>{let n=new Map([...ec,...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},cl=(e,t,n,i,a)=>{let o=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){z(n,o,a);return}let i=Bc(n,n.name,o,a);if(i!==void 0&&i!==t.arity)throw new r(`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},c=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){a.errors.push({location:h(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let i=e.expression;s(r,i);let o=i.location.range;c.has(n)?o&&a.errors.push({location:h(o),message:`Multiple substitutions for symbol '${n}' in substitution.`}):c.set(n,i)});let l=t.filter(e=>!c.has(e.name)),u=e=>!ac(o,e.name)&&!gc(e.name,a);return l.filter(e=>!u(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};s(t,n),c.set(t.name,n)}),l.filter(u).forEach(t=>{let r=e.location.range,i=t.location.range;r&&i&&a.errors.push({location:h(r),message:`Substitution missing for symbol ${t.name} declared at ${h(i)} \nand instantiated in module ${n}.`})}),c},ll=(e,t,n)=>{let r=n.getInstance(e);return cl(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>lc(e,t,r,n),t)},ul=(e,t,n,r)=>{let i=sl(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),cl(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:al}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},dl=(e,t)=>{let n=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>tc(e.location,t.location)?-1:+!!tc(t.location,e.location)).forEach(e=>{let a=[],o=[];try{e.check(a,o)}catch(e){if(!(e instanceof r)||!e.sany&&a.length===0)throw e;a.push(...e.sany?.errors??[])}a.forEach(e=>i(n,e)),o.forEach(e=>i(t,e))}),n},fl=(e,t)=>{let n=sl(e,t.imported),r=/* @__PURE__ */ new Set([...t.facts,...[...e.theorems,...e.assumptions].flatMap(e=>e.name??[])]),i=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),a=new Map([...ec,...t.bound].map(([e,t])=>[e,{...t,position:al}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c,l)=>({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),l=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>uc(e.name,{kind:t,arity:e.arity,range:e.location.range},c(e.location,void 0,n,r,!1))}));return dl([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.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=cc(e.name,a.get(e.name),r,c(e.location,void 0,t,n,!1));i&&(a.set(e.name,r),o.add(r)),s.push({declaration:e,binding:i?r:void 0})}})),...e.definitions.map(t=>({location:t.location,check:(n,r)=>{let i=c(t.location,t,n,r,!0);ol(e,t)?z(t.body,void 0,i):Wc(t,void 0,i,o)&&a.set(t.name,{kind:`Definition`,arity:nc(t),range:t.location.range,position:t.location})}})),...e.instances.map(e=>({location:e.location,check:(n,r)=>{let i=c(e.location,void 0,n,r,!1);fc(void 0,e.params,i),t.instanced.get(e)?.forEach((e,t)=>uc(t,e,i)),e.name!==void 0&&uc(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...e.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=c(e.location,void 0,t,n,e.name!==void 0);z(e.expression,void 0,r),e.name!==void 0&&uc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>il(e,c(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>Zc(e.facts,void 0,c(e.location,void 0,t,n,!1))})),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:h(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},pl=/* @__PURE__ */ new WeakSet,ml=/* @__PURE__ */ new WeakMap,hl=(e,t)=>{if(t.length===0)return e;let n={...e};return pl.has(e)&&pl.add(n),ml.set(n,[...t,...ml.get(e)??[]]),n},gl=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Sl(e,(e,r)=>gl(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&k(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&k(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},_l=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),vl=/* @__PURE__ */ new WeakMap,yl=e=>vl.get(e)??e.name,bl=(e,t)=>(yl(t)!==e.name&&vl.set(e,yl(t)),e),xl=(e,t)=>bl(e.kind===`Function`?{...e,bounds:_l(e.bounds,e=>t(e,[])),body:t(e.body,mc(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Sl=(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=>xl(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:_l(e.bounds,n),body:t(e.body,mc(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,pc(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,pc(e.bound.pattern))};case`SetMap`:return{...e,bounds:_l(e.bounds,n),expression:t(e.expression,mc(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)}}},Cl=`LAMBDA`,wl=e=>`${e}@SUBSTITUTION`,Tl=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(Tl),El=(e,t)=>{if(e.kind!==`Identifier`)return!Tl(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=k(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!Tl(n.body)},Dl=(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 Sl(e,(e,n)=>(r.push(...Dl(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Ol=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}},kl=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Al=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},jl=(e,t)=>e.map(e=>({pattern:Al(e.pattern,t),set:e.set})),Ml=(e,t)=>e.kind===`Function`?{...e,bounds:jl(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=>bl({...Ml(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:jl(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Al(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Al(e.bound.pattern,n),set:e.bound.set}};default:return e}},Pl=e=>`${e}@ENABLED`,Fl=(e,t)=>e.modes.get(t)??e,Il=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!k(e)&&t.instantiation.variables.has(e.name),Ll=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Ll(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Il(e,t,n))return[e.name];let r=k(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Ll(r.body,t,/* @__PURE__ */ new Map):void 0},Rl=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Il(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Pl(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Ul(e.expression,Fl(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Ul(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Ul(e.subscript,Fl(t,`Primed`),n),location:r},Ul(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Ll(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:Pl(r),location:e.location},location:e.location},Ul({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},zl=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:Ys}),Bl=(e,t)=>e.map(e=>zl(e.name,t)),Vl=(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:[...Bl(t,r),...i.map(e=>zl(e,r))],location:r},location:r}},Hl=(e,t)=>e.instantiation.isParameterized(t)?Gl(e,t):void 0,Ul=(e,t,n)=>{let i=e=>Ul(e,t,n),a=t.instantiation,o=a.params,s=t=>!n.has(t)&&!k(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Ul(e.expression,Fl(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:i(e.subscript),action:i(e.action),enabled:Ul(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Fl(t,`Enabled`),n)};let c=Rl(e,t,n);if(c)return c;if(e.kind===`Identifier`&&s(e.name)){let n=a.substitutions.get(e.name),r=t.bindings;if(n&&(r===void 0||!El(n,a)))return hl(n,[e]);if(n&&r){let t=wl(e.name);return r.set(t,n),zl(t,e.location)}let i=Hl(t,e.name);if(i===void 0)return e;if(o.length===0)return{...e,name:i};let s=a.getDefinition(e.name);return s&&nc(s)>0?Vl(i,o,nc(s),e.location):{kind:`Apply`,operator:i,args:Bl(o,e.location),location:e.location}}if(e.kind===`Apply`&&s(e.operator)){let n=e.args.map(i),s=a.substitutions.get(e.operator),c=a.substitutions.size>0||o.length>0||pl.has(e),l=e=>(c&&pl.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let t=s.kind===`Identifier`?s.name:s.operator;return l({...e,operator:t,args:n,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...e,operator:s.operator,args:[...s.args,...n],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Cl,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...e,operator:Cl,args:n,resolution:Ys},location:e.location};if(s)throw new r(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=Hl(t,e.operator);return u===void 0?l({...e,args:n}):{...e,operator:u,args:[...Bl(o,e.location),...n]}}if(e.kind===`OperatorReference`&&s(e.operator)){let n=Hl(t,e.operator);if(n===void 0)return e;let r=a.getDefinition(e.operator);return o.length>0&&r?Vl(n,o,nc(r),e.location):{...e,operator:n}}let l=Ol(t),u=Sl(e,(e,r)=>r.length===0?i(e):Ul(e,t,kl(n,r,l)));return Nl(u,n,l)},Wl=(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:zl(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Gl=(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=Ol(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=Ml(xl(i,(e,t)=>Ul(e,s,kl(/* @__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&&ml.set(l,[u,...ml.get(i.body)??[]]),Wl({...c,body:l},r.params,i.location)}):t},Kl=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Dl(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=>Hl(i,e)??e,getQualifiedKey:t=>{let n=Hl(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Wl(r,e.params,r.location)):t}}},ql=e=>e.kind===`Let`&&e.instances!==void 0||gt(e).some(ql),Jl=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Sl(e,e=>Jl(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>tc(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}},Yl=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Xl=(e,t)=>e.definitions.some(e=>ql(e.body))||e.assumptions.some(e=>ql(e.expression))||e.theorems.some(e=>{let t=Yl(e);return t!==void 0&&ql(t)})?{...e,definitions:e.definitions.map(e=>xl(e,e=>Jl(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Jl(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Yl(e);return n===void 0?e:{...e,statement:Jl(n,t,[])}})}:e,Zl=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}])),Ql={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]}},$l=(e,t)=>{let n=Ql[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},eu=(e,t)=>`${e}${t}`,tu=(e,t,n)=>`${e}${t}${n}`,nu=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},ru=(e,t,n)=>`${e},${t},${n}`,iu=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),au=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),ou=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),su=(e,t,n,r)=>({...iu(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),cu=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,lu=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,uu=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,{...su(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),du=su(`$Set`,0,[2],[1]),fu=su(`$Junction`,0,[3],[1]),pu=su(`$Choose`,0,[2],[1]),mu=su(`$Function`,0,[3],[1]),hu=su(`$FcnApply`,0,[2,2],[1,1]),gu=su(`$RcdSelect`,0,[2,0],[1,1]),_u=su(`'`,2,[1],[0]),vu=su(`ENABLED`,1,[2],[0]),yu=su(`[]`,3,[3],[0]),bu=su(`$SquareAct`,2,[2,1],[0,0]),xu=su(`$WF`,3,[1,2],[0,0]),Su=su(`$TemporalExists`,3,[3],[0]),Cu=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),wu=e=>e.map(e=>({name:e,arity:0})),Tu=(e,t)=>t.location.range?a(`${e}.`,t.location.range):new r(`${e} at line ${t.location.line}, column ${t.location.column}`),Eu=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Du=e=>e.kind!==`Let`&&e.kind!==`Label`,Ou=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:g(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=g(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=uu.get(t)??Zl.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},i=(e,t,n)=>{let r=iu(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(tu(e,n,t))}),t.data.constraints.forEach((e,t)=>au(r.constraints,t,e)),ou(r.argConstraints,eu(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>ou(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},a=(e,t,n=[],i=[])=>{let a=e=>i.includes(e);if(t.forEach((t,n)=>{if(!(t.operator||t.declared)&&t.data.level>cu(e,n))throw new r(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new r(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let o=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},s=(t,n,r)=>e.conditions.has(ru(t,n,r)),c=iu(Math.max(e.level,...t.filter((t,n)=>lu(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>c.params.add(e)),t.forEach((t,n)=>{lu(e,n)===1&&t.data.params.forEach(e=>c.params.add(e))}),n.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),e.constraints.forEach((e,t)=>au(c.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||au(c.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>au(c.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{a(t)||au(c.constraints,t,cu(e,n))})),t.forEach((e,n)=>{let r=e.operator;r&&t.forEach((e,t)=>r.formals.forEach((i,a)=>{s(n,t,a)&&e.data.params.forEach(e=>au(c.constraints,e,cu(r,a)))}))}),e.argParams.forEach(e=>{let t=nu(e),n=o(t.operator)?.operator;n&&au(c.constraints,t.param,cu(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>ou(c.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>ou(c.argConstraints,eu(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&ou(c.argConstraints,eu(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=nu(e),n=o(t.operator);n&&ou(c.argConstraints,eu(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{a(nu(e).param)||c.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),e.argParams.forEach(e=>{let t=nu(e),n=o(t.operator);if(n)n.declared&&c.argParams.add(tu(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(tu(t.operator,t.index,e)))}}),t.forEach((e,n)=>{let r=e.declared;r&&t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{s(n,t,a)&&e.data.params.forEach(e=>c.argParams.add(tu(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`){let n=te(`LAMBDA`,wu(e.params),e.body,t);return{data:n,operator:n}}let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,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=iu();return e.params.add(r),{data:e,declared:{name:r,arity:i.arity}}}if(e.kind===`OperatorReference`)return{data:iu()}}return{data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=Cu(n,wu(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 Tu(`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 Tu(`Action used where only temporal formula or state predicate allowed`,e);Eu.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Du(n)&&n.kind!==r)throw Tu(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=g(e,n);t.constraints.forEach((e,t)=>au(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>ou(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof r)||t.sany?t:Tu(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return iu();case`Identifier`:return l(n(e.name,t),[]);case`Apply`:{let r=s(e.args,t);return d(e,r),l(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(fu,n)}case`Prime`:case`Unchanged`:return c(_u,[e.expression],t);case`Enabled`:return c(vu,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(yu,[n])}case`If`:return c(fu,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(fu,[...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(fu,[e.body],t,e.bounds.map(e=>e.set),mc(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Tu(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?Su:fu,[e.body],t,[],e.names);case`Choose`:return c(pu,[e.body],t,e.set?[e.set]:[],pc(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(du,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(du,[e.predicate],t,[e.bound.set],pc(e.bound.pattern));case`SetMap`:return c(du,[e.expression],t,e.bounds.map(e=>e.set),mc(e.bounds));case`FunctionConstruction`:return c(mu,[e.body],t,e.bounds.map(e=>e.set),mc(e.bounds));case`Record`:return c(mu,e.fields.map(e=>e.value),t);case`RecordSet`:return c(du,e.fields.map(e=>e.value),t);case`Except`:return c(du,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(hu,[o(e.function,t),e.args.length===1?o(e.args[0],t):{data:c(du,e.args,t)}]);case`Bracket`:return iu();case`FieldAccess`:return a(gu,[o(e.record,t),{data:iu()}]);case`BoxAction`:case`AngleAction`:return c(bu,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(xu,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return iu()}},ee=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>ee(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||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 gt(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,Cu(t,wu(e.names))),i;default:return Sl(e,(e,n)=>(a(e,r,Cu(t,wu(n))),e)),i}},te=(e,t,n,r)=>{let i=Cu(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=ee(n,i),c={...iu(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(eu(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(tu(e.name,n,t.name))).map(e=>ru(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(nu(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=nu(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},g=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...iu(),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=te(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:g,toOperand:o}},ku=(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`?ku(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=iu(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>au(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>ou(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},Au=(e,t,n,r)=>{let i=Ou(t),a=e=>Math.max(0,...e.map(e=>i.analyze(e,/* @__PURE__ */ new Map).level)),o=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?a([t.expression]):t.kind===`Witness`?a(t.expressions):t.kind===`Take`?a(t.bounds.map(e=>e.set)):t.kind===`Pick`?a([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?ku(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=h(e.statement),n=()=>o(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...s(e.proof)]:e.body.kind===`Qed`?s(e.proof):[]}):[],c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>o(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>a([e.set])!==0).flatMap(e=>e.set.location.range?[{location:h(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...c(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[],l=dl([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>i.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?ku(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...c(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw ae(n)}})),...n],r);if(l.length>0)throw ae(l,!1,void 0,r)},ju=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),Mu=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Nu=/* @__PURE__ */ new Set([...ju,...Mu,`Enabled`]),Pu=/* @__PURE__ */ new Set([`~>`,`-+->`]),Fu=/* @__PURE__ */ new Set([...Pu,`\\cdot`]),Iu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Lu=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),Ru=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},zu=(e,t)=>Iu.has(e)||t.builtins.get(e)?.isStateLevel===!0,Bu=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(ju.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(Mu.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&Pu.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(Nu.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&Fu.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=Ru(e);if(u!==void 0&&!k(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{zu(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),Lu.has(u)&&(r[0]|=8),!a&&zu(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)}}gt(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},Vu=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],Hu=(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},Uu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),Wu=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=Bu(Vu(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=Hu(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=Hu(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!Uu(t[e],l[e*r])))),p=Hu(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}},Gu=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?Ku(Vu(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},Ku=(e,t)=>{let n=t.facts.words,r=Bu(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=Gu(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]}Uu(e.callee,r[0])||(i[0]|=r[0]&14)}),i},qu=(e,t)=>!(Gu(e,t)[0]&1),Ju={any:2,repeated:4,streamed:8},Yu=(e,t,n=`any`)=>(Gu(e,t)[0]&Ju[n])!==0,Xu=(e,t)=>{let n=Gu(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},Zu=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},Qu=(e,t)=>{let n=Ku([e],t);return n[0]&16?void 0:Zu(n)},$u=(e,t)=>!!(Ku([e],t)[0]&1),ed=(e,t,n)=>new c(`Applying ${e} to the following value,\nwhich is not ${t}:\n${I(n)}`),td=e=>ln(e)?F(e):void 0,nd=`a function with a finite domain`,rd=(e,t,n)=>{let r=L(e,t,n),i=td(r);if(!i)throw ed(n,nd,r);return i},id=(e,t)=>{let n=L(e,1,t),r=td(n),i=r&&cd(r,L(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw ts(`second`,t,`bag`,n);return i},ad=(e,t,n)=>{let r=t[n];if(!r||!sd(r))throw ts(n===0?`first`:`second`,`(+)`,`bag`,L(e,n,`(+)`));return r},od=(e,t)=>{if(!j(e)||!M(e))throw t();return N(e).elements},sd=e=>e.range.every(e=>typeof e==`number`&&e>0),cd=(e,t)=>{let n=e.domain.findIndex(e=>Kr(t,e));return n===-1?void 0:e.range[n]},ld=e=>{if(typeof e==`number`)return e;let t=`tlc2.value.impl.${gs(e)}`;throw new _(`class ${t} cannot be cast to class tlc2.value.impl.IntValue (${t} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},ud=(e,t)=>{let n=ld(e)+ld(t);if(us(n))throw ds(`${e}+${t}`);return n},dd=(e,t,n)=>{let r=ld(e.range[t]),i=cd(n,e.domain[t]);if(i===void 0)return r;let a=r-ld(i);if(us(a))throw ds(`${r}-${i}`);return a},fd=(e,t,n,r=e.length)=>{let i=e.slice(0,r).find(e=>Kr(t,e[0]));i?i[1]=ud(i[1],n):e.push([t,n])},pd=e=>e.domain.map((t,n)=>[t,e.range[n]]),md=tr([],[]),hd=e=>[os(`EmptyBag`,md),R(`IsABag`,1,e=>{let t=td(L(e,0,`IsABag`));return t!==void 0&&sd(t)}),R(`BagCardinality`,1,e=>{let t=L(e,0,`BagCardinality`);return rd(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw ed(`BagCardinality`,`a bag`,t);return ud(e,n)},0)}),R(`BagIn`,2,e=>{let t=id(e,`BagIn`);return t!==void 0&&t>0}),R(`CopiesIn`,2,e=>id(e,`CopiesIn`)??0),R(`\\oplus`,2,e=>{let t=[0,1].map(t=>td(L(e,t,`(+)`))),n=ad(e,t,0),r=ad(e,t,1),i=pd(n);return r.domain.forEach((e,t)=>fd(i,e,r.range[t],n.domain.length)),ti(i)}),R(`\\ominus`,2,e=>{let t=L(e,0,`(-)`),n=L(e,1,`(-)`),r=td(t),i=td(n);if(!r)throw ts(`first`,`(-)`,`bag`,t);if(!i)throw ts(`second`,`(-)`,`bag`,n);return ti(r.domain.flatMap((e,t)=>{let n=dd(r,t,i);return n>0?[[e,n]]:[]}))}),R(`BagUnion`,1,e=>{let t=L(e,0,`BagUnion`),n=od(t,()=>ed(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??md;let r=e=>{let n=td(e);if(!n)throw new c(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${I(t)}`);return n},i=pd(r(n[0]));return n.slice(1).forEach(e=>{let t=r(e);t.domain.forEach((e,n)=>fd(i,e,t.range[n]))}),ti(i)}),R(`\\sqsubseteq`,2,e=>{let t=L(e,0,`\\sqsubseteq`),n=L(e,1,`\\sqsubseteq`),r=td(t),i=td(n);if(!r)throw ed(`\\sqsubseteq`,nd,t);if(!i)throw ed(`\\sqsubseteq`,nd,n);return r.domain.every((e,t)=>{let n=cd(i,e);return ld(r.range[t])<=(n===void 0?0:ld(n))})}),ss(`BagOfAll`,2,e=>{let t=as(e,0,`BagOfAll`),n=L(e,1,`BagOfAll`),r=td(n);if(!r)throw ts(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[];return r.domain.forEach((e,n)=>fd(i,t.call([e]),r.range[n])),ti(i)}),R(`SubBag`,1,t=>{let n=L(t,0,`SubBag`);if(!ln(n))throw new _(`Attempted to apply the operator DOMAIN to a non-function\n(${_s(n)})\nline 106, col 58 to line 106, col 65 of module Bags`);let r=F(n),i=N(Xr(r.range)).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new _(`Attempted to apply a function to ${I(r)}, which is not in its domain`);return Yr(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>tr(e.map(e=>e[0]),e.map(e=>e[1]))))}),R(`BagToSet`,1,e=>fa(rd(e,0,`BagToSet`))),R(`SetToBag`,1,e=>{let t=L(e,0,`SetToBag`),n=od(t,()=>ed(`BagToSet`,nd,t));return tr([...n],n.map(()=>1))})],gd={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},B={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},_d={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},vd=[{lower:`true`,upper:`TRUE`,token:B.true},{lower:`false`,upper:`FALSE`,token:B.false},{lower:`null`,upper:`NULL`,token:B.null}],yd=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
|
|
79
|
+
`],[`r`,`\r`],[`f`,`\f`]]),bd=1024,xd=e=>{let t=+!!e.startsWith(``),n=t,r=0,i=t,a=!0,o=B.none,s=0,c=[gd.emptyDocument],l=[void 0],u=[0],d=()=>`$${c.map((e,t)=>e===gd.emptyArray||e===gd.nonemptyArray?`[${u[t]}]`:e===gd.emptyDocument||e===gd.nonemptyDocument?``:`.${l[t]??``}`).join(``)}`,f=()=>` at line ${r+1} column ${n-i+1} path ${d()}`,p=e=>new _(`com.google.gson.stream.MalformedJsonException: ${e}${f()}
|
|
80
|
+
See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`),m=()=>new _(`java.io.EOFException: End of input${f()}`),h=()=>{if(!a)throw p(`Use JsonReader.setStrictness(Strictness.LENIENT) to accept malformed JSON`)},ee=e=>`/\\;#=`.includes(e)?(h(),!1):!`{}[]:, \f\r
|
|
81
|
+
`.includes(e),te=()=>{for(;n<e.length;){let t=e[n++];if(t===`
|
|
82
|
+
`){r++,i=n;return}if(t===`\r`)return}},g=t=>{for(;n+t.length<=e.length;n++)if(e[n]===`
|
|
83
|
+
`)r++,i=n+1;else if(e.startsWith(t,n))return!0;return!1},ne=()=>{for(;n<e.length;){let t=e[n++];if(t===`
|
|
84
|
+
`)r++,i=n;else if(t===`/`){if(n===e.length)return t;h();let r=e[n];if(r!==`*`&&r!==`/`)return t;if(n++,r===`/`)te();else if(g(`*/`))n+=2;else throw p(`Unterminated comment`)}else if(t===`#`)h(),te();else if(t!==` `&&t!==`\r`&&t!==` `)return t}},v=()=>{let e=ne();if(e===void 0)throw m();return e},re=()=>{let t=vd.find(t=>e[n]===t.lower[0]||e[n]===t.upper[0]);if(!t)return B.none;let r=t.lower.length;for(let i=0;i<r;i++){let r=e[n+i];if(r!==t.lower[i]&&r!==t.upper[i])return B.none}return n+r<e.length&&ee(e[n+r])?B.none:(n+=r,t.token)},y=()=>{let t=_d.none,r=!1,i=0;for(;n+i<e.length;i++){if(i===bd)return B.none;let a=e[n+i];if(a===`-`){if(t===_d.none)t=_d.sign;else if(t===_d.exponentE)t=_d.exponentSign;else return B.none}else if(a===`+`){if(t!==_d.exponentE)return B.none;t=_d.exponentSign}else if(a===`e`||a===`E`){if(t!==_d.digit&&t!==_d.fractionDigit)return B.none;t=_d.exponentE}else if(a===`.`){if(t!==_d.digit)return B.none;t=_d.decimal}else if(a<`0`||a>`9`){if(ee(a))return B.none;break}else if(t===_d.sign||t===_d.none)r=a===`0`,t=_d.digit;else if(t===_d.digit){if(r)return B.none}else t===_d.decimal?t=_d.fractionDigit:(t===_d.exponentE||t===_d.exponentSign)&&(t=_d.exponentDigit)}return i===bd||t!==_d.digit&&t!==_d.fractionDigit&&t!==_d.exponentDigit?B.none:(s=i,B.number)},ie=()=>{let t=c.length-1,r=c[t];if(r===gd.emptyArray)c[t]=gd.nonemptyArray;else if(r===gd.nonemptyArray){let e=v();if(e===`]`)return B.endArray;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated array`)}else if(r===gd.emptyObject||r===gd.nonemptyObject){if(c[t]=gd.danglingName,r===gd.nonemptyObject){let e=v();if(e===`}`)return B.endObject;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated object`)}let e=v();if(e===`"`)return B.doubleQuotedName;if(e===`'`)return h(),B.singleQuotedName;if(e===`}`){if(r!==gd.nonemptyObject)return B.endObject;throw p(`Expected name`)}if(h(),n--,ee(e))return B.unquotedName;throw p(`Expected name`)}else if(r===gd.danglingName){c[t]=gd.nonemptyObject;let r=v();if(r===`=`)h(),e[n]===`>`&&n++;else if(r!==`:`)throw p(`Expected ':'`)}else if(r===gd.emptyDocument){if(ne()===void 0)return B.eof;n--,e.startsWith(`)]}'
|
|
85
|
+
`,n)&&(n+=5),c[t]=gd.nonemptyDocument}else if(r===gd.nonemptyDocument){if(ne()===void 0)return B.eof;h(),n--}let i=ne();if(i===void 0){if(r===gd.emptyDocument)return B.eof;throw m()}if(i===`]`&&r===gd.emptyArray)return B.endArray;if(i===`]`||i===`;`||i===`,`){if(r!==gd.emptyArray&&r!==gd.nonemptyArray)throw p(`Unexpected value`);return h(),n--,B.null}if(i===`'`)return h(),B.singleQuoted;if(i===`"`)return B.doubleQuoted;if(i===`[`)return B.beginArray;if(i===`{`)return B.beginObject;n--;let a=re();if(a!==B.none)return a;let o=y();if(o!==B.none)return o;if(!ee(e[n]))throw p(`Expected value`);return h(),B.unquoted},ae=()=>(o===B.none&&(o=ie()),o),b=()=>{if(n===e.length)throw p(`Unterminated escape sequence`);let t=e[n++];if(t===`u`){if(n+4>e.length)throw p(`Unterminated escape sequence`);let t=e.slice(n,n+4);if(!/^[\da-fA-F]{4}$/.test(t))throw p(`Malformed Unicode escape \\u${t}`);return n+=4,String.fromCharCode(Number.parseInt(t,16))}let a=yd.get(t);if(a!==void 0)return a;if(t===`
|
|
86
|
+
`)return r++,i=n,t;if(`'"\\/`.includes(t))return t;throw p(`Invalid escape sequence`)},oe=t=>{let a=``,o=n;for(;n<e.length;){let s=e[n++];if(s===t)return a+e.slice(o,n-1);s===`\\`?(a+=e.slice(o,n-1)+b(),o=n):s===`
|
|
87
|
+
`&&(r++,i=n)}throw p(`Unterminated string`)},se=()=>{let t=n;for(;n<e.length&&ee(e[n]);)n++;return e.slice(t,n)},ce=e=>{if(c.length-1>=255)throw new _(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${f()}`);c.push(e),l.push(void 0),u.push(0),o=B.none},le=()=>{c.pop(),l.pop(),u.pop(),u[c.length-1]++,o=B.none},ue=()=>{let e=ae();return e!==B.endObject&&e!==B.endArray&&e!==B.eof},de=()=>{let e=ae(),t=e===B.unquotedName?se():oe(e===B.singleQuotedName?`'`:`"`);return o=B.none,l[c.length-1]=t,t},x=t=>t===B.true||t===B.false?t===B.true:t===B.null?null:t===B.number?(n+=s,{literal:e.slice(n-s,n)}):t===B.unquoted?se():oe(t===B.singleQuoted?`'`:`"`),S=()=>{let e=ae();if(e===B.beginArray){ce(gd.emptyArray);let e=[];for(;ue();)e.push(S());return le(),e}if(e===B.beginObject){ce(gd.emptyObject);let e=/* @__PURE__ */ new Map;for(;ue();)e.set(de(),S());return le(),e}let t=x(e);return o=B.none,u[c.length-1]++,t};if(ae()===B.eof)return null;let C=S();return a=!1,C!==null&&ae(),C},Sd=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),Cd=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),wd=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),Td=e=>{if(!ln(e))return;let t=F(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?pi(n):void 0},Ed=(e,t)=>{let n=`tlc2.value.impl.${gs(e)}`,r=`tlc2.value.impl.${t}`;return new _(`class ${n} cannot be cast to class ${r} (${n} and ${r} are in unnamed module of loader 'app')`)},Dd=e=>new _(`Cannot convert value: unsupported value type tlc2.value.impl.${gs(e)}`),Od=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),kd=e=>`[${e.map(Nd).join(`,`)}]`,Ad=e=>`{${vn(e).map(e=>`${Od(typeof e[0]==`string`?e[0]:I(e[0]))}:${Nd(e[1])}`).join(`,`)}}`,jd=e=>{let t=F(e),n=Hi(t);return n?kd(n):Ad(t)},Md=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,Nd=e=>{if(typeof e==`string`)return Od(e);if(typeof e!=`object`)return String(e);if(e.kind===`ModelValue`)return Od(e.name);let t=gs(e);if(t===`RecordValue`)return Ad(F(e));if(t===`TupleValue`)return kd(F(e).range);if(Md(t))return jd(e);if(hi(e))return kd(N(e).elements);throw Dd(e)},Pd=e=>{let t=gs(e);if(t===`TupleValue`)return kd(F(e).range);if(Md(t))return jd(e);if(hi(e))return kd(N(e).elements);throw Dd(e)},Fd=e=>{let t=gs(e);if(t===`RecordValue`)return Ad(F(e));if(t===`TupleValue`)return`{${F(e).range.map((e,t)=>`"${t}":${Nd(e)}`).join(`,`)}}`;if(Md(t))return jd(e);throw Dd(e)},Id=e=>{if(e===null)throw new _(`Cannot convert value: unsupported JSON value null`);if(typeof e==`boolean`)return e;if(typeof e==`string`)return Rn(e);if(Array.isArray(e))return fi(e.map(Id));if(e instanceof Map)return pi([...e].map(e=>[Rn(e[0]),Id(e[1])]));let t=Number(e.literal);if(!/^-?\d+$/.test(e.literal)||us(t))throw new _(`Cannot convert value: expected a 32-bit integer JSON number, but found ${e.literal}`);return t||0},Ld=e=>{if(typeof e!=`string`)throw new _(`Cannot cast tlc2.value.impl.${gs(e)} to tlc2.value.impl.StringValue`);return e},Rd=(e,t)=>{let n=ua(e,t);if(typeof n!=`string`)throw Ed(n,`StringValue`);return n},zd=e=>{if(!Cd.has(e.toLowerCase()))throw wd.has(e.toLowerCase())?new t(`IOUtils!Serialize does not support the charset ${e}`):new _(/^[a-zA-Z\d][\w.:+-]*$/.test(e)?`java.nio.charset.UnsupportedCharsetException: ${e}`:`java.nio.charset.IllegalCharsetNameException: ${e}`)},Bd=(e,n,r,i)=>{let a=r.find(e=>!Sd.has(e));if(a!==void 0)throw new _(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${a}`);if(r.includes(`READ`))throw new _(`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 _(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(o.has(`DELETE_ON_CLOSE`))throw new t(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let s=e.readFile?.(n);if(s===void 0&&!o.has(`CREATE`)&&!o.has(`CREATE_NEW`))throw new _(`java.nio.file.NoSuchFileException: ${n}`);if(s!==void 0&&o.has(`CREATE_NEW`))throw new _(`java.nio.file.FileAlreadyExistsException: ${n}`);s===void 0||o.has(`TRUNCATE_EXISTING`)?e.writeFile?.(n,i):e.writeFile?.(n,o.has(`APPEND`)?s+i:i+s.slice(i.length))},Vd=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},Hd=(e,t)=>{let n=e.readFile?.(t);if(n===void 0)throw new _(`${t} (No such file or directory)`);return n},Ud=e=>[bs(cs(`ToJson`,1,e=>Rn(Nd(L(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),bs(cs(`ToJsonArray`,1,e=>Rn(Pd(L(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),bs(cs(`ToJsonObject`,1,e=>Rn(Fd(L(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),bs(cs(`JsonSerialize`,2,t=>{let n=Ld(L(t,0,`JsonSerialize`)),r=L(t,1,`JsonSerialize`);if(!Hi(r)&&!Td(r))throw ts(`second`,`JsonSerialize`,`sequence or record`,r);return Vd(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`),bs(cs(`ndJsonSerialize`,2,t=>{let n=Ld(L(t,0,`ndJsonSerialize`)),r=L(t,1,`ndJsonSerialize`),i=Hi(r);if(!i)throw ts(`second`,`ndJsonSerialize`,`sequence`,r);return Vd(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`),bs(cs(`JsonDeserialize`,1,t=>Id(xd(Hd(e,Ld(L(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),bs(cs(`ndJsonDeserialize`,1,t=>fi(Hd(e,Ld(L(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>Id(xd(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],Wd=(e,t)=>[bs(Es(`Serialize`,3,(n,r)=>{let i=Ds(n,2,`Serialize`)(),a=Td(i);if(!a)throw ts(`third`,`ndJsonSerialize`,`sequence`,i);if(Rd(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Ds(n,0,`Serialize`)(),s=Hi(o);if(!s)throw ts(`first`,`Serialize`,`sequence`,o);let c=Ds(n,1,`Serialize`)();if(typeof c!=`string`)throw ts(`second`,`ndJsonSerialize`,`sequence`,c);let l=ua(a,`openOptions`);if(gs(l)!==`TupleValue`)throw Ed(l,`TupleValue`);let u=Rd(a,`charset`),d=F(l).range.map(e=>{if(typeof e!=`string`)throw Ed(e,`StringValue`);return e});return zd(u),Bd(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)`)],Gd={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},Kd=e=>{let t=[],n={objects:/* @__PURE__ */ new Map,names:/* @__PURE__ */ new Map,count:0},r=Qn(),i=e=>t.push(e&255),a=e=>{i(e>>8),i(e)},o=e=>{a(e>>16),a(e)},s=e=>e>32767?o(-e):a(e),c=e=>{i(Gd.string),o(0),o(-1),o(e.length),e.split(``).forEach(e=>i(e.charCodeAt(0)))},l=e=>{i(Gd.handle),s(e)},u=e=>{if(typeof e==`boolean`){i(Gd.boolean),i(+!!e);return}if(typeof e==`number`){i(Gd.integer),o(e);return}if(typeof e==`string`){n.count++,c(e);return}if(e.kind===`ModelValue`){i(Gd.modelValue),a(r.indexOf(e));return}if(e.kind===`Interval`){i(Gd.interval),o(e.low),o(e.high);return}let t=n.objects.get(e);if(t!==void 0){l(t);return}if(n.objects.set(e,n.count++),j(e)){let t=N(e).elements;i(Gd.set),o(t.length),t.forEach(u);return}let d=F(e),f=ir(e);f===`tuple`?(i(Gd.tuple),s(d.range.length),d.range.forEach(u)):f===`record`?(i(Gd.record),o(d.domain.length),d.domain.forEach((e,t)=>{let r=String(e),i=n.names.get(r);i===void 0?(n.names.set(r,n.count++),c(r)):l(i),u(d.range[t])})):(i(Gd.function),s(d.domain.length),i(1),d.domain.forEach((e,t)=>{u(e),u(d.range[t])}))};return u(e),de(Uint8Array.from(t))},qd=e=>[bs(cs(`_TLCTraceSerialize`,2,t=>{let n=Ld(L(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,Kd(L(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`)],Jd=25214903917n,Yd=(1n<<48n)-1n,Xd=2147483647,Zd=e=>{let t={value:(BigInt.asUintN(64,e)^Jd)&Yd},n=e=>(t.value=t.value*Jd+11n&Yd,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Jd)&Yd},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<=Xd)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Qd=[],$d=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},ef=()=>{for(let e=1277011;Qd.length<1341;e++)$d(e)&&Qd.push(e);return Qd},tf=e=>{let t=ef(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},nf=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},rf=e=>{for(let t=Math.max(e,9);;t++){let e=nf(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)}}},af=(e,t,n)=>{if(t<=0)return[];let r=rf(t),i={index:BigInt(n.nextInt(t))},a=BigInt(tf(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},of=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Xd),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},sf=(1n<<63n)-1n-24n,cf=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(sf*BigInt(n)+i)%t;return r<0n?r+t:r})},lf=(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,uf=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=ui(e.domain),n=N(e.range).elements;return{lists:t.map(()=>n),create:e=>tr(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>N(e).elements),create:t=>pi(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>N(e).elements),create:fi}}},df=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,ff=(e,t,n,r)=>{if(P(t))return[];let i=r===`1.7.4`?of:af;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=df(t,r)?void 0:uf(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Xd)?cf(e,t,n):i(e,Number(t),n)).map(e=>a.create(lf(a.lists,e)))}let o=N(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},pf=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...ns(e.domain,`RandomElement`,e).elements];return tr(n,n.map(()=>pf(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return pi(e.names.map((n,r)=>[n,pf(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return fi(e.factors.map(e=>pf(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new _(`Attempted to retrieve out-of-bounds element from the interval value ${I(e)}.`);return e.low+r}let n=ns(e,`RandomElement`).elements,r=Math.floor(t.nextDouble()*n.length);if(r>=n.length)throw new _(`Index ${r} out of bounds for length ${n.length}`);return n[r]},mf=(e,t,n)=>{if(typeof e!=`number`||e<0)throw ts(t,n,`nonnegative integer`,e);return e},hf=(e,t,n,r)=>Yr(Array.from({length:t},()=>Yr(e.filter(()=>r.nextDouble()<n)))),gf=(e,t)=>{let n=`RandomSetOfSubsets`,r=mf(L(e,0,n),`first`,n),i=mf(L(e,1,n),`second`,n),a=L(e,2,n);if(!j(a)||!M(a))throw ts(`third`,n,`finite set`,a);let o=N(a).elements;if(o.length<31&&r>2**o.length)throw ts(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw ts(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return hf(o,r,o.length===0?0:i/o.length,t.getRandom())},_f=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,vf=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,yf=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(_f.test(t))return Number(t.replace(/[fFdD]$/,``));let n=vf.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},bf=e=>R(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=mf(L(t,0,n),`first`,n),i=L(t,1,n);if(typeof i!=`string`)throw ts(`second`,n,`string literal representing a probability`,i);let a=yf(i);if(a===void 0||a<0||a>1)throw ts(`second`,n,`string literal does not represent a parsable probability`,i);let o=L(t,2,n);if(!j(o)||Vn(o)||!zi(o))throw ts(`third`,n,`finite set`,o);let s=Li(o);if(32-Math.clz32(r)>s&&r>1<<s)throw ts(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return hf(N(o).elements,r,a,e.getRandom())}),xf=e=>[bs(R(`RandomSubset`,2,t=>{let n=L(t,0,`RandomSubset`);if(typeof n!=`number`||n<0)throw ts(`first`,`RandomSubset`,`nonnegative integer`,n);let r=L(t,1,`RandomSubset`);if(!hi(r)||!zi(r))throw ts(`second`,`RandomSubset`,`a finite set`,r);let i=df(r,e.version);if(i&&i.reduce((e,t)=>e*N(t).elements.length,1)>nn())throw new _(rn());return Yr(ff(n,r,e.getRandom(),e.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),R(`RandomSetOfSubsets`,3,t=>gf(t,e)),R(`TestRandomSetOfSubsets`,3,t=>fi(Array.from({length:5},()=>N(gf(t,e)).elements.length)))],Sf=(e,t=0n)=>{let n=Zd(t),r={random:Zd(t),seededState:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>pi([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,getSuccessorAction:()=>void 0,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:mo,getSimulationValue:void 0,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: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 a},Cf=e=>ti([...e.possibleCounts].map(([e,t])=>[e,t])),wf=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Cf(e)]]),Tf=e=>pi([[`name`,e??`UnnamedAction`],[`location`,pi([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),Ef=/* @__PURE__ */ new WeakSet,Df=(e,t)=>{let n=pi([[`action`,Yr(e)],[`state`,Yr(t)]]);return Ef.add(n),n},Of=(e,t,n)=>{let r=e.map((e,t)=>fi([t+1,pi(Object.entries(e))])),i=r.slice(1).map((e,n)=>fi([r[n],t[n],e])),a=n?[fi([r[r.length-1],n.action,r[n.start]])]:[];return Df([...i,...a],r)},kf=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return wf(e).get(t)},Af=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0||!e.pause)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),I(r));else throw new c(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${I(n)}`)},jf=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:V(e),Mf=e=>e.every(e=>e!==void 0),Nf=(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&&!k(e);if(i&&t.variableIndex.has(r))return 1;let a=gt(e).map(e=>Nf(e,t,n)),o=i?og(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(Nf(o.body,t,n))),Math.max(0,...a)},Pf=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[Es(`AssertError`,2,e=>{let n=as(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw new _(`In computing AssertError, a non-string expression (${jf(n)}) was used as the err of an AssertError(err, exp).`);let r=Ds(e,0,`AssertError`)();try{Ds(e,1,`AssertError`)()}catch(e){if(e instanceof _)return It(e.message,t.isTool)===r;throw e}return!1}),cs(`TLCGetOrDefault`,2,e=>{let n=L(e,0,`TLCGetOrDefault`);return kf(t,n)??L(e,1,`TLCGetOrDefault`)}),cs(`Trace`,0,(e,n)=>{let r=n?.environment.variables??[],i=n?.state??r.map(()=>void 0);if(!n||!Mf(i)){let e=r.filter((e,t)=>i[t]===void 0);throw new _(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return n.state?fi(t.getBehavior(i).map(e=>{let r=n.environment.variables.map((t,n)=>[t,e[n]]),i=t.getSimulationValue?.(`action`,e);return pi(i===void 0?r:[[`_action`,i],...r])})):fi([pi([])])}),cs(`CounterExample`,0,()=>t.counterExample??Df([],[])),R(`ToTrace`,1,e=>{let t=L(e,0,`ToTrace`);if(typeof t!=`object`||!Ef.has(t))throw new c(`The argument of ToTrace should be a CounterExample, but instead it is:\n${I(t)}`);let n=N(ua(t,`state`)).elements.map(e=>Hi(e)??[]);return fi(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),R(`TLCModelValue`,1,e=>{let t=L(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new c(`The argument of ModelValue should be a string, but instead it is:\n${I(t)}`);return Zn(t)}),Es(`TLCDefer`,1,(e,n)=>{let r=as(e,0,`TLCDefer`).expression;return n&&r&&(t.deferred=e=>{U(r,{...n,next:e})}),!0}),R(`TLCNoOp`,1,e=>L(e,0,`TLCNoOp`)),{...Es(`PickSuccessor`,1,(n,r)=>{let i=r?.next??(r?.environment.variables??[]).map(()=>void 0);if(!Mf(i)||r?.next&&t.isSeen(i))return!0;let a=as(n,0,`PickSuccessor`),o=a.call([]);if(typeof o!=`boolean`)throw new _(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${_s(o)}) was used as the condition of an IF.\n${a.expression?jf(a.expression):``}`);if(o||!r?.next||!r.state||!Mf(r.state))return!0;let s=t.getSuccessorAction(r.state,i);throw e(Tt(t.isTool,St.moduleOverrideStdout,Ct.none,`Extend behavior of length ${t.getLevel(r.state)} with a "${s?.name}" step [<Action ${s?.location.range&&h(s.location.range)}>]? (Yes/no/explored/states/diff):`)),new se}),isActionLevel:!0},Es(`TLCCache`,2,(e,r)=>{let a=as(e,0,`TLCCache`),o=ja(Ds(e,1,`TLCCache`)()),s=a.expression;if(!s||!r)return a.call([]);let c=Nf(s,r.environment,/* @__PURE__ */ new Set);if(c===2)return a.call([]);let l=c===1;if(l&&r.state&&t.getSimulationValue===void 0)return a.call([]),a.call([]);let u=l&&r.state?i(r.state):n,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=a.call([]);return d.set(o,p),p}),R(`TLCFP`,1,e=>{let t=L(e,0,`TLCFP`),n=Sa(t);if(n)throw n;return Number(BigInt.asIntN(32,mo([t])))}),Es(`TLCEvalDefinition`,1,(e,t)=>{let n=Ds(e,0,`TLCEvalDefinition`)();if(typeof n!=`string`)throw new c(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${I(n)}`);let r=t?og(n,t.environment):void 0,i=r?void 0:t?.environment.builtins.get(n);if(i?.arity===0)return i.evaluate([],t);if(!r||!t)throw new c(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${I(n)}`);if(r.kind===`Operator`&&r.params.length>0){let e=r.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new c(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${n}(${e.join(`, `)})`)}return r.kind===`Operator`?U(r.body,t):U({kind:`Identifier`,name:n,location:r.location},t)})]},Ff=(e,t)=>[cs(`_Track`,2,e=>{let n=String(L(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,L(e,0,`_Track`)===!0?r+1:r),!0}),cs(`_Counts`,0,()=>Cf(t)),cs(`_CheckName`,1,n=>{let r=String(L(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(I(Cf(t),!0)),!1)}),cs(`_PrintCounts`,0,()=>(e(I(Cf(t),!0)),!0))],If=e=>String(e).padStart(2,`0`),Lf=e=>`${e.getUTCFullYear()}.${If(e.getUTCMonth()+1)}.${If(e.getUTCDate())}.${If(e.getUTCHours())}${If(e.getUTCMinutes())}${If(e.getUTCSeconds())}`,Rf=e=>ti([...e].map(([e,t])=>[e,fi([t])])),zf=e=>rr(ni(e),`record`),Bf=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Vf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Hf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Uf=(e,t,n)=>{if(e.version===`1.7.4`?!Vf.has(t)||!e.isStarted&&Hf.has(t):!e.isStarted&&Bf.has(t))throw new c(`TLCGet(${t}) was undefined.`);let r=e.getSimulationValue?.(t,n);if(r!==void 0)return r;let i=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return i;case`stats`:return zf([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,i],[`worker`,0]]);case`config`:return zf([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,String(BigInt.asIntN(64,Xa()))],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return zf([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Rn(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Rn(Lf(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Tf(void 0);case`all`:return Rf(e.registers);case`all:named`:return Rf(wf(e))}if(t.startsWith(`s:`)){let n=wf(e).get(t);if(n===void 0)throw new c(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Rn(e.properties.get(t.slice(2))??t);throw new c(`TLCGet(${t}) was undefined.`)},Wf=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new c(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new c(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${I(t)}`);return Uf(e,t,n?.state)},Gf=e=>e.length===0?[[]]:e.flatMap((t,n)=>Gf([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Kf=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&N(e).elements.forEach(Kf),e.kind===`Function`&&e.range.forEach(Kf))},qf=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 F(e);default:return N(e)}},Jf=(e,t)=>[R(`Print`,2,t=>(e(Ha([L(t,0,`Print`),L(t,1,`Print`)]).map(A).join(` `)),L(t,1,`Print`))),R(`PrintT`,1,t=>(e(A(Ha([L(t,0,`PrintT`)])[0])),!0)),R(`Assert`,2,e=>{if(L(e,0,`Assert`)!==!0)throw new c(`The first argument of Assert evaluated to FALSE; the second argument was:\n${A(I(L(e,1,`Assert`)))}`,b.assertViolation);return!0}),R(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),R(`:>`,2,e=>ti([[L(e,0,`:>`),L(e,1,`:>`)]])),R(`@@`,2,e=>{let t=L(e,0,`@@`),n=L(e,1,`@@`),r=ln(t)?F(t):void 0,i=ln(n)?F(n):void 0;if(!r)throw ts(`first`,`@@`,`function`,t);if(!i)throw ts(`second`,`@@`,`function`,n);let a=_n(r),o=_n(i).filter(e=>!a.some(t=>Kr(e[0],t[0])));return ni([...a,...o])}),R(`ToString`,1,e=>Rn(I(L(e,0,`ToString`),!0))),{...Es(`TLCEval`,1,(e,t)=>{let n=qf(Ds(e,0,`TLCEval`)());return t===void 0&&Kf(n),n}),isStateLevel:!1},R(`Permutations`,1,e=>{let t=ns(L(e,0,`Permutations`),`Permutations`).elements;return Yr(Gf(t).map(e=>ti(t.map((t,n)=>[t,e[n]]))))}),ss(`SortSeq`,2,e=>{let t=L(e,0,`SortSeq`),n=Hi(t);if(!n)throw ts(`first`,`SortSeq`,`natural number`,t);let r=as(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw ts(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t={index:a.length};for(;t.index>0&&i(e,a[t.index-1]);)t.index--;a.splice(t.index,0,e)}),fi(a)}),t.version===`1.7.4`?bs({...cs(`TLCGet`,1,(e,n)=>Wf(t,L(e,0,`TLCGet`),n)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):bs(Es(`TLCGet`,1,(e,n)=>Wf(t,Ds(e,0,`TLCGet`)(),n)),`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)`),cs(`TLCSet`,2,n=>{let r=L(n,0,`TLCSet`);return Af(t,e,r,L(n,1,`TLCSet`)),!0}),os(`Any`,Gn),R(`RandomElement`,1,e=>pf(L(e,0,`RandomElement`),t.getRandom()))],Yf=/* @__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(`,`),Xf=[[`\\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`,`≀`],[`^+`,`⁺`]],Zf=/* @__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(`,`),Qf=/* @__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(`.`),$f=/* @__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(`.`),ep=/* @__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
|
-
`]]),yf=/* @__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)`]])]]),bf=E(`EOF`),xf=E(`IDENTIFIER`),Sf=E(`DEFBREAK`),Cf=(e,t)=>Array.from({length:E(t)-E(e)+1},(t,n)=>E(e)+n),wf=new Set(Cf(`op_57`,`op_119`)),Tf=new Set(Cf(`op_1`,`op_119`)),Ef=new Set(Cf(`op_57`,`op_70`)),Df=/* @__PURE__ */ new Set([...Cf(`ACTION`,`EXCEPT`),E(`EXTENDS`),...Cf(`IF`,`SF`),E(`STATE`),...Cf(`THEN`,`WITH`),E(`US`),...Cf(`op_112`,`op_116`)]),U=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),Of=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,`=>`)]),kf=new Map([...Of,...pf.flatMap(e=>e.slice(1).map(t=>[t,Of.get(e[0])]))]),Af=kf.get(`[`),jf={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},Mf=e=>({type:`tokens`,kinds:new Set(e)}),Nf=e=>typeof e==`string`?e.startsWith(`<`)?Mf([E(e.slice(1,-1))]):{type:`call`,name:e}:e,W=(...e)=>({type:`sequence`,units:e.map(Nf)}),G=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:W(e))}),Pf=e=>(...t)=>({type:e,body:W(...t)}),K=Pf(`zeroOrMore`),Ff=Pf(`oneOrMore`),q=Pf(`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}),If=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Lf=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=If(e,n);return n},Rf=(...e)=>{let t=e.map(E);return e=>t.includes(Lf(e,1).kind)},zf=(e,t=Lf(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Bf=e=>{let t=Lf(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Vf=e=>Rf(`CASESEP`)(e)&&zf(e),Hf=e=>{let t=Lf(e,1);Df.has(t.kind)&&(t.kind=xf)},Uf=(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}`,Wf=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),Gf=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Kf=e=>e.operatorStacks[e.operatorStacks.length-1],qf=(e,t)=>e.low>t.high,Jf=(e,t)=>e.high<t.low,Yf=e=>e.fix===`prefix`?e:kf.get(`${e.name}.`),Xf=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===Af?Wf(`FcnAppl`,[n,...r.node.heirs]):Wf(`PostfixExpr`,[n,r.node]),operator:void 0})},Zf=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Wf(`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:Wf(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Qf=e=>{let t=Kf(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 Xf(t,n),Qf(e);if(i.operator!==void 0){let t=Yf(r.operator);return t!==void 0&&qf(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Uf(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 ${Uf(e,a.node.first,a.node.last)} and expression at location ${Uf(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Jf(a.operator,r.operator)?void 0:qf(a.operator,r.operator)?(Zf(t,a.operator),Qf(e)):`Precedence conflict between ops ${a.operator.name} in block ${Uf(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Yf(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Jf(s,r.operator))return;if(!qf(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Uf(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Zf(t,s),Qf(e);let c=Uf(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===jf?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},$f=e=>J(t=>{let n=Kf(t),r=Gf(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:Qf(t)}),ep=$f(()=>!1),tp=$f(()=>!0),np=J(e=>{e.lastOperator=kf.get(e.token.image)}),rp=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},ip=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?rp(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},ap=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!zf(e,n.first.beginColumn))return n;let t=ap(e,n);if(t!==void 0)return t}},op=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(E),n=(e,...t)=>t.some(t=>e.kind===E(t)),r=e=>e!==void 0&&wf.has(e.kind),i=e.token,a=If(e,i);i.next=void 0;let o=If(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===xf&&(e=e.next)}else if(e.kind===xf){let t=e.next;!r(t)||Ef.has(t.kind)||Tf.has(t.kind)&&t.next?.kind!==xf||(e=t.next?.kind===E(`SUBSTITUTE`)?i:Tf.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Sf&&(e.next={kind:Sf,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=If(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},sp=e=>{let t=Lf(e,1);if(t.kind===E(`LAB`)){let n=1;for(;n!==0;)if(t=If(e,t),t.kind===E(`LAB`)&&n++,t.kind===E(`RAB`)&&n--,t.kind===bf)return!1;return If(e,t).kind===E(`IN`)}if(t.kind!==xf)return!1;for(t=If(e,t);t.kind===E(`COMMA`);){if(t=If(e,t),t.kind!==xf)return!1;t=If(e,t)}return t.kind===E(`IN`)},cp=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),lp=e=>e.proofLevels.at(-1)??-1,up=e=>{let t=Lf(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:Rf(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||lp(e)>=0&&cp(t)>lp(e):Rf(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},dp=(e,t)=>{let n=cp(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},fp=e=>J(t=>dp(t,t.token)?void 0:`${Uf(t,t.token)}: ${e}`),pp=Mf([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(E)),mp=Mf([...pp.kinds,E(`op_76`)]),hp=Mf(Tf),gp=Mf(Ef),_p=Mf([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(E)),vp=()=>K(X({expansion:[G(pp,`<op_77>`)],semantic:zf}),G(`PrefixOp`,`InfixOp`),tp),yp=()=>G(W(X({expansion:[`OpenStart`],semantic:zf}),`OpenExpression`,ep),W(X({semantic:zf}),`ExtendableExpr`)),bp=()=>G(W(`<MODULE>`,Y(`identifier`),`Identifier`),`Expression`),xp=()=>G(W(X({semantic:e=>Rf(`ASSUME`,`BOXASSUME`)(e)||Lf(e,2).kind===E(`COLONCOLON`)&&[E(`ASSUME`),E(`BOXASSUME`)].includes(Lf(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Sp=()=>[`JuncItem`,K(X({semantic:Bf}),`JuncItem`)],Cp=e=>J(t=>{t.expecting=e,Hf(t)}),wp=e=>J(t=>{t.isTerminalProof=e}),Tp=(e,...t)=>W(...t.slice(0,-1),Y(`==`),`<DEF>`,J(t=>{op(t),t.expecting=e}),t[t.length-1]),Z=(e,t,n)=>({message:e,body:W(...t),exit:n}),Ep={CompilationUnit:Z(void 0,[J(op),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>`),Cp(`Identifier`),`Identifier`,J(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Z(void 0,[`<END_MODULE>`]),Extends:Z(`Extends`,[q(`<EXTENDS>`,Cp(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,Cp(`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(op)),W(X({semantic:e=>Rf(`USE`)(e)&&Lf(e,2).kind!==E(`ONLY`)||Rf(`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(Tp(`Expression`,X({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,Y(`[`),`<LSB>`,Y(`Identifier`),`QuantBound`,Y(`COMMA or ]`),K(`<COMMA>`,Y(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),Tp(`Expression`,X({expansion:[`<IDENTIFIER>`,gp]}),`PostfixLHS`,`Expression`),Tp(`Expression`,X({expansion:[`<IDENTIFIER>`,hp]}),`InfixLHS`,`Expression`),Tp(`Expression or Instance`,X({expansion:[`<IDENTIFIER>`,G(`<LBR>`,`<DEF>`)]}),`IdentLHS`,G(`Expression`,`Instantiation`)),Tp(`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`,[mp,Y(`Identifier`),`Identifier`]),InfixLHS:Z(`Infix LHS`,[`Identifier`,hp,`Identifier`]),PostfixLHS:Z(`Postfix LHS`,[`Identifier`,gp]),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>`,Cp(`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,[pp,np]),NonExpPrefixOp:Z(void 0,[mp,np]),InfixOp:Z(`Infix Op`,[hp,np]),PostfixOp:Z(void 0,[gp,np]),Identifier:Z(void 0,[`<IDENTIFIER>`]),Assumption:Z(`Assumption`,[Y(`ASSUM...`),G(`<ASSUMPTION>`,`<ASSUME>`),q(X({amount:2}),q(`<DEFBREAK>`),`Identifier`,Y(`==`),`<DEF>`),J(e=>{op(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Z(`Assume-Prove`,[G(W(`Identifier`,`<COLONCOLON>`,`AssumeProve`),W(G(`<ASSUME>`,`<BOXASSUME>`),Y(`Expression, Declaration, or AssumeProve`),xp(),Y("PROVE or `,'"),K(`<COMMA>`,Y(`Expression, Declaration, or AssumeProve`),xp(),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=Gf(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Uf(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(op),G(W(X({amount:3}),X({semantic:Rf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),q(X({semantic:up}),`Proof`)]),Proof:Z(`Proof`,[J(e=>{e.proofLevels.push(-1)}),G(W(X({semantic:e=>Rf(`BY`)(e)||Lf(e,2).kind===E(`BY`)}),`UseOrHideOrBy`),W(X({amount:2}),q(`<PROOF>`),G(`<OBVIOUS>`,`<OMITTED>`)),W(q(X({amount:2}),`<PROOF>`),K(X({semantic:e=>Lf(e,2).kind!==E(`QED`)}),`Step`,Y(`a proof step`)),`QEDStep`)),J(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Z(`UseOrHideOrBy`,[G(W(q(`<PROOF>`),`<BY>`,wp(!0),q(`<ONLY>`)),W(`<USE>`,wp(!1),q(`<ONLY>`)),W(`<HIDE>`,wp(!1))),Y("an expression, `MODULE' or `DEF'"),q(bp(),K(`<COMMA>`,Y(`MODULE or expression`),bp(),J(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),q(`<DF>`,Y(`MODULE or expression`),bp(),K(`<COMMA>`,Y(`MODULE or expression`),bp(),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`),_p,fp(`QED step's number has bad level.`),Y(`QED`),`<QED>`,q(X({semantic:up}),`Proof`)]),Step:Z(`Step`,[Y(`Step number`),_p,fp(`step's number has bad level.`),Y(`proof step`),G(W(X({semantic:Rf(`USE`,`HIDE`)}),`UseOrHideOrBy`),W(X({semantic:Rf(`INSTANCE`)}),`Instantiation`),W(X({semantic:Rf(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),q(X({semantic:up}),J(e=>{let t=Gf(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Uf(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Z(`DefStep`,[q(`<DEFINE>`),Ff(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:Rf(`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(mp,hp,gp),Mf([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(E))],semantic:zf}),G(`NonExpPrefixOp`,W(`InfixOp`,J(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Uf(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),W(X({expansion:[`<LAMBDA>`],semantic:zf}),`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:sp}),G(`IdentifierTuple`,`Identifier`),Y(`\\in`),`<IN>`,`Expression`,Y(`':', ',' or '}'`),q(G(W(`<COLON>`,`Expression`),Ff(`<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=Gf(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`)),Ff(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Z(`Some [] Form`,[`<LSB>`,G(W(X({semantic:sp}),`QuantBound`,K(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({semantic:e=>Lf(e,2).kind===E(`MAPTO`)&&Df.has(Lf(e,1).kind)}),J(e=>{Lf(e,1).kind=xf}),`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=Wf(`FcnAppl`,t.heirs),e.lastOperator=Af})),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>`,Ff(`ExceptComponent`,Y(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Z(`Except Component`,[G(W(`<DOT>`,J(Hf),`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===E(`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=>Vf(e)&&Lf(e,2).kind!==E(`OTHER`)}),`<CASESEP>`,`CaseArm`),q(X({semantic:Vf}),`<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`,[Ff(G(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Z(`AND-OR Junction`,[J(e=>{let t=Lf(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),G(W(X({expansion:[`<OR>`]}),...Sp()),W(X({expansion:[`<AND>`]}),...Sp())),J(e=>{e.junctions.pop()})]),JuncItem:Z(`Junction Item`,[G(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=ap(t,e.heirs[1]);return n&&`Item at ${Uf(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Uf(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([])}),vp(),yp()],(e,t)=>{let n=Kf(t);n.push({node:e.heirs[0],operator:jf});let r=Qf(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`),ep,K(G(W(X({expansion:[`PostfixOp`],semantic:zf}),`PostfixOp`,tp),W(X({expansion:[`<DOT>`],semantic:zf}),`<DOT>`,J(Hf),X({semantic:zf}),`Identifier`,J(e=>{let t=Kf(e);t[t.length-1].operator!==void 0&&Xf(t,t.length),t[t.length-1]={node:Wf(`RecordComponent`,[t[t.length-1].node,Gf(e,2),Gf(e,1)]),operator:void 0}})),W(X({expansion:[`<LSB>`],semantic:zf}),Y(`function argument`),`SBracketCases`,$f(e=>e.kind===`FcnAppl`)))),q(G(W(X({expansion:[`InfixOp`],semantic:zf}),`InfixOp`,tp,vp(),yp()),W(X({expansion:[`<COLONCOLON>`],semantic:zf}),`<COLONCOLON>`,J(e=>{let t=Kf(e);if(!ip(t[t.length-1].node))return`\`::' at ${Uf(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,J(e=>{let t=Kf(e),n=Gf(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Jf(r,e.lastOperator)){let t=Gf(e,3);return`Removing label at ${Uf(e,t.first,t.last)} would change expression parsing.`}t.push({node:Wf(`Label`,[Gf(e,3),Gf(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Z(`Primitive expression`,[G(W(X({expansion:[`String`],semantic:zf}),`String`),W(X({expansion:[`<NUMBER_LITERAL>`],semantic:zf}),`Number`),W(G(`Identifier`,W(G(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),J(e=>lp(e)<0&&e.proofLevels.length<=1?`${Uf(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Uf(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:rp(e.heirs)===void 0?e.heirs.length===1?Wf(`GeneralId`,e.heirs):void 0:Wf(`OpApplication`,e.heirs)}),BangExt:Z(`Bang Extension`,[`<BANG>`,G(W(G(W(X({expansion:[`Identifier`],semantic:e=>Lf(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=>Lf(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Uf(t,n.first,n.last)}`:void 0}),OpenStart:Z(void 0,[G(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},Dp=/* @__PURE__ */ new Map,Op=e=>{let t=Dp.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=Op(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,Op(Ep[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 Dp.set(e,n),n},kp=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},Ap=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=If(e,e.scanPosition)),e.scanPosition=If(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`},jp=(e,t)=>{if(t.type===`tokens`)return Ap(e,t.kinds);if(t.type===`call`)return jp(e,Ep[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||kp(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=jp(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||kp(e,t.semantic)?jp(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=jp(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=jp(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},Mp=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=jp(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},Np=(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||Op(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!Op(a).hasSemanticStart?Op(a).first.has(Lf(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):Mp(e,i,a)&&(o===void 0||o(e))}),Pp=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,jp(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=If(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===bf){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=If(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Ke(e.token.image)}" `},Fp=(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??Pp(e)}\n\nResidual stack trace follows:\n${r}`,!1},Ip=(e,t)=>{let n=If(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,Fp(e))},Lp=(e,t)=>{let n=Ep[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Lf(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!Rp(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 Fp(e,i);let a=r.node??(r.heirs.length===0?void 0:Wf(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},Rp=(e,t)=>{if(t.type===`tokens`)return Ip(e,t.kinds);if(t.type===`call`)return Lp(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||Fp(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||Fp(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||Rp(e,t));if(t.type===`choice`){let n=Np(e,t.alternatives);return n===-1?Fp(e):Rp(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!Rp(e,t.body))return!1;if(t.type===`optional`)return Np(e,[t.body])===-1||Rp(e,t.body);for(;Np(e,[t.body])===0;)if(!Rp(e,t.body))return!1;return!0},zp=e=>{let t=We(e),n={kind:bf,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=Rp(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},Bp={low:15,high:15},Vp={low:16,high:16},Q=(e,t,n)=>({low:e,high:t,isAssociative:n}),Hp=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)]]),Up=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Wp=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Gp=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),Kp=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),qp=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),Jp=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...Up]),Yp=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),Xp=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Zp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Qp=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),$p=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),em=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),tm=/* @__PURE__ */ new Set([``,`*`,`-`]),nm=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),rm=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),im=/* @__PURE__ */ new Set([`NEW`,...rm.keys()]),am=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),om=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),sm=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),cm=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Hp.has(e.operator):Up.has(e.operator)),lm=e=>Hp.has(e)||Up.has(e)||e===`-.`,um=(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}}},dm=(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`},fm=(e,t,n=xe(e))=>{let r=t===`tlapm`,i=r?n:n.map(_e),o={index:0,offsideColumns:[]},s={},c=[],u=/* @__PURE__ */ new Set,d=[],f=[],p=e=>c[c.length-1].has(e),m=e=>({line:e.line,column:r&&e.kind===`String`?e.endColumn:e.column,range:void 0}),h=[],ee=[],g=[],_=(e,t=o.index-1)=>{let n=e===t?g[e]:void 0;if(n)return n;let r=i[t];h[e]??=m(i[e]),ee[t]??={line:r.line,column:r.endColumn};let a={module:f[0].name,start:h[e],end:ee[t]};return e===t&&(g[e]=a),a},v=(e,t)=>(e.location.range=_(t),e),te=(e=0)=>i[Math.min(o.index+e,i.length-1)],y=(e=0)=>{let t=te(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},ne=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),re={index:0},ie=e=>{let t=i.slice(re.index,o.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ae=e=>r&&(e.kind===`Keyword`||sm.has(e.text)),oe=e=>{let t=i.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},se=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:em.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):ae(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,le=(e,t=te(),n)=>{let r=i[i.length-1],a=t.line===r.line&&t.column===r.column;return new l(`${e} at line ${t.line}, column ${t.column}`,void 0,ue(e,t,a,n))},ue=(e,t,n,a)=>{if(r&&n){let e=i[i.length-1];return{reason:`Unexpected EOF`,...ie(oe(e)),isEnd:n}}return r&&a?{reason:`Unexpected ${se(a)}`,...oe(a),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},de=(e,t=te())=>le(e,t,t),fe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ae(e),x=(e,t=0)=>{let n=y(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},S=()=>{let e=y();if(e.kind===`End`)throw le(`Unexpected end of expression`);return o.index++,e},C=e=>x(e)?(o.index++,!0):!1,w=e=>{if(!x(e))throw de(`Expected ${JSON.stringify(e)} but found ${ne(y())}`);return S()},pe=()=>{let e=y();if(e.kind!==`Identifier`)throw de(`Expected an identifier but found ${ne(e)}`);if(ae(e))throw de(`Unexpected keyword ${e.text}`);return o.index++,e.text},me=()=>{let e=o.index;return{name:pe(),range:_(e)}},he=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),ge=()=>{let e=y();return e.kind!==`String`&&(Gp.has(e.text)||Hp.has(e.text)||Up.has(e.text)||e.text===`'`)?(o.index++,e.text):pe()},ve={isUsed:!1},ye=()=>y().kind===`Identifier`||!fe(y())?pe():(ve.isUsed=!0,S().text),be=e=>{if(!r)return e();o.offsideColumns.push(-1);let t=e();return o.offsideColumns.pop(),t},T=(e,t=`,`)=>{let n=[e()];for(;C(t);)n.push(e());return n},Se=()=>{if(x(`<<`)){let e={value:1};for(;y(e.value).kind===`Identifier`||x(`,`,e.value);)e.value++;return x(`>>`,e.value)&&x(`\\in`,e.value+1)}let e={value:0};for(;y(e.value).kind===`Identifier`;){if(x(`\\in`,e.value+1))return!0;if(!x(`,`,e.value+1))return!1;e.value+=2}return!1},Ce=()=>{if(x(`::`))return!0;if(!x(`(`))return!1;let e={value:1};for(;y(e.value).kind===`Identifier`&&x(`,`,e.value+1);)e.value+=2;return y(e.value).kind===`Identifier`&&x(`)`,e.value+1)&&x(`::`,e.value+2)},we=()=>{if(!C(`<<`)){let e=me();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=he(T(me));return w(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},E=()=>T(()=>{let e=T(we);w(`\\in`);let t=D();return e.map(e=>({pattern:e,set:t}))}).flat(),Te=()=>{let e=y();if(e.kind===`Identifier`){let t=o.index,n=[S().text];for(;x(`!`)&&y(1).kind===`Identifier`;)S(),n.push(pe());return v({kind:`Identifier`,name:n.join(`!`),location:m(e)},t)}if(x(`<<`)||x(`(`))return Be();throw de(`Expected a subscript but found ${ne(e)}`)},Ee=e=>{let t=y(1),n=y(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`&&x(`==`,Up.has(n.text)?3:4))},De=e=>{let t=y(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||x(`,`,1)||x(`)`,1)||t.kind===`Keyword`&&Xp.has(t.text)||Ee(e)},Oe=()=>{let e=y(),t=e.kind===`Operator`&&(Hp.has(e.text)||Wp.has(e.text))&&De(e);if(r&&e.kind!==`String`&&(Wp.has(e.text)||Jp.has(e.text)&&e.text!==`'`&&!Up.has(e.text)||qp.has(e.text)&&y(-1).text===`(`&&y(-1).line===e.line&&y(-1).endColumn+1===e.column&&y(1).text===`)`&&y(1).line===e.line&&y(1).column===e.endColumn+1)&&De(e))throw le(`incomplete expression`,e);if(t)return o.index++,v({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:m(e)},o.index-1);if(e.kind!==`String`&&Jp.has(e.text)&&De(e)){o.index++;let t=m(e);if(Up.has(e.text))return v({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return v({kind:`Lambda`,params:[n.name],body:um(e.text,n,t),operator:e.text,location:m(e)},o.index-1)}if(x(`LAMBDA`)){let t=o.index;S();let n=he(T(me));w(`:`);let r=D();return v({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:m(e)},t)}return D()},ke={range:void 0},Ae=()=>be(()=>{let e=o.index;w(`(`);let t=T(Oe);return w(`)`),ke.range=_(e),t}),je=()=>{let e=S();o.offsideColumns.push(e.column);let t=[D()];for(;te().text===e.text&&te().column===e.column;)o.index++,t.push(D());return o.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:m(e)}},Me=e=>be(()=>{let t=m(e),n=y().kind===`Identifier`,i=x(`|->`,1)&&(n||fe(y()));if(i||n&&x(`:`,1)){let e=i?`Record`:`RecordSet`,r=e=>{let t=o.index,n=m(y()),r=e();return n.range=_(t),w(i?`|->`:`:`),{name:r,value:D(),location:n}},a=[r(()=>n?pe():S().text),...C(`,`)?T(()=>r(pe)):[]];return w(`]`),{kind:e,fields:a,location:t}}if(Se()){let e=E();w(`|->`);let n=D();return w(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let a=D();if(C(`->`)){let e=D();return w(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(C(`EXCEPT`)){let e=T(()=>{w(`!`);let e=[];for(;x(`.`)||x(`[`);)if(C(`.`)){if(!fe(y()))throw de(`Expected a field name but found ${ne(y())}`);e.push({kind:`Field`,name:S().text})}else w(`[`),e.push({kind:`Index`,args:T(()=>D())}),w(`]`);return w(`=`),{path:e,value:D()}});return w(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!r&&!x(`]_`)){let e=[a];for(;C(`,`);)e.push(D());return w(`]`),{kind:`Bracket`,args:e,location:t}}return w(`]_`),{kind:`BoxAction`,action:a,subscript:Te(),location:t}}),Ne=()=>{let e=o.index,t=v(He(),e),n=m(S());return v({kind:`Apply`,operator:`\\in`,args:[t,D()],location:n},e)},Pe=e=>be(()=>{let t=m(e);if(C(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(Se()&&(y(1).text===`\\in`||x(`<<`))){let e=o.index,n=we();w(`\\in`);let r=D();if(C(`:`)){let e=D();return w(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o.index=e}let n=y().kind===`Identifier`&&x(`\\in`,1)?Ne():D();if(C(`:`)){let e=E();return w(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;C(`,`);)r.push(D());return w(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Fe=e=>{let t=m(e),n=be(()=>x(`>>`)||x(`>>_`)?[]:T(()=>D()));if(C(`>>_`)){if(n.length!==1)throw le(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:Te(),location:t}}return w(`>>`),{kind:`Tuple`,elements:n,location:t}},Ie=e=>{let t=m(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&Se()){let e=E();return w(`:`),{kind:n,bounds:e,body:D(),location:t}}let i=he(T(me));return w(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:D(),isTemporal:r,location:t}},Le=e=>{let t=[];do{if(C(`OTHER`))return w(`->`),{kind:`Case`,arms:t,other:D(),location:m(e)};let n=D();w(`->`),t.push({condition:n,body:D()})}while(C(`[]`));return{kind:`Case`,arms:t,other:void 0,location:m(e)}},Re=()=>{let e=y(1);return x(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Yp.has(e.text)||e.kind===`Operator`&&(Hp.has(e.text)||Up.has(e.text)||Wp.has(e.text)))},ze=()=>{let e=S();if(e.kind===`Number`)return{kind:`Operand`,operand:ce(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:x(`(`)?Ae():[]}},Be=e=>{let t=o.index,n=S(),i=m(n);if(r&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=T(pe);return w(`:`),{kind:`Lambda`,params:e,body:D(),location:i}}if(n.kind===`Number`){if(r&&/^\\[BOH]/.test(n.text))throw le(`incomplete expression`,n);return{kind:`Number`,value:ce(n.text),text:n.text,location:i}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:i};if(n.kind===`String`)return{kind:`String`,value:n.text,location:i};let a=n.kind===`Step`&&it(n);if(a&&tt()<0&&et.length<=1)throw le(`Step number used outside proof`,n);if(a&&n.text[1]===`+`)throw le(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||a){let c=a?at(n)??n.text:n.text;if(Ce()){let t=he(C(`(`)?T(me):[]);t.names.length>0&&w(`)`),w(`::`);let a=D();if(!r&&e!==void 0&&s.last!==void 0&&cm(a)&&e.high>=s.last.low)throw le(`Removing the label would change expression parsing`,n);return{kind:`Label`,name:c,params:t.names,paramRanges:t.ranges,body:a,location:i}}let l=x(`(`);if(c===`@`&&!l&&!Re())return{kind:`ExceptAt`,location:i};let u=l?Ae():[],d=[l?ke.range:void 0];if(!Re())return l?{kind:`Apply`,operator:c,args:u,argumentsRange:ke.range,location:i}:{kind:`Identifier`,name:c,location:i};let f=[{kind:`Name`,name:c,args:u}],p=[_(t,t)];for(;Re();)S(),p.push(_(o.index,o.index)),ke.range=void 0,f.push(ze()),d.push(ke.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),ee=f.flatMap(e=>`args`in e?e.args:[]),g=f.map(e=>`args`in e?e.args.length:0),v=d.at(-1)??_(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:i}:ee.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:i}:{kind:`Apply`,operator:h,args:ee,...g.slice(0,-1).some(e=>e>0)&&{argumentCounts:g},argumentsRange:v,selectorRanges:p,argumentRanges:d,location:i}}if(n.kind===`Operator`&&lm(n.text)&&x(`(`))return{kind:`Apply`,operator:n.text,spelling:n.spelling,args:Ae(),location:i};if(n.kind===`Operator`&&lm(n.text)&&!r)return{kind:`Identifier`,name:n.text,spelling:n.spelling,location:i};switch(n.text){case`(`:{let e=be(()=>D());return w(`)`),e}case`[`:return Me(n);case`{`:return Pe(n);case`<<`:return Fe(n);case`@`:return{kind:`ExceptAt`,location:i};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Ie(n);case`IF`:{let e=D();w(`THEN`);let t=D();return w(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:D(),location:i}}case`CASE`:return Le(n);case`LET`:{let e=[],t=[];for(c.push(/* @__PURE__ */ new Set);!C(`IN`);){if(r&&x(`RECURSIVE`))throw le(`Unexpected keyword RECURSIVE`,ie(te()));if(C(`RECURSIVE`)){Ze();continue}let n=Ge(!1);n.kind===`Instance`?t.push(n):e.push(n)}c.pop();let n=D();return t.length===0?{kind:`Let`,definitions:e,body:n,location:i}:{kind:`Let`,definitions:e,instances:t,body:n,location:i}}case`CHOOSE`:{let e=we(),t=C(`\\in`)?D():void 0;return w(`:`),{kind:`Choose`,pattern:e,set:t,body:D(),location:i}}case`WF_`:case`SF_`:{let e=Te(),t=be(()=>{w(`(`);let e=D();return w(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:i}}}throw de(`Unexpected ${ne(n)}`,n)},Ve=(e,t,n)=>{s.last=s.preceding={low:t,high:n};let i=D(n+1),a=y(),o=a.text===`'`||Up.has(a.text)?Bp.high:Hp.get(a.text)?.high;if(!r&&a.kind===`Operator`&&o!==void 0&&o>=t)throw le(`Precedence conflict between ${e.text} and ${a.text}`,a);return i},He=()=>{let e=s.preceding;s.preceding=void 0;let t=y(),n=m(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return je();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return S(),{kind:`Apply`,operator:`~`,args:[Ve(t,4,4)],location:n};case`-`:return S(),{kind:`Apply`,operator:`-.`,args:[Ve(t,12,12)],location:n};case`[]`:return S(),{kind:`Always`,expression:Ve(t,4,15),location:n};case`<>`:return S(),{kind:`Eventually`,expression:Ve(t,4,15),location:n};case`ENABLED`:return S(),{kind:`Enabled`,expression:Ve(t,4,15),location:n};case`UNCHANGED`:return S(),{kind:`Unchanged`,expression:Ve(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return S(),{kind:`Apply`,operator:t.text,args:[r?D(9):Ve(t,10,13)],location:n}}return Be(e)},D=(e=0)=>{let t=o.index,n=He(),r={left:n.location.range?n:v(n,t),previous:void 0};for(;;){let n=y();if(n.kind!==`Operator`)break;let i=m(n);if(n.text===`'`&&e<=15){S(),s.last=Bp,r.left=v({kind:`Prime`,expression:r.left,location:i},t);continue}if(Up.has(n.text)&&e<=15){S(),s.last=Bp,r.left=v({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){S();let e=be(()=>T(()=>D()));be(()=>w(`]`)),s.last=Vp,r.left=v({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&fe(y(1))){S();let e=S().text;r.left=v({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let a=Hp.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 le(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(S(),a.low>12&&x(`-`))throw le(`Precedence conflict between ${n.text} and -`,y());s.last=s.preceding=a;let c=D(a.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[_(t).end];r.left=l.kind===e&&o?.text===n.text?{...l,operands:[...l.operands,c],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,c],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&o?.text===`\\X`?{...l,factors:[...l.factors,c]}:{kind:`Product`,factors:[l,c],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,c],location:i};r.left=v(r.left,t),r.previous={...a,text:n.text}}return r.left},Ue=()=>{if(!C(`(`))return[];let e=Xe();return w(`)`),e},We=()=>{let e=m(y()),t=D(),n=i[o.index-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:f[0].name,start:e,end:r}}},Ge=e=>{let t=o.index;return v(qe(e),t)},Ke=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),qe=e=>{let t=y(),n=m(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...We(),isLocal:e,isRecursive:p(t),location:n});if(t.kind===`Identifier`&&y(1).kind===`Operator`&&Hp.has(y(1).text)&&y(2).kind===`Identifier`&&x(`==`,3)){let e=me(),t=S().text,n=me();return w(`==`),r(t,[Ke(e),Ke(n)])}let i=t.kind!==`String`&&Gp.has(t.text),a=t.kind===`Identifier`&&Up.has(y(1).text)&&x(`==`,2);if(i||a){let e=i?t.text:y(1).text;i&&S();let n=me();return a&&S(),w(`==`),r(e,[Ke(n)])}let s=pe();if(C(`[`)){let t=be(()=>E());return w(`]`),w(`==`),{kind:`Function`,name:s,bounds:t,body:D(),isLocal:e,isRecursive:p(s),location:n}}let c=o.index,l=Ue();return w(`==`),x(`INSTANCE`)?{...Je(s,l,e,n),definitionRange:_(c)}:r(s,l)},Je=(e,t,n,r)=>{let i=o.index;return w(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ye(),substitutions:C(`WITH`)?T(()=>{let e=o.index,t=ge(),n=_(e);return w(`<-`),{name:t,nameRange:n,expression:Oe()}}):[],isLocal:n,location:r,instanceRange:_(i)}},Ye=()=>{let e=o.index;return v(O(),e)},O=()=>{let e=m(y());if(x(`_`)&&y(1).kind===`Operator`)return S(),{name:S().text,arity:C(`_`)?2:1,location:e};if(y().kind===`Operator`&&x(`_`,1)){let t=S().text;return S(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=pe();if(!C(`(`))return{name:t,arity:0,location:e};let n=T(()=>w(`_`));return w(`)`),{name:t,arity:n.length,location:e}},Xe=()=>T(Ye),Ze=()=>{let e=Xe();return e.forEach(e=>c[c.length-1].add(e.name)),e},Qe=e=>{let t={value:0,offset:e};do{let e=y(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&am.has(e.text)&&t.value++,e.kind===`Operator`&&om.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},$e=()=>{let e=y(),t=y(1);return e.kind===`Identifier`?x(`(`,1)||x(`[`,1)?x(`==`,Qe(1)):t.kind===`Operator`&&Up.has(t.text)?x(`==`,2):t.kind===`Operator`&&Hp.has(t.text)?y(2).kind===`Identifier`&&x(`==`,3):x(`==`,1):e.kind!==`String`&&Gp.has(e.text)&&t.kind===`Identifier`&&x(`==`,2)},et=[],tt=()=>et[et.length-1]??-1,nt=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),rt=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)},it=e=>!e.text.endsWith(`.`)&&!tm.has(rt(e)),at=e=>{let t=rt(e);if(tm.has(t))return;let n=nt(e);if(n>=0)return`<${n}>${t}`;let r=tt(),i=et[et.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},ot=e=>{if(e.kind===`Keyword`)return Qp.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return et.length===0;if(e.text[1]===`+`||et.length===0)return!0;let t=tt();return t>=0&&nt(e)>t},k=e=>{let t=nt(e),n=et.length-1,r=et[n-1]??-1,i=et[n]<0;return i&&(et[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:et[n]===t},st=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)),A=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!sm.has(e.name)&&!st(e.name):!1,j=()=>{let e=y();return e.kind===`Step`?it(e):e.kind===`Keyword`?nm.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!$e()},ct=()=>{let e=o.index,t=y();return t.kind===`Operator`&&!Kp.has(t.text)&&lm(t.text)?(o.index++,v({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:m(t)},e)):C(`MODULE`)?v({kind:`ModuleFact`,name:pe(),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=y(),n=T(()=>{let e=y();if((e.kind!==`Identifier`||ae(e))&&e.kind!==`Operator`)throw de(`Expected a definition name but found ${ne(e)}`,e);return o.index++,e.text},`!`),r=m(t);return v(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},pt=()=>{if(r)return T(ft);let e=T(ct),n=t===`tlc`?e.find(e=>e.kind===`Identifier`&&dt(e.name)):void 0;if(n)throw le(`DEF clause entry should describe a defined operator`,n.location);return e},mt=()=>({facts:j()?T(ct):[],defs:C(`DEF`)||C(`DEFS`)?pt():[]}),ht=()=>{let e=o.index,n=S(),r=n.text===`USE`&&C(`ONLY`),i=_(e),s={kind:n.text===`USE`?`Use`:`Hide`,isOnly:r,...mt(),keyword:i,location:m(n)},c=s.kind===`Hide`&&t===`tlc`?s.facts.filter(e=>!A(e)):[];if(c.length>0)throw a(c.map(t=>({location:b(t.location.range??_(e)),message:`The only expression allowed as a fact in a HIDE is
|
|
457
|
-
the name of a theorem, assumption, or step.`})));return v(s,e)},gt=()=>{let e=o.index,t=m(y()),n=C(`NEW`),r=y().kind===`Keyword`?rm.get(y().text):void 0;if(!n&&r===void 0)throw de(`Expected a declaration but found ${ne(y())}`);if(r!==void 0&&S(),r===`Variable`){let n=me();return lt(n.name),v({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let i=Ye();lt(i.name);let a=(r??`Constant`)===`Constant`&&x(`\\in`);if(a&&i.arity>0)throw le(`declared symbol with arguments before \\in`);return a&&S(),v({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(w(`ASSUME`)),n=T(()=>x(`ASSUME`)?ut(_t):y().kind===`Keyword`&&im.has(y().text)?gt():D());return w(`PROVE`),v({kind:`AssumeProve`,assumptions:n,conclusion:D(),location:t},e)},vt=e=>{let t={value:0};for(;y(t.value).kind===`Identifier`&&x(`,`,t.value+1);)t.value+=2;return y(t.value).kind===`Identifier`&&x(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=y();if(x(`USE`)||x(`HIDE`))return ht();if(x(`INSTANCE`)){let t=o.index;return v(Je(void 0,[],!1,m(e)),t)}if(x(`DEFINE`)||$e()){let t=o.index;C(`DEFINE`);let n=[Ge(!1)];for(;$e();)n.push(Ge(!1));let r={kind:`Define`,definitions:n,location:m(e)};return v(r,t)}if(C(`HAVE`))return{kind:`Have`,expression:D()};if(C(`TAKE`)){let e=Se(),t=he(e?[]:T(me)),n=e?E():[];return yt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(C(`WITNESS`))return{kind:`Witness`,expressions:T(()=>D())};if(C(`PICK`)){let e=vt(`:`),t=he(e?T(me):[]),n=e?[]:E();return yt(t.names,n),w(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:D()}}return C(`CASE`)?{kind:`Case`,expression:D()}:{kind:`Assert`,isSuffices:C(`SUFFICES`),statement:x(`ASSUME`)?_t():D()}},xt=e=>{let t=y();if(t.kind!==`Step`)throw de(`Expected a step number but found ${ne(t)}`,t);if(!k(t))throw le(`${e?`QED step`:`step`}'s number has bad level`,t);if(nt(t)<0&&at(t)!==void 0)throw le(`<*> and <+> cannot be used for a named step`,t);return o.index++,{name:at(t),token:t.text,location:m(t)}},St=()=>{let e=o.index,t=xt(x(`QED`,1)),n=o.index,r=/* @__PURE__ */ new Set;d.push(r);let i=C(`QED`)?{kind:`Qed`}:bt(),a=_(e),s=_(n),c=ot(y());if(c&&!$p.has(i.kind))throw le(`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),v({...t,body:i,head:a,statement:s,proof:l},e)},Ct=()=>{let e=m(y());if(x(`BY`)||x(`PROOF`)&&x(`BY`,1)){C(`PROOF`),S();let t=_(o.index-1);return{kind:`By`,isOnly:C(`ONLY`),...mt(),keyword:t,location:e}}let t=y(+!!x(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){C(`PROOF`),S();let n=_(o.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}C(`PROOF`);let n=[St()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(St());return{kind:`Steps`,level:tt(),steps:n,location:e}},wt=()=>{let e=o.index;et.push(-1);let t=ut(Ct);return et.pop(),v(t,e)},Tt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},Et=e=>{let t=o.index,n=S(),r=y().kind===`Identifier`&&x(`==`,1)?pe():void 0;r!==void 0&&(u.add(r),S());let i=ut(()=>({statement:x(`ASSUME`)?_t():D(),proof:ot(y())?wt():void 0})),a=i.statement,s=v({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,v({kind:`Operator`,name:r,params:[],body:a,isLocal:!1,isRecursive:!1,location:m(n)},t))},Dt=()=>{let e=o.index,t=S(),n=y().kind===`Identifier`&&x(`==`,1)?pe():void 0;return n!==void 0&&(u.add(n),S()),v({name:n,expression:D(),isAxiom:t.text===`AXIOM`,location:m(t)},e)},Ot=()=>{let e=m(w(`----`));w(`MODULE`);let t=ye();w(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(f.push(n),c.push(/* @__PURE__ */ new Set),C(`EXTENDS`)&&T(()=>{let e=o.index;n.extends.push(ye()),n.extendsRanges.push(_(e))});;){let t=o.index;re.index=t;let r=y();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(),c.pop(),n;if(r.kind===`Separator`){if(x(`MODULE`,1)){let e=Ot();n.modules.push(e),n.units.push({kind:`Module`,module:e}),w(`====`);continue}S()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=m(S()),r=Xe();n.constants.push(...r),e.range=_(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=m(S()),r=T(()=>{let e=o.index,t=m(y());return v({name:pe(),arity:0,location:t},e)});n.variables.push(...r),e.range=_(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(x(`USE`)&&x(`ONLY`,1))throw de(`Expected a module unit but found ${ne(r)}`);let e=ht();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:S(),n.units.push({kind:`Recursive`,declarations:Ze()});continue;case`INSTANCE`:kt(n,v(Je(void 0,[],!1,m(r)),t));continue;case`LOCAL`:if(S(),x(`INSTANCE`)){kt(n,v(Je(void 0,[],!0,m(r)),t));continue}kt(n,v(qe(!0),t));continue}r.kind===`Keyword`&&Zp.has(r.text)?Et(n):kt(n,Ge(!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=ve.isUsed?zp(e):void 0;if(jt!==void 0)throw new l(jt);return At},pm=e=>fm(e,`tlc`),mm=(e,t)=>fm(e,`tlc`,t),hm=e=>fm(e,`tlapm`),gm=e=>fm(e,`sany`),_m=10454148508367108822n,vm=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:_m);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),ym=Int32Array.from(vm,e=>Number(BigInt.asIntN(32,e>>32n))),bm=Int32Array.from(vm,e=>Number(BigInt.asIntN(32,e))),xm=Number(BigInt.asIntN(32,_m>>32n)),Sm=Number(BigInt.asIntN(32,_m));let Cm=xm,wm=Sm;const Tm=e=>{let t=(e^wm)&255;wm=(wm>>>8|Cm<<24)^bm[t],Cm=Cm>>>8^ym[t]},Em=(()=>{let e=[ym],t=[bm];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)^bm[t],a[e]=r[e]>>>8^ym[t]}e.push(a),t.push(o)}return{highs:e,lows:t}})(),Dm=Em.highs[0],Om=Em.highs[1],km=Em.highs[2],Am=Em.highs[3],jm=Em.lows[0],Mm=Em.lows[1],Nm=Em.lows[2],Pm=Em.lows[3],Fm=e=>{let t=wm^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;wm=Cm^Pm[n]^Nm[r]^Mm[i]^jm[a],Cm=Am[n]^km[r]^Om[i]^Dm[a]},Im=e=>{if(typeof e==`boolean`)return Tm(0),Tm(e?116:102),2;if(typeof e==`number`)return Tm(1),Fm(e),5;if(typeof e==`string`){Tm(3),Fm(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)Fm(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++)Tm(e.charCodeAt(n));return 5+e.length}return Tm(21),Fm(Ot(e.name)+1),5},Lm=e=>{if(typeof e!=`object`||j(e))Im(e);else if(A(e)){let t=I(e);Tm(9),Fm(t.domain.length);for(let e=0;e<t.domain.length;e++)Lm(t.domain[e]),Lm(t.range[e])}else{let t=P(e).elements;Tm(5),Fm(t.length);for(let e of t)Lm(e)}},Rm=e=>{let t={high:Cm,low:wm};Cm=xm,wm=Sm;for(let t of e)Lm(t);let n=BigInt(Cm>>>0)<<32n|BigInt(wm>>>0);return Cm=t.high,wm=t.low,n},zm=(e,t)=>{let n=new BigInt64Array(e.length),r=new Int32Array(n.buffer),i=Cm,a=wm;return e.forEach((e,n)=>{Cm=xm,wm=Sm;for(let n of t)Lm(e[n]);r[2*n]=wm,r[2*n+1]=Cm}),Cm=i,wm=a,n},Bm=25214903917n,Vm=(1n<<48n)-1n,Hm=2147483647,Um=e=>{let t={value:(BigInt.asUintN(64,e)^Bm)&Vm},n=e=>(t.value=t.value*Bm+11n&Vm,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Bm)&Vm},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<=Hm)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Wm=[],Gm=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Km=()=>{for(let e=1277011;Wm.length<1341;e++)Gm(e)&&Wm.push(e);return Wm},qm=e=>{let t=Km(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},Jm=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},Ym=e=>{for(let t=Math.max(e,9);;t++){let e=Jm(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)}}},Xm=(e,t,n)=>{if(t<=0)return[];let r=Ym(t),i={index:BigInt(n.nextInt(t))},a=BigInt(qm(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},Zm=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Hm),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},Qm=(1n<<63n)-1n-24n,$m=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Qm*BigInt(n)+i)%t;return r<0n?r+t:r})},eh=(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,th=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Kn(e.domain),n=P(e.range).elements;return{lists:t.map(()=>n),create:e=>zt(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>P(e).elements),create:t=>Jn(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>P(e).elements),create:M}}},nh=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,rh=(e,t,n,r)=>{if(F(t))return[];let i=r===`1.7.4`?Zm:Xm;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=nh(t,r)?void 0:th(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Hm)?$m(e,t,n):i(e,Number(t),n)).map(e=>a.create(eh(a.lists,e)))}let o=P(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},ih=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new h(`RandomElement of the empty set`);return n},ah=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...Kn(e.domain)];return zt(n,n.map(()=>ah(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Jn(e.names.map((n,r)=>[n,ah(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return M(e.factors.map(e=>ah(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new h(`RandomElement of the empty set`);return e.low+r}return ih(P(e).elements,t)},oh=(e,t=0n)=>{let n=Um(t),r={random:Um(t),seededState:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Jn([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Rm,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},sh=e=>Rn([...e.possibleCounts].map(([e,t])=>[e,t])),ch=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,sh(e)]]),lh=`----------------------------- MODULE Bags --------------------------------
|
|
403
|
+
`]]),tp=/* @__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)`]])]]),np=`----------------------------- 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
|
+
`,rp=/* @__PURE__ */ new Map([[`Bags`,np],[`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
|
+
`]]),ip=new Map([...[...rp].filter(([e])=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e)),[`Bags`,np.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
|
-
`]]),fh=(e=`master`)=>e===`1.7.4`?dh:uh,ph=(e,t,r)=>new n(`Applying ${e} to the following value,\nwhich is not ${t}:\n${L(r)}`),mh=e=>A(e)?I(e):void 0,hh=(e,t,n)=>{let r=R(e,t,n),i=mh(r);if(!i)throw ph(n,`a function with a finite domain`,r);return i},gh=(e,t,n)=>{let r=R(e,t,n),i=mh(r);if(!i)throw fi(t===0?`first`:`second`,n,`bag`,r);return i},_h=(e,t)=>{if(!k(e)||!N(e))throw t();return P(e).elements},vh=e=>e.range.every(e=>typeof e==`number`&&e>0),yh=(e,t)=>{let n=e.domain.findIndex(e=>Xt(e,t));return n===-1?void 0:e.range[n]},bh=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,xh=bh(`BagDiff`,`tlc2.value.impl.Value`,2),Sh=bh(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Ch=bh(`BagUnion`,`tlc2.value.impl.Value`,1),wh=bh(`BagOfAll`,`tlc2.value.impl.Value`,2),Th=bh(`BagCup`,`tlc2.value.impl.Value`,2),Eh=bh(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Dh=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Mi(e)}`;throw Pi(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')`)},Oh=(e,t,n)=>{let r=Dh(e,n)+Dh(t,n);if(Ei(r))throw Di(`${e}+${t}`);return r},kh=(e,t,n,r)=>{let i=yh(n,e.domain[t]),a=Dh(e.range[t],r);return i===void 0?a:a-Dh(i,r)|0},Ah=(e,t)=>Rn(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>Xt(e[0],r));a?a[1]=Oh(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),jh=zt([],[]),Mh=e=>[Si(`EmptyBag`,jh),z(`IsABag`,1,e=>{let t=mh(R(e,0,`IsABag`));return t!==void 0&&vh(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`);return hh(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw ph(`BagCardinality`,`a bag`,t);return Oh(e,n,Eh)},0)}),z(`BagIn`,2,e=>{let t=R(e,1,`BagIn`),n=yh(hh(e,1,`BagIn`),R(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw fi(`second`,`BagIn`,`bag`,t);return n>0}),z(`CopiesIn`,2,e=>{let t=R(e,1,`CopiesIn`),n=yh(hh(e,1,`CopiesIn`),R(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw fi(`second`,`CopiesIn`,`bag`,t);return n}),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=gh(e,t,`(+)`);if(!vh(n))throw fi(t===0?`first`:`second`,`(+)`,`bag`,R(e,t,`(+)`));return n});return Ah(t,Th)}),z(`\\ominus`,2,e=>{let t=gh(e,0,`(-)`),n=gh(e,1,`(-)`);return Rn(t.domain.flatMap((e,r)=>{let i=kh(t,r,n,xh);return i>0?[[e,i]]:[]}))}),z(`BagUnion`,1,e=>{let t=R(e,0,`BagUnion`),r=_h(t,()=>ph(`BagUnion`,`a finite enumerable set`,t));if(r.length<2)return r[0]??jh;let i=r.map(e=>{let r=mh(e);if(!r)throw new n(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${L(t)}`);return r});return Ah(i,Ch)}),z(`\\sqsubseteq`,2,e=>{let t=hh(e,0,`\\sqsubseteq`),n=hh(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>kh(t,r,n,Sh)<=0)}),Ci(`BagOfAll`,2,e=>{let t=xi(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new n(`The first argument of BagOfAll should be an operator, but instead it is:\n${L(t.literalBody)}`);let r=R(e,1,`BagOfAll`),i=mh(r);if(!i)throw fi(`second`,`BagOfAll`,`function with a finite domain`,r);return Ah(i.domain.map((e,n)=>zt([t.call([e])],[i.range[n]])),wh)}),z(`SubBag`,1,t=>{let n=R(t,0,`SubBag`);if(!A(n))throw new h(`DOMAIN expects a function but received ${L(n)}`);let r=I(n),i=Mn(r.range).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new h(`Attempted to apply a function to ${L(r)}, which is not in its domain`);return Mn(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>zt(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>Fr(hh(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=_h(t,()=>ph(`BagToSet`,`a function with a finite domain`,t));return zt([...n],n.map(()=>1))})],Nh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Ph=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,Fh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Ih=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Lh=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Rh=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,zh=e=>{if(!A(e))return!1;let t=I(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},Bh=(e,t)=>Pi(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Mi(t)}`),Vh=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Hh=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw Bh(t,e);return`[${P(e).elements.map(e=>Wh(e,t)).join(`,`)}]`},Uh=(e,t)=>{let n=I(e),r=vr(n);return r?`[${r.map(e=>Wh(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Vh(typeof e==`string`?e:L(e))}:${Wh(n.range[r],t)}`).join(`,`)}}`},Wh=(e,t)=>typeof e==`string`?Vh(e):typeof e==`object`?e.kind===`ModelValue`?Vh(e.name):k(e)?Hh(e,t):Uh(e,t):String(e),Gh=e=>{if(k(e))return Hh(e,Nh);if(!A(e)||zh(e))throw Bh(Nh,e);return Uh(e,Nh)},Kh=e=>{if(!A(e))throw Bh(Ph,e);return Uh(e,Ph)},qh=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))},Jh=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Et(e);if(Array.isArray(e))return M(e.map(e=>Jh(e,t)));if(typeof e==`object`&&e)return Jn(Object.entries(e).map(([e,n])=>[Et(e),Jh(n,t)]));throw Pi(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Yh=(e,t)=>{if(e.trim()===``)return Jh(null,t);try{return Jh(JSON.parse(e,(e,t,n)=>typeof t==`number`?qh(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Pi(t,e.message):e}},Xh=(e,t)=>{if(typeof e!=`string`)throw Pi(t,`Cannot cast tlc2.value.impl.${Mi(e)} to tlc2.value.impl.StringValue`);return e},Zh=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Pi(n,`${t} (No such file or directory)`);return r},Qh=e=>[wi(`ToJson`,1,e=>Et(Wh(R(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),wi(`ToJsonArray`,1,e=>Et(Gh(R(e,0,`ToJsonArray`)))),wi(`ToJsonObject`,1,e=>Et(Kh(R(e,0,`ToJsonObject`)))),wi(`JsonSerialize`,2,t=>{let n=Xh(R(t,0,`JsonSerialize`),Fh),r=R(t,1,`JsonSerialize`);if(!vr(r)&&!zh(r))throw fi(`second`,`JsonSerialize`,`sequence or record`,r);return e.writeFile?.(n,Wh(r,Fh)),!0}),wi(`ndJsonSerialize`,2,t=>{let n=Xh(R(t,0,`ndJsonSerialize`),Ih),r=R(t,1,`ndJsonSerialize`),i=vr(r);if(!i)throw fi(`second`,`ndJsonSerialize`,`sequence`,r);return e.writeFile?.(n,i.map(e=>`${Wh(e,Ih)}\n`).join(``)),!0}),wi(`JsonDeserialize`,1,t=>{let n=Xh(R(t,0,`JsonDeserialize`),Lh);return Yh(Zh(e,n,Lh),Lh)}),wi(`ndJsonDeserialize`,1,t=>{let n=Xh(R(t,0,`ndJsonDeserialize`),Rh);return M(Zh(e,n,Rh).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Yh(e,Rh)))})],$h=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,eg=1e6,tg=(e,t,n)=>{if(typeof e!=`number`||e<0)throw fi(t,n,`nonnegative integer`,e);return e},ng=(e,t,n,r)=>Mn(Array.from({length:t},()=>Mn(e.filter(()=>r.nextDouble()<n)))),rg=(e,t)=>{let n=`RandomSetOfSubsets`,r=tg(R(e,0,n),`first`,n),i=tg(R(e,1,n),`second`,n),a=R(e,2,n);if(!k(a)||!N(a))throw fi(`third`,n,`finite set`,a);let o=P(a).elements;if(o.length<31&&r>2**o.length)throw fi(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw fi(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return ng(o,r,o.length===0?0:i/o.length,t.getRandom())},ig=e=>[wi(`RandomSubset`,2,t=>{let n=R(t,0,`RandomSubset`);if(typeof n!=`number`)throw fi(`first`,`RandomSubset`,`nonnegative integer`,n);if(n<0)throw Pi($h,String(n));let r=R(t,1,`RandomSubset`);if(!k(r)||!F(r)&&!N(r))throw fi(`second`,`RandomSubset`,`a finite set`,r);let i=nh(r,e.version);if(i&&i.reduce((e,t)=>e*P(t).elements.length,1)>eg)throw Pi($h,`Attempted to construct a set with too many elements (>${eg}).`);return Mn(rh(n,r,e.getRandom(),e.version))}),wi(`RandomSetOfSubsets`,3,t=>rg(t,e)),wi(`TestRandomSetOfSubsets`,3,t=>M(Array.from({length:5},()=>P(rg(t,e)).elements.length)))],ag=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,og=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${ag})`,sg=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${ag}) throws java.io.IOException`,cg=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${ag})`,lg=e=>Jn([[`name`,e??`UnnamedAction`],[`location`,Jn([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),ug=(e,t,n)=>{let r=e.map((e,t)=>M([t+1,Jn(Object.entries(e))])),i=r.slice(1).map((e,n)=>M([r[n],t[n],e])),a=n?[M([r[r.length-1],n.action,r[n.start]])]:[];return Jn([[`action`,Mn([...i,...a])],[`state`,Mn(r)]])},dg=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return ch(e).get(t)},fg=(e,t,r,i)=>{if(typeof r==`number`&&r>=0)e.registers.set(r,i);else if(r===`exit`)i===!0&&(e.isStopped=!0);else if(r===`pause`){if(i!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))e.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))e.properties.set(r.slice(2),L(i));else throw new n(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${L(r)}`)},pg=e=>e.every(e=>e!==void 0),mg=(e,t)=>Jn(t.variables.map((t,n)=>[t,e[n]])),hg=(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&&!O(e)){if(t.variableIndex.has(r))return!0;let e=Mu(r,t);if(e&&!n.has(e)&&(n.add(e),hg(e.body,t,n)))return!0}return Ye(e).some(e=>hg(e,t,n))},gg=(t,r)=>{let i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new WeakMap,o=e=>{let t=a.get(e)??/* @__PURE__ */ new Map;return a.set(e,t),t};return[z(`AssertEq`,2,e=>{let n=R(e,0,`AssertEq`),r=R(e,1,`AssertEq`),i=Xt(n,r);return i||(t(L(`Assertion failed`,!0)),t(L(n,!0)),t(L(r,!0))),i}),Vi(`AssertError`,2,e=>{let t=xi(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw Pi(og,`In computing AssertError, a non-string expression (line ${t.location.line}, col ${t.location.column}) was used as the err of an AssertError(err, exp).`);let n=Hi(e,0,`AssertError`)();try{Hi(e,1,`AssertError`)()}catch(e){if(e instanceof h)return _a(e.message,r.isTool)===n;throw e}return!1}),wi(`TLCGetOrDefault`,2,e=>{let t=R(e,0,`TLCGetOrDefault`);return dg(r,t)??R(e,1,`TLCGetOrDefault`)}),{...Ci(`TLCGetAndSet`,4,e=>{let n=R(e,0,`TLCGetAndSet`),i=dg(r,n)??R(e,3,`TLCGetAndSet`),a=xi(e,1,`TLCGetAndSet`);return fg(r,t,n,a.call([i,R(e,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},wi(`Trace`,0,(e,t)=>{let n=t?.state;if(!t||!n||!pg(n)){let e=(t?.environment.variables??[]).filter((e,t)=>n?.[t]===void 0);throw Pi(sg,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return M(r.getBehavior(n).map(e=>mg(e,t.environment)))}),wi(`CounterExample`,0,()=>r.counterExample??Jn([[`action`,Mn([])],[`state`,Mn([])]])),z(`ToTrace`,1,e=>{let t=R(e,0,`ToTrace`);if(!A(t)||!Xt(Fr(t),Mn([`action`,`state`])))throw new h(`The argument of ToTrace should be a CounterExample, but instead it is:\n${L(t)}`);let n=P(Nr(t,`state`)).elements.map(e=>vr(e)??[]);return M(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,e=>{let t=R(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new n(`The argument of ModelValue should be a string, but instead it is:\n${L(t)}`);return Lt(t)}),Vi(`TLCDefer`,1,()=>!0),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),Vi(`PickSuccessor`,1,(t,n)=>{let i=n?.next;if(!i||!pg(i))throw Pi(cg,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(r.isSeen(i)||ju(Hi(t,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new e(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Vi(`TLCCache`,2,(e,t)=>{let n=xi(e,0,`TLCCache`),r=ei(Hi(e,1,`TLCCache`)()),a=n.expression;if(!a||!t)return n.call([]);let s=hg(a,t.environment,/* @__PURE__ */ new Set)&&t.state?o(t.state):i,c=s.get(a)??/* @__PURE__ */ new Map;s.set(a,c);let l=c.get(r);if(l!==void 0)return l;let u=n.call([]);return c.set(r,u),u}),z(`TLCFP`,1,e=>Number(BigInt.asIntN(32,Rm([R(e,0,`TLCFP`)])))),wi(`TLCEvalDefinition`,1,(e,t)=>{let r=R(e,0,`TLCEvalDefinition`),i=typeof r==`string`&&t?Mu(r,t.environment):void 0;if(!i||typeof r!=`string`||!t)throw new n(`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)throw new n(`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},t)})]},_g=(e,t)=>[wi(`_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}),wi(`_Counts`,0,()=>sh(t)),wi(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(sh(t),!0)),!1)}),wi(`_PrintCounts`,0,()=>(e(L(sh(t),!0)),!0))],vg=e=>String(e).padStart(2,`0`),yg=e=>`${e.getUTCFullYear()}.${vg(e.getUTCMonth()+1)}.${vg(e.getUTCDate())}.${vg(e.getUTCHours())}${vg(e.getUTCMinutes())}${vg(e.getUTCSeconds())}`,bg=e=>Rn([...e].map(([e,t])=>[e,M([t])])),xg=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Sg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Cg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),wg=(e,t,r)=>{if(e.version===`1.7.4`?!Sg.has(t)||!e.isStarted&&Cg.has(t):!e.isStarted&&xg.has(t))throw new n(`TLCGet(${t}) was undefined.`);let i=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return r===void 0?0:e.getLevel(r);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return i;case`stats`:return Jn([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,i],[`worker`,0]]);case`config`:return Jn([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Jn([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Et(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Et(yg(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return lg(void 0);case`all`:return bg(e.registers);case`all:named`:return bg(ch(e))}if(t.startsWith(`s:`)){let r=ch(e).get(t);if(r===void 0)throw new n(`TLCGet(${t}) was undefined.`);return r}if(t.startsWith(`-D`))return Et(e.properties.get(t.slice(2))??t);throw new n(`TLCGet(${t}) was undefined.`)},Tg=(e,t,r)=>{if(typeof t==`number`&&t>=0){let r=e.registers.get(t);if(r===void 0)throw new n(`TLCGet(${t}) was undefined.`);return r}if(typeof t!=`string`)throw new n(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${L(t)}`);return wg(e,t,r?.state)},Eg=e=>e.length===0?[[]]:e.flatMap((t,n)=>Eg([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Dg=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&P(e).elements.forEach(Dg),e.kind===`Function`&&e.range.forEach(Dg))},Og=(e,t)=>[z(`Print`,2,t=>(e(`${at(L(R(t,0,`Print`),!0,!0))} ${at(L(R(t,1,`Print`),!0,!0))}`),R(t,1,`Print`))),z(`PrintT`,1,t=>(e(at(L(R(t,0,`PrintT`),!0,!0))),!0)),z(`Assert`,2,e=>{if(R(e,0,`Assert`)!==!0)throw new n(`The first argument of Assert evaluated to FALSE; the second argument was:\n${at(L(R(e,1,`Assert`)))}`,m.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>Rn([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=bi(e,0,`@@`),n=bi(e,1,`@@`);return zn([...pt(t),...pt(n)])}),z(`ToString`,1,e=>Et(L(R(e,0,`ToString`),!0))),z(`TLCEval`,1,e=>{let t=R(e,0,`TLCEval`);return Dg(t),t}),z(`Permutations`,1,e=>{let t=vi(e,0,`Permutations`);return Mn(Eg(t).map(e=>Rn(t.map((t,n)=>[t,e[n]]))))}),Ci(`SortSeq`,2,e=>{let t=xi(e,1,`SortSeq`);return M(yi(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)]},[]))}),t.version===`1.7.4`?Fi({...wi(`TLCGet`,1,(e,n)=>Tg(t,R(e,0,`TLCGet`),n)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Fi(Vi(`TLCGet`,1,(e,n)=>Tg(t,Hi(e,0,`TLCGet`)(),n)),`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)`),wi(`TLCSet`,2,n=>{let r=R(n,0,`TLCSet`);return fg(t,e,r,R(n,1,`TLCSet`)),!0}),Si(`Any`,Nt),z(`RandomElement`,1,e=>ah(_i(e,0,`RandomElement`),t.getRandom()))],kg=(e,t)=>e.every(e=>Sr(e,t)),Ag=Mn([!1,!0]),jg=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Ln(jg(e,t,r),jg(e,r,n))},Mg=[`\\cup`,`\\cap`,`\\`],Ng=e=>typeof e==`object`&&e.kind===`MixedSet`,Pg=(e,t,n)=>{let r=t.kind===`Interval`?P(t).elements:t.elements;if(e!==`\\cup`){let t=e===`\\cap`;return Nn(r.filter(e=>Sr(e,n)===t))}if(r.length===0)return n;if(!st(n))return Kt({kind:`SetOperation`,operator:e,left:t,right:n});let i=P(n).elements.filter(e=>!Sr(e,t));return Nn([...r,...i])},Fg=[Si(`TRUE`,!0),Si(`FALSE`,!1),Si(`BOOLEAN`,Ag),Si(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Ti(`=`,An),Ti(`#`,(e,t)=>!An(e,t)),z(`~`,1,e=>!hi(e,0,`~`)),z(`<=>`,2,e=>hi(e,0,`<=>`)===hi(e,1,`<=>`)),z(`/\\`,2,e=>hi(e,0,`/\\`)&&hi(e,1,`/\\`)),z(`\\/`,2,e=>hi(e,0,`\\/`)||hi(e,1,`\\/`)),z(`=>`,2,e=>!hi(e,0,`=>`)||hi(e,1,`=>`)),z(`\\in`,2,e=>Sr(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!Sr(R(e,0,`\\notin`),R(e,1,`\\notin`))),z(`\\subseteq`,2,e=>{let t=gi(e,0,`\\subseteq`),n=R(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&N(t.base)?kg(P(t.base).elements,n.base):kg(P(t).elements,n)}),...Mg.map(e=>z(e,2,t=>{let n=R(t,0,e),r=R(t,1,e);if(st(n)&&st(r)&&!Ng(n)&&!Ng(r)){if(e===`\\cup`&&F(n))return r;let t=e===`\\cup`?Ln:e===`\\cap`?In:Fn;return xr((e,n)=>t(P(e),P(n)),(t,n)=>Pg(e,t,n),n,r)}return st(n)?Pg(e,n,r):e!==`\\`&&st(r)?Pg(e,r,n):Kt({kind:`SetOperation`,operator:e,left:n,right:r})})),z(`SUBSET`,1,e=>({kind:`Subset`,base:R(e,0,`SUBSET`)})),z(`UNION`,1,e=>{let t=gi(e,0,`UNION`),n=ct(t)?t.elements.filter(ct):[];if(!ct(t)||n.length!==t.elements.length)return Kt({kind:`Union`,base:t});if(Ng(t)||n.some(Ng)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{Sr(t,e)||e.elements.push(t)})),Nn(e.elements)}return n.length===0?Pn:jg(n.map(P),0,n.length)}),z(`DOMAIN`,1,e=>{let t=R(e,0,`DOMAIN`);if(!A(t))throw new h(`DOMAIN expects a function but received ${L(t)}`);return Fr(t)})],Ig=Li(`Integers`,`Neg`,`IntValue`,1),Lg=e=>{let t=Li(e,`DotDot`,`IntervalValue`,2);return[Ri(e,`+`,`Plus`,(e,t)=>e+t),Ri(e,`-`,`Minus`,(e,t)=>e-t),Ri(e,`*`,`Times`,(e,t)=>e*t),Ri(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new n(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new n(`0^0 is undefined.`);return e**t}),Ri(e,`\\div`,`Divide`,(t,r)=>{if(r===0)throw new n(`The second argument of \\div is 0.`);if(e===`Naturals`){let e=Math.trunc(t/r)|0;return e<0&&Math.imul(e,r)!==t?e-1:e}let i=Math.floor(t/r);if(Ei(i))throw Di(`${t} \\div ${r}`);return i}),Ri(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new n(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),z(`..`,2,e=>({kind:`Interval`,low:Ii(R(e,0,`..`),t),high:Ii(R(e,1,`..`),t)}))]},Rg=Lg(`Naturals`),zg=Lg(`Integers`),Bg=e=>{let t=Rg.indexOf(e);return t===-1?void 0:zg[t]},Vg=[Si(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Rg,Bi(`<`,(e,t)=>e<t),Bi(`>`,(e,t)=>e>t),Bi(`<=`,(e,t)=>e<=t),Bi(`>=`,(e,t)=>e>=t,`>`)],Hg=[Si(`Int`,{kind:`InfiniteSet`,name:`Int`}),...zg,Bi(`>=`,(e,t)=>e>=t),z(`-.`,1,e=>{let t=Ii(R(e,0,`-`),Ig);if(Ei(-t))throw Di(`-${t}`);return-t})],Ug=(e,t,r)=>{let i=R(e,t,r),a=vr(i);if(!a)throw new n(`${r}\n${L(i)}`);return a},Wg=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:Ug(e,t,n)},Gg=(e,t,n)=>typeof e==`string`?Et(e.slice(t,n)):M(e.slice(t,n)),Kg=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,qg=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Jg=(e,t)=>{let n=yf.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Fi(e,t):e}):t},Yg=e=>Jg(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>Wg(e,0,Kg(``,`Len`)).length),z(`\\o`,2,e=>{let t=Wg(e,0,qg(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Ug(e,1,qg(`t \\o s`,`sequence`));return M([...t,...n])}let r=R(e,1,`\\o`);if(typeof r!=`string`)throw new n(`${qg(`t \\o s`,`string`)}\n${L(r)}`);return Et(t+r)}),z(`Append`,2,t=>M([...Ug(t,0,qg(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(t,1,`Append`)])),z(`Head`,1,e=>{let t=Ug(e,0,Kg(``,`Head`));if(t.length===0)throw new n(`Attempted to apply Head to the empty sequence.`);return t[0]}),z(`Tail`,1,e=>{let t=Wg(e,0,Kg(``,`Tail`));if(t.length===0)throw new n(`Attempted to apply Tail to the empty sequence.`);return Gg(t,1)}),z(`SubSeq`,3,e=>{let t=Wg(e,0,Kg(`first `,`SubSeq`)),r=mi(e,1,`SubSeq`),i=mi(e,2,`SubSeq`);if(r>i)return Gg(t,0,0);let a=r<1||r>t.length?{position:`second`,value:r}:i>t.length?{position:`third`,value:i}:void 0;if(a)throw new n(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${L(R(e,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return Gg(t,r-1,i)}),Ci(`SelectSeq`,2,e=>{let t=xi(e,1,`SelectSeq`);return M(Ug(e,0,Kg(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw fi(`second`,`SelectSeq`,`operator`,n);return n}))})]),Xg=e=>Jg(`FiniteSets`,[z(`IsFiniteSet`,1,e=>{let t=R(e,0,`IsFiniteSet`);if(k(t))return gr(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new h(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${L(t)}\nis a finite set.`:`Attempted to check if the ${lt(t)} ${L(t)} is a finite set.`)}),z(`Cardinality`,1,t=>{let r=R(t,0,`Cardinality`);if(!k(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new n(`Attempted to compute cardinality of the value\n${L(r)}`);return mr(r,e)})]),Zg=/* @__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`]]]),Qg=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:Vg};case`Integers`:return{extends:[`Naturals`],operators:Hg};case`Sequences`:return{extends:[],operators:Yg(n.version)};case`FiniteSets`:return{extends:[],operators:Xg(n.version)};case`TLC`:return{extends:[],operators:Jg(`TLC`,Og(t,n))};case`Randomization`:return{extends:[],operators:ig(n)};case`_Possible`:return{extends:[],operators:_g(t,n)};case`Json`:return{extends:[],operators:Qh(r)};case`Bags`:return{extends:[],operators:Mh(i)};case`TLCExt`:return{extends:[],operators:gg(t,n)};default:return}},$g=`$subexpression`,e_=(e,t)=>new l(`${e} at line ${t.line}, column ${t.column}`),t_=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return t_(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of Ye(e)){let e=t_(r,t,n);if(e)return e}},n_=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),r_=(e,t)=>{let n=e.location,r=n_(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 e_(`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 e_(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:$g,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:$g,args:e.args,location:n,resolution:Ma},location:n}},i_=(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:Ma})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Ma}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Ma};return r_({...t,params:[...t.params,...r]},a)},a_=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o={index:0,current:void 0,isFailed:!1},s=(t,r)=>{if(!t)throw e_(r,i);Pa.set(n,{args:e.slice(0,o.index).flatMap(e=>`args`in e?e.args:[]),error:{location:b(t),message:r}}),o.isFailed=!0},c=n=>{let r=[],a=[];for(;o.index<e.length;){let s=e[o.index];if(s.kind!==`Name`)throw e_(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>ns(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o.index++}throw e_(`Unknown operator ${r.join(`!`)}`,i)},l=t=>{let l=c(t),u=l.definition,d=za(u),f=o.index===e.length-1;if(l.args.length!==d&&(!r||l.args.length!==0))return s(n.argumentRanges?.[o.index]??i.range,`The operator ${l.name} requires ${d-l.earlier} arguments.`);if(f)return{definition:u,args:l.args};if(u.kind!==`Operator`)throw e_(`Cannot select a subexpression of ${u.name}`,i);a.params.push(...u.params),a.args.push(...l.args),o.current=u.body,o.index++},u=()=>{for(;o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o.index],c=o.current&&t_(o.current,t.name,[]);if(!c)return s(i,`Cannot find label \`${t.name}'.`);let l=c.label.params;if(!r&&t.args.length!==l.length)return s(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...l.map(e=>({name:e,arity:0}))),a.args.push(...t.args),o.current=c.label.body,o.index++}},d=t=>{let n=o.current;if(!n)throw e_(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(n.kind===`Label`){o.current=n.body,d(t);return}if(n.kind===`Let`){if(t.kind!==`Operand`||oo(t.operand,1)!==0)throw e_(`A LET/IN expression has only one operand`,i);a.lets.push(n.definitions),o.current=n.body;return}let r=uo(n);if(r&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...r.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),o.current=r.body;return}if(n.kind===`Case`&&t.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],a=r[oo(t.operand,r.length)],s=e[o.index+1];if(!a||s?.kind!==`Operand`)throw e_(`A subexpression of CASE must have the form !i!j`,i);o.index++;let c=oo(s.operand,2),l=c===0?a.condition:c===1?a.body:void 0;if(!l)throw e_(`Nonexistent CASE operand`,i);o.current=l;return}if(t.kind!==`Operand`)throw e_(`Unexpected subexpression selector`,i);let s=r?r.sets:fo(n),c=s?.[oo(t.operand,s.length)];if(!c)throw e_(`Nonexistent operand specified by the selector`,i);o.current=c},f=l(void 0);if(o.isFailed)return n;if(f)return i_(f.definition,{...a,args:f.args});for(u();o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind===`Name`){for(;o.current?.kind===`Label`;)o.current=o.current.body;if(o.current?.kind!==`Let`)throw e_(`A name selector here must be from a LET clause`,i);a.lets.push(o.current.definitions);let e=l(o.current.definitions);if(o.isFailed)return n;if(e)return i_(e.definition,{...a,args:[...a.args,...e.args]});u()}else d(t),o.index++}if(o.isFailed)return n;if(!o.current)throw e_(`Subexpression selection failed`,i);return r_(a,o.current)},o_=(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 so(e,t,n)},s_=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Ye(e).some(s_),c_=(e,t,n,r=!1)=>{if(!s_(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=as(e,e=>c_(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>l_(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)=>c_(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:as(e,e=>c_(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?o_(a.name,[],void 0,t):a.kind===`Apply`?o_(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=a_(o,t,a,r);return c!==a&&Na.add(c),c},l_=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:c_(e.expression,t,n,!0)}))}),u_=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},d_=(e,t)=>l_(e,u_(t.definitions),()=>!1),f_=(e,t)=>{let n=u_([...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=>c_(e,n,i),o=e=>i(e)||!n(e),s=e=>c_(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 l_(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?l_(e,n,o):is(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=>s_(e.body))||e.assumptions.some(e=>s_(e.expression))?{...p,definitions:e.definitions.map(e=>is(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},p_=(e,t)=>e.maxLevels[t]??3,m_=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=cc({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,i=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),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=>zs(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>zs(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Bs(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Is(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)&&zs(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(lc(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,o=b(t.location.range??{module:t.instancer,start:t.location,end:t.location}),s=e=>r.set(`${o}\n${e}`,{location:o,message:e}),c=e(t.module),l=i(t.module),u=n(t.instancer),d=/* @__PURE__ */ new Map;t.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 n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=u.analyze(n,d);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(n,d);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),p=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&s(p(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let n=l.constraints.get(e.name);n!==void 0&&e.level>n&&s(p(e.name,n));let r=e.operator;r&&Array.from({length:e.arity},(n,i)=>{let a=l.argConstraints.get(Ps(e.name,i));a!==void 0&&p_(r,i)<a&&s(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),l.argParams.forEach(e=>{let n=Is(e),r=f.find(e=>e.name===n.operator)?.operator,i=f.find(e=>e.name===n.param);if(!r||!i)return;let a=p_(r,n.index);i.level>a&&s(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw a([...r.values()])}},h_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],g_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),__=new Map(pf.flatMap(e=>e.map(t=>[t,e[0]]))),v_=e=>__.get(e)??e,y_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},b_=()=>{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}}},x_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:y_(e)&2147483647,kind:t,isLocal:n}),S_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:v_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:v_(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}},C_=(e,t)=>{let n=[];for(let r=t;;){let t=S_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},w_=e=>({line:e.line,column:e.column}),T_=(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=C_(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},E_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,D_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},O_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&E_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&E_(e[n+1],e[n+2])?n+=E_(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=>D_[e])}"`:r.text)}return t},k_=e=>e[2]?.text,A_=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},j_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>j_(e.modules,t)).find(Boolean),M_=e=>{let t=e===void 0?[]:xe(e),n={module:void 0};return{tokens:t,ranges:A_(t),getModule:()=>n.module??=e===void 0?pm(``):mm(e,t)}},N_=(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=M_(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:(_f.has(i)?t?.(i):void 0)??vf.get(i)??t?.(i)??dm(e,i),{tokens:c,ranges:l,getModule:u}=a(s),d=l.get(k_(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:()=>j_(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()}},P_=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=C_(t,e+1);i.push({location:w_(t[e]),apply:e=>r.forEach(t=>e.put(x_(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:w_(u),apply:t=>t.put(x_(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`&&C_(t,l+1).every(e=>s.has(e))&&o(l,`definition`),g_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(a.push(w_(u)),i.push({location:w_(u),apply:e=>e.put(x_(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(x_(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=v_(e.name);i.push({location:e.location,apply:n=>n.put(x_(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(x_(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(x_(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>Ra(e.location,t.location)?-1:+!!Ra(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=b_();n.set(i??``,o),ff.toReversed().forEach(e=>o.put(x_(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)}}},F_=(e,t)=>{let n=/* @__PURE__ */ new Set,r=e=>{n.add(e)},a=e=>{e.kind===`ModelValue`&&r(e.name),e.kind===`String`&&r(e.value),e.kind===`Set`&&e.elements.forEach(a)};t.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),mf.forEach(r);let o=t=>{let n=e(t);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=T_(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),ee=m(e=>e.instances),g=/* @__PURE__ */ new Set([void 0]),_=/* @__PURE__ */ new Map;O_(o(void 0)).forEach((e,t)=>{t===3&&gf.forEach(r),r(e)});let v=l(void 0);for(;;){let t=h(v,/* @__PURE__ */ new Set)??ee(v,/* @__PURE__ */ new Set);if(!t)break;let[n,a]=t;if(d.add(`${n.key}>${a}`),_.set(n.unit,[..._.get(n.unit)??[],a]),!g.has(a)){if(g.add(a),e(a).tokens.length===0){let t=n.unit??k_(e(void 0).tokens);throw i(a,t)}O_(o(a)).forEach(r)}}h_.forEach(r);let te=/* @__PURE__ */ new Set,y=e=>{if(te.has(e))return;te.add(e);let t=_.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(y),o(e).forEach(e=>{e.kind===`String`&&r(e.text)})};return y(void 0),hf.forEach(r),[...n]},I_=(e,t)=>{let n=N_(e,t),r=n.getParsed,i,a=()=>i??=P_(r);return{getStringOrder:e=>F_(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)}}},L_=e=>{switch(e.kind){case`Number`:if(!ut(e.value))throw o(new n(`Integer overflow: ${e.value} is outside TLC's 32-bit range`),m.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return Lt(e.name);case`Set`:return Mn(e.elements.map(L_))}},R_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],z_=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof l))throw n;let r=zp(e);throw r===void 0?n:a([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},B_=e=>new l(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),V_=(e,t)=>e.location.range&&t.location.range&&{location:b(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${b(t.location.range)}.`},H_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,U_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:H_(e),W_=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:ys(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),G_=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>L(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new h(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&Xt(t,r)})});if(t)return t[1];throw new h(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:L(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},K_=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||Ye(e).some(e=>K_(e,t)),q_=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(ms(e),n.get(e)??n.size)),n},J_=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Y_=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw bu(e);if(e.kind===`Number`&&!ut(e.value))throw xu(e);Y_(e.kind===`Let`?[...Ye(e),...J_(e.instances??[])]:Ye(e))}),X_=(e,n)=>{let r=n.order??I_(n.source,n.loadModule),o=r.parseModule(n.source),s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Map,d=/* @__PURE__ */ new Set,f=new Map(Fg.map(e=>[e.name,e])),p=/* @__PURE__ */ new Map,m=oh(e.checkDeadlock,n.seed);m.isWarningEnabled=n.isWarningEnabled??!0,m.isTool=n.isTool??!1,m.version=n.version??`master`;let ee=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Map,te=[],y=/* @__PURE__ */ new Map,ne=[],re=[],ie=(e,t)=>ne.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ae={value:0},oe=e=>`${e}#${ae.value++}`,se=[],ce=[],le=m_(e=>{let t=v.get(e)??me(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>s.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>s.get(t.visible.get(e)?.key??e)}}),ue=/* @__PURE__ */ new Map,de=/* @__PURE__ */ new Map,fe=/* @__PURE__ */ new Map,x=e=>{let t=p.get(e);if(t)return t;let r=Qg(e,n.print,m,n.files,f);if(!r)return;Zg.get(e)?.forEach(x);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>x(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{f.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:js.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Ns(e,t.name)??i.get(t.name)?.range})}),p.set(e,i),i},S=e=>{if(_f.has(e)&&n.loadModule?.(e)!==void 0)return;let t=x(e),r=Zg.get(e)??[];return t&&ie(e,r),t&&r.includes(`Integers`)&&x(`Integers`),t},C=e=>(Y_([...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]),...J_(e.instances)]),e.modules.forEach(C),e);C(o);let w=(e,t)=>{let o=n.loadModule?.(e)??$e.get(e)??dm(n.source,e);if(o===void 0)throw i(e,t);let s=z_(o,e,r);if(s.name!==e)throw a([{location:`Unknown location`,message:`File name '${e}' does not match the name '${s.name}' of the top level module it contains.`}],!0);return C(s)},pe=e=>{let t=re.indexOf(e.name);if(t!==-1){let n=[...re.slice(t),e.name].map(e=>`${e}.tla`);throw new l(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,r=[],i=[],o=[];re.push(e.name),ne.push(n);let s=Ce(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:ce,levelChecks:o});if(ne.pop(),re.pop(),i.length>0)throw a(i,!1,void 0,ce);let c=r.find(e=>n.has(e.name)),u=c&&ee.get(c.name),d=u&&V_(c,u.module);if(d)throw a([d],!1,void 0,ce);if(c)throw B_(c);return o.forEach(e=>e()),{linked:s,closure:n}},me=(e,t)=>{let r=ee.get(e);if(r)return ie(e,y.get(e)??[]),r;let i=pe(w(e,t));return(fh(m.version).has(e)?Qg(e,n.print,m,n.files,f):void 0)?.operators.forEach(e=>{let t=i.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(f.set(t.key,e),s.delete(t.key))}),ee.set(e,i.linked),y.set(e,i.closure),ie(e,i.closure),i.linked},he=(e,t,n,r,i)=>{let a=i?void 0:S(e.module);if(a)return ge(e,a);let o=i??me(e.module,t.name);o.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let l=R_(o),f=`#${ae.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=Jo(d_(e,t),l,t,n);se.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=Es({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,$o(t,p)])),variables:new Set(o.variables),getDefinition:e=>s.get(e),isParameterized:e=>c.get(e)===!0,addDefinition:(n,i,a)=>{let o=oe(`${i}@${t.name}`),f=a(o);return s.set(o,f),l.length>0&&d.add(f),e.name!==void 0&&de.set(o,`${e.name}!${de.get(n)??i}`),c.set(o,!r),u.set(o,{source:n,prefix:e.params.length}),o},createName:oe});return _e(e,o.exported,l,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return l.length>0&&ue.set(r,{name:n,location:e.location}),e.name!==void 0&&fe.set(r,n),r})},ge=(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}])),_e=(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:c.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}]}))},ve=(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:bs(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),ye=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),be=(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=ye(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:bs(r,n),location:n}}},T=(e,t,n,r)=>{let i=e.location,a=r?void 0:S(e.module);if(a)return e.name===void 0?[]:[...a].map(([t,n])=>{let r=ye(n.arity);return ve(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let o=r??me(e.module,n),l=`#${ae.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=R_(o),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};se.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=>K_(f(e),p),h=d.map(t=>{let n=be(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}}),ee=[],g=Es({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:bs(e.params,i),location:i,resolution:Ma}:ys(`${t.name}${l}`,i)])),variables:new Set(o.variables),getDefinition:e=>s.get(e),isParameterized:e=>c.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${ee.length}`,a=r(i);return ee.push(a.kind===`Operator`?{...a,name:i}:W_(a,i)),i},createName:oe}),_=new Set(d.map(e=>e.name)),v=[...o.exported].filter(([e])=>!_.has(e)).map(([t,n])=>{let r=g.getKey(n.key),a=ye(n.arity),o=[...e.params,...a];return ve(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...ee,...v]},xe=e=>[...e].flatMap(([e,t])=>{let n=s.get(t.key);return n?[{...n,name:e}]:[]}),Se=/* @__PURE__ */ new Map,Ce=(e,t)=>{let r=df(e,n.loadClass?.(e.name),e===o);Se.set(e.name,r.overrides);let i=r.module,a=se.length,l=new Map([...Fg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...t.symbols]),u=/* @__PURE__ */ new Map,d={location:Uo,errors:[],warnings:[]},f=[d],p=e=>e.forEach((e,t)=>{let n=m.get(t);if(!n){l.set(t,e),m.set(t,e);return}if(!n.range||!e.range||b(n.range)===b(e.range))return;let r=b(e.range),i=b(n.range);U_(n.kind)===U_(e.kind)?d.warnings.push({location:r,message:`Warning: the ${H_(n.kind)} of '${t}' conflicts with \nits ${H_(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${H_(e.kind)} of '${t}' conflicts with \nits ${H_(n.kind)} at ${i}.`})}),m=/* @__PURE__ */ new Map,h=/* @__PURE__ */ new Set,ee=/* @__PURE__ */ new Map,g=[],y=[...i.constants],ne=i.variables.map(e=>e.name),re=i.variables.map(e=>e.location);i.extends.forEach(e=>{let n=t.modules.get(e),r=n?void 0:S(e);if(r){p(r);return}let a=n??me(e,i.name);y.push(...a.constants.filter(e=>y.every(t=>t.name!==e.name))),a.variables.forEach((e,t)=>{ne.includes(e)||(ne.push(e),re.push(a.variableLocations[t]))}),p(a.exported),a.facts.forEach(e=>h.add(e)),a.modules.forEach((e,t)=>ee.set(t,e)),g.push(a)});let ie=new Map(l),ae=[...i.constants.map(e=>({...e,kind:`Constant`})),...i.variables.map(e=>({...e,kind:`Variable`}))],oe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});ae.forEach(e=>m.set(e.name,oe(e)));let ue=e=>({key:x(e),arity:za(e),params:Ba(e),kind:Wo(i,e)?`Theorem`:`Definition`,range:e.location.range}),de=y.length===0&&ne.length===0,x=e=>i===o?e.name:`${e.name}@${t.id}`,C=/* @__PURE__ */ new Map,w=()=>new Map([...t.modules,...ee]),pe=e=>{let t=i.instances.find(t=>t.module===e.name);return t!==void 0&&Ra(e.location,t.location)},ve=e=>{let t=i.modules.find(t=>t.name===e.module);return t?pe(t)?ee.get(t.name):void 0:w().get(e.module)},ye=e=>({imported:l,getInstance:e=>{let t=ve(e),n=t?void 0:S(e.module);if(n)return{declarations:[],symbols:ge(e,n),instancer:i.name};let r=t??me(e.module,i.name),a=R_(r);return{declarations:a,symbols:_e(e,r.exported,a,e=>e),instancer:i.name}},bound:ie,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:x,instanced:C,facts:h,reports:f,warnings:t.warnings}),be=e=>[...ae.filter(t=>Ra(t.location,e)).map(e=>[e.name,oe(e)]),...i.definitions.filter(t=>Ra(t.location,e)).map(e=>[e.name,ue(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(l)),we=e=>{let n=w(),r=n.get(e.name),i=r&&V_(e,r.module);if(r&&!i)throw B_(e);t.nested.push(e);let a={location:e.location,errors:[],warnings:[]};f.push(a);let o=Ce(e,{id:`${t.id}/${e.name}`,symbols:be(e.location),modules:n,nested:t.nested,errors:a.errors,warnings:a.warnings,levelChecks:t.levelChecks});i&&a.errors.push(i),r||ee.set(e.name,o),_.has(e.name)||_.set(e.name,o)};[...i.instances.map(e=>({location:e.location,link:()=>{let t=he(e,i,ye(i),de,w().get(e.module));C.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||m.set(n,t))})}})),...i.modules.map(e=>({location:e.location,link:()=>we(e)}))].sort((e,t)=>Ra(e.location,t.location)?-1:1).forEach(e=>e.link());let E=f_(As(i,(e,t)=>T(e,t,i.name,ve(e))),xe(l));t.errors.push(...Xo(E,ye(E))),E.definitions.forEach(e=>{let t=x(e);s.set(t,e),c.set(t,!de);let n=ue(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!Ra(r,e.location))&&(l.set(e.name,n),e.isLocal||m.set(e.name,n))});let Te={module:E,constants:y,variables:ne,variableLocations:re,visible:l,exported:m,modules:ee,extended:g,facts:/* @__PURE__ */ new Set([...h,...[...E.theorems,...E.assumptions].flatMap(e=>e.name??[])])};v.has(i.name)||v.set(i.name,Te);let Ee=se.splice(a).map(e=>({location:e.location,check:()=>le(e)}));return t.levelChecks.push(()=>uc(E,{constants:new Set(y.map(e=>e.name)),variables:new Set(ne),getDefinition:e=>s.get(l.get(e)?.key??e),getQualifiedName:e=>fe.get(l.get(e)?.key??e)},Ee,ce)),te.push(Te),Te},we=pe(o).linked;ce.length>0&&!n.isSanyReported&&n.print(t(ce));let E=e=>we.visible.get(e)?.key??e;we.visible.forEach((e,t)=>{let n=s.get(e.key);n&&e.key!==t&&s.set(t,n)});let Te=[],Ee=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Ee(e,t)),Te.push(...e.module.assumptions))};Ee(we,/* @__PURE__ */ new Set);let De=we.constants.map(e=>e.name),Oe=we.variables,ke=e=>e.module===void 0?[e.name,E(e.name)]:e.module===o.name||De.includes(e.name)?[]:[(ee.get(e.module)??_.get(e.module))?.visible.get(e.name)?.key??e.name],Ae=e=>{let t=s.get(e);return t?.kind===`Operator`?t.params.length:we.constants.find(t=>t.name===e)?.arity??0},je=/* @__PURE__ */ new Map,Me=/* @__PURE__ */ new Set,Ne=(e,t)=>{f.set(e,t),s.delete(e),je.delete(e),Me.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=L_(e.value);kn(t),ke(e).forEach(e=>{let n=Ae(e);n===0?je.set(e,t):Ne(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Pe=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Pe.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new g(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(L_),L_(e.value)]),Pe.set(t,n)}),Pe.forEach(e=>ke(e).forEach(t=>Ne(t,G_(e.name,Ae(t)||e.rows[0][0].length,e.rows))));let Fe=new Map(e.substitutions.flatMap(e=>ke(e).map(t=>[t,E(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,r=t.target;if(!De.includes(n)&&!we.visible.has(n))throw new g(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===r))throw new g(`In the configuration file, the identifier ${r} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let i=E(r),a=s.get(i);if(!(a!==void 0||f.has(i)||je.has(i)||De.includes(r)||Oe.includes(r)))throw new g(`The configuration file substitutes for ${n} with the undefined identifier ${r}.`);if(a?.kind===`Operator`&&a.params.length!==(we.constants.find(e=>e.name===n)?.arity??we.visible.get(n)?.arity))throw new g(`The configuration file substitutes for ${n} with ${r} of different number of arguments.`)});let Ie=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(ke)),Le=(e,t)=>{if(Ie.has(e))return{key:e,prefix:t};let n=u.get(e);return n&&Le(n.source,t+n.prefix)};u.forEach((e,t)=>{let n=Le(e.source,e.prefix),r=s.get(t);if(!n||!r)return;let i=r.kind===`Operator`?r.params:[],a=ve(t,n.key,i,i.slice(n.prefix),r.location);s.set(t,a),we.visible.forEach((e,n)=>{e.key===t&&n!==t&&s.set(n,a)})});let Re=De.filter(e=>!je.has(e)&&!Fe.has(e)&&!Me.has(e));if(Re.length>0&&!n.isUnconfigured){let e=r.getDeclarationOrder(`constant`).find(e=>Re.includes(e))??Re[0];throw new g(`The constant parameter ${e} is not assigned a value by the configuration file.`)}n.isTraceRecorded&&f.forEach((e,t)=>{let n=Bg(e);n&&f.set(t,n)});let ze=q_(Oe,te.flatMap(e=>e.module.variables.map(e=>e.name))),Be=wc({definitions:s,substitutions:Fe,constants:je,variableIndex:ze,builtins:f,variables:Oe}),Ve={runtime:m,definitions:s,builtins:f,constants:je,substitutions:Fe,instanceNames:de,variables:Oe,variableIndex:ze,facts:Be,startupValues:Array.from({length:Be.ids.size},()=>void 0),substitutedDefinitions:d,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},He=cc({constants:new Set(je.keys()),variables:/* @__PURE__ */ new Set([...Oe,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>f.has(e))]),getDefinition:e=>Mu(e,Ve)}),D=e=>{try{H(e,{environment:Ve,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof h)return e;throw e}};Fe.forEach((e,t)=>{let n=s.get(e),r=De.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&He.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?D(n.body):void 0;if(r){let n=ma(r)?``:` - specifically: ${r.message}`;throw new g(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),m.version!==`1.7.4`&&(m.isStarted=!0);let Ue=new Set(te.flatMap(e=>e.module.instances.map(e=>e.module))),We=r.createDefinitionOrder();return{environment:Ve,assumptions:Te,variableLocations:we.variableLocations,instanceActions:ue,startupDefinitions:te.filter(e=>!Ue.has(e.module.name)||R_(e).length===0).flatMap(e=>We(e===we?void 0:e.module.name).flatMap(t=>{let n=s.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:we.constants,rootSymbols:we.visible,javaOverrides:te.flatMap(e=>Se.get(e.module.name)??[])}},Z_={kind:`Boolean`,value:!0},Q_={kind:`Boolean`,value:!1},$_=e=>e?Z_:Q_,ev=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,tv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),nv=(e,t,n)=>({kind:e,operands:[t,n]}),rv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?rv(e,t.operands).operands:[t])}),iv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return iv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,iv(t)),0)}},av=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 av(e.body);case`And`:case`Or`:return e.operands.some(av)}},ov=/* @__PURE__ */ new WeakMap,sv={count:0},cv=e=>{let t=ov.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`#${sv.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(cv).join(`,`)})`;default:return`${e.kind}(${cv(e.body)})`}})();return ov.set(e,n),n},lv=(e,t)=>e===t||cv(e)===cv(t),uv=(e,t)=>{let n=cv(t);return e.some(e=>e===t||cv(e)===n)},dv=e=>e===`And`?`Or`:`And`,fv=(e,t)=>{switch(e.kind){case`Boolean`:return t?$_(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return fv(e.body,!t);case`And`:case`Or`:return rv(t?dv(e.kind):e.kind,e.operands.map(e=>fv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,fv(e.body,t))}}},pv=e=>{switch(e.kind){case`Boolean`:return $_(!e.value);case`Not`:return e.body;case`And`:case`Or`:return rv(dv(e.kind),e.operands.map(pv));case`Always`:return $(`Eventually`,pv(e.body));case`Eventually`:return $(`Always`,pv(e.body));default:return $(`Not`,e)}},mv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=mv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return $_(t)}return n.length===0?$_(!t):n.length===1?n[0]:rv(e.kind,n)}case`Not`:{let t=mv(e.body);return t.kind===`Boolean`?$_(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=mv(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},hv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,gv=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=gv(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new h(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>rv(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=gv(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=hv(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:rv(`Or`,t);n.push($(`Always`,$(`Eventually`,e)))}return rv(`Or`,n)}case`Not`:return ev(e.body)?e:gv(pv(e.body));default:return e}},_v=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?_v(e.operands[0]):rv(e.kind,e.operands.map(_v));case`Not`:return e.body.kind===`Not`?_v(e.body.body):$(`Not`,_v(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,_v(e.body));default:return e}},vv=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return vv(e.operands[0]);let t=Math.floor(e.operands.length/2);return nv(e.kind,vv(rv(e.kind,e.operands.slice(0,t))),vv(rv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,vv(e.body));default:return e}},yv=(e,t)=>{e.kind===`Eventually`&&!uv(t,e)&&t.push(e),`body`in e&&yv(e.body,t),`operands`in e&&e.operands.forEach(e=>yv(e,t))},bv=e=>{let t=e.filter(tv),n=e.flatMap(e=>e.kind===`Not`&&tv(e.body)?[e.body]:[]);return!t.some(e=>uv(n,e))},xv=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,$(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new h(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Sv=(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]}},Cv=(e,t,n)=>e.flatMap(e=>{let r=Sv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),wv=e=>[...new Set(e.map(cv))].sort().join(`|`),Tv=(e,t)=>{let n=new Set(t.map(wv));return[...e.filter(e=>!n.has(wv(e))),...t]},Ev=e=>{let t=xv(e),n=Cv(t,`Always`,`And`),r=Cv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Sv(t,`Eventually`,`Or`);if(n&&!(uv(e,n.first)||uv(e,n.second)))return Tv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(uv(e,t.first)||uv(e,t.second))&&!uv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!bv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Sv(t[e],`Always`,`And`);n&&(uv(t,n.first)||t.push(n.first),uv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)uv(t,e.first)&&uv(t,e.second)&&!uv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!bv(t)?[]:i(t)};return a(e)},Dv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>iv(e)<=1)}),Ov=e=>{let t=Ev([e]).map(Dv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=wv(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 Ev(n)){let n=wv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Dv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},kv=(e,t)=>!uv(e,t)||uv(e,t.body),Av=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&iv(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=hv(e);if(n){let e=iv(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(av(e))throw new h(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},jv=(e,t)=>{let n=e.findIndex(e=>lv(e,t));return n===-1?(e.push(t),e.length-1):n},Mv=e=>{let t=gv(mv(fv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=_v(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Av(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:rv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:lv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&vv(e.formula),n=[];t&&yv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>jv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>jv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>jv(i,e))}));return{tableau:t&&Ov(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Nv=()=>o(new h(`Temporal formula is a tautology (its negation is unsatisfiable).`),m.livenessEvaluationFailure),Pv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Fv=/* @__PURE__ */ new WeakSet,Iv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Lv=(e,t)=>new h(`TLC cannot handle the temporal formula ${fu(e)}${t===void 0?``:`:\n${t}`}`),Rv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=Tu(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return Rv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?Rv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=Mu(e,n);if(t)return Ac(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:O(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return as(e,(e,a)=>(i.value=Math.max(i.value,Rv(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 Pv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},zv=(e,t)=>{try{return Vu(e,t)}catch(e){if(!(e instanceof h))throw e;if(!ma(e))return;throw o(new h(`${c}${e.message}`),m.error)}},Bv=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o)=>{let s=(e,t,s=o,c=i,l)=>Bv(e,t,n,r,c,a||l!==void 0&&n.substitutedDefinitions.has(l),s);if(e.kind===`And`)return e.operands.flatMap(e=>s(e,t,fu(e)));if(e.kind===`Label`)return s(e.body,t);if(e.kind===`Let`)return s(e.body,Vv(e,t,n));if(e.kind===`Identifier`){let r=O(e)?Tu(t,e.name):void 0;if(r?.kind===`Thunk`)return s(r.expression,r.scope);let a=n.constants.has(e.name)?void 0:Mu(e.name,n);if(!r&&a?.kind===`Operator`&&a.params.length===0&&Ac(a,n)>0){if(i.has(a))throw d();return s(a.body,void 0,a.name,/* @__PURE__ */ new Set([...i,a]),a)}}let c=Iv(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||Rv(e,t,n)===3)){let t=ld(e,c),r=O(e)?void 0:Mu(e.operator,n);if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&!a)return s(t.body,xd(t,e.args,c),e.operator,i,r)}let l=r&&e.kind===`Forall`&&e.bounds.every(e=>Rv(e.set,t,n)===0),u=l?zv(e.bounds,c):void 0;if(l&&u){let n=[];if(Hu(e.bounds,u,t,t=>(n.push(...s(e.body,t,fu(e.body))),!1)),n.length===0)throw Nv();return n}return[{expression:e,scope:t,name:o}]},Vv=(e,t,n)=>{let r=Cd(e.definitions,Iv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Fv.add(e.binding);return r},Hv=(e,t,n)=>{let i=n.runtime.version===`1.7.4`,a=(e,t,r)=>{let a=r===0&&!i?Rv(e,t,n):r;if(a===0){let r=H(e,Iv(n,t));if(typeof r!=`boolean`)throw new h(`TLC expected a boolean value, but did not find one. ${pu(e)}`);return $_(r)}return a===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},o={depth:0},s=(e,t,n,r)=>{if(o.depth>=100)throw d();o.depth++;let i=m(e,t);o.depth--;let s=iv(i);return s>2?i:a(n,r,s)},c=(e,t)=>{let r=e.kind===`Identifier`?e.name:e.operator,a=Iv(n,t),o=O(e)||Mu(r,n)===void 0?Tu(t,r):void 0;if(o?.kind===`Thunk`&&Fv.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:O(e)?ud(r,a):cd(r,n);if(c?.kind!==`Closure`)throw Lv(e);let u=e.kind===`Apply`?e.args:[],d=!O(e)&&Mu(r,n)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>H(e,a)),s(c.body,xd(c,u,a),e,t)),d)},l=(e,t,n=!1)=>{try{return t()}catch(t){let a=t instanceof r||n&&!i;throw!(t instanceof h)||a?t:Lv(e)}},u=(e,t)=>{let i=Rv(e,t,n);if(!e.bounds.every(e=>Rv(e.set,t,n)===0)){if(i<=2)return a(e,t,i);throw Lv(e)}let o=[],s=e.kind===`Forall`;try{Uu(e.bounds,Iv(n,t),t=>(o.push(m(e.body,t)),!1))}catch(n){if(!(n instanceof h)||n instanceof r)throw n;if(i<=2)return a(e,t,i);throw Lv(e,s&&!ma(n)?n.message:void 0)}return o.length===0?$_(s):f(e,t,rv(s?`And`:`Or`,o))},f=(e,t,n)=>{let r=iv(n);return r>2?n:a(e,t,r)},p=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===`=>`),m=(e,t)=>{let r=Rv(e,t,n);if(r<=2&&!p(e))return a(e,t,r);switch(e.kind){case`Label`:return m(e.body,t);case`Let`:return m(e.body,Vv(e,t,n));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,nv(`Or`,$(`Not`,m(n[0],t)),$(`Eventually`,m(n[1],t)))):e.operator===`~`&&!O(e)?f(e,t,$(`Not`,m(n[0],t))):e.operator===`=>`?f(e,t,nv(`Or`,$(`Not`,m(n[0],t)),m(n[1],t))):c(e,t)}case`And`:case`Or`:return f(e,t,rv(e.kind,e.operands.map(e=>m(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&Rv(e.condition,t,n)===0){let r=H(e.condition,Iv(n,t));if(typeof r==`boolean`)return m(r?e.consequent:e.alternative,t)}let r=m(e.condition,t);return f(e,t,nv(`Or`,nv(`And`,r,m(e.consequent,t)),nv(`And`,$(`Not`,r),m(e.alternative,t))))}case`Always`:case`Eventually`:return $(e.kind,m(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`,nv(`Or`,i,a))):nv(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw Lv(e)}};return m(e,t)},Uv=(e,t,n,r,i)=>{let a=e=>Uv(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?ju(H(e.expression,a),`a temporal property predicate`):tu(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&ju(H(e.unchanged,a),`a subscript`)?!1:ju(H(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return Uv(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new h(`TLC cannot evaluate a temporal formula in a single step`)}},Wv=(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)=>Wv(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 Uv(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Gv=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),Kv=(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},qv=e=>o(new h(`${u}${e}`),m.error),Jv=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!j(e)||!j(i))throw qv(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},Yv=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(Yv);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},Xv=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,Zv=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new g(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw qv(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>H(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!k(a)||!N(a))throw qv(`The symmetry operator must specify a set of functions.`);let o=P(a).elements;if(!o.every(A))throw qv(`The symmetry values must be function records.`);let s=o.map(Jv),c=r.body.kind===`Apply`?r.body.args:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=Yv(Xv(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(ia.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;s.forEach(e=>{e.size>0&&d.set(Gv(e),e)});let f=[...d.values()],p={start:0};for(;p.start<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p.start,t).forEach(e=>{let t=Kv(n,e),r=Gv(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p.start=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!Xv(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>j(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},Qv=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=ey(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(ey(e[r],t));return a}},$v=(e,t)=>{let n=[],r=[];for(let i of e){let e=ey(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Ft);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Ft(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},ey=(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=$v(e.elements,t);return n?Rt(n):e}if(n===`Function`||n===`LazyFunction`&&N(e.domain)){let n=I(e),r=Qv(n.domain,t),i=Qv(n.range,t)??n.range;if(r){let e=Rn(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?zt(n.domain,e.range):e}return i===n.range?n:zt(n.domain,i)}if(n===`Interval`||!k(e)||!N(e))return e;let r=P(e),i=Qv(r.elements,t);return i?Mn(i):r},ty=(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]=ey(e[o],i),a===0&&(a=Ft(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},ny={line:0,column:0},ry=e=>({kind:`Identifier`,name:e,location:ny}),iy=/* @__PURE__ */ new Set([`name`,`property`]),ay=(e,t,n)=>{let r=Mu(t,n);if(!r)throw new g(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new g(iy.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},oy=(e,t,n)=>{if(Dc(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return H(ry(e),Oy(n,void 0,void 0))}catch(e){if(e instanceof h||f(e))return;throw e}},sy=(e,t,n)=>{let r=ay(e,t,n);if(oy(t,r,n)!==void 0)throw new g(`The ${e} ${t} cannot be a constant.`);return r},cy=(e,t,n)=>{let r=n.constants.has(t)?void 0:ay(e,t,n),i=r?oy(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new g(`The ${e} of ${t} is equal to ${L(i)}`);return i===void 0?r:void 0},ly=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},uy=(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})),ad(e.startupDefinitions,r),t.invariants.forEach(e=>{cy(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},dy=(e,t)=>{let n=cc({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>Mu(e,t)});return e.flatMap(e=>{let r=cy(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
|
|
1780
|
+
`]]),ap=(e=`master`)=>e===`1.7.4`?ip:rp,op=(e,t)=>e.every(e=>qi(e,t)),sp=Yr([!1,!0]);Wr(sp);const cp=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return ei(cp(e,t,r),cp(e,r,n))},lp=[`\\cup`,`\\cap`,`\\`],up=e=>typeof e==`object`&&e.kind===`MixedSet`,dp=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,fp=(e,t,n)=>{t.kind===`Interval`&&Li(t);let r=t.kind===`Interval`?t:Ur(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return sn(r,e=>{qi(e,n)===i&&an(a,e)}),dp(t)?er(a):Xr(a)}if(P(t))return n;if(!cn(n))return cr({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return sn(r,e=>an(i,e)),sn(n.kind===`Interval`?n:N(n).elements,e=>{qi(e,t)||an(i,e)}),Xr(i)},pp=(e,t)=>{let n=(t,n)=>is([Ds(t,n,e)()],0,e);return{...R(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},mp=[os(`TRUE`,!0),os(`FALSE`,!1),os(`BOOLEAN`,sp),os(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ls(`=`,Kr),ls(`#`,(e,t)=>!Kr(e,t)),R(`~`,1,e=>!is(e,0,`~`)),R(`<=>`,2,e=>is(e,0,`<=>`)===is(e,1,`<=>`)),pp(`/\\`,(e,t)=>e&&t()),pp(`\\/`,(e,t)=>e||t()),pp(`=>`,(e,t)=>!e||t()),R(`\\in`,2,e=>qi(L(e,0,`\\in`),L(e,1,`\\in`))),R(`\\notin`,2,e=>!qi(L(e,0,`\\notin`),L(e,1,`\\notin`))),ls(`\\subseteq`,(e,t)=>{if(!j(e))throw new _(`\\subseteq expects a set but received ${I(e)}`);if(typeof e==`object`&&e.kind===`Subset`&&typeof t==`object`&&t.kind===`Subset`&&M(e.base))return op(N(e.base).elements,t.base);if(typeof e==`object`&&e.kind===`Interval`){if(typeof t==`object`&&t.kind===`Interval`&&t.low<=e.low&&t.high>=e.high)return!0;for(let n=e.low;n<=e.high;n++)if(!qi(n,t))return!1;return!0}return!ki(e,e=>!qi(e,t))}),...lp.map(e=>R(e,2,t=>{let n=L(t,0,e),r=L(t,1,e),i=e!==`\\cup`&&typeof r==`object`&&r.kind===`Interval`&&typeof n==`object`&&n.kind!==`Interval`;if(cn(n)&&cn(r)&&!up(n)&&!up(r)&&!i&&!on(n)&&!on(r)){if(e===`\\cup`&&P(n))return r;let t=e===`\\cup`?ei:e===`\\cap`?$r:Qr;return Gi((n,r)=>{let i=N(n),a=N(r),o=t(i,a);if(e===`\\cup`){let e=Ur(i),t=Qr(a,i).elements,n=e===i.elements&&(t.length===0||Jn(e[e.length-1],t[0])<0);if(e.length+t.length>nn())throw new s(rn());if(n&&!i.isNormalized)return o;let r=o===i?$n(o.elements):o;return n||(r.writtenElements=[...e,...t]),r}return o===n||(o.isNormalized=dp(n),i.writtenElements&&!i.isNormalized&&(o.writtenElements=i.writtenElements.filter(e=>qi(e,o)))),o},(t,n)=>fp(e,t,n),n,r)}return cn(n)?fp(e,n,r):e!==`\\`&&cn(r)?fp(e,r,n):cr({kind:`SetOperation`,operator:e,left:n,right:r})})),R(`SUBSET`,1,e=>({kind:`Subset`,base:L(e,0,`SUBSET`)})),R(`UNION`,1,e=>{let t=L(e,0,`UNION`),n=dn(t)?Ur(t):[],r=n.filter(dn);if(!dn(t)||r.length!==n.length)return cr({kind:`Union`,base:t});let i=r.flatMap(Ur),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{qi(t,e)||an(e.elements,t)}),Xr(e.elements)};return up(t)||r.some(up)?a():r.length===0?Zr:Gi(e=>Vi(cp(e,0,e.length),i),a,r.map(N),void 0)}),R(`DOMAIN`,1,e=>{let t=L(e,0,`DOMAIN`);if(!ln(t))throw new _(`DOMAIN expects a function but received ${I(t)}`);return fa(t)})],hp=Ss(`Integers`,`Neg`,`IntValue`,1),gp=e=>{let t=Ss(e,`DotDot`,`IntervalValue`,2);return[Cs(e,`+`,`Plus`,(e,t)=>e+t),Cs(e,`-`,`Minus`,(e,t)=>e-t),Cs(e,`*`,`Times`,(e,t)=>e*t),Cs(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new c(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new c(`0^0 is undefined.`);return e**t}),Cs(e,`\\div`,`Divide`,(e,t)=>{if(t===0)throw new c(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if(us(n))throw ds(`${e} \\div ${t}`);return n}),Cs(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new c(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),R(`..`,2,e=>{let n=L(e,0,`..`),r=xs(L(e,1,`..`),t);return{kind:`Interval`,low:xs(n,t),high:r}})]},_p=gp(`Naturals`),vp=gp(`Integers`),yp=e=>{let t=_p.indexOf(e);return t===-1?void 0:vp[t]},bp=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[bs(Ts(`<`,(e,t)=>e<t),t(`LT`)),bs(Ts(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),bs(Ts(`<=`,(e,t)=>e<=t),t(`LE`)),bs(Ts(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},xp=[os(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),..._p,...bp(`Naturals`)],Sp=[os(`Int`,{kind:`InfiniteSet`,name:`Int`}),...vp,...bp(`Integers`),R(`-.`,1,e=>{let t=xs(L(e,0,`-`),hp);if(us(-t))throw ds(`-${t}`);return-t})],Cp=(e,t,n)=>{let r=L(e,t,n),i=Hi(r);if(!i)throw new c(`${n}\n${I(r)}`);return i},wp=(e,t,n)=>{let r=L(e,t,n);return typeof r==`string`?r:Cp(e,t,n)},Tp=(e,t,n)=>{let r=L(e,t,`SubSeq`);if(typeof r!=`number`)throw ts(n,`SubSeq`,`natural number`,r);return r},Ep=(e,t,n)=>typeof e==`string`?Rn(e.slice(t,n)):fi(e.slice(t,n)),Dp=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Op=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,kp=(e,t)=>{let n=tp.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?bs(e,t):e}):t},Ap=e=>kp(`Sequences`,[R(`Seq`,1,e=>({kind:`SequenceSet`,base:L(e,0,`Seq`)})),R(`Len`,1,e=>wp(e,0,Dp(``,`Len`)).length),R(`\\o`,2,e=>{let t=wp(e,0,Op(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Cp(e,1,Op(`t \\o s`,`sequence`));return fi([...t,...n])}let n=L(e,1,`\\o`);if(typeof n!=`string`)throw new c(`${Op(`t \\o s`,`string`)}\n${I(n)}`);return Rn(t+n)}),R(`Append`,2,t=>fi([...Cp(t,0,Op(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),L(t,1,`Append`)])),R(`Head`,1,e=>{let t=Cp(e,0,Dp(``,`Head`));if(t.length===0)throw new c(`Attempted to apply Head to the empty sequence.`);return t[0]}),R(`Tail`,1,e=>{let t=wp(e,0,Dp(``,`Tail`));if(t.length===0)throw new c(`Attempted to apply Tail to the empty sequence.`);return Ep(t,1)}),R(`SubSeq`,3,e=>{let t=wp(e,0,Dp(`first `,`SubSeq`)),n=Tp(e,1,`second`),r=Tp(e,2,`third`);if(n>r)return Ep(t,0,0);let i=n<1||n>t.length?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new c(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${I(L(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Ep(t,n-1,r)}),ss(`SelectSeq`,2,e=>{let t=as(e,1,`SelectSeq`);return fi(Cp(e,0,Dp(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new c(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${t.name}>`);return n}))})]),jp=e=>kp(`FiniteSets`,[R(`IsFiniteSet`,1,e=>{let t=L(e,0,`IsFiniteSet`);if(j(t))return zi(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new _(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${I(t)}\nis a finite set.`:`Attempted to check if the ${fn(t)} ${I(t)} is a finite set.`)}),R(`Cardinality`,1,t=>{let n=L(t,0,`Cardinality`);if(!j(n)||typeof n==`object`&&(n.kind===`InfiniteSet`||n.kind===`SequenceSet`))throw new c(`Attempted to compute cardinality of the value\n${I(n)}`);return Li(n,e)})]),Mp=[bs(R(`Warshall`,1,e=>{let t=L(e,0,`Warshall`);if(!j(t)||Vn(t))throw new c(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${I(t)}`);Li(t);let n=[],r=/* @__PURE__ */ new Map,i=e=>{let t=ja(e),i=r.get(t)??n.length;return i===n.length&&(r.set(t,i),n.push(e)),i},a=N(t).elements.map(e=>{let t=Hi(e);if(t?.length!==2)throw new c(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${I(e)}`);return[i(t[0]),i(t[1])]}),o=n.map(()=>n.map(()=>!1));a.forEach(e=>{o[e[0]][e[1]]=!0});for(let e=0;e<n.length;e++)for(let t=0;t<n.length;t++)if(o[t][e])for(let r=0;r<n.length;r++)o[e][r]&&(o[t][r]=!0);return Xr(n.flatMap((e,t)=>n.flatMap((n,r)=>o[t][r]?[fi([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 Mp;if(e===`AnySet`)return[os(`ANY`,Gn)];if(e===`IOUtils`)return Wd(r,a);if(e===`_TLCTrace`)return qd(r);if(!ap(n.version).has(e))return;let o=Fp(e,t,n,r,i)?.operators;return e===`Randomization`&&o?[...o,bf(n)]:o},Pp=/* @__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`]]]),Fp=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:xp};case`Integers`:return{extends:[`Naturals`],operators:Sp};case`Sequences`:return{extends:[],operators:Ap(n.version)};case`FiniteSets`:return{extends:[],operators:jp(n.version)};case`TLC`:return{extends:[],operators:kp(`TLC`,Jf(t,n))};case`Randomization`:return{extends:[],operators:xf(n)};case`_Possible`:return{extends:[],operators:Ff(t,n)};case`Json`:return{extends:[],operators:Ud(r)};case`Bags`:return{extends:[],operators:kp(`Bags`,hd(i))};case`TLCExt`:return{extends:[],operators:kp(`TLCExt`,Pf(t,n))};default:return}},Ip=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&ml.get(t)||[];r.expressions.push(...i,t);let a=Wi.sets,o=a??[],s=o.length;Wi.sets=o;try{return n()}catch(e){throw d_(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,Wi.sets=a}},Lp=(e,t,n)=>e.coverage?Po(e.coverage,t,n):-1,Rp=(e,t,n)=>e.coverage?Io(e.coverage,t,n):n(),zp=(e,t,n,r)=>Rp(e,t,()=>U(n,r)),Bp=(e,t,n,r)=>{let i=zp(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},Vp=(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},Hp=e=>!e.includes(void 0),Up=e=>e.variables.map(()=>void 0),Wp=(e,t,n)=>{let r=[...e];return r[t]=n,r},Gp=(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}},Kp=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,qp=e=>e.kind===`Identifier`?e.name:void 0,Jp=(e,t,n)=>{if(t.kind===`Label`)return Jp(e,t.body,n);let r=qp(t);if(r===void 0)return;let i=Yh(n,r);if(i?.kind===`Thunk`)return Jp(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=zg(r,e);return o?.kind===`Closure`&&o.params.length===0?Jp(e,o.body,o.scope):void 0},Yp=(e,t,n)=>{if(t.kind===`Prime`)return Jp(e,t.expression,n);if(t.kind===`Label`)return Yp(e,t.body,n);let r=qp(t);if(r===void 0)return;let i=Yh(n,r);if(i?.kind===`Thunk`)return Yp(e,i.expression,i.scope);if(i)return;let a=zg(r,e);return a?.kind===`Closure`&&a.params.length===0?Yp(e,a.body,a.scope):void 0},Xp=e=>{if(typeof e!=`boolean`)throw new _(`TLC expected a boolean expression.`);return e},Zp=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Qp=(e,t,n,r)=>{let i=em(e,t,n,r);return i&&e.coverage&&!e.isInit&&Fo(e.coverage,r),i},$p=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(Fo(r,n),Fo(r,r.roots[n])),e.onState(t),!0},em=(e,t,n,r)=>t===void 0?Hp(n)?$p(e,n,r):(e.onIncomplete?.(n),!1):Hp(n)&&Zp(e)?nm(e,t,n,r):t.kind===`Predicate`?rm(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?ym(e,t.expression,t.rest,t.scope,n,t.node):tm(e,t,n)&&Qp(e,t.rest,n,t.node),tm=(e,t,n)=>{let r=e.environment,i=zp(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return zp(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?Jh(t,r.runtime.version):t}})();try{return!Kr(i,a)}catch(t){throw e.callStack&&d_(e.callStack,[i],t),t}},nm=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return ym(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?tm(e,i,n):Xp(zp(e,i.node,i.expression,Vp(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return $p(e,n,r)},rm=(e,t,n,r,i,a)=>im(e,t,n,r,i,Lp(e,a,t)),im=(e,t,n,r,i,a)=>Ip(e,t,()=>{switch(t.kind){case`Let`:{let o=Vp(e,r,i),s=t.definitions,c=e.coverage?n_(s,o,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):n_(s,o);return rm(e,t.body,n,c,i,a)}case`Label`:return rm(e,t.body,n,r,i,a);default:if(pm.has(t.kind))throw new _(`The state relation is not a boolean expression.`);return Ip(e,t,()=>_m(e,t,n,r,i,a))}}),am=(e,t,n,r,i)=>Xp(t)&&Qp(e,n,r,i),om=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),sm=(e,t,n,r,i,a)=>{let o=Vp(e,r,i);if(t.kind===`Identifier`){let s=Yh(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return rm(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return rm(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:zg(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&qu(c,e.environment))?rm(e,l.body,n,l.scope,i,a):am(e,Bp(e,a,t,o),n,i,a)}let s=Bg(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=Rp(e,a,()=>Qg(s,t.args,o));return rm(e,s.body,n,r,i,a)}let c=om.has(t.operator)?zp(e,a,t,o):Bp(e,a,t,o);return am(e,c,n,i,a)},cm=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?Qp(e,t,Wp(n,r,i),a):Kr(o,i)&&Qp(e,t,n,a)},lm=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),um=(e,t,n)=>(e.coverage&&Lo(e.coverage,t,n.length+1),n),dm=(e,t,n,r,i,a)=>{let[o,s]=t.args,c=e.isInit?Jp(e.environment,o,r):Yp(e.environment,o,r),l=Vp(e,r,i);if(c===void 0)return zp(e,a,t,l)===!0&&Qp(e,n,i,a);let u=zp(e,a,s,l),d=i[c];if(t.operator===`=`)return cm(e,n,i,c,u,a);let f=t.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(typeof f==`object`&&f!==u&&e.callStack?.sources.set(f,s),d!==void 0)return zp(e,a,t,l)===!0&&Qp(e,n,i,a);if(!hi(f))throw new _(`The right side of \\IN is not enumerable.`);return um(e,f,Ai(f)).reduce((t,r)=>Qp(e,n,Wp(i,c,r),a)||t,!1)},fm=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),pm=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),mm={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},hm=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:mm[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${V(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${V(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${V(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${V(e)}`},gm=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=Rp(e,r,()=>hg(t.bounds,t=>{let r=U(t,n),i=fg(r,t,a);return Array.isArray(i)&&um(e,r,i),i}));return _g(t.bounds,o,n.scope,e=>(i.push(e),!1)),i},_m=(e,t,n,r,i,a)=>{let o=Vp(e,r,i);switch(t.kind){case`Identifier`:return sm(e,t,n,r,i,a);case`Apply`:return fm.has(t.operator)&&t.args.length===2?dm(e,t,n,r,i,a):t.operator===`=>`&&t.args.length===2?Xp(zp(e,a,t.args[0],o))?rm(e,t.args[1],n,r,i,a):Qp(e,n,i,a):sm(e,t,n,r,i,a);case`And`:{let o=t.operands;if(t.isBulleted||o.length===2){let t=o.slice(1).reduceRight((e,t)=>lm(`Predicate`,t,r,a,e),n);return rm(e,o[0],t,r,i,a)}let s=o[o.length-1];return im(e,Gp(t,o.length-1),lm(`Predicate`,s,r,a,n),r,i,Kp(e,a))}case`Or`:{let o=t.operands;if(t.isBulleted||o.length===2)return o.reduce((t,o)=>rm(e,o,n,r,i,a)||t,!1);let s=im(e,Gp(t,o.length-1),n,r,i,Kp(e,a)),c=rm(e,o[o.length-1],n,r,i,a);return s||c}case`Exists`:return gm(e,t,o,a).reduce((r,o)=>rm(e,t.body,n,o,i,a)||r,!1);case`Forall`:{let r=gm(e,t,o,a);if(r.length===0)return Qp(e,n,i,a);let s=r.slice(1).reduce((e,n)=>lm(`Predicate`,t.body,n,a,e),n);return rm(e,t.body,s,r[0],i,a)}case`If`:return rm(e,Xp(zp(e,a,t.condition,o))?t.consequent:t.alternative,n,r,i,a);case`Case`:{let s=t.arms.find(t=>Xp(zp(e,a,t.condition,o)))?.body??t.other;if(s===void 0)throw new _(`TLC encountered a CASE with no conditions true.`);return rm(e,s,n,r,i,a)}case`FunctionApplication`:{let r=Cg(zp(e,a,t.function,e.isInit?o:$h(o)));if(r){let s=Rp(e,a,()=>wg(r,t,o));return rm(e,r.body,n,s,i,a)}break}case`Unchanged`:if(!e.isInit)return ym(e,t.expression,n,r,i,a);break;case`BoxAction`:if(!e.isInit){let o=rm(e,t.action,n,r,i,a);return ym(e,t.subscript,n,r,i,a)||o}break;case`AngleAction`:if(!e.isInit)return rm(e,t.action,lm(`Changed`,t.subscript,r,a,n),r,i,a)}let s=e.isEnabled?hm(t):void 0;if(s!==void 0)throw new _(s);return am(e,zp(e,a,t,o),n,i,a)},vm=(e,t,n)=>e.runtime.warn(St.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${V(n)}`),ym=(e,t,n,r,i,a)=>Ip(e,t,()=>{let o=Lp(e,a,t),s=Jp(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&&!Kr(a,r)?(vm(e.environment,s,t),!1):cm(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return Qp(e,n,i,o);let c=s.reduceRight((e,t)=>lm(`Unchanged`,t,r,o,e),n);return ym(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=Yh(r,t.name);if(a?.kind===`Thunk`)return ym(e,a.expression,n,a.scope,i,o);let s=a?void 0:zg(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return ym(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=Vp(e,r,i),s=Bg(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return ym(e,s.body,n,Qg(s,t.args,a),i,o)}let c=e.environment,l=zp(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=zp(e,o,t,{environment:c,scope:r,state:i,next:void 0});return Kr(l,u)&&Qp(e,n,i,o)}),bm=(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}),xm=/* @__PURE__ */ Error(`The replay found a successor`),Sm=(e,t,n,r)=>{let i=bm(r,!1,n,()=>{throw xm},!0),a=i.callStack,o=a?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=lm(`Changed`,e.subscript,t,-1,void 0);rm(i,e.action,n,t,Up(r),-1)}else rm(i,e,void 0,t,Up(r),-1);return!1}catch(e){if(e!==xm)throw e;return a&&(a.expressions.length=o,a.isFrozen=!1),!0}},Cm=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=bm(t,!0,void 0,n,!1,r),s=a.reduceRight((e,t)=>lm(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);rm(o,i.expression,s,i.scope,Up(t),i.node??-1)},wm=(e,t,n,r)=>{e.some(e=>pm.has(e.expression.kind))||e.forEach(e=>{let i=[];Tm(e,-1,t,n,e=>i.push(e)),i.forEach(t=>r(t,e))})},Tm=(e,t,n,r,i,a)=>{let o=bm(r,!1,n,i,!1,a);rm(o,e.expression,void 0,e.scope,Up(r),t)},Em=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(Jp(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=Yh(r,e.name)?void 0:zg(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,n_(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`){Yp(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=Yh(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?Bg(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:zg(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,Qg(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??[])},Dm=/* @__PURE__ */ new WeakMap,Om=/* @__PURE__ */ new WeakMap,km=(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},Am=(e,t,n)=>{let r=e.slice();return r[t]=n,r},jm=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,Mm=(e,t)=>{let n=new _(t);return e.isInit?n:y(n,b.error)},Nm=(e,t,n,r)=>{let i=Rh(n);return r&&pm.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 ${jm(e)}, TLC expected a boolean expression,\nbut instead found ${I(t)}.\n${i}`},Pm=(e,t,n)=>{let r=_s(t),i=V(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 ${jm(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
1781
|
+
`:``}${i}`},Fm=(e,t,n)=>Rm(e,t,U(t,n)),Im=new Set(mp.map(e=>e.name)),Lm=e=>e.kind===`Apply`?Im.has(e.operator):e.kind!==`Identifier`&&!pm.has(e.kind),Rm=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;let i=Nm(e,n,t,r);throw e.isInit&&r&&Lm(t)?new ue(i):Mm(e,i)},zm=(e,t,n,r)=>r.environment.callStack?U(n,r):(e[t]??=g_(n,r.environment))(r),Bm=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Vm=(e,t,n)=>{let r=n?Dm:Om,i=r.get(e);if(i)return i;let a=xh(e,t,n),o=n?void 0:bh(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},Hm=(e,t)=>{if(t.constants.has(e))return;let n=og(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},Um=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return Um(e.expression,t,!1,r);if(e.kind!==`Identifier`||k(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Hm(e.name,t);if(a&&!r.has(a))return r.add(a),Um(a.body,t,n,r)},Wm=(e,t,n)=>Um(e,t,!n),Gm=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return Gm(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=n_(e.definitions,km(r,t,n));return Gm(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Yh(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return Gm(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=Hm(e.name,r.environment);if(s)return Gm(s.body,void 0,n,r,i)},Km=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||k(e))||!t&&e.kind===`Prime`,qm=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>qm(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=Hm(e.name,t);if(i)return n.add(e.name),qm(i.body,t,n)},Jm=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Ym=(e,t,n)=>Jm.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Bm(e.operator)&&(Km(e.args[0],n)||Wm(e.args[0],t,n)!==void 0)||k(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,Xm=/* @__PURE__ */ new Set,Zm=(e,t)=>{if(k(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Sl(e,(e,i)=>{let a=r.isReadOnly?Zm(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},Qm=(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||k(e)?void 0:og(r,t);return i&&!n.has(i)&&(n.add(i),Qm(i.body,t,n))?!0:gt(e).some(e=>Qm(e,t,n))},$m=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Wm(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=qm(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return Ym(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Vm(e,t,n)}},eh=(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(Qu(e,t)===void 0||Qm(e,t,/* @__PURE__ */ new Set))return!0;let n=Zm(e,Xm);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)}},th=(e,t,n)=>{let r=e.map(e=>$m(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Zp(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Ch(u)){d??=km(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&&!Kr(t,i[e.index])}):void 0;if(o){vm(t.environment,o.index,o.expression);return}let s=n.expression,c=zm(a,e,s,d);if(!Rm(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=km(t,n,u);let r=zm(i,s,e.expression,d);if(!Rm(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=km(t,n,u);let r=zm(i,s,e.value,d),a=u[e.index];if(a===void 0)u=Am(u,e.index,r),d=void 0;else if(!Kr(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(!Kr(e,n[i.index])){vm(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)},nh=e=>{let t=hm(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw Mm(n,t);Fm(n,e,km(n,r,i))&&s(i,a)}},rh=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=km(r,i,a);if(a[l]!==void 0){Fm(r,e,u)&&c(a,o);return}let d=U(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!hi(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${jm(r)}, the right side of \\IN is not enumerable.`;throw Mm(r,`${t}\n${V(e)}`)}let p=Ai(f);if(r.generator){for(let e of ff(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(Am(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(Am(a,l,p[e]),o)}},ih=/* @__PURE__ */ new WeakMap,ah=e=>{let t=ih.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(ah),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return ih.set(e,n),n},oh=(e,t)=>{let n=e.args[0],r=nh(e),i=(e,r,i)=>Gm(n,r,i,e,!t)??-1,a=rh(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=U(e.args[1],km(t,n,o));l(Am(o,u,d),s)}},sh=(e,t,n)=>{let r=V(e);return(i,a,o,s,c,l)=>{let u=km(i,a,o),d=U(e.function,n?u:$h(u)),f=Cg(d);if(f!==void 0){Vm(f.body,t,n)(i,wg(f,e,u),o,s,c,l);return}if(!ln(d))throw Mm(i,`In computing ${jm(i)}, a non-function (${_s(d)}) was applied as a function.\n${r}`);let p=U(e,u);if(typeof p!=`boolean`)throw Mm(i,`In computing ${jm(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},ch=(e,t)=>{if(qm(e,t))return th([ah(e)],t,!1);if(e.kind===`Tuple`)return Vm(ah(e),t,!1);let n=ah(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Yh(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){Vm(ah(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=km(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=Bg(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){Vm(ah(n.body),t,!1)(r,Qg(n,e.args,u),a,o,s,c);return}}Fm(r,n,u)&&c(a,o)}},lh=(e,t,n)=>{let r=e.operator,i=nh(e),a=k(e)?void 0:zg(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=x_(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=Vm(a.body,t,n),o.body(e,i(km(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=km(a,o,s),f=Bg(e,d);f?.kind===`Closure`?Vm(f.body,t,n)(a,Qg(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},uh=(e,t,n)=>{let r=nh(e),i=k(e)?void 0:Hm(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=Yh(s,e.name);f?.kind===`Thunk`&&!f.isReleased?Vm(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&Pg(i,t)!==void 0?r(o,s,c,l,u,d):(a.body??=Vm(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},dh=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||k(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`||!k(i))return;let a=Um(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},fh=e=>e.kind===`And`?e.operands.flatMap(fh):[e],ph=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&Ym(e,t,!1),mh=e=>{let t=[];return(n,r,i)=>{let a=km(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!Rm(n,i,zm(t,r,i,a)))return}}},hh=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=fh(e),r=n.findIndex(e=>!ph(e,t)||dh(e,t)),i=r===-1?void 0:dh(n[r],t);return i?{...i,before:r===0?void 0:mh(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>hh(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`||k(e))return;let r=zg(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=hh(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`||!k(o))return;let s=i.before,c=s&&x_(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(km(e,t,n)),n))}},gh=(e,t,n)=>{let r=Yh(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},_h=(e,t,n)=>{let r=e.map(e=>Vm(e,t,n)),i=n?[]:e.map(e=>hh(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&&gh(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)}}},vh=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=tf(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},yh=(e,t)=>{let n=Vm(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=km(r,i,a),u=t.runtime.version,d=hg(e.bounds,e=>U(e,l)).map((n,r)=>ff(ug(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,Zh(i,l,e)))};f(d.length-1,i)}},bh=(e,t)=>{if(e.kind===`Exists`)return yh(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>Vm(e,t,!1));return e.isBulleted?vh(n):n.reduce((e,t)=>vh([e,t]))},xh=(e,t,n)=>{let r=e=>Vm(e,t,n);switch(e.kind){case`And`:return th(e.operands,t,n);case`Or`:return _h(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(n,r,o,s,c,l)=>{let u=ug(U(a.set,km(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,Xh(r,e,u[t]),o,s,c,l)}}let o=n?void 0:eh(e,t);if(o){let r=th(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=km(n,i,a),d=hg(e.bounds,e=>ug(U(e,u),e,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=Xh(t,o.names[e],r);if(e===d.length-1){let e=km(n,i,a);if(!o.guards.every(t=>Fm(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{vg(e.bounds,km(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Qu(e,t)!==void 0&&!Qm(e.body,t,/* @__PURE__ */ new Set)?Zm(e,Xm):void 0;return(t,n,r,o,s,c)=>{let l=[];vg(e.bounds,km(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Yh(n,e)?.kind===`Value`)){u.every(n=>Fm(t,e.body,km(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Ch(r)?u.slice(n).every(n=>Fm(t,e.body,km(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=U(e.condition,km(r,i,a));if(typeof l!=`boolean`)throw Mm(r,Pm(r,l,e));(l?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,source:e.body,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=km(r,i,a),u=t.find(e=>{let t=U(e.condition,l);if(typeof t==`boolean`)return t;throw Mm(r,`In computing ${jm(r)}, a non-boolean expression${r.isEnabled?``:` `}(${_s(t)}) was used as a guard condition of a CASE.\n${Rh(e.source)}`)})?.body??n;if(!u)throw Mm(r,`In computing ${jm(r)}, TLC encountered a CASE with no conditions true.\n${V(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=i_(e.definitions,t);return(t,r,a,o,s,c)=>n(t,n_(e.definitions,km(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new _(`UNCHANGED appears in an initial predicate at ${Ph(e)}`)}:ch(e.expression,t);case`AngleAction`:{let n=r(e.action),i={kind:`Unchanged`,expression:e.subscript,location:e.subscript.location},a=(e,n,r)=>{try{return Fm(e,i,km(e,n,r))}catch(n){throw e.isEnabled?Jh(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return _h([e.action,ah(e.subscript)],t,n);case`Label`:return r(e.body);case`Identifier`:return uh(e,t,n);case`FunctionApplication`:return sh(e,t,n);case`Apply`:{let i=e.args;if(Bm(e.operator)){let r=Wm(i[0],t,n);if(r!==void 0)return e.operator===`=`?th([e],t,n):rh(e,()=>r);if(Km(i[0],n))return oh(e,n)}if(e.operator===`=>`){let t=r(i[1]);return(n,r,a,o,s,c)=>{let l=U(i[0],km(n,r,a));if(typeof l!=`boolean`){let t=_s(l),r=V(e);throw Mm(n,n.isInit?`In computing initial states of a predicate of form P => Q, P was ${t}\n.${r}`:n.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${t}.\n${r}`:`In computing next states of a predicate of the form P => Q, P was\n${t}.\n${r}`)}l?t(n,r,a,o,s,c):c(a,o)}}return lh(e,t,n)}default:return nh(e)}},Sh=e=>e.variables.map(()=>void 0),Ch=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},wh=(e,t)=>{let n=t.state;if(!n||!Ch(n))throw new _(`ENABLED needs a complete state at ${Ph(e)}`);let r=t.environment;if(r.callStack)return Sm(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1,generator:void 0,successors:0};return Vm(e,r,!1)(i,t.scope,Sh(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Th=(e,t,n,r,i)=>{let a={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};Vm(e,t,!0)(a,r,Sh(t),void 0,!1,e=>{if(!a.isStopped){if(!Ch(e)){if(i){a.isStopped=i([...e]);return}throw y(new f([...e]),b.error)}a.isStopped=n(e)}})},Eh=(e,t,n)=>{let r=[];return Th(e,t,e=>(r.push(e),!1),n),r},Dh=(e,t,r,i,a,o,s)=>{let c={environment:r,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:o,successors:0,onUnsatisfied:s};return Vm(e,r,!1)(c,a,Sh(r),void 0,!1,(e,t)=>{if(!c.isStopped){if(!Ch(e)){let i=r.variables.filter((t,n)=>e[n]===void 0);throw new n(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,e,t,i)}c.successors++,c.isStopped=i({state:e,action:t})}}),c.successors},Oh=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return Vm(e,n,!1)(i,r,Sh(n),void 0,!1,e=>{Ch(e)||(i.isStopped=!0)}),i.isStopped},kh=(e,t,n,r)=>{let i=[];return Dh(e,t,n,e=>(i.push(e),!1),r),i},Ah=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),jh=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Mh=e=>jh.has(e.kind)||e.kind===`Apply`&&Ah.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&&cn(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Ph=e=>`line ${e.location.line}, column ${e.location.column}`,Fh=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,V=e=>{let t=e.location.range;return t?Fh(t):Ph(e)},Ih={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},Lh=(e,t)=>new _(`TLC encountered a temporal formula (${e}) when evaluating a predicate or action.\n${V(t)}`),Rh=e=>e.kind===`Number`?e.text??String(e.value):V(e),zh=(e,t)=>new _(`A non-boolean expression (${_s(t)}) was used as the condition of an IF.\n${V(e)}`),Bh=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new _(`A non-boolean expression (${_s(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${Rh(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new _(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${_s(n)}.\n${V({...e,location:{...e.location,range:{...r,end:i}}})}`)},Vh=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${A(I(n))}\n${V(e)}`,r=e=>`Attempted to apply function:\n${A(I(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!ln(i))throw new _(`Attempted to select field "${t}" from a non-record value ${A(I(i))}\n${V(e)}`);let a=ir(i);if(a===`tuple`)throw ia(t);return ua(i.kind===`LazyFunction`?F(i):i,t,a===`record`?n:r)}},Hh=e=>e===`1.7.4`?(t,n)=>ta(t,n,e):void 0,Uh=e=>t=>{if(!ln(t))throw new _(`Attempted to apply the operator DOMAIN to a non-function\n(${_s(t)})\n${V(e)}`);return fa(t)},Wh=(e,t)=>(n,r)=>{if(!j(n)||Vn(n))throw new _(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${V(e)}`);return t.evaluateBinary?t.evaluateBinary(n,r):t.evaluate([n,r])},Gh=e=>y(new _(`TLC can't handle real numbers.\n${e.text}`),b.configParseError),Kh=e=>y(new _(`TLC can't handle a number this big.\n${e.text??e.value}`),b.error),qh=(e,t)=>new d(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${V(t)}`,e),Jh=(e,t)=>e instanceof d&&t!==`1.7.4`?new _(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,Yh=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},Xh=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Zh=(e,t,n)=>{if(t.kind===`Name`)return Xh(e,t.name,n);let r=Hi(n);if(!r||r.length!==t.names.length){let e=t.ranges?.[0];throw new _(`Argument mismatch in operator application.${e?Fh(e):``}`)}return t.names.reduce((e,t,n)=>Xh(e,t,r[n]),e)},Qh=(e,t)=>{if(ln(e))return e;throw new _(`A non-function (${_s(e)}) was applied as a function.\n${V(t)}`)},$h=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},eg=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),tg=(e,t)=>{if(typeof e!=`boolean`)throw new _(`Expected ${t} to be a boolean but found ${I(e)}`);return e},ng=(e,t,n)=>{if(typeof e!=`boolean`)throw new _(`Attempted to evaluate an expression of form P => Q when ${n} was\n${_s(e)}.\n${V(t)}`);return e},rg=(e,t)=>{if(typeof e!=`boolean`)throw new _(`Attempted to apply the operator ~ to a non-boolean\n(${_s(e)})\n${V(t)}`);return!e},ig=(e,t,n)=>{if(typeof e!=`boolean`||typeof t!=`boolean`)throw new _(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${V(n)}`);return e===t},ag=(e,t)=>{if(typeof e!=`boolean`)throw new _(`TLC expected a boolean value, but did not find one. ${Rh(t)}`);return e},og=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),sg=(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.`},cg=(e,t,n)=>{if(!j(e)||Vn(e)){let r=I(e),i=n===`1.7.4`?void 0:sg(e,r);throw new _(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${Rh(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${Rh(t)}\n${i}`)}},lg=(e,t,n)=>(cg(e,t,n),typeof e==`object`&&e.kind===`Interval`?ci(e):Si(e)??Oi(e)),ug=(e,t,n)=>n===`1.7.4`?(cg(e,t,n),Si(e)??Ai(e)):lg(e,t,n),dg=e=>{if(typeof e==`object`&&e.kind===`Interval`)return Li(e),e},fg=(e,t,n)=>dg(e)??ug(e,t,n),pg=(e,t,n)=>dg(e)??lg(e,t,n),mg=(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},hg=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set)),n),[]),gg=(e,t)=>hg(e,e=>fg(U(e,t),e,t.environment.runtime.version)),_g=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):mg(t[n],t=>i(n-1,Zh(a,e[n].pattern,t)));return i(e.length-1,n)},vg=(e,t,n)=>_g(e,gg(e,t),t.scope,n),yg=(e,t)=>{let n=hg(e,e=>U(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},bg=(e,t,n)=>{if(e.length===1)return Zh(t,e[0].pattern,n);let r=Hi(n)??[];return e.reduce((e,t,n)=>Zh(e,t.pattern,r[n]),t)},xg=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Sg=e=>Object.assign(e.value,{lambda:e}),Cg=e=>xg(e)?e.lambda:void 0,wg=(e,t,n)=>{let r=e.value,i=t.args.map(e=>U(e,n)),a=i.length===1?i[0]:fi(i),o=(e,n,i)=>`In applying the function\n${A(I(r))},\nthe ${e} is:\n${A(I(n))}${i}.\n${V(t.function)}`,s=e.bounds;if(s.length===1){if(!qi(a,r.domain))throw new _(o(`first argument`,a,`which is not in its domain`));return bg(s,e.scope,a)}let c=Hi(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[],u=()=>new _(`In applying the function\n${A(I(r))},\nthe argument list is:\n${A(I(a))}\nwhich does not match its formal parameter.\n`);if(c===void 0||(s.forEach((e,t)=>{if(t>=c.length)throw u();let n=c[t],r=`argument number ${t+1}`;if(!qi(n,l[t]))throw new _(o(r,n,`${e.pattern.kind===`Name`?``:`
|
|
1782
|
+
`}which is not in its domain`));if(e.pattern.kind===`Tuple`&&Hi(n)?.length!==e.pattern.names.length)throw new _(o(r,n,`which does not match its formal parameter`))}),c.length>s.length))throw u();return bg(s,e.scope,a)},Tg=(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:Fh(n)}},Eg=(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}},Dg=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},Og=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),kg=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),Ag=(e,t)=>{let n=yg(e.bounds,t),r=Dg(n,(n,r)=>U(e.body,eg(t,bg(e.bounds,Xh(void 0,e.name,r),n))),Eg(Tg(e.bounds,e.body),e.bounds,n),Og(e.bounds));Sg({value:r,bounds:e.bounds,body:e.body,scope:Xh(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=Ag(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?ar(i):i},jg=(e,t)=>{if(typeof t!=`object`||ir(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!cn(t.domain))return t;try{let e=F(t);return tr(e.domain,e.range)}catch(e){if(e instanceof _)return t;throw e}},Mg=(e,t)=>e.kind===`Operator`&&e.params.length>0?()=>{throw new _(`Operator ${e.name} requires ${e.params.length} arguments`)}:e.kind===`Function`?e.isSelfReferential?t=>Ag(e,t):g_(kg(e),t):g_(e.body,t),Ng=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=Mg(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(eg(e,void 0)):e=>a[i]??r(eg(e,void 0));return t.definitionEvaluators.set(e,o),o},Pg=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},Fg=(e,t)=>e.forEach(e=>{if(e.kind===`Operator`&&e.params.length>0)return;let n=e.name;if(t.constants.has(n)||t.substitutions.has(n)||!qu(e,t))return;let r=t.facts.ids.get(e);if(r===void 0||t.startupValues[r]!==void 0)return;let i={environment:t,scope:void 0,state:void 0,next:void 0};try{let n=t.runtime.evaluateAtStartup(()=>jg(e,Mg(e,t)(i)));Wr(n),t.startupValues[r]=n}catch(e){if(!(e instanceof _)&&!ne(e))throw e}}),Ig=(e,t)=>{if(t===void 0||e===t)return!0;try{return t.every((t,n)=>t===void 0||e?.[n]!==void 0&&fr(e[n],t))}catch(e){if(e instanceof _)return!1;throw e}},Lg=(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,()=>U(e.expression,eg(t,e.scope))):U(e.expression,eg(t,e.scope));return(!e.isStreamed||Mi(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},Rg=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),zg=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return zg(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Rg(r):t.builtins.get(e)},Bg=(e,t)=>k(e)?Vg(e.operator,t):zg(e.operator,t.environment)??Vg(e.operator,t),Vg=(e,t)=>{let n=Yh(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return zg(e,t.environment)},Hg=e=>e.kind===`Closure`?e.params.length:e.arity,Ug=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:e.params.map(e=>({name:e,arity:0})),body:e.body,scope:t.scope};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0,r=n===void 0?void 0:Vg(n,t);if(!r)throw new _(`Expected an operator argument at ${Ph(e)}`);return r},Wg=(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)=>Xh(e,n.name,t[r]),e.scope);return U(e.body,eg(n,r))},Gg=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Hg(e),call:n=>Wg(e,n,t)},Kg=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Vg(e.name,t);return n!==void 0&&Hg(n)>0},qg=(e,t)=>e.map(e=>Kg(e,t)?Gg(Ug(e,t),t):U(e,t)),Jg=(e,t)=>new _(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),Yg=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),Xg=(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 Xg(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([])}},Zg=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&pn(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=Yg(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=k(e)?void 0:Xg(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=Yh(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:Yg(e,t)}}return t=>Yg(e,t)},Qg=(e,t,n,r)=>{if(t.length!==e.params.length)throw Jg(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:Ug(t[a],n)}:(r?.[a]??Zg(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},$g=(e,t,n,r)=>e.kind===`Closure`?U(e.body,eg(n,Qg(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>U(e,n))):e.isLazy?e.evaluate(y_(t,n),n):e.evaluate(qg(t,n),n),e_=/* @__PURE__ */ new WeakMap,t_=e=>{let t=e_.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return e_.set(e,n),n},n_=(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:t_(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},r_=(e,t,n)=>{let r=Yh(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Lg(r,n);if(r?.kind===`Operator`){if(Hg(r.operator)===0)return Wg(r.operator,[],n);throw new _(`Operator ${e} is used without arguments`)}let i=Xg(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw qh(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Ng(i.definition,n.environment)(n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new _(`Unknown identifier ${e} at ${Ph(t)}`)},i_=(e,t)=>({impure:new Set(e.filter(e=>Yu(e,t))),streamed:new Set(e.filter(e=>Yu(e,t,`streamed`)))}),a_=e=>[...e.facts.ids.keys()].some(t=>Yu(t,e)),o_=e=>[...e.facts.ids.keys()].some(t=>Yu(t,e,`repeated`)),s_=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,c_=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),l_=e=>t=>{let n=e(t);return fr(n,e(c_(t)))},u_=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Wi.sets,o=Wi.callStack,c=a??[],l=c.length;Wi.sets=c,Wi.callStack=r;try{let a=t(i),o=s_(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Mh(e)&&r.sources.set(o,e),o}catch(t){t instanceof s&&!r.isFrozen&&(r.expressions.length=0,r.isFrozen=!0);let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Nh(e,r.values),a=i&&!gt(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!ln(a)?void 0:a;throw d_(r,[o,...c.slice(l).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),c.length=l,Wi.sets=a,Wi.callStack=o}},d_=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof _){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},f_=(e,t,n)=>{if(!(n instanceof _))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},p_=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}}),m_=(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)}},h_=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=Po(n,i,e);Fo(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}},H=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=U_(e,t),i=t.callStack,a=i&&ml.get(e),o=i?u_(e,r,t,i):r,s=i&&a?m_(e,a,o,i):o,c=t.coverage,l=c?h_(e,s,c):s;return t.evaluators.set(e,l),l},g_=(e,t)=>{if(t.callStack||t.coverage)return H(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=Js(e,t)??H(e,t);return t.entryEvaluators.set(e,r),r},U=(e,t)=>g_(e,t.environment)(t),__=(e,t)=>{let n=e.name,r=k(e)?void 0:Xg(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw qh(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??=Ng(e,t))(r)}return t=>r_(n,e,t)},v_=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||k(e))return!0;let n=zg(e.name,t);return n===void 0||Hg(n)===0},y_=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>U(e,t),expression:e})),b_=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(y_(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&v_(t[0],n)){let e=H(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&v_(t[0],n)&&v_(t[1],n);if(i&&a){let e=H(t[0],n),r=H(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(qg(t,n),n)},x_=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw Jg(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Zg(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:Ug(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},S_=(e,t,n)=>{let r=x_(e,t,n),i={body:void 0};return t=>(i.body??=g_(e.body,n),i.body({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},C_=(e,t)=>{let n=e.args;if(e.operator===`=>`){let r=H(n[0],t),i=H(n[1],t);return t=>!ng(r(t),e,`P`)||ng(i(t),e,`Q`)}if(e.operator===`~`&&n.length===1){let r=H(n[0],t);return t=>rg(r(t),e)}if(e.operator===`<=>`){let r=H(n[0],t),i=H(n[1],t);return t=>ig(r(t),i(t),e)}if(e.operator===`~>`||e.operator===`-+->`)return()=>{throw Lh(e.operator===`~>`?`a ~> b`:`a -+-> formula`,e)};let r=k(e)?void 0:zg(e.operator,t);if(r?.kind===`Closure`)return S_(r,n,t);if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=H(n[0],t),i=Uh(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=!pl.has(e)&&!$u(n[0],t);return e=>r.evaluate(y_(n,e),i&&e.scope===void 0?void 0:e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=H(n[0],t),a=H(n[1],t),o=Wh(e,r);return e=>o(i(e),a(e))}if(r?.kind===`Builtin`)return b_(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new _(t.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 i=n.map(e=>Zg(e,t));return r=>{let a=Vg(e.operator,r);if(a)return $g(a,n,r,i);throw t.definitions.get(e.operator)?.kind===`Function`?new _(`${e.operator} is a function; apply it with brackets`):new _(`Unknown operator ${e.operator} at ${Ph(e)}`)}},w_=(e,t)=>{let n=e.kind===`Forall`,r=H(e.body,t),i=e.bounds[0];if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=H(i.set,t);return s=>mg(fg(o(s),i.set,t.runtime.version),t=>ag(r(eg(s,Xh(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=hg(a,e=>fg(H(e,t)(o),e,t.runtime.version)),c=(t,a)=>t<0?ag(r(eg(o,a)),e)!==n:mg(s[t],e=>c(t-1,Xh(a,i[t],e)));return c(a.length-1,o.scope)?!n:n}}return t=>vg(a,t,i=>ag(r(eg(t,i)),e)!==n)?!n:n},T_=(e,t)=>{if(e.kind===`Tuple`)return fi(e.names.map(e=>{let n=Yh(t,e);return n?.kind===`Value`&&n.value}));let n=Yh(t,e.name);return n?.kind===`Value`?n.value:void 0},E_=/* @__PURE__ */ new WeakSet,D_=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&E_.add(e)},O_=/* @__PURE__ */ new WeakMap,k_=e=>{if(O_.has(e))return O_.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(`@`),gt(e).every(n)),r=n(e)?[...t]:void 0;return O_.set(e,r),r},A_=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=Yh(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),j_=e=>E_.has(e),M_=(e,t)=>{let n=j_(e),r=H(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=e=>r(eg(t,Xh(t.scope,n,e)));if(on(e))return Li(e),sn(e,i),d(e,t);let o=ui(e),s=tr(o,o.map(i));return cn(e)?s:(s.lambdaDomain=e,ar(s))}let n=[],s=hg(i,e=>pg(U(e,t),e,t.environment.runtime.version));return _g(i,s,t.scope,e=>{let o=i.length===1?T_(a.pattern,e)??!1:fi(i.map(t=>T_(t.pattern,e)??!1));return n.push([o,r(eg(t,e))]),!1}),ti(n)},c=Tg(i,e.body),l=Og(i),u=k_(e.body),d=(t,n)=>{let a=A_(n.scope,u),o=eg(n,a),s=Sg({value:Dg(t,e=>r(eg(o,bg(i,a,e))),Eg(c,i,t),l),bounds:i,body:e.body,scope:a});return i.length===1?ar(s):s},f=t.callStack;return{build:(t,r)=>{if(e.isRecursive||n||r.isKeepLazy||!M(t))return d(t,r);if(!(i.length===1?cn(t):typeof t==`object`&&t.kind===`ProductSet`&&t.factors.every(cn))){if(f)return d(t,r);try{return s(t,r)}catch(e){if(!(e instanceof _))throw e;return d(t,r)}}if(!f)return s(t,r);try{return s(t,r)}catch(t){throw f_(f,e,t),t}},createLazy:d}},N_=(e,t)=>{let n=M_(e,t).build,r=e.bounds;if(r.length===1&&r[0].pattern.kind===`Name`){let e=H(r[0].set,t);return t=>n(e(t),t)}return e=>n(yg(r,e),e)},P_=(e,t)=>{let n=E_.has(e);n&&D_(e.function);let r=H(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=>H(e,t))}),value:H(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):fi(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(eg(i,Xh(i.scope,`@`,e))):pa(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(St.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${V(e.function)}`)}return n}},F_=(e,t)=>{let n=H(e.predicate,t),r=e.bound.pattern,i=e.predicate.location.range,a=i&&{names:r.kind===`Name`?r.name:r.names.join(`, `),predicate:Fh(i)},o=Rh(e.predicate),s=t.coverage,c=(e,t,n)=>{if(!s||e===-1)return n();t||s.secondary[e]++;let r=Io(s,t?-1:e,n);return!t&&r===!0&&s.secondary[e]++,r},l=(t,n,i,s)=>({kind:`FilteredSet`,base:t,test:(e,t)=>{if(r.kind===`Tuple`&&Hi(e)?.length!==r.names.length)throw new _(`Attempted to check if the value:\n${A(I(e))}\nis an element of a set of ${r.names.length}-tuples.`);let a=c(s,t,()=>i(eg(n,Zh(n.scope,r,e))));if(typeof a!=`boolean`)throw new _(`${t?`The evaluation of predicate`:`Evaluating predicate`} ${o} yielded non-Boolean value.`);return a},source:a,rebind:r=>l(t,{...n,environment:r},H(e.predicate,r),-1)});return(e,t,r=-1)=>l(e,t,n,r)},I_=(e,t)=>{if(typeof e!=`boolean`)throw new _(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${_s(e)}.\n${Rh(t.predicate)}`);return e},L_=(e,t,n,r)=>{if(!j(e)||Vn(e))throw new _(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${V(t)}`);return Gr(e),pg(e,n,r)},R_=e=>new _(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${V(e)}`),z_=(e,t)=>{if(e.kind===`SetFilter`){let n=H(e.predicate,t),r=H(e.bound.set,t),i=F_(e,t),a=e.bound.pattern,o=t.coverage;return t=>{let s=r(t);if(!cn(s))return i(s,t,o?.current);let c=[],l=r=>{let i=n(eg(t,Zh(t.scope,a,r)));I_(i,e)&&an(c,r)},u=s.kind===`Interval`?s:N(s).elements;return sn(u,l),o&&o.current!==-1&&(o.secondary[o.current]+=(Array.isArray(u)?u.length:u.high-u.low+1)+c.length),er(c)}}if(e.kind===`SetMap`){let n=H(e.expression,t);return t=>{let r=[];return vg(e.bounds,t,e=>(an(r,n(eg(t,e))),!1)),Xr(r)}}let n=e.set;if(!n)return()=>{throw new _(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${V(e)}`)};let r=H(e.body,t),i=H(n,t);return t=>{let a=L_(i(t),e,n,t.environment.runtime.version),o={value:void 0},s=e.pattern;if(mg(a,n=>{if(s.kind===`Tuple`&&Hi(n)?.length!==s.names.length)throw new _(`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${V(e)}`);let i=Zh(t.scope,s,n);return ag(r(eg(t,i)),e)?(o.value=T_(s,i),!0):!1}),o.value===void 0)throw R_(e);return o.value}},B_=e=>[...e].sort((e,t)=>Jn(e.name,t.name)),V_=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),H_=(e,t)=>{let n=B_(e),r=V_(n),i=n.map(e=>H(e.value,t));if(r)return e=>pi(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=>yn(a,i.map(t=>t(e)),o):e=>mi(a,i.map(t=>t(e)))},U_=(e,t)=>{let n=e=>H(e,t);switch(e.kind){case`Number`:{let t=e.value;return pn(t)?()=>t:()=>{throw Kh(e)}}case`Decimal`:return()=>{throw Gh(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return __(e,t);case`Apply`:return C_(e,t);case`Bracket`:return()=>{throw new _(`A bracket without a function or subscript is not an expression at ${Ph(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new _(`An operator cannot be used as a value at ${Ph(e)}`)};case`And`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw Bh(e,r,i);if(!i)return!1}return!0}}case`Or`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw Bh(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return e=>t(c_(e))}case`Unchanged`:return l_(n(e.expression));case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw zh(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new _(`A non-boolean expression (${_s(t)}) was used as a condition of a CASE. ${Rh(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new _(`Attempted to evaluate a CASE with no conditions true.\n${V(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(eg(n,n_(e.definitions,n)))}case`Forall`:case`Exists`:return w_(e,t);case`UnboundedQuantifier`:return()=>{let t=e.quantifier===`Forall`?`\\A`:`\\E`;throw e.isTemporal?Lh(e.quantifier===`Forall`?`\\AA`:`\\EE`,e):new _(`TLC attempted to evaluate an unbounded ${t}.\nMake sure that the expression is of form ${t} x \\in S: P(x).\n${V(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return z_(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Xr(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>fi(t.map(t=>t(e)))}case`FunctionConstruction`:return N_(e,t);case`FunctionSet`:{let t=n(e.domain),r=n(e.range);return e=>({kind:`FunctionSet`,domain:t(e),range:r(e)})}case`Record`:return H_(e.fields,t);case`RecordSet`:{let t=B_(e.fields),r=t.map(e=>e.name),i=t.map(e=>n(e.value));return e=>({kind:`RecordSet`,names:r,sets:i.map(t=>t(e))})}case`Except`:return P_(e,t);case`ExceptAt`:return t=>{let n=Yh(t.scope,`@`);if(n?.kind!==`Value`)throw new _(`@ appears outside an EXCEPT at ${Ph(e)}`);return n.value};case`FunctionApplication`:{D_(e.function);let r=n(e.function),i=t=>Qh(r($h(t)),e),a=e.args.map(n),o=Hh(t.runtime.version);if(a.length===1){let e=a[0];return t=>ua(i(t),e(t),o)}return e=>ua(i(e),fi(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=Vh(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=l_(n(e.subscript)),i=e.kind===`BoxAction`,a=i?`[A]_e`:`<A>_e`;return n=>{let o=t(n);if(typeof o!=`boolean`)throw new _(`Attempted to evaluate an expression of form ${a}, but A was not a boolean.\n${V(e)}`);return i?o||r(n):o&&!r(n)}}case`Enabled`:{let t=e.expression;return e=>wh(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new _(`The subexpression reference at ${Ph(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw Lh(Ih[e.kind],e)}}},W_=`tlc2/value/impl/`,G_={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},K_={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},q_=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)}},J_=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),Y_=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],X_=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??J_.get(e[3])}${`[]`.repeat(e[1].length)}`),Z_=(e,t)=>e[e[t].first].text,Q_=(e,t)=>Z_(e,t).replaceAll(`/`,`.`),$_=e=>{let t=q_(e);if(t.readUint32()!==3405691582)throw new r(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],i=t.readUint16(),a=new TextDecoder;for(let e=1;e<i;e++){let r=t.readUint8(),i={tag:r,text:``,value:0,first:0,second:0};n[e]=i,r===G_.utf8?i.text=a.decode(t.readBytes(t.readUint16())):r===G_.integer?i.value=t.readInt32():r===G_.float?t.readUint32():r===G_.long||r===G_.double?(t.readBytes(8),e++):r===G_.class||r===G_.string||r===G_.methodType||r===G_.module||r===G_.package?i.first=t.readUint16():r===G_.methodHandle?(t.readUint8(),i.first=t.readUint16()):(i.first=t.readUint16(),i.second=t.readUint16())}t.readUint16();let o=Q_(n,t.readUint16());t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let s=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,a=i.indexOf(`)`),c=X_(i.slice(1,a)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:q_(t.readBytes(t.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()},()=>Q_(n,d.readUint16())):[],p=Y_.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=X_(i.slice(a+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;s.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${o}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:s}},ev=(e,t)=>{let n=e[t],r=e[n.second];return{className:Z_(e,n.first),name:e[r.first].text}},tv=(e,n,r,i)=>{let a=()=>new t(`The Java override ${r}.${e.name} computes its value, which tla-ts cannot run`),o=e.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===G_.integer)return t.value;if(t.tag===G_.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>=K_.iconstM1&&t<=K_.iconst5)s.push(t-K_.iconst0),e+=1;else if(t===K_.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===K_.sipush)s.push(r()<<16>>16),e+=3;else if(t===K_.ldc)s.push(l(o[e+1])),e+=2;else if(t===K_.ldcW)s.push(l(r())),e+=3;else if(t===K_.dup){let t=c();s.push(t,t),e+=1}else if(t===K_.getstatic){let t=ev(n,r());if(t.className!==`${W_}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===K_.invokestatic){let t=ev(n,r()),o=c();if(t.className!==`${W_}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===K_.new)s.push({className:Z_(n,r()),value:void 0}),e+=3;else if(t===K_.invokespecial){let t=ev(n,r()),o=c(),s=c();if(!(t.className===`${W_}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===K_.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()},nv=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=$_(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:tv(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)}))}},rv=D(`EOF`),iv=D(`IDENTIFIER`),av=D(`DEFBREAK`),ov=(e,t)=>Array.from({length:D(t)-D(e)+1},(t,n)=>D(e)+n),sv=new Set(ov(`op_57`,`op_119`)),cv=new Set(ov(`op_1`,`op_119`)),lv=new Set(ov(`op_57`,`op_70`)),uv=/* @__PURE__ */ new Set([...ov(`ACTION`,`EXCEPT`),D(`EXTENDS`),...ov(`IF`,`SF`),D(`STATE`),...ov(`THEN`,`WITH`),D(`US`),...ov(`op_112`,`op_116`)]),dv=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),fv=new Map([...dv(`postfix`,160,160,!0,`[`),...dv(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...dv(`prefix`,120,120,!1,`-.`),...dv(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...dv(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...dv(`prefix`,40,40,!0,`\\lnot`),...dv(`nfix`,100,130,!0,`\\times`),...dv(`infix`,140,140,!1,`^`,`^^`),...dv(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...dv(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...dv(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...dv(`infix`,100,110,!0,`|`,`||`,`%%`),...dv(`infix`,100,110,!1,`%`),...dv(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...dv(`infix`,90,140,!1,`\\wr`),...dv(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...dv(`infix`,90,130,!1,`!!`),...dv(`infix`,90,90,!1,`...`,`..`),...dv(`infix`,80,80,!0,`\\intersect`,`\\union`),...dv(`infix`,80,80,!1,`\\`),...dv(`infix`,70,70,!1,`<:`,`:>`),...dv(`infix`,60,60,!0,`@@`),...dv(`infix`,50,140,!0,`\\cdot`),...dv(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...dv(`infix`,30,30,!0,`\\land`,`\\lor`),...dv(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...dv(`infix`,10,10,!1,`=>`)]),pv=new Map([...fv,...Xf.flatMap(e=>e.slice(1).map(t=>[t,fv.get(e[0])]))]),mv=pv.get(`[`),hv={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},gv=e=>({type:`tokens`,kinds:new Set(e)}),_v=e=>typeof e==`string`?e.startsWith(`<`)?gv([D(e.slice(1,-1))]):{type:`call`,name:e}:e,W=(...e)=>({type:`sequence`,units:e.map(_v)}),G=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:W(e))}),vv=e=>(...t)=>({type:e,body:W(...t)}),K=vv(`zeroOrMore`),yv=vv(`oneOrMore`),q=vv(`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}),bv=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),xv=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=bv(e,n);return n},Sv=(...e)=>{let t=e.map(D);return e=>t.includes(xv(e,1).kind)},Cv=(e,t=xv(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},wv=e=>{let t=xv(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Tv=e=>Sv(`CASESEP`)(e)&&Cv(e),Ev=e=>{let t=xv(e,1);uv.has(t.kind)&&(t.kind=iv)},Dv=(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}`,Ov=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),kv=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Av=e=>e.operatorStacks[e.operatorStacks.length-1],jv=(e,t)=>e.low>t.high,Mv=(e,t)=>e.high<t.low,Nv=e=>e.fix===`prefix`?e:pv.get(`${e.name}.`),Pv=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===mv?Ov(`FcnAppl`,[n,...r.node.heirs]):Ov(`PostfixExpr`,[n,r.node]),operator:void 0})},Fv=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Ov(`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:Ov(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=Av(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 Pv(t,n),Iv(e);if(i.operator!==void 0){let t=Nv(r.operator);return t!==void 0&&jv(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Dv(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 ${Dv(e,a.node.first,a.node.last)} and expression at location ${Dv(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Mv(a.operator,r.operator)?void 0:jv(a.operator,r.operator)?(Fv(t,a.operator),Iv(e)):`Precedence conflict between ops ${a.operator.name} in block ${Dv(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Nv(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Mv(s,r.operator))return;if(!jv(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Dv(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Fv(t,s),Iv(e);let c=Dv(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===hv?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},Lv=e=>J(t=>{let n=Av(t),r=kv(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)}),Rv=Lv(()=>!1),zv=Lv(()=>!0),Bv=J(e=>{e.lastOperator=pv.get(e.token.image)}),Vv=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},Hv=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?Vv(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Uv=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Cv(e,n.first.beginColumn))return n;let t=Uv(e,n);if(t!==void 0)return t}},Wv=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(D),n=(e,...t)=>t.some(t=>e.kind===D(t)),r=e=>e!==void 0&&sv.has(e.kind),i=e.token,a=bv(e,i);i.next=void 0;let o=bv(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===iv&&(e=e.next)}else if(e.kind===iv){let t=e.next;!r(t)||lv.has(t.kind)||cv.has(t.kind)&&t.next?.kind!==iv||(e=t.next?.kind===D(`SUBSTITUTE`)?i:cv.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==av&&(e.next={kind:av,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=bv(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Gv=e=>{let t=xv(e,1);if(t.kind===D(`LAB`)){let n=1;for(;n!==0;)if(t=bv(e,t),t.kind===D(`LAB`)&&n++,t.kind===D(`RAB`)&&n--,t.kind===rv)return!1;return bv(e,t).kind===D(`IN`)}if(t.kind!==iv)return!1;for(t=bv(e,t);t.kind===D(`COMMA`);){if(t=bv(e,t),t.kind!==iv)return!1;t=bv(e,t)}return t.kind===D(`IN`)},Kv=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),qv=e=>e.proofLevels.at(-1)??-1,Jv=e=>{let t=xv(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:Sv(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||qv(e)>=0&&Kv(t)>qv(e):Sv(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Yv=(e,t)=>{let n=Kv(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},Xv=e=>J(t=>Yv(t,t.token)?void 0:`${Dv(t,t.token)}: ${e}`),Zv=gv([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(D)),Qv=gv([...Zv.kinds,D(`op_76`)]),$v=gv(cv),ey=gv(lv),ty=gv([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(D)),ny=()=>K(X({expansion:[G(Zv,`<op_77>`)],semantic:Cv}),G(`PrefixOp`,`InfixOp`),zv),ry=()=>G(W(X({expansion:[`OpenStart`],semantic:Cv}),`OpenExpression`,Rv),W(X({semantic:Cv}),`ExtendableExpr`)),iy=()=>G(W(`<MODULE>`,Y(`identifier`),`Identifier`),`Expression`),ay=()=>G(W(X({semantic:e=>Sv(`ASSUME`,`BOXASSUME`)(e)||xv(e,2).kind===D(`COLONCOLON`)&&[D(`ASSUME`),D(`BOXASSUME`)].includes(xv(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),oy=()=>[`JuncItem`,K(X({semantic:wv}),`JuncItem`)],sy=e=>J(t=>{t.expecting=e,Ev(t)}),cy=e=>J(t=>{t.isTerminalProof=e}),ly=(e,...t)=>W(...t.slice(0,-1),Y(`==`),`<DEF>`,J(t=>{Wv(t),t.expecting=e}),t[t.length-1]),Z=(e,t,n)=>({message:e,body:W(...t),exit:n}),uy={CompilationUnit:Z(void 0,[J(Wv),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>`),sy(`Identifier`),`Identifier`,J(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Z(void 0,[`<END_MODULE>`]),Extends:Z(`Extends`,[q(`<EXTENDS>`,sy(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,sy(`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(Wv)),W(X({semantic:e=>Sv(`USE`)(e)&&xv(e,2).kind!==D(`ONLY`)||Sv(`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(ly(`Expression`,X({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,Y(`[`),`<LSB>`,Y(`Identifier`),`QuantBound`,Y(`COMMA or ]`),K(`<COMMA>`,Y(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),ly(`Expression`,X({expansion:[`<IDENTIFIER>`,ey]}),`PostfixLHS`,`Expression`),ly(`Expression`,X({expansion:[`<IDENTIFIER>`,$v]}),`InfixLHS`,`Expression`),ly(`Expression or Instance`,X({expansion:[`<IDENTIFIER>`,G(`<LBR>`,`<DEF>`)]}),`IdentLHS`,G(`Expression`,`Instantiation`)),ly(`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`,[Qv,Y(`Identifier`),`Identifier`]),InfixLHS:Z(`Infix LHS`,[`Identifier`,$v,`Identifier`]),PostfixLHS:Z(`Postfix LHS`,[`Identifier`,ey]),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>`,sy(`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,[Zv,Bv]),NonExpPrefixOp:Z(void 0,[Qv,Bv]),InfixOp:Z(`Infix Op`,[$v,Bv]),PostfixOp:Z(void 0,[ey,Bv]),Identifier:Z(void 0,[`<IDENTIFIER>`]),Assumption:Z(`Assumption`,[Y(`ASSUM...`),G(`<ASSUMPTION>`,`<ASSUME>`),q(X({amount:2}),q(`<DEFBREAK>`),`Identifier`,Y(`==`),`<DEF>`),J(e=>{Wv(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Z(`Assume-Prove`,[G(W(`Identifier`,`<COLONCOLON>`,`AssumeProve`),W(G(`<ASSUME>`,`<BOXASSUME>`),Y(`Expression, Declaration, or AssumeProve`),ay(),Y("PROVE or `,'"),K(`<COMMA>`,Y(`Expression, Declaration, or AssumeProve`),ay(),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=kv(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Dv(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(Wv),G(W(X({amount:3}),X({semantic:Sv(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),q(X({semantic:Jv}),`Proof`)]),Proof:Z(`Proof`,[J(e=>{e.proofLevels.push(-1)}),G(W(X({semantic:e=>Sv(`BY`)(e)||xv(e,2).kind===D(`BY`)}),`UseOrHideOrBy`),W(X({amount:2}),q(`<PROOF>`),G(`<OBVIOUS>`,`<OMITTED>`)),W(q(X({amount:2}),`<PROOF>`),K(X({semantic:e=>xv(e,2).kind!==D(`QED`)}),`Step`,Y(`a proof step`)),`QEDStep`)),J(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Z(`UseOrHideOrBy`,[G(W(q(`<PROOF>`),`<BY>`,cy(!0),q(`<ONLY>`)),W(`<USE>`,cy(!1),q(`<ONLY>`)),W(`<HIDE>`,cy(!1))),Y("an expression, `MODULE' or `DEF'"),q(iy(),K(`<COMMA>`,Y(`MODULE or expression`),iy(),J(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),q(`<DF>`,Y(`MODULE or expression`),iy(),K(`<COMMA>`,Y(`MODULE or expression`),iy(),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`),ty,Xv(`QED step's number has bad level.`),Y(`QED`),`<QED>`,q(X({semantic:Jv}),`Proof`)]),Step:Z(`Step`,[Y(`Step number`),ty,Xv(`step's number has bad level.`),Y(`proof step`),G(W(X({semantic:Sv(`USE`,`HIDE`)}),`UseOrHideOrBy`),W(X({semantic:Sv(`INSTANCE`)}),`Instantiation`),W(X({semantic:Sv(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),q(X({semantic:Jv}),J(e=>{let t=kv(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Dv(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Z(`DefStep`,[q(`<DEFINE>`),yv(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:Sv(`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(Qv,$v,ey),gv([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(D))],semantic:Cv}),G(`NonExpPrefixOp`,W(`InfixOp`,J(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Dv(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),W(X({expansion:[`<LAMBDA>`],semantic:Cv}),`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:Gv}),G(`IdentifierTuple`,`Identifier`),Y(`\\in`),`<IN>`,`Expression`,Y(`':', ',' or '}'`),q(G(W(`<COLON>`,`Expression`),yv(`<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=kv(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`)),yv(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Z(`Some [] Form`,[`<LSB>`,G(W(X({semantic:Gv}),`QuantBound`,K(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({semantic:e=>xv(e,2).kind===D(`MAPTO`)&&uv.has(xv(e,1).kind)}),J(e=>{xv(e,1).kind=iv}),`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=Ov(`FcnAppl`,t.heirs),e.lastOperator=mv})),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>`,yv(`ExceptComponent`,Y(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Z(`Except Component`,[G(W(`<DOT>`,J(Ev),`Identifier`,J(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),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===D(`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=>Tv(e)&&xv(e,2).kind!==D(`OTHER`)}),`<CASESEP>`,`CaseArm`),q(X({semantic:Tv}),`<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`,[yv(G(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Z(`AND-OR Junction`,[J(e=>{let t=xv(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),G(W(X({expansion:[`<OR>`]}),...oy()),W(X({expansion:[`<AND>`]}),...oy())),J(e=>{e.junctions.pop()})]),JuncItem:Z(`Junction Item`,[G(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Uv(t,e.heirs[1]);return n&&`Item at ${Dv(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Dv(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([])}),ny(),ry()],(e,t)=>{let n=Av(t);n.push({node:e.heirs[0],operator:hv});let r=Iv(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`),Rv,K(G(W(X({expansion:[`PostfixOp`],semantic:Cv}),`PostfixOp`,zv),W(X({expansion:[`<DOT>`],semantic:Cv}),`<DOT>`,J(Ev),X({semantic:Cv}),`Identifier`,J(e=>{let t=Av(e);t[t.length-1].operator!==void 0&&Pv(t,t.length),t[t.length-1]={node:Ov(`RecordComponent`,[t[t.length-1].node,kv(e,2),kv(e,1)]),operator:void 0}})),W(X({expansion:[`<LSB>`],semantic:Cv}),Y(`function argument`),`SBracketCases`,Lv(e=>e.kind===`FcnAppl`)))),q(G(W(X({expansion:[`InfixOp`],semantic:Cv}),`InfixOp`,zv,ny(),ry()),W(X({expansion:[`<COLONCOLON>`],semantic:Cv}),`<COLONCOLON>`,J(e=>{let t=Av(e);if(!Hv(t[t.length-1].node))return`\`::' at ${Dv(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,J(e=>{let t=Av(e),n=kv(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Mv(r,e.lastOperator)){let t=kv(e,3);return`Removing label at ${Dv(e,t.first,t.last)} would change expression parsing.`}t.push({node:Ov(`Label`,[kv(e,3),kv(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Z(`Primitive expression`,[G(W(X({expansion:[`String`],semantic:Cv}),`String`),W(X({expansion:[`<NUMBER_LITERAL>`],semantic:Cv}),`Number`),W(G(`Identifier`,W(G(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),J(e=>qv(e)<0&&e.proofLevels.length<=1?`${Dv(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Dv(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:Vv(e.heirs)===void 0?e.heirs.length===1?Ov(`GeneralId`,e.heirs):void 0:Ov(`OpApplication`,e.heirs)}),BangExt:Z(`Bang Extension`,[`<BANG>`,G(W(G(W(X({expansion:[`Identifier`],semantic:e=>xv(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=>xv(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Dv(t,n.first,n.last)}`:void 0}),OpenStart:Z(void 0,[G(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},dy=/* @__PURE__ */ new Map,fy=e=>{let t=dy.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=fy(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,fy(uy[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 dy.set(e,n),n},py=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},my=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=bv(e,e.scanPosition)),e.scanPosition=bv(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`},hy=(e,t)=>{if(t.type===`tokens`)return my(e,t.kinds);if(t.type===`call`)return hy(e,uy[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||py(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=hy(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||py(e,t.semantic)?hy(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=hy(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=hy(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},gy=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=hy(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},_y=(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||fy(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!fy(a).hasSemanticStart?fy(a).first.has(xv(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):gy(e,i,a)&&(o===void 0||o(e))}),vy=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,hy(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=bv(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===rv){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=bv(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${tt(e.token.image)}" `},yy=(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??vy(e)}\n\nResidual stack trace follows:\n${r}`,!1},by=(e,t)=>{let n=bv(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,yy(e))},xy=(e,t)=>{let n=uy[t];n.message!==void 0&&(e.messages.push({name:n.message,token:xv(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!Sy(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 yy(e,i);let a=r.node??(r.heirs.length===0?void 0:Ov(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},Sy=(e,t)=>{if(t.type===`tokens`)return by(e,t.kinds);if(t.type===`call`)return xy(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||yy(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||yy(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||Sy(e,t));if(t.type===`choice`){let n=_y(e,t.alternatives);return n===-1?yy(e):Sy(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!Sy(e,t.body))return!1;if(t.type===`optional`)return _y(e,[t.body])===-1||Sy(e,t.body);for(;_y(e,[t.body])===0;)if(!Sy(e,t.body))return!1;return!0},Cy=e=>{let t=$e(e),n={kind:rv,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=Sy(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
|
+
`)},wy={low:15,high:15},Ty={low:16,high:16},Q=(e,t,n)=>({low:e,high:t,isAssociative:n}),Ey=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)]]),Dy=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Oy=/* @__PURE__ */ new Set([...Dy,`'`]),ky=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Ay=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),jy=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),My=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),Ny=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...Oy]),Py=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),Fy=/* @__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`]),Ly=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Ry=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),zy=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),By=/* @__PURE__ */ new Set([``,`*`,`-`]),Vy={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},Hy=(e,t)=>e.line-t.line||e.column-t.column,Uy=(e,t)=>({start:Hy(e.start,t.start)<=0?e.start:t.start,stop:Hy(e.stop,t.stop)>=0?e.stop:t.stop}),Wy=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),Gy=(e,t,n=`Proof.Parser`)=>new r(e,void 0,{reason:e,line:t.start.line,column:t.start.column,isEnd:!1,proof:{stop:t.stop,exception:n}}),Ky=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),qy=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),Jy=/* @__PURE__ */ new Set([`NEW`,...qy.keys()]),Yy=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Xy=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Zy=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Qy=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Ey.has(e.operator):Dy.has(e.operator)),$y=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,eb=e=>Ey.has(e)||Dy.has(e)||e===`-.`,tb=(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}}},nb=(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`},rb=(e,t,n=Ae(e,t===`tlapm`))=>{let i=t===`tlapm`,a=i?n:n.map(Te),o={index:0,offsideColumns:[]},s={},c=[],l=/* @__PURE__ */ new Set,u=[],d=[],f=e=>c[c.length-1].has(e),p=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),m=[],ee=[],te=[],g=(e,t=o.index-1)=>{let n=e===t?te[e]:void 0;if(n)return n;let r=a[t];m[e]??=p(a[e]),ee[t]??={line:r.line,column:r.endColumn};let i={module:d[0].name,start:m[e],end:ee[t]};return e===t&&(te[e]=i),i},_=(e,t)=>(e.location.range=g(t),e),ne=(e=0)=>a[Math.min(o.index+e,a.length-1)],v=(e=0)=>{let t=ne(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},re=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),y={index:0},ie=e=>{let t=a.slice(y.index,o.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},b=e=>i&&(e.kind===`Keyword`||Zy.has(e.text)),oe=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},se=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:zy.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:b(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,ce=(e,t=ne(),n)=>{let i=a[a.length-1],o=t.line===i.line&&t.column===i.column;return new r(`${e} at line ${t.line}, column ${t.column}`,void 0,le(e,t,o,n))},le=(e,t,n,r)=>{if(i&&n){let e=a[a.length-1];return{reason:`Unexpected EOF`,...ie(oe(e)),isEnd:n}}return i&&r?{reason:`Unexpected ${se(r)}`,...oe(r),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},ue=(e,t=ne())=>ce(e,t,t),de=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!b(e),x=(e,t=0)=>{let n=v(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},S=()=>{let e=v();if(e.kind===`End`)throw ce(`Unexpected end of expression`);return o.index++,e},C=e=>x(e)?(o.index++,!0):!1,w=e=>{if(!x(e))throw ue(`Expected ${JSON.stringify(e)} but found ${re(v())}`);return S()},fe=()=>{let e=v();if(e.kind!==`Identifier`)throw ue(`Expected an identifier but found ${re(e)}`);if(b(e))throw ue(`Unexpected keyword ${e.text}`);return o.index++,e.text},pe=()=>{let e=o.index;return{name:fe(),range:g(e)}},he=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),ge=()=>{let e=v();return e.kind!==`String`&&(Ay.has(e.text)||Ey.has(e.text)||Oy.has(e.text))?(o.index++,e.text):fe()},_e={isUsed:!1},ve=()=>v().kind===`Identifier`||!de(v())?fe():(_e.isUsed=!0,S().text),ye=e=>{if(!i)return e();o.offsideColumns.push(-1);let t=e();return o.offsideColumns.pop(),t},T=(e,t=`,`)=>{let n=[e()];for(;C(t);)n.push(e());return n},be=()=>{if(x(`<<`)){let e={value:1};for(;v(e.value).kind===`Identifier`||x(`,`,e.value);)e.value++;return x(`>>`,e.value)&&x(`\\in`,e.value+1)}let e={value:0};for(;v(e.value).kind===`Identifier`;){if(x(`\\in`,e.value+1))return!0;if(!x(`,`,e.value+1))return!1;e.value+=2}return!1},xe=()=>{if(x(`::`))return!0;if(!x(`(`))return!1;let e={value:1};for(;v(e.value).kind===`Identifier`&&x(`,`,e.value+1);)e.value+=2;return v(e.value).kind===`Identifier`&&x(`)`,e.value+1)&&x(`::`,e.value+2)},Se=()=>{if(!C(`<<`)){let e=pe();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=he(x(`>>`)?[]:T(pe));return w(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Ce=()=>T(()=>{let e=T(Se);w(`\\in`);let t=O();return e.map(e=>({pattern:e,set:t}))}).flat(),E=()=>{let e=v();if(i&&Zy.has(e.text)){let t=o.index;S();let n={kind:`Identifier`,name:e.text,location:p(e)};return{subscript:_(n,t),lastArgs:[]}}let t=i&&(e.kind===`Number`||e.kind===`String`||x(`@`));if(e.kind===`Identifier`){let t=o.index,n=[],r=[],a=e=>(r.push(g(o.index,o.index)),n.push(fe()),e&&x(`(`)?ke():[]),s=[a(!i)];for(;x(`!`)&&v(1).kind===`Identifier`;)S(),s.push(a(!0));let c=s.slice(0,-1),l=p(e);l.range={...g(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(x(`<<`)||x(`(`)||x(`{`)||x(`[`)||t){let e=o.index,t=ze();return{subscript:t.location.range?t:_(t,e),lastArgs:[]}}throw ue(`Expected a subscript but found ${re(e)}`)},we=e=>{let t=v(1),n=v(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`&&x(`==`,Oy.has(n.text)?3:4))},Ee=e=>{let t=v(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||x(`,`,1)||x(`)`,1)||t.kind===`Keyword`&&Fy.has(t.text)||we(e)},De=()=>{let e=v(),t=e.kind===`Operator`&&(Ey.has(e.text)||ky.has(e.text))&&Ee(e);if(i&&e.kind!==`String`&&(ky.has(e.text)||Ny.has(e.text)&&e.text!==`'`&&!Dy.has(e.text)||My.has(e.text)&&v(-1).text===`(`&&v(-1).line===e.line&&v(-1).endColumn+1===e.column&&v(1).text===`)`&&v(1).line===e.line&&v(1).column===e.endColumn+1)&&Ee(e))throw ce(`incomplete expression`,e);if(t&&!i&&e.text===`\\X`&&e.spelling!==`×`)throw ce(`\\X may not be used as an infix operator`,e);if(t)return o.index++,_({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:p(e)},o.index-1);if(e.kind!==`String`&&Ny.has(e.text)&&Ee(e)){o.index++;let t=p(e);if(Dy.has(e.text))return _({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return _({kind:`Lambda`,params:[n.name],body:tb(e.text,n,t),operator:e.text,location:p(e)},o.index-1)}if(x(`LAMBDA`)){let t=o.index;S();let n=he(T(pe));w(`:`);let r=O();return _({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:p(e)},t)}return O()},Oe={range:void 0},ke=()=>ye(()=>{let e=o.index;w(`(`);let t=T(De);return w(`)`),Oe.range=g(e),t}),je=()=>{let e=S();o.offsideColumns.push(e.column);let t=[O()];for(;$y(ne())&&ne().text===e.text&&ne().column===e.column;)o.index++,t.push(O());return o.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:p(e)}},Me=e=>ye(()=>{let t=p(e),n=v().kind===`Identifier`,r=x(`|->`,1)&&(n||de(v()));if(r||n&&x(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o.index,n=p(v()),i=e();return n.range=g(t),w(r?`|->`:`:`),{name:i,value:O(),location:n}},a=[i(()=>n?fe():S().text),...C(`,`)?T(()=>i(fe)):[]];return w(`]`),{kind:e,fields:a,location:t}}if(be()){let e=o.index,n=Ce();if(!i||x(`|->`)){w(`|->`);let e=O();return w(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}o.index=e}let a=O();if(C(`->`)){let e=O();return w(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(C(`EXCEPT`)){let e=T(()=>{w(`!`);let e=[];for(;x(`.`)||x(`[`);)if(C(`.`)){if(!de(v()))throw ue(`Expected a field name but found ${re(v())}`);if(!i&&x(`@`))throw ue(`@ used in !.@`);e.push({kind:`Field`,name:S().text})}else w(`[`),e.push({kind:`Index`,args:T(()=>O())}),w(`]`);return w(`=`),{path:e,value:O()}});return w(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!x(`]_`)){let e=[a];for(;C(`,`);)e.push(O());return w(`]`),{kind:`Bracket`,args:e,location:t}}return w(`]_`),{kind:`BoxAction`,action:a,subscript:E().subscript,location:t}}),Ne=()=>{let e=o.index,t=_(Ve(),e),n=p(S());return _({kind:`Apply`,operator:`\\in`,args:[t,O()],location:n},e)},D=e=>ye(()=>{let t=p(e);if(C(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(be()&&(v(1).text===`\\in`||x(`<<`))){let e=o.index,n=Se();w(`\\in`);let r=O();if(C(`:`)){let e=O();return w(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o.index=e}let n=v().kind===`Identifier`&&x(`\\in`,1)?Ne():O();if(C(`:`)){let e=Ce();return w(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;C(`,`);)r.push(O());return w(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Pe=e=>{let t=p(e),n=ye(()=>x(`>>`)||x(`>>_`)?[]:T(()=>O()));if(C(`>>_`)){if(n.length!==1)throw ce(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:E().subscript,location:t}}return w(`>>`),{kind:`Tuple`,elements:n,location:t}},Fe=e=>{let t=p(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&be()){let e=Ce();return w(`:`),{kind:n,bounds:e,body:O(),location:t}}let i=he(T(pe));return w(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:O(),isTemporal:r,location:t}},Ie=e=>{let t=[];do{let n=o.index;if(C(`OTHER`))return w(`->`),{kind:`Case`,arms:t,other:O(),otherRange:g(n),location:p(e)};let r=O();w(`->`),t.push({condition:r,body:O()})}while(C(`[]`));return{kind:`Case`,arms:t,other:void 0,location:p(e)}},Le=()=>{let e=v(1);return x(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Py.has(e.text)||e.kind===`Operator`&&(Ey.has(e.text)||Oy.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&Ay.has(e.text))},Re=()=>{let e=S();if(e.kind===`Number`)return{kind:`Operand`,operand:me(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:ke()}}return{kind:`Name`,name:e.text,args:x(`(`)?ke():[]}},ze=e=>{let n=o.index,r=S(),a=p(r);if(i&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=T(fe);return w(`:`),{kind:`Lambda`,params:e,body:O(),location:a}}if(r.kind===`Number`){if(i&&/^\\[BOH]/.test(r.text))throw ce(`incomplete expression`,r);return{kind:`Number`,value:me(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 l=r.kind===`Step`&&it(r);if(!i&&l&&tt()<0&&et.length<=1)throw ce(`Step number used outside proof`,r);if(l&&r.text[1]===`+`)throw ce(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||l){let t=l?at(r)??r.text:r.text;if(xe()){let o=he(C(`(`)?T(pe):[]);o.names.length>0&&w(`)`),w(`::`);let c=g(n),l=O();if(!i&&e!==void 0&&s.last!==void 0&&Qy(l)&&e.high>=s.last.low)throw ce(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:t,params:o.names,paramRanges:o.ranges,head:c,body:l,location:a}}let c=x(`(`);if(t===`@`&&!c&&!Le())return{kind:`ExceptAt`,location:a};let u=c?ke():[],d=[c?Oe.range:void 0];if(!Le())return c?{kind:`Apply`,operator:t,args:u,argumentsRange:Oe.range,location:a}:{kind:`Identifier`,name:t,location:a};let f=[{kind:`Name`,name:t,args:u}],p=[g(n,n)];for(;Le();)S(),p.push(g(o.index,o.index)),Oe.range=void 0,f.push(Re()),d.push(Oe.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),ee=f.flatMap(e=>`args`in e?e.args:[]),te=f.map(e=>`args`in e?e.args.length:0),_=d.at(-1)??g(n);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:a}:ee.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:a}:{kind:`Apply`,operator:h,args:ee,...te.slice(0,-1).some(e=>e>0)&&{argumentCounts:te},argumentsRange:_,selectorRanges:p,argumentRanges:d,location:a}}if(r.kind===`Operator`&&eb(r.text)&&x(`(`)){let e=ke();return t===`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`&&eb(r.text)&&!i)return{kind:`Identifier`,name:r.text,spelling:r.spelling,location:a};switch(r.text){case`(`:{let e=ye(()=>O());return w(`)`),e}case`[`:return Me(r);case`{`:return D(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=O();w(`THEN`);let t=O();return w(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:O(),location:a}}case`CASE`:return Ie(r);case`LET`:{let e=[],t=[];for(c.push(/* @__PURE__ */ new Set);!C(`IN`);){if(i&&x(`RECURSIVE`))throw ce(`Unexpected keyword RECURSIVE`,ie(ne()));if(C(`RECURSIVE`)){Ze();continue}let n=We(!i&&C(`LOCAL`));n.kind===`Instance`?t.push(n):e.push(n)}c.pop();let n=O();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=C(`\\in`)?O():void 0;return w(`:`),{kind:`Choose`,pattern:e,set:t,body:O(),location:a}}case`WF_`:case`SF_`:{let e=E(),t=!x(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:ye(()=>{w(`(`);let e=O();return w(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:a}}}throw ue(`Unexpected ${re(r)}`,r)},Be=(e,t,n)=>{s.last=s.preceding={low:t,high:n};let r=O(i?Math.min(n+1,wy.low):n+1),a=v(),o=Oy.has(a.text)?wy.high:Ey.get(a.text)?.high;if(!i&&a.kind===`Operator`&&o!==void 0&&o>=t)throw ce(`Precedence conflict between ${e.text} and ${a.text}`,a);return r},Ve=()=>{let e=s.preceding;s.preceding=void 0;let t=v(),n=p(t);if(t.kind===`Operator`&&$y(t))return je();if(i&&Ey.has(t.text)&&x(`(`,1)){let e=o.index,r=ye(()=>{S(),S();let r=O();if(!C(`,`))return;let i=O();w(`)`);let a={kind:`Apply`,operator:t.text,args:[r,i],location:n};return _(a,e)});if(r!==void 0)return r;o.index=e}if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return S(),{kind:`Apply`,operator:`~`,args:[Be(t,4,4)],location:n};case`-`:case`-.`:if(t.text===`-.`&&!i)break;return S(),{kind:`Apply`,operator:`-.`,args:[Be(t,12,12)],location:n};case`[]`:return S(),{kind:`Always`,expression:Be(t,4,15),location:n};case`<>`:return S(),{kind:`Eventually`,expression:Be(t,4,15),location:n};case`ENABLED`:return S(),{kind:`Enabled`,expression:Be(t,4,15),location:n};case`UNCHANGED`:return S(),{kind:`Unchanged`,expression:Be(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return S(),{kind:`Apply`,operator:t.text,args:[i?O(9):Be(t,10,13)],location:n}}return ze(e)},O=(e=0)=>{let t=o.index,n=Ve(),r={left:n.location.range?n:_(n,t),previous:void 0};for(;;){let n=v();if(n.kind!==`Operator`)break;let a=p(n);if(n.text===`'`&&e<=15){S(),s.last=wy,r.left=_({kind:`Prime`,expression:r.left,location:a},t);continue}if(Dy.has(n.text)&&e<=15){S(),s.last=wy,r.left=_({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:a},t);continue}if(n.text===`[`){S();let e=ye(()=>T(()=>O()));ye(()=>w(`]`)),s.last=Ty,r.left=_({kind:`FunctionApplication`,function:r.left,args:e,location:a},t);continue}if(n.text===`.`&&de(v(1))){S();let e=S().text;r.left=_({kind:`FieldAccess`,record:r.left,field:e,location:a},t);continue}let o=Ey.get(n.text);if(!o||o.low<e)break;let c=r.previous;if(c){let e=!(c.low>o.high||c.high<o.low),t=c.text===n.text&&o.isAssociative;if(e&&!t&&(c.text!==`\\X`||n.text!==`\\X`))throw ce(`Precedence conflict between ${c.text} and ${n.text}`,n)}if(S(),!i&&o.low>12&&x(`-`))throw ce(`Precedence conflict between ${n.text} and -`,v());s.last=s.preceding=o;let l=O(o.high+1),u=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,i=[g(t).end];r.left=u.kind===e&&c?.text===n.text?{...u,operands:[...u.operands,l],prefixEnds:[...u.prefixEnds??[],...i]}:{kind:e,operands:[u,l],prefixEnds:i,location:a}}else r.left=n.text===`\\X`?u.kind===`Product`&&c?.text===`\\X`?{...u,factors:[...u.factors,l]}:{kind:`Product`,factors:[u,l],location:a}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[u,l],location:a};r.left=_(r.left,t),r.previous={...o,text:n.text}}return r.left},He=()=>{if(!C(`(`))return[];let e=Xe();return w(`)`),e},Ue=()=>{let e=p(v()),t=O(),n=a[o.index-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:d[0].name,start:e,end:r}}},We=e=>{let t=o.index;return _(Ke(e),t)},Ge=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),Ke=e=>{let t=v(),n=o.index,r=p(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:g(n,o.index-2),...Ue(),isLocal:e,isRecursive:f(t),location:r});if(t.kind===`Identifier`&&v(1).kind===`Operator`&&Ey.has(v(1).text)&&v(2).kind===`Identifier`&&x(`==`,3)){let e=pe(),t=S().text,n=pe();return w(`==`),i(t,[Ge(e),Ge(n)])}let a=t.kind!==`String`&&Ay.has(t.text),s=t.kind===`Identifier`&&Oy.has(v(1).text)&&x(`==`,2);if(a||s){let e=a?t.text:v(1).text;a&&S();let n=pe();return s&&S(),w(`==`),i(e,[Ge(n)])}let c=fe();if(C(`[`)){let t=ye(()=>Ce());return w(`]`),w(`==`),{kind:`Function`,name:c,bounds:t,body:O(),isLocal:e,isRecursive:f(c),location:r}}let l=o.index,u=He();return w(`==`),x(`INSTANCE`)?{...qe(c,u,e,r),definitionRange:g(l)}:i(c,u)},qe=(e,t,n,r)=>{let i=o.index;return w(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ve(),substitutions:C(`WITH`)?T(()=>{let e=o.index,t=ge(),n=g(e);return w(`<-`),{name:t,nameRange:n,expression:De()}}):[],isLocal:n,location:r,instanceRange:g(i)}},Je=()=>{let e=o.index;return _(Ye(),e)},Ye=()=>{let e=p(v());if(x(`_`)&&v(1).kind===`Operator`)return S(),{name:S().text,arity:C(`_`)?2:1,location:e};if(v().kind!==`String`&&(Ay.has(v().text)||i&&v().kind===`Operator`)&&x(`_`,1)){let t=S().text;return S(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=fe();if(!C(`(`))return{name:t,arity:0,location:e};let n=T(()=>w(`_`));return w(`)`),{name:t,arity:n.length,location:e}},Xe=()=>T(Je),Ze=()=>{let e=Xe();return e.forEach(e=>c[c.length-1].add(e.name)),e},Qe=e=>{let t={value:0,offset:e};do{let e=v(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&Yy.has(e.text)&&t.value++,e.kind===`Operator`&&Xy.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},$e=()=>{let e=v(),t=v(1);return e.kind===`Identifier`?x(`(`,1)||x(`[`,1)?x(`==`,Qe(1)):t.kind===`Operator`&&Oy.has(t.text)?x(`==`,2):t.kind===`Operator`&&Ey.has(t.text)?v(2).kind===`Identifier`&&x(`==`,3):x(`==`,1):e.kind!==`String`&&Ay.has(e.text)&&t.kind===`Identifier`&&x(`==`,2)},et=[],tt=()=>et[et.length-1]??-1,nt=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),rt=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)},it=e=>!e.text.endsWith(`.`)&&!By.has(rt(e)),at=e=>{let t=rt(e);if(By.has(t))return;let n=nt(e);if(n>=0)return`<${n}>${t}`;let r=tt(),i=et[et.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},ot=e=>{if(e.kind===`Keyword`)return Ly.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return et.length===0;if(e.text[1]===`+`||et.length===0)return!0;let t=tt();return t>=0&&nt(e)>t},st=e=>{let t=nt(e),n=et.length-1,r=et[n-1]??-1,i=et[n]<0;return i&&(et[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:et[n]===t},ct=e=>!l.has(e)&&d.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),lt=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Zy.has(e.name)&&!ct(e.name):!1,ut=()=>{let e=v();return e.kind===`Step`?it(e):e.kind===`Keyword`?Ky.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!$e()},dt=()=>{let e=o.index,t=v();return t.kind===`Operator`&&!jy.has(t.text)&&eb(t.text)?(o.index++,_({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:p(t)},e)):C(`MODULE`)?_({kind:`ModuleFact`,name:fe(),location:p(t)},e):O()},ft=e=>u[u.length-1]?.add(e),pt=e=>{u.push(/* @__PURE__ */ new Set);let t=e();return u.pop(),t},mt=e=>u.some(t=>t.has(e))||d.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),ht=()=>{let e=o.index,t=v(),n=T(()=>{let e=v();if((e.kind!==`Identifier`||b(e))&&e.kind!==`Operator`)throw ue(`Expected a definition name but found ${re(e)}`,e);return o.index++,e.text},`!`),r=p(t);return _(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},gt=()=>{if(i)return T(ht);let e=T(dt),n=t===`tlc`?e.find(e=>e.kind===`Identifier`&&mt(e.name)):void 0;if(n)throw ce(`DEF clause entry should describe a defined operator`,n.location);return e},k=()=>{let e=ut()?T(dt):[],t=C(`DEF`)||C(`DEFS`);if(i&&e.length===0&&!t)throw ue(`Expected a fact`);return{facts:e,defs:t?gt():[]}},_t=()=>{let e=o.index,n=S(),r=n.text===`USE`&&C(`ONLY`),i=g(e),a={kind:n.text===`USE`?`Use`:`Hide`,isOnly:r,...k(),keyword:i,location:p(n)},s=a.kind===`Hide`&&t===`tlc`?a.facts.filter(e=>!lt(e)):[];if(s.length>0)throw ae(s.map(t=>({location:h(t.location.range??g(e)),message:`The only expression allowed as a fact in a HIDE is
|
|
1785
|
+
the name of a theorem, assumption, or step.`})));return _(a,e)},vt=()=>{let e=o.index,t=p(v()),n=C(`NEW`),r=i?o.index:e,a=i?p(v()):t,s=v().kind===`Keyword`?qy.get(v().text):void 0;if(!n&&s===void 0)throw ue(`Expected a declaration but found ${re(v())}`);if(s!==void 0&&S(),s===`Variable`){let e=pe();return ft(e.name),_({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:a},r)}let c=Je();ft(c.name);let l=(s??`Constant`)===`Constant`&&x(`\\in`);if(l&&c.arity>0)throw ce(`declared symbol with arguments before \\in`);return l&&S(),_({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?O():void 0,nameRange:c.location.range,location:a},r)},yt=()=>{let e=o.index,t=p(w(`ASSUME`)),n=T(()=>(v().kind===`Identifier`&&x(`::`,1)&&x(`ASSUME`,2)&&(S(),S()),x(`ASSUME`)?pt(yt):v().kind===`Keyword`&&Jy.has(v().text)?vt():O()));return w(`PROVE`),_({kind:`AssumeProve`,assumptions:n,conclusion:O(),location:t},e)},bt=e=>{let t={value:0};for(;v(t.value).kind===`Identifier`&&x(`,`,t.value+1);)t.value+=2;return v(t.value).kind===`Identifier`&&x(e,t.value+1)},xt=(e,t)=>{e.forEach(ft),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(ft))},A=()=>{let e=v();if(x(`USE`)||x(`HIDE`))return _t();if(x(`INSTANCE`)){let t=o.index;return _(qe(void 0,[],!1,p(e)),t)}if(x(`DEFINE`)||$e()){let t=o.index;C(`DEFINE`);let n=[We(!1)];for(;$e();)n.push(We(!1));let r={kind:`Define`,definitions:n,location:p(e)};return _(r,t)}if(C(`HAVE`))return{kind:`Have`,expression:O()};if(C(`TAKE`)){let e=be(),t=he(e?[]:T(pe)),n=e?Ce():[];return xt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(C(`WITNESS`))return{kind:`Witness`,expressions:T(()=>O())};if(C(`PICK`)){let e=bt(`:`),t=he(e?T(pe):[]),n=e?[]:Ce();return xt(t.names,n),w(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:O()}}return C(`CASE`)?{kind:`Case`,expression:O()}:{kind:`Assert`,isSuffices:C(`SUFFICES`),statement:x(`ASSUME`)?yt():O()}},St=e=>{let n=v();if(n.kind!==`Step`)throw ue(`Expected a step number but found ${re(n)}`,n);if(!st(n))throw ce(`${e?`QED step`:`step`}'s number has bad level`,n);if(t!==`sany`&&nt(n)<0&&at(n)!==void 0)throw ce(`<*> and <+> cannot be used for a named step`,n);return o.index++,{name:at(n),token:n.text,location:p(n)}},Ct=()=>{let e=o.index,t=St(x(`QED`,1)),n=o.index,r=/* @__PURE__ */ new Set;u.push(r);let i=C(`QED`)?{kind:`Qed`}:A(),a=g(e),s=g(n),c=ot(v());if(c&&!Ry.has(i.kind))throw ce(`Proof of a step that does not take a proof`);let l=c?Et():void 0;return u.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(ft),_({...t,body:i,head:a,statement:s,proof:l},e)},wt=e=>{if(C(`BY`)){let t=g(o.index-1);return{kind:`By`,isOnly:C(`ONLY`),...k(),keyword:t,location:e}}let t=v();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;S();let n=g(o.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Tt=()=>{let e=p(v());C(`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:tt(),steps:n,location:e}},Et=()=>{let e=o.index;et.push(-1);let t=pt(Tt);return et.pop(),_(t,e)},Dt=()=>v().kind===`Step`||v().kind===`Keyword`&&Ly.has(v().text),Ot=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return Wy(e);let n=t.defs[t.defs.length-1]?.location.range;return Uy(Wy({...e,end:e.start}),Wy(n??t.keyword))},kt=()=>{let e=o.index,t=p(v()),n=C(`PROOF`),r=wt(t);if(r){let t=_(r,e);return{kind:`Leaf`,proof:t,span:Wy(t.keyword),first:e,end:o.index-1}}let i=v();if(i.kind!==`Step`)throw ue(`Expected a step number but found ${re(i)}`);let a=o.index;S();let s=o.index,c=C(`QED`)?{kind:`Qed`}:A(),l=g(a);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:g(s),span:Ot(l,c),first:e,start:a,end:o.index-1}},At=(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=jt(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={...p(a[i.first]),range:g(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}},jt=(e,t,n,r,i)=>{let a=e[t];if(!a)throw Gy(`Unexpected end of (sub)proof at level ${n} before QED step`,r);if(a.kind===`Leaf`)throw Gy(`Expecting a proof step but found a${Vy[a.proof.kind]} leaf proof`,a.span);if(!i&&a.isProof)throw Gy(`PROOF keyword found in step that does not begin subproof`,a.span);let o=a.token.text[1];if(o===`+`&&!i)throw Gy(`<+> used but no subproof expected`,a.span);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:nt(a.token);if(s<n||!i&&s>n)return;let c=Ry.has(a.body.kind)?At(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:at(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{...p(a.token),range:g(a.start,l)}},d=Uy(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=jt(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:Uy(d,f.span)}},Mt=()=>{if(!Dt())return;let e=[];for(;Dt();)e.push(kt());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=At(e,0,0,t.span),r=e[n.next];if(r)throw Gy(`extra step(s) after finished proof`,r.span,`Proof.Parser.toplevel`);return n.proof},Nt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},Pt=e=>{let t=o.index,n=S(),r=v().kind===`Identifier`&&x(`==`,1)?fe():void 0;r!==void 0&&(l.add(r),S());let a=pt(()=>{let e=x(`ASSUME`)?yt():O();return i?{statement:e,proof:Mt()}:{statement:e,proof:ot(v())?Et():void 0}}),s=a.statement,c=_({name:r,statement:s,proof:a.proof,location:p(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&s.kind!==`AssumeProve`&&Nt(e,_({kind:`Operator`,name:r,params:[],body:s,isLocal:!1,isRecursive:!1,location:p(n)},t))},Ft=()=>{let e=o.index,t=S(),n=v().kind===`Identifier`&&x(`==`,1)?fe():void 0;return n!==void 0&&(l.add(n),S()),_({name:n,expression:O(),isAxiom:t.text===`AXIOM`,location:p(t)},e)},It=()=>{let e=p(w(`----`));w(`MODULE`);let t=ve();w(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(d.push(n),c.push(/* @__PURE__ */ new Set),C(`EXTENDS`)&&T(()=>{let e=o.index;n.extends.push(ve()),n.extendsRanges.push(g(e))});;){let t=o.index;y.index=t;let r=v();if(r.kind===`ModuleEnd`)return e.range={module:d[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},d.pop(),c.pop(),n;if(r.kind===`Separator`){if(x(`MODULE`,1)){let e=It();n.modules.push(e),n.units.push({kind:`Module`,module:e}),w(`====`);continue}S()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=p(S()),r=Xe();n.constants.push(...r),e.range=g(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=p(S()),r=T(()=>{let e=o.index,t=p(v());return _({name:fe(),arity:0,location:t},e)});n.variables.push(...r),e.range=g(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Ft();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&Nt(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(x(`USE`)&&x(`ONLY`,1))throw ue(`Expected a module unit but found ${re(r)}`);let e=_t();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=p(S()),r=Ze();e.range=g(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:Lt(n,_(qe(void 0,[],!1,p(r)),t));continue;case`LOCAL`:if(S(),x(`INSTANCE`)){Lt(n,_(qe(void 0,[],!0,p(r)),t));continue}Lt(n,_(Ke(!0),t));continue}r.kind===`Keyword`&&Iy.has(r.text)?Pt(n):Lt(n,We(!1))}}},Lt=(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}))},Rt=It(),zt=_e.isUsed?Cy(e):void 0;if(zt!==void 0)throw new r(zt);return Rt},ib=e=>rb(e,`tlc`),ab=(e,t)=>rb(e,`tlc`,t),ob=e=>rb(e,`tlapm`),sb=e=>rb(e,`sany`),cb=`$subexpression`,lb=(e,t)=>new r(`${e} at line ${t.line}, column ${t.column}`),ub=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return ub(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of gt(e)){let e=ub(r,t,n);if(e)return e}},db=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),fb=(e,t)=>{let n=e.location,r=db(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 lb(`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 lb(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:cb,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:cb,args:e.args,location:n,resolution:Ys},location:n}},pb=(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:Ys})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Ys}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Ys};return fb({...t,params:[...t.params,...r]},a)},mb=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o={index:0,current:void 0,isFailed:!1},s=(t,r)=>{if(!t)throw lb(r,i);Zs.set(n,{args:e.slice(0,o.index).flatMap(e=>`args`in e?e.args:[]),error:{location:h(t),message:r}}),o.isFailed=!0},c=n=>{let r=[],a=[];for(;o.index<e.length;){let s=e[o.index];if(s.kind!==`Name`)throw lb(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>yl(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o.index++}throw lb(`Unknown operator ${r.join(`!`)}`,i)},l=t=>{let l=c(t),u=l.definition,d=nc(u),f=o.index===e.length-1;if(l.args.length!==d&&(!r||l.args.length!==0))return s(n.argumentRanges?.[o.index]??i.range,`The operator ${l.name} requires ${d-l.earlier} arguments.`);if(f)return{definition:u,args:l.args};if(u.kind!==`Operator`)throw lb(`Cannot select a subexpression of ${u.name}`,i);a.params.push(...u.params),a.args.push(...l.args),o.current=u.body,o.index++},u=()=>{for(;o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o.index],c=o.current&&ub(o.current,t.name,[]);if(!c)return s(i,`Cannot find label \`${t.name}'.`);let l=c.label.params;if(!r&&t.args.length!==l.length)return s(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...l.map(e=>({name:e,arity:0}))),a.args.push(...t.args),o.current=c.label.body,o.index++}},d=t=>{let n=o.current;if(!n)throw lb(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(n.kind===`Label`){o.current=n.body,d(t);return}if(n.kind===`Let`){if(t.kind!==`Operand`||Cc(t.operand,1)!==0)throw lb(`A LET/IN expression has only one operand`,i);a.lets.push(n.definitions),o.current=n.body;return}let r=Dc(n);if(r&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...r.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),o.current=r.body;return}if(n.kind===`Case`&&t.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],a=r[Cc(t.operand,r.length)],s=e[o.index+1];if(!a||s?.kind!==`Operand`)throw lb(`A subexpression of CASE must have the form !i!j`,i);o.index++;let c=Cc(s.operand,2),l=c===0?a.condition:c===1?a.body:void 0;if(!l)throw lb(`Nonexistent CASE operand`,i);o.current=l;return}if(t.kind!==`Operand`)throw lb(`Unexpected subexpression selector`,i);let s=r?r.sets:Oc(n),c=s?.[Cc(t.operand,s.length)];if(!c)throw lb(`Nonexistent operand specified by the selector`,i);o.current=c},f=l(void 0);if(o.isFailed)return n;if(f)return pb(f.definition,{...a,args:f.args});for(u();o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind===`Name`){for(;o.current?.kind===`Label`;)o.current=o.current.body;if(o.current?.kind!==`Let`)throw lb(`A name selector here must be from a LET clause`,i);a.lets.push(o.current.definitions);let e=l(o.current.definitions);if(o.isFailed)return n;if(e)return pb(e.definition,{...a,args:[...a.args,...e.args]});u()}else d(t),o.index++}if(o.isFailed)return n;if(!o.current)throw lb(`Subexpression selection failed`,i);return fb(a,o.current)},hb=(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 wc(e,t,n)},gb=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||gt(e).some(gb),_b=(e,t,n,r=!1)=>{if(!gb(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Sl(e,e=>_b(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>vb(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)=>_b(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Sl(e,e=>_b(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?hb(a.name,[],void 0,t):a.kind===`Apply`?hb(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=mb(o,t,a,r);return c!==a&&Xs.add(c),c},vb=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:_b(e.expression,t,n,!0)}))}),yb=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},bb=(e,t)=>vb(e,yb(t.definitions),()=>!1),xb=(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=yb([...t,...e.definitions]),a=e=>n.has(e),o=yb([...t,...e.definitions,...r]),s=e=>_b(e,o,e=>a(e)&&r.every(t=>t.name!==e)),c=e=>a(e)||!i(e),l=e=>_b(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 vb(e,i,c);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?vb(e,i,c):xl(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=>gb(e.body))||e.assumptions.some(e=>gb(e.expression))?{...h,definitions:e.definitions.map(e=>xl(e,s)),assumptions:e.assumptions.map(e=>({...e,expression:s(e.expression)}))}:h},Sb=(e,t)=>e.maxLevels[t]??3,Cb=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=Ou({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,i=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),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=>au(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>au(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>ou(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=nu(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)&&au(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(ku(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,a=h(t.location.range??{module:t.instancer,start:t.location,end:t.location}),o=e=>r.set(`${a}\n${e}`,{location:a,message:e}),s=e(t.module),c=i(t.module),l=n(t.instancer),u=/* @__PURE__ */ new Map;t.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=l.analyze(n,u);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),f=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(d.forEach(e=>{!c.isConstant&&e.level>e.maximumLevel&&o(f(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),d.forEach(e=>{let n=c.constraints.get(e.name);n!==void 0&&e.level>n&&o(f(e.name,n));let r=e.operator;r&&Array.from({length:e.arity},(n,i)=>{let a=c.argConstraints.get(eu(e.name,i));a!==void 0&&Sb(r,i)<a&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),c.argParams.forEach(e=>{let n=nu(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=Sb(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw ae([...r.values()])}},wb=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],Tb=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Eb=new Map(Xf.flatMap(e=>e.map(t=>[t,e[0]]))),Db=e=>Eb.get(e)??e,Ob=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},kb=()=>{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}}},Ab=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:Ob(e)&2147483647,kind:t,isLocal:n}),jb=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:Db(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:Db(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}},Mb=(e,t)=>{let n=[];for(let r=t;;){let t=jb(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},Nb=e=>({line:e.line,column:e.column}),Pb=(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=Mb(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},Fb=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,Ib={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},Lb=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&Fb(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&Fb(e[n+1],e[n+2])?n+=Fb(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},Rb=e=>e[2]?.text,zb=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},Bb=(e,t)=>e.find(e=>e.name===t)??e.map(e=>Bb(e.modules,t)).find(Boolean),Vb=e=>{let t=e===void 0?[]:Ae(e),n={module:void 0};return{tokens:t,ranges:zb(t),getModule:()=>n.module??=e===void 0?ib(``):ab(e,t)}},Hb=(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=Vb(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)??ep.get(i)??rp.get(i)??nb(e,i),{tokens:c,ranges:l,getModule:u}=a(s),d=l.get(Rb(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:()=>Bb(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()}},Ub=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=Mb(t,e+1);i.push({location:Nb(t[e]),apply:e=>r.forEach(t=>e.put(Ab(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={value:0};t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r,d=t[u];if(d.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l.value++,l.value===2){let e=t[u+2].text;i.push({location:Nb(d),apply:t=>t.put(Ab(e,`module`,!1))})}return}if(d.kind===`ModuleEnd`&&l.value--,l.value!==1||d.kind!==`Keyword`)return;let f=c.has(`${d.line}:${d.column}`);f&&(d.text===`CONSTANT`||d.text===`CONSTANTS`)&&o(u,`constant`),f&&(d.text===`VARIABLE`||d.text===`VARIABLES`)&&o(u,`variable`),d.text===`RECURSIVE`&&Mb(t,u+1).every(e=>s.has(e))&&o(u,`definition`),Tb.has(d.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(Nb(d)),i.push({location:Nb(d),apply:e=>e.put(Ab(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(Ab(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=Db(e.name);i.push({location:e.location,apply:n=>n.put(Ab(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(Ab(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(Ab(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>tc(e.location,t.location)?-1:+!!tc(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=kb();n.set(i??``,o),Yf.toReversed().forEach(e=>o.put(Ab(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)}}},Wb=(e,t)=>{let n=/* @__PURE__ */ new Set,r=e=>{n.add(e)},i=e=>{e.kind===`ModelValue`&&r(e.name),e.kind===`String`&&r(e.value),e.kind===`Set`&&e.elements.forEach(i)};t.constants.forEach(e=>{e.args?.forEach(i),i(e.value)}),Zf.forEach(r);let a=t=>{let n=e(t);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=Pb(a(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),ee=m(e=>e.instances),te=/* @__PURE__ */ new Set([void 0]),g=/* @__PURE__ */ new Map;Lb(a(void 0)).forEach((e,t)=>{t===3&&$f.forEach(r),r(e)});let _=l(void 0);for(;;){let t=h(_,/* @__PURE__ */ new Set)??ee(_,/* @__PURE__ */ new Set);if(!t)break;let[n,i]=t;if(d.add(`${n.key}>${i}`),g.set(n.unit,[...g.get(n.unit)??[],i]),!te.has(i)){if(te.add(i),e(i).tokens.length===0){let t=n.unit??Rb(e(void 0).tokens);throw o(i,t)}Lb(a(i)).forEach(r)}}wb.forEach(r);let ne=/* @__PURE__ */ new Set,v=e=>{if(ne.has(e))return;ne.add(e);let t=g.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(v),a(e).forEach(e=>{e.kind===`String`&&r(e.text)})};return v(void 0),Qf.forEach(r),[...n]},Gb=(e,t)=>{let n=Hb(e,t),r=n.getParsed,i,a=()=>i??=Ub(r);return{getStringOrder:e=>Wb(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)}}},Kb=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),qb=e=>{switch(e.kind){case`Number`:if(!pn(e.value))throw y(new c(`TLC can't handle a number this big.\n${e.value}`),b.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return Zn(e.name);case`Set`:return N({kind:`MixedSet`,elements:e.elements.map(qb)})}},Jb=e=>{try{return qb(e)}catch(e){throw!(e instanceof _)||e instanceof c||e instanceof ce?e:y(new _(`${i}${e.message}`),b.error)}},Yb=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],Xb=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof r))throw n;let i=Cy(e);throw i===void 0?n:ae([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,i)}},Zb=e=>new r(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),Qb=(e,t)=>e.location.range&&t.location.range&&{location:h(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${h(t.location.range)}.`},$b=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,ex=e=>e===`Theorem`?`ThmOrAssumpDefNode`:$b(e),tx=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:zl(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),nx=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>I(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new _(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&fr(t,r)})});if(t)return t[1];throw new _(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:I(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},rx=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||gt(e).some(e=>rx(e,t)),ix=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Pl(e),n.get(e)??n.size)),n},ax=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),ox=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Gh(e);if(e.kind===`Number`&&!pn(e.value))throw Kh(e);ox(e.kind===`Let`?[...gt(e),...ax(e.instances??[])]:gt(e))}),sx=(e,t)=>{let n=t.order??Gb(t.source,t.loadModule),i=n.parseModule(t.source),a=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Set,d=new Map(mp.map(e=>[e.name,e])),f=/* @__PURE__ */ new Map,p=Sf(e.checkDeadlock,t.seed);p.isWarningEnabled=t.isWarningEnabled??!0,p.isTool=t.isTool??!1,p.version=t.version??`master`;let m=/* @__PURE__ */ new Map,ee=/* @__PURE__ */ new Map,ne=[],v=/* @__PURE__ */ new Map,re=[],y=[],ie=(e,t)=>re.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),b=0,oe=e=>`${e}#${b++}`,se=[],ce=[],le=Cb(e=>{let t=ee.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)}}),ue=/* @__PURE__ */ new Map,de=/* @__PURE__ */ new Map,x=/* @__PURE__ */ new Map,S=e=>{let n=f.get(e);if(n)return n;let r=Fp(e,t.print,p,t.files,d);if(!r)return;Pp.get(e)?.forEach(S);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>S(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{d.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Zl.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:$l(e,t.name)??i.get(t.name)?.range})}),f.set(e,i),i},C=e=>{let n=Pp.get(e)??[];if(e===`TLCExt`||[e,...n].some(e=>t.loadModule?.(e)!==void 0))return;let r=S(e);return r&&ie(e,n),r&&n.includes(`Integers`)&&S(`Integers`),r},w=e=>(ox([...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]),...ax(e.instances)]),e.modules.forEach(w),e);w(i);let fe=(e,r)=>{let i=t.loadModule?.(e)??ap(p.version).get(e)??nb(t.source,e);if(i===void 0)throw o(e,r);let a=Xb(i,e,n);if(a.name!==e)throw ae([{location:`Unknown location`,message:`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return w(a)},pe=e=>{let t=y.indexOf(e.name);if(t!==-1){let n=[...y.slice(t),e.name].map(e=>`${e}.tla`);throw new r(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,i=[],a=[],o=[];y.push(e.name),re.push(n);let s=Ce(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:ce,levelChecks:o});if(re.pop(),y.pop(),a.length>0)throw ae(a,!1,void 0,ce);let c=i.find(e=>n.has(e.name)),l=c&&m.get(c.name),u=l&&Qb(c,l.module);if(u)throw ae([u],!1,void 0,ce);if(c)throw Zb(c);return o.forEach(e=>e()),{linked:s,closure:n}},me=(e,n)=>{let r=m.get(e);if(r)return ie(e,v.get(e)??[]),r;let i=pe(fe(e,n)),o=/* @__PURE__ */ new Map;return Np(e,t.print,p,t.files,d,(e,t,n)=>{let r=o.get(e),i=t.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(r?.kind!==`Operator`||!n||i.length!==t.length)throw new _(`No definition of ${e} to fall back to`);let a={kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:void 0};return U(r.body,{environment:n.environment,scope:Qg(a,i,n),state:n.state,next:n.next,isKeepLazy:n.isKeepLazy})})?.forEach(t=>{let n=i.linked.visible.get(t.name);if(n?.kind!==`Definition`||n.arity!==t.arity&&Kb.has(e))return;let r=a.get(n.key);r&&o.set(t.name,r),d.set(n.key,t),a.delete(n.key)}),m.set(e,i.linked),v.set(e,i.closure),ie(e,i.closure),i.linked},he=(e,t,n,r,i)=>{let o=i?void 0:C(e.module);if(o)return ge(e,o);let d=i??me(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=Yb(d),p=`#${b++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=ul(bb(e,t),f,t,n);se.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let ee=e.params.map(e=>({...e,name:`${e.name}${p}`}));ee.forEach(e=>u.add(e));let te=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,g=Kl({params:ee,substitutions:new Map([...h].map(([e,t])=>[e,gl(t,m)])),variables:new Set(d.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>s.get(e)===!0,addDefinition:(n,i,o)=>{let u=oe(`${i}@${t.name}`),d=o(u);return a.set(u,d),f.length>0&&l.add(d),e.name!==void 0&&de.set(u,`${e.name}!${de.get(n)??i}`),s.set(u,!r),c.set(u,{source:n,prefix:e.params.length}),u},createName:oe,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{...te.start,range:te}}}});return _e(e,d.exported,f,(t,n)=>{let r=e.name===void 0?g.getKey(t):g.getQualifiedKey(t);return f.length>0&&ue.set(r,{name:n,location:e.location}),e.name!==void 0&&x.set(r,n),r})},ge=(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}])),_e=(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:s.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}]}))},ve=(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:Bl(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),ye=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),T=(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=ye(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:Bl(r,n),location:n}}},be=(e,t,n,r)=>{let i=e.location,o=r?void 0:C(e.module);if(o)return e.name===void 0?[]:[...o].map(([t,n])=>{let r=ye(n.arity);return ve(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??me(e.module,n),l=`#${b++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=Yb(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};se.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=>rx(f(e),p),h=d.map(t=>{let n=T(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}}),ee=[],te=Kl({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:Bl(e.params,i),location:i,resolution:Ys}:zl(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>s.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${ee.length}`,a=r(i);return ee.push(a.kind===`Operator`?{...a,name:i}:tx(a,i)),i},createName:oe}),g=new Set(d.map(e=>e.name)),_=[...c.exported].filter(([e])=>!g.has(e)).map(([t,n])=>{let r=te.getKey(n.key),a=ye(n.arity),o=[...e.params,...a];return ve(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...ee,..._]},xe=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),Se=/* @__PURE__ */ new Map,Ce=(e,n)=>{let r=nv(e,t.loadClass?.(e.name),e===i);Se.set(e.name,r.overrides);let o=r.module,c=se.length,l=new Map([...mp.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...n.symbols]),u=/* @__PURE__ */ new Map,d={location:al,errors:[],warnings:[]},f=[d],p=e=>e.forEach((e,t)=>{let n=m.get(t);if(!n){l.set(t,e),m.set(t,e);return}if(!n.range||!e.range||h(n.range)===h(e.range))return;let r=h(e.range),i=h(n.range);ex(n.kind)===ex(e.kind)?d.warnings.push({location:r,message:`Warning: the ${$b(n.kind)} of '${t}' conflicts with \nits ${$b(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${$b(e.kind)} of '${t}' conflicts with \nits ${$b(n.kind)} at ${i}.`})}),m=/* @__PURE__ */ new Map,te=/* @__PURE__ */ new Set,g=/* @__PURE__ */ new Map,_=[],v=[...o.constants],re=o.variables.filter((e,t)=>o.variables.findIndex(t=>t.name===e.name)===t),y=re.map(e=>e.name),ie=re.map(e=>e.location);o.extends.forEach(e=>{let t=n.modules.get(e),r=t?void 0:C(e);if(r){p(r);return}let i=t??me(e,o.name);v.push(...i.constants.filter(e=>v.every(t=>t.name!==e.name)&&!y.includes(e.name))),i.variables.forEach((e,t)=>{y.includes(e)||v.some(t=>t.name===e)||(y.push(e),ie.push(i.variableLocations[t]))}),p(i.exported),i.facts.forEach(e=>te.add(e)),i.modules.forEach((e,t)=>g.set(t,e)),_.push(i)});let ae=new Map(l),b=[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))],oe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});b.forEach(e=>m.set(e.name,oe(e)));let ue=e=>({key:S(e),arity:nc(e),params:rc(e),kind:ol(o,e)?`Theorem`:`Definition`,range:e.location.range}),de=v.length===0&&y.length===0,S=e=>o===i?e.name:`${e.name}@${n.id}`,w=/* @__PURE__ */ new Map,fe=()=>new Map([...n.modules,...g]),pe=e=>{let t=o.modules.find(t=>t.name===e.module);return t?tc(t.location,e.location)?g.get(t.name):void 0:fe().get(e.module)},ve=e=>({imported:l,getInstance:e=>{let t=pe(e),n=t?void 0:C(e.module);if(n)return{declarations:[],symbols:ge(e,n),instancer:o.name};let r=t??me(e.module,o.name),i=Yb(r);return{declarations:i,symbols:_e(e,r.exported,i,e=>e),instancer:o.name}},bound:ae,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:S,instanced:w,facts:te,reports:f,warnings:n.warnings}),ye=e=>[...b.filter(t=>tc(t.location,e)).map(e=>[e.name,oe(e)]),...o.definitions.filter(t=>tc(t.location,e)).map(e=>[e.name,ue(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(l)),T=e=>{let t=fe(),r=t.get(e.name),i=r&&Qb(e,r.module);if(r&&!i)throw Zb(e);n.nested.push(e);let a={location:e.location,errors:[],warnings:[]};f.push(a);let o=Ce(e,{id:`${n.id}/${e.name}`,symbols:ye(e.location),modules:t,nested:n.nested,errors:a.errors,warnings:a.warnings,levelChecks:n.levelChecks});i&&a.errors.push(i),r||g.set(e.name,o)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=he(e,o,ve(o),de,fe().get(e.module));w.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||m.set(n,t))})}})),...o.modules.map(e=>({location:e.location,link:()=>T(e)}))].sort((e,t)=>tc(e.location,t.location)?-1:1).forEach(e=>e.link());let E=xb(Xl(o,(e,t)=>be(e,t,o.name,pe(e))),xe(l));n.errors.push(...fl(E,ve(E))),E.definitions.forEach(e=>{let t=S(e);a.set(t,e),s.set(t,!de);let n=ue(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!tc(r,e.location))&&(l.set(e.name,n),e.isLocal||m.set(e.name,n))});let we={module:E,constants:v,variables:y,variableLocations:ie,visible:l,exported:m,modules:g,extended:_,facts:/* @__PURE__ */ new Set([...te,...[...E.theorems,...E.assumptions].flatMap(e=>e.name??[])])};ee.has(o.name)||ee.set(o.name,we);let Te=se.splice(c).map(e=>({location:e.location,check:()=>le(e)}));return n.levelChecks.push(()=>Au(E,{constants:new Set(v.map(e=>e.name)),variables:new Set(y),getDefinition:e=>a.get(l.get(e)?.key??e),getQualifiedName:e=>x.get(l.get(e)?.key??e)},Te,ce)),ne.push(we),we},E=pe(i).linked,we=t.traceFile,Te=we===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:we}}],Ee=[...t.moduleOperators??[],...Te].map(e=>{let t=me(e.module,i.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});ne.push(...ne.splice(ne.indexOf(E),1)),ce.length>0&&!t.isSanyReported&&t.print(te(ce));let De=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)}),Ee.forEach(e=>{let t=e.key===void 0?void 0:a.get(e.key);e.kind!==`postcondition`&&t&&a.set(e.operator,t)});let Oe=[],ke=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>ke(e,t)),Oe.push(...e.module.assumptions))};ke(E,/* @__PURE__ */ new Set);let Ae=E.constants.map(e=>e.name),je=E.variables,Me=new Map([...f,...[...m].map(([e,t])=>[e,t.visible]),[i.name,E.visible]]),Ne=e=>{let t=Me.get(e.module??``)?.get(e.name);return t?.kind===`Definition`?t:void 0},D=e=>{if(e.module===void 0)return[e.name,De(e.name)];let t=Ne(e);return t?[t.key]:[]},Pe=e=>e.module===i.name?[]:D(e),Fe=e=>{let t=a.get(e);return t?.kind===`Operator`?t.params.length:E.constants.find(t=>t.name===e)?.arity??d.get(e)?.arity??0},Ie=/* @__PURE__ */ new Map,Le=/* @__PURE__ */ new Set,Re=(e,t)=>{d.set(e,t),a.delete(e),Ie.delete(e),Le.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=Jb(e.value);Wr(t),Pe(e).forEach(e=>{let n=Fe(e);n===0?Ie.set(e,t):Re(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let ze=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=ze.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new g(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(qb),qb(e.value)]),ze.set(t,n)}),ze.forEach(e=>Pe(e).forEach(t=>Re(t,nx(e.name,Fe(t),e.rows))));let Be=new Map(e.substitutions.flatMap(e=>D(e).map(t=>[t,De(e.target)])));[...Be.keys()].forEach(e=>Ie.delete(e));let Ve=(e,t,n)=>{let r=De(t),i=a.get(r);if(!(i!==void 0||d.has(r)||Ie.has(r)||Ae.includes(t)||je.includes(t)))throw new g(`The configuration file substitutes for ${e} with the undefined identifier ${t}.`);if(i?.kind===`Operator`&&i.params.length!==n)throw new g(`The configuration file substitutes for ${e} with ${t} of different number of arguments.`)};e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,r=t.target;if(!Ae.includes(n)&&!E.visible.has(n))throw new g(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===r))throw new g(`In the configuration file, the identifier ${r} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);Ve(n,r,E.constants.find(e=>e.name===n)?.arity??E.visible.get(n)?.arity)});let O=e.substitutions.filter(e=>e.module!==void 0);[...Me.keys()].forEach(e=>{let t=O.filter(t=>t.module===e);t.forEach(e=>{let n=Ne(e);if(n){if(t.some(t=>t.name===e.target))throw new g(`In the configuration file, the identifier ${e.target} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);Ve(e.name,e.target,n.arity)}});let n=t.find(e=>!Ne(e));if(n)throw new g(`In the configuration file, the identifier ${n.name} does not appear in the specification.`)});let He=O.find(e=>!Me.has(e.module??``));if(He)throw new g(`In the configuration file, the module name ${He.module} is not a module in the specification.`);let Ue=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(Pe)),We=(e,t)=>{if(Ue.has(e))return{key:e,prefix:t};let n=c.get(e);return n&&We(n.source,t+n.prefix)};c.forEach((e,t)=>{let n=We(e.source,e.prefix),r=a.get(t);if(!n||!r)return;let i=r.kind===`Operator`?r.params:[],o=ve(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)})}),Ee.forEach(e=>me(e.module,i.name).constants.forEach(t=>{let n=e.constants?.[t.name];n!==void 0&&Ie.set(t.name,n)}));let Ge=Ae.filter(e=>!Ie.has(e)&&!Be.has(e)&&!Le.has(e));if(Ge.length>0){let e=n.getDeclarationOrder(`constant`).find(e=>Ge.includes(e))??Ge[0];throw new g(`The constant parameter ${e} is not assigned a value by the configuration file.`)}we!==void 0&&d.forEach((e,t)=>{let n=yp(e);n&&d.set(t,n)});let Ke=ix(je,ne.flatMap(e=>e.module.variables.map(e=>e.name))),qe=Wu({definitions:a,substitutions:Be,constants:Ie,variableIndex:Ke,builtins:d,variables:je}),Je={runtime:p,definitions:a,builtins:d,constants:Ie,substitutions:Be,instanceNames:de,variables:je,variableIndex:Ke,facts:qe,startupValues:Array.from({length:qe.ids.size},()=>void 0),substitutedDefinitions:l,instanceParams:u,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Ye=Ou({constants:new Set(Ie.keys()),variables:/* @__PURE__ */ new Set([...je,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>d.has(e))]),getDefinition:e=>og(e,Je)}),Xe=e=>{try{U(e,{environment:Je,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof _)return e;throw e}};Be.forEach((e,t)=>{let n=a.get(e),r=Ae.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ye.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Xe(n.body):void 0;if(r){let n=Nt(r)?``:` - specifically: ${r.message}`;throw new g(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),p.version!==`1.7.4`&&(p.isStarted=!0);let Ze=new Set(ne.flatMap(e=>e.module.instances.map(e=>e.module))),Qe=n.createDefinitionOrder();return{environment:Je,assumptions:Oe,variableLocations:E.variableLocations,instanceActions:ue,startupDefinitions:ne.filter(e=>!Ze.has(e.module.name)||Yb(e).length===0).flatMap(e=>Qe(e===E?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:ne.flatMap(e=>Se.get(e.module.name)??[]),moduleOperators:Ee,rootName:i.name}},cx={kind:`Boolean`,value:!0},lx={kind:`Boolean`,value:!1},ux=e=>e?cx:lx,dx=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,fx=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),px=(e,t,n)=>({kind:e,operands:[t,n]}),mx=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?mx(e,t.operands).operands:[t])}),hx=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return hx(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,hx(t)),0)}},gx=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 gx(e.body);case`And`:case`Or`:return e.operands.some(gx)}},_x=/* @__PURE__ */ new WeakMap;let vx=0;const yx=e=>{let t=_x.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`#${vx++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(yx).join(`,`)})`;default:return`${e.kind}(${yx(e.body)})`}})();return _x.set(e,n),n},bx=(e,t)=>e===t||yx(e)===yx(t),xx=(e,t)=>{let n=yx(t);return e.some(e=>e===t||yx(e)===n)},Sx=e=>e===`And`?`Or`:`And`,Cx=(e,t)=>{switch(e.kind){case`Boolean`:return t?ux(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return Cx(e.body,!t);case`And`:case`Or`:return mx(t?Sx(e.kind):e.kind,e.operands.map(e=>Cx(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,Cx(e.body,t))}}},wx=e=>{switch(e.kind){case`Boolean`:return ux(!e.value);case`Not`:return e.body;case`And`:case`Or`:return mx(Sx(e.kind),e.operands.map(wx));case`Always`:return $(`Eventually`,wx(e.body));case`Eventually`:return $(`Always`,wx(e.body));default:return $(`Not`,e)}},Tx=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Tx(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return ux(t)}return n.length===0?ux(!t):n.length===1?n[0]:mx(e.kind,n)}case`Not`:{let t=Tx(e.body);return t.kind===`Boolean`?ux(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=Tx(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Ex=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Dx=e=>{switch(e.kind){case`And`:{let t=[],n=1;for(let r of e.operands){let e=Dx(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n*=e.operands.length,n>2147483647))throw new _(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n===1)return{kind:`And`,operands:t};let r=Array.from({length:n},()=>[]),i=1,a=n;for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}a/=e.operands.length;let t=0;for(let n=0;n<i;n++)for(let n of e.operands)for(let e=0;e<a;e++)r[t++].push(n);i*=e.operands.length}return{kind:`Or`,operands:r.map(e=>mx(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Dx(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Ex(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:mx(`Or`,t);n.push($(`Always`,$(`Eventually`,e)))}return mx(`Or`,n)}case`Not`:return dx(e.body)?e:Dx(wx(e.body));default:return e}},Ox=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Ox(e.operands[0]):mx(e.kind,e.operands.map(Ox));case`Not`:return e.body.kind===`Not`?Ox(e.body.body):$(`Not`,Ox(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,Ox(e.body));default:return e}},kx=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return kx(e.operands[0]);let t=Math.floor(e.operands.length/2);return px(e.kind,kx(mx(e.kind,e.operands.slice(0,t))),kx(mx(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,kx(e.body));default:return e}},Ax=(e,t)=>{e.kind===`Eventually`&&!xx(t,e)&&t.push(e),`body`in e&&Ax(e.body,t),`operands`in e&&e.operands.forEach(e=>Ax(e,t))},jx=e=>{let t=e.filter(fx),n=e.flatMap(e=>e.kind===`Not`&&fx(e.body)?[e.body]:[]);return!t.some(e=>xx(n,e))},Mx=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,$(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new _(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Nx=(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]}},Px=(e,t,n)=>e.flatMap(e=>{let r=Nx(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Fx=e=>[...new Set(e.map(yx))].sort().join(`|`),Ix=(e,t)=>{let n=new Set(t.map(Fx));return[...e.filter(e=>!n.has(Fx(e))),...t]},Lx=e=>{let t=Mx(e),n=Px(t,`Always`,`And`),r=Px(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Nx(t,`Eventually`,`Or`);if(n&&!(xx(e,n.first)||xx(e,n.second)))return Ix(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(xx(e,t.first)||xx(e,t.second))&&!xx(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!jx(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Nx(t[e],`Always`,`And`);n&&(xx(t,n.first)||t.push(n.first),xx(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)xx(t,e.first)&&xx(t,e.second)&&!xx(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!jx(t)?[]:i(t)};return a(e)},Rx=e=>({particle:e,successors:[],statePredicates:e.filter(e=>hx(e)<=1)}),zx=e=>{let t=Lx([e]).map(Rx),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Fx(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 Lx(n)){let n=Fx(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Rx(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Bx=(e,t)=>!xx(e,t)||xx(e,t.body),Vx=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&hx(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Ex(e);if(n){let e=hx(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(gx(e))throw new _(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Hx=(e,t)=>{let n=e.findIndex(e=>bx(e,t));return n===-1?(e.push(t),e.length-1):n},Ux=e=>{let t=Dx(Tx(Cx(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Ox(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Vx(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:mx(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:bx(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&kx(e.formula),n=[];t&&Ax(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Hx(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Hx(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Hx(i,e))}));return{tableau:t&&zx(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Wx=()=>y(new _(`Temporal formula is a tautology (its negation is unsatisfiable).`),b.livenessEvaluationFailure),Gx=/* @__PURE__ */ new Set([`~>`,`-+->`]),Kx=/* @__PURE__ */ new WeakSet,qx=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),Jx=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Yx=(e,t)=>new _(`TLC cannot handle the temporal formula ${V(e)}${t===void 0?``:`:\n${t}`}`),Xx=(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=Xx(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=Yh(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=og(e,n);if(t)return Xu(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:k(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a={value:0};return Sl(e,(e,o)=>(a.value=Math.max(a.value,Xx(e,t,n,o.length===0?r:/* @__PURE__ */ new Set([...r,...o]),i)),e)),a.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:l(e);case`Identifier`:return c(e.name,e);case`OperatorReference`:return c(e.operator,e);case`Apply`:{if(Gx.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=k(e)?void 0:zg(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,Qg(o,e.args,Jx(n,t)))}default:return l(e)}},Zx=(e,t)=>{try{return gg(e,t)}catch(e){if(!(e instanceof _))throw e;if(!Nt(e))return;throw y(new _(`${m}${e.message}`),b.error)}},Qx=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o,s=[])=>{let c=(e,t,c=o,l=i,u)=>Qx(e,t,n,r,l,a||u!==void 0&&n.substitutedDefinitions.has(u),c,u?.kind===`Operator`&&u.params.length===0?[...s,u.name]:s);if(e.kind===`And`)return e.operands.flatMap(e=>c(e,t,V(e)));if(e.kind===`Label`)return c(e.body,t);if(e.kind===`Let`)return c(e.body,$x(e,t,n));if(e.kind===`Identifier`){let r=k(e)?Yh(t,e.name):void 0;if(r?.kind===`Thunk`&&!r.isReleased)return c(r.expression,r.scope,Kx.has(r)?e.name:o);let s=n.constants.has(e.name)?void 0:og(e.name,n);if(!r&&s?.kind===`Operator`&&s.params.length===0&&(Xu(s,n)>0||Pg(s,n)===void 0)){if(i.has(s))throw ee();return c(s.body,void 0,!a&&n.instanceNames.get(e.name)||s.name,/* @__PURE__ */ new Set([...i,s]),s)}}let l=Jx(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||Xx(e,t,n)===3)){let t=Bg(e,l),r=k(e)?void 0:og(e.operator,n),o=t?.kind===`Closure`&&t.params.every(e=>n.instanceParams.has(e));if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&(!a||o))return c(t.body,Qg(t,e.args,l),a&&r?r.name:e.operator,i,r)}let u=r&&e.kind===`Forall`&&e.bounds.every(e=>Xx(e.set,t,n)===0),d=u?Zx(e.bounds,l):void 0;if(u&&d){let n=[];if(_g(e.bounds,d,t,t=>(n.push(...c(e.body,t,V(e.body))),!1)),n.length===0)throw Wx();return n}return[{expression:e,scope:t,name:o,path:s}]},$x=(e,t,n)=>{let r=n_(e.definitions,Jx(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Kx.add(e.binding);return r},eS=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,i=(e,t,i)=>{let a=i===0&&!r?Xx(e,t,n):i;if(a===0){let r=U(e,Jx(n,t));if(typeof r!=`boolean`)throw new _(`TLC expected a boolean value, but did not find one. ${Rh(e)}`);return ux(r)}return a===1?{kind:`State`,expression:e,scope:t}:e.kind===`AngleAction`?{kind:`Action`,expression:e.action,subscript:e.subscript,scope:t}:{kind:`Action`,expression:e,subscript:void 0,scope:t}},a={depth:0},o=(e,t,r,o)=>{if(a.depth>=100)throw ee();a.depth++;let s=p(e,t);a.depth--;let c=hx(s),l=c===0&&Xx(r,o,n)>2;return c>2||l?s:i(r,o,c)},s=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=Jx(n,t),s=k(e)||og(i,n)===void 0?Yh(t,i):void 0;if(s?.kind===`Thunk`&&!s.isReleased&&Kx.has(s))return c(e,()=>o(s.expression,s.scope,e,t));let l=s?.kind===`Operator`?s.operator:s?void 0:k(e)?Vg(i,a):zg(i,n),u=e.kind===`Apply`?e.args:[],f=l?.kind===`Builtin`&&u.length===2?qx.get(l.name):void 0;if(f){let n=u.map(e=>p(e,t));return d(e,t,mx(f,n))}if(l?.kind!==`Closure`)throw Yx(e);let m=!k(e)&&og(i,n)?.isRecursive===!0;return c(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>U(e,a)),o(l.body,Qg(l,u,a),e,t)),m)},c=(e,t,n=!1)=>{try{return t()}catch(t){let i=t instanceof l||n&&!r;throw!(t instanceof _)||i?t:Yx(e)}},u=(e,t)=>{let r=Xx(e,t,n),a=[],o=e.kind===`Forall`;try{vg(e.bounds,Jx(n,t),t=>(a.push(p(e.body,t)),!1))}catch(n){if(!(n instanceof _)||n instanceof l)throw n;if(r<=2)return i(e,t,r);throw Yx(e,o&&!Nt(n)?n.message:void 0)}return a.length===0?ux(o):d(e,t,mx(o?`And`:`Or`,a))},d=(e,t,n)=>{let r=hx(n);return r>2?n:i(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===`~`&&!k(e)||e.operator===`=>`),p=(e,t)=>{let a=Xx(e,t,n);if(a<=2&&!f(e))return i(e,t,a);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,$x(e,t,n));case`Identifier`:return s(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,px(`Or`,$(`Not`,p(n[0],t)),$(`Eventually`,p(n[1],t)))):e.operator===`~`&&!k(e)?d(e,t,$(`Not`,p(n[0],t))):e.operator===`=>`?d(e,t,px(`Or`,$(`Not`,p(n[0],t)),p(n[1],t))):s(e,t)}case`And`:case`Or`:return d(e,t,mx(e.kind,e.operands.map(e=>p(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!r&&Xx(e.condition,t,n)===0){let r=U(e.condition,Jx(n,t));if(typeof r==`boolean`)return p(r?e.consequent:e.alternative,t)}let i=p(e.condition,t);return d(e,t,px(`Or`,px(`And`,i,p(e.consequent,t)),px(`And`,$(`Not`,i),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,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?$(`Always`,$(`Eventually`,px(`Or`,i,a))):px(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw Yx(e)}};return p(e,t)},tS=(e,t,n,r,i)=>{let a=e=>tS(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?U(e.expression,a):wh(e.step,a);if(typeof o!=`boolean`)throw new _(`A state predicate was evaluated to a non-boolean value.`);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a=e.scope,o=e.subscript;if(o&&Kr(U(o,{environment:r,scope:a,state:t,next:void 0}),U(o,{environment:r,scope:a,state:n,next:void 0})))return!1;let s=U(e.expression,{environment:r,scope:a,state:t,next:n});if(typeof s!=`boolean`)throw new _(`Encountered an action predicate that's not a boolean.`);return s}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return tS(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new _(`TLC cannot evaluate a temporal formula in a single step`)}},nS=(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)=>nS(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 tS(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},rS=`UnnamedAction`,iS={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},aS=e=>{let t=e.range??iS;return pi([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},oS=(e,t)=>{let n=[[`name`,e.name],[`location`,aS(e.location)]];return e.parameters.length>0&&n.push([`context`,pi(e.parameters)],[`parameters`,fi(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),pi(n)},sS=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),cS=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),lS=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,uS=e=>e.kind===`Apply`?e.args:[],dS=(e,t,n)=>{let r=lS(e);if(r===void 0)return;if(k(e)){let e=Yh(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=zg(r,n);return i?.kind===`Closure`?i:void 0},fS=(e,t)=>{try{return U(e,cS(t,void 0)),!0}catch(e){if(e instanceof le)return!1;throw e}},pS=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&qu(e,t)&&fS(e.body,t),mS=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&pS(e,t),hS=(e,t)=>{let n=og(e.name,t);return n?.body===e.body&&mS(n,t)},gS=(e,t)=>{if(e.kind!==`Identifier`||!k(e))return;let n=Yh(t,e.name);return n?.kind===`Thunk`?n:void 0},_S=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Yh(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),vS=(e,t)=>{try{return e()}catch(e){if(e instanceof le)return t();throw e}},yS=(e,t,n,r,i)=>{let a=uS(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=>Xx(e,n,i)!==0)?o():vS(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),U(e,cS(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},bS=(e,t,n,r,a)=>{let o=()=>({name:n?.name??rS,location:e.location,parameters:_S(n,t),expression:e,scope:t});if(pm.has(e.kind))throw y(new _(`${i}The next state relation is not a boolean expression.\n${Rh(e)}`),b.error);switch(e.kind){case`Let`:return bS(e.body,n_(e.definitions,cS(r,t)),n,r,a);case`Label`:return bS(e.body,t,n,r,a);case`Or`:return e.operands.flatMap(e=>bS(e,t,n,r,a));case`Exists`:return vS(()=>{let i=[];return vg(e.bounds,cS(r,t),t=>(i.push(...bS(e.body,t,n,r,a)),!1)),i.length===0?[o()]:i},()=>[o()])}let s=k(e)?void 0:a.get(lS(e)??``),c=dS(e,t,r);if(s)return yS(s,e,t,c,r);if(!c)return[o()];let l=uS(e),u=k(e)?c.name:r.instanceNames.get(lS(e)??``)??c.name,d=()=>[{name:u,location:e.location,parameters:[],expression:e,scope:t}];return hS(c,r)||l.some(e=>Xx(e,t,r)!==0)?d():vS(()=>{let e=l.reduce((e,n,i)=>({name:c.params[i].name,binding:{kind:`Value`,value:U(n,cS(r,t))},parent:e}),c.scope);return bS(c.body,e,{...c,name:u},r,a)},d)},xS=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>xS(e,t,n,r,i,o),s=(e,t,n)=>sS(e,hl(t,a),n);if(e.kind===`Let`){o(e.body,n_(e.definitions,cS(n,t)));return}let c=gS(e,t);if(c){o(c.expression,c.scope);return}let l=dS(e,t,n);if(l&&hS(l,n))return;let u=l?[...a,...ml.get(l.body)??[]]:a;if(l&&l.params.length===0){if(Xx(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,Qg(l,e.args,cS(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(rS,e,t));return}let d=Xx(e,t,n);d<=1?r.inits.push(s(rS,e,t)):d===3&&r.temporals.push(s(rS,e,t))},SS=(e,t,n,r,i)=>{let a=(t,n)=>SS(e,t,n,r,i);if(t.kind===`Let`){a(t.body,n_(t.definitions,cS(r,n)));return}let o=gS(t,n);if(o){a(o.expression,o.scope);return}let s=dS(t,n,r);if(s&&hS(s,r))return;if(s&&s.params.length===uS(t).length){a(s.body,t.kind===`Apply`?Qg(s,t.args,cS(r,n)):s.scope);return}if(t.kind===`Forall`&&vS(()=>(vg(t.bounds,cS(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(sS(e,a)):Xx(a,n,r)<2?i.invariants.push(sS(e,a)):i.impliedTemporals.push(sS(e,t));return}let c=Xx(t,n,r);c<=1?i.impliedInits.push(sS(e,t)):c===3&&i.impliedTemporals.push(sS(e,t))},CS=(e,t)=>{let n=og(e,t);return n?.kind===`Operator`&&!mS(n,t)?n:void 0},wS=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:CS(e.specification,t);a&&(xS(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:rS,location:e.frames[0].location,parameters:[],expression:hl(e.expression,e.frames),scope:e.scope}]:bS(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:zg(e.init,t);o?.kind===`Closure`&&r.inits.push(sS(e.init??``,o.body));let s=e.next===void 0?void 0:zg(e.next,t);return s?.kind===`Closure`&&r.actions.push(...bS(s.body,s.scope,s,t,n)),r},TS=(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);if(e.kind===`Let`)return i(e.body,n_(e.definitions,cS(n,t)));let a=gS(e,t);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&k(e)?Yh(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!k(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=dS(e,t,n);if(!s||s.params.length!==uS(e).length)return!0;let c=og(s.name,n);return c?.body===s.body&&pS(c,n)?!0:i(s.body,e.kind===`Apply`?Qg(s,e.args,cS(n,t)):s.scope)};return i(e,t)?r:void 0},ES=(e,t,n)=>wS(e,t,n).inits,DS=(e,t,n)=>wS(e,t,n).actions,OS=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>I(e[1])).join(`,`)})`,kS=(e,t,n=!1)=>`${e.name===rS?n?`Initial predicate`:`Action`:e.name}${t===`1.7.4`?``:OS(e)} ${h(e.location.range??iS)}`,AS=e=>`${e.name}${OS(e)}`,jS=(e,t,n,r)=>{let i=wS(e,t,r);e.invariants.forEach(e=>{let n=CS(e,t);n&&i.invariants.push(sS(e,n.body))}),e.properties.forEach(e=>{let n=CS(e,t);n&&SS(e,n.body,void 0,t,i)});let a=t.coverage,o=(e,t)=>Yr(e.map(e=>{let n=a&&t&&Qo(a,t,e.expression);return oS(e,n&&pi(n))})),s=e=>Yr(e.flatMap(e=>{let n=CS(e,t);return n?[pi([[`name`,n.name],[`location`,aS(n.location)]])]:[]}));return pi([[`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`,Yr(t.variables.map((e,t)=>pi([[`name`,e],[`location`,aS(n[t])],...a?[[`coverage`,pi([[`distinct`,Bo(a,t)]])]]:[]])))],[`actionconstraints`,s(e.actionConstraints)],[`constraints`,s(e.constraints)]])},MS=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),NS=(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},PS=e=>y(new _(`${i}${e}`),b.error),FS=e=>{let t=F(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!un(e)||!un(i))throw PS(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},IS=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${LS(t)}`:n},LS=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(LS).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${IS(e.pattern,e.set)}:${LS(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(LS).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${LS(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>IS(e.pattern,e.set)).join(`,`)}|->${LS(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(LS);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},RS=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,zS=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new g(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw PS(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>U(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!j(a)||!M(a))throw PS(`The symmetry operator must specify a set of functions.`);let o=N(a).elements;if(!o.every(ln))throw PS(`The symmetry values must be function records.`);let s=r.body,c=s.kind===`Apply`?s.args:s.kind===`SetEnumeration`?s.elements:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=LS(RS(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(St.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;o.map(FS).forEach(e=>{e.size>0&&d.set(MS(e),e)});let f=[...d.values()],p={start:0};for(;p.start<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p.start,t).forEach(e=>{let t=NS(n,e),r=MS(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p.start=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!RS(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>un(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},BS=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=HS(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(HS(e[r],t));return a}},VS=(e,t)=>{let n=[],r=[];for(let i of e){let e=HS(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Jn);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Jn(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},HS=(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=VS(e.elements,t);return n?$n(n):e}if(n===`Function`||n===`LazyFunction`&&M(e.domain)){let n=F(e),r=BS(n.domain,t),i=BS(n.range,t)??n.range;if(r){let e=ti(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?tr(n.domain,e.range):e}return i===n.range?n:tr(n.domain,i)}if(n===`Interval`||!j(e)||!M(e))return e;let r=N(e),i=BS(r.elements,t);return i?Yr(i):r},US=(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]=HS(e[o],i),a===0&&(a=Jn(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},WS={line:0,column:0},GS=e=>({kind:`Identifier`,name:e,location:WS}),KS=/* @__PURE__ */ new Set([`name`,`property`]),qS=(e,t,n)=>{let r=og(t,n);if(!r)throw new g(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new g(KS.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},JS=e=>e.body.kind===`Number`||e.body.kind===`String`,YS=(e,t,n)=>{if(n.constants.has(e))return n.constants.get(e);if(qu(t,n)&&!JS(t))try{return U(GS(e),yC(n,void 0,void 0))}catch(e){if(e instanceof _||ne(e))return;throw e}},XS=(e,t,n)=>{if(n.constants.has(t))throw new g(`The ${e} ${t} cannot be a constant.`);let r=qS(e,t,n);if(YS(t,r,n)!==void 0)throw new g(`The ${e} ${t} cannot be a constant.`);return r},ZS=(e,t,n)=>{let r=n.constants.has(t)?void 0:qS(e,t,n),i=r?YS(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new g(`The ${e} of ${t} is equal to ${I(i)}`);return i===void 0?r:void 0},QS=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},$S=(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})),Fg(e.startupDefinitions,r),t.invariants.forEach(e=>{ZS(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},eC=(e,t)=>{let n=Ou({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>t.definitions.get(e)});return e.flatMap(e=>{let r=ZS(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.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 o(new g(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),m.safetyEvaluationFailure)}return[{name:e,expression:ry(e),scope:void 0}]})},fy=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>fy(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Mu(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return fy(n.body,t)}return[e]},py=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||Rv(r,e.scope,t)>0)return!1;let i=H(r,Oy(t,void 0,void 0,e.scope));if(i===!1)throw new g(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new g(`The operator ${r.name}, which equals ${L(i)},\ncannot be used as a ${n}`);return!0},my=(e,t)=>{if(e.specification===void 0){let n=(e,n)=>{if(e!==void 0)return sy(n,e,t),ry(e)};return{init:n(e.init,`initial predicate`),next:n(e.next,`next state action`),scope:void 0,temporals:[]}}if(e.init!==void 0||e.next!==void 0)throw new g(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let n=[],r=[],i=[],a=ay(`name`,e.specification,t),s=oy(e.specification,a,t);if(s!==void 0)throw new g(`The value of ${e.specification} is equal to ${L(s)}`);if(Bv(a.body,void 0,t,!1).forEach(a=>{let s=a.expression;if(py(a,t,`spec`))return;if(s.kind===`UnboundedQuantifier`&&s.isTemporal)throw o(new g(`TLC does not support temporal existential, nor universal, quantification over state variables.`),m.error);if(s.kind===`Always`&&s.expression.kind===`BoxAction`){r.push({expression:s.expression.action,scope:a.scope});return}if(s.kind===`Always`&&Rv(s.expression,a.scope,t)<2)throw o(new h(`TLC cannot handle the temporal formula ${fu(s.expression)}`),m.error);let c=Rv(s,a.scope,t);if(c===3)i.push(a);else{if(c===2)throw new g(`TLC cannot handle the action-level conjunct of the specification ${e.specification}`);n.push(a)}}),r.length>1)throw new g(`The specification ${e.specification} must contain at most one [][Next]_vars`);let c=[...n,...r],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:n.length===0?void 0:{kind:`And`,operands:n.map(d),location:ny},next:r.length===0?void 0:d(r[0],n.length),scope:u,temporals:i}},hy=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=cy(`property`,e,t);if(!i)return;Rv(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;Bv(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(py(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&Rv(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!O(e)?Mu(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=Rv(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2)throw new g(`The property ${e} is an action-level formula`);r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},gy=(e,t,n)=>t.flatMap(t=>cy(e,t,n)?[{name:t,expression:ry(t),scope:void 0}]:[]),_y=(e,t)=>{let n=Mu(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},vy=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new g(`_POSSIBLE lists ${n} more than once`);sy(`possible`,n,t);let i=ry(n);if(Rv(i,void 0,t)===3)throw new g(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),yy=(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},by=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=Mu(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},xy=(e,t)=>e.flatMap(e=>fy(e.expression,t).map(n=>{let r=e.scope===void 0?Mc(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:yy(n,r,t),predicate:by(e.expression,t)}})),Sy=(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},Cy=/[\u0100-\uffff]/,wy=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Ty=e=>e.kind===`String`?Cy.test(e.value):e.kind===`Set`&&e.elements.some(Ty),Ey=e=>e.kind===`String`&&Cy.test(e.value)||e.kind===`Apply`&&wy.has(e.operator)||Ye(e).some(Ey),Dy=(e,t)=>e.constants.some(e=>Ty(e.value)||(e.args??[]).some(Ty))||[...t.definitions.values()].some(e=>Ey(e.body)||e.kind===`Function`&&e.bounds.some(e=>Ey(e.set))),Oy=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),ky=(e,t,n)=>ju(H(e,t),n),Ay=(e,t,n=jy)=>{let r=H(e,t);if(typeof r!=`boolean`)throw new h(n(e,t.environment));return r},jy=(e,t)=>{let n=e.kind===`Identifier`?Mu(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`?du(i):pu(r)}`},My=(e,t)=>Ay(e.expression,t,(n,r)=>(Ay(e.predicate,t),jy(n,r))),Ny=()=>{},Py=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=ky(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),Fy=(e,t,n)=>{try{return ky(e,Oy(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof h)return{message:e.message};throw e}},Iy=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=Fy(n.expression,t,`an assumption`);if(e)return{name:fu(n.expression),trace:[],message:e.message}}},Ly=(e,t,n,r)=>{let i=dy(e.invariants,t),a=my(e,t),s=hy(e,t,r),c=xy([...i,...s.invariants],t),l=[...new Map(c.map(e=>[e.predicate,e])).values()],d=c.length>0||s.actionProperties.length>0||s.liveness.length>0;if(a.init===void 0&&(d||s.initialPredicates.length>0||t.variables.length>0))throw new g(t.runtime.version===`1.7.4`?ca:`The configuration file did not specify the initial state predicate.`);if(a.next===void 0&&d)throw new g(`The configuration file did not specify the next state predicate.`);let f=xy(gy(`constraint`,e.constraints,t),t),p=gy(`action constraint`,e.actionConstraints,t);e.rlReward!==void 0&&ay(`rlreward`,e.rlReward,t),e.periodic!==void 0&&ay(`periodic`,e.periodic,t);let ee=vy(e.possible,t);if(t.variables.length===0)return;let _=e.symmetry===void 0?void 0:Zv(e.symmetry,t,e.substitutions);e.view!==void 0&&ay(`view function`,e.view,t);let v=e.view===void 0?void 0:{name:e.view,expression:ry(e.view),scope:void 0},te=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:ny};return{...e,unchanged:t}}),y=e=>Rv(e.expression,void 0,t)>=2,b=ee.filter(e=>!y(e)),ne=ee.filter(y),re=t.runtime,ie={indices:void 0},ae=()=>{if(ie.indices)return ie.indices;let e=n(),r=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return ie.indices=t.variables.map((e,t)=>t).sort((e,t)=>r(e)-r(t)),ie.indices},oe=(e,n)=>H(e,Oy(t,n,void 0)),se=e=>{let t=ae(),n=_===void 0?e:ty(e,_,t);return Rm(v===void 0?t.map(e=>n[e]):[oe(v.expression,n)])},ce=Dy(e,t);re.getFingerprint=se;let le=()=>{let e=ee.find(e=>!re.possibleCounts.get(e.name));if(!e)return;let n=_y(e.name,t),r=n?` at ${du(n)}`:``;return{name:e.name,code:ia.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:at(L(sh(re),!0))}};return{properties:s,spec:a,isSymmetric:_!==void 0,isConstrained:f.length>0||p.length>0,getTlcOrder:ae,getStoredFingerprints:(e,t)=>v!==void 0||ce?BigInt64Array.from(e,se):zm(t,ae()),getFingerprintState:e=>{if(ce)return[String(se(e))];let t=_===void 0?e:ty(e,_,ae());return v===void 0?t:[oe(v.expression,t)]},findViolatedInvariant:(e,n)=>c.find(r=>{if(Sy(r,e,n))return!1;try{let i=Oy(t,e,void 0,r.scope),a=r.membership;return n&&a?!Er(e[a.variable],n[a.variable],H(a.set,i)):!My(r,i)}catch(e){throw n?Sa(o(e,m.safetyEvaluationFailure),ia.invariantEvaluationFailed,`Evaluating invariant ${r.name} failed.`):e}}),checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>Ay(n,Oy(t,e,void 0,r));f.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)=>(!(!(f.every(e=>Ay(e.predicate,Oy(n,t,void 0,e.scope)))&&p.every(r=>Ay(r.expression,Oy(n,e,t,r.scope))))||r())||l.every(e=>Ay(e.predicate,Oy(n,t,void 0,e.scope))))&&te.every(r=>Ay(r.box,Oy(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>f.every(r=>Sy(r,e,n)||My(r,Oy(t,e,void 0))),findFailedInitialPredicate:e=>s.initialPredicates.find(n=>!Ay(n.expression,Oy(t,e,void 0,n.scope))),findViolatedActionProperty:(e,n)=>te.find(r=>{try{return!Ay(r.action,Oy(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${fu(r.box)}`)&&!ky(r.unchanged,Oy(t,e,n,r.scope),`a subscript`)}catch(e){throw Sa(Ry(e),ia.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,n)=>p.every(r=>Ay(r.expression,Oy(t,e,n),e=>`${u}${jy(e,t)}`)),trackStatePossible:b.length===0?Ny:e=>Py(b,re,Oy(t,e,void 0)),trackActionPossible:ne.length===0?Ny:(e,n)=>Py(ne,re,Oy(t,e,n)),findUnwitnessedPossible:le,findPostconditionViolation:(n=!1)=>{let r=e.postconditions.find(e=>{let n=Mu(e,t);return n!==void 0&&id(n,t)!==void 0});if(r!==void 0){if(n)return;throw o(new h(`${u}The post condition ${r} cannot be a constant.`),m.error)}let i=le();if(i)return i;for(let n of e.postconditions){let e=Fy(ry(n),t,`a postcondition`);if(!e)continue;let r=_y(n,t),i=r?` at ${du(r)}`:``;return e.message===void 0?{name:n,code:ia.postconditionFalse,message:`Postcondition ${n}${i} is false.`}:{name:n,code:ia.postconditionFailed,message:`Evaluating postcondition ${n}${i} failed.\n${e.message}`}}}}},Ry=e=>e instanceof n?o(e,e.exitCode):e,zy=(e,t)=>e*((t-e)/2**64),By=e=>e.includes(`.`)?e:`${e}.0`,Vy=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return By(String(e));let[n,r]=e.toExponential().split(`e`);return`${By(n)}E${r.replace(`+`,``)}`},Hy=e=>e!==void 0&&e>=`0`&&e<=`9`,Uy=e=>{if(e===0)return`0.0`;let t=Vy(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;Hy(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(;Hy(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;Hy(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(Hy(t[n.next])&&Number(t[n.next])>=5&&(n.result=Wy(n.result));Hy(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},Wy=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Wy(r)}.`:n===`9`?`${Wy(r)}0`:`${r}${Number(n)+1}`},Gy=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}`)},Ky=(e,t,n)=>{if(zy(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},qy=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}).`},Jy=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Yy=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^qr(e[t]),16777619),r=Math.imul(r^$r(e[t]),1540483477);t[0]=Jy(n)||1,t[1]=Jy(r)},Xy=()=>{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)}}},Zy=(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}},Qy=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),$y=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return Zy(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},eb=e=>Atomics.load(e.used,0)*2>=e.slots.length,tb=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&Zy(t,n);return{slots:t,used:e.used}},nb=[void 0,`lambda`,`tuple`,`record`],rb=()=>{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=Pr(e.domain);return t?(r(7),r(nb.indexOf(Ht(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(nb.indexOf(Ht(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})}},ib=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 Lt(t.strings[n[r.index++]]);if(e===5)return Rt(i(n[r.index++]));let a=nb[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=Kn({kind:`Interval`,low:e,high:e+t-1});return Vt(zt(o,i(t)),a)}let o=n[r.index++],s=i(o);return Vt(zt(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Mu as $,cv as A,li as At,dm as B,Tt as Bt,Uv as C,Oa as Ct,rv as D,Jn as Dt,Hv as E,Lt as Et,ug as F,qr as Ft,pf as G,Je as Gt,gm as H,Ye as Ht,dh as I,A as It,Md as J,me as Jt,Cd as K,Be as Kt,uh as L,Qt as Lt,X_ as M,Gr as Mt,I_ as N,Kr as Nt,$ as O,Mn as Ot,lg as P,Dt as Pt,du as Q,fh as R,Yt as Rt,Nv as S,Ca as St,Rv as T,tn as Tt,hm as U,O as Ut,pm as V,I as Vt,zp as W,qe as Wt,H as X,xe as Xt,fu as Y,_e as Yt,Uu as Z,sy as _,ya as _t,tb as a,iu as at,uy as b,Da as bt,Yy as c,sl as ct,Ky as d,ia as dt,Dd as et,zy as f,aa as ft,Iy as g,ba as gt,Ly as h,_a as ht,Qy as i,nu as it,kv as j,L as jt,Mv as k,M as kt,Uy as l,cl as lt,ry as m,ga as mt,rb as n,Tu as nt,$y as o,ru as ot,qy as p,sa as pt,xd as q,w as qt,Xy as r,cd as rt,eb as s,au as st,ib as t,Ed as tt,Gy as u,Dc as ut,Oy as v,pa as vt,Wv as w,Rr as wt,Ry as x,ma as xt,ly as y,ja as yt,Rm as z,Ct as zt};
|
|
1788
|
+
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw y(new g(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),b.safetyEvaluationFailure)}return[{name:e,expression:GS(e),scope:void 0}]})},tC=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>tC(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=og(e.name,t);if(n?.kind===`Operator`&&n.params.length===0&&Pg(n,t)===void 0)return tC(n.body,t)}return[e]},nC=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||Xx(r,e.scope,t)>0)return!1;let i=U(r,yC(t,void 0,void 0,e.scope));if(i===!1)throw new g(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new g(`The operator ${r.name}, which equals ${I(i)},\ncannot be used as a ${n}`);return!0},rC=(e,t,n,r,i)=>{if(e.specification===void 0){let n=(e,n)=>{if(e!==void 0)return XS(n,e,t),GS(e)};return{init:n(e.init,`initial predicate`),next:n(e.next,`next state action`),scope:void 0,temporals:[],isPropertyFairness:!1}}if(e.init!==void 0||e.next!==void 0)throw new g(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let a=[],o=[],s=[],c=t.constants.has(e.specification)?t.constants.get(e.specification):YS(e.specification,qS(`name`,e.specification,t),t);if(c!==void 0)throw new g(`The value of ${e.specification} is equal to ${I(c)}`);let l=qS(`name`,e.specification,t),u=e.properties.length===1?e.properties[0]:void 0,d=!1;Qx(l.body,void 0,t,!1).forEach(e=>{let c=e.expression;if(nC(e,t,`spec`))return;let l=c.kind===`Identifier`&&!k(c)?t.variableIndex.get(c.name):void 0;if(c.kind===`Identifier`&&l!==void 0){let e=n[l].range;throw new g(`The operator ${c.name}, which equals ${e?Fh(e):c.name},\ncannot be used as a spec`)}if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw y(new g(`TLC does not support temporal existential, nor universal, quantification over state variables.`),b.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){let n=TS(c.expression.subscript,e.scope,t);if(n===void 0&&i?.({kind:`warning`,code:St.subscriptUndetermined,text:`TLC could not determine if the subscript of the next-state relation contains
|
|
1789
|
+
all state variables. Proceed with fingers crossed.`}),r().filter(e=>n!==void 0&&!n.includes(e)).forEach(e=>i?.({kind:`warning`,code:St.subscriptMissingVariable,text:`The subscript of the next-state relation specified by the specification\ndoes not seem to contain the state variable ${e}`})),o.length>0)throw new g(`The specification contains more than one conjunct of the form [][Next]_v,
|
|
1790
|
+
but TLC can handle only specifications with one next-state relation.`);o.push({expression:c.expression.action,scope:e.scope});return}if(c.kind===`Always`&&c.expression.kind!==`Let`&&c.expression.kind!==`Label`&&Xx(c.expression,e.scope,t)<2)throw y(new _(`TLC cannot handle the temporal formula ${V(c.expression)}`),b.error);let f=Xx(c,e.scope,t);if(f===3)u!==void 0&&e.path.includes(u)||(d=!0),s.push(e);else{if(f===2)throw new g(`TLC cannot handle this conjunct of the spec:\n${V(c)}`);a.push(e)}});let f=[...a,...o],p=e=>`$specification${e}`,m=f.reduce((e,t,n)=>t.scope===void 0?e:{name:p(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),h=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:p(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:a.length===0?void 0:{kind:`And`,operands:a.map(h),location:WS},next:o.length===0?void 0:h(o[0],a.length),scope:m,temporals:s,isPropertyFairness:s.length>0&&!d}},iC=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=ZS(`property`,e,t);if(!i)return;Xx(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;Qx(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(nC(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&Xx(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!k(e)?og(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=Xx(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2){let e=V(i),t=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,n=i.kind===`BoxAction`?`To check that action ${a} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${e} (compare page 90 of ${t}).`:i.kind===`AngleAction`?`To check that infinitely many ${a} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${e} (compare page 91 of ${t}).`:`To check that action ${a} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${e}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${t}).`;throw new g(`The formula ${a} at ${e} 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. ${n}`)}r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},aC=(e,t,n)=>t.flatMap(t=>ZS(e,t,n)?[{name:t,expression:GS(t),scope:void 0}]:[]),oC=(e,t)=>{let n=og(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},sC=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new g(`_POSSIBLE lists ${n} more than once`);XS(`possible`,n,t);let i=GS(n);if(Xx(i,void 0,t)===3)throw new g(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),cC=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||k(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},lC=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=og(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},uC=(e,t)=>e.flatMap(e=>tC(e.expression,t).map(n=>{let r=e.scope===void 0?Qu(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:cC(n,r,t),predicate:lC(e.expression,t)}})),dC=(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},fC=/[\u0100-\uffff]/,pC=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),mC=e=>e.kind===`String`?fC.test(e.value):e.kind===`Set`&&e.elements.some(mC),hC=e=>e.kind===`String`&&fC.test(e.value)||e.kind===`Apply`&&pC.has(e.operator)||gt(e).some(hC),gC=(e,t)=>e.constants.some(e=>mC(e.value)||(e.args??[]).some(mC))||[...t.definitions.values()].some(e=>hC(e.body)||e.kind===`Function`&&e.bounds.some(e=>hC(e.set))),_C=e=>{if(!ln(e))return;let t=_n(F(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},vC=(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`},yC=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),bC=(e,t,n)=>tg(U(e,t),n),xC=(e,t,n=CC)=>{let r=U(e,t);if(typeof r!=`boolean`)throw new _(n(e,t.environment));return r},SC=(e,t,n)=>{let r=t.kind===`Identifier`?og(t.name,n):void 0,i=r?.kind===`Operator`?r.body:t,a=r?.kind===`Operator`?r.bodyRange:void 0;return`TLC expected a ${e} value, but did not find one. ${a&&i.kind!==`Number`?Fh(a):Rh(i)}`},CC=(e,t)=>SC(`boolean`,e,t),wC=(e,t)=>xC(e.expression,t,(n,r)=>(xC(e.predicate,t),CC(n,r))),TC=()=>{},EC=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=bC(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),DC=(e,t)=>{try{return e(yC(t,void 0,void 0))?void 0:{message:void 0}}catch(e){if(e instanceof _)return{message:e.message};throw e}},OC=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=DC(e=>ag(U(n.expression,e),n.expression),t);if(e)return{name:Rh(n.expression),trace:[],message:e.message}}},kC=e=>{let t=typeof e.config==`string`?ht(e.config,e.version):e.config,n=Gb(e.source,e.loadModule);On(n.getStringOrder(t)),Nn(e),lo(e.fingerprintPolynomial??0);let r=sx(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});$S(r,t,e.onProgress);let i=r.environment;return i.runtime.getSpecification=()=>jS(t,i,r.variableLocations,r.instanceActions),{config:t,specification:r,environment:i,search:MC(t,i,r.variableLocations,()=>n.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators)}},AC=(e,t,n)=>{let r=OC(e,t);if(!r)return;if(r.message===void 0){let e=`Assumption ${r.name} is false.`;return n(St.assumptionFalse,e,e),b.assumptionViolation}let i=`Evaluating assumption ${r.name} failed.\n${r.message}`;return n(St.assumptionEvaluationError,i,Ft(St.assumptionEvaluationError,i,!0)),b.assumptionViolation},jC=e=>y(new _(`${i}Could not find operator: ${e.operator} in module: ${e.module}`),b.error),MC=(e,t,n,r,a,o=[])=>{let s=e=>o.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw jC(e);return{name:e.operator,key:e.key}}),c=eC(e.invariants,t),l=rC(e,t,n,r,a),u=iC(e,t,a),d=e.properties[0],f=d&&og(d,t)?.location.range,p=e.specification,m=p&&og(p,t)?.location.range;l.isPropertyFairness&&f&&m&&a?.({kind:`warning`,code:St.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${d} at ${Fh(f)} equals\nthe fairness constraints of the behavior specification ${p} at ${Fh(m)}.\nTherefore, checking whether ${p} => ${d} using TLC will never result in a violation of ${d}.`});let h=uC([...c,...u.invariants],t),ee=[...new Map(h.map(e=>[e.predicate,e])).values()],te=h.length>0||u.actionProperties.length>0||u.liveness.length>0;if(l.init===void 0&&(te||u.initialPredicates.length>0||t.variables.length>0))throw new g(t.runtime.version===`1.7.4`?Dt:`The configuration file did not specify the initial state predicate.`);if(l.next===void 0&&te)throw new g(`The configuration file did not specify the next state predicate.`);let ne=aC(`constraint`,[...e.constraints,...s(`constraint`).map(e=>e.name)],t),v=uC(ne,t),re=aC(`action constraint`,e.actionConstraints,t),ie=t.coverage,ae=(e,n,r=!0)=>n.flatMap(n=>{if(!ie)return[];let i=r?lC(n.expression,t):n.expression,a=Co(r?n.name:void 0,i,t),o=xo(ie,e,a,i,n.scope);return[{expression:i,scope:n.scope,node:o}]}),oe=[...ae(`invariant`,c),...ae(`invariant`,u.invariants,!1)],se=ae(`constraint`,re),ce=ae(`constraint`,ne),le=ae(`implied`,u.initialPredicates,!1),ue=ae(`implied`,u.actionProperties.map(e=>({...e,expression:e.box})),!1),de=(e,n,r,i)=>{try{return Io(e,n.node,()=>U(n.expression,yC(t,r,i,n.scope)))}catch{return}},x=(e,t,n)=>ie!==void 0&&e.every(e=>de(ie,e,t,n)===!0),S=(e,t,n)=>{if(ie){for(let r of e){let e=de(ie,r,t,n);if(typeof e!=`boolean`)return;if(!e)return ie.primary[r.node]++,!1;ie.secondary[r.node]++}return!0}};e.rlReward!==void 0&&qS(`rlreward`,e.rlReward,t),e.periodic!==void 0&&qS(`periodic`,e.periodic,t);let C=sC(e.possible,t);if(t.variables.length===0)return;let w=e.symmetry===void 0?void 0:zS(e.symmetry,t,e.substitutions),fe=e.view===void 0?void 0:XS(`view function`,e.view,t),pe=e.view??s(`view`)[0]?.name,me=pe===void 0?void 0:{name:pe,expression:GS(pe),scope:void 0},he=u.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:WS};return{...e,unchanged:t}}),ge=e=>Xx(e.expression,void 0,t)>=2,_e=C.filter(e=>!ge(e)),ve=C.filter(ge),ye=t.runtime,T,be=()=>{if(T)return T;let e=r(),n=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return T=t.variables.map((e,t)=>t).sort((e,t)=>n(e)-n(t)),T},xe=(e,n)=>U(e,yC(t,n,void 0)),Se=e=>{let t=be(),n=w===void 0?e:US(e,w,t);return mo(me===void 0?t.map(e=>n[e]):[xe(me.expression,n)])},Ce=/* @__PURE__ */ new WeakSet,E=(e,n,r)=>{let i=r&&!Ce.has(r)?r:void 0;if(dC(e,n,i))return!1;try{let r=yC(t,n,void 0,e.scope),a=e.membership;return i&&a?!ea(n[a.variable],i[a.variable],U(a.set,r)):!wC(e,r)}catch(t){throw r?Vt(y(t,b.safetyEvaluationFailure),St.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},we=gC(e,t);ye.getFingerprint=Se;let Te=()=>{let e=C.find(e=>!ye.possibleCounts.get(e.name));if(!e)return;let n=oC(e.name,t),r=n?` at ${Fh(n)}`:``;return{name:e.name,code:St.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:A(I(Cf(ye),!0))}},Ee=fe?.body.kind===`Tuple`?fe.body.elements:[],De=Ee.flatMap(e=>e.kind===`Identifier`&&t.variables.includes(e.name)?[e.name]:[]),Oe=fe?.body.kind===`Tuple`&&De.length===Ee.length&&new Set(De).size===De.length,ke=(e,n)=>Oe?be().filter(e=>De.includes(t.variables[e])).map(e=>`/\\ ${t.variables[e]} = ${A(I(n[e]))}\n`).join(``):A(I(xe(e,n))),Ae=(e,n,r)=>xC(e.expression,yC(t,n,r),e=>`${i}${CC(e,t)}`),je=e=>{let n=Object.fromEntries(be().map(n=>[t.variables[n],e[n]]));return me===void 0?n:Fn(n,()=>ke(me.expression,e))};return{properties:u,spec:l,toRecord:je,evaluateAlias:(e,n,r,i)=>{try{XS(`alias`,e,t);let i=U(GS(e),yC(t,n,r)),a=_C(i);return a===void 0?je(n):Ln(a,e)}catch(e){if(!(e instanceof g||e instanceof _))throw e;return{...je(n),_ALIASEvalError:It(e.message,i)}}},isSymmetric:w!==void 0,isConstrained:v.length>0||re.length>0,getTlcOrder:be,getStoredFingerprints:(e,t)=>me!==void 0||we?BigInt64Array.from(e,Se):ho(t,be()),getFingerprintState:e=>{if(we)return[String(Se(e))];let t=w===void 0?e:US(e,w,be());return me===void 0?t:[xe(me.expression,t)]},findViolatedInvariant:(e,t)=>{if(x(oe,e))return;let n=h.find(n=>E(n,e,t));return n&&Ce.add(e),n},getViolatedInvariants:e=>{let t=ee.filter(t=>h.some(n=>n.predicate===t.predicate&&E(n,e,void 0)));return t.length>0&&Ce.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>xC(n,yC(t,e,void 0,r));v.every(e=>r(e.predicate,e.scope))&&n();let i=ee.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)=>(!(!(v.every(e=>xC(e.predicate,yC(n,t,void 0,e.scope)))&&re.every(r=>xC(r.expression,yC(n,e,t,r.scope))))||r())||ee.every(e=>xC(e.predicate,yC(n,t,void 0,e.scope))))&&he.every(r=>xC(r.box,yC(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>S(ce,e)??v.every(r=>dC(r,e,n)||wC(r,yC(t,e,void 0))),findFailedInitialPredicate:e=>x(le,e)?void 0:u.initialPredicates.find(n=>!xC(n.expression,yC(t,e,void 0,n.scope))),findViolatedActionProperty:(e,n)=>x(ue,e,n)?void 0:he.find(r=>{try{return!xC(r.action,yC(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${V(r.box)}`)&&!bC(r.unchanged,yC(t,e,n,r.scope),`a subscript`)}catch(e){throw Vt(NC(e),St.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>S(se,e,t)??re.every(n=>Ae(n,e,t)),getExcludingConstraints:(e,n)=>[...v.filter(e=>!wC(e,yC(t,n,void 0))),...re.filter(t=>!Ae(t,e,n))].map(e=>{let n=oC(e.name,t);return n?Fh(n):e.name}),trackStatePossible:_e.length===0?TC:e=>EC(_e,ye,yC(t,e,void 0)),trackActionPossible:ve.length===0?TC:(e,n)=>EC(ve,ye,yC(t,e,n)),findUnwitnessedPossible:Te,getReward:(n,r,i)=>{if(e.rlReward===void 0)return i;let a=GS(e.rlReward),o=U(a,yC(t,n,r));if(typeof o!=`number`)throw new _(SC(`integer`,a,t));return o},findPostconditionViolation:(n=!1)=>{let r=s(`postcondition`),i=e.postconditions.map(e=>{let n=og(e,t);return n?n.kind===`Operator`&&n.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!JS(n)&&Pg(n,t)!==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(i!==void 0){if(n)return;throw y(new _(i),b.configParseError)}let a=(e,n)=>{let r=DC(e=>xC(GS(n),e),t);if(!r)return;let i=og(n,t)?.body,a=oC(n,t),o=a?` at ${i?.kind===`Number`?Rh(i):Fh(a)}`:``;return r.message===void 0?{name:e,code:St.postconditionFalse,message:`Postcondition ${e}${o} is false.`}:{name:e,code:St.postconditionFailed,message:`Evaluating postcondition ${e}${o} failed.\n${r.message}`}};for(let e of r){let t=a(e.name,e.key);if(t)return t}let o=Te();if(o)return o;for(let t of e.postconditions){let e=a(t,t);if(e)return e}}}},NC=e=>e instanceof c?y(e,e.exitCode):e,PC=(e,t)=>e*((t-e)/2**64),FC=e=>e.includes(`.`)?e:`${e}.0`,IC=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return FC(String(e));let[n,r]=e.toExponential().split(`e`);return`${FC(n)}E${r.replace(`+`,``)}`},LC=e=>e!==void 0&&e>=`0`&&e<=`9`,RC=e=>{if(e===0)return`0.0`;let t=IC(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;LC(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(;LC(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;LC(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(LC(t[n.next])&&Number(t[n.next])>=5&&(n.result=zC(n.result));LC(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},zC=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${zC(r)}.`:n===`9`?`${zC(r)}0`:`${r}${Number(n)+1}`},BC=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}`)},VC=(e,t,n)=>{if(PC(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},HC=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}).`},UC=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},WC=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^wa(e[t]),16777619),r=Math.imul(r^Aa(e[t]),1540483477);t[0]=UC(n)||1,t[1]=UC(r)},GC=()=>{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)}}},KC=(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}},qC=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),JC=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return KC(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},YC=e=>Atomics.load(e.used,0)*2>=e.slots.length,XC=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&KC(t,n);return{slots:t,used:e.used}},ZC=[void 0,`lambda`,`tuple`,`record`],QC=()=>{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=da(e.domain);return t?(a(7),a(ZC.indexOf(ir(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(ZC.indexOf(ir(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})}},$C=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 Zn(t.strings[n[r++]]);if(e===5)return $n(i(n[r++]));let a=ZC[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=ui({kind:`Interval`,low:e,high:e+t-1});return rr(tr(o,i(t)),a)}let o=n[r++],s=i(o);return rr(tr(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Eh as $,gt as $t,tS as A,Sa as At,nb as B,St as Bt,kS as C,ha as Ct,jS as D,qa as Dt,DS as E,pi as Et,Ux as F,wa as Ft,p_ as G,zt as Gt,sb as H,Et as Ht,yx as I,mr as It,og as J,Zt as Jt,V as K,Rt as Kt,Bx as L,dr as Lt,eS as M,Qn as Mt,mx as N,tn as Nt,oS as O,I as Ot,$ as P,An as Pt,Dh as Q,Jt as Qt,sx as R,On as Rt,NC as S,lo as St,ES as T,Zn as Tt,ob as U,Ft as Ut,ib as V,Ct as Vt,Cy as W,It as Wt,a_ as X,Nt as Xt,o_ as Y,qt as Yt,Th as Z,Ht as Zt,vC as _,zo as _t,XC as a,Tm as at,QS as b,Zo as bt,WC as c,ap as ct,VC as d,Of as dt,ht as en,kh as et,PC as f,Zd as ft,OC as g,Mo as gt,MC as h,xo as ht,qC as i,Ae as in,wm as it,nS as j,Ca as jt,Wx as k,kn as kt,RC as l,Xf as lt,jC as m,tc as mt,QC as n,Je as nn,Em as nt,JC as o,ip as ot,HC as p,tf as pt,Fh as q,Mt as qt,GC as r,Te as rn,Cm as rt,YC as s,rp as st,$C as t,rt as tn,Oh as tt,BC as u,Tf as ut,kC as v,vo as vt,AS as w,_r as wt,$S as x,mo as xt,AC as y,Co as yt,Gb as z,Nn as zt};
|