tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.fdc173479
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -1
- package/dist/compile.cjs +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +41 -37
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +21 -4
- package/dist/index.d.ts +21 -4
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2681 -425
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +41 -42
- package/dist/run.js +41 -42
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +97 -89
- package/dist/transfer.js +97 -89
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +72 -39
- package/src/bags.ts +50 -29
- package/src/builtins.ts +8 -16
- package/src/check-failure.ts +118 -0
- package/src/check-trace.ts +321 -0
- package/src/check.ts +828 -770
- package/src/cli/options.ts +6 -31
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +224 -212
- package/src/cli/tlc-output.ts +701 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +65 -712
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +28 -20
- package/src/coverage.ts +255 -20
- package/src/dependencies.ts +96 -27
- package/src/dfid.ts +115 -50
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +175 -373
- package/src/errors.ts +40 -5
- package/src/evaluate.ts +429 -139
- package/src/exit-codes.ts +28 -12
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +178 -17
- package/src/java-hash.ts +14 -0
- package/src/java-overrides.ts +2 -2
- package/src/json.ts +4 -7
- package/src/levels.ts +708 -272
- package/src/lexer.ts +17 -5
- package/src/liveness-checker.ts +707 -249
- package/src/liveness.ts +148 -95
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +39 -9
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +27 -18
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +48 -18
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +120 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +17 -31
- package/src/parallel.ts +29 -47
- package/src/parser.ts +757 -326
- package/src/pretty-print.ts +1 -1
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +1 -3
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +19 -30
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +9 -20
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +3 -5
- package/src/prover/isabelle/pure/thm.ts +14 -13
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/md5.ts +26 -29
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1016 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +624 -9
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +319 -0
- package/src/prover/smt/solver/asserted-formulas.ts +240 -56
- package/src/prover/smt/solver/ast-lt.ts +165 -11
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1483 -45
- package/src/prover/smt/solver/auf-solver.ts +25 -18
- package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +598 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +127 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +598 -128
- package/src/prover/smt/solver/ctx-simplify.ts +29 -14
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +207 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +298 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- package/src/prover/smt/solver/elim-bounds.ts +89 -0
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +227 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +901 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1046 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +328 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +734 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +886 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +178 -15
- package/src/prover/smt/solver/goal2nlsat.ts +216 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +34 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +111 -39
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +355 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +30 -11
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +41 -5
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +68 -17
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -290
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +310 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +106 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +19 -28
- package/src/prover/smt/solver/model-evaluator.ts +190 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +104 -35
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +709 -0
- package/src/prover/smt/solver/mus.ts +50 -0
- package/src/prover/smt/solver/muz/dl-context.ts +382 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +485 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
- package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +427 -229
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
- package/src/prover/smt/solver/nlsat/solver.ts +293 -92
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
- package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +110 -24
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +801 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +301 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +312 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
- package/src/prover/smt/solver/poly-rewriter.ts +259 -57
- package/src/prover/smt/solver/probes.ts +577 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +634 -0
- package/src/prover/smt/solver/push-app-ite.ts +37 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +39 -19
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1499 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +829 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +22 -25
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +82 -14
- package/src/prover/smt/solver/rewriter.ts +505 -60
- package/src/prover/smt/solver/rlimit.ts +45 -5
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +589 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +190 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2107 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +995 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
- package/src/prover/smt/solver/seq-skolem.ts +294 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +124 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +589 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
- package/src/prover/smt/solver/smtlib-script.ts +2136 -0
- package/src/prover/smt/solver/solve-eqs.ts +928 -0
- package/src/prover/smt/solver/solver.ts +128 -23
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +2176 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1210 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +57 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
- package/src/prover/smt/solver/theory-lra-state.ts +7 -23
- package/src/prover/smt/solver/theory-lra.ts +189 -2
- package/src/prover/smt/solver/theory-pb.ts +951 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +852 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory-without-terms.ts +24 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +495 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +57 -26
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +28 -2
- package/src/prover/zenon/index-table.ts +16 -23
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +37 -39
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- package/src/prover/zenon/phrase.ts +1 -3
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/resolve.ts +1327 -328
- package/src/runtime.ts +25 -2
- package/src/sany/builtins.ts +10 -10
- package/src/sany/generation.ts +384 -0
- package/src/sany/generator-def-entries.ts +297 -0
- package/src/sany/generator-definitions.ts +688 -0
- package/src/sany/generator-expressions.ts +1123 -0
- package/src/sany/generator-proofs.ts +668 -0
- package/src/sany/generator.ts +161 -2625
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +32 -23
- package/src/sany/linter.ts +0 -2
- package/src/sany/modules.ts +4 -2
- package/src/sany/nodes.ts +3 -4
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +46 -44
- package/src/sany/xml.ts +25 -58
- package/src/search.ts +513 -165
- package/src/simulate.ts +340 -251
- package/src/spec-description.ts +48 -55
- package/src/standard-definitions.ts +5 -0
- package/src/standard-modules.ts +72 -54
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +564 -138
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +56 -28
- package/src/symmetry.ts +4 -3
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +10 -0
- package/src/tlc/messages.ts +23 -18
- package/src/tlc/order.ts +14 -3
- package/src/tlc/random.ts +6 -5
- package/src/tlc/replay.ts +152 -58
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +12 -11
- package/src/tlc/tlcext-operators.ts +87 -26
- package/src/tlc/trace-spec.ts +27 -60
- package/src/trace-liveness.ts +529 -0
- package/src/typed-tier.ts +6556 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +208 -227
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
package/dist/transfer.cjs
CHANGED
|
@@ -6,85 +6,17 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
const e=require("./worker.cjs");let t=require("node:zlib");const n
|
|
10
|
-
`,t:` `,r:`\r`,f:`\f`},re=(e,t)=>t===9?e+8-e%8:e+1,b=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),ie=(e,t)=>{if(e.charCodeAt(t)!==92)return 0;let n=b.get(e.charAt(t+1).toLowerCase());if(n===void 0)return 0;let r=f(e,t+2,n);return r===t+2?0:r-t},ae=(t,r=!1)=>{let i=l.exec(t);if(!i)throw new e.F(`Expected a module header such as ---- MODULE Name ----`);let a=[],o=/* @__PURE__ */ new Map,s=t.slice(0,i.index).split(`
|
|
11
|
-
`),c=i.index,u=s.length,p=i.index-s[s.length-1].length,m=0,h=-1,ee=0,ne=0,b=()=>{for((h!==p||ee>c)&&(h=p,ee=p,ne=0);ee<c;ee++)ne=re(ne,t.charCodeAt(ee));return re(ne,t.charCodeAt(c))},ae=(e,t,n,r)=>{let i=b();a.push({kind:e,text:t,spelling:r,line:u,column:i,endColumn:i+n-1}),c+=n},oe=e=>{for(let n=0;n<e;n++)t.charCodeAt(c)===10&&(u++,p=c+1),c++},se=n=>new e.F(`${n} at line ${u}, column ${b()}`,void 0,{reason:n,line:u,column:b(),isEnd:c>=t.length});for(;c<t.length;){let e=t.charCodeAt(c);if(e===10||e===32||e===9||e===13){oe(1);continue}if(e===92&&t.charCodeAt(c+1)===42){oe(te(t,c,e=>e!==`
|
|
12
|
-
`&&e!==`\r`)-c);continue}if(e===40&&t.charCodeAt(c+1)===42){let e=0;do{if(c>=t.length)throw se(`Unterminated comment`);t.startsWith(`(*`,c)?(e++,oe(2)):t.startsWith(`*)`,c)?(e--,oe(2)):oe(1)}while(e>0);continue}if(e===45&&t.startsWith(`----`,c)){let e=te(t,c,e=>e===`-`)-c,n=te(t,c+e,e=>e===` `);t.startsWith(`MODULE`,n)&&m++,ae(`Separator`,`----`,e);continue}if(e===61&&t.startsWith(`====`,c)){if(ae(`ModuleEnd`,`====`,te(t,c,e=>e===`=`)-c),m--,m<=0)break;continue}if(e===34){let e=u,n=b(),r=[];for(oe(1);t.charCodeAt(c)!==34;){let e=t.charCodeAt(c);if(c>=t.length||e===10||e===13)throw se(`Unterminated string`);if(e===92){let e=t[c+1];if(e===void 0||!`ntrf\\"`.includes(e))throw se(`Invalid escape in string`);r.push(y[e]??e),oe(2)}else r.push(t[c]),oe(1)}oe(1),a.push({kind:`String`,text:r.join(``),line:e,column:n,endColumn:b()-1});continue}let i=ie(t,c);if(i>0){ae(`Number`,t.slice(c,c+i),i);continue}if(d(e,7)){let r=f(t,c,7),i=t.slice(c,r),a=f(t,c,1);if(a===r){let e=t.charCodeAt(r)===46?f(t,r+1,1):r,n=e>r+1,a=n?t.slice(c,e):i;ae(n?`Decimal`:`Number`,a,a.length);continue}if(!/[A-Za-z]/.test(i)){let n=e===95?`_`:t.slice(c,a);ae(n===`_`?`Operator`:`Number`,n,n.length);continue}if(i.startsWith(`WF_`)||i.startsWith(`SF_`)){ae(`Keyword`,i.slice(0,3),3);continue}let s=o.get(i)??i;o.set(s,s),ae(n.has(i)?`Keyword`:`Identifier`,s,i.length);continue}let s=t[c];if(e>=128&&_.has(s)){ae(`Identifier`,o.get(s)??s,1),o.set(s,s);continue}if(e===60){let e=v(t,c,r);if(e>0){ae(`Step`,t.slice(c,c+e),e);continue}}let l=g(t,c);if(l){let e=t.slice(c,c+l.length);ae(`Operator`,l.text,l.length,e===l.text?void 0:e)}else throw se(`Unexpected character ${JSON.stringify(s)}`)}let ce=b();return a.push({kind:`End`,text:``,line:u,column:ce,endColumn:ce}),a},oe=[[`EOF`],[`BEGIN_PRAGMA`,`--->`],[`_BM1`],[`NUMBER`],[`_BM2`],[`_BM0`],[`SEPARATOR`],[`END_MODULE`],[`ACTION`,`ACTION`,`ACTIONS`],[`ASSUME`,`ASSUME`],[`BOXASSUME`,`[]ASSUME`],[`ASSUMPTION`,`ASSUMPTION`,`AXIOM`],[`CASE`,`CASE`],[`CHOOSE`,`CHOOSE`],[`CONSTANT`,`CONSTANT`,`CONSTANTS`],[`ELSE`,`ELSE`],[`EXCEPT`,`EXCEPT`],[`EXISTS`,`\\E`,`\\exists`,`∃`],[`EXTENDS`,`EXTENDS`],[`FORALL`,`\\A`,`\\forall`,`∀`],[`IF`,`IF`],[`INSTANCE`,`INSTANCE`],[`LET`,`LET`],[`LETIN`,`IN`],[`LOCAL`,`LOCAL`],[`MODULE`,`MODULE`],[`NEW`,`NEW`],[`OTHER`,`OTHER`],[`PROPOSITION`,`PROPOSITION`,`LEMMA`,`COROLLARY`],[`SF`,`SF_`],[`T_EXISTS`,`\\EE`],[`T_FORALL`,`\\AA`],[`THEN`,`THEN`],[`BY`,`BY`],[`ONLY`,`ONLY`],[`DEFINE`,`DEFINE`],[`DF`,`DEF`,`DEFS`],[`THEOREM`,`THEOREM`],[`USE`,`USE`],[`HIDE`,`HIDE`],[`HAVE`,`HAVE`],[`OBVIOUS`,`OBVIOUS`],[`OMITTED`,`OMITTED`],[`LAMBDA`,`LAMBDA`],[`TAKE`,`TAKE`],[`PROOF`,`PROOF`],[`PROVE`,`PROVE`],[`BOXPROVE`,`[]PROVE`],[`QED`,`QED`],[`RECURSIVE`,`RECURSIVE`],[`STATE`,`STATE`],[`TEMPORAL`,`TEMPORAL`,`TEMPORALS`],[`PICK`,`PICK`],[`WITNESS`,`WITNESS`],[`SUFFICES`,`SUFFICES`],[`VARIABLE`,`VARIABLE`,`VARIABLES`],[`WF`,`WF_`],[`WITH`,`WITH`],[`COMMA`,`,`],[`COLON`,`:`],[`COLONCOLON`,`::`,`∷`],[`DOT`,`.`],[`US`,`_`],[`DEF`,`==`,`≜`],[`LBR`,`(`],[`RBR`,`)`],[`DEFBREAK`,`-|-`],[`LSB`,`[`],[`ARSB`,`]_`],[`RSB`,`]`],[`LBC`,`{`],[`RBC`,`}`],[`LAB`,`<<`,`⟨`],[`ARAB`,`>>_`,`⟩_`],[`RAB`,`>>`,`⟩`],[`BANG`,`!`],[`ARROW`,`->`,`→`],[`SUBSTITUTE`,`<-`,`←`],[`MAPTO`,`|->`,`↦`],[`NUMBER_LITERAL`],[`STRING_LITERAL`],[`BAND`],[`BOR`],[`op_57`,`'`],[`op_68`,`^+`,`⁺`],[`op_69`,`^*`],[`op_70`,`^#`],[`op_76`,`-.`],[`op_26`,`\\lnot`,`¬`],[`op_29`,`\\neg`],[`op_58`,`~`],[`CASESEP`,`[]`,`□`],[`op_61`,`<>`,`◇`],[`op_112`,`ENABLED`],[`op_113`,`UNCHANGED`],[`op_114`,`SUBSET`],[`op_115`,`UNION`],[`op_116`,`DOMAIN`],[`op_1`,`//`],[`AND`,`/\\`,`∧`],[`op_3`,`/=`],[`op_4`,`/`],[`OR`,`\\/`,`∨`],...[`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`].map(e=>[`infix`,e]),[`IN`,`\\in`,`∈`],...(/* @__PURE__ */ `\\intersect.\\union.\\land.\\leq.\\ll.\\lor.\\o.\\odot.\\ominus.\\oplus.\\oslash.\\otimes.\\prec.\\preceq.\\propto.\\sim.\\simeq.\\sqcap.\\sqcup.\\sqsubset.\\sqsupset.\\sqsubseteq.\\sqsupseteq.\\star.\\subset.\\subseteq.\\succ.\\succeq.\\supset.\\supseteq.\\uplus.\\wr.\\.~>.=>.=<.=|`.split(`.`)).map(e=>[`infix`,e]),[`EQUALS`,`=`],...[`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`].map(e=>[`infix`,e]),[`op_77`,`-`],...[`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`].map(e=>[`infix`,e]),[`op_119`,`\\X`],[`IDENTIFIER`],[`ProofStepLexeme`],[`ProofImplicitStepLexeme`],[`ProofStepDotLexeme`],[`BareLevelLexeme`],[`UnnumberedStepLexeme`]],se=oe.map(e=>e[0]),ce=new Map(se.map((e,t)=>[e,t]).reverse()),x=t=>{let n=ce.get(t);if(n===void 0)throw new e.y(`Unknown SANY token kind ${t}`);return n},le=new Map(oe.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),S=Math.max(...[...le.keys()].map(e=>e.length)),ue=Array.from({length:S},(e,t)=>S-t),de=/----+ *MODULE/y,fe=[/_\w*[A-Za-z]\w*/y,/[0-9]\w*[A-Za-z]\w*/y,/[WS](?:[a-zA-EG-Z_0-9]\w*)?/y,/[WS]F(?:[A-Za-z0-9]\w*)?/y,/[a-zA-RT-VX-Z]\w*/y,/@|ℕ|ℤ|ℝ/y],C=e=>[/[0-9][A-Za-z0-9]*/,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*/,/[a-zA-RT-VX-Z][A-Za-z0-9]*/].map(t=>RegExp(`${t.source}${e}`,`y`)),w=C(String.raw`\.\/\\`),T=C(String.raw`\.\\\/`),E=String.raw`<(?:[0-9]+|\+|\*)>`,pe=[[`_BM0`,[de]],[`SEPARATOR`,[/----+/y]],[`END_MODULE`,[/====+/y]],[`NUMBER_LITERAL`,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[`STRING_LITERAL`,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[`BAND`,w],[`BOR`,T],[`IDENTIFIER`,fe],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${E}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(E,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${E}(?:\*\.*|-\.*|\.+)`,`y`)]]],me=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[de]]],he=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[de]],[`BAND`,w],[`BOR`,T],[`IDENTIFIER`,fe]],ge=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),_e=(e,t,n)=>e.map(([e,r])=>({kind:x(e),length:Math.max(...r.map(e=>ge(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),ve=(e,t)=>{let n=ue.find(n=>le.has(e.slice(t,t+n))),r=_e(pe,e,t);if(n===void 0)return r;let i={kind:le.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},ye=e=>e+8-e%8,D=e=>{let t=[],n=[],r=1,i=0,a=!1,o=!1;for(let s of e)for(let e=0;e<s.length;e++)i++,o?(o=!1,r++,i=1):a&&(a=!1,s===`
|
|
9
|
+
const e=require("./worker.cjs");let t=require("node:zlib");const n=[[`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`]],r=n.map(e=>e[0]),i=new Map(r.map((e,t)=>[e,t]).reverse()),a=t=>{let n=i.get(t);if(n===void 0)throw new e.b(`Unknown SANY token kind ${t}`);return n},o=new Map(n.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),s=Math.max(...[...o.keys()].map(e=>e.length)),c=Array.from({length:s},(e,t)=>s-t),l=/----+ *MODULE/y,u=[/_\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],d=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`)),f=d(String.raw`\.\/\\`),p=d(String.raw`\.\\\/`),m=String.raw`<(?:[0-9]+|\+|\*)>`,h=[[`_BM0`,[l]],[`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`,f],[`BOR`,p],[`IDENTIFIER`,u],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${m}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(m,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${m}(?:\*\.*|-\.*|\.+)`,`y`)]]],g=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[l]]],_=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[l]],[`BAND`,f],[`BOR`,p],[`IDENTIFIER`,u]],v=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),ee=(e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,y=(e,t,n)=>e.map(e=>({kind:a(e[0]),length:Math.max(...e[1].map(e=>v(e,t,n)))})).reduce(ee,{kind:-1,length:0}),b=(e,t)=>{let n=c.find(n=>o.has(e.slice(t,t+n))),r=y(h,e,t);return n===void 0?r:ee(r,{kind:o.get(e.slice(t,t+n))??-1,length:n})},x=e=>e+8-e%8,te=e=>{let t=[],n=[],r=1,i=0,a=!1,o=!1;for(let s of e)for(let e=0;e<s.length;e++)i++,o?(o=!1,r++,i=1):a&&(a=!1,s===`
|
|
13
10
|
`?o=!0:(r++,i=1)),s===`\r`?a=!0:s===`
|
|
14
|
-
`?o=!0:s===` `&&(i=
|
|
15
|
-
`||e[a]===`\r`?
|
|
16
|
-
\r`.includes(e[t]))n++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=
|
|
17
|
-
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),
|
|
11
|
+
`?o=!0:s===` `&&(i=x(i-1)),t.push(r),n.push(i);return{lines:t,columns:n}},S=e=>{let t=te(e);return{line:t.lines[e.length-1]??0,column:t.columns[e.length-1]??0}},ne=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,re=new Set([...o.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),ie=(e,t)=>{let n=0;for(;re.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,v(ne,e,t)))},ae=e=>{let t=te(e),n=0,i=`DEFAULT`,o=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),s=()=>o(a(`EOF`),e.length-1,0),c=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?w(o,s,e[a],i):t.lines[n]===o?e[a]===`
|
|
12
|
+
`||e[a]===`\r`?w(o+1,0,void 0,i):w(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},l=()=>{let t=n;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return c(t,e.length,``);n+=r+1;return}let r=0,i=t,a=t;for(;a<e.length;)if(e.startsWith(`(*`,a))r++,a+=2,r>1&&(i=a);else if(e.startsWith(`*)`,a)){if(r--,a+=2,i=a,r===0){n=a;return}}else a++;return n=a,i===e.length?void 0:c(i,a,``)},u=t=>{for(;n<e.length;){let a=y(t,e,n);if(a.length>0){let e=o(a.kind,n,a.length);return n+=a.length,r[a.kind].startsWith(`_BM`)&&(i=`SPEC`),r[a.kind]===`BEGIN_PRAGMA`&&(i=`PRAGMA`),e}n++}return s()};return()=>{if(i===`DEFAULT`)return u(g);if(i===`PRAGMA`)return u(_);for(;n<e.length;){let t=n;if(`
|
|
13
|
+
\r`.includes(e[t]))n++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=l();if(e!==void 0)return e}else{let r=b(e,t);if(r.length===0){let n=ie(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),a=r<e.length?n:i.length>1?i:``;return c(t,r,a)}let i=o(r.kind,t,r.length);return n+=r.length,i}}return s()}},C=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
|
|
14
|
+
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),oe=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>C.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),w=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${oe(n)}" (${n.charCodeAt(0)}), `}after : "${oe(r)}"`,se=e=>{let t=ae(e);for(let e=t();typeof e!=`string`&&e.kind!==a(`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===` `?x(e):e+1,e.beginColumn);return w(e.beginLine,n,e.image[t],e.image.slice(0,t))}},ce=/* @__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(`.`)),le=/* @__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`]]),ue=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),T=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),E=/* @__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`]]),D=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),de=e=>e.startsWith(`\\`)?parseInt(e.slice(2),D.get(e[1].toLowerCase())):Number(e),O=/-{4,} *MODULE\b/,fe=/* @__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)fe[n.charCodeAt(0)]|=e});const pe=(e,t)=>e<128&&(fe[e]&t)!==0,me=(e,t,n)=>{let r=t;for(;pe(e.charCodeAt(r),n);)r++;return r},he=/* @__PURE__ */ new Map;T.forEach(e=>{let t=e.charCodeAt(0),n=he.get(t)??[];n.push(e),he.set(t,n)});const ge=(e,t)=>{let n=he.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]}},_e=(e,t)=>{if(e.charCodeAt(t)<128)return;let n=e.slice(t,t+2);if(E.has(n))return n;let r=e[t];return E.has(r)?r:void 0},ve=(e,t)=>{let n=e.charCodeAt(t);if(n===92&&pe(e.charCodeAt(t+1),2)){let n=e.slice(t+1,me(e,t+1,2)),r=n.length;for(;r>0&&!le.has(n.slice(0,r));)r--;let i=le.get(n.slice(0,r));return{text:i??`\\`,length:i===void 0?1:r+1}}let r=_e(e,t);if(r!==void 0)return{text:E.get(r)??``,length:r.length};let i=ge(e,t);return i?{text:ue.get(i)??i,length:i.length}:n===92?{text:`\\`,length:1}:void 0},k=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),ye=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>E.has(e)||k.has(e));return n===void 0?void 0:{text:n,length:n.length}},be=(e,t,n)=>{let r=t;for(;r<e.length&&n(e[r]);)r++;return r},xe=(e,t,n)=>{let r=e[t+1]===`+`||e[t+1]===`*`,i=r?t+2:me(e,t+1,1);if(i===t+1||e[i]!==`>`)return 0;let a=!r||!n,o=a?me(e,i+1,7):i+1,s=a&&o===i+1&&(e[o]===`*`||e[o]===`-`);return be(e,s?o+1:o,e=>e===`.`)-t},Se=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,Ce={n:`
|
|
15
|
+
`,t:` `,r:`\r`,f:`\f`},we=(e,t)=>t===9?e+8-e%8:e+1,Te=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),Ee=(e,t,n=!1)=>{if(e.charCodeAt(t)!==92)return 0;let r=e.charAt(t+1),i=Te.get(n?r:r.toLowerCase());if(i===void 0)return 0;let a=me(e,t+2,i);return a===t+2?0:a-t},De=(t,n=!1)=>{let r=O.exec(t);if(!r){let n=S(t),r=`Expected a module header such as ---- MODULE Name ----`;throw new e.I(`${r} at line ${n.line}, column ${n.column}`,void 0,{reason:r,line:n.line,column:n.column,isEnd:!0})}let i=[],a=/* @__PURE__ */ new Map,o=t.slice(0,r.index).split(`
|
|
16
|
+
`),s=r.index,c=o.length,l=r.index-o[o.length-1].length,u=0,d=-1,f=0,p=0,m=()=>{for((d!==l||f>s)&&(d=l,f=l,p=0);f<s;f++)p=we(p,t.charCodeAt(f));return we(p,t.charCodeAt(s))},h=(e,t,n,r)=>{let a=m();i.push({kind:e,text:t,spelling:r,line:c,column:a,endColumn:a+n-1}),s+=n},g=e=>{for(let n=0;n<e;n++)t.charCodeAt(s)===10&&(c++,l=s+1),s++},_=n=>new e.I(`${n} at line ${c}, column ${m()}`,void 0,{reason:n,line:c,column:m(),isEnd:s>=t.length});for(;s<t.length;){let e=t.charCodeAt(s);if(e===10||e===32||e===9||e===13){g(1);continue}if(e===92&&t.charCodeAt(s+1)===42){g(be(t,s,e=>e!==`
|
|
17
|
+
`&&e!==`\r`)-s);continue}if(e===40&&t.charCodeAt(s+1)===42){let e=0;do{if(s>=t.length)throw _(`Unterminated comment`);t.startsWith(`(*`,s)?(e++,g(2)):t.startsWith(`*)`,s)?(e--,g(2)):g(1)}while(e>0);continue}if(e===45&&t.startsWith(`----`,s)){let e=be(t,s,e=>e===`-`)-s,n=be(t,s+e,e=>e===` `);t.startsWith(`MODULE`,n)&&u++,h(`Separator`,`----`,e);continue}if(e===61&&t.startsWith(`====`,s)){if(h(`ModuleEnd`,`====`,be(t,s,e=>e===`=`)-s),u--,u<=0)break;continue}if(e===34){let e=c,n=m(),r=[];for(g(1);t.charCodeAt(s)!==34;){let e=t.charCodeAt(s);if(s>=t.length||e===10||e===13)throw _(`Unterminated string`);if(e===92){let e=t[s+1];if(e===void 0||!`ntrf\\"`.includes(e))throw _(`Invalid escape in string`);r.push(Ce[e]??e),g(2)}else r.push(t[s]),g(1)}g(1),i.push({kind:`String`,text:r.join(``),line:e,column:n,endColumn:m()-1});continue}let r=Ee(t,s,n);if(r>0){h(`Number`,t.slice(s,s+r),r);continue}if(pe(e,7)){let n=me(t,s,7),r=t.slice(s,n),i=me(t,s,1);if(i===n){let e=t.charCodeAt(n)===46?me(t,n+1,1):n,i=e>n+1,a=i?t.slice(s,e):r;h(i?`Decimal`:`Number`,a,a.length);continue}if(!/[A-Za-z]/.test(r)){let n=e===95?`_`:t.slice(s,i);h(n===`_`?`Operator`:`Number`,n,n.length);continue}if(r.startsWith(`WF_`)||r.startsWith(`SF_`)){h(`Keyword`,r.slice(0,3),3);continue}let o=a.get(r)??r;a.set(o,o),h(ce.has(r)?`Keyword`:`Identifier`,o,r.length);continue}let o=t[s];if(e>=128&&k.has(o)){h(`Identifier`,a.get(o)??o,1),a.set(o,o);continue}if(e===60){let e=xe(t,s,n);if(e>0){h(`Step`,t.slice(s,s+e),e);continue}}let l=ve(t,s);if(l){let e=t.slice(s,s+l.length);h(`Operator`,l.text,l.length,e===l.text?void 0:e)}else throw _(`Unexpected character ${JSON.stringify(o)}`)}let v=m();return i.push({kind:`End`,text:``,line:c,column:v,endColumn:v}),i},Oe=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],ke=/* @__PURE__ */ new Set([...Oe,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),Ae=[`TYPE`,`TYPE_CONSTRAINT`],je=/* @__PURE__ */ new Set([...Oe,...Ae]),Me=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],Ne=e=>{let t=0,n=0;do{if(t>=e.length)return;let r=e.slice(t,t+2),i=r===`(*`?1:r===`*)`?-1:0;n+=i,t+=i===0?1:2}while(n>0);return t},Pe=e=>{let t=[],n=0,r=1,i=0,a=(n,a)=>{t.push({kind:`Error`,text:w(r,n-i+1,e[n],a),line:r})},o=e=>{t.push({kind:`Error`,text:w(r+1,0,void 0,e),line:r})},s=e=>{let t=e.split(`
|
|
18
18
|
`);t.length>1&&(r+=t.length-1,i=n+e.length-t[t.length-1].length),n+=e.length};for(;n<e.length;){let i=e.slice(n),c=/^\s+/.exec(i)?.[0];if(c){s(c);continue}if(i.startsWith(`\\*`)){let e=i.indexOf(`
|
|
19
|
-
`);s(e===-1?i:i.slice(0,e));continue}if(i.startsWith(`(*`)){let e=Ne(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=ie(e,n),d=u>0?i.slice(0,u):/^\d+(?![A-Za-z_])/.exec(i)?.[0];if(d){t.push({kind:`Number`,text:d,line:l}),s(d);continue}let f=/^[A-Za-z0-9_]+/.exec(i)?.[0];if(f){t.push({kind:`Word`,text:f,line:l}),s(f);continue}if(i.startsWith(`"`)){let r=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(i),c=r?.[0]??`"`;if(r?.[2]!==`"`)return s(c),n===e.length?o(`${c}\n`):a(n,c),t;t.push({kind:`String`,text:c,line:l}),s(c);continue}let p=ee(e,n)??g(e,n),m=Me.find(e=>i.startsWith(e));if(m&&m.length>=(p?.length??0))t.push({kind:`Symbol`,text:m,line:l}),s(m);else{if(!p)return a(n,``),t;t.push({kind:`Word`,text:p.text,line:l}),s(e.slice(n,n+p.length))}}return t.push({kind:`End`,text:``,line:r}),t},Fe=(t,n)=>new e._(`TLC found an error in the configuration file at line ${t}\n${n}`),Ie=(e,t)=>Fe(e,`The keyword ${t} appeared twice.`),Le=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),Re=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),ze=(t,n=`master`)=>{let r=n===`1.7.4`?je:ke,i=Pe(t),a=0,o={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],rawConstants:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},s=!1,c=/* @__PURE__ */ new Set,l=()=>{let t=i[Math.min(a++,i.length-1)];if(t.kind===`Error`)throw new e._(`TLC found an error in the configuration file:\n${t.text}`);return t},u=t=>{if(t.kind===`Number`&&t.text.startsWith(`\\`))throw e.it(new e._(`${e.$(`java.lang.NumberFormatException`)}For input string: "${t.text}"`),e.tt.error);if(t.kind===`Number`)return{kind:`Number`,value:Number(t.text)};if(t.kind===`String`&&t.text.includes(`\\`))throw new e._(`TLC found an error in the configuration file:\nescape sequences are not supported in strings at line ${t.line}`);if(t.kind===`String`)return{kind:`String`,value:t.text.slice(1,-1)};if(t.text===`TRUE`||t.text===`FALSE`)return{kind:`Boolean`,value:t.text===`TRUE`};if(t.text===`{`){let e=[],t=l();if(t.text!==`}`)for(;e.push(u(t)),t=l(),t.text===`,`;)t=l();if(t.text!==`}`)throw Fe(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(t.kind!==`End`)return{kind:`ModelValue`,name:t.text};throw Fe(t.line,`It was expecting a value, but did not find it.`)},d=e=>{let t=l();if(t.kind===`End`)throw Fe(t.line,`Expected an identifier after ${e}[.`);let n=l();if(n.text!==`]`)throw Fe(n.line,`It was expecting ], but did not find it.`);return t.text},f=(e,t)=>{let n=e.text,r=l();for(;r.text===`!`;)n=`${n}!${l().text}`,r=l();if(r.text===`<-`){if(r=l(),r.text===`[`){let e=d(`<-`),t=l();if(t.kind===`End`)throw Fe(t.line,`Expected an identifier after <-[mod].`);o.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw Fe(r.line,`Expected an identifier after <-.`);o.substitutions.push({name:n,target:r.text});return}let i=[],a=r.text===`(`;if(a){for(;i.push(u(l())),r=l(),r.text===`,`;);if(r.text!==`)`)throw Fe(t,``);r=l()}if(r.text!==`=`)throw Fe(r.line,`It was expecting = or <-, but did not find it.`);r=l();let s=r.text===`[`?d(`=`):void 0,c=u(s===void 0?r:l());o.constants.push({name:n,value:c,...a&&{args:i},...s!==void 0&&{module:s}})},p=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;let n=a-1;f(t,e),o.rawConstants.push(i.slice(n,a).map(e=>e.text).join(` `))}},m=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;e.push(t.text)}},h=l();for(;h.kind!==`End`;){let e=h.text,t=h.line,n=r.has(e)?Le.get(e):void 0,i=r.has(e)?Re.get(e):void 0,a=()=>{let n=l();if(n.kind===`End`)throw Fe(t,`The keyword ${e} was not followed by an identifier.`);return n};if(n!==void 0){let r=a();if(o[n]!==void 0)throw Ie(t,e);o[n]=r.text,h=l()}else if(i!==void 0)h=m(o[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)h=p(t);else if(e===`CHECK_DEADLOCK`){let n=a();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw Fe(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(s)throw Ie(t,e);s=!0,o.checkDeadlock=n.text===`TRUE`,h=l()}else{if(!r.has(e)||!Ae.includes(e))throw Fe(t,`It was expecting a keyword, but did not find it.`);if(a(),c.has(e))throw Ie(t,e);c.add(e),h=l()}}return o},Be=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},O=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,k=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},Ve={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:` `}},He=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},Ue=e=>e!==void 0&&/^\p{Nd}$/u.test(e),We=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),Ge=e=>{let t=t=>{let n=te(e,t,He);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l=t(i);for(;l!==void 0&&e[l]!==a;){let n=o(l);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l=t(i)}if(l!==void 0)return c.last=l,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=te(e,t,Ue);if(e.startsWith(`..`,n)&&Ue(e[n+2]))return{kind:`Constant`,first:t,last:te(e,n+2,Ue)-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=Ue(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:te(e,t+1,Ue)-1,children:[]};if(We(n))return{kind:`Constant`,first:t,last:te(e,t,We)-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:Ge(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=Ve[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},Ke={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},qe={none:0,error:1,warning:3,state:4},Je={0:``,1:`Error: `,3:`Warning: `,4:`State `},Ye=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${Je[n]}${r}`,Xe=(t,n=!0,r=`master`,i=[],a=[])=>{let o=/* @__PURE__ */ new Set;return{isTool:t,version:r,print:(r,s,c)=>{let l=s===qe.warning;if(l&&a.includes(r))throw new e.V(r,c);if(l&&!n||s!==qe.error&&i.includes(r))return;let u=l&&!t&&o.size===0?`
|
|
20
|
-
(Use the -nowarning option to disable this warning.)`:``,d=Ye(t,r,s,`${c}${u}`);l&&o.has(d)||(l&&o.add(d),console.log(d))}}},Ze=`The configuration file did not specify the initial state predicate.
|
|
21
|
-
Can also be caused by trying to run TLC on a specification from
|
|
22
|
-
a module imported with a parameterized INSTANCE statement.`,Qe=[[1005,e.u,!1],[1e3,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable%1% %2% undefined).`,!1],[1e3,`Could not find operator: %1% in module: %2%`,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
|
|
23
|
-
%1%`,!0],[2143,`The variable %1% was changed while it is specified as UNCHANGED at
|
|
24
|
-
%2%`,!1],[2144,`The EXCEPT was applied to non-existing fields of the value at
|
|
25
|
-
%1%`,!1],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
|
|
26
|
-
%1%,
|
|
27
|
-
but it produced the following error:
|
|
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.
|
|
29
|
-
`,!1],[2155,`Attempted to compare %1% with the value
|
|
30
|
-
%2%`,!0],[2158,`Attempted to check if the value:
|
|
31
|
-
%1%
|
|
32
|
-
is an element of %2%.`,!0],[2157,`Attempted to apply TransitiveClosure to a set containing
|
|
33
|
-
the following value:
|
|
34
|
-
%1%`,!0],[2156,`TLC supports at most %1% model values, but model value %2% exceeds this limit.`,!1],[2156,`tla-ts can't recover a model check from the checkpoint in %1%.`,!1],[2165,`Choose can only deal with numbers up to %1%`,!1],[2169,`The %1% argument of %2% should be a %3%, but instead it is:
|
|
35
|
-
%4%`,!0],[2170,`Argument mismatch in operator application.%1%`,!1],[2171,`Parsing or semantic analysis failed.%1%`,!1],[2172,e.h,!1],[2176,`Applying %1% to the following value,
|
|
36
|
-
which is not %2%:
|
|
37
|
-
%3%`,!0],[2177,`Attempted to apply BagUnion to the following set, whose
|
|
38
|
-
element is not a bag:
|
|
39
|
-
%1%`,!0],[2178,`Overflow when computing %1%`,!1],[2179,`The second argument of \\div is 0.`,!0],[2180,`0^0 is undefined.`,!0],[2181,`Attempted to compute cardinality of the value
|
|
40
|
-
%1%`,!0],[2182,`Evaluating an expression of the form %1% when s is not a %2%:
|
|
41
|
-
%3%`,!0],[2183,`The %1% argument of %2% must be in the domain of its %3% argument:
|
|
42
|
-
%4%
|
|
43
|
-
, but instead it is
|
|
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
|
|
45
|
-
on the right-hand side of a <- after already appearing on the
|
|
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
|
|
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,Ze,!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,
|
|
52
|
-
but instead found %3%.
|
|
53
|
-
%4%`,!1],[2248,`In computing %1%, TLC expected a %2% expression,
|
|
54
|
-
but didn't find one.
|
|
55
|
-
%3%`,!1],[2260,`In computing ENABLED, TLC encountered a temporal formula (%1%).
|
|
56
|
-
%2%`,!1],[2261,`TLC encountered a temporal formula (%1%) when evaluating a predicate or action.
|
|
57
|
-
%2%`,!1],[2265,`TLC can't handle a number this big.
|
|
58
|
-
%1%`,!1],[2266,`The %1% argument of %2% should be an %3%, but instead it is:
|
|
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.
|
|
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:
|
|
61
|
-
%3%`,!0],[5003,`TLC found an error in the configuration file at line %1%
|
|
62
|
-
The keyword %2% was not followed by an identifier.`,!1],[5004,`TLC found an error in the configuration file at line %1%
|
|
63
|
-
The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configuration file at line %1%
|
|
64
|
-
Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
|
|
65
|
-
It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
|
|
66
|
-
%1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
|
|
67
|
-
`,!1],[2250,`A state predicate was evaluated to a non-boolean value.`,!1],[2252,`Encountered an action predicate that's not a boolean.`,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]];let $e;const et=()=>$e??=Qe.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),tt=/^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)\)\./,nt=e=>tt.test(e)?void 0:et().find(t=>t.pattern.test(e))?.message,rt=t=>t instanceof e.O||nt(t.message)?.isEvalException===!0,it=/* @__PURE__ */ new Map([[1e3,`
|
|
68
|
-
: `],[2105,`failed.
|
|
69
|
-
`],[2154,`but it produced the following error:
|
|
70
|
-
`],[2171,`Parsing or semantic analysis failed.`],[2213,`:
|
|
71
|
-
`],[2281,` - specifically: `],[2405,`failed.
|
|
72
|
-
`]]),at=(e,t,n)=>{let r=n?it.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)}${ot(t.slice(a),n)}`},ot=(e,t)=>{let n=t?nt(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${qe.none} @!@!@\n${at(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},st=e=>String(e).padStart(2,`0`),ct=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 ${st(r%24)}h`:e>36e5?`${st(r%24)}h ${st(n)}min`:e>6e4?`${st(n)}min ${st(t)}s`:`${st(t)}s`},lt=e=>`${e.getFullYear()}-${st(e.getMonth()+1)}-${st(e.getDate())} ${st(e.getHours())}:${st(e.getMinutes())}:${st(e.getSeconds())}`,ut=/* @__PURE__ */ new WeakMap,dt=(t,n,r)=>{if(!(t instanceof e.b))return t;let i=e.it(new e.b(`${r}\n${t.message}`,t),e.Q(t));return ut.set(i,{code:n,headline:r,inner:t}),i},ft=e=>ut.has(e),pt=e.$(`util.WrongInvocationException`),mt=e.G.slice(0,e.G.indexOf(`
|
|
73
|
-
`)),ht=`${e.G}tlc2.tool.EvalException: `,gt=`${e.G}util.Assert$TLCRuntimeException: `,_t=e=>rt(e)?ht:gt,vt=t=>{try{return t()}catch(t){throw t instanceof e.b?rt(t)?new e.b(`${e.W}${t.message}`):nt(t.message)?t:new e.b(`${e.G}${t.message}`):t}},yt=[ht,gt,e.G,e.W],bt=(t,n)=>{let r=ut.get(t);if(r)return`${r.headline}\n${bt(r.inner,n)}`;let i=t.message;if(t instanceof e.z)return i;let a=yt.find(e=>i.startsWith(e))??``;return`${a}${ot(i.slice(a.length),n)}`},xt=(t,n)=>{let r=ut.get(t),i=t.message;if(r)return{code:r.code,message:i,toolMessage:bt(t,!0)};if(t instanceof e.P)return{code:n?Ke.stackOverflow:Ke.general,message:i,toolMessage:i};if(n&&rt(t))return{code:nt(i)?.code??Ke.general,message:i,toolMessage:i};let a=n&&!i.startsWith(mt)&&!(t instanceof e.z),o=t instanceof e.N?pt:e.G,s=a?o:``;return{code:Ke.general,message:`${s}${i}`,toolMessage:`${s}${bt(t,!0)}`}},St=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,Ct=1e6;let wt=Ct;const Tt=()=>wt,Et=()=>Math.max(wt,10),Dt=()=>`Attempted to construct a set with too many elements (>${wt}).`,Ot=(t,n)=>{if(t.length===Et())throw new e.N(Dt());t.push(n)},kt=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=Et(),At=(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`,jt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),M=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),N=e=>typeof e==`object`&&e.kind===`ModelValue`,Mt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),Nt=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:j(e)?`set`:`function`,Pt=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let Ft=!1;const It=(e,t)=>(Ft=!0,e.writtenKeys=t,e),Lt=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,Rt=e=>Lt(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),zt=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):Rt(e),Bt=(e,t,n)=>It(Ir(e,t),n),Vt=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(Vt);e.writtenKeys=void 0,e.range.forEach(Vt)}},Ht=e=>e.every(e=>typeof e==`string`),Ut=(e,t)=>e.length>0&&t.length>0&&Ht(e)!==Ht(t),Wt=(e,t)=>{Ft&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Ut(n,r)?tr(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=gn(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:gn(t,n);if(r!==0)return r}return 0},Gt=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=gn(n[e],r[e]);if(t!==0)return t}return 0},Kt=e=>N(e)?e.type:void 0,qt=(t,n,r)=>{let i=Kt(t),a=Kt(n);if(i===void 0&&a===void 0)return;let o=r?`check equality of`:`compare`;if(N(t)&&N(n)){if(i===void 0||a===void 0||i===a)return;throw new e.b(`Attempted to ${o} the differently-typed model values ${L(t)} and ${L(n)}`)}throw i===void 0?new e.b(`Attempted to ${o} the typed model value ${L(n)} and the non-model value\n${L(t)}`):new e.b(`Attempted to ${o}${r?``:` the`} typed model value ${L(t)} and non-model value\n${L(n)}`)},Jt={ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0},Yt=e=>{Jt.ranks=Object.create(null),Jt.size=0,Jt.searchRank=void 0,Jt.unorderedString=void 0,_n.clear();for(let t of e)on(t)},Xt=()=>{Jt.searchRank=Jt.size},Zt=()=>Jt.unorderedString;let Qt=!1;const $t={isExpanded:!0,isViewPrinted:!1},en=e=>{Qt=e.version===`1.7.4`,wt=e.maxSetSize??Ct,$t.isExpanded=e.isLazyValueExpanded??!0,$t.isViewPrinted=e.isViewPrinted??!1},tn=/* @__PURE__ */ new WeakMap,nn=(e,t)=>($t.isViewPrinted&&tn.set(e,t),e),rn=/* @__PURE__ */ new WeakMap,an=(e,t)=>(rn.set(e,t),e),on=e=>(Jt.ranks[e]===void 0&&(Jt.ranks[e]=Jt.size++),e),sn=e=>Jt.ranks[on(e)],cn=(e,t)=>{if(e===t)return 0;let n=Jt.ranks,r=n[e],i=n[t],a=Jt.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(Jt.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},ln=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),un=(e,t)=>(ln(e)||ln(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),dn=(t,n)=>new e.b(ln(t)?`Attempted to compare overridden value ${L(t,!0)} with non-overridden value:\n${L(n)}`:`Attempted to compare ${Nt(t)} ${L(t)} with ${Nt(n)} ${L(n)}`),fn=(t,n,r)=>{if(!ln(t))throw new e.b(`Attempted to ${r} the set ${L(P(t)?F(t):t,!0)} with the value:\n${L(n,!0)}`);if(!ln(n))throw dn(t,n);let i=t.kind===`InfiniteSet`?t.name:void 0,a=n.kind===`InfiniteSet`?n.name:void 0;if(i!==void 0&&i===a)return 0;if(i===`Nat`&&a===`Int`||i===`Int`&&a===`Nat`)return i===`Nat`?-1:1;throw new e.O(`Attempted to compare ${L(t,!0)} with the value\n${L(n,!0)}`)},pn={kind:`InfiniteSet`,name:`Any`},mn=t=>{throw new e.O(`Attempted to compare ANY with the value\n${L(t)}`)},hn=e=>{Ft&&Vt(e),e===pn&&mn(e),typeof e==`object`&&e.kind===`LazyFunction`&&I(e)},gn=(e,t)=>{if(e===t)return hn(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Wt(e,t);if(n===`Set`&&r===`Set`)return Gt(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&qt(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return qt(e,t,!1),n===`ModelValue`?-1:1;if(e===pn||t===pn)return mn(e===pn?t:e);if(j(e)&&j(t)&&un(e,t))return fn(e,t,`compare`);let i=j(e);if(i!==j(t))throw dn(e,t);if(n===`Interval`&&r===`Set`){let n=oi(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-oi(t);if(n!==0)return n}return i?Gt(F(e),F(t)):Wt(I(e),I(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return cn(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(qt(e,t,!1),N(e))return-1;if(N(t))return 1;throw dn(e,t)},_n=/* @__PURE__ */ new Map,vn=32768,yn=t=>{let n=_n.get(t);if(n)return n;if(_n.size===vn)throw new e.x(`TLC supports at most ${vn} model values, but model value ${t} exceeds this limit.`);let r={kind:`ModelValue`,name:t,type:t.length>2&&t[1]===`_`?t[0]:void 0,rank:sn(t),hash:Li(Ri(zi(t),109)),fingerprint:Ji(Yi(t)^60)};return _n.set(t,r),r},bn=()=>[..._n.values()],xn=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),Sn=e=>{let t=xn(e);return t.isNormalized=!0,t},Cn=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let wn=!1;const Tn=(e,t)=>(t===`lambda`&&(wn=!0),t!==void 0&&(e.functionClass=t),e),En=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Dn=e=>Tn(e,`lambda`),On=e=>St(e)&&e.isCached===!0;let kn=!1;const An=e=>(kn=!0,e),jn=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),Mn=e=>{kn&&typeof e==`object`&&St(e)&&jn.has(e.kind)&&(e.isCached=!0)},Nn=e=>{(wn||kn)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(Nn),e.range.forEach(Nn)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Nn):j(e)&&P(e)&&(Mn(e),F(e).elements.forEach(Nn))))},Pn=(e,t)=>{if(Mn(e),e===t)return hn(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&qt(e,t,!0),gn(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return Wt(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Gt(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&oi(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==oi(t))return!1;if(N(e)||N(t))return e.kind===`LazyFunction`&&I(e),qt(e,t,!0),N(e)&&N(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Pn(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=ri(e.domain),r=ri(t.domain);if(n||r)return n===r;let i=ri(e.range),a=ri(t.range);return i||a?i===a:Pn(e.domain,t.domain)&&Pn(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(ri(e))return ri(t);if(ri(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&Pn(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return ri(e)?ri(t):!ri(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Pn(e,t.factors[n]));let n=j(e)&&j(t)&&!(P(e)&&P(t));if(n&&un(e,t))return fn(e,t,`check equality of`)===0;if(n){if(!ln(e)){let n=F(e);if(!ln(t))return Gt(n,F(t))===0}return ea(e)===ea(t)}return gn(e,t)===0},Fn=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):ea(n)===ea(r);return n},In=Fn(!1),Ln=Fn(!0),Rn=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},zn=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=qi(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Ln(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Ln(i[e],n))return i[e]}return n.kind===`Set`?Rn(n.elements,t):(Rn(n.domain,t),Rn(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},Bn=(e,t)=>t.length===0||En(e)===`tuple`?1:Pi(t)?.low,Vn=e=>{if(!M(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:Bn(e,t.domain)}},Hn=e=>{if(!M(e))return;let t=I(e);return Ht(t.domain)?t:void 0},Un=(e,t)=>(qt(t,e,!1),1),Wn=(e,t)=>(qt(t,e,!0),!1),Gn=(e,t)=>(e.type!==void 0&&qt(e,t,!1),N(t)?e.rank-t.rank:-1),Kn=(e,t)=>(e.type!==void 0&&qt(e,t,!0),N(t)&&e.name===t.name),qn={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},Jn=(e,t,n)=>{let r=qn[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${L(e)} with ${r.other}:\n${L(t)}`},Yn=(t,n,r)=>{let i=Vn(r);if(!i){if(N(r))return Un(r,n);throw new e.b(`Attempted to compare the function ${L(n)} with the value:\n${L(r)}`)}if(t.range.length!==i.range.length)return t.range.length-i.range.length;let a=()=>Xn(t.range,i.range);if(t.low!==void 0&&t.range.length===0)return 0;if(t.low!==void 0&&i.low!==void 0)return t.low===i.low?a():t.low-i.low;let o=t.low??i.low;if(o===void 0)return Xn(t.domain,i.domain)||a();let s=t.low===void 0?t.domain:i.domain;for(let n=0;n<s.length;n++){let r=s[n];if(typeof r!=`number`)throw new e.b(`Attempted to compare integer with non-integer${t.low===void 0?``:`:`}\n${L(r)}.`);let i=t.low===void 0?r-(o+n):o+n-r;if(i!==0)return i}return a()},Xn=(e,t)=>{for(let n=0;n<e.length;n++){let r=tr(e[n],t[n]);if(r!==0)return r}return 0},Zn=(t,n)=>{let r=I(t);if(En(t)===`tuple`){let e=M(n)?di(n):void 0;return e?r.range.length-e.length||Xn(r.range,e):Yn({...r,low:1},t,n)}if(En(t)===`record`){let i=Hn(n);if(!i){if(N(n))return Un(n,t);throw new e.b(`Attempted to compare record:\n${L(t)}\nwith non-record\n${L(n)}`)}return r.domain.length-i.domain.length||Xn(r.domain,i.domain)||Xn(r.range,i.range)}return Yn({...r,low:Bn(t,r.domain)},t,n)},Qn=(e,t)=>ln(e)||ln(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),$n=(e,t)=>{let n=Mt(t)?t:F(t);return{elements:F(e).elements,otherElements:F(n).elements}},er=(t,n)=>{if(Qn(t,n))return gn(t,n);if(!Mt(t))return er(F(t),n);if(!j(n)){if(N(n))return Un(n,t);throw new e.b(`Attempted to compare the set ${L(t)} with the value:\n${L(n)}`)}let r=$n(t,n);return r.elements.length-r.otherElements.length||Xn(r.elements,r.otherElements)},tr=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return gn(t,n);if(N(n))return Un(n,t);throw new e.b(Jn(t,n,!1))}return t.kind===`ModelValue`?Gn(t,n):M(t)?Zn(t,n):er(t,n)},nr=(e,t)=>e.every((e,n)=>or(e,t[n])),rr=(t,n,r)=>{let i=Vn(r);if(!i){if(N(r))return Wn(r,n);throw new e.b(`Attempted to check equality of the function ${L(n)} with the value:\n${L(r)}`)}if(t.range.length!==i.range.length)return!1;if(t.low!==void 0&&i.low!==void 0)return(t.range.length===0||t.low===i.low)&&nr(t.range,i.range);let a=t.low??i.low;return a===void 0?nr(t.domain,i.domain)&&nr(t.range,i.range):(t.low===void 0?t.domain:i.domain).every((t,n)=>{if(typeof t!=`number`)throw new e.b(`Attempted to compare an integer with non-integer:\n${L(t)}.`);return t===a+n})&&nr(t.range,i.range)},ir=(t,n)=>{let r=I(t);if(En(t)===`tuple`){let e=M(n)?di(n):void 0;return e?r.range.length===e.length&&nr(r.range,e):rr({...r,low:1},t,n)}if(En(t)===`record`){let i=Hn(n);if(!i){if(N(n))return Wn(n,t);throw new e.b(`Attempted to check equality of record:\n${L(t)}\nwith non-record\n${L(n)}`)}return r.domain.length===i.domain.length&&nr(r.domain,i.domain)&&nr(r.range,i.range)}return rr({...r,low:Bn(t,r.domain)},t,n)},ar=(t,n)=>{if(Qn(t,n))return Pn(t,n);if(!Mt(t))return ar(F(t),n);if(!j(n)){if(N(n))return Wn(n,t);throw new e.b(`Attempted to check equality of the set ${L(t)} with the value:\n${L(n)}`)}let r=$n(t,n);return r.elements.length===r.otherElements.length&&nr(r.elements,r.otherElements)},or=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return t===n;if(N(n))return Wn(n,t);throw new e.b(Jn(t,n,!0))}return t.kind===`ModelValue`?Kn(t,n):M(t)?ir(t,n):ar(t,n)},sr=e=>{let t=[];for(let n of e){let e=lr(n,t);e.isFound||t.splice(e.index,0,n)}return t},cr=(e,t)=>{let n=pi.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},lr=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=cr(e,()=>tr(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},ur=(e,t)=>t.some(t=>cr(t,()=>or(t,e))),dr=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,fr=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(fr)),e.kind===`Function`&&(e.domain.forEach(fr),e.range.forEach(fr)))},pr=e=>{if(!(typeof e!=`object`||On(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:F(e);return;case`FilteredSet`:case`Subset`:return pr(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(pr(e.left),pr(e.right));case`FunctionSet`:return pr(e.domain),pr(e.range);case`RecordSet`:return e.sets.forEach(pr);case`ProductSet`:return e.factors.forEach(pr)}},mr=(e,t)=>mi(Pn,or,e,t),hr=e=>{for(let t=1;t<e.length;t++)if(gn(e[t-1],e[t])>=0)return!1;return!0},gr=e=>{for(let t=0;t<e.length;t++){let n=e[t],r=t>0?e[t-1]:void 0;if(typeof n!=`number`||typeof r==`number`&&r>=n)return!1}return!0},_r=e=>{for(let t=1;t<e.length;t++)Mn(e[t]);if(e.length<2||hr(e))return xn(e);let t=[...e].sort(gn),n=[t[0]];for(let e=1;e<t.length;e++)gn(n[n.length-1],t[e])!==0&&n.push(t[e]);return xn(n)},vr=e=>{if(gr(e))return xn(e);let t=mi(_r,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},yr=xn([]),br=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&gn(r[a],t)<0;)a++;a<r.length&&gn(r[a],t)===0||i.push(t)}return i.length===n.length?e:xn(i)},xr=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&gn(r[a],t)<0;)a++;a<r.length&&gn(r[a],t)===0&&i.push(t)}return i.length===n.length?e:xn(i)},Sr=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=gn(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=xn(i);if(e.hash!==0&&e.hash!==Hi){let t=e.hash,n=0;for(;n<a.length;n++){let e=qi(a[n]);if(e===Hi)break;t=t+Bi(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+Xi(a[e])|0;c.fingerprint=t}return c},Cr=e=>{let t=e.length<2?e:[...e].sort((e,t)=>gn(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&gn(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Cn(n,r)},wr=e=>{let t=Cr(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:It(t,e.map(e=>e[0]))},Tr=[],Er=/* @__PURE__ */ new Map,Dr=[],Or=/* @__PURE__ */ new WeakMap,kr=e=>{let t=Tr[e]??Er.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?Er.set(e,new WeakRef(n)):Tr[e]=n,n},Ar=e=>{if(oi(e),e.low===1&&e.high>=1)return kr(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},jr=e=>e.length>0&&(e===Tr[e.length]||e===Er.get(e.length)?.deref())||Or.has(e),Mr=e=>{let t=F(e).elements;return jr(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Nr=e=>{let t=Dr[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Dr[e]=n,n},Pr=e=>Tn(Cn(kr(e.length),e),`tuple`),Fr=e=>Tn(Cr(e),`record`),Ir=(e,t)=>Tn(Cn(e,t),`record`),Lr=e=>j(e)&&!ln(e),Rr=(e,t=!1)=>`UNION(${L(e.base,t)})`,zr=(t,n=e=>F(e).elements)=>{if(!Lr(t.base))throw new e.b(`Attempted to enumerate the nonenumerable set:\n${Rr(t)}`);return n(t.base)},Br=(t,n,r)=>{if(Lr(t))return t;throw new e.b(n===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${L(t)}\nwhen enumerating:\n${Rr(r)}`)},P=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 P(e.base);case`FunctionSet`:return P(e.domain)&&P(e.range)||Vr(e.domain)===!0||Vr(e)===!0;case`RecordSet`:return e.sets.every(P)||Vr(e)===!0;case`ProductSet`:return e.factors.every(P)||Vr(e)===!0;case`Union`:return P(e.base)&&(Mt(e.base)?dr(e.base):Qr(e.base)).every(P);case`SetOperation`:return e.operator===`\\cup`?P(e.left)&&P(e.right):e.operator===`\\cap`?P(e.left)||P(e.right):P(e.left);default:return!1}},Vr=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=Vr(e.domain);return t===void 0?void 0:!t&&Vr(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Vr(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return P(e)?F(e).elements.length===0:void 0;default:return}},Hr=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},Ur=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},Wr=e=>{if(typeof e!=`object`||e.kind!==`Subset`||ln(e.base))return;let t=F(e.base).elements;if(t.length<=20)return;let n=-1,r=[0],i=e=>{for(e<=n&&(n=-1);n<e;)n===-1?r=[]:Ur(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return xn(r.map(e=>t[e]))},a=2**t.length,o=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<a;return new Proxy([],{get:(e,t,n)=>t===`length`?a:o(t)?i(Number(t)):Reflect.get(e,t,n),has:(e,t)=>o(t)||Reflect.has(e,t)})},Gr=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(xn(r.map(t=>e[t])));while(Ur(r,e.length))}return t},Kr=(t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){let o=t[a];if(ln(o))throw new e.b(r(o,a));let s=n(o);if(s.length===0)return[[]];i.push(s)}return i},qr=(t,n=e=>F(e).elements)=>{if(typeof t!=`object`)throw new e.b(`Expected a set but found ${L(t)}`);switch(t.kind){case`Set`:return t.elements;case`MixedSet`:return sr(t.elements);case`Interval`:{let e=Ar(t);return e!==Tr[e.length]&&Or.set(e,t),e}case`Subset`:{if(oi(t.base)===0)return Gr([]);if(!j(t.base))throw new e.b(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${A(L(t.base))}`);let n=F(t.base).elements;if(n.length>30)throw new e.b(ai(t));return Gr(n)}case`FunctionSet`:{if(!Qt&&ri(t))return[];if(ln(t.domain))throw new e.b(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${L(t.domain)}\ncannot be enumerated.`);let r=Mr(t.domain);if((r.length>0||Qt)&&ln(t.range))throw new e.b(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${L(t.range)}\ncannot be enumerated.`);let i=r.length===0?[]:n(t.range);return Hr(r.map(()=>i)).map(e=>Cn(r,e))}case`RecordSet`:{if(!Qt&&ri(t))return[];let e=Kr(t.sets,n,(e,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${t.names[n]}' field:\n${L(e)}`);return Hr(e).map(e=>Fr(t.names.map((t,n)=>[t,e[n]])))}case`ProductSet`:{if(!Qt&&ri(t))return[];let e=Kr(t.factors,n,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${L(e)}`);return Hr(e).map(Pr)}case`FilteredSet`:if(!j(t.base)||ln(t.base))throw new e.b(`Attempted to enumerate { x \\in S : p(x) } when S:\n${L(t.base)}\nis not enumerable`);return F(vr(Qr(t.base).filter(e=>t.test(e,!1)))).elements;case`Union`:{let n=[];return zr(t).forEach((r,i)=>{let a=Br(r,i,t);if(kt(a))throw new e.N(Dt());Qr(a).forEach(e=>Ot(n,e))}),F(vr(n)).elements}case`SetOperation`:{if(t.operator===`\\cap`&&!Lr(t.left)&&!Lr(t.right))throw new e.b(`Attempted to enumerate S \\cap T when neither S:\n${L(t.left)}\nnor T:\n${L(t.right)}\nis enumerable`);if(t.operator===`\\`&&!Lr(t.left))throw new e.b(`Attempted to enumerate S \\ T when S:\n${L(t.left)}\nis not enumerable.`);if(t.operator===`\\cup`)return F(vr(Yr(t))).elements;let n=t.operator===`\\`||Lr(t.left),r=n?t.left:t.right,i=n?t.right:t.left,a=[];return At(typeof r==`object`&&r.kind===`Interval`?r:Qr(r),e=>{gi(e,i)===(t.operator===`\\cap`)&&Ot(a,e)}),F(vr(a)).elements}case`InfiniteSet`:case`SequenceSet`:throw new e.b(`Attempted to enumerate the non-enumerable set ${L(t)}`);default:throw new e.b(`Expected a set but found ${L(t)}`)}},F=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return xn(qr(e));let t=typeof e==`object`&&St(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=pi.sets;n?.push(e);let r=qr(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?xn(r):_r(r);return t&&(t.enumerated=i),i},Jr=e=>{if(!(typeof e!=`object`||On(e)))switch(e.kind){case`MixedSet`:F(e);return;case`FilteredSet`:return Lr(e.base)||F(e),Jr(e.base);case`Union`:if(!Mt(e.base)&&Lr(e.base))return Jr(e.base);zr(e).slice(0,1).forEach(t=>Jr(Br(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!Lr(e.left)&&F(e),e.operator!==`\\cup`||Lr(e.left)&&Lr(e.right)||F(e),e.operator!==`\\cap`||Lr(e.left)?Jr(e.left):Jr(e.right),e.operator===`\\cup`&&Jr(e.right)}},Yr=t=>{if(!Lr(t.left)||!Lr(t.right))throw new e.b(`Attempted to enumerate S \\cup T when S:\n${L(t.left)}\nand T:\n${L(t.right)}\nare not both enumerable`);if(Jr(t.left),Jr(t.right),kt(t.left))throw new e.N(Dt());let n=Qr(t.left),r=kt(t.right)?void 0:Qr(t.right);if(!r||n.length+r.length>Et())throw new e.N(Dt());return[...n,...r]},Xr=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return F(e).elements;let t=cr(e,()=>Yr(e)),n=F(vr(t)).elements;return e.enumerated=xn(n),n},Zr=(e,t)=>{if(typeof e!=`object`||On(e))return F(e).elements.some(t);let n=pi.sets;n?.push(e),Jr(e);let r=ni(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},Qr=e=>{let t=[];return Zr(e,e=>(t.push(e),!1)),t},$r=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,ei=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(ei);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(ei)&&e.range.every(ei);case`SetOperation`:return e.operator!==`\\cup`&&ei(e.left)&&ei(e.right);case`FilteredSet`:return ei(e.base);case`ProductSet`:return e.factors.every(ei);default:return!1}},ti=e=>typeof e!=`object`||On(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?ti(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||ti(e.left)||ti(e.right):$r(e)?.some(ti)??!1,ni=(e,t)=>{if(e.kind===`Union`)return zr(e,Qr).some((n,r)=>Zr(Br(n,r,e),t));if(e.kind===`FilteredSet`&&Lr(e.base))return Zr(e.base,n=>e.test(n,!1)&&t(n));if($r(e)?.some(ti))return qr(e,Qr).some(t);if(e.kind!==`SetOperation`)return F(e).elements.some(t);if(e.operator===`\\cup`)return!Lr(e.left)||!Lr(e.right)?F(e).elements.some(t):Zr(e.left,t)||Zr(e.right,t);let n=e.operator===`\\`||Lr(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return Lr(r)?Zr(r,n=>gi(n,i)===(e.operator===`\\cap`)&&t(n)):F(e).elements.some(t)},ri=t=>{if(typeof t!=`object`||!j(t))throw new e.b(`Shouldn't call isEmpty() on value ${L(t)}`);switch(t.kind){case`Set`:case`MixedSet`:return t.elements.length===0;case`Interval`:return t.low>t.high;case`InfiniteSet`:if(t.name===`Any`)throw new e.b(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return t.factors.some(ri);case`RecordSet`:return t.sets.some(ri);case`FunctionSet`:return!ri(t.domain)&&ri(t.range);case`Union`:return zr(t).every((e,n)=>ri(Br(e,n,t)));default:return F(t).elements.length===0}},ii=(t,n,r)=>t.reduce((t,i)=>{let a=t*oi(i,n);if(a>2147483647)throw new e.b(r());return a},1),ai=e=>`Overflow when computing the number of elements in:\n${L(e)}`,oi=(t,n)=>{if(typeof t!=`object`)throw new e.b(`Attempted to compute the number of elements in the ${Nt(t)} ${L(t)}.`);switch(t.kind){case`ModelValue`:throw new e.b(`Attempted to compute the number of elements in the model value ${L(t)}.`);case`Function`:return t.domain.length;case`LazyFunction`:return oi(t.domain,n);case`Interval`:{let n=Math.max(0,t.high-t.low+1);if(n>2147483647)throw new e.b(`Size of interval value exceeds the maximum representable size (32bits): ${t.low}..${t.high}.`);return n}case`InfiniteSet`:case`SequenceSet`:throw new e.b(`Attempted to compute the number of elements in the overridden value ${L(t)}.`);case`Subset`:{let r=oi(t.base,n);if(r>=31)throw new e.b(ai(t));return 2**r}case`FunctionSet`:{if(n!==`1.7.4`){if(ri(t.domain))return 1;if(ri(t.range))return 0;if(oi(t.range,n)===1)return 1}let r=oi(t.domain,n),i=oi(t.range,n);if(i<=1)return r===0?1:i;let a=1;for(let n=0;n<r;n++)if(a*=i,a>2147483647)throw new e.b(ai(t));return a}case`RecordSet`:return n!==`1.7.4`&&ri(t)?0:ii(t.sets,n,()=>ai(t));case`ProductSet`:return n!==`1.7.4`&&ri(t)?0:ii(t.factors,n,()=>`Overflow when computing the number of elements in ${L(t)}`);default:return Mn(t),F(t).elements.length}},si=e=>`Attempted to check if the set ${L(e)}is finite.`,ci=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)throw new e.b(`Attempted to check if the ${Nt(t)} ${L(t)} is a finite set.`);switch(t.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new e.b(`Attempted to check if the function:\n${L(t)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return ci(t.base)&&ri(t.base);case`Subset`:return ci(t.base);case`FunctionSet`:{let e=ci(t.domain);if(e&&ri(t.domain))return!0;let n=ci(t.range);return n&&ri(t.range)?!0:n&&(e||oi(t.range)===1)}case`RecordSet`:case`ProductSet`:{let e=t.kind===`RecordSet`?t.sets:t.factors,n=!0;for(let t of e)if(!ci(t))n=!1;else if(ri(t))return!0;return n}case`Union`:if(!Lr(t.base))throw new e.b(`Attempted to check if the nonenumerable set:\n${Rr(t)}\nis a finite set.`);return F(t.base).elements.every(ci);case`SetOperation`:if(t.operator===`\\cup`)return ci(t.left)&&ci(t.right);if(t.operator===`\\cap`){if(!ci(t.left)&&!ci(t.right))throw new e.b(si(t));return!0}if(ci(t.left))return!0;if(!ci(t.right))throw new e.b(si(t));return!1;case`FilteredSet`:if(!ci(t.base))throw new e.b(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${L(t.base)}\nis finite.`);return!0}},li=(e,t,n=gn)=>{let r=0,i=e.length-1;for(;r<=i;){let a=r+i>>1,o=n(e[a],t);if(o===0)return a;o<0?r=a+1:i=a-1}return-1},ui=(t,n)=>{let r=t.elements;if(r.length>Et())throw new e.N(Dt());let i=Array.from({length:r.length},()=>!1),a=n.filter(e=>{let t=li(r,e);return!i[t]&&(i[t]=!0,!0)}),o=xn(r);return a.some((e,t)=>e!==r[t])&&(o.writtenElements=a),o},di=t=>{if(typeof t!=`object`||!M(t))return;if(t.kind===`LazyFunction`&&(!j(t.domain)||ln(t.domain)))throw new e.b(`To convert a function of form [x \\in S |-> f(x)] to a tuple, the set S must be enumerable.`);let n=I(t);return n.domain.every((e,t)=>e===t+1)?n.range:void 0},fi=(e,t)=>{let n=`Attempted to check if the value:\n${L(e)}\nis an element of the`;if(!M(t))return`${n} ${Nt(t)} ${L(t)}`;let r=En(t);return r===`record`?`Attempted to check if element:\n${L(e)}\nis in the record:\n${L(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${L(t)}`},pi={sets:void 0},mi=(t,n,r,i)=>{let a=pi.sets,o=pi.callStack,s=a?.length??0,c=o&&{...o,length:o.expressions.length};try{return t(r,i)}catch(t){if(!(t instanceof e.b))throw t;return a&&(a.length=s),o&&c&&(o.expressions.length=c.length,o.isFrozen=c.isFrozen,o.fingerprint=c.fingerprint),n(r,i,t)}},hi=e=>(pi.sets??[]).slice(e).some(e=>typeof e==`object`&&pi.callStack?.sources.has(e)===!0),gi=(e,t)=>{let n=pi.sets;if(n===void 0)return xi(e,t);n.push(t);let r=xi(e,t);return n.pop(),r},_i=(e,t)=>{let n=t.elements,r=0,i=n.length-1;for(;r<=i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;if(a===e)return!0;a<e?r=t+1:i=t-1}return!1},vi=(e,t)=>li(t.elements,e)!==-1,yi=(e,t)=>t.isNormalized?lr(e,t.elements).isFound:ur(e,dr(t)),bi=(t,n)=>{if(t.type!==void 0)throw new e.b(`Attempted to check if the typed model value ${A(L(t))} is an element of\n${A(L(n))}`);return!1},xi=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return _i(e,t)??Si(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return Si(e,t)},Si=(t,n)=>{if(!j(n))throw new e.b(fi(t,n));switch(n.kind){case`Set`:return Mn(t),mi(vi,yi,t,n);case`MixedSet`:return ur(t,n.elements);case`Interval`:if(typeof t==`number`)return t>=n.low&&t<=n.high;if(n.low<=n.high&&(!N(t)||t.type!==void 0))throw new e.b(`Attempted to check if the value:\n${L(t)}\nis in the integer interval ${L(n)}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(N(t))return bi(t,n);if(!(n.name===`STRING`?typeof t==`string`:typeof t==`number`))throw new e.O(`Attempted to check if the value:\n${L(t)}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof t==`number`&&t>=0;case`Subset`:if(!j(t)||ln(t))throw new e.b(`Attempted to check if the non-enumerable value\n${A(L(t))}\nis element of\n${A(L(n))}`);return F(t).elements.every(e=>gi(e,n.base));case`FunctionSet`:{if(!M(t)){if(N(t))return bi(t,n);throw new e.b(`Attempted to check if \n${L(t)}\nwhich is not a TLC function value, is in the set of functions:\n${A(L(n))}`)}let r=I(t),i=Bn(t,r.domain);return(i===void 0?mr(n.domain,xn(r.domain)):mr({kind:`Interval`,low:i,high:i+r.domain.length-1},n.domain))&&r.range.every(e=>gi(e,n.range))}case`RecordSet`:{let r=M(t)?I(t):void 0;if(!r||!Ht(r.domain)){if(N(t))return bi(t,n);throw new e.b(`Attempted to check if non-record\n${L(t)}\nis in the set of records:\n${L(n)}`)}return r.domain.length===n.names.length&&n.names.every((e,t)=>{let i=li(r.domain,e);return i!==-1&&gi(r.range[i],n.sets[t])})}case`ProductSet`:{let r=M(t)?di(t):void 0;if(r===void 0){let r=M(t)&&I(t).domain.every(e=>typeof e==`number`);if(N(t))return bi(t,n);if(r)return!1;throw new e.b(`Attempted to check if non-tuple\n${L(t)}\nis in the set of tuples:\n${L(n)}`)}return r.length===n.factors.length&&r.every((e,t)=>gi(e,n.factors[t]))}case`FilteredSet`:try{return gi(t,n.base)&&n.test(t,!0)}catch(r){throw!(r instanceof e.b)||!rt(r)?r:new e.b(`Cannot decide if element:\n${A(L(t))}\n is element of:\n${A(L(n.base))}\nand satisfies the predicate ${n.source?.predicate}`)}case`Union`:{if(!Lr(n.base))throw new e.b(`Attempted to check if:\n ${L(t)}\nis an element of the non-enumerable set:\n ${Rr(n)}`);let r=F(n.base).elements;return r.length>1&&r.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),r.some(e=>gi(t,e))}case`SetOperation`:return n.operator===`\\cup`?gi(t,n.left)||gi(t,n.right):gi(t,n.left)&&gi(t,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=di(t);if(r===void 0){if(N(t))return bi(t,n);throw new e.O(`Attempted to check if the value:\n${A(L(t))}\nis an element of ${A(L(n))}.`)}return r.every(e=>gi(e,n.base))}default:throw new e.b(fi(t,n))}},Ci=(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?gi(e,n):e.range.every((e,r)=>Ci(e,t.range[r],n.range)),I=t=>{if(typeof t==`object`&&t.kind===`Function`)return t;if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return t.enumerated;if(P(t.domain)||oi(t.domain),!j(t.domain))throw new e.b(`The domains of formal parameters must be enumerable.`);let n=Mr(t.domain);return t.enumerated=Tn(Cn(n,n.map(e=>t.apply(e))),En(t)),t.enumerated}throw new e.b(`Expected a function but found ${L(t)}`)},wi=(e,t,n)=>{let r=A(L(e)),i=A(L(t)),a=n===`1.7.4`;switch(En(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},Ti=(e,t)=>{if(!Qt)return wi(e,t);let n=A(L(t));return En(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Ei=(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},Di=t=>new e.b(`Attempted to apply function with integer domain to the non-integer argument ${A(L(t))}`),Oi=(e,t)=>li(e.domain,t),ki=(e,t,n)=>{let r=Lt(e);throw Qt||r!==e.domain||r.length<32?r.forEach(e=>or(e,t)):li(r,t,tr),n},Ai=(t,n,r)=>{let i=t.domain;if(typeof n!=typeof i[0]){let a=En(t),o=a===`tuple`?`number`:a===`record`?`string`:void 0;if(o!==void 0&&typeof n!==o)throw new e.b(r(t,n));if(o===void 0&&!Qt&&typeof n!=`number`&&jr(i))throw Di(n)}let a=Ei(i,n);return a===-1?mi(Oi,ki,t,n):a},ji=(t,n,r)=>{let i=t.domain,a=di(r),o=(e,n,r)=>`In applying the function\n${A(L(t))},\nthe ${e} is:\n${A(L(n))}\nwhich ${r}.\n`,s=()=>new e.b(o(`argument list`,r,`does not match its formal parameter`));if(a===void 0)throw s();if(typeof i!=`object`||i.kind!==`ProductSet`)throw new e.b(`Attempted to apply a function to ${L(r)}, which is not in its domain`);if(n.forEach((t,n)=>{if(n>=a.length)throw s();let r=a[n],c=`argument number ${n+1}`;if(!gi(r,i.factors[n]))throw new e.b(o(c,r,t===void 0?`is not in the function's domain ${L(i)}`:`is not in its domain`));if(t!==void 0&&di(r)?.length!==t)throw new e.b(o(c,r,`does not match its formal parameter`))}),a.length>n.length)throw s()},Mi=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!gi(t,e.lambdaDomain),Ni=(t,n,r)=>{if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return Ni(t.enumerated,n,r);let i=t.boundTupleLengths;if(i!==void 0)return ji(t,i,n),t.apply(n);if(!gi(n,t.domain))throw new e.b(En(t)===`lambda`?wi(t,n):`Attempted to apply a function to ${L(n)}, which is not in its domain`);return t.apply(n)}if(typeof t!=`object`||t.kind!==`Function`)throw new e.b(`Attempted to apply ${L(t)}, which is not a function`);let i=r??wi;if(Mi(t,n))throw new e.b(i(t,n));let a=Ai(t,n,i);if(a===-1)throw new e.b(i(t,n));return t.range[a]},Pi=e=>jr(e)?Or.get(e)??Nr(e.length):void 0,Fi=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=I(e);if(t.functionClass===`lambda`&&t.lambdaDomain)return t.lambdaDomain;let n=Pi(t.domain);if(n)return n;let r=xn(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},Ii=(t,n,r,i=!1)=>{if(typeof t==`object`&&t.kind===`LazyFunction`&&(i||t.enumerated===void 0)){if(!gi(n,t.domain))return t;let e=r(t.apply(n));return Tn({kind:`LazyFunction`,domain:t.domain,apply:r=>mr(n,r)?e:t.apply(r),source:t.source,boundTupleLengths:t.boundTupleLengths},En(t))}if(!M(t))throw new e.b(`Attempted to apply EXCEPT construct to the value ${A(L(t))}.`);let a=I(t);if(Mi(a,n))return a;let o=Ai(a,n,Ti);if(o===-1)return a;let s=[...a.range],c=a.range[o],l=r(c);s[o]=l;let u=Tn(Cn(a.domain,s),En(a));if(u.writtenKeys=a.writtenKeys,u.lambdaDomain=a.lambdaDomain,a.hash!==0&&a.hash!==Hi){let e=qi(l);if(e!==Hi){let t=qi(a.domain[o]);u.hash=c===l?a.hash:a.hash-Vi(t,qi(c))+Vi(t,e)|0}}if(a.fingerprint!==0){let e=a.domain[o];u.fingerprint=c===l?a.fingerprint:a.fingerprint-Zi(e,c)+Zi(e,l)|0}return u},Li=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Ri=(e,t)=>Math.imul(e^t,16777619),zi=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Li(t)},Bi=e=>Li(e+2654435769|0),Vi=(e,t)=>Li(Math.imul(e,668265261)+t|0),Hi=795548749,Ui=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=qi(t[e]);if(r===Hi)return Hi;n=n+Bi(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=qi(e.domain[n]),i=qi(e.range[n]);if(r===Hi||i===Hi)return Hi;t=t+Vi(r,i)|0}return t},Wi=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)return;if(t.kind===`InfiniteSet`||t.kind===`SequenceSet`)throw new e.b(`TLC has found a state in which the value of a variable contains ${L(t)}`);if(j(t)){F(t).elements.forEach(Wi);return}let n=I(t);n.domain.forEach(Wi),n.range.forEach(Wi)},Gi=t=>{if(typeof t==`object`&&t.kind!==`ModelValue`)try{qi(t)===Hi&&Wi(t);return}catch(t){if(!(t instanceof e.b))throw t;return t}},Ki=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[]}},qi=e=>typeof e==`number`?Li(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?zi(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=Ui(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?P(e.domain)?qi(I(e)):Hi:P(e)?qi(F(e)):Hi,Ji=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Yi=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Ji(t)},Xi=e=>Ji($i(e)+2135587861|0),Zi=(e,t)=>Ji(Math.imul($i(e),374761393)+$i(t)|0),Qi=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Xi(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Zi(e.domain[n],e.range[n])|0;return t},$i=e=>typeof e==`number`?Ji(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?Yi(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Qi(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?$i(I(e)):P(e)?$i(F(e)):Yi(ea(e)),ea=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):ta(e),ta=t=>{if(t.kind===`ModelValue`)return`@${t.name}`;if(t.kind===`InfiniteSet`)return`<${t.name}>`;if(t.kind===`SequenceSet`)return`<Seq ${ea(t.base)}>`;if(t.kind===`FilteredSet`&&!P(t))throw new e.b(`Attempted to compare the non-enumerable set ${L(t)} with another value`);if(j(t))return P(t)?`{${F(t).elements.map(ea).join(`,`)}}`:`<${t.kind} ${L(t)}>`;let n=I(t);return`(${n.domain.map((e,t)=>`${ea(e)}:${ea(n.range[t])}`).join(`,`)})`},na={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},ra=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>na[e])}"`,ia=1999,aa=e=>e.reduce((e,t)=>e===0?0:e*oi(t),1),oa=e=>{if(e.kind===`Subset`)return oi(e.base)<=6?F(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return F(e);if(e.kind===`FunctionSet`){let t=ri(e.domain)?0:oi(e.domain);return(t===0?1:oi(e.range)**t)<=ia?F(e):void 0}return aa(e.kind===`RecordSet`?e.sets:e.factors)<=ia?F(e):void 0},sa=(t,n)=>{if(n||t.kind===`Union`||t.kind===`Subset`&&M(t.base)&&(t.base.kind===`Function`||P(t.base.domain)))return oa(t);if(P(t))try{return oa(t)}catch(t){if(t instanceof e.b)return;throw t}},ca=(e,t)=>{let n=e=>L(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return Rr(e,t)}},la=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),ua=t=>{if(P(t.domain))try{return I(t)}catch(t){if(t instanceof e.b||e.et(t))return;throw t}},da=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),F(e);return;case`Function`:e.range.forEach(n);return;case`LazyFunction`:n(e.enumerated??e.domain);return;case`SetOperation`:n(e.left),n(e.right);return;case`FunctionSet`:n(e.domain),n(e.range);return;case`RecordSet`:e.sets.forEach(n);return;case`ProductSet`:e.factors.forEach(n);return;case`Subset`:case`Union`:case`FilteredSet`:case`SequenceSet`:n(e.base);return;default:return}};try{return e.forEach(n),e.map(e=>L(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1})}},L=(e,t=!1,n=!1)=>{let r=e=>L(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return ra(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(F(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=$t.isExpanded?sa(e,t):void 0;return n?r(n):ca(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?$t.isExpanded||!e.source?ua(e):void 0:e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${L(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Qt&&En(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&En(e)!==`lambda`);if(i.domain.length===0&&En(e)===`record`)return`[]`;if(i.domain.every((e,t)=>e===t+1))return`<<${i.range.map(a).join(`, `)}>>`;let o=n?i.domain.map((e,t)=>[e,i.range[t]]):zt(i);return En(e)===`record`||i.domain.every(e=>typeof e==`string`&&la(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},fa=(t,n)=>{if(t===void 0)return!1;try{return Pn(t,n)}catch(t){if(t instanceof e.b)return!1;throw t}},pa=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,ma=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(pa,(e,a,o=``,s,c,l=``)=>{let u=e=>o.includes(`-`)?e.padEnd(Number(s)):e.padStart(Number(s??0)),d=o.includes(`<`),f=o.replace(`<`,``);if(l===`n`&&e===`%n`)return`
|
|
74
|
-
`;if(l===`%`&&c===void 0&&/^-?$/.test(f))return f===`-`&&s===void 0&&(i=!1),u(`%`);let p=d?r:a===void 0?n++:Number(a.slice(0,-1))-1;r=p;let m=t[p];if(!`sSbBhH`.includes(l)||l===``||!/^-?$/.test(f)||f===`-`&&s===void 0||m===void 0)return i=!1,e;let h=l.toLowerCase(),g=h===`s`?m:h===`b`?`true`:(k(m)>>>0).toString(16),_=u(c===void 0?g:g.slice(0,Number(c.slice(1))));return l===h?_:_.toUpperCase()});return i?a:void 0},ha=(t,n)=>{let r=n?void 0:tn.get(t);if(r)return r();let i=Object.entries(t),a=rn.get(t),o=a!==void 0&&`_format`in t,s=o?t._format:i.length===1?`%s = %s
|
|
75
|
-
`:`/\\ %s = %s
|
|
76
|
-
`;if(typeof s!=`string`)throw new e.g(`The _format field of the ALIAS ${a} is ${L(s)}, but it must be a string.`);return i.filter(([e])=>!(o&&e===`_format`)).filter(([e,t])=>!n||!fa(n[e],t)).map(([t,n])=>{let r=ma(s,[t,A(L(n))]);if(r===void 0)throw new e.g(`The _format field of the ALIAS ${a} is ${L(s)}, but it must format two strings, the name and the value of a field.`);return r}).join(``)},ga=[10454148508367108822n,15747411856486957441n,13848313129918172575n,15427004735118145554n,14338780731064426356n,15931650522396165332n,17670238537108149059n,12816660938095048951n,13192168525635896882n,16119298732711755075n,13564417994159519395n,15831473429641889162n,17671735485712653535n,14582471876431321160n,9288673424107444897n,12345523232675890545n,13774063780198914517n,10636128657019767374n,13227535641082688945n,10085966873248490402n,17056045221983369811n,18027133543548002442n,13033986364717636900n,12663388180492401538n,11007194744055901935n,16251515628090973732n,18046429724439772544n,9876734796024595817n,14949643787442512870n,16960057143726945461n,10590203213448744021n,12248592797044284137n,9558805810925624286n,16993321702164258530n,11754329512098378960n,12074934892440206921n,15696745233288286746n,10531590977001201739n,18107999685377398317n,12149369488538049728n,12923655455904407421n,10507099144397364930n,17322088528956367024n,14653973644796244054n,15165509594857513400n,13554280709034297251n,16228911470502883382n,17115369786458865383n,11179220607102683830n,16708422618246866334n,12295941796329322556n,18336630348474106240n,13989616001589685348n,14822072159597151759n,14264172520427195041n,11642530518213145397n,11877331515501935358n,13913116192159715440n,17054474839259161580n,13461230878584418056n,16058025410470398786n,11100471369705097435n,11133782763824505275n,13192312712502684421n,17456091706045076157n,13237272598629075916n,12914531898895761383n,15801841604014567326n,16446055517513626294n,16780923767715884464n,15104658705803254918n,10882049990920163451n,12728112724252049190n,11720209067562733740n,16476221075563830086n,16602801460297162326n,16206898064012585915n,12158475401238648099n,13742285336487677729n,15543703592025073839n,9615783578189153721n,16710542608962839044n,11960730242263336692n,13328718558362718101n,12971616006464047952n,17057853503483465676n,16180230282101315295n,15483523553568578902n,17773465781871025571n,18047252642493037509n,11580640560664688668n,10121963531818974651n,14218267149826330657n,12715294421139777506n,10584764766358778171n,12666843443693621286n,17403948736867619210n,17907955559063099692n,15179434392748515198n,15413469521140985247n,13455040338347572751n,15419348191054617477n,12340568220039846914n,13236419189535069162n,18074463254581147189n,10818750974828329405n,9859349269386152082n,15035006154709018396n,13627907273947709876n,9549035931546940138n,16199589727945564820n,10285831968679942330n,17737018494601061698n,15477896647372134857n,13595764249822586512n,10556855812148546550n,12421897615105552821n,15477767459253848096n,17421607461439241175n,12409061346569762725n,13621778224251023638n,10680972825126675886n,16494492050207190715n,16801324317763555620n,12664650400804916358n,16134230614391269483n,10027806175083075147n,9259037851175017999n,11803214621941906429n,9537357587847606069n,10517495000576890277n];let _a=ga[0];const va=()=>_a,ya=/* @__PURE__ */ new Int32Array(256),ba=/* @__PURE__ */ new Int32Array(256),xa=/* @__PURE__ */ new Int32Array(256),Sa=/* @__PURE__ */ new Int32Array(256),Ca=/* @__PURE__ */ new Int32Array(256),wa=/* @__PURE__ */ new Int32Array(256),Ta=/* @__PURE__ */ new Int32Array(256),Ea=/* @__PURE__ */ new Int32Array(256);let Da=0,Oa=0,ka=0,Aa=0;const ja=e=>{let t=(e^Aa)&255;Aa=(Aa>>>8|ka<<24)^Ca[t],ka=ka>>>8^ya[t]},Ma=e=>{let t=ga[e];_a=t;let n=[];for(let e=1n<<63n;n.length<72;)n.push(e),e=e>>1n^((e&1n)==0n?0n:t);let r=n.slice(64,72).reverse();for(let e=0;e<256;e++){let t=r.reduce((t,n,r)=>e>>r&1?t^n:t,0n);ya[e]=Number(BigInt.asIntN(32,t>>32n)),Ca[e]=Number(BigInt.asIntN(32,t))}let i=[ya,ba,xa,Sa],a=[Ca,wa,Ta,Ea];for(let e=1;e<4;e++){let t=i[e-1],n=a[e-1];for(let r=0;r<256;r++){let o=n[r]&255;a[e][r]=(n[r]>>>8|t[r]<<24)^Ca[o],i[e][r]=t[r]>>>8^ya[o]}}Da=Number(BigInt.asIntN(32,t>>32n)),Oa=Number(BigInt.asIntN(32,t))};Ma(0);const Na=e=>{let t=Aa^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;Aa=ka^Ea[n]^Ta[r]^wa[i]^Ca[a],ka=Sa[n]^xa[r]^ba[i]^ya[a]},Pa=e=>{if(typeof e==`boolean`)return ja(0),ja(e?116:102),2;if(typeof e==`number`)return ja(1),Na(e),5;if(typeof e==`string`){ja(3),Na(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)Na(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)ja(e.charCodeAt(n));return 5+e.length}return ja(21),Na(sn(e.name)+1),5},Fa=e=>{if(typeof e!=`object`||N(e))Pa(e);else if(M(e)){let t=I(e);ja(9),Na(t.domain.length);for(let e=0;e<t.domain.length;e++)Fa(t.domain[e]),Fa(t.range[e])}else{let t=F(e).elements;ja(5),Na(t.length);for(let e of t)Fa(e)}},Ia=e=>{let t=ka,n=Aa;ka=Da,Aa=Oa;for(let t of e)Fa(t);let r=BigInt(ka>>>0)<<32n|BigInt(Aa>>>0);return ka=t,Aa=n,r},La=(e,t)=>{let n=new BigInt64Array(e.length),r=new Int32Array(n.buffer),i=ka,a=Aa;return e.forEach((e,n)=>{ka=Da,Aa=Oa;for(let n of t)Fa(e[n]);r[2*n]=Aa,r[2*n+1]=ka}),ka=i,Aa=a,n},Ra=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),za=1024,Ba=e=>({current:-1,expressions:[],ranges:[],firstChild:[],lastChild:[],nextSibling:[],prefixes:[],isPart:[],isPrimed:[],isUnchanged:[],recursive:[],lets:[],roots:[],primary:[],secondary:[],covered:/* @__PURE__ */ new WeakSet,values:/* @__PURE__ */ new WeakMap,registers:new Uint8Array(e*za),relations:[]}),Va=(e,t,n,r,i)=>{let a=e.expressions.length;if(e.expressions.push(t),e.ranges.push(n),e.firstChild.push(-1),e.lastChild.push(-1),e.nextSibling.push(-1),e.prefixes.push(-1),e.isPart.push(i),e.isPrimed.push(!1),e.isUnchanged.push(t?.kind===`Unchanged`),e.recursive.push(-1),e.lets.push(void 0),e.roots.push(r===-1?a:e.roots[r]),e.primary.push(0),e.secondary.push(0),t&&e.covered.add(t),r===-1)return a;let o=e.lastChild[r];return o===-1&&(e.firstChild[r]=a),o!==-1&&(e.nextSibling[o]=a),e.lastChild[r]=a,a},Ha=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,Ua=(e,t,n,r,i)=>{let a=t===`next`?Ha(e,t,r):void 0;if(a!==void 0)return a;let o=Va(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},Wa=(e,t)=>e!==void 0&&t!==void 0&&e.module===t.module&&e.start.line===t.start.line&&e.start.column===t.start.column&&e.end.line===t.end.line&&e.end.column===t.end.column,Ga=(t,n,r)=>{let i=t===void 0?void 0:r.definitions.get(t),a=i?.kind===`Operator`?i.head:void 0,o=n.location.range;return!i||!a?`Action ${o?e.X(o):`Unknown location`}`:Wa(i.body.location.range,o)||!o?`${i.name} ${e.X(a)}`:`${i.name} ${e.X(a)} (${o.start.line} ${o.start.column} ${o.end.line} ${o.end.column})`},Ka=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,qa=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,Ja=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},Ya=e=>{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[(k(t.name)&2147483647)%e.length].unshift(t));t=e}t[(k(e.name)&2147483647)%t.length].unshift(e)}),t.toReversed().flat()},Xa=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),Za=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),Qa=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),$a=(e,t,n)=>{let r=new Set(n.map(Ka)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(O(e)){for(let e=r;e;e=e.parent)if(e.name===n)return e.definition&&{definition:e.definition,scope:e.scope};return}let i=t.substitutions.get(n)??n;if(t.variableIndex.has(i)||t.constants.has(i))return;let a=t.definitions.get(i),o=a?.location.range?.module??a?.body.location.range?.module;return a&&!Ra.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=Va(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(Ka(n));let d=t&&s.get(t);if(d&&i.forEach(t=>{e.expressions[t]===d&&(e.lets[t]??=[]).push(u)}),l?.kind===`Operator`&&l.isRecursive){let t=i.findLast(e=>a[e]===l);t!==void 0&&(e.recursive[u]=t)}return a[u]=l,i.push(u),o(),i.pop(),u},u=e=>{let t=e.definition;if(o.includes(t))return;o.push(t);let n=t.kind===`Function`?Qa(t.bounds):t.params.map(e=>e.name);m(t.body,Za(n,e.scope)),t.kind===`Function`&&Xa(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,Za(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,Za(e.params,t));return;case`Lambda`:m(e.body,Za(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)}),Ya(e.definitions).forEach(e=>u({definition:e,scope:n})),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,qa(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,Ja(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,qa(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,Za(Qa(e.bounds),t)),r(Xa(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,Za(Qa(e.bounds),t)),r(Xa(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,Za(Qa([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,Za(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,Za(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()})},eo=(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=eo(e,r,n);if(t!==-1)return t}}return-1},to=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=eo(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:eo(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},no=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},ro=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},io=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},ao=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},oo=(e,t)=>t.forEach((t,n)=>{let r=Ia([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*za+i;e.registers[o]=Math.max(e.registers[o],ao(a)+1)}),so=(e,t)=>{let n=e.registers.subarray(t*za,(t+1)*za),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*za*za/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*za?a===0?i:za*Math.log(za/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},co=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},lo=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>co(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)},fo=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],po=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},mo=(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}},ho=(t,n)=>{let r=[],i=/* @__PURE__ */ new Map,a=e=>{let n=[],r={primary:t.primary[e],secondary:t.secondary[e]};return(r.primary>0||r.secondary>0||fo(t,e))&&uo(n,r),po(t,e).forEach(e=>a(e).forEach(e=>uo(n,e))),i.set(e,n),n},o=(n,i,a,o)=>{let s=t.ranges[n];r.push({location:s?e.X(s):`Unknown location`,depth:i,count:a,cost:o})},s=(e,n)=>o(e,n,t.primary[e],t.secondary[e]),c=(e,n)=>{let r=po(t,e),l=[];r.forEach(e=>(i.get(e)??a(e)).forEach(e=>uo(l,e)));let u={primary:t.primary[e],secondary:t.secondary[e]},d=fo(t,e),f=e=>r.forEach(t=>c(t,e));if(t.isUnchanged[e]){let t=l.filter(e=>e.primary!==0||e.secondary!==0);t.length===0?s(e,n):o(e,n,Math.max(u.primary,lo(t).primary),0);return}if(l.length===0){(u.primary!==0||d)&&s(e,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let t=l[0],r=t.primary===0&&t.secondary===0;if(t.primary<u.primary){s(e,n),f(n+1);return}if(!d&&p&&!r){o(e,n,t.primary,t.secondary);return}if(p&&r){d&&s(e,n),f(d?n+1:n);return}if(u.primary===t.primary&&u.secondary===t.secondary){s(e,n);return}}let m=!p||d;m&&s(e,n),f(m?n+1:n)};return po(t,n).forEach(e=>{a(e),c(e,0)}),r},go=[`init`,`next`,`invariant`,`constraint`,`implied`],_o=(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,vo=e=>go.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>_o(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||_o(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),yo=(t,n,r,i)=>({variables:i.map(i=>{let a=r[i]?.range;return{label:`${n.variables[i]} ${a?e.X(a):`Unknown location`}`,distinct:so(t,i)}}),relations:vo(t).map(e=>({kind:e.kind,label:e.label,...mo(t,e),expressions:ho(t,e.node)}))}),bo=(e,t,n)=>{let r=Ha(e,t,n);if(r===void 0)return;let i=e.primary[r],a=e.secondary[r];if(t===`init`)return[[`generated`,i+a],[`distinct`,i]];if(t===`next`)return[[`generated`,i],[`distinct`,a]];let o=e.firstChild[r];return[[`count`,o===-1?i:e.primary[o]]]},xo=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),So=(t,n)=>xo.has(t)?new e.b(n):new e.O(n),Co=(t,n,r,i)=>new e.O(`The ${t} argument of ${n} should be a ${r}, but instead it is:\n${L(i)}`),wo=(t,n,r=t)=>{if(!j(t)||ln(t))throw new e.O(`Applying ${n} to the following value,\nwhich is not a finite set:\n${L(r)}`);return F(t)},To=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||To(r))throw So(n,`${n} expects a value as argument ${t+1}`);return r},Eo=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw So(n,`${n} expects a boolean but received ${L(r)}`);return r},Do=(e,t,n)=>{let r=e[t];if(r===void 0||!To(r))throw So(n,`${n} expects an operator as argument ${t+1}`);return r},Oo=(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}),ko=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Ao=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),jo=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Mo=e=>e>2147483647||e<-2147483648,No=t=>new e.O(`Overflow when computing ${t}`),Po={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`},Fo={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Io={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`},Lo={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Ro=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Fo[e.operator];if(e.kind!==`Function`)return Po[e.kind];let t=En(e);return t===void 0?`FcnRcdValue`:Lo[t]},zo=e=>Io[Ro(e)],Bo=(e,t)=>`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`,Vo=(t,n)=>new e.b(Bo(t,n)),Ho=(t,n)=>{let r=r=>(...i)=>{let a=pi.sets?.length??0;try{return r(...i)}catch(r){if(!(r instanceof e.b)||r instanceof e.v)throw r;let i=hi(a);throw pi.sets&&(pi.sets.length=a),t.isLazy!==!0&&r instanceof e.O&&!i?r:t.isLazy!==!0&&r instanceof e.k?new e.O(Bo(n,r.message)):Vo(n,r.message)}},i=r(t.evaluate);return{...t,evaluate:(e,r)=>{if(e.length!==t.arity)throw Vo(n,`array is not of length ${t.arity}`);return i(e,r)},evaluateUnary:t.evaluateUnary&&r(t.evaluateUnary),evaluateBinary:t.evaluateBinary&&r(t.evaluateBinary)}},Uo=(e,t)=>{if(typeof e!=`number`)throw Vo(t,`Cannot cast tlc2.value.impl.${Ro(e)} to tlc2.value.impl.IntValue`);return e},Wo=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Go=(e,t,n,r)=>{let i=Wo(e,n,`IntValue`,2);return jo(t,(e,n)=>{let a=Uo(n,i),o=Uo(e,i),s=r(o,a);if(Mo(s))throw No(`${o}${t}${a}`);return s})},Ko=(t,n,r)=>{if(typeof t!=`number`)throw new e.O(`The ${n} argument of ${r} should be an integer, but instead it is:\n${L(t)}`);return t},qo=(e,t,n=e)=>jo(e,(e,r)=>t(Ko(e,`first`,n),Ko(r,`second`,n))),Jo=(e,t,n)=>({...Ao(e,t,n),isLazy:!0}),Yo=(e,t,n)=>{let r=Do(e,t,n);return()=>r.call([])},Xo=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),Zo=()=>({implication:Ch,negate:wh,equivalent:Th,body:Eh,condition:(e,t)=>{if(typeof e!=`boolean`)throw oh(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw sh(t,n,e);return e},apply:Ni,expectFunction:yh,tuple:Pr,set:vr,record:Ir,writtenRecord:Bt,equal:Pn,enumerate:Nh,choiceElements:i_,noChoice:e=>{throw a_(e)},filterPredicate:r_,isReducible:jt,finiteElements:e=>F(e).elements,addBounded:Ot,normalizedSet:Sn,isBeyondBound:kt,cardinality:oi,functionDomain:Mr,sortedFunction:Cn,unassigned:(e,t)=>{throw mh(e,t)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:bh,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>_h(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let Qo,$o;const es=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},ts=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),ns=e=>`local${e.counter++}`,rs=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),Be(e).forEach(e=>rs(e,t)),t),is=(e,t,n)=>{let r=rs(t),i=[...n.locals].filter(([e])=>r.has(e));if(i.length===0)return n.context;let a=ts(e,i.map(([e])=>e));return`extend(${n.context}, ${a}, [${i.map(([,e])=>e).join(`, `)}])`},as=(e,t,n)=>`${ts(e,U(t,e.environment))}(${is(e,t,n)})`,os=(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})`},ss=(e,t,n,r)=>{let i=ns(e),a=ns(e),o=ns(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} }`},cs=(e,t,n)=>{let r=t.kind===`Forall`;return os(e,n,n=>{let i=t.bounds.map(()=>ns(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(${hs(e,r.set,n)}, ${ts(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=ns(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${hs(e,t.body,n)}, ${ts(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>ss(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},ls=(e,t,n,r,i)=>os(e,i,i=>{let a=ns(e),o=ns(e),s=ts(e,t),c=`choiceElements(${hs(e,n,i)}, ${s}, ${ts(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${hs(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${ss(e,a,o,l)} return noChoice(${s});`}),us=(e,t,n,r)=>os(e,r,r=>{let i=ns(e),a=ns(e),o=ns(e),s=ns(e),c=ts(e,t),l=`if (!isReducible(${i})) return ${ts(e,n_(t,e.environment))}(${i}, ${is(e,t,r)});`,u=hs(e,t.bound.set,r);r.locals.set(n,s);let d=`if (filterPredicate(${hs(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${ss(e,a,s,d)} return normalizedSet(${o});`}),ds=(e,t,n,r)=>os(e,r,r=>{let i=ns(e),a=ns(e),o=ns(e),s=ns(e),c=ns(e),l=ns(e),u=ts(e,$g(t,e.environment)),d=is(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=hs(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${hs(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} = []; ${ss(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),fs=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=hs(e,r[0],n),a=hs(e,r[1],n),o=ts(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${hs(e,r[0],n)}, ${ts(e,t)})`;if(t.operator===`<=>`)return`equivalent(${hs(e,r[0],n)}, ${hs(e,r[1],n)}, ${ts(e,t)})`;if(O(t))return as(e,t,n);let i=og(t.operator,e.environment);if(i?.kind!==`Builtin`)return as(e,t,n);if(i.name===`DOMAIN`)return`${ts(e,uh(t))}(${hs(e,r[0],n)})`;if(i.name===`TLCEval`)return as(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${ts(e,dh(t,i))}(${hs(e,r[0],n)}, ${hs(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&zg(r[0],a))return`${ts(e,i.evaluateUnary)}(${hs(e,r[0],n)})`;let o=r.length===2&&zg(r[0],a)&&zg(r[1],a);return i.evaluateBinary&&o?`${ts(e,i.evaluateBinary)}(${hs(e,r[0],n)}, ${hs(e,r[1],n)})`:as(e,t,n)},ps=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(O(e))return!1;let r=_g(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return ps(e.expression,t,n);case`FieldAccess`:return ps(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>ps(e,t,n));default:return!1}},ms=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return ms(e.record);case`FunctionApplication`:return[e.function,...e.args].every(ms);default:return!1}},hs=(e,t,n)=>{let r=(t,r=n)=>hs(e,t,r);switch(t.kind){case`Number`:return Pt(t.value)?String(t.value):as(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 as(e,t,n);let i=_g(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=ts(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?ts(e,i.value):as(e,t,n)}case`Apply`:return fs(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=ts(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)}, ${ts(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Jg(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${ps(t.function,n,e.environment)?r(t.function):ms(t.function)?r(t.function,i):as(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${ts(e,t)}))`,o=lh(e.environment.runtime.version),s=o?`, ${ts(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`${ts(e,ch(t))}(${r(t.record)})`;case`Record`:{let i=s_(t.fields);if(c_(i))return as(e,t,n);let a=ts(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}, ${ts(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?as(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`)?cs(e,t,n):as(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?ls(e,t,t.set,t.pattern.name,n):as(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!Qg(t)?ds(e,t,r.pattern.name,n):as(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?us(e,t,t.bound.pattern.name,n):as(e,t,n);default:return as(e,t,n)}},gs=(e,t)=>{if(!Xo.has(e.kind)||($o??=es(),!$o))return;let n={environment:t,references:[],helpers:[],counter:0},r=hs(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 Qo??=Zo(),Function(...Object.keys(Qo),...i,a)(...Object.values(Qo),...n.references)},_s={kind:`Local`},vs=/* @__PURE__ */ new WeakSet,ys=/* @__PURE__ */ new WeakMap,bs=/* @__PURE__ */ new WeakMap,xs=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Ss=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),Cs=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,ws=e=>e.kind===`Operator`?e.params.length:0,Ts=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Es=e=>e.name.includes(`!`),Ds=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Os=(e,t,n)=>{let r=t.bindings.get(e);return r&&Cs(r.position,t.location)&&(!n||Cs(r.position,n.start))?r:void 0},ks=(t,n)=>t!==void 0&&n!==void 0&&e.X(t)===e.X(n),As=(t,n,r,i)=>{if(n===void 0)return!0;if(ks(n.range,r.range))return!1;let a=r.range;if(a===void 0||i.isGenerated||n.kind!==`Builtin`&&!n.range)return!0;let o=e.X(a),s=n.range&&e.X(n.range);return n.kind===`Builtin`?i.errors.push({location:o,message:`Symbol ${t} is a built-in operator, and cannot be redefined.`}):r.kind===`Parameter`||n.kind!==r.kind||n.arity!==r.arity?i.errors.push({location:o,message:`Multiply-defined symbol '${t}': this definition or declaration conflicts \nwith the one at ${s}.`}):i.warnings.push({location:o,message:`Multiple declarations or definitions for symbol ${t}. \nThis duplicates the one at ${s}.`}),!1},js=(e,t,n,r)=>As(t,Ds(e,t)??Os(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Ms=(e,t,n)=>{As(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Ns=(e,t,n,r)=>t.reduce((e,t,i)=>js(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Ps=(e,t,n)=>t.reduce((e,t)=>js(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Fs=e=>e.kind===`Name`?[e.name]:e.names,Is=e=>e.flatMap(e=>Fs(e.pattern)),Ls=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||Cs(n.location,t.location))?n:void 0},Rs=(e,t)=>{let n=Ls(e,t);return n?{key:t.getKey(n),arity:ws(n),params:Ts(n),kind:`Definition`}:t.imported.get(e)},zs=(e,t,n)=>Ds(t,e)??Rs(e,n),Bs=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Vs=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Bs(e.location,e.spelling??t)},Hs=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return Cs(e.location,e.args[0].location)?`prefix`:`postfix`}},Us=e=>!/^[\p{L}\d_]/u.test(e),Ws=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Gs=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Ks=(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])}})},qs=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?Ks(e.name,[],void 0):Ks(e.operator,e.args,e.argumentCounts),Js=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Ys=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Is(e.bounds),body:e.body,sets:Js(e.bounds)};case`SetMap`:return{names:Is(e.bounds),body:e.expression,sets:Js(e.bounds)};case`SetFilter`:return{names:Fs(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Fs(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}},Xs=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}},Zs=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Qs=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),$s=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?$s(e.body,t):Be(e).reduce((e,n)=>e??$s(n,t),void 0)},ec=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??ec(i,t,n||Qs(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&$s(e.set,t):$s(e,t)},tc=e=>e.kind===`Label`?tc(e.body):e,nc=e=>typeof e==`number`?`argument selector ${e}`:e,rc=`within the scope of a declaration
|
|
78
|
-
from outside that declaration's scope.`,ic=(t,n,r,i,a,o)=>{let s=(n,r)=>{let i=(n===void 0?void 0:t.selectorRanges?.[n])??t.location.range;i&&a.errors.push({location:e.X(i),message:r})},c=r.isSuffices===r.isInProof,l=r.statement,u={node:l,isGoal:!0,isSufficesOpen:r.isSuffices};for(let[e,t]of n.slice(1).entries()){let r=e+1,o=u.node;if(t.kind===`Name`){if(n[r-1].kind!==`Name`)return o.kind!==`NewSymbol`&&o.kind!==`AssumeProve`&&tc(o).kind===`Let`?void 0:s(r-1,`A name selector here must be from a LET clause.`);let e=l.kind===`AssumeProve`?[...l.assumptions,l.conclusion]:[l],i=r===1?e.map((e,n)=>({position:n,label:ec(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:o.kind===`Label`?$s(o.body,t.name):void 0};if(!i?.label)return s(r,`Cannot find label \`${t.name}'.`);if(r===1&&l.kind===`AssumeProve`&&Qs(l,i.position)&&c)return s(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${rc}`);if(t.args.length!==i.label.params.length)return s(r,`Label \`${t.name}' used with wrong number of arguments.`);u.node=i.label,u.isGoal=!1,u.isSufficesOpen=!1;continue}if(t.kind!==`Operand`)return;let d=nc(t.operand);if(u.isSufficesOpen){if(Gs(t.operand,1)!==0)return s(r,o.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);u.isSufficesOpen=!1;continue}if(o.kind===`NewSymbol`)return;if(o.kind!==`AssumeProve`){let e=tc(o);if([`Number`,`Decimal`,`String`].includes(e.kind))return s(r,`Selecting subexpression of expression that has none.`);let n=e.kind===`Identifier`?zs(e.name,i,a)?.kind:void 0;if(n===`Variable`||n?.startsWith(`New`))return s(r,`Choosing operand \`${d}' of subexpression with no operands.`);let c=Ys(e)?.sets,l=e.kind===`Identifier`?[]:c?c.length>0?c:void 0:e.kind===`Except`?void 0:Xs(e);if(!l)return;let f=Gs(t.operand,l.length);if(f===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);u.node=l[f],u.isGoal=!1;continue}let f=[...o.assumptions,o.conclusion],p=Gs(t.operand,f.length);if(p===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);if(Qs(o,p)&&(!u.isGoal||c))return s(r,`Accessing ASSUME/PROVE clause ${rc}`);let m=f[p];if(m.kind===`NewSymbol`&&r!==n.length-1)return s(r,`Selected a subexpression of a NEW clause of an ASSUME.`);u.node=m,u.isGoal=!1}o||(u.node.kind===`AssumeProve`&&s(void 0,`Selected ASSUME/PROVE instead of expression.`),u.node.kind===`NewSymbol`&&s(void 0,`Selected a NEW declaration as an expression or operator.`))},ac=(t,n)=>{let r=n.isGenerated?void 0:n.hasLabelScope?n.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:n.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return r===void 0||!t.location.range?!1:(n.errors.push({location:e.X(t.location.range),message:r}),!0)},oc=(t,n,r)=>{let i=t.location.range;if(!i||r.isGenerated)return;let a=e.X(i),o=t.params.filter((i,a)=>{let o=Ds(n,i)?.kind===`Parameter`,s=t.paramRanges?.[a];return!o&&s&&r.errors.push({location:e.X(s),message:`Illegal parameter ${i} of label \`${t.name}'.`}),o});o.filter((e,t)=>o.indexOf(e)!==t).forEach(e=>r.errors.push({location:a,message:`Repeated formal parameter ${e} \nin label \`${t.name}'.`})),r.labelParams.filter(e=>!o.includes(e)).forEach(e=>r.errors.push({location:a,message:`Label ${t.name} must contain formal parameter \`${e}'.`}));let s=[...new Set(o.filter(e=>!r.labelParams.includes(e))),...t.params.filter(e=>!o.includes(e))];s.length>0&&r.errors.push({location:a,message:`Label ${t.name} declares extra parameter(s) ${s.map(e=>`${e} `).join(``)}`}),r.labels.has(t.name)&&r.errors.push({location:a,message:`Duplicate label \`${t.name}'.`}),r.labels.add(t.name)},sc=(e,t,n,r)=>{if(!Zs(e))return!1;let i=qs(e),a=i[0],o=i.length>1&&a.kind===`Name`?Ds(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&ic(e,i,o,t,n,r),o!==void 0},cc=(t,n,r,i)=>{let a=t.location;if(vc(t,r,i))return;let o=bs.get(t);if(o!==void 0)return o;if(xs(n))return t.kind===`Apply`?t.args.length:0;let s=Ds(r,n);if(s?.isNonFact){i.errors.push({location:e.X(Vs(t,n)),message:`Step number of non-expression step used as an expression.`});return}if(sc(t,r,i,!1)||Ws(n)&&s)return t.kind===`Apply`?t.args.length:0;if(s&&t.kind!==`OperatorReference`&&(t.resolution=_s),s)return s.arity;let c=Rs(n,i);if(c)return t.kind===`Identifier`?t.name=c.key:t.operator=c.key,bs.set(t,c.arity),c.arity;let l=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``;if(l!==``&&(Ds(r,l)!==void 0||Rs(l,i)!==void 0||i.facts.has(l)))return t.kind===`Apply`?t.args.length:0;let u=(t.kind===`Identifier`?void 0:t.spelling)??n,d=e.X(t.kind===`Apply`&&u===`-.`?Bs(a,`-`):Vs(t,n));if(!Us(n)||Ws(n)){i.errors.push({location:d,message:`Unknown operator: \`${n}'.`});return}i.errors.push({location:d,message:`Could not find declaration or definition of symbol '${u}'.`});let f=Hs(t);f&&a.range&&i.errors.push({location:e.X(a.range),message:`Couldn't resolve ${f} operator symbol \`${u}'.`})},lc=(e,t,n)=>(e.forEach(e=>B(e.set,t,n)),e.reduce((e,t)=>Ns(e,Fs(t.pattern),t.pattern.ranges,n),t)),uc=(e,t)=>e.kind===`Identifier`&&e.name===t&&O(e)||Be(e).some(e=>uc(e,t)),dc=(e,t)=>{e.kind===`FunctionConstruction`&&uc(e.body,t)&&(e.isRecursive=!0),Be(e).forEach(e=>dc(e,t))},fc=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?Is(t.bounds):[],labels:/* @__PURE__ */ new Set},o=t.name,s=t.location.range,c=t=>{s&&!a.isGenerated&&a.errors.push({location:e.X(s),message:t})},l=t.kind===`Function`?lc(t.bounds,n,a):Ps(n,t.params,a),u=Ds(l,o)??Os(o,a,s),d=u?.isPending===!0&&i.has(u);return u?.isPending&&!d?c(`Recursive ${t.kind===`Function`?`function`:`operator`} ${o} defined at wrong LET/IN level.`):u&&!d&&c(t.kind===`Function`?`Function name \`${o}' already defined or declared.`:`Operator ${o} already defined or declared.`),t.kind===`Function`?(B(t.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),dc(t.body,o),t.isSelfReferential=uc(t.body,o)):B(t.body,l,a),u&&d?(u.isPending=!1,u.range=s,!1):t.kind===`Function`?u===void 0:As(o,Ds(n,o)??Os(o,a,s),{kind:`Definition`,arity:ws(t),range:s},a)},pc=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Ds(e,t.name)?.isPending)return e;let n={name:t.name,arity:ws(t),params:Ts(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)=>wc(t,e,n),e)};return s(e.reduce((e,t)=>{let a=xs(t.name)?e:s(e,e=>!Cs(t.location,e.location)),o={name:t.name,arity:ws(t),kind:`Definition`,range:t.location.range,parent:a};if(Es(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||xs(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return fc(t,a,u,i)?{...o,params:Ts(t)}:a},a),()=>!0)},mc=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Ds(t,r)??Os(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},hc=(t,n,r)=>{if(t.kind!==`Identifier`&&t.kind!==`Apply`)return!1;let i=mc(t.kind===`Identifier`?t.name:t.operator,n,r),a=t.kind===`Apply`?t.argumentCounts?.[0]??0:0;if(!i||a===i.arity)return!1;let o=(t.kind===`Apply`?t.argumentRanges?.[0]:void 0)??t.location.range;return o&&r.errors.push({location:e.X(o),message:`The operator ${i.name} requires ${i.arity} arguments.`}),!0},gc=(t,n,r)=>{if(hc(t,n,r))return;let i=t.operator,a=zs(i,n,r),o=cc(t,i,n,r);if(o===void 0)return;if(o!==t.args.length){r.errors.push({location:e.X(t.argumentsRange??Vs(t,i)),message:`The operator ${i} requires ${o-(mc(i,n,r)?.arity??0)} arguments.`});return}let s=a&&(a.kind===`Definition`?a.params:[]);if(s===void 0){t.args.forEach(e=>_c(e,n,r));return}let c=(t,n)=>{t&&r.errors.push({location:e.X(t),message:n})};t.args.map((e,a)=>{let o=s[a]??0,l=e.location.range;if(o===0){if(e.kind===`Lambda`&&e.operator!==void 0)c(l,`The operator ${e.operator} requires 1 arguments.`);else if(e.kind===`Lambda`&&l)c(l,`LAMBDA expression used where an expression is required.`);else if(e.kind===`OperatorReference`){let t=cc(e,e.operator,n,r);t!==void 0&&c(l,`The operator ${e.operator} requires ${t} arguments.`)}else B(e,n,r);return!0}if(e.kind===`Lambda`){B(e,n,r);let s=e.params.length===o;return!s&&vs.has(e)?c(l,`Expected arity ${o} but found operator of arity ${e.params.length}.`):!s&&l&&e.operator===void 0&&c(t.selectorRanges?.at(-1)??Vs(t,i),`Lambda expression with arity ${e.params.length} used as argument ${a+1} of operator \`${i}', \nbut an operator of arity ${o} is required.`),s}if(e.kind===`Subexpression`)return B(e,n,r),!0;if(e.kind===`Apply`&&e.argumentCounts?.at(-1)===0){let t=e.argumentCounts.findIndex(e=>e>0);return c(e.selectorRanges?.[t],`Selector \`${e.operator.split(`!`)[t]}' should not have argument(s).`),!1}if(e.kind!==`Identifier`&&e.kind!==`OperatorReference`)return c(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${i}', in a position an operator is required.`),!1;let u=e.kind===`Identifier`?e.name:e.operator,d=zs(u,n,r)?.params??[],f=cc(e,u,n,r);return e.kind===`Identifier`&&f!==void 0&&f!==o&&c(Vs(e,u),`Expected arity ${o} but found operator of arity ${f}.`),f===o&&d.every(e=>e===0)}).forEach((e,n)=>{e||c(t.location.range,`Argument number ${n+1} to operator '${i}' \nshould be a ${s[n]}-parameter operator.`)})},_c=(e,t,n)=>{e.kind===`Identifier`?cc(e,e.name,t,n):B(e,t,n)},vc=(e,t,n)=>{let r=ys.get(e);return r?(r.args.forEach(e=>_c(e,t,n)),n.errors.push(r.error),!0):!1},B=(t,n,r)=>{if(vs.has(t)&&!r.isGenerated){B(t,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>B(e,n,r)),a=e=>({...r,labelParams:[...r.labelParams,...e]});switch(t.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(hc(t,n,r))return;let i=t.name,a=cc(t,i,n,r);a!==void 0&&a>0&&r.errors.push({location:e.X(Vs(t,i)),message:`The operator ${i} requires ${a} arguments.`});return}case`OperatorReference`:cc(t,t.operator,n,r);return;case`Apply`:gc(t,n,r);return;case`Lambda`:B(t.body,Ns(n,t.params,t.paramRanges,r),a(t.params));return;case`And`:case`Or`:i(t.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:B(t.expression,n,r);return;case`If`:i([t.condition,t.consequent,t.alternative]);return;case`Case`:i(t.arms.flatMap(e=>[e.condition,e.body])),t.other&&B(t.other,n,r);return;case`Let`:B(t.body,pc(t.definitions,n,r,t.instances),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:B(t.body,lc(t.bounds,n,r),a(Is(t.bounds)));return;case`UnboundedQuantifier`:B(t.body,Ns(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&B(t.set,n,r),B(t.body,Ns(n,Fs(t.pattern),t.pattern.ranges,r),a(Fs(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:B(t.predicate,lc([t.bound],n,r),a(Fs(t.bound.pattern)));return;case`SetMap`:B(t.expression,lc(t.bounds,n,r),a(Is(t.bounds)));return;case`FunctionSet`:i([t.domain,t.range]);return;case`Record`:case`RecordSet`:t.fields.forEach((i,a)=>{t.fields.slice(0,a).some(e=>e.name===i.name)&&r.errors.push({location:e.X(i.location.range??Bs(i.location,i.name)),message:`Non-unique fields in constructor.`}),B(i.value,n,r)});return;case`Except`:B(t.function,n,r),t.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),B(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:i([t.function,...t.args]);return;case`FieldAccess`:B(t.record,n,r);return;case`Product`:i(t.factors);return;case`BoxAction`:case`AngleAction`:i([t.action,t.subscript]);return;case`WeakFairness`:case`StrongFairness`:i([t.subscript,t.action]);return;case`Label`:if(ac(t,r))return;B(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),oc(t,n,r);return;case`Subexpression`:if(vc(t,n,r))return;t.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>_c(e,n,r)),sc(t,n,r,!1)}},yc=(t,n,r)=>t.forEach(t=>{if(t.kind===`ModuleFact`||hc(t,n,r)||sc(t,n,r,!0))return;let i=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;t.kind===`Identifier`&&Ds(n,i)?.isNonFact?r.errors.push({location:e.X(Vs(t,i)),message:`Step number of non-fact used as a fact`}):r.facts.has(i)||B(t,n,r)}),bc=(e,t,n)=>(e.set&&B(e.set,t,n),js(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),xc=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:bc(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?xc(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},Sc=(e,t,n)=>e.kind===`AssumeProve`?xc(e,t,n):(B(e,t,n),t),Cc=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&yc(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Tc(t,e,r),t)},wc=(e,t,n)=>{let r=jc(e,t,n);return e.name===void 0?r:js(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Tc=(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=Sc(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Cc(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Cc(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 yc(r.facts,t,n),o(t);case`Instance`:return o(wc(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?wc(t,e,i):pc([t],e,n),t));case`Have`:case`Case`:return B(r.expression,t,i),Cc(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>B(e,t,i)),a(t);case`Take`:return a(Ns(lc(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Ns(lc(r.bounds,t,i),r.names,r.nameRanges,i);return B(r.body,o,{...i,labelParams:[...i.labelParams,...Is(r.bounds),...r.names]}),Cc(e.proof,a(t),n),a(o)}default:return Cc(e.proof,a(t),n),a(t)}},Ec=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Sc(e.statement,void 0,t);e.name!==void 0&&Ms(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Cc(e.proof,n,t),r&&(r.isInProof=!1)},Dc={line:0,column:0},Oc=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),kc=(e,t)=>{let n=new Map([...Ss,...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},Ac=(t,n,r,i,a)=>{let o=t.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(n,r)=>{if(n.arity===0||r.kind!==`Identifier`){B(r,o,a);return}let i=cc(r,r.name,o,a);if(i!==void 0&&i!==n.arity)throw new e.F(`An operator must be substituted for symbol '${n.name}', and it must have arity ${n.arity} in the instance of ${t.module} at line ${t.location.line}, column ${t.location.column}`)},c=/* @__PURE__ */ new Map;t.substitutions.forEach(t=>{let r=t.name,i=n.find(e=>e.name===r);if(!i){a.errors.push({location:e.X(t.nameRange),message:`Identifier '${r}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let o=t.expression;s(i,o);let l=o.location.range;c.has(r)?l&&a.errors.push({location:e.X(l),message:`Multiple substitutions for symbol '${r}' in substitution.`}):c.set(r,o)});let l=n.filter(e=>!c.has(e.name)),u=e=>!Ds(o,e.name)&&!Rs(e.name,a);return l.filter(e=>!u(e)).forEach(e=>{let n={kind:`Identifier`,name:e.name,location:t.location};s(e,n),c.set(e.name,n)}),l.filter(u).forEach(n=>{let i=t.location.range,o=n.location.range;i&&o&&a.errors.push({location:e.X(i),message:`Substitution missing for symbol ${n.name} declared at ${e.X(o)} \nand instantiated in module ${r}.`})}),c},jc=(e,t,n)=>{let r=n.getInstance(e);return Ac(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>js(e,t,r,n),t)},Mc=(e,t,n,r)=>{let i=kc(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Ac(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:Dc}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Nc=(t,n)=>{let r=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return t.toSorted((e,t)=>Cs(e.location,t.location)?-1:+!!Cs(t.location,e.location)).forEach(t=>{let a=[],o=[];try{t.check(a,o)}catch(t){if(!(t instanceof e.F)||!t.sany&&a.length===0)throw t;a.push(...t.sany?.errors??[])}a.forEach(e=>i(r,e)),o.forEach(e=>i(n,e))}),r},Pc=(t,n)=>{let r=kc(t,n.imported),i=/* @__PURE__ */ new Set([...n.facts,...[...t.theorems,...t.assumptions].flatMap(e=>e.name??[])]),a=new Map(t.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),o=new Map([...Ss,...n.bound].map(([e,t])=>[e,{...t,position:Dc}])),s=/* @__PURE__ */ new Set,c=[],l=(e,t,s,c,l)=>({imported:r,getInstance:n.getInstance,definitions:n.definitions,getKey:n.getKey,location:e,self:t,facts:i,goals:a,bindings:o,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),u=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>Ms(e.name,{kind:t,arity:e.arity,range:e.location.range},l(e.location,void 0,n,r,!1))}));return Nc([...n.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...u(t.constants,`Constant`),...u(t.variables,`Variable`),...t.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=As(e.name,o.get(e.name),r,l(e.location,void 0,t,n,!1));i&&(o.set(e.name,r),s.add(r)),c.push({declaration:e,binding:i?r:void 0})}})),...t.definitions.map(e=>({location:e.location,check:(n,r)=>{let i=l(e.location,e,n,r,!0);Oc(t,e)?B(e.body,void 0,i):fc(e,void 0,i,s)&&o.set(e.name,{kind:`Definition`,arity:ws(e),range:e.location.range,position:e.location})}})),...t.instances.map(e=>({location:e.location,check:(t,r)=>{let i=l(e.location,void 0,t,r,!1);Ps(void 0,e.params,i),n.instanced.get(e)?.forEach((e,t)=>Ms(t,e,i)),e.name!==void 0&&Ms(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...t.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=l(e.location,void 0,t,n,e.name!==void 0);B(e.expression,void 0,r),e.name!==void 0&&Ms(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...t.theorems.map(e=>({location:e.location,check:(t,n)=>Ec(e,l(e.location,void 0,t,n,e.name!==void 0))})),...t.uses.map(e=>({location:e.location,check:(t,n)=>yc(e.facts,void 0,l(e.location,void 0,t,n,!1))})),{location:t.location.range?.end??t.location,check:t=>c.forEach(n=>{let r=n.declaration.location.range;r&&(!n.binding||n.binding.isPending)&&t.push({location:e.X(r),message:`Symbol ${n.declaration.name} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},Fc=/* @__PURE__ */ new WeakSet,Ic=/* @__PURE__ */ new WeakMap,Lc=(e,t)=>{if(t.length===0)return e;let n={...e};return Fc.has(e)&&Fc.add(n),Ic.set(n,[...t,...Ic.get(e)??[]]),n},Rc=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Wc(e,(e,r)=>Rc(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&O(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&O(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},zc=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Bc=/* @__PURE__ */ new WeakMap,Vc=e=>Bc.get(e)??e.name,Hc=(e,t)=>(Vc(t)!==e.name&&Bc.set(e,Vc(t)),e),Uc=(e,t)=>Hc(e.kind===`Function`?{...e,bounds:zc(e.bounds,e=>t(e,[])),body:t(e.body,Is(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Wc=(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=>Uc(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:zc(e.bounds,n),body:t(e.body,Is(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,Fs(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,Fs(e.bound.pattern))};case`SetMap`:return{...e,bounds:zc(e.bounds,n),expression:t(e.expression,Is(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)}}},Gc=`LAMBDA`,Kc=e=>`${e}@SUBSTITUTION`,qc=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(qc),Jc=(e,t)=>{if(e.kind!==`Identifier`)return!qc(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=O(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!qc(n.body)},Yc=(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 Wc(e,(e,n)=>(r.push(...Yc(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Xc=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}},Zc=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Qc=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},$c=(e,t)=>e.map(e=>({pattern:Qc(e.pattern,t),set:e.set})),el=(e,t)=>e.kind===`Function`?{...e,bounds:$c(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},tl=(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=>Hc({...el(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:$c(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Qc(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Qc(e.bound.pattern,n),set:e.bound.set}};default:return e}},nl=e=>`${e}@ENABLED`,rl=(e,t)=>e.modes.get(t)??e,il=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!O(e)&&t.instantiation.variables.has(e.name),al=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>al(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=O(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?al(r.body,t,/* @__PURE__ */ new Map):void 0},ol=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return il(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:nl(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:dl(e.expression,rl(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[dl(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:dl(e.subscript,rl(t,`Primed`),n),location:r},dl(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=al(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:nl(r),location:e.location},location:e.location},dl({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},sl=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:_s}),cl=(e,t)=>e.map(e=>sl(e.name,t)),ll=(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:[...cl(t,r),...i.map(e=>sl(e,r))],location:r},location:r}},ul=(e,t)=>e.instantiation.isParameterized(t)?pl(e,t):void 0,dl=(t,n,r)=>{let i=e=>dl(e,n,r),a=n.instantiation,o=a.params,s=e=>!r.has(e)&&!O(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:dl(t.expression,rl(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:dl(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},rl(n,`Enabled`),r)};let c=ol(t,n,r);if(c)return c;if(t.kind===`Identifier`&&s(t.name)){let e=a.substitutions.get(t.name),r=n.bindings;if(e&&(r===void 0||!Jc(e,a)))return Lc(e,[t]);if(e&&r){let n=Kc(t.name);return r.set(n,e),sl(n,t.location)}let i=ul(n,t.name);if(i===void 0)return t;if(o.length===0)return{...t,name:i};let s=a.getDefinition(t.name);return s&&ws(s)>0?ll(i,o,ws(s),t.location):{kind:`Apply`,operator:i,args:cl(o,t.location),location:t.location}}if(t.kind===`Apply`&&s(t.operator)){let r=t.args.map(i),s=a.substitutions.get(t.operator),c=a.substitutions.size>0||o.length>0||Fc.has(t),l=e=>(c&&Fc.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let e=s.kind===`Identifier`?s.name:s.operator;return l({...t,operator:e,args:r,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...t,operator:s.operator,args:[...s.args,...r],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Gc,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:Gc,args:r,resolution:_s},location:t.location};if(s)throw new e.F(`The operator ${t.operator} can only be substituted by an operator at line ${t.location.line}, column ${t.location.column}`);let u=ul(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[...cl(o,t.location),...r]}}if(t.kind===`OperatorReference`&&s(t.operator)){let e=ul(n,t.operator);if(e===void 0)return t;let r=a.getDefinition(t.operator);return o.length>0&&r?ll(e,o,ws(r),t.location):{...t,operator:e}}let l=Xc(n),u=Wc(t,(e,t)=>t.length===0?i(e):dl(e,n,Zc(r,t,l)));return tl(u,r,l)},fl=(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:sl(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},pl=(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=Xc(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=el(Uc(i,(e,t)=>dl(e,s,Zc(/* @__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&&Ic.set(l,[u,...Ic.get(i.body)??[]]),fl({...c,body:l},r.params,i.location)}):t},ml=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Yc(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=>ul(i,e)??e,getQualifiedKey:t=>{let n=ul(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>fl(r,e.params,r.location)):t}}},hl=e=>e.kind===`Let`&&e.instances!==void 0||Be(e).some(hl),gl=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Wc(e,e=>gl(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Cs(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}},_l=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,vl=(e,t)=>e.definitions.some(e=>hl(e.body))||e.assumptions.some(e=>hl(e.expression))||e.theorems.some(e=>{let t=_l(e);return t!==void 0&&hl(t)})?{...e,definitions:e.definitions.map(e=>Uc(e,e=>gl(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:gl(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=_l(e);return n===void 0?e:{...e,statement:gl(n,t,[])}})}:e,yl=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}])),bl={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]}},xl=(e,t)=>{let n=bl[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Sl=(e,t)=>`${e}${t}`,Cl=(e,t,n)=>`${e}${t}${n}`,wl=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Tl=(e,t,n)=>`${e},${t},${n}`,El=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Dl=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Ol=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),kl=(e,t,n,r)=>({...El(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Al=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,jl=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Ml=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,{...kl(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Nl=kl(`$Set`,0,[2],[1]),Pl=kl(`$Junction`,0,[3],[1]),Fl=kl(`$Choose`,0,[2],[1]),Il=kl(`$Function`,0,[3],[1]),Ll=kl(`$FcnApply`,0,[2,2],[1,1]),Rl=kl(`$RcdSelect`,0,[2,0],[1,1]),zl=kl(`'`,2,[1],[0]),Bl=kl(`ENABLED`,1,[2],[0]),Vl=kl(`[]`,3,[3],[0]),Hl=kl(`$SquareAct`,2,[2,1],[0,0]),Ul=kl(`$WF`,3,[1,2],[0,0]),Wl=kl(`$TemporalExists`,3,[3],[0]),Gl=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Kl=e=>e.map(e=>({name:e,arity:0})),ql=(t,n)=>n.location.range?e.J(`${t}.`,n.location.range):new e.F(`${t} at line ${n.location.line}, column ${n.location.column}`),Jl=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Yl=e=>e.kind!==`Let`&&e.kind!==`Label`,Xl=t=>{let n=/* @__PURE__ */ new Map,r=(e,n)=>{let r=n.get(e);if(r?.kind===`Formal`)return{kind:`Declared`,name:e,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:ee(r.definition,r.scope)};if(t.constants.has(e))return{kind:`Declared`,name:e,level:0,arity:0};if(t.variables.has(e))return{kind:`Declared`,name:e,level:1,arity:0};let i=t.getDefinition(e);if(i){let n=ee(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Ml.get(e)??yl.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},i=(e,t,n)=>{let r=El(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(Cl(e,n,t))}),t.data.constraints.forEach((e,t)=>Dl(r.constraints,t,e)),Ol(r.argConstraints,Sl(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Ol(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},a=(t,n,r=[],i=[])=>{let a=e=>i.includes(e);if(n.forEach((n,r)=>{if(!(n.operator||n.declared)&&n.data.level>Al(t,r))throw new e.F(`Level error in applying operator ${t.name}:\nThe level of argument ${r+1} exceeds the maximum level allowed by the operator`)}),r.some(e=>e.level>2))throw new e.F(`Level error in applying operator ${t.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let o=e=>{let r=t.formals.findIndex(t=>t.name===e);return r===-1?void 0:n[r]},s=(e,n,r)=>t.conditions.has(Tl(e,n,r)),c=El(Math.max(t.level,...n.filter((e,n)=>jl(t,n)===1).map(e=>e.data.level),...r.map(e=>e.level)));return t.params.forEach(e=>c.params.add(e)),n.forEach((e,n)=>{jl(t,n)===1&&e.data.params.forEach(e=>c.params.add(e))}),r.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),t.constraints.forEach((e,t)=>Dl(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||Dl(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>Dl(c.constraints,t,e))),n.forEach((e,n)=>e.data.params.forEach(e=>{a(e)||Dl(c.constraints,e,Al(t,n))})),n.forEach((e,t)=>{let r=e.operator;r&&n.forEach((e,n)=>r.formals.forEach((i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>Dl(c.constraints,e,Al(r,a)))}))}),t.argParams.forEach(e=>{let t=wl(e),n=o(t.operator)?.operator;n&&Dl(c.constraints,t.param,Al(n,t.index))}),[t.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Ol(c.argConstraints,t,e))),n.forEach((e,r)=>{let i=e.declared;i&&(Array.from({length:i.arity},(e,n)=>Ol(c.argConstraints,Sl(i.name,n),t.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&Ol(c.argConstraints,Sl(i.name,a),e.data.level)})))}),t.argParams.forEach(e=>{let t=wl(e),n=o(t.operator);n&&Ol(c.argConstraints,Sl(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a(wl(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),t.argParams.forEach(e=>{let t=wl(e),n=o(t.operator);if(n)n.declared&&c.argParams.add(Cl(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(Cl(t.operator,t.index,e)))}}),n.forEach((e,t)=>{let r=e.declared;r&&n.forEach((e,n)=>Array.from({length:r.arity},(i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>c.argParams.add(Cl(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,Kl(e.params),e.body,t);return{data:n,operator:n}}let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let i=r(n,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=El();return e.params.add(n),{data:e,declared:{name:n,arity:i.arity}}}if(e.kind===`OperatorReference`)return{data:El()}}return{data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=Gl(n,Kl(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 ql(`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 ql(`Action used where only temporal formula or state predicate allowed`,e);Jl.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Yl(n)&&n.kind!==r)throw ql(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=ee(e,n);t.constraints.forEach((e,t)=>Dl(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Ol(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(t,n)=>{try{return h(t,n)}catch(n){throw!(n instanceof e.F)||n.sany?n:ql(n.message,t)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return El();case`Identifier`:return l(r(e.name,t),[]);case`Apply`:{let n=s(e.args,t);return d(e,n),l(r(e.operator,t),n)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(Pl,n)}case`Prime`:case`Unchanged`:return c(zl,[e.expression],t);case`Enabled`:return c(Bl,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(Vl,[n])}case`If`:return c(Pl,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(Pl,[...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(Pl,[e.body],t,e.bounds.map(e=>e.set),Is(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw ql(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?Wl:Pl,[e.body],t,[],e.names);case`Choose`:return c(Fl,[e.body],t,e.set?[e.set]:[],Fs(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(Nl,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(Nl,[e.predicate],t,[e.bound.set],Fs(e.bound.pattern));case`SetMap`:return c(Nl,[e.expression],t,e.bounds.map(e=>e.set),Is(e.bounds));case`FunctionConstruction`:return c(Il,[e.body],t,e.bounds.map(e=>e.set),Is(e.bounds));case`Record`:return c(Il,e.fields.map(e=>e.value),t);case`RecordSet`:return c(Nl,e.fields.map(e=>e.value),t);case`Except`:return c(Nl,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(Ll,[o(e.function,t),e.args.length===1?o(e.args[0],t):{data:c(Nl,e.args,t)}]);case`Bracket`:return El();case`FieldAccess`:return a(Rl,[o(e.record,t),{data:El()}]);case`BoxAction`:case`AngleAction`:return c(Hl,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(Ul,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return El()}},g=(e,t,n=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,r=n,a=t)=>g(e,a,r,i),o=(e,o)=>{let s=r(e,t);s.kind===`Declared`?(n&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,n||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return Be(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,Gl(t,Kl(e.names))),i;default:return Wc(e,(e,r)=>(a(e,n,Gl(t,Kl(r))),e)),i}},_=(e,t,n,r)=>{let i=Gl(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...El(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(Sl(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(Cl(e.name,n,t.name))).map(e=>Tl(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(wl(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=wl(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},ee=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{...El(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,t);return n.set(e,o),o};return{analyze:m,analyzeDefinition:ee,toOperand:o}},Zl=(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`?Zl(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=El(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Dl(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ol(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},Ql=(t,n,r,i)=>{let a=Xl(n),o=e=>Math.max(0,...e.map(e=>a.analyze(e,/* @__PURE__ */ new Map).level)),s=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?o([t.expression]):t.kind===`Witness`?o(t.expressions):t.kind===`Take`?o(t.bounds.map(e=>e.set)):t.kind===`Pick`?o([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?Zl(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},c=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=e.X(t.statement),r=()=>s(t)===0;return t.body.kind===`Have`||t.body.kind===`Take`||t.body.kind===`Witness`?r()?[]:[{location:n,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:t.body.kind===`Case`?[...r()?[]:[{location:n,message:`Non-constant CASE for temporal goal.`}],...c(t.proof)]:t.body.kind===`Qed`?c(t.proof):[]}):[],l=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=t.body,r=()=>s(t)===3,i=n.kind===`Pick`&&n.bounds.length>0&&r()?n.bounds.filter(e=>o([e.set])!==0).flatMap(t=>t.set.location.range?[{location:e.X(t.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(t.proof),...i,...t.proof?.kind===`Steps`&&r()?c(t.proof):[]]}):[],u=Nc([...t.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>a.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...t.assumptions.map(e=>({location:e.location,check:()=>a.analyze(e.expression,/* @__PURE__ */ new Map)})),...t.theorems.map(t=>({location:t.location,check:()=>{let n=t.statement.kind===`AssumeProve`?Zl(t.statement,/* @__PURE__ */ new Map,a):a.analyze(t.statement,/* @__PURE__ */ new Map),r=[...l(t.proof),...n.level===3?c(t.proof):[]];if(r.length>0)throw e.q(r)}})),...r],i);if(u.length>0)throw e.q(u,!1,void 0,i)},$l=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),eu=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),tu=/* @__PURE__ */ new Set([...$l,...eu,`Enabled`]),nu=/* @__PURE__ */ new Set([`~>`,`-+->`]),ru=/* @__PURE__ */ new Set([...nu,`\\cdot`]),iu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),au=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),ou=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},su=(e,t)=>iu.has(e)||t.builtins.get(e)?.isStateLevel===!0,cu=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if($l.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(eu.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&nu.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(tu.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&ru.has(e.operator))&&(r[0]|=1),tu.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=ou(e);if(u!==void 0&&!O(e)){let e=t.substitutions.get(u)??u,n=t.definitions.get(e),a=t.constants.has(u),o=t.variableIndex.get(u);if((o!==void 0||t.builtins.get(u)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=1),o!==void 0&&(l&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:l});else{su(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),au.has(u)&&(r[0]|=8),!a&&su(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}Be(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},lu=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],uu=(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},du=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),fu=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=cu(lu(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=uu(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=uu(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!du(t[e],l[e*r])))),p=uu(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}},pu=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?mu(lu(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},mu=(e,t)=>{let n=t.facts.words,r=cu(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=pu(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]}du(e.callee,r[0])||(i[0]|=r[0]&14)}),i},hu=(e,t)=>!(pu(e,t)[0]&1),gu={any:2,repeated:4,streamed:8},_u=(e,t,n=`any`)=>(pu(e,t)[0]&gu[n])!==0,vu=(e,t)=>{let n=pu(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},yu=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},bu=(e,t)=>{let n=mu([e],t);return n[0]&16?void 0:yu(n)},xu=(e,t)=>!!(mu([e],t)[0]&1),Su=(t,n,r)=>new e.O(`Applying ${t} to the following value,\nwhich is not ${n}:\n${L(r)}`),Cu=e=>M(e)?I(e):void 0,wu=`a function with a finite domain`,Tu=(e,t,n)=>{let r=R(e,t,n),i=Cu(r);if(!i)throw Su(n,wu,r);return i},Eu=(e,t)=>{let n=R(e,1,t),r=Cu(n),i=r&&Au(r,R(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw Co(`second`,t,`bag`,n);return i},Du=(e,t,n)=>{let r=t[n];if(!r||!ku(r))throw Co(n===0?`first`:`second`,`(+)`,`bag`,R(e,n,`(+)`));return r},Ou=(e,t)=>{if(!j(e)||!P(e))throw t();return F(e).elements},ku=e=>e.range.every(e=>typeof e==`number`&&e>0),Au=(e,t)=>{let n=e.domain.findIndex(e=>mr(t,e));return n===-1?void 0:e.range[n]},ju=t=>{if(typeof t==`number`)return t;let n=`tlc2.value.impl.${Ro(t)}`;throw new e.b(`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},Mu=(e,t)=>{let n=ju(e)+ju(t);if(Mo(n))throw No(`${e}+${t}`);return n},Nu=(e,t,n)=>{let r=ju(e.range[t]),i=Au(n,e.domain[t]);if(i===void 0)return r;let a=r-ju(i);if(Mo(a))throw No(`${r}-${i}`);return a},Pu=(e,t,n,r=e.length)=>{let i=e.slice(0,r).find(e=>mr(t,e[0]));i?i[1]=Mu(i[1],n):e.push([t,n])},Fu=e=>e.domain.map((t,n)=>[t,e.range[n]]),Iu=Cn([],[]),Lu=t=>[Oo(`EmptyBag`,Iu),z(`IsABag`,1,e=>{let t=Cu(R(e,0,`IsABag`));return t!==void 0&&ku(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`);return Tu(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Su(`BagCardinality`,`a bag`,t);return Mu(e,n)},0)}),z(`BagIn`,2,e=>{let t=Eu(e,`BagIn`);return t!==void 0&&t>0}),z(`CopiesIn`,2,e=>Eu(e,`CopiesIn`)??0),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>Cu(R(e,t,`(+)`))),n=Du(e,t,0),r=Du(e,t,1),i=Fu(n);return r.domain.forEach((e,t)=>Pu(i,e,r.range[t],n.domain.length)),Cr(i)}),z(`\\ominus`,2,e=>{let t=R(e,0,`(-)`),n=R(e,1,`(-)`),r=Cu(t),i=Cu(n);if(!r)throw Co(`first`,`(-)`,`bag`,t);if(!i)throw Co(`second`,`(-)`,`bag`,n);return Cr(r.domain.flatMap((e,t)=>{let n=Nu(r,t,i);return n>0?[[e,n]]:[]}))}),z(`BagUnion`,1,t=>{let n=R(t,0,`BagUnion`),r=Ou(n,()=>Su(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??Iu;let i=t=>{let r=Cu(t);if(!r)throw new e.O(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${L(n)}`);return r},a=Fu(i(r[0]));return r.slice(1).forEach(e=>{let t=i(e);t.domain.forEach((e,n)=>Pu(a,e,t.range[n]))}),Cr(a)}),z(`\\sqsubseteq`,2,e=>{let t=R(e,0,`\\sqsubseteq`),n=R(e,1,`\\sqsubseteq`),r=Cu(t),i=Cu(n);if(!r)throw Su(`\\sqsubseteq`,wu,t);if(!i)throw Su(`\\sqsubseteq`,wu,n);return r.domain.every((e,t)=>{let n=Au(i,e);return ju(r.range[t])<=(n===void 0?0:ju(n))})}),ko(`BagOfAll`,2,e=>{let t=Do(e,0,`BagOfAll`),n=R(e,1,`BagOfAll`),r=Cu(n);if(!r)throw Co(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[];return r.domain.forEach((e,n)=>Pu(i,t.call([e]),r.range[n])),Cr(i)}),z(`SubBag`,1,n=>{let r=R(n,0,`SubBag`);if(!M(r))throw new e.b(`Attempted to apply the operator DOMAIN to a non-function\n(${zo(r)})\nline 106, col 58 to line 106, col 65 of module Bags`);let i=I(r),a=F(vr(i.range)).elements,o=a.find(e=>typeof e!=`number`);o!==void 0&&t.get(`>=`)?.evaluateBinary?.(a[0],o);let s=i.range.filter(e=>typeof e==`number`);if(s.some(e=>e<1))throw new e.b(`Attempted to apply a function to ${L(i)}, which is not in its domain`);return _r(i.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:s[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Cn(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>Fi(Tu(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=Ou(t,()=>Su(`BagToSet`,wu,t));return Cn([...n],n.map(()=>1))})],Ru={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},V={none:0,beginObject:1,endObject:2,beginArray:3,endArray:4,true:5,false:6,null:7,singleQuoted:8,doubleQuoted:9,unquoted:10,singleQuotedName:12,doubleQuotedName:13,unquotedName:14,number:16,eof:17},zu={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},Bu=[{lower:`true`,upper:`TRUE`,token:V.true},{lower:`false`,upper:`FALSE`,token:V.false},{lower:`null`,upper:`NULL`,token:V.null}],Vu=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
|
|
79
|
-
`],[`r`,`\r`],[`f`,`\f`]]),Hu=1024,Uu=t=>{let n=+!!t.startsWith(``),r=n,i=0,a=n,o=!0,s=V.none,c=0,l=[Ru.emptyDocument],u=[void 0],d=[0],f=()=>`$${l.map((e,t)=>e===Ru.emptyArray||e===Ru.nonemptyArray?`[${d[t]}]`:e===Ru.emptyDocument||e===Ru.nonemptyDocument?``:`.${u[t]??``}`).join(``)}`,p=()=>` at line ${i+1} column ${r-a+1} path ${f()}`,m=t=>new e.b(`com.google.gson.stream.MalformedJsonException: ${t}${p()}
|
|
80
|
-
See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`),h=()=>new e.b(`java.io.EOFException: End of input${p()}`),g=()=>{if(!o)throw m(`Use JsonReader.setStrictness(Strictness.LENIENT) to accept malformed JSON`)},_=e=>`/\\;#=`.includes(e)?(g(),!1):!`{}[]:, \f\r
|
|
81
|
-
`.includes(e),ee=()=>{for(;r<t.length;){let e=t[r++];if(e===`
|
|
82
|
-
`){i++,a=r;return}if(e===`\r`)return}},te=e=>{for(;r+e.length<=t.length;r++)if(t[r]===`
|
|
83
|
-
`)i++,a=r+1;else if(t.startsWith(e,r))return!0;return!1},v=()=>{for(;r<t.length;){let e=t[r++];if(e===`
|
|
84
|
-
`)i++,a=r;else if(e===`/`){if(r===t.length)return e;g();let n=t[r];if(n!==`*`&&n!==`/`)return e;if(r++,n===`/`)ee();else if(te(`*/`))r+=2;else throw m(`Unterminated comment`)}else if(e===`#`)g(),ee();else if(e!==` `&&e!==`\r`&&e!==` `)return e}},ne=()=>{let e=v();if(e===void 0)throw h();return e},y=()=>{let e=Bu.find(e=>t[r]===e.lower[0]||t[r]===e.upper[0]);if(!e)return V.none;let n=e.lower.length;for(let i=0;i<n;i++){let n=t[r+i];if(n!==e.lower[i]&&n!==e.upper[i])return V.none}return r+n<t.length&&_(t[r+n])?V.none:(r+=n,e.token)},re=()=>{let e=zu.none,n=!1,i=0;for(;r+i<t.length;i++){if(i===Hu)return V.none;let a=t[r+i];if(a===`-`){if(e===zu.none)e=zu.sign;else if(e===zu.exponentE)e=zu.exponentSign;else return V.none}else if(a===`+`){if(e!==zu.exponentE)return V.none;e=zu.exponentSign}else if(a===`e`||a===`E`){if(e!==zu.digit&&e!==zu.fractionDigit)return V.none;e=zu.exponentE}else if(a===`.`){if(e!==zu.digit)return V.none;e=zu.decimal}else if(a<`0`||a>`9`){if(_(a))return V.none;break}else if(e===zu.sign||e===zu.none)n=a===`0`,e=zu.digit;else if(e===zu.digit){if(n)return V.none}else e===zu.decimal?e=zu.fractionDigit:(e===zu.exponentE||e===zu.exponentSign)&&(e=zu.exponentDigit)}return i===Hu||e!==zu.digit&&e!==zu.fractionDigit&&e!==zu.exponentDigit?V.none:(c=i,V.number)},b=()=>{let e=l.length-1,n=l[e];if(n===Ru.emptyArray)l[e]=Ru.nonemptyArray;else if(n===Ru.nonemptyArray){let e=ne();if(e===`]`)return V.endArray;if(e===`;`)g();else if(e!==`,`)throw m(`Unterminated array`)}else if(n===Ru.emptyObject||n===Ru.nonemptyObject){if(l[e]=Ru.danglingName,n===Ru.nonemptyObject){let e=ne();if(e===`}`)return V.endObject;if(e===`;`)g();else if(e!==`,`)throw m(`Unterminated object`)}let t=ne();if(t===`"`)return V.doubleQuotedName;if(t===`'`)return g(),V.singleQuotedName;if(t===`}`){if(n!==Ru.nonemptyObject)return V.endObject;throw m(`Expected name`)}if(g(),r--,_(t))return V.unquotedName;throw m(`Expected name`)}else if(n===Ru.danglingName){l[e]=Ru.nonemptyObject;let n=ne();if(n===`=`)g(),t[r]===`>`&&r++;else if(n!==`:`)throw m(`Expected ':'`)}else if(n===Ru.emptyDocument){if(v()===void 0)return V.eof;r--,t.startsWith(`)]}'
|
|
85
|
-
`,r)&&(r+=5),l[e]=Ru.nonemptyDocument}else if(n===Ru.nonemptyDocument){if(v()===void 0)return V.eof;g(),r--}let i=v();if(i===void 0){if(n===Ru.emptyDocument)return V.eof;throw h()}if(i===`]`&&n===Ru.emptyArray)return V.endArray;if(i===`]`||i===`;`||i===`,`){if(n!==Ru.emptyArray&&n!==Ru.nonemptyArray)throw m(`Unexpected value`);return g(),r--,V.null}if(i===`'`)return g(),V.singleQuoted;if(i===`"`)return V.doubleQuoted;if(i===`[`)return V.beginArray;if(i===`{`)return V.beginObject;r--;let a=y();if(a!==V.none)return a;let o=re();if(o!==V.none)return o;if(!_(t[r]))throw m(`Expected value`);return g(),V.unquoted},ie=()=>(s===V.none&&(s=b()),s),ae=()=>{if(r===t.length)throw m(`Unterminated escape sequence`);let e=t[r++];if(e===`u`){if(r+4>t.length)throw m(`Unterminated escape sequence`);let e=t.slice(r,r+4);if(!/^[\da-fA-F]{4}$/.test(e))throw m(`Malformed Unicode escape \\u${e}`);return r+=4,String.fromCharCode(Number.parseInt(e,16))}let n=Vu.get(e);if(n!==void 0)return n;if(e===`
|
|
86
|
-
`)return i++,a=r,e;if(`'"\\/`.includes(e))return e;throw m(`Invalid escape sequence`)},oe=e=>{let n=``,o=r;for(;r<t.length;){let s=t[r++];if(s===e)return n+t.slice(o,r-1);s===`\\`?(n+=t.slice(o,r-1)+ae(),o=r):s===`
|
|
87
|
-
`&&(i++,a=r)}throw m(`Unterminated string`)},se=()=>{let e=r;for(;r<t.length&&_(t[r]);)r++;return t.slice(e,r)},ce=t=>{if(l.length-1>=255)throw new e.b(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${p()}`);l.push(t),u.push(void 0),d.push(0),s=V.none},x=()=>{l.pop(),u.pop(),d.pop(),d[l.length-1]++,s=V.none},le=()=>{let e=ie();return e!==V.endObject&&e!==V.endArray&&e!==V.eof},S=()=>{let e=ie(),t=e===V.unquotedName?se():oe(e===V.singleQuotedName?`'`:`"`);return s=V.none,u[l.length-1]=t,t},ue=e=>e===V.true||e===V.false?e===V.true:e===V.null?null:e===V.number?(r+=c,{literal:t.slice(r-c,r)}):e===V.unquoted?se():oe(e===V.singleQuoted?`'`:`"`),de=()=>{let e=ie();if(e===V.beginArray){ce(Ru.emptyArray);let e=[];for(;le();)e.push(de());return x(),e}if(e===V.beginObject){ce(Ru.emptyObject);let e=/* @__PURE__ */ new Map;for(;le();)e.set(S(),de());return x(),e}let t=ue(e);return s=V.none,d[l.length-1]++,t};if(ie()===V.eof)return null;let fe=de();return o=!1,fe!==null&&ie(),fe},Wu=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),Gu=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),Ku=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),qu=e=>{if(!M(e))return;let t=I(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?Fr(n):void 0},Ju=(t,n)=>{let r=`tlc2.value.impl.${Ro(t)}`,i=`tlc2.value.impl.${n}`;return new e.b(`class ${r} cannot be cast to class ${i} (${r} and ${i} are in unnamed module of loader 'app')`)},Yu=t=>new e.b(`Cannot convert value: unsupported value type tlc2.value.impl.${Ro(t)}`),Xu=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Zu=e=>`[${e.map(td).join(`,`)}]`,Qu=e=>`{${zt(e).map(e=>`${Xu(typeof e[0]==`string`?e[0]:L(e[0]))}:${td(e[1])}`).join(`,`)}}`,$u=e=>{let t=I(e),n=di(t);return n?Zu(n):Qu(t)},ed=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,td=e=>typeof e==`string`?Xu(e):typeof e==`object`?e.kind===`ModelValue`?Xu(e.name):Ro(e)===`RecordValue`?Qu(I(e)):nd(e):String(e),nd=e=>{let t=Ro(e);if(t===`TupleValue`)return Zu(I(e).range);if(ed(t))return $u(e);if(Lr(e))return Zu(F(e).elements);throw Yu(e)},rd=e=>{let t=Ro(e);if(t===`RecordValue`)return Qu(I(e));if(t===`TupleValue`)return`{${I(e).range.map((e,t)=>`"${t}":${td(e)}`).join(`,`)}}`;if(ed(t))return $u(e);throw Yu(e)},id=t=>{if(t===null)throw new e.b(`Cannot convert value: unsupported JSON value null`);if(typeof t==`boolean`)return t;if(typeof t==`string`)return on(t);if(Array.isArray(t))return Pr(t.map(id));if(t instanceof Map)return Fr([...t].map(e=>[on(e[0]),id(e[1])]));let n=Number(t.literal);if(!/^-?\d+$/.test(t.literal)||Mo(n))throw new e.b(`Cannot convert value: expected a 32-bit integer JSON number, but found ${t.literal}`);return n||0},ad=t=>{if(typeof t!=`string`)throw new e.b(`Cannot cast tlc2.value.impl.${Ro(t)} to tlc2.value.impl.StringValue`);return t},od=(e,t)=>{let n=Ni(e,t);if(typeof n!=`string`)throw Ju(n,`StringValue`);return n},sd=t=>{if(!Gu.has(t.toLowerCase()))throw Ku.has(t.toLowerCase())?new e.B(`IOUtils!Serialize does not support the charset ${t}`):new e.b(/^[a-zA-Z\d][\w.:+-]*$/.test(t)?`java.nio.charset.UnsupportedCharsetException: ${t}`:`java.nio.charset.IllegalCharsetNameException: ${t}`)},cd=(t,n,r,i)=>{let a=r.find(e=>!Wu.has(e));if(a!==void 0)throw new e.b(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${a}`);if(r.includes(`READ`))throw new e.b(`java.lang.IllegalArgumentException: READ not allowed`);let o=new Set(r.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:r);if(o.has(`APPEND`)&&o.has(`TRUNCATE_EXISTING`))throw new e.b(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(o.has(`DELETE_ON_CLOSE`))throw new e.B(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let s=t.readFile?.(n);if(s===void 0&&!o.has(`CREATE`)&&!o.has(`CREATE_NEW`))throw new e.b(`java.nio.file.NoSuchFileException: ${n}`);if(s!==void 0&&o.has(`CREATE_NEW`))throw new e.b(`java.nio.file.FileAlreadyExistsException: ${n}`);s===void 0||o.has(`TRUNCATE_EXISTING`)?t.writeFile?.(n,i):t.writeFile?.(n,o.has(`APPEND`)?s+i:i+s.slice(i.length))},ld=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},ud=(t,n)=>{let r=t.readFile?.(n);if(r===void 0)throw new e.b(`${n} (No such file or directory)`);return r},dd=e=>[Ho(Ao(`ToJson`,1,e=>on(td(R(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),Ho(Ao(`ToJsonArray`,1,e=>on(nd(R(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),Ho(Ao(`ToJsonObject`,1,e=>on(rd(R(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),Ho(Ao(`JsonSerialize`,2,t=>{let n=ad(R(t,0,`JsonSerialize`)),r=R(t,1,`JsonSerialize`);if(!di(r)&&!qu(r))throw Co(`second`,`JsonSerialize`,`sequence or record`,r);return ld(e,n),e.writeFile?.(n,td(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`),Ho(Ao(`ndJsonSerialize`,2,t=>{let n=ad(R(t,0,`ndJsonSerialize`)),r=R(t,1,`ndJsonSerialize`),i=di(r);if(!i)throw Co(`second`,`ndJsonSerialize`,`sequence`,r);return ld(e,n),e.writeFile?.(n,i.map(e=>`${td(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`),Ho(Ao(`JsonDeserialize`,1,t=>id(Uu(ud(e,ad(R(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),Ho(Ao(`ndJsonDeserialize`,1,t=>Pr(ud(e,ad(R(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>id(Uu(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],fd=(e,t)=>[Ho(Jo(`Serialize`,3,(n,r)=>{let i=Yo(n,2,`Serialize`)(),a=qu(i);if(!a)throw Co(`third`,`ndJsonSerialize`,`sequence`,i);if(od(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Yo(n,0,`Serialize`)(),s=di(o);if(!s)throw Co(`first`,`Serialize`,`sequence`,o);let c=Yo(n,1,`Serialize`)();if(typeof c!=`string`)throw Co(`second`,`ndJsonSerialize`,`sequence`,c);let l=Ni(a,`openOptions`);if(Ro(l)!==`TupleValue`)throw Ju(l,`TupleValue`);let u=od(a,`charset`),d=I(l).range.map(e=>{if(typeof e!=`string`)throw Ju(e,`StringValue`);return e});return sd(u),cd(e,c,d,s.map(e=>`${td(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)`)],pd={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},md=e=>{let n=[],r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=0,o=bn(),s=e=>n.push(e&255),c=e=>{s(e>>8),s(e)},l=e=>{c(e>>16),c(e)},u=e=>e>32767?l(-e):c(e),d=e=>{s(pd.string),l(0),l(-1),l(e.length),e.split(``).forEach(e=>s(e.charCodeAt(0)))},f=e=>{s(pd.handle),u(e)},p=e=>{if(typeof e==`boolean`){s(pd.boolean),s(+!!e);return}if(typeof e==`number`){s(pd.integer),l(e);return}if(typeof e==`string`){a++,d(e);return}if(e.kind===`ModelValue`){s(pd.modelValue),c(o.indexOf(e));return}if(e.kind===`Interval`){s(pd.interval),l(e.low),l(e.high);return}let t=r.get(e);if(t!==void 0){f(t);return}if(r.set(e,a++),j(e)){let t=F(e).elements;s(pd.set),l(t.length),t.forEach(p);return}let n=I(e),m=En(e);m===`tuple`?(s(pd.tuple),u(n.range.length),n.range.forEach(p)):m===`record`?(s(pd.record),l(n.domain.length),n.domain.forEach((e,t)=>{let r=String(e),o=i.get(r);o===void 0?(i.set(r,a++),d(r)):f(o),p(n.range[t])})):(s(pd.function),u(n.domain.length),s(1),n.domain.forEach((e,t)=>{p(e),p(n.range[t])}))};return p(e),(0,t.gzipSync)(Uint8Array.from(n))},hd=e=>[Ho(Ao(`_TLCTraceSerialize`,2,t=>{let n=ad(R(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,md(R(t,0,`_TLCTraceSerialize`))),!0}),`public static final tlc2.value.IValue tlc2.module._TLCTrace.ioSerialize(tlc2.value.IValue,tlc2.value.impl.StringValue) throws java.io.IOException`)],gd=25214903917n,_d=(1n<<48n)-1n,vd=2147483647,yd=e=>{let t=(BigInt.asUintN(64,e)^gd)&_d,n=e=>(t=t*gd+11n&_d,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^gd)&_d},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<=vd)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},bd=[],xd=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Sd=()=>{for(let e=1277011;bd.length<1341;e++)xd(e)&&bd.push(e);return bd},Cd=e=>{let t=Sd(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},wd=e=>{let t=[],n=e;for(let e=2;e*e<=n;e++)for(;n%e===0;)t.push(e),n/=e;return n>1&&t.push(n),t},Td=e=>{for(let t=Math.max(e,9);;t++){let e=wd(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)}}},Ed=(e,t,n)=>{if(t<=0)return[];let r=Td(t),i=BigInt(n.nextInt(t)),a=BigInt(Cd(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},Dd=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:vd),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},Od=(1n<<63n)-1n-24n,kd=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Od*BigInt(n)+i)%t;return r<0n?r+t:r})},Ad=(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,jd=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Mr(e.domain),n=F(e.range).elements;return{lists:t.map(()=>n),create:e=>Cn(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>F(e).elements),create:t=>Fr(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>F(e).elements),create:Pr}}},Md=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,Nd=(e,t,n,r)=>{if(ri(t))return[];let i=r===`1.7.4`?Dd:Ed;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=Md(t,r)?void 0:jd(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(vd)?kd(e,t,n):i(e,Number(t),n)).map(e=>a.create(Ad(a.lists,e)))}let o=F(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},Pd=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[...wo(t.domain,`RandomElement`,t).elements];return Cn(e,e.map(()=>Pd(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return Fr(t.names.map((e,r)=>[e,Pd(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return Pr(t.factors.map(e=>Pd(e,n)));if(typeof t==`object`&&t.kind===`Interval`){let r=Math.max(0,t.high-t.low+1),i=Math.floor(n.nextDouble()*r);if(i>=r)throw new e.b(`Attempted to retrieve out-of-bounds element from the interval value ${L(t)}.`);return t.low+i}let r=wo(t,`RandomElement`).elements,i=Math.floor(n.nextDouble()*r.length);if(i>=r.length)throw new e.b(`Index ${i} out of bounds for length ${r.length}`);return r[i]},Fd=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Co(t,n,`nonnegative integer`,e);return e},Id=(e,t,n,r)=>_r(Array.from({length:t},()=>_r(e.filter(()=>r.nextDouble()<n)))),Ld=(e,t)=>{let n=`RandomSetOfSubsets`,r=Fd(R(e,0,n),`first`,n),i=Fd(R(e,1,n),`second`,n),a=R(e,2,n);if(!j(a)||!P(a))throw Co(`third`,n,`finite set`,a);let o=F(a).elements;if(o.length<31&&r>2**o.length)throw Co(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw Co(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return Id(o,r,o.length===0?0:i/o.length,t.getRandom())},Rd=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,zd=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,Bd=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(Rd.test(t))return Number(t.replace(/[fFdD]$/,``));let n=zd.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},Vd=e=>z(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=Fd(R(t,0,n),`first`,n),i=R(t,1,n);if(typeof i!=`string`)throw Co(`second`,n,`string literal representing a probability`,i);let a=Bd(i);if(a===void 0||a<0||a>1)throw Co(`second`,n,`string literal does not represent a parsable probability`,i);let o=R(t,2,n);if(!j(o)||ln(o)||!ci(o))throw Co(`third`,n,`finite set`,o);let s=oi(o);if(32-Math.clz32(r)>s&&r>1<<s)throw Co(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return Id(F(o).elements,r,a,e.getRandom())}),Hd=t=>[Ho(z(`RandomSubset`,2,n=>{let r=Fd(R(n,0,`RandomSubset`),`first`,`RandomSubset`),i=R(n,1,`RandomSubset`);if(!Lr(i)||!ci(i))throw Co(`second`,`RandomSubset`,`a finite set`,i);let a=Md(i,t.version);if(a&&a.reduce((e,t)=>e*F(t).elements.length,1)>Et())throw new e.b(Dt());return _r(Nd(r,i,t.getRandom(),t.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),z(`RandomSetOfSubsets`,3,e=>Ld(e,t)),z(`TestRandomSetOfSubsets`,3,e=>Pr(Array.from({length:5},()=>F(Ld(e,t)).elements.length)))],Ud=(e,t=0n)=>{let n=yd(t),r=yd(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Fr([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,getSuccessorAction:()=>void 0,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Ia,getSimulationValue:void 0,getRandom:()=>{let e=a?void 0:o.getCurrentState();return e===void 0?n:(e!==i&&(r.setSeed(o.getFingerprint(e)^BigInt.asUintN(64,t)),i=e),r)},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return o},Wd=e=>Cr([...e.possibleCounts].map(([e,t])=>[e,t])),Gd=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Wd(e)]]),Kd=e=>Fr([[`name`,e??`UnnamedAction`],[`location`,Fr([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),qd=/* @__PURE__ */ new WeakSet,Jd=(e,t)=>{let n=Fr([[`action`,_r(e)],[`state`,_r(t)]]);return qd.add(n),n},Yd=(e,t,n)=>{let r=e.map((e,t)=>Pr([t+1,Fr(Object.entries(e))])),i=r.slice(1).map((e,n)=>Pr([r[n],t[n],e])),a=n?[Pr([r[r.length-1],n.action,r[n.start]])]:[];return Jd([...i,...a],r)},Xd=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Gd(e).get(t)},Zd=(t,n,r,i)=>{if(typeof r==`number`&&r>=0)t.registers.set(r,i);else if(r===`exit`)i===!0&&(t.isStopped=!0);else if(r===`pause`){if(i!==!0||!t.pause)return;n(`Press enter to resume model checking.`),t.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))t.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))t.properties.set(r.slice(2),L(i));else throw new e.O(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${L(r)}`)},Qd=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:H(e),$d=e=>e.every(e=>e!==void 0),ef=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!O(e);if(i&&t.variableIndex.has(r))return 1;let a=Be(e).map(e=>ef(e,t,n)),o=i?Dh(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(ef(o.body,t,n))),Math.max(0,...a)},tf=(t,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[Jo(`AssertError`,2,t=>{let r=Do(t,0,`AssertError`).expression;if(r&&r.kind!==`String`)throw new e.b(`In computing AssertError, a non-string expression (${Qd(r)}) was used as the err of an AssertError(err, exp).`);let i=Yo(t,0,`AssertError`)();try{Yo(t,1,`AssertError`)()}catch(t){if(t instanceof e.b)return ot(t.message,n.isTool)===i;throw t}return!1}),Ao(`TLCGetOrDefault`,2,e=>Xd(n,R(e,0,`TLCGetOrDefault`))??R(e,1,`TLCGetOrDefault`)),Ao(`Trace`,0,(t,r)=>{let i=r?.environment.variables??[],a=r?.state??i.map(()=>void 0);if(!r||!$d(a)){let t=i.filter((e,t)=>a[t]===void 0);throw new e.b(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${t.length>1?`s`:``} ${t.join(`, `)} undefined).`)}return r.state?Pr(n.getBehavior(a).map(e=>{let t=r.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return Fr(i===void 0?t:[[`_action`,i],...t])})):Pr([Fr([])])}),Ao(`CounterExample`,0,()=>n.counterExample??Jd([],[])),z(`ToTrace`,1,t=>{let n=R(t,0,`ToTrace`);if(typeof n!=`object`||!qd.has(n))throw new e.O(`The argument of ToTrace should be a CounterExample, but instead it is:\n${L(n)}`);let r=F(Ni(n,`state`)).elements.map(e=>di(e)??[]);return Pr(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,t=>{let n=R(t,0,`TLCModelValue`);if(typeof n!=`string`)throw new e.O(`The argument of ModelValue should be a string, but instead it is:\n${L(n)}`);return yn(n)}),Jo(`TLCDefer`,1,(e,t)=>{let r=Do(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{W(r,{...t,next:e})}),!0}),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),{...Jo(`PickSuccessor`,1,(r,i)=>{let a=i?.next??(i?.environment.variables??[]).map(()=>void 0);if(!$d(a)||i?.next&&n.isSeen(a))return!0;let o=Do(r,0,`PickSuccessor`),s=o.call([]);if(typeof s!=`boolean`)throw new e.b(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${zo(s)}) was used as the condition of an IF.\n${o.expression?Qd(o.expression):``}`);if(s||!i?.next||!i.state||!$d(i.state))return!0;let c=n.getSuccessorAction(i.state,a);throw t(Ye(n.isTool,Ke.moduleOverrideStdout,qe.none,`Extend behavior of length ${n.getLevel(i.state)} with a "${c?.name}" step [<Action ${c?.location.range&&e.X(c.location.range)}>]? (Yes/no/explored/states/diff):`)),new e.v}),isActionLevel:!0},Jo(`TLCCache`,2,(e,t)=>{let i=Do(e,0,`TLCCache`),o=ea(Yo(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=ef(s,t.environment,/* @__PURE__ */ new Set);if(c===2)return i.call([]);let l=c===1;if(l&&t.state&&n.getSimulationValue===void 0)return i.call([]),i.call([]);let u=l&&t.state?a(t.state):r,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=i.call([]);return d.set(o,p),p}),z(`TLCFP`,1,e=>{let t=R(e,0,`TLCFP`),n=Gi(t);if(n)throw n;return Number(BigInt.asIntN(32,Ia([t])))}),Jo(`TLCEvalDefinition`,1,(t,n)=>{let r=Yo(t,0,`TLCEvalDefinition`)();if(typeof r!=`string`)throw new e.O(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${L(r)}`);let i=n?Dh(r,n.environment):void 0,a=i?void 0:n?.environment.builtins.get(r);if(a?.arity===0)return a.evaluate([],n);if(!i||!n)throw new e.O(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${L(r)}`);if(i.kind===`Operator`&&i.params.length>0){let t=i.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new e.O(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${r}(${t.join(`, `)})`)}return i.kind===`Operator`?W(i.body,n):W({kind:`Identifier`,name:r,location:i.location},n)})]},nf=(e,t)=>[Ao(`_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}),Ao(`_Counts`,0,()=>Wd(t)),Ao(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(Wd(t),!0)),!1)}),Ao(`_PrintCounts`,0,()=>(e(L(Wd(t),!0)),!0))],rf=e=>String(e).padStart(2,`0`),af=e=>`${e.getUTCFullYear()}.${rf(e.getUTCMonth()+1)}.${rf(e.getUTCDate())}.${rf(e.getUTCHours())}${rf(e.getUTCMinutes())}${rf(e.getUTCSeconds())}`,of=e=>Cr([...e].map(([e,t])=>[e,Pr([t])])),sf=e=>Tn(wr(e),`record`),cf=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),lf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),uf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),df=(t,n,r)=>{if(t.version===`1.7.4`?!lf.has(n)||!t.isStarted&&uf.has(n):!t.isStarted&&cf.has(n))throw new e.O(`TLCGet(${n}) was undefined.`);let i=t.getSimulationValue?.(n,r);if(i!==void 0)return i;let a=Math.floor((Date.now()-t.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:t.getLevel(r);case`diameter`:return t.diameter;case`generated`:return t.generatedStates;case`distinct`:return t.distinctStates;case`queue`:return t.queueSize;case`duration`:return a;case`stats`:return sf([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,a],[`worker`,0]]);case`config`:return sf([[`mode`,`bfs`],[`deadlock`,t.checkDeadlock],[`worker`,1],[`seed`,String(t.seed)],[`fingerprint`,String(BigInt.asIntN(64,va()))],[`install`,`unknown`]]);case`revision`:{let e=/* @__PURE__ */ new Date;return sf([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,on(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,on(af(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return Kd(void 0);case`all`:return of(t.registers);case`all:named`:return of(Gd(t))}if(n.startsWith(`s:`)){let r=Gd(t).get(n);if(r===void 0)throw new e.O(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return on(t.properties.get(n.slice(2))??n);throw new e.O(`TLCGet(${n}) was undefined.`)},ff=(t,n,r)=>{if(typeof n==`number`&&n>=0){let r=t.registers.get(n);if(r===void 0)throw new e.O(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new e.O(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${L(n)}`);return df(t,n,r?.state)},pf=e=>e.length===0?[[]]:e.flatMap((t,n)=>pf([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),mf=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&F(e).elements.forEach(mf),e.kind===`Function`&&e.range.forEach(mf))},hf=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`ModelValue`:case`Function`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return I(e);default:return F(e)}},gf=(t,n)=>[z(`Print`,2,e=>(t(da([R(e,0,`Print`),R(e,1,`Print`)]).map(A).join(` `)),R(e,1,`Print`))),z(`PrintT`,1,e=>(t(A(da([R(e,0,`PrintT`)])[0])),!0)),z(`Assert`,2,t=>{if(R(t,0,`Assert`)!==!0)throw new e.O(`The first argument of Assert evaluated to FALSE; the second argument was:\n${A(L(R(t,1,`Assert`)))}`,e.tt.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>Cr([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=R(e,0,`@@`),n=R(e,1,`@@`),r=M(t)?I(t):void 0,i=M(n)?I(n):void 0;if(!r)throw Co(`first`,`@@`,`function`,t);if(!i)throw Co(`second`,`@@`,`function`,n);let a=Rt(r),o=Rt(i).filter(e=>!a.some(t=>mr(e[0],t[0])));return wr([...a,...o])}),z(`ToString`,1,e=>on(L(R(e,0,`ToString`),!0))),{...Jo(`TLCEval`,1,(e,t)=>{let n=hf(Yo(e,0,`TLCEval`)());return t===void 0&&mf(n),n}),isStateLevel:!1},z(`Permutations`,1,e=>{let t=wo(R(e,0,`Permutations`),`Permutations`).elements;return _r(pf(t).map(e=>Cr(t.map((t,n)=>[t,e[n]]))))}),ko(`SortSeq`,2,e=>{let t=R(e,0,`SortSeq`),n=di(t);if(!n)throw Co(`first`,`SortSeq`,`natural number`,t);let r=Do(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw Co(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t=a.length;for(;t>0&&i(e,a[t-1]);)t--;a.splice(t,0,e)}),Pr(a)}),n.version===`1.7.4`?Ho({...Ao(`TLCGet`,1,(e,t)=>ff(n,R(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Ho(Jo(`TLCGet`,1,(e,t)=>ff(n,Yo(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),Ao(`TLCSet`,2,e=>(Zd(n,t,R(e,0,`TLCSet`),R(e,1,`TLCSet`)),!0)),Oo(`Any`,pn),z(`RandomElement`,1,e=>Pd(R(e,0,`RandomElement`),n.getRandom()))],_f=/* @__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(`,`),vf=[[`\\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`,`≀`],[`^+`,`⁺`]],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,***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(`,`),bf=/* @__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(`.`),xf=/* @__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(`.`),Sf=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
19
|
+
`);s(e===-1?i:i.slice(0,e));continue}if(i.startsWith(`(*`)){let e=Ne(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=Ee(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=ye(e,n)??ve(e,n),m=Me.find(e=>i.startsWith(e));if(m&&m.length>=(p?.length??0))t.push({kind:`Symbol`,text:m,line:l}),s(m);else{if(!p)return a(n,``),t;t.push({kind:`Word`,text:p.text,line:l}),s(e.slice(n,n+p.length))}}return t.push({kind:`End`,text:``,line:r}),t},Fe=(t,n)=>new e.v(`TLC found an error in the configuration file at line ${t}\n${n}`),Ie=(e,t)=>Fe(e,`The keyword ${t} appeared twice.`),Le=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),Re=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),ze=(t,n=`master`)=>{let r=n===`1.7.4`?je:ke,i=Pe(t),a=0,o={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],rawConstants:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},s=!1,c=/* @__PURE__ */ new Set,l=()=>{let t=i[Math.min(a++,i.length-1)];if(t.kind===`Error`)throw new e.v(`TLC found an error in the configuration file:\n${t.text}`);return t},u=t=>{if(t.kind===`Number`&&t.text.startsWith(`\\`))throw e.at(new e.v(`${e.$(`java.lang.NumberFormatException`)}For input string: "${t.text}"`),e.nt.error);if(t.kind===`Number`)return{kind:`Number`,value:Number(t.text)};if(t.kind===`String`&&t.text.includes(`\\`))throw new e.v(`TLC found an error in the configuration file:\nescape sequences are not supported in strings at line ${t.line}`);if(t.kind===`String`)return{kind:`String`,value:t.text.slice(1,-1)};if(t.text===`TRUE`||t.text===`FALSE`)return{kind:`Boolean`,value:t.text===`TRUE`};if(t.text===`{`){let e=[],t=l();if(t.text!==`}`)for(;e.push(u(t)),t=l(),t.text===`,`;)t=l();if(t.text!==`}`)throw Fe(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(t.kind!==`End`)return{kind:`ModelValue`,name:t.text};throw Fe(t.line,`It was expecting a value, but did not find it.`)},d=e=>{let t=l();if(t.kind===`End`)throw Fe(t.line,`Expected an identifier after ${e}[.`);let n=l();if(n.text!==`]`)throw Fe(n.line,`It was expecting ], but did not find it.`);return t.text},f=(e,t)=>{let n=e.text,r=l();for(;r.text===`!`;)n=`${n}!${l().text}`,r=l();if(r.text===`<-`){if(r=l(),r.text===`[`){let e=d(`<-`),t=l();if(t.kind===`End`)throw Fe(t.line,`Expected an identifier after <-[mod].`);o.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw Fe(r.line,`Expected an identifier after <-.`);o.substitutions.push({name:n,target:r.text});return}let i=[],a=r.text===`(`;if(a){for(;i.push(u(l())),r=l(),r.text===`,`;);if(r.text!==`)`)throw Fe(t,``);r=l()}if(r.text!==`=`)throw Fe(r.line,`It was expecting = or <-, but did not find it.`);r=l();let s=r.text===`[`?d(`=`):void 0,c=u(s===void 0?r:l());o.constants.push({name:n,value:c,...a&&{args:i},...s!==void 0&&{module:s}})},p=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;let n=a-1;f(t,e),o.rawConstants.push(i.slice(n,a).map(e=>e.text).join(` `))}},m=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;e.push(t.text)}},h=l();for(;h.kind!==`End`;){let e=h.text,t=h.line,n=r.has(e)?Le.get(e):void 0,i=r.has(e)?Re.get(e):void 0,a=()=>{let n=l();if(n.kind===`End`)throw Fe(t,`The keyword ${e} was not followed by an identifier.`);return n};if(n!==void 0){let r=a();if(o[n]!==void 0)throw Ie(t,e);o[n]=r.text,h=l()}else if(i!==void 0)h=m(o[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)h=p(t);else if(e===`CHECK_DEADLOCK`){let n=a();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw Fe(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(s)throw Ie(t,e);s=!0,o.checkDeadlock=n.text===`TRUE`,h=l()}else{if(!r.has(e)||!Ae.includes(e))throw Fe(t,`It was expecting a keyword, but did not find it.`);if(a(),c.has(e))throw Ie(t,e);c.add(e),h=l()}}return o},Be=/* @__PURE__ */ new WeakMap,Ve=(e,t)=>{let n=Be.get(e);if(n)return n;let r={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:t};return Be.set(e,r),r},He=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],Ue=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(He),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:[]);case`Selection`:return[e.expression]}},We=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},A=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,Ge=/* @__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(`,`),Ke=[[`\\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`,`≀`],[`^+`,`⁺`]],qe=new Map(Ke.flatMap(e=>e.slice(1).map(t=>[t,e[0]]))),j=e=>e.split(`!`).map(e=>qe.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),Je=/* @__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(`,`),Ye=/* @__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(`.`),Xe=/* @__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(`.`),Ze=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
88
20
|
Nat == { }
|
|
89
21
|
a+b == {a, b}
|
|
90
22
|
a-b == CHOOSE n : b + n = a
|
|
@@ -400,7 +332,85 @@ _CheckName(name) ==
|
|
|
400
332
|
=> (PrintT(counts) /\\ FALSE)
|
|
401
333
|
_PrintCounts == PrintT(_Counts)
|
|
402
334
|
=============================================================================
|
|
403
|
-
`]]),Cf=/* @__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)`]])]]),wf=`----------------------------- MODULE Bags --------------------------------
|
|
335
|
+
`]]),Qe=/* @__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)`]])]]),$e=a(`EOF`),et=a(`IDENTIFIER`),tt=a(`DEFBREAK`),nt=(e,t)=>Array.from({length:a(t)-a(e)+1},(t,n)=>a(e)+n),rt=new Set(nt(`op_57`,`op_119`)),it=new Set(nt(`op_1`,`op_119`)),at=new Set(nt(`op_57`,`op_70`)),M=/* @__PURE__ */ new Set([...nt(`ACTION`,`EXCEPT`),a(`EXTENDS`),...nt(`IF`,`SF`),a(`STATE`),...nt(`THEN`,`WITH`),a(`US`),...nt(`op_112`,`op_116`)]),ot=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),st=new Map([...ot(`postfix`,160,160,!0,`[`),...ot(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...ot(`prefix`,120,120,!1,`-.`),...ot(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...ot(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...ot(`prefix`,40,40,!0,`\\lnot`),...ot(`nfix`,100,130,!0,`\\times`),...ot(`infix`,140,140,!1,`^`,`^^`),...ot(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...ot(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...ot(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...ot(`infix`,100,110,!0,`|`,`||`,`%%`),...ot(`infix`,100,110,!1,`%`),...ot(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...ot(`infix`,90,140,!1,`\\wr`),...ot(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...ot(`infix`,90,130,!1,`!!`),...ot(`infix`,90,90,!1,`...`,`..`),...ot(`infix`,80,80,!0,`\\intersect`,`\\union`),...ot(`infix`,80,80,!1,`\\`),...ot(`infix`,70,70,!1,`<:`,`:>`),...ot(`infix`,60,60,!0,`@@`),...ot(`infix`,50,140,!0,`\\cdot`),...ot(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...ot(`infix`,30,30,!0,`\\land`,`\\lor`),...ot(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...ot(`infix`,10,10,!1,`=>`)]),ct=new Map([...st,...Ke.flatMap(e=>e.slice(1).map(t=>[t,st.get(e[0])]))]),lt=ct.get(`[`),ut={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},dt=e=>({type:`tokens`,kinds:new Set(e)}),ft=e=>typeof e==`string`?e.startsWith(`<`)?dt([a(e.slice(1,-1))]):{type:`call`,name:e}:e,N=(...e)=>({type:`sequence`,units:e.map(ft)}),P=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:N(e))}),pt=e=>(...t)=>({type:e,body:N(...t)}),F=pt(`zeroOrMore`),mt=pt(`oneOrMore`),I=pt(`optional`),L=e=>({type:`action`,run:t=>e(t)??void 0}),R=e=>L(t=>{t.expecting=e}),z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&N(...e.expansion),semantic:e.semantic}),ht=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),gt=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=ht(e,n);return n},_t=(...e)=>{let t=e.map(a);return e=>t.includes(gt(e,1).kind)},vt=(e,t=gt(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},yt=e=>{let t=gt(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},bt=e=>_t(`CASESEP`)(e)&&vt(e),xt=e=>{let t=gt(e,1);M.has(t.kind)&&(t.kind=et)},St=(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}`,Ct=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),wt=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Tt=e=>e.operatorStacks[e.operatorStacks.length-1],Et=(e,t)=>e.low>t.high,Dt=(e,t)=>e.high<t.low,Ot=e=>e.fix===`prefix`?e:ct.get(`${e.name}.`),kt=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===lt?Ct(`FcnAppl`,[n,...r.node.heirs]):Ct(`PostfixExpr`,[n,r.node]),operator:void 0})},At=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Ct(`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:Ct(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},jt=e=>{let t=Tt(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 kt(t,n),jt(e);if(i.operator!==void 0){let t=Ot(r.operator);return t!==void 0&&Et(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${St(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 ${St(e,a.node.first,a.node.last)} and expression at location ${St(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Dt(a.operator,r.operator)?void 0:Et(a.operator,r.operator)?(At(t,a.operator),jt(e)):`Precedence conflict between ops ${a.operator.name} in block ${St(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Ot(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Dt(s,r.operator))return;if(!Et(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${St(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return At(t,s),jt(e);let c=St(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===ut?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},Mt=e=>L(t=>{let n=Tt(t),r=wt(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:jt(t)}),Nt=Mt(()=>!1),Pt=Mt(()=>!0),Ft=L(e=>{e.lastOperator=ct.get(e.token.image)}),It=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},Lt=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?It(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Rt=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!vt(e,n.first.beginColumn))return n;let t=Rt(e,n);if(t!==void 0)return t}},zt=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(a),n=(e,...t)=>t.some(t=>e.kind===a(t)),r=e=>e!==void 0&&rt.has(e.kind),i=e.token,o=ht(e,i);i.next=void 0;let s=ht(e,o);for(o.next=i;!t.includes(s.kind)&&!n(o,`THEOREM`,`PROPOSITION`);){if(n(o,`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===et&&(e=e.next)}else if(e.kind===et){let t=e.next;!r(t)||at.has(t.kind)||it.has(t.kind)&&t.next?.kind!==et||(e=t.next?.kind===a(`SUBSTITUTE`)?i:it.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==tt&&(e.next={kind:tt,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=o,o=s,s=ht(e,o),o.next=i}for(;i!==void 0;)o.next=s,s=o,o=i,i=o.next;o.next=s},Bt=e=>{let t=gt(e,1);if(t.kind===a(`LAB`)){let n=1;for(;n!==0;)if(t=ht(e,t),t.kind===a(`LAB`)&&n++,t.kind===a(`RAB`)&&n--,t.kind===$e)return!1;return ht(e,t).kind===a(`IN`)}if(t.kind!==et)return!1;for(t=ht(e,t);t.kind===a(`COMMA`);){if(t=ht(e,t),t.kind!==et)return!1;t=ht(e,t)}return t.kind===a(`IN`)},Vt=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Ht=e=>e.proofLevels.at(-1)??-1,Ut=e=>{let t=gt(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:_t(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Ht(e)>=0&&Vt(t)>Ht(e):_t(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Wt=(e,t)=>{let n=Vt(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},Gt=e=>L(t=>Wt(t,t.token)?void 0:`${St(t,t.token)}: ${e}`),Kt=dt([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(a)),qt=dt([...Kt.kinds,a(`op_76`)]),Jt=dt(it),Yt=dt(at),Xt=dt([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(a)),Zt=()=>F(z({expansion:[P(Kt,`<op_77>`)],semantic:vt}),P(`PrefixOp`,`InfixOp`),Pt),Qt=()=>P(N(z({expansion:[`OpenStart`],semantic:vt}),`OpenExpression`,Nt),N(z({semantic:vt}),`ExtendableExpr`)),$t=()=>P(N(`<MODULE>`,R(`identifier`),`Identifier`),`Expression`),en=()=>P(N(z({semantic:e=>_t(`ASSUME`,`BOXASSUME`)(e)||gt(e,2).kind===a(`COLONCOLON`)&&[a(`ASSUME`),a(`BOXASSUME`)].includes(gt(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),tn=()=>[`JuncItem`,F(z({semantic:yt}),`JuncItem`)],nn=e=>L(t=>{t.expecting=e,xt(t)}),rn=e=>L(t=>{t.isTerminalProof=e}),an=(e,...t)=>N(...t.slice(0,-1),R(`==`),`<DEF>`,L(t=>{zt(t),t.expecting=e}),t[t.length-1]),B=(e,t,n)=>({message:e,body:N(...t),exit:n}),on={CompilationUnit:B(void 0,[L(zt),I(`Prelude`),`Module`]),Prelude:B(void 0,[`<BEGIN_PRAGMA>`,F(P(`<NUMBER>`,`<IDENTIFIER>`))]),Module:B(`Module definition`,[R(`---- MODULE`),`BeginModule`,R(`EXTENDS clause or module body`),`Extends`,R(`Module body`),`Body`,R(`==== or more Module body`),`EndModule`]),BeginModule:B(`Begin module`,[R(`---- MODULE (beginning of module)`),P(`<_BM0>`,`<_BM1>`,`<_BM2>`),nn(`Identifier`),`Identifier`,L(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:B(void 0,[`<END_MODULE>`]),Extends:B(`Extends`,[I(`<EXTENDS>`,nn(`Identifier`),`Identifier`,R(`comma or module body`),F(`<COMMA>`,nn(`Identifier`),`Identifier`))]),Body:B(`Module body`,[R(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),F(P(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,N(z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,N(z({amount:2}),`Instance`),N(z({amount:2}),`Assumption`),N(z({amount:2}),`Theorem`),N(z({amount:1}),`Module`,L(zt)),N(z({semantic:e=>_t(`USE`)(e)&>(e,2).kind!==a(`ONLY`)||_t(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:B(`variable declaration`,[`<VARIABLE>`,R(`Identifier`),`Identifier`,R(`comma or module body`),F(`<COMMA>`,R(`Identifier`),`Identifier`)]),ParamDeclaration:B(`Parameter declaration`,[R(`CONSTANT`),`ParamSubDecl`,R(`Identifier, operator or _`),`ConstantDeclarationItems`,R(`,`),F(`<COMMA>`,R(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:B(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:B(`Recursive`,[R(`RECURSIVE`),`<RECURSIVE>`,R(`Identifier, operator or _`),`ConstantDeclarationItems`,R(`,`),F(`<COMMA>`,R(`Identifier, operator or _`),`ConstantDeclarationItems`,R("`,' or `)'"))]),ConstantDeclarationItems:B(`Constant declaration items`,[R(`Identifier, _ or prefix op`),P(N(`Identifier`,R(`(, comma, or Module Body`),I(z({amount:2}),`<LBR>`,R(`_`),`<US>`,R(`comma or )`),F(`<COMMA>`,R(`_`),`<US>`,R(`comma or )`)),`<RBR>`)),N(`NonExpPrefixOp`,R(`_`),`<US>`),N(`<US>`,R(`prefix or postfix operator`),P(N(`InfixOp`,R(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:B(`Definition`,[R(`LOCAL, Identifier or Operator Symbol`),I(`<LOCAL>`),`<DEFBREAK>`,R(`LOCAL, Identifier or Operator Symbol`),P(an(`Expression`,z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,R(`[`),`<LSB>`,R(`Identifier`),`QuantBound`,R(`COMMA or ]`),F(`<COMMA>`,R(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),an(`Expression`,z({expansion:[`<IDENTIFIER>`,Yt]}),`PostfixLHS`,`Expression`),an(`Expression`,z({expansion:[`<IDENTIFIER>`,Jt]}),`InfixLHS`,`Expression`),an(`Expression or Instance`,z({expansion:[`<IDENTIFIER>`,P(`<LBR>`,`<DEF>`)]}),`IdentLHS`,P(`Expression`,`Instantiation`)),an(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:B(`Identifier tuple`,[`<LAB>`,R(`Identifier or >>`),I(`Identifier`,R(`COMMA or >>`),F(`<COMMA>`,R(`COMMA or >>`),`Identifier`,R(`COMMA or >>`))),`<RAB>`]),IdentLHS:B(`Identifier LHS`,[`Identifier`,R(`( or ==`),I(`<LBR>`,R(`Identifier Declaration, prefix op, _ or )`),P(`IdentDecl`,`SomeFixDecl`),R(`COMMA or )`),F(`<COMMA>`,R(`Identifier Declaration, prefix op or _`),P(`IdentDecl`,`SomeFixDecl`),R(`COMMA or )`)),`<RBR>`)]),PrefixLHS:B(`Prefix LHS`,[qt,R(`Identifier`),`Identifier`]),InfixLHS:B(`Infix LHS`,[`Identifier`,Jt,`Identifier`]),PostfixLHS:B(`Postfix LHS`,[`Identifier`,Yt]),IdentDecl:B(`Identifier Declation`,[`Identifier`,R(`( or ...`),I(`<LBR>`,R(`_`),`<US>`,R(`COMMA or )`),F(`<COMMA>`,R(`_`),`<US>`,R(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:B(`Op. Symbol Declaration`,[P(N(`NonExpPrefixOp`,R(`_`),`<US>`),N(`<US>`,R(`infix or postfix operator`),P(N(`InfixOp`,R(`_`),`<US>`),`PostfixOp`)))]),Instance:B(`Instance`,[R(`LOCAL or instance`),I(`<LOCAL>`),`Instantiation`,R(`COMMA or Module Body`)]),Instantiation:B(`NonLocalInstance`,[`<INSTANCE>`,nn(`Module identifier`),`Identifier`,R(`WITH or another definition.`),I(`<WITH>`,R(``),`Substitution`,R(``),F(z({amount:3}),`<COMMA>`,R(``),`Substitution`,R(``)))]),Substitution:B(`Substitution`,[P(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),R(`<-`),`<SUBSTITUTE>`,R(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:B(void 0,[Kt,Ft]),NonExpPrefixOp:B(void 0,[qt,Ft]),InfixOp:B(`Infix Op`,[Jt,Ft]),PostfixOp:B(void 0,[Yt,Ft]),Identifier:B(void 0,[`<IDENTIFIER>`]),Assumption:B(`Assumption`,[R(`ASSUM...`),P(`<ASSUMPTION>`,`<ASSUME>`),I(z({amount:2}),I(`<DEFBREAK>`),`Identifier`,R(`==`),`<DEF>`),L(e=>{zt(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:B(`Assume-Prove`,[P(N(`Identifier`,`<COLONCOLON>`,`AssumeProve`),N(P(`<ASSUME>`,`<BOXASSUME>`),R(`Expression, Declaration, or AssumeProve`),en(),R("PROVE or `,'"),F(`<COMMA>`,R(`Expression, Declaration, or AssumeProve`),en(),R("PROVE or `,'")),P(`<PROVE>`,`<BOXPROVE>`),R(`Expression`),`Expression`))]),NewSymb:B(`NEW symbol declaration`,[R(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),P(N(z({amount:2}),P(N(z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),R(`Constant declaration`),P(N(z({amount:2}),`IdentDecl`,I(`<IN>`,L(e=>{let t=wt(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${St(e,t.first,t.last)}`:void 0}),R(`Expression`),`Expression`)),`SomeFixDecl`)),N(z({amount:2}),I(`<NEW>`),`<VARIABLE>`,R(`Identifier`),`Identifier`),N(z({amount:2}),I(`<NEW>`),P(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),R(`Declaration`),P(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:B(`Domain binding`,[I(`<IN>`,R(`Expression`),`Expression`)]),Theorem:B(`Theorem`,[R(`THEOREM, PROPOSITION`),P(`<THEOREM>`,`<PROPOSITION>`),R(`Identifier, Assume-Prove or Expression`),I(z({amount:2}),`Identifier`,R(`==`),`<DEF>`),L(zt),P(N(z({amount:3}),z({semantic:_t(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),I(z({semantic:Ut}),`Proof`)]),Proof:B(`Proof`,[L(e=>{e.proofLevels.push(-1)}),P(N(z({semantic:e=>_t(`BY`)(e)||gt(e,2).kind===a(`BY`)}),`UseOrHideOrBy`),N(z({amount:2}),I(`<PROOF>`),P(`<OBVIOUS>`,`<OMITTED>`)),N(I(z({amount:2}),`<PROOF>`),F(z({semantic:e=>gt(e,2).kind!==a(`QED`)}),`Step`,R(`a proof step`)),`QEDStep`)),L(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:B(`UseOrHideOrBy`,[P(N(I(`<PROOF>`),`<BY>`,rn(!0),I(`<ONLY>`)),N(`<USE>`,rn(!1),I(`<ONLY>`)),N(`<HIDE>`,rn(!1))),R("an expression, `MODULE' or `DEF'"),I($t(),F(`<COMMA>`,R(`MODULE or expression`),$t(),L(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),I(`<DF>`,R(`MODULE or expression`),$t(),F(`<COMMA>`,R(`MODULE or expression`),$t(),L(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),L(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:B(`QED step`,[R(`Step number`),Xt,Gt(`QED step's number has bad level.`),R(`QED`),`<QED>`,I(z({semantic:Ut}),`Proof`)]),Step:B(`Step`,[R(`Step number`),Xt,Gt(`step's number has bad level.`),R(`proof step`),P(N(z({semantic:_t(`USE`,`HIDE`)}),`UseOrHideOrBy`),N(z({semantic:_t(`INSTANCE`)}),`Instantiation`),N(z({semantic:_t(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),I(z({semantic:Ut}),L(e=>{let t=wt(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${St(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:B(`DefStep`,[I(`<DEFINE>`),mt(z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:B(`HaveStep`,[`<HAVE>`,R(`expression`),`Expression`]),TakeStep:B(`TakeStep`,[`<TAKE>`,R(`identifier`),P(N(z({expansion:[P(N(`<IDENTIFIER>`,F(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,R(`comma or step`),F(`<COMMA>`,R(`identifier or tuple of identifiers`),`QuantBound`,R(`comma or proof step`))),N(`Identifier`,R(`comma or proof step`),F(`<COMMA>`,R(`identifier`),`Identifier`,R(`comma or proof step`))))]),WitnessStep:B(`WitnessStep`,[`<WITNESS>`,R(`expression`),`Expression`,F(`<COMMA>`,R(`expression`),`Expression`,R(`comma or colon`))]),PickStep:B(`PickStep`,[`<PICK>`,R(`identifier`),P(N(z({expansion:[`<IDENTIFIER>`,F(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,R(`comma, or colon`),F(`<COMMA>`,R(`identifier`),`Identifier`,R(`comma or colon`))),N(`QuantBound`,R(`comma or colon`),F(`<COMMA>`,R(`identifier or tuple of identifiers`),`QuantBound`,R(`comma or colon`)))),`<COLON>`,R(`expression`),`Expression`]),CaseStep:B(`CaseStep`,[`<CASE>`,R(`expression`),`Expression`]),AssertStep:B(`AssertStep`,[I(`<SUFFICES>`,R(`expression or ASSUME/PROVE`)),P(`Expression`,N(z({semantic:_t(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:B(void 0,[P(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:B(void 0,[P(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:B(`String`,[`<STRING_LITERAL>`]),Number:B(void 0,[`<NUMBER_LITERAL>`,I(z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:B(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,F(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:B(void 0,[P(N(z({amount:2,expansion:[P(qt,Jt,Yt),dt([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(a))],semantic:vt}),P(`NonExpPrefixOp`,N(`InfixOp`,L(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${St(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),N(z({expansion:[`<LAMBDA>`],semantic:vt}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:B(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:B(`Quantified form`,[P(`<EXISTS>`,`<FORALL>`),P(N(z({expansion:[`<IDENTIFIER>`,F(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,F(`<COMMA>`,`Identifier`)),N(`QuantBound`,F(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:B(`Bound Quantified Expression`,[P(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,F(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:B(`Quant Bound`,[P(`IdentifierTuple`,N(`Identifier`,F(`<COMMA>`,`Identifier`,R(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:B(`Some { } form`,[`<LBC>`,I(P(N(z({semantic:Bt}),P(`IdentifierTuple`,`Identifier`),R(`\\in`),`<IN>`,`Expression`,R(`':', ',' or '}'`),I(P(N(`<COLON>`,`Expression`),mt(`<COMMA>`,`Expression`)))),N(z({expansion:[P(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,F(`<COMMA>`,`Expression`)),N(z({expansion:[P(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,F(`<COMMA>`,`QuantBound`)),N(`Expression`,I(P(N(`<COLON>`,L(e=>{let t=wt(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`,F(`<COMMA>`,`QuantBound`)),mt(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:B(`Some [] Form`,[`<LSB>`,P(N(z({semantic:Bt}),`QuantBound`,F(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),N(z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,F(`<COMMA>`,`FieldVal`),`<RSB>`),N(z({semantic:e=>gt(e,2).kind===a(`MAPTO`)&&M.has(gt(e,1).kind)}),L(e=>{gt(e,1).kind=et}),`FieldVal`,F(`<COMMA>`,`FieldVal`),`<RSB>`),N(z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,F(`<COMMA>`,`FieldSet`),`<RSB>`),N(`Expression`,P(N(F(`<COMMA>`,`Expression`),`<RSB>`,L(e=>{let t=e.frames[e.frames.length-1];t.node=Ct(`FcnAppl`,t.heirs),e.lastOperator=lt})),N(`<ARROW>`,`Expression`,`<RSB>`),N(`<EXCEPT>`,`ExceptSpec`,F(`<COMMA>`,`ExceptSpec`),`<RSB>`),N(`<ARSB>`,`ReducedExpression`))))]),FieldVal:B(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:B(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:B(`Except Spec`,[`<BANG>`,mt(`ExceptComponent`,R(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:B(`Except Component`,[P(N(`<DOT>`,L(xt),`Identifier`,L(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),N(`<LSB>`,`Expression`,F(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:B(`Some << -- >> or >>_ Form`,[`<LAB>`,I(`Expression`,F(`<COMMA>`,`Expression`)),P(`<RAB>`,N(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:B(void 0,[`Identifier`,I(z({amount:2}),`OpArgs`),P(N(`<BANG>`,`NoOpExtension`),L(e=>{e.isFairnessHooked=e.token.kind===a(`RBR`)}))]),ReducedExpression:B(`restricted form of expression`,[P(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:B(`Fairness Expression`,[L(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),P(`<WF>`,`<SF>`),`ReducedExpression`,I(z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,L(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:B(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:B(`CASE Expression`,[`<CASE>`,`CaseArm`,F(z({semantic:e=>bt(e)&>(e,2).kind!==a(`OTHER`)}),`<CASESEP>`,`CaseArm`),I(z({semantic:bt}),`<CASESEP>`,`OtherArm`)]),CaseArm:B(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:B(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:B(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:B(`Let Definitions`,[mt(P(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:B(`AND-OR Junction`,[L(e=>{let t=gt(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),P(N(z({expansion:[`<OR>`]}),...tn()),N(z({expansion:[`<AND>`]}),...tn())),L(e=>{e.junctions.pop()})]),JuncItem:B(`Junction Item`,[P(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Rt(t,e.heirs[1]);return n&&`Item at ${St(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${St(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:B(`(Un)Bounded Choose`,[`<CHOOSE>`,P(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:B(`Lambda`,[`<LAMBDA>`,R(`Identifier`),`Identifier`,R("`,' or `:'"),F(`<COMMA>`,R(`Identifier`),`Identifier`,R("`,' or `:'")),`<COLON>`,R(`Expression`),`Expression`]),Expression:B(`Expression`,[L(e=>{e.operatorStacks.push([])}),Zt(),Qt()],(e,t)=>{let n=Tt(t);n.push({node:e.heirs[0],operator:ut});let r=jt(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:B(`ExtendableExpr`,[P(N(z({expansion:[P(`<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`),Nt,F(P(N(z({expansion:[`PostfixOp`],semantic:vt}),`PostfixOp`,Pt),N(z({expansion:[`<DOT>`],semantic:vt}),`<DOT>`,L(xt),z({semantic:vt}),`Identifier`,L(e=>{let t=Tt(e);t[t.length-1].operator!==void 0&&kt(t,t.length),t[t.length-1]={node:Ct(`RecordComponent`,[t[t.length-1].node,wt(e,2),wt(e,1)]),operator:void 0}})),N(z({expansion:[`<LSB>`],semantic:vt}),R(`function argument`),`SBracketCases`,Mt(e=>e.kind===`FcnAppl`)))),I(P(N(z({expansion:[`InfixOp`],semantic:vt}),`InfixOp`,Pt,Zt(),Qt()),N(z({expansion:[`<COLONCOLON>`],semantic:vt}),`<COLONCOLON>`,L(e=>{let t=Tt(e);if(!Lt(t[t.length-1].node))return`\`::' at ${St(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,L(e=>{let t=Tt(e),n=wt(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Dt(r,e.lastOperator)){let t=wt(e,3);return`Removing label at ${St(e,t.first,t.last)} would change expression parsing.`}t.push({node:Ct(`Label`,[wt(e,3),wt(e,2),n]),operator:void 0})}))))]),PrimitiveExp:B(`Primitive expression`,[P(N(z({expansion:[`String`],semantic:vt}),`String`),N(z({expansion:[`<NUMBER_LITERAL>`],semantic:vt}),`Number`),N(P(`Identifier`,N(P(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),L(e=>Ht(e)<0&&e.proofLevels.length<=1?`${St(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${St(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,N(z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),I(z({amount:2}),`OpArgs`),F(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:It(e.heirs)===void 0?e.heirs.length===1?Ct(`GeneralId`,e.heirs):void 0:Ct(`OpApplication`,e.heirs)}),BangExt:B(`Bang Extension`,[`<BANG>`,P(N(P(N(z({expansion:[`Identifier`],semantic:e=>gt(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),I(z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:B(`StructOp`,[R("`<<' , `>>' , `:' , `@' , or number"),P(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,N(z({semantic:e=>gt(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${St(t,n.first,n.last)}`:void 0}),OpenStart:B(void 0,[P(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},sn=/* @__PURE__ */ new Map,cn=e=>{let t=sn.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=cn(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,cn(on[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 sn.set(e,n),n},ln=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},un=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=ht(e,e.scanPosition)),e.scanPosition=ht(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`},dn=(e,t)=>{if(t.type===`tokens`)return un(e,t.kinds);if(t.type===`call`)return dn(e,on[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||ln(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=dn(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||ln(e,t.semantic)?dn(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=dn(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=dn(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},fn=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=dn(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},pn=(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||cn(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!cn(a).hasSemanticStart?cn(a).first.has(gt(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):fn(e,i,a)&&(o===void 0||o(e))}),mn=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,dn(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=ht(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===$e){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=ht(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${oe(e.token.image)}" `},hn=(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??mn(e)}\n\nResidual stack trace follows:\n${r}`,!1},gn=(e,t)=>{let n=ht(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,hn(e))},_n=(e,t)=>{let n=on[t];n.message!==void 0&&(e.messages.push({name:n.message,token:gt(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!vn(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 hn(e,i);let a=r.node??(r.heirs.length===0?void 0:Ct(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},vn=(e,t)=>{if(t.type===`tokens`)return gn(e,t.kinds);if(t.type===`call`)return _n(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||hn(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||hn(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||vn(e,t));if(t.type===`choice`){let n=pn(e,t.alternatives);return n===-1?hn(e):vn(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!vn(e,t.body))return!1;if(t.type===`optional`)return pn(e,[t.body])===-1||vn(e,t.body);for(;pn(e,[t.body])===0;)if(!vn(e,t.body))return!1;return!0},yn=e=>{let t=ae(e),n={kind:$e,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=vn(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(`
|
|
336
|
+
`)},bn=/* @__PURE__ */ new Map([[`(`,`)`],[`[`,`]`],[`{`,`}`],[`<<`,`>>`]]),xn=(e,t)=>`${e}:${t}`,Sn=(e,t)=>{let n=De(t).filter(e=>e.kind!==`End`).map(Se),r=[0,0];for(let e=0;e<t.length;e++)t[e]===`
|
|
337
|
+
`&&r.push(e+1);return{name:e,source:t,tokens:n,lineOffsets:r,tokenIndexes:new Map(n.map((e,t)=>[xn(e.line,e.column),t]))}},Cn=(e,t,n)=>e.tokens[t]!==void 0&&e.tokens[t].text===n&&e.tokens[t].kind!==`String`,wn=(e,t,n)=>{let r=0,i=e.tokens.length;for(;r<i;){let a=r+i>>>1,o=e.tokens[a];o.line<t.line||o.line===t.line&&(n?o.column<=t.column:o.column<t.column)?r=a+1:i=a}return r},Tn=(e,t)=>e.tokenIndexes.get(xn(t.line,t.column))??Math.min(wn(e,t,!1),e.tokens.length-1),En=(e,t)=>Math.max(wn(e,t,!0)-1,0),Dn=(e,t)=>{let n=e.tokens[t].text,r=bn.get(n);if(r===void 0)return t;let i=0;for(let a=t;a<e.tokens.length;a++)if(Cn(e,a,n))i++;else if(Cn(e,a,r)&&(i--,i===0))return a;return t},On=(e,t)=>({start:Tn(e,t.start),end:En(e,t.end)}),kn=(e,t)=>{let n=t.location.range;if(n)return On(e,n);let r=Tn(e,t.location);return{start:r,end:Dn(e,r)}},An=(e,t)=>{let n=t.start-1,r=t.end+1;return Cn(e,n,`(`)&&Cn(e,r,`)`)&&Dn(e,n)===r?An(e,{start:n,end:r}):t},jn=(e,t)=>{let n=t.start-1,r=t.end+1;return Cn(e,n,`(`)&&Dn(e,n)===r&&(Cn(e,n-1,`(`)||Cn(e,n-1,`,`))?jn(e,{start:n,end:r}):t},Mn=(e,t)=>({file:e.name,beginLine:e.tokens[t.start].line,beginColumn:e.tokens[t.start].column,endLine:e.tokens[t.end].line,endColumn:e.tokens[t.end].endColumn}),Nn=(e,t)=>Mn(e,{start:t,end:t}),Pn=(e,t,n)=>{let r=0,i=e.lineOffsets[t];for(;i<e.source.length;){if(r=e.source[i]===` `?x(r):r+1,r>=n)return i;i++}return i},Fn=(e,t)=>{let n=e.tokens[t],r=Pn(e,n.line,n.column);return e.source.slice(r,Pn(e,n.line,n.endColumn)+1)},In=(e,t)=>{let n=e.tokens[t],r=e.tokens[t+1];return n?.kind===`Operator`&&n.text===`[]`&&r?.kind===`Keyword`&&(r.text===`ASSUME`||r.text===`PROVE`)&&r.line===n.line&&r.column===n.endColumn+1},Ln=t=>{let n=Sn(``,t),r=n.tokens.reduce((e,t,r)=>{if(!In(n,r))return e;let i=Pn(n,t.line,t.column);return`${e.slice(0,i)} ${e.slice(i+2)}`},t);if(r!==t&&yn(t)!==void 0)throw new e.I(`SANY rejects a []ASSUME or []PROVE outside an ASSUME/PROVE`);return r},Rn=(e,t)=>{let n=e.tokens[t-1],r=e.tokens[t],i=n===void 0?0:Pn(e,n.line,n.endColumn)+1,a=e.source.slice(i,Pn(e,r.line,r.column)),o=[],s=0;for(;s<a.length;)if(a.startsWith(`\\*`,s)){let e=a.indexOf(`
|
|
338
|
+
`,s),t=e===-1?a.length:e+1;o.push(a.slice(s,t)),s=t}else if(a.startsWith(`(*`,s)){let e=1,t=s,n=s+2;for(;e>0&&n<a.length;){let r=a.startsWith(`(*`,n),i=a.startsWith(`*)`,n);r||i?(e+=r?1:-1,n+=2,o.push(a.slice(t,n)),t=n):n++}t<n&&o.push(a.slice(t,n)),s=n}else s++;return o},zn=(e,t,n,r)=>{let i=[];for(let a=t;a<n&&i.length<r.length;a++){let t=e.tokens[a];t.kind===`Identifier`&&t.text===r[i.length]&&i.push(a)}return i},Bn=(e,t,n,r)=>{for(let i=t;i<=n;i++)if(Cn(e,i,r))return i;return-1},Vn=/* @__PURE__ */ new Map([[`Identifier`,`N_GeneralId`],[`Subexpression`,`N_GeneralId`],[`Number`,`N_Number`],[`Decimal`,`N_Real`],[`SetEnumeration`,`N_SetEnumerate`],[`SetFilter`,`N_SubsetOf`],[`SetMap`,`N_SetOfAll`],[`Tuple`,`N_Tuple`],[`Product`,`N_Times`],[`FunctionApplication`,`N_FcnAppl`],[`FunctionConstruction`,`N_FcnConst`],[`FunctionSet`,`N_SetOfFcns`],[`Record`,`N_RcdConstructor`],[`RecordSet`,`N_SetOfRcds`],[`FieldAccess`,`N_RecordComponent`],[`Except`,`N_Except`],[`Prime`,`N_PostfixExpr`],[`Always`,`N_PrefixExpr`],[`Eventually`,`N_PrefixExpr`],[`Enabled`,`N_PrefixExpr`],[`Unchanged`,`N_PrefixExpr`],[`Forall`,`N_BoundedQuant`],[`Exists`,`N_BoundedQuant`],[`UnboundedQuantifier`,`N_UnboundedQuant`],[`Choose`,`N_UnBoundedOrBoundedChoose`],[`If`,`N_IfThenElse`],[`Case`,`N_Case`],[`Let`,`N_LetIn`],[`BoxAction`,`N_ActionExpr`],[`AngleAction`,`N_ActionExpr`],[`WeakFairness`,`N_FairnessExpr`],[`StrongFairness`,`N_FairnessExpr`]]),Hn=/* @__PURE__ */ new Set([`N_GeneralId`,`N_OpApplication`,`N_PrefixExpr`,`N_InfixExpr`,`N_PostfixExpr`,`N_FcnAppl`,`N_RecordComponent`]),Un=(e,t)=>Cn(e,t.start,`(`)&&Dn(e,t.start)===t.end,Wn=(e,t)=>An(e,kn(e,t)),Gn=(e,t,n)=>Wn(e,t.args[0]).start===n.start?t.args.length===2?`N_InfixExpr`:`N_PostfixExpr`:e.tokens[n.start].kind===`Identifier`?`N_OpApplication`:`N_PrefixExpr`,Kn=(e,t,n)=>Un(e,n)?`N_ParenExpr`:t.kind===`String`?Fn(e,n.start):t.kind===`Apply`?Gn(e,t,n):t.kind===`And`||t.kind===`Or`?t.isBulleted?t.kind===`And`?`N_ConjList`:`N_DisjList`:`N_InfixExpr`:Vn.get(t.kind),qn=(e,t,n)=>{if(t.kind===`String`&&!Un(e,n))return!1;if(t.kind===`Identifier`&&!t.name.includes(`!`))return!0;let r=Kn(e,t,n);return r===void 0||Hn.has(r)?void 0:!0},Jn=(e,t,n)=>{let r=(t,n=t)=>Mn(e,{start:t,end:n}),i=(t,n=Wn(e,t))=>({last:Mn(e,n),lastKind:Kn(e,t,n)}),a=(e,t)=>({hasChildlessFirstChild:!1,last:r(n.start+1,e),lastKind:t}),o=(t,n)=>{let i=Wn(e,t);return{hasChildlessFirstChild:qn(e,t,i),last:r(i.end+1),lastKind:n}};if(Un(e,n))return{hasChildlessFirstChild:!1,...i(t,{start:n.start+1,end:n.end-1})};switch(t.kind){case`If`:case`BoxAction`:case`AngleAction`:return{hasChildlessFirstChild:!1,...i(t.kind===`If`?t.condition:t.action)};case`Tuple`:case`SetEnumeration`:{let a=t.elements[0];return a===void 0?{hasChildlessFirstChild:!1,last:r(n.end),lastKind:e.tokens[n.end].text}:{hasChildlessFirstChild:!1,...i(a)}}case`Except`:return{hasChildlessFirstChild:!1,...i(t.function)};case`FunctionSet`:return{hasChildlessFirstChild:!1,...i(t.domain)};case`SetMap`:return{hasChildlessFirstChild:!1,...i(t.expression)};case`WeakFairness`:case`StrongFairness`:return{hasChildlessFirstChild:!1,...i(t.subscript)};case`Case`:return a(Wn(e,t.arms[0].body).end,`N_CaseArm`);case`Record`:case`RecordSet`:return a(Wn(e,t.fields[0].value).end,t.kind===`Record`?`N_FieldVal`:`N_FieldSet`);case`FunctionConstruction`:case`Forall`:case`Exists`:return a(Wn(e,t.bounds[0].set).end,`N_QuantBound`);case`Choose`:case`SetFilter`:return(t.kind===`Choose`?t.pattern:t.bound.pattern).kind===`Tuple`?a(Dn(e,n.start+1),`N_IdentifierTuple`):void 0;case`Decimal`:{let t=e.tokens[n.start],i=t.column+t.text.indexOf(`.`);return{hasChildlessFirstChild:!1,last:{...r(n.start),beginColumn:i,endColumn:i},lastKind:`.`}}case`Let`:return a(Wn(e,t.body).start-2,`N_LetDefinitions`);case`Product`:return o(t.factors[0],`N_GenInfixOp`);case`And`:case`Or`:{if(t.operands.length===1)return;if(!t.isBulleted&&t.operands.length>2)return{hasChildlessFirstChild:void 0,last:r(Wn(e,t.operands[t.operands.length-1]).start-1),lastKind:`N_GenInfixOp`};if(!t.isBulleted)return o(t.operands[0],`N_GenInfixOp`);let n=Wn(e,t.operands[1]);return{hasChildlessFirstChild:!0,last:r(n.start-1,n.end),lastKind:t.kind===`And`?`N_ConjItem`:`N_DisjItem`}}case`Always`:case`Eventually`:case`Enabled`:case`Unchanged`:return{hasChildlessFirstChild:!0,...i(t.expression,{start:n.start+1,end:n.end})};case`Prime`:return{hasChildlessFirstChild:qn(e,t.expression,Wn(e,t.expression)),last:r(n.end),lastKind:`N_GenPostfixOp`};case`FunctionApplication`:case`FieldAccess`:{let n=t.kind===`FunctionApplication`?t.function:t.record,i=Wn(e,n),a=i.end+1;return{hasChildlessFirstChild:qn(e,n,i),last:r(a),lastKind:e.tokens[a].text}}case`Apply`:{let a=Gn(e,t,n);return a===`N_OpApplication`?t.operator.includes(`!`)?void 0:{hasChildlessFirstChild:!0,last:r(n.start+1,n.end),lastKind:`N_OpArgs`}:a===`N_PrefixExpr`?{hasChildlessFirstChild:!0,...i(t.args[0],{start:n.start+1,end:n.end})}:o(t.args[0],a===`N_InfixExpr`?`N_GenInfixOp`:`N_GenPostfixOp`)}}},Yn=(e,t)=>{let n=Wn(e,t),r=Mn(e,n),i=Jn(e,t,n),a=t.kind===`Number`||t.kind===`String`||(t.kind===`And`||t.kind===`Or`)&&t.operands.length===1;return i===void 0&&a||i!==void 0&&i.hasChildlessFirstChild===void 0?[{location:r,message:`DEF clause entry should describe a defined operator.`}]:i?.hasChildlessFirstChild===void 0||i.lastKind===void 0?[]:[...i.hasChildlessFirstChild?[{location:r,message:`Was expecting a GeneralId.`}]:[],...i.lastKind===`N_OpArgs`?[{location:i.last,message:"Selector `!(...)' should not have argument(s)."}]:[{location:i.last,message:`Unexpected token found.`},{location:i.last,message:`Need name or step number here, not \`${i.lastKind}'.`}],{location:r,message:`DEF clause entry should describe a defined operator.`}]},Xn={low:15,high:15},Zn={low:16,high:16},V=(e,t,n)=>({low:e,high:t,isAssociative:n}),Qn=new Map([[`=>`,V(1,1,!1)],[`<=>`,V(2,2,!1)],[`~>`,V(2,2,!1)],[`-+->`,V(2,2,!1)],[`/\\`,V(3,3,!0)],[`\\/`,V(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,V(5,5,!1)]),[`\\cdot`,V(5,14,!0)],[`@@`,V(6,6,!0)],[`:>`,V(7,7,!1)],[`<:`,V(7,7,!1)],[`\\cup`,V(8,8,!0)],[`\\cap`,V(8,8,!0)],[`\\`,V(8,8,!1)],[`..`,V(9,9,!1)],[`...`,V(9,9,!1)],[`##`,V(9,13,!0)],[`$`,V(9,13,!0)],[`$$`,V(9,13,!0)],[`??`,V(9,13,!0)],[`!!`,V(9,13,!1)],[`\\sqcap`,V(9,13,!0)],[`\\sqcup`,V(9,13,!0)],[`\\uplus`,V(9,13,!0)],[`\\wr`,V(9,14,!1)],[`+`,V(10,10,!0)],[`++`,V(10,10,!0)],[`(+)`,V(10,10,!0)],[`\\oplus`,V(10,10,!0)],[`%`,V(10,11,!1)],[`%%`,V(10,11,!0)],[`|`,V(10,11,!0)],[`||`,V(10,11,!0)],[`\\X`,V(10,13,!1)],[`-`,V(11,11,!0)],[`--`,V(11,11,!0)],[`(-)`,V(11,11,!0)],[`\\ominus`,V(11,11,!0)],[`*`,V(13,13,!0)],[`**`,V(13,13,!0)],[`/`,V(13,13,!1)],[`//`,V(13,13,!1)],[`\\div`,V(13,13,!1)],[`\\o`,V(13,13,!0)],[`(.)`,V(13,13,!0)],[`\\odot`,V(13,13,!0)],[`(/)`,V(13,13,!1)],[`\\oslash`,V(13,13,!1)],[`(\\X)`,V(13,13,!0)],[`\\otimes`,V(13,13,!0)],[`&`,V(13,13,!0)],[`&&`,V(13,13,!0)],[`\\star`,V(13,13,!0)],[`\\bullet`,V(13,13,!0)],[`\\bigcirc`,V(13,13,!0)],[`^`,V(14,14,!1)],[`^^`,V(14,14,!1)]]),$n=(e,t)=>t.isAssociative||e===`%`||e===`\\X`,er=/* @__PURE__ */ new Map([[`~`,{low:4,high:4}],[`[]`,{low:4,high:15}],[`<>`,{low:4,high:15}],[`ENABLED`,{low:4,high:15}],[`UNCHANGED`,{low:4,high:15}],[`SUBSET`,{low:8,high:8}],[`UNION`,{low:8,high:8}],[`DOMAIN`,{low:9,high:9}],[`-`,{low:12,high:12}],[`-.`,{low:12,high:12}]]),tr={low:17,high:17},nr=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`@`,`\\A`,`\\E`,`\\AA`,`\\EE`,`IF`,`CASE`,`LET`,`CHOOSE`,`LAMBDA`,`WF_`,`SF_`]),rr=/* @__PURE__ */ new Set([`(`,`{`,`<<`]),ir=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),ar=/* @__PURE__ */ new Set([...ir,`'`]),or=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),sr=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),cr=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),lr=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),ur=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...ar]),dr=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),fr=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),pr=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),mr=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),hr=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),gr=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),_r=/* @__PURE__ */ new Set([``,`*`,`-`]),vr={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},yr=(e,t)=>e.line-t.line||e.column-t.column,br=(e,t)=>({start:yr(e.start,t.start)<=0?e.start:t.start,stop:yr(e.stop,t.stop)>=0?e.stop:t.stop}),xr=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),Sr={printed:``,set:``},Cr={printed:`
|
|
339
|
+
`,set:``},wr={printed:`
|
|
340
|
+
`,set:`
|
|
341
|
+
`},Tr=(t,n,r,i=`Proof.Parser`)=>new e.I(t,void 0,{reason:`${t}${r.set}`,line:n.start.line,column:n.start.column,isEnd:!1,proof:{stop:n.stop,exception:i,printed:`${t}${r.printed}`}}),Er=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),Dr=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),Or=/* @__PURE__ */ new Set([`NEW`,...Dr.keys()]),kr=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Ar=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),jr=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Mr=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Qn.has(e.operator):ir.has(e.operator)),Nr=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,Pr=e=>Qn.has(e)||ir.has(e)||e===`-.`,Fr=(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}}},Ir=/* @__PURE__ */ new WeakMap,Lr=/* @__PURE__ */ new WeakMap,Rr=e=>{if(Ir.has(e))return;let t=e.kind===`UnboundedQuantifier`?{name:e.names[0],range:e.nameRanges?.[0]}:e.kind===`Choose`&&e.pattern.kind===`Name`?{name:e.pattern.name,range:e.pattern.ranges?.[0]}:e.kind===`SetFilter`&&e.bound.pattern.kind===`Name`?{name:e.bound.pattern.name,range:e.bound.pattern.ranges?.[0]}:void 0,n=t?.range;return t&&n?{kind:`Identifier`,name:t.name,location:{...n.start,range:n}}:void 0},zr=(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(`
|
|
342
|
+
`)}\n`},Br=(t,n,r=De(t,n===`tlapm`))=>{let i=n===`tlapm`,a=i?r:r.map(Se),o=0,s=[],c,l,u=[],d=[],f,p=0,m=[],h=/* @__PURE__ */ new WeakMap,g=e=>u[u.length-1].has(e),_=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),v=[],ee=[],y=[],b=(e,t=o-1)=>{let n=e===t?y[e]:void 0;if(n)return n;let r=a[t];v[e]??=_(a[e]),ee[t]??={line:r.line,column:r.endColumn};let i={module:d[0].name,start:v[e],end:ee[t]};return e===t&&(y[e]=i),i},x=(e,t)=>(e.location.range=b(t),e),te=(e=0)=>a[Math.min(o+e,a.length-1)],S=(e=0)=>{let t=te(e),n=s[s.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=e=>i&&(e.kind===`Keyword`||jr.has(e.text)),ie=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},ae=e=>e.kind===`End`?`EOF`:/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:gr.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:re(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,C=(t,n=te(),r)=>{let i=a[a.length-1],o=n.line===i.line&&n.column===i.column,s=new e.I(`${t} at line ${n.line}, column ${n.column}`,void 0,oe(t,n,o,r));return f!==void 0&&h.set(s,f),s},oe=(e,t,n,r)=>{if(!i)return{reason:e,line:t.line,column:t.column,isEnd:n};let o=a[m[0]-1],s=r?`Unexpected ${ae(r)}`:e;if(o)return{reason:s,line:o.line,column:o.endColumn+1,isEnd:n};let c=r?ie(r):t;return{reason:s,line:c.line,column:c.column,isEnd:n}},w=(e,t=te())=>C(e,t,t),se=t=>{let n={cursor:o,frame:f,restorePoints:m.length,offsideColumns:s.length,recursiveScopes:u.length},r=++p;f=r;try{let e=t();return f=n.frame,e}catch(t){if(!(t instanceof e.I)||h.get(t)!==r)throw t;o=n.cursor,f=n.frame,m.length=n.restorePoints,s.length=n.offsideColumns,u.length=n.recursiveScopes;return}},ce=e=>{let t=f;f=void 0;let n=e();return f=t,n},le=e=>{m.push(o);let t=e();return m.pop(),t},ue=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!re(e),T=(e,t=0)=>{let n=S(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},E=()=>{let e=S();if(e.kind===`End`)throw w(`Unexpected end of expression`);return o++,e},D=e=>T(e)?(o++,!0):!1,O=e=>{if(!T(e))throw w(`Expected ${JSON.stringify(e)} but found ${ne(S())}`);return E()},fe=()=>{let e=S();if(e.kind!==`Identifier`)throw w(`Expected an identifier but found ${ne(e)}`);if(re(e))throw w(`Unexpected keyword ${e.text}`);return o++,e.text},pe=()=>{let e=o;return{name:fe(),range:b(e)}},me=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),he=()=>{let e=S();return e.kind!==`String`&&(sr.has(e.text)||Qn.has(e.text)||ar.has(e.text))?(o++,e.text):fe()},ge=!1,_e=()=>S().kind===`Identifier`||!ue(S())?fe():(ge=!0,E().text),ve=e=>{if(!i)return e();s.push(-1);let t=e();return s.pop(),t},k=(e,t=`,`)=>{let n=[e()];for(;D(t);)n.push(e());return n},ye=(e=0)=>{if(T(`<<`,e)){let t=e+1;for(;S(t).kind===`Identifier`||T(`,`,t);)t++;return T(`>>`,t)&&T(`\\in`,t+1)}let t=e;for(;S(t).kind===`Identifier`;){if(T(`\\in`,t+1))return!0;if(!T(`,`,t+1))return!1;t+=2}return!1},be=()=>{if(T(`::`))return!0;if(!T(`(`))return!1;let e=1;for(;S(e).kind===`Identifier`&&T(`,`,e+1);)e+=2;return S(e).kind===`Identifier`&&T(`)`,e+1)&&T(`::`,e+2)},xe=()=>{if(!D(`<<`)){let e=pe();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=me(T(`>>`)?[]:k(pe));return O(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Ce=()=>{let e=()=>{let e=k(xe);O(`\\in`);let t=ce(M);return e.map(e=>({pattern:e,set:t}))},t=[e()];for(;T(`,`)&&(!i||ye(1));)E(),t.push(e());return t.flat()},we=()=>{let e=S();if(i&&jr.has(e.text)){let t=o;E();let n={kind:`Identifier`,name:e.text,location:_(e)};return{subscript:x(n,t),lastArgs:[]}}let t=i&&(e.kind===`Number`||e.kind===`String`||T(`@`));if(e.kind===`Identifier`){let t=o,n=[],r=[],a=e=>(r.push(b(o,o)),n.push(fe()),e&&T(`(`)?Ae():[]),s=[a(!i)];for(;T(`!`)&&S(1).kind===`Identifier`;)E(),s.push(a(!0));let c=s.slice(0,-1),l=_(e);l.range={...b(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(T(`<<`)||T(`(`)||T(`{`)||T(`[`)||t){let e=o,t=Ve();return{subscript:t.location.range?t:x(t,e),lastArgs:[]}}throw w(`Expected a subscript but found ${ne(e)}`)},Te=e=>{let t=S(1),n=S(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`&&T(`==`,ar.has(n.text)?3:4))},Ee=e=>{let t=S(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||T(`,`,1)||T(`)`,1)||t.kind===`Keyword`&&fr.has(t.text)||Te(e)},Oe=()=>{let e=S(),t=e.kind===`Operator`&&(Qn.has(e.text)||or.has(e.text))&&Ee(e);if(i&&e.kind!==`String`&&(or.has(e.text)||ur.has(e.text)&&e.text!==`'`&&!ir.has(e.text)||lr.has(e.text)&&S(-1).text===`(`&&S(-1).line===e.line&&S(-1).endColumn+1===e.column&&S(1).text===`)`&&S(1).line===e.line&&S(1).column===e.endColumn+1)&&Ee(e))throw C(`incomplete expression`,e);if(t&&!i&&e.text===`\\X`&&e.spelling!==`×`)throw C(`\\X may not be used as an infix operator`,e);if(t)return o++,x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:_(e)},o-1);if(e.kind!==`String`&&ur.has(e.text)&&Ee(e)){o++;let t=_(e);if(ir.has(e.text))return x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o-1);let n={kind:`Identifier`,name:`argument`,location:t};return x({kind:`Lambda`,params:[n.name],body:Fr(e.text,n,t),operator:e.text,location:_(e)},o-1)}if(T(`LAMBDA`)){let t=o;E();let n=me(k(pe));O(`:`);let r=M();return x({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:_(e)},t)}if(!i)return M();let n=se(M);if(n)return n;throw w(`Unexpected ${ne(S())}`)},ke,Ae=()=>ve(()=>{let e=o;O(`(`);let t=k(Oe);return O(`)`),ke=b(e),t}),je=()=>{let e=E();s.push(e.column);let t=[M()],n=()=>{for(;Nr(te())&&te().text===e.text&&te().column===e.column;)o++,t.push(M())};return i?ce(n):n(),s.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:_(e)}},Me=e=>ve(()=>{let t=_(e),n=S().kind===`Identifier`,r=T(`|->`,1)&&(n||ue(S()));if(r||n&&T(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o,n=_(S()),i=e();return n.range=b(t),O(r?`|->`:`:`),{name:i,value:M(),location:n}},a=[i(()=>n?fe():E().text),...D(`,`)?k(()=>i(fe)):[]];return O(`]`),{kind:e,fields:a,location:t}}if(ye()){let e=o,n=Ce();if(!i||T(`|->`)){O(`|->`);let e=M();return O(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}o=e}let a=M();if(D(`->`)){let e=M();return O(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(D(`EXCEPT`)){let e=k(()=>{let e=[o];O(`!`);let t=[];for(;T(`.`)||T(`[`);)if(e.push(o),D(`.`)){if(!ue(S()))throw w(`Expected a field name but found ${ne(S())}`);if(!i&&T(`@`))throw w(`@ used in !.@`);t.push(E().text)}else O(`[`),t.push(k(()=>M())),O(`]`);e.push(o,o+1),O(`=`);let n=M();e.push(o);let r=t=>b(e[t],e[t+1]-1);return{path:t.map((t,n)=>typeof t==`string`?{kind:`Field`,name:t}:{kind:`Index`,args:t,tupleRange:r(2*n+1<e.length-1?2*n+1:n+1)}),value:n,range:b(e[0])}});return O(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!T(`]_`)){let e=[a];for(;D(`,`);)e.push(M());return O(`]`),{kind:`Bracket`,args:e,location:t}}return O(`]_`),{kind:`BoxAction`,action:a,subscript:we().subscript,location:t}}),Ne=()=>{let e=o,t=x(Ue(),e),n=_(E());return x({kind:`Apply`,operator:`\\in`,args:[t,ce(M)],location:n},e)},Pe=e=>ve(()=>{let t=_(e);if(D(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ye()&&(S(1).text===`\\in`||T(`<<`))){let e=o,n=xe();O(`\\in`);let r=ce(M);if(D(`:`)){let e=ce(M);return O(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o=e}let n=S().kind===`Identifier`&&T(`\\in`,1)?Ne():M();if(D(`:`)){let e=Ce();return O(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;D(`,`);)r.push(M());return O(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Fe=e=>{let t=_(e),n=ve(()=>T(`>>`)||T(`>>_`)?[]:k(()=>M()));if(D(`>>_`)){if(n.length!==1)throw C(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:ce(we).subscript,location:t}}return O(`>>`),{kind:`Tuple`,elements:n,location:t}},Ie=e=>{let t=_(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ye()){let e=Ce();return O(`:`),{kind:n,bounds:e,body:M(),location:t}}let i=me(k(pe));return O(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:M(),isTemporal:r,location:t}},Le=e=>{let t=[];do{let n=o;if(D(`OTHER`))return O(`->`),{kind:`Case`,arms:t,other:M(),otherRange:b(n),location:_(e)};let r=M();O(`->`),t.push({condition:r,body:M()})}while(D(`[]`));return{kind:`Case`,arms:t,other:void 0,location:_(e)}},Re=()=>{let e=S(1);return T(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||dr.has(e.text)||e.kind===`Operator`&&(Qn.has(e.text)||ar.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&sr.has(e.text))},ze=()=>{let e=E();if(e.kind===`Number`)return{kind:`Operand`,operand:de(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return o--,{kind:`Bound`,args:Ae()}}return{kind:`Name`,name:e.text,args:T(`(`)?Ae():[]}},Be=(e,t,n,r,i)=>{let a=[{kind:`Name`,name:e,args:t}],s=[b(r,r)],c=[n];for(;Re();){E();let e=o;ke=void 0;let t=ze();s.push(t.kind===`Bound`?b(e):b(e,e)),a.push(t),c.push(ke)}let l=a.flatMap(e=>e.kind===`Name`?[e.name]:[]),u=l.join(`!`),d=a.flatMap(e=>`args`in e?e.args:[]),f=a.map(e=>`args`in e?e.args.length:0);return l.length<a.length?{kind:`Subexpression`,selectors:a,selectorRanges:s,argumentRanges:c,location:i}:d.length===0?{kind:`Identifier`,name:u,selectorRanges:s,location:i}:{kind:`Apply`,operator:u,args:d,...f.slice(0,-1).some(e=>e>0)&&{argumentCounts:f},argumentsRange:c.at(-1)??b(r),selectorRanges:s,argumentRanges:c,location:i}},Ve=e=>{let t=o,r=E(),a=_(r);if(i&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=k(fe);return O(`:`),{kind:`Lambda`,params:e,body:M(),location:a}}if(r.kind===`Number`)return{kind:`Number`,value:de(r.text),text:r.text,location:a};if(r.kind===`Decimal`)return{kind:`Decimal`,text:r.text,location:a};if(r.kind===`String`)return{kind:`String`,value:r.text,location:a};let s=r.kind===`Step`&&ht(r);if(!i&&s&&L()<0&&I.length<=1)throw C(`Step number used outside proof`,r);if(s&&r.text[1]===`+`)throw C(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||s){let n=s?gt(r)??r.text:r.text;if(be()){let o=me(D(`(`)?k(pe):[]);o.names.length>0&&O(`)`),O(`::`);let s=b(t),l=M();if(!i&&e!==void 0&&c!==void 0&&Mr(l)&&e.high>=c.low)throw C(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:n,params:o.names,paramRanges:o.ranges,head:s,body:l,location:a}}let o=T(`(`);if(n===`@`&&!o&&!Re())return{kind:`ExceptAt`,location:a};let l=o?Ae():[];return Re()?Be(n,l,o?ke:void 0,t,a):o?{kind:`Apply`,operator:n,args:l,argumentsRange:ke,location:a}:{kind:`Identifier`,name:n,location:a}}let l=r.kind===`Operator`&&(Pr(r.text)||r.text===`'`&&!i);if(l&&T(`(`)){let e=Ae();return!i&&Re()?Be(r.text,e,ke,t,a):n===`tlc`&&r.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:a}:r.text===`'`&&e.length===1?{kind:`Prime`,expression:e[0],location:a}:{kind:`Apply`,operator:r.text,spelling:r.spelling,args:e,argumentsRange:ke,location:a}}if(l&&!i)return Re()?Be(r.text,[],void 0,t,a):{kind:`Identifier`,name:r.text,spelling:r.spelling,location:a};switch(r.text){case`(`:{let e=ve(()=>M());return O(`)`),Ir.set(e,b(t)),e}case`[`:return Me(r);case`{`:return Pe(r);case`<<`:return Fe(r);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Ie(r);case`IF`:{let e=M();O(`THEN`);let t=M();return O(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:M(),location:a}}case`CASE`:return Le(r);case`LET`:{let e=[],t=[],n=[];for(u.push(/* @__PURE__ */ new Set);!D(`IN`);){if(i&&T(`RECURSIVE`))throw w(`Unexpected keyword RECURSIVE`);if(D(`RECURSIVE`)){n.push(...pt()),d[d.length-1].hasRecursiveLet=!0;continue}let r=ct(!i&&D(`LOCAL`));r.kind===`Instance`?t.push(r):e.push(r)}return u.pop(),{kind:`Let`,definitions:e,...t.length>0&&{instances:t},...n.length>0&&{recursive:n},body:M(),location:a}}case`CHOOSE`:{let e=xe(),t=D(`\\in`)?M():void 0;return O(`:`),{kind:`Choose`,pattern:e,set:t,body:M(),location:a}}case`WF_`:case`SF_`:{let e=we(),t=!T(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:ve(()=>{O(`(`);let e=M();return O(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:a}}}throw w(`Unexpected ${ne(r)}`,r)},He=(e,t,n)=>{c=l={low:t,high:n};let r=M(n+1),i=S(),a=ar.has(i.text)?Xn.high:Qn.get(i.text)?.high;if(i.kind===`Operator`&&a!==void 0&&a>=t)throw C(`Precedence conflict between ${e.text} and ${i.text}`,i);return r},Ue=()=>{let e=l;l=void 0;let t=S(),n=_(t);if(t.kind===`Operator`&&Nr(t))return je();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return E(),{kind:`Apply`,operator:`~`,args:[He(t,4,4)],location:n};case`-`:return E(),{kind:`Apply`,operator:`-.`,args:[He(t,12,12)],location:n};case`[]`:case`<>`:case`ENABLED`:case`UNCHANGED`:return E(),Fr(t.text,He(t,4,15),n);case`SUBSET`:case`UNION`:case`DOMAIN`:return E(),{kind:`Apply`,operator:t.text,args:[He(t,10,13)],location:n}}return Ve(e)},We=(e,t,n,r,i)=>{let a=_(e);if(e.text===`/\\`||e.text===`\\/`){let o=e.text===`/\\`?`And`:`Or`;return t.kind===o&&r?{...t,operands:[...t.operands,n],prefixEnds:[...t.prefixEnds??[],i]}:{kind:o,operands:[t,n],prefixEnds:[i],location:a}}return e.text===`\\X`?t.kind===`Product`&&r?{...t,factors:[...t.factors,n]}:{kind:`Product`,factors:[t,n],location:a}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t,n],location:a}},A=(e,t)=>e.text===`'`?{kind:`Prime`,expression:t,location:_(e)}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t],location:_(e)},Ge=()=>{E();let e=ve(()=>k(()=>M()));return ve(()=>O(`]`)),e},Ke=e=>{let t=o,n=Ue(),r=n.location.range?n:x(n,t),i;for(;;){let n=S();if(n.kind!==`Operator`)break;let a=_(n);if(ar.has(n.text)&&e<=15){E(),c=Xn,r=x(A(n,r),t);continue}if(n.text===`[`){let e=Ge();c=Zn,r=x({kind:`FunctionApplication`,function:r,args:e,location:a},t);continue}if(n.text===`.`&&ue(S(1))){E();let e=E().text;r=x({kind:`FieldAccess`,record:r,field:e,location:a},t);continue}let o=Qn.get(n.text);if(!o||o.low<e)break;if(i){let e=!(i.low>o.high||i.high<o.low),t=i.text===n.text&&o.isAssociative;if(e&&!t&&(i.text!==`\\X`||n.text!==`\\X`))throw C(`Precedence conflict between ${i.text} and ${n.text}`,n)}if(E(),o.low>12&&T(`-`))throw C(`Precedence conflict between ${n.text} and -`,S());c=l=o;let s=M(o.high+1),u=i?.text===n.text;r=x(We(n,r,s,u,b(t).end),t),i={...o,text:n.text}}return r},qe=e=>e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`||e.kind===`Identifier`||e.kind===`Step`&&ht(e)&&/^<\d/.test(e.text)||(e.kind===`Operator`||e.kind===`Keyword`)&&nr.has(e.text),j=(e,t)=>({start:t,end:o-1,expression:e.location.range?e:x(e,t)}),Je=(e,t,n,r)=>({...n,start:e,end:o-1,fixity:t,isLeft:!1,apply:r}),Ye=e=>e.kind===`Operator`&&ar.has(e.text)&&T(`(`,1)?se(()=>ve(()=>{E(),E();let t=M(),n=o-1;return O(`)`),{end:n,expression:A(e,t)}})):void 0,Xe=()=>{let e=0;for(let t=o+1;t<a.length;t++){let n=a[t];if(n.kind===`Operator`){if(e===1&&n.text===`,`)return!0;if(a[t-1].text!==`!`&&(kr.has(n.text)&&e++,Ar.has(n.text)&&--e===0))return!1}}return!1},Ze=e=>T(`(`,1)&&Xe()?se(()=>ve(()=>{E(),E();let t=M();O(`,`);let n=M();return O(`)`),{kind:`Apply`,operator:e.text,args:[t,n],location:_(e)}})):void 0,Qe=e=>{let t=o,n=S(),r=_(n),i=n.kind===`Operator`||n.kind===`Keyword`,a=i?Qn.get(n.text):void 0;if(!e){if(T(`[`)){let e=Ge();return Je(t,`Postfix`,tr,t=>({kind:`FunctionApplication`,function:t[0].expression,args:e,location:r}))}if(T(`.`)&&ue(S(1))){E();let e=E().text;return Je(t,`Postfix`,tr,t=>({kind:`FieldAccess`,record:t[0].expression,field:e,location:r}))}if(a){if(Ze(n)){o=t;return}return E(),{...Je(t,`Infix`,a,e=>We(n,e[0].expression,e[1].expression,e[0].joinedBy===n.text,b(e[0].start,e[1].end).end)),isLeft:$n(n.text,a),joins:n.text}}if(n.kind!==`Operator`||!ar.has(n.text))return;if(Ye(n)){o=t;return}return E(),Je(t,`Postfix`,Xn,e=>A(n,e[0].expression))}if(n.kind===`Operator`&&Nr(n))return j(je(),t);let s=a?Ze(n):void 0;if(s)return j(s,t);let c=Ye(n);if(c)return c.expression.location.range=b(t,c.end),{start:t,end:c.end,expression:c.expression};let l=i?er.get(n.text):void 0;if(l)return E(),Je(t,`Prefix`,l,e=>Fr(n.text===`-`?`-.`:n.text,e[0].expression,r));if(!qe(n))return;let u=n.kind===`Operator`&&rr.has(n.text);return j(u?Ve():ce(Ve),t)},$e=e=>e!==void 0&&`fixity`in e,et=e=>e!==void 0&&!(`fixity`in e),tt=(e,t)=>{let n=Math.min(e.start,t[0].start),r=Math.max(e.end,t[t.length-1].end),i=e.apply(t);return i.location.range=b(n,r),{start:n,end:r,expression:i,joinedBy:e.joins}},nt=e=>{let t=e.pop(),n=e.pop();if(!et(t)||!$e(n))throw C(`incomplete expression`);let r=n.fixity===`Infix`?e.pop():void 0;e.push(tt(n,et(r)?[r,t]:[t]))},rt=e=>{let t=e[e.length-2];return $e(t)?t:void 0},it=(e,t)=>t!==void 0&&e.high<t.low,at=()=>le(()=>{let e=se(()=>Qe(!0));if(e===void 0){let e=te();throw e.kind===`End`?w(`Unexpected end of expression`,e):C(`required expressions(s) missing before '${ae(e)}'`,e)}return ce(()=>{let t=[e];for(;;){let e=se(()=>Qe($e(t[t.length-1])));if(e===void 0)break;if(et(e)||e.fixity===`Prefix`){t.push(e);continue}for(;it(e,rt(t));)nt(t);let n=t[t.length-1];if(e.fixity===`Postfix`&&et(n)){t.splice(-1,1,tt(e,[n]));continue}let r=rt(t);r?.fixity===`Infix`&&r.isLeft&&e.isLeft&&!it(r,e)&&nt(t),t.push(e)}for(;t.length>1;)nt(t);let n=t[0];if(!et(n))throw C(`incomplete expression`);return n.expression})}),M=(e=0)=>i?at():Ke(e),ot=()=>{if(!D(`(`))return[];let e=P();return O(`)`),e},st=()=>{let e=_(S()),t=M(),n=a[o-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:d[0].name,start:e,end:r}}},ct=e=>{let t=o;return x(ut(e),t)},lt=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),ut=e=>{let t=S(),n=o,r=_(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:b(n,o-2),...st(),isLocal:e,isRecursive:g(t),location:r});if(t.kind===`Identifier`&&S(1).kind===`Operator`&&Qn.has(S(1).text)&&S(2).kind===`Identifier`&&T(`==`,3)){let e=pe(),t=E().text,n=pe();return O(`==`),i(t,[lt(e),lt(n)])}let a=t.kind!==`String`&&sr.has(t.text),s=t.kind===`Identifier`&&ar.has(S(1).text)&&T(`==`,2);if(a||s){let e=a?t.text:S(1).text;a&&E();let n=pe();return s&&E(),O(`==`),i(e,[lt(n)])}let c=fe();if(D(`[`)){let t=ve(()=>Ce());return O(`]`),O(`==`),{kind:`Function`,name:c,bounds:t,body:M(),isLocal:e,isRecursive:g(c),location:r}}let l=o,u=ot();return O(`==`),T(`INSTANCE`)?{...dt(c,u,e,r),definitionRange:b(l)}:i(c,u)},dt=(e,t,n,r)=>{let i=o;return O(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:_e(),substitutions:D(`WITH`)?k(()=>{let e=o,t=he(),n=b(e);return O(`<-`),{name:t,nameRange:n,expression:Oe()}}):[],isLocal:n,location:r,instanceRange:b(i)}},ft=()=>{let e=o;return x(N(),e)},N=()=>{let e=_(S());if(T(`_`)&&S(1).kind===`Operator`&&(Qn.has(S(1).text)||ar.has(S(1).text)))return E(),{name:E().text,arity:D(`_`)?2:1,location:e};if(S().kind!==`String`&&(sr.has(S().text)||i&&S().kind===`Operator`)&&T(`_`,1)){let t=E().text;return E(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=fe();if(!D(`(`))return{name:t,arity:0,location:e};let n=k(()=>O(`_`));return O(`)`),{name:t,arity:n.length,location:e}},P=()=>k(ft),pt=()=>{let e=P();return e.forEach(e=>u[u.length-1].add(e.name)),e},F=e=>{let t=0,n=e;do{let e=S(n);if(e.kind===`End`)return n;e.kind===`Operator`&&kr.has(e.text)&&t++,e.kind===`Operator`&&Ar.has(e.text)&&t--,n++}while(t>0);return n},mt=()=>{let e=S(),t=S(1);return e.kind===`Identifier`?T(`(`,1)||T(`[`,1)?T(`==`,F(1)):t.kind===`Operator`&&ar.has(t.text)?T(`==`,2):t.kind===`Operator`&&Qn.has(t.text)?S(2).kind===`Identifier`&&T(`==`,3):T(`==`,1):e.kind!==`String`&&sr.has(e.text)&&t.kind===`Identifier`&&T(`==`,2)},I=[],L=()=>I[I.length-1]??-1,R=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),z=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},ht=e=>!e.text.endsWith(`.`)&&!_r.has(z(e)),gt=e=>{let t=z(e);if(_r.has(t))return;let n=R(e);if(n>=0)return`<${n}>${t}`;let r=L(),i=I[I.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},_t=e=>{if(e.kind===`Keyword`)return mr.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return I.length===0;if(e.text[1]===`+`||I.length===0)return!0;let t=L();return t>=0&&R(e)>t},vt=e=>{let t=R(e),n=I.length-1,r=I[n-1]??-1,i=I[n]<0;return i&&(I[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:I[n]===t},yt=()=>{let e=S();return e.kind===`Step`?ht(e):e.kind===`Keyword`?Er.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!mt()},bt=()=>{let e=o,t=S();return t.kind===`Operator`&&!cr.has(t.text)&&Pr(t.text)?(o++,x({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:_(t)},e)):D(`MODULE`)?x({kind:`ModuleFact`,name:fe(),location:_(t)},e):M()},xt=()=>{let e=o,t=S(),n=k(()=>{let e=S();if((e.kind!==`Identifier`||re(e))&&e.kind!==`Operator`)throw w(`Expected a definition name but found ${ne(e)}`,e);return o++,e.text},`!`),r=_(t);return x(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},St=()=>k(()=>{if(i)return xt();let e=bt(),n=(e.kind===`Identifier`||e.kind===`Subexpression`||e.kind===`OperatorReference`)&&!Ir.has(e);return e.kind!==`ModuleFact`&&!n&&Lr.set(e,Yn(Sn(d[0].name,t),e)),e}),Ct=()=>{let e=se(M);if(!e)return[];let t=[e];return le(()=>{for(;T(`,`);){let e=se(()=>(E(),M()));if(!e)return;t.push(e)}}),t},wt=()=>{let e=i?Ct():yt()?k(bt):[],t=D(`DEF`)||D(`DEFS`);if(i&&e.length===0&&!t)throw w(`Expected a fact`);return{facts:e,defs:t?St():[]}},Tt=()=>{let e=o,t=E(),n=t.text===`USE`&&D(`ONLY`),r=b(e);return x({kind:t.text===`USE`?`Use`:`Hide`,isOnly:n,...wt(),keyword:r,location:_(t)},e)},Et=()=>{let e=o,t=_(S()),n=D(`NEW`),r=i?o:e,a=i?_(S()):t,s=S().kind===`Keyword`?Dr.get(S().text):void 0;if(!n&&s===void 0)throw w(`Expected a declaration but found ${ne(S())}`);if(s!==void 0&&E(),s===`Variable`){let e=pe();return x({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:a},r)}let c=ft(),l=(s??`Constant`)===`Constant`&&T(`\\in`);if(l&&c.arity>0)throw C(`declared symbol with arguments before \\in`);return l&&E(),x({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?M():void 0,nameRange:c.location.range,location:a},r)},Dt=()=>{if(S().kind===`Identifier`&&T(`::`,1)&&T(`ASSUME`,2)&&(E(),E()),T(`ASSUME`))return kt();if(S().kind===`Keyword`&&Or.has(S().text))return i?ce(Et):Et();if(!i)return M();let e=se(M);if(e===void 0)throw w(`Expected a hypothesis`);return e},Ot=()=>{let e=[Dt()];return le(()=>{for(;;){let t=se(()=>(O(`,`),Dt()));if(t===void 0)break;e.push(t)}}),e},kt=()=>{let e=o,t=_(O(`ASSUME`)),n=()=>{let n=i?Ot():k(Dt);return O(`PROVE`),x({kind:`AssumeProve`,assumptions:n,conclusion:M(),location:t},e)};return i?ce(n):n()},At=e=>{let t=0;for(;S(t).kind===`Identifier`&&T(`,`,t+1);)t+=2;return S(t).kind===`Identifier`&&T(e,t+1)},jt=()=>{let e=S();if(T(`USE`)||T(`HIDE`))return Tt();if(!i&&T(`INSTANCE`)){let t=o;return x(dt(void 0,[],!1,_(e)),t)}if(T(`DEFINE`)||mt()){let t=o;D(`DEFINE`);let n=[ct(!1)];for(;mt();)n.push(ct(!1));let r={kind:`Define`,definitions:n,location:_(e)};return x(r,t)}if(D(`HAVE`))return{kind:`Have`,expression:M()};if(D(`TAKE`)){let e=ye(),t=me(e?[]:k(pe)),n=e?Ce():[];return{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(D(`WITNESS`))return{kind:`Witness`,expressions:k(()=>M())};if(D(`PICK`)){let e=At(`:`),t=me(e?k(pe):[]),n=e?[]:Ce();return O(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:M()}}return D(`CASE`)?{kind:`Case`,expression:M()}:{kind:`Assert`,isSuffices:D(`SUFFICES`),statement:T(`ASSUME`)?kt():M()}},Mt=e=>{let t=S();if(t.kind!==`Step`)throw w(`Expected a step number but found ${ne(t)}`,t);if(!vt(t))throw C(`${e?`QED step`:`step`}'s number has bad level`,t);if(n!==`sany`&&R(t)<0&>(t)!==void 0)throw C(`<*> and <+> cannot be used for a named step`,t);return o++,{name:gt(t),token:t.text,location:_(t)}},Nt=()=>{let e=o,t=Mt(T(`QED`,1)),n=o,r=D(`QED`)?{kind:`Qed`}:jt(),i=b(e),a=b(n),s=_t(S());if(s&&!hr.has(r.kind))throw C(`Proof of a step that does not take a proof`);let c=s?It():void 0;return x({...t,body:r,head:i,statement:a,proof:c},e)},Pt=e=>{if(D(`BY`)){let t=b(o-1);return{kind:`By`,isOnly:D(`ONLY`),...wt(),keyword:t,location:e}}let t=S();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;E();let n=b(o-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Ft=()=>{let e=_(S());D(`PROOF`);let t=Pt(e);if(t)return t;let n=[Nt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(Nt());return{kind:`Steps`,level:L(),steps:n,location:e}},It=()=>{let e=o;I.push(-1);let t=Ft();return I.pop(),x(t,e)},Lt=()=>S().kind===`Step`||S().kind===`Keyword`&&mr.has(S().text),Rt=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return xr(e);let n=t.defs[t.defs.length-1]?.location.range;return br(xr({...e,end:e.start}),xr(n??t.keyword))},zt=()=>{let e=o,t=_(S()),n=D(`PROOF`),r=Pt(t);if(r){let t=x(r,e);return{kind:`Leaf`,proof:t,span:xr(t.keyword),first:e,end:o-1}}let i=S();if(i.kind!==`Step`)throw w(`Expected a step number but found ${ne(i)}`);let a=o;E();let s=o,c=D(`QED`)?{kind:`Qed`}:jt(),l=b(a);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:b(s),span:Rt(l,c),first:e,start:a,end:o-1}},Bt=(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=Vt(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={..._(a[i.first]),range:b(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}},Vt=(e,t,n,r,i)=>{let a=e[t];if(!a)throw Tr(`Unexpected end of (sub)proof at level ${n} before QED step`,r,wr);if(a.kind===`Leaf`)throw Tr(`Expecting a proof step but found a${vr[a.proof.kind]} leaf proof`,a.span,wr);if(!i&&a.isProof)throw Tr(`PROOF keyword found in step that does not begin subproof`,a.span,Cr);let o=a.token.text[1];if(o===`+`&&!i)throw Tr(`<+> used but no subproof expected`,a.span,Cr);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:R(a.token);if(s<n||!i&&s>n)return;let c=hr.has(a.body.kind)?Bt(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:gt(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{..._(a.token),range:b(a.start,l)}},d=br(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=Vt(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:br(d,f.span)}},Ht=()=>{if(!Lt())return;let e=[];for(;Lt();)e.push(zt());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=Bt(e,0,0,t.span),r=e[n.next];if(r)throw Tr(`extra step(s) after finished proof`,r.span,Sr,`Proof.Parser.toplevel`);return n.proof},Ut=(e,t,n,r)=>{e.definitions.some(e=>e.name===t)||e.definitions.push({kind:`Operator`,name:t,params:[],body:n,isLocal:!1,isRecursive:!1,location:r})},Wt=()=>{if(S().kind!==`Identifier`||!T(`==`,1))return;let e=fe();return E(),e},Gt=()=>{if(!i)return M();let e=te(),t=se(M);if(t)return t;throw w(`Expected "====" but found ${ne(e)}`,e)},Kt=e=>{let t=o,n=E(),r=Wt(),a=T(`ASSUME`)?kt():Gt(),s=i?Ht():_t(S())?It():void 0,c=x({name:r,statement:a,proof:s,location:_(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&a.kind!==`AssumeProve`&&Ut(e,r,a,c.location)},qt=()=>{let e=o,t=E(),n=Wt();return x({name:n,expression:M(),isAxiom:t.text===`AXIOM`,location:_(t)},e)},Jt=()=>{let e=_(O(`----`));O(`MODULE`);let t=_e();O(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[],hasRecursiveLet:!1};for(d.push(n),u.push(/* @__PURE__ */ new Set),D(`EXTENDS`)&&k(()=>{let e=o;n.extends.push(_e()),n.extendsRanges.push(b(e))});;){let t=o,r=S();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(),u.pop(),n;if(r.kind===`Separator`){if(T(`MODULE`,1)){let e=Jt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),O(`====`);continue}E()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=_(E()),r=P();n.constants.push(...r),e.range=b(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=_(E()),r=k(()=>{let e=o,t=_(S());return x({name:fe(),arity:0,location:t},e)});n.variables.push(...r),e.range=b(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=qt();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&Ut(n,e.name,e.expression,e.location);continue}case`USE`:case`HIDE`:{if(T(`USE`)&&T(`ONLY`,1))throw w(`Expected a module unit but found ${ne(r)}`);let e=Tt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=_(E()),r=pt();e.range=b(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:Yt(n,x(dt(void 0,[],!1,_(r)),t));continue;case`LOCAL`:if(E(),T(`INSTANCE`)){Yt(n,x(dt(void 0,[],!0,_(r)),t));continue}Yt(n,x(ut(!0),t));continue}r.kind===`Keyword`&&pr.has(r.text)?Kt(n):Yt(n,ct(!1))}}},Yt=(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}))},Xt=Jt(),Zt=ge?yn(t):void 0;if(Zt!==void 0)throw new e.I(Zt);return Xt},Vr=e=>Br(e,`tlc`),Hr=(e,t)=>Br(e,`tlc`,t),Ur=e=>Br(e,`tlapm`),Wr=e=>Br(e,`sany`),Gr=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},Kr=e=>{let t=Gr(e);return t^t>>>16},qr=e=>{let t=[...new Set(e)],n=2**Math.max(4,Math.ceil(Math.log2(t.length/.75)));return t.map((e,t)=>({name:e,index:t,bucket:Kr(e)&n-1})).sort((e,t)=>e.bucket-t.bucket||e.index-t.index).map(e=>e.name)},Jr=(e,t)=>{let n=JSON.stringify(t);e.some(e=>JSON.stringify(e)===n)||e.push(t)},Yr=e=>e===void 0?`Unknown location`:typeof e==`string`?`In module ${e}`:e.beginLine===0&&e.beginColumn===0&&e.endLine===0&&e.endColumn===0?`In module ${e.file}`:`line ${e.beginLine}, col ${e.beginColumn} to line ${e.endLine}, col ${e.endColumn} of module ${e.file}`,Xr=e=>e?.kind===`OpAppl`&&e.nullKind===`absent`,Zr=()=>({buckets:Array.from({length:11},()=>[]),count:0,threshold:8}),Qr=(e,t)=>(e&2147483647)%t,$r=e=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let r=e.buckets.length-1;r>=0;r--)e.buckets[r].forEach(e=>n[Qr(e.hash,t)].unshift(e));e.buckets=n,e.threshold=Math.floor(t*.75)},ei=(e,t,n=t)=>e.buckets[Qr(Gr(n),e.buckets.length)].find(e=>e.key===t)?.value,ti=(e,t,n,r=t)=>{let i=Gr(r),a=e.buckets[Qr(i,e.buckets.length)].find(e=>e.key===t);a?a.value=n:(e.count>=e.threshold&&$r(e),e.buckets[Qr(i,e.buckets.length)].unshift({hash:i,key:t,value:n}),e.count++)},ni=e=>e.buckets.toReversed().flatMap(e=>e.map(e=>e.value)),ri=`\0module `,ii=()=>({table:Zr(),symbols:[]}),ai=e=>e.kind===`Module`?ri+e.name:e.name,oi=(e,t)=>{ti(e.table,ai(t),t,t.name),e.symbols.push(t)},si=e=>e.kind===`ThmOrAssumpDef`?e.params.length:e.kind===`Module`?0:e.arity,ci=(e,t)=>ei(e.table,t),li=(e,t)=>ei(e.table,ri+t,t),ui=e=>e.context.symbols.filter(e=>e.kind===`OpDef`&&e.defKind===`UserDefined`),di=(e,t)=>ni(e.context.table).filter(e=>e.kind===`OpDecl`&&e.declKind===t).toReversed(),fi=e=>e.context.symbols.filter(e=>e.kind===`ThmOrAssumpDef`),pi={kind:`Local`},mi=`$subexpression`,hi=/* @__PURE__ */ new WeakMap,gi=/* @__PURE__ */ new WeakMap,_i=/* @__PURE__ */ new WeakMap,vi=/* @__PURE__ */ new WeakMap,yi=/* @__PURE__ */ new WeakMap,bi=/* @__PURE__ */ new WeakMap,xi=/* @__PURE__ */ new WeakMap,Si=/* @__PURE__ */ new WeakSet,Ci=/* @__PURE__ */ new WeakSet,wi=e=>Ci.has(e)||Ei(bi.get(e))!==void 0,Ti=e=>e?.find(e=>e.isEmpty?wi(e.node):Si.has(e.node)),Ei=e=>Ti(e)?.error,Di=/* @__PURE__ */ new WeakMap,Oi=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ki=new Map([...[`~>`,`-+->`,`\\cdot`,`\\X`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}]),[`'`,{key:`'`,arity:1,kind:`Builtin`}]]),Ai=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,ji=(e,t)=>Ai(e,t)?-1:+!!Ai(t,e),Mi=e=>e.kind===`Operator`?e.params.length:0,Ni=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Pi=e=>e.name.includes(`!`),Fi=e=>e.kind===`Function`&&!Pi(e)?e.bounds.length:void 0,Ii=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Li=(e,t,n)=>{let r=t.bindings.get(e);return r&&Ai(r.position,t.location)&&(!n||Ai(r.position,n.start))?r:void 0},Ri=(t,n)=>t!==void 0&&n!==void 0&&e.X(t)===e.X(n),zi=(t,n,r,i)=>{if(n===void 0)return!0;if(Ri(n.range,r.range))return!1;let a=r.range;if(a===void 0||i.isGenerated||n.kind!==`Builtin`&&!n.range)return!0;let o=e.X(a),s=n.range&&e.X(n.range);return n.kind===`Builtin`?i.errors.push({location:o,message:`Symbol ${j(t)} is a built-in operator, and cannot be redefined.`}):r.kind===`Parameter`||n.kind!==r.kind||n.arity!==r.arity?i.errors.push({location:o,message:`Multiply-defined symbol '${j(t)}': this definition or declaration conflicts \nwith the one at ${s}.`}):i.warnings.push({location:o,message:`Multiple declarations or definitions for symbol ${j(t)}. \nThis duplicates the one at ${s}.`}),!1},Bi=(e,t,n,r)=>zi(t,Ii(e,t)??Li(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Vi=(e,t,n)=>{zi(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Hi=(e,t,n,r)=>t.reduce((e,t,i)=>Bi(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Ui=(e,t,n)=>t.reduce((e,t)=>Bi(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Wi=e=>e.kind===`Name`?[e.name]:e.names,Gi=e=>e.flatMap(e=>Wi(e.pattern)),Ki=(e,t)=>{let n=t.definitions.get(e),r=Li(e,t,void 0);return n!==void 0&&(n===t.self?n.isRecursive:n.isRecursive?r!==void 0:Ai(n.location,t.location)&&(r===void 0||!Ai(r.position,n.location)))?n:void 0},qi=(e,t)=>{let n=Ki(e,t);if(n){let r=n.isRecursive?t.bindings.get(e):void 0;return{key:t.getKey(n),arity:r?.arity??Mi(n),params:r?.params??Ni(n),kind:`Definition`,range:n.location.range,functionArity:Fi(n)}}let r=Li(e,t,void 0);return r?.isPending?{key:e,arity:r.arity,params:r.params,kind:r.kind}:r?t.imported.get(e):void 0},Ji=(e,t)=>t.facts.has(e)||t.bindings.get(e)?.kind===`Theorem`,Yi=(e,t)=>t.bindings.get(e)?.kind===`Theorem`?t.goals.get(e):void 0,Xi=(e,t,n)=>Ii(t,e)??qi(e,n),Zi=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Qi=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Zi(e.location,e.spelling??t)},$i=e=>{if(!(e.kind!==`Apply`||e.argumentsRange)){if(e.args.length===2)return`infix`;if(e.args.length===1)return e.operator===`-.`?`prefix`:`postfix`}},ea=`In module --TLA+ BUILTINS--`,ta=/* @__PURE__ */ new Set([`Definition`,`Instance`,`Theorem`]),na=(t,n,r)=>r.errors.push({location:e.X(n),message:`Cannot take subexpression of \`${j(t)}'.`}),ra=e=>!/^[\p{L}\d_]/u.test(e),ia=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),aa=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,oa=(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])}})},sa=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?oa(e.name,[],void 0):oa(e.operator,e.args,e.argumentCounts),ca=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),la=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Gi(e.bounds),body:e.body,sets:ca(e.bounds)};case`SetMap`:return{names:Gi(e.bounds),body:e.expression,sets:ca(e.bounds)};case`SetFilter`:return{names:Wi(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Wi(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}},ua=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`:case`Selection`: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}},da=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,fa=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),pa=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind===`Lambda`||e.kind===`Selection`)return;if(e.kind===`Let`)return pa(e.body,t);let n=xi.get(e);if(!(e.kind===`Apply`&&n===void 0&&wi(e)))return e.kind===`FunctionApplication`&&wi(e)?pa(e.function,t):Ue(e).slice(0,n).reduce((e,n)=>e??pa(n,t),void 0)},ma=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??ma(i,t,n||fa(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&pa(e.set,t):pa(e,t)},ha=e=>e.kind===`Label`?ha(e.body):e,ga=e=>typeof e==`number`?`argument selector ${e}`:e,_a=`within the scope of a declaration
|
|
343
|
+
from outside that declaration's scope.`,va=(t,n,r,i,a)=>{let o=(n,r)=>{let a=(n===void 0?void 0:t.selectorRanges?.[n])??t.location.range;a&&i.errors.push({location:e.X(a),message:r})},s=r.isSuffices===r.isInProof,c=r.statement,l={node:c,isGoal:!0,isSufficesOpen:r.isSuffices},u=0,d=0;for(let[e,t]of n.slice(1).entries()){let r=e+1,i=l.node;if(t.kind===`Name`){if(n[r-1].kind!==`Name`)return i.kind!==`NewSymbol`&&i.kind!==`AssumeProve`&&ha(i).kind===`Let`?i:o(r-1,`A name selector here must be from a LET clause.`);let e=c.kind===`AssumeProve`?[...c.assumptions,c.conclusion]:[c],a=r===1?e.map((e,n)=>({position:n,label:ma(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:i.kind===`Label`?pa(i.body,t.name):void 0};if(!a?.label)return o(r,`Cannot find label \`${t.name}'.`);if(r===1&&c.kind===`AssumeProve`&&fa(c,a.position)&&s)return o(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${_a}`);if(t.args.length!==a.label.params.length)return o(r,`Label \`${t.name}' used with wrong number of arguments.`);l.node=a.label,l.isGoal=!1,l.isSufficesOpen=!1;continue}if(t.kind===`Colon`){if(n[r-1].kind!==`Name`)return o(r-1,`!: should not follow an operand selector.`);let e=n[r+1];if(e===void 0?r!==1:e.kind!==`Name`)return o(r,`\`!:' can be used only after a name and either at the end after an
|
|
344
|
+
operator name or before an operator name.`);continue}let a=t.kind===`Operand`?ga(t.operand):t.kind===`At`?`@`:`!(...)`,f=e=>t.kind===`Operand`?aa(t.operand,e):-1,p=`An unexpected null node specified by '${a}'.\nThis is probably due to a previous error.`;if(l.isSufficesOpen){if(f(1)!==0)return o(r,i.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${a}'.`);l.isSufficesOpen=!1;continue}if(i.kind===`NewSymbol`)return i;if(i.kind!==`AssumeProve`){let e=ha(i);if(Si.has(e))return o(r,`Subexpression selection failed, probably due to an error in the selected expression.`);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(r,`Selecting subexpression of expression that has none.`);if(wi(e))return o(r,`Choosing operand \`${a}' of subexpression with no operands.`);let n=la(e);if(n&&t.kind!==`Operand`){let e=t.kind===`Bound`?t.args.length:0;if(t.kind===`Bound`&&e!==n.names.length)return o(r,`Selector with ${e} argument(s) used for quantifier with ${n.names.length} bound identifier(s).`);u+=n.names.length,d+=e,l.node=n.body,l.isGoal=!1;continue}let s=n?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:ua(e);if(!c)return i;let m=e.kind===`Except`,h=f(m?e.updates.length+1:c.length);if(h===-1)return o(r,`Nonexistent operand specified by \`${a}'.`);if(m&&h>0)return o(r,`Selecting subexpression of an EXCEPT not yet implemented.`);if(l.node=c[h],l.isGoal=!1,Si.has(l.node))return o(r,p);continue}let m=[...i.assumptions,i.conclusion],h=f(m.length);if(h===-1)return o(r,`Nonexistent operand specified by \`${a}'.`);if(fa(i,h)&&(!l.isGoal||s))return o(r,`Accessing ASSUME/PROVE clause ${_a}`);let g=m[h];if(g.kind===`NewSymbol`&&r!==n.length-1)return o(r,`Selected a subexpression of a NEW clause of an ASSUME.`);if(l.node=g,l.isGoal=!1,g.kind!==`NewSymbol`&&g.kind!==`AssumeProve`&&Si.has(g))return o(r,p)}return l.node.kind===`AssumeProve`?a?l.node:o(void 0,`Selected ASSUME/PROVE instead of expression.`):l.node.kind===`NewSymbol`?a?l.node:o(void 0,`Selected a NEW declaration as an expression or operator.`):u===d?l.node:o(void 0,`Expected ${u} arguments but found ${d}.`)},ya=(t,n)=>{let r=n.isGenerated?void 0:n.hasLabelScope?n.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:n.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return r===void 0||!t.location.range?!1:(n.errors.push({location:e.X(t.location.range),message:r}),!0)},ba=(t,n,r)=>{let i=t.location.range;if(!i||r.isGenerated)return;let a=e.X(i),o=t.params.filter((i,a)=>{let o=Ii(n,i)?.kind===`Parameter`,s=t.paramRanges?.[a];return!o&&s&&r.errors.push({location:e.X(s),message:`Illegal parameter ${i} of label \`${t.name}'.`}),o});o.filter((e,t)=>o.indexOf(e)!==t).forEach(e=>r.errors.push({location:a,message:`Repeated formal parameter ${e} \nin label \`${t.name}'.`})),r.labelParams.filter(e=>!o.includes(e)).forEach(e=>r.errors.push({location:a,message:`Label ${t.name} must contain formal parameter \`${e}'.`}));let s=[...new Set(o.filter(e=>!r.labelParams.includes(e))),...t.params.filter(e=>!o.includes(e))];s.length>0&&r.errors.push({location:a,message:`Label ${t.name} declares extra parameter(s) ${s.map(e=>`${e} `).join(``)}`}),r.labels.has(t.name)&&r.errors.push({location:a,message:`Duplicate label \`${t.name}'.`}),r.labels.add(t.name)},xa=(e,t,n,r)=>{if(!da(e))return!1;let i=sa(e),a=i[0],o=i.length>1&&a.kind===`Name`?Ii(t,a.name)?.goal??Yi(a.name,n):void 0;return o&&{node:va(e,i,o,n,r)}},Sa=(e,t,n)=>{let r=Ii(t,e)??Li(e,n,void 0);return r?r.kind===`Instance`:ka(e,t,n)!==void 0&&[...n.bindings.keys()].some(t=>t.startsWith(`${e}!`))},Ca=(t,n,r,i)=>{let a=t.location;if(Ra(t,r,i))return;let o=Di.get(t);if(o!==void 0)return o;if(Oi(n))return t.kind===`Apply`?t.args.length:0;let s=Ii(r,n);if(s?.nonFactStep){i.errors.push({location:e.X(Qi(t,n)),message:`Step number of non-expression step used as an expression.`});return}let c=s?.goal?.keyword;if(c){i.errors.push({location:e.X(Qi(t,n)),message:`${c} proof step selected instead of expression.`});return}if(xa(t,r,i,!1)||ia(n)&&s)return t.kind===`Apply`?t.args.length:0;if(Sa(n,r,i)){let a=Ii(r,n)??Li(n,i,void 0),o=t.kind===`Apply`?t.args.length:0;if(a?.kind===`Instance`&&a.arity!==o){i.errors.push({location:e.X(t.kind===`Apply`&&t.argumentsRange||Qi(t,n)),message:`The operator ${n} requires ${a.arity} arguments.`});return}let s=Qi(t,n);i.errors.push({location:e.X({...s,start:{line:s.end.line,column:s.end.column-n.slice(n.lastIndexOf(`!`)+1).length+1}}),message:`Operator name ${n} is incomplete.`});return}if(s&&t.kind!==`OperatorReference`&&(t.resolution=pi),s)return s.arity;if(Yi(n,i)?.statement.kind===`AssumeProve`)return 0;let l=qi(n,i);if(l)return t.kind===`Identifier`?t.name=l.key:t.operator=l.key,Di.set(t,l.arity),l.arity;let u=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``,d=u===``?void 0:Ii(r,u)??qi(u,i);if(d&&(!ta.has(d.kind)||Ii(r,u)?.nonFactStep)){na(u,t.kind!==`OperatorReference`&&t.selectorRanges?.[0]||Qi(t,n),i);return}if(t.kind!==`OperatorReference`&&u!==``&&Ba(u,t.kind===`Apply`&&t.argumentCounts?t.args.slice(0,t.argumentCounts[0]):[],t.selectorRanges?.[0],(t.kind===`Apply`?t.argumentRanges?.[0]:void 0)??a.range,r,i))return;if(d||u!==``&&Ji(u,i))return t.kind===`Apply`?t.args.length:0;let f=$i(t),p=t.kind===`OperatorReference`||f!==void 0;if(!ra(n)||ia(n)||!p){i.errors.push({location:e.X(Qi(t,n)),message:`Unknown operator: \`${j(n)}'.`});return}let m=t.spelling??n;i.errors.push({location:e.X(f===`prefix`&&m===`-.`?Zi(a,`-`):Qi(t,n)),message:`Could not find declaration or definition of symbol '${m}'.`}),f&&Si.add(t),f&&a.range&&i.errors.push({location:e.X(a.range),message:`Couldn't resolve ${f} operator symbol \`${m}'.`})},wa=(e,t,n)=>(e.forEach(e=>H(e.set,t,n)),e.reduce((e,t)=>Hi(e,Wi(t.pattern),t.pattern.ranges,n),t)),Ta=(e,t)=>e.kind===`Identifier`&&e.name===t&&A(e)||Ue(e).some(e=>Ta(e,t)),Ea=(e,t)=>{e.kind===`FunctionConstruction`&&Ta(e.body,t)&&(e.isRecursive=!0),Ue(e).forEach(e=>Ea(e,t))},Da=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?Gi(t.bounds):[],labels:/* @__PURE__ */ new Set},o=t.name,s=t.location.range,c=t=>{s&&!a.isGenerated&&a.errors.push({location:e.X(s),message:t})},l=t.kind===`Function`?wa(t.bounds,n,a):Ui(n,t.params,a),u=Ii(l,o)??Li(o,a,s),d=u?.isPending===!0&&i.has(u);return u?.isPending&&!d?c(`Recursive ${t.kind===`Function`?`function`:`operator`} ${j(o)} defined at wrong LET/IN level.`):u&&!d?c(t.kind===`Function`?`Function name \`${o}' already defined or declared.`:`Operator ${j(o)} already defined or declared.`):u&&t.kind===`Function`&&u.arity>0?c(`Function ${j(o)} has operator arguments in its RECURSIVE declaration.`):u&&t.kind===`Operator`&&(u.arity!==t.params.length||t.params.some(e=>e.arity>0))&&c(`Definition of ${j(o)} has different arity than its RECURSIVE declaration.`),u&&d&&t.kind===`Operator`&&(u.params=Ni(t)),t.kind===`Function`?(H(t.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),Ea(t.body,o),t.isSelfReferential=Ta(t.body,o)):H(t.body,l,a),u&&d?((t.kind===`Operator`||u.arity===0)&&(u.isPending=!1,u.range=s),!1):t.kind===`Function`?u===void 0:zi(o,Ii(n,o)??Li(o,a,s),{kind:`Definition`,arity:Mi(t),range:s},a)},Oa=(t,n,r,i=[],a=[])=>{let o=/* @__PURE__ */ new Set,s=t.filter(e=>e.isRecursive&&a.every(t=>t.name!==e.name)).reduce((e,t)=>{if(Ii(e,t.name)?.isPending)return e;let n={name:t.name,arity:Mi(t),params:Ni(t),kind:`Definition`,parent:e,isPending:!0};return o.add(n),n},n),c=/* @__PURE__ */ new Map,l=(e,t)=>{let n={kind:`Definition`,arity:t.arity,params:Array(t.arity).fill(0),range:t.location.range},i=zi(t.name,Ii(e,t.name)??Li(t.name,r,n.range),n,r)?{...n,name:t.name,parent:e,isPending:!0}:void 0;return i&&o.add(i),c.set(t,i),i??e},u=[...r.isGenerated?[]:i,...a].toSorted((e,t)=>ji(e.location,t.location)),d=(e,t)=>{let n=u.findIndex(e=>!t(e));return u.splice(0,n===-1?u.length:n).reduce((e,t)=>`kind`in t?$a(t,e,r):l(e,t),e)},f=d(t.reduce((e,t)=>{let n=Oi(t.name)?e:d(e,e=>!Ai(t.location,e.location)),a={name:t.name,arity:Mi(t),kind:`Definition`,range:t.location.range,parent:n,functionArity:Fi(t)};if(Pi(t))return{...a,params:Ni(t),functionArity:Ii(n,t.name)?.functionArity};let s=i.some(e=>e.location===t.location),c=r.isGenerated||t.isLocal||Oi(t.name),l=s?{...r,isGenerated:!0,errors:[],warnings:[]}:c?{...r,isGenerated:c}:r;return Da(t,n,l,o)?{...a,params:Ni(t)}:n},s),()=>!0);return c.forEach((t,n)=>{let i=n.location.range;i&&!r.isGenerated&&(!t||t.isPending)&&r.errors.push({location:e.X(i),message:`Symbol ${j(n.name)} declared in RECURSIVE statement but not defined.`})}),f},ka=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Ii(t,r)??Li(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity,range:i.range}:void 0},Aa=(t,n,r)=>{if(!da(t))return!1;let i=sa(t),a=i.findIndex(e=>e.kind!==`Name`),o=ka(i.slice(0,a===-1?i.length:a).flatMap(e=>e.kind===`Name`?[e.name]:[]).join(`!`),n,r),s=i[0],c=s.kind===`Name`?s.args.length:0;if(!o||c===o.arity)return!1;let l=(t.kind===`Identifier`?void 0:t.argumentRanges?.[0])??t.location.range;return l&&r.errors.push({location:e.X(l),message:`The operator ${o.name} requires ${o.arity} arguments.`}),!0},ja=(t,n,r,i,a)=>{let o=t?.kind===`Definition`?t.params:void 0;return!t||!o||o.length===t.arity?!1:(i&&!a.isGenerated&&a.errors.push({location:e.X(i),message:`Wrong number of arguments (${r}) given to operator '${j(n)}', \nwhich requires ${o.length} arguments.`}),!0)},Ma=(t,n,r)=>{let i=t.location.range,a=t=>{i&&r.errors.push({location:e.X(i),message:t})},o=_i.get(t);if(t.kind===`Lambda`&&t.operator!==void 0)a(`The operator ${j(t.operator)} requires 1 arguments.`);else if(o)r.errors.push(o);else if(t.kind===`Lambda`&&i)Si.add(t),a(`LAMBDA expression used where an expression is required.`);else if(t.kind===`OperatorReference`){let e=Ca(t,t.operator,n,r);e!==void 0&&a(`The operator ${j(t.operator)} requires ${e} arguments.`)}else H(t,n,r)},Na=e=>{let t=e.kind===`Subexpression`||e.kind===`Apply`&&e.argumentCounts?.at(-1)===0?sa(e):[],n=t.findIndex(e=>`args`in e&&e.args.length>0);if(n===-1||!da(e))return;let r=t[n];return{index:n,range:e.selectorRanges?.[n],message:`Selector \`${r.kind===`Name`?r.name:`!(...)`}' should not have argument(s).`}},Pa=(t,n,r,i,a,o,s)=>{let c=(t,n)=>{t&&s.errors.push({location:e.X(t),message:n})},l=(t,l)=>{let u=ka(i,o,s)?.range??Xi(i,o,s)?.range;u&&c(a,`Operator with incorrect arity passed as argument. \nOperator '${j(t)}' of arity ${l} is argument number ${r+1} (counting from 1) to operator \`${e.X(u)}', \nbut an operator of arity ${n} was expected.`)},u=t.location.range;if(n===0)return Ma(t,o,s),!0;let d=Ir.get(t);if(d)return c(d,`An expression appears as argument number ${r+1} (counting from 1) to operator '${i}', in a position an operator is required.`),!1;let f=hi.get(t)??t,p=Na(f);if(p)return c(p.range,p.message),!1;if(t.kind===`Lambda`){if(hi.has(t)?H(t,o,s):za(t,o,s),Ei(bi.get(t)))return!1;let e=t.params.length===n;return!e&&hi.has(t)?c(u,`Expected arity ${n} but found operator of arity ${t.params.length}.`):!e&&u&&t.operator===void 0?c(a,`Lambda expression with arity ${t.params.length} used as argument ${r+1} of operator \`${i}', \nbut an operator of arity ${n} is required.`):!e&&t.operator!==void 0&&l(t.operator,t.params.length),e}if(f!==t){let e=Ei(bi.get(t));return e&&s.errors.push(e),e||c(f.location.range,`Expected arity ${n} but found operator of arity 0.`),!1}if(t.kind===`Subexpression`)return H(t,o,s),!1;if(t.kind!==`Identifier`&&t.kind!==`OperatorReference`)return c(u,`An expression appears as argument number ${r+1} (counting from 1) to operator '${i}', in a position an operator is required.`),!1;let m=t.kind===`Identifier`?t.name:t.operator,h=Xi(m,o,s)?.params??[],g=Ca(t,m,o,s);return t.kind===`Identifier`&&g!==void 0&&g!==n&&c(Qi(t,m),`Expected arity ${n} but found operator of arity ${g}.`),t.kind===`OperatorReference`&&g!==void 0&&g!==n&&l(m,g),g===n&&h.every(e=>e===0)},Fa=(t,n,r)=>{let i=t.operator,a=Xi(i,n,r),o=Aa(t,n,r)?void 0:Ca(t,i,n,r);if(o!==void 0&&o!==t.args.length&&r.errors.push({location:e.X(t.argumentsRange??Qi(t,i)),message:`The operator ${j(i)} requires ${o-(ka(i,n,r)?.arity??0)} arguments.`}),o!==t.args.length){Ci.add(t);return}let s=a&&(a.kind===`Definition`?a.params:t.args.map(()=>0));if(s===void 0){t.args.forEach(e=>Ia(e,n,r));return}let c=t.selectorRanges?.at(-1)??Qi(t,i),l=i===mi,u=t.args.slice(0,s.length).map((e,t)=>{let a=l?yi.get(e):void 0;return Pa(e,s[t],a?.index??t,a?.operator??i,a?.range??c,n,l?{...r,isGenerated:!1}:r)});ja(a,i,t.args.length,t.location.range,r)||u.forEach((n,a)=>{!n&&t.location.range&&r.errors.push({location:e.X(t.location.range),message:`Argument number ${a+1} to operator '${l?`LAMBDA`:i}' \nshould be a ${s[a]}-parameter operator.`})})},Ia=(e,t,n)=>{e.kind===`Identifier`?Ca(e,e.name,t,n):H(e,t,n)},La=(e,t,n)=>e.forEach(e=>e.args.slice(0,e.params.length).forEach((r,i)=>Pa(r,e.params[i],i,e.operator,e.range,t,n))),Ra=(e,t,n)=>{let r=gi.get(e);return r?(La(r.applications,t,n),n.errors.push(Ei(r.nulls)??r.error),!0):!1},za=(e,t,n)=>H(e.body,Hi(t,e.params,e.paramRanges,n),{...n,labelParams:[...n.labelParams,...e.params]}),H=(t,n,r)=>{if(hi.has(t)&&!r.isGenerated){let e=Ti(bi.get(t));if(e){La(e.applications,n,r),r.errors.push(e.error);return}H(t,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>H(e,n,r)),a=e=>({...r,labelParams:[...r.labelParams,...e]});switch(t.kind){case`Number`:case`Decimal`:case`String`:return;case`ExceptAt`:!r.isInExcept&&t.location.range&&(Ci.add(t),r.errors.push({location:e.X(t.location.range),message:`@ used where its meaning is not defined.`}));return;case`Identifier`:{let i=t.name,a=Aa(t,n,r)?void 0:Ca(t,i,n,r);if(a===0){let a=Xi(i,n,r),o=a?.kind;(o===`Variable`||o===`Theorem`||o?.startsWith(`New`)||Ji(i,r))&&Ci.add(t);let s=Ii(n,i);if((s?s.goal:Yi(i,r))?.statement.kind===`AssumeProve`){r.errors.push({location:e.X(Qi(t,i)),message:`ASSUME/PROVE used where an expression is required.`});return}ja(a,i,0,Qi(t,i),r);return}a!==void 0&&r.errors.push({location:e.X(Qi(t,i)),message:`The operator ${j(i)} requires ${a} arguments.`}),Ci.add(t);return}case`OperatorReference`:Ca(t,t.operator,n,r);return;case`Apply`:Fa(t,n,r);return;case`Lambda`:hi.has(t)?za(t,n,r):t.location.range&&(Si.add(t),r.errors.push({location:e.X(t.location.range),message:`LAMBDA expression used where an expression is required.`}));return;case`And`:case`Or`:i(t.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:H(t.expression,n,r);return;case`If`:i([t.condition,t.consequent,t.alternative]);return;case`Case`:i(t.arms.flatMap(e=>[e.condition,e.body])),t.other&&H(t.other,n,r);return;case`Let`:H(t.body,Oa(t.definitions,n,r,t.instances,t.recursive),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:H(t.body,wa(t.bounds,n,r),a(Gi(t.bounds)));return;case`UnboundedQuantifier`:H(t.body,Hi(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&H(t.set,n,r),H(t.body,Hi(n,Wi(t.pattern),t.pattern.ranges,r),a(Wi(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:H(t.predicate,wa([t.bound],n,r),a(Wi(t.bound.pattern)));return;case`SetMap`:H(t.expression,wa(t.bounds,n,r),a(Gi(t.bounds)));return;case`FunctionSet`:i([t.domain,t.range]);return;case`Record`:case`RecordSet`:t.fields.forEach((i,a)=>{t.fields.slice(0,a).some(e=>e.name===i.name)&&r.errors.push({location:e.X(i.location.range??Zi(i.location,i.name)),message:`Non-unique fields in constructor.`}),H(i.value,n,r)});return;case`Except`:H(t.function,n,r),t.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),H(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:{let a=t.function,o=a.kind===`Identifier`?a.name:a.kind===`Apply`?a.operator:void 0,s=o===void 0?void 0:Xi(o,n,r)?.functionArity;H(a,n,r);let c=t.args.length;if(s===void 0||c<2||s===c||wi(a)){i(t.args);return}Ci.add(t),t.location.range&&r.errors.push({location:e.X(t.location.range),message:`Function '${o}' is defined with ${s} parameters, but is applied to ${c} arguments.`});return}case`FieldAccess`:H(t.record,n,r);return;case`Product`:i(t.factors);return;case`BoxAction`:case`AngleAction`:i([t.action,t.subscript]);return;case`WeakFairness`:case`StrongFairness`:i([t.subscript,t.action]);return;case`Label`:if(ya(t,r))return;H(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),ba(t,n,r);return;case`Subexpression`:Va(t,n,r)&&Ci.add(t);return;case`Selection`:return}},Ba=(t,n,r,i,a,o)=>{let s=Ii(a,t)??Li(t,o,void 0);return!s?.isPending||!r||!i?!1:n.length===s.arity?(n.forEach(e=>H(e,a,o)),o.errors.push({location:e.X(r),message:`Subexpression of \`${t}' used inside the operator's definition.`}),!0):(o.errors.push({location:e.X(i),message:`The operator ${t} requires ${s.arity} arguments.`}),!0)},Va=(t,n,r)=>{if(Aa(t,n,r)||Ra(t,n,r))return!0;let i=t.selectors[0],a=t.selectorRanges?.[0],o=t.selectors.findIndex(e=>e.kind!==`Name`),s=t.selectors.slice(0,o).flatMap(e=>e.kind===`Name`?[e.name]:[]),c=s.findIndex((e,t)=>t>0&&(qi(s.slice(0,t+1).join(`!`),r)?.kind??`Instance`)!==`Instance`),l=s.length>1&&(Ii(n,s[0])??Li(s[0],r,void 0))?.kind===`Instance`,u=t.selectorRanges?.[o-1];if(l&&c===-1&&a&&u)return r.errors.push({location:e.X({module:a.module,start:a.start,end:u.end}),message:`Unknown operator: \`${j(s.join(`!`))}'.`}),!0;let d=s.slice(0,c+1).join(`!`),f=c>0?qi(d,r):void 0,p=t.selectors.slice(0,c+1).flatMap(e=>`args`in e?e.args:[]).length,m=t.argumentRanges?.[c]??t.location.range;if(f&&f.arity!==p&&m)return r.errors.push({location:e.X(m),message:`The operator ${j(d)} requires ${f.arity} arguments.`}),!0;if(i.kind===`Name`&&t.selectors[1].kind!==`Name`&&a){let t=Ii(n,i.name),o=t??qi(i.name,r);if(o===void 0&&!Ji(i.name,r)||o?.kind===`Instance`)return r.errors.push({location:e.X(a),message:`Unknown operator: \`${j(i.name)}'.`}),!0;if(o&&(!ta.has(o.kind)||t?.nonFactStep))return na(i.name,a,r),!0}if(i.kind===`Name`&&Ba(i.name,i.args,a,t.argumentRanges?.[0]??t.location.range,n,r))return!0;t.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Ia(e,n,r));let h=xa(t,n,r,!1);return h?h.node===void 0:!1},Ha=(t,n)=>{let r=t.location.range;!n.isModuleKnown(t.name,t.location)&&r&&n.errors.push({location:e.X({...r,start:{line:r.end.line,column:r.end.column-t.name.length+1}}),message:`Module \`${t.name}' used without being extended or instantiated.`})},Ua=(t,n,r,i)=>{if(t.kind===`ModuleFact`){Ha(t,i);return}if(t.kind===`ExceptAt`&&t.location.range)return i.errors.push({location:e.X(t.location.range),message:"Unknown operator: `@'."}),ea;let a=qa(t,n,r,i);if(hi.has(t))return H(t,r,i),a;if(Aa(t,r,i))return a;let o=xa(t,r,i,!0);if(o){let n=o.node?.kind;return n===void 0?ea:n===`AssumeProve`||n===`NewSymbol`?void 0:t.location.range&&e.X(t.location.range)}if(t.kind===`Subexpression`)return Va(t,r,i)?ea:a;let s=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;return t.kind===`Identifier`&&Ii(r,s)?.nonFactStep?(i.errors.push({location:e.X(Qi(t,s)),message:`Step number of non-fact used as a fact`}),ea):(Ji(s,i)||Ii(r,s)?.goal||t.kind===`Identifier`&&Sa(s,r,i)||H(t,r,i),a)},Wa=(t,n,r)=>{if(t.kind===`ModuleFact`)return Ha(t,r),r.isModuleKnown(t.name,t.location);let i=Lr.get(t)??[];if(r.errors.push(...i.map(e=>({location:Yr(e.location),message:e.message}))),i.length>0)return!1;let a=Rr(t),o=a??hi.get(t)??t,s=o.location.range;if(!s)return!0;let c=o.kind===`Identifier`?o.name:o.kind===`Apply`||o.kind===`OperatorReference`?o.operator:``,l=Ii(n,c),u=l??qi(c,r)??Li(c,r,s);return u===void 0&&Ji(c,r)||(da(o)&&sa(o).length>1&&(u===void 0||Na(o))?Ka(t,o,n,r):c===``||Ga(c,l,u,s,r))?!0:(r.errors.push({location:e.X((a?t:o).location.range??s),message:`DEF clause entry should describe a defined operator.`}),!1)},Ga=(t,n,r,i,a)=>(r===void 0&&a.errors.push({location:e.X(i),message:`Unknown operator: \`${j(t)}'.`}),n?.nonFactStep===`Define`||(n?.nonFactStep&&a.errors.push({location:e.X(i),message:`DEF clause entry refers to a non-definition step.`}),r!==void 0&&ta.has(r.kind)&&!ia(t))),Ka=(t,n,r,i)=>{let a=(t,n)=>(t&&i.errors.push({location:e.X(t),message:n}),!1),o=Na(n);if(o?.index===0)return a(o.range,o.message);let s=sa(n),c=n.selectorRanges,l=gi.get(t);if(!l&&!hi.has(t)){let e=s[0],t=e.kind===`Name`?e.name:``,l=Ii(r,t),u=l??qi(t,i);if(u&&(!ta.has(u.kind)||l?.nonFactStep)&&c?.[0])return na(t,c[0],i),!1;if(o)return a(o.range,o.message);if(xa(n,r,i,!1))return!1;let d=c?.[0],f=c?.[s.findLastIndex(e=>e.kind===`Name`)],p=s.flatMap(e=>e.kind===`Name`?[e.name]:[]);return a(d&&f&&{...d,end:f.end},`Unknown operator: \`${j(p.join(`!`))}'.`)}if(o)return a(o.range,o.message);let u=l?Ei(l.nulls)??l.error:Ei(bi.get(t));return u?(i.errors.push(u),!1):s.at(-1)?.kind===`Name`&&s.at(-2)?.kind!==`Name`},qa=(t,n,r,i)=>{let a=t.location.range&&e.X(t.location.range);if(hi.has(t))return Ei(bi.get(t))?ea:n.location.range&&e.X(n.location.range);if(gi.has(t)||t.kind===`ExceptAt`)return ea;switch(t.kind){case`Number`:case`String`:case`Decimal`:case`Let`:case`Label`:return;case`Identifier`:case`Apply`:case`Subexpression`:{let e=sa(t)[0];if(t.kind===`Subexpression`||e.kind!==`Name`)return;let n=t.kind===`Identifier`?t.name:t.operator,o=Ii(r,e.name)?.goal??Yi(e.name,i);if(Ji(n,i)||o||ia(n)&&Ii(r,n)||t.kind===`Identifier`&&Sa(n,r,i))return;let s=Xi(n,r,i),c=t.kind===`Apply`?t.args.length:0;return s?.arity===c?a:ea}default:return a}},Ja=(t,n,r)=>{let i=vi.get(t.facts)??t.facts,a=t.facts.map((e,t)=>Ua(e,i[t],n,r)),o=t.facts.filter(e=>e.kind!==`ModuleFact`||r.isModuleKnown(e.name,e.location)).length,s=t.defs.filter(e=>Wa(e,n,r)).length;a.forEach(e=>{e&&t.kind===`Hide`&&r.errors.push({location:e,message:`The only expression allowed as a fact in a HIDE is
|
|
345
|
+
the name of a theorem, assumption, or step.`})});let c=t.location.range;o+s===0&&c&&r.errors.push({location:e.X(c),message:t.kind===`By`?`Empty BY`:`Empty USE or HIDE statement.`})},Ya=(e,t,n)=>(e.set&&H(e.set,t,n),Bi(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Xa=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Ya(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Xa(t,e.scope,e.unit,!0):H(t,e.scope,e.unit),e),{scope:t,unit:n});return H(e.conclusion,i.scope,i.unit),i.scope},Za=(e,t,n)=>e.kind===`AssumeProve`?Xa(e,t,n):(H(e,t,n),t),Qa=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Ja(e,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>to(t,e,r),t)},$a=(e,t,n)=>{let r=so(e,t,n);return e.name===void 0?r:Bi(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},eo=(e,t)=>{let n=(e,t)=>({statement:t,isSuffices:!1,isInProof:!1,keyword:e});switch(e.kind){case`Have`:return n(`HAVE`,{kind:`Tuple`,elements:[e.expression],location:t});case`Case`:return n(`CASE`,{kind:`Tuple`,elements:[e.expression],location:t});case`Witness`:return n(`WITNESS`,{kind:`Tuple`,elements:e.expressions,location:t});case`Take`:return n(`TAKE`,{kind:`Tuple`,elements:ca(e.bounds),location:t});case`Pick`:return n(`PICK`,e.bounds.length>0?{kind:`Exists`,bounds:e.bounds,body:e.body,location:t}:{kind:`UnboundedQuantifier`,quantifier:`Exists`,names:e.names,body:e.body,location:t});case`Qed`:return n(`QED step`,{kind:`Tuple`,elements:[],location:t});default:return}},to=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=eo(r,e.location),o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,goal:a},s=(t,n)=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,nonFactStep:n};switch(r.kind){case`Assert`:{let a=Za(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Qa(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0,keyword:r.isSuffices&&r.statement.kind!==`AssumeProve`?`SUFFICES`:void 0};return Qa(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 Ja(r,t,n),s(t,r.kind);case`Instance`:return s($a(r,t,i),r.kind);case`Define`:return s(r.definitions.reduce((e,t)=>t.kind===`Instance`?$a(t,e,i):Oa([t],e,n),t),r.kind);case`Have`:case`Case`:return H(r.expression,t,i),Qa(e.proof,o(t),n),o(t);case`Witness`:return r.expressions.forEach(e=>H(e,t,i)),o(t);case`Take`:return o(Hi(wa(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let a=Hi(wa(r.bounds,t,i),r.names,r.nameRanges,i);return H(r.body,a,{...i,labelParams:[...i.labelParams,...Gi(r.bounds),...r.names]}),Qa(e.proof,o(t),n),o(a)}default:return Qa(e.proof,o(t),n),o(t)}},no=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Za(e.statement,void 0,t);e.name!==void 0&&Vi(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Qa(e.proof,n,t),r&&(r.isInProof=!1)},ro={line:0,column:0},io=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),ao=(e,t)=>{let n=new Map([...ki,...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},oo=(t,n,r,i,a)=>{let o=t.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(e,t)=>a.errors.push({location:t,message:`An operator must be substituted for symbol '${j(e.name)}', and it must have arity ${e.arity}.`}),c=(t,n)=>{let r=n.location.range;if(t.arity===0){Ma(n,o,a);return}let i=Ir.get(n),c=i?void 0:hi.get(n);if(c){let r=n.kind===`Lambda`?n.params.length:0,i=Ei(bi.get(n));n.kind===`Lambda`?H(n,o,a):i&&a.errors.push(i),!i&&r!==t.arity&&c.location.range&&a.errors.push({location:e.X(c.location.range),message:`Expected arity ${t.arity} but found operator of arity ${r}.`}),(i||r!==t.arity)&&s(t,ea);return}if(n.kind===`Subexpression`&&!i){H(n,o,a),s(t,ea);return}if(n.kind===`Lambda`&&!i){za(n,o,a),n.params.length!==t.arity&&r&&s(t,e.X(r));return}if(n.kind===`OperatorReference`&&!i){let i=Ca(n,n.operator,o,a);i===void 0?s(t,ea):i!==t.arity&&r&&s(t,e.X(r));return}if(n.kind!==`Identifier`||i){let n=i??r;n&&a.errors.push({location:e.X(n),message:`Arity ${t.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${j(t.name)}'.`}),s(t,ea);return}let l=Ca(n,n.name,o,a);l!==void 0&&l!==t.arity&&a.errors.push({location:e.X(Qi(n,n.name)),message:`Expected arity ${t.arity} but found operator of arity ${l}.`}),l!==t.arity&&s(t,ea)},l=t.location.range,u=n.filter(e=>Ii(o,e.name)!==void 0||qi(e.name,a)!==void 0).map(e=>({declaration:e,expression:{kind:`Identifier`,name:e.name,location:t.location}}));u.filter(e=>e.declaration.arity===0).forEach(t=>{let n=Ca(t.expression,t.declaration.name,o,a);n&&l&&a.errors.push({location:e.X(l),message:`Wrong number of arguments (0) given to operator '${j(t.declaration.name)}', \nwhich requires ${n} arguments.`})});let d=/* @__PURE__ */ new Map;return t.substitutions.forEach(t=>{let r=t.name,i=n.find(e=>e.name===r);if(!i){a.errors.push({location:e.X(t.nameRange),message:`Identifier '${r}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let o=t.expression;c(i,o);let s=o.location.range;d.has(r)?s&&a.errors.push({location:e.X(s),message:`Multiple substitutions for symbol '${r}' in substitution.`}):d.set(r,o)}),u.filter(e=>!d.has(e.declaration.name)).forEach(t=>{(t.declaration.arity===0?0:Ca(t.expression,t.declaration.name,o,a))!==t.declaration.arity&&l&&s(t.declaration,e.X(l)),d.set(t.declaration.name,t.expression)}),n.filter(e=>!d.has(e.name)).forEach(t=>{let n=t.location.range;l&&n&&a.errors.push({location:e.X(l),message:`Substitution missing for symbol ${j(t.name)} declared at ${e.X(n)} \nand instantiated in module ${r}.`})}),d},so=(e,t,n)=>{let r=n.getInstance(e);return oo(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,t)=>Bi(e,t[0],t[1],n),t)},co=(e,t,n,r)=>{let i=ao(n,r.imported),a=new Map([...n.constants,...n.variables].map(e=>[e.name,e.location])),o={location:e.location,errors:[],warnings:[]};return r.reports.push(o),oo(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,isModuleKnown:r.isModuleKnown,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(e=>[e[0],{...e[1],position:a.get(e[0])??ro}])),errors:o.errors,warnings:o.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},lo=(t,n)=>{let r=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return t.toSorted((e,t)=>ji(e.location,t.location)).forEach(t=>{let a=[],o=[];try{t.check(a,o)}catch(t){if(!(t instanceof e.I)||!t.sany&&a.length===0)throw t;a.push(...t.sany?.errors??[])}a.forEach(e=>i(r,e)),o.forEach(e=>i(n,e))}),r},uo=(t,n)=>{let r=ao(t,n.imported),i=new Map(t.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1,keyword:void 0}]]:[])),a=new Map([...ki,...n.bound].map(e=>[e[0],{...e[1],position:ro}])),o=/* @__PURE__ */ new Set,s=[],c=(e,t,o,s)=>({location:e,check:(c,l)=>s({imported:r,getInstance:n.getInstance,definitions:n.definitions,getKey:n.getKey,isModuleKnown:n.isModuleKnown,location:e,self:t,facts:n.facts,goals:i,bindings:a,errors:c,warnings:l,hasLabelScope:o,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})}),l=(e,t)=>e.map(e=>c(e.location,void 0,!1,n=>Vi(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return lo([...t.units.flatMap(t=>{let n=t.kind===`Variables`?{type:`A VARIABLE declaration`,location:t.location}:t.kind===`Constants`?{type:`A declaration`,location:t.location}:t.kind===`Module`?{type:`A MODULE `,location:t.module.location}:t.kind===`Theorem`?{type:`A THEOREM`,location:t.theorem.location}:t.kind===`Assumption`?{type:`An ASSUME`,location:t.assumption.location}:t.kind===`Use`?{type:`A USE or HIDE`,location:t.use.location}:void 0,r=n?.location.range;return!n||!r?[]:[{location:n.location,check:t=>{s.some(e=>e.binding?.isPending)&&t.push({location:e.X(r),message:`${n.type} may not appear within a recursive definition section.`})}}]}),...n.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(t.constants,`Constant`),...l(t.variables,`Variable`),...t.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>c(e.location,void 0,!1,t=>{let n={kind:`Definition`,arity:e.arity,params:Array(e.arity).fill(0),range:e.location.range,position:e.location,isPending:!0},r=zi(e.name,a.get(e.name),n,t);r&&(a.set(e.name,n),o.add(n)),s.push({declaration:e,binding:r?n:void 0})})),...t.definitions.map(e=>c(e.location,e,!0,n=>{io(t,e)?H(e.body,void 0,n):Da(e,void 0,n,o)&&a.set(e.name,{kind:`Definition`,arity:Mi(e),range:e.location.range,position:e.location})})),...t.instances.map(e=>c(e.location,void 0,!1,t=>{Ui(void 0,e.params,t),n.instanced.get(e)?.forEach((e,n)=>Vi(n,e,t)),e.name!==void 0&&Vi(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},t)})),...t.assumptions.map(e=>c(e.location,void 0,e.name!==void 0,t=>{H(e.expression,void 0,t),e.name!==void 0&&Vi(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t)})),...t.theorems.map(e=>c(e.location,void 0,e.name!==void 0,t=>no(e,t))),...t.uses.map(e=>c(e.location,void 0,!1,t=>Ja(e,void 0,t))),{location:t.location.range?.end??t.location,check:t=>s.forEach(n=>{let r=n.declaration.location.range;r&&(!n.binding||n.binding.isPending)&&t.push({location:e.X(r),message:`Symbol ${j(n.declaration.name)} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},fo={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:` `}},po=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},mo=e=>e!==void 0&&/^\p{Nd}$/u.test(e),ho=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),go=e=>{let t=t=>{let n=be(e,t,po);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l=t(i);for(;l!==void 0&&e[l]!==a;){let n=o(l);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l=t(i)}if(l!==void 0)return c.last=l,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=be(e,t,mo);if(e.startsWith(`..`,n)&&mo(e[n+2]))return{kind:`Constant`,first:t,last:be(e,n+2,mo)-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=mo(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:be(e,t+1,mo)-1,children:[]};if(ho(n))return{kind:`Constant`,first:t,last:be(e,t,ho)-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)},U=e=>{let t=e.length===0?void 0:go(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=fo[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},_o={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},vo={none:0,error:1,warning:3,state:4},yo={0:``,1:`Error: `,3:`Warning: `,4:`State `},bo=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${yo[n]}${r}`,xo=t=>{let n=/* @__PURE__ */ new Set;return{isTool:t.isTool,isDiffTrace:t.isDiffTrace??!1,version:t.version??`master`,print:(r,i,a)=>{let o=i===vo.warning;if(o&&t.errorCodes?.includes(r))throw new e.H(r,a);if(o&&t.isWarningEnabled===!1||i!==vo.error&&t.suppressedCodes?.includes(r))return;let s=o&&!t.isTool&&n.size===0?`
|
|
346
|
+
(Use the -nowarning option to disable this warning.)`:``,c=bo(t.isTool,r,i,`${a}${s}`);o&&n.has(c)||(o&&n.add(c),console.log(c))}}},So=`The configuration file did not specify the initial state predicate.
|
|
347
|
+
Can also be caused by trying to run TLC on a specification from
|
|
348
|
+
a module imported with a parameterized INSTANCE statement.`,Co=[[1005,e.u,!1],[1e3,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable%1% %2% undefined).`,!1],[1e3,`Could not find operator: %1% in module: %2%`,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
|
|
349
|
+
%1%`,!0],[2143,`The variable %1% was changed while it is specified as UNCHANGED at
|
|
350
|
+
%2%`,!1],[2144,`The EXCEPT was applied to non-existing fields of the value at
|
|
351
|
+
%1%`,!1],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
|
|
352
|
+
%1%,
|
|
353
|
+
but it produced the following error:
|
|
354
|
+
%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.
|
|
355
|
+
`,!1],[2155,`Attempted to compare %1% with the value
|
|
356
|
+
%2%`,!0],[2158,`Attempted to check if the value:
|
|
357
|
+
%1%
|
|
358
|
+
is an element of %2%.`,!0],[2157,`Attempted to apply TransitiveClosure to a set containing
|
|
359
|
+
the following value:
|
|
360
|
+
%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:
|
|
361
|
+
%4%`,!0],[2170,`Argument mismatch in operator application.%1%`,!1],[2171,`Parsing or semantic analysis failed.%1%`,!1],[2172,e.g,!1],[2176,`Applying %1% to the following value,
|
|
362
|
+
which is not %2%:
|
|
363
|
+
%3%`,!0],[2177,`Attempted to apply BagUnion to the following set, whose
|
|
364
|
+
element is not a bag:
|
|
365
|
+
%1%`,!0],[2178,`Overflow when computing %1%`,!1],[2179,`The second argument of \\div is 0.`,!0],[2180,`0^0 is undefined.`,!0],[2181,`Attempted to compute cardinality of the value
|
|
366
|
+
%1%`,!0],[2182,`Evaluating an expression of the form %1% when s is not a %2%:
|
|
367
|
+
%3%`,!0],[2183,`The %1% argument of %2% must be in the domain of its %3% argument:
|
|
368
|
+
%4%
|
|
369
|
+
, but instead it is
|
|
370
|
+
%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
|
|
371
|
+
on the right-hand side of a <- after already appearing on the
|
|
372
|
+
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
|
|
373
|
+
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,So,!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%,
|
|
374
|
+
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:
|
|
375
|
+
%1%`,!1],[2240,`The specification contains more than one conjunct of the form [][Next]_v,
|
|
376
|
+
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.
|
|
377
|
+
%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,
|
|
378
|
+
but instead found %3%.
|
|
379
|
+
%4%`,!1],[2248,`In computing %1%, TLC expected a %2% expression,
|
|
380
|
+
but didn't find one.
|
|
381
|
+
%3%`,!1],[2260,`In computing ENABLED, TLC encountered a temporal formula (%1%).
|
|
382
|
+
%2%`,!1],[2261,`TLC encountered a temporal formula (%1%) when evaluating a predicate or action.
|
|
383
|
+
%2%`,!1],[2265,`TLC can't handle a number this big.
|
|
384
|
+
%1%`,!1],[2266,`The %1% argument of %2% should be an %3%, but instead it is:
|
|
385
|
+
%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.
|
|
386
|
+
%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:
|
|
387
|
+
%3%`,!0],[5003,`TLC found an error in the configuration file at line %1%
|
|
388
|
+
The keyword %2% was not followed by an identifier.`,!1],[5004,`TLC found an error in the configuration file at line %1%
|
|
389
|
+
The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configuration file at line %1%
|
|
390
|
+
Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
|
|
391
|
+
It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
|
|
392
|
+
%1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
|
|
393
|
+
`,!1],[2250,`A state predicate was evaluated to a non-boolean value.`,!1],[2252,`Encountered an action predicate that's not a boolean.`,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]];let wo;const To=()=>wo??=Co.map(e=>({pattern:RegExp(`^${e[1].split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e[0],isEvalException:e[2]}})),Eo=/^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)\)\./,Do=e=>Eo.test(e)?void 0:To().find(t=>t.pattern.test(e))?.message,Oo=t=>t instanceof e.A||Do(t.message)?.isEvalException===!0,ko=/* @__PURE__ */ new Map([[1e3,`
|
|
394
|
+
: `],[2105,`failed.
|
|
395
|
+
`],[2154,`but it produced the following error:
|
|
396
|
+
`],[2171,`Parsing or semantic analysis failed.`],[2213,`:
|
|
397
|
+
`],[2281,` - specifically: `],[2405,`failed.
|
|
398
|
+
`]]),Ao=(e,t,n)=>{let r=n?ko.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)}${jo(t.slice(a),n)}`},jo=(e,t)=>{let n=t?Do(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${vo.none} @!@!@\n${Ao(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},Mo=(e,t=2)=>String(e).padStart(t,`0`),No=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 ${Mo(r%24)}h`:e>36e5?`${Mo(r%24)}h ${Mo(n)}min`:e>6e4?`${Mo(n)}min ${Mo(t)}s`:`${Mo(t)}s`},Po=e=>`${e.getFullYear()}-${Mo(e.getMonth()+1)}-${Mo(e.getDate())} ${Mo(e.getHours())}:${Mo(e.getMinutes())}:${Mo(e.getSeconds())}`,Fo=/* @__PURE__ */ new WeakMap,Io=(t,n,r)=>{if(!(t instanceof e.x))return t;let i=e.at(new e.x(`${r}\n${t.message}`,t),e.Q(t));return Fo.set(i,{code:n,headline:r,inner:t}),i},Lo=e=>Fo.has(e),Ro=e.$(`util.WrongInvocationException`),zo=e.K.slice(0,e.K.indexOf(`
|
|
399
|
+
`)),Bo=`${e.K}tlc2.tool.EvalException: `,Vo=`${e.K}util.Assert$TLCRuntimeException: `,Ho=e=>Oo(e)?Bo:Vo,Uo=t=>{try{return t()}catch(t){throw t instanceof e.x?Oo(t)?new e.x(`${e.G}${t.message}`):Do(t.message)?t:new e.x(`${e.K}${t.message}`):t}},Wo=[Bo,Vo,e.K,e.G],Go=(t,n)=>{let r=Fo.get(t);if(r)return`${r.headline}\n${Go(r.inner,n)}`;let i=t.message;if(t instanceof e.B)return i;let a=Wo.find(e=>i.startsWith(e))??``;return`${a}${jo(i.slice(a.length),n)}`},Ko=(t,n)=>{let r=Fo.get(t),i=t.message;if(r)return{code:r.code,message:i,toolMessage:Go(t,!0)};if(t instanceof e.F)return{code:n?_o.stackOverflow:_o.general,message:i,toolMessage:i};if(n&&Oo(t))return{code:Do(i)?.code??_o.general,message:i,toolMessage:i};let a=n&&!i.startsWith(zo)&&!(t instanceof e.B),o=t instanceof e.P?Ro:e.K,s=a?o:``;return{code:_o.general,message:`${s}${i}`,toolMessage:`${s}${Go(t,!0)}`}},qo=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,Jo=2147483647,Yo=1e6;let Xo=Yo;const Zo=()=>Xo,Qo=()=>Math.max(Xo,10),$o=()=>`Attempted to construct a set with too many elements (>${Xo}).`,es=(t,n)=>{if(t.length===Qo())throw new e.P($o());t.push(n)},ts=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=Qo(),ns=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},rs=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,is=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),as=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),os=e=>typeof e==`object`&&e.kind===`ModelValue`,ss=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),cs=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:rs(e)?`set`:`function`,ls=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let us=!1;const ds=(e,t)=>(us=!0,e.writtenKeys=t,e),fs=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,ps=e=>fs(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),ms=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):ps(e),hs=(e,t,n,r)=>ds(sl(e,t.map(e=>n[e])),r),gs=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(gs);e.writtenKeys=void 0,e.range.forEach(gs)}},_s=e=>{us&&typeof e==`object`&&e.kind===`Function`&&(e.writtenKeys=void 0)},vs=e=>e.every(e=>typeof e==`string`),ys=(e,t)=>e.length>0&&t.length>0&&vs(e)!==vs(t),bs=(e,t)=>{us&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return ys(n,r)?Ac(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Ks(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:Ks(t,n);if(r!==0)return r}return 0},xs=(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=Ks(n[e],r[e]);if(t!==0)return t}return 0},Ss=e=>os(e)?e.type:void 0,Cs=(t,n,r)=>{let i=Ss(t),a=Ss(n);if(i===void 0&&a===void 0)return;let o=r?`check equality of`:`compare`;if(os(t)&&os(n)){if(i===void 0||a===void 0||i===a)return;throw new e.x(`Attempted to ${o} the differently-typed model values ${U(q(t))} and ${U(q(n))}`)}throw i===void 0?new e.x(`Attempted to ${o} the typed model value ${U(q(n))} and the non-model value\n${U(q(t))}`):new e.x(`Attempted to ${o}${r?``:` the`} typed model value ${U(q(t))} and non-model value\n${U(q(n))}`)},ws=()=>({ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0}),Ts=ws(),Es=e=>{Object.assign(Ts,ws()),qs.clear();for(let t of e)Is(t)},Ds=()=>{Ts.searchRank=Ts.size},Os=()=>Ts.unorderedString;let ks=!1;const As={isExpanded:!0,isViewPrinted:!1},js=e=>{ks=e.version===`1.7.4`,Xo=e.maxSetSize??Yo,As.isExpanded=e.isLazyValueExpanded??!0,As.isViewPrinted=e.isViewPrinted??!1},Ms=/* @__PURE__ */ new WeakMap,Ns=(e,t)=>(As.isViewPrinted&&Ms.set(e,t),e),Ps=/* @__PURE__ */ new WeakMap,Fs=(e,t)=>(Ps.set(e,t),e),Is=e=>(Ts.ranks[e]===void 0&&(Ts.ranks[e]=Ts.size++),e),Ls=e=>Ts.ranks[Is(e)],Rs=(e,t)=>{if(e===t)return 0;let n=Ts.ranks,r=n[e],i=n[t],a=Ts.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(Ts.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},zs=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Bs=(e,t)=>(zs(e)||zs(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Vs=(t,n)=>new e.x(zs(t)?`Attempted to compare overridden value ${U(q(t,!0))} with non-overridden value:\n${U(q(n))}`:`Attempted to compare ${cs(t)} ${q(t)} with ${cs(n)} ${q(n)}`),Hs=(t,n,r)=>{if(!zs(t))throw new e.x(`Attempted to ${r} the set ${U(q(W(t)?G(t):t,!0))} with the value:\n${U(q(n,!0))}`);if(!zs(n))throw Vs(t,n);let i=t.kind===`InfiniteSet`?t.name:void 0,a=n.kind===`InfiniteSet`?n.name:void 0;if(i!==void 0&&i===a)return 0;if(i===`Nat`&&a===`Int`||i===`Int`&&a===`Nat`)return i===`Nat`?-1:1;throw new e.A(`Attempted to compare ${U(q(t,!0))} with the value\n${U(q(n,!0))}`)},Us={kind:`InfiniteSet`,name:`Any`},Ws=t=>{throw new e.A(`Attempted to compare ANY with the value\n${U(q(t))}`)},Gs=e=>{us&&gs(e),e===Us&&Ws(e),typeof e==`object`&&e.kind===`LazyFunction`&&K(e)},Ks=(e,t)=>{if(e===t)return Gs(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return bs(e,t);if(n===`Set`&&r===`Set`)return xs(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&&Cs(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return Cs(e,t,!1),n===`ModelValue`?-1:1;if(e===Us||t===Us)return Ws(e===Us?t:e);if(rs(e)&&rs(t)&&Bs(e,t))return Hs(e,t,`compare`);let i=rs(e);if(i!==rs(t))throw Vs(e,t);if(n===`Interval`&&r===`Set`){let n=jl(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-jl(t);if(n!==0)return n}return i?xs(G(e),G(t)):bs(K(e),K(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Rs(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(Cs(e,t,!1),os(e))return-1;if(os(t))return 1;throw Vs(e,t)},qs=/* @__PURE__ */ new Map,Js=32768,Ys=t=>{let n=qs.get(t);if(n)return n;if(qs.size===Js)throw new e.S(`TLC supports at most ${Js} model values, but model value ${t} exceeds this limit.`);let r={kind:`ModelValue`,name:t,type:t.length>2&&t[1]===`_`?t[0]:void 0,rank:Ls(t),hash:uu(du(fu(t),109)),fingerprint:xu(Su(t)^60)};return qs.set(t,r),r},Xs=()=>[...qs.values()],Zs=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),Qs=e=>{let t=Zs(e);return t.isNormalized=!0,t},$s=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let ec=!1;const tc=(e,t)=>(t===`lambda`&&(ec=!0),t!==void 0&&(e.functionClass=t),e),nc=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,rc=e=>tc(e,`lambda`),ic=e=>qo(e)&&e.isCached===!0;let ac=!1;const oc=e=>(ac=!0,e),sc=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),cc=e=>{ac&&typeof e==`object`&&qo(e)&&sc.has(e.kind)&&(e.isCached=!0)},lc=e=>{(ec||ac)&&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(lc),e.range.forEach(lc)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(lc):rs(e)&&W(e)&&(cc(e),G(e).elements.forEach(lc))))},uc=(e,t)=>{if(cc(e),e===t)return Gs(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Cs(e,t,!0),Ks(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return bs(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return xs(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&jl(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==jl(t))return!1;if(os(e)||os(t))return e.kind===`LazyFunction`&&K(e),Cs(e,t,!0),os(e)&&os(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return uc(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=Ol(e.domain),r=Ol(t.domain);if(n||r)return n===r;let i=Ol(e.range),a=Ol(t.range);return i||a?i===a:uc(e.domain,t.domain)&&uc(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(Ol(e))return Ol(t);if(Ol(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]&&uc(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return Ol(e)?Ol(t):!Ol(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>uc(e,t.factors[n]));let n=rs(e)&&rs(t)&&!(W(e)&&W(t));if(n&&Bs(e,t))return Hs(e,t,`check equality of`)===0;if(n){if(!zs(e)){let n=G(e);if(!zs(t))return xs(n,G(t))===0}return Du(e)===Du(t)}return Ks(e,t)===0},dc=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):Du(n)===Du(r);return n},fc=dc(!1),pc=dc(!0),mc=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},hc=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=bu(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||pc(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||pc(i[e],n))return i[e]}return n.kind===`Set`?mc(n.elements,t):(mc(n.domain,t),mc(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}},gc=(e,t)=>t.length===0||nc(e)===`tuple`?1:su(t)?.low,_c=e=>{if(!as(e))return;let t=K(e);return{domain:t.domain,range:t.range,low:gc(e,t.domain)}},vc=e=>{if(!as(e))return;let t=K(e);return vs(t.domain)?t:void 0},yc=(e,t,n)=>(Cs(t,e,n),1),bc={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`}},xc=(e,t,n)=>{let r=bc[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${U(q(e))} with ${r.other}:\n${U(q(t))}`},Sc=e=>e?`check equality of`:`compare`,Cc=(t,n,r,i)=>{let a=_c(r);if(!a){if(os(r))return yc(r,n,i);throw new e.x(`Attempted to ${Sc(i)} the function ${U(q(n))} with the value:\n${U(q(r))}`)}if(t.range.length!==a.range.length)return t.range.length-a.range.length;let o=()=>wc(t.range,a.range,i);if(t.low!==void 0&&t.range.length===0)return 0;if(t.low!==void 0&&a.low!==void 0)return t.low===a.low?o():t.low-a.low;let s=t.low??a.low;if(s===void 0)return wc(t.domain,a.domain,i)||o();let c=t.low===void 0?t.domain:a.domain;for(let n=0;n<c.length;n++){let r=c[n];if(typeof r!=`number`)throw new e.x(`Attempted to compare ${i?`an `:``}integer with non-integer${i||t.low!==void 0?`:`:``}\n${U(q(r))}.`);let a=t.low===void 0?r-(s+n):s+n-r;if(a!==0)return a}return o()},wc=(e,t,n)=>{for(let r=0;r<e.length;r++){let i=kc(e[r],t[r],n);if(i!==0)return i}return 0},Tc=(t,n,r)=>{let i=K(t);if(nc(t)===`tuple`){let e=as(n)?Il(n):void 0;return e?i.range.length-e.length||wc(i.range,e,r):Cc({...i,low:1},t,n,r)}if(nc(t)===`record`){let a=vc(n);if(!a){if(os(n))return yc(n,t,r);throw new e.x(`Attempted to ${Sc(r)} record:\n${U(q(t))}\nwith non-record\n${U(q(n))}`)}return i.domain.length-a.domain.length||wc(i.domain,a.domain,r)||wc(i.range,a.range,r)}return Cc({...i,low:gc(t,i.domain)},t,n,r)},Ec=(e,t)=>zs(e)||zs(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),Dc=(e,t)=>{let n=ss(t)?t:G(t);return{elements:G(e).elements,otherElements:G(n).elements}},Oc=(t,n,r)=>{if(Ec(t,n))return r?+!uc(t,n):Ks(t,n);if(!ss(t))return Oc(G(t),n,r);if(!rs(n)){if(os(n))return yc(n,t,r);throw new e.x(`Attempted to ${Sc(r)} the set ${U(q(t))} with the value:\n${U(q(n))}`)}let i=Dc(t,n);return i.elements.length-i.otherElements.length||wc(i.elements,i.otherElements,r)},kc=(t,n,r)=>{if(typeof t!=`object`){if(typeof n==typeof t)return r?t===n?0:1:Ks(t,n);if(os(n))return yc(n,t,r);throw new e.x(xc(t,n,r))}return t.kind===`ModelValue`?(t.type!==void 0&&Cs(t,n,r),os(n)?r?t.name===n.name?0:1:t.rank-n.rank:-1):as(t)?Tc(t,n,r):Oc(t,n,r)},Ac=(e,t)=>kc(e,t,!1),jc=(e,t)=>kc(e,t,!0)===0,Mc=e=>{let t=[];for(let n of e){let e=Pc(n,t);e.isFound||t.splice(e.index,0,n)}return t},Nc=(e,t)=>{let n=Rl.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Pc=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=Nc(e,()=>Ac(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},Fc=(e,t)=>t.some(t=>Nc(t,()=>jc(t,e))),Ic=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,Lc=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(Lc)),e.kind===`Function`&&(e.writtenKeys=void 0,e.domain.forEach(Lc),e.range.forEach(Lc)))},Rc=e=>{if(!(typeof e!=`object`||ic(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:G(e);return;case`FilteredSet`:case`Subset`:return Rc(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(Rc(e.left),Rc(e.right));case`FunctionSet`:return Rc(e.domain),Rc(e.range);case`RecordSet`:return e.sets.forEach(Rc);case`ProductSet`:return e.factors.forEach(Rc)}},zc=(e,t)=>zl(uc,jc,e,t),Bc=e=>{for(let t=1;t<e.length;t++)if(Ks(e[t-1],e[t])>=0)return!1;return!0},Vc=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},Hc=e=>{for(let t=1;t<e.length;t++)cc(e[t]);if(e.length<2||Bc(e))return Zs(e);let t=[...e].sort(Ks),n=[t[0]];for(let e=1;e<t.length;e++)Ks(n[n.length-1],t[e])!==0&&n.push(t[e]);return Zs(n)},Uc=e=>{if(Vc(e))return Zs(e);let t=zl(Hc,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},Wc=Zs([]),Gc=(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&&Ks(r[a],t)<0;)a++;a<r.length&&Ks(r[a],t)===0||i.push(t)}return i.length===n.length?e:Zs(i)},Kc=(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&&Ks(r[a],t)<0;)a++;a<r.length&&Ks(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Zs(i)},qc=(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=Ks(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=Zs(i);if(e.hash!==0&&e.hash!==hu){let t=e.hash,n=0;for(;n<a.length;n++){let e=bu(a[n]);if(e===hu)break;t=t+pu(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+Cu(a[e])|0;c.fingerprint=t}return c},Jc=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Ks(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Ks(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return $s(n,r)},Yc=e=>{let t=Jc(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:ds(t,e.map(e=>e[0]))},Xc=[],Zc=/* @__PURE__ */ new Map,Qc=[],$c=/* @__PURE__ */ new WeakMap,el=e=>{let t=Xc[e]??Zc.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?Zc.set(e,new WeakRef(n)):Xc[e]=n,n},tl=e=>{if(jl(e),e.low===1&&e.high>=1)return el(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},nl=e=>e.length>0&&(e===Xc[e.length]||e===Zc.get(e.length)?.deref())||$c.has(e),rl=e=>{let t=G(e).elements;return nl(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},il=e=>{let t=Qc[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Qc[e]=n,n},al=e=>tc($s(el(e.length),e),`tuple`),ol=e=>tc(Jc(e),`record`),sl=(e,t)=>tc($s(e,t),`record`),cl=e=>rs(e)&&!zs(e),ll=(e,t=!1)=>`UNION(${q(e.base,t)})`,ul=(t,n=e=>G(e).elements)=>{if(!cl(t.base))throw new e.x(`Attempted to enumerate the nonenumerable set:\n${ll(t)}`);return n(t.base)},dl=(t,n,r)=>{if(cl(t))return t;throw new e.x(n===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${U(q(t))}\nwhen enumerating:\n${U(ll(r))}`)},W=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 W(e.base);case`FunctionSet`:return W(e.domain)&&W(e.range)||fl(e.domain)===!0||fl(e)===!0;case`RecordSet`:return e.sets.every(W)||fl(e)===!0;case`ProductSet`:return e.factors.every(W)||fl(e)===!0;case`Union`:return W(e.base)&&(ss(e.base)?Ic(e.base):Cl(e.base)).every(W);case`SetOperation`:return e.operator===`\\cup`?W(e.left)&&W(e.right):e.operator===`\\cap`?W(e.left)||W(e.right):W(e.left);default:return!1}},fl=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=fl(e.domain);return t===void 0?void 0:!t&&fl(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=fl(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return W(e)?G(e).elements.length===0:void 0;default:return}},pl=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},ml=(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},hl=e=>{if(typeof e!=`object`||e.kind!==`Subset`||zs(e.base))return;let t=G(e.base).elements;if(t.length<=20)return;let n=-1,r=[0],i=e=>{for(e<=n&&(n=-1);n<e;)n===-1?r=[]:ml(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return Zs(r.map(e=>t[e]))},a=2**t.length,o=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<a;return new Proxy([],{get:(e,t,n)=>t===`length`?a:o(t)?i(Number(t)):Reflect.get(e,t,n),has:(e,t)=>o(t)||Reflect.has(e,t)})},gl=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Zs(r.map(t=>e[t])));while(ml(r,e.length))}return t},_l=(t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){let o=t[a];if(zs(o))throw new e.x(r(o,a));let s=n(o);if(s.length===0)return[[]];i.push(s)}return i},vl=(t,n=e=>G(e).elements)=>{if(typeof t!=`object`)throw new e.x(`Expected a set but found ${q(t)}`);switch(t.kind){case`Set`:return t.elements;case`MixedSet`:return Mc(t.elements);case`Interval`:{let e=tl(t);return e!==Xc[e.length]&&$c.set(e,t),e}case`Subset`:{if(jl(t.base)===0)return gl([]);if(!rs(t.base))throw new e.x(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${U(q(t.base))}`);let n=G(t.base).elements;if(n.length>30)throw new e.x(Al(t));return gl(n)}case`FunctionSet`:{if(!ks&&Ol(t))return[];if(zs(t.domain))throw new e.x(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${U(q(t.domain))}\ncannot be enumerated.`);let r=rl(t.domain);if((r.length>0||ks)&&zs(t.range))throw new e.x(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${U(q(t.range))}\ncannot be enumerated.`);let i=r.length===0?[]:n(t.range);return pl(r.map(()=>i)).map(e=>$s(r,e))}case`RecordSet`:{if(!ks&&Ol(t))return[];let e=_l(t.sets,n,(e,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${t.names[n]}' field:\n${U(q(e))}`);return pl(e).map(e=>ol(t.names.map((t,n)=>[t,e[n]])))}case`ProductSet`:{if(!ks&&Ol(t))return[];let e=_l(t.factors,n,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${U(q(e))}`);return pl(e).map(al)}case`FilteredSet`:if(!rs(t.base)||zs(t.base))throw new e.x(`Attempted to enumerate { x \\in S : p(x) } when S:\n${U(q(t.base))}\nis not enumerable`);return G(Uc(Cl(t.base).filter(t.startPass?.(!0)??(e=>t.test(e,!1))))).elements;case`Union`:{let n=[];return ul(t).forEach((r,i)=>{let a=dl(r,i,t);if(ts(a))throw new e.P($o());Cl(a).forEach(e=>es(n,e))}),G(Uc(n)).elements}case`SetOperation`:{if(t.operator===`\\cap`&&!cl(t.left)&&!cl(t.right))throw new e.x(`Attempted to enumerate S \\cap T when neither S:\n${U(q(t.left))}\nnor T:\n${U(q(t.right))}\nis enumerable`);if(t.operator===`\\`&&!cl(t.left))throw new e.x(`Attempted to enumerate S \\ T when S:\n${U(q(t.left))}\nis not enumerable.`);if(t.operator===`\\cup`)return G(Uc(bl(t))).elements;let n=t.operator===`\\`||cl(t.left),r=n?t.left:t.right,i=n?t.right:t.left,a=[];return ns(typeof r==`object`&&r.kind===`Interval`?r:Cl(r),e=>{Vl(e,i)===(t.operator===`\\cap`)&&es(a,e)}),G(Uc(a)).elements}case`InfiniteSet`:case`SequenceSet`:throw new e.x(`Attempted to enumerate the non-enumerable set ${q(t)}`);default:throw new e.x(`Expected a set but found ${q(t)}`)}},G=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Zs(vl(e));let t=typeof e==`object`&&qo(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=Rl.sets;n?.push(e);let r=vl(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`)?Zs(r):Hc(r);return t&&(t.enumerated=i),i},yl=e=>{if(!(typeof e!=`object`||ic(e)))switch(e.kind){case`MixedSet`:G(e);return;case`FilteredSet`:return cl(e.base)||G(e),yl(e.base);case`Union`:if(!ss(e.base)&&cl(e.base))return yl(e.base);ul(e).slice(0,1).forEach(t=>yl(dl(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!cl(e.left)&&G(e),e.operator!==`\\cup`||cl(e.left)&&cl(e.right)||G(e),e.operator!==`\\cap`||cl(e.left)?yl(e.left):yl(e.right),e.operator===`\\cup`&&yl(e.right)}},bl=t=>{if(!cl(t.left)||!cl(t.right))throw new e.x(`Attempted to enumerate S \\cup T when S:\n${U(q(t.left))}\nand T:\n${U(q(t.right))}\nare not both enumerable`);if(yl(t.left),yl(t.right),ts(t.left))throw new e.P($o());let n=Cl(t.left),r=ts(t.right)?void 0:Cl(t.right);if(!r||n.length+r.length>Qo())throw new e.P($o());return[...n,...r]},xl=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return G(e).elements;let t=Nc(e,()=>bl(e)),n=G(Uc(t)).elements;return e.enumerated=Zs(n),n},Sl=(e,t)=>{if(typeof e!=`object`||ic(e))return G(e).elements.some(t);let n=Rl.sets;n?.push(e),yl(e);let r=Dl(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},Cl=e=>{let t=[];return Sl(e,e=>(t.push(e),!1)),t},wl=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,Tl=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(Tl);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(Tl)&&e.range.every(Tl);case`SetOperation`:return e.operator!==`\\cup`&&Tl(e.left)&&Tl(e.right);case`FilteredSet`:return Tl(e.base);case`ProductSet`:return e.factors.every(Tl);default:return!1}},El=e=>typeof e!=`object`||ic(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?El(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||El(e.left)||El(e.right):wl(e)?.some(El)??!1,Dl=(e,t)=>{if(e.kind===`Union`)return ul(e,Cl).some((n,r)=>Sl(dl(n,r,e),t));if(e.kind===`FilteredSet`&&cl(e.base)){let n=e.startPass?.(!1);return n?Sl(e.base,e=>n(e)&&t(e)):Sl(e.base,n=>e.test(n,!1)&&t(n))}if(wl(e)?.some(El))return vl(e,Cl).some(t);if(e.kind!==`SetOperation`)return G(e).elements.some(t);if(e.operator===`\\cup`)return!cl(e.left)||!cl(e.right)?G(e).elements.some(t):Sl(e.left,t)||Sl(e.right,t);let n=e.operator===`\\`||cl(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return cl(r)?Sl(r,n=>Vl(n,i)===(e.operator===`\\cap`)&&t(n)):G(e).elements.some(t)},Ol=t=>{if(typeof t!=`object`||!rs(t))throw Rl.sets?.push(t),new e.x(`Shouldn't call isEmpty() on value ${q(t)}`);switch(t.kind){case`Set`:case`MixedSet`:return t.elements.length===0;case`Interval`:return t.low>t.high;case`InfiniteSet`:if(t.name===`Any`)throw new e.x(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return t.factors.some(Ol);case`RecordSet`:return t.sets.some(Ol);case`FunctionSet`:return!Ol(t.domain)&&Ol(t.range);case`Union`:return ul(t).every((e,n)=>Ol(dl(e,n,t)));default:return G(t).elements.length===0}},kl=(t,n,r)=>t.reduce((t,i)=>{let a=t*jl(i,n);if(a>2147483647)throw new e.x(r());return a},1),Al=e=>`Overflow when computing the number of elements in:\n${U(q(e))}`,jl=(t,n)=>{if(typeof t!=`object`)throw new e.x(`Attempted to compute the number of elements in the ${cs(t)} ${U(q(t))}.`);switch(t.kind){case`ModelValue`:throw new e.x(`Attempted to compute the number of elements in the model value ${U(q(t))}.`);case`Function`:return t.domain.length;case`LazyFunction`:return jl(t.domain,n);case`Interval`:{let n=Math.max(0,t.high-t.low+1);if(n>2147483647)throw new e.x(`Size of interval value exceeds the maximum representable size (32bits): ${t.low}..${t.high}.`);return n}case`InfiniteSet`:case`SequenceSet`:throw new e.x(`Attempted to compute the number of elements in the overridden value ${U(q(t))}.`);case`Subset`:{let r=jl(t.base,n);if(r>=31)throw new e.x(Al(t));return 2**r}case`FunctionSet`:{if(n!==`1.7.4`){if(Ol(t.domain))return 1;if(Ol(t.range))return 0;if(jl(t.range,n)===1)return 1}let r=jl(t.domain,n),i=jl(t.range,n);if(i<=1)return r===0?1:i;let a=1;for(let n=0;n<r;n++)if(a*=i,a>2147483647)throw new e.x(Al(t));return a}case`RecordSet`:return n!==`1.7.4`&&Ol(t)?0:kl(t.sets,n,()=>Al(t));case`ProductSet`:return n!==`1.7.4`&&Ol(t)?0:kl(t.factors,n,()=>`Overflow when computing the number of elements in ${U(q(t))}`);default:return cc(t),G(t).elements.length}},Ml=e=>`Attempted to check if the set ${U(q(e))}is finite.`,Nl=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)throw new e.x(`Attempted to check if the ${cs(t)} ${U(q(t))} is a finite set.`);switch(t.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new e.x(`Attempted to check if the function:\n${U(q(t))}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Nl(t.base)&&Ol(t.base);case`Subset`:return Nl(t.base);case`FunctionSet`:{let e=Nl(t.domain);if(e&&Ol(t.domain))return!0;let n=Nl(t.range);return n&&Ol(t.range)?!0:n&&(e||jl(t.range)===1)}case`RecordSet`:case`ProductSet`:{let e=t.kind===`RecordSet`?t.sets:t.factors,n=!0;for(let t of e)if(!Nl(t))n=!1;else if(Ol(t))return!0;return n}case`Union`:if(!cl(t.base))throw new e.x(`Attempted to check if the nonenumerable set:\n${ll(t)}\nis a finite set.`);return G(t.base).elements.every(Nl);case`SetOperation`:if(t.operator===`\\cup`)return Nl(t.left)&&Nl(t.right);if(t.operator===`\\cap`){if(!Nl(t.left)&&!Nl(t.right))throw new e.x(Ml(t));return!0}if(Nl(t.left))return!0;if(!Nl(t.right))throw new e.x(Ml(t));return!1;case`FilteredSet`:if(!Nl(t.base))throw new e.x(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${U(q(t.base))}\nis finite.`);return!0}},Pl=(e,t,n=Ks)=>{let r=0,i=e.length-1;for(;r<=i;){let a=r+i>>1,o=n(e[a],t);if(o===0)return a;o<0?r=a+1:i=a-1}return-1},Fl=(t,n)=>{let r=t.elements;if(r.length>Qo())throw new e.P($o());let i=Array.from({length:r.length},()=>!1),a=n.filter(e=>{let t=Pl(r,e);return!i[t]&&(i[t]=!0,!0)}),o=Zs(r);return a.some((e,t)=>e!==r[t])&&(o.writtenElements=a),o},Il=t=>{if(typeof t!=`object`||!as(t))return;if(t.kind===`LazyFunction`&&(!rs(t.domain)||zs(t.domain)))throw new e.x(`To convert a function of form [x \\in S |-> f(x)] to a tuple, the set S must be enumerable.`);let n=K(t);return n.domain.every((e,t)=>e===t+1)?n.range:void 0},Ll=(e,t)=>{let n=`Attempted to check if the value:\n${U(q(e))}\nis an element of the`;if(!as(t))return`${n} ${cs(t)} ${U(q(t))}`;let r=nc(t);return r===`record`?`Attempted to check if element:\n${U(q(e))}\nis in the record:\n${U(q(t))}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${U(q(t))}`},Rl={sets:void 0},zl=(t,n,r,i)=>{let a=Rl.sets,o=Rl.callStack,s=a?.length??0,c=o&&{...o,length:o.expressions.length};try{return t(r,i)}catch(t){if(!(t instanceof e.x))throw t;return a&&(a.length=s),o&&c&&(o.expressions.length=c.length,o.isFrozen=c.isFrozen,o.fingerprint=c.fingerprint),n(r,i,t)}},Bl=e=>(Rl.sets??[]).slice(e).some(e=>typeof e==`object`&&Rl.callStack?.sources.has(e)===!0),Vl=(e,t)=>{let n=Rl.sets;if(n===void 0)return Kl(e,t);n.push(t);let r=Kl(e,t);return n.pop(),r},Hl=(e,t)=>{let n=t.elements,r=0,i=n.length-1;for(;r<=i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;if(a===e)return!0;a<e?r=t+1:i=t-1}return!1},Ul=(e,t)=>Pl(t.elements,e)!==-1,Wl=(e,t)=>t.isNormalized?Pc(e,t.elements).isFound:Fc(e,Ic(t)),Gl=(t,n)=>{if(t.type!==void 0)throw new e.x(`Attempted to check if the typed model value ${U(q(t))} is an element of\n${U(q(n))}`);return!1},Kl=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return Hl(e,t)??ql(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return ql(e,t)},ql=(t,n)=>{if(!rs(n))throw new e.x(Ll(t,n));switch(n.kind){case`Set`:return cc(t),zl(Ul,Wl,t,n);case`MixedSet`:return Fc(t,n.elements);case`Interval`:if(typeof t==`number`)return t>=n.low&&t<=n.high;if(n.low<=n.high&&(!os(t)||t.type!==void 0))throw new e.x(`Attempted to check if the value:\n${U(q(t))}\nis in the integer interval ${U(q(n))}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(os(t))return Gl(t,n);if(!(n.name===`STRING`?typeof t==`string`:typeof t==`number`))throw new e.A(`Attempted to check if the value:\n${U(q(t))}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof t==`number`&&t>=0;case`Subset`:if(!rs(t)||zs(t))throw new e.x(`Attempted to check if the non-enumerable value\n${U(q(t))}\nis element of\n${U(q(n))}`);return G(t).elements.every(e=>Vl(e,n.base));case`FunctionSet`:{if(!as(t)){if(os(t))return Gl(t,n);throw new e.x(`Attempted to check if \n${q(t)}\nwhich is not a TLC function value, is in the set of functions:\n${U(q(n))}`)}_s(t);let r=K(t),i=gc(t,r.domain);return(i===void 0?zc(n.domain,Zs(r.domain)):zc({kind:`Interval`,low:i,high:i+r.domain.length-1},n.domain))&&r.range.every(e=>Vl(e,n.range))}case`RecordSet`:{_s(t);let r=as(t)?K(t):void 0;if(!r||!vs(r.domain)){if(os(t))return Gl(t,n);throw new e.x(`Attempted to check if non-record\n${q(t)}\nis in the set of records:\n${U(q(n))}`)}return r.domain.length===n.names.length&&n.names.every((e,t)=>{let i=Pl(r.domain,e);return i!==-1&&Vl(r.range[i],n.sets[t])})}case`ProductSet`:{let r=as(t)?Il(t):void 0;if(r===void 0){let r=as(t)&&K(t).domain.every(e=>typeof e==`number`);if(os(t))return Gl(t,n);if(r)return!1;throw new e.x(`Attempted to check if non-tuple\n${U(q(t))}\nis in the set of tuples:\n${U(q(n))}`)}return r.length===n.factors.length&&r.every((e,t)=>Vl(e,n.factors[t]))}case`FilteredSet`:try{return Vl(t,n.base)&&n.test(t,!0)}catch(r){throw!(r instanceof e.x)||!Oo(r)?r:new e.x(`Cannot decide if element:\n${U(q(t))}\n is element of:\n${U(q(n.base))}\nand satisfies the predicate ${n.source?.predicate}`)}case`Union`:{if(!cl(n.base))throw new e.x(`Attempted to check if:\n ${U(q(t))}\nis an element of the non-enumerable set:\n ${U(ll(n))}`);let r=G(n.base).elements;return r.length>1&&r.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),r.some(e=>Vl(t,e))}case`SetOperation`:return n.operator===`\\cup`?Vl(t,n.left)||Vl(t,n.right):Vl(t,n.left)&&Vl(t,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=Il(t);if(r===void 0){if(os(t))return Gl(t,n);throw new e.A(`Attempted to check if the value:\n${U(q(t))}\nis an element of ${U(q(n))}.`)}return r.every(e=>Vl(e,n.base))}default:throw new e.x(Ll(t,n))}},Jl=(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?Vl(e,n):e.range.every((e,r)=>Jl(e,t.range[r],n.range)),K=t=>{if(typeof t==`object`&&t.kind===`Function`)return t;if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return t.enumerated;if(W(t.domain)||jl(t.domain),!rs(t.domain))throw new e.x(`The domains of formal parameters must be enumerable.`);let n=rl(t.domain);return t.enumerated=$s(n,n.map(e=>t.apply(e))),t.enumerated}throw new e.x(`Expected a function but found ${q(t)}`)},Yl=(e,t,n)=>{let r=U(q(e)),i=U(q(t)),a=n===`1.7.4`;switch(nc(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.`}},Xl=(e,t)=>{if(!ks)return Yl(e,t);let n=U(q(t));return nc(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Zl=(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},Ql=t=>new e.x(`Attempted to apply function with integer domain to the non-integer argument ${U(q(t))}`),$l=(e,t)=>Pl(e.domain,t),eu=(e,t,n)=>{let r=fs(e);throw ks||r!==e.domain||r.length<32?r.forEach(e=>jc(e,t)):Pl(r,t,Ac),n},tu=(t,n,r)=>{let i=t.domain;if(typeof n!=typeof i[0]){let a=nc(t),o=a===`tuple`?`number`:a===`record`?`string`:void 0;if(o!==void 0&&typeof n!==o)throw new e.x(r(t,n));if(o===void 0&&!ks&&typeof n!=`number`&&nl(i))throw Ql(n)}let a=Zl(i,n);return a===-1?zl($l,eu,t,n):a},nu=(e,t,n,r)=>`In applying the function\n${U(q(e))},\nthe ${t} is:\n${U(q(n))}\nwhich ${r}.\n`,ru=(t,n)=>new e.x(nu(t,`argument list`,n,`does not match its formal parameter`)),iu=(t,n,r)=>{let i=t.domain,a=Il(r);if(a===void 0)throw ru(t,r);if(typeof i!=`object`||i.kind!==`ProductSet`)throw new e.x(`Attempted to apply a function to ${q(r)}, which is not in its domain`);if(n.forEach((n,o)=>{if(o>=a.length)throw ru(t,r);let s=a[o],c=`argument number ${o+1}`;if(!Vl(s,i.factors[o]))throw new e.x(nu(t,c,s,n===void 0?`is not in the function's domain ${q(i)}`:`is not in its domain`));if(n!==void 0&&Il(s)?.length!==n)throw new e.x(nu(t,c,s,`does not match its formal parameter`))}),a.length>n.length)throw ru(t,r)},au=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!Vl(t,e.lambdaDomain),ou=(t,n,r)=>{if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return ou(t.enumerated,n,r);let i=t.boundTupleLengths;if(i!==void 0)return iu(t,i,n),t.apply(n);if(!Vl(n,t.domain))throw new e.x(nc(t)===`lambda`?Yl(t,n):`Attempted to apply a function to ${q(n)}, which is not in its domain`);return t.apply(n)}if(typeof t!=`object`||t.kind!==`Function`)throw new e.x(`Attempted to apply ${q(t)}, which is not a function`);let i=r??Yl;if(au(t,n))throw new e.x(i(t,n));let a=tu(t,n,i);if(a===-1)throw new e.x(i(t,n));return t.range[a]},su=e=>nl(e)?$c.get(e)??il(e.length):void 0,cu=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=K(e);if(t.functionClass===`lambda`&&t.lambdaDomain)return t.lambdaDomain;let n=su(t.domain);if(n)return n;let r=Zs(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},lu=(t,n,r,i=!1)=>{if(typeof t==`object`&&t.kind===`LazyFunction`&&(i||t.enumerated===void 0)){if(t.boundTupleLengths!==void 0&&Il(n)===void 0)throw ru(t,n);if(!Vl(n,t.domain))return t;let e=r(t.apply(n));return tc({kind:`LazyFunction`,domain:t.domain,apply:r=>zc(n,r)?e:t.apply(r),source:t.source,boundTupleLengths:t.boundTupleLengths},nc(t))}if(!as(t))throw new e.x(`Attempted to apply EXCEPT construct to the value ${U(q(t))}.`);let a=K(t);if(au(a,n))return a;let o=tu(a,n,Xl);if(o===-1)return a;let s=[...a.range],c=a.range[o],l=r(c);s[o]=l;let u=tc($s(a.domain,s),nc(a));if(u.writtenKeys=a.writtenKeys,u.lambdaDomain=a.lambdaDomain,a.hash!==0&&a.hash!==hu){let e=bu(l);if(e!==hu){let t=bu(a.domain[o]);u.hash=c===l?a.hash:a.hash-mu(t,bu(c))+mu(t,e)|0}}if(a.fingerprint!==0){let e=a.domain[o];u.fingerprint=c===l?a.fingerprint:a.fingerprint-wu(e,c)+wu(e,l)|0}return u},uu=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},du=(e,t)=>Math.imul(e^t,16777619),fu=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return uu(t)},pu=e=>uu(e+2654435769|0),mu=(e,t)=>uu(Math.imul(e,668265261)+t|0),hu=795548749,gu=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=bu(t[e]);if(r===hu)return hu;n=n+pu(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=bu(e.domain[n]),i=bu(e.range[n]);if(r===hu||i===hu)return hu;t=t+mu(r,i)|0}return t},_u=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)return;if(t.kind===`InfiniteSet`||t.kind===`SequenceSet`)throw new e.x(`TLC has found a state in which the value of a variable contains ${U(q(t))}`);if(rs(t)){G(t).elements.forEach(_u);return}let n=K(t);n.domain.forEach(_u),n.range.forEach(_u)},vu=t=>{if(typeof t==`object`&&t.kind!==`ModelValue`)try{bu(t)===hu&&_u(t);return}catch(t){if(!(t instanceof e.x))throw t;return t}},yu=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[]}},bu=e=>typeof e==`number`?uu(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?fu(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=gu(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?W(e.domain)?bu(K(e)):hu:W(e)?bu(G(e)):hu,xu=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Su=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return xu(t)},Cu=e=>xu(Eu(e)+2135587861|0),wu=(e,t)=>xu(Math.imul(Eu(e),374761393)+Eu(t)|0),Tu=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Cu(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+wu(e.domain[n],e.range[n])|0;return t},Eu=e=>typeof e==`number`?xu(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?Su(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Tu(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?Eu(K(e)):W(e)?Eu(G(e)):Su(Du(e)),Du=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):Ou(e),Ou=t=>{if(t.kind===`ModelValue`)return`@${t.name}`;if(t.kind===`InfiniteSet`)return`<${t.name}>`;if(t.kind===`SequenceSet`)return`<Seq ${Du(t.base)}>`;if(t.kind===`FilteredSet`&&!W(t))throw new e.x(`Attempted to compare the non-enumerable set ${q(t)} with another value`);if(rs(t))return W(t)?`{${G(t).elements.map(Du).join(`,`)}}`:`<${t.kind} ${q(t)}>`;let n=K(t);return`(${n.domain.map((e,t)=>`${Du(e)}:${Du(n.range[t])}`).join(`,`)})`},ku={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},Au=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>ku[e])}"`,ju=1999,Mu=e=>e.reduce((e,t)=>e===0?0:e*jl(t),1),Nu=e=>{if(e.kind===`Subset`)return jl(e.base)<=6?G(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return G(e);if(e.kind===`FunctionSet`){let t=Ol(e.domain)?0:jl(e.domain);return(t===0?1:jl(e.range)**t)<=ju?G(e):void 0}return Mu(e.kind===`RecordSet`?e.sets:e.factors)<=ju?G(e):void 0},Pu=(t,n)=>{if(n||t.kind===`Union`||t.kind===`Subset`&&as(t.base)&&(t.base.kind===`Function`||W(t.base.domain)))return Nu(t);if(W(t))try{return Nu(t)}catch(t){if(t instanceof e.x)return;throw t}},Fu=(e,t)=>{let n=e=>q(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 ll(e,t)}},Iu=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Lu=t=>{if(W(t.domain))try{return K(t)}catch(t){if(t instanceof e.x||e.tt(t))return;throw t}},Ru=e=>{let t=[],n=[],r=[],i=(e,a,o)=>{if(typeof e!=`object`)return;let s=e=>i(e,a,!1);switch(e.kind){case`Set`:if(e.elements.forEach(s),e.isNormalized)return;e.isNormalized=!0,t.push(e);return;case`MixedSet`:e.elements.forEach(s),G(e);return;case`Function`:{let t=a||nc(e)===`lambda`;if(e.range.forEach(e=>i(e,t,o)),a||e.writtenKeys===void 0)return;n.push([e,e.writtenKeys]),e.writtenKeys=void 0;return}case`LazyFunction`:if(e.enumerated)return i(e.enumerated,!0,o);o&&r.push(e),s(e.domain);return;case`SetOperation`:s(e.left),s(e.right);return;case`FunctionSet`:s(e.domain),s(e.range);return;case`RecordSet`:e.sets.forEach(s);return;case`ProductSet`:e.factors.forEach(s);return;case`Subset`:case`Union`:case`FilteredSet`:case`SequenceSet`:s(e.base);return;default:return}};try{return e.forEach(e=>i(e,!1,!0)),e.map(e=>q(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1}),r.forEach(e=>{e.enumerated=void 0}),n.forEach(e=>{e[0].writtenKeys=e[1]})}},q=(e,t=!1,n=!1)=>{let r=e=>q(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Au(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(G(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=As.isExpanded?Pu(e,t):void 0;return n?r(n):Fu(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?As.isExpanded||!e.source?Lu(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 ${q(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&ks&&nc(e)!==`tuple`)return`<< >>`;let a=r=>q(r,t,n&&nc(e)!==`lambda`);if(i.domain.length===0&&nc(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]]):ms(i);return nc(e)===`record`||i.domain.every(e=>typeof e==`string`&&Iu(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},zu=(t,n)=>{if(t===void 0)return!1;try{return uc(t,n)}catch(t){if(t instanceof e.x)return!1;throw t}},Bu=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,Vu=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(Bu,(e,a,o=``,s,c,l=``)=>{let u=e=>o.includes(`-`)?e.padEnd(Number(s)):e.padStart(Number(s??0)),d=o.includes(`<`),f=o.replace(`<`,``);if(l===`n`&&e===`%n`)return`
|
|
400
|
+
`;if(l===`%`&&c===void 0&&/^-?$/.test(f))return f===`-`&&s===void 0&&(i=!1),u(`%`);let p=d?r:a===void 0?n++:Number(a.slice(0,-1))-1;r=p;let m=t[p];if(!`sSbBhH`.includes(l)||l===``||!/^-?$/.test(f)||f===`-`&&s===void 0||m===void 0)return i=!1,e;let h=l.toLowerCase(),g=h===`s`?m:h===`b`?`true`:(Gr(m)>>>0).toString(16),_=u(c===void 0?g:g.slice(0,Number(c.slice(1))));return l===h?_:_.toUpperCase()});return i?a:void 0},Hu=(t,n)=>{let r=n?void 0:Ms.get(t);if(r)return r();let i=Object.entries(t),a=Ps.get(t),o=a!==void 0&&`_format`in t,s=o?t._format:i.length===1?`%s = %s
|
|
401
|
+
`:`/\\ %s = %s
|
|
402
|
+
`;if(typeof s!=`string`)throw new e._(`The _format field of the ALIAS ${a} is ${q(s)}, but it must be a string.`);return i.filter(e=>!(o&&e[0]===`_format`)).filter(e=>!n||!zu(n[e[0]],e[1])).map(t=>{let n=Vu(s,[t[0],U(q(t[1]))]);if(n===void 0)throw new e._(`The _format field of the ALIAS ${a} is ${q(s)}, but it must format two strings, the name and the value of a field.`);return n}).join(``)},Uu=[10454148508367108822n,15747411856486957441n,13848313129918172575n,15427004735118145554n,14338780731064426356n,15931650522396165332n,17670238537108149059n,12816660938095048951n,13192168525635896882n,16119298732711755075n,13564417994159519395n,15831473429641889162n,17671735485712653535n,14582471876431321160n,9288673424107444897n,12345523232675890545n,13774063780198914517n,10636128657019767374n,13227535641082688945n,10085966873248490402n,17056045221983369811n,18027133543548002442n,13033986364717636900n,12663388180492401538n,11007194744055901935n,16251515628090973732n,18046429724439772544n,9876734796024595817n,14949643787442512870n,16960057143726945461n,10590203213448744021n,12248592797044284137n,9558805810925624286n,16993321702164258530n,11754329512098378960n,12074934892440206921n,15696745233288286746n,10531590977001201739n,18107999685377398317n,12149369488538049728n,12923655455904407421n,10507099144397364930n,17322088528956367024n,14653973644796244054n,15165509594857513400n,13554280709034297251n,16228911470502883382n,17115369786458865383n,11179220607102683830n,16708422618246866334n,12295941796329322556n,18336630348474106240n,13989616001589685348n,14822072159597151759n,14264172520427195041n,11642530518213145397n,11877331515501935358n,13913116192159715440n,17054474839259161580n,13461230878584418056n,16058025410470398786n,11100471369705097435n,11133782763824505275n,13192312712502684421n,17456091706045076157n,13237272598629075916n,12914531898895761383n,15801841604014567326n,16446055517513626294n,16780923767715884464n,15104658705803254918n,10882049990920163451n,12728112724252049190n,11720209067562733740n,16476221075563830086n,16602801460297162326n,16206898064012585915n,12158475401238648099n,13742285336487677729n,15543703592025073839n,9615783578189153721n,16710542608962839044n,11960730242263336692n,13328718558362718101n,12971616006464047952n,17057853503483465676n,16180230282101315295n,15483523553568578902n,17773465781871025571n,18047252642493037509n,11580640560664688668n,10121963531818974651n,14218267149826330657n,12715294421139777506n,10584764766358778171n,12666843443693621286n,17403948736867619210n,17907955559063099692n,15179434392748515198n,15413469521140985247n,13455040338347572751n,15419348191054617477n,12340568220039846914n,13236419189535069162n,18074463254581147189n,10818750974828329405n,9859349269386152082n,15035006154709018396n,13627907273947709876n,9549035931546940138n,16199589727945564820n,10285831968679942330n,17737018494601061698n,15477896647372134857n,13595764249822586512n,10556855812148546550n,12421897615105552821n,15477767459253848096n,17421607461439241175n,12409061346569762725n,13621778224251023638n,10680972825126675886n,16494492050207190715n,16801324317763555620n,12664650400804916358n,16134230614391269483n,10027806175083075147n,9259037851175017999n,11803214621941906429n,9537357587847606069n,10517495000576890277n];let Wu=Uu[0];const Gu=()=>Wu,Ku=/* @__PURE__ */ new Int32Array(256),qu=/* @__PURE__ */ new Int32Array(256),Ju=/* @__PURE__ */ new Int32Array(256),Yu=/* @__PURE__ */ new Int32Array(256),Xu=/* @__PURE__ */ new Int32Array(256),Zu=/* @__PURE__ */ new Int32Array(256),Qu=/* @__PURE__ */ new Int32Array(256),$u=/* @__PURE__ */ new Int32Array(256);let ed=0,td=0,nd=0,rd=0;const id=e=>{let t=(e^rd)&255;rd=(rd>>>8|nd<<24)^Xu[t],nd=nd>>>8^Ku[t]},ad=e=>{let t=Uu[e];Wu=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);Ku[e]=Number(BigInt.asIntN(32,t>>32n)),Xu[e]=Number(BigInt.asIntN(32,t))}let i=[Ku,qu,Ju,Yu],a=[Xu,Zu,Qu,$u];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)^Xu[o],i[e][r]=t[r]>>>8^Ku[o]}}ed=Number(BigInt.asIntN(32,t>>32n)),td=Number(BigInt.asIntN(32,t))};ad(0);const od=e=>{let t=rd^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;rd=nd^$u[n]^Qu[r]^Zu[i]^Xu[a],nd=Yu[n]^Ju[r]^qu[i]^Ku[a]},sd=e=>{if(typeof e==`boolean`)return id(0),id(e?116:102),2;if(typeof e==`number`)return id(1),od(e),5;if(typeof e==`string`){id(3),od(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)od(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++)id(e.charCodeAt(n));return 5+e.length}return id(21),od(Ls(e.name)+1),5},cd=e=>{let t=nd,n=rd;nd=0,rd=0;let r=[sd(e),nd,rd];return nd=t,rd=n,r},ld=e=>`m = (${e} ^ l) & 255; l = ((l >>> 8) | (h << 24)) ^ L0[m]; h = (h >>> 8) ^ H0[m];`,ud=e=>`m = l ^ ${e}; l = h ^ L3[m & 255] ^ L2[(m >>> 8) & 255] ^ L1[(m >>> 16) & 255] ^ L0[m >>> 24]; h = H3[m & 255] ^ H2[(m >>> 8) & 255] ^ H1[(m >>> 16) & 255] ^ H0[m >>> 24];`,dd={integer:e=>`${ld(`1`)} ${ud(e)}`,boolean:e=>`${ld(`0`)} ${ld(`(${e} ? 116 : 102)`)}`,set:e=>`${ld(`5`)} ${ud(e)}`,function:e=>`${ld(`9`)} ${ud(e)}`,scalar:(e,t,n)=>`{ let r = ${e}; for (; r >= 4; r -= 4) { ${ud(`0`)} } for (; r > 0; r--) { ${ld(`0`)} } h ^= ${t}; l ^= ${n}; }`},fd=()=>({H0:Ku,H1:qu,H2:Ju,H3:Yu,L0:Xu,L1:Zu,L2:Qu,L3:$u,initialHigh:ed,initialLow:td}),pd=(e,t)=>{let n=nd,r=rd;rd=e[0],nd=e[1],gd(t),e[0]=rd,e[1]=nd,nd=n,rd=r},md=e=>{id(5),od(e)},hd=e=>{id(9),od(e)},gd=e=>{if(typeof e!=`object`||os(e))sd(e);else if(as(e)){let t=K(e);hd(t.domain.length);for(let e=0;e<t.domain.length;e++)gd(t.domain[e]),gd(t.range[e])}else{let t=G(e).elements;md(t.length);for(let e of t)gd(e)}},_d=e=>{let t=nd,n=rd;nd=ed,rd=td;for(let t of e)gd(t);let r=BigInt(nd>>>0)<<32n|BigInt(rd>>>0);return nd=t,rd=n,r},vd=(e,t)=>{let n=new BigInt64Array(e),r=new Int32Array(n.buffer),i=nd,a=rd;for(let n=0;n<e;n++)nd=ed,rd=td,t(n),r[2*n]=rd,r[2*n+1]=nd;return nd=i,rd=a,n},yd=(e,t)=>vd(e.length,n=>{for(let r of t)gd(e[n][r])}),bd=/* @__PURE__ */ new WeakMap,xd=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),Sd=1024,Cd=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*Sd),relations:[]}),wd=(e,t)=>({...e,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,coverage:t}),Td=(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},Ed=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,Dd=e=>e.location.range??(e.kind===`Let`?e.body.location.range:void 0),Od=(e,t,n,r,i)=>{let a=t===`next`?Ed(e,t,r):void 0;if(a!==void 0)return a;let o=Td(e,void 0,Dd(r),-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},kd=(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,Ad=(t,n,r)=>{let i=t===void 0?void 0:r.definitions.get(t),a=i?.kind===`Operator`?i.head:void 0,o=Dd(n);return!i||!a?`Action ${o?e.X(o):`Unknown location`}`:kd(Dd(i.body),o)||!o?`${i.name} ${e.X(a)}`:`${i.name} ${e.X(a)} (${o.start.line} ${o.start.column} ${o.end.line} ${o.end.column})`},jd=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,Md=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,Nd=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},Pd=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[(Gr(t.name)&2147483647)%e.length].unshift(t));t=e}t[(Gr(e.name)&2147483647)%t.length].unshift(e)}),t.toReversed().flat()},Fd=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),Id=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),Ld=(e,t)=>{let n=e.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;return n},Rd=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),zd=(e,t,n)=>{let r=new Set(n.map(jd)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(A(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&&!xd.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=Td(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(jd(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`?Rd(t.bounds):t.params.map(e=>e.name);if(t.kind===`Function`){let r=e.scope!==void 0;l(Ve(t,r),t.location.range,()=>{m(t.body,Id(n,e.scope)),Fd(t.bounds).forEach(t=>m(t,e.scope))})}else m(t.body,Id(n,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,Id(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`:case`Lambda`:m(e.body,Id(e.params,t));return;case`Selection`:n===void 0?m(e.expression,t):l(e,n,()=>m(e.expression,t));return;case`Let`:{let n=Ld(e.definitions,t);e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),Pd(e.definitions).forEach(e=>{e.name!==`$subexpression`&&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,Md(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,Nd(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,Md(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,Id(Rd(e.bounds),t)),r(Fd(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,Id(Rd(e.bounds),t)),r(Fd(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,Id(Rd([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,Id(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,Id(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]))}},h=e=>{let t=[];for(let n=e;n;n=n.parent){let e=bd.get(n);e&&t.unshift(e)}return Ld(t,void 0)};e.relations.forEach(e=>{i.push(e.node),m(e.expression,h(e.scope)),i.pop()})},Bd=(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=Bd(e,r,n);if(t!==-1)return t}}return-1},Vd=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=Bd(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:Bd(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},Hd=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},Ud=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},Wd=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},Gd=(e,t,n,r,i)=>{let a=is(n)?n:t!==`\\`&&is(r)?r:void 0;if(a===void 0||typeof i!=`object`)return i;let o=a===n?r:n;if(t===`\\cup`){if(Ol(a)||!is(o))return i;let t=e.values.get(o);t!==void 0&&(e.secondary[t]+=jl(o)+1)}let s=t===`\\cup`?void 0:e.values.get(a);if(e.values.get(i)===s)return i;let c=i===n||i===r||e.values.has(i)?{...i}:i;return s!==void 0&&e.values.set(c,s),c},Kd=(e,t,n)=>{let r=0;return{next:()=>(t!==void 0&&e.secondary[t]++,r++<n),reset:()=>{r=0}}},qd=(e,t,n)=>{if(n.some(e=>Ol(e)))return{next:()=>!1,reset:()=>void 0};let r=n.map(t=>Yd(e,t,jl(t),!1)),i=()=>{for(let e=r.length-1;e>0;e--){if(r[e].next())return!0;r[e].reset(),r[e].next()}return r.length>0&&r[0].next()},a=!r.every(e=>e.next());return{next:()=>!a&&(e.secondary[t]+=Math.max(r.length,1),a=!i(),!0),reset:()=>{r.forEach(e=>{e.reset(),e.next()}),a=!1}}},Jd=(e,t)=>{let n=typeof t==`object`?e.values.get(t):void 0;if(n!==void 0&&typeof t==`object`){if(t.kind===`RecordSet`)return qd(e,n,t.sets);if(t.kind===`FunctionSet`)return qd(e,n,Array.from({length:jl(t.domain)},()=>t.range))}},Yd=(e,t,n,r)=>{let i=typeof t==`object`?e.values.get(t):void 0;if(typeof t==`object`&&(t.kind===`Subset`||!r&&t.kind===`FilteredSet`))return Kd(e,void 0,n);let a=Jd(e,t);if(!a||i===void 0)return Kd(e,i,n);if(!r)return a;let o=0;for(;a.next();)o++;return e.secondary[i]+=o,Kd(e,i,o)},Xd=(e,t,n)=>{let r=typeof t==`object`&&t.kind===`Subset`?e.values.get(t):void 0;r!==void 0&&typeof n==`object`&&e.values.set(n,r)},Zd=/* @__PURE__ */ new Set([`Set`,`MixedSet`,`Interval`,`FunctionSet`,`RecordSet`,`ProductSet`]),Qd=(e,t,n,r)=>{if(typeof t!=`object`||Zd.has(t.kind))return;if(t.kind!==`Subset`){let r=Yd(e,t,n,!1);for(let e=0;e<=n;e++)r.next();return}let i=e.values.get(t);i!==void 0&&(e.secondary[i]+=n);for(let n=0;n<r.length;n++)Xd(e,t,r[n])},$d=(e,t,n,r)=>{let i=Array.isArray(n)?n.length:n.high-n.low+1;return typeof t!=`object`||t.kind!==`Subset`||!Array.isArray(n)?Yd(e,t,i,r):(n.forEach(n=>Xd(e,t,n)),Kd(e,void 0,i))},ef=e=>(e.every(e=>e.next()),()=>{for(let t=0;t<e.length;t++){if(e[t].next()||t===e.length-1)return;e[t].reset(),e[t].next()}}),tf=(e,t,n)=>ef(t.map((t,r)=>$d(e,t,n[r],!0))),nf=(e,t,n)=>{let r=n.map(e=>jl(e)),i=ef(n.map((t,n)=>Yd(e,t,r[n],!1))),a=r.reduce((e,t)=>e*t,1);for(let e=0;e<a;e++)i();e.secondary[t]+=a},rf=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},af=(e,t)=>t.forEach((t,n)=>{let r=_d([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*Sd+i;e.registers[o]=Math.max(e.registers[o],rf(a)+1)}),of=(e,t)=>{let n=e.registers.subarray(t*Sd,(t+1)*Sd),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*Sd*Sd/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*Sd?a===0?i:Sd*Math.log(Sd/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},sf=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},cf=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>sf(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},lf=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},uf=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],df=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},ff=(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}},pf=(t,n)=>{let r=[],i=/* @__PURE__ */ new Map,a=e=>{let n=[],r={primary:t.primary[e],secondary:t.secondary[e]};return(r.primary>0||r.secondary>0||uf(t,e))&&lf(n,r),df(t,e).forEach(e=>a(e).forEach(e=>lf(n,e))),i.set(e,n),n},o=(n,i,a,o)=>{let s=t.ranges[n];r.push({location:s?e.X(s):`Unknown location`,depth:i,count:a,cost:o})},s=(e,n)=>o(e,n,t.primary[e],t.secondary[e]),c=(e,n)=>{let r=df(t,e),l=[];r.forEach(e=>(i.get(e)??a(e)).forEach(e=>lf(l,e)));let u={primary:t.primary[e],secondary:t.secondary[e]},d=uf(t,e),f=e=>r.forEach(t=>c(t,e));if(t.isUnchanged[e]){let t=l.filter(e=>e.primary!==0||e.secondary!==0);t.length===0?s(e,n):o(e,n,Math.max(u.primary,cf(t).primary),0);return}if(l.length===0){(u.primary!==0||d)&&s(e,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let t=l[0],r=t.primary===0&&t.secondary===0;if(t.primary<u.primary){s(e,n),f(n+1);return}if(!d&&p&&!r){o(e,n,t.primary,t.secondary);return}if(p&&r){d&&s(e,n),f(d?n+1:n);return}if(u.primary===t.primary&&u.secondary===t.secondary){s(e,n);return}}let m=!p||d;m&&s(e,n),f(m?n+1:n)};return df(t,n).forEach(e=>{a(e),c(e,0)}),r},mf=[`init`,`next`,`invariant`,`constraint`,`implied`],hf=(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,gf=e=>mf.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>hf(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||hf(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),_f=(t,n,r,i)=>({variables:i.map(i=>{let a=r[i]?.range;return{label:`${n.variables[i]} ${a?e.X(a):`Unknown location`}`,distinct:of(t,i)}}),relations:gf(t).map(e=>({kind:e.kind,label:e.label,...ff(t,e),expressions:pf(t,e.node)}))}),vf=(e,t,n)=>{let r=Ed(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]]]},yf=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),bf=(t,n)=>yf.has(t)?new e.x(n):new e.A(n),xf=(t,n,r,i)=>new e.A(`The ${t} argument of ${n} should be a ${r}, but instead it is:\n${U(q(i))}`),Sf=(t,n,r=t)=>{if(!rs(t)||zs(t))throw new e.A(`Applying ${n} to the following value,\nwhich is not a finite set:\n${U(q(r))}`);return G(t)},Cf=e=>typeof e==`object`&&e.kind===`Operator`,J=(e,t,n)=>{let r=e[t];if(r===void 0||Cf(r))throw bf(n,`${n} expects a value as argument ${t+1}`);return r},wf=(e,t,n)=>{let r=J(e,t,n);if(typeof r!=`boolean`)throw bf(n,`${n} expects a boolean but received ${q(r)}`);return r},Tf=(e,t,n)=>{let r=e[t];if(r===void 0||!Cf(r))throw bf(n,`${n} expects an operator as argument ${t+1}`);return r},Ef=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),Y=(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}),Df=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Of=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),kf=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(J(n,0,e),J(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Af=e=>e>2147483647||e<-2147483648,jf=t=>new e.A(`Overflow when computing ${t}`),Mf={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`},Nf={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Pf={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`},Ff={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},If=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Nf[e.operator];if(e.kind!==`Function`)return Mf[e.kind];let t=nc(e);return t===void 0?`FcnRcdValue`:Ff[t]},Lf=e=>Pf[If(e)],Rf=(t,n)=>new e.x(`Attempted to apply the operator overridden by the Java method\n${t},\nbut it produced the following error:\n${n}`),zf=(t,n)=>{let r=r=>(...i)=>{let a=Rl.sets?.length??0;try{return r(...i)}catch(r){if(!(r instanceof e.x)||r instanceof e.y)throw r;let i=Bl(a);throw Rl.sets&&(Rl.sets.length=a),t.isLazy!==!0&&r instanceof e.A&&!i?r:Rf(n,r.message)}},i=r(t.evaluate);return{...t,evaluate:(e,r)=>{if(e.length!==t.arity)throw Rf(n,`array is not of length ${t.arity}`);return i(e,r)},evaluateUnary:t.evaluateUnary&&r(t.evaluateUnary),evaluateBinary:t.evaluateBinary&&r(t.evaluateBinary)}},Bf=(e,t)=>{if(typeof e!=`number`)throw Rf(t,`Cannot cast tlc2.value.impl.${If(e)} to tlc2.value.impl.IntValue`);return e},Vf=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Hf=(e,t,n,r)=>{let i=Vf(e,n,`IntValue`,2);return kf(t,(e,n)=>{let a=Bf(n,i),o=Bf(e,i),s=r(o,a);if(Af(s))throw jf(`${o}${t}${a}`);return s})},Uf=(t,n,r)=>{if(typeof t!=`number`)throw new e.A(`The ${n} argument of ${r} should be an integer, but instead it is:\n${U(q(t))}`);return t},Wf=(e,t,n=e)=>kf(e,(e,r)=>t(Uf(e,`first`,n),Uf(r,`second`,n))),Gf=(e,t,n)=>({...Of(e,t,n),isLazy:!0}),Kf=(e,t,n)=>{let r=Tf(e,t,n);return()=>r.call([])},qf=/* @__PURE__ */ new WeakSet,Jf=/* @__PURE__ */ new WeakMap,Yf=(e,t)=>{if(t.length===0)return e;let n={...e};return qf.has(e)&&qf.add(n),Jf.set(n,[...t,...Jf.get(e)??[]]),n},Xf=(e,t,n=/* @__PURE__ */ new Set)=>{let r=np(e,(e,r)=>Xf(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&A(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&A(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Zf=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Qf=/* @__PURE__ */ new WeakMap,$f=e=>Qf.get(e)??e.name,ep=(e,t)=>($f(t)!==e.name&&Qf.set(e,$f(t)),e),tp=(e,t)=>ep(e.kind===`Function`?{...e,bounds:Zf(e.bounds,e=>t(e,[])),body:t(e.body,Gi(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),np=(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=>tp(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Zf(e.bounds,n),body:t(e.body,Gi(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,Wi(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,Wi(e.bound.pattern))};case`SetMap`:return{...e,bounds:Zf(e.bounds,n),expression:t(e.expression,Gi(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=>({...e,path:e.path.map(e=>e.kind===`Index`?{...e,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`Selection`:return{...e,expression:n(e.expression)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},rp=[],ip=(e,t)=>{for(let n=0;n<e.length;n++)t(e[n],rp)},ap=(e,t)=>{for(let n=0;n<e.length;n++)t(e[n].set,rp)},op=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return;case`Apply`:case`Bracket`:return ip(e.args,t);case`Lambda`:return t(e.body,e.params);case`And`:case`Or`:return ip(e.operands,t);case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`Selection`:return t(e.expression,rp);case`If`:return t(e.condition,rp),t(e.consequent,rp),t(e.alternative,rp);case`Case`:for(let n=0;n<e.arms.length;n++)t(e.arms[n].condition,rp),t(e.arms[n].body,rp);e.other&&t(e.other,rp);return;case`Let`:{let n=e.definitions.map(e=>e.name);return e.definitions.forEach(e=>{e.kind===`Function`?(ap(e.bounds,e=>t(e,n)),t(e.body,[...n,...Gi(e.bounds)])):t(e.body,[...n,...e.params.map(e=>e.name)])}),t(e.body,n)}case`Forall`:case`Exists`:case`FunctionConstruction`:return ap(e.bounds,t),t(e.body,Gi(e.bounds));case`UnboundedQuantifier`:return t(e.body,e.names);case`Choose`:return e.set&&t(e.set,rp),t(e.body,Wi(e.pattern));case`SetEnumeration`:case`Tuple`:return ip(e.elements,t);case`SetFilter`:return t(e.bound.set,rp),t(e.predicate,Wi(e.bound.pattern));case`SetMap`:return ap(e.bounds,t),t(e.expression,Gi(e.bounds));case`FunctionSet`:return t(e.domain,rp),t(e.range,rp);case`Record`:case`RecordSet`:for(let n=0;n<e.fields.length;n++)t(e.fields[n].value,rp);return;case`Except`:t(e.function,rp);for(let n=0;n<e.updates.length;n++){let r=e.updates[n];for(let e=0;e<r.path.length;e++){let n=r.path[e];n.kind===`Index`&&ip(n.args,t)}t(r.value,rp)}return;case`FunctionApplication`:return t(e.function,rp),ip(e.args,t);case`FieldAccess`:return t(e.record,rp);case`Product`:return ip(e.factors,t);case`BoxAction`:case`AngleAction`:return t(e.action,rp),t(e.subscript,rp);case`WeakFairness`:case`StrongFairness`:return t(e.subscript,rp),t(e.action,rp);case`Label`:return t(e.body,rp);case`Subexpression`:e.selectors.forEach(e=>{`args`in e&&ip(e.args,t)})}},sp=`LAMBDA`,cp=e=>`${e}@SUBSTITUTION`,lp=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(lp),up=(e,t)=>{if(e.kind!==`Identifier`)return!lp(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=A(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!lp(n.body)},dp=(e,t=/* @__PURE__ */ new Set)=>{let n=We(e),r=n===void 0||t.has(n)?[]:[n];return op(e,(e,n)=>r.push(...dp(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},fp=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}},pp=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),mp=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},hp=(e,t)=>e.map(e=>({pattern:mp(e.pattern,t),set:e.set})),gp=(e,t)=>e.kind===`Function`?{...e,bounds:hp(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},_p=(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=>ep({...gp(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:hp(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:mp(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:mp(e.bound.pattern,n),set:e.bound.set}};default:return e}},vp=e=>`${e}@ENABLED`,yp=(e,t)=>e.modes.get(t)??e,bp=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!A(e)&&t.instantiation.variables.has(e.name),xp=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>xp(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(bp(e,t,n))return[e.name];let r=A(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?xp(r.body,t,/* @__PURE__ */ new Map):void 0},Sp=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return bp(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:vp(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Op(e.expression,yp(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Op(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Op(e.subscript,yp(t,`Primed`),n),location:r},Op(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=xp(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:vp(r),location:e.location},location:e.location},Op({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Cp=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:pi}),wp=(e,t)=>e.map(e=>Cp(e.name,t)),Tp=(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:wp(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),Ep=(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:[...wp(t,r),...i.map(e=>Cp(e,r))],location:r},location:r}},Dp=(e,t)=>e.instantiation.isParameterized(t)?Ap(e,t):void 0,Op=(t,n,r)=>{let i=e=>Op(e,n,r);if(t.kind===`Selection`&&[...r].every(e=>e[0]===e[1])){let e=t.expression,r=n.selections.get(e)??i(e);return n.selections.set(e,r),{...t,expression:r}}let a=n.instantiation,o=a.params,s=e=>!r.has(e)&&!A(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:Op(t.expression,yp(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:Op(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},yp(n,`Enabled`),r)};let c=Sp(t,n,r);if(c)return c;if(t.kind===`Identifier`&&s(t.name)){let e=a.substitutions.get(t.name),r=n.bindings;if(e&&(r===void 0||!up(e,a)))return Yf(e,[t]);if(e&&r){let n=cp(t.name);return r.set(n,e),Cp(n,t.location)}let i=Dp(n,t.name);if(i===void 0)return t;if(o.length===0)return{...t,name:i};let s=a.getDefinition(t.name);return s&&Mi(s)>0?Ep(i,o,Mi(s),t.location):{kind:`Apply`,operator:i,args:wp(o,t.location),location:t.location}}if(t.kind===`Apply`&&s(t.operator)){let r=t.args.map(i),s=a.substitutions.get(t.operator),c=a.substitutions.size>0||o.length>0||qf.has(t),l=e=>(c&&qf.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let e=s.kind===`Identifier`?s.name:s.operator;return l({...t,operator:e,args:r,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...t,operator:s.operator,args:[...s.args,...r],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:sp,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:sp,args:r,resolution:pi},location:t.location};if(s)throw new e.I(`The operator ${t.operator} can only be substituted by an operator at line ${t.location.line}, column ${t.location.column}`);let u=Dp(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[...wp(o,t.location),...r]}}if(t.kind===`OperatorReference`&&s(t.operator)){let e=a.substitutions.get(t.operator);if(e?.kind===`Identifier`||e?.kind===`OperatorReference`||e?.kind===`Lambda`)return Yf(e,[t]);let r=Dp(n,t.operator);if(r===void 0)return t;let i=a.getDefinition(t.operator);return o.length>0&&i?Ep(r,o,Mi(i),t.location):{...t,operator:r}}let l=fp(n),u=np(t,(e,t)=>t.length===0?i(e):Op(e,n,pp(r,t,l)));return _p(u,r,l)},kp=(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:Cp(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Ap=(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=fp(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o,selections:/* @__PURE__ */ new Map}:e,c=gp(tp(i,(e,t)=>Op(e,s,pp(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(e=>({kind:`Operator`,name:e[0],params:[],body:e[1],isLocal:!0,isRecursive:!1,location:e[1].location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&Jf.set(l,[u,...Jf.get(i.body)??[]]),kp({...c,body:l},r.params,i.location)}):t},jp=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>dp(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t,selections:/* @__PURE__ */ new Map};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>Dp(i,e)??e,getQualifiedKey:t=>{let n=Dp(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>kp(r,e.params,r.location)):t}}},Mp=e=>e.kind===`Let`&&e.instances!==void 0||Ue(e).some(Mp),Np=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=np(e,e=>Np(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Ai(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}},Pp=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Fp=(e,t)=>e.definitions.some(e=>Mp(e.body))||e.assumptions.some(e=>Mp(e.expression))||e.theorems.some(e=>{let t=Pp(e);return t!==void 0&&Mp(t)})?{...e,definitions:e.definitions.map(e=>tp(e,e=>Np(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Np(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Pp(e);return n===void 0?e:{...e,statement:Np(n,t,[])}})}:e,Ip=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]],[`_Track`,0,[0,0],[3,2],[0,0]],[`_Counts`,0,[],[],[]],[`_CheckName`,0,[0],[2],[1]],[`_PrintCounts`,0,[],[],[]]].map(e=>[e[0],{name:e[0],level:e[1],isCorrect:!0,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}])),Lp={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]}},Rp=(e,t)=>{let n=Lp[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},zp={Constant:0,Variable:1,State:1,Action:2,Temporal:3},Bp=(e,t)=>`${e}${t}`,Vp=(e,t,n)=>`${e}${t}${n}`,Hp=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Up=(e,t,n)=>`${e},${t},${n}`,Wp=(e=0)=>({level:e,isCorrect:!0,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Gp=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Kp=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),qp=(e,t)=>{t.constraints.forEach((t,n)=>Gp(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>Kp(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},X=(e,t,n,r)=>({...Wp(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Jp=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Yp=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Xp=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=>[e[0],{...X(e[0],e[1],[...e[2]],[...e[3]]),nonLeibniz:new Set(e[1]>1?[0,1]:[])}])),Zp=X(`'`,2,[1],[0]),Qp=X(`UNCHANGED`,2,[1],[0]),$p=X(`ENABLED`,1,[2],[0]),em=X(`[]`,3,[3],[0]),tm=X(`<>`,3,[3],[0]),nm=X(`$ConjList`,0,[3],[1]),rm=X(`$DisjList`,0,[3],[1]),im=X(`$IfThenElse`,0,[3],[1]),am=X(`$Case`,0,[3],[1]),om=X(`$BoundedForall`,0,[3],[1]),sm=X(`$BoundedExists`,0,[3],[1]),cm=X(`$UnboundedForall`,0,[3],[1]),lm=X(`$UnboundedExists`,0,[3],[1]),um=X(`$TemporalForall`,3,[3],[0]),dm=X(`$TemporalExists`,3,[3],[0]),fm=X(`$BoundedChoose`,0,[2],[1]),pm=X(`$UnboundedChoose`,0,[2],[1]),mm=X(`$SetEnumerate`,0,[2],[1]),hm=X(`$Tuple`,0,[2],[1]),gm=X(`$SetOfFcns`,0,[2],[1]),_m=X(`$CartesianProd`,0,[2],[1]),vm=X(`$SubsetOf`,0,[2],[1]),ym=X(`$SetOfAll`,0,[2],[1]),bm=X(`$FcnConstructor`,0,[3],[1]),xm=X(`$RcdConstructor`,0,[3],[1]),Sm=X(`$SetOfRcds`,0,[2],[1]),Cm=X(`$Except`,0,[2],[1]),wm=X(`$Pair`,0,[3],[1]),Tm=X(`$Seq`,0,[2],[1]),Em=X(`$FcnApply`,0,[2,2],[1,1]),Dm=X(`$RcdSelect`,0,[2,0],[1,1]),Om=X(`$SquareAct`,2,[2,1],[0,0]),km=X(`$AngleAct`,2,[2,1],[0,0]),Am=X(`$WF`,3,[1,2],[0,0]),jm=X(`$SF`,3,[1,2],[0,0]),Mm=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity,level:0}])]),Nm=e=>e.map(e=>({name:e,arity:0})),Pm=e=>e.kind===`Operator`?e.params:[],Fm=e=>e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,Im=(e,t)=>{let n=new Map(t);return e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n})),n},Lm=(e,t,n)=>{let r=Pm(e);return{...Wp(),name:e.name,formals:r,maxLevels:r.map(()=>t),weights:r.map(()=>n),minMaxLevels:r.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}},Rm=(e,t,n=!0)=>{let r=[],i=[],a=[],o=[],s=0,c=0,l=()=>{let t=a.length;for(;t>0&&o[t-1]===void 0;)t--;let n=o[t-1]??e;for(let e=t;e<a.length;e++){let t=a[e];n=Array.isArray(t)?Mm(n,Nm(t)):t.kind===`Let`?Im(t,n):t.kind===`Function`?Mm(n,Nm(Gi(t.bounds))):Mm(n,t.params),o[e]=n}return n},u=(e,t)=>{a.push(e),o.push(void 0),f(t),a.pop(),o.pop()},d=(e,t)=>t.length===0?f(e):u(t,e),f=e=>{if(e.kind!==`Let`)return op(e,d);if(a.push(e),o.push(void 0),c++,e.recursive)h(zm(e));else for(let t=0;t<e.definitions.length;t++)p(e.definitions[t]);c--,f(e.body),a.pop(),o.pop()},p=e=>{if(e.kind===`Function`)for(let t=0;t<e.bounds.length;t++)f(e.bounds[t].set);if(u(e,e.body),s===0)return;let t=i[c]??=/* @__PURE__ */ new Set;e.isRecursive&&t.delete(e.name)?s--:r.at(-1)?.members.push({definition:e,scope:l(),isRechecked:t.size>0})},m=(e,t)=>{s===0&&r.push({location:t,members:[]});let n=i[c]??=/* @__PURE__ */ new Set;e.forEach(e=>{n.has(e.name)||(n.add(e.name),s++)}),e.forEach(e=>r.at(-1)?.members.push({definition:e,scope:l(),isRechecked:!0}))},h=e=>{let t=/* @__PURE__ */ new Map;e.forEach(e=>{if(e.kind!==`Definition`||!e.definition.isRecursive)return;let n=t.get(e.definition.name);n?n.push(e.definition):t.set(e.definition.name,[e.definition])}),e.forEach(e=>{e.kind===`Recursive`?m(e.declarations.flatMap(e=>t.get(e.name)??[]),e.location):(s!==0||n)&&(e.kind===`Assumption`?f(e.assumption.expression):e.kind===`Theorem`&&e.theorem.statement.kind!==`AssumeProve`?f(e.theorem.statement):e.kind===`Definition`&&p(e.definition))})};return Array.isArray(t)?h(t):f(t),r},zm=e=>[...(e.recursive??[]).map(e=>({location:e.location,unit:{kind:`Recursive`,declarations:[e],location:e.location}})),...e.definitions.map(e=>({location:e.location,unit:{kind:`Definition`,definition:e}}))].toSorted((e,t)=>Ai(e.location,t.location)?-1:1).map(e=>e.unit),Bm=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Vm=e=>e.includes(2)&&e.includes(3),Hm=e=>Ir.get(e)??e.location.range,Um=e=>e.kind!==`Let`&&e.kind!==`Label`,Wm=t=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=[],a=[],o=(e,n)=>{let r=n.get(e);if(r?.kind===`Formal`)return{kind:`Declared`,name:e,level:r.level,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:S(r.definition,r.scope)};if(t.constants.has(e))return{kind:`Declared`,name:e,level:0,arity:0};if(t.variables.has(e))return{kind:`Declared`,name:e,level:1,arity:0};let i=t.getDefinition(e);if(i){let n=S(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Xp.get(e)??Ip.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},s=(e,t,n)=>{let r=Wp(Math.max(t,...n.map(e=>e.data.level)));return r.isCorrect=n.every(e=>e.data.isCorrect),r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(Vp(e,n,t))}),Kp(r.argConstraints,Bp(e,n),t.data.level),qp(r,t.data)}),r},c=(e,t,n=[],r=[])=>{let i=e=>r.includes(e),o=t.flatMap((t,n)=>t.kind===`Value`&&t.data.level>Jp(e,n)?[{operand:t,index:n}]:[]);o.filter(t=>e.isCorrect&&t.operand.data.isCorrect).forEach(t=>a.push(`Level error in applying operator ${j(e.name)}:\nThe level of argument ${t.index+1} exceeds the maximum level allowed by the operator`));let s=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},c=(t,n,r)=>e.conditions.has(Up(t,n,r)),l=Wp(Math.max(e.level,...t.filter((t,n)=>Yp(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return l.isCorrect=o.length===0&&t.every(e=>e.data.isCorrect)&&n.every(e=>e.isCorrect),e.params.forEach(e=>l.params.add(e)),t.forEach((t,n)=>{Yp(e,n)===1&&t.data.params.forEach(e=>l.params.add(e))}),n.forEach(e=>e.params.forEach(e=>l.params.add(e))),r.forEach(e=>l.params.delete(e)),e.constraints.forEach((e,t)=>Gp(l.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Gp(l.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Gp(l.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Gp(l.constraints,t,Jp(e,n))})),t.forEach((e,n)=>{if(e.kind!==`Operator`)return;let r=e.data;t.forEach((e,t)=>r.formals.forEach((i,a)=>{c(n,t,a)&&e.data.params.forEach(e=>Gp(l.constraints,e,Jp(r,a)))}))}),e.argParams.forEach(e=>{let t=Hp(e),n=s(t.operator);n?.kind===`Operator`&&Gp(l.constraints,t.param,Jp(n.data,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Kp(l.argConstraints,t,e))),t.forEach((n,r)=>{if(n.kind!==`Declared`)return;let i=n.declared;Array.from({length:i.arity},(t,n)=>Kp(l.argConstraints,Bp(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{c(r,t,a)&&Kp(l.argConstraints,Bp(i.name,a),e.data.level)}))}),e.argParams.forEach(e=>{let t=Hp(e),n=s(t.operator);n&&Kp(l.argConstraints,Bp(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Hp(e).param)||l.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>l.argParams.add(e))),e.argParams.forEach(e=>{let t=Hp(e),n=s(t.operator);if(n)n.kind===`Declared`&&l.argParams.add(Vp(n.declared.name,t.index,t.param));else{let n=s(t.param);if(!n){l.argParams.add(e);return}n.data.params.forEach(e=>l.argParams.add(Vp(t.operator,t.index,e)))}}),t.forEach((e,n)=>{if(e.kind!==`Declared`)return;let r=e.declared;t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{c(n,t,a)&&e.data.params.forEach(e=>l.argParams.add(Vp(r.name,a,e)))}))}),l},l=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:x(`LAMBDA`,Nm(e.params),e.body,t)};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let r=o(n,t);if(r.kind===`Defined`&&(r.levels.formals.length>0||e.kind===`OperatorReference`))return{kind:`Operator`,data:r.levels};if(r.kind===`Declared`&&r.arity>0){let e=Wp();return e.params.add(n),{kind:`Declared`,data:e,declared:{name:n,arity:r.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:Wp()}}return{kind:`Value`,data:ee(e,t)}},u=(e,t)=>e.map(e=>l(e,t)),d=(t,n,r,i=[],o=Gi(i))=>{let s=u(n,Mm(r,Nm(o))),l=i.map(e=>ee(e.set,r)),d=c(t,s,l,o);return l.forEach((n,r)=>{if(n.level<=2||(d.isCorrect=!1,!n.isCorrect))return;let o=i[r].pattern,s=o.ranges?.[0];a.push(`Level error in applying operator ${t.name}:\nThe level of the range for the bounded variable ${s?e.X(s):Wi(o)[0]} \nexceeds the maximum level allowed by the operator`)}),d},f=(e,t)=>e.kind===`Declared`?s(e.name,e.level,t):c(e.levels,t),p=(e,t)=>{Vm(e)&&a.push(`${t} has both temporal formula and action as arguments`)},m=(e,t)=>{(e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2)&&a.push(`Action used where only temporal formula or state predicate allowed`),Bm.has(e.operator)&&p(t.map(e=>e.data.level),j(e.operator))},h=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;t===2&&Um(n)&&n.kind!==r&&a.push(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`)},g=(e,t)=>{let n=Im(e,t);e.recursive&&Rm(t,e).forEach(e=>re(e.members));let r=e.definitions.map(e=>S(e,n)),i=ee(e.body,n),a={level:i.level,isCorrect:i.isCorrect&&r.every(e=>e.isCorrect),params:new Set(i.params),constraints:new Map(i.constraints),argConstraints:new Map(i.argConstraints),argParams:new Set(i.argParams)};return r.forEach(e=>qp(a,e)),a},_=(t,n,r)=>a.length===t?r:(n&&a.splice(t).forEach(t=>i.push({location:e.X(n),message:`${t}.`})),{...r,isCorrect:!1}),v=(e,t)=>{let n=a.length;return _(n,e,t())},ee=(e,t)=>{let n=a.length;return _(n,e.location.range,y(e,t))},y=(t,n)=>{switch(t.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Wp();case`Identifier`:return f(o(t.name,n),[]);case`Apply`:{let e=u(t.args,n);return m(t,e),f(o(t.operator,n),e)}case`OperatorReference`:case`Lambda`:return l(t,n).data;case`And`:case`Or`:{let r=t.kind===`And`;if(t.isBulleted){let e=u(t.operands,n);return p(e.map(e=>e.data.level),`${r?`Conjunction`:`Disjunction`} list`),c(r?nm:rm,e)}let a=r?`\\land`:`\\lor`,o=Hm(t.operands[0]),s=[],d=0,f=!1;t.operands.forEach((r,c)=>{let u=l(r,n);s.push(u);let m=[d,u.data.level];if(d=Math.max(d,u.data.level),c===0)return;let h=Hm(r);c===t.operands.length-1||!o||!h?p(m,a):Vm(m)&&(i.push({location:e.X({...o,end:h.end}),message:`${a} has both temporal formula and action as arguments.`}),f=!0)});let m=c(r?nm:rm,s);return f?{...m,isCorrect:!1}:m}case`Prime`:return d(Zp,[t.expression],n);case`Unchanged`:return d(Qp,[t.expression],n);case`Enabled`:return d($p,[t.expression],n);case`Always`:case`Eventually`:{let e=l(t.expression,n);return h(t,e.data.level),c(t.kind===`Always`?em:tm,[e])}case`If`:return d(im,[t.condition,t.consequent,t.alternative],n);case`Case`:return d(am,[...t.arms.flatMap(e=>[e.condition,e.body]),...t.other?[t.other]:[]],n);case`Let`:return g(t,n);case`Forall`:case`Exists`:{let r=d(t.kind===`Forall`?om:sm,[t.body],n,t.bounds),a=r.level===3?t.bounds.find(e=>ee(e.set,n).level===2):void 0,o=a?.set.location.range;return o&&i.push({location:e.X(o),message:`Action-level bound of quantified temporal formula.`}),a?{...r,isCorrect:!1}:r}case`UnboundedQuantifier`:return d(t.isTemporal?t.quantifier===`Forall`?um:dm:t.quantifier===`Forall`?cm:lm,[t.body],n,[],t.names);case`Choose`:return d(t.set?fm:pm,[t.body],n,t.set?[{pattern:t.pattern,set:t.set}]:[],Wi(t.pattern));case`SetEnumeration`:return d(mm,t.elements,n);case`Tuple`:return d(hm,t.elements,n);case`FunctionSet`:return d(gm,[t.domain,t.range],n);case`Product`:return d(_m,t.factors,n);case`SetFilter`:return d(vm,[t.predicate],n,[t.bound]);case`SetMap`:return d(ym,[t.expression],n,t.bounds);case`FunctionConstruction`:return d(bm,[t.body],n,t.bounds);case`Record`:return d(xm,t.fields.map(e=>e.value),n);case`RecordSet`:return d(Sm,t.fields.map(e=>e.value),n);case`Except`:return c(Cm,[l(t.function,n),...t.updates.map(e=>({kind:`Value`,data:c(wm,[{kind:`Value`,data:v(e.range,()=>c(Tm,e.path.map(e=>e.kind===`Field`?{kind:`Value`,data:Wp()}:e.args.length===1?l(e.args[0],n):{kind:`Value`,data:v(e.tupleRange,()=>d(hm,e.args,n))})))},l(e.value,n)])}))]);case`FunctionApplication`:return c(Em,[l(t.function,n),t.args.length===1?l(t.args[0],n):{kind:`Value`,data:d(hm,t.args,n)}]);case`Bracket`:return Wp();case`FieldAccess`:return c(Dm,[l(t.record,n),{kind:`Value`,data:Wp()}]);case`BoxAction`:case`AngleAction`:return d(t.kind===`BoxAction`?Om:km,[t.action,t.subscript],n);case`WeakFairness`:case`StrongFairness`:return d(t.kind===`WeakFairness`?Am:jm,[t.subscript,t.action],n);case`Label`:return ee(t.body,n);case`Selection`:{let e=t.expression,i=r.get(e);if(i)return i;let a=ee(e,n);return r.set(e,a),a}case`Subexpression`:return Wp()}},b=(e,t,n=!1,r=/* @__PURE__ */ new Set)=>{let i=(e,i=n,a=t)=>b(e,a,i,r),a=(e,a)=>{let s=o(e,t);s.kind===`Declared`?(n&&r.add(e),a.forEach(e=>i(e))):a.forEach((e,t)=>i(e,n||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return a(e.name,[]),r;case`Apply`:return a(e.operator,e.args),r;case`Lambda`:case`Let`:case`Selection`:return r;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return Ue(e).forEach(e=>i(e,!0)),r;case`UnboundedQuantifier`:return i(e.body,n||e.isTemporal===!0,Mm(t,Nm(e.names))),r;default:return op(e,(e,r)=>i(e,n,Mm(t,Nm(r)))),r}},x=(e,t,n,r)=>{let i=Mm(r,t),a=ee(n,i),o=e=>t.some(t=>t.name===e),s=b(n.kind===`Selection`?n.expression:n,i),c={...Wp(a.level),isCorrect:a.isCorrect,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(Bp(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(Vp(e.name,n,t.name))).map(e=>Up(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(Hp(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Hp(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},te=/* @__PURE__ */ new Set,S=(e,t)=>{let r=n.get(e);if(r&&!te.delete(e))return r;let i=r??Lm(e,3,0);n.set(e,i);let a=x(e.name,Pm(e),Fm(e),t),o={...a,level:Math.max(i.level,a.level),params:/* @__PURE__ */ new Set([...i.params,...a.params]),argParams:/* @__PURE__ */ new Set([...i.argParams,...a.argParams]),maxLevels:a.maxLevels.map((e,t)=>Math.min(e,i.maxLevels[t])),weights:a.weights.map((e,t)=>Math.max(e,i.weights[t])),nonLeibniz:/* @__PURE__ */ new Set([...i.nonLeibniz,...a.nonLeibniz])};return n.set(e,o),o},ne=t=>t.forEach(t=>{let n=t.definition.location.range;t.definition.isRecursive&&n&&S(t.definition,t.scope).maxLevels.forEach((r,a)=>{r>=2||i.push({location:e.X(n),message:`Argument ${a+1} of recursive operator ${j(t.definition.name)} is primed`})})}),re=e=>{if(e.length===0||n.has(e[0].definition))return;let t=e.filter(e=>e.definition.isRecursive);t.forEach(e=>n.set(e.definition,Lm(e.definition,2,1)));let r=e=>(e.definition.isRecursive&&te.add(e.definition),S(e.definition,e.scope));e.forEach(e=>{r(e),ne([e])});let i=t.map(e=>S(e.definition,e.scope)),a=Math.max(0,...i.map(e=>e.level)),o=i.flatMap(e=>[...e.params]);e.forEach(e=>{let t=S(e.definition,e.scope);n.set(e.definition,{...t,level:Math.max(t.level,a),params:/* @__PURE__ */ new Set([...t.params,...o])}),e.isRechecked&&!e.definition.isRecursive&&te.add(e.definition)}),e.forEach(r)};return{analyze:ee,analyzeDefinition:S,checkPrimedArguments:ne,checkRecursiveSection:re,toOperand:l,errors:i}},Gm=(t,n,r)=>{let i=new Map(n),a=t.assumptions.flatMap(t=>{if(t.kind===`NewSymbol`){let n=t.set&&r.analyze(t.set,i),a=t.location.range;return n?.level===3&&a&&r.errors.push({location:e.X(a),message:`Level error:
|
|
403
|
+
Temporal formula used as set.`}),i.set(t.name,{kind:`Formal`,arity:t.arity,level:zp[t.level]}),n?[n]:[]}return[t.kind===`AssumeProve`?Gm(t,i,r):r.analyze(t,i)]});a.push(r.analyze(t.conclusion,i));let o=Wp(Math.max(...a.map(e=>e.level)));return a.forEach(e=>{e.params.forEach(e=>o.params.add(e)),qp(o,e)}),o},Km=(t,n,r,i)=>{let a=Wm(n),o=(e,t)=>Math.max(0,...e.map(e=>a.analyze(e,t).level)),s=(e,t)=>{let n=e.body;return n.kind===`Have`||n.kind===`Case`?o([n.expression],t):n.kind===`Witness`?o(n.expressions,t):n.kind===`Take`?o(n.bounds.map(e=>e.set),t):n.kind===`Pick`?o([n.body,...n.bounds.map(e=>e.set)],t):n.kind===`Assert`?n.statement.kind===`AssumeProve`?Gm(n.statement,t,a).level:o([n.statement],t):0},c=(e,t)=>e.forEach(e=>{e.kind!==`ModuleFact`&&a.analyze(e,t)}),l=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=e.X(t.statement),r=()=>s(t,/* @__PURE__ */ new Map)===0;return t.body.kind===`Have`||t.body.kind===`Take`||t.body.kind===`Witness`?r()?[]:[{location:n,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:t.body.kind===`Case`?[...r()?[]:[{location:n,message:`Non-constant CASE for temporal goal.`}],...l(t.proof)]:t.body.kind===`Qed`?l(t.proof):[]}):[],u=(t,n)=>{if(t?.kind===`By`)return c(t.facts,n),a.errors.splice(0);if(t?.kind!==`Steps`)return[];let r=new Map(n);return t.steps.flatMap(t=>{let n=t.body;(n.kind===`Use`||n.kind===`Hide`)&&c(n.facts,r),n.kind===`Define`&&n.definitions.forEach(e=>{e.kind!==`Instance`&&(r.set(e.name,{kind:`Let`,definition:e,scope:r}),a.analyzeDefinition(e,r))});let i=s(t,r)===3,d=n.kind===`Pick`&&n.bounds.length>0&&i?n.bounds.filter(e=>o([e.set],r)!==0).flatMap(t=>t.set.location.range?[{location:e.X(t.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...a.errors.splice(0),...u(t.proof,r),...d,...t.proof?.kind===`Steps`&&i?l(t.proof):[]]})},d=/* @__PURE__ */ new Map,f=e=>{let t=d.get(e);if(t!==void 0)return t;let n=e.kind===`AssumeProve`?Gm(e,/* @__PURE__ */ new Map,a).level:a.analyze(e,/* @__PURE__ */ new Map).level;return d.set(e,n),n},p=[...t.theorems,...t.assumptions.map(e=>({...e,statement:e.expression}))],m=new Set(p.map(e=>e.statement)),h=Rm(/* @__PURE__ */ new Map,t.units,t.hasRecursiveLet),g=(e,t)=>({location:e,check:e=>{t(),e.push(...a.errors.splice(0))}});return{sections:h.map(e=>g(e.location,()=>a.checkRecursiveSection(e.members))),check:n=>[(n?h:[]).map(e=>g(e.location,()=>a.checkPrimedArguments(e.members))),t.definitions.filter(e=>!e.name.includes(`!`)&&!m.has(e.body)).map(e=>g(e.location,()=>a.analyzeDefinition(e,/* @__PURE__ */ new Map))),p.filter(e=>e.name!==void 0).map(e=>g(e.location,()=>f(e.statement))),[...t.assumptions.map(t=>({location:t.location,check:n=>{let r=f(t.expression);n.push(...a.errors.splice(0));let i=t.location.range;r!==0&&i&&n.push({location:e.X(i),message:`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${r}.`})}})),...t.theorems.map(e=>({location:e.location,check:t=>{let n=f(e.statement);t.push(...a.errors.splice(0),...u(e.proof,/* @__PURE__ */ new Map),...n===3?l(e.proof):[],...a.errors.splice(0))}})),...t.uses.map(e=>g(e.location,()=>c(e.facts,/* @__PURE__ */ new Map))),...r]].flatMap(e=>lo(e,i))}},qm=1024,Jm=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),Ym=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Xm=/* @__PURE__ */ new Set([...Jm,...Ym,`Enabled`]),Zm=/* @__PURE__ */ new Set([`~>`,`-+->`]),Qm=/* @__PURE__ */ new Set([...Zm,`\\cdot`]),$m=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),eh=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),th=/* @__PURE__ */ new Set([`RandomSubset`,`RandomSetOfSubsets`,`TestRandomSetOfSubsets`,`RandomSubsetSet`]),nh=(e,t)=>$m.has(e)||t.builtins.get(e)?.isStateLevel===!0,rh=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(Jm.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(Ym.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&Zm.has(e.operator))return 224},o=/* @__PURE__ */ new Map,s=(e,n,c)=>{let l=e.kind;if(l===`Selection`){let t=o.get(e.expression)??0,r=n?c?1:2:c?4:8;if((t&r)!==0)return;o.set(e.expression,t|r)}let u=c?1:513;(Xm.has(l)||l===`UnboundedQuantifier`&&e.isTemporal===!0||l===`Apply`&&Qm.has(e.operator))&&(r[0]|=u),Xm.has(l)&&(r[0]|=16);let d=a(e);n&&d!==void 0&&(r[0]|=d);let f=n&&d===void 0,p=We(e);if(p!==void 0&&A(e)&&t.variableIndex.has(p)&&(c||(r[0]|=512),f&&(r[0]|=32)),p!==void 0&&!A(e)){let e=t.substitutions.get(p)??p,n=t.definitions.get(e),a=t.constants.has(p),o=t.variableIndex.get(p);if((o!==void 0||t.builtins.get(e)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=u),o!==void 0&&(f&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:f,isOperatorArgument:c||l===`OperatorReference`||l===`Identifier`&&n.kind===`Operator`&&n.params.length>0});else{nh(e,t)&&(r[0]|=2|(e===`Assert`?0:4)),eh.has(e)&&(r[0]|=8),th.has(e)&&(r[0]|=256),e===`TLCEval`&&(r[0]|=qm),!a&&nh(e,t)&&(r[0]|=16);let n=t.builtins.get(e);f&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}Ue(e).forEach(e=>s(e,f,c||l===`Lambda`))};return e.forEach(e=>s(e,!0,!1)),{row:r,edges:i}},ih=(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},ah=1294,oh=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&513),sh=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=rh(He(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&ah,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=ih(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=ih(i,r,u,224),f=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&!e.isOperatorArgument).map(s))),p=ih(i,r,f,512),m=o.map(e=>new Int32Array(e.map(s).filter(e=>!oh(t[e],l[e*r]|p[e*r])))),h=ih(a,r,m,ah);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|p[t]&512|d[t]&224|h[t]&ah:e),words:r}},ch=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?lh(He(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},lh=(e,t)=>{let n=t.facts.words,r=rh(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=ch(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isOperatorArgument||(i[0]|=r[0]&512),e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}oh(e.callee,r[0])||(i[0]|=r[0]&ah)}),i},uh=(e,t)=>!(ch(e,t)[0]&513),dh=(e,t)=>!(ch(e,t)[0]&512),fh={any:2,repeated:4,streamed:8,replayed:260,varying:258},ph=(e,t,n)=>(lh(e,t)[0]&fh[n])!==0,mh=(e,t,n=`any`)=>(ch(e,t)[0]&fh[n])!==0,hh=(e,t)=>!!(lh([e],t)[0]&qm),gh=(e,t)=>{let n=ch(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},_h=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},vh=(e,t)=>{let n=lh([e],t);return n[0]&16?void 0:_h(n)},yh=(e,t)=>!!(lh([e],t)[0]&1),bh=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),xh=()=>({implication:Lb,negate:Rb,equivalent:zb,body:Bb,condition:(e,t)=>{if(typeof e!=`boolean`)throw bb(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw xb(t,n,e);return e},apply:ou,expectFunction:Nb,tuple:al,set:Uc,record:sl,writtenRecord:hs,equal:uc,enumerate:qb,choiceElements:TS,noChoice:e=>{throw ES(e)},filterPredicate:wS,isReducible:is,finiteElements:e=>G(e).elements,addBounded:es,normalizedSet:Qs,isBeyondBound:ts,cardinality:jl,functionDomain:rl,sortedFunction:$s,unassigned:(e,t)=>{throw Ob(e,t)},prime:Wx,keepLazyContext:Pb,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>jb(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let Sh,Ch;const wh=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Th=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Eh=e=>`local${e.counter++}`,Dh=(e,t=/* @__PURE__ */ new Set)=>{let n=We(e);return n!==void 0&&t.add(n),e.kind!==`Selection`&&Ue(e).forEach(e=>Dh(e,t)),t},Oh=(e,t,n)=>{if(n.locals.size===0)return n.context;let r=hh(t,e.environment),i=Dh(t),a=[...n.locals].filter(e=>r||i.has(e[0]));if(a.length===0)return n.context;let o=Th(e,a.map(e=>e[0]));return`extend(${n.context}, ${o}, [${a.map(e=>e[1]).join(`, `)}])`},kh=(e,t,n)=>`${Th(e,$x(t,e.environment))}(${Oh(e,t,n)})`,Ah=(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})`},jh=(e,t,n,r)=>{let i=Eh(e),a=Eh(e),o=Eh(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} }`},Mh=(e,t,n)=>{let r=t.kind===`Forall`;return Ah(e,n,n=>{let i=t.bounds.map(()=>Eh(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(${zh(e,r.set,n)}, ${Th(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=Eh(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${zh(e,t.body,n)}, ${Th(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>jh(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},Nh=(e,t,n,r,i)=>Ah(e,i,i=>{let a=Eh(e),o=Eh(e),s=Th(e,t),c=`choiceElements(${zh(e,n,i)}, ${s}, ${Th(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${zh(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${jh(e,a,o,l)} return noChoice(${s});`}),Ph=(e,t,n,r)=>Ah(e,r,r=>{let i=Eh(e),a=Eh(e),o=Eh(e),s=Eh(e),c=Th(e,t),l=`if (!isReducible(${i})) return ${Th(e,xS(t,e.environment))}(${i}, ${Oh(e,t,r)});`,u=zh(e,t.bound.set,r);r.locals.set(n,s);let d=CS(t,e.environment)?` else break;`:``,f=`if (filterPredicate(${zh(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});${d}`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${jh(e,a,s,f)} return normalizedSet(${o});`}),Fh=(e,t,n,r)=>Ah(e,r,r=>{let i=Eh(e),a=Eh(e),o=Eh(e),s=Eh(e),c=Eh(e),l=Eh(e),u=Th(e,vS(t,e.environment)),d=Oh(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=zh(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${zh(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} = []; ${jh(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),Ih=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=zh(e,r[0],n),a=zh(e,r[1],n),o=Th(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${zh(e,r[0],n)}, ${Th(e,t)})`;if(t.operator===`<=>`)return`equivalent(${zh(e,r[0],n)}, ${zh(e,r[1],n)}, ${Th(e,t)})`;if(A(t))return kh(e,t,n);let i=xx(t.operator,e.environment);if(i?.kind!==`Builtin`)return kh(e,t,n);if(i.name===`DOMAIN`)return`${Th(e,wb(t))}(${zh(e,r[0],n)})`;if(i.name===`\\subseteq`&&i.evaluateBinary&&r.length===2)return`${Th(e,Tb(t,i.evaluateBinary))}(${zh(e,r[0],n)}, ${zh(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&nS(r[0],a))return`${Th(e,i.evaluateUnary)}(${zh(e,r[0],n)})`;let o=r.length===2&&nS(r[0],a)&&nS(r[1],a);return i.evaluateBinary&&o?`${Th(e,i.evaluateBinary)}(${zh(e,r[0],n)}, ${zh(e,r[1],n)})`:kh(e,t,n)},Lh=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(A(e))return!1;let r=Mx(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Lh(e.expression,t,n);case`FieldAccess`:return Lh(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Lh(e,t,n));default:return!1}},Rh=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Rh(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Rh);default:return!1}},zh=(e,t,n)=>{let r=(t,r=n)=>zh(e,t,r);switch(t.kind){case`Number`:return ls(t.value)?String(t.value):kh(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(A(t))return kh(e,t,n);let i=Mx(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Th(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Th(e,i.value):kh(e,t,n)}case`Apply`:return Ih(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=Th(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)}, ${Th(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{pS(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Lh(t.function,n,e.environment)?r(t.function):Rh(t.function)?r(t.function,i):kh(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Th(e,t)}))`,o=Cb(e.environment.runtime.version),s=o?`, ${Th(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`${Th(e,Sb(t))}(${r(t.record)})`;case`Record`:{let i=OS(t.fields);if(kS(i))return kh(e,t,n);let a=Th(e,i.map(e=>e.name)),o=`[${t.fields.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}, ${Th(e,i.map(e=>t.fields.indexOf(e)))}, ${o}, ${Th(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?kh(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`)?Mh(e,t,n):kh(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?Nh(e,t,t.set,t.pattern.name,n):kh(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!_S(t)?Fh(e,t,r.pattern.name,n):kh(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?Ph(e,t,t.bound.pattern.name,n):kh(e,t,n);default:return kh(e,t,n)}},Bh=(e,t)=>{if(!bh.has(e.kind)||(Ch??=wh(),!Ch))return;let n={environment:t,references:[],helpers:[],counter:0},r=zh(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(`
|
|
404
|
+
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return Sh??=xh(),Function(...Object.keys(Sh),...i,a)(...Object.values(Sh),...n.references)},Vh=(t,n,r)=>new e.A(`Applying ${t} to the following value,\nwhich is not ${n}:\n${U(q(r))}`),Hh=e=>as(e)?K(e):void 0,Uh=`a function with a finite domain`,Wh=(e,t,n)=>{let r=J(e,t,n),i=Hh(r);if(!i)throw Vh(n,Uh,r);return i},Gh=(e,t)=>{let n=J(e,1,t),r=Hh(n),i=r&&Yh(r,J(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw xf(`second`,t,`bag`,n);return i},Kh=(e,t,n)=>{let r=t[n];if(!r||!Jh(r))throw xf(n===0?`first`:`second`,`(+)`,`bag`,J(e,n,`(+)`));return r},qh=(e,t)=>{if(!rs(e)||!W(e))throw t();return G(e).elements},Jh=e=>e.range.every(e=>typeof e==`number`&&e>0),Yh=(e,t)=>{let n=e.domain.findIndex(e=>zc(t,e));return n===-1?void 0:e.range[n]},Xh=(e,t)=>{if(typeof e==`number`)return e;throw t()},Zh=(e,t,n)=>{let r=Xh(e,n)+Xh(t,n);if(Af(r))throw jf(`${e}+${t}`);return r},Qh=(e,t,n,r,i)=>{let a=Xh(e.range[t],r),o=Yh(n,e.domain[t]);if(o===void 0)return a;let s=a-Xh(o,i);if(Af(s))throw jf(`${a}-${o}`);return s},$h=(e,t,n,r,i=e.length)=>{let a=e.slice(0,i).find(e=>zc(t,e[0]));a?a[1]=Zh(a[1],n,r):e.push([t,n])},eg=e=>e.domain.map((t,n)=>[t,e.range[n]]),tg=$s([],[]),ng=t=>[Ef(`EmptyBag`,tg),Y(`IsABag`,1,e=>{let t=Hh(J(e,0,`IsABag`));return t!==void 0&&Jh(t)}),Y(`BagCardinality`,1,e=>{let t=J(e,0,`BagCardinality`),n=Wh(e,0,`BagCardinality`),r=()=>Vh(`BagCardinality`,`a bag`,t);return n.range.reduce((e,t)=>{if(typeof t!=`number`||t<=0)throw r();return Zh(e,t,r)},0)}),Y(`BagIn`,2,e=>{let t=Gh(e,`BagIn`);return t!==void 0&&t>0}),Y(`CopiesIn`,2,e=>Gh(e,`CopiesIn`)??0),Y(`\\oplus`,2,e=>{let t=[0,1].map(t=>Hh(J(e,t,`(+)`))),n=Kh(e,t,0),r=Kh(e,t,1),i=eg(n),a=()=>xf(`second`,`(+)`,`bag`,J(e,1,`(+)`));return r.domain.forEach((e,t)=>$h(i,e,r.range[t],a,n.domain.length)),Jc(i)}),Y(`\\ominus`,2,e=>{let t=J(e,0,`(-)`),n=J(e,1,`(-)`),r=Hh(t),i=Hh(n);if(!r)throw xf(`first`,`(-)`,`bag`,t);if(!i)throw xf(`second`,`(-)`,`bag`,n);let a=()=>xf(`first`,`(-)`,`bag`,t),o=()=>xf(`second`,`(-)`,`bag`,n);return Jc(r.domain.flatMap((e,t)=>{let n=Qh(r,t,i,a,o);return n>0?[[e,n]]:[]}))}),Y(`BagUnion`,1,t=>{let n=J(t,0,`BagUnion`),r=qh(n,()=>Vh(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??tg;let i=()=>new e.A(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${U(q(n))}`),a=e=>{let t=Hh(e);if(!t)throw i();return t},o=eg(a(r[0]));return r.slice(1).forEach(e=>{let t=a(e);t.domain.forEach((e,n)=>$h(o,e,t.range[n],i))}),Jc(o)}),Y(`\\sqsubseteq`,2,e=>{let t=J(e,0,`\\sqsubseteq`),n=J(e,1,`\\sqsubseteq`),r=Hh(t),i=Hh(n);if(!r)throw Vh(`\\sqsubseteq`,Uh,t);if(!i)throw Vh(`\\sqsubseteq`,Uh,n);let a=()=>Vh(`\\sqsubseteq`,`a bag`,t),o=()=>Vh(`\\sqsubseteq`,`a bag`,n);return r.domain.every((e,t)=>{let n=Yh(i,e);return Xh(r.range[t],a)<=(n===void 0?0:Xh(n,o))})}),Df(`BagOfAll`,2,e=>{let t=Tf(e,0,`BagOfAll`),n=J(e,1,`BagOfAll`),r=Hh(n);if(!r)throw xf(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[],a=()=>xf(`second`,`BagOfAll`,`bag`,n);return r.domain.forEach((e,n)=>$h(i,t.call([e]),r.range[n],a)),Jc(i)}),Y(`SubBag`,1,n=>{let r=J(n,0,`SubBag`);if(!as(r))throw new e.x(`Attempted to apply the operator DOMAIN to a non-function\n(${Lf(r)})\nline 106, col 58 to line 106, col 65 of module Bags`);let i=K(r),a=G(Uc(i.range)).elements,o=a.find(e=>typeof e!=`number`);o!==void 0&&t.get(`>=`)?.evaluateBinary?.(a[0],o);let s=i.range.filter(e=>typeof e==`number`);if(s.some(e=>e<1))throw new e.x(`Attempted to apply a function to ${q(i)}, which is not in its domain`);return Hc(i.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:s[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>$s(e.map(e=>e[0]),e.map(e=>e[1]))))}),Y(`BagToSet`,1,e=>cu(Wh(e,0,`BagToSet`))),Y(`SetToBag`,1,e=>{let t=J(e,0,`SetToBag`),n=qh(t,()=>Vh(`BagToSet`,Uh,t));return $s([...n],n.map(()=>1))})],rg={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},Z={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},ig={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},ag=[{lower:`true`,upper:`TRUE`,token:Z.true},{lower:`false`,upper:`FALSE`,token:Z.false},{lower:`null`,upper:`NULL`,token:Z.null}],og=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
|
|
405
|
+
`],[`r`,`\r`],[`f`,`\f`]]),sg=1024,cg=t=>{let n=+!!t.startsWith(``),r=n,i=0,a=n,o=!0,s=Z.none,c=0,l=[rg.emptyDocument],u=[void 0],d=[0],f=()=>`$${l.map((e,t)=>e===rg.emptyArray||e===rg.nonemptyArray?`[${d[t]}]`:e===rg.emptyDocument||e===rg.nonemptyDocument?``:`.${u[t]??``}`).join(``)}`,p=()=>` at line ${i+1} column ${r-a+1} path ${f()}`,m=t=>new e.x(`com.google.gson.stream.MalformedJsonException: ${t}${p()}
|
|
406
|
+
See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`),h=()=>new e.x(`java.io.EOFException: End of input${p()}`),g=()=>{if(!o)throw m(`Use JsonReader.setStrictness(Strictness.LENIENT) to accept malformed JSON`)},_=e=>`/\\;#=`.includes(e)?(g(),!1):!`{}[]:, \f\r
|
|
407
|
+
`.includes(e),v=()=>{for(;r<t.length;){let e=t[r++];if(e===`
|
|
408
|
+
`){i++,a=r;return}if(e===`\r`)return}},ee=e=>{for(;r+e.length<=t.length;r++)if(t[r]===`
|
|
409
|
+
`)i++,a=r+1;else if(t.startsWith(e,r))return!0;return!1},y=()=>{for(;r<t.length;){let e=t[r++];if(e===`
|
|
410
|
+
`)i++,a=r;else if(e===`/`){if(r===t.length)return e;g();let n=t[r];if(n!==`*`&&n!==`/`)return e;if(r++,n===`/`)v();else if(ee(`*/`))r+=2;else throw m(`Unterminated comment`)}else if(e===`#`)g(),v();else if(e!==` `&&e!==`\r`&&e!==` `)return e}},b=()=>{let e=y();if(e===void 0)throw h();return e},x=()=>{let e=ag.find(e=>t[r]===e.lower[0]||t[r]===e.upper[0]);if(!e)return Z.none;let n=e.lower.length;for(let i=0;i<n;i++){let n=t[r+i];if(n!==e.lower[i]&&n!==e.upper[i])return Z.none}return r+n<t.length&&_(t[r+n])?Z.none:(r+=n,e.token)},te=()=>{let e=ig.none,n=!1,i=0;for(;r+i<t.length;i++){if(i===sg)return Z.none;let a=t[r+i];if(a===`-`){if(e===ig.none)e=ig.sign;else if(e===ig.exponentE)e=ig.exponentSign;else return Z.none}else if(a===`+`){if(e!==ig.exponentE)return Z.none;e=ig.exponentSign}else if(a===`e`||a===`E`){if(e!==ig.digit&&e!==ig.fractionDigit)return Z.none;e=ig.exponentE}else if(a===`.`){if(e!==ig.digit)return Z.none;e=ig.decimal}else if(a<`0`||a>`9`){if(_(a))return Z.none;break}else if(e===ig.sign||e===ig.none)n=a===`0`,e=ig.digit;else if(e===ig.digit){if(n)return Z.none}else e===ig.decimal?e=ig.fractionDigit:(e===ig.exponentE||e===ig.exponentSign)&&(e=ig.exponentDigit)}return i===sg||e!==ig.digit&&e!==ig.fractionDigit&&e!==ig.exponentDigit?Z.none:(c=i,Z.number)},S=()=>{let e=l.length-1,n=l[e];if(n===rg.emptyArray)l[e]=rg.nonemptyArray;else if(n===rg.nonemptyArray){let e=b();if(e===`]`)return Z.endArray;if(e===`;`)g();else if(e!==`,`)throw m(`Unterminated array`)}else if(n===rg.emptyObject||n===rg.nonemptyObject){if(l[e]=rg.danglingName,n===rg.nonemptyObject){let e=b();if(e===`}`)return Z.endObject;if(e===`;`)g();else if(e!==`,`)throw m(`Unterminated object`)}let t=b();if(t===`"`)return Z.doubleQuotedName;if(t===`'`)return g(),Z.singleQuotedName;if(t===`}`){if(n!==rg.nonemptyObject)return Z.endObject;throw m(`Expected name`)}if(g(),r--,_(t))return Z.unquotedName;throw m(`Expected name`)}else if(n===rg.danglingName){l[e]=rg.nonemptyObject;let n=b();if(n===`=`)g(),t[r]===`>`&&r++;else if(n!==`:`)throw m(`Expected ':'`)}else if(n===rg.emptyDocument){if(y()===void 0)return Z.eof;r--,t.startsWith(`)]}'
|
|
411
|
+
`,r)&&(r+=5),l[e]=rg.nonemptyDocument}else if(n===rg.nonemptyDocument){if(y()===void 0)return Z.eof;g(),r--}let i=y();if(i===void 0){if(n===rg.emptyDocument)return Z.eof;throw h()}if(i===`]`&&n===rg.emptyArray)return Z.endArray;if(i===`]`||i===`;`||i===`,`){if(n!==rg.emptyArray&&n!==rg.nonemptyArray)throw m(`Unexpected value`);return g(),r--,Z.null}if(i===`'`)return g(),Z.singleQuoted;if(i===`"`)return Z.doubleQuoted;if(i===`[`)return Z.beginArray;if(i===`{`)return Z.beginObject;r--;let a=x();if(a!==Z.none)return a;let o=te();if(o!==Z.none)return o;if(!_(t[r]))throw m(`Expected value`);return g(),Z.unquoted},ne=()=>(s===Z.none&&(s=S()),s),re=()=>{if(r===t.length)throw m(`Unterminated escape sequence`);let e=t[r++];if(e===`u`){if(r+4>t.length)throw m(`Unterminated escape sequence`);let e=t.slice(r,r+4);if(!/^[\da-fA-F]{4}$/.test(e))throw m(`Malformed Unicode escape \\u${e}`);return r+=4,String.fromCharCode(Number.parseInt(e,16))}let n=og.get(e);if(n!==void 0)return n;if(e===`
|
|
412
|
+
`)return i++,a=r,e;if(`'"\\/`.includes(e))return e;throw m(`Invalid escape sequence`)},ie=e=>{let n=``,o=r;for(;r<t.length;){let s=t[r++];if(s===e)return n+t.slice(o,r-1);s===`\\`?(n+=t.slice(o,r-1)+re(),o=r):s===`
|
|
413
|
+
`&&(i++,a=r)}throw m(`Unterminated string`)},ae=()=>{let e=r;for(;r<t.length&&_(t[r]);)r++;return t.slice(e,r)},C=t=>{if(l.length-1>=255)throw new e.x(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${p()}`);l.push(t),u.push(void 0),d.push(0),s=Z.none},oe=()=>{l.pop(),u.pop(),d.pop(),d[l.length-1]++,s=Z.none},w=()=>{let e=ne();return e!==Z.endObject&&e!==Z.endArray&&e!==Z.eof},se=()=>{let e=ne(),t=e===Z.unquotedName?ae():ie(e===Z.singleQuotedName?`'`:`"`);return s=Z.none,u[l.length-1]=t,t},ce=e=>e===Z.true||e===Z.false?e===Z.true:e===Z.null?null:e===Z.number?(r+=c,{literal:t.slice(r-c,r)}):e===Z.unquoted?ae():ie(e===Z.singleQuoted?`'`:`"`),le=()=>{let e=ne();if(e===Z.beginArray){C(rg.emptyArray);let e=[];for(;w();)e.push(le());return oe(),e}if(e===Z.beginObject){C(rg.emptyObject);let e=/* @__PURE__ */ new Map;for(;w();)e.set(se(),le());return oe(),e}let t=ce(e);return s=Z.none,d[l.length-1]++,t};if(ne()===Z.eof)return null;let ue=le();return o=!1,ue!==null&&ne(),ue},lg=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),ug=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),dg=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),fg=e=>{if(!as(e))return;let t=K(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?ol(n):void 0},pg=(t,n)=>{let r=`tlc2.value.impl.${If(t)}`,i=`tlc2.value.impl.${n}`;return new e.x(`class ${r} cannot be cast to class ${i} (${r} and ${i} are in unnamed module of loader 'app')`)},mg=t=>new e.x(`Cannot convert value: unsupported value type tlc2.value.impl.${If(t)}`),hg=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),gg=e=>`[${e.map(bg).join(`,`)}]`,_g=e=>`{${ms(e).map(e=>`${hg(typeof e[0]==`string`?e[0]:q(e[0]))}:${bg(e[1])}`).join(`,`)}}`,vg=e=>{let t=K(e),n=Il(t);return n?gg(n):_g(t)},yg=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,bg=e=>typeof e==`string`?hg(e):typeof e==`object`?e.kind===`ModelValue`?hg(e.name):If(e)===`RecordValue`?_g(K(e)):xg(e):String(e),xg=e=>{let t=If(e);if(t===`TupleValue`)return gg(K(e).range);if(yg(t))return vg(e);if(cl(e))return gg(G(e).elements);throw mg(e)},Sg=e=>e.map(e=>`${bg(e)}\n`).join(``),Cg=e=>{let t=If(e);if(t===`RecordValue`)return _g(K(e));if(t===`TupleValue`)return`{${K(e).range.map((e,t)=>`"${t}":${bg(e)}`).join(`,`)}}`;if(yg(t))return vg(e);throw mg(e)},wg=t=>{if(t===null)throw new e.x(`Cannot convert value: unsupported JSON value null`);if(typeof t==`boolean`)return t;if(typeof t==`string`)return Is(t);if(Array.isArray(t))return al(t.map(wg));if(t instanceof Map)return ol([...t].map(e=>[Is(e[0]),wg(e[1])]));let n=Number(t.literal);if(!/^-?\d+$/.test(t.literal)||Af(n))throw new e.x(`Cannot convert value: expected a 32-bit integer JSON number, but found ${t.literal}`);return n||0},Tg=t=>{if(typeof t!=`string`)throw new e.x(`Cannot cast tlc2.value.impl.${If(t)} to tlc2.value.impl.StringValue`);return t},Eg=(e,t)=>{let n=ou(e,t);if(typeof n!=`string`)throw pg(n,`StringValue`);return n},Dg=t=>{if(!ug.has(t.toLowerCase()))throw dg.has(t.toLowerCase())?new e.V(`IOUtils!Serialize does not support the charset ${t}`):new e.x(/^[a-zA-Z\d][\w.:+-]*$/.test(t)?`java.nio.charset.UnsupportedCharsetException: ${t}`:`java.nio.charset.IllegalCharsetNameException: ${t}`)},Og=(t,n,r,i)=>{let a=r.find(e=>!lg.has(e));if(a!==void 0)throw new e.x(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${a}`);if(r.includes(`READ`))throw new e.x(`java.lang.IllegalArgumentException: READ not allowed`);let o=new Set(r.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:r);if(o.has(`APPEND`)&&o.has(`TRUNCATE_EXISTING`))throw new e.x(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(o.has(`DELETE_ON_CLOSE`))throw new e.V(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let s=t.readFile?.(n);if(s===void 0&&!o.has(`CREATE`)&&!o.has(`CREATE_NEW`))throw new e.x(`java.nio.file.NoSuchFileException: ${n}`);if(s!==void 0&&o.has(`CREATE_NEW`))throw new e.x(`java.nio.file.FileAlreadyExistsException: ${n}`);s===void 0||o.has(`TRUNCATE_EXISTING`)?t.writeFile?.(n,i):t.writeFile?.(n,o.has(`APPEND`)?s+i:i+s.slice(i.length))},kg=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},Ag=(t,n)=>{let r=t.readFile?.(n);if(r===void 0)throw new e.x(`${n} (No such file or directory)`);return r},jg=e=>[zf(Of(`ToJson`,1,e=>Is(bg(J(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),zf(Of(`ToJsonArray`,1,e=>Is(xg(J(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),zf(Of(`ToJsonObject`,1,e=>Is(Cg(J(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),zf(Of(`JsonSerialize`,2,t=>{let n=Tg(J(t,0,`JsonSerialize`)),r=J(t,1,`JsonSerialize`);if(!Il(r)&&!fg(r))throw xf(`second`,`JsonSerialize`,`sequence or record`,r);return kg(e,n),e.writeFile?.(n,bg(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`),zf(Of(`ndJsonSerialize`,2,t=>{let n=Tg(J(t,0,`ndJsonSerialize`)),r=J(t,1,`ndJsonSerialize`),i=Il(r);if(!i)throw xf(`second`,`ndJsonSerialize`,`sequence`,r);return kg(e,n),e.writeFile?.(n,Sg(i)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),zf(Of(`JsonDeserialize`,1,t=>wg(cg(Ag(e,Tg(J(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),zf(Of(`ndJsonDeserialize`,1,t=>al(Ag(e,Tg(J(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>wg(cg(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],Mg=(e,t)=>[zf(Gf(`Serialize`,3,(n,r)=>{let i=Kf(n,2,`Serialize`)(),a=fg(i);if(!a)throw xf(`third`,`ndJsonSerialize`,`sequence`,i);if(Eg(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Kf(n,0,`Serialize`)(),s=Il(o);if(!s)throw xf(`first`,`Serialize`,`sequence`,o);let c=Kf(n,1,`Serialize`)();if(typeof c!=`string`)throw xf(`second`,`ndJsonSerialize`,`sequence`,c);let l=ou(a,`openOptions`);if(If(l)!==`TupleValue`)throw pg(l,`TupleValue`);let u=Eg(a,`charset`),d=K(l).range.map(e=>{if(typeof e!=`string`)throw pg(e,`StringValue`);return e});return Dg(u),Og(e,c,d,Sg(s)),!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)`)],Ng={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},Pg=e=>{let n=[],r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=0,o=Xs(),s=e=>n.push(e&255),c=e=>{s(e>>8),s(e)},l=e=>{c(e>>16),c(e)},u=e=>e>32767?l(-e):c(e),d=e=>{s(Ng.string),l(0),l(-1),l(e.length),e.split(``).forEach(e=>s(e.charCodeAt(0)))},f=e=>{s(Ng.handle),u(e)},p=e=>{if(typeof e==`boolean`){s(Ng.boolean),s(+!!e);return}if(typeof e==`number`){s(Ng.integer),l(e);return}if(typeof e==`string`){a++,d(e);return}if(e.kind===`ModelValue`){s(Ng.modelValue),c(o.indexOf(e));return}if(e.kind===`Interval`){s(Ng.interval),l(e.low),l(e.high);return}let t=r.get(e);if(t!==void 0){f(t);return}if(r.set(e,a++),rs(e)){let t=G(e).elements;s(Ng.set),l(t.length),t.forEach(p);return}let n=K(e),m=nc(e);m===`tuple`?(s(Ng.tuple),u(n.range.length),n.range.forEach(p)):m===`record`?(s(Ng.record),l(n.domain.length),n.domain.forEach((e,t)=>{let r=String(e),o=i.get(r);o===void 0?(i.set(r,a++),d(r)):f(o),p(n.range[t])})):(s(Ng.function),u(n.domain.length),s(1),n.domain.forEach((e,t)=>{p(e),p(n.range[t])}))};return p(e),(0,t.gzipSync)(Uint8Array.from(n))},Fg=e=>[zf(Of(`_TLCTraceSerialize`,2,t=>{let n=Tg(J(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,Pg(J(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`)],Ig=25214903917n,Lg=(1n<<48n)-1n,Rg=e=>{let t=(BigInt.asUintN(64,e)^Ig)&Lg,n=e=>(t=t*Ig+11n&Lg,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^Ig)&Lg},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<=2147483647)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},zg=[],Bg=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Vg=()=>{for(let e=1277011;zg.length<1341;e++)Bg(e)&&zg.push(e);return zg},Hg=e=>{let t=Vg(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},Ug=e=>{let t=[],n=e;for(let e=2;e*e<=n;e++)for(;n%e===0;)t.push(e),n/=e;return n>1&&t.push(n),t},Wg=e=>{for(let t=Math.max(e,9);;t++){let e=Ug(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)}}},Gg=(e,t,n)=>{if(t<=0)return[];let r=Wg(t),i=BigInt(n.nextInt(t)),a=BigInt(Hg(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},Kg=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Jo),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},qg=(1n<<63n)-1n-24n,Jg=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(qg*BigInt(n)+i)%t;return r<0n?r+t:r})},Yg=(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,Xg=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=rl(e.domain),n=G(e.range).elements;return{lists:t.map(()=>n),create:e=>$s(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>G(e).elements),create:t=>ol(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>G(e).elements),create:al}}},Zg=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,Qg=(e,t,n,r)=>{if(Ol(t))return[];let i=r===`1.7.4`?Kg:Gg;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=Zg(t,r)?void 0:Xg(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?Jg(e,t,n):i(e,Number(t),n)).map(e=>a.create(Yg(a.lists,e)))}let o=G(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},$g=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[...Sf(t.domain,`RandomElement`,t).elements];return $s(e,e.map(()=>$g(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return ol(t.names.map((e,r)=>[e,$g(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return al(t.factors.map(e=>$g(e,n)));if(typeof t==`object`&&t.kind===`Interval`){let r=Math.max(0,t.high-t.low+1),i=Math.floor(n.nextDouble()*r);if(i>=r)throw new e.x(`Attempted to retrieve out-of-bounds element from the interval value ${U(q(t))}.`);return t.low+i}let r=Sf(t,`RandomElement`).elements,i=Math.floor(n.nextDouble()*r.length);if(i>=r.length)throw new e.x(`Index ${i} out of bounds for length ${r.length}`);return r[i]},e_=(e,t,n)=>{if(typeof e!=`number`||e<0)throw xf(t,n,`nonnegative integer`,e);return e},t_=(e,t,n,r)=>Hc(Array.from({length:t},()=>Hc(e.filter(()=>r.nextDouble()<n)))),n_=(e,t)=>{let n=`RandomSetOfSubsets`,r=e_(J(e,0,n),`first`,n),i=e_(J(e,1,n),`second`,n),a=J(e,2,n);if(!rs(a)||!W(a))throw xf(`third`,n,`finite set`,a);let o=G(a).elements;if(o.length<31&&r>2**o.length)throw xf(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw xf(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return t_(o,r,o.length===0?0:i/o.length,t.getRandom())},r_=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,i_=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,a_=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(r_.test(t))return Number(t.replace(/[fFdD]$/,``));let n=i_.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},o_=e=>Y(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=e_(J(t,0,n),`first`,n),i=J(t,1,n);if(typeof i!=`string`)throw xf(`second`,n,`string literal representing a probability`,i);let a=a_(i);if(a===void 0||a<0||a>1)throw xf(`second`,n,`string literal does not represent a parsable probability`,i);let o=J(t,2,n);if(!rs(o)||zs(o)||!Nl(o))throw xf(`third`,n,`finite set`,o);let s=jl(o);if(32-Math.clz32(r)>s&&r>1<<s)throw xf(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return t_(G(o).elements,r,a,e.getRandom())}),s_=t=>[zf(Y(`RandomSubset`,2,n=>{let r=e_(J(n,0,`RandomSubset`),`first`,`RandomSubset`),i=J(n,1,`RandomSubset`);if(!cl(i)||!Nl(i))throw xf(`second`,`RandomSubset`,`a finite set`,i);let a=Zg(i,t.version);if(a&&a.reduce((e,t)=>e*G(t).elements.length,1)>Qo())throw new e.x($o());return Hc(Qg(r,i,t.getRandom(),t.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),Y(`RandomSetOfSubsets`,3,e=>n_(e,t)),Y(`TestRandomSetOfSubsets`,3,e=>al(Array.from({length:5},()=>G(n_(e,t)).elements.length)))],c_=(e,t=0n)=>{let n=Rg(t),r=Rg(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>ol([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,markExplored:void 0,getSuccessorAction:()=>void 0,toRecord:()=>({}),setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:_d,getSimulationValue:void 0,getRandom:()=>{let e=a?void 0:o.getCurrentState();return e===void 0?n:(e!==i&&(r.setSeed(o.getFingerprint(e)^BigInt.asUintN(64,t)),i=e),r)},reseedRandom:()=>{i=void 0},runWithNewRandom:e=>{let n=r,a=i;r=Rg(t),i=void 0;try{return e()}finally{r=n,i=a}},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,readLine:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return o},l_=e=>Jc([...e.possibleCounts].map(e=>[e[0],e[1]])),u_=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,l_(e)]]),d_=e=>ol([[`name`,e??`UnnamedAction`],[`location`,ol([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),f_=/* @__PURE__ */ new WeakSet,p_=e=>tc(Yc(e),`record`),m_=(e,t,n=!0)=>{[`state`,`action`,`console`].forEach(Is);let r=[[`action`,Hc(e)],[`state`,Hc(t)]],i=p_(n?r:[...r,[`console`,!1]]);return f_.add(i),i},h_=(e,t,n,r=!0)=>{let i=e.map((e,t)=>al([t+1,ol(Object.entries(e))])),a=i.slice(1).map((e,n)=>al([i[n],t[n],e])),o=n?[al([i[i.length-1],n.action,i[n.start]])]:[];return m_([...a,...o],i,r)},g_=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return u_(e).get(t)},__=(t,n,r,i)=>{if(typeof r==`number`&&r>=0)t.registers.set(r,i);else if(r===`exit`)i===!0&&(t.isStopped=!0);else if(r===`pause`){if(i!==!0||!t.pause)return;n(`Press enter to resume model checking.`),t.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))t.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))t.properties.set(r.slice(2),q(i));else throw new e.A(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${U(q(r))}`)},v_=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:Q(e),y_=e=>e.every(e=>e!==void 0),b_=(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&&!A(e);if(i&&t.variableIndex.has(r))return 1;let a=Ue(e).map(e=>b_(e,t,n)),o=i?Vb(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(b_(o.body,t,n))),Math.max(0,...a)},x_=(t,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[Gf(`AssertError`,2,t=>{let r=Tf(t,0,`AssertError`).expression;if(r&&r.kind!==`String`)throw new e.x(`In computing AssertError, a non-string expression (${v_(r)}) was used as the err of an AssertError(err, exp).`);let i=Kf(t,0,`AssertError`)();try{Kf(t,1,`AssertError`)()}catch(t){if(t instanceof e.x)return jo(t.message,n.isTool)===i;throw t}return!1}),Of(`TLCGetOrDefault`,2,e=>g_(n,J(e,0,`TLCGetOrDefault`))??J(e,1,`TLCGetOrDefault`)),Of(`Trace`,0,(t,r)=>{let i=r?.environment.variables??[],a=r?.state??i.map(()=>void 0);if(!r||!y_(a)){let t=i.filter((e,t)=>a[t]===void 0);throw new e.x(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${t.length>1?`s`:``} ${t.join(`, `)} undefined).`)}return r.state?al(n.getBehavior(a).map(e=>{let t=r.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return ol(i===void 0?t:[[`_action`,i],...t])})):al([ol([])])}),Of(`CounterExample`,0,()=>n.counterExample??m_([],[])),Y(`ToTrace`,1,t=>{let n=J(t,0,`ToTrace`);if(typeof n!=`object`||!f_.has(n))throw new e.A(`The argument of ToTrace should be a CounterExample, but instead it is:\n${U(q(n))}`);let r=G(ou(n,`state`)).elements.map(e=>Il(e)??[]);return al(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),Y(`TLCModelValue`,1,t=>{let n=J(t,0,`TLCModelValue`);if(typeof n!=`string`)throw new e.A(`The argument of ModelValue should be a string, but instead it is:\n${U(q(n))}`);return Ys(n)}),Gf(`TLCDefer`,1,(e,t)=>{let r=Tf(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{$(r,{...t,next:e})}),!0}),Y(`TLCNoOp`,1,e=>J(e,0,`TLCNoOp`)),{...Gf(`PickSuccessor`,1,(r,i)=>{let a=i?.next??(i?.environment.variables??[]).map(()=>void 0);if(n.getSimulationValue===void 0&&(!y_(a)||i?.next&&n.isSeen(a)))return!0;let o=Tf(r,0,`PickSuccessor`),s=o.call([]);if(typeof s!=`boolean`)throw new e.x(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${Lf(s)}) was used as the condition of an IF.\n${o.expression?v_(o.expression):``}`);if(s||!i?.next||!y_(a)||!i.state||!y_(i.state))return!0;let c=i.state,l=n.getSuccessorAction(c,a),u=e=>t(bo(n.isTool,_o.moduleOverrideStdout,vo.none,e));for(;;){u(`Extend behavior of length ${n.getLevel(c)} with a "${l?.name}" step [<Action ${l?.location.range&&e.X(l.location.range)}>]? (Yes/no/explored/states/diff):`);let t=n.readLine?.();if(t===void 0)throw new e.y;if(/^[\0-\x20]*$/.test(t)||t.toLowerCase().startsWith(`y`))return!0;if(t[0]===`s`)u(`${Hu(n.toRecord(c)).trimEnd()}\n~>\n${Hu(n.toRecord(a)).trimEnd()}`);else if(t[0]===`d`)u(Hu(n.toRecord(a),n.toRecord(c)));else if(t[0]===`e`){if(n.markExplored)return n.markExplored(a),!0;if(n.getSimulationValue===void 0)throw new e.V(`tla-ts can't mark a state explored while it searches depth first.`);u(`Marking a state explored is unsupported by the current TLC mode. Is TLC running in simulation mode?`)}else if(t[0]===`n`)return!1}}),isActionLevel:!0},Gf(`TLCCache`,2,(e,t)=>{let i=Tf(e,0,`TLCCache`),o=Du(Kf(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=b_(s,t.environment,/* @__PURE__ */ new Set);if(c===2)return i.call([]);let l=c===1;if(l&&t.state&&n.getSimulationValue===void 0)return i.call([]),i.call([]);let u=l&&t.state?a(t.state):r,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=i.call([]);return d.set(o,p),p}),Y(`TLCFP`,1,e=>{let t=J(e,0,`TLCFP`),n=vu(t);if(n)throw n;return Number(BigInt.asIntN(32,_d([t])))}),Gf(`TLCEvalDefinition`,1,(t,n)=>{let r=Kf(t,0,`TLCEvalDefinition`)();if(typeof r!=`string`)throw new e.A(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${U(q(r))}`);let i=n?Vb(r,n.environment):void 0,a=i?void 0:n?.environment.builtins.get(r);if(a?.arity===0)return a.evaluate([],n);if(!i||!n)throw new e.A(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${U(q(r))}`);if(i.kind===`Operator`&&i.params.length>0){let t=i.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new e.A(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${r}(${t.join(`, `)})`)}return i.kind===`Operator`?$(i.body,n):$({kind:`Identifier`,name:r,location:i.location},n)})]},S_=(e,t)=>[Of(`_Track`,2,e=>{let n=String(J(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,J(e,0,`_Track`)===!0?r+1:r),!0}),Of(`_Counts`,0,()=>l_(t)),Of(`_CheckName`,1,n=>{let r=String(J(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(q(l_(t),!0)),!1)}),Of(`_PrintCounts`,0,()=>(e(q(l_(t),!0)),!0))],C_=e=>`${e.getUTCFullYear()}.${Mo(e.getUTCMonth()+1)}.${Mo(e.getUTCDate())}.${Mo(e.getUTCHours())}${Mo(e.getUTCMinutes())}${Mo(e.getUTCSeconds())}`,w_=e=>Jc([...e].map(e=>[e[0],al([e[1]])])),T_=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),E_=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),D_=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),O_=(t,n,r)=>{if(t.version===`1.7.4`?!E_.has(n)||!t.isStarted&&D_.has(n):!t.isStarted&&T_.has(n))throw new e.A(`TLCGet(${n}) was undefined.`);let i=t.getSimulationValue?.(n,r);if(i!==void 0)return i;let a=Math.floor((Date.now()-t.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:t.getLevel(r);case`diameter`:return t.diameter;case`generated`:return t.generatedStates;case`distinct`:return t.distinctStates;case`queue`:return t.queueSize;case`duration`:return a;case`stats`:return p_([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,a],[`worker`,0]]);case`config`:return p_([[`mode`,`bfs`],[`deadlock`,t.checkDeadlock],[`worker`,1],[`seed`,String(t.seed)],[`fingerprint`,String(BigInt.asIntN(64,Gu()))],[`install`,`unknown`]]);case`revision`:{let e=/* @__PURE__ */ new Date;return p_([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,Is(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Is(C_(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return d_(void 0);case`all`:return w_(t.registers);case`all:named`:return w_(u_(t))}if(n.startsWith(`s:`)){let r=u_(t).get(n);if(r===void 0)throw new e.A(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return Is(t.properties.get(n.slice(2))??n);throw new e.A(`TLCGet(${n}) was undefined.`)},k_=(t,n,r)=>{if(typeof n==`number`&&n>=0){let r=t.registers.get(n);if(r===void 0)throw new e.A(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new e.A(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${U(q(n))}`);return O_(t,n,r?.state)},A_=e=>e.length===0?[[]]:e.flatMap((t,n)=>A_([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),j_=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&G(e).elements.forEach(j_),e.kind===`Function`&&e.range.forEach(j_))},M_=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`Function`:return e.functionClass===void 0?e:$s(e.domain,e.range);case`ModelValue`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return K(e);default:return G(e)}},N_=(t,n)=>[Y(`Print`,2,e=>(t(Ru([J(e,0,`Print`),J(e,1,`Print`)]).map(U).join(` `)),J(e,1,`Print`))),Y(`PrintT`,1,e=>(t(U(Ru([J(e,0,`PrintT`)])[0])),!0)),Y(`Assert`,2,t=>{if(J(t,0,`Assert`)!==!0)throw new e.A(`The first argument of Assert evaluated to FALSE; the second argument was:\n${U(q(J(t,1,`Assert`)))}`,e.nt.assertViolation);return!0}),Y(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),Y(`:>`,2,e=>Jc([[J(e,0,`:>`),J(e,1,`:>`)]])),Y(`@@`,2,e=>{let t=J(e,0,`@@`),n=J(e,1,`@@`),r=as(t)?K(t):void 0,i=as(n)?K(n):void 0;if(!r)throw xf(`first`,`@@`,`function`,t);if(!i)throw xf(`second`,`@@`,`function`,n);let a=ps(r),o=ps(i).filter(e=>!a.some(t=>zc(e[0],t[0])));return Yc([...a,...o])}),Y(`ToString`,1,e=>Is(q(J(e,0,`ToString`),!0))),{...Gf(`TLCEval`,1,(e,t)=>{let n=M_(Kf(e,0,`TLCEval`)());return t===void 0&&j_(n),n}),isStateLevel:!1},Y(`Permutations`,1,e=>{let t=Sf(J(e,0,`Permutations`),`Permutations`).elements;return Hc(A_(t).map(e=>Jc(t.map((t,n)=>[t,e[n]]))))}),Df(`SortSeq`,2,e=>{let t=J(e,0,`SortSeq`),n=Il(t);if(!n)throw xf(`first`,`SortSeq`,`natural number`,t);let r=Tf(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw xf(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t=a.length;for(;t>0&&i(e,a[t-1]);)t--;a.splice(t,0,e)}),al(a)}),n.version===`1.7.4`?zf({...Of(`TLCGet`,1,(e,t)=>k_(n,J(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):zf(Gf(`TLCGet`,1,(e,t)=>k_(n,Kf(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),Of(`TLCSet`,2,e=>(__(n,t,J(e,0,`TLCSet`),J(e,1,`TLCSet`)),!0)),Ef(`Any`,Us),Y(`RandomElement`,1,e=>$g(J(e,0,`RandomElement`),n.getRandom()))],P_=`----------------------------- MODULE Bags --------------------------------
|
|
404
414
|
(**************************************************************************)
|
|
405
415
|
(* A bag, also called a multiset, is a set that can contain multiple *)
|
|
406
416
|
(* copies of the same element. A bag can have infinitely many elements, *)
|
|
@@ -553,7 +563,7 @@ CopiesIn(e, B) ==
|
|
|
553
563
|
7 Dec 98 : Corrected error found by Stephan Merz.
|
|
554
564
|
6 Dec 98 : Modified comments based on suggestions by Lyle Ramshaw.
|
|
555
565
|
5 Dec 98 : Initial version.
|
|
556
|
-
`,
|
|
566
|
+
`,F_=/* @__PURE__ */ new Map([[`Bags`,P_],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
|
|
557
567
|
(***************************************************************************)
|
|
558
568
|
(* The two definitions in this standard module are overridden by TLC in *)
|
|
559
569
|
(* the Java class tlc2.module.FiniteSets. Each operator is overridden by *)
|
|
@@ -1685,7 +1695,7 @@ _TLCTrace ==
|
|
|
1685
1695
|
/\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
|
|
1686
1696
|
|
|
1687
1697
|
=============================================================================
|
|
1688
|
-
`]]),
|
|
1698
|
+
`]]),I_=new Map([...[...F_].filter(e=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e[0])),[`Bags`,P_.replace(`
|
|
1689
1699
|
LOCAL INSTANCE Naturals
|
|
1690
1700
|
`,`
|
|
1691
1701
|
EXTENDS TLC
|
|
@@ -1777,14 +1787,12 @@ _TEPosition ==
|
|
|
1777
1787
|
ELSE TLCGet("level") + 1
|
|
1778
1788
|
|
|
1779
1789
|
=============================================================================
|
|
1780
|
-
`]]),Df=(e=`master`)=>e===`1.7.4`?Ef:Tf,Of=(e,t)=>e.every(e=>gi(e,t)),kf=_r([!1,!0]);fr(kf);const Af=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Sr(Af(e,t,r),Af(e,r,n))},jf=[`\\cup`,`\\cap`,`\\`],Mf=e=>typeof e==`object`&&e.kind===`MixedSet`,Nf=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,Pf=(e,t,n)=>{t.kind===`Interval`&&oi(t);let r=t.kind===`Interval`?t:dr(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return At(r,e=>{gi(e,n)===i&&Ot(a,e)}),Nf(t)?Sn(a):vr(a)}if(ri(t))return n;if(!jt(n))return An({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return At(r,e=>Ot(i,e)),At(n.kind===`Interval`?n:F(n).elements,e=>{gi(e,t)||Ot(i,e)}),vr(i)},Ff=(e,t)=>{let n=(t,n)=>Eo([Yo(t,n,e)()],0,e);return{...z(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},If=[Oo(`TRUE`,!0),Oo(`FALSE`,!1),Oo(`BOOLEAN`,kf),Oo(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),jo(`=`,mr),jo(`#`,(e,t)=>!mr(e,t)),z(`~`,1,e=>!Eo(e,0,`~`)),z(`<=>`,2,e=>Eo(e,0,`<=>`)===Eo(e,1,`<=>`)),Ff(`/\\`,(e,t)=>e&&t()),Ff(`\\/`,(e,t)=>e||t()),Ff(`=>`,(e,t)=>!e||t()),z(`\\in`,2,e=>gi(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!gi(R(e,0,`\\notin`),R(e,1,`\\notin`))),jo(`\\subseteq`,(t,n)=>{if(!j(t))throw new e.b(`\\subseteq expects a set but received ${L(t)}`);if(typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&P(t.base))return Of(F(t.base).elements,n.base);if(typeof t==`object`&&t.kind===`Interval`){if(typeof n==`object`&&n.kind===`Interval`&&n.low<=t.low&&n.high>=t.high)return!0;for(let e=t.low;e<=t.high;e++)if(!gi(e,n))return!1;return!0}return!Zr(t,e=>!gi(e,n))}),...jf.map(t=>z(t,2,n=>{let r=R(n,0,t),i=R(n,1,t),a=t!==`\\cup`&&typeof i==`object`&&i.kind===`Interval`&&typeof r==`object`&&r.kind!==`Interval`;if(jt(r)&&jt(i)&&!Mf(r)&&!Mf(i)&&!a&&!kt(r)&&!kt(i)){if(t===`\\cup`&&ri(r))return i;let n=t===`\\cup`?Sr:t===`\\cap`?xr:br;return mi((r,i)=>{let a=F(r),o=F(i),s=n(a,o);if(t===`\\cup`){let t=dr(a),n=br(o,a).elements,r=t===a.elements&&(n.length===0||gn(t[t.length-1],n[0])<0);if(t.length+n.length>Et())throw new e.N(Dt());if(r&&!a.isNormalized)return s;let i=s===a?xn(s.elements):s;return r||(i.writtenElements=[...t,...n]),i}return s===r||(s.isNormalized=Nf(r),a.writtenElements&&!a.isNormalized&&(s.writtenElements=a.writtenElements.filter(e=>gi(e,s)))),s},(e,n)=>Pf(t,e,n),r,i)}return jt(r)?Pf(t,r,i):t!==`\\`&&jt(i)?Pf(t,i,r):An({kind:`SetOperation`,operator:t,left:r,right:i})})),z(`SUBSET`,1,e=>({kind:`Subset`,base:R(e,0,`SUBSET`)})),z(`UNION`,1,e=>{let t=R(e,0,`UNION`),n=Mt(t)?dr(t):[],r=n.filter(Mt);if(!Mt(t)||r.length!==n.length)return An({kind:`Union`,base:t});let i=r.flatMap(dr),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{gi(t,e)||Ot(e.elements,t)}),vr(e.elements)};return Mf(t)||r.some(Mf)?a():r.length===0?yr:mi(e=>ui(Af(e,0,e.length),i),a,r.map(F),void 0)}),z(`DOMAIN`,1,t=>{let n=R(t,0,`DOMAIN`);if(!M(n))throw new e.b(`DOMAIN expects a function but received ${L(n)}`);return Fi(n)})],Lf=Wo(`Integers`,`Neg`,`IntValue`,1),Rf=t=>{let n=Wo(t,`DotDot`,`IntervalValue`,2);return[Go(t,`+`,`Plus`,(e,t)=>e+t),Go(t,`-`,`Minus`,(e,t)=>e-t),Go(t,`*`,`Times`,(e,t)=>e*t),Go(t,`^`,`Expt`,(t,n)=>{if(n<0)throw new e.O(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(t===0&&n===0)throw new e.O(`0^0 is undefined.`);return t**n}),Go(t,`\\div`,`Divide`,(t,n)=>{if(n===0)throw new e.O(`The second argument of \\div is 0.`);let r=Math.floor(t/n);if(Mo(r))throw No(`${t} \\div ${n}`);return r}),Go(t,`%`,`Mod`,(t,n)=>{if(n<=0)throw new e.O(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(t%n+n)%n}),z(`..`,2,e=>{let t=R(e,0,`..`),r=Uo(R(e,1,`..`),n);return{kind:`Interval`,low:Uo(t,n),high:r}})]},zf=Rf(`Naturals`),Bf=Rf(`Integers`),Vf=e=>{let t=zf.indexOf(e);return t===-1?void 0:Bf[t]},Hf=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[Ho(qo(`<`,(e,t)=>e<t),t(`LT`)),Ho(qo(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),Ho(qo(`<=`,(e,t)=>e<=t),t(`LE`)),Ho(qo(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},Uf=[Oo(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...zf,...Hf(`Naturals`)],Wf=[Oo(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Bf,...Hf(`Integers`),z(`-.`,1,e=>{let t=Uo(R(e,0,`-`),Lf);if(Mo(-t))throw No(`-${t}`);return-t})],Gf=(t,n,r)=>{let i=R(t,n,r),a=di(i);if(!a)throw new e.O(`${r}\n${L(i)}`);return a},Kf=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:Gf(e,t,n)},qf=(e,t,n)=>{let r=R(e,t,`SubSeq`);if(typeof r!=`number`)throw Co(n,`SubSeq`,`natural number`,r);return r},Jf=(e,t,n)=>typeof e==`string`?on(e.slice(t,n)):Pr(e.slice(t,n)),Yf=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Xf=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Zf=(e,t)=>{let n=Cf.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Ho(e,t):e}):t},Qf=t=>Zf(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>Kf(e,0,Yf(``,`Len`)).length),z(`\\o`,2,t=>{let n=Kf(t,0,Xf(`s \\o t`,`sequence`));if(typeof n!=`string`){let e=Gf(t,1,Xf(`t \\o s`,`sequence`));return Pr([...n,...e])}let r=R(t,1,`\\o`);if(typeof r!=`string`)throw new e.O(`${Xf(`t \\o s`,`string`)}\n${L(r)}`);return on(n+r)}),z(`Append`,2,e=>Pr([...Gf(e,0,Xf(t===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(e,1,`Append`)])),z(`Head`,1,t=>{let n=Gf(t,0,Yf(``,`Head`));if(n.length===0)throw new e.O(`Attempted to apply Head to the empty sequence.`);return n[0]}),z(`Tail`,1,t=>{let n=Kf(t,0,Yf(``,`Tail`));if(n.length===0)throw new e.O(`Attempted to apply Tail to the empty sequence.`);return Jf(n,1)}),z(`SubSeq`,3,t=>{let n=Kf(t,0,Yf(`first `,`SubSeq`)),r=qf(t,1,`second`),i=qf(t,2,`third`);if(r>i)return Jf(n,0,0);let a=r<1||r>n.length?{position:`second`,value:r}:i>n.length?{position:`third`,value:i}:void 0;if(a)throw new e.O(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${L(R(t,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return Jf(n,r-1,i)}),ko(`SelectSeq`,2,t=>{let n=Do(t,1,`SelectSeq`);return Pr(Gf(t,0,Yf(`first `,`SelectSeq`)).filter(t=>{let r=n.call([t]);if(typeof r!=`boolean`)throw new e.O(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${n.name}>`);return r}))})]),$f=t=>Zf(`FiniteSets`,[z(`IsFiniteSet`,1,t=>{let n=R(t,0,`IsFiniteSet`);if(j(n))return ci(n);if(typeof n==`object`&&n.kind===`Function`)return!0;throw new e.b(typeof n==`object`&&n.kind===`LazyFunction`?`Attempted to check if the function:\n${L(n)}\nis a finite set.`:`Attempted to check if the ${Nt(n)} ${L(n)} is a finite set.`)}),z(`Cardinality`,1,n=>{let r=R(n,0,`Cardinality`);if(!j(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new e.O(`Attempted to compute cardinality of the value\n${L(r)}`);return oi(r,t)})]),ep=[Ho(z(`Warshall`,1,t=>{let n=R(t,0,`Warshall`);if(!j(n)||ln(n))throw new e.O(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${L(n)}`);oi(n);let r=[],i=/* @__PURE__ */ new Map,a=e=>{let t=ea(e),n=i.get(t)??r.length;return n===r.length&&(i.set(t,n),r.push(e)),n},o=F(n).elements.map(t=>{let n=di(t);if(n?.length!==2)throw new e.O(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${L(t)}`);return[a(n[0]),a(n[1])]}),s=r.map(()=>r.map(()=>!1));o.forEach(e=>{s[e[0]][e[1]]=!0});for(let e=0;e<r.length;e++)for(let t=0;t<r.length;t++)if(s[t][e])for(let n=0;n<r.length;n++)s[e][n]&&(s[t][n]=!0);return vr(r.flatMap((e,t)=>r.flatMap((n,r)=>s[t][r]?[Pr([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],tp=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return ep;if(e===`AnySet`)return[Oo(`ANY`,pn)];if(e===`IOUtils`)return fd(r,a);if(e===`_TLCTrace`)return hd(r);if(!Df(n.version).has(e))return;let o=rp(e,t,n,r,i)?.operators;return e===`Randomization`&&o?[...o,Vd(n)]:o},np=/* @__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`]]]),rp=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:Uf};case`Integers`:return{extends:[`Naturals`],operators:Wf};case`Sequences`:return{extends:[],operators:Qf(n.version)};case`FiniteSets`:return{extends:[],operators:$f(n.version)};case`TLC`:return{extends:[],operators:Zf(`TLC`,gf(t,n))};case`Randomization`:return{extends:[],operators:Hd(n)};case`_Possible`:return{extends:[],operators:nf(t,n)};case`Json`:return{extends:[],operators:dd(r)};case`Bags`:return{extends:[],operators:Zf(`Bags`,Lu(i))};case`TLCExt`:return{extends:[],operators:Zf(`TLCExt`,tf(t,n))};default:return}},ip=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&Ic.get(t)||[];r.expressions.push(...i,t);let a=pi.sets,o=a??[],s=o.length;pi.sets=o;try{return n()}catch(e){throw Mg(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,pi.sets=a}},ap=(e,t,n)=>e.coverage?to(e.coverage,t,n):-1,op=(e,t,n)=>e.coverage?ro(e.coverage,t,n):n(),sp=(e,t,n,r)=>op(e,t,()=>W(n,r)),cp=(e,t,n,r)=>{let i=sp(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},lp=(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},up=e=>!e.includes(void 0),dp=e=>e.variables.map(()=>void 0),fp=(e,t,n)=>{let r=[...e];return r[t]=n,r},pp=(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}},mp=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,hp=e=>e.kind===`Identifier`?e.name:void 0,gp=(e,t,n)=>{if(t.kind===`Label`)return gp(e,t.body,n);let r=hp(t);if(r===void 0)return;let i=gh(n,r);if(i?.kind===`Thunk`)return gp(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=og(r,e);return o?.kind===`Closure`&&o.params.length===0?gp(e,o.body,o.scope):void 0},_p=(e,t,n)=>{if(t.kind===`Prime`)return gp(e,t.expression,n);if(t.kind===`Label`)return _p(e,t.body,n);let r=hp(t);if(r===void 0)return;let i=gh(n,r);if(i?.kind===`Thunk`)return _p(e,i.expression,i.scope);if(i)return;let a=og(r,e);return a?.kind===`Closure`&&a.params.length===0?_p(e,a.body,a.scope):void 0},vp=t=>{if(typeof t!=`boolean`)throw new e.b(`TLC expected a boolean expression.`);return t},yp=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),bp=(e,t,n,r)=>{let i=Sp(e,t,n,r);return i&&e.coverage&&!e.isInit&&no(e.coverage,r),i},xp=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(no(r,n),no(r,r.roots[n])),e.onState(t),!0},Sp=(e,t,n,r)=>t===void 0?up(n)?xp(e,n,r):(e.onIncomplete?.(n),!1):up(n)&&yp(e)?wp(e,t,n,r):t.kind===`Predicate`?Tp(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?Vp(e,t.expression,t.rest,t.scope,n,t.node):Cp(e,t,n)&&bp(e,t.rest,n,t.node),Cp=(e,t,n)=>{let r=e.environment,i=sp(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return sp(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?hh(t,r.runtime.version):t}})();try{return!mr(i,a)}catch(t){throw e.callStack&&Mg(e.callStack,[i],t),t}},wp=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return Vp(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?Cp(e,i,n):vp(sp(e,i.node,i.expression,lp(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return xp(e,n,r)},Tp=(e,t,n,r,i,a)=>Ep(e,t,n,r,i,ap(e,a,t)),Ep=(t,n,r,i,a,o)=>ip(t,n,()=>{switch(n.kind){case`Let`:{let e=lp(t,i,a),s=n.definitions,c=t.coverage?Cg(s,e,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):Cg(s,e);return Tp(t,n.body,r,c,a,o)}case`Label`:return Tp(t,n.body,r,i,a,o);default:if(Fp.has(n.kind))throw new e.b(`The state relation is not a boolean expression.`);return ip(t,n,()=>zp(t,n,r,i,a,o))}}),Dp=(e,t,n,r,i)=>vp(t)&&bp(e,n,r,i),Op=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),kp=(e,t,n,r,i,a)=>{let o=lp(e,r,i);if(t.kind===`Identifier`){let s=gh(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return Tp(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return Tp(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:og(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&hu(c,e.environment))?Tp(e,l.body,n,l.scope,i,a):Dp(e,cp(e,a,t,o),n,i,a)}let s=sg(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=op(e,a,()=>yg(s,t.args,o));return Tp(e,s.body,n,r,i,a)}let c=Op.has(t.operator)?sp(e,a,t,o):cp(e,a,t,o);return Dp(e,c,n,i,a)},Ap=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?bp(e,t,fp(n,r,i),a):mr(o,i)&&bp(e,t,n,a)},jp=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),Mp=(e,t,n)=>(e.coverage&&io(e.coverage,t,n.length+1),n),Np=(t,n,r,i,a,o)=>{let[s,c]=n.args,l=t.isInit?gp(t.environment,s,i):_p(t.environment,s,i),u=lp(t,i,a);if(l===void 0)return sp(t,o,n,u)===!0&&bp(t,r,a,o);let d=sp(t,o,c,u),f=a[l];if(n.operator===`=`)return Ap(t,r,a,l,d,o);let p=n.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(typeof p==`object`&&p!==d&&t.callStack?.sources.set(p,c),f!==void 0)return sp(t,o,n,u)===!0&&bp(t,r,a,o);if(!Lr(p))throw new e.b(`The right side of \\IN is not enumerable.`);return Mp(t,p,Qr(p)).reduce((e,n)=>bp(t,r,fp(a,l,n),o)||e,!1)},Pp=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Fp=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Ip={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},Lp=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:Ip[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${H(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${H(e)}`:`In computing ENABLED, TLC encountered unbounded quantifier. Make sure that the expression is of form ${e.quantifier===`Forall`?`\\A`:`\\E`} x \\in S: P(x).\n${H(e)}`;if(e.kind===`Choose`&&e.set===void 0)return`In computing ENABLED, TLC encountered unbounded CHOOSE. Make sure that the expression is of form CHOOSE x \\in S: P(x).\n${H(e)}`},Rp=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=op(e,r,()=>Ih(t.bounds,t=>{let r=W(t,n),i=Nh(r,t,a);return Array.isArray(i)&&Mp(e,r,i),i}));return Rh(t.bounds,o,n.scope,e=>(i.push(e),!1)),i},zp=(t,n,r,i,a,o)=>{let s=lp(t,i,a);switch(n.kind){case`Identifier`:return kp(t,n,r,i,a,o);case`Apply`:return Pp.has(n.operator)&&n.args.length===2?Np(t,n,r,i,a,o):n.operator===`=>`&&n.args.length===2?vp(sp(t,o,n.args[0],s))?Tp(t,n.args[1],r,i,a,o):bp(t,r,a,o):kp(t,n,r,i,a,o);case`And`:{let e=n.operands;if(n.isBulleted||e.length===2){let n=e.slice(1).reduceRight((e,t)=>jp(`Predicate`,t,i,o,e),r);return Tp(t,e[0],n,i,a,o)}let s=e[e.length-1];return Ep(t,pp(n,e.length-1),jp(`Predicate`,s,i,o,r),i,a,mp(t,o))}case`Or`:{let e=n.operands;if(n.isBulleted||e.length===2)return e.reduce((e,n)=>Tp(t,n,r,i,a,o)||e,!1);let s=Ep(t,pp(n,e.length-1),r,i,a,mp(t,o)),c=Tp(t,e[e.length-1],r,i,a,o);return s||c}case`Exists`:return Rp(t,n,s,o).reduce((e,i)=>Tp(t,n.body,r,i,a,o)||e,!1);case`Forall`:{let e=Rp(t,n,s,o);if(e.length===0)return bp(t,r,a,o);let i=e.slice(1).reduce((e,t)=>jp(`Predicate`,n.body,t,o,e),r);return Tp(t,n.body,i,e[0],a,o)}case`If`:return Tp(t,vp(sp(t,o,n.condition,s))?n.consequent:n.alternative,r,i,a,o);case`Case`:{let c=n.arms.find(e=>vp(sp(t,o,e.condition,s)))?.body??n.other;if(c===void 0)throw new e.b(`TLC encountered a CASE with no conditions true.`);return Tp(t,c,r,i,a,o)}case`FunctionApplication`:{let e=Wh(sp(t,o,n.function,t.isInit?s:bh(s)));if(e){let i=op(t,o,()=>Gh(e,n,s));return Tp(t,e.body,r,i,a,o)}break}case`Unchanged`:if(!t.isInit)return Vp(t,n.expression,r,i,a,o);break;case`BoxAction`:if(!t.isInit){let e=Tp(t,n.action,r,i,a,o);return Vp(t,n.subscript,r,i,a,o)||e}break;case`AngleAction`:if(!t.isInit)return Tp(t,n.action,jp(`Changed`,n.subscript,i,o,r),i,a,o)}let c=t.isEnabled?Lp(n):void 0;if(c!==void 0)throw new e.b(c);return Dp(t,sp(t,o,n,s),r,a,o)},Bp=(e,t,n)=>e.runtime.warn(Ke.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${H(n)}`),Vp=(e,t,n,r,i,a)=>ip(e,t,()=>{let o=ap(e,a,t),s=gp(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;let a=i[s];return a!==void 0&&!mr(a,r)?(Bp(e.environment,s,t),!1):Ap(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return bp(e,n,i,o);let c=s.reduceRight((e,t)=>jp(`Unchanged`,t,r,o,e),n);return Vp(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=gh(r,t.name);if(a?.kind===`Thunk`)return Vp(e,a.expression,n,a.scope,i,o);let s=a?void 0:og(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return Vp(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=lp(e,r,i),s=sg(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return Vp(e,s.body,n,yg(s,t.args,a),i,o)}let c=e.environment,l=sp(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=sp(e,o,t,{environment:c,scope:r,state:i,next:void 0});return mr(l,u)&&bp(e,n,i,o)}),Hp=(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}),Up=/* @__PURE__ */ Error(`The replay found a successor`),Wp=(e,t,n,r)=>{let i=Hp(r,!1,n,()=>{throw Up},!0),a=i.callStack,o=a?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=jp(`Changed`,e.subscript,t,-1,void 0);Tp(i,e.action,n,t,dp(r),-1)}else Tp(i,e,void 0,t,dp(r),-1);return!1}catch(e){if(e!==Up)throw e;return a&&(a.expressions.length=o,a.isFrozen=!1),!0}},Gp=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=Hp(t,!0,void 0,n,!1,r),s=a.reduceRight((e,t)=>jp(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);Tp(o,i.expression,s,i.scope,dp(t),i.node??-1)},Kp=(e,t,n,r)=>{e.some(e=>Fp.has(e.expression.kind))||e.forEach(e=>{let i=[];qp(e,-1,t,n,e=>i.push(e)),i.forEach(t=>r(t,e))})},qp=(e,t,n,r,i,a)=>{let o=Hp(r,!1,n,i,!1,a);Tp(o,e.expression,void 0,e.scope,dp(r),t)},Jp=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(gp(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=gh(r,e.name)?void 0:og(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,Cg(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`){_p(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=gh(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?sg(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:og(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,yg(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??[])},Yp=/* @__PURE__ */ new WeakMap,Xp=/* @__PURE__ */ new WeakMap,Zp=(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},Qp=(e,t,n)=>{let r=e.slice();return r[t]=n,r},$p=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,em=(t,n)=>{let r=new e.b(n);return t.isInit?r:e.it(r,e.tt.error)},tm=(e,t,n,r)=>{let i=ah(n);return r&&Fp.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 ${$p(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},nm=(e,t,n)=>{let r=zo(t),i=H(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${$p(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
1781
|
-
`:``}${i}`},rm=(e,t,n)=>om(e,t,W(t,n)),im=new Set(If.map(e=>e.name)),am=e=>e.kind===`Apply`?im.has(e.operator):e.kind!==`Identifier`&&!Fp.has(e.kind),om=(t,n,r,i=!0)=>{if(typeof r==`boolean`)return r;let a=tm(t,r,n,i);throw t.isInit&&i&&am(n)?new e.z(a):em(t,a)},sm=(e,t,n,r)=>r.environment.callStack?W(n,r):(e[t]??=Lg(n,r.environment))(r),cm=e=>e===`=`||e===`\\in`||e===`\\subseteq`,lm=(e,t,n)=>{let r=n?Yp:Xp,i=r.get(e);if(i)return i;let a=Um(e,t,n),o=n?void 0:Hm(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},um=(e,t)=>{if(t.constants.has(e))return;let n=Dh(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},dm=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return dm(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=um(e.name,t);if(a&&!r.has(a))return r.add(a),dm(a.body,t,n,r)},fm=(e,t,n)=>dm(e,t,!n),pm=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return pm(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Cg(e.definitions,Zp(r,t,n));return pm(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=gh(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return pm(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=um(e.name,r.environment);if(s)return pm(s.body,void 0,n,r,i)},mm=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||O(e))||!t&&e.kind===`Prime`,hm=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>hm(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=um(e.name,t);if(i)return n.add(e.name),hm(i.body,t,n)},gm=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),_m=(e,t,n)=>gm.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||cm(e.operator)&&(mm(e.args[0],n)||fm(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,vm=/* @__PURE__ */ new Set,ym=(e,t)=>{if(O(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return Wc(e,(e,i)=>{let a=r?ym(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r=!1,e}),r?n:void 0},bm=(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:Dh(r,t);return i&&!n.has(i)&&(n.add(i),bm(i.body,t,n))?!0:Be(e).some(e=>bm(e,t,n))},xm=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=fm(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=hm(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return _m(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:lm(e,t,n)}},Sm=(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(bu(e,t)===void 0||bm(e,t,/* @__PURE__ */ new Set))return!0;let n=ym(e,vm);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)}},Cm=(e,t,n)=>{let r=e.map(e=>xm(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=yp(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Gm(u)){d??=Zp(t,n,u);for(let e=s;e<r.length;e++){let n=r[e],i=t.current,o=i&&n.kind===`Unchanged`?n.variables.find(e=>{let t=u[e.index];return t!==void 0&&!mr(t,i[e.index])}):void 0;if(o){Bp(t.environment,o.index,o.expression);return}let s=n.expression,c=sm(a,e,s,d);if(!om(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=Zp(t,n,u);let r=sm(i,s,e.expression,d);if(!om(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=Zp(t,n,u);let r=sm(i,s,e.value,d),a=u[e.index];if(a===void 0)u=Qp(u,e.index,r),d=void 0;else if(!mr(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let i of e.variables){let e=(r??u)[i.index];if(e===void 0)r??=u.slice(),r[i.index]=n[i.index];else if(!mr(e,n[i.index])){Bp(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)},wm=e=>{let t=Lp(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw em(n,t);rm(n,e,Zp(n,r,i))&&s(i,a)}},Tm=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Zp(r,i,a);if(a[l]!==void 0){rm(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Lr(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${$p(r)}, the right side of \\IN is not enumerable.`;throw em(r,`${t}\n${H(e)}`)}let p=Qr(f);if(r.generator){for(let e of Nd(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(Qp(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(Qp(a,l,p[e]),o)}},Em=/* @__PURE__ */ new WeakMap,Dm=e=>{let t=Em.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Dm),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Em.set(e,n),n},Om=(e,t)=>{let n=e.args[0],r=wm(e),i=(e,r,i)=>pm(n,r,i,e,!t)??-1,a=Tm(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=W(e.args[1],Zp(t,n,o));l(Qp(o,u,d),s)}},km=(e,t,n)=>{let r=H(e);return(i,a,o,s,c,l)=>{let u=Zp(i,a,o),d=W(e.function,n?u:bh(u)),f=Wh(d);if(f!==void 0){lm(f.body,t,n)(i,Gh(f,e,u),o,s,c,l);return}if(!M(d))throw em(i,`In computing ${$p(i)}, a non-function (${zo(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw em(i,`In computing ${$p(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Am=(e,t)=>{if(hm(e,t))return Cm([Dm(e)],t,!1);if(e.kind===`Tuple`)return lm(Dm(e),t,!1);let n=Dm(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?gh(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){lm(Dm(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=Zp(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=sg(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){lm(Dm(n.body),t,!1)(r,yg(n,e.args,u),a,o,s,c);return}}rm(r,n,u)&&c(a,o)}},jm=(e,t,n)=>{let r=e.operator,i=wm(e),a=O(e)?void 0:og(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Hg(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=lm(a.body,t,n),o(e,i(Zp(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Zp(a,o,s),f=sg(e,d);f?.kind===`Closure`?lm(f.body,t,n)(a,yg(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Mm=(e,t,n)=>{let r=wm(e),i=O(e)?void 0:um(e.name,t),a;return(o,s,c,l,u,d)=>{let f=gh(s,e.name);f?.kind===`Thunk`&&!f.isReleased?lm(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&tg(i,t)!==void 0?r(o,s,c,l,u,d):(a??=lm(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},Nm=(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=dm(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},Pm=e=>e.kind===`And`?e.operands.flatMap(Pm):[e],Fm=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&_m(e,t,!1),Im=e=>{let t=[];return(n,r,i)=>{let a=Zp(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!om(n,i,sm(t,r,i,a)))return}}},Lm=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=Pm(e),r=n.findIndex(e=>!Fm(e,t)||Nm(e,t)),i=r===-1?void 0:Nm(n[r],t);return i?{...i,before:r===0?void 0:Im(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>Lm(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=og(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Lm(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&&Hg(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(Zp(e,t,n)),n))}},Rm=(e,t,n)=>{let r=gh(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},zm=(e,t,n)=>{let r=e.map(e=>lm(e,t,n)),i=n?[]:e.map(e=>Lm(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&&Rm(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)}}},Bm=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=Cd(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},Vm=(e,t)=>{let n=lm(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=Zp(r,i,a),u=t.runtime.version,d=Ih(e.bounds,e=>W(e,l)).map((n,r)=>Nd(jh(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,vh(i,l,e)))};f(d.length-1,i)}},Hm=(e,t)=>{if(e.kind===`Exists`)return Vm(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>lm(e,t,!1));return e.isBulleted?Bm(n):n.reduce((e,t)=>Bm([e,t]))},Um=(t,n,r)=>{let i=e=>lm(e,n,r);switch(t.kind){case`And`:return Cm(t.operands,n,r);case`Or`:return zm(t.operands,n,r);case`Exists`:{let e=i(t.body),a=t.bounds[0];if(t.bounds.length===1&&a.pattern.kind===`Name`){let t=a.pattern.name;return(r,i,o,s,c,l)=>{let u=jh(W(a.set,Zp(r,i,o)),a.set,n.runtime.version);for(let n=0;n<u.length&&!r.isStopped;n++)e(r,_h(i,t,u[n]),o,s,c,l)}}let o=r?void 0:Sm(t,n);if(o){let e=Cm(o.rest,n,r);return(r,i,a,s,c,l)=>{let u=Zp(r,i,a),d=Ih(t.bounds,e=>jh(W(e,u),e,n.runtime.version));if(d.some(e=>e.length===0))return;let f=(t,n)=>{if(t<0)e(r,n,a,s,c,l);else for(let e of d[t]){if(r.isStopped)return;let i=_h(n,o.names[t],e);if(t===d.length-1){let e=Zp(r,i,a);if(!o.guards.every(t=>rm(r,t,e)))continue}f(t-1,i)}};f(d.length-1,i)}}return(n,r,i,a,o,s)=>{zh(t.bounds,Zp(n,r,i),t=>(e(n,t,i,a,o,s),n.isStopped))}}case`Forall`:{let e=i(t.body),a=!r&&bu(t,n)!==void 0&&!bm(t.body,n,/* @__PURE__ */ new Set)?ym(t,vm):void 0;return(n,r,i,o,s,c)=>{let l=[];zh(t.bounds,Zp(n,r,i),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>gh(r,e)?.kind===`Value`)){u.every(e=>rm(n,t.body,Zp(n,e,i)))&&c(i,o);return}let d=(r,i,a)=>{r===u.length?c(i,a):r>0&&n.isInit&&Gm(i)?u.slice(r).every(e=>rm(n,t.body,Zp(n,e,i)))&&c(i,a):e(n,u[r],i,a,!0,(e,t)=>d(r+1,e,t))};d(0,i,o)}}case`If`:{let e=i(t.consequent),n=i(t.alternative);return(r,i,a,o,s,c)=>{let l=W(t.condition,Zp(r,i,a));if(typeof l!=`boolean`)throw em(r,nm(r,l,t));(l?e:n)(r,i,a,o,s,c)}}case`Case`:{let e=t.arms.map(e=>({condition:e.condition,source:e.body,body:i(e.body)})),n=t.other?i(t.other):void 0;return(r,i,a,o,s,c)=>{let l=Zp(r,i,a),u=e.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw em(r,`In computing ${$p(r)}, a non-boolean expression${r.isEnabled?``:` `}(${zo(t)}) was used as a guard condition of a CASE.\n${ah(e.source)}`)})?.body??n;if(!u)throw em(r,`In computing ${$p(r)}, TLC encountered a CASE with no conditions true.\n${H(t)}`);u(r,i,a,o,s,c)}}case`Let`:{let e=i(t.body),r=Tg(t.definitions,n);return(n,i,a,o,s,c)=>e(n,Cg(t.definitions,Zp(n,i,a),r),a,o,s,c)}case`Unchanged`:return r?()=>{throw new e.b(`UNCHANGED appears in an initial predicate at ${nh(t)}`)}:Am(t.expression,n);case`AngleAction`:{let e=i(t.action),r={kind:`Unchanged`,expression:t.subscript,location:t.subscript.location},a=(e,t,i)=>{try{return rm(e,r,Zp(e,t,i))}catch(t){throw e.isEnabled?hh(t,n.runtime.version):t}};return(t,n,r,i,o,s)=>e(t,n,r,i,o,(e,r)=>{a(t,n,e)||s(e,r)})}case`BoxAction`:return zm([t.action,Dm(t.subscript)],n,r);case`Label`:return i(t.body);case`Identifier`:return Mm(t,n,r);case`FunctionApplication`:return km(t,n,r);case`Apply`:{let e=t.args;if(cm(t.operator)){let i=fm(e[0],n,r);if(i!==void 0)return t.operator===`=`?Cm([t],n,r):Tm(t,()=>i);if(mm(e[0],r))return Om(t,r)}if(t.operator===`=>`){let n=i(e[1]);return(r,i,a,o,s,c)=>{let l=W(e[0],Zp(r,i,a));if(typeof l!=`boolean`){let e=zo(l),n=H(t);throw em(r,r.isInit?`In computing initial states of a predicate of form P => Q, P was ${e}\n.${n}`:r.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${e}.\n${n}`:`In computing next states of a predicate of the form P => Q, P was\n${e}.\n${n}`)}l?n(r,i,a,o,s,c):c(a,o)}}return jm(t,n,r)}default:return wm(t)}},Wm=e=>e.variables.map(()=>void 0),Gm=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Km=(t,n)=>{let r=n.state;if(!r||!Gm(r))throw new e.b(`ENABLED needs a complete state at ${nh(t)}`);let i=n.environment;if(i.callStack)return Wp(t,n.scope,r,i);let a={environment:i,isInit:!1,isEnabled:!0,current:r,isStopped:!1,generator:void 0,successors:0};return lm(t,i,!1)(a,n.scope,Wm(i),void 0,!1,()=>{a.isStopped=!0}),a.isStopped},qm=(t,n,r,i,a)=>{let o={environment:n,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};lm(t,n,!0)(o,i,Wm(n),void 0,!1,t=>{if(!o.isStopped){if(!Gm(t)){if(a){o.isStopped=a([...t]);return}throw e.it(new e.S([...t]),e.tt.error)}o.isStopped=r(t)}})},Jm=(e,t,n)=>{let r=[];return qm(e,t,e=>(r.push(e),!1),n),r},Ym=(t,n,r,i,a,o,s)=>{let c={environment:r,isInit:!1,isEnabled:!1,current:n,isStopped:!1,generator:o,successors:0,onUnsatisfied:s};return lm(t,r,!1)(c,a,Wm(r),void 0,!1,(t,n)=>{if(!c.isStopped){if(!Gm(t)){let i=r.variables.filter((e,n)=>t[n]===void 0);throw new e.C(`Successor state is not completely specified by action ${n??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,t,n,i)}c.successors++,c.isStopped=i({state:t,action:n})}}),c.successors},Xm=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return lm(e,n,!1)(i,r,Wm(n),void 0,!1,e=>{Gm(e)||(i.isStopped=!0)}),i.isStopped},Zm=(e,t,n,r)=>{let i=[];return Ym(e,t,n,e=>(i.push(e),!1),r),i},Qm=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),$m=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),eh=e=>$m.has(e.kind)||e.kind===`Apply`&&Qm.has(e.operator),th=(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&&jt(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},nh=e=>`line ${e.location.line}, column ${e.location.column}`,H=t=>{let n=t.location.range;return n?e.X(n):nh(t)},rh={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},ih=(t,n)=>new e.b(`TLC encountered a temporal formula (${t}) when evaluating a predicate or action.\n${H(n)}`),ah=e=>e.kind===`Number`?e.text??String(e.value):H(e),oh=(t,n)=>new e.b(`A non-boolean expression (${zo(n)}) was used as the condition of an IF.\n${H(t)}`),sh=(t,n,r)=>{let i=t.location.range;if(i?.start.line===t.location.line&&i.start.column===t.location.column||!i)return new e.b(`A non-boolean expression (${zo(r)}) was used as a formula in a ${t.kind===`And`?`conjunction`:`disjunction`}.\n${ah(t.operands[n])}`);let a=t.prefixEnds?.[Math.max(n,1)-1]??i.end;return new e.b(`Attempted to evaluate an expression of form P ${t.kind===`And`?`/\\`:`\\/`} Q when ${n===0?`P`:`Q`} was\n${zo(r)}.\n${H({...t,location:{...t.location,range:{...i,end:a}}})}`)},ch=t=>{let n=t.field,r=e=>`Attempted to select nonexistent field "${n}" from the record\n${A(L(e))}\n${H(t)}`,i=e=>`Attempted to apply function:\n${A(L(e))}\nto argument "${n}", which is not in the domain of the function.`;return a=>{if(!M(a))throw new e.b(`Attempted to select field "${n}" from a non-record value ${A(L(a))}\n${H(t)}`);let o=En(a);if(o===`tuple`)throw Di(n);return Ni(a.kind===`LazyFunction`?I(a):a,n,o===`record`?r:i)}},lh=e=>e===`1.7.4`?(t,n)=>wi(t,n,e):void 0,uh=t=>n=>{if(!M(n))throw new e.b(`Attempted to apply the operator DOMAIN to a non-function\n(${zo(n)})\n${H(t)}`);return Fi(n)},dh=(t,n)=>(r,i)=>{if(!j(r)||ln(r))throw new e.b(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${H(t)}`);return n.evaluateBinary?n.evaluateBinary(r,i):n.evaluate([r,i])},fh=t=>e.it(new e.b(`TLC can't handle real numbers.\n${t.text}`),e.tt.configParseError),ph=t=>e.it(new e.b(`TLC can't handle a number this big.\n${t.text??t.value}`),e.tt.error),mh=(t,n)=>new e.R(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${H(n)}`,t),hh=(t,n)=>t instanceof e.R&&n!==`1.7.4`?new e.b(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${t.variable} occurring in the state formula v.\n`):t,gh=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},_h=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),vh=(t,n,r)=>{if(n.kind===`Name`)return _h(t,n.name,r);let i=di(r);if(!i||i.length!==n.names.length){let t=n.ranges?.[0];throw new e.b(`Argument mismatch in operator application.${t?e.X(t):``}`)}return n.names.reduce((e,t,n)=>_h(e,t,i[n]),t)},yh=(t,n)=>{if(M(t))return t;throw new e.b(`A non-function (${zo(t)}) was applied as a function.\n${H(n)}`)},bh=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},xh=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),Sh=(t,n)=>{if(typeof t!=`boolean`)throw new e.b(`Expected ${n} to be a boolean but found ${L(t)}`);return t},Ch=(t,n,r)=>{if(typeof t!=`boolean`)throw new e.b(`Attempted to evaluate an expression of form P => Q when ${r} was\n${zo(t)}.\n${H(n)}`);return t},wh=(t,n)=>{if(typeof t!=`boolean`)throw new e.b(`Attempted to apply the operator ~ to a non-boolean\n(${zo(t)})\n${H(n)}`);return!t},Th=(t,n,r)=>{if(typeof t!=`boolean`||typeof n!=`boolean`)throw new e.b(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${H(r)}`);return t===n},Eh=(t,n)=>{if(typeof t!=`boolean`)throw new e.b(`TLC expected a boolean value, but did not find one. ${ah(n)}`);return t},Dh=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),Oh=(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.`},kh=(t,n,r)=>{if(!j(t)||ln(t)){let i=L(t),a=r===`1.7.4`?void 0:Oh(t,i);throw new e.b(a===void 0?`TLC encountered a non-enumerable quantifier bound\n${i}.\n${ah(n)}`:`TLC encountered the non-enumerable quantifier bound\n${i}\n${ah(n)}\n${a}`)}},Ah=(e,t,n)=>(kh(e,t,n),typeof e==`object`&&e.kind===`Interval`?Ar(e):Wr(e)??Xr(e)),jh=(e,t,n)=>n===`1.7.4`?(kh(e,t,n),Wr(e)??Qr(e)):Ah(e,t,n),Mh=e=>{if(typeof e==`object`&&e.kind===`Interval`)return oi(e),e},Nh=(e,t,n)=>Mh(e)??jh(e,t,n),Ph=(e,t,n)=>Mh(e)??Ah(e,t,n),Fh=(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},Ih=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set)),n),[]),Lh=(e,t)=>Ih(e,e=>Nh(W(e,t),e,t.environment.runtime.version)),Rh=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Fh(t[n],t=>i(n-1,vh(a,e[n].pattern,t)));return i(e.length-1,n)},zh=(e,t,n)=>Rh(e,Lh(e,t),t.scope,n),Bh=(e,t)=>{let n=Ih(e,e=>W(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Vh=(e,t,n)=>{if(e.length===1)return vh(t,e[0].pattern,n);let r=di(n)??[];return e.reduce((e,t,n)=>vh(e,t.pattern,r[n]),t)},Hh=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Uh=e=>Object.assign(e.value,{lambda:e}),Wh=e=>Hh(e)?e.lambda:void 0,Gh=(t,n,r)=>{let i=t.value,a=n.args.map(e=>W(e,r)),o=a.length===1?a[0]:Pr(a),s=(e,t,r)=>`In applying the function\n${A(L(i))},\nthe ${e} is:\n${A(L(t))}${r}.\n${H(n.function)}`,c=t.bounds;if(c.length===1){if(!gi(o,i.domain))throw new e.b(s(`first argument`,o,`which is not in its domain`));return Vh(c,t.scope,o)}let l=di(o),u=typeof i.domain==`object`&&i.domain.kind===`ProductSet`?i.domain.factors:[],d=()=>new e.b(`In applying the function\n${A(L(i))},\nthe argument list is:\n${A(L(o))}\nwhich does not match its formal parameter.\n`);if(l===void 0||(c.forEach((t,n)=>{if(n>=l.length)throw d();let r=l[n],i=`argument number ${n+1}`;if(!gi(r,u[n]))throw new e.b(s(i,r,`${t.pattern.kind===`Name`?``:`
|
|
1782
|
-
`}which is not in its domain`));if(t.pattern.kind===`Tuple`&&di(r)?.length!==t.pattern.names.length)throw new e.b(s(i,r,`which does not match its formal parameter`))}),l.length>c.length))throw d();return Vh(c,t.scope,o)},Kh=(t,n)=>{let r=n.location.range;if(r)return{parameters:t.flatMap((e,n)=>n>0&&t[n-1].set===e.set?[]:[{index:n,name:e.pattern.kind===`Name`?e.pattern.name:`<<${e.pattern.names.join(`, `)}>>`}]),body:e.X(r)}},qh=(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}},Jh=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},Yh=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),Xh=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),Zh=(e,t)=>{let n=Bh(e.bounds,t),r=Jh(n,(n,r)=>W(e.body,xh(t,Vh(e.bounds,_h(void 0,e.name,r),n))),qh(Kh(e.bounds,e.body),e.bounds,n),Yh(e.bounds));Uh({value:r,bounds:e.bounds,body:e.body,scope:_h(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=Zh(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?Dn(i):i},Qh=(t,n)=>{if(typeof n!=`object`||En(n)!==`lambda`||t.kind===`Operator`||t.isSelfReferential||n.kind!==`LazyFunction`||!jt(n.domain))return n;try{let e=I(n);return Cn(e.domain,e.range)}catch(t){if(t instanceof e.b)return n;throw t}},$h=(t,n)=>t.kind===`Operator`&&t.params.length>0?()=>{throw new e.b(`Operator ${t.name} requires ${t.params.length} arguments`)}:t.kind===`Function`?t.isSelfReferential?e=>Zh(t,e):Lg(Xh(t),n):Lg(t.body,n),eg=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=$h(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(xh(e,void 0)):e=>a[i]??r(xh(e,void 0));return t.definitionEvaluators.set(e,o),o},tg=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},ng=(t,n)=>t.forEach(t=>{if(t.kind===`Operator`&&t.params.length>0)return;let r=t.name;if(n.constants.has(r)||n.substitutions.has(r)||!hu(t,n))return;let i=n.facts.ids.get(t);if(i===void 0||n.startupValues[i]!==void 0)return;let a={environment:n,scope:void 0,state:void 0,next:void 0};try{let e=n.runtime.evaluateAtStartup(()=>Qh(t,$h(t,n)(a)));fr(e),n.startupValues[i]=e}catch(t){if(!(t instanceof e.b)&&!e.et(t))throw t}}),rg=(t,n)=>{if(n===void 0||t===n)return!0;try{return n.every((e,n)=>e===void 0||t?.[n]!==void 0&&Pn(t[n],e))}catch(t){if(t instanceof e.b)return!1;throw t}},ig=(e,t)=>{let n=e.cache;if(n!==void 0&&rg(t.state,e.state)&&rg(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?ro(r,i,()=>W(e.expression,xh(t,e.scope))):W(e.expression,xh(t,e.scope));return(!e.isStreamed||ei(a))&&(e.cache=a,e.state=t.state,e.next=t.next),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),a},ag=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),og=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return og(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?ag(r):t.builtins.get(e)},sg=(e,t)=>O(e)?cg(e.operator,t):og(e.operator,t.environment)??cg(e.operator,t),cg=(e,t)=>{let n=gh(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return og(e,t.environment)},lg=e=>e.kind===`Closure`?e.params.length:e.arity,ug=(t,n)=>{if(t.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:t.params.map(e=>({name:e,arity:0})),body:t.body,scope:n.scope};let r=t.kind===`OperatorReference`?t.operator:t.kind===`Identifier`?t.name:void 0,i=r===void 0?void 0:cg(r,n);if(!i)throw new e.b(`Expected an operator argument at ${nh(t)}`);return i},dg=(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)=>_h(e,n.name,t[r]),e.scope);return W(e.body,xh(n,r))},fg=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:lg(e),call:n=>dg(e,n,t)},pg=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=cg(e.name,t);return n!==void 0&&lg(n)>0},mg=(e,t)=>e.map(e=>pg(e,t)?fg(ug(e,t),t):W(e,t)),hg=(t,n)=>new e.b(`Operator ${t.name} expects ${t.params.length} arguments but received ${n}`),gg=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),_g=(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 _g(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([])}},vg=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Pt(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=gg(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=O(e)?void 0:_g(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=gh(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:gg(e,t)}}return t=>gg(e,t)},yg=(e,t,n,r)=>{if(t.length!==e.params.length)throw hg(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]??vg(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},bg=(e,t,n,r)=>e.kind===`Closure`?W(e.body,xh(n,yg(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(Bg(t,n),n):e.evaluate(mg(t,n),n),xg=/* @__PURE__ */ new WeakMap,Sg=e=>{let t=xg.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return xg.set(e,n),n},Cg=(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:Sg(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},wg=(t,n,r)=>{let i=gh(r.scope,t);if(i?.kind===`Value`)return i.value;if(i?.kind===`Thunk`)return ig(i,r);if(i?.kind===`Operator`){if(lg(i.operator)===0)return dg(i.operator,[],r);throw new e.b(`Operator ${t} is used without arguments`)}let a=_g(t,r.environment);if(a?.kind===`Variable`){let e=r.state?.[a.index];if(e===void 0)throw mh(t,n);return e}if(a?.kind===`Value`)return a.value;if(a?.kind===`Definition`)return eg(a.definition,r.environment)(r);let o=r.environment.builtins.get(t);if(o?.arity===0)return o.evaluate([],r);throw new e.b(`Unknown identifier ${t} at ${nh(n)}`)},Tg=(e,t)=>({impure:new Set(e.filter(e=>_u(e,t))),streamed:new Set(e.filter(e=>_u(e,t,`streamed`)))}),Eg=e=>[...e.facts.ids.keys()].some(t=>_u(t,e)),Dg=e=>[...e.facts.ids.keys()].some(t=>_u(t,e,`repeated`)),Og=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,kg=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),Ag=e=>t=>{let n=e(t);return Pn(n,e(kg(t)))},jg=(t,n,r,i)=>a=>{i.expressions.push(t);let o=pi.sets,s=pi.callStack,c=o??[],l=c.length;pi.sets=c,pi.callStack=i;try{let e=n(a),o=Og(e)?e.rebind(r):e;return i.values.set(t,o),typeof o==`object`&&o.kind!==`FilteredSet`&&eh(t)&&i.sources.set(o,t),o}catch(n){n instanceof e.N&&!i.isFrozen&&(i.expressions.length=0,i.isFrozen=!0);let r=n instanceof Error?i.failures.get(n):void 0;n instanceof Error&&i.failures.set(n,t);let a=th(t,i.values),o=a&&!Be(t).some(e=>e===r)?i.values.get(a):void 0,s=t.kind===`FunctionApplication`&&o!==void 0&&!M(o)?void 0:o;throw Mg(i,[s,...c.slice(l).filter(e=>e!==s)],n),n}finally{i.isFrozen||i.expressions.pop(),c.length=l,pi.sets=o,pi.callStack=s}},Mg=(t,n,r)=>{let i=[...new Set(n)].flatMap(e=>{let n=typeof e==`object`?t.sources.get(e):void 0;return n?[n]:[]});if(i.length>0&&r instanceof e.b){t.isFrozen||t.expressions.push(...i);let e=t.fingerprint;t.fingerprint={sources:[...i,...e?.sources??[]],reason:e?.reason??r.message}}t.isFrozen=!0},Ng=(t,n,r)=>{if(!(r instanceof e.b))return;t.isFrozen||t.expressions.push(n),t.isFrozen=!0;let i=t.fingerprint;t.fingerprint={sources:[n,...i?.sources??[]],reason:i?.reason??r.message}},Pg=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}}),Fg=(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)}},Ig=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=to(n,i,e);no(n,a),n.current=a;try{let i=t(r);return typeof i==`object`&&e.kind===`SetEnumeration`&&n.values.set(i,a),i}finally{n.current=i}},U=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=u_(e,t),i=t.callStack,a=i&&Ic.get(e),o=i?jg(e,r,t,i):r,s=i&&a?Fg(e,a,o,i):o,c=t.coverage,l=c?Ig(e,s,c):s;return t.evaluators.set(e,l),l},Lg=(e,t)=>{if(t.callStack||t.coverage)return U(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=gs(e,t)??U(e,t);return t.entryEvaluators.set(e,r),r},W=(e,t)=>Lg(e,t.environment)(t),Rg=(e,t)=>{let n=e.name,r=O(e)?void 0:_g(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw mh(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n;return r=>(n??=eg(e,t))(r)}return t=>wg(n,e,t)},zg=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||O(e))return!0;let n=og(e.name,t);return n===void 0||lg(n)===0},Bg=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),Vg=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Bg(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&zg(t[0],n)){let e=U(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&zg(t[0],n)&&zg(t[1],n);if(i&&a){let e=U(t[0],n),r=U(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(mg(t,n),n)},Hg=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw hg(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:vg(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}},Ug=(e,t,n)=>{let r=Hg(e,t,n),i;return t=>(i??=Lg(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},Wg=(t,n)=>{let r=t.args;if(t.operator===`=>`){let e=U(r[0],n),i=U(r[1],n);return n=>!Ch(e(n),t,`P`)||Ch(i(n),t,`Q`)}if(t.operator===`~`&&r.length===1){let e=U(r[0],n);return n=>wh(e(n),t)}if(t.operator===`<=>`){let e=U(r[0],n),i=U(r[1],n);return n=>Th(e(n),i(n),t)}if(t.operator===`~>`||t.operator===`-+->`)return()=>{throw ih(t.operator===`~>`?`a ~> b`:`a -+-> formula`,t)};let i=O(t)?void 0:og(t.operator,n);if(i?.kind===`Closure`)return Ug(i,r,n);if(i?.kind===`Builtin`&&i.name===`DOMAIN`){let e=U(r[0],n),i=uh(t);return t=>i(e(t))}if(i?.kind===`Builtin`&&i.name===`TLCEval`&&r.length===1){let e=!Fc.has(t)&&!xu(r[0],n);return t=>i.evaluate(Bg(r,t),e&&t.scope===void 0?void 0:t)}if(i?.kind===`Builtin`&&i.name===`\\subseteq`&&r.length===2){let e=U(r[0],n),a=U(r[1],n),o=dh(t,i);return t=>o(e(t),a(t))}if(i?.kind===`Builtin`)return Vg(i,r,n);if(t.operator===`\\cdot`&&r.length===2)return()=>{throw new e.b(n.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let a=r.map(e=>vg(e,n));return i=>{let o=cg(t.operator,i);if(o)return bg(o,r,i,a);throw n.definitions.get(t.operator)?.kind===`Function`?new e.b(`${t.operator} is a function; apply it with brackets`):new e.b(`Unknown operator ${t.operator} at ${nh(t)}`)}},Gg=(e,t)=>{let n=e.kind===`Forall`,r=U(e.body,t),i=e.bounds[0];if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=U(i.set,t);return s=>Fh(Nh(o(s),i.set,t.runtime.version),t=>Eh(r(xh(s,_h(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=Ih(a,e=>Nh(U(e,t)(o),e,t.runtime.version)),c=(t,a)=>t<0?Eh(r(xh(o,a)),e)!==n:Fh(s[t],e=>c(t-1,_h(a,i[t],e)));return c(a.length-1,o.scope)?!n:n}}return t=>zh(a,t,i=>Eh(r(xh(t,i)),e)!==n)?!n:n},Kg=(e,t)=>{if(e.kind===`Tuple`)return Pr(e.names.map(e=>{let n=gh(t,e);return n?.kind===`Value`&&n.value}));let n=gh(t,e.name);return n?.kind===`Value`?n.value:void 0},qg=/* @__PURE__ */ new WeakSet,Jg=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&qg.add(e)},Yg=/* @__PURE__ */ new WeakMap,Xg=e=>{if(Yg.has(e))return Yg.get(e);let t=/* @__PURE__ */ new Set,n=e=>e.kind!==`Subexpression`&&(e.kind===`Identifier`&&t.add(e.name),(e.kind===`Apply`||e.kind===`OperatorReference`)&&t.add(e.operator),e.kind===`ExceptAt`&&t.add(`@`),Be(e).every(n)),r=n(e)?[...t]:void 0;return Yg.set(e,r),r},Zg=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=gh(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),Qg=e=>qg.has(e),$g=(t,n)=>{let r=Qg(t),i=U(t.body,n),a=t.bounds,o=a[0],s=a.length===1&&o.pattern.kind===`Name`,c=(e,t)=>{if(s&&o.pattern.kind===`Name`){let n=o.pattern.name,r=e=>i(xh(t,_h(t.scope,n,e)));if(kt(e))return oi(e),At(e,r),f(e,t);let a=Mr(e),s=Cn(a,a.map(r));return jt(e)?s:(s.lambdaDomain=e,Dn(s))}let n=[],r=Ih(a,e=>Ph(W(e,t),e,t.environment.runtime.version));return Rh(a,r,t.scope,e=>{let r=a.length===1?Kg(o.pattern,e)??!1:Pr(a.map(t=>Kg(t.pattern,e)??!1));return n.push([r,i(xh(t,e))]),!1}),Cr(n)},l=Kh(a,t.body),u=Yh(a),d=Xg(t.body),f=(e,n)=>{let r=Zg(n.scope,d),o=xh(n,r),s=Uh({value:Jh(e,e=>i(xh(o,Vh(a,r,e))),qh(l,a,e),u),bounds:a,body:t.body,scope:r});return a.length===1?Dn(s):s},p=n.callStack;return{build:(n,i)=>{if(t.isRecursive||r||i.isKeepLazy||!P(n))return f(n,i);if(!(a.length===1?jt(n):typeof n==`object`&&n.kind===`ProductSet`&&n.factors.every(jt))){if(p)return f(n,i);try{return c(n,i)}catch(t){if(!(t instanceof e.b))throw t;return f(n,i)}}if(!p)return c(n,i);try{return c(n,i)}catch(e){throw Ng(p,t,e),e}},createLazy:f}},e_=(e,t)=>{let n=$g(e,t).build,r=e.bounds;if(r.length===1&&r[0].pattern.kind===`Name`){let e=U(r[0].set,t);return t=>n(e(t),t)}return e=>n(Bh(r,e),e)},t_=(e,t)=>{let n=qg.has(e);n&&Jg(e.function);let r=U(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>U(e,t))}),value:U(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Pr(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(xh(i,_h(i.scope,`@`,e))):Ii(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i=!1;n=o(n,r.path,0,t,e=>(i=!0,r.value(e))),i||t.environment.runtime.warn(Ke.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${H(e.function)}`)}return n}},n_=(t,n)=>{let r=U(t.predicate,n),i=t.bound.pattern,a=t.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:e.X(a)},s=ah(t.predicate),c=n.coverage,l=(e,t,n)=>{if(!c||e===-1)return n();t||c.secondary[e]++;let r=ro(c,t?-1:e,n);return!t&&r===!0&&c.secondary[e]++,r},u=(n,r,a,c)=>({kind:`FilteredSet`,base:n,test:(t,n)=>{if(i.kind===`Tuple`&&di(t)?.length!==i.names.length)throw new e.b(`Attempted to check if the value:\n${A(L(t))}\nis an element of a set of ${i.names.length}-tuples.`);let o=l(c,n,()=>a(xh(r,vh(r.scope,i,t))));if(typeof o!=`boolean`)throw new e.b(`${n?`The evaluation of predicate`:`Evaluating predicate`} ${s} yielded non-Boolean value.`);return o},source:o,rebind:e=>u(n,{...r,environment:e},U(t.predicate,e),-1)});return(e,t,n=-1)=>u(e,t,r,n)},r_=(t,n)=>{if(typeof t!=`boolean`)throw new e.b(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${zo(t)}.\n${ah(n.predicate)}`);return t},i_=(t,n,r,i)=>{if(!j(t)||ln(t))throw new e.b(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${H(n)}`);return pr(t),Ph(t,r,i)},a_=t=>new e.b(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${H(t)}`),o_=(t,n)=>{if(t.kind===`SetFilter`){let e=U(t.predicate,n),r=U(t.bound.set,n),i=n_(t,n),a=t.bound.pattern,o=n.coverage;return n=>{let s=r(n);if(!jt(s))return i(s,n,o?.current);let c=[],l=r=>{let i=e(xh(n,vh(n.scope,a,r)));r_(i,t)&&Ot(c,r)},u=s.kind===`Interval`?s:F(s).elements;return At(u,l),o&&o.current!==-1&&(o.secondary[o.current]+=(Array.isArray(u)?u.length:u.high-u.low+1)+c.length),Sn(c)}}if(t.kind===`SetMap`){let e=U(t.expression,n);return n=>{let r=[];return zh(t.bounds,n,t=>(Ot(r,e(xh(n,t))),!1)),vr(r)}}let r=t.set;if(!r)return()=>{throw new e.b(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${H(t)}`)};let i=U(t.body,n),a=U(r,n);return n=>{let o=i_(a(n),t,r,n.environment.runtime.version),s,c=t.pattern;if(Fh(o,r=>{if(c.kind===`Tuple`&&di(r)?.length!==c.names.length)throw new e.b(`Attempted to compute the value of an expression of form\nCHOOSE <<x1, ... , xN>> \\in S: P, but S was not a set\nof N-tuples.\n${H(t)}`);let a=vh(n.scope,c,r);return Eh(i(xh(n,a)),t)?(s=Kg(c,a),!0):!1}),s===void 0)throw a_(t);return s}},s_=e=>[...e].sort((e,t)=>gn(e.name,t.name)),c_=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),l_=(e,t)=>{let n=s_(e),r=c_(n),i=n.map(e=>U(e.value,t));if(r)return e=>Fr(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>Bt(a,i.map(t=>t(e)),o):e=>Ir(a,i.map(t=>t(e)))},u_=(t,n)=>{let r=e=>U(e,n);switch(t.kind){case`Number`:{let e=t.value;return Pt(e)?()=>e:()=>{throw ph(t)}}case`Decimal`:return()=>{throw fh(t)};case`String`:{let e=t.value;return()=>e}case`Identifier`:return Rg(t,n);case`Apply`:return Wg(t,n);case`Bracket`:return()=>{throw new e.b(`A bracket without a function or subscript is not an expression at ${nh(t)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new e.b(`An operator cannot be used as a value at ${nh(t)}`)};case`And`:{let e=t.operands.map(r);return n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw sh(t,r,i);if(!i)return!1}return!0}}case`Or`:{let e=t.operands.map(r);return n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw sh(t,r,i);if(i)return!0}return!1}}case`Prime`:{let e=r(t.expression);return t=>e(kg(t))}case`Unchanged`:return Ag(r(t.expression));case`If`:{let e=r(t.condition),n=r(t.consequent),i=r(t.alternative);return r=>{let a=e(r);if(typeof a!=`boolean`)throw oh(t,a);return a?n(r):i(r)}}case`Case`:{let n=t.arms.map(e=>({source:e.condition,condition:r(e.condition),body:r(e.body)})),i=t.other?r(t.other):void 0;return r=>{for(let t of n){let n=t.condition(r);if(typeof n!=`boolean`)throw new e.b(`A non-boolean expression (${zo(n)}) was used as a condition of a CASE. ${ah(t.source)}`);if(n)return t.body(r)}if(i)return i(r);throw new e.b(`Attempted to evaluate a CASE with no conditions true.\n${H(t)}`)}}case`Let`:{let e=r(t.body);return n=>e(xh(n,Cg(t.definitions,n)))}case`Forall`:case`Exists`:return Gg(t,n);case`UnboundedQuantifier`:return()=>{let n=t.quantifier===`Forall`?`\\A`:`\\E`;throw t.isTemporal?ih(t.quantifier===`Forall`?`\\AA`:`\\EE`,t):new e.b(`TLC attempted to evaluate an unbounded ${n}.\nMake sure that the expression is of form ${n} x \\in S: P(x).\n${H(t)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return o_(t,n);case`SetEnumeration`:{let e=t.elements.map(r);return t=>vr(e.map(e=>e(t)))}case`Tuple`:{let e=t.elements.map(r);return t=>Pr(e.map(e=>e(t)))}case`FunctionConstruction`:return e_(t,n);case`FunctionSet`:{let e=r(t.domain),n=r(t.range);return t=>({kind:`FunctionSet`,domain:e(t),range:n(t)})}case`Record`:return l_(t.fields,n);case`RecordSet`:{let e=s_(t.fields),n=e.map(e=>e.name),i=e.map(e=>r(e.value));return e=>({kind:`RecordSet`,names:n,sets:i.map(t=>t(e))})}case`Except`:return t_(t,n);case`ExceptAt`:return n=>{let r=gh(n.scope,`@`);if(r?.kind!==`Value`)throw new e.b(`@ appears outside an EXCEPT at ${nh(t)}`);return r.value};case`FunctionApplication`:{Jg(t.function);let e=r(t.function),i=n=>yh(e(bh(n)),t),a=t.args.map(r),o=lh(n.runtime.version);if(a.length===1){let e=a[0];return t=>Ni(i(t),e(t),o)}return e=>Ni(i(e),Pr(a.map(t=>t(e))),o)}case`FieldAccess`:{let e=r(t.record),n=ch(t);return t=>n(e(t))}case`Product`:{let e=t.factors.map(r);return t=>({kind:`ProductSet`,factors:e.map(e=>e(t))})}case`BoxAction`:case`AngleAction`:{let n=r(t.action),i=Ag(r(t.subscript)),a=t.kind===`BoxAction`,o=a?`[A]_e`:`<A>_e`;return r=>{let s=n(r);if(typeof s!=`boolean`)throw new e.b(`Attempted to evaluate an expression of form ${o}, but A was not a boolean.\n${H(t)}`);return a?s||i(r):s&&!i(r)}}case`Enabled`:{let e=t.expression;return t=>Km(e,t)}case`Label`:return r(t.body);case`Subexpression`:return()=>{throw new e.b(`The subexpression reference at ${nh(t)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw ih(rh[t.kind],t)}}},d_=`tlc2/value/impl/`,f_={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},p_={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},m_=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n=0,r=e=>{let t=n;return n+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n)}},h_=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),g_=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],__=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??h_.get(e[3])}${`[]`.repeat(e[1].length)}`),v_=(e,t)=>e[e[t].first].text,y_=(e,t)=>v_(e,t).replaceAll(`/`,`.`),b_=t=>{let n=m_(t);if(n.readUint32()!==3405691582)throw new e.F(`A module override is not a class file`);n.readUint16(),n.readUint16();let r=[],i=n.readUint16(),a=new TextDecoder;for(let e=1;e<i;e++){let t=n.readUint8(),i={tag:t,text:``,value:0,first:0,second:0};r[e]=i,t===f_.utf8?i.text=a.decode(n.readBytes(n.readUint16())):t===f_.integer?i.value=n.readInt32():t===f_.float?n.readUint32():t===f_.long||t===f_.double?(n.readBytes(8),e++):t===f_.class||t===f_.string||t===f_.methodType||t===f_.module||t===f_.package?i.first=n.readUint16():t===f_.methodHandle?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=y_(r,n.readUint16());n.readUint16(),n.readBytes(n.readUint16()*2);for(let e=n.readUint16();e>0;e--){n.readBytes(6);for(let e=n.readUint16();e>0;e--)n.readUint16(),n.readBytes(n.readUint32())}let s=[];for(let e=n.readUint16();e>0;e--){let e=n.readUint16(),t=r[n.readUint16()].text,i=r[n.readUint16()].text,a=i.indexOf(`)`),c=__(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:m_(n.readBytes(n.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>y_(r,d.readUint16())):[],p=g_.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=__(i.slice(a+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;s.push({name:t,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${o}.${t}(${c.join(`,`)})${h}`})}return{pool:r,methods:s}},x_=(e,t)=>{let n=e[t],r=e[n.second];return{className:v_(e,n.first),name:e[r.first].text}},S_=(t,n,r,i)=>{let a=()=>new e.B(`The Java override ${r}.${t.name} computes its value, which tla-ts cannot run`),o=t.code;if(!o)throw a();let s=[],c=()=>{let e=s.pop();if(e===void 0)throw a();return e},l=e=>{let t=n[e];if(t.tag===f_.integer)return t.value;if(t.tag===f_.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>=p_.iconstM1&&t<=p_.iconst5)s.push(t-p_.iconst0),e+=1;else if(t===p_.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===p_.sipush)s.push(r()<<16>>16),e+=3;else if(t===p_.ldc)s.push(l(o[e+1])),e+=2;else if(t===p_.ldcW)s.push(l(r())),e+=3;else if(t===p_.dup){let t=c();s.push(t,t),e+=1}else if(t===p_.getstatic){let t=x_(n,r());if(t.className!==`${d_}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===p_.invokestatic){let t=x_(n,r()),o=c();if(t.className!==`${d_}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===p_.new)s.push({className:v_(n,r()),value:void 0}),e+=3;else if(t===p_.invokespecial){let t=x_(n,r()),o=c(),s=c();if(!(t.className===`${d_}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===p_.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()},C_=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=b_(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:S_(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)}))}},w_=x(`EOF`),T_=x(`IDENTIFIER`),E_=x(`DEFBREAK`),D_=(e,t)=>Array.from({length:x(t)-x(e)+1},(t,n)=>x(e)+n),O_=new Set(D_(`op_57`,`op_119`)),k_=new Set(D_(`op_1`,`op_119`)),A_=new Set(D_(`op_57`,`op_70`)),j_=/* @__PURE__ */ new Set([...D_(`ACTION`,`EXCEPT`),x(`EXTENDS`),...D_(`IF`,`SF`),x(`STATE`),...D_(`THEN`,`WITH`),x(`US`),...D_(`op_112`,`op_116`)]),M_=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),N_=new Map([...M_(`postfix`,160,160,!0,`[`),...M_(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...M_(`prefix`,120,120,!1,`-.`),...M_(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...M_(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...M_(`prefix`,40,40,!0,`\\lnot`),...M_(`nfix`,100,130,!0,`\\times`),...M_(`infix`,140,140,!1,`^`,`^^`),...M_(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...M_(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...M_(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...M_(`infix`,100,110,!0,`|`,`||`,`%%`),...M_(`infix`,100,110,!1,`%`),...M_(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...M_(`infix`,90,140,!1,`\\wr`),...M_(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...M_(`infix`,90,130,!1,`!!`),...M_(`infix`,90,90,!1,`...`,`..`),...M_(`infix`,80,80,!0,`\\intersect`,`\\union`),...M_(`infix`,80,80,!1,`\\`),...M_(`infix`,70,70,!1,`<:`,`:>`),...M_(`infix`,60,60,!0,`@@`),...M_(`infix`,50,140,!0,`\\cdot`),...M_(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...M_(`infix`,30,30,!0,`\\land`,`\\lor`),...M_(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...M_(`infix`,10,10,!1,`=>`)]),P_=new Map([...N_,...vf.flatMap(e=>e.slice(1).map(t=>[t,N_.get(e[0])]))]),F_=P_.get(`[`),I_={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},L_=e=>({type:`tokens`,kinds:new Set(e)}),R_=e=>typeof e==`string`?e.startsWith(`<`)?L_([x(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(R_)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),z_=e=>(...t)=>({type:e,body:G(...t)}),q=z_(`zeroOrMore`),B_=z_(`oneOrMore`),J=z_(`optional`),Y=e=>({type:`action`,run:t=>e(t)??void 0}),X=e=>Y(t=>{t.expecting=e}),Z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&G(...e.expansion),semantic:e.semantic}),V_=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),H_=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=V_(e,n);return n},U_=(...e)=>{let t=e.map(x);return e=>t.includes(H_(e,1).kind)},W_=(e,t=H_(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},G_=e=>{let t=H_(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},K_=e=>U_(`CASESEP`)(e)&&W_(e),q_=e=>{let t=H_(e,1);j_.has(t.kind)&&(t.kind=T_)},J_=(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}`,Y_=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),X_=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Z_=e=>e.operatorStacks[e.operatorStacks.length-1],Q_=(e,t)=>e.low>t.high,$_=(e,t)=>e.high<t.low,ev=e=>e.fix===`prefix`?e:P_.get(`${e.name}.`),tv=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===F_?Y_(`FcnAppl`,[n,...r.node.heirs]):Y_(`PostfixExpr`,[n,r.node]),operator:void 0})},nv=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Y_(`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:Y_(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},rv=e=>{let t=Z_(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 tv(t,n),rv(e);if(i.operator!==void 0){let t=ev(r.operator);return t!==void 0&&Q_(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${J_(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 ${J_(e,a.node.first,a.node.last)} and expression at location ${J_(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return $_(a.operator,r.operator)?void 0:Q_(a.operator,r.operator)?(nv(t,a.operator),rv(e)):`Precedence conflict between ops ${a.operator.name} in block ${J_(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=ev(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if($_(s,r.operator))return;if(!Q_(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${J_(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return nv(t,s),rv(e);let c=J_(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===I_?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},iv=e=>Y(t=>{let n=Z_(t),r=X_(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:rv(t)}),av=iv(()=>!1),ov=iv(()=>!0),sv=Y(e=>{e.lastOperator=P_.get(e.token.image)}),cv=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},lv=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?cv(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(!W_(e,n.first.beginColumn))return n;let t=uv(e,n);if(t!==void 0)return t}},dv=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(x),n=(e,...t)=>t.some(t=>e.kind===x(t)),r=e=>e!==void 0&&O_.has(e.kind),i=e.token,a=V_(e,i);i.next=void 0;let o=V_(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===T_&&(e=e.next)}else if(e.kind===T_){let t=e.next;!r(t)||A_.has(t.kind)||k_.has(t.kind)&&t.next?.kind!==T_||(e=t.next?.kind===x(`SUBSTITUTE`)?i:k_.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==E_&&(e.next={kind:E_,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=V_(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},fv=e=>{let t=H_(e,1);if(t.kind===x(`LAB`)){let n=1;for(;n!==0;)if(t=V_(e,t),t.kind===x(`LAB`)&&n++,t.kind===x(`RAB`)&&n--,t.kind===w_)return!1;return V_(e,t).kind===x(`IN`)}if(t.kind!==T_)return!1;for(t=V_(e,t);t.kind===x(`COMMA`);){if(t=V_(e,t),t.kind!==T_)return!1;t=V_(e,t)}return t.kind===x(`IN`)},pv=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),mv=e=>e.proofLevels.at(-1)??-1,hv=e=>{let t=H_(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:U_(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||mv(e)>=0&&pv(t)>mv(e):U_(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},gv=(e,t)=>{let n=pv(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},_v=e=>Y(t=>gv(t,t.token)?void 0:`${J_(t,t.token)}: ${e}`),vv=L_([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(x)),yv=L_([...vv.kinds,x(`op_76`)]),bv=L_(k_),xv=L_(A_),Sv=L_([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(x)),Cv=()=>q(Z({expansion:[K(vv,`<op_77>`)],semantic:W_}),K(`PrefixOp`,`InfixOp`),ov),wv=()=>K(G(Z({expansion:[`OpenStart`],semantic:W_}),`OpenExpression`,av),G(Z({semantic:W_}),`ExtendableExpr`)),Tv=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),Ev=()=>K(G(Z({semantic:e=>U_(`ASSUME`,`BOXASSUME`)(e)||H_(e,2).kind===x(`COLONCOLON`)&&[x(`ASSUME`),x(`BOXASSUME`)].includes(H_(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Dv=()=>[`JuncItem`,q(Z({semantic:G_}),`JuncItem`)],Ov=e=>Y(t=>{t.expecting=e,q_(t)}),kv=e=>Y(t=>{t.isTerminalProof=e}),Av=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{dv(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),jv={CompilationUnit:Q(void 0,[Y(dv),J(`Prelude`),`Module`]),Prelude:Q(void 0,[`<BEGIN_PRAGMA>`,q(K(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Q(`Module definition`,[X(`---- MODULE`),`BeginModule`,X(`EXTENDS clause or module body`),`Extends`,X(`Module body`),`Body`,X(`==== or more Module body`),`EndModule`]),BeginModule:Q(`Begin module`,[X(`---- MODULE (beginning of module)`),K(`<_BM0>`,`<_BM1>`,`<_BM2>`),Ov(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,Ov(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,Ov(`Identifier`),`Identifier`))]),Body:Q(`Module body`,[X(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),q(K(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,G(Z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,G(Z({amount:2}),`Instance`),G(Z({amount:2}),`Assumption`),G(Z({amount:2}),`Theorem`),G(Z({amount:1}),`Module`,Y(dv)),G(Z({semantic:e=>U_(`USE`)(e)&&H_(e,2).kind!==x(`ONLY`)||U_(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Q(`variable declaration`,[`<VARIABLE>`,X(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,X(`Identifier`),`Identifier`)]),ParamDeclaration:Q(`Parameter declaration`,[X(`CONSTANT`),`ParamSubDecl`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Q(`Recursive`,[X(`RECURSIVE`),`<RECURSIVE>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X("`,' or `)'"))]),ConstantDeclarationItems:Q(`Constant declaration items`,[X(`Identifier, _ or prefix op`),K(G(`Identifier`,X(`(, comma, or Module Body`),J(Z({amount:2}),`<LBR>`,X(`_`),`<US>`,X(`comma or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`comma or )`)),`<RBR>`)),G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`prefix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Q(`Definition`,[X(`LOCAL, Identifier or Operator Symbol`),J(`<LOCAL>`),`<DEFBREAK>`,X(`LOCAL, Identifier or Operator Symbol`),K(Av(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),Av(`Expression`,Z({expansion:[`<IDENTIFIER>`,xv]}),`PostfixLHS`,`Expression`),Av(`Expression`,Z({expansion:[`<IDENTIFIER>`,bv]}),`InfixLHS`,`Expression`),Av(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),Av(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Q(`Identifier tuple`,[`<LAB>`,X(`Identifier or >>`),J(`Identifier`,X(`COMMA or >>`),q(`<COMMA>`,X(`COMMA or >>`),`Identifier`,X(`COMMA or >>`))),`<RAB>`]),IdentLHS:Q(`Identifier LHS`,[`Identifier`,X(`( or ==`),J(`<LBR>`,X(`Identifier Declaration, prefix op, _ or )`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`),q(`<COMMA>`,X(`Identifier Declaration, prefix op or _`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Q(`Prefix LHS`,[yv,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,bv,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,xv]),IdentDecl:Q(`Identifier Declation`,[`Identifier`,X(`( or ...`),J(`<LBR>`,X(`_`),`<US>`,X(`COMMA or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Q(`Op. Symbol Declaration`,[K(G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`infix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),Instance:Q(`Instance`,[X(`LOCAL or instance`),J(`<LOCAL>`),`Instantiation`,X(`COMMA or Module Body`)]),Instantiation:Q(`NonLocalInstance`,[`<INSTANCE>`,Ov(`Module identifier`),`Identifier`,X(`WITH or another definition.`),J(`<WITH>`,X(``),`Substitution`,X(``),q(Z({amount:3}),`<COMMA>`,X(``),`Substitution`,X(``)))]),Substitution:Q(`Substitution`,[K(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),X(`<-`),`<SUBSTITUTE>`,X(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Q(void 0,[vv,sv]),NonExpPrefixOp:Q(void 0,[yv,sv]),InfixOp:Q(`Infix Op`,[bv,sv]),PostfixOp:Q(void 0,[xv,sv]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{dv(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),Ev(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),Ev(),X("PROVE or `,'")),K(`<PROVE>`,`<BOXPROVE>`),X(`Expression`),`Expression`))]),NewSymb:Q(`NEW symbol declaration`,[X(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),K(G(Z({amount:2}),K(G(Z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),X(`Constant declaration`),K(G(Z({amount:2}),`IdentDecl`,J(`<IN>`,Y(e=>{let t=X_(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${J_(e,t.first,t.last)}`:void 0}),X(`Expression`),`Expression`)),`SomeFixDecl`)),G(Z({amount:2}),J(`<NEW>`),`<VARIABLE>`,X(`Identifier`),`Identifier`),G(Z({amount:2}),J(`<NEW>`),K(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),X(`Declaration`),K(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Q(`Domain binding`,[J(`<IN>`,X(`Expression`),`Expression`)]),Theorem:Q(`Theorem`,[X(`THEOREM, PROPOSITION`),K(`<THEOREM>`,`<PROPOSITION>`),X(`Identifier, Assume-Prove or Expression`),J(Z({amount:2}),`Identifier`,X(`==`),`<DEF>`),Y(dv),K(G(Z({amount:3}),Z({semantic:U_(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:hv}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>U_(`BY`)(e)||H_(e,2).kind===x(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>H_(e,2).kind!==x(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,kv(!0),J(`<ONLY>`)),G(`<USE>`,kv(!1),J(`<ONLY>`)),G(`<HIDE>`,kv(!1))),X("an expression, `MODULE' or `DEF'"),J(Tv(),q(`<COMMA>`,X(`MODULE or expression`),Tv(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),Tv(),q(`<COMMA>`,X(`MODULE or expression`),Tv(),Y(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),Y(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Q(`QED step`,[X(`Step number`),Sv,_v(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:hv}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),Sv,_v(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:U_(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:U_(`INSTANCE`)}),`Instantiation`),G(Z({semantic:U_(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:hv}),Y(e=>{let t=X_(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${J_(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),B_(Z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Q(`HaveStep`,[`<HAVE>`,X(`expression`),`Expression`]),TakeStep:Q(`TakeStep`,[`<TAKE>`,X(`identifier`),K(G(Z({expansion:[K(G(`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,X(`comma or step`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or proof step`))),G(`Identifier`,X(`comma or proof step`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or proof step`))))]),WitnessStep:Q(`WitnessStep`,[`<WITNESS>`,X(`expression`),`Expression`,q(`<COMMA>`,X(`expression`),`Expression`,X(`comma or colon`))]),PickStep:Q(`PickStep`,[`<PICK>`,X(`identifier`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,X(`comma, or colon`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or colon`))),G(`QuantBound`,X(`comma or colon`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or colon`)))),`<COLON>`,X(`expression`),`Expression`]),CaseStep:Q(`CaseStep`,[`<CASE>`,X(`expression`),`Expression`]),AssertStep:Q(`AssertStep`,[J(`<SUFFICES>`,X(`expression or ASSUME/PROVE`)),K(`Expression`,G(Z({semantic:U_(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Q(void 0,[K(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Q(void 0,[K(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Q(`String`,[`<STRING_LITERAL>`]),Number:Q(void 0,[`<NUMBER_LITERAL>`,J(Z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,q(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Q(void 0,[K(G(Z({amount:2,expansion:[K(yv,bv,xv),L_([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(x))],semantic:W_}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${J_(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:W_}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Q(`Quantified form`,[K(`<EXISTS>`,`<FORALL>`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,q(`<COMMA>`,`Identifier`)),G(`QuantBound`,q(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Q(`Bound Quantified Expression`,[K(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,q(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Q(`Quant Bound`,[K(`IdentifierTuple`,G(`Identifier`,q(`<COMMA>`,`Identifier`,X(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Q(`Some { } form`,[`<LBC>`,J(K(G(Z({semantic:fv}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),B_(`<COMMA>`,`Expression`)))),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,q(`<COMMA>`,`Expression`)),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,q(`<COMMA>`,`QuantBound`)),G(`Expression`,J(K(G(`<COLON>`,Y(e=>{let t=X_(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,q(`<COMMA>`,`QuantBound`)),B_(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:fv}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>H_(e,2).kind===x(`MAPTO`)&&j_.has(H_(e,1).kind)}),Y(e=>{H_(e,1).kind=T_}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,q(`<COMMA>`,`FieldSet`),`<RSB>`),G(`Expression`,K(G(q(`<COMMA>`,`Expression`),`<RSB>`,Y(e=>{let t=e.frames[e.frames.length-1];t.node=Y_(`FcnAppl`,t.heirs),e.lastOperator=F_})),G(`<ARROW>`,`Expression`,`<RSB>`),G(`<EXCEPT>`,`ExceptSpec`,q(`<COMMA>`,`ExceptSpec`),`<RSB>`),G(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Q(`Except Spec`,[`<BANG>`,B_(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(q_),`Identifier`,Y(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===x(`RBR`)}))]),ReducedExpression:Q(`restricted form of expression`,[K(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Q(`Fairness Expression`,[Y(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),K(`<WF>`,`<SF>`),`ReducedExpression`,J(Z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,Y(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Q(`CASE Expression`,[`<CASE>`,`CaseArm`,q(Z({semantic:e=>K_(e)&&H_(e,2).kind!==x(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:K_}),`<CASESEP>`,`OtherArm`)]),CaseArm:Q(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Q(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Q(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Q(`Let Definitions`,[B_(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=H_(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...Dv()),G(Z({expansion:[`<AND>`]}),...Dv())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=uv(t,e.heirs[1]);return n&&`Item at ${J_(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${J_(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Q(`(Un)Bounded Choose`,[`<CHOOSE>`,K(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Q(`Lambda`,[`<LAMBDA>`,X(`Identifier`),`Identifier`,X("`,' or `:'"),q(`<COMMA>`,X(`Identifier`),`Identifier`,X("`,' or `:'")),`<COLON>`,X(`Expression`),`Expression`]),Expression:Q(`Expression`,[Y(e=>{e.operatorStacks.push([])}),Cv(),wv()],(e,t)=>{let n=Z_(t);n.push({node:e.heirs[0],operator:I_});let r=rv(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Q(`ExtendableExpr`,[K(G(Z({expansion:[K(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),av,q(K(G(Z({expansion:[`PostfixOp`],semantic:W_}),`PostfixOp`,ov),G(Z({expansion:[`<DOT>`],semantic:W_}),`<DOT>`,Y(q_),Z({semantic:W_}),`Identifier`,Y(e=>{let t=Z_(e);t[t.length-1].operator!==void 0&&tv(t,t.length),t[t.length-1]={node:Y_(`RecordComponent`,[t[t.length-1].node,X_(e,2),X_(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:W_}),X(`function argument`),`SBracketCases`,iv(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:W_}),`InfixOp`,ov,Cv(),wv()),G(Z({expansion:[`<COLONCOLON>`],semantic:W_}),`<COLONCOLON>`,Y(e=>{let t=Z_(e);if(!lv(t[t.length-1].node))return`\`::' at ${J_(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=Z_(e),n=X_(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!$_(r,e.lastOperator)){let t=X_(e,3);return`Removing label at ${J_(e,t.first,t.last)} would change expression parsing.`}t.push({node:Y_(`Label`,[X_(e,3),X_(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:W_}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:W_}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>mv(e)<0&&e.proofLevels.length<=1?`${J_(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${J_(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,G(Z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),J(Z({amount:2}),`OpArgs`),q(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:cv(e.heirs)===void 0?e.heirs.length===1?Y_(`GeneralId`,e.heirs):void 0:Y_(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>H_(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),J(Z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Q(`StructOp`,[X("`<<' , `>>' , `:' , `@' , or number"),K(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,G(Z({semantic:e=>H_(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${J_(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},Mv=/* @__PURE__ */ new Map,Nv=e=>{let t=Mv.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=Nv(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,Nv(jv[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 Mv.set(e,n),n},Pv=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},Fv=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=V_(e,e.scanPosition)),e.scanPosition=V_(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`},Iv=(e,t)=>{if(t.type===`tokens`)return Fv(e,t.kinds);if(t.type===`call`)return Iv(e,jv[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||Pv(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=Iv(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||Pv(e,t.semantic)?Iv(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=Iv(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=Iv(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},Lv=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=Iv(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},Rv=(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||Nv(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!Nv(a).hasSemanticStart?Nv(a).first.has(H_(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):Lv(e,i,a)&&(o===void 0||o(e))}),zv=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,Iv(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=V_(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===w_){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=V_(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Te(e.token.image)}" `},Bv=(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??zv(e)}\n\nResidual stack trace follows:\n${r}`,!1},Vv=(e,t)=>{let n=V_(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,Bv(e))},Hv=(e,t)=>{let n=jv[t];n.message!==void 0&&(e.messages.push({name:n.message,token:H_(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!Uv(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 Bv(e,i);let a=r.node??(r.heirs.length===0?void 0:Y_(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},Uv=(e,t)=>{if(t.type===`tokens`)return Vv(e,t.kinds);if(t.type===`call`)return Hv(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||Bv(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||Bv(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||Uv(e,t));if(t.type===`choice`){let n=Rv(e,t.alternatives);return n===-1?Bv(e):Uv(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!Uv(e,t.body))return!1;if(t.type===`optional`)return Rv(e,[t.body])===-1||Uv(e,t.body);for(;Rv(e,[t.body])===0;)if(!Uv(e,t.body))return!1;return!0},Wv=e=>{let t=Ce(e),n={kind:w_,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=Uv(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
|
-
`)},Gv={low:15,high:15},Kv={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),qv=new Map([[`=>`,$(1,1,!1)],[`<=>`,$(2,2,!1)],[`~>`,$(2,2,!1)],[`-+->`,$(2,2,!1)],[`/\\`,$(3,3,!0)],[`\\/`,$(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,$(5,5,!1)]),[`\\cdot`,$(5,14,!0)],[`@@`,$(6,6,!0)],[`:>`,$(7,7,!1)],[`<:`,$(7,7,!1)],[`\\cup`,$(8,8,!0)],[`\\cap`,$(8,8,!0)],[`\\`,$(8,8,!1)],[`..`,$(9,9,!1)],[`...`,$(9,9,!1)],[`##`,$(9,13,!0)],[`$`,$(9,13,!0)],[`$$`,$(9,13,!0)],[`??`,$(9,13,!0)],[`!!`,$(9,13,!1)],[`\\sqcap`,$(9,13,!0)],[`\\sqcup`,$(9,13,!0)],[`\\uplus`,$(9,13,!0)],[`\\wr`,$(9,14,!1)],[`+`,$(10,10,!0)],[`++`,$(10,10,!0)],[`(+)`,$(10,10,!0)],[`\\oplus`,$(10,10,!0)],[`%`,$(10,11,!1)],[`%%`,$(10,11,!0)],[`|`,$(10,11,!0)],[`||`,$(10,11,!0)],[`\\X`,$(10,13,!1)],[`-`,$(11,11,!0)],[`--`,$(11,11,!0)],[`(-)`,$(11,11,!0)],[`\\ominus`,$(11,11,!0)],[`*`,$(13,13,!0)],[`**`,$(13,13,!0)],[`/`,$(13,13,!1)],[`//`,$(13,13,!1)],[`\\div`,$(13,13,!1)],[`\\o`,$(13,13,!0)],[`(.)`,$(13,13,!0)],[`\\odot`,$(13,13,!0)],[`(/)`,$(13,13,!1)],[`\\oslash`,$(13,13,!1)],[`(\\X)`,$(13,13,!0)],[`\\otimes`,$(13,13,!0)],[`&`,$(13,13,!0)],[`&&`,$(13,13,!0)],[`\\star`,$(13,13,!0)],[`\\bullet`,$(13,13,!0)],[`\\bigcirc`,$(13,13,!0)],[`^`,$(14,14,!1)],[`^^`,$(14,14,!1)]]),Jv=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Yv=/* @__PURE__ */ new Set([...Jv,`'`]),Xv=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Zv=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),Qv=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),$v=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),ey=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...Yv]),ty=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),ny=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),ry=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),iy=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),ay=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),oy=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),sy=/* @__PURE__ */ new Set([``,`*`,`-`]),cy={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},ly=(e,t)=>e.line-t.line||e.column-t.column,uy=(e,t)=>({start:ly(e.start,t.start)<=0?e.start:t.start,stop:ly(e.stop,t.stop)>=0?e.stop:t.stop}),dy=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),fy=(t,n,r=`Proof.Parser`)=>new e.F(t,void 0,{reason:t,line:n.start.line,column:n.start.column,isEnd:!1,proof:{stop:n.stop,exception:r}}),py=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),my=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),hy=/* @__PURE__ */ new Set([`NEW`,...my.keys()]),gy=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),_y=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),vy=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),yy=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?qv.has(e.operator):Jv.has(e.operator)),by=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,xy=e=>qv.has(e)||Jv.has(e)||e===`-.`,Sy=(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}}},Cy=(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`},wy=(t,n,r=ae(t,n===`tlapm`))=>{let i=n===`tlapm`,a=i?r:r.map(ne),o=0,s=[],l,u,d=[],f=/* @__PURE__ */ new Set,p=[],m=[],h=e=>d[d.length-1].has(e),g=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),_=[],ee=[],te=[],v=(e,t=o-1)=>{let n=e===t?te[e]:void 0;if(n)return n;let r=a[t];_[e]??=g(a[e]),ee[t]??={line:r.line,column:r.endColumn};let i={module:m[0].name,start:_[e],end:ee[t]};return e===t&&(te[e]=i),i},y=(e,t)=>(e.location.range=v(t),e),re=(e=0)=>a[Math.min(o+e,a.length-1)],b=(e=0)=>{let t=re(e),n=s[s.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ie=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),oe=0,se=e=>{let t=a.slice(oe,o).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ce=e=>i&&(e.kind===`Keyword`||vy.has(e.text)),x=e=>{let t=a.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},le=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:oy.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:ce(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,S=(t,n=re(),r)=>{let i=a[a.length-1],o=n.line===i.line&&n.column===i.column;return new e.F(`${t} at line ${n.line}, column ${n.column}`,void 0,ue(t,n,o,r))},ue=(e,t,n,r)=>{if(i&&n){let e=a[a.length-1];return{reason:`Unexpected EOF`,...se(x(e)),isEnd:n}}return i&&r?{reason:`Unexpected ${le(r)}`,...x(r),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},de=(e,t=re())=>S(e,t,t),fe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ce(e),C=(e,t=0)=>{let n=b(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},w=()=>{let e=b();if(e.kind===`End`)throw S(`Unexpected end of expression`);return o++,e},T=e=>C(e)?(o++,!0):!1,E=e=>{if(!C(e))throw de(`Expected ${JSON.stringify(e)} but found ${ie(b())}`);return w()},pe=()=>{let e=b();if(e.kind!==`Identifier`)throw de(`Expected an identifier but found ${ie(e)}`);if(ce(e))throw de(`Unexpected keyword ${e.text}`);return o++,e.text},me=()=>{let e=o;return{name:pe(),range:v(e)}},he=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),ge=()=>{let e=b();return e.kind!==`String`&&(Zv.has(e.text)||qv.has(e.text)||Yv.has(e.text))?(o++,e.text):pe()},_e=!1,ve=()=>b().kind===`Identifier`||!fe(b())?pe():(_e=!0,w().text),ye=e=>{if(!i)return e();s.push(-1);let t=e();return s.pop(),t},D=(e,t=`,`)=>{let n=[e()];for(;T(t);)n.push(e());return n},be=()=>{if(C(`<<`)){let e=1;for(;b(e).kind===`Identifier`||C(`,`,e);)e++;return C(`>>`,e)&&C(`\\in`,e+1)}let e=0;for(;b(e).kind===`Identifier`;){if(C(`\\in`,e+1))return!0;if(!C(`,`,e+1))return!1;e+=2}return!1},xe=()=>{if(C(`::`))return!0;if(!C(`(`))return!1;let e=1;for(;b(e).kind===`Identifier`&&C(`,`,e+1);)e+=2;return b(e).kind===`Identifier`&&C(`)`,e+1)&&C(`::`,e+2)},Se=()=>{if(!T(`<<`)){let e=me();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=he(C(`>>`)?[]:D(me));return E(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Ce=()=>D(()=>{let e=D(Se);E(`\\in`);let t=k();return e.map(e=>({pattern:e,set:t}))}).flat(),we=()=>{let e=b();if(i&&vy.has(e.text)){let t=o;w();let n={kind:`Identifier`,name:e.text,location:g(e)};return{subscript:y(n,t),lastArgs:[]}}let t=i&&(e.kind===`Number`||e.kind===`String`||C(`@`));if(e.kind===`Identifier`){let t=o,n=[],r=[],a=e=>(r.push(v(o,o)),n.push(pe()),e&&C(`(`)?ke():[]),s=[a(!i)];for(;C(`!`)&&b(1).kind===`Identifier`;)w(),s.push(a(!0));let c=s.slice(0,-1),l=g(e);l.range={...v(t),end:r[r.length-1].end};let u=n.join(`!`);return{subscript:c.every(e=>e.length===0)?{kind:`Identifier`,name:u,location:l}:{kind:`Apply`,operator:u,args:c.flat(),argumentCounts:[...c.map(e=>e.length),0],argumentsRange:l.range,selectorRanges:r,location:l},lastArgs:s[s.length-1]}}if(C(`<<`)||C(`(`)||C(`{`)||C(`[`)||t){let e=o,t=ze();return{subscript:t.location.range?t:y(t,e),lastArgs:[]}}throw de(`Expected a subscript but found ${ie(e)}`)},Te=e=>{let t=b(1),n=b(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&C(`==`,Yv.has(n.text)?3:4))},Ee=e=>{let t=b(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||C(`,`,1)||C(`)`,1)||t.kind===`Keyword`&&ny.has(t.text)||Te(e)},De=()=>{let e=b(),t=e.kind===`Operator`&&(qv.has(e.text)||Xv.has(e.text))&&Ee(e);if(i&&e.kind!==`String`&&(Xv.has(e.text)||ey.has(e.text)&&e.text!==`'`&&!Jv.has(e.text)||$v.has(e.text)&&b(-1).text===`(`&&b(-1).line===e.line&&b(-1).endColumn+1===e.column&&b(1).text===`)`&&b(1).line===e.line&&b(1).column===e.endColumn+1)&&Ee(e))throw S(`incomplete expression`,e);if(t&&!i&&e.text===`\\X`&&e.spelling!==`×`)throw S(`\\X may not be used as an infix operator`,e);if(t)return o++,y({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:g(e)},o-1);if(e.kind!==`String`&&ey.has(e.text)&&Ee(e)){o++;let t=g(e);if(Jv.has(e.text))return y({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o-1);let n={kind:`Identifier`,name:`argument`,location:t};return y({kind:`Lambda`,params:[n.name],body:Sy(e.text,n,t),operator:e.text,location:g(e)},o-1)}if(C(`LAMBDA`)){let t=o;w();let n=he(D(me));E(`:`);let r=k();return y({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:g(e)},t)}return k()},Oe,ke=()=>ye(()=>{let e=o;E(`(`);let t=D(De);return E(`)`),Oe=v(e),t}),Ae=()=>{let e=w();s.push(e.column);let t=[k()];for(;by(re())&&re().text===e.text&&re().column===e.column;)o++,t.push(k());return s.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:g(e)}},je=e=>ye(()=>{let t=g(e),n=b().kind===`Identifier`,r=C(`|->`,1)&&(n||fe(b()));if(r||n&&C(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o,n=g(b()),i=e();return n.range=v(t),E(r?`|->`:`:`),{name:i,value:k(),location:n}},a=[i(()=>n?pe():w().text),...T(`,`)?D(()=>i(pe)):[]];return E(`]`),{kind:e,fields:a,location:t}}if(be()){let e=o,n=Ce();if(!i||C(`|->`)){E(`|->`);let e=k();return E(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}o=e}let a=k();if(T(`->`)){let e=k();return E(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(T(`EXCEPT`)){let e=D(()=>{E(`!`);let e=[];for(;C(`.`)||C(`[`);)if(T(`.`)){if(!fe(b()))throw de(`Expected a field name but found ${ie(b())}`);if(!i&&C(`@`))throw de(`@ used in !.@`);e.push({kind:`Field`,name:w().text})}else E(`[`),e.push({kind:`Index`,args:D(()=>k())}),E(`]`);return E(`=`),{path:e,value:k()}});return E(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!C(`]_`)){let e=[a];for(;T(`,`);)e.push(k());return E(`]`),{kind:`Bracket`,args:e,location:t}}return E(`]_`),{kind:`BoxAction`,action:a,subscript:we().subscript,location:t}}),Me=()=>{let e=o,t=y(O(),e),n=g(w());return y({kind:`Apply`,operator:`\\in`,args:[t,k()],location:n},e)},Ne=e=>ye(()=>{let t=g(e);if(T(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(be()&&(b(1).text===`\\in`||C(`<<`))){let e=o,n=Se();E(`\\in`);let r=k();if(T(`:`)){let e=k();return E(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o=e}let n=b().kind===`Identifier`&&C(`\\in`,1)?Me():k();if(T(`:`)){let e=Ce();return E(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;T(`,`);)r.push(k());return E(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Pe=e=>{let t=g(e),n=ye(()=>C(`>>`)||C(`>>_`)?[]:D(()=>k()));if(T(`>>_`)){if(n.length!==1)throw S(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:we().subscript,location:t}}return E(`>>`),{kind:`Tuple`,elements:n,location:t}},Fe=e=>{let t=g(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&be()){let e=Ce();return E(`:`),{kind:n,bounds:e,body:k(),location:t}}let i=he(D(me));return E(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:k(),isTemporal:r,location:t}},Ie=e=>{let t=[];do{let n=o;if(T(`OTHER`))return E(`->`),{kind:`Case`,arms:t,other:k(),otherRange:v(n),location:g(e)};let r=k();E(`->`),t.push({condition:r,body:k()})}while(T(`[]`));return{kind:`Case`,arms:t,other:void 0,location:g(e)}},Le=()=>{let e=b(1);return C(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||ty.has(e.text)||e.kind===`Operator`&&(qv.has(e.text)||Yv.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&Zv.has(e.text))},Re=()=>{let e=w();if(e.kind===`Number`)return{kind:`Operand`,operand:c(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return o--,{kind:`Bound`,args:ke()}}return{kind:`Name`,name:e.text,args:C(`(`)?ke():[]}},ze=e=>{let t=o,r=w(),a=g(r);if(i&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=D(pe);return E(`:`),{kind:`Lambda`,params:e,body:k(),location:a}}if(r.kind===`Number`){if(i&&/^\\[BOH]/.test(r.text))throw S(`incomplete expression`,r);return{kind:`Number`,value:c(r.text),text:r.text,location:a}}if(r.kind===`Decimal`)return{kind:`Decimal`,text:r.text,location:a};if(r.kind===`String`)return{kind:`String`,value:r.text,location:a};let s=r.kind===`Step`&&nt(r);if(!i&&s&&$e()<0&&Qe.length<=1)throw S(`Step number used outside proof`,r);if(s&&r.text[1]===`+`)throw S(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||s){let n=s?rt(r)??r.text:r.text;if(xe()){let o=he(T(`(`)?D(me):[]);o.names.length>0&&E(`)`),E(`::`);let s=v(t),c=k();if(!i&&e!==void 0&&l!==void 0&&yy(c)&&e.high>=l.low)throw S(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:n,params:o.names,paramRanges:o.ranges,head:s,body:c,location:a}}let c=C(`(`);if(n===`@`&&!c&&!Le())return{kind:`ExceptAt`,location:a};let u=c?ke():[],d=[c?Oe:void 0];if(!Le())return c?{kind:`Apply`,operator:n,args:u,argumentsRange:Oe,location:a}:{kind:`Identifier`,name:n,location:a};let f=[{kind:`Name`,name:n,args:u}],p=[v(t,t)];for(;Le();)w(),p.push(v(o,o)),Oe=void 0,f.push(Re()),d.push(Oe);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),g=f.flatMap(e=>`args`in e?e.args:[]),_=f.map(e=>`args`in e?e.args.length:0),ee=d.at(-1)??v(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:a}:g.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:a}:{kind:`Apply`,operator:h,args:g,..._.slice(0,-1).some(e=>e>0)&&{argumentCounts:_},argumentsRange:ee,selectorRanges:p,argumentRanges:d,location:a}}if(r.kind===`Operator`&&xy(r.text)&&C(`(`)){let e=ke();return n===`tlc`&&r.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:a}:{kind:`Apply`,operator:r.text,spelling:r.spelling,args:e,location:a}}if(r.kind===`Operator`&&xy(r.text)&&!i)return{kind:`Identifier`,name:r.text,spelling:r.spelling,location:a};switch(r.text){case`(`:{let e=ye(()=>k());return E(`)`),e}case`[`:return je(r);case`{`:return Ne(r);case`<<`:return Pe(r);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Fe(r);case`IF`:{let e=k();E(`THEN`);let t=k();return E(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:k(),location:a}}case`CASE`:return Ie(r);case`LET`:{let e=[],t=[];for(d.push(/* @__PURE__ */ new Set);!T(`IN`);){if(i&&C(`RECURSIVE`))throw S(`Unexpected keyword RECURSIVE`,se(re()));if(T(`RECURSIVE`)){Ye();continue}let n=Ue(!i&&T(`LOCAL`));n.kind===`Instance`?t.push(n):e.push(n)}d.pop();let n=k();return t.length===0?{kind:`Let`,definitions:e,body:n,location:a}:{kind:`Let`,definitions:e,instances:t,body:n,location:a}}case`CHOOSE`:{let e=Se(),t=T(`\\in`)?k():void 0;return E(`:`),{kind:`Choose`,pattern:e,set:t,body:k(),location:a}}case`WF_`:case`SF_`:{let e=we(),t=!C(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:ye(()=>{E(`(`);let e=k();return E(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:a}}}throw de(`Unexpected ${ie(r)}`,r)},Be=(e,t,n)=>{l=u={low:t,high:n};let r=k(i?Math.min(n+1,Gv.low):n+1),a=b(),o=Yv.has(a.text)?Gv.high:qv.get(a.text)?.high;if(!i&&a.kind===`Operator`&&o!==void 0&&o>=t)throw S(`Precedence conflict between ${e.text} and ${a.text}`,a);return r},O=()=>{let e=u;u=void 0;let t=b(),n=g(t);if(t.kind===`Operator`&&by(t))return Ae();if(i&&qv.has(t.text)&&C(`(`,1)){let e=o,r=ye(()=>{w(),w();let r=k();if(!T(`,`))return;let i=k();E(`)`);let a={kind:`Apply`,operator:t.text,args:[r,i],location:n};return y(a,e)});if(r!==void 0)return r;o=e}if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return w(),{kind:`Apply`,operator:`~`,args:[Be(t,4,4)],location:n};case`-`:case`-.`:if(t.text===`-.`&&!i)break;return w(),{kind:`Apply`,operator:`-.`,args:[Be(t,12,12)],location:n};case`[]`:return w(),{kind:`Always`,expression:Be(t,4,15),location:n};case`<>`:return w(),{kind:`Eventually`,expression:Be(t,4,15),location:n};case`ENABLED`:return w(),{kind:`Enabled`,expression:Be(t,4,15),location:n};case`UNCHANGED`:return w(),{kind:`Unchanged`,expression:Be(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return w(),{kind:`Apply`,operator:t.text,args:[i?k(9):Be(t,10,13)],location:n}}return ze(e)},k=(e=0)=>{let t=o,n=O(),r=n.location.range?n:y(n,t),a;for(;;){let n=b();if(n.kind!==`Operator`)break;let o=g(n);if(n.text===`'`&&e<=15){w(),l=Gv,r=y({kind:`Prime`,expression:r,location:o},t);continue}if(Jv.has(n.text)&&e<=15){w(),l=Gv,r=y({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r],location:o},t);continue}if(n.text===`[`){w();let e=ye(()=>D(()=>k()));ye(()=>E(`]`)),l=Kv,r=y({kind:`FunctionApplication`,function:r,args:e,location:o},t);continue}if(n.text===`.`&&fe(b(1))){w();let e=w().text;r=y({kind:`FieldAccess`,record:r,field:e,location:o},t);continue}let s=qv.get(n.text);if(!s||s.low<e)break;if(a){let e=!(a.low>s.high||a.high<s.low),t=a.text===n.text&&s.isAssociative;if(e&&!t&&(a.text!==`\\X`||n.text!==`\\X`))throw S(`Precedence conflict between ${a.text} and ${n.text}`,n)}if(w(),!i&&s.low>12&&C(`-`))throw S(`Precedence conflict between ${n.text} and -`,b());l=u=s;let c=k(s.high+1);if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,i=[v(t).end];r=r.kind===e&&a?.text===n.text?{...r,operands:[...r.operands,c],prefixEnds:[...r.prefixEnds??[],...i]}:{kind:e,operands:[r,c],prefixEnds:i,location:o}}else r=n.text===`\\X`?r.kind===`Product`&&a?.text===`\\X`?{...r,factors:[...r.factors,c]}:{kind:`Product`,factors:[r,c],location:o}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r,c],location:o};r=y(r,t),a={...s,text:n.text}}return r},Ve=()=>{if(!T(`(`))return[];let e=Je();return E(`)`),e},He=()=>{let e=g(b()),t=k(),n=a[o-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:m[0].name,start:e,end:r}}},Ue=e=>{let t=o;return y(Ge(e),t)},We=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),Ge=e=>{let t=b(),n=o,r=g(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:v(n,o-2),...He(),isLocal:e,isRecursive:h(t),location:r});if(t.kind===`Identifier`&&b(1).kind===`Operator`&&qv.has(b(1).text)&&b(2).kind===`Identifier`&&C(`==`,3)){let e=me(),t=w().text,n=me();return E(`==`),i(t,[We(e),We(n)])}let a=t.kind!==`String`&&Zv.has(t.text),s=t.kind===`Identifier`&&Yv.has(b(1).text)&&C(`==`,2);if(a||s){let e=a?t.text:b(1).text;a&&w();let n=me();return s&&w(),E(`==`),i(e,[We(n)])}let c=pe();if(T(`[`)){let t=ye(()=>Ce());return E(`]`),E(`==`),{kind:`Function`,name:c,bounds:t,body:k(),isLocal:e,isRecursive:h(c),location:r}}let l=o,u=Ve();return E(`==`),C(`INSTANCE`)?{...A(c,u,e,r),definitionRange:v(l)}:i(c,u)},A=(e,t,n,r)=>{let i=o;return E(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ve(),substitutions:T(`WITH`)?D(()=>{let e=o,t=ge(),n=v(e);return E(`<-`),{name:t,nameRange:n,expression:De()}}):[],isLocal:n,location:r,instanceRange:v(i)}},Ke=()=>{let e=o;return y(qe(),e)},qe=()=>{let e=g(b());if(C(`_`)&&b(1).kind===`Operator`)return w(),{name:w().text,arity:T(`_`)?2:1,location:e};if(b().kind!==`String`&&(Zv.has(b().text)||i&&b().kind===`Operator`)&&C(`_`,1)){let t=w().text;return w(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=pe();if(!T(`(`))return{name:t,arity:0,location:e};let n=D(()=>E(`_`));return E(`)`),{name:t,arity:n.length,location:e}},Je=()=>D(Ke),Ye=()=>{let e=Je();return e.forEach(e=>d[d.length-1].add(e.name)),e},Xe=e=>{let t=0,n=e;do{let e=b(n);if(e.kind===`End`)return n;e.kind===`Operator`&&gy.has(e.text)&&t++,e.kind===`Operator`&&_y.has(e.text)&&t--,n++}while(t>0);return n},Ze=()=>{let e=b(),t=b(1);return e.kind===`Identifier`?C(`(`,1)||C(`[`,1)?C(`==`,Xe(1)):t.kind===`Operator`&&Yv.has(t.text)?C(`==`,2):t.kind===`Operator`&&qv.has(t.text)?b(2).kind===`Identifier`&&C(`==`,3):C(`==`,1):e.kind!==`String`&&Zv.has(e.text)&&t.kind===`Identifier`&&C(`==`,2)},Qe=[],$e=()=>Qe[Qe.length-1]??-1,et=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),tt=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},nt=e=>!e.text.endsWith(`.`)&&!sy.has(tt(e)),rt=e=>{let t=tt(e);if(sy.has(t))return;let n=et(e);if(n>=0)return`<${n}>${t}`;let r=$e(),i=Qe[Qe.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},it=e=>{if(e.kind===`Keyword`)return iy.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Qe.length===0;if(e.text[1]===`+`||Qe.length===0)return!0;let t=$e();return t>=0&&et(e)>t},at=e=>{let t=et(e),n=Qe.length-1,r=Qe[n-1]??-1,i=Qe[n]<0;return i&&(Qe[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Qe[n]===t},ot=e=>!f.has(e)&&m.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),st=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!vy.has(e.name)&&!ot(e.name):!1,ct=()=>{let e=b();return e.kind===`Step`?nt(e):e.kind===`Keyword`?py.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Ze()},lt=()=>{let e=o,t=b();return t.kind===`Operator`&&!Qv.has(t.text)&&xy(t.text)?(o++,y({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:g(t)},e)):T(`MODULE`)?y({kind:`ModuleFact`,name:pe(),location:g(t)},e):k()},ut=e=>p[p.length-1]?.add(e),dt=e=>{p.push(/* @__PURE__ */ new Set);let t=e();return p.pop(),t},ft=e=>p.some(t=>t.has(e))||m.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),pt=()=>{let e=o,t=b(),n=D(()=>{let e=b();if((e.kind!==`Identifier`||ce(e))&&e.kind!==`Operator`)throw de(`Expected a definition name but found ${ie(e)}`,e);return o++,e.text},`!`),r=g(t);return y(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},mt=()=>{if(i)return D(pt);let e=D(lt),t=n===`tlc`?e.find(e=>e.kind===`Identifier`&&ft(e.name)):void 0;if(t)throw S(`DEF clause entry should describe a defined operator`,t.location);return e},ht=()=>{let e=ct()?D(lt):[],t=T(`DEF`)||T(`DEFS`);if(i&&e.length===0&&!t)throw de(`Expected a fact`);return{facts:e,defs:t?mt():[]}},gt=()=>{let t=o,r=w(),i=r.text===`USE`&&T(`ONLY`),a=v(t),s={kind:r.text===`USE`?`Use`:`Hide`,isOnly:i,...ht(),keyword:a,location:g(r)},c=s.kind===`Hide`&&n===`tlc`?s.facts.filter(e=>!st(e)):[];if(c.length>0)throw e.q(c.map(n=>({location:e.X(n.location.range??v(t)),message:`The only expression allowed as a fact in a HIDE is
|
|
1785
|
-
the name of a theorem, assumption, or step.`})));return y(s,t)},_t=()=>{let e=o,t=g(b()),n=T(`NEW`),r=i?o:e,a=i?g(b()):t,s=b().kind===`Keyword`?my.get(b().text):void 0;if(!n&&s===void 0)throw de(`Expected a declaration but found ${ie(b())}`);if(s!==void 0&&w(),s===`Variable`){let e=me();return ut(e.name),y({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:a},r)}let c=Ke();ut(c.name);let l=(s??`Constant`)===`Constant`&&C(`\\in`);if(l&&c.arity>0)throw S(`declared symbol with arguments before \\in`);return l&&w(),y({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?k():void 0,nameRange:c.location.range,location:a},r)},vt=()=>{let e=o,t=g(E(`ASSUME`)),n=D(()=>(b().kind===`Identifier`&&C(`::`,1)&&C(`ASSUME`,2)&&(w(),w()),C(`ASSUME`)?dt(vt):b().kind===`Keyword`&&hy.has(b().text)?_t():k()));return E(`PROVE`),y({kind:`AssumeProve`,assumptions:n,conclusion:k(),location:t},e)},yt=e=>{let t=0;for(;b(t).kind===`Identifier`&&C(`,`,t+1);)t+=2;return b(t).kind===`Identifier`&&C(e,t+1)},bt=(e,t)=>{e.forEach(ut),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(ut))},xt=()=>{let e=b();if(C(`USE`)||C(`HIDE`))return gt();if(C(`INSTANCE`)){let t=o;return y(A(void 0,[],!1,g(e)),t)}if(C(`DEFINE`)||Ze()){let t=o;T(`DEFINE`);let n=[Ue(!1)];for(;Ze();)n.push(Ue(!1));let r={kind:`Define`,definitions:n,location:g(e)};return y(r,t)}if(T(`HAVE`))return{kind:`Have`,expression:k()};if(T(`TAKE`)){let e=be(),t=he(e?[]:D(me)),n=e?Ce():[];return bt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(T(`WITNESS`))return{kind:`Witness`,expressions:D(()=>k())};if(T(`PICK`)){let e=yt(`:`),t=he(e?D(me):[]),n=e?[]:Ce();return bt(t.names,n),E(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:k()}}return T(`CASE`)?{kind:`Case`,expression:k()}:{kind:`Assert`,isSuffices:T(`SUFFICES`),statement:C(`ASSUME`)?vt():k()}},St=e=>{let t=b();if(t.kind!==`Step`)throw de(`Expected a step number but found ${ie(t)}`,t);if(!at(t))throw S(`${e?`QED step`:`step`}'s number has bad level`,t);if(n!==`sany`&&et(t)<0&&rt(t)!==void 0)throw S(`<*> and <+> cannot be used for a named step`,t);return o++,{name:rt(t),token:t.text,location:g(t)}},Ct=()=>{let e=o,t=St(C(`QED`,1)),n=o,r=/* @__PURE__ */ new Set;p.push(r);let i=T(`QED`)?{kind:`Qed`}:xt(),a=v(e),s=v(n),c=it(b());if(c&&!ay.has(i.kind))throw S(`Proof of a step that does not take a proof`);let l=c?Et():void 0;return p.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(ut),y({...t,body:i,head:a,statement:s,proof:l},e)},wt=e=>{if(T(`BY`)){let t=v(o-1);return{kind:`By`,isOnly:T(`ONLY`),...ht(),keyword:t,location:e}}let t=b();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;w();let n=v(o-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Tt=()=>{let e=g(b());T(`PROOF`);let t=wt(e);if(t)return t;let n=[Ct()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(Ct());return{kind:`Steps`,level:$e(),steps:n,location:e}},Et=()=>{let e=o;Qe.push(-1);let t=dt(Tt);return Qe.pop(),y(t,e)},Dt=()=>b().kind===`Step`||b().kind===`Keyword`&&iy.has(b().text),Ot=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return dy(e);let n=t.defs[t.defs.length-1]?.location.range;return uy(dy({...e,end:e.start}),dy(n??t.keyword))},kt=()=>{let e=o,t=g(b()),n=T(`PROOF`),r=wt(t);if(r){let t=y(r,e);return{kind:`Leaf`,proof:t,span:dy(t.keyword),first:e,end:o-1}}let i=b();if(i.kind!==`Step`)throw de(`Expected a step number but found ${ie(i)}`);let a=o;w();let s=o,c=T(`QED`)?{kind:`Qed`}:xt(),l=v(a);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:v(s),span:Ot(l,c),first:e,start:a,end:o-1}},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=j(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={...g(a[i.first]),range:v(i.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},j=(e,t,n,r,i)=>{let a=e[t];if(!a)throw fy(`Unexpected end of (sub)proof at level ${n} before QED step`,r);if(a.kind===`Leaf`)throw fy(`Expecting a proof step but found a${cy[a.proof.kind]} leaf proof`,a.span);if(!i&&a.isProof)throw fy(`PROOF keyword found in step that does not begin subproof`,a.span);let o=a.token.text[1];if(o===`+`&&!i)throw fy(`<+> used but no subproof expected`,a.span);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:et(a.token);if(s<n||!i&&s>n)return;let c=ay.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:rt(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{...g(a.token),range:v(a.start,l)}},d=uy(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=j(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)}},jt=()=>{if(!Dt())return;let e=[];for(;Dt();)e.push(kt());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=At(e,0,0,t.span),r=e[n.next];if(r)throw fy(`extra step(s) after finished proof`,r.span,`Proof.Parser.toplevel`);return n.proof},M=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},N=()=>{if(b().kind!==`Identifier`||!C(`==`,1))return;let e=pe();return f.add(e),w(),e},Mt=e=>{let t=o,n=w(),r=N(),a=dt(()=>{let e=C(`ASSUME`)?vt():k();return i?{statement:e,proof:jt()}:{statement:e,proof:it(b())?Et():void 0}}),s=a.statement,c=y({name:r,statement:s,proof:a.proof,location:g(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&s.kind!==`AssumeProve`&&M(e,y({kind:`Operator`,name:r,params:[],body:s,isLocal:!1,isRecursive:!1,location:g(n)},t))},Nt=()=>{let e=o,t=w(),n=N();return y({name:n,expression:k(),isAxiom:t.text===`AXIOM`,location:g(t)},e)},Pt=()=>{let e=g(E(`----`));E(`MODULE`);let t=ve();E(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(m.push(n),d.push(/* @__PURE__ */ new Set),T(`EXTENDS`)&&D(()=>{let e=o;n.extends.push(ve()),n.extendsRanges.push(v(e))});;){let t=o;oe=t;let r=b();if(r.kind===`ModuleEnd`)return e.range={module:m[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},m.pop(),d.pop(),n;if(r.kind===`Separator`){if(C(`MODULE`,1)){let e=Pt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),E(`====`);continue}w()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=g(w()),r=Je();n.constants.push(...r),e.range=v(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=g(w()),r=D(()=>{let e=o,t=g(b());return y({name:pe(),arity:0,location:t},e)});n.variables.push(...r),e.range=v(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Nt();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&M(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(C(`USE`)&&C(`ONLY`,1))throw de(`Expected a module unit but found ${ie(r)}`);let e=gt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=g(w()),r=Ye();e.range=v(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:Ft(n,y(A(void 0,[],!1,g(r)),t));continue;case`LOCAL`:if(w(),C(`INSTANCE`)){Ft(n,y(A(void 0,[],!0,g(r)),t));continue}Ft(n,y(Ge(!0),t));continue}r.kind===`Keyword`&&ry.has(r.text)?Mt(n):Ft(n,Ue(!1))}}},Ft=(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}))},It=Pt(),Lt=_e?Wv(t):void 0;if(Lt!==void 0)throw new e.F(Lt);return It},Ty=e=>wy(e,`tlc`),Ey=(e,t)=>wy(e,`tlc`,t),Dy=e=>wy(e,`tlapm`),Oy=e=>wy(e,`sany`),ky=`$subexpression`,Ay=(t,n)=>new e.F(`${t} at line ${n.line}, column ${n.column}`),jy=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return jy(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of Be(e)){let e=jy(r,t,n);if(e)return e}},My=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Ny=(e,t)=>{let n=e.location,r=My(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 Ay(`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 Ay(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:ky,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:ky,args:e.args,location:n,resolution:_s},location:n}},Py=(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:_s})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:_s}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:_s};return Ny({...t,params:[...t.params,...r]},a)},Fy=(t,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s=0,c,l=!1,u=(n,i)=>{if(!n)throw Ay(i,a);ys.set(r,{args:t.slice(0,s).flatMap(e=>`args`in e?e.args:[]),error:{location:e.X(n),message:i}}),l=!0},d=e=>{let r=[],i=[];for(;s<t.length;){let o=t[s];if(o.kind!==`Name`)throw Ay(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=e?e.find(e=>Vc(e)===c):n(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s++}throw Ay(`Unknown operator ${r.join(`!`)}`,a)},f=e=>{let n=d(e),l=n.definition,f=ws(l),p=s===t.length-1;if(n.args.length!==f&&(!i||n.args.length!==0))return u(r.argumentRanges?.[s]??a.range,`The operator ${n.name} requires ${f-n.earlier} arguments.`);if(p)return{definition:l,args:n.args};if(l.kind!==`Operator`)throw Ay(`Cannot select a subexpression of ${l.name}`,a);o.params.push(...l.params),o.args.push(...n.args),c=l.body,s++},p=()=>{for(;s<t.length&&!l;){let e=t[s];if(e.kind!==`Name`)return;let n=r.selectorRanges?.[s],a=c&&jy(c,e.name,[]);if(!a)return u(n,`Cannot find label \`${e.name}'.`);let l=a.label.params;if(!i&&e.args.length!==l.length)return u(n,`Label \`${e.name}' used with wrong number of arguments.`);o.lets.push(...a.lets),o.params.push(...l.map(e=>({name:e,arity:0}))),o.args.push(...e.args),c=a.label.body,s++}},m=e=>{if(!c)throw Ay(`Subexpression selection failed`,a);if(e.kind===`Colon`)return;if(c.kind===`Label`){c=c.body,m(e);return}if(c.kind===`Let`){if(e.kind!==`Operand`||Gs(e.operand,1)!==0)throw Ay(`A LET/IN expression has only one operand`,a);o.lets.push(c.definitions),c=c.body;return}let n=Ys(c);if(n&&(e.kind===`Bound`||e.kind===`At`)){o.params.push(...n.names.map(e=>({name:e,arity:0}))),e.kind===`Bound`&&o.args.push(...e.args),c=n.body;return}if(c.kind===`Case`&&e.kind===`Operand`){let n=[...c.arms,...c.other?[{condition:void 0,body:c.other}]:[]],r=n[Gs(e.operand,n.length)],i=t[s+1];if(!r||i?.kind!==`Operand`)throw Ay(`A subexpression of CASE must have the form !i!j`,a);s++;let o=Gs(i.operand,2),l=o===0?r.condition:o===1?r.body:void 0;if(!l)throw Ay(`Nonexistent CASE operand`,a);c=l;return}if(e.kind!==`Operand`)throw Ay(`Unexpected subexpression selector`,a);let r=n?n.sets:Xs(c),i=r?.[Gs(e.operand,r.length)];if(!i)throw Ay(`Nonexistent operand specified by the selector`,a);c=i},h=f(void 0);if(l)return r;if(h)return Py(h.definition,{...o,args:h.args});for(p();s<t.length&&!l;){let e=t[s];if(e.kind===`Name`){for(;c?.kind===`Label`;)c=c.body;if(c?.kind!==`Let`)throw Ay(`A name selector here must be from a LET clause`,a);o.lets.push(c.definitions);let e=f(c.definitions);if(l)return r;if(e)return Py(e.definition,{...o,args:[...o.args,...e.args]});p()}else m(e),s++}if(l)return r;if(!c)throw Ay(`Subexpression selection failed`,a);return Ny(o,c)},Iy=(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 Ks(e,t,n)},Ly=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Be(e).some(Ly),Ry=(e,t,n,r=!1)=>{if(!Ly(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Wc(e,e=>Ry(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>zy(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)=>Ry(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Wc(e,e=>Ry(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?Iy(a.name,[],void 0,t):a.kind===`Apply`?Iy(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Fy(o,t,a,r);return c!==a&&vs.add(c),c},zy=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:Ry(e.expression,t,n,!0)}))}),By=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Vy=(e,t)=>zy(e,By(t.definitions),()=>!1),Hy=(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=By([...t,...e.definitions]),a=e=>n.has(e),o=By([...t,...e.definitions,...r]),s=e=>Ry(e,o,e=>a(e)&&r.every(t=>t.name!==e)),c=e=>a(e)||!i(e),l=e=>Ry(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 zy(e,i,c);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?zy(e,i,c):Uc(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=>Ly(e.body))||e.assumptions.some(e=>Ly(e.expression))?{...h,definitions:e.definitions.map(e=>Uc(e,s)),assumptions:e.assumptions.map(e=>({...e,expression:s(e.expression)}))}:h},Uy=(e,t)=>e.maxLevels[t]??3,Wy=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=Xl({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(e,a),a},i=/* @__PURE__ */ new Map,a=e=>{let n=i.get(e);if(n)return n;let a=t(e),o=r(e),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Dl(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Dl(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ol(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=wl(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)&&Dl(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(Zl(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c};return n=>{let i=/* @__PURE__ */ new Map,o=e.X(n.location.range??{module:n.instancer,start:n.location,end:n.location}),s=e=>i.set(`${o}\n${e}`,{location:o,message:e}),c=t(n.module),l=a(n.module),u=r(n.instancer),d=/* @__PURE__ */ new Map;n.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...c.constants.map(e=>({...e,maximumLevel:0})),...c.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let t=n.substitutions.get(e.name);if(!t)return[];if(e.arity===0){let n=u.analyze(t,d);return[{...e,level:n.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(t,d);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),p=(e,t)=>`Level error in instantiating module '${n.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${t}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&s(p(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${n.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let t=l.constraints.get(e.name);t!==void 0&&e.level>t&&s(p(e.name,t));let r=e.operator;r&&Array.from({length:e.arity},(t,i)=>{let a=l.argConstraints.get(Sl(e.name,i));a!==void 0&&Uy(r,i)<a&&s(`Level error in instantiating module '${n.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),l.argParams.forEach(e=>{let t=wl(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=Uy(r,t.index);i.level>a&&s(`Level error when instantiating module '${n.module}':\nThe level of the argument ${t.index} of the operator ${t.operator}' \nmust be at most ${a}.`)}),i.size>0)throw e.q([...i.values()])}},Gy=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],Ky=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),qy=new Map(vf.flatMap(e=>e.map(t=>[t,e[0]]))),Jy=e=>qy.get(e)??e,Yy=()=>{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}}},Xy=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:k(e)&2147483647,kind:t,isLocal:n}),Zy=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:Jy(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:Jy(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}},Qy=(e,t)=>{let n=[];for(let r=t;;){let t=Zy(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},$y=e=>({line:e.line,column:e.column}),eb=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text!==`.`){if(a.text===`EXTENDS`){let n=Qy(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},tb=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,nb={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},rb=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&tb(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&tb(e[n+1],e[n+2])?n+=tb(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=>nb[e])}"`:r.text)}return t},ib=e=>e[2]?.text,ab=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},ob=(e,t)=>e.find(e=>e.name===t)??e.map(e=>ob(e.modules,t)).find(Boolean),sb=e=>{let t=e===void 0?[]:ae(e),n;return{tokens:t,ranges:ab(t),getModule:()=>n??=e===void 0?Ty(``):Ey(e,t)}},cb=(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=sb(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)??Sf.get(i)??Tf.get(i)??Cy(e,i),c=a(s),l=c.tokens,u=c.ranges.get(ib(l)??``)??{start:0,end:0},d={tokens:l,...u,getModule:c.getModule};return n.set(i??``,d),c.ranges.forEach((e,t)=>{e.start===u.start||r.has(t)||r.set(t,{tokens:l,...e,getModule:()=>ob(d.getModule().modules,t)??d.getModule()})}),d};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},lb=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=Qy(t,e+1);i.push({location:$y(t[e]),apply:e=>r.forEach(t=>e.put(Xy(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c=new Set(n.units.flatMap(e=>e.kind===`Constants`||e.kind===`Variables`?[`${e.location.line}:${e.location.column}`]:[])),l=0;t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r;if(n.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l++,l===2){let e=t[u+2].text;i.push({location:$y(n),apply:t=>t.put(Xy(e,`module`,!1))})}return}if(n.kind===`ModuleEnd`&&l--,l!==1||n.kind!==`Keyword`)return;let d=c.has(`${n.line}:${n.column}`);d&&(n.text===`CONSTANT`||n.text===`CONSTANTS`)&&o(u,`constant`),d&&(n.text===`VARIABLE`||n.text===`VARIABLES`)&&o(u,`variable`),n.text===`RECURSIVE`&&Qy(t,u+1).every(e=>s.has(e))&&o(u,`definition`),Ky.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push($y(n)),i.push({location:$y(n),apply:e=>e.put(Xy(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(Xy(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=Jy(e.name);i.push({location:e.location,apply:n=>n.put(Xy(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(Xy(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(Xy(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>Cs(e.location,t.location)?-1:+!!Cs(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=Yy();n.set(i??``,o),_f.toReversed().forEach(e=>o.put(Xy(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)}}},ub=(t,n)=>{let r=/* @__PURE__ */ new Set,i=e=>{r.add(e)},a=e=>{e.kind===`ModelValue`&&i(e.name),e.kind===`String`&&i(e.value),e.kind===`Set`&&e.elements.forEach(a)};n.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),yf.forEach(i);let o=e=>{let n=t(e);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=eb(o(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),g=m(e=>e.instances),_=/* @__PURE__ */ new Set([void 0]),ee=/* @__PURE__ */ new Map;rb(o(void 0)).forEach((e,t)=>{t===3&&xf.forEach(i),i(e)});let te=l(void 0);for(;;){let n=h(te,/* @__PURE__ */ new Set)??g(te,/* @__PURE__ */ new Set);if(!n)break;let[r,a]=n;if(d.add(`${r.key}>${a}`),ee.set(r.unit,[...ee.get(r.unit)??[],a]),!_.has(a)){if(_.add(a),t(a).tokens.length===0){let n=r.unit??ib(t(void 0).tokens);throw e.K(a,n)}rb(o(a)).forEach(i)}}Gy.forEach(i);let v=/* @__PURE__ */ new Set,ne=e=>{if(v.has(e))return;v.add(e);let t=ee.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(ne),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return ne(void 0),bf.forEach(i),[...r]},db=(e,t)=>{let n=cb(e,t),r=n.getParsed,i,a=()=>i??=lb(r);return{getStringOrder:e=>ub(r,e),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},fb=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),pb=t=>{switch(t.kind){case`Number`:if(!Pt(t.value))throw e.it(new e.O(`TLC can't handle a number this big.\n${t.value}`),e.tt.error);return t.value;case`String`:case`Boolean`:return t.value;case`ModelValue`:return yn(t.name);case`Set`:return F({kind:`MixedSet`,elements:t.elements.map(pb)})}},mb=t=>{try{return pb(t)}catch(t){throw!(t instanceof e.b)||t instanceof e.O||t instanceof e.x?t:e.it(new e.b(`${e.G}${t.message}`),e.tt.error)}},hb=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],gb=(t,n,r)=>{try{return r.parseModule(t)}catch(r){if(!(r instanceof e.F))throw r;let i=Wv(t);throw i===void 0?r:e.q([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},_b=t=>new e.F(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),vb=(t,n)=>t.location.range&&n.location.range&&{location:e.X(t.location.range),message:`Multiply-defined module '${t.name}': this definition or declaration conflicts \nwith the one at ${e.X(n.location.range)}.`},yb=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,bb=e=>e===`Theorem`?`ThmOrAssumpDefNode`:yb(e),xb=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:sl(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),Sb=(t,n,r)=>{let i=`{ ${r.map(e=>`<${[...e[0],e[1]].map(e=>L(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:t,arity:n,evaluate:t=>{let n=r.find(n=>{if(n[0].length!==t.length)throw new e.b(`Attempted to apply the operator ${i}\nwith wrong number of arguments.`);return n[0].every((e,n)=>{let r=t[n];return(typeof r!=`object`||r.kind!==`Operator`)&&Pn(e,r)})});if(n)return n[1];throw new e.b(`Attempted to apply operator:\n${i}\nto arguments (${t.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:L(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},Cb=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||Be(e).some(e=>Cb(e,t)),wb=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(nl(e),n.get(e)??n.size)),n},Tb=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Eb=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw fh(e);if(e.kind===`Number`&&!Pt(e.value))throw ph(e);Eb(e.kind===`Let`?[...Be(e),...Tb(e.instances??[])]:Be(e))}),Db=(t,n)=>{let r=n.order??db(n.source,n.loadModule),i=r.parseModule(n.source),a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Set,l=/* @__PURE__ */ new Set,u=new Map(If.map(e=>[e.name,e])),d=/* @__PURE__ */ new Map,f=Ud(t.checkDeadlock,n.seed);f.isWarningEnabled=n.isWarningEnabled??!0,f.isTool=n.isTool??!1,f.version=n.version??`master`;let p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,h=[],g=/* @__PURE__ */ new Map,_=[],ee=[],te=(e,t)=>_.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),v=0,ne=e=>`${e}#${v++}`,y=[],re=[],b=Wy(e=>{let t=m.get(e)??ue(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>a.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>a.get(t.visible.get(e)?.key??e)}}),ie=/* @__PURE__ */ new Map,ae=/* @__PURE__ */ new Map,oe=/* @__PURE__ */ new Map,se=e=>{let t=d.get(e);if(t)return t;let r=rp(e,n.print,f,n.files,u);if(!r)return;np.get(e)?.forEach(se);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>se(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{u.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:yl.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:xl(e,t.name)??i.get(t.name)?.range})}),d.set(e,i),i},ce=e=>{let t=np.get(e)??[];if(e===`TLCExt`||[e,...t].some(e=>n.loadModule?.(e)!==void 0))return;let r=se(e);return r&&te(e,t),r&&t.includes(`Integers`)&&se(`Integers`),r},x=e=>(Eb([...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]),...Tb(e.instances)]),e.modules.forEach(x),e);x(i);let le=(t,i)=>{let a=n.loadModule?.(t)??Df(f.version).get(t)??Cy(n.source,t);if(a===void 0)throw e.K(t,i);let o=gb(a,t,r);if(o.name!==t)throw e.q([{location:`Unknown location`,message:`File name '${t}' does not match the name '${o.name}' of the top level module it contains.`}],!0);return x(o)},S=t=>{let n=ee.indexOf(t.name);if(n!==-1){let r=[...ee.slice(n),t.name].map(e=>`${e}.tla`);throw new e.F(`Circular dependency among .tla files; dependency cycle is: ${r.join(` --> `)}`)}let r=/* @__PURE__ */ new Set,i=[],a=[],o=[];ee.push(t.name),_.push(r);let s=ge(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:re,levelChecks:o});if(_.pop(),ee.pop(),a.length>0)throw e.q(a,!1,void 0,re);let c=i.find(e=>r.has(e.name)),l=c&&p.get(c.name),u=l&&vb(c,l.module);if(u)throw e.q([u],!1,void 0,re);if(c)throw _b(c);return o.forEach(e=>e()),{linked:s,closure:r}},ue=(t,r)=>{let i=p.get(t);if(i)return te(t,g.get(t)??[]),i;let o=S(le(t,r)),s=/* @__PURE__ */ new Map;return tp(t,n.print,f,n.files,u,(t,n,r)=>{let i=s.get(t),a=n.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(i?.kind!==`Operator`||!r||a.length!==n.length)throw new e.b(`No definition of ${t} to fall back to`);let o={kind:`Closure`,name:i.name,params:i.params,body:i.body,scope:void 0};return W(i.body,{environment:r.environment,scope:yg(o,a,r),state:r.state,next:r.next,isKeepLazy:r.isKeepLazy})})?.forEach(e=>{let n=o.linked.visible.get(e.name);if(n?.kind!==`Definition`||n.arity!==e.arity&&fb.has(t))return;let r=a.get(n.key);r&&s.set(e.name,r),u.set(n.key,e),a.delete(n.key)}),p.set(t,o.linked),g.set(t,o.closure),te(t,o.closure),o.linked},de=(e,t,n,r,i)=>{let u=i?void 0:ce(e.module);if(u)return fe(e,u);let d=i??ue(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=hb(d),p=`#${v++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=Mc(Vy(e,t),f,t,n);y.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>l.add(e));let _=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,ee=ml({params:g,substitutions:new Map([...h].map(([e,t])=>[e,Rc(t,m)])),variables:new Set(d.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>o.get(e)===!0,addDefinition:(n,i,l)=>{let u=ne(`${i}@${t.name}`),d=l(u);return a.set(u,d),f.length>0&&c.add(d),e.name!==void 0&&ae.set(u,`${e.name}!${ae.get(n)??i}`),o.set(u,!r),s.set(u,{source:n,prefix:e.params.length}),u},createName:ne,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return C(e,d.exported,f,(t,n)=>{let r=e.name===void 0?ee.getKey(t):ee.getQualifiedKey(t);return f.length>0&&ie.set(r,{name:n,location:e.location}),e.name!==void 0&&oe.set(r,n),r})},fe=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),C=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:o.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},w=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:cl(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),T=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),E=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=T(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:cl(r,n),location:n}}},pe=(e,t,n,r)=>{let i=e.location,s=r?void 0:ce(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=T(n.arity);return w(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??ue(e.module,n),l=`#${v++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=hb(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};y.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>Cb(f(e),p),h=d.map(t=>{let n=E(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),g=[],_=ml({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:cl(e.params,i),location:i,resolution:_s}:sl(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>o.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:xb(a,i)),i},createName:ne}),ee=new Set(d.map(e=>e.name)),te=[...c.exported].filter(([e])=>!ee.has(e)).map(([t,n])=>{let r=_.getKey(n.key),a=T(n.arity),o=[...e.params,...a];return w(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...g,...te]},me=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),he=/* @__PURE__ */ new Map,ge=(t,r)=>{let s=C_(t,n.loadClass?.(t.name),t===i);he.set(t.name,s.overrides);let c=s.module,l=y.length,u=new Map([...If.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:Dc,errors:[],warnings:[]},p=[f],g=t=>t.forEach((t,n)=>{let r=_.get(n);if(!r){u.set(n,t),_.set(n,t);return}if(!r.range||!t.range||e.X(r.range)===e.X(t.range))return;let i=e.X(t.range),a=e.X(r.range);bb(r.kind)===bb(t.kind)?f.warnings.push({location:i,message:`Warning: the ${yb(r.kind)} of '${n}' conflicts with \nits ${yb(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${yb(t.kind)} of '${n}' conflicts with \nits ${yb(r.kind)} at ${a}.`})}),_=/* @__PURE__ */ new Map,ee=/* @__PURE__ */ new Set,te=/* @__PURE__ */ new Map,v=[],ne=[...c.constants],ie=c.variables.filter((e,t)=>c.variables.findIndex(t=>t.name===e.name)===t),ae=ie.map(e=>e.name),se=ie.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:ce(e);if(n){g(n);return}let i=t??ue(e,c.name);ne.push(...i.constants.filter(e=>ne.every(t=>t.name!==e.name)&&!ae.includes(e.name))),i.variables.forEach((e,t)=>{ae.includes(e)||ne.some(t=>t.name===e)||(ae.push(e),se.push(i.variableLocations[t]))}),g(i.exported),i.facts.forEach(e=>ee.add(e)),i.modules.forEach((e,t)=>te.set(t,e)),v.push(i)});let x=new Map(u),le=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],S=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});le.forEach(e=>_.set(e.name,S(e)));let w=e=>({key:E(e),arity:ws(e),params:Ts(e),kind:Oc(c,e)?`Theorem`:`Definition`,range:e.location.range}),T=ne.length===0&&ae.length===0,E=e=>c===i?e.name:`${e.name}@${r.id}`,_e=/* @__PURE__ */ new Map,ve=()=>new Map([...r.modules,...te]),ye=e=>{let t=c.modules.find(t=>t.name===e.module);return t?Cs(t.location,e.location)?te.get(t.name):void 0:ve().get(e.module)},D=e=>({imported:u,getInstance:e=>{let t=ye(e),n=t?void 0:ce(e.module);if(n)return{declarations:[],symbols:fe(e,n),instancer:c.name};let r=t??ue(e.module,c.name),i=hb(r);return{declarations:i,symbols:C(e,r.exported,i,e=>e),instancer:c.name}},bound:x,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:E,instanced:_e,facts:ee,reports:p,warnings:r.warnings}),be=e=>[...le.filter(t=>Cs(t.location,e)).map(e=>[e.name,S(e)]),...c.definitions.filter(t=>Cs(t.location,e)).map(e=>[e.name,w(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(u)),xe=e=>{let t=ve(),n=t.get(e.name),i=n&&vb(e,n.module);if(n&&!i)throw _b(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};p.push(a);let o=ge(e,{id:`${r.id}/${e.name}`,symbols:be(e.location),modules:t,nested:r.nested,errors:a.errors,warnings:a.warnings,levelChecks:r.levelChecks});i&&a.errors.push(i),n||te.set(e.name,o)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=de(e,c,D(c),T,ve().get(e.module));_e.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||_.set(n,t))})}})),...c.modules.map(e=>({location:e.location,link:()=>xe(e)}))].sort((e,t)=>Cs(e.location,t.location)?-1:1).forEach(e=>e.link());let Se=Hy(vl(c,(e,t)=>pe(e,t,c.name,ye(e))),me(u));r.errors.push(...Pc(Se,D(Se))),Se.definitions.forEach(e=>{let t=E(e);a.set(t,e),o.set(t,!T);let n=w(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!Cs(r,e.location))&&(u.set(e.name,n),e.isLocal||_.set(e.name,n))});let Ce={module:Se,constants:ne,variables:ae,variableLocations:se,visible:u,exported:_,modules:te,extended:v,facts:/* @__PURE__ */ new Set([...ee,...[...Se.theorems,...Se.assumptions].flatMap(e=>e.name??[])])};m.has(c.name)||m.set(c.name,Ce);let we=y.splice(l).map(e=>({location:e.location,check:()=>b(e)}));return r.levelChecks.push(()=>Ql(Se,{constants:new Set(ne.map(e=>e.name)),variables:new Set(ae),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>oe.get(u.get(e)?.key??e)},we,re)),h.push(Ce),Ce},_e=S(i).linked,ve=n.traceFile,ye=ve===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:ve}}],D=[...n.moduleOperators??[],...ye].map(e=>{let t=ue(e.module,i.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});h.push(...h.splice(h.indexOf(_e),1)),re.length>0&&!n.isSanyReported&&n.print(e.Z(re));let be=e=>_e.visible.get(e)?.key??e;_e.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)}),D.forEach(e=>{let t=e.key===void 0?void 0:a.get(e.key);e.kind!==`postcondition`&&t&&a.set(e.operator,t)});let xe=[],Se=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Se(e,t)),xe.push(...e.module.assumptions))};Se(_e,/* @__PURE__ */ new Set);let Ce=_e.constants.map(e=>e.name),we=_e.variables,Te=new Map([...d,...[...p].map(([e,t])=>[e,t.visible]),[i.name,_e.visible]]),Ee=e=>{let t=Te.get(e.module??``)?.get(e.name);return t?.kind===`Definition`?t:void 0},De=e=>{if(e.module===void 0)return[e.name,be(e.name)];let t=Ee(e);return t?[t.key]:[]},Oe=e=>e.module===i.name?[]:De(e),ke=e=>{let t=a.get(e);return t?.kind===`Operator`?t.params.length:_e.constants.find(t=>t.name===e)?.arity??u.get(e)?.arity??0},Ae=/* @__PURE__ */ new Map,je=/* @__PURE__ */ new Set,Me=(e,t)=>{u.set(e,t),a.delete(e),Ae.delete(e),je.add(e)};t.constants.filter(e=>e.args===void 0).forEach(e=>{let t=mb(e.value);fr(t),Oe(e).forEach(e=>{let n=ke(e);n===0?Ae.set(e,t):Me(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ne=/* @__PURE__ */ new Map;t.constants.forEach(t=>{if(t.args===void 0)return;let n=`${t.module??``}!${t.name}`,r=Ne.get(n)??{name:t.name,module:t.module,rows:[]};if(r.rows.length>0&&r.rows[0][0].length!==t.args.length)throw new e._(`The arity of the operator ${t.name} is inconsistent in the configuration file.`);r.rows.push([t.args.map(pb),pb(t.value)]),Ne.set(n,r)}),Ne.forEach(e=>Oe(e).forEach(t=>Me(t,Sb(e.name,ke(t),e.rows))));let Pe=new Map(t.substitutions.flatMap(e=>De(e).map(t=>[t,be(e.target)])));[...Pe.keys()].forEach(e=>Ae.delete(e));let Fe=(t,n,r)=>{let i=be(n),o=a.get(i);if(!(o!==void 0||u.has(i)||Ae.has(i)||Ce.includes(n)||we.includes(n)))throw new e._(`The configuration file substitutes for ${t} with the undefined identifier ${n}.`);if(o?.kind===`Operator`&&o.params.length!==r)throw new e._(`The configuration file substitutes for ${t} with ${n} of different number of arguments.`)};t.substitutions.filter(e=>e.module===void 0).forEach(n=>{let r=n.name,i=n.target;if(!Ce.includes(r)&&!_e.visible.has(r))throw new e._(`In the configuration file, the identifier ${r} does not appear in the specification.`);if(t.substitutions.some(e=>e.name===i))throw new e._(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);Fe(r,i,_e.constants.find(e=>e.name===r)?.arity??_e.visible.get(r)?.arity)});let Ie=t.substitutions.filter(e=>e.module!==void 0);[...Te.keys()].forEach(t=>{let n=Ie.filter(e=>e.module===t);n.forEach(t=>{let r=Ee(t);if(r){if(n.some(e=>e.name===t.target))throw new e._(`In the configuration file, the identifier ${t.target} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);Fe(t.name,t.target,r.arity)}});let r=n.find(e=>!Ee(e));if(r)throw new e._(`In the configuration file, the identifier ${r.name} does not appear in the specification.`)});let Le=Ie.find(e=>!Te.has(e.module??``));if(Le)throw new e._(`In the configuration file, the module name ${Le.module} is not a module in the specification.`);let Re=new Set([...t.constants,...t.substitutions].filter(e=>e.module!==void 0).flatMap(Oe)),ze=(e,t)=>{if(Re.has(e))return{key:e,prefix:t};let n=s.get(e);return n&&ze(n.source,t+n.prefix)};s.forEach((e,t)=>{let n=ze(e.source,e.prefix),r=a.get(t);if(!n||!r)return;let i=r.kind===`Operator`?r.params:[],o=w(t,n.key,i,i.slice(n.prefix),r.location);a.set(t,o),_e.visible.forEach((e,n)=>{e.key===t&&n!==t&&a.set(n,o)})}),D.forEach(e=>ue(e.module,i.name).constants.forEach(t=>{let n=e.constants?.[t.name];n!==void 0&&Ae.set(t.name,n)}));let Be=Ce.filter(e=>!Ae.has(e)&&!Pe.has(e)&&!je.has(e));if(Be.length>0){let t=r.getDeclarationOrder(`constant`).find(e=>Be.includes(e))??Be[0];throw new e._(`The constant parameter ${t} is not assigned a value by the configuration file.`)}ve!==void 0&&u.forEach((e,t)=>{let n=Vf(e);n&&u.set(t,n)});let O=wb(we,h.flatMap(e=>e.module.variables.map(e=>e.name))),k=fu({definitions:a,substitutions:Pe,constants:Ae,variableIndex:O,builtins:u,variables:we}),Ve={runtime:f,definitions:a,builtins:u,constants:Ae,substitutions:Pe,instanceNames:ae,variables:we,variableIndex:O,facts:k,startupValues:Array.from({length:k.ids.size},()=>void 0),substitutedDefinitions:c,instanceParams:l,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},He=Xl({constants:new Set(Ae.keys()),variables:/* @__PURE__ */ new Set([...we,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>u.has(e))]),getDefinition:e=>Dh(e,Ve)}),Ue=t=>{try{W(t,{environment:Ve,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e.b)return t;throw t}};Pe.forEach((t,n)=>{let r=a.get(t),i=Ce.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&He.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?Ue(r.body):void 0;if(i){let r=rt(i)?``:` - specifically: ${i.message}`;throw new e._(`The configuration file substitutes constant ${n} with non-constant ${t}${r}`)}}),f.version!==`1.7.4`&&(f.isStarted=!0);let We=new Set(h.flatMap(e=>e.module.instances.map(e=>e.module))),Ge=r.createDefinitionOrder();return{environment:Ve,assumptions:xe,variableLocations:_e.variableLocations,instanceActions:ie,startupDefinitions:h.filter(e=>!We.has(e.module.name)||hb(e).length===0).flatMap(e=>Ge(e===_e?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:h.flatMap(e=>he.get(e.module.name)??[]),moduleOperators:D,rootName:i.name}},Ob={kind:`Boolean`,value:!0},kb={kind:`Boolean`,value:!1},Ab=e=>e?Ob:kb,jb=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,Mb=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,Nb=(e,t)=>({kind:e,body:t}),Pb=(e,t,n)=>({kind:e,operands:[t,n]}),Fb=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?Fb(e,t.operands).operands:[t])}),Ib=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return Ib(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,Ib(t)),0)}},Lb=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 Lb(e.body);case`And`:case`Or`:return e.operands.some(Lb)}},Rb=/* @__PURE__ */ new WeakMap;let zb=0;const Bb=e=>{let t=Rb.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`#${zb++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(Bb).join(`,`)})`;default:return`${e.kind}(${Bb(e.body)})`}})();return Rb.set(e,n),n},Vb=(e,t)=>e===t||Bb(e)===Bb(t),Hb=(e,t)=>{let n=Bb(t);return e.some(e=>e===t||Bb(e)===n)},Ub=e=>e===`And`?`Or`:`And`,Wb=(e,t)=>{switch(e.kind){case`Boolean`:return t?Ab(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?Nb(`Not`,e):e;case`Not`:return Wb(e.body,!t);case`And`:case`Or`:return Fb(t?Ub(e.kind):e.kind,e.operands.map(e=>Wb(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return Nb(n,Wb(e.body,t))}}},Gb=e=>{switch(e.kind){case`Boolean`:return Ab(!e.value);case`Not`:return e.body;case`And`:case`Or`:return Fb(Ub(e.kind),e.operands.map(Gb));case`Always`:return Nb(`Eventually`,Gb(e.body));case`Eventually`:return Nb(`Always`,Gb(e.body));default:return Nb(`Not`,e)}},Kb=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Kb(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return Ab(t)}return n.length===0?Ab(!t):n.length===1?n[0]:Fb(e.kind,n)}case`Not`:{let t=Kb(e.body);return t.kind===`Boolean`?Ab(!t.value):Nb(`Not`,t)}case`Always`:case`Eventually`:{let t=Kb(e.body);return Nb(e.kind,t.kind===e.kind?t.body:t)}default:return e}},qb=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Jb=t=>{switch(t.kind){case`And`:{let n=[],r=1;for(let i of t.operands){let t=Jb(i);if(t.kind===`And`)n.push(...t.operands);else{if(t.kind===`Or`&&(r*=t.operands.length,r>2147483647))throw new e.b(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);n.push(t)}}if(r===1)return{kind:`And`,operands:n};let i=Array.from({length:r},()=>[]),a=1,o=r;for(let e of n){if(e.kind!==`Or`){i.forEach(t=>t.push(e));continue}o/=e.operands.length;let t=0;for(let n=0;n<a;n++)for(let n of e.operands)for(let e=0;e<o;e++)i[t++].push(n);a*=e.operands.length}return{kind:`Or`,operands:i.map(e=>Fb(`And`,e))}}case`Or`:{let e=[],n=[];for(let r of t.operands){let t=Jb(r);for(let r of t.kind===`Or`?t.operands:[t]){let t=qb(r);t?e.push(t):n.push(r)}}if(e.length>0){let t=e.length===1?e[0]:Fb(`Or`,e);n.push(Nb(`Always`,Nb(`Eventually`,t)))}return Fb(`Or`,n)}case`Not`:return jb(t.body)?t:Jb(Gb(t.body));default:return t}},Yb=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Yb(e.operands[0]):Fb(e.kind,e.operands.map(Yb));case`Not`:return e.body.kind===`Not`?Yb(e.body.body):Nb(`Not`,Yb(e.body));case`Always`:case`Eventually`:case`Next`:return Nb(e.kind,Yb(e.body));default:return e}},Xb=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Xb(e.operands[0]);let t=Math.floor(e.operands.length/2);return Pb(e.kind,Xb(Fb(e.kind,e.operands.slice(0,t))),Xb(Fb(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return Nb(e.kind,Xb(e.body));default:return e}},Zb=(e,t)=>{e.kind===`Eventually`&&!Hb(t,e)&&t.push(e),`body`in e&&Zb(e.body,t),`operands`in e&&e.operands.forEach(e=>Zb(e,t))},Qb=e=>{let t=e.filter(Mb),n=e.flatMap(e=>e.kind===`Not`&&Mb(e.body)?[e.body]:[]);return!t.some(e=>Hb(n,e))},$b=t=>{let n=[...t],r=[];for(;n.length>0;){let t=n.pop();if(!t)break;switch(t.kind){case`Not`:n.push(t.body);break;case`Next`:r.push(t),n.push(t.body);break;case`Always`:case`Eventually`:r.push(t,Nb(`Next`,t)),n.push(t.body);break;case`And`:case`Or`:n.push(...t.operands),r.push(t);break;case`Action`:throw new e.b(`TLC encountered actions while constructing the tableau`);default:r.push(t)}}return r},ex=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:Nb(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},tx=(e,t,n)=>e.flatMap(e=>{let r=ex(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),nx=e=>[...new Set(e.map(Bb))].sort().join(`|`),rx=(e,t)=>{let n=new Set(t.map(nx));return[...e.filter(e=>!n.has(nx(e))),...t]},ix=e=>{let t=$b(e),n=tx(t,`Always`,`And`),r=tx(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=ex(t,`Eventually`,`Or`);if(n&&!(Hb(e,n.first)||Hb(e,n.second)))return rx(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Hb(e,t.first)||Hb(e,t.second))&&!Hb(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Qb(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=ex(t[e],`Always`,`And`);n&&(Hb(t,n.first)||t.push(n.first),Hb(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)Hb(t,e.first)&&Hb(t,e.second)&&!Hb(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!Qb(t)?[]:i(t)};return a(e)},ax=e=>({particle:e,successors:[],statePredicates:e.filter(e=>Ib(e)<=1)}),ox=e=>{let t=ix([e]).map(ax),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=nx(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 ix(n)){let n=nx(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(ax(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},sx=(e,t)=>!Hb(e,t)||Hb(e,t.body),cx=(t,n)=>{if(t.kind===`Eventually`&&t.body.kind===`Always`&&Ib(t.body.body)<3){n.eventuallyAlways.push(t.body.body);return}let r=qb(t);if(r){let e=Ib(r);if(e<=1){n.infinitelyOftenStates.push(r);return}if(e===2){n.infinitelyOftenActions.push(r);return}}if(Lb(t))throw new e.b(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);n.formulas.push(t)},lx=(e,t)=>{let n=e.findIndex(e=>Vb(e,t));return n===-1?(e.push(t),e.length-1):n},ux=e=>{let t=Jb(Kb(Wb(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Yb(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])cx(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:Fb(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Vb(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Xb(e.formula),n=[];t&&Zb(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>lx(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>lx(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>lx(i,e))}));return{tableau:t&&ox(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},dx=()=>e.it(new e.b(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.tt.livenessEvaluationFailure),fx=/* @__PURE__ */ new Set([`~>`,`-+->`]),px=/* @__PURE__ */ new WeakSet,mx=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),hx=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),gx=(t,n)=>new e.b(`TLC cannot handle the temporal formula ${H(t)}${n===void 0?``:`:\n${n}`}`),_x=(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=_x(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=gh(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=Dh(e,n);if(t)return vu(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isActionLevel?2:r.isStateLevel&&!r.isLevelConstant?1:0},c=(e,t)=>r.has(e)?0:O(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return Wc(e,(e,o)=>(a=Math.max(a,_x(e,t,n,o.length===0?r:/* @__PURE__ */ new Set([...r,...o]),i)),e)),a};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:l(e);case`Identifier`:return c(e.name,e);case`OperatorReference`:return c(e.operator,e);case`Apply`:{if(fx.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=O(e)?void 0:og(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,yg(o,e.args,hx(n,t)))}default:return l(e)}},vx=(t,n)=>{try{return Lh(t,n)}catch(t){if(!(t instanceof e.b))throw t;if(!rt(t))return;throw e.it(new e.b(`${e.W}${t.message}`),e.tt.error)}},yx=(t,n,r,i,a=/* @__PURE__ */ new Set,o=!1,s,c=[])=>{let l=(e,t,n=s,l=a,u)=>yx(e,t,r,i,l,o||u!==void 0&&r.substitutedDefinitions.has(u),n,u?.kind===`Operator`&&u.params.length===0?[...c,u.name]:c);if(t.kind===`And`)return t.operands.flatMap(e=>l(e,n,H(e)));if(t.kind===`Label`)return l(t.body,n);if(t.kind===`Let`)return l(t.body,bx(t,n,r));if(t.kind===`Identifier`){let i=O(t)?gh(n,t.name):void 0;if(i?.kind===`Thunk`&&!i.isReleased)return l(i.expression,i.scope,px.has(i)?t.name:s);let c=r.constants.has(t.name)?void 0:Dh(t.name,r);if(!i&&c?.kind===`Operator`&&c.params.length===0&&(vu(c,r)>0||tg(c,r)===void 0)){if(a.has(c))throw e.Y();return l(c.body,void 0,!o&&r.instanceNames.get(t.name)||c.name,/* @__PURE__ */ new Set([...a,c]),c)}}let u=hx(r,n);if(t.kind===`Apply`&&r.runtime.version!==`1.7.4`&&(i||_x(t,n,r)===3)){let e=sg(t,u),n=O(t)?void 0:Dh(t.operator,r),i=e?.kind===`Closure`&&e.params.every(e=>r.instanceParams.has(e));if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive&&(!o||i))return l(e.body,yg(e,t.args,u),o&&n?n.name:t.operator,a,n)}let d=i&&t.kind===`Forall`&&t.bounds.every(e=>_x(e.set,n,r)===0),f=d?vx(t.bounds,u):void 0;if(d&&f){let e=[];if(Rh(t.bounds,f,n,n=>(e.push(...l(t.body,n,H(t.body))),!1)),e.length===0)throw dx();return e}return[{expression:t,scope:n,name:s,path:c}]},bx=(e,t,n)=>{let r=Cg(e.definitions,hx(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&px.add(e.binding);return r},xx=(t,n,r)=>{let i=r.runtime.version===`1.7.4`,a=(t,n,a)=>{let o=a===0&&!i?_x(t,n,r):a;if(o===0){let i=W(t,hx(r,n));if(typeof i!=`boolean`)throw new e.b(`TLC expected a boolean value, but did not find one. ${ah(t)}`);return Ab(i)}return o===1?{kind:`State`,expression:t,scope:n}:t.kind===`AngleAction`?{kind:`Action`,expression:t.action,subscript:t.subscript,scope:n}:{kind:`Action`,expression:t,subscript:void 0,scope:n}},o=0,s=(t,n,i,s)=>{if(o>=100)throw e.Y();o++;let c=p(t,n);o--;let l=Ib(c),u=l===0&&_x(i,s,r)>2;return l>2||u?c:a(i,s,l)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,a=hx(r,t),o=O(e)||Dh(n,r)===void 0?gh(t,n):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&px.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:O(e)?cg(n,a):og(n,r),u=e.kind===`Apply`?e.args:[],f=c?.kind===`Builtin`&&u.length===2?mx.get(c.name):void 0;if(f){let n=u.map(e=>p(e,t));return d(e,t,Fb(f,n))}if(c?.kind!==`Closure`)throw gx(e);let m=!O(e)&&Dh(n,r)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),s(c.body,yg(c,u,a),e,t)),m)},l=(t,n,r=!1)=>{try{return n()}catch(n){let a=n instanceof e.P||r&&!i;throw!(n instanceof e.b)||a?n:gx(t)}},u=(t,n)=>{let i=_x(t,n,r),o=[],s=t.kind===`Forall`;try{zh(t.bounds,hx(r,n),e=>(o.push(p(t.body,e)),!1))}catch(r){if(!(r instanceof e.b)||r instanceof e.P)throw r;if(i<=2)return a(t,n,i);throw gx(t,s&&!rt(r)?r.message:void 0)}return o.length===0?Ab(s):d(t,n,Fb(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=Ib(n);return r>2?n:a(e,t,r)},f=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!O(e)||e.operator===`=>`),p=(e,t)=>{let n=_x(e,t,r);if(n<=2&&!f(e))return a(e,t,n);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,bx(e,t,r));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?Nb(`Always`,Pb(`Or`,Nb(`Not`,p(n[0],t)),Nb(`Eventually`,p(n[1],t)))):e.operator===`~`&&!O(e)?d(e,t,Nb(`Not`,p(n[0],t))):e.operator===`=>`?d(e,t,Pb(`Or`,Nb(`Not`,p(n[0],t)),p(n[1],t))):c(e,t)}case`And`:case`Or`:return d(e,t,Fb(e.kind,e.operands.map(e=>p(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&_x(e.condition,t,r)===0){let n=W(e.condition,hx(r,t));if(typeof n==`boolean`)return p(n?e.consequent:e.alternative,t)}let n=p(e.condition,t);return d(e,t,Pb(`Or`,Pb(`And`,n,p(e.consequent,t)),Pb(`And`,Nb(`Not`,n),p(e.alternative,t))))}case`Always`:case`Eventually`:return Nb(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=Nb(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?Nb(`Always`,Nb(`Eventually`,Pb(`Or`,i,a))):Pb(`Or`,Nb(`Eventually`,Nb(`Always`,i)),Nb(`Always`,Nb(`Eventually`,a)))}default:throw gx(e)}};return p(t,n)},Sx=(t,n,r,i,a)=>{let o=e=>Sx(e,n,r,i,a);switch(t.kind){case`Boolean`:return t.value;case`State`:case`Enabled`:{let r=a.get(t);if(r!==void 0)return r;let o={environment:i,scope:t.scope,state:n,next:void 0},s=t.kind===`State`?W(t.expression,o):Km(t.step,o);if(typeof s!=`boolean`)throw new e.b(`A state predicate was evaluated to a non-boolean value.`);return a.set(t,s),s}case`Action`:{if(t.enabled&&a.get(t.enabled)===!1)return!1;let o=t.scope,s=t.subscript;if(s&&mr(W(s,{environment:i,scope:o,state:n,next:void 0}),W(s,{environment:i,scope:o,state:r,next:void 0})))return!1;let c=W(t.expression,{environment:i,scope:o,state:n,next:r});if(typeof c!=`boolean`)throw new e.b(`Encountered an action predicate that's not a boolean.`);return c}case`Not`:return!o(t.body);case`And`:return t.operands.every(o);case`Or`:return t.operands.some(o);case`Next`:return Sx(t.body,r??n,void 0,i,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new e.b(`TLC cannot evaluate a temporal formula in a single step`)}},Cx=(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)=>Cx(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 Sx(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},wx=`UnnamedAction`,Tx={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},Ex=e=>{let t=e.range??Tx;return Fr([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Dx=(e,t)=>{let n=[[`name`,e.name],[`location`,Ex(e.location)]];return e.parameters.length>0&&n.push([`context`,Fr(e.parameters)],[`parameters`,Pr(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),Fr(n)},Ox=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),kx=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Ax=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,jx=e=>e.kind===`Apply`?e.args:[],Mx=(e,t,n)=>{let r=Ax(e);if(r===void 0)return;if(O(e)){let e=gh(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=og(r,n);return i?.kind===`Closure`?i:void 0},Nx=(t,n)=>{try{return W(t,kx(n,void 0)),!0}catch(t){if(t instanceof e.y)return!1;throw t}},Px=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&hu(e,t)&&Nx(e.body,t),Fx=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&Px(e,t),Ix=(e,t)=>{let n=Dh(e.name,t);return n?.body===e.body&&Fx(n,t)},Lx=(e,t)=>{if(e.kind!==`Identifier`||!O(e))return;let n=gh(t,e.name);return n?.kind===`Thunk`?n:void 0},Rx=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:Cg(e.definitions,kx(n,t))};let r=Lx(e,t);return r&&{expression:r.expression,scope:r.scope}},zx=(e,t)=>(e?.params??[]).flatMap(e=>{let n=gh(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Bx=(t,n)=>{try{return t()}catch(t){if(t instanceof e.y)return n();throw t}},Vx=(e,t,n,r,i)=>{let a=jx(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=>_x(e,n,i)!==0)?o():Bx(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,kx(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},Hx=(t,n,r,i,a)=>{let o=()=>({name:r?.name??wx,location:t.location,parameters:zx(r,n),expression:t,scope:n});if(Fp.has(t.kind))throw e.it(new e.b(`${e.G}The next state relation is not a boolean expression.\n${ah(t)}`),e.tt.error);switch(t.kind){case`Let`:return Hx(t.body,Cg(t.definitions,kx(i,n)),r,i,a);case`Label`:return Hx(t.body,n,r,i,a);case`Or`:return t.operands.flatMap(e=>Hx(e,n,r,i,a));case`Exists`:return Bx(()=>{let e=[];return zh(t.bounds,kx(i,n),n=>(e.push(...Hx(t.body,n,r,i,a)),!1)),e.length===0?[o()]:e},()=>[o()])}let s=O(t)?void 0:a.get(Ax(t)??``),c=Mx(t,n,i);if(s)return Vx(s,t,n,c,i);if(!c)return[o()];let l=jx(t),u=O(t)?c.name:i.instanceNames.get(Ax(t)??``)??c.name,d=()=>[{name:u,location:t.location,parameters:[],expression:t,scope:n}];return Ix(c,i)||l.some(e=>_x(e,n,i)!==0)?d():Bx(()=>{let e=l.reduce((e,t,r)=>({name:c.params[r].name,binding:{kind:`Value`,value:W(t,kx(i,n))},parent:e}),c.scope);return Hx(c.body,e,{...c,name:u},i,a)},d)},Ux=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>Ux(e,t,n,r,i,o),s=(e,t,n)=>Ox(e,Lc(t,a),n),c=Rx(e,t,n);if(c){o(c.expression,c.scope);return}let l=Mx(e,t,n);if(l&&Ix(l,n))return;let u=l?[...a,...Ic.get(l.body)??[]]:a;if(l&&l.params.length===0){if(_x(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,yg(l,e.args,kx(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(wx,e,t));return}let d=_x(e,t,n);d<=1?r.inits.push(s(wx,e,t)):d===3&&r.temporals.push(s(wx,e,t))},Wx=(e,t,n,r,i)=>{let a=(t,n)=>Wx(e,t,n,r,i),o=Rx(t,n,r);if(o){a(o.expression,o.scope);return}let s=Mx(t,n,r);if(s&&Ix(s,r))return;if(s&&s.params.length===jx(t).length){a(s.body,t.kind===`Apply`?yg(s,t.args,kx(r,n)):s.scope);return}if(t.kind===`Forall`&&Bx(()=>(zh(t.bounds,kx(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(Ox(e,a)):_x(a,n,r)<2?i.invariants.push(Ox(e,a)):i.impliedTemporals.push(Ox(e,t));return}let c=_x(t,n,r);c<=1?i.impliedInits.push(Ox(e,t)):c===3&&i.impliedTemporals.push(Ox(e,t))},Gx=(e,t)=>{let n=Dh(e,t);return n?.kind===`Operator`&&!Fx(n,t)?n:void 0},Kx=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:Gx(e.specification,t);a&&(Ux(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:wx,location:e.frames[0].location,parameters:[],expression:Lc(e.expression,e.frames),scope:e.scope}]:Hx(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:og(e.init,t);o?.kind===`Closure`&&r.inits.push(Ox(e.init??``,o.body));let s=e.next===void 0?void 0:og(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Hx(s.body,s.scope,s,t,n)),r},qx=(e,t,n)=>{let r=[],i=(e,t)=>{if(e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`)return!1;if(e.kind===`Tuple`)return e.elements.every(e=>i(e,t));if(e.kind===`Label`)return i(e.body,t);let a=Rx(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&O(e)?gh(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!O(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=Mx(e,t,n);if(!s||s.params.length!==jx(e).length)return!0;let c=Dh(s.name,n);return c?.body===s.body&&Px(c,n)?!0:i(s.body,e.kind===`Apply`?yg(s,e.args,kx(n,t)):s.scope)};return i(e,t)?r:void 0},Jx=(e,t,n)=>Kx(e,t,n).inits,Yx=(e,t,n)=>Kx(e,t,n).actions,Xx=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>L(e[1])).join(`,`)})`,Zx=(t,n,r=!1)=>`${t.name===wx?r?`Initial predicate`:`Action`:t.name}${n===`1.7.4`?``:Xx(t)} ${e.X(t.location.range??Tx)}`,Qx=e=>`${e.name}${Xx(e)}`,$x=(e,t,n,r)=>{let i=Kx(e,t,r);e.invariants.forEach(e=>{let n=Gx(e,t);n&&i.invariants.push(Ox(e,n.body))}),e.properties.forEach(e=>{let n=Gx(e,t);n&&Wx(e,n.body,void 0,t,i)});let a=t.coverage,o=(e,t)=>_r(e.map(e=>{let n=a&&t&&bo(a,t,e.expression);return Dx(e,n&&Fr(n))})),s=e=>_r(e.flatMap(e=>{let n=Gx(e,t);return n?[Fr([[`name`,n.name],[`location`,Ex(n.location)]])]:[]}));return Fr([[`inits`,o(i.inits,`init`)],[`actions`,o(i.actions,`next`)],[`temporals`,o(i.temporals)],[`invariants`,o(i.invariants,`invariant`)],[`impliedinits`,o(i.impliedInits,`implied`)],[`impliedactions`,o(i.impliedActions,`implied`)],[`impliedtemporals`,o(i.impliedTemporals)],[`variables`,_r(t.variables.map((e,t)=>Fr([[`name`,e],[`location`,Ex(n[t])],...a?[[`coverage`,Fr([[`distinct`,so(a,t)]])]]:[]])))],[`actionconstraints`,s(e.actionConstraints)],[`constraints`,s(e.constraints)]])},eS=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),tS=(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},nS=t=>e.it(new e.b(`${e.G}${t}`),e.tt.error),rS=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!N(e)||!N(i))throw nS(`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${aS(t)}`:n},aS=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(aS).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${iS(e.pattern,e.set)}:${aS(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(aS).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${aS(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>iS(e.pattern,e.set)).join(`,`)}|->${aS(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(aS);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},oS=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,sS=(t,n,r)=>{let i=n.definitions.get(t);if(i===void 0&&!n.constants.has(t))throw new e._(`The symmetry function ${t} specified in the configuration file\nis not defined in the specification.`);if(i?.kind!==`Operator`||i.params.length>0)throw nS(`The symmetry function ${t} must specify a set of permutations.`);let a=e=>W(e,{environment:n,scope:void 0,state:void 0,next:void 0}),o=a(i.body);if(!j(o)||!P(o))throw nS(`The symmetry operator must specify a set of functions.`);let s=F(o).elements;if(!s.every(M))throw nS(`The symmetry values must be function records.`);let c=i.body,l=c.kind===`Apply`?c.args:c.kind===`SetEnumeration`?c.elements:[],u=new Map(r.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),d=e=>{if(e.length===0)return;let t=e.map(e=>{let t=aS(oS(e)?e.args[0]:e);return u.get(t)??t}),r=e.length>1;n.runtime.warn(Ke.symmetrySetTooSmall,`The set${r?`s`:``} ${t.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(l.length>=s.length){d(l);return}let f=/* @__PURE__ */ new Map;s.map(rS).forEach(e=>{e.size>0&&f.set(eS(e),e)});let p=[...f.values()],m=0;for(;m<f.size;){let e=[...f.values()],t=e.length;p.forEach(n=>e.slice(m,t).forEach(e=>{let t=tS(n,e),r=eS(t);t.size>0&&!f.has(r)&&f.set(r,t)})),m=t}let h=new Set([...f.values()].flatMap(e=>[...e.values()].map(e=>e.name))),g=new Set(r.map(e=>e.name));if(d(l.filter(e=>{if(!oS(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||g.has(t.name))return!1;let n=a(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>N(e)&&h.has(e.name))})),f.size!==0)return[...f.values()]},cS=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=uS(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(uS(e[r],t));return a}},lS=(e,t)=>{let n=[],r=[];for(let i of e){let e=uS(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(gn);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(gn(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},uS=(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=lS(e.elements,t);return n?xn(n):e}if(n===`Function`||n===`LazyFunction`&&P(e.domain)){let n=I(e),r=cS(n.domain,t),i=cS(n.range,t)??n.range;if(r){let e=Cr(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Cn(n.domain,e.range):e}return i===n.range?n:Cn(n.domain,i)}if(n===`Interval`||!j(e)||!P(e))return e;let r=F(e),i=cS(r.elements,t);return i?_r(i):r},dS=(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]=uS(e[o],i),a===0&&(a=gn(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},fS={line:0,column:0},pS=e=>({kind:`Identifier`,name:e,location:fS}),mS=/* @__PURE__ */ new Set([`name`,`property`]),hS=(t,n,r)=>{let i=Dh(n,r);if(!i)throw new e._(`The ${t} ${n} specified in the configuration file\nis not defined in the specification.`);if(i.kind===`Operator`&&i.params.length>0)throw new e._(mS.has(t)?`TLC requires ${n} not to take any argument.`:`TLC requires ${t} not to take any argument, but one was given: ${n}`);return i},gS=e=>e.body.kind===`Number`||e.body.kind===`String`,_S=(t,n,r)=>{if(r.constants.has(t))return r.constants.get(t);if(hu(n,r)&&!gS(n))try{return W(pS(t),VS(r,void 0,void 0))}catch(t){if(t instanceof e.b||e.et(t))return;throw t}},vS=(t,n,r)=>{if(r.constants.has(n))throw new e._(`The ${t} ${n} cannot be a constant.`);let i=hS(t,n,r);if(_S(n,i,r)!==void 0)throw new e._(`The ${t} ${n} cannot be a constant.`);return i},yS=(t,n,r)=>{let i=r.constants.has(n)?void 0:hS(t,n,r),a=i?_S(n,i,r):r.constants.get(n);if(a!==void 0&&a!==!0)throw new e._(`The ${t} of ${n} is equal to ${L(a)}`);return a===void 0?i:void 0},bS=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},xS=(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})),ng(e.startupDefinitions,r),t.invariants.forEach(e=>{yS(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},SS=(t,n)=>{let r=Xl({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>n.definitions.get(e)});return t.flatMap(t=>{let i=yS(`invariant`,t,n);if(!i)return[];let a=r.analyzeDefinition(i,/* @__PURE__ */ new Map);if(a.level>=2){let n=a.params.size===0?``:`
|
|
1790
|
+
`]]),L_=(e=`master`)=>e===`1.7.4`?I_:F_,R_=(e,t)=>e.every(e=>Vl(e,t)),z_=Hc([!1,!0]);Lc(z_);const B_=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return qc(B_(e,t,r),B_(e,r,n))},V_=[`\\cup`,`\\cap`,`\\`],H_=e=>typeof e==`object`&&e.kind===`MixedSet`,U_=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,W_=(e,t,n)=>{t.kind===`Interval`&&jl(t);let r=t.kind===`Interval`?t:Ic(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return ns(r,e=>{Vl(e,n)===i&&es(a,e)}),U_(t)?Qs(a):Uc(a)}if(Ol(t))return n;if(!is(n))return oc({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return ns(r,e=>es(i,e)),ns(n.kind===`Interval`?n:G(n).elements,e=>{Vl(e,t)||es(i,e)}),Uc(i)},G_=(e,t)=>{let n=t.elements,r=0,i=n.length;for(;r<i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;a<e.low?r=t+1:i=t}for(let t=e.low;t<=e.high;t++,r++){if(r===n.length)return!1;let e=n[r];if(e!==t)return typeof e!=`number`&&void 0}return!0},K_=(e,t)=>{if(typeof t==`object`&&t.kind===`Interval`&&t.low<=e.low&&t.high>=e.high)return!0;let n=typeof t==`object`&&t.kind===`Set`?G_(e,t):void 0;if(n!==void 0)return n;for(let n=e.low;n<=e.high;n++)if(!Vl(n,t))return!1;return!0},q_=(e,t)=>{let n=(t,n)=>wf([Kf(t,n,e)()],0,e);return{...Y(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},J_=[Ef(`TRUE`,!0),Ef(`FALSE`,!1),Ef(`BOOLEAN`,z_),Ef(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),kf(`=`,zc),kf(`#`,(e,t)=>!zc(e,t)),Y(`~`,1,e=>!wf(e,0,`~`)),Y(`<=>`,2,e=>wf(e,0,`<=>`)===wf(e,1,`<=>`)),q_(`/\\`,(e,t)=>e&&t()),q_(`\\/`,(e,t)=>e||t()),q_(`=>`,(e,t)=>!e||t()),Y(`\\in`,2,e=>Vl(J(e,0,`\\in`),J(e,1,`\\in`))),Y(`\\notin`,2,e=>!Vl(J(e,0,`\\notin`),J(e,1,`\\notin`))),kf(`\\subseteq`,(t,n)=>{if(typeof t==`object`&&t.kind===`Interval`)return K_(t,n);if(!rs(t))throw new e.x(`\\subseteq expects a set but received ${q(t)}`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&W(t.base)?R_(G(t.base).elements,n.base):!Sl(t,e=>!Vl(e,n))}),...V_.map(t=>Y(t,2,n=>{let r=J(n,0,t),i=J(n,1,t),a=t!==`\\cup`&&typeof i==`object`&&i.kind===`Interval`&&typeof r==`object`&&r.kind!==`Interval`;if(is(r)&&is(i)&&!H_(r)&&!H_(i)&&!a&&!ts(r)&&!ts(i)){if(t===`\\cup`&&Ol(r))return i;let n=t===`\\cup`?qc:t===`\\cap`?Kc:Gc;return zl((r,i)=>{let a=G(r),o=G(i),s=n(a,o);if(t===`\\cup`){let t=Ic(a),n=Gc(o,a).elements,r=t===a.elements&&(n.length===0||Ks(t[t.length-1],n[0])<0);if(t.length+n.length>Qo())throw new e.P($o());if(r&&!a.isNormalized)return s;let i=s===a?Zs(s.elements):s;return r||(i.writtenElements=[...t,...n]),i}return s===r||(s.isNormalized=U_(r),a.writtenElements&&!a.isNormalized&&(s.writtenElements=a.writtenElements.filter(e=>Vl(e,s)))),s},(e,n)=>W_(t,e,n),r,i)}return is(r)?W_(t,r,i):t!==`\\`&&is(i)?W_(t,i,r):oc({kind:`SetOperation`,operator:t,left:r,right:i})})),Y(`SUBSET`,1,e=>({kind:`Subset`,base:J(e,0,`SUBSET`)})),Y(`UNION`,1,e=>{let t=J(e,0,`UNION`),n=ss(t)?Ic(t):[],r=n.filter(ss);if(!ss(t)||r.length!==n.length)return oc({kind:`Union`,base:t});let i=r.flatMap(Ic),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{Vl(t,e)||es(e.elements,t)}),Uc(e.elements)};return H_(t)||r.some(H_)?a():r.length===0?Wc:zl(e=>Fl(B_(e,0,e.length),i),a,r.map(G),void 0)}),Y(`DOMAIN`,1,t=>{let n=J(t,0,`DOMAIN`);if(!as(n))throw new e.x(`DOMAIN expects a function but received ${q(n)}`);return cu(n)})],Y_=Vf(`Integers`,`Neg`,`IntValue`,1),X_=t=>{let n=Vf(t,`DotDot`,`IntervalValue`,2);return[Hf(t,`+`,`Plus`,(e,t)=>e+t),Hf(t,`-`,`Minus`,(e,t)=>e-t),Hf(t,`*`,`Times`,(e,t)=>e*t),Hf(t,`^`,`Expt`,(t,n)=>{if(n<0)throw new e.A(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(t===0&&n===0)throw new e.A(`0^0 is undefined.`);return t**n}),Hf(t,`\\div`,`Divide`,(t,n)=>{if(n===0)throw new e.A(`The second argument of \\div is 0.`);let r=Math.floor(t/n);if(Af(r))throw jf(`${t} \\div ${n}`);return r}),Hf(t,`%`,`Mod`,(t,n)=>{if(n<=0)throw new e.A(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(t%n+n)%n}),kf(`..`,(e,t)=>{let r=Bf(t,n);return{kind:`Interval`,low:Bf(e,n),high:r}})]},Z_=X_(`Naturals`),Q_=X_(`Integers`),$_=e=>{let t=Z_.indexOf(e);return t===-1?void 0:Q_[t]},ev=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[zf(Wf(`<`,(e,t)=>e<t),t(`LT`)),zf(Wf(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),zf(Wf(`<=`,(e,t)=>e<=t),t(`LE`)),zf(Wf(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},tv=[Ef(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Z_,...ev(`Naturals`)],nv=[Ef(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Q_,...ev(`Integers`),Y(`-.`,1,e=>{let t=Bf(J(e,0,`-`),Y_);if(Af(-t))throw jf(`-${t}`);return-t})],rv=(t,n,r)=>{let i=J(t,n,r),a=Il(i);if(!a)throw new e.A(`${r}\n${U(q(i))}`);return a},iv=(e,t,n)=>{let r=J(e,t,n);return typeof r==`string`?r:rv(e,t,n)},av=(e,t,n)=>{let r=J(e,t,`SubSeq`);if(typeof r!=`number`)throw xf(n,`SubSeq`,`natural number`,r);return r},ov=(e,t,n)=>typeof e==`string`?Is(e.slice(t,n)):al(e.slice(t,n)),sv=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,cv=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,lv=(e,t)=>{let n=Qe.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?zf(e,t):e}):t},uv=t=>lv(`Sequences`,[Y(`Seq`,1,e=>({kind:`SequenceSet`,base:J(e,0,`Seq`)})),Y(`Len`,1,e=>iv(e,0,sv(``,`Len`)).length),Y(`\\o`,2,t=>{let n=iv(t,0,cv(`s \\o t`,`sequence`));if(typeof n!=`string`){let e=rv(t,1,cv(`t \\o s`,`sequence`)),r=n.length===0?J(t,1,`\\o`):e.length===0?J(t,0,`\\o`):void 0;return r!==void 0&&nc(r)===`tuple`?r:al([...n,...e])}let r=J(t,1,`\\o`);if(typeof r!=`string`)throw new e.A(`${cv(`t \\o s`,`string`)}\n${U(q(r))}`);return Is(n+r)}),Y(`Append`,2,e=>al([...rv(e,0,cv(t===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),J(e,1,`Append`)])),Y(`Head`,1,t=>{let n=rv(t,0,sv(``,`Head`));if(n.length===0)throw new e.A(`Attempted to apply Head to the empty sequence.`);return n[0]}),Y(`Tail`,1,t=>{let n=iv(t,0,sv(``,`Tail`));if(n.length===0)throw new e.A(`Attempted to apply Tail to the empty sequence.`);return ov(n,1)}),Y(`SubSeq`,3,t=>{let n=iv(t,0,sv(`first `,`SubSeq`)),r=av(t,1,`second`),i=av(t,2,`third`);if(r>i)return ov(n,0,0);let a=r<1||r>n.length?{position:`second`,value:r}:i>n.length?{position:`third`,value:i}:void 0;if(a)throw new e.A(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${U(q(J(t,0,`SubSeq`)))}\n, but instead it is\n${a.value}`);return ov(n,r-1,i)}),Df(`SelectSeq`,2,t=>{let n=Tf(t,1,`SelectSeq`);return al(rv(t,0,sv(`first `,`SelectSeq`)).filter(t=>{let r=n.call([t]);if(typeof r!=`boolean`)throw new e.A(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${n.name}>`);return r}))})]),dv=t=>lv(`FiniteSets`,[Y(`IsFiniteSet`,1,e=>Nl(J(e,0,`IsFiniteSet`))),Y(`Cardinality`,1,n=>{let r=J(n,0,`Cardinality`);if(!rs(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new e.A(`Attempted to compute cardinality of the value\n${U(q(r))}`);return jl(r,t)})]),fv=[zf(Y(`Warshall`,1,t=>{let n=J(t,0,`Warshall`);if(!rs(n)||zs(n))throw new e.A(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${U(q(n))}`);jl(n);let r=[],i=/* @__PURE__ */ new Map,a=e=>{let t=Du(e),n=i.get(t)??r.length;return n===r.length&&(i.set(t,n),r.push(e)),n},o=G(n).elements.map(t=>{let n=Il(t);if(n?.length!==2)throw new e.A(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${U(q(t))}`);return[a(n[0]),a(n[1])]}),s=r.map(()=>r.map(()=>!1));o.forEach(e=>{s[e[0]][e[1]]=!0});for(let e=0;e<r.length;e++)for(let t=0;t<r.length;t++)if(s[t][e])for(let n=0;n<r.length;n++)s[e][n]&&(s[t][n]=!0);return Uc(r.flatMap((e,t)=>r.flatMap((n,r)=>s[t][r]?[al([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],pv=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return fv;if(e===`AnySet`)return[Ef(`ANY`,Us)];if(e===`IOUtils`)return Mg(r,a);if(e===`_TLCTrace`)return Fg(r);if(!L_(n.version).has(e))return;let o=gv(e,t,n,r,i);return e===`Randomization`&&o?[...o,o_(n)]:o},mv=/* @__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`]]]),hv=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]]]),gv=(e,t,n,r,i)=>{switch(e){case`Naturals`:return tv;case`Integers`:return nv;case`Sequences`:return uv(n.version);case`FiniteSets`:return dv(n.version);case`TLC`:return lv(`TLC`,N_(t,n));case`Randomization`:return s_(n);case`_Possible`:return S_(t,n);case`Json`:return jg(r);case`Bags`:return lv(`Bags`,ng(i));case`TLCExt`:return lv(`TLCExt`,x_(t,n));default:return}},_v=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&Jf.get(t)||[];r.expressions.push(...i,t);let a=Rl.sets,o=a??[],s=o.length;Rl.sets=o;try{return n()}catch(e){throw qx(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,Rl.sets=a}},vv=(e,t,n)=>e.coverage?Vd(e.coverage,t,n):-1,yv=(e,t,n)=>e.coverage?Ud(e.coverage,t,n):n(),bv=(e,t,n,r)=>yv(e,t,()=>$(n,r)),xv=(e,t,n,r)=>{let i=bv(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},Sv=(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},Cv=e=>!e.includes(void 0),wv=e=>e.variables.map(()=>void 0),Tv=(e,t,n)=>{let r=[...e];return r[t]=n,r},Ev=(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}},Dv=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,Ov=e=>e.kind===`Identifier`?e.name:void 0,kv=(e,t,n)=>{if(t.kind===`Label`)return kv(e,t.body,n);let r=Ov(t);if(r===void 0)return;let i=Ab(n,r);if(i?.kind===`Thunk`)return kv(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=xx(r,e);return o?.kind===`Closure`&&o.params.length===0?kv(e,o.body,o.scope):void 0},Av=(e,t,n)=>{if(t.kind===`Prime`)return kv(e,t.expression,n);if(t.kind===`Label`)return Av(e,t.body,n);let r=Ov(t);if(r===void 0)return;let i=Ab(n,r);if(i?.kind===`Thunk`)return Av(e,i.expression,i.scope);if(i)return;let a=xx(r,e);return a?.kind===`Closure`&&a.params.length===0?Av(e,a.body,a.scope):void 0},jv=t=>{if(typeof t!=`boolean`)throw new e.x(`TLC expected a boolean expression.`);return t},Mv=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Nv=(e,t,n,r)=>{let i=Fv(e,t,n,r);return i&&e.coverage&&!e.isInit&&Hd(e.coverage,r),i},Pv=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(Hd(r,n),Hd(r,r.roots[n])),e.onState(t),!0},Fv=(e,t,n,r)=>t===void 0?Cv(n)?Pv(e,n,r):e.onIncomplete?.(n)??!1:Cv(n)&&Mv(e)?Lv(e,t,n,r):t.kind===`Predicate`?Rv(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?ey(e,t.expression,t.rest,t.scope,n,t.node):Iv(e,t,n)&&Nv(e,t.rest,n,t.node),Iv=(e,t,n)=>{let r=e.environment,i=bv(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return bv(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?kb(t,r.runtime.version):t}})();try{return!zc(i,a)}catch(t){throw e.callStack&&qx(e.callStack,[i],t),t}},Lv=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return ey(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?Iv(e,i,n):jv(bv(e,i.node,i.expression,Sv(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return Pv(e,n,r)},Rv=(e,t,n,r,i,a)=>zv(e,t,n,r,i,vv(e,a,t)),zv=(t,n,r,i,a,o)=>_v(t,n,()=>{switch(n.kind){case`Let`:{let e=Sv(t,i,a),s=n.definitions,c=t.coverage&&!t.isEnabled?Rx(s,e,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):Rx(s,e);return Rv(t,n.body,r,c,a,o)}case`Label`:return Rv(t,n.body,r,i,a,o);case`Selection`:return Rv(t,n.expression,r,i,a,o);default:if(qv.has(n.kind))throw new e.x(`The state relation is not a boolean expression.`);return _v(t,n,()=>Qv(t,n,r,i,a,o))}}),Bv=(e,t,n,r,i)=>jv(t)&&Nv(e,n,r,i),Vv=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),Hv=(e,t,n,r,i,a)=>{let o=Sv(e,r,i);if(t.kind===`Identifier`){let s=Ab(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return Rv(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return Rv(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:xx(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&uh(c,e.environment))?Rv(e,l.body,n,l.scope,i,a):Bv(e,xv(e,a,t,o),n,i,a)}let s=Sx(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=yv(e,a,()=>Px(s,t.args,o));return Rv(e,s.body,n,r,i,a)}let c=Vv.has(t.operator)?bv(e,a,t,o):xv(e,a,t,o);return Bv(e,c,n,i,a)},Uv=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?Nv(e,t,Tv(n,r,i),a):zc(o,i)&&Nv(e,t,n,a)},Wv=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),Gv=(t,n,r,i,a,o)=>{let[s,c]=n.args,l=t.isInit?kv(t.environment,s,i):Av(t.environment,s,i),u=Sv(t,i,a);if(l===void 0)return bv(t,o,n,u)===!0&&Nv(t,r,a,o);let d=bv(t,o,c,u),f=a[l];if(n.operator===`=`)return Uv(t,r,a,l,d,o);let p=n.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(typeof p==`object`&&p!==d&&(t.callStack?.sources.set(p,c),t.coverage?.values.set(p,o)),f!==void 0)return bv(t,o,n,u)===!0&&Nv(t,r,a,o);if(!cl(p))throw new e.x(`The right side of \\IN is not enumerable.`);let m=Cl(p),h=t.generator;if(h){let e=Xv(t,p,m);for(let n=0;n<e.length;n++){let i=Nv(t,r,Tv(a,l,e[n]),o);if(h.kept>0)return i}}let g=t.coverage&&$d(t.coverage,p,m,!1),_=m.reduce((e,n)=>(g?.next(),Nv(t,r,Tv(a,l,n),o)||e),!1);return g?.next(),_},Kv=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),qv=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Jv={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},Yv=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:Jv[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${Q(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${Q(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${Q(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${Q(e)}`},Xv=(e,t,n)=>{let r=e.environment.runtime,i=Qg(n.length,t,r.getRandom(),r.version);return e.coverage&&Qd(e.coverage,t,n.length,i),i},Zv=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=yv(e,r,()=>Xb(t.bounds,e=>{let t=$(e,n);return{value:t,elements:qb(t,e,a)}})),s=o.map(e=>e.elements);Qb(t.bounds,s,n.scope,e=>(i.push(e),!1));let c=e.coverage;return{bindings:i,charge:c&&tf(c,o.map(e=>e.value),s)}},Qv=(t,n,r,i,a,o)=>{let s=Sv(t,i,a);switch(n.kind){case`Identifier`:return Hv(t,n,r,i,a,o);case`Apply`:return Kv.has(n.operator)&&n.args.length===2?Gv(t,n,r,i,a,o):n.operator===`=>`&&n.args.length===2?jv(bv(t,o,n.args[0],s))?Rv(t,n.args[1],r,i,a,o):Nv(t,r,a,o):Hv(t,n,r,i,a,o);case`And`:{let e=n.operands;if(n.isBulleted||e.length===2){let n=e.slice(1).reduceRight((e,t)=>Wv(`Predicate`,t,i,o,e),r);return Rv(t,e[0],n,i,a,o)}let s=e[e.length-1];return zv(t,Ev(n,e.length-1),Wv(`Predicate`,s,i,o,r),i,a,Dv(t,o))}case`Or`:{let e=n.operands,s=n.isBulleted||e.length===2,c=t.generator;if(c){let l=s?e.length:2,u=Math.floor(c.random.nextDouble()*l),d=Hg(c.random),f=!1;for(let p=0;p<l;p++){let m=(u+p*d)%l;if(f=(s||m===1?Rv(t,e[s?m:e.length-1],r,i,a,o):zv(t,Ev(n,e.length-1),r,i,a,Dv(t,o)))||f,c.kept>0)return f}return f}if(s)return e.reduce((e,n)=>Rv(t,n,r,i,a,o)||e,!1);let l=zv(t,Ev(n,e.length-1),r,i,a,Dv(t,o)),u=Rv(t,e[e.length-1],r,i,a,o);return l||u}case`Exists`:{let e=t.generator;if(e){let i=t.environment.runtime.version,c=yv(t,o,()=>Xb(n.bounds,e=>$(e,s))).map((e,r)=>Xv(t,e,Gb(e,n.bounds[r].set,i))),l=!1;return Qb(n.bounds,c,s.scope,i=>(l=Rv(t,n.body,r,i,a,o)||l,e.kept>0)),l}let i=Zv(t,n,s,o);return i.bindings.reduce((e,s)=>(i.charge?.(),Rv(t,n.body,r,s,a,o)||e),!1)}case`Forall`:{let e=Zv(t,n,s,o),i=e.bindings;if(i.forEach(()=>e.charge?.()),i.length===0)return Nv(t,r,a,o);let c=i.slice(1).reduce((e,t)=>Wv(`Predicate`,n.body,t,o,e),r);return Rv(t,n.body,c,i[0],a,o)}case`If`:return Rv(t,jv(bv(t,o,n.condition,s))?n.consequent:n.alternative,r,i,a,o);case`Case`:{let c=n.arms.find(e=>jv(bv(t,o,e.condition,s)))?.body??n.other;if(c===void 0)throw new e.x(`TLC encountered a CASE with no conditions true.`);return Rv(t,c,r,i,a,o)}case`FunctionApplication`:{let e=ax(bv(t,o,n.function,t.isInit?s:Pb(s)));if(e){let i=yv(t,o,()=>ox(e,n,s));return Rv(t,e.body,r,i,a,o)}break}case`Unchanged`:if(!t.isInit)return ey(t,n.expression,r,i,a,o);break;case`BoxAction`:if(!t.isInit){let e=Rv(t,n.action,r,i,a,o);return ey(t,n.subscript,r,i,a,o)||e}break;case`AngleAction`:if(!t.isInit)return Rv(t,n.action,Wv(`Changed`,n.subscript,i,o,r),i,a,o)}let c=t.isEnabled?Yv(n):void 0;if(c!==void 0)throw new e.x(c);return Bv(t,bv(t,o,n,s),r,a,o)},$v=(e,t,n)=>e.runtime.warn(_o.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${Q(n)}`),ey=(e,t,n,r,i,a)=>_v(e,t,()=>{let o=vv(e,a,t),s=kv(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;e.isEnabled&&e.coverage&&Hd(e.coverage,o);let a=i[s];return a!==void 0&&!zc(a,r)?($v(e.environment,s,t),!1):Uv(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return Nv(e,n,i,o);let c=s.reduceRight((e,t)=>Wv(`Unchanged`,t,r,o,e),n);return ey(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=Ab(r,t.name);if(a?.kind===`Thunk`)return ey(e,a.expression,n,a.scope,i,o);let s=a?void 0:xx(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return ey(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=Sv(e,r,i),s=Sx(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return ey(e,s.body,n,Px(s,t.args,a),i,o)}let c=e.environment,l=bv(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=bv(e,o,t,{environment:c,scope:r,state:i,next:void 0});return zc(l,u)&&Nv(e,n,i,o)}),ty=(e,t,n,r,i,a)=>({environment:e,callStack:e.callStack,coverage:t===`enabled`&&e.coverage?.current===-1?void 0:e.coverage,isInit:t===`init`,isEnabled:t===`enabled`,current:n,onState:r,onIncomplete:i,generator:a}),ny=/* @__PURE__ */ Error(`The replay found a successor`),ry=(e,t,n,r)=>{let i=()=>{throw ny},a=r.coverage?.current??-1,o=ty(r,`enabled`,n,i,i),s=o.callStack,c=s?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Wv(`Changed`,e.subscript,t,a,void 0);Rv(o,e.action,n,t,wv(r),a)}else Rv(o,e,void 0,t,wv(r),a);return!1}catch(e){if(e!==ny)throw e;return s&&(s.expressions.length=c,s.isFrozen=!1),!0}},iy=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=ty(t,`init`,void 0,n,r),s=a.reduceRight((e,t)=>Wv(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);Rv(o,i.expression,s,i.scope,wv(t),i.node??-1)},ay=(e,t,n,r)=>{if(e.some(e=>qv.has(e.expression.kind)))return;let i=n.coverage;e.forEach(e=>{let a=[],o=e.node??-1;oy(e,o,t,n,e=>{i&&o!==-1&&i.primary[o]++,a.push(e)}),a.forEach(t=>r(t,e))})},oy=(e,t,n,r,i,a,o)=>{let s=ty(r,`next`,n,i,a,o);Rv(s,e.expression,void 0,e.scope,wv(r),t)},sy=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(kv(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=Ab(r,e.name)?void 0:xx(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,Rx(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`Selection`:a(e.expression,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`){Av(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=Ab(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?Sx(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:xx(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,Px(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??[])},cy=/* @__PURE__ */ new WeakMap,ly=/* @__PURE__ */ new WeakMap,uy=(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},dy=(e,t,n)=>{let r=e.slice();return r[t]=n,r},fy=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,py=(t,n)=>{let r=new e.x(n);return t.isInit?r:e.at(r,e.nt.error)},my=(e,t,n,r)=>{let i=yb(n);return r&&qv.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 ${fy(e)}, TLC expected a boolean expression,\nbut instead found ${q(t)}.\n${i}`},hy=(e,t,n)=>{let r=Lf(t),i=Q(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 ${fy(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
1791
|
+
`:``}${i}`},gy=(e,t,n)=>yy(e,t,$(t,n)),_y=new Set(J_.map(e=>e.name)),vy=e=>e.kind===`Apply`?_y.has(e.operator):e.kind!==`Identifier`&&!qv.has(e.kind),yy=(t,n,r,i=!0)=>{if(typeof r==`boolean`)return r;let a=my(t,r,n,i);throw t.isInit&&i&&vy(n)?new e.B(a):py(t,a)},by=(e,t,n,r)=>r.environment.callStack?$(n,r):(e[t]??=eS(n,r.environment))(r),xy=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Sy=(e,t,n)=>{let r=n?cy:ly,i=r.get(e);if(i)return i;let a=nb(e,t,n),o=n?void 0:tb(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},Cy=(e,t)=>{if(t.constants.has(e))return;let n=Vb(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},wy=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return wy(e.expression,t,!1,r);if(e.kind!==`Identifier`||A(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Cy(e.name,t);if(a&&!r.has(a))return r.add(a),wy(a.body,t,n,r)},Ty=(e,t,n)=>wy(e,t,!n),Ey=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return Ey(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Rx(e.definitions,uy(r,t,n));return Ey(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Ab(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return Ey(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=Cy(e.name,r.environment);if(s)return Ey(s.body,void 0,n,r,i)},Dy=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||A(e))||!t&&e.kind===`Prime`,Oy=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Oy(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=Cy(e.name,t);if(i)return n.add(e.name),Oy(i.body,t,n)},ky=/* @__PURE__ */ new Set([`Label`,`Selection`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Ay=(e,t,n)=>ky.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||xy(e.operator)&&(Dy(e.args[0],n)||Ty(e.args[0],t,n)!==void 0)||A(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,jy=/* @__PURE__ */ new Set,My=(e,t)=>{if(A(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return op(e,(e,i)=>{let a=r?My(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];a?n.push(...a):r=!1}),r?n:void 0},Ny=(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||A(e)?void 0:Vb(r,t);return i&&!n.has(i)&&(n.add(i),Ny(i.body,t,n))?!0:Ue(e).some(e=>Ny(e,t,n))},Py=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Ty(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=Oy(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return Ay(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Sy(e,t,n)}},Fy=(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(vh(e,t)===void 0||Ny(e,t,/* @__PURE__ */ new Set))return!0;let n=My(e,jy);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)}},Iy=(e,t,n)=>{let r=e.map(e=>Py(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Mv(t);for(let s=e;s<r.length;s++){if(s>0&&f&&ib(u)){d??=uy(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&&!zc(t,i[e.index])}):void 0;if(o){$v(t.environment,o.index,o.expression);return}let s=n.expression,c=by(a,e,s,d);if(!yy(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=uy(t,n,u);let r=by(i,s,e.expression,d);if(!yy(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=uy(t,n,u);let r=by(i,s,e.value,d),a=u[e.index];if(a===void 0)u=dy(u,e.index,r),d=void 0;else if(!zc(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(!zc(e,n[i.index])){$v(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)},Ly=e=>{let t=Yv(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw py(n,t);gy(n,e,uy(n,r,i))&&s(i,a)}},Ry=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=uy(r,i,a);if(a[l]!==void 0){gy(r,e,u)&&c(a,o);return}let d=$(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!cl(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${fy(r)}, the right side of \\IN is not enumerable.`;throw py(r,`${t}\n${Q(e)}`)}let p=Cl(f);if(r.generator){for(let e of Qg(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(dy(a,l,e),o),r.generator.kept>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(dy(a,l,p[e]),o)}},zy=/* @__PURE__ */ new WeakMap,By=e=>{let t=zy.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(By),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return zy.set(e,n),n},Vy=(e,t)=>{let n=e.args[0],r=Ly(e),i=(e,r,i)=>Ey(n,r,i,e,!t)??-1,a=Ry(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=$(e.args[1],uy(t,n,o));l(dy(o,u,d),s)}},Hy=(e,t,n)=>{let r=Q(e);return(i,a,o,s,c,l)=>{let u=uy(i,a,o),d=$(e.function,n?u:Pb(u)),f=ax(d);if(f!==void 0){Sy(f.body,t,n)(i,ox(f,e,u),o,s,c,l);return}if(!as(d))throw py(i,`In computing ${fy(i)}, a non-function (${Lf(d)}) was applied as a function.\n${r}`);let p=$(e,u);if(typeof p!=`boolean`)throw py(i,`In computing ${fy(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Uy=(e,t)=>{let n=By(e);return Oy(e,t)?Iy([n],t,!1):e.kind===`Tuple`?Sy(n,t,!1):(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Ab(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){Sy(By(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=uy(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=Sx(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){Sy(By(n.body),t,!1)(r,Px(n,e.args,u),a,o,s,c);return}}gy(r,n,u)&&c(a,o)}},Wy=(e,t,n)=>{let r=e.operator,i=Ly(e),a=A(e)?void 0:xx(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=aS(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=Sy(a.body,t,n),o(e,i(uy(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=uy(a,o,s),f=Sx(e,d);f?.kind===`Closure`?Sy(f.body,t,n)(a,Px(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Gy=(e,t,n)=>{let r=Ly(e),i=A(e)?void 0:Cy(e.name,t),a;return(o,s,c,l,u,d)=>{let f=Ab(s,e.name);f?.kind===`Thunk`&&!f.isReleased?Sy(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&gx(i,t)!==void 0?r(o,s,c,l,u,d):(a??=Sy(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},Ky=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||A(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`||!A(i))return;let a=wy(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},qy=e=>e.kind===`And`?e.operands.flatMap(qy):[e],Jy=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&Ay(e,t,!1),Yy=e=>{let t=[];return(n,r,i)=>{let a=uy(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!yy(n,i,by(t,r,i,a)))return}}},Xy=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=qy(e),r=n.findIndex(e=>!Jy(e,t)||Ky(e,t)),i=r===-1?void 0:Ky(n[r],t);return i?{...i,before:r===0?void 0:Yy(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>Xy(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`||A(e))return;let r=xx(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Xy(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`||!A(o))return;let s=i.before,c=s&&aS(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(uy(e,t,n)),n))}},Zy=(e,t,n)=>{let r=Ab(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},Qy=(e,t,n)=>{let r=e.map(e=>Sy(e,t,n)),i=n?[]:e.map(e=>Xy(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&&Zy(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)}}},$y=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.random.nextDouble()*e.length),l=Hg(s.random);for(let u=0;u<e.length;u++)if(e[(c+u*l)%e.length](t,n,r,i,a,o),s.kept>0||t.isStopped)return},eb=(e,t)=>{let n=Sy(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=uy(r,i,a),u=t.runtime.version,d=Xb(e.bounds,e=>$(e,l)).map((n,r)=>Qg(Gb(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.generator?.kept??0)>0||r.isStopped;let l=e.bounds[t].pattern;return d[t].some(e=>f(t-1,Mb(i,l,e)))};f(d.length-1,i)}},tb=(e,t)=>{if(e.kind===`Exists`)return eb(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>Sy(e,t,!1));return e.isBulleted?$y(n):n.reduce((e,t)=>$y([e,t]))},nb=(t,n,r)=>{let i=e=>Sy(e,n,r);switch(t.kind){case`And`:return Iy(t.operands,n,r);case`Or`:return Qy(t.operands,n,r);case`Exists`:{let e=i(t.body),a=t.bounds[0];if(t.bounds.length===1&&a.pattern.kind===`Name`){let t=a.pattern.name;return(r,i,o,s,c,l)=>{let u=Gb($(a.set,uy(r,i,o)),a.set,n.runtime.version);for(let n=0;n<u.length&&!r.isStopped;n++)e(r,jb(i,t,u[n]),o,s,c,l)}}let o=r?void 0:Fy(t,n);if(o){let e=Iy(o.rest,n,r);return(r,i,a,s,c,l)=>{let u=uy(r,i,a),d=Xb(t.bounds,e=>Gb($(e,u),e,n.runtime.version));if(d.some(e=>e.length===0))return;let f=(t,n)=>{if(t<0)e(r,n,a,s,c,l);else for(let e of d[t]){if(r.isStopped)return;let i=jb(n,o.names[t],e);if(t===d.length-1){let e=uy(r,i,a);if(!o.guards.every(t=>gy(r,t,e)))continue}f(t-1,i)}};f(d.length-1,i)}}return(n,r,i,a,o,s)=>{$b(t.bounds,uy(n,r,i),t=>(e(n,t,i,a,o,s),n.isStopped))}}case`Forall`:{let e=i(t.body),a=!r&&vh(t,n)!==void 0&&!Ny(t.body,n,/* @__PURE__ */ new Set)?My(t,jy):void 0;return(n,r,i,o,s,c)=>{let l=[];$b(t.bounds,uy(n,r,i),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Ab(r,e)?.kind===`Value`)){u.every(e=>gy(n,t.body,uy(n,e,i)))&&c(i,o);return}let d=(r,i,a)=>{r===u.length?c(i,a):r>0&&n.isInit&&ib(i)?u.slice(r).every(e=>gy(n,t.body,uy(n,e,i)))&&c(i,a):e(n,u[r],i,a,!0,(e,t)=>d(r+1,e,t))};d(0,i,o)}}case`If`:{let e=i(t.consequent),n=i(t.alternative);return(r,i,a,o,s,c)=>{let l=$(t.condition,uy(r,i,a));if(typeof l!=`boolean`)throw py(r,hy(r,l,t));(l?e:n)(r,i,a,o,s,c)}}case`Case`:{let e=t.arms.map(e=>({condition:e.condition,source:e.body,body:i(e.body)})),n=t.other?i(t.other):void 0;return(r,i,a,o,s,c)=>{let l=uy(r,i,a),u=e.find(e=>{let t=$(e.condition,l);if(typeof t==`boolean`)return t;throw py(r,`In computing ${fy(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Lf(t)}) was used as a guard condition of a CASE.\n${yb(e.source)}`)})?.body??n;if(!u)throw py(r,`In computing ${fy(r)}, TLC encountered a CASE with no conditions true.\n${Q(t)}`);u(r,i,a,o,s,c)}}case`Let`:{let e=i(t.body),r=Bx(t.definitions,n),a={impure:/* @__PURE__ */ new Set,streamed:r.streamed};return(n,i,o,s,c,l)=>e(n,Rx(t.definitions,uy(n,i,o),n.isEnabled?a:r),o,s,c,l)}case`Unchanged`:return r?()=>{throw new e.x(`UNCHANGED appears in an initial predicate at ${gb(t)}`)}:Uy(t.expression,n);case`AngleAction`:{let e=i(t.action),r={kind:`Unchanged`,expression:t.subscript,location:t.subscript.location},a=(e,t,i)=>{try{return gy(e,r,uy(e,t,i))}catch(t){throw e.isEnabled?kb(t,n.runtime.version):t}};return(t,n,r,i,o,s)=>e(t,n,r,i,o,(e,r)=>{a(t,n,e)||s(e,r)})}case`BoxAction`:return Qy([t.action,By(t.subscript)],n,r);case`Label`:return i(t.body);case`Selection`:return i(t.expression);case`Identifier`:return Gy(t,n,r);case`FunctionApplication`:return Hy(t,n,r);case`Apply`:{let e=t.args;if(xy(t.operator)){let i=Ty(e[0],n,r);if(i!==void 0)return t.operator===`=`?Iy([t],n,r):Ry(t,()=>i);if(Dy(e[0],r))return Vy(t,r)}if(t.operator===`=>`){let n=i(e[1]);return(r,i,a,o,s,c)=>{let l=$(e[0],uy(r,i,a));if(typeof l!=`boolean`){let e=Lf(l),n=Q(t);throw py(r,r.isInit?`In computing initial states of a predicate of form P => Q, P was ${e}\n.${n}`:r.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${e}.\n${n}`:`In computing next states of a predicate of the form P => Q, P was\n${e}.\n${n}`)}l?n(r,i,a,o,s,c):c(a,o)}}return Wy(t,n,r)}default:return Ly(t)}},rb=e=>e.variables.map(()=>void 0),ib=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},ab=(t,n)=>{let r=n.state;if(!r||!ib(r))throw new e.x(`ENABLED needs a complete state at ${gb(t)}`);let i=n.environment;if(i.callStack||i.coverage&&i.coverage.current!==-1)return ry(t,n.scope,r,i);let a={environment:i,isInit:!1,isEnabled:!0,current:r,isStopped:!1,generator:void 0,successors:0};return Sy(t,i,!1)(a,n.scope,rb(i),void 0,!1,()=>{a.isStopped=!0}),a.isStopped},ob=(t,n,r,i,a)=>{let o={environment:n,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};Sy(t,n,!0)(o,i,rb(n),void 0,!1,t=>{if(!o.isStopped){if(!ib(t)){if(a){o.isStopped=a([...t]);return}throw e.at(new e.C([...t]),e.nt.error)}o.isStopped=r(t)}})},sb=(e,t,n)=>{let r=[];return ob(e,t,e=>(r.push(e),!1),n),r},cb=(t,n,r)=>{let i=r.variables.filter((e,n)=>t[n]===void 0);return new e.w(`Successor state is not completely specified by action ${n??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,t,n,i)},lb=(e,t,n,r,i,a,o,s)=>{let c={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:a,successors:0,onUnsatisfied:o};return Sy(e,n,!1)(c,i,rb(n),void 0,!1,(e,t)=>{if(!c.isStopped){if(!ib(e)){if(s){s(e,t);return}throw cb(e,t,n)}c.successors++,c.isStopped=r({state:e,action:t})}}),c.successors},ub=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return Sy(e,n,!1)(i,r,rb(n),void 0,!1,e=>{ib(e)||i.successors++}),i.successors>0},db=(e,t,n,r)=>{let i=[];return lb(e,t,n,e=>(i.push(e),!1),r),i},fb=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),pb=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),mb=e=>pb.has(e.kind)||e.kind===`Apply`&&fb.has(e.operator),hb=(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&&is(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},gb=e=>`line ${e.location.line}, column ${e.location.column}`,Q=t=>{let n=t.location.range;return n?e.X(n):gb(t)},_b={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},vb=(t,n)=>new e.x(`TLC encountered a temporal formula (${t}) when evaluating a predicate or action.\n${Q(n)}`),yb=e=>e.kind===`Number`?e.text??String(e.value):Q(e),bb=(t,n)=>new e.x(`A non-boolean expression (${Lf(n)}) was used as the condition of an IF.\n${Q(t)}`),xb=(t,n,r)=>{let i=t.location.range;if(i?.start.line===t.location.line&&i.start.column===t.location.column||!i)return new e.x(`A non-boolean expression (${Lf(r)}) was used as a formula in a ${t.kind===`And`?`conjunction`:`disjunction`}.\n${yb(t.operands[n])}`);let a=t.prefixEnds?.[Math.max(n,1)-1]??i.end;return new e.x(`Attempted to evaluate an expression of form P ${t.kind===`And`?`/\\`:`\\/`} Q when ${n===0?`P`:`Q`} was\n${Lf(r)}.\n${Q({...t,location:{...t.location,range:{...i,end:a}}})}`)},Sb=t=>{let n=t.field,r=e=>`Attempted to select nonexistent field "${n}" from the record\n${U(q(e))}\n${Q(t)}`,i=e=>`Attempted to apply function:\n${U(q(e))}\nto argument "${n}", which is not in the domain of the function.`;return a=>{if(!as(a))throw new e.x(`Attempted to select field "${n}" from a non-record value ${U(q(a))}\n${Q(t)}`);let o=nc(a);if(o===`tuple`)throw Ql(n);return ou(a.kind===`LazyFunction`?K(a):a,n,o===`record`?r:i)}},Cb=e=>e===`1.7.4`?(t,n)=>Yl(t,n,e):void 0,wb=t=>n=>{if(!as(n))throw new e.x(`Attempted to apply the operator DOMAIN to a non-function\n(${Lf(n)})\n${Q(t)}`);return cu(n)},Tb=(t,n)=>(r,i)=>{if(!rs(r)||zs(r))throw new e.x(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Q(t)}`);return n(r,i)},Eb=t=>e.at(new e.x(`TLC can't handle real numbers.\n${t.text}`),e.nt.configParseError),Db=t=>e.at(new e.x(`TLC can't handle a number this big.\n${t.text??t.value}`),e.nt.error),Ob=(t,n)=>new e.z(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${Q(n)}`,t),kb=(t,n)=>t instanceof e.z&&n!==`1.7.4`?new e.x(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${t.variable} occurring in the state formula v.\n`):t,Ab=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},jb=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Mb=(t,n,r)=>{if(n.kind===`Name`)return jb(t,n.name,r);let i=Il(r);if(!i||i.length!==n.names.length){let t=n.ranges?.[0];throw new e.x(`Argument mismatch in operator application.${t?e.X(t):``}`)}return n.names.reduce((e,t,n)=>jb(e,t,i[n]),t)},Nb=(t,n)=>{if(as(t))return t;throw new e.x(`A non-function (${Lf(t)}) was applied as a function.\n${Q(n)}`)},Pb=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},Fb=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),Ib=(t,n)=>{if(typeof t!=`boolean`)throw new e.x(`Expected ${n} to be a boolean but found ${q(t)}`);return t},Lb=(t,n,r)=>{if(typeof t!=`boolean`)throw new e.x(`Attempted to evaluate an expression of form P => Q when ${r} was\n${Lf(t)}.\n${Q(n)}`);return t},Rb=(t,n)=>{if(typeof t!=`boolean`)throw new e.x(`Attempted to apply the operator ~ to a non-boolean\n(${Lf(t)})\n${Q(n)}`);return!t},zb=(t,n,r)=>{if(typeof t!=`boolean`||typeof n!=`boolean`)throw new e.x(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${Q(r)}`);return t===n},Bb=(t,n)=>{if(typeof t!=`boolean`)throw new e.x(`TLC expected a boolean value, but did not find one. ${yb(n)}`);return t},Vb=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),Hb=(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.`},Ub=(t,n,r)=>{if(!rs(t)||zs(t)){let i=q(t),a=r===`1.7.4`?void 0:Hb(t,i);throw new e.x(a===void 0?`TLC encountered a non-enumerable quantifier bound\n${i}.\n${yb(n)}`:`TLC encountered the non-enumerable quantifier bound\n${i}\n${yb(n)}\n${a}`)}},Wb=(e,t,n)=>(Ub(e,t,n),typeof e==`object`&&e.kind===`Interval`?tl(e):hl(e)??xl(e)),Gb=(e,t,n)=>n===`1.7.4`?(Ub(e,t,n),hl(e)??Cl(e)):Wb(e,t,n),Kb=e=>{if(typeof e==`object`&&e.kind===`Interval`)return jl(e),e},qb=(e,t,n)=>Kb(e)??Gb(e,t,n),Jb=(e,t,n)=>Kb(e)??Wb(e,t,n),Yb=(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},Xb=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set,i)),n),[]),Zb=(e,t)=>Xb(e,e=>qb($(e,t),e,t.environment.runtime.version)),Qb=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Yb(t[n],t=>i(n-1,Mb(a,e[n].pattern,t)));return i(e.length-1,n)},$b=(e,t,n)=>Qb(e,Zb(e,t),t.scope,n),ex=(e,t,n,r)=>{let i=Xb(e,e=>{let n=$(e,t);return{value:n,elements:qb(n,e,t.environment.runtime.version)}}),a=i.map(e=>e.elements),o=tf(n,i.map(e=>e.value),a);return Qb(e,a,t.scope,e=>(o(),r(e)))},tx=(e,t)=>{let n=Xb(e,e=>$(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},nx=(e,t,n)=>{if(e.length===1)return Mb(t,e[0].pattern,n);let r=Il(n)??[];return e.reduce((e,t,n)=>Mb(e,t.pattern,r[n]),t)},rx=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,ix=e=>Object.assign(e.value,{lambda:e}),ax=e=>rx(e)?e.lambda:void 0,ox=(t,n,r)=>{let i=t.value,a=n.args.map(e=>$(e,r)),o=a.length===1?a[0]:al(a),s=(e,t,r)=>`In applying the function\n${U(q(i))},\nthe ${e} is:\n${U(q(t))}${r}.\n${Q(n.function)}`,c=t.bounds;if(c.length===1){if(!Vl(o,i.domain))throw new e.x(s(`first argument`,o,`which is not in its domain`));return nx(c,t.scope,o)}let l=Il(o),u=typeof i.domain==`object`&&i.domain.kind===`ProductSet`?i.domain.factors:[];if(l===void 0)throw new e.x(`Attempted to apply a function to an argument not in its domain.\n${Q(n.function)}`);let d=()=>new e.x(`In applying the function\n${U(q(i))},\nthe argument list is:\n${U(q(o))}\nwhich does not match its formal parameter.\n`);if(c.forEach((t,n)=>{if(n>=l.length)throw d();let r=l[n],i=`argument number ${n+1}`;if(!Vl(r,u[n]))throw new e.x(s(i,r,`${t.pattern.kind===`Name`?``:`
|
|
1792
|
+
`}which is not in its domain`));if(t.pattern.kind===`Tuple`&&Il(r)?.length!==t.pattern.names.length)throw new e.x(s(i,r,`which does not match its formal parameter`))}),l.length>c.length)throw d();return nx(c,t.scope,o)},sx=(e,t)=>{if(t.location.range)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:yb(t)}},cx=(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}},lx=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},ux=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),dx=(e,t)=>{let n=tx(e.bounds,t),r=(n,r)=>$(e.body,Fb(t,nx(e.bounds,jb(void 0,e.name,r),n))),i=t.environment.coverage,a=i&&!t.environment.callStack?i.current:-1,o=lx(n,i?(e,t)=>i.current===-1?r(e,t):Ud(i,a,()=>r(e,t)):r,cx(sx(e.bounds,e.body),e.bounds,n),ux(e.bounds));ix({value:o,bounds:e.bounds,body:e.body,scope:jb(void 0,e.name,o)});let s=Object.assign(o,{rebind:n=>{let r=dx(e,{...t,environment:n});return r.enumerated=o.enumerated,r}});return e.bounds.length===1?rc(s):s},fx=(t,n)=>{if(typeof n!=`object`||nc(n)!==`lambda`||t.kind===`Operator`||t.isSelfReferential||n.kind!==`LazyFunction`||!is(n.domain))return n;try{let e=K(n);return $s(e.domain,e.range)}catch(t){if(t instanceof e.x)return n;throw t}},px=(t,n)=>{if(t.kind===`Operator`&&t.params.length>0)return()=>{throw new e.x(`Operator ${t.name} requires ${t.params.length} arguments`)};if(t.kind!==`Function`)return eS(t.body,n);let r=Ve(t,!1);if(!t.isSelfReferential)return eS(r,n);let i=e=>dx(t,e),a=n.coverage;return a?Qx(r,i,a):i},mx={name:``,binding:{kind:`Value`,value:!1},parent:void 0},hx=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=px(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=e.kind===`Operator`&&e.params.length===0&&hh(e.body,t)?e=>(i===void 0?void 0:a[i])??r(Fb(e,sS(e.scope)?void 0:mx)):i===void 0?e=>r(Fb(e,void 0)):e=>a[i]??r(Fb(e,void 0));return t.definitionEvaluators.set(e,o),o},gx=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},_x=(t,n)=>t.forEach(t=>{if(t.kind===`Operator`&&t.params.length>0)return;let r=t.name;if(n.constants.has(r)||n.substitutions.has(r)||!dh(t,n))return;let i=n.facts.ids.get(t);if(i===void 0||n.startupValues[i]!==void 0)return;let a={environment:n,scope:void 0,state:void 0,next:void 0};try{let e=n.runtime.evaluateAtStartup(()=>fx(t,px(t,n)(a)));Lc(e),n.startupValues[i]=e}catch(t){if(!(t instanceof e.x)&&!e.tt(t))throw t}}),vx=(t,n)=>{if(n===void 0||t===n)return!0;try{return n.every((e,n)=>e===void 0||t?.[n]!==void 0&&uc(t[n],e))}catch(t){if(t instanceof e.x)return!1;throw t}},yx=(e,t)=>{let n=e.cache;if(n!==void 0&&vx(t.state,e.state)&&vx(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?Ud(r,i,()=>$(e.expression,Fb(t,e.scope))):$(e.expression,Fb(t,e.scope));return(!e.isStreamed||Tl(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},bx=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),xx=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return xx(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?bx(r):t.builtins.get(e)},Sx=(e,t)=>A(e)?Cx(e.operator,t):xx(e.operator,t.environment)??Cx(e.operator,t),Cx=(e,t)=>{let n=Ab(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return xx(e,t.environment)},wx=e=>e.kind===`Closure`?e.params.length:e.arity,Tx=(t,n)=>{if(t.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:t.params.map(e=>({name:e,arity:0})),body:t.body,scope:n.scope};let r=t.kind===`OperatorReference`?t.operator:t.kind===`Identifier`?t.name:void 0,i=r===void 0?void 0:Cx(r,n);if(!i)throw new e.x(`Expected an operator argument at ${gb(t)}`);return i},Ex=(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)=>jb(e,n.name,t[r]),e.scope);return $(e.body,Fb(n,r))},Dx=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:wx(e),call:n=>Ex(e,n,t)},Ox=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Cx(e.name,t);return n!==void 0&&wx(n)>0},kx=(e,t)=>e.map(e=>Ox(e,t)?Dx(Tx(e,t),t):$(e,t)),Ax=(t,n)=>new e.x(`Operator ${t.name} expects ${t.params.length} arguments but received ${n}`),jx=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),Mx=(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 Mx(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([])}},Nx=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&ls(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=jx(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=A(e)?void 0:Mx(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=Ab(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:jx(e,t)}}return t=>jx(e,t)},Px=(e,t,n,r)=>{if(t.length!==e.params.length)throw Ax(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:Tx(t[a],n)}:(r?.[a]??Nx(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},Fx=(e,t,n,r)=>e.kind===`Closure`?$(e.body,Fb(n,Px(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>$(e,n))):e.isLazy?e.evaluate(rS(t,n),n):e.evaluate(kx(t,n),n),Ix=e=>e.kind===`Operator`&&e.isRecursive&&e.params.length>0,Lx=(e,t,n)=>{let r=n;for(let n=0;n<e.length;n++)Ix(e[n])&&(t[n].parent=r,r=t[n]);for(let n=0;n<e.length;n++)Ix(e[n])||(t[n].parent=r,r=t[n]);return r},Rx=(e,t,n)=>{let r=e.map(e=>({name:e.name,binding:{kind:`Value`,value:!1},parent:void 0})),i=t.scope,a=!1;for(let t=0;t<r.length;t++)r[t].parent=i,i=r[t],a||=e[t].isRecursive;a&&(i=Lx(e,r,t.scope));let o=!1;for(let a=e.length-1;a>=0;a--){let s=e[a];o||=s.isRecursive&&s.kind===`Operator`&&s.params.length===0;let c=s.kind===`Operator`&&s.params.length===0&&!o?r[a].parent:i;r[a].binding=s.kind===`Function`?{kind:`Thunk`,expression:Ve(s,!0),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1}:s.params.length>0||n?.impure.has(s)?{kind:`Operator`,operator:{kind:`Closure`,name:s.name,params:s.params,body:s.body,scope:c}}:{kind:`Thunk`,expression:s.body,scope:c,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(s)??!1}}let s=t.environment.coverage;return s&&s.current!==-1&&r.forEach(e=>{e.binding.kind===`Thunk`&&s.values.set(e.binding,s.current)}),i},zx=(t,n,r)=>{let i=Ab(r.scope,t);if(i?.kind===`Value`)return i.value;if(i?.kind===`Thunk`)return yx(i,r);if(i?.kind===`Operator`){if(wx(i.operator)===0)return Ex(i.operator,[],r);throw new e.x(`Operator ${t} is used without arguments`)}let a=Mx(t,r.environment);if(a?.kind===`Variable`){let e=r.state?.[a.index];if(e===void 0)throw Ob(t,n);return e}if(a?.kind===`Value`)return a.value;if(a?.kind===`Definition`)return hx(a.definition,r.environment)(r);let o=r.environment.builtins.get(r.environment.substitutions.get(t)??t);if(o?.arity===0)return o.evaluate([],r);throw new e.x(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${Q(n)}`)},Bx=(e,t)=>({impure:new Set(e.filter(e=>mh(e,t,`varying`))),streamed:new Set(e.filter(e=>mh(e,t,`streamed`)))}),Vx=e=>[...e.facts.ids.keys()].some(t=>mh(t,e)),Hx=e=>[...e.facts.ids.keys()].some(t=>mh(t,e,`repeated`)),Ux=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,Wx=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),Gx=e=>t=>{let n=e(t);return uc(n,e(Wx(t)))},Kx=(t,n,r,i)=>a=>{i.expressions.push(t);let o=Rl.sets,s=Rl.callStack,c=o??[],l=c.length;Rl.sets=c,Rl.callStack=i;try{let e=n(a),o=Ux(e)?e.rebind(r):e;return i.values.set(t,o),typeof o==`object`&&o.kind!==`FilteredSet`&&mb(t)&&i.sources.set(o,t),o}catch(n){n instanceof e.P&&!i.isFrozen&&(i.expressions.length=0,i.isFrozen=!0);let r=n instanceof Error?i.failures.get(n):void 0;n instanceof Error&&i.failures.set(n,t);let a=hb(t,i.values),o=a&&!Ue(t).some(e=>e===r)?i.values.get(a):void 0,s=t.kind===`FunctionApplication`&&o!==void 0&&!as(o)?void 0:o;throw qx(i,[s,...c.slice(l).filter(e=>e!==s)],n),n}finally{i.isFrozen||i.expressions.pop(),c.length=l,Rl.sets=o,Rl.callStack=s}},qx=(t,n,r)=>{let i=[...new Set(n)].flatMap(e=>{let n=typeof e==`object`?t.sources.get(e):void 0;return n?[n]:[]});if(i.length>0&&r instanceof e.x){t.isFrozen||t.expressions.push(...i);let e=t.fingerprint;t.fingerprint={sources:[...i,...e?.sources??[]],reason:e?.reason??r.message}}t.isFrozen=!0},Jx=(t,n,r)=>{if(!(r instanceof e.x))return;t.isFrozen||t.expressions.push(n),t.isFrozen=!0;let i=t.fingerprint;t.fingerprint={sources:[n,...i?.sources??[]],reason:i?.reason??r.message}},Yx=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}}),Xx=(e,t,n)=>{let r=e.location.range,i=e.prefixEnds;if(!n||e.isBulleted||!r||!i||t.length<3)return;let a=i.slice(0,t.length-2).map(t=>({...e,location:{...e.location,range:{...r,end:t}}})).reverse(),o=e.kind===`And`;return r=>{n.expressions.push(...a);for(let i=0;i<t.length;i++){i>=2&&!n.isFrozen&&n.expressions.pop();let s=t[i](r);if(typeof s!=`boolean`)throw xb(e,i,s);if(s!==o)return n.isFrozen||(n.expressions.length-=a.length-Math.max(i-1,0)),s}return o}},Zx=(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)}},Qx=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=Vd(n,i,e);Hd(n,a),n.current=a;try{let i=t(r),o=e.kind===`SetEnumeration`||(e.kind===`SetFilter`||e.kind===`SetMap`)&&is(i)||e.kind===`SetFilter`&&typeof i==`object`&&i.kind===`FilteredSet`||(e.kind===`FunctionSet`||e.kind===`RecordSet`)&&typeof i==`object`&&i.kind===e.kind||e.kind===`Apply`&&e.operator===`SUBSET`&&typeof i==`object`&&i.kind===`Subset`;return typeof i==`object`&&o&&n.values.set(i,a),i}finally{n.current=i}},$x=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=jS(e,t),i=t.callStack,a=i&&Jf.get(e),o=i?Kx(e,r,t,i):r,s=i&&a?Zx(e,a,o,i):o,c=t.coverage,l=c?Qx(e,s,c):s;return t.evaluators.set(e,l),l},eS=(e,t)=>{if(t.callStack||t.coverage)return $x(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=Bh(e,t)??$x(e,t);return t.entryEvaluators.set(e,r),r},$=(e,t)=>eS(e,t.environment)(t),tS=(e,t)=>{let n=e.name,r=A(e)?void 0:Mx(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Ob(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n;return r=>(n??=hx(e,t))(r)}return t=>zx(n,e,t)},nS=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||A(e))return!0;let n=xx(e.name,t);return n===void 0||wx(n)===0},rS=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>$(e,t),expression:e})),iS=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(rS(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&nS(t[0],n)){let e=$x(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&nS(t[0],n)&&nS(t[1],n);if(i&&a){let e=$x(t[0],n),r=$x(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(kx(t,n),n)},aS=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw Ax(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Nx(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:Tx(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},oS=(e,t,n)=>{let r=aS(e,t,n),i;return t=>(i??=eS(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},sS=e=>{for(let t=e;t!==void 0;t=t.parent){let e=t.binding;if(e.kind!==`Operator`||e.operator.kind!==`Closure`||e.operator.params.length===0)return!1;let n=e.operator.scope;for(;n!==void 0&&n!==t;)n=n.parent;if(n!==t)return!1}return!0},cS=/* @__PURE__ */ new Set([`\\cup`,`\\cap`,`\\`]),lS=(t,n)=>{let r=t.args;if(t.operator===`=>`){let e=$x(r[0],n),i=$x(r[1],n);return n=>!Lb(e(n),t,`P`)||Lb(i(n),t,`Q`)}if(t.operator===`~`&&r.length===1){let e=$x(r[0],n);return n=>Rb(e(n),t)}if(t.operator===`<=>`){let e=$x(r[0],n),i=$x(r[1],n);return n=>zb(e(n),i(n),t)}if(t.operator===`~>`||t.operator===`-+->`)return()=>{throw vb(t.operator===`~>`?`a ~> b`:`a -+-> formula`,t)};let i=A(t)?void 0:xx(t.operator,n);if(i?.kind===`Closure`)return oS(i,r,n);if(i?.kind===`Builtin`&&i.name===`DOMAIN`){let e=$x(r[0],n),i=wb(t);return t=>i(e(t))}if(i?.kind===`Builtin`&&i.name===`TLCEval`&&r.length===1){let e=!qf.has(t)&&!yh(r[0],n),a=n.tlcEvalValues;return n=>{if(!e||!sS(n.scope))return i.evaluate(rS(r,n),n);let o=a.get(t);if(o!==void 0)return o;let s=i.evaluate(rS(r,n),void 0);return a.set(t,s),s}}if(i?.kind===`Builtin`&&i.name===`\\subseteq`&&i.evaluateBinary&&r.length===2){let e=$x(r[0],n),a=$x(r[1],n),o=Tb(t,i.evaluateBinary),s=n.coverage;return s?t=>{let n=e(t),r=a(t);if(typeof n!=`object`||n.kind!==`Set`||!s.values.has(n))return o(n,r);let i=n.elements.findIndex(e=>!Vl(e,r));return Wd(s,n,(i===-1?n.elements.length:i)+1),i===-1}:t=>o(e(t),a(t))}let a=n.coverage,o=i?.kind===`Builtin`?i.evaluateBinary:void 0;if(a&&o&&cS.has(t.operator)&&r.length===2){let e=$x(r[0],n),i=$x(r[1],n);return n=>{let r=e(n),s=i(n);return Gd(a,t.operator,r,s,o(r,s))}}if(i?.kind===`Builtin`)return iS(i,r,n);if(t.operator===`\\cdot`&&r.length===2)return()=>{throw new e.x(n.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let s=r.map(e=>Nx(e,n));return i=>{let a=Cx(t.operator,i);if(a)return Fx(a,r,i,s);throw n.definitions.get(t.operator)?.kind===`Function`?new e.x(`${t.operator} is a function; apply it with brackets`):new e.x(`Unknown operator ${t.operator} at ${gb(t)}`)}},uS=(e,t)=>{let n=e.kind===`Forall`,r=$x(e.body,t),i=e.bounds[0],a=t.coverage;if(a)return t=>ex(e.bounds,t,a,i=>Bb(r(Fb(t,i)),e)!==n)?!n:n;if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=$x(i.set,t);return s=>Yb(qb(o(s),i.set,t.runtime.version),t=>Bb(r(Fb(s,jb(s.scope,a,t))),e)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let i=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``);return a=>{let s=Xb(o,e=>qb($x(e,t)(a),e,t.runtime.version)),c=(t,o)=>t<0?Bb(r(Fb(a,o)),e)!==n:Yb(s[t],e=>c(t-1,jb(o,i[t],e)));return c(o.length-1,a.scope)?!n:n}}return t=>$b(o,t,i=>Bb(r(Fb(t,i)),e)!==n)?!n:n},dS=(e,t)=>{if(e.kind===`Tuple`)return al(e.names.map(e=>{let n=Ab(t,e);return n?.kind===`Value`&&n.value}));let n=Ab(t,e.name);return n?.kind===`Value`?n.value:void 0},fS=/* @__PURE__ */ new WeakSet,pS=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&fS.add(e)},mS=/* @__PURE__ */ new WeakMap,hS=e=>{if(mS.has(e))return mS.get(e);let t=/* @__PURE__ */ new Set,n=e=>{if(e.kind===`Subexpression`)return!1;let r=We(e);return r!==void 0&&t.add(r),e.kind===`ExceptAt`&&t.add(`@`),Ue(e).every(n)},r=n(e)?[...t]:void 0;return mS.set(e,r),r},gS=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=Ab(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),_S=e=>fS.has(e),vS=(t,n)=>{let r=_S(t),i=$x(t.body,n),a=t.bounds,o=a[0],s=a.length===1&&o.pattern.kind===`Name`,c=(e,t)=>{if(s&&o.pattern.kind===`Name`){let n=o.pattern.name,r=e=>i(Fb(t,jb(t.scope,n,e)));if(ts(e))return jl(e),ns(e,r),p(e,t);let a=rl(e),s=$s(a,a.map(r));return is(e)?s:(s.lambdaDomain=e,rc(s))}let n=[],r=Xb(a,(n,r)=>Jb(a.length>1&&typeof e==`object`&&e.kind===`ProductSet`?e.factors[r]:e,n,t.environment.runtime.version));return Qb(a,r,t.scope,e=>{let r=a.length===1?dS(o.pattern,e)??!1:al(a.map(t=>dS(t.pattern,e)??!1));return n.push([r,i(Fb(t,e))]),!1}),Jc(n)},l=sx(a,t.body),u=ux(a),d=hS(t.body),f=n.coverage,p=(e,r)=>{let o=gS(r.scope,d),s=Fb(r,o),c=e=>i(Fb(s,nx(a,o,e))),p=f&&!n.callStack?f.current:-1,m=ix({value:lx(e,f?e=>f.current===-1?c(e):Ud(f,p,()=>c(e)):c,cx(l,a,e),u),bounds:a,body:t.body,scope:o});return a.length===1?rc(m):m},m=n.callStack;return{build:(n,i)=>{if(t.isRecursive||r||i.isKeepLazy||!W(n))return p(n,i);if(!(a.length===1?is(n):typeof n==`object`&&n.kind===`ProductSet`&&n.factors.every(is))){if(m)return p(n,i);try{return c(n,i)}catch(t){if(!(t instanceof e.x))throw t;return p(n,i)}}if(!m)return c(n,i);try{return c(n,i)}catch(e){throw Jx(m,t,e),e}},createLazy:p}},yS=(e,t)=>{let n=vS(e,t).build,r=e.bounds,i=t.coverage;if(i)return t=>{let a=tx(r,t),o=n(a,t),s=r.length===1||typeof a!=`object`||a.kind!==`ProductSet`?[a]:a.factors;return(typeof o!=`object`||o.kind!==`LazyFunction`)&&s.every(is)&&i.current!==-1&&i.covered.has(e)&&nf(i,i.current,s),o};if(r.length===1&&r[0].pattern.kind===`Name`){let e=$x(r[0].set,t);return t=>n(e(t),t)}return e=>n(tx(r,e),e)},bS=(e,t)=>{let n=fS.has(e);n&&pS(e.function);let r=$x(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=>$x(e,t))}),value:$x(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):al(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Fb(i,jb(i.scope,`@`,e))):lu(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i=!1;n=o(n,r.path,0,t,e=>(i=!0,r.value(e))),i||t.environment.runtime.warn(_o.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${Q(e.function)}`)}return n}},xS=(t,n)=>{let r=$x(t.predicate,n),i=t.bound.pattern,a=yb(t.predicate),o=t.predicate.location.range&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:a},s=n.coverage,c=(n,r,l,u)=>{let d=(t,n)=>{if(i.kind===`Tuple`&&Il(t)?.length!==i.names.length)throw new e.x(`Attempted to check if the value:\n${U(q(t))}\nis an element of a set of ${i.names.length}-tuples.`);let o=l(Fb(r,Mb(r.scope,i,t)));if(typeof o!=`boolean`)throw new e.x(`${n?`The evaluation of predicate`:`Evaluating predicate`} ${a} yielded non-Boolean value.`);return o},f=e=>c(n,{...r,environment:e},$x(t.predicate,e),-1);return!s||u===-1?{kind:`FilteredSet`,base:n,test:d,source:o,rebind:f}:{kind:`FilteredSet`,base:n,test:(e,t)=>Ud(s,t?-1:u,()=>d(e,t)),startPass:e=>{let t=Jd(s,n);return r=>{t?.next(),Xd(s,n,r),s.secondary[u]++;let i=Ud(s,u,()=>d(r,!1));return e&&i&&s.secondary[u]++,i}},source:o,rebind:f}};return(e,t,n=-1)=>c(e,t,r,n)},SS=e=>A(e)||e.kind===`OperatorReference`||Ue(e).some(SS),CS=(e,t)=>e.bound.pattern.kind===`Name`&&!t.coverage&&!SS(e.predicate)&&!ph([e.predicate],t,`varying`),wS=(t,n)=>{if(typeof t!=`boolean`)throw new e.x(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${Lf(t)}.\n${yb(n.predicate)}`);return t},TS=(t,n,r,i)=>{if(!rs(t)||zs(t))throw new e.x(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${Q(n)}`);return Rc(t),Jb(t,r,i)},ES=t=>new e.x(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${Q(t)}`),DS=(t,n)=>{if(t.kind===`SetFilter`){let e=$x(t.predicate,n),r=$x(t.bound.set,n),i=xS(t,n),a=t.bound.pattern,o=n.coverage,s=CS(t,n);return n=>{let c=r(n);if(!is(c))return i(c,n,o?.current);let l=[],u=c.kind===`Interval`?c:G(c).elements,d=Array.isArray(u)?u.length:u.high-u.low+1;for(let r=0;r<d;r++){let i=Array.isArray(u)?u[r]:u.low+r,o=e(Fb(n,Mb(n.scope,a,i)));if(wS(o,t))es(l,i);else if(s)break}return o&&Wd(o,c,d+1),Qs(l)}}if(t.kind===`SetMap`){let e=$x(t.expression,n),r=n.coverage;return n=>{let i=[],a=t=>(es(i,e(Fb(n,t))),!1);return r?ex(t.bounds,n,r,a):$b(t.bounds,n,a),Uc(i)}}let r=t.set;if(!r)return()=>{throw new e.x(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${Q(t)}`)};let i=$x(t.body,n),a=$x(r,n),o=n.coverage;return n=>{let s=a(n),c=TS(s,t,r,n.environment.runtime.version),l=o&&$d(o,s,c,!0),u,d=t.pattern;if(Yb(c,r=>{if(l?.next(),d.kind===`Tuple`&&Il(r)?.length!==d.names.length)throw new e.x(`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${Q(t)}`);let a=Mb(n.scope,d,r);return Bb(i(Fb(n,a)),t)?(u=dS(d,a),!0):!1}),u!==void 0)return u;throw l?.next(),ES(t)}},OS=e=>[...e].sort((e,t)=>Ks(e.name,t.name)),kS=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),AS=(e,t)=>{let n=OS(e),r=e.map(e=>$x(e.value,t));if(kS(n))return t=>ol(e.map((e,n)=>[e.name,r[n](t)]));let i=n.map(e=>e.name),a=e.map(e=>e.name);if(a.some((e,t)=>e!==i[t])){let t=n.map(t=>e.indexOf(t));return e=>hs(i,t,r.map(t=>t(e)),a)}return e=>sl(i,r.map(t=>t(e)))},jS=(t,n)=>{let r=e=>$x(e,n);switch(t.kind){case`Number`:{let e=t.value;return ls(e)?()=>e:()=>{throw Db(t)}}case`Decimal`:return()=>{throw Eb(t)};case`String`:{let e=t.value;return()=>e}case`Identifier`:return tS(t,n);case`Apply`:return lS(t,n);case`Bracket`:return()=>{throw new e.x(`A bracket without a function or subscript is not an expression at ${gb(t)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new e.x(`An operator cannot be used as a value at ${gb(t)}`)};case`And`:{let e=t.operands.map(r);return Xx(t,e,n.callStack)??(n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw xb(t,r,i);if(!i)return!1}return!0})}case`Or`:{let e=t.operands.map(r);return Xx(t,e,n.callStack)??(n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw xb(t,r,i);if(i)return!0}return!1})}case`Prime`:{let e=r(t.expression);return t=>e(Wx(t))}case`Unchanged`:return Gx(r(t.expression));case`If`:{let e=r(t.condition),n=r(t.consequent),i=r(t.alternative);return r=>{let a=e(r);if(typeof a!=`boolean`)throw bb(t,a);return a?n(r):i(r)}}case`Case`:{let n=t.arms.map(e=>({source:e.condition,condition:r(e.condition),body:r(e.body)})),i=t.other?r(t.other):void 0;return r=>{for(let t of n){let n=t.condition(r);if(typeof n!=`boolean`)throw new e.x(`A non-boolean expression (${Lf(n)}) was used as a condition of a CASE. ${yb(t.source)}`);if(n)return t.body(r)}if(i)return i(r);throw new e.x(`Attempted to evaluate a CASE with no conditions true.\n${Q(t)}`)}}case`Let`:{let e=r(t.body);return n=>e(Fb(n,Rx(t.definitions,n)))}case`Forall`:case`Exists`:return uS(t,n);case`UnboundedQuantifier`:return()=>{let n=t.quantifier===`Forall`?`\\A`:`\\E`;throw t.isTemporal?vb(t.quantifier===`Forall`?`\\AA`:`\\EE`,t):new e.x(`TLC attempted to evaluate an unbounded ${n}.\nMake sure that the expression is of form ${n} x \\in S: P(x).\n${Q(t)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return DS(t,n);case`SetEnumeration`:{let e=t.elements.map(r);return t=>Uc(e.map(e=>e(t)))}case`Tuple`:{let e=t.elements.map(r);return t=>al(e.map(e=>e(t)))}case`FunctionConstruction`:return yS(t,n);case`FunctionSet`:{let e=r(t.domain),n=r(t.range);return t=>({kind:`FunctionSet`,domain:e(t),range:n(t)})}case`Record`:return AS(t.fields,n);case`RecordSet`:{let e=OS(t.fields),n=e.map(e=>e.name),i=e.map(e=>t.fields.indexOf(e)),a=t.fields.map(e=>r(e.value));return i.every((e,t)=>e===t)?e=>({kind:`RecordSet`,names:n,sets:a.map(t=>t(e))}):e=>{let t=a.map(t=>t(e));return{kind:`RecordSet`,names:n,sets:i.map(e=>t[e])}}}case`Except`:return bS(t,n);case`ExceptAt`:return n=>{let r=Ab(n.scope,`@`);if(r?.kind!==`Value`)throw new e.x(`@ appears outside an EXCEPT at ${gb(t)}`);return r.value};case`FunctionApplication`:{pS(t.function);let e=r(t.function),i=n=>Nb(e(Pb(n)),t),a=t.args.map(r),o=Cb(n.runtime.version);if(a.length===1){let e=a[0];return t=>ou(i(t),e(t),o)}return e=>ou(i(e),al(a.map(t=>t(e))),o)}case`FieldAccess`:{let e=r(t.record),n=Sb(t);return t=>n(e(t))}case`Product`:{let e=t.factors.map(r);return t=>({kind:`ProductSet`,factors:e.map(e=>e(t))})}case`BoxAction`:case`AngleAction`:{let n=r(t.action),i=Gx(r(t.subscript)),a=t.kind===`BoxAction`,o=a?`[A]_e`:`<A>_e`;return r=>{let s=n(r);if(typeof s!=`boolean`)throw new e.x(`Attempted to evaluate an expression of form ${o}, but A was not a boolean.\n${Q(t)}`);return a?s||i(r):s&&!i(r)}}case`Enabled`:{let e=t.expression;return t=>ab(e,t)}case`Label`:return r(t.body);case`Selection`:return r(t.expression);case`Subexpression`:return()=>{throw new e.x(`The subexpression reference at ${gb(t)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw vb(_b[t.kind],t)}}},MS=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},NS=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^bu(e[t]),16777619),r=Math.imul(r^Eu(e[t]),1540483477);t[0]=MS(n)||1,t[1]=MS(r)},PS=()=>{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)}}},FS=e=>({slots:new Int32Array(1<<17),size:0,shift:16,states:e}),IS=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=du(t,bu(e[n]));return t&1073741823},LS=(e,t)=>{for(let n=0;n<t.length;n++)if(!fc(e[n],t[n]))return!1;return!0},RS=(e,t)=>Math.imul(t,2654435761)>>>e.shift<<1,zS=(e,t,n)=>{let r=e.slots.length-1;for(let i=RS(e,t);;i=i+2&r){let r=e.slots[i+1];if(r===0)return-1;if(e.slots[i]===t&&LS(e.states[r-1],n))return r-1}},BS=(e,t,n)=>{let r=e.slots.length-1,i=RS(e,t);for(;e.slots[i+1]!==0;)i=i+2&r;e.slots[i]=t,e.slots[i+1]=n},VS=(e,t,n)=>{if(e.size++,e.size*4>e.slots.length){let t=e.slots;e.slots=new Int32Array(t.length*2),e.shift--;for(let n=0;n<t.length;n+=2)t[n+1]!==0&&BS(e,t[n],t[n+1])}BS(e,t,n+1)},HS=(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}},US=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),WS=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return HS(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},GS=e=>Atomics.load(e.used,0)*2>=e.slots.length,KS=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&HS(t,n);return{slots:t,used:e.used}},qS={kind:`Boolean`,value:!0},JS={kind:`Boolean`,value:!1},YS=e=>e?qS:JS,XS=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,ZS=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,QS=(e,t)=>({kind:e,body:t}),$S=(e,t,n)=>({kind:e,operands:[t,n]}),eC=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?eC(e,t.operands).operands:[t])}),tC=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return tC(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,tC(t)),0)}},nC=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 nC(e.body);case`And`:case`Or`:return e.operands.some(nC)}},rC=/* @__PURE__ */ new WeakMap;let iC=0;const aC=e=>{let t=rC.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`#${iC++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(aC).join(`,`)})`;default:return`${e.kind}(${aC(e.body)})`}})();return rC.set(e,n),n},oC=(e,t)=>e===t||aC(e)===aC(t),sC=(e,t)=>{let n=aC(t);return e.some(e=>e===t||aC(e)===n)},cC=e=>e===`And`?`Or`:`And`,lC=(e,t)=>{switch(e.kind){case`Boolean`:return t?YS(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?QS(`Not`,e):e;case`Not`:return lC(e.body,!t);case`And`:case`Or`:return eC(t?cC(e.kind):e.kind,e.operands.map(e=>lC(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return QS(n,lC(e.body,t))}}},uC=e=>{switch(e.kind){case`Boolean`:return YS(!e.value);case`Not`:return e.body;case`And`:case`Or`:return eC(cC(e.kind),e.operands.map(uC));case`Always`:return QS(`Eventually`,uC(e.body));case`Eventually`:return QS(`Always`,uC(e.body));default:return QS(`Not`,e)}},dC=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=dC(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return YS(t)}return n.length===0?YS(!t):n.length===1?n[0]:eC(e.kind,n)}case`Not`:{let t=dC(e.body);return t.kind===`Boolean`?YS(!t.value):QS(`Not`,t)}case`Always`:case`Eventually`:{let t=dC(e.body);return QS(e.kind,t.kind===e.kind?t.body:t)}default:return e}},fC=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,pC=t=>{switch(t.kind){case`And`:{let n=[],r=1;for(let i of t.operands){let t=pC(i);if(t.kind===`And`)n.push(...t.operands);else{if(t.kind===`Or`&&(r*=t.operands.length,r>2147483647))throw new e.x(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);n.push(t)}}if(r===1)return{kind:`And`,operands:n};let i=Array.from({length:r},()=>[]),a=1,o=r;for(let e of n){if(e.kind!==`Or`){i.forEach(t=>t.push(e));continue}o/=e.operands.length;let t=0;for(let n=0;n<a;n++)for(let n of e.operands)for(let e=0;e<o;e++)i[t++].push(n);a*=e.operands.length}return{kind:`Or`,operands:i.map(e=>eC(`And`,e))}}case`Or`:{let e=[],n=[];for(let r of t.operands){let t=pC(r);for(let r of t.kind===`Or`?t.operands:[t]){let t=fC(r);t?e.push(t):n.push(r)}}if(e.length>0){let t=e.length===1?e[0]:eC(`Or`,e);n.push(QS(`Always`,QS(`Eventually`,t)))}return eC(`Or`,n)}case`Not`:return XS(t.body)?t:pC(uC(t.body));default:return t}},mC=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?mC(e.operands[0]):eC(e.kind,e.operands.map(mC));case`Not`:return e.body.kind===`Not`?mC(e.body.body):QS(`Not`,mC(e.body));case`Always`:case`Eventually`:case`Next`:return QS(e.kind,mC(e.body));default:return e}},hC=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return hC(e.operands[0]);let t=Math.floor(e.operands.length/2);return $S(e.kind,hC(eC(e.kind,e.operands.slice(0,t))),hC(eC(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return QS(e.kind,hC(e.body));default:return e}},gC=(e,t)=>{e.kind===`Eventually`&&!sC(t,e)&&t.push(e),`body`in e&&gC(e.body,t),`operands`in e&&e.operands.forEach(e=>gC(e,t))},_C=e=>{let t=e.filter(ZS),n=e.flatMap(e=>e.kind===`Not`&&ZS(e.body)?[e.body]:[]);return!t.some(e=>sC(n,e))},vC=t=>{let n=[...t],r=[];for(;n.length>0;){let t=n.pop();if(!t)break;switch(t.kind){case`Not`:n.push(t.body);break;case`Next`:r.push(t),n.push(t.body);break;case`Always`:case`Eventually`:r.push(t,QS(`Next`,t)),n.push(t.body);break;case`And`:case`Or`:n.push(...t.operands),r.push(t);break;case`Action`:throw new e.x(`TLC encountered actions while constructing the tableau`);default:r.push(t)}}return r},yC=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:QS(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},bC=(e,t,n)=>e.flatMap(e=>{let r=yC(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),xC=e=>[...new Set(e.map(aC))].sort().join(`|`),SC=(e,t)=>{let n=new Set(t.map(xC));return[...e.filter(e=>!n.has(xC(e))),...t]},CC=e=>{let t=vC(e),n=bC(t,`Always`,`And`),r=bC(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=yC(t,`Eventually`,`Or`);if(n&&!(sC(e,n.first)||sC(e,n.second)))return SC(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(sC(e,t.first)||sC(e,t.second))&&!sC(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!_C(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=yC(t[e],`Always`,`And`);n&&(sC(t,n.first)||t.push(n.first),sC(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)sC(t,e.first)&&sC(t,e.second)&&!sC(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!_C(t)?[]:i(t)};return a(e)},wC=e=>({particle:e,successors:[],statePredicates:e.filter(e=>tC(e)<=1)}),TC=e=>{let t=CC([e]).map(wC),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=xC(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 CC(n)){let n=xC(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(wC(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},EC=(e,t)=>!sC(e,t)||sC(e,t.body),DC=(t,n)=>{if(t.kind===`Eventually`&&t.body.kind===`Always`&&tC(t.body.body)<3){n.eventuallyAlways.push(t.body.body);return}let r=fC(t);if(r){let e=tC(r);if(e<=1){n.infinitelyOftenStates.push(r);return}if(e===2){n.infinitelyOftenActions.push(r);return}}if(nC(t))throw new e.x(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);n.formulas.push(t)},OC=(e,t)=>{let n=e.findIndex(e=>oC(e,t));return n===-1?(e.push(t),e.length-1):n},kC=e=>{let t=pC(dC(lC(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=mC(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])DC(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:eC(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:oC(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&hC(e.formula),n=[];t&&gC(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>OC(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>OC(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>OC(i,e))}));return{tableau:t&&TC(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},AC=()=>e.at(new e.x(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.nt.livenessEvaluationFailure),jC=/* @__PURE__ */ new Set([`~>`,`-+->`]),MC=/* @__PURE__ */ new WeakSet,NC=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),PC=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),FC=(t,n)=>new e.x(`TLC cannot handle the temporal formula ${Q(t)}${n===void 0?``:`:\n${n}`}`),IC=(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=IC(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=Ab(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=Vb(e,n);if(t)return gh(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:A(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return np(e,(e,o)=>(a=Math.max(a,IC(e,t,n,o.length===0?r:/* @__PURE__ */ new Set([...r,...o]),i)),e)),a};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:l(e);case`Identifier`:return c(e.name,e);case`OperatorReference`:return c(e.operator,e);case`Apply`:{if(jC.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=A(e)?void 0:xx(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,Px(o,e.args,PC(n,t)))}default:return l(e)}},LC=(t,n)=>{try{return Zb(t,n)}catch(t){if(!(t instanceof e.x))throw t;if(!Oo(t))return;throw e.at(new e.x(`${e.G}${t.message}`),e.nt.error)}},RC=(t,n,r,i,a={name:void 0,path:[],expanding:/* @__PURE__ */ new Set,isSubstituted:!1})=>{let o=(e,t,n=a.name,o=a.expanding,s)=>RC(e,t,r,i,{name:n,path:s?.kind===`Operator`&&s.params.length===0?[...a.path,s.name]:a.path,expanding:o,isSubstituted:a.isSubstituted||s!==void 0&&r.substitutedDefinitions.has(s)});if(t.kind===`And`)return t.operands.flatMap(e=>o(e,n,Q(e)));if(t.kind===`Label`)return o(t.body,n);if(t.kind===`Selection`)return o(t.expression,n);if(t.kind===`Let`)return o(t.body,zC(t,n,r));if(t.kind===`Identifier`){let i=A(t)?Ab(n,t.name):void 0;if(i?.kind===`Thunk`&&!i.isReleased)return o(i.expression,i.scope,MC.has(i)?t.name:a.name);let s=r.constants.has(t.name)?void 0:Vb(t.name,r);if(!i&&s?.kind===`Operator`&&s.params.length===0&&(gh(s,r)>0||gx(s,r)===void 0)){if(a.expanding.has(s))throw e.Y();return o(s.body,void 0,!a.isSubstituted&&r.instanceNames.get(t.name)||s.name,/* @__PURE__ */ new Set([...a.expanding,s]),s)}}let s=PC(r,n);if(t.kind===`Apply`&&r.runtime.version!==`1.7.4`&&(i||IC(t,n,r)===3)){let e=Sx(t,s),n=A(t)?void 0:Vb(t.operator,r),i=e?.kind===`Closure`&&e.params.every(e=>r.instanceParams.has(e));if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive&&(!a.isSubstituted||i))return o(e.body,Px(e,t.args,s),a.isSubstituted&&n?n.name:t.operator,a.expanding,n)}let c=i&&t.kind===`Forall`&&t.bounds.every(e=>IC(e.set,n,r)===0),l=c?LC(t.bounds,s):void 0;if(c&&l){let e=[];if(Qb(t.bounds,l,n,n=>(e.push(...o(t.body,n,Q(t.body))),!1)),e.length===0)throw AC();return e}return[{expression:t,scope:n,name:a.name,path:a.path}]},zC=(e,t,n)=>{let r=Rx(e.definitions,PC(n,t),Bx(e.definitions,n));for(let n=r;n&&n!==t;n=n.parent){n.binding.kind===`Thunk`&&MC.add(n.binding);let t=n.name,r=e.definitions.find(e=>e.name===t);r&&bd.set(n,r)}return r},BC=(t,n,r)=>{let i=r.runtime.version===`1.7.4`,a=(t,n,a)=>{let o=a===0&&!i?IC(t,n,r):a;if(o===0){let i=$(t,PC(r,n));if(typeof i!=`boolean`)throw new e.x(`TLC expected a boolean value, but did not find one. ${yb(t)}`);return YS(i)}return o===1?{kind:`State`,expression:t,scope:n}:t.kind===`AngleAction`?{kind:`Action`,expression:t.action,subscript:t.subscript,scope:n}:{kind:`Action`,expression:t,subscript:void 0,scope:n}},o=0,s=(t,n,i,s)=>{if(o>=100)throw e.Y();o++;let c=p(t,n);o--;let l=tC(c),u=l===0&&IC(i,s,r)>2;return l>2||u?c:a(i,s,l)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,a=PC(r,t),o=A(e)||Vb(n,r)===void 0?Ab(t,n):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&MC.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:A(e)?Cx(n,a):xx(n,r),u=e.kind===`Apply`?e.args:[],f=c?.kind===`Builtin`&&u.length===2?NC.get(c.name):void 0;if(f){let n=u.map(e=>p(e,t));return d(e,t,eC(f,n))}if(c?.kind!==`Closure`)throw FC(e);let m=!A(e)&&Vb(n,r)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>$(e,a)),s(c.body,Px(c,u,a),e,t)),m)},l=(t,n,r=!1)=>{try{return n()}catch(n){let a=n instanceof e.F||r&&!i;throw!(n instanceof e.x)||a?n:FC(t)}},u=(t,n)=>{let i=IC(t,n,r),o=[],s=t.kind===`Forall`;try{$b(t.bounds,PC(r,n),e=>(o.push(p(t.body,e)),!1))}catch(r){if(!(r instanceof e.x)||r instanceof e.F)throw r;if(i<=2)return a(t,n,i);throw FC(t,s&&!Oo(r)?r.message:void 0)}return o.length===0?YS(s):d(t,n,eC(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=tC(n);return r>2?n:a(e,t,r)},f=(e,t)=>{let n=e.operands,r=e.location.range,i=e.prefixEnds;return e.isBulleted||!r||!i?d(e,t,eC(e.kind,n.map(e=>p(e,t)))):n.slice(1).reduce((a,o,s)=>{let c=s===n.length-2?e:{...e,operands:n.slice(0,s+2),prefixEnds:i.slice(0,s+1),location:{...e.location,range:{...r,end:i[s]}}};return d(c,t,eC(e.kind,[a,p(o,t)]))},p(n[0],t))},p=(e,t)=>{let n=IC(e,t,r);switch(e.kind){case`Label`:return p(e.body,t);case`Selection`:return p(e.expression,t);case`Let`:return p(e.body,zC(e,t,r));case`Apply`:{let n=e.args;if(e.operator===`~`&&!A(e))return d(e,t,QS(`Not`,p(n[0],t)));if(e.operator===`=>`)return d(e,t,$S(`Or`,QS(`Not`,p(n[0],t)),p(n[1],t)));break}case`And`:case`Or`:return f(e,t);case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&IC(e.condition,t,r)===0){let n=$(e.condition,PC(r,t));if(typeof n==`boolean`)return p(n?e.consequent:e.alternative,t)}let n=p(e.condition,t);return d(e,t,$S(`Or`,$S(`And`,n,p(e.consequent,t)),$S(`And`,QS(`Not`,n),p(e.alternative,t))))}}if(n<=2)return a(e,t,n);switch(e.kind){case`Identifier`:return c(e,t);case`Apply`:return e.operator===`~>`?QS(`Always`,$S(`Or`,QS(`Not`,p(e.args[0],t)),QS(`Eventually`,p(e.args[1],t)))):c(e,t);case`Always`:case`Eventually`:return QS(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=QS(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?QS(`Always`,QS(`Eventually`,$S(`Or`,i,a))):$S(`Or`,QS(`Eventually`,QS(`Always`,i)),QS(`Always`,QS(`Eventually`,a)))}default:throw FC(e)}};return p(t,n)},VC=t=>({holdsState:(n,r)=>{let i={environment:t,scope:n.scope,state:r,next:void 0},a=n.kind===`State`?$(n.expression,i):ab(n.step,i);if(typeof a!=`boolean`)throw new e.x(`A state predicate was evaluated to a non-boolean value.`);return a},holdsAction:(n,r,i)=>{let a=n.scope,o=n.subscript;if(o&&zc($(o,{environment:t,scope:a,state:r,next:void 0}),$(o,{environment:t,scope:a,state:i,next:void 0})))return!1;let s=$(n.expression,{environment:t,scope:a,state:r,next:i});if(typeof s!=`boolean`)throw new e.x(`Encountered an action predicate that's not a boolean.`);return s}}),HC=(t,n,r,i,a)=>{let o=e=>HC(e,n,r,i,a);switch(t.kind){case`Boolean`:return t.value;case`State`:case`Enabled`:{let e=a.get(t);if(e!==void 0)return e;let r=i.holdsState(t,n);return a.set(t,r),r}case`Action`:return t.enabled&&a.get(t.enabled)===!1?!1:r!==void 0&&i.holdsAction(t,n,r);case`Not`:return!o(t.body);case`And`:return t.operands.every(o);case`Or`:return t.operands.some(o);case`Next`:return HC(t.body,r??n,void 0,i,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new e.x(`TLC cannot evaluate a temporal formula in a single step`)}},UC=(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)=>UC(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 HC(e,t[r],t[a(r)],VC(i),/* @__PURE__ */ new Map)}},WC=`UnnamedAction`,GC={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},KC=e=>{let t=e.range??GC;return ol([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},qC=(e,t)=>{let n=[[`name`,e.name],[`location`,KC(e.location)]];return e.parameters.length>0&&n.push([`context`,ol(e.parameters)],[`parameters`,al(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),ol(n)},JC=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),YC=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),XC=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,ZC=e=>e.kind===`Apply`?e.args:[],QC=(e,t,n)=>{let r=XC(e);if(r===void 0)return;if(A(e)){let e=Ab(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=xx(r,n);return i?.kind===`Closure`?i:void 0},$C=(t,n)=>{try{return $(t,YC(n,void 0)),!0}catch(t){if(t instanceof e.b)return!1;throw t}},ew=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&dh(e,t)&&$C(e.body,t),tw=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&ew(e,t),nw=(e,t)=>{let n=Vb(e.name,t);return n?.body===e.body&&tw(n,t)},rw=(e,t)=>{if(e.kind!==`Identifier`||!A(e))return;let n=Ab(t,e.name);return n?.kind===`Thunk`?n:void 0},iw=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:zC(e,t,n)};let r=rw(e,t);return r&&{expression:r.expression,scope:r.scope}},aw=(e,t,n,r)=>t.kind===`Apply`?Px(e,t.args,YC(r,n)):e.scope,ow=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Ab(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),sw=(t,n)=>{try{return t()}catch(t){if(t instanceof e.b)return n();throw t}},cw=(e,t,n,r,i)=>{let a=ZC(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=>IC(e,n,i)!==0)?o():sw(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),$(e,YC(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},lw=(t,n,r,i,a)=>{let o=()=>({name:r?.name??WC,location:t.location,parameters:ow(r,n),expression:t,scope:n});if(qv.has(t.kind))throw e.at(new e.x(`${e.K}The next state relation is not a boolean expression.\n${yb(t)}`),e.nt.error);switch(t.kind){case`Let`:return lw(t.body,zC(t,n,i),r,i,a);case`Label`:return lw(t.body,n,r,i,a);case`Selection`:return t.location.range===void 0?lw(t.expression,n,r,i,a):[o()];case`Or`:return t.operands.flatMap(e=>lw(e,n,r,i,a));case`Exists`:return sw(()=>{let e=[];return $b(t.bounds,YC(i,n),n=>(e.push(...lw(t.body,n,r,i,a)),!1)),e.length===0?[o()]:e},()=>[o()])}let s=A(t)?void 0:a.get(XC(t)??``),c=QC(t,n,i);if(s)return cw(s,t,n,c,i);if(!c)return[o()];let l=ZC(t),u=A(t)?c.name===`$subexpression`?`LAMBDA`:c.name:i.instanceNames.get(XC(t)??``)??c.name,d=()=>[{name:u,location:t.location,parameters:[],expression:t,scope:n}];return nw(c,i)||l.some(e=>IC(e,n,i)!==0)?d():sw(()=>{let e=l.reduce((e,t,r)=>({name:c.params[r].name,binding:{kind:`Value`,value:$(t,YC(i,n))},parent:e}),c.scope);return lw(c.body,e,{...c,name:u},i,a)},d)},uw=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>uw(e,t,n,r,i,o),s=(e,t,n)=>JC(e,Yf(t,a),n),c=iw(e,t,n);if(c){o(c.expression,c.scope);return}let l=QC(e,t,n);if(l&&nw(l,n))return;let u=l?[...a,...Jf.get(l.body)??[]]:a;if(l&&l.params.length===0){if(IC(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,Px(l,e.args,YC(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(WC,e,t));return}let d=IC(e,t,n);d<=1?r.inits.push(s(WC,e,t)):d===3&&r.temporals.push(s(WC,e,t))},dw=(e,t,n,r,i)=>{let a=(t,n)=>dw(e,t,n,r,i),o=iw(t,n,r);if(o){a(o.expression,o.scope);return}let s=QC(t,n,r);if(s&&nw(s,r))return;if(s&&s.params.length===ZC(t).length){a(s.body,aw(s,t,n,r));return}if(t.kind===`Forall`&&sw(()=>($b(t.bounds,YC(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(JC(e,a)):IC(a,n,r)<2?i.invariants.push(JC(e,a)):i.impliedTemporals.push(JC(e,t));return}let c=IC(t,n,r);c<=1?i.impliedInits.push(JC(e,t)):c===3&&i.impliedTemporals.push(JC(e,t))},fw=(e,t)=>{let n=Vb(e,t);return n?.kind===`Operator`&&!tw(n,t)?n:void 0},pw=(e,t,n)=>{let r={inits:[],actions:[],temporals:[]},i=[],a=e.specification===void 0?void 0:fw(e.specification,t);a&&(uw(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:WC,location:e.frames[0].location,parameters:[],expression:Yf(e.expression,e.frames),scope:e.scope}]:lw(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:xx(e.init,t);o?.kind===`Closure`&&r.inits.push(JC(e.init??``,o.body));let s=e.next===void 0?void 0:xx(e.next,t);return s?.kind===`Closure`&&r.actions.push(...lw(s.body,s.scope,s,t,n)),r},mw=(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===`Selection`)return i(e.expression,t);let a=iw(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&A(e)?Ab(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!A(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=QC(e,t,n);if(!s||s.params.length!==ZC(e).length)return!0;let c=Vb(s.name,n);return c?.body===s.body&&ew(c,n)?!0:i(s.body,aw(s,e,t,n))};return i(e,t)?r:void 0},hw=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>q(e[1])).join(`,`)})`,gw=(t,n,r=!1)=>`${t.name===WC?r?`Initial predicate`:`Action`:t.name}${n===`1.7.4`?``:hw(t)} ${e.X(t.location.range??GC)}`,_w=e=>`${e.name}${hw(e)}`,vw=(e,t,n,r)=>{let i={invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]};t.invariants.forEach(e=>{let t=fw(e,n);t&&i.invariants.push(JC(e,t.body))}),t.properties.forEach(e=>{let t=fw(e,n);t&&dw(e,t.body,void 0,n,i)});let a=n.coverage,o=(e,t)=>Hc(e.map(e=>{let n=a&&t&&vf(a,t,e.expression);return qC(e,n&&ol(n))})),s=e=>Hc(e.flatMap(e=>{let t=fw(e,n);return t?[ol([[`name`,t.name],[`location`,KC(t.location)]])]:[]}));return ol([[`inits`,o(e.inits,`init`)],[`actions`,o(e.actions,`next`)],[`temporals`,o(e.temporals)],[`invariants`,o(i.invariants,`invariant`)],[`impliedinits`,o(i.impliedInits,`implied`)],[`impliedactions`,o(i.impliedActions,`implied`)],[`impliedtemporals`,o(i.impliedTemporals)],[`variables`,Hc(n.variables.map((e,t)=>ol([[`name`,e],[`location`,KC(r[t])],...a?[[`coverage`,ol([[`distinct`,of(a,t)]])]]:[]])))],[`actionconstraints`,s(t.actionConstraints)],[`constraints`,s(t.constraints)]])},yw=2**50,bw=2**51,xw=(e,t,n,r)=>({fingerprint:e,tableau:t,position:n,stateChecks:r,successors:[],actionChecks:[],stepPositions:[],number:0}),Sw=(e,t,n,r)=>{e.successors.push(t),e.actionChecks.push(n),e.stepPositions.push(r)},Cw=(e,t)=>e.stepPositions[e.successors.indexOf(t)],ww=e=>{let t=e[e.length-1];return--e.length,t},Tw=(e,t,n,r)=>{let i={initial:[],isPartial:!1},a=t.tableau;if(!a){let t=/* @__PURE__ */ new Map,r=xw(e[0],-1,0,n.getStates(0));Sw(r,r,n.getStutters(0),0),t.set(e[0],r),i.initial.push(r);for(let i=1;i<e.length;i++){let a=t.get(e[i]);if(a===void 0){let a=xw(e[i],-1,i,n.getStates(i));Sw(a,a,n.getStutters(i),i),Sw(r,a,n.getSteps(i),i),t.set(e[i],a),r=a}else r.successors.includes(a)||Sw(r,a,n.getSteps(i),i),r=a}return i}let o=/* @__PURE__ */ new Map,s=e=>{let t=o.get(e)??[];return o.set(e,t),t},c=(t,o,s,c,l,u)=>{for(let d=0;d<t.length;d++){let f=t[d],p=a.nodes[f.tableau].successors;for(let t=0;t<p.length;t++){let a=p[t],d=s[a];if(d===void 0){if(!n.isConsistent(a,c))continue;let t=xw(e[c],a,c,l);Sw(f,t,u,c),o.push(t),s[a]=t}else f.successors.includes(d)||Sw(f,d,u,c),d.position!==c&&(i.isPartial=!0,r&&!o.includes(d)&&o.push(d))}}},l=s(e[0]),u=n.getStates(0),d=n.getStutters(0);for(let t=0;t<a.initialCount;t++){if(!n.isConsistent(t,0))continue;let r=xw(e[0],t,0,u);i.initial.push(r),l[t]=r}for(let e of i.initial)for(let t of a.nodes[e.tableau].successors){let n=l[t];n?Sw(e,n,d,0):i.isPartial=!0}let f=[...i.initial];r&&c(f,f,l,0,u,d);for(let t=1;t<e.length;t++){let r=s(e[t]),i=n.getStates(t),a=[];c(f,a,r,t,i,n.getSteps(t)),c(a,a,r,t,i,n.getStutters(t)),f=a}return i},Ew=(e,t,n)=>{let r=t.promises,i=t.tableau?.nodes??[],a=[],o=1,s=yw+1,c=bw+1,l=s,u=c,d=s,f=c,p=t.models[0],m,h=(e,t)=>{let n=e.actionChecks[t],r=p.eventuallyAlways;for(let e=0;e<r.length;e++)if(!n[r[e]])return!1;return!0},g=t=>{let n=[],a=c-1,o=p.infinitelyOftenStates,s=p.infinitelyOftenActions,l=o.map(()=>!1),u=s.map(()=>!1),d=r.map(()=>!1),f=o.length+s.length+r.length,m=t;for(;f>0;){m.number=c;let e=f;search:for(;;){for(let e=0;e<o.length;e++)!l[e]&&m.stateChecks[o[e]]&&(l[e]=!0,f--);for(let e=0;e<r.length;e++)!d[e]&&EC(i[m.tableau].particle,r[e])&&(d[e]=!0,f--);if(f<=0)break;let t,p,h=f;for(let e=0;e<m.successors.length;e++){let r=m.successors[e],i=r.number;if(a<=i&&i<=c){t=r;for(let t=0;t<s.length;t++)!u[t]&&m.actionChecks[e][s[t]]&&(u[t]=!0,f--)}if(f<h){n.push(m),m=r,c++;break search}a<=i&&i<c&&(p=r)}if(f<e&&t){n.push(m),m=t,c++;break}for(;p===void 0;){m=ww(n);for(let e=0;e<m.successors.length;e++){let t=m.successors[e];if(a<=t.number&&t.number<c){n.push(m),p=t;break}}}n.push(m),m=p,m.number=c}}c++,m.number=c;close:for(;m!==t;){let e=!1;for(let r=0;r<m.successors.length;r++){let i=m.successors[r];if(a<=i.number&&i.number<c){if(n.push(m),i===t)break close;e=!0,m=i,m.number=c;break}}e||(m=ww(n))}n.length===0&&n.push(m);let h=[];for(let n=0;n<=t.position;n++)(n===0||e[n]!==e[n-1])&&h.push(n);let g=h.length;for(let e=1;e<n.length;e++)n[e].fingerprint!==n[e-1].fingerprint&&h.push(Cw(n[e-1],n[e]));let _=n[n.length-1];return{positions:h,cyclePosition:g,backPosition:_.fingerprint===t.fingerprint?void 0:Cw(_,t)}},_=e=>{let t=p.infinitelyOftenStates,n=p.infinitelyOftenActions,a=t.map(()=>!1),o=n.map(()=>!1),s=r.map(()=>!1),l=[e];for(e.number++;l.length>0;){let e=ww(l);for(let n=0;n<t.length;n++)a[n]||(a[n]=e.stateChecks[t[n]]);for(let t=0;t<e.successors.length;t++){let r=e.successors[t],i=r.number;if(i>=c)for(let r=0;r<n.length;r++)o[r]||(o[r]=e.actionChecks[t][n[r]]);i===c&&(r.number++,l.push(r))}for(let t=0;t<r.length;t++)EC(i[e.tableau].particle,r[t])&&(s[t]=!0)}c+=2,m!==void 0||a.includes(!1)||o.includes(!1)||s.includes(!1)||(m=g(e))},v=e=>{let t=e.successors.indexOf(e);return t!==-1&&d<=e.number&&h(e,t)},ee=e=>{let t=ww(a);if(t===e&&!v(e))return e.number=c++,!1;for(t.number=c;t!==e;)t=ww(a),t.number=c;return!0},y=e=>{let t=s++;e.number=t,a.push(e);for(let n=0;n<e.successors.length;n++){let r=e.successors[n],i=r.number;d<=i&&h(e,n)&&((i<l||f<=i&&i<u)&&(i=y(r)),i<t&&(t=i))}return t===e.number&&ee(e)&&_(e),t},b=e=>{let t=ww(a);if(t===e&&!e.successors.includes(e)){e.number=yw;return}let n=[];for(d=s++,f=c,t.number=d,n.push(t);t!==e;)t=ww(a),t.number=d,n.push(t);return n},x=e=>{let n=b(e);if(n)for(let e of t.models){p=e,l=s,u=c;for(let e=n.length-1;e>=0;e--)n[e].number<u&&y(n[e])}},te=e=>{let t=o++;e.number=t,a.push(e);for(let n=0;n<e.successors.length;n++){let r=e.successors[n],i=r.number===0?te(r):r.number;i<t&&(t=i)}return t===e.number&&x(e),t};for(let e of n)if(e.number===0&&te(e),m)return m},Dw=(e,t,n,r,i)=>{let a=/* @__PURE__ */ new Map,o=(t,n,i)=>(a.clear(),HC(t,e[n],i===void 0?void 0:e[i],r,a)),s=e.map((e,t)=>t),c=e.map((e,t)=>t);if(i){let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map;for(let i=0;i<e.length;i++){let a=n.get(t[i])??i;if(n.set(t[i],a),LS(e[a],e[i])&&(s[i]=a),i===0)continue;let o=s[i-1]*e.length+s[i];c[i]=r.get(o)??i,r.set(o,c[i])}}let l=n.map(e=>{let t=[],n=[],r=[],a=[],l=e.tableau?.nodes.map(e=>e.statePredicates)??[];return{getStates:n=>{let r=s[n];return t[r]??=e.stateChecks.map(e=>o(e,r,void 0))},getSteps:t=>{let r=c[t];return n[r]??=e.actionChecks.map(e=>o(e,r-1,r))},getStutters:t=>{let n=s[t];return r[n]??=e.actionChecks.map(e=>o(e,n,n))},isConsistent:(e,t)=>{let n=s[t],r=a[n]??=[],c=i?r[e]:void 0;return c===void 0?(r[e]=l[e].every(e=>o(e,n,void 0)),r[e]):c}}}),u=[];for(let e=0;e<n.length;e++){let r=Tw(t,n[e],l[e],!1),i=Ew(t,n[e],r.initial);if(i)return i;r.isPartial&&u.push(e)}for(let e of u){let r=Tw(t,n[e],l[e],!0),i=Ew(t,n[e],r.initial);if(i)return i}},Ow=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return Ow(e.body);case`And`:case`Or`:return e.operands.some(Ow);default:return!1}},kw=e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0,Aw=e=>e.promises.some(e=>Ow(e.body))||e.models.some(e=>!kw(e)),jw=(e,t)=>e.every((e,n)=>fc(e,t[n])),Mw=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Nw=e=>({data:e(1024),length:0,create:e}),Pw=(e,t,n,r=0,i=n.length-r)=>{let a=t+i;if(a>e.data.length){let t=e.create(Math.max(2*e.data.length,a));t.set(e.data),e.data=t}for(let a=0;a<i;a++)e.data[t+a]=n[r+a];e.length=Math.max(e.length,a)},Fw=(e,t,n)=>{let r=e.slots.length/3-1,i=Math.imul(Math.imul(t,2654435761)^n,2246822507)>>>e.shift;for(let a=i;;a=a+1&r){let r=a*3,i=e.slots[r];if(i===0||i===t+1&&e.slots[r+1]===n)return r}},Iw=e=>new Int32Array(e).fill(-1),Lw=(e,t)=>(e.edgeStarts[t]??-1)!==-1,Rw=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},zw=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,Bw=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.edgeStarts.push(-1),e.edgeCounts.push(0),e.nextSiblings.push(-1),e.nodeStates.length-1),Vw=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},Hw=2**53-1,Uw=(e,t,n)=>{let r=t.map(e=>BC(e.expression,e.scope,n)),i=e.map(e=>BC(e.expression,e.scope,n)),a=i.map(e=>QS(`Not`,e)),o=a.length===1?a[0]:eC(`Or`,a);return{formula:r.length===0?o:eC(`And`,[...r,o]),checks:i}},Ww=e=>{switch(e.kind){case`State`:return[e];case`Enabled`:return[{expression:e.step,scope:e.scope}];case`Action`:return[e.expression,e.subscript].flatMap(t=>t?[{expression:t,scope:e.scope}]:[])}},Gw=(e,t)=>{switch(e.kind){case`Boolean`:return;case`State`:case`Enabled`:case`Action`:t.add(e);return;case`And`:case`Or`:e.operands.forEach(e=>Gw(e,t));return;default:Gw(e.body,t)}},Kw=e=>{let t=/* @__PURE__ */ new Set;for(let n of e)[...n.stateChecks,...n.actionChecks,...n.tableau?.nodes.flatMap(e=>e.statePredicates)??[]].forEach(e=>Gw(e,t));return[...t]},qw=e=>Kw(e).flatMap(e=>Ww(e).map(e=>e.expression)),Jw=(e,t)=>{let n=/* @__PURE__ */ new Set;Gw(e,n);let r=[...n].flatMap(Ww);return r.every(e=>e.scope===void 0)?!ph(r.map(e=>e.expression),t,`repeated`):!Hx(t)},Yw=(t,n,r,i,a,o)=>[...new Set(t.filter((t,s)=>{try{return!UC(n[s],r,i,0,a)}catch(t){if(!o||!(t instanceof e.x))throw t;return o.push(t),!1}}).map(e=>e.name))],Xw=(e,t,n)=>{if(e.length===0)return;let r=Uw(e,t,n),i=kC(r.formula),a=VC(n),o=Jw(r.formula,n);return{solutions:i,findTraceViolation:(t,s)=>{let c=Dw(t,s,i,a,o);if(!c)return;let l=[],u=Yw(e,r.checks,c.positions.map(e=>t[e]),c.cyclePosition-1,n,l);return{...c,properties:u,failures:l}}}},Zw=(e,t,n,r)=>{if(e.length===0)return;let i=Uw(e,t,n),a=Jw(i.formula,n),o=kC(i.formula),s={atoms:VC(n),replay:void 0},c=Qw(o,{atoms:{holdsState:(e,t)=>s.atoms.holdsState(e,t),holdsAction:(e,t,n)=>s.atoms.holdsAction(e,t,n)},isShared:a,isSame:jw,evaluateFrom:(e,t)=>{n.runtime.setLivenessSource(e);try{return t()}finally{n.runtime.setLivenessSource(void 0)}}},{getFingerprint:r.getFingerprint,forEachActionSuccessors:(e,t,n)=>r.forEachActionSuccessors(e,t,n,s.replay)},n.runtime.version!==`1.7.4`),l=(e,t)=>{if(e===void 0)return t();s.atoms=VC(e),s.replay=e;try{return t()}finally{s.atoms=VC(n),s.replay=void 0}};return{branches:c.branches,solutions:o,addInitialState:(e,t,n)=>l(n,()=>c.addInitialState(e,t)),addState:(e,t,n,r)=>l(r,()=>c.addState(e,t,n,r!==void 0)),storeState:c.storeState,getStateCounts:c.getStateCounts,findViolation:c.findViolation,getViolatedProperties:(t,r)=>Yw(e,i.checks,t,r,n)}},Qw=(t,n,r,i)=>{let a=/* @__PURE__ */ new Map,o=1,s=n.isShared,c=n.atoms,l=n.evaluateFrom,u=/* @__PURE__ */ new Map,d=[],f=e=>{let t=u.get(e)??u.size;return u.set(e,t),d[t]=e,t},p=e=>{if(e.kind===`State`||e.kind===`Enabled`)return[f(e)*2+1];if(e.kind===`Not`){let t=e.body;return t.kind===`State`||t.kind===`Enabled`?[f(t)*2]:void 0}if(e.kind!==`And`)return;let t=e.operands.map(p);return t.every(e=>e!==void 0)?t.flat():void 0},m=e=>new Int8Array(e*u.size).fill(-1),h=e=>new Int8Array(e*a.size).fill(-1),g=(e,t,n,r,i)=>s?e(t,n,r,i):e(t,m(1),0,i),_=t=>{switch(t.kind){case`Boolean`:{let e=t.value;return()=>e}case`State`:case`Enabled`:{let e=f(t);return(n,r,i)=>(r[i+e]===-1&&(r[i+e]=+!!c.holdsState(t,n)),r[i+e]===1)}case`Action`:{let e=t.enabled&&f(t.enabled);return(n,r,i,a)=>(e===void 0||r[i+e]!==0)&&a!==void 0&&c.holdsAction(t,n,a)}case`Not`:{let e=_(t.body);return(t,n,r,i)=>!e(t,n,r,i)}case`And`:{let e=t.operands.map(_);return(t,n,r,i)=>e.every(e=>e(t,n,r,i))}case`Or`:{let e=t.operands.map(_);return(t,n,r,i)=>e.some(e=>e(t,n,r,i))}case`Next`:{let e=_(t.body);return(t,n,r,i)=>e(i??t,m(1),0,void 0)}case`Always`:case`Eventually`:return()=>{throw new e.x(`TLC cannot evaluate a temporal formula in a single step`)}}},v=t.map(e=>({solution:e,checks:{states:e.stateChecks.map(_),actions:e.actionChecks.map(_),nodes:e.tableau?.nodes.map(e=>{let t=s?p({kind:`And`,operands:e.statePredicates}):void 0;return t?Int32Array.from(t):e.statePredicates.map(_)})??[]},actionIds:Int32Array.from(e.actionChecks,e=>{let t=aC(e),n=a.get(t)??a.size;return a.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:Nw(e=>new Int32Array(e)),edgeActions:Nw(e=>new Uint8Array(e)),stateResults:Nw(e=>new Uint8Array(e)),initial:[],firstNodes:Nw(Iw),lastNodes:Nw(Iw),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],stateCount:0,errorNode:void 0})),ee=(e,t,n,r,i)=>l(t,()=>{let t=e.checks.states,a=new Uint8Array(t.length);return t.forEach((e,t)=>{a[t]=+!!g(e,n,r,i)}),a}),y=(e,t,n,r,i,a,o,c,u,d)=>l(t,()=>{let t=e.checks.actions;for(let l=0;l<t.length;l++){if(!s){u[d+l]=+!!g(t[l],n,r,i,a);continue}let f=c+e.actionIds[l];o[f]===-1&&(o[f]=+!!t[l](n,r,i,a)),u[d+l]=o[f]}}),b=(e,t,n,r,i)=>{let a=e.checks.nodes[t];if(!(a instanceof Int32Array))return a.every(e=>g(e,n,r,i));for(let e=0;e<a.length;e++){let t=a[e],o=i+(t>>1);if(r[o]===-1&&(r[o]=+!!c.holdsState(d[t>>1],n)),r[o]!==(t&1))return!1}return!0},x=(e,t,n,r,i,a)=>l(n,()=>b(e,t,r,i,a)),te=(e,t)=>{if(!i)return!1;let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},S=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=Fw(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},ne=(e,t,n,r)=>{let i=e.nodeIds;if(++i.size*2>i.slots.length/3){let e=i.slots;i.slots=new Int32Array(e.length*2),i.shift--;for(let t=0;t<e.length;t+=3)e[t]!==0&&i.slots.set(e.subarray(t,t+3),Fw(i,e[t]-1,e[t+1]))}if(i.slots.set([t+1,n,r],Fw(i,t,n)),t<0)return r;let a=e.lastNodes.data[t]??-1;return a===-1?Pw(e.firstNodes,t,[r]):e.nextSiblings[a]=r,Pw(e.lastNodes,t,[r]),r},re=(e,t)=>t<0?e.checks.nodes.some((n,r)=>S(e,t,r)!==void 0):e.isDone[t]===!0||(e.firstNodes.data[t]??-1)!==-1,ie=(e,t,n)=>(re(e,t)||e.stateCount++,ne(e,t,n,Bw(e,t,n))),ae=(e,t,n,r,i,a)=>{let o=e.edgeTargets.length,s=e.solution.actionChecks.length;Pw(e.edgeTargets,o,n),i.forEach((t,n)=>Pw(e.edgeActions,(o+n)*s,r,t*s,s)),Pw(e.stateResults,e.nodeStates[t]*a.length,a),e.edgeStarts[t]=o,e.edgeCounts[t]=n.length},C={slots:/* @__PURE__ */ new Int32Array},oe=(e,t,i)=>{let a=[...i,{index:e,state:t}],s=16*o;C.slots=C.slots.length===s?C.slots.fill(0):new Int32Array(s);let c=e=>{let t=C.slots,i=a[e];for(let o=(r.getFingerprint(i)&2147483647)%t.length;;o=(o+1)%t.length){let r=t[o];if(r===0)return t[o]=e+1,!0;let s=a[r-1];if(s.index===i.index&&n.isSame(s.state,i.state))return!1}},l=0;for(let e=0;e<a.length;e++){if(l>=C.slots.length>>1){let e=C.slots;C.slots=new Int32Array(2*e.length+1);for(let t of e)t!==0&&c(t-1)}c(e)&&l++}C.slots.length>s&&o++;let u=[];for(let e of C.slots)e!==0&&u.push(a[e-1]);return u},w=(e,t,n,i,o,s,c)=>{let l=ee(e,i,n,s,c),u=t.nodes[e.nodeTableaux[o]],d=e.checks.actions.length,f=[],p=[],g=new Uint8Array(d);u.successors.length>0&&y(e,i,n,s,c,n,h(1),0,g,0);for(let r of u.successors){if(!x(e,r,i,n,s,c))continue;if(te(t,r)&&e.errorNode===void 0&&e.solution.models.some(kw)){e.errorNode=o;return}let a=S(e,i,r);if(a!==void 0&&p.includes(a))continue;let l=a??ie(e,i,r);p.push(l),f.push(0),a===void 0&&w(e,t,n,i,l,s,c)}let _=[g],v=1;if(r.forEachActionSuccessors(i,n,r=>{let o=h(r.length),l=new Uint8Array(r.length*d);_.push(l);for(let h=0;h<r.length;h++){let g=r[h],_=m(1);y(e,i,n,s,c,g.state,o,h*a.size,l,h*d);let ee=e.isDone[g.index]===!0;for(let n of u.successors){if(!x(e,n,i,g.state,_,0))continue;let r=S(e,g.index,n);if(r!==void 0&&p.includes(r))continue;let a=r??ie(e,g.index,n);p.push(a),f.push(v+h),r===void 0&&ee&&w(e,t,g.state,g.index,a,_,0)}}v+=r.length}),p.length>0){let t=new Uint8Array(v*d);for(let e=0,n=0;e<_.length;e++)t.set(_[e],n),n+=_[e].length;ae(e,o,p,t,f,l)}},se=(e,t,n,r,i,a,o)=>{let s=u.size,c=new Uint8Array(t.nodes.length*n.length);l(o,()=>{for(let i=0;i<t.nodes.length;i++)for(let t=0;t<n.length;t++)b(e,i,n[t].state,r,t*s)&&(c[i*n.length+t]=1)}),re(e,o)||e.stateCount++,e.isDone[o]=!0;for(let l of Vw(e,o)){let o=[],u=[];n.forEach((i,a)=>{let d=e.isDone[i.index]===!0;for(let f of t.nodes[e.nodeTableaux[l]].successors){if(c[f*n.length+a]===0)continue;let l=S(e,i.index,f);if(l!==void 0&&o.includes(l))continue;let p=l??ie(e,i.index,f);o.push(p),u.push(a),l===void 0&&d&&w(e,t,i.state,i.index,p,r,a*s)}}),ae(e,l,o,i,u,a)}return e.errorNode===void 0?void 0:ue(e,e.errorNode)},ce=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)Bw(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,n)=>{Lw(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n))}),Lw(e,i)||e.stateCount++,ae(e,i,a,n,o,r)},le=(t,n)=>{if(t.initial.includes(n))return[n];let r=/* @__PURE__ */ new Map,i=[];for(let e of t.initial)Lw(t,e)&&(i.push(e),r.set(e,-1));for(let e=0;e<i.length;e++){let a=i[e];for(let e of Rw(t,a))if(!(e===a&&t.solution.tableau)){if(e===n){let e=[n];for(let t=a;t!==-1;t=r.get(t)??-1)e.push(t);return e}Lw(t,e)&&!r.has(e)&&(r.set(e,a),i.push(e))}}throw new e.x(`Couldn't re-create liveness trace (path) starting at: ${n}`)},ue=(e,t)=>Mw(le(e,t).reverse().map(t=>e.nodeStates[t])),T=(t,n)=>{let r=t.solution,i=r.actionChecks.length,a=(e,n,r)=>t.edgeActions.data[(t.edgeStarts[e]+n)*i+r]===1,o=(e,t)=>n.eventuallyAlways.every(n=>a(e,t,n)),s=new Float64Array(t.nodeStates.length).fill(-1),c=t.initial.filter(e=>Lw(t,e)),l=[],u=e=>{let n=Rw(t,e).indexOf(e);return n!==-1&&o(e,n)},d=(e,n)=>r.tableau!==void 0&&EC(r.tableau.nodes[t.nodeTableaux[e]].particle,n),f=e=>{let i=l.pop()??e;if(i===e&&!u(i)){s[i]=Hw;return}let c=/* @__PURE__ */ new Set,f=/* @__PURE__ */ new Map;for(let n=i;;n=l.pop()??e){c.add(n);let r=f.get(t.nodeStates[n]);if(r?r.push(n):f.set(t.nodeStates[n],[n]),s[n]=Hw,n===e)break}let m=n.infinitelyOftenStates.every(e=>[...c].some(n=>zw(t,n,e))),h=n.infinitelyOftenActions.every(e=>[...c].some(n=>Rw(t,n).some((t,r)=>c.has(t)&&o(n,r)&&a(n,r,e)))),g=r.promises.every(e=>[...c].some(t=>d(t,e)));if(m&&h&&g)return p(e,c,f)},p=(i,s,c)=>{let l=ue(t,i),u=[],f=/* @__PURE__ */ new Set([i]),p=n.infinitelyOftenStates.map(()=>!1),h=n.infinitelyOftenActions.map(()=>!1),g=r.promises.map(()=>!1),_=p.length+h.length+g.length,v=i,ee=e=>{u.push(v),v=e};for(;_>0;){let i=_;for(;n.infinitelyOftenStates.forEach((e,n)=>{!p[n]&&zw(t,v,e)&&(p[n]=!0,_--)}),r.promises.forEach((e,t)=>{!g[t]&&d(v,e)&&(g[t]=!0,_--)}),!(_<=0);){let r=-1,l=-1,d=_;if(Rw(t,v).some((e,i)=>{if(c.has(t.nodeStates[e])){if(!s.has(e)||!o(v,i))return!1;r=e,n.infinitelyOftenActions.forEach((e,t)=>{!h[t]&&a(v,i,e)&&(h[t]=!0,_--)})}return _<d?(ee(e),f.clear(),!0):(s.has(e)&&!f.has(e)&&(l=e),!1)}))break;if(_<i){ee(r),f.clear();break}for(;l===-1;){let n=u.pop();if(n===void 0)throw new e.x(`TLC failed to build the counterexample of a liveness property`);v=n,l=Rw(t,n).find(e=>s.has(e)&&!f.has(e))??-1}ee(l),f.add(l)}}let y=m(i,v,c);for(let e=u.length-1;e>=0;e--){let n=t.nodeStates[u[e]];y[y.length-1]!==n&&y.push(n)}let b=l[l.length-1];return y[y.length-1]===b&&y.pop(),{prefix:l.slice(0,-1),cycle:[b,...y.reverse()],isCycleConstrained:Aw(r)}},m=(n,r,i)=>{if(r===n)return[];let a=t.nodeStates[r],s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Set([a]),l=[];for(let r=a,u=-1,d=0;;d++){for(let e of i.get(r)??[])for(let[d,f]of Rw(t,e).entries()){if(f===e||!o(e,d))continue;if(f===n){let e=[];for(let t=r,n=u;t!==a;)e.push(t),t=n,n=s.get(t)??-1;return e.push(a),e}let p=t.nodeStates[f];i.has(p)&&!c.has(p)&&(c.add(p),l.push([p,r]))}s.set(r,u);let f=l[d];if(f===void 0)throw new e.x(`TLC failed to build the counterexample of a liveness property`);r=f[0],u=f[1]}};for(let e=0;e<c.length;e++){let n=[c[e],-1,0],r=0;for(;n.length>=3;){let e=n.pop()??0,i=n.pop(),a=n.pop()??0;if(i===-42){if(s[a]===e){let e=f(a);if(e)return e}n.push(Math.min(n.pop()??e,e));continue}if(s[a]!==-1){n.push(Math.min(e,s[a]));continue}s[a]=r,n.push(e,a,-42),l.push(a);let u=r++;Rw(t,a).forEach((e,r)=>{Lw(t,e)&&(o(a,r)?s[e]===-1?n.push(e,-1):u=Math.min(u,s[e]):s[e]===-1&&c.push(e))}),n.push(u)}}};return{branches:v.length,addInitialState:(e,t)=>{let n=m(1);for(let r of v){let i=r.solution.tableau;if(!i)r.initial.push(e);else for(let a=0;a<i.initialCount;a++)x(r,a,void 0,t,n,0)&&r.initial.push(S(r,e,a)??ie(r,e,a))}},addState:(t,n,r,i)=>{let o=oe(t,n,r),s=m(o.length),c=o.findIndex(e=>e.index===t)*u.size,l=h(o.length);for(let r of v){let u=r.checks.actions.length,d=new Uint8Array(o.length*u);o.forEach((e,i)=>y(r,t,n,s,c,e.state,l,i*a.size,d,i*u));let f=ee(r,t,n,s,c),p=r.solution.tableau;if(i&&(p?Vw(r,t).some(e=>r.edgeCounts[e]>0):o.every(e=>Lw(r,e.index))))throw new e.x(`The behavior graph holds every edge of the state already.`);if(!p){ce(r,o,d,f,t);continue}let m=se(r,p,o,s,d,f,t);if(m)return m}},storeState:(e,t)=>{for(let n of v){let r=n.solution.tableau;if(!r)continue;let i=[];for(let t=0;t<r.nodes.length;t++){let r=S(n,e,t);r!==void 0&&i.push(r)}for(let e of i.sort((e,t)=>e-t))n.nodeStates[e]=t,ne(n,t,n.nodeTableaux[e],e)}},getStateCounts:()=>v.map(e=>e.stateCount),findViolation:()=>{for(let e of v)for(let t of e.solution.models){let n=T(e,t);if(n)return n}}}},$w=t=>{switch(t.kind){case`Number`:if(!ls(t.value))throw e.at(new e.A(`TLC can't handle a number this big.\n${t.value}`),e.nt.error);return t.value;case`String`:case`Boolean`:return t.value;case`ModelValue`:return Ys(t.name);case`Set`:return G({kind:`MixedSet`,elements:t.elements.map($w)})}},eT=t=>{try{return $w(t)}catch(t){throw!(t instanceof e.x)||t instanceof e.A||t instanceof e.S?t:e.at(new e.x(`${e.K}${t.message}`),e.nt.error)}},tT=(t,n,r)=>{let i=`{ ${r.map(e=>`<${[...e[0],e[1]].map(e=>q(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:t,arity:n,evaluate:t=>{let n=r.find(n=>{if(n[0].length!==t.length)throw new e.x(`Attempted to apply the operator ${i}\nwith wrong number of arguments.`);return n[0].every((e,n)=>{let r=t[n];return(typeof r!=`object`||r.kind!==`Operator`)&&uc(e,r)})});if(n)return n[1];throw new e.x(`Attempted to apply operator:\n${i}\nto arguments (${t.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:q(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},nT=t=>new e.v(`In the configuration file, the identifier ${t} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`),rT=(t,n)=>{let r=e=>n.root.visible.get(e)?.key??e,i=n.root.constants.map(e=>e.name),a=n.root.variables,o=e=>{let t=n.moduleSymbols.get(e.module??``)?.get(e.name);return t?.kind===`Definition`?t:void 0},s=e=>{if(e.module===void 0)return[e.name,r(e.name)];let t=o(e);return t?[t.key]:[]},c=e=>e.module===n.root.module.name?[]:s(e),l=e=>{let t=n.definitions.get(e);return t?.kind===`Operator`?t.params.length:n.root.constants.find(t=>t.name===e)?.arity??n.builtins.get(e)?.arity??0},u=/* @__PURE__ */ new Map,d=/* @__PURE__ */ new Set,f=(e,t)=>{n.builtins.set(e,t),n.definitions.delete(e),u.delete(e),d.add(e)};t.constants.filter(e=>e.args===void 0).forEach(e=>{let t=eT(e.value);Lc(t),c(e).forEach(e=>{let n=l(e);n===0?u.set(e,t):f(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let p=/* @__PURE__ */ new Map;t.constants.forEach(t=>{if(t.args===void 0)return;let n=`${t.module??``}!${t.name}`,r=p.get(n)??{name:t.name,module:t.module,rows:[]};if(r.rows.length>0&&r.rows[0][0].length!==t.args.length)throw new e.v(`The arity of the operator ${t.name} is inconsistent in the configuration file.`);r.rows.push([t.args.map($w),$w(t.value)]),p.set(n,r)}),p.forEach(e=>c(e).forEach(t=>f(t,tT(e.name,l(t),e.rows))));let m=new Map(t.substitutions.flatMap(e=>s(e).map(t=>[t,r(e.target)])));[...m.keys()].forEach(e=>u.delete(e));let h=(t,o,s)=>{let c=r(o),l=n.definitions.get(c);if(!(l!==void 0||n.builtins.has(c)||u.has(c)||i.includes(o)||a.includes(o)))throw new e.v(`The configuration file substitutes for ${t} with the undefined identifier ${o}.`);if(l?.kind===`Operator`&&l.params.length!==s)throw new e.v(`The configuration file substitutes for ${t} with ${o} of different number of arguments.`)};t.substitutions.filter(e=>e.module===void 0).forEach(r=>{let a=r.name,o=r.target;if(!i.includes(a)&&!n.root.visible.has(a))throw new e.v(`In the configuration file, the identifier ${a} does not appear in the specification.`);if(t.substitutions.some(e=>e.name===o))throw nT(o);h(a,o,n.root.constants.find(e=>e.name===a)?.arity??n.root.visible.get(a)?.arity)});let g=t.substitutions.filter(e=>e.module!==void 0);[...n.moduleSymbols.keys()].forEach(t=>{let n=g.filter(e=>e.module===t);n.forEach(e=>{let t=o(e);if(t){if(n.some(t=>t.name===e.target))throw nT(e.target);h(e.name,e.target,t.arity)}});let r=n.find(e=>!o(e));if(r)throw new e.v(`In the configuration file, the identifier ${r.name} does not appear in the specification.`)});let _=g.find(e=>!n.moduleSymbols.has(e.module??``));if(_)throw new e.v(`In the configuration file, the module name ${_.module} is not a module in the specification.`);let v=new Set([...t.constants,...t.substitutions].filter(e=>e.module!==void 0).flatMap(c)),ee=(e,t)=>{if(v.has(e))return{key:e,prefix:t};let r=n.copySources.get(e);return r&&ee(r.source,t+r.prefix)};n.copySources.forEach((e,t)=>{let r=ee(e.source,e.prefix),i=n.definitions.get(t);if(!r||!i)return;let a=i.kind===`Operator`?i.params:[],o=Tp(t,r.key,a,a.slice(r.prefix),i.location);n.definitions.set(t,o),n.root.visible.forEach((e,r)=>{e.key===t&&r!==t&&n.definitions.set(r,o)})}),n.operatorConstants.forEach((e,t)=>u.set(t,e));let y=i.filter(e=>!u.has(e)&&!m.has(e)&&!d.has(e));if(y.length>0){let t=n.order.getDeclarationOrder(`constant`).find(e=>y.includes(e))??y[0];throw new e.v(`The constant parameter ${t} is not assigned a value by the configuration file.`)}return{constants:u,substitutions:m}},iT=`tlc2/value/impl/`,aT={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},oT={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},sT=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n=0,r=e=>{let t=n;return n+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n)}},cT=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),lT=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],uT=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??cT.get(e[3])}${`[]`.repeat(e[1].length)}`),dT=(e,t)=>e[e[t].first].text,fT=(e,t)=>dT(e,t).replaceAll(`/`,`.`),pT=t=>{let n=sT(t);if(n.readUint32()!==3405691582)throw new e.I(`A module override is not a class file`);n.readUint16(),n.readUint16();let r=[],i=n.readUint16(),a=new TextDecoder;for(let e=1;e<i;e++){let t=n.readUint8(),i={tag:t,text:``,value:0,first:0,second:0};r[e]=i,t===aT.utf8?i.text=a.decode(n.readBytes(n.readUint16())):t===aT.integer?i.value=n.readInt32():t===aT.float?n.readUint32():t===aT.long||t===aT.double?(n.readBytes(8),e++):t===aT.class||t===aT.string||t===aT.methodType||t===aT.module||t===aT.package?i.first=n.readUint16():t===aT.methodHandle?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=fT(r,n.readUint16());n.readUint16(),n.readBytes(n.readUint16()*2);for(let e=n.readUint16();e>0;e--){n.readBytes(6);for(let e=n.readUint16();e>0;e--)n.readUint16(),n.readBytes(n.readUint32())}let s=[];for(let e=n.readUint16();e>0;e--){let e=n.readUint16(),t=r[n.readUint16()].text,i=r[n.readUint16()].text,a=i.indexOf(`)`),c=uT(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:sT(n.readBytes(n.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>fT(r,d.readUint16())):[],p=lT.filter(t=>(e&t[0])!==0).map(e=>e[1]),m=uT(i.slice(a+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;s.push({name:t,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${o}.${t}(${c.join(`,`)})${h}`})}return{pool:r,methods:s}},mT=(e,t)=>{let n=e[t],r=e[n.second];return{className:dT(e,n.first),name:e[r.first].text}},hT=(t,n,r,i)=>{let a=()=>new e.V(`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===aT.integer)return t.value;if(t.tag===aT.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>=oT.iconstM1&&t<=oT.iconst5)s.push(t-oT.iconst0),e+=1;else if(t===oT.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===oT.sipush)s.push(r()<<16>>16),e+=3;else if(t===oT.ldc)s.push(l(o[e+1])),e+=2;else if(t===oT.ldcW)s.push(l(r())),e+=3;else if(t===oT.dup){let t=c();s.push(t,t),e+=1}else if(t===oT.getstatic){let t=mT(n,r());if(t.className!==`${iT}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===oT.invokestatic){let t=mT(n,r()),o=c();if(t.className!==`${iT}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===oT.new)s.push({className:dT(n,r()),value:void 0}),e+=3;else if(t===oT.invokespecial){let t=mT(n,r()),o=c(),s=c();if(!(t.className===`${iT}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===oT.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()},gT=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=pT(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:hT(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},_T=/* @__PURE__ */ new WeakMap,vT=(e,t)=>{let n=tp(e,t),r=_T.get(e);return r!==void 0&&_T.set(n,r),n},yT=(e,t)=>e.forEach(e=>{let n=t.find(t=>t.isRecursive&&t.name===e.name);n&&_T.set(n,e.arity)}),bT=e=>{switch(e.kind){case`Name`:return e.name;case`Operand`:return typeof e.operand==`number`?`argument selector ${e.operand}`:e.operand;case`Bound`:return`!(...)`;case`At`:return`@`;case`Colon`:return`:`}},xT=(e,t,n)=>({operator:e,range:t,args:n,params:n.map(()=>0)}),ST=(t,n)=>new e.I(`${t} at line ${n.line}, column ${n.column}`),CT=(e,t,n,r)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n,applications:r}:void 0;if(e.kind===`Let`)return CT(e.body,t,[...n,e.definitions],r);if(e.kind===`Lambda`||e.kind===`Selection`)return;let i=xi.get(e),a=e.kind===`Apply`&&i===void 0||e.kind===`FunctionApplication`?[...r,e]:r;for(let o of Ue(e).slice(0,i)){let i=e.kind===`FunctionApplication`&&o===e.function,s=CT(o,t,n,i?r:a);if(s)return s}},wT=e=>({line:e.line,column:e.column}),TT=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:wT(n)}),e),ET=(e,t)=>{let n=e.location;if(e.params.length===0)return t;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw ST(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:t,location:n}}if(e.args.length!==e.params.length)throw ST(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:mi,params:e.params,body:t,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:mi,args:e.args,location:n,resolution:pi},location:wT(n)}},DT=(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:pi})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:pi}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:pi};return ET({...t,params:[...t.params,...r]},TT(a,t.lets,n))},OT=(t,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s=0,c=-1,l,u,d=!1,f=0,p=[],m=[],h,g=(t,n)=>{!h&&t&&(h={location:e.X(t),message:n})},_=(t,n,i=!1)=>{let a=r.selectorRanges?.[s];t&&a&&p.push({node:t,error:{location:e.X(a),message:n},isEmpty:i,applications:[...m]})},v=(t,n)=>{if(!t)throw ST(n,a);gi.set(r,{applications:m,nulls:p,error:{location:e.X(t),message:n}}),xi.set(r,f),d=!0},ee=e=>{let i=r.selectorRanges?.[s],a=[],o=[];for(;s<t.length;){let r=t[s];if(r.kind!==`Name`&&!e)return;if(r.kind===`Name`){a.push(r.name),o.push(...r.args);let t=a.join(`!`),i=e?e.find(e=>$f(e)===t):n(t);if(i)return{definition:i,name:t,args:o,earlier:o.length-r.args.length}}s++}let c=r.selectorRanges?.[t.findLastIndex(e=>e.kind===`Name`)];return v(i&&c&&{...i,end:c.end},`Unknown operator: \`${a.join(`!`)}'.`)},y=e=>{let n=ee(e);if(!n){d=!0;return}let u=n.definition,p=_T.get(u)??Mi(u),h=s===t.length-1;if(n.args.length!==p){let e=r.argumentRanges?.[s]??a.range,t=`The operator ${j(n.name)} requires ${p-n.earlier} arguments.`;if(!i||n.args.length!==0)return f+=n.earlier,v(e,t);g(e,t)}if(f+=n.args.length,n.args.forEach((e,t)=>yi.set(e,{operator:n.name,index:t,range:r.selectorRanges?.[s]})),h)return{definition:u,args:n.args};let _=u.location.range,y=_T.has(u)&&_?.module===a.range?.module&&Ai(a,u.location);if(m.push({operator:n.name,range:r.selectorRanges?.[s],args:n.args,params:y?Array(p).fill(0):Ni(u)}),u.isRecursive&&_&&_.module===a.range?.module&&Ai(a,_.end))return v(r.selectorRanges?.[s],`Subexpression of \`${n.name}' used inside the operator's definition.`);if(u.kind!==`Operator`)throw ST(`Cannot select a subexpression of ${u.name}`,a);o.params.push(...u.params),o.args.push(...n.args),l=u.body,c=s,s++},b=()=>{for(;s<t.length&&!d;){let e=t[s];if(e.kind!==`Name`)return;let n=r.selectorRanges?.[s],a=l&&CT(l,e.name,[],[]),c=`Cannot find label \`${e.name}'.`;if(!a)return v(n,c);a.applications.forEach(e=>_(e,c,!0));let u=a.label.params;if(e.args.length!==u.length){let t=`Label \`${e.name}' used with wrong number of arguments.`;if(!i)return v(n,t);g(n,t)}f+=e.args.length,o.lets.push(...a.lets),o.params.push(...u.map(e=>({name:e,arity:0}))),o.args.push(...e.args),m.push(xT(e.name,n,e.args)),l=a.label.body,s++}},x=e=>{if(!l)throw ST(`Subexpression selection failed`,a);if(e.kind===`Colon`)return;let n=r.selectorRanges?.[s],i=`Choosing operand \`${bT(e)}' of subexpression with no operands.`;if(gi.has(l)){v(n,i);return}if(hi.has(l)&&l.kind!==`Lambda`&&l!==u&&(_(l,i,!0),u=l,l=l.kind===`Let`&&l.body.kind===`Apply`&&l.body.operator===`$subexpression`?l.body:l.kind===`Selection`?l:{kind:`Tuple`,elements:[l],location:l.location}),l.kind===`Label`){l=l.body,x(e);return}let c=`Nonexistent operand specified by \`${bT(e)}'.`;if(l.kind===`Let`){if(e.kind!==`Operand`||aa(e.operand,1)!==0){v(n,`A LET/IN expression has only one operand.`);return}o.lets.push(l.definitions),l=l.body;return}let d=la(l);if(d&&(e.kind===`Bound`||e.kind===`At`)){if(e.kind===`Bound`&&e.args.length!==d.names.length){v(n,`Selector with ${e.args.length} argument(s) used for quantifier with ${d.names.length} bound identifier(s).`);return}o.params.push(...d.names.map(e=>({name:e,arity:0}))),e.kind===`Bound`&&(f+=e.args.length,o.args.push(...e.args),m.push(xT(``,n,e.args))),l=hi.has(l)&&d.body.kind===`Selection`?d.body.expression:d.body;return}if(l.kind===`Case`){let i=[...l.arms,...l.other?[{condition:void 0,body:l.other}]:[]];if(s===t.length-1){v(n,`Subexpression of CASE must have form !i!j.`);return}let a=e.kind===`Operand`?i[aa(e.operand,i.length)]:void 0;if(!a){v(n,c);return}s++;let o=t[s],u=o.kind===`Operand`?aa(o.operand,2):-1,d=r.selectorRanges?.[s];if(u===-1){v(d,`Second selector for CASE subexpression must specify one of two operands.`);return}let f=u===0?a.condition:a.body;if(!f){v(d,`Selecting OTHER in a CASE statement.`);return}l=f;return}if(l.kind===`Except`&&e.kind===`Operand`&&aa(e.operand,l.updates.length+1)>0){v(n,`Selecting subexpression of an EXCEPT not yet implemented.`);return}let p=d?d.sets:ua(l);if(!p&&l.kind!==`Identifier`){v(n,`Selecting subexpression of expression that has none.`);return}if(e.kind!==`Operand`){v(n,c);return}let h=p?.[aa(e.operand,p.length)];h?l=h:v(n,c)},te=y(void 0);if(d)return r;if(te)return DT(te.definition,{...o,args:te.args});for(b();s<t.length&&!d;){let e=t[s];if(e.kind===`Name`){for(;l?.kind===`Label`;)l=l.body;if(l?.kind!==`Let`)return v(r.selectorRanges?.[s-1],`A name selector here must be from a LET clause.`),r;o.lets.push(l.definitions);let e=y(l.definitions);if(d)return r;if(e)return DT(e.definition,{...o,args:[...o.args,...e.args]});b()}else{if(e.kind===`Colon`&&t[s-1].kind!==`Name`)return v(r.selectorRanges?.[s-1],`!: should not follow an operand selector.`),r;if(e.kind===`Colon`&&t[s+1]?.kind!==`Name`&&(c!==s-1||s!==t.length-1))return v(r.selectorRanges?.[s],`\`!:' can be used only after a name and either at the end after an
|
|
1793
|
+
operator name or before an operator name.`),r;e.kind!==`Colon`&&(_(l,`Subexpression selection failed, probably due to an error in the selected expression.`),_(l,`Choosing operand \`${bT(e)}' of subexpression with no operands.`,!0)),x(e),_(l,`An unexpected null node specified by '${bT(t[s])}'.\nThis is probably due to a previous error.`),s++}}if(d)return r;if(!l)throw ST(`Subexpression selection failed`,a);let S=o.params.length,ne=o.args.length;if(S!==ne){let e=`Expected ${S} arguments but found ${ne}.`;if(!i||ne>0)return v(a.range,e),r;g(a.range,e)}let re=TT(l,o.lets,a),ie=e=>({kind:`Selection`,expression:e,location:o.params.length===0&&re.kind!==`Lambda`?a:wT(a)}),ae=ET(o,re.kind===`Lambda`?{...re,body:hi.has(re)?re.body:ie(re.body),location:a}:ie(re));return bi.set(ae,p),h&&_i.set(ae,h),ae},kT=(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 oa(e,t,n)},AT=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Ue(e).some(AT),jT=(e,t,n,r=!1)=>{if(!AT(e))return e;if(e.kind===`Let`){e.recursive&&yT(e.recursive,e.definitions);let r=[],i=n=>r.find(e=>e.name===n)??e.definitions.find(e=>e.name===n)??t(n),a=t=>!e.definitions.some(e=>e.name===t)&&n(t);e.definitions.forEach(e=>r.push(vT(e,e=>jT(e,i,a))));let o={...e,definitions:r,body:jT(e.body,i,a)};return o.instances?{...o,instances:o.instances.map(e=>MT(e,i,a))}:o}let i=e.kind===`Apply`?t(e.operator):void 0,a=i?.kind===`Operator`?i.params:e.kind===`Apply`?Ip.get(e.operator.slice(e.operator.lastIndexOf(`!`)+1))?.formals:void 0,o=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>jT(e,t,n,a!==void 0&&a[r]?.arity!==0))}:np(e,e=>jT(e,t,n)),s=Ue(e),c=Ue(o).every((e,t)=>e===s[t])?e:o,l=c.kind===`Subexpression`?c.selectors:c.kind===`Identifier`?kT(c.name,[],void 0,t):c.kind===`Apply`?kT(c.operator,c.args,c.argumentCounts,t):void 0,u=l?.[0],d=t=>{xi.set(e,t),xi.set(c,t)};if(!l)return c.kind===`Apply`&&c.operator.includes(`!`)&&!t(c.operator)&&d(0),c;let f=l.findIndex(e=>e.kind!==`Name`),p=l.slice(0,f===-1?l.length:f),m=p.some((e,n)=>n>0&&t(p.slice(0,n+1).map(bT).join(`!`)));if(u?.kind===`Name`&&n(u.name)&&!m)return c;if(u?.kind===`Name`&&l[1].kind!==`Name`&&!t(u.name))return d(0),c;let h=OT(l,t,c,r),g=xi.get(c);g!==void 0&&d(g);let _=Ir.get(e);return _&&h!==c&&Ir.set(h,_),h!==c&&hi.set(h,c),h},MT=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:jT(e.expression,t,n,!0)}))}),NT=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},PT=(e,t)=>MT(e,NT(t.definitions),()=>!1),FT=(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=/* @__PURE__ */ new Set([...e.definitions,...r]);yT(e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]),e.definitions);let a=new Map(e.units.flatMap(e=>e.kind===`Recursive`?e.declarations.map(e=>[e.name,e.location]):[])),o=(e,t)=>{let n=a.get(e.name);return Ai(e.location,t)||e.isRecursive&&n!==void 0&&Ai(n,t)},s=/* @__PURE__ */ new Map,c=(e,t)=>n=>{let r=e(n);if(!(!r||i.has(r)&&!o(r,t)))return s.get(r)??r},l=NT([...t,...e.definitions]),u=e=>n.has(e),d=NT([...t,...e.definitions,...r]),f=(e,t)=>jT(e,c(d,t),e=>u(e)&&r.every(t=>t.name!==e)),p=e=>{let t=t=>u(t)||!e(t),n=n=>jT(n,e,t),r=e=>{let t=e.map(e=>e.kind===`ModuleFact`?e:n(e));return vi.set(t,e),t},i=n=>n.map(n=>n.kind===`ModuleFact`?n:jT(n,e,t,!0)),a=e=>e.map(e=>({...e,set:n(e.set)})),o=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&n(e.set)}:o(e)),conclusion:n(e.conclusion)}:n(e),s=s=>{switch(s.kind){case`Use`:case`Hide`:return{...s,facts:r(s.facts),defs:i(s.defs)};case`Instance`:return MT(s,e,t);case`Define`:return{...s,definitions:s.definitions.map(r=>r.kind===`Instance`?MT(r,e,t):vT(r,n))};case`Have`:case`Case`:return{...s,expression:n(s.expression)};case`Witness`:return{...s,expressions:s.expressions.map(n)};case`Take`:return{...s,bounds:a(s.bounds)};case`Pick`:return{...s,bounds:a(s.bounds),body:n(s.body)};case`Assert`:return{...s,statement:o(s.statement)};default:return s}},c=t=>{if(t?.kind===`By`)return{...t,facts:r(t.facts),defs:i(t.defs)};if(t?.kind!==`Steps`)return t;let n={lookup:e,resolveStep:s,resolveProof:c};return{...t,steps:t.steps.map(e=>{let t={...e,body:n.resolveStep(e.body),proof:n.resolveProof(e.proof)};if(t.body.kind===`Define`){let e=t.body.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),r=n.lookup;n=p(t=>e.find(e=>e.name===t)??r(t))}return t})}};return{lookup:e,resolveFacts:r,resolveDefs:i,resolveStatement:o,resolveStep:s,resolveProof:c}},m=e.definitions.some(e=>AT(e.body))||e.assumptions.some(e=>AT(e.expression));m&&[...e.definitions,...r].toSorted((e,t)=>ji(e.location,t.location)).forEach(e=>s.set(e,vT(e,t=>f(t,e.location))));let h={...e,theorems:e.theorems.map(e=>{let t=p(c(l,e.location));return{...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:t.resolveStatement(e.statement),proof:e.proof&&p(c(l,e.proof.location)).resolveProof(e.proof)}}),uses:e.uses.map(e=>{let t=p(c(l,e.location));return{...e,facts:t.resolveFacts(e.facts),defs:t.resolveDefs(e.defs)}})};return m?{...h,definitions:e.definitions.map(e=>s.get(e)??e),assumptions:e.assumptions.map(e=>({...e,expression:f(e.expression,e.location)}))}:h},IT=(e,t)=>e.maxLevels[t]??3,LT=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=Wm({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(e,a),a},i=/* @__PURE__ */ new Map,a=e=>{let n=i.get(e);if(n)return n;let a=t(e),o=r(e),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Gp(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Gp(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Kp(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Hp(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)&&Gp(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(Gm(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c};return n=>{let i=/* @__PURE__ */ new Map,o=e.X(n.location.range??{module:n.instancer,start:n.location,end:n.location}),s=e=>i.set(`${o}\n${e}`,{location:o,message:e}),c=t(n.module),l=a(n.module),u=r(n.instancer),d=/* @__PURE__ */ new Map;n.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...c.constants.map(e=>({...e,maximumLevel:0})),...c.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let t=n.substitutions.get(e.name);if(!t)return[];if(e.arity===0){let n=u.analyze(t,d);return[{...e,level:n.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(t,d),i=r.kind===`Operator`?r.data:void 0;return[{...e,level:r.data.level,operator:i,isLeibniz:i===void 0||i.nonLeibniz.size===0}]}),p=(e,t)=>`Level error in instantiating module '${n.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${t}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&s(p(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${n.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let t=l.constraints.get(e.name);t!==void 0&&e.level>t&&s(p(e.name,t));let r=e.operator;if(r)for(let t=0;t<e.arity;t++){let i=l.argConstraints.get(Bp(e.name,t));i!==void 0&&IT(r,t)<i&&s(`Level error in instantiating module '${n.module}':\nThe level of the argument ${t+1} of the operator ${r.name} \nmust be at least ${i}.`)}}),l.argParams.forEach(e=>{let t=Hp(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=IT(r,t.index);i.level>a&&s(`Level error when instantiating module '${n.module}':\nThe level of the argument ${t.index} of the operator ${t.operator}' \nmust be at most ${a}.`)}),i.size>0)throw e.J([...i.values()])}},RT=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],zT=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),BT=new Map(Ke.flatMap(e=>e.map(t=>[t,e[0]]))),VT=e=>BT.get(e)??e,HT=()=>{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}}},UT=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:Gr(e)&2147483647,kind:t,isLocal:n}),WT=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:VT(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:VT(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}},GT=(e,t)=>{let n=[];for(let r=t;;){let t=WT(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},KT=e=>({line:e.line,column:e.column}),qT=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text!==`.`){if(a.text===`EXTENDS`){let n=GT(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},JT=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,YT={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},XT=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&JT(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&JT(e[n+1],e[n+2])?n+=JT(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=>YT[e])}"`:r.text)}return t},ZT=e=>e[2]?.text,QT=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},$T=(e,t)=>e.find(e=>e.name===t)??e.map(e=>$T(e.modules,t)).find(Boolean),eE=e=>{let t=e===void 0?[]:De(e),n;return{tokens:t,ranges:QT(t),getModule:()=>n??=e===void 0?Vr(``):Hr(e,t)}},tE=(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=eE(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)??Ze.get(i)??F_.get(i)??zr(e,i),c=a(s),l=c.tokens,u=c.ranges.get(ZT(l)??``)??{start:0,end:0},d={tokens:l,...u,getModule:c.getModule};return n.set(i??``,d),c.ranges.forEach((e,t)=>{e.start===u.start||r.has(t)||r.set(t,{tokens:l,...e,getModule:()=>$T(d.getModule().modules,t)??d.getModule()})}),d};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},nE=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=GT(t,e+1);i.push({location:KT(t[e]),apply:e=>r.forEach(t=>e.put(UT(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c=new Set(n.units.flatMap(e=>e.kind===`Constants`||e.kind===`Variables`?[`${e.location.line}:${e.location.column}`]:[])),l=0;t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r;if(n.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l++,l===2){let e=t[u+2].text;i.push({location:KT(n),apply:t=>t.put(UT(e,`module`,!1))})}return}if(n.kind===`ModuleEnd`&&l--,l!==1||n.kind!==`Keyword`)return;let d=c.has(`${n.line}:${n.column}`);d&&(n.text===`CONSTANT`||n.text===`CONSTANTS`)&&o(u,`constant`),d&&(n.text===`VARIABLE`||n.text===`VARIABLES`)&&o(u,`variable`),n.text===`RECURSIVE`&>(t,u+1).every(e=>s.has(e))&&o(u,`definition`),zT.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(KT(n)),i.push({location:KT(n),apply:e=>e.put(UT(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(UT(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=VT(e.name);i.push({location:e.location,apply:n=>n.put(UT(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(UT(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(UT(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>Ai(e.location,t.location)?-1:+!!Ai(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=HT();n.set(i??``,o),Ge.toReversed().forEach(e=>o.put(UT(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)}}},rE=(t,n,r)=>{let i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};n.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),Je.forEach(a);let s=e=>{let n=t(e);return n.tokens.slice(n.start,n.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=qT(s(e),e,c);return l.set(e,n),n},d=e=>c.get(e)??u(e),f=/* @__PURE__ */ new Set,p=(e,t)=>c.has(t)||f.has(`${e.key}>${t}`),m=(e,t,n)=>{let r=[...e.extends.map(d),...e.instances.filter(t=>p(e,t)).map(d),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},h=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!p(n,e));return i===void 0?m(n,r,t):[n,i]};return t},g=h(e=>e.extends),_=h(e=>e.instances),v=/* @__PURE__ */ new Set([void 0]),ee=/* @__PURE__ */ new Map;XT(s(void 0)).forEach((e,t)=>{t===3&&Xe.forEach(a),a(e)});let y=u(void 0);for(;;){let n=g(y,/* @__PURE__ */ new Set)??_(y,/* @__PURE__ */ new Set);if(!n)break;let[r,i]=n;if(f.add(`${r.key}>${i}`),ee.set(r.unit,[...ee.get(r.unit)??[],i]),!v.has(i)){if(v.add(i),t(i).tokens.length===0){let n=r.unit??ZT(t(void 0).tokens);throw e.q(i,n)}XT(s(i)).forEach(a)}}RT.forEach(a);let b=/* @__PURE__ */ new Set,x=e=>{if(b.has(e))return;b.add(e);let t=ee.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(x),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return x(void 0),r.forEach(e=>{let t=s(e);XT(t).forEach(a),t.forEach(e=>{e.kind===`String`&&a(e.text)})}),Ye.forEach(a),[...i]},iE=(e,t)=>{let n=tE(e,t),r=n.getParsed,i,a=()=>i??=nE(r);return{getStringOrder:(e,t)=>rE(r,e,t),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},aE=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),oE=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],sE=(t,n,r)=>{try{return r.parseModule(t)}catch(r){if(!(r instanceof e.I))throw r;let i=yn(t);throw i===void 0?r:e.J([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},cE=t=>new e.I(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),lE=(t,n)=>t.location.range&&n.location.range&&{location:e.X(t.location.range),message:`Multiply-defined module '${t.name}': this definition or declaration conflicts \nwith the one at ${e.X(n.location.range)}.`},uE=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,dE=e=>e===`Theorem`?`ThmOrAssumpDefNode`:uE(e),fE=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:Cp(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),pE=(e,t)=>{let n=We(e);return n!==void 0&&t.has(n)||Ue(e).some(e=>pE(e,t))},mE=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(vp(e),n.get(e)??n.size)),n},hE=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),gE=e=>e?.kind===`Steps`?e.steps.flatMap(e=>[...e.body.kind===`Instance`?[e.body]:[],...e.body.kind===`Define`?e.body.definitions.flatMap(e=>e.kind===`Instance`?[e]:[]):[],...gE(e.proof)]):[],_E=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Eb(e);if(e.kind===`Number`&&!ls(e.value))throw Db(e);_E(e.kind===`Let`?[...Ue(e),...hE(e.instances??[])]:Ue(e))}),vE=(t,n)=>{let r=n.order??iE(n.source,n.loadModule),i=r.parseModule(n.source),a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Set,l=/* @__PURE__ */ new Set,u=new Map(J_.map(e=>[e.name,e])),d=/* @__PURE__ */ new Map,f=c_(t.checkDeadlock,n.seed);f.isWarningEnabled=n.isWarningEnabled??!0,f.isTool=n.isTool??!1,f.version=n.version??`master`,f.readLine=n.readLine;let p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,h=[],g=/* @__PURE__ */ new Map,_=[],v=[],ee=/* @__PURE__ */ new Set,y=(e,t)=>[ee,..._].forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),b=0,x=e=>`${e}#${b++}`,te=[],S=[],ne=LT(e=>{let t=m.get(e)??le(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)}}),re=/* @__PURE__ */ new Map,ie=/* @__PURE__ */ new Map,ae=/* @__PURE__ */ new Map,C=e=>{let t=d.get(e);if(t)return t;let r=gv(e,n.print,f,n.files,u);if(!r)return;mv.get(e)?.forEach(C);let i=/* @__PURE__ */ new Map;return hv.get(e)?.forEach(e=>C(e)?.forEach((e,t)=>i.set(t,e))),r.forEach(t=>{u.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Ip.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Rp(e,t.name)??i.get(t.name)?.range})}),d.set(e,i),i},oe=e=>{let t=mv.get(e)??[];if(e===`TLCExt`||[e,...t].some(e=>n.loadModule?.(e)!==void 0))return;let r=C(e);return r&&y(e,t),r&&t.includes(`Integers`)&&C(`Integers`),r},w=e=>(_E([...e.definitions.flatMap(He),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...hE(e.instances)]),e.modules.forEach(w),e);w(i);let se=(t,i)=>{let a=n.loadModule?.(t)??L_(f.version).get(t)??zr(n.source,t);if(a===void 0)throw e.q(t,i);let o=sE(a,t,r);if(o.name!==t)throw e.J([{location:`Unknown location`,message:`File name '${t}' does not match the name '${o.name}' of the top level module it contains.`}],!0);return w(o)},ce=t=>{let n=v.indexOf(t.name);if(n!==-1){let r=[...v.slice(n),t.name].map(e=>`${e}.tla`);throw new e.I(`Circular dependency among .tla files; dependency cycle is: ${r.join(` --> `)}`)}let r=/* @__PURE__ */ new Set,i=[],a=[],o=[];v.push(t.name),_.push(r);let s=me(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:S,levelChecks:o});if(_.pop(),v.pop(),a.length>0)throw e.J(a,!1,void 0,S);let c=i.find(e=>r.has(e.name)),l=c&&p.get(c.name),u=l&&lE(c,l.module);if(u)throw e.J([u],!1,void 0,S);if(c)throw cE(c);let d=[...lo(o.flatMap(e=>e.sections),S),...o.flatMap(e=>e.check(e!==o.at(-1)))].filter((e,t,n)=>n.findIndex(t=>t.location===e.location&&t.message===e.message)===t);if(d.length>0)throw e.J(d,!1,void 0,S);return{linked:s,closure:r}},le=(t,r)=>{let i=p.get(t);if(i)return y(t,g.get(t)??[]),i;let o=ce(se(t,r)),s=/* @__PURE__ */ new Map;return pv(t,n.print,f,n.files,u,(t,n,r)=>{let i=s.get(t),a=n.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(i?.kind!==`Operator`||!r||a.length!==n.length)throw new e.x(`No definition of ${t} to fall back to`);return $(i.body,{environment:r.environment,scope:Px(bx(i),a,r),state:r.state,next:r.next,isKeepLazy:r.isKeepLazy})})?.forEach(e=>{let n=o.linked.visible.get(e.name);if(n?.kind!==`Definition`||n.arity!==e.arity&&aE.has(t))return;let r=a.get(n.key);r&&s.set(e.name,r),u.set(n.key,e),a.delete(n.key)}),p.set(t,o.linked),g.set(t,o.closure),y(t,o.closure),o.linked},ue=(e,t,n,r,i)=>{let u=i?void 0:oe(e.module);if(u)return T(e,u);let d=i??le(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=oE(d),p=`#${b++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=co(PT(e,t),f,t,n);te.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>l.add(e));let _=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,v=jp({params:g,substitutions:new Map([...h].map(e=>[e[0],Xf(e[1],m)])),variables:new Set(d.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>o.get(e)===!0,addDefinition:(n,i,l)=>{let u=x(`${i}@${t.name}`),d=l(u);return a.set(u,d),f.length>0&&c.add(d),e.name!==void 0&&ie.set(u,`${e.name}!${ie.get(n)??i}`),o.set(u,!r),s.set(u,{source:n,prefix:e.params.length}),u},createName:x,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return E(e,d.exported,f,(t,n)=>{let r=e.name===void 0?v.getKey(t):v.getQualifiedKey(t);return f.length>0&&re.set(r,{name:n,location:e.location}),e.name!==void 0&&ae.set(r,n),r})},T=(e,t)=>e.name===void 0?t:new Map([...t].map(t=>[`${e.name}!${t[0]}`,{key:t[1].key,arity:t[1].arity,params:t[1].params,kind:t[1].kind}])),E=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(t=>!i.has(t[0])&&(e.name!==void 0||t[1].kind!==`Instance`)).map(t=>{if(e.name===void 0)return[t[0],{key:r(t[1].key,t[0]),arity:t[1].arity,params:t[1].params,kind:t[1].kind,range:o.get(t[1].key)===!0?e.location.range:t[1].range,functionArity:o.get(t[1].key)===!0?void 0:t[1].functionArity}];let i=`${e.name}!${t[0]}`;return[i,{key:t[1].kind===`Instance`?i:r(t[1].key,i),arity:t[1].arity+e.params.length,params:t[1].params&&[...e.params.map(e=>e.arity),...t[1].params],kind:t[1].kind,functionArity:n.length>0?void 0:t[1].functionArity}]}))},D=(e,t)=>Array.from({length:e},(e,n)=>({name:`argument${n}`,arity:t?.[n]??0})),de=(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=D(t.arity,void 0);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:wp(r,n),location:n}}},O=(e,t,n,r)=>{let i=e.location,s=r?void 0:oe(e.module);if(s)return e.name===void 0?[]:[...s].map(t=>{let n=D(t[1].arity,t[1].params);return Tp(`${e.name}!${t[0]}`,t[1].key,[...e.params,...n],n,i)});let c=r??le(e.module,n),l=`#${b++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=oE(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};te.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=>pE(f(e),p),h=d.map(t=>{let n=de(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),g=[],_=jp({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:wp(e.params,i),location:i,resolution:pi}:Cp(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>o.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:fE(a,i)),i},createName:x}),v=new Set(d.map(e=>e.name)),ee=[...c.exported].filter(e=>!v.has(e[0])&&e[1].kind!==`Instance`).map(t=>{let n=_.getKey(t[1].key),r=D(t[1].arity,t[1].params),a=[...e.params,...r];return Tp(e.name===void 0?t[0]:`${e.name}!${t[0]}`,n,a,n===t[1].key?r:a,i)});return[...h,...g,...ee]},fe=e=>[...e].flatMap(e=>{let t=a.get(e[1].key);return t?[{...t,name:e[0]}]:[]}),pe=/* @__PURE__ */ new Map,me=(t,r)=>{let s=gT(t,n.loadClass?.(t.name),t===i);pe.set(t.name,s.overrides);let c=s.module,l=te.length,u=new Map([...J_.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:ro,errors:[],warnings:[]},p=[f],g=t=>t.forEach((t,n)=>{let r=_.get(n);if(!r){u.set(n,t),_.set(n,t);return}if(!r.range||!t.range||e.X(r.range)===e.X(t.range))return;let i=e.X(t.range),a=e.X(r.range);dE(r.kind)===dE(t.kind)?f.warnings.push({location:i,message:`Warning: the ${uE(r.kind)} of '${n}' conflicts with \nits ${uE(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${uE(t.kind)} of '${n}' conflicts with \nits ${uE(r.kind)} at ${a}.`})}),_=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,b=[],x=[...c.constants],re=c.variables.filter((e,t)=>c.variables.findIndex(t=>t.name===e.name)===t),ie=re.map(e=>e.name),C=re.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:oe(e);if(n){g(n);return}let i=t??le(e,c.name);x.push(...i.constants.filter(e=>x.every(t=>t.name!==e.name)&&!ie.includes(e.name))),i.variables.forEach((e,t)=>{ie.includes(e)||x.some(t=>t.name===e)||(ie.push(e),C.push(i.variableLocations[t]))}),g(i.exported),i.facts.forEach(e=>v.add(e)),i.modules.forEach((e,t)=>y.set(t,e)),b.push(i)});let w=new Map(u),se=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],ce=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});se.forEach(e=>_.set(e.name,ce(e)));let D=e=>({key:he(e),arity:Mi(e),params:Ni(e),kind:io(c,e)?`Theorem`:`Definition`,range:e.location.range,functionArity:Fi(e)}),de=x.length===0&&ie.length===0,he=e=>c===i?e.name:`${e.name}@${r.id}`,ge=/* @__PURE__ */ new Map,_e=()=>new Map([...r.modules,...y]),ve=e=>{let t=c.modules.find(t=>t.name===e.module);return t?Ai(t.location,e.location)?y.get(t.name):void 0:_e().get(e.module)},k=e=>({imported:u,getInstance:e=>{let t=ve(e),n=t?void 0:oe(e.module);if(n)return{declarations:[],symbols:T(e,n),instancer:c.name};let r=t??le(e.module,c.name),i=oE(r);return{declarations:i,symbols:E(e,r.exported,i,e=>e),instancer:c.name}},bound:w,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:he,isModuleKnown:(e,t)=>e===c.name||ee.has(e)||r.modules.has(e)||c.modules.some(n=>n.name===e&&Ai(n.location,t)),instanced:ge,facts:v,reports:p,warnings:r.warnings}),ye=e=>[...se.filter(t=>Ai(t.location,e)).map(e=>[e.name,ce(e)]),...c.definitions.filter(t=>Ai(t.location,e)).map(e=>[e.name,D(e)])].reduce((e,t)=>e.has(t[0])?e:e.set(t[0],t[1]),new Map(u)),be=e=>{let t=_e(),n=t.get(e.name),i=n&&lE(e,n.module);if(n&&!i)throw cE(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};p.push(a);let o=me(e,{id:`${r.id}/${e.name}`,symbols:ye(e.location),modules:t,nested:r.nested,errors:a.errors,warnings:a.warnings,levelChecks:r.levelChecks});i&&a.errors.push(i),n||y.set(e.name,o)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=ue(e,c,k(c),de,_e().get(e.module));ge.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||_.set(n,t))}),e.name!==void 0&&!e.isLocal&&_.set(e.name,{key:`${e.name}@${r.id}`,arity:e.params.length,kind:`Instance`,range:e.location.range})}})),...c.modules.map(e=>({location:e.location,link:()=>be(e)}))].sort((e,t)=>Ai(e.location,t.location)?-1:1).forEach(e=>e.link());let xe=FT(Fp(c,(e,t)=>O(e,t,c.name,ve(e))),fe(u));c.theorems.flatMap(e=>gE(e.proof)).filter(e=>!_e().has(e.module)).forEach(e=>oe(e.module)??le(e.module,c.name)),r.errors.push(...uo(xe,k(xe))),xe.definitions.forEach(e=>{let t=he(e);a.set(t,e),o.set(t,!de);let n=D(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!Ai(r,e.location))&&(u.set(e.name,n),e.isLocal||_.set(e.name,n))});let Se={module:xe,constants:x,variables:ie,variableLocations:C,visible:u,exported:_,modules:y,extended:b,facts:/* @__PURE__ */ new Set([...v,...[...xe.theorems,...xe.assumptions].flatMap(e=>e.name??[])])};m.has(c.name)||m.set(c.name,Se);let Ce=te.splice(l).map(e=>({location:e.location,check:()=>ne(e)}));return r.levelChecks.push(Km(xe,{constants:new Set(x.map(e=>e.name)),variables:new Set(ie),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>ae.get(u.get(e)?.key??e)},Ce,S)),h.push(Se),Se},he=ce(i).linked,ge=n.traceFile,_e=ge===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:ge}}],ve=[...n.moduleOperators??[],..._e].map(e=>{let t=le(e.module,i.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});h.push(...h.splice(h.indexOf(he),1)),S.length>0&&!n.isSanyReported&&n.print(e.Z(S));let k=n.runtimeInvariants??[];k.forEach(e=>{if(e.module===void 0)return;p.set(i.name,he);let t=le(e.module,i.name);h.splice(h.indexOf(t),1);let n=a.get(t.visible.get(e.name)?.key??e.name);n&&a.set(e.name,n)}),he.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)}),ve.forEach(e=>{let t=e.key===void 0?void 0:a.get(e.key);e.kind!==`postcondition`&&t&&a.set(e.operator,t)});let ye=[],be=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>be(e,t)),ye.push(...e.module.assumptions))};be(he,/* @__PURE__ */ new Set);let xe=he.constants.map(e=>e.name),Se=he.variables,Ce=rT(t,{root:he,moduleSymbols:new Map([...d,...[...p].map(e=>[e[0],e[1].visible]),[i.name,he.visible]]),definitions:a,builtins:u,copySources:s,operatorConstants:new Map(ve.flatMap(e=>le(e.module,i.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:r}),we=Ce.constants,Te=Ce.substitutions;ge!==void 0&&u.forEach((e,t)=>{let n=$_(e);n&&u.set(t,n)});let Ee=mE(Se,h.flatMap(e=>e.module.variables.map(e=>e.name))),De=sh({definitions:a,substitutions:Te,constants:we,variableIndex:Ee,builtins:u,variables:Se}),Oe={runtime:f,definitions:a,builtins:u,constants:we,substitutions:Te,instanceNames:ie,variables:Se,variableIndex:Ee,facts:De,startupValues:Array.from({length:De.ids.size},()=>void 0),tlcEvalValues:/* @__PURE__ */ new WeakMap,substitutedDefinitions:c,instanceParams:l,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},ke=Wm({constants:new Set(we.keys()),variables:/* @__PURE__ */ new Set([...Se,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>u.has(e))]),getDefinition:e=>Vb(e,Oe)}),Ae=t=>{try{$(t,{environment:Oe,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e.x)return t;throw t}};Te.forEach((t,n)=>{let r=a.get(t),i=xe.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&ke.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?Ae(r.body):void 0;if(i){let r=Oo(i)?``:` - specifically: ${i.message}`;throw new e.v(`The configuration file substitutes constant ${n} with non-constant ${t}${r}`)}}),f.version!==`1.7.4`&&(f.isStarted=!0);let je=new Set(h.flatMap(e=>e.module.instances.map(e=>e.module))),Me=r.createDefinitionOrder();return{environment:Oe,assumptions:ye,variableLocations:he.variableLocations,instanceActions:re,startupDefinitions:h.filter(e=>!je.has(e.module.name)||oE(e).length===0).flatMap(e=>Me(e===he?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:h.flatMap(e=>pe.get(e.module.name)??[]),moduleOperators:ve,runtimeInvariants:k,rootName:i.name}},yE=e=>[...e].map(e=>`${e[0]}>${e[1].name}`).sort().join(`,`),bE=(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},xE=t=>e.at(new e.x(`${e.K}${t}`),e.nt.error),SE=e=>{let t=K(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!os(e)||!os(i))throw xE(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},CE=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${wE(t)}`:n},wE=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(wE).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${CE(e.pattern,e.set)}:${wE(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(wE).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${wE(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>CE(e.pattern,e.set)).join(`,`)}|->${wE(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(wE);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},TE=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,EE=(t,n,r)=>{let i=n.definitions.get(t);if(i===void 0&&!n.constants.has(t))throw new e.v(`The symmetry function ${t} specified in the configuration file\nis not defined in the specification.`);if(i?.kind!==`Operator`||i.params.length>0)throw xE(`The symmetry function ${t} must specify a set of permutations.`);let a=e=>$(e,{environment:n,scope:void 0,state:void 0,next:void 0}),o=a(i.body);if(!rs(o)||!W(o))throw xE(`The symmetry operator must specify a set of functions.`);let s=G(o).elements;if(!s.every(as))throw xE(`The symmetry values must be function records.`);let c=i.body,l=c.kind===`Apply`?c.args:c.kind===`SetEnumeration`?c.elements:[],u=new Map(r.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),d=e=>{if(e.length===0)return;let t=e.map(e=>{let t=wE(TE(e)?e.args[0]:e);return u.get(t)??t}),r=e.length>1;n.runtime.warn(_o.symmetrySetTooSmall,`The set${r?`s`:``} ${t.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(l.length>=s.length){d(l);return}let f=/* @__PURE__ */ new Map;s.map(SE).forEach(e=>{e.size>0&&f.set(yE(e),e)});let p=[...f.values()],m=0;for(;m<f.size;){let e=[...f.values()],t=e.length;p.forEach(n=>e.slice(m,t).forEach(e=>{let t=bE(n,e),r=yE(t);t.size>0&&!f.has(r)&&f.set(r,t)})),m=t}let h=new Set([...f.values()].flatMap(e=>[...e.values()].map(e=>e.name))),g=new Set(r.map(e=>e.name));if(d(l.filter(e=>{if(!TE(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||g.has(t.name))return!1;let n=a(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>os(e)&&h.has(e.name))})),f.size!==0)return[...f.values()]},DE=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=kE(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(kE(e[r],t));return a}},OE=(e,t)=>{let n=[],r=[];for(let i of e){let e=kE(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Ks);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Ks(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},kE=(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=OE(e.elements,t);return n?Zs(n):e}if(n===`Function`||n===`LazyFunction`&&W(e.domain)){let n=K(e),r=DE(n.domain,t),i=DE(n.range,t)??n.range;if(r){let e=Jc(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?$s(n.domain,e.range):e}return i===n.range?n:$s(n.domain,i)}if(n===`Interval`||!rs(e)||!W(e))return e;let r=G(e),i=DE(r.elements,t);return i?Hc(i):r},AE=(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]=kE(e[o],i),a===0&&(a=Ks(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},jE={line:0,column:0},ME=e=>({kind:`Identifier`,name:e,location:jE}),NE=e=>({name:e,expression:ME(e),scope:void 0}),PE=/* @__PURE__ */ new Set([`name`,`property`]),FE=(t,n,r)=>{let i=Vb(n,r);if(!i)throw new e.v(`The ${t} ${n} specified in the configuration file\nis not defined in the specification.`);if(i.kind===`Operator`&&i.params.length>0)throw new e.v(PE.has(t)?`TLC requires ${n} not to take any argument.`:`TLC requires ${t} not to take any argument, but one was given: ${n}`);return i},IE=e=>e.body.kind===`Number`||e.body.kind===`String`,LE=(e,t,n)=>n.constants.has(e)?n.constants.get(e):IE(t)?void 0:gx(t,n),RE=(t,n,r)=>{if(r.constants.has(n))throw new e.v(`The ${t} ${n} cannot be a constant.`);let i=FE(t,n,r);if(LE(n,i,r)!==void 0)throw new e.v(`The ${t} ${n} cannot be a constant.`);return i},zE=(t,n,r)=>{let i=r.constants.has(n)?void 0:FE(t,n,r),a=i?LE(n,i,r):r.constants.get(n);if(a!==void 0&&a!==!0)throw new e.v(`The ${t} of ${n} is equal to ${q(a)}`);return a===void 0?i:void 0},BE=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},VE=(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})),_x(e.startupDefinitions,r),t.invariants.forEach(e=>{zE(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},HE=(t,n)=>{let r=Wm({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>n.definitions.get(e)});return t.flatMap(t=>{let i=zE(`invariant`,t,n);if(!i)return[];let a=r.analyzeDefinition(i,/* @__PURE__ */ new Map);if(a.level>=2){let n=a.params.size===0?``:`
|
|
1786
1794
|
Note that a bug can cause TLC to incorrectly report this error.
|
|
1787
1795
|
If you believe your TLA+ or PlusCal specification to be correct,
|
|
1788
|
-
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw e.
|
|
1789
|
-
all state variables. Proceed with fingers crossed.`}),i().filter(e=>r!==void 0&&!r.includes(e)).forEach(e=>a?.({kind:`warning`,code:
|
|
1790
|
-
but TLC can handle only specifications with one next-state relation.`);s.push({expression:l.expression.action,scope:t.scope});return}if(l.kind===`Always`&&l.expression.kind!==`Let`&&l.expression.kind!==`Label`&&_x(l.expression,t.scope,n)<2)throw e.it(new e.b(`TLC cannot handle the temporal formula ${H(l.expression)}`),e.tt.error);let p=_x(l,t.scope,n);if(p===3)d!==void 0&&t.path.includes(d)||(f=!0),c.push(t);else{if(p===2)throw new e._(`TLC cannot handle this conjunct of the spec:\n${H(l)}`);o.push(t)}});let p=[...o,...s],m=e=>`$specification${e}`,h=p.reduce((e,t,n)=>t.scope===void 0?e:{name:m(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),g=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:m(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:o.length===0?void 0:{kind:`And`,operands:o.map(g),location:fS},next:s.length===0?void 0:g(s[0],o.length),scope:h,temporals:c,isPropertyFairness:c.length>0&&!f}},ES=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=yS(`property`,t,n);if(!a)return;_x(a.body,void 0,n)===1&&r?.({kind:`state-level-property`,name:t});let o=n.runtime.version!==`1.7.4`;yx(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(wS(r,n,`property`))return;let o=r.name??t;if(a.kind===`Always`&&a.expression.kind===`BoxAction`){i.actionProperties.push({name:o,box:a.expression,action:a.expression.action,subscript:a.expression.subscript,scope:r.scope});return}if(a.kind===`Always`&&_x(a.expression,r.scope,n)<=1){let e=a.expression,t=e.kind===`Identifier`&&!O(e)?Dh(e.name,n):void 0;i.invariants.push({name:t?.name??(e.kind===`Identifier`?e.name:o),expression:e,scope:r.scope});return}let s=_x(a,r.scope,n);if(s<2)i.initialPredicates.push({name:o,expression:a,scope:r.scope});else{if(s===2){let t=H(a),n=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,r=a.kind===`BoxAction`?`To check that action ${o} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${t} (compare page 90 of ${n}).`:a.kind===`AngleAction`?`To check that infinitely many ${o} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${t} (compare page 91 of ${n}).`:`To check that action ${o} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${t}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${n}).`;throw new e._(`The formula ${o} at ${t} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${r}`)}i.liveness.push({name:t,expression:a,scope:r.scope})}})}),i},DS=(e,t,n)=>t.flatMap(t=>yS(e,t,n)?[{name:t,expression:pS(t),scope:void 0}]:[]),OS=(e,t)=>{let n=Dh(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},kS=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e._(`_POSSIBLE lists ${r} more than once`);vS(`possible`,r,n);let a=pS(r);if(_x(a,void 0,n)===3)throw new e._(`The possible of ${r} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:r,expression:a,scope:void 0}}),AS=(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},jS=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=Dh(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},MS=(e,t)=>e.flatMap(e=>CS(e.expression,t).map(n=>{let r=e.scope===void 0?bu(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:AS(n,r,t),predicate:jS(e.expression,t)}})),NS=(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},PS=/[\u0100-\uffff]/,FS=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),IS=e=>e.kind===`String`?PS.test(e.value):e.kind===`Set`&&e.elements.some(IS),LS=e=>e.kind===`String`&&PS.test(e.value)||e.kind===`Apply`&&FS.has(e.operator)||Be(e).some(LS),RS=(e,t)=>e.constants.some(e=>IS(e.value)||(e.args??[]).some(IS))||[...t.definitions.values()].some(e=>LS(e.body)||e.kind===`Function`&&e.bounds.some(e=>LS(e.set))),zS=e=>{if(!M(e))return;let t=Rt(I(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},BS=(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`},VS=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),HS=(e,t,n)=>Sh(W(e,t),n),US=(t,n,r=GS)=>{let i=W(t,n);if(typeof i!=`boolean`)throw new e.b(r(t,n.environment));return i},WS=(t,n,r)=>{let i=n.kind===`Identifier`?Dh(n.name,r):void 0,a=i?.kind===`Operator`?i.body:n,o=i?.kind===`Operator`?i.bodyRange:void 0;return`TLC expected a ${t} value, but did not find one. ${o&&a.kind!==`Number`?e.X(o):ah(a)}`},GS=(e,t)=>WS(`boolean`,e,t),KS=(e,t)=>US(e.expression,t,(n,r)=>(US(e.predicate,t),GS(n,r))),qS=()=>{},JS=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=HS(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),YS=(t,n)=>{try{return t(VS(n,void 0,void 0))?void 0:{message:void 0}}catch(t){if(t instanceof e.b)return{message:t.message};throw t}},XS=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=YS(e=>Eh(W(n.expression,e),n.expression),t);if(e)return{name:ah(n.expression),trace:[],message:e.message}}},ZS=e=>{let t=typeof e.config==`string`?ze(e.config,e.version):e.config,n=db(e.source,e.loadModule);Yt(n.getStringOrder(t)),en(e),Ma(e.fingerprintPolynomial??0);let r=Db(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});xS(r,t,e.onProgress);let i=r.environment;return i.runtime.getSpecification=()=>$x(t,i,r.variableLocations,r.instanceActions),{config:t,specification:r,environment:i,search:eC(t,i,r.variableLocations,()=>n.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators)}},QS=(t,n,r)=>{let i=XS(t,n);if(!i)return;if(i.message===void 0){let t=`Assumption ${i.name} is false.`;return r(Ke.assumptionFalse,t,t),e.tt.assumptionViolation}let a=`Evaluating assumption ${i.name} failed.\n${i.message}`;return r(Ke.assumptionEvaluationError,a,at(Ke.assumptionEvaluationError,a,!0)),e.tt.assumptionViolation},$S=t=>e.it(new e.b(`${e.G}Could not find operator: ${t.operator} in module: ${t.module}`),e.tt.error),eC=(t,n,r,i,a,o=[])=>{let s=e=>o.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw $S(e);return{name:e.operator,key:e.key}}),c=SS(t.invariants,n),l=TS(t,n,r,i,a),u=ES(t,n,a),d=t.properties[0],f=d&&Dh(d,n)?.location.range,p=t.specification,m=p&&Dh(p,n)?.location.range;l.isPropertyFairness&&f&&m&&a?.({kind:`warning`,code:Ke.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${d} at ${e.X(f)} equals\nthe fairness constraints of the behavior specification ${p} at ${e.X(m)}.\nTherefore, checking whether ${p} => ${d} using TLC will never result in a violation of ${d}.`});let h=MS([...c,...u.invariants],n),g=[...new Map(h.map(e=>[e.predicate,e])).values()],_=h.length>0||u.actionProperties.length>0||u.liveness.length>0;if(l.init===void 0&&(_||u.initialPredicates.length>0||n.variables.length>0))throw new e._(n.runtime.version===`1.7.4`?Ze:`The configuration file did not specify the initial state predicate.`);if(l.next===void 0&&_)throw new e._(`The configuration file did not specify the next state predicate.`);let ee=DS(`constraint`,[...t.constraints,...s(`constraint`).map(e=>e.name)],n),te=MS(ee,n),v=DS(`action constraint`,t.actionConstraints,n),ne=n.coverage,y=(e,t,r=!0)=>t.flatMap(t=>{if(!ne)return[];let i=r?jS(t.expression,n):t.expression,a=Ga(r?t.name:void 0,i,n),o=Ua(ne,e,a,i,t.scope);return[{expression:i,scope:t.scope,node:o}]}),re=[...y(`invariant`,c),...y(`invariant`,u.invariants,!1)],b=y(`constraint`,v),ie=y(`constraint`,ee),ae=y(`implied`,u.initialPredicates,!1),oe=y(`implied`,u.actionProperties.map(e=>({...e,expression:e.box})),!1),se=(e,t,r,i)=>{try{return ro(e,t.node,()=>W(t.expression,VS(n,r,i,t.scope)))}catch{return}},ce=(e,t,n)=>ne!==void 0&&e.every(e=>se(ne,e,t,n)===!0),x=(e,t,n)=>{if(ne){for(let r of e){let e=se(ne,r,t,n);if(typeof e!=`boolean`)return;if(!e)return ne.primary[r.node]++,!1;ne.secondary[r.node]++}return!0}};t.rlReward!==void 0&&hS(`rlreward`,t.rlReward,n),t.periodic!==void 0&&hS(`periodic`,t.periodic,n);let le=kS(t.possible,n);if(n.variables.length===0)return;let S=t.symmetry===void 0?void 0:sS(t.symmetry,n,t.substitutions),ue=t.view===void 0?void 0:vS(`view function`,t.view,n),de=t.view??s(`view`)[0]?.name,fe=de===void 0?void 0:{name:de,expression:pS(de),scope:void 0},C=u.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:fS};return{...e,unchanged:t}}),w=e=>_x(e.expression,void 0,n)>=2,T=le.filter(e=>!w(e)),E=le.filter(w),pe=n.runtime,me,he=()=>{if(me)return me;let e=i(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return me=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),me},ge=(e,t)=>W(e,VS(n,t,void 0)),_e=e=>{let t=he(),n=S===void 0?e:dS(e,S,t);return Ia(fe===void 0?t.map(e=>n[e]):[ge(fe.expression,n)])},ve=/* @__PURE__ */ new WeakSet,ye=(t,r,i)=>{let a=i&&!ve.has(i)?i:void 0;if(NS(t,r,a))return!1;try{let e=VS(n,r,void 0,t.scope),i=t.membership;return a&&i?!Ci(r[i.variable],a[i.variable],W(i.set,e)):!KS(t,e)}catch(n){throw i?dt(e.it(n,e.tt.safetyEvaluationFailure),Ke.invariantEvaluationFailed,`Evaluating invariant ${t.name} failed.`):n}},D=RS(t,n);pe.getFingerprint=_e;let be=()=>{let t=le.find(e=>!pe.possibleCounts.get(e.name));if(!t)return;let r=OS(t.name,n),i=r?` at ${e.X(r)}`:``;return{name:t.name,code:Ke.possibleUnwitnessed,message:`The _POSSIBLE predicate ${t.name}${i} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:A(L(Wd(pe),!0))}},xe=ue?.body.kind===`Tuple`?ue.body.elements:[],Se=xe.flatMap(e=>e.kind===`Identifier`&&n.variables.includes(e.name)?[e.name]:[]),Ce=ue?.body.kind===`Tuple`&&Se.length===xe.length&&new Set(Se).size===Se.length,we=(e,t)=>Ce?he().filter(e=>Se.includes(n.variables[e])).map(e=>`/\\ ${n.variables[e]} = ${A(L(t[e]))}\n`).join(``):A(L(ge(e,t))),Te=(t,r,i)=>US(t.expression,VS(n,r,i),t=>`${e.G}${GS(t,n)}`),Ee=e=>{let t=Object.fromEntries(he().map(t=>[n.variables[t],e[t]]));return fe===void 0?t:nn(t,()=>we(fe.expression,e))};return{properties:u,spec:l,toRecord:Ee,evaluateAlias:(t,r,i,a)=>{try{vS(`alias`,t,n);let e=W(pS(t),VS(n,r,i)),a=zS(e);return a===void 0?Ee(r):an(a,t)}catch(t){if(!(t instanceof e._||t instanceof e.b))throw t;return{...Ee(r),_ALIASEvalError:ot(t.message,a)}}},isSymmetric:S!==void 0,isConstrained:te.length>0||v.length>0,getTlcOrder:he,getStoredFingerprints:(e,t)=>fe!==void 0||D?BigInt64Array.from(e,_e):La(t,he()),getFingerprintState:e=>{if(D)return[String(_e(e))];let t=S===void 0?e:dS(e,S,he());return fe===void 0?t:[ge(fe.expression,t)]},findViolatedInvariant:(e,t)=>{if(ce(re,e))return;let n=h.find(n=>ye(n,e,t));return n&&ve.add(e),n},getViolatedInvariants:e=>{let t=g.filter(t=>h.some(n=>n.predicate===t.predicate&&ye(n,e,void 0)));return t.length>0&&ve.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>US(n,VS(t,e,void 0,r));te.every(e=>r(e.predicate,e.scope))&&n();let i=g.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=u.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(te.every(e=>US(e.predicate,VS(n,t,void 0,e.scope)))&&v.every(r=>US(r.expression,VS(n,e,t,r.scope))))||r())||g.every(e=>US(e.predicate,VS(n,t,void 0,e.scope))))&&C.every(r=>US(r.box,VS(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>x(ie,e)??te.every(r=>NS(r,e,t)||KS(r,VS(n,e,void 0))),findFailedInitialPredicate:e=>ce(ae,e)?void 0:u.initialPredicates.find(t=>!US(t.expression,VS(n,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>ce(oe,e,t)?void 0:C.find(r=>{try{return!US(r.action,VS(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${H(r.box)}`)&&!HS(r.unchanged,VS(n,e,t,r.scope),`a subscript`)}catch(e){throw dt(tC(e),Ke.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>x(b,e,t)??v.every(n=>Te(n,e,t)),getExcludingConstraints:(t,r)=>[...te.filter(e=>!KS(e,VS(n,r,void 0))),...v.filter(e=>!Te(e,t,r))].map(t=>{let r=OS(t.name,n);return r?e.X(r):t.name}),trackStatePossible:T.length===0?qS:e=>JS(T,pe,VS(n,e,void 0)),trackActionPossible:E.length===0?qS:(e,t)=>JS(E,pe,VS(n,e,t)),findUnwitnessedPossible:be,getReward:(r,i,a)=>{if(t.rlReward===void 0)return a;let o=pS(t.rlReward),s=W(o,VS(n,r,i));if(typeof s!=`number`)throw new e.b(WS(`integer`,o,n));return s},findPostconditionViolation:(r=!1)=>{let i=s(`postcondition`),a=t.postconditions.map(e=>{let t=Dh(e,n);return t?t.kind===`Operator`&&t.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!gS(t)&&tg(t,n)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(a!==void 0){if(r)return;throw e.it(new e.b(a),e.tt.configParseError)}let o=(t,r)=>{let i=YS(e=>US(pS(r),e),n);if(!i)return;let a=Dh(r,n)?.body,o=OS(r,n),s=o?` at ${a?.kind===`Number`?ah(a):e.X(o)}`:``;return i.message===void 0?{name:t,code:Ke.postconditionFalse,message:`Postcondition ${t}${s} is false.`}:{name:t,code:Ke.postconditionFailed,message:`Evaluating postcondition ${t}${s} failed.\n${i.message}`}};for(let e of i){let t=o(e.name,e.key);if(t)return t}let c=be();if(c)return c;for(let e of t.postconditions){let t=o(e,e);if(t)return t}}}},tC=t=>t instanceof e.O?e.it(t,t.exitCode):t,nC=(e,t)=>e*((t-e)/2**64),rC=e=>e.includes(`.`)?e:`${e}.0`,iC=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return rC(String(e));let[n,r]=e.toExponential().split(`e`);return`${rC(n)}E${r.replace(`+`,``)}`},aC=e=>e!==void 0&&e>=`0`&&e<=`9`,oC=e=>{if(e===0)return`0.0`;let t=iC(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;aC(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;aC(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;aC(t[n])&&r<2;)i+=t[n++],r++;for(aC(t[n])&&Number(t[n])>=5&&(i=sC(i));aC(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},sC=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${sC(r)}.`:n===`9`?`${sC(r)}0`:`${r}${Number(n)+1}`},cC=e=>{let t=0;for(;10n**BigInt(t+1)<e*10n;)t++;let n=10n**BigInt(t+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t+1}`)},lC=(e,t,n)=>{if(nC(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a=1/0,o=9223372036854775807n;for(let e=1;e<r.length;e++){let t=i[2*e+1],n=i[2*e-1];if(t<0!=n<0)continue;let s=t-n;if(s<=1048576){let t=s*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a=Math.min(a,t)}else{let t=r[e]-r[e-1];t<o&&(o=t)}}if(a===1/0)return o;let s=BigInt(a);return s<o?s:o},uC=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a=0,o=n.find(t=>(a+=e[t],a>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},dC=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},fC=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^qi(e[t]),16777619),r=Math.imul(r^$i(e[t]),1540483477);t[0]=dC(n)||1,t[1]=dC(r)},pC=()=>{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)}}},mC=(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}},hC=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),gC=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return mC(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},_C=e=>Atomics.load(e.used,0)*2>=e.slots.length,vC=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&mC(t,n);return{slots:t,used:e.used}},yC=[void 0,`lambda`,`tuple`,`record`],bC=()=>{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=Pi(e.domain);return t?(a(7),a(yC.indexOf(En(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(yC.indexOf(En(e))),a(e.domain.length),e.domain.every(s)&&e.range.every(s))}return!1};return{encode:e=>{let r=t;return e.every(s)?(n++,!0):(t=r,!1)},finish:()=>({words:e.slice(0,t),strings:r,count:n})}},xC=e=>t=>{let n=t.words,r=0,i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r++];if(e===3)return t.strings[n[r++]];if(e===4)return yn(t.strings[n[r++]]);if(e===5)return xn(i(n[r++]));let a=yC[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=Mr({kind:`Interval`,low:e,high:e+t-1});return Tn(Cn(o,i(t)),a)}let o=n[r++],s=i(o);return Tn(Cn(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return Zm}}),Object.defineProperty(exports,"$t",{enumerable:!0,get:function(){return Be}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return Sx}}),Object.defineProperty(exports,"At",{enumerable:!0,get:function(){return Ki}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return Cy}}),Object.defineProperty(exports,"Bt",{enumerable:!0,get:function(){return qe}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Zx}}),Object.defineProperty(exports,"Ct",{enumerable:!0,get:function(){return zn}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return $x}}),Object.defineProperty(exports,"Dt",{enumerable:!0,get:function(){return L}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Yx}}),Object.defineProperty(exports,"Et",{enumerable:!0,get:function(){return ha}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return ux}}),Object.defineProperty(exports,"Ft",{enumerable:!0,get:function(){return In}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return Pg}}),Object.defineProperty(exports,"Gt",{enumerable:!0,get:function(){return ct}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return Oy}}),Object.defineProperty(exports,"Ht",{enumerable:!0,get:function(){return at}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return Bb}}),Object.defineProperty(exports,"It",{enumerable:!0,get:function(){return Nn}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return Dg}}),Object.defineProperty(exports,"Jt",{enumerable:!0,get:function(){return _t}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return H}}),Object.defineProperty(exports,"Kt",{enumerable:!0,get:function(){return nt}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return sx}}),Object.defineProperty(exports,"Lt",{enumerable:!0,get:function(){return Yt}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return xx}}),Object.defineProperty(exports,"Mt",{enumerable:!0,get:function(){return Tt}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return Fb}}),Object.defineProperty(exports,"Nt",{enumerable:!0,get:function(){return Zt}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return Dx}}),Object.defineProperty(exports,"Ot",{enumerable:!0,get:function(){return Xt}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return Nb}}),Object.defineProperty(exports,"Pt",{enumerable:!0,get:function(){return qi}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return Jm}}),Object.defineProperty(exports,"Qt",{enumerable:!0,get:function(){return k}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return Db}}),Object.defineProperty(exports,"Rt",{enumerable:!0,get:function(){return en}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return tC}}),Object.defineProperty(exports,"St",{enumerable:!0,get:function(){return Ri}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Jx}}),Object.defineProperty(exports,"Tt",{enumerable:!0,get:function(){return Fr}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return Dy}}),Object.defineProperty(exports,"Ut",{enumerable:!0,get:function(){return ot}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return Ty}}),Object.defineProperty(exports,"Vt",{enumerable:!0,get:function(){return Xe}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return Wv}}),Object.defineProperty(exports,"Wt",{enumerable:!0,get:function(){return lt}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return qm}}),Object.defineProperty(exports,"Xt",{enumerable:!0,get:function(){return ft}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return Eg}}),Object.defineProperty(exports,"Yt",{enumerable:!0,get:function(){return rt}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return Ym}}),Object.defineProperty(exports,"Zt",{enumerable:!0,get:function(){return vt}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return BS}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return Ba}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return vC}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return Ef}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return bS}}),Object.defineProperty(exports,"bt",{enumerable:!0,get:function(){return Ia}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return fC}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return vf}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return lC}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return yd}}),Object.defineProperty(exports,"en",{enumerable:!0,get:function(){return ze}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return Xm}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return nC}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return Cd}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return XS}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return oo}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return eC}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return $a}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return hC}}),Object.defineProperty(exports,"in",{enumerable:!0,get:function(){return ae}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return qp}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return Cx}}),Object.defineProperty(exports,"jt",{enumerable:!0,get:function(){return bn}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return dx}}),Object.defineProperty(exports,"kt",{enumerable:!0,get:function(){return Gi}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return oC}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return Kd}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return $S}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return Ua}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return bC}}),Object.defineProperty(exports,"nn",{enumerable:!0,get:function(){return ye}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return Gp}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return gC}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return Tf}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return uC}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return Cs}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return Dh}}),Object.defineProperty(exports,"qt",{enumerable:!0,get:function(){return xt}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return pC}}),Object.defineProperty(exports,"rn",{enumerable:!0,get:function(){return ne}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return Kp}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return _C}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return Df}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return xC}}),Object.defineProperty(exports,"tn",{enumerable:!0,get:function(){return De}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return Jp}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return cC}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return Yd}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return ZS}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return Ga}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Qx}}),Object.defineProperty(exports,"wt",{enumerable:!0,get:function(){return yn}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return xS}}),Object.defineProperty(exports,"xt",{enumerable:!0,get:function(){return Ma}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return QS}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return yo}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return db}}),Object.defineProperty(exports,"zt",{enumerable:!0,get:function(){return Ke}});
|
|
1796
|
+
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw e.at(new e.v(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${n}`),e.nt.safetyEvaluationFailure)}return[NE(t)]})},UE=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>UE(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Vb(e.name,t);if(n?.kind===`Operator`&&n.params.length===0&&gx(n,t)===void 0)return UE(n.body,t)}return[e]},WE=(t,n,r)=>{let i=t.expression;if(i.kind!==`Identifier`||IC(i,t.scope,n)>0)return!1;let a=$(i,cD(n,void 0,void 0,t.scope));if(a===!1)throw new e.v(`The spec is trivially false because ${i.name} is false.`);if(a!==!0)throw new e.v(`The operator ${i.name}, which equals ${q(a)},\ncannot be used as a ${r}`);return!0},GE=(t,n,r,i,a)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return RE(t,e,n),ME(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[],isPropertyFairness:!1}}if(t.init!==void 0||t.next!==void 0)throw new e.v(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let o=[],s=[],c=[],l=n.constants.has(t.specification)?n.constants.get(t.specification):LE(t.specification,FE(`name`,t.specification,n),n);if(l!==void 0)throw new e.v(`The value of ${t.specification} is equal to ${q(l)}`);let u=FE(`name`,t.specification,n),d=t.properties.length===1?t.properties[0]:void 0,f=!1;RC(u.body,void 0,n,!1).forEach(t=>{let l=t.expression,u=t.path.some(e=>{let t=Vb(e,n);return t?.kind===`Operator`&&IC(t.body,void 0,n)===1});if(!u&&WE(t,n,`spec`))return;let p=l.kind===`Identifier`&&!A(l)?n.variableIndex.get(l.name):void 0;if(!u&&l.kind===`Identifier`&&p!==void 0){let t=r[p].range;throw new e.v(`The operator ${l.name}, which equals ${t?e.X(t):l.name},\ncannot be used as a spec`)}if(l.kind===`UnboundedQuantifier`&&l.isTemporal)throw e.at(new e.v(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.nt.error);if(l.kind===`Always`&&l.expression.kind===`BoxAction`){let r=mw(l.expression.subscript,t.scope,n);if(r===void 0&&a?.({kind:`warning`,code:_o.subscriptUndetermined,text:`TLC could not determine if the subscript of the next-state relation contains
|
|
1797
|
+
all state variables. Proceed with fingers crossed.`}),i().filter(e=>r!==void 0&&!r.includes(e)).forEach(e=>a?.({kind:`warning`,code:_o.subscriptMissingVariable,text:`The subscript of the next-state relation specified by the specification\ndoes not seem to contain the state variable ${e}`})),s.length>0)throw new e.v(`The specification contains more than one conjunct of the form [][Next]_v,
|
|
1798
|
+
but TLC can handle only specifications with one next-state relation.`);s.push({expression:l.expression.action,scope:t.scope});return}if(l.kind===`Always`&&l.expression.kind!==`Let`&&l.expression.kind!==`Label`&&IC(l.expression,t.scope,n)<2)throw e.at(new e.x(`TLC cannot handle the temporal formula ${Q(l.expression)}`),e.nt.error);let m=IC(l,t.scope,n);if(m===3)d!==void 0&&t.path.includes(d)||(f=!0),c.push(t);else{if(m===2)throw new e.v(`TLC cannot handle this conjunct of the spec:\n${Q(l)}`);o.push(t)}});let p=[...o,...s],m=e=>`$specification${e}`,h=p.reduce((e,t,n)=>t.scope===void 0?e:{name:m(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),g=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:m(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:o.length===0?void 0:{kind:`And`,operands:o.map(g),location:jE},next:s.length===0?void 0:g(s[0],o.length),scope:h,temporals:c,isPropertyFairness:c.length>0&&!f}},KE=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=zE(`property`,t,n);if(!a)return;IC(a.body,void 0,n)===1&&r?.({kind:`state-level-property`,name:t});let o=n.runtime.version!==`1.7.4`;RC(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(WE(r,n,`property`))return;let o=r.name??t;if(a.kind===`Always`&&a.expression.kind===`BoxAction`){i.actionProperties.push({name:o,box:a.expression,action:a.expression.action,subscript:a.expression.subscript,scope:r.scope});return}if(a.kind===`Always`&&IC(a.expression,r.scope,n)<=1){let e=a.expression,t=e.kind===`Identifier`&&!A(e)?Vb(e.name,n):void 0;i.invariants.push({name:t?.name??(e.kind===`Identifier`?e.name:o),expression:e,scope:r.scope});return}let s=IC(a,r.scope,n);if(s<2)i.initialPredicates.push({name:o,expression:a,scope:r.scope});else{if(s===2){let t=Q(a),n=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,r=a.kind===`BoxAction`?`To check that action ${o} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${t} (compare page 90 of ${n}).`:a.kind===`AngleAction`?`To check that infinitely many ${o} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${t} (compare page 91 of ${n}).`:`To check that action ${o} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${t}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${n}).`;throw new e.v(`The formula ${o} at ${t} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${r}`)}i.liveness.push({name:t,expression:a,scope:r.scope})}})}),i},qE=e=>{let t=[],n=/* @__PURE__ */ new Set,r=e=>{if(e===void 0||n.has(e))return!0;n.add(e);let i=e.binding;return i.kind===`Thunk`?(t.push(i.expression),r(i.scope)&&r(e.parent)):i.kind===`Operator`?i.operator.kind===`Closure`&&(t.push(i.operator.body),r(i.operator.scope)&&r(e.parent)):r(e.parent)};return r(e)?t:void 0},JE=(e,t,n)=>t.flatMap(t=>zE(e,t,n)?[NE(t)]:[]),YE=(e,t)=>{let n=Vb(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},XE=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e.v(`_POSSIBLE lists ${r} more than once`);RE(`possible`,r,n);let a=NE(r);if(IC(a.expression,void 0,n)===3)throw new e.v(`The possible of ${r} is equal to a temporal formula; only state- and action-level predicates are supported`);return a}),ZE=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||A(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},QE=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=Vb(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},$E=(e,t)=>e.flatMap(e=>{let n=QE(e.expression,t);return(e.scope===void 0&&vh(n,t)===void 0?[n]:UE(e.expression,t)).map(r=>{let i=e.scope===void 0?vh(r,t):void 0;return{name:e.name,expression:r,scope:e.scope,variables:i,membership:ZE(r,i,t),predicate:n}})}),eD=(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},tD=/[\u0100-\uffff]/,nD=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),rD=e=>e.kind===`String`?tD.test(e.value):e.kind===`Set`&&e.elements.some(rD),iD=(e,t)=>{if(e.kind===`Selection`){if(t.has(e.expression))return!1;t.add(e.expression)}return e.kind===`String`&&tD.test(e.value)||e.kind===`Apply`&&nD.has(e.operator)||Ue(e).some(e=>iD(e,t))},aD=(e,t)=>{let n=/* @__PURE__ */ new Set;return e.constants.some(e=>rD(e.value)||(e.args??[]).some(rD))||[...t.definitions.values()].some(e=>iD(e.body,n)||e.kind===`Function`&&e.bounds.some(e=>iD(e.set,n)))},oD=e=>{if(!as(e))return;let t=ps(K(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},sD=(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`},cD=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),lD=(e,t,n)=>Ib($(e,t),n),uD=(t,n,r=fD)=>{let i=$(t,n);if(typeof i!=`boolean`)throw new e.x(r(t,n.environment));return i},dD=(t,n,r)=>{let i=n.kind===`Identifier`?Vb(n.name,r):void 0,a=i?.kind===`Operator`?i.body:n,o=i?.kind===`Operator`?i.bodyRange:void 0;return`TLC expected a ${t} value, but did not find one. ${o&&a.kind!==`Number`?e.X(o):yb(a)}`},fD=(e,t)=>dD(`boolean`,e,t),pD=(e,t)=>uD(e.expression,t,(n,r)=>(e.predicate!==e.expression&&uD(e.predicate,t),fD(n,r))),mD=()=>{},hD=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=lD(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),gD=(t,n)=>{try{return t(cD(n,void 0,void 0))?void 0:{message:void 0}}catch(t){if(t instanceof e.x)return{message:t.message};throw t}},_D=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=gD(e=>Bb($(n.expression,e),n.expression),t);if(e)return{name:yb(n.expression),trace:[],message:e.message}}},vD=(e,t,n,r=!1)=>{let i=iE(t.source,t.loadModule);return Es(i.getStringOrder(e,(t.runtimeInvariants??[]).flatMap(e=>e.module??[]))),js(t),ad(t.fingerprintPolynomial??0),r&&Ds(),{order:i,specification:vE(e,{source:t.source,loadModule:t.loadModule,order:i,loadClass:t.loadClass,print:n,files:{readFile:t.readFile,writeFile:t.writeFile,makeDirectory:t.makeDirectory},seed:t.seed,isTool:t.isTool,traceFile:t.traceSpec?.traceFile,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version,moduleOperators:t.moduleOperators,readLine:t.readLine,runtimeInvariants:t.runtimeInvariants})}},yD=e=>{let t=typeof e.config==`string`?ze(e.config,e.version):e.config,n=vD(t,e,e.onPrint??console.log),r=n.specification;VE(r,t,e.onProgress);let i=e.coverage===void 0?void 0:Cd(r.environment.variables.length),a=i?wd(r.environment,i):r.environment,o,s=()=>o??=pw(t,a,r.instanceActions);a.runtime.getSpecification=()=>vw(s(),t,a,r.variableLocations);let c=TD(t,a,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators,r.runtimeInvariants);return{config:t,specification:r,environment:a,search:c,getDescription:s,coverage:i,getCoverage:()=>i&&_f(i,a,r.variableLocations,c?.getTlcOrder()??[])}},bD=/* @__PURE__ */ Error(`The walk stopped`),xD=(e,t,n)=>{let r=(n,r)=>r.map(r=>({...r,node:Od(e,n,Ad(r.name,r.expression,t),r.expression,r.scope)})),i=r(`init`,n.inits),a=r(`next`,n.actions);return zd(e,t,sy(a,t)),{inits:i,actions:a}},SD=(e,t,n,r,i,a=(e,t)=>{throw cb(e,t,r)},o)=>oy(t,t.node,n,r,n=>{e.primary[t.node]++,i(n)},n=>(e.primary[t.node]++,a(n,t.name),!0),o),CD=(t,n,r)=>{let i=_D(t,n);if(!i)return;if(i.message===void 0){let t=`Assumption ${i.name} is false.`;return r(_o.assumptionFalse,t,t),e.nt.assumptionViolation}let a=`Evaluating assumption ${i.name} failed.\n${i.message}`;return r(_o.assumptionEvaluationError,a,Ao(_o.assumptionEvaluationError,a,!0)),e.nt.assumptionViolation},wD=t=>e.at(new e.x(`${e.K}Could not find operator: ${t.operator} in module: ${t.module}`),e.nt.error),TD=(t,n,r,i,a,o=[],s=[])=>{let c=e=>o.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw wD(e);return{name:e.operator,key:e.key}}),l=HE(t.invariants,n),u=GE(t,n,r,i,a),d=KE(t,n,a),f=t.properties[0],p=f&&Vb(f,n)?.location.range,m=t.specification,h=m&&Vb(m,n)?.location.range;u.isPropertyFairness&&p&&h&&a?.({kind:`warning`,code:_o.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${f} at ${e.X(p)} equals\nthe fairness constraints of the behavior specification ${m} at ${e.X(h)}.\nTherefore, checking whether ${m} => ${f} using TLC will never result in a violation of ${f}.`});let g=$E([...l,...d.invariants],n),_=g.length>0||d.actionProperties.length>0||d.liveness.length>0;if(u.init===void 0&&(_||d.initialPredicates.length>0||n.variables.length>0))throw new e.v(n.runtime.version===`1.7.4`?So:`The configuration file did not specify the initial state predicate.`);if(u.next===void 0&&_)throw new e.v(`The configuration file did not specify the next state predicate.`);let v=$E(s.map(e=>{let t=Vb(e.name,n);return{name:e.name,expression:t?.kind===`Operator`?t.body:ME(e.name),scope:void 0}}),n),ee=[...g,...v],y=[...new Map(ee.map(e=>[e.predicate,e])).values()],b=JE(`constraint`,[...t.constraints,...c(`constraint`).map(e=>e.name)],n),x=$E(b,n),te=JE(`action constraint`,t.actionConstraints,n),S=n.coverage,ne=(e,t,r=!0)=>t.flatMap(t=>{if(!S)return[];let i=r?QE(t.expression,n):t.expression,a=Ad(r?t.name:void 0,i,n),o=Od(S,e,a,i,t.scope);return[{expression:i,scope:t.scope,node:o}]}),re=[...ne(`invariant`,l),...ne(`invariant`,d.invariants,!1)],ie=new Map([...l,...d.invariants].map((e,t)=>[QE(e.expression,n),re[t]])),ae=ne(`constraint`,te),C=ne(`constraint`,b),oe=new Map(C.map(e=>[e.expression,e])),w=[...new Map(x.map(e=>[e.predicate,e])).values()],se=ne(`implied`,d.initialPredicates,!1),ce=ne(`implied`,d.actionProperties.map(e=>({...e,expression:e.box})),!1),le=(e,t,r,i)=>{try{return Ud(e,t.node,()=>$(t.expression,cD(n,r,i,t.scope)))}catch{return}},ue=(e,t,n)=>S&&e?Ud(S,e.node,()=>uD(e.expression,n)):uD(t,n),T=(e,t,n)=>{if(S){for(let r of e){let e=le(S,r,t,n);if(typeof e!=`boolean`)return;if(!e)return S.primary[r.node]++,!1;S.secondary[r.node]++}return!0}};t.rlReward!==void 0&&FE(`rlreward`,t.rlReward,n),t.periodic!==void 0&&FE(`periodic`,t.periodic,n);let E=XE(t.possible,n);if(n.variables.length===0)return;let D=t.symmetry===void 0?void 0:EE(t.symmetry,n,t.substitutions),de=t.view===void 0?void 0:RE(`view function`,t.view,n),O=t.view??c(`view`)[0]?.name,fe=O===void 0?void 0:NE(O),pe=d.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:jE};return{...e,unchanged:t}}),me=e=>IC(e.expression,void 0,n)>=2,he=E.filter(e=>!me(e)),ge=E.filter(me),_e=n.runtime,ve,k=()=>{if(ve)return ve;let e=i(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return ve=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),ve},ye=(e,t)=>$(e,cD(n,t,void 0)),be=e=>(fe!==void 0&&e.forEach(Lc),D===void 0?e:AE(e,D,k())),xe=e=>{let t=be(e);return _d(fe===void 0?k().map(e=>t[e]):[ye(fe.expression,t)])},Se=e=>d.initialPredicates.find((t,r)=>{let i=S&&le(S,se[r],e,void 0);return typeof i==`boolean`?!i:!uD(t.expression,cD(n,e,void 0,t.scope))}),Ce=/* @__PURE__ */ new WeakSet,we=(t,r,i)=>{let a=i&&!Ce.has(i)?i:void 0;if(eD(t,r,a))return!1;try{let e=cD(n,r,void 0,t.scope),i=t.membership;return a&&i?!Jl(r[i.variable],a[i.variable],$(i.set,e)):!pD(t,e)}catch(n){throw i?Io(e.at(n,e.nt.safetyEvaluationFailure),_o.invariantEvaluationFailed,`Evaluating invariant ${t.name} failed.`):n}},Te=(e,t,n)=>{let r=ie.get(e.predicate),i=S&&r?le(S,r,t,void 0):void 0;return typeof i==`boolean`?!i:ee.some(r=>r.predicate===e.predicate&&we(r,t,n))},Ee=aD(t,n);_e.getFingerprint=xe;let De=()=>{let t=E.find(e=>!_e.possibleCounts.get(e.name));if(!t)return;let r=YE(t.name,n),i=r?` at ${e.X(r)}`:``;return{name:t.name,code:_o.possibleUnwitnessed,message:`The _POSSIBLE predicate ${t.name}${i} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:U(q(l_(_e),!0))}},Oe=de?.body.kind===`Tuple`?de.body.elements:[],ke=Oe.flatMap(e=>e.kind===`Identifier`&&n.variables.includes(e.name)?[e.name]:[]),Ae=de?.body.kind===`Tuple`&&ke.length===Oe.length&&new Set(ke).size===ke.length,je=(e,t)=>Ae?k().filter(e=>ke.includes(n.variables[e])).map(e=>`/\\ ${n.variables[e]} = ${U(q(t[e]))}\n`).join(``):U(q(ye(e,t))),Me=(t,r,i)=>uD(t.expression,cD(n,r,i),t=>`${e.K}${fD(t,n)}`),Ne=e=>{let t=Object.fromEntries(k().map(t=>[n.variables[t],e[t]]));return fe===void 0?t:Ns(t,()=>je(fe.expression,e))};return _e.toRecord=Ne,{properties:d,spec:u,toRecord:Ne,evaluateAlias:(t,r,i,a)=>{let o=()=>Ne(r.map(e=>e??Ys(`null`)));try{RE(`alias`,t,n);let e=$(ME(t),cD(n,r,i)),a=oD(e);return a===void 0?o():Fs(a,t)}catch(t){if(!(t instanceof e.v||t instanceof e.x))throw t;return{...o(),_ALIASEvalError:jo(t.message,a)}}},isSymmetric:D!==void 0,isConstrained:x.length>0||te.length>0,getTypedChecks:e=>{if(S!==void 0||E.length>0||t.periodic!==void 0||[...ee,...x].some(e=>e.scope!==void 0)||te.length>0||d.actionProperties.some(e=>e.scope!==void 0)||d.liveness.length>0&&(e===void 0||fe!==void 0)||u.init===void 0||u.next===void 0)return;let r=y.map(e=>e.predicate),i=[...new Set(x.map(e=>e.predicate))],a=d.initialPredicates.map(e=>e.expression),o=[...n.facts.ids.keys()],s=qE(u.scope),c=e=>gx(e,n)===void 0&&mh(e,n,`replayed`);return(s===void 0?o.some(c):o.some(e=>!(e.kind===`Operator`&&e.params.length>0)&&uh(e,n)&&c(e))||ph([u.init,u.next,...r,...i,...a,...d.actionProperties.flatMap(e=>[e.action,e.subscript]),...fe?[fe.expression]:[],...s,...qw(e??[])],n,`replayed`))?void 0:{init:u.init,next:u.next,scope:u.scope,invariants:r,constraints:i,holdsInitialPredicates:e=>Se(e)===void 0,actionProperties:d.actionProperties,symmetry:D,view:fe?.expression,variableOrder:k(),liveness:e}},getTlcOrder:k,getStoredFingerprints:(e,t)=>fe!==void 0||Ee?BigInt64Array.from(e,xe):yd(t,k()),getFingerprintState:e=>{if(Ee)return[String(xe(e))];let t=be(e);return fe===void 0?t:[ye(fe.expression,t)]},findViolatedInvariant:(e,t)=>{let n=S===void 0?ee.find(n=>we(n,e,t)):y.find(n=>Te(n,e,t));return n&&Ce.add(e),n},forEachViolatedInvariant:(e,t)=>{for(let n of y)Te(n,e,void 0)&&(Ce.add(e),t(n))},checkReplayedInitialState:(e,t,n,r)=>{let i=(n,r,i)=>ue(n,r,cD(t,e,void 0,i));w.every(e=>i(oe.get(e.predicate),e.predicate,e.scope))&&n();for(let e of y)i(ie.get(e.predicate),e.predicate,e.scope)||r({status:`invariant-violation`,name:e.name});let a=d.initialPredicates.find((e,t)=>!i(se[t],e.expression,e.scope));a&&r({status:`liveness-violation`,name:a.name})},checkReplayedSuccessor:(e,t,n,r)=>(!(!(w.every(e=>ue(oe.get(e.predicate),e.predicate,cD(n,t,void 0,e.scope)))&&te.every((r,i)=>ue(ae[i],r.expression,cD(n,e,t,r.scope))))||r())||y.every(e=>ue(ie.get(e.predicate),e.predicate,cD(n,t,void 0,e.scope))))&&pe.every((r,i)=>ue(ce[i],r.box,cD(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>T(C,e)??x.every(r=>eD(r,e,t)||pD(r,cD(n,e,void 0))),findFailedInitialPredicate:Se,findViolatedActionProperty:(e,t)=>pe.find((r,i)=>{let a=S&&le(S,ce[i],e,t);if(typeof a==`boolean`)return!a;try{return!uD(r.action,cD(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Q(r.box)}`)&&!lD(r.unchanged,cD(n,e,t,r.scope),`a subscript`)}catch(e){throw Io(ED(e),_o.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>T(ae,e,t)??te.every(n=>Me(n,e,t)),getExcludingConstraints:(t,r)=>[...x.filter(e=>!pD(e,cD(n,r,void 0))),...te.filter(e=>!Me(e,t,r))].map(t=>{let r=YE(t.name,n);return r?e.X(r):t.name}),trackStatePossible:he.length===0?mD:e=>hD(he,_e,cD(n,e,void 0)),trackActionPossible:ge.length===0?mD:(e,t)=>hD(ge,_e,cD(n,e,t)),findUnwitnessedPossible:De,getReward:(r,i,a)=>{if(t.rlReward===void 0)return a;let o=ME(t.rlReward),s=$(o,cD(n,r,i));if(typeof s!=`number`)throw new e.x(dD(`integer`,o,n));return s},findPostconditionViolation:(r=!1)=>{let i=c(`postcondition`),a=t.postconditions.map(e=>{let t=Vb(e,n);return t?t.kind===`Operator`&&t.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!IE(t)&&gx(t,n)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(a!==void 0){if(r)return;throw e.at(new e.x(a),e.nt.configParseError)}let o=(t,r)=>{let i=gD(e=>uD(ME(r),e),n);if(!i)return;let a=Vb(r,n)?.body,o=YE(r,n),s=o?` at ${a?.kind===`Number`?yb(a):e.X(o)}`:``;return i.message===void 0?{name:t,code:_o.postconditionFalse,message:`Postcondition ${t}${s} is false.`}:{name:t,code:_o.postconditionFailed,message:`Evaluating postcondition ${t}${s} failed.\n${i.message}`}};for(let e of i){let t=o(e.name,e.key);if(t)return t}let s=De();if(s)return s;for(let e of t.postconditions){let t=o(e,e);if(t)return t}}}},ED=t=>t instanceof e.A?e.at(t,t.exitCode):t,DD=(e,t)=>e*((t-e)/2**64),OD=e=>e.includes(`.`)?e:`${e}.0`,kD=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return OD(String(e));let[n,r]=e.toExponential().split(`e`);return`${OD(n)}E${r.replace(`+`,``)}`},AD=e=>e!==void 0&&e>=`0`&&e<=`9`,jD=e=>{if(e===0)return`0.0`;let t=kD(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;AD(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;AD(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;AD(t[n])&&r<2;)i+=t[n++],r++;for(AD(t[n])&&Number(t[n])>=5&&(i=MD(i));AD(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},MD=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${MD(r)}.`:n===`9`?`${MD(r)}0`:`${r}${Number(n)+1}`},ND=e=>{let t=0;for(;10n**BigInt(t+1)<e*10n;)t++;let n=10n**BigInt(t+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t+1}`)},PD=(e,t,n)=>{if(DD(e,t)<1e-10)return;let r=1/0,i=9223372036854775807n,a;if(n(e=>{if(e.length===0)return;let t=e.sort();if(a!==void 0&&a<0n==t[0]<0n){let e=t[0]-a;e<i&&(i=e)}a=t[t.length-1];let n=new Int32Array(t.buffer,t.byteOffset,t.length*2);for(let e=1;e<t.length;e++){let a=n[2*e+1],o=n[2*e-1];if(a<0!=o<0)continue;let s=a-o;if(s<=1048576){let t=s*4294967296+(n[2*e]>>>0)-(n[2*e-2]>>>0);r=Math.min(r,t)}else{let n=t[e]-t[e-1];n<i&&(i=n)}}}),r===1/0)return i;let o=BigInt(r);return o<i?o:i},FD=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a=0,o=n.find(t=>(a+=e[t],a>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},ID=[void 0,`lambda`,`tuple`,`record`],LD=()=>{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=su(e.domain);return t?(a(7),a(ID.indexOf(nc(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(ID.indexOf(nc(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})}},RD=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 Ys(t.strings[n[r++]]);if(e===5)return Zs(i(n[r++]));let a=ID[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=rl({kind:`Interval`,low:e,high:e+t-1});return tc($s(o,i(t)),a)}let o=n[r++],s=i(o);return tc($s(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return ob}}),Object.defineProperty(exports,"$n",{enumerable:!0,get:function(){return j}}),Object.defineProperty(exports,"$t",{enumerable:!0,get:function(){return uc}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return vw}}),Object.defineProperty(exports,"An",{enumerable:!0,get:function(){return zr}}),Object.defineProperty(exports,"At",{enumerable:!0,get:function(){return hc}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return LS}}),Object.defineProperty(exports,"Bn",{enumerable:!0,get:function(){return kn}}),Object.defineProperty(exports,"Bt",{enumerable:!0,get:function(){return q}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Qw}}),Object.defineProperty(exports,"Cn",{enumerable:!0,get:function(){return ui}}),Object.defineProperty(exports,"Ct",{enumerable:!0,get:function(){return pd}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return gw}}),Object.defineProperty(exports,"Dn",{enumerable:!0,get:function(){return qr}}),Object.defineProperty(exports,"Dt",{enumerable:!0,get:function(){return Jo}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Kw}}),Object.defineProperty(exports,"En",{enumerable:!0,get:function(){return Xr}}),Object.defineProperty(exports,"Et",{enumerable:!0,get:function(){return _d}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return FS}}),Object.defineProperty(exports,"Fn",{enumerable:!0,get:function(){return Wn}}),Object.defineProperty(exports,"Ft",{enumerable:!0,get:function(){return $s}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return Q}}),Object.defineProperty(exports,"Gn",{enumerable:!0,get:function(){return Mn}}),Object.defineProperty(exports,"Gt",{enumerable:!0,get:function(){return Zo}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return VS}}),Object.defineProperty(exports,"Hn",{enumerable:!0,get:function(){return An}}),Object.defineProperty(exports,"Ht",{enumerable:!0,get:function(){return yu}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return zS}}),Object.defineProperty(exports,"In",{enumerable:!0,get:function(){return Sn}}),Object.defineProperty(exports,"It",{enumerable:!0,get:function(){return sl}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return Vb}}),Object.defineProperty(exports,"Jn",{enumerable:!0,get:function(){return Fn}}),Object.defineProperty(exports,"Jt",{enumerable:!0,get:function(){return W}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return $}}),Object.defineProperty(exports,"Kn",{enumerable:!0,get:function(){return Tn}}),Object.defineProperty(exports,"Kt",{enumerable:!0,get:function(){return Cl}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return IS}}),Object.defineProperty(exports,"Ln",{enumerable:!0,get:function(){return zn}}),Object.defineProperty(exports,"Lt",{enumerable:!0,get:function(){return Zs}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return AC}}),Object.defineProperty(exports,"Mn",{enumerable:!0,get:function(){return Vr}}),Object.defineProperty(exports,"Mt",{enumerable:!0,get:function(){return Ys}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return PS}}),Object.defineProperty(exports,"Nn",{enumerable:!0,get:function(){return Wr}}),Object.defineProperty(exports,"Nt",{enumerable:!0,get:function(){return ol}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return _w}}),Object.defineProperty(exports,"On",{enumerable:!0,get:function(){return Gr}}),Object.defineProperty(exports,"Ot",{enumerable:!0,get:function(){return Ks}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return US}}),Object.defineProperty(exports,"Pn",{enumerable:!0,get:function(){return Ur}}),Object.defineProperty(exports,"Pt",{enumerable:!0,get:function(){return Hc}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return cb}}),Object.defineProperty(exports,"Qn",{enumerable:!0,get:function(){return yn}}),Object.defineProperty(exports,"Qt",{enumerable:!0,get:function(){return G}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return KS}}),Object.defineProperty(exports,"Rn",{enumerable:!0,get:function(){return Bn}}),Object.defineProperty(exports,"Rt",{enumerable:!0,get:function(){return al}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return kE}}),Object.defineProperty(exports,"Sn",{enumerable:!0,get:function(){return ni}}),Object.defineProperty(exports,"St",{enumerable:!0,get:function(){return dd}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Xw}}),Object.defineProperty(exports,"Tn",{enumerable:!0,get:function(){return fi}}),Object.defineProperty(exports,"Tt",{enumerable:!0,get:function(){return cd}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return NS}}),Object.defineProperty(exports,"Un",{enumerable:!0,get:function(){return Rn}}),Object.defineProperty(exports,"Ut",{enumerable:!0,get:function(){return Qo}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return GS}}),Object.defineProperty(exports,"Vn",{enumerable:!0,get:function(){return Dn}}),Object.defineProperty(exports,"Vt",{enumerable:!0,get:function(){return vu}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return Yx}}),Object.defineProperty(exports,"Wn",{enumerable:!0,get:function(){return On}}),Object.defineProperty(exports,"Wt",{enumerable:!0,get:function(){return Xs}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return Vx}}),Object.defineProperty(exports,"Xn",{enumerable:!0,get:function(){return In}}),Object.defineProperty(exports,"Xt",{enumerable:!0,get:function(){return lc}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return gx}}),Object.defineProperty(exports,"Yn",{enumerable:!0,get:function(){return Ln}}),Object.defineProperty(exports,"Yt",{enumerable:!0,get:function(){return fc}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return CS}}),Object.defineProperty(exports,"Zn",{enumerable:!0,get:function(){return Cn}}),Object.defineProperty(exports,"Zt",{enumerable:!0,get:function(){return Lc}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return CD}}),Object.defineProperty(exports,"_n",{enumerable:!0,get:function(){return ii}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return ph}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return PD}}),Object.defineProperty(exports,"an",{enumerable:!0,get:function(){return Po}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return iy}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return SD}}),Object.defineProperty(exports,"bn",{enumerable:!0,get:function(){return ci}}),Object.defineProperty(exports,"bt",{enumerable:!0,get:function(){return wd}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return bD}}),Object.defineProperty(exports,"cn",{enumerable:!0,get:function(){return Ko}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return I_}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return wD}}),Object.defineProperty(exports,"dn",{enumerable:!0,get:function(){return Lo}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return d_}}),Object.defineProperty(exports,"en",{enumerable:!0,get:function(){return _o}}),Object.defineProperty(exports,"er",{enumerable:!0,get:function(){return Ue}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return lb}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return TD}}),Object.defineProperty(exports,"fn",{enumerable:!0,get:function(){return Uo}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return h_}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return yD}}),Object.defineProperty(exports,"gn",{enumerable:!0,get:function(){return oi}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return uh}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return sD}}),Object.defineProperty(exports,"hn",{enumerable:!0,get:function(){return Jr}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return Hg}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return ND}}),Object.defineProperty(exports,"in",{enumerable:!0,get:function(){return jo}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return ub}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return qC}}),Object.defineProperty(exports,"jn",{enumerable:!0,get:function(){return Rr}}),Object.defineProperty(exports,"jt",{enumerable:!0,get:function(){return Jc}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return pw}}),Object.defineProperty(exports,"kn",{enumerable:!0,get:function(){return Lr}}),Object.defineProperty(exports,"kt",{enumerable:!0,get:function(){return zl}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return xD}}),Object.defineProperty(exports,"ln",{enumerable:!0,get:function(){return Ho}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return F_}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return cD}}),Object.defineProperty(exports,"mn",{enumerable:!0,get:function(){return Ai}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return Rg}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return LD}}),Object.defineProperty(exports,"nn",{enumerable:!0,get:function(){return xo}}),Object.defineProperty(exports,"nr",{enumerable:!0,get:function(){return De}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return db}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return DD}}),Object.defineProperty(exports,"on",{enumerable:!0,get:function(){return No}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return ay}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return _D}}),Object.defineProperty(exports,"pn",{enumerable:!0,get:function(){return Mo}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return p_}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return Mx}}),Object.defineProperty(exports,"qn",{enumerable:!0,get:function(){return Nn}}),Object.defineProperty(exports,"qt",{enumerable:!0,get:function(){return Os}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return jD}}),Object.defineProperty(exports,"rn",{enumerable:!0,get:function(){return Ao}}),Object.defineProperty(exports,"rr",{enumerable:!0,get:function(){return se}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return Ny}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return FD}}),Object.defineProperty(exports,"sn",{enumerable:!0,get:function(){return Do}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return oy}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return RD}}),Object.defineProperty(exports,"tn",{enumerable:!0,get:function(){return vo}}),Object.defineProperty(exports,"tr",{enumerable:!0,get:function(){return ze}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return sb}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return vD}}),Object.defineProperty(exports,"un",{enumerable:!0,get:function(){return Oo}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return L_}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return BE}}),Object.defineProperty(exports,"vn",{enumerable:!0,get:function(){return Yr}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return af}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Zw}}),Object.defineProperty(exports,"wn",{enumerable:!0,get:function(){return si}}),Object.defineProperty(exports,"wt",{enumerable:!0,get:function(){return fd}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return ED}}),Object.defineProperty(exports,"xn",{enumerable:!0,get:function(){return di}}),Object.defineProperty(exports,"xt",{enumerable:!0,get:function(){return _f}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return VE}}),Object.defineProperty(exports,"yn",{enumerable:!0,get:function(){return li}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return Cd}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return WS}}),Object.defineProperty(exports,"zn",{enumerable:!0,get:function(){return jn}}),Object.defineProperty(exports,"zt",{enumerable:!0,get:function(){return Hu}});
|