tla-ts 0.0.10-dev.d618a2d79 → 0.0.10-dev.e5c8dc315
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/dist/compile.cjs +3 -3
- package/dist/compile.js +1 -1
- package/dist/deciders.cjs +36 -36
- package/dist/deciders.js +53 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +18 -4
- package/dist/index.d.ts +18 -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 +56 -56
- package/dist/prove.js +78 -78
- package/dist/run.cjs +40 -44
- package/dist/run.js +42 -46
- package/dist/tlapm.cjs +1 -1
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +97 -92
- package/dist/transfer.js +97 -92
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +31 -3
- package/src/bags.ts +50 -29
- package/src/builtins.ts +4 -3
- package/src/check-failure.ts +13 -11
- package/src/check-trace.ts +146 -93
- package/src/check.ts +518 -281
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/tlc-arguments.ts +2 -2
- package/src/cli/tlc-output.ts +18 -4
- package/src/cli/tlc.ts +18 -12
- package/src/cli/xml-exporter.ts +1 -1
- package/src/codegen.ts +23 -10
- package/src/coverage.ts +255 -18
- package/src/dependencies.ts +68 -15
- package/src/dfid.ts +101 -36
- package/src/environment.ts +155 -66
- package/src/errors.ts +7 -0
- package/src/evaluate.ts +424 -135
- package/src/exit-codes.ts +28 -14
- package/src/instances.ts +152 -25
- package/src/java-hash.ts +14 -0
- package/src/java-overrides.ts +2 -2
- package/src/levels.ts +675 -236
- package/src/lexer.ts +12 -2
- package/src/liveness-checker.ts +179 -60
- package/src/liveness.ts +55 -10
- package/src/obligations/index.ts +1 -1
- package/src/obligations/normalize.ts +1 -4
- package/src/obligations/printer.ts +5 -5
- package/src/obligations/source.ts +2 -0
- package/src/parallel-worker.ts +8 -2
- package/src/parallel.ts +5 -0
- package/src/parser.ts +180 -149
- package/src/prover/isabelle/isar/attrib.ts +4 -4
- package/src/prover/isabelle/isar/rule-cases.ts +8 -6
- package/src/prover/isabelle/provers/clasimp.ts +1 -1
- package/src/prover/isabelle/provers/hypsubst.ts +2 -2
- package/src/prover/isabelle/pure/rewriter.ts +3 -3
- package/src/prover/isabelle/pure/term.ts +3 -3
- package/src/prover/prep/md5.ts +26 -29
- package/src/prover/smt/rewrite.ts +2 -7
- package/src/prover/smt/simplify.ts +1 -1
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +3 -2
- package/src/prover/smt/solver/arith-rewriter.ts +11 -3
- package/src/prover/smt/solver/array-rewriter.ts +12 -2
- package/src/prover/smt/solver/asserted-formulas.ts +171 -58
- package/src/prover/smt/solver/ast-lt.ts +1 -1
- package/src/prover/smt/solver/ast.ts +66 -14
- package/src/prover/smt/solver/auf-solver.ts +23 -12
- package/src/prover/smt/solver/bit-blast-tactic.ts +28 -2
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-simplifier.ts +11 -13
- package/src/prover/smt/solver/bv-decl-plugin.ts +13 -10
- package/src/prover/smt/solver/bv-rewriter.ts +1 -1
- package/src/prover/smt/solver/bv1-blast.ts +1 -1
- package/src/prover/smt/solver/card2bv.ts +35 -18
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +39 -24
- package/src/prover/smt/solver/context.ts +84 -15
- package/src/prover/smt/solver/ctx-simplify.ts +9 -4
- package/src/prover/smt/solver/datatype-decl-plugin.ts +15 -7
- package/src/prover/smt/solver/dependent-expr-state.ts +28 -16
- package/src/prover/smt/solver/diff-neq.ts +9 -8
- package/src/prover/smt/solver/dt2bv-tactic.ts +66 -28
- package/src/prover/smt/solver/elim-bounds.ts +89 -0
- package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +31 -28
- package/src/prover/smt/solver/eq2bv-tactic.ts +15 -6
- package/src/prover/smt/solver/euf/arith-internalize.ts +1 -1
- package/src/prover/smt/solver/euf/array-internalize.ts +1 -1
- package/src/prover/smt/solver/euf/bv-internalize.ts +1 -1
- package/src/prover/smt/solver/euf/egraph.ts +4 -11
- package/src/prover/smt/solver/euf/euf-solver.ts +1 -2
- package/src/prover/smt/solver/euf/mam.ts +1 -5
- package/src/prover/smt/solver/euf/q-ematch.ts +1 -2
- package/src/prover/smt/solver/euf/th-solver.ts +0 -7
- package/src/prover/smt/solver/expr2polynomial.ts +204 -79
- package/src/prover/smt/solver/factor.ts +36 -14
- package/src/prover/smt/solver/fd-solver.ts +608 -139
- package/src/prover/smt/solver/fix-dl-var.ts +2 -3
- package/src/prover/smt/solver/fm-tactic.ts +9 -7
- package/src/prover/smt/solver/fpa-rewriter.ts +1 -2
- package/src/prover/smt/solver/fpa2bv-converter.ts +3 -1
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +1 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +1 -1
- package/src/prover/smt/solver/goal.ts +6 -3
- package/src/prover/smt/solver/goal2nlsat.ts +57 -30
- package/src/prover/smt/solver/hashtable.ts +4 -0
- package/src/prover/smt/solver/internalizer.ts +1 -1
- package/src/prover/smt/solver/lia2pb.ts +1 -1
- package/src/prover/smt/solver/logic-tactics.ts +15 -5
- package/src/prover/smt/solver/lp/core-solver.ts +12 -8
- package/src/prover/smt/solver/lp/lar-solver.ts +1 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +6 -2
- package/src/prover/smt/solver/lp/nla-core.ts +1 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +158 -80
- package/src/prover/smt/solver/lp/nra-solver.ts +45 -39
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -2
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -20
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -39
- package/src/prover/smt/solver/lp/pdd.ts +725 -290
- package/src/prover/smt/solver/lp/union-find.ts +1 -1
- package/src/prover/smt/solver/mam-compiler.ts +1 -1
- package/src/prover/smt/solver/maxcore.ts +2 -1
- package/src/prover/smt/solver/maxsmt-base.ts +1 -0
- package/src/prover/smt/solver/model-based-opt.ts +1 -1
- package/src/prover/smt/solver/model-checker.ts +1 -1
- package/src/prover/smt/solver/model-evaluator.ts +2 -0
- package/src/prover/smt/solver/model-generator.ts +85 -43
- package/src/prover/smt/solver/mpf.ts +2 -4
- package/src/prover/smt/solver/mus.ts +2 -3
- package/src/prover/smt/solver/muz/dl-context.ts +22 -44
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +1 -1
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +3 -3
- package/src/prover/smt/solver/muz/dl-rule.ts +8 -9
- package/src/prover/smt/solver/muz/hnf.ts +2 -2
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +1 -1
- package/src/prover/smt/solver/muz/horn-tactic.ts +15 -2
- package/src/prover/smt/solver/muz/rule-properties.ts +22 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +2 -4
- package/src/prover/smt/solver/muz/spacer-pdr.ts +1 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +1 -1
- package/src/prover/smt/solver/nlqsat.ts +2 -1
- package/src/prover/smt/solver/nlsat/algebraic.ts +196 -92
- package/src/prover/smt/solver/nlsat/atoms.ts +52 -33
- package/src/prover/smt/solver/nlsat/explain.ts +375 -217
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -240
- package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -681
- package/src/prover/smt/solver/nlsat/solver.ts +74 -64
- package/src/prover/smt/solver/nlsat/transcendentals.ts +41 -17
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -4
- package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -18
- package/src/prover/smt/solver/nlsat-tactic.ts +1 -1
- package/src/prover/smt/solver/nnf.ts +6 -2
- package/src/prover/smt/solver/normalize-bounds.ts +2 -2
- package/src/prover/smt/solver/occf.ts +1 -1
- package/src/prover/smt/solver/opt-context.ts +21 -7
- package/src/prover/smt/solver/opt-nlsat.ts +29 -18
- package/src/prover/smt/solver/opt-pareto.ts +19 -0
- package/src/prover/smt/solver/opt-preprocess.ts +1 -1
- package/src/prover/smt/solver/opt-solver.ts +10 -6
- package/src/prover/smt/solver/optsmt.ts +1 -1
- package/src/prover/smt/solver/parallel-tactic.ts +1 -1
- package/src/prover/smt/solver/pb-rewriter.ts +1 -4
- package/src/prover/smt/solver/pb2bv-tactic.ts +9 -3
- package/src/prover/smt/solver/poly-rewriter.ts +75 -18
- package/src/prover/smt/solver/probes.ts +88 -23
- package/src/prover/smt/solver/proto-model.ts +8 -8
- package/src/prover/smt/solver/purify-arith.ts +51 -49
- package/src/prover/smt/solver/push-app-ite.ts +37 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +2 -4
- package/src/prover/smt/solver/qe-lite.ts +2 -2
- package/src/prover/smt/solver/qe.ts +3 -2
- package/src/prover/smt/solver/qsat.ts +23 -8
- package/src/prover/smt/solver/quantifier-manager.ts +14 -9
- package/src/prover/smt/solver/recfun-decl-plugin.ts +2 -1
- package/src/prover/smt/solver/reduce-args.ts +2 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +7 -6
- package/src/prover/smt/solver/rewriter.ts +31 -25
- package/src/prover/smt/solver/rlimit.ts +7 -3
- package/src/prover/smt/solver/sat/config.ts +1 -1
- package/src/prover/smt/solver/sat/goal2sat.ts +75 -12
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +149 -47
- package/src/prover/smt/solver/sat/model-converter.ts +1 -1
- package/src/prover/smt/solver/sat/pb-constraint.ts +7 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +26 -7
- package/src/prover/smt/solver/sat/sat-tactic.ts +54 -25
- package/src/prover/smt/solver/sat/sat2goal.ts +75 -50
- package/src/prover/smt/solver/sat/simplifier.ts +1 -1
- package/src/prover/smt/solver/sat/solver.ts +27 -47
- package/src/prover/smt/solver/seq-axioms.ts +20 -35
- package/src/prover/smt/solver/seq-decl-plugin.ts +1 -1
- package/src/prover/smt/solver/seq-derive.ts +2 -2
- package/src/prover/smt/solver/seq-eq-solver.ts +2 -2
- package/src/prover/smt/solver/seq-monadic.ts +7 -5
- package/src/prover/smt/solver/seq-re-rewriter.ts +2 -1
- package/src/prover/smt/solver/seq-re-util.ts +1 -1
- package/src/prover/smt/solver/seq-regex-bisim.ts +1 -1
- package/src/prover/smt/solver/seq-regex-live.ts +2 -2
- package/src/prover/smt/solver/seq-rewriter.ts +31 -29
- package/src/prover/smt/solver/seq-skolem.ts +0 -23
- package/src/prover/smt/solver/seq-view-witness.ts +4 -4
- package/src/prover/smt/solver/smt-consequences.ts +1 -1
- package/src/prover/smt/solver/smt-kernel.ts +48 -7
- package/src/prover/smt/solver/smt-setup.ts +106 -13
- package/src/prover/smt/solver/smtlib-parser.ts +589 -224
- package/src/prover/smt/solver/smtlib-script.ts +718 -213
- package/src/prover/smt/solver/solve-eqs.ts +36 -37
- package/src/prover/smt/solver/solver.ts +18 -4
- package/src/prover/smt/solver/tactic.ts +389 -199
- package/src/prover/smt/solver/theory-bv.ts +13 -3
- package/src/prover/smt/solver/theory-fpa.ts +1 -1
- package/src/prover/smt/solver/theory-lra-final-check.ts +1 -0
- package/src/prover/smt/solver/theory-lra-internalize.ts +2 -0
- package/src/prover/smt/solver/theory-lra-propagate.ts +12 -3
- package/src/prover/smt/solver/theory-lra-state.ts +1 -1
- package/src/prover/smt/solver/theory-lra.ts +1 -1
- package/src/prover/smt/solver/theory-pb.ts +24 -7
- package/src/prover/smt/solver/theory-seq-solve.ts +1 -1
- package/src/prover/smt/solver/theory-seq-state.ts +2 -21
- package/src/prover/smt/solver/theory-without-terms.ts +24 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +15 -5
- package/src/prover/tlapm/cache.ts +8 -8
- package/src/prover/zenon/index-table.ts +5 -2
- package/src/prover/zenon/isar-case.ts +1 -1
- package/src/prover/zenon/isar.ts +2 -2
- package/src/prover/zenon/phrase.ts +1 -1
- package/src/resolve.ts +1311 -268
- package/src/runtime.ts +21 -2
- package/src/sany/builtins.ts +10 -10
- package/src/sany/generation.ts +5 -15
- package/src/sany/generator-def-entries.ts +123 -36
- package/src/sany/generator-definitions.ts +5 -3
- package/src/sany/generator-expressions.ts +60 -37
- package/src/sany/generator-proofs.ts +19 -12
- package/src/sany/generator.ts +12 -6
- package/src/sany/lexer.ts +15 -7
- package/src/sany/modules.ts +4 -2
- package/src/sany/nodes.ts +1 -1
- package/src/sany/selectors.ts +12 -6
- package/src/sany/xml.ts +2 -3
- package/src/search.ts +321 -135
- package/src/simulate.ts +247 -185
- package/src/spec-description.ts +15 -7
- package/src/standard-definitions.ts +1 -0
- package/src/standard-modules.ts +56 -22
- package/src/subexpressions.ts +666 -147
- package/src/successors.ts +50 -20
- package/src/symmetry.ts +2 -1
- package/src/tlc/jar-data.ts +10 -0
- package/src/tlc/messages.ts +3 -3
- package/src/tlc/order.ts +14 -3
- package/src/tlc/random.ts +2 -1
- package/src/tlc/replay.ts +147 -46
- package/src/tlc/tlc-operators.ts +10 -8
- package/src/tlc/tlcext-operators.ts +44 -15
- package/src/tlc/trace-spec.ts +9 -22
- package/src/trace-liveness.ts +529 -0
- package/src/typed-tier.ts +52 -31
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +150 -79
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`},te=(e,t)=>t===9?e+8-e%8:e+1,ne=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),S=(e,t,n=!1)=>{if(e.charCodeAt(t)!==92)return 0;let r=e.charAt(t+1),i=ne.get(n?r:r.toLowerCase());if(i===void 0)return 0;let a=f(e,t+2,i);return a===t+2?0:a-t},re=(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,v=0,x=0,ne=()=>{for((h!==p||v>c)&&(h=p,v=p,x=0);v<c;v++)x=te(x,t.charCodeAt(v));return te(x,t.charCodeAt(c))},re=(e,t,n,r)=>{let i=ne();a.push({kind:e,text:t,spelling:r,line:u,column:i,endColumn:i+n-1}),c+=n},C=e=>{for(let n=0;n<e;n++)t.charCodeAt(c)===10&&(u++,p=c+1),c++},w=n=>new e.F(`${n} at line ${u}, column ${ne()}`,void 0,{reason:n,line:u,column:ne(),isEnd:c>=t.length});for(;c<t.length;){let e=t.charCodeAt(c);if(e===10||e===32||e===9||e===13){C(1);continue}if(e===92&&t.charCodeAt(c+1)===42){C(y(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 w(`Unterminated comment`);t.startsWith(`(*`,c)?(e++,C(2)):t.startsWith(`*)`,c)?(e--,C(2)):C(1)}while(e>0);continue}if(e===45&&t.startsWith(`----`,c)){let e=y(t,c,e=>e===`-`)-c,n=y(t,c+e,e=>e===` `);t.startsWith(`MODULE`,n)&&m++,re(`Separator`,`----`,e);continue}if(e===61&&t.startsWith(`====`,c)){if(re(`ModuleEnd`,`====`,y(t,c,e=>e===`=`)-c),m--,m<=0)break;continue}if(e===34){let e=u,n=ne(),r=[];for(C(1);t.charCodeAt(c)!==34;){let e=t.charCodeAt(c);if(c>=t.length||e===10||e===13)throw w(`Unterminated string`);if(e===92){let e=t[c+1];if(e===void 0||!`ntrf\\"`.includes(e))throw w(`Invalid escape in string`);r.push(ee[e]??e),C(2)}else r.push(t[c]),C(1)}C(1),a.push({kind:`String`,text:r.join(``),line:e,column:n,endColumn:ne()-1});continue}let i=S(t,c,r);if(i>0){re(`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;re(n?`Decimal`:`Number`,a,a.length);continue}if(!/[A-Za-z]/.test(i)){let n=e===95?`_`:t.slice(c,a);re(n===`_`?`Operator`:`Number`,n,n.length);continue}if(i.startsWith(`WF_`)||i.startsWith(`SF_`)){re(`Keyword`,i.slice(0,3),3);continue}let s=o.get(i)??i;o.set(s,s),re(n.has(i)?`Keyword`:`Identifier`,s,i.length);continue}let s=t[c];if(e>=128&&_.has(s)){re(`Identifier`,o.get(s)??s,1),o.set(s,s);continue}if(e===60){let e=b(t,c,r);if(e>0){re(`Step`,t.slice(c,c+e),e);continue}}let l=g(t,c);if(l){let e=t.slice(c,c+l.length);re(`Operator`,l.text,l.length,e===l.text?void 0:e)}else throw w(`Unexpected character ${JSON.stringify(s)}`)}let T=ne();return a.push({kind:`End`,text:``,line:u,column:T,endColumn:T}),a},C=[[`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`]],w=C.map(e=>e[0]),T=new Map(w.map((e,t)=>[e,t]).reverse()),E=t=>{let n=T.get(t);if(n===void 0)throw new e.y(`Unknown SANY token kind ${t}`);return n},ie=new Map(C.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),ae=Math.max(...[...ie.keys()].map(e=>e.length)),oe=Array.from({length:ae},(e,t)=>ae-t),se=/----+ *MODULE/y,ce=[/_\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],le=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`)),ue=le(String.raw`\.\/\\`),de=le(String.raw`\.\\\/`),fe=String.raw`<(?:[0-9]+|\+|\*)>`,pe=[[`_BM0`,[se]],[`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`,ue],[`BOR`,de],[`IDENTIFIER`,ce],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${fe}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(fe,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${fe}(?:\*\.*|-\.*|\.+)`,`y`)]]],D=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[se]]],O=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[se]],[`BAND`,ue],[`BOR`,de],[`IDENTIFIER`,ce]],k=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),A=(e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,me=(e,t,n)=>e.map(([e,r])=>({kind:E(e),length:Math.max(...r.map(e=>k(e,t,n)))})).reduce(A,{kind:-1,length:0}),he=(e,t)=>{let n=oe.find(n=>ie.has(e.slice(t,t+n))),r=me(pe,e,t);return n===void 0?r:A(r,{kind:ie.get(e.slice(t,t+n))??-1,length:n})},ge=e=>e+8-e%8,_e=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),y=(e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,b=(e,t,n)=>e.map(e=>({kind:a(e[0]),length:Math.max(...e[1].map(e=>v(e,t,n)))})).reduce(y,{kind:-1,length:0}),x=(e,t)=>{let n=c.find(n=>o.has(e.slice(t,t+n))),r=b(h,e,t);return n===void 0?r:y(r,{kind:o.get(e.slice(t,t+n))??-1,length:n})},S=e=>e+8-e%8,ee=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=S(i-1)),t.push(r),n.push(i);return{lines:t,columns:n}},C=e=>{let t=ee(e);return{line:t.lines[e.length-1]??0,column:t.columns[e.length-1]??0}},te=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,ne=new Set([...o.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),re=(e,t)=>{let n=0;for(;ne.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,v(te,e,t)))},ie=e=>{let t=ee(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?T(o,s,e[a],i):t.lines[n]===o?e[a]===`
|
|
12
|
+
`||e[a]===`\r`?T(o+1,0,void 0,i):T(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=b(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=x(e,t);if(r.length===0){let n=re(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()}},w=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
|
|
14
|
+
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),ae=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>w.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),T=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${ae(n)}" (${n.charCodeAt(0)}), `}after : "${ae(r)}"`,oe=e=>{let t=ie(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===` `?S(e):e+1,e.beginColumn);return T(e.beginLine,n,e.image[t],e.image.slice(0,t))}},se=/* @__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(`.`)),ce=/* @__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`]]),le=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),E=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),D=/* @__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`]]),O=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),ue=e=>e.startsWith(`\\`)?parseInt(e.slice(2),O.get(e[1].toLowerCase())):Number(e),k=/-{4,} *MODULE\b/,de=/* @__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)de[n.charCodeAt(0)]|=e});const fe=(e,t)=>e<128&&(de[e]&t)!==0,pe=(e,t,n)=>{let r=t;for(;fe(e.charCodeAt(r),n);)r++;return r},me=/* @__PURE__ */ new Map;E.forEach(e=>{let t=e.charCodeAt(0),n=me.get(t)??[];n.push(e),me.set(t,n)});const he=(e,t)=>{let n=me.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]}},ge=(e,t)=>{if(e.charCodeAt(t)<128)return;let n=e.slice(t,t+2);if(D.has(n))return n;let r=e[t];return D.has(r)?r:void 0},_e=(e,t)=>{let n=e.charCodeAt(t);if(n===92&&fe(e.charCodeAt(t+1),2)){let n=e.slice(t+1,pe(e,t+1,2)),r=n.length;for(;r>0&&!ce.has(n.slice(0,r));)r--;let i=ce.get(n.slice(0,r));return{text:i??`\\`,length:i===void 0?1:r+1}}let r=ge(e,t);if(r!==void 0)return{text:D.get(r)??``,length:r.length};let i=he(e,t);return i?{text:le.get(i)??i,length:i.length}:n===92?{text:`\\`,length:1}:void 0},A=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),ve=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>D.has(e)||A.has(e));return n===void 0?void 0:{text:n,length:n.length}},ye=(e,t,n)=>{let r=t;for(;r<e.length&&n(e[r]);)r++;return r},be=(e,t,n)=>{let r=e[t+1]===`+`||e[t+1]===`*`,i=r?t+2:pe(e,t+1,1);if(i===t+1||e[i]!==`>`)return 0;let a=!r||!n,o=a?pe(e,i+1,7):i+1,s=a&&o===i+1&&(e[o]===`*`||e[o]===`-`);return ye(e,s?o+1:o,e=>e===`.`)-t},xe=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,Se={n:`
|
|
15
|
+
`,t:` `,r:`\r`,f:`\f`},Ce=(e,t)=>t===9?e+8-e%8:e+1,we=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),Te=(e,t,n=!1)=>{if(e.charCodeAt(t)!==92)return 0;let r=e.charAt(t+1),i=we.get(n?r:r.toLowerCase());if(i===void 0)return 0;let a=pe(e,t+2,i);return a===t+2?0:a-t},Ee=(t,n=!1)=>{let r=k.exec(t);if(!r){let n=C(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=Ce(p,t.charCodeAt(f));return Ce(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(ye(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=ye(t,s,e=>e===`-`)-s,n=ye(t,s+e,e=>e===` `);t.startsWith(`MODULE`,n)&&u++,h(`Separator`,`----`,e);continue}if(e===61&&t.startsWith(`====`,s)){if(h(`ModuleEnd`,`====`,ye(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(Se[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=Te(t,s,n);if(r>0){h(`Number`,t.slice(s,s+r),r);continue}if(fe(e,7)){let n=pe(t,s,7),r=t.slice(s,n),i=pe(t,s,1);if(i===n){let e=t.charCodeAt(n)===46?pe(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(se.has(r)?`Keyword`:`Identifier`,o,r.length);continue}let o=t[s];if(e>=128&&A.has(o)){h(`Identifier`,a.get(o)??o,1),a.set(o,o);continue}if(e===60){let e=be(t,s,n);if(e>0){h(`Step`,t.slice(s,s+e),e);continue}}let l=_e(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},De=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],Oe=/* @__PURE__ */ new Set([...De,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),ke=[`TYPE`,`TYPE_CONSTRAINT`],Ae=/* @__PURE__ */ new Set([...De,...ke]),je=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],Me=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},Ne=e=>{let t=[],n=0,r=1,i=0,a=(n,a)=>{t.push({kind:`Error`,text:T(r,n-i+1,e[n],a),line:r})},o=e=>{t.push({kind:`Error`,text:T(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=je(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=S(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=v(e,n)??g(e,n),m=Ae.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},Ne=(t,n)=>new e._(`TLC found an error in the configuration file at line ${t}\n${n}`),Pe=(e,t)=>Ne(e,`The keyword ${t} appeared twice.`),Fe=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),Ie=/* @__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`]]),Le=(t,n=`master`)=>{let r=n===`1.7.4`?ke:De,i=Me(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.at(new e._(`${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._(`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 Ne(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 Ne(t.line,`It was expecting a value, but did not find it.`)},d=e=>{let t=l();if(t.kind===`End`)throw Ne(t.line,`Expected an identifier after ${e}[.`);let n=l();if(n.text!==`]`)throw Ne(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 Ne(t.line,`Expected an identifier after <-[mod].`);o.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw Ne(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 Ne(t,``);r=l()}if(r.text!==`=`)throw Ne(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)?Fe.get(e):void 0,i=r.has(e)?Ie.get(e):void 0,a=()=>{let n=l();if(n.kind===`End`)throw Ne(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 Pe(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 Ne(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(s)throw Pe(t,e);s=!0,o.checkDeadlock=n.text===`TRUE`,h=l()}else{if(!r.has(e)||!Oe.includes(e))throw Ne(t,`It was expecting a keyword, but did not find it.`);if(a(),c.has(e))throw Pe(t,e);c.add(e),h=l()}}return o},Re=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],ze=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(Re),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:[])}},Be=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},j=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,Ve=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},He={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:` `}},Ue=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},We=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Ge=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),Ke=e=>{let t=t=>{let n=y(e,t,Ue);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=y(e,t,We);if(e.startsWith(`..`,n)&&We(e[n+2]))return{kind:`Constant`,first:t,last:y(e,n+2,We)-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=We(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:y(e,t+1,We)-1,children:[]};if(Ge(n))return{kind:`Constant`,first:t,last:y(e,t,Ge)-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)},M=e=>{let t=e.length===0?void 0:Ke(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=He[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},qe={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},Je={none:0,error:1,warning:3,state:4},Ye={0:``,1:`Error: `,3:`Warning: `,4:`State `},Xe=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${Ye[n]}${r}`,Ze=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===Je.warning;if(o&&t.errorCodes?.includes(r))throw new e.V(r,a);if(o&&t.isWarningEnabled===!1||i!==Je.error&&t.suppressedCodes?.includes(r))return;let s=o&&!t.isTool&&n.size===0?`
|
|
20
|
-
(Use the -nowarning option to disable this warning.)`:``,c=Xe(t.isTool,r,i,`${a}${s}`);o&&n.has(c)||(o&&n.add(c),console.log(c))}}},Qe=`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.`,$e=[[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,Qe,!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 et;const tt=()=>et??=$e.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),nt=/^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)\)\./,rt=e=>nt.test(e)?void 0:tt().find(t=>t.pattern.test(e))?.message,it=t=>t instanceof e.k||rt(t.message)?.isEvalException===!0,at=/* @__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
|
-
`]]),N=(e,t,n)=>{let r=n?at.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?rt(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Je.none} @!@!@\n${N(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},st=(e,t=2)=>String(e).padStart(t,`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.at(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=>it(e)?ht:gt,vt=t=>{try{return t()}catch(t){throw t instanceof e.b?it(t)?new e.b(`${e.W}${t.message}`):rt(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?qe.stackOverflow:qe.general,message:i,toolMessage:i};if(n&&it(t))return{code:rt(i)?.code??qe.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:qe.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=2147483647,wt=1e6;let Tt=wt;const Et=()=>Tt,Dt=()=>Math.max(Tt,10),Ot=()=>`Attempted to construct a set with too many elements (>${Tt}).`,kt=(t,n)=>{if(t.length===Dt())throw new e.N(Ot());t.push(n)},At=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=Dt(),jt=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},P=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,Mt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),Nt=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),Pt=e=>typeof e==`object`&&e.kind===`ModelValue`,Ft=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),It=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:P(e)?`set`:`function`,Lt=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let Rt=!1;const zt=(e,t)=>(Rt=!0,e.writtenKeys=t,e),Bt=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,Vt=e=>Bt(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),Ht=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):Vt(e),Ut=(e,t,n)=>zt(Fr(e,t),n),Wt=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(Wt);e.writtenKeys=void 0,e.range.forEach(Wt)}},Gt=e=>e.every(e=>typeof e==`string`),Kt=(e,t)=>e.length>0&&t.length>0&&Gt(e)!==Gt(t),qt=(e,t)=>{Rt&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Kt(n,r)?ir(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=bn(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:bn(t,n);if(r!==0)return r}return 0},Jt=(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=bn(n[e],r[e]);if(t!==0)return t}return 0},Yt=e=>Pt(e)?e.type:void 0,Xt=(t,n,r)=>{let i=Yt(t),a=Yt(n);if(i===void 0&&a===void 0)return;let o=r?`check equality of`:`compare`;if(Pt(t)&&Pt(n)){if(i===void 0||a===void 0||i===a)return;throw new e.b(`Attempted to ${o} the differently-typed model values ${R(t)} and ${R(n)}`)}throw i===void 0?new e.b(`Attempted to ${o} the typed model value ${R(n)} and the non-model value\n${R(t)}`):new e.b(`Attempted to ${o}${r?``:` the`} typed model value ${R(t)} and non-model value\n${R(n)}`)},Zt=()=>({ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0}),Qt=Zt(),$t=e=>{Object.assign(Qt,Zt()),xn.clear();for(let t of e)un(t)},en=()=>{Qt.searchRank=Qt.size},tn=()=>Qt.unorderedString;let nn=!1;const rn={isExpanded:!0,isViewPrinted:!1},an=e=>{nn=e.version===`1.7.4`,Tt=e.maxSetSize??wt,rn.isExpanded=e.isLazyValueExpanded??!0,rn.isViewPrinted=e.isViewPrinted??!1},on=/* @__PURE__ */ new WeakMap,sn=(e,t)=>(rn.isViewPrinted&&on.set(e,t),e),cn=/* @__PURE__ */ new WeakMap,ln=(e,t)=>(cn.set(e,t),e),un=e=>(Qt.ranks[e]===void 0&&(Qt.ranks[e]=Qt.size++),e),dn=e=>Qt.ranks[un(e)],fn=(e,t)=>{if(e===t)return 0;let n=Qt.ranks,r=n[e],i=n[t],a=Qt.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(Qt.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},pn=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),mn=(e,t)=>(pn(e)||pn(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),hn=(t,n)=>new e.b(pn(t)?`Attempted to compare overridden value ${R(t,!0)} with non-overridden value:\n${R(n)}`:`Attempted to compare ${It(t)} ${R(t)} with ${It(n)} ${R(n)}`),gn=(t,n,r)=>{if(!pn(t))throw new e.b(`Attempted to ${r} the set ${R(F(t)?I(t):t,!0)} with the value:\n${R(n,!0)}`);if(!pn(n))throw hn(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.k(`Attempted to compare ${R(t,!0)} with the value\n${R(n,!0)}`)},_n={kind:`InfiniteSet`,name:`Any`},vn=t=>{throw new e.k(`Attempted to compare ANY with the value\n${R(t)}`)},yn=e=>{Rt&&Wt(e),e===_n&&vn(e),typeof e==`object`&&e.kind===`LazyFunction`&&L(e)},bn=(e,t)=>{if(e===t)return yn(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return qt(e,t);if(n===`Set`&&r===`Set`)return Jt(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&Xt(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return Xt(e,t,!1),n===`ModelValue`?-1:1;if(e===_n||t===_n)return vn(e===_n?t:e);if(P(e)&&P(t)&&mn(e,t))return gn(e,t,`compare`);let i=P(e);if(i!==P(t))throw hn(e,t);if(n===`Interval`&&r===`Set`){let n=ai(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-ai(t);if(n!==0)return n}return i?Jt(I(e),I(t)):qt(L(e),L(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return fn(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(Xt(e,t,!1),Pt(e))return-1;if(Pt(t))return 1;throw hn(e,t)},xn=/* @__PURE__ */ new Map,Sn=32768,Cn=t=>{let n=xn.get(t);if(n)return n;if(xn.size===Sn)throw new e.x(`TLC supports at most ${Sn} 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:dn(t),hash:Ii(Li(Ri(t),109)),fingerprint:qi(Ji(t)^60)};return xn.set(t,r),r},wn=()=>[...xn.values()],Tn=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),En=e=>{let t=Tn(e);return t.isNormalized=!0,t},Dn=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let On=!1;const kn=(e,t)=>(t===`lambda`&&(On=!0),t!==void 0&&(e.functionClass=t),e),An=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,jn=e=>kn(e,`lambda`),Mn=e=>St(e)&&e.isCached===!0;let Nn=!1;const Pn=e=>(Nn=!0,e),Fn=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),In=e=>{Nn&&typeof e==`object`&&St(e)&&Fn.has(e.kind)&&(e.isCached=!0)},Ln=e=>{(On||Nn)&&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(Ln),e.range.forEach(Ln)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Ln):P(e)&&F(e)&&(In(e),I(e).elements.forEach(Ln))))},Rn=(e,t)=>{if(In(e),e===t)return yn(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Xt(e,t,!0),bn(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return qt(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Jt(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&ai(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==ai(t))return!1;if(Pt(e)||Pt(t))return e.kind===`LazyFunction`&&L(e),Xt(e,t,!0),Pt(e)&&Pt(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Rn(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=ni(e.domain),r=ni(t.domain);if(n||r)return n===r;let i=ni(e.range),a=ni(t.range);return i||a?i===a:Rn(e.domain,t.domain)&&Rn(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(ni(e))return ni(t);if(ni(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]&&Rn(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return ni(e)?ni(t):!ni(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Rn(e,t.factors[n]));let n=P(e)&&P(t)&&!(F(e)&&F(t));if(n&&mn(e,t))return gn(e,t,`check equality of`)===0;if(n){if(!pn(e)){let n=I(e);if(!pn(t))return Jt(n,I(t))===0}return $i(e)===$i(t)}return bn(e,t)===0},zn=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):$i(n)===$i(r);return n},Bn=zn(!1),Vn=zn(!0),Hn=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Un=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Ki(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Vn(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Vn(i[e],n))return i[e]}return n.kind===`Set`?Hn(n.elements,t):(Hn(n.domain,t),Hn(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}},Wn=(e,t)=>t.length===0||An(e)===`tuple`?1:Ni(t)?.low,Gn=e=>{if(!Nt(e))return;let t=L(e);return{domain:t.domain,range:t.range,low:Wn(e,t.domain)}},Kn=e=>{if(!Nt(e))return;let t=L(e);return Gt(t.domain)?t:void 0},qn=(e,t,n)=>(Xt(t,e,n),1),Jn={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`}},Yn=(e,t,n)=>{let r=Jn[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${R(e)} with ${r.other}:\n${R(t)}`},Xn=e=>e?`check equality of`:`compare`,Zn=(t,n,r,i)=>{let a=Gn(r);if(!a){if(Pt(r))return qn(r,n,i);throw new e.b(`Attempted to ${Xn(i)} the function ${R(n)} with the value:\n${R(r)}`)}if(t.range.length!==a.range.length)return t.range.length-a.range.length;let o=()=>Qn(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 Qn(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.b(`Attempted to compare ${i?`an `:``}integer with non-integer${i||t.low!==void 0?`:`:``}\n${R(r)}.`);let a=t.low===void 0?r-(s+n):s+n-r;if(a!==0)return a}return o()},Qn=(e,t,n)=>{for(let r=0;r<e.length;r++){let i=rr(e[r],t[r],n);if(i!==0)return i}return 0},$n=(t,n,r)=>{let i=L(t);if(An(t)===`tuple`){let e=Nt(n)?ui(n):void 0;return e?i.range.length-e.length||Qn(i.range,e,r):Zn({...i,low:1},t,n,r)}if(An(t)===`record`){let a=Kn(n);if(!a){if(Pt(n))return qn(n,t,r);throw new e.b(`Attempted to ${Xn(r)} record:\n${R(t)}\nwith non-record\n${R(n)}`)}return i.domain.length-a.domain.length||Qn(i.domain,a.domain,r)||Qn(i.range,a.range,r)}return Zn({...i,low:Wn(t,i.domain)},t,n,r)},er=(e,t)=>pn(e)||pn(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),tr=(e,t)=>{let n=Ft(t)?t:I(t);return{elements:I(e).elements,otherElements:I(n).elements}},nr=(t,n,r)=>{if(er(t,n))return r?+!Rn(t,n):bn(t,n);if(!Ft(t))return nr(I(t),n,r);if(!P(n)){if(Pt(n))return qn(n,t,r);throw new e.b(`Attempted to ${Xn(r)} the set ${R(t)} with the value:\n${R(n)}`)}let i=tr(t,n);return i.elements.length-i.otherElements.length||Qn(i.elements,i.otherElements,r)},rr=(t,n,r)=>{if(typeof t!=`object`){if(typeof n==typeof t)return r?t===n?0:1:bn(t,n);if(Pt(n))return qn(n,t,r);throw new e.b(Yn(t,n,r))}return t.kind===`ModelValue`?(t.type!==void 0&&Xt(t,n,r),Pt(n)?r?t.name===n.name?0:1:t.rank-n.rank:-1):Nt(t)?$n(t,n,r):nr(t,n,r)},ir=(e,t)=>rr(e,t,!1),ar=(e,t)=>rr(e,t,!0)===0,or=e=>{let t=[];for(let n of e){let e=cr(n,t);e.isFound||t.splice(e.index,0,n)}return t},sr=(e,t)=>{let n=fi.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},cr=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=sr(e,()=>ir(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},lr=(e,t)=>t.some(t=>sr(t,()=>ar(t,e))),ur=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,dr=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(dr)),e.kind===`Function`&&(e.domain.forEach(dr),e.range.forEach(dr)))},fr=e=>{if(!(typeof e!=`object`||Mn(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:I(e);return;case`FilteredSet`:case`Subset`:return fr(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(fr(e.left),fr(e.right));case`FunctionSet`:return fr(e.domain),fr(e.range);case`RecordSet`:return e.sets.forEach(fr);case`ProductSet`:return e.factors.forEach(fr)}},pr=(e,t)=>pi(Rn,ar,e,t),mr=e=>{for(let t=1;t<e.length;t++)if(bn(e[t-1],e[t])>=0)return!1;return!0},hr=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},gr=e=>{for(let t=1;t<e.length;t++)In(e[t]);if(e.length<2||mr(e))return Tn(e);let t=[...e].sort(bn),n=[t[0]];for(let e=1;e<t.length;e++)bn(n[n.length-1],t[e])!==0&&n.push(t[e]);return Tn(n)},_r=e=>{if(hr(e))return Tn(e);let t=pi(gr,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},vr=Tn([]),yr=(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&&bn(r[a],t)<0;)a++;a<r.length&&bn(r[a],t)===0||i.push(t)}return i.length===n.length?e:Tn(i)},br=(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&&bn(r[a],t)<0;)a++;a<r.length&&bn(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Tn(i)},xr=(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=bn(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=Tn(i);if(e.hash!==0&&e.hash!==Vi){let t=e.hash,n=0;for(;n<a.length;n++){let e=Ki(a[n]);if(e===Vi)break;t=t+zi(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Yi(a[e])|0;c.fingerprint=t}return c},Sr=e=>{let t=e.length<2?e:[...e].sort((e,t)=>bn(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&bn(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Dn(n,r)},Cr=e=>{let t=Sr(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:zt(t,e.map(e=>e[0]))},wr=[],Tr=/* @__PURE__ */ new Map,Er=[],Dr=/* @__PURE__ */ new WeakMap,Or=e=>{let t=wr[e]??Tr.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?Tr.set(e,new WeakRef(n)):wr[e]=n,n},kr=e=>{if(ai(e),e.low===1&&e.high>=1)return Or(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Ar=e=>e.length>0&&(e===wr[e.length]||e===Tr.get(e.length)?.deref())||Dr.has(e),jr=e=>{let t=I(e).elements;return Ar(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Mr=e=>{let t=Er[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Er[e]=n,n},Nr=e=>kn(Dn(Or(e.length),e),`tuple`),Pr=e=>kn(Sr(e),`record`),Fr=(e,t)=>kn(Dn(e,t),`record`),Ir=e=>P(e)&&!pn(e),Lr=(e,t=!1)=>`UNION(${R(e.base,t)})`,Rr=(t,n=e=>I(e).elements)=>{if(!Ir(t.base))throw new e.b(`Attempted to enumerate the nonenumerable set:\n${Lr(t)}`);return n(t.base)},zr=(t,n,r)=>{if(Ir(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${R(t)}\nwhen enumerating:\n${Lr(r)}`)},F=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 F(e.base);case`FunctionSet`:return F(e.domain)&&F(e.range)||Br(e.domain)===!0||Br(e)===!0;case`RecordSet`:return e.sets.every(F)||Br(e)===!0;case`ProductSet`:return e.factors.every(F)||Br(e)===!0;case`Union`:return F(e.base)&&(Ft(e.base)?ur(e.base):Zr(e.base)).every(F);case`SetOperation`:return e.operator===`\\cup`?F(e.left)&&F(e.right):e.operator===`\\cap`?F(e.left)||F(e.right):F(e.left);default:return!1}},Br=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=Br(e.domain);return t===void 0?void 0:!t&&Br(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Br(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return F(e)?I(e).elements.length===0:void 0;default:return}},Vr=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},Hr=(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},Ur=e=>{if(typeof e!=`object`||e.kind!==`Subset`||pn(e.base))return;let t=I(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=[]:Hr(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return Tn(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)})},Wr=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Tn(r.map(t=>e[t])));while(Hr(r,e.length))}return t},Gr=(t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){let o=t[a];if(pn(o))throw new e.b(r(o,a));let s=n(o);if(s.length===0)return[[]];i.push(s)}return i},Kr=(t,n=e=>I(e).elements)=>{if(typeof t!=`object`)throw new e.b(`Expected a set but found ${R(t)}`);switch(t.kind){case`Set`:return t.elements;case`MixedSet`:return or(t.elements);case`Interval`:{let e=kr(t);return e!==wr[e.length]&&Dr.set(e,t),e}case`Subset`:{if(ai(t.base)===0)return Wr([]);if(!P(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${M(R(t.base))}`);let n=I(t.base).elements;if(n.length>30)throw new e.b(ii(t));return Wr(n)}case`FunctionSet`:{if(!nn&&ni(t))return[];if(pn(t.domain))throw new e.b(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${R(t.domain)}\ncannot be enumerated.`);let r=jr(t.domain);if((r.length>0||nn)&&pn(t.range))throw new e.b(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${R(t.range)}\ncannot be enumerated.`);let i=r.length===0?[]:n(t.range);return Vr(r.map(()=>i)).map(e=>Dn(r,e))}case`RecordSet`:{if(!nn&&ni(t))return[];let e=Gr(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${R(e)}`);return Vr(e).map(e=>Pr(t.names.map((t,n)=>[t,e[n]])))}case`ProductSet`:{if(!nn&&ni(t))return[];let e=Gr(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${R(e)}`);return Vr(e).map(Nr)}case`FilteredSet`:if(!P(t.base)||pn(t.base))throw new e.b(`Attempted to enumerate { x \\in S : p(x) } when S:\n${R(t.base)}\nis not enumerable`);return I(_r(Zr(t.base).filter(e=>t.test(e,!1)))).elements;case`Union`:{let n=[];return Rr(t).forEach((r,i)=>{let a=zr(r,i,t);if(At(a))throw new e.N(Ot());Zr(a).forEach(e=>kt(n,e))}),I(_r(n)).elements}case`SetOperation`:{if(t.operator===`\\cap`&&!Ir(t.left)&&!Ir(t.right))throw new e.b(`Attempted to enumerate S \\cap T when neither S:\n${R(t.left)}\nnor T:\n${R(t.right)}\nis enumerable`);if(t.operator===`\\`&&!Ir(t.left))throw new e.b(`Attempted to enumerate S \\ T when S:\n${R(t.left)}\nis not enumerable.`);if(t.operator===`\\cup`)return I(_r(Jr(t))).elements;let n=t.operator===`\\`||Ir(t.left),r=n?t.left:t.right,i=n?t.right:t.left,a=[];return jt(typeof r==`object`&&r.kind===`Interval`?r:Zr(r),e=>{hi(e,i)===(t.operator===`\\cap`)&&kt(a,e)}),I(_r(a)).elements}case`InfiniteSet`:case`SequenceSet`:throw new e.b(`Attempted to enumerate the non-enumerable set ${R(t)}`);default:throw new e.b(`Expected a set but found ${R(t)}`)}},I=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Tn(Kr(e));let t=typeof e==`object`&&St(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=fi.sets;n?.push(e);let r=Kr(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`)?Tn(r):gr(r);return t&&(t.enumerated=i),i},qr=e=>{if(!(typeof e!=`object`||Mn(e)))switch(e.kind){case`MixedSet`:I(e);return;case`FilteredSet`:return Ir(e.base)||I(e),qr(e.base);case`Union`:if(!Ft(e.base)&&Ir(e.base))return qr(e.base);Rr(e).slice(0,1).forEach(t=>qr(zr(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!Ir(e.left)&&I(e),e.operator!==`\\cup`||Ir(e.left)&&Ir(e.right)||I(e),e.operator!==`\\cap`||Ir(e.left)?qr(e.left):qr(e.right),e.operator===`\\cup`&&qr(e.right)}},Jr=t=>{if(!Ir(t.left)||!Ir(t.right))throw new e.b(`Attempted to enumerate S \\cup T when S:\n${R(t.left)}\nand T:\n${R(t.right)}\nare not both enumerable`);if(qr(t.left),qr(t.right),At(t.left))throw new e.N(Ot());let n=Zr(t.left),r=At(t.right)?void 0:Zr(t.right);if(!r||n.length+r.length>Dt())throw new e.N(Ot());return[...n,...r]},Yr=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return I(e).elements;let t=sr(e,()=>Jr(e)),n=I(_r(t)).elements;return e.enumerated=Tn(n),n},Xr=(e,t)=>{if(typeof e!=`object`||Mn(e))return I(e).elements.some(t);let n=fi.sets;n?.push(e),qr(e);let r=ti(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},Zr=e=>{let t=[];return Xr(e,e=>(t.push(e),!1)),t},Qr=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,$r=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every($r);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every($r)&&e.range.every($r);case`SetOperation`:return e.operator!==`\\cup`&&$r(e.left)&&$r(e.right);case`FilteredSet`:return $r(e.base);case`ProductSet`:return e.factors.every($r);default:return!1}},ei=e=>typeof e!=`object`||Mn(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?ei(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||ei(e.left)||ei(e.right):Qr(e)?.some(ei)??!1,ti=(e,t)=>{if(e.kind===`Union`)return Rr(e,Zr).some((n,r)=>Xr(zr(n,r,e),t));if(e.kind===`FilteredSet`&&Ir(e.base))return Xr(e.base,n=>e.test(n,!1)&&t(n));if(Qr(e)?.some(ei))return Kr(e,Zr).some(t);if(e.kind!==`SetOperation`)return I(e).elements.some(t);if(e.operator===`\\cup`)return!Ir(e.left)||!Ir(e.right)?I(e).elements.some(t):Xr(e.left,t)||Xr(e.right,t);let n=e.operator===`\\`||Ir(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return Ir(r)?Xr(r,n=>hi(n,i)===(e.operator===`\\cap`)&&t(n)):I(e).elements.some(t)},ni=t=>{if(typeof t!=`object`||!P(t))throw new e.b(`Shouldn't call isEmpty() on value ${R(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(ni);case`RecordSet`:return t.sets.some(ni);case`FunctionSet`:return!ni(t.domain)&&ni(t.range);case`Union`:return Rr(t).every((e,n)=>ni(zr(e,n,t)));default:return I(t).elements.length===0}},ri=(t,n,r)=>t.reduce((t,i)=>{let a=t*ai(i,n);if(a>2147483647)throw new e.b(r());return a},1),ii=e=>`Overflow when computing the number of elements in:\n${R(e)}`,ai=(t,n)=>{if(typeof t!=`object`)throw new e.b(`Attempted to compute the number of elements in the ${It(t)} ${R(t)}.`);switch(t.kind){case`ModelValue`:throw new e.b(`Attempted to compute the number of elements in the model value ${R(t)}.`);case`Function`:return t.domain.length;case`LazyFunction`:return ai(t.domain,n);case`Interval`:{let n=Math.max(0,t.high-t.low+1);if(n>2147483647)throw new e.b(`Size of interval value exceeds the maximum representable size (32bits): ${t.low}..${t.high}.`);return n}case`InfiniteSet`:case`SequenceSet`:throw new e.b(`Attempted to compute the number of elements in the overridden value ${R(t)}.`);case`Subset`:{let r=ai(t.base,n);if(r>=31)throw new e.b(ii(t));return 2**r}case`FunctionSet`:{if(n!==`1.7.4`){if(ni(t.domain))return 1;if(ni(t.range))return 0;if(ai(t.range,n)===1)return 1}let r=ai(t.domain,n),i=ai(t.range,n);if(i<=1)return r===0?1:i;let a=1;for(let n=0;n<r;n++)if(a*=i,a>2147483647)throw new e.b(ii(t));return a}case`RecordSet`:return n!==`1.7.4`&&ni(t)?0:ri(t.sets,n,()=>ii(t));case`ProductSet`:return n!==`1.7.4`&&ni(t)?0:ri(t.factors,n,()=>`Overflow when computing the number of elements in ${R(t)}`);default:return In(t),I(t).elements.length}},oi=e=>`Attempted to check if the set ${R(e)}is finite.`,si=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)throw new e.b(`Attempted to check if the ${It(t)} ${R(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${R(t)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return si(t.base)&&ni(t.base);case`Subset`:return si(t.base);case`FunctionSet`:{let e=si(t.domain);if(e&&ni(t.domain))return!0;let n=si(t.range);return n&&ni(t.range)?!0:n&&(e||ai(t.range)===1)}case`RecordSet`:case`ProductSet`:{let e=t.kind===`RecordSet`?t.sets:t.factors,n=!0;for(let t of e)if(!si(t))n=!1;else if(ni(t))return!0;return n}case`Union`:if(!Ir(t.base))throw new e.b(`Attempted to check if the nonenumerable set:\n${Lr(t)}\nis a finite set.`);return I(t.base).elements.every(si);case`SetOperation`:if(t.operator===`\\cup`)return si(t.left)&&si(t.right);if(t.operator===`\\cap`){if(!si(t.left)&&!si(t.right))throw new e.b(oi(t));return!0}if(si(t.left))return!0;if(!si(t.right))throw new e.b(oi(t));return!1;case`FilteredSet`:if(!si(t.base))throw new e.b(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${R(t.base)}\nis finite.`);return!0}},ci=(e,t,n=bn)=>{let r=0,i=e.length-1;for(;r<=i;){let a=r+i>>1,o=n(e[a],t);if(o===0)return a;o<0?r=a+1:i=a-1}return-1},li=(t,n)=>{let r=t.elements;if(r.length>Dt())throw new e.N(Ot());let i=Array.from({length:r.length},()=>!1),a=n.filter(e=>{let t=ci(r,e);return!i[t]&&(i[t]=!0,!0)}),o=Tn(r);return a.some((e,t)=>e!==r[t])&&(o.writtenElements=a),o},ui=t=>{if(typeof t!=`object`||!Nt(t))return;if(t.kind===`LazyFunction`&&(!P(t.domain)||pn(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=L(t);return n.domain.every((e,t)=>e===t+1)?n.range:void 0},di=(e,t)=>{let n=`Attempted to check if the value:\n${R(e)}\nis an element of the`;if(!Nt(t))return`${n} ${It(t)} ${R(t)}`;let r=An(t);return r===`record`?`Attempted to check if element:\n${R(e)}\nis in the record:\n${R(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${R(t)}`},fi={sets:void 0},pi=(t,n,r,i)=>{let a=fi.sets,o=fi.callStack,s=a?.length??0,c=o&&{...o,length:o.expressions.length};try{return t(r,i)}catch(t){if(!(t instanceof e.b))throw t;return a&&(a.length=s),o&&c&&(o.expressions.length=c.length,o.isFrozen=c.isFrozen,o.fingerprint=c.fingerprint),n(r,i,t)}},mi=e=>(fi.sets??[]).slice(e).some(e=>typeof e==`object`&&fi.callStack?.sources.has(e)===!0),hi=(e,t)=>{let n=fi.sets;if(n===void 0)return bi(e,t);n.push(t);let r=bi(e,t);return n.pop(),r},gi=(e,t)=>{let n=t.elements,r=0,i=n.length-1;for(;r<=i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;if(a===e)return!0;a<e?r=t+1:i=t-1}return!1},_i=(e,t)=>ci(t.elements,e)!==-1,vi=(e,t)=>t.isNormalized?cr(e,t.elements).isFound:lr(e,ur(t)),yi=(t,n)=>{if(t.type!==void 0)throw new e.b(`Attempted to check if the typed model value ${M(R(t))} is an element of\n${M(R(n))}`);return!1},bi=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return gi(e,t)??xi(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return xi(e,t)},xi=(t,n)=>{if(!P(n))throw new e.b(di(t,n));switch(n.kind){case`Set`:return In(t),pi(_i,vi,t,n);case`MixedSet`:return lr(t,n.elements);case`Interval`:if(typeof t==`number`)return t>=n.low&&t<=n.high;if(n.low<=n.high&&(!Pt(t)||t.type!==void 0))throw new e.b(`Attempted to check if the value:\n${R(t)}\nis in the integer interval ${R(n)}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(Pt(t))return yi(t,n);if(!(n.name===`STRING`?typeof t==`string`:typeof t==`number`))throw new e.k(`Attempted to check if the value:\n${R(t)}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof t==`number`&&t>=0;case`Subset`:if(!P(t)||pn(t))throw new e.b(`Attempted to check if the non-enumerable value\n${M(R(t))}\nis element of\n${M(R(n))}`);return I(t).elements.every(e=>hi(e,n.base));case`FunctionSet`:{if(!Nt(t)){if(Pt(t))return yi(t,n);throw new e.b(`Attempted to check if \n${R(t)}\nwhich is not a TLC function value, is in the set of functions:\n${M(R(n))}`)}let r=L(t),i=Wn(t,r.domain);return(i===void 0?pr(n.domain,Tn(r.domain)):pr({kind:`Interval`,low:i,high:i+r.domain.length-1},n.domain))&&r.range.every(e=>hi(e,n.range))}case`RecordSet`:{let r=Nt(t)?L(t):void 0;if(!r||!Gt(r.domain)){if(Pt(t))return yi(t,n);throw new e.b(`Attempted to check if non-record\n${R(t)}\nis in the set of records:\n${R(n)}`)}return r.domain.length===n.names.length&&n.names.every((e,t)=>{let i=ci(r.domain,e);return i!==-1&&hi(r.range[i],n.sets[t])})}case`ProductSet`:{let r=Nt(t)?ui(t):void 0;if(r===void 0){let r=Nt(t)&&L(t).domain.every(e=>typeof e==`number`);if(Pt(t))return yi(t,n);if(r)return!1;throw new e.b(`Attempted to check if non-tuple\n${R(t)}\nis in the set of tuples:\n${R(n)}`)}return r.length===n.factors.length&&r.every((e,t)=>hi(e,n.factors[t]))}case`FilteredSet`:try{return hi(t,n.base)&&n.test(t,!0)}catch(r){throw!(r instanceof e.b)||!it(r)?r:new e.b(`Cannot decide if element:\n${M(R(t))}\n is element of:\n${M(R(n.base))}\nand satisfies the predicate ${n.source?.predicate}`)}case`Union`:{if(!Ir(n.base))throw new e.b(`Attempted to check if:\n ${R(t)}\nis an element of the non-enumerable set:\n ${Lr(n)}`);let r=I(n.base).elements;return r.length>1&&r.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),r.some(e=>hi(t,e))}case`SetOperation`:return n.operator===`\\cup`?hi(t,n.left)||hi(t,n.right):hi(t,n.left)&&hi(t,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=ui(t);if(r===void 0){if(Pt(t))return yi(t,n);throw new e.k(`Attempted to check if the value:\n${M(R(t))}\nis an element of ${M(R(n))}.`)}return r.every(e=>hi(e,n.base))}default:throw new e.b(di(t,n))}},Si=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?hi(e,n):e.range.every((e,r)=>Si(e,t.range[r],n.range)),L=t=>{if(typeof t==`object`&&t.kind===`Function`)return t;if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return t.enumerated;if(F(t.domain)||ai(t.domain),!P(t.domain))throw new e.b(`The domains of formal parameters must be enumerable.`);let n=jr(t.domain);return t.enumerated=kn(Dn(n,n.map(e=>t.apply(e))),An(t)),t.enumerated}throw new e.b(`Expected a function but found ${R(t)}`)},Ci=(e,t,n)=>{let r=M(R(e)),i=M(R(t)),a=n===`1.7.4`;switch(An(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},wi=(e,t)=>{if(!nn)return Ci(e,t);let n=M(R(t));return An(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Ti=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},Ei=t=>new e.b(`Attempted to apply function with integer domain to the non-integer argument ${M(R(t))}`),Di=(e,t)=>ci(e.domain,t),Oi=(e,t,n)=>{let r=Bt(e);throw nn||r!==e.domain||r.length<32?r.forEach(e=>ar(e,t)):ci(r,t,ir),n},ki=(t,n,r)=>{let i=t.domain;if(typeof n!=typeof i[0]){let a=An(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&&!nn&&typeof n!=`number`&&Ar(i))throw Ei(n)}let a=Ti(i,n);return a===-1?pi(Di,Oi,t,n):a},Ai=(t,n,r)=>{let i=t.domain,a=ui(r),o=(e,n,r)=>`In applying the function\n${M(R(t))},\nthe ${e} is:\n${M(R(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 ${R(r)}, which is not in its domain`);if(n.forEach((t,n)=>{if(n>=a.length)throw s();let r=a[n],c=`argument number ${n+1}`;if(!hi(r,i.factors[n]))throw new e.b(o(c,r,t===void 0?`is not in the function's domain ${R(i)}`:`is not in its domain`));if(t!==void 0&&ui(r)?.length!==t)throw new e.b(o(c,r,`does not match its formal parameter`))}),a.length>n.length)throw s()},ji=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!hi(t,e.lambdaDomain),Mi=(t,n,r)=>{if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return Mi(t.enumerated,n,r);let i=t.boundTupleLengths;if(i!==void 0)return Ai(t,i,n),t.apply(n);if(!hi(n,t.domain))throw new e.b(An(t)===`lambda`?Ci(t,n):`Attempted to apply a function to ${R(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 ${R(t)}, which is not a function`);let i=r??Ci;if(ji(t,n))throw new e.b(i(t,n));let a=ki(t,n,i);if(a===-1)throw new e.b(i(t,n));return t.range[a]},Ni=e=>Ar(e)?Dr.get(e)??Mr(e.length):void 0,Pi=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=L(e);if(t.functionClass===`lambda`&&t.lambdaDomain)return t.lambdaDomain;let n=Ni(t.domain);if(n)return n;let r=Tn(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},Fi=(t,n,r,i=!1)=>{if(typeof t==`object`&&t.kind===`LazyFunction`&&(i||t.enumerated===void 0)){if(!hi(n,t.domain))return t;let e=r(t.apply(n));return kn({kind:`LazyFunction`,domain:t.domain,apply:r=>pr(n,r)?e:t.apply(r),source:t.source,boundTupleLengths:t.boundTupleLengths},An(t))}if(!Nt(t))throw new e.b(`Attempted to apply EXCEPT construct to the value ${M(R(t))}.`);let a=L(t);if(ji(a,n))return a;let o=ki(a,n,wi);if(o===-1)return a;let s=[...a.range],c=a.range[o],l=r(c);s[o]=l;let u=kn(Dn(a.domain,s),An(a));if(u.writtenKeys=a.writtenKeys,u.lambdaDomain=a.lambdaDomain,a.hash!==0&&a.hash!==Vi){let e=Ki(l);if(e!==Vi){let t=Ki(a.domain[o]);u.hash=c===l?a.hash:a.hash-Bi(t,Ki(c))+Bi(t,e)|0}}if(a.fingerprint!==0){let e=a.domain[o];u.fingerprint=c===l?a.fingerprint:a.fingerprint-Xi(e,c)+Xi(e,l)|0}return u},Ii=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Li=(e,t)=>Math.imul(e^t,16777619),Ri=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Ii(t)},zi=e=>Ii(e+2654435769|0),Bi=(e,t)=>Ii(Math.imul(e,668265261)+t|0),Vi=795548749,Hi=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Ki(t[e]);if(r===Vi)return Vi;n=n+zi(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Ki(e.domain[n]),i=Ki(e.range[n]);if(r===Vi||i===Vi)return Vi;t=t+Bi(r,i)|0}return t},Ui=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)return;if(t.kind===`InfiniteSet`||t.kind===`SequenceSet`)throw new e.b(`TLC has found a state in which the value of a variable contains ${R(t)}`);if(P(t)){I(t).elements.forEach(Ui);return}let n=L(t);n.domain.forEach(Ui),n.range.forEach(Ui)},Wi=t=>{if(typeof t==`object`&&t.kind!==`ModelValue`)try{Ki(t)===Vi&&Ui(t);return}catch(t){if(!(t instanceof e.b))throw t;return t}},Gi=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},Ki=e=>typeof e==`number`?Ii(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?Ri(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=Hi(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?F(e.domain)?Ki(L(e)):Vi:F(e)?Ki(I(e)):Vi,qi=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Ji=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return qi(t)},Yi=e=>qi(Qi(e)+2135587861|0),Xi=(e,t)=>qi(Math.imul(Qi(e),374761393)+Qi(t)|0),Zi=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Yi(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Xi(e.domain[n],e.range[n])|0;return t},Qi=e=>typeof e==`number`?qi(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?Ji(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Zi(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?Qi(L(e)):F(e)?Qi(I(e)):Ji($i(e)),$i=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):ea(e),ea=t=>{if(t.kind===`ModelValue`)return`@${t.name}`;if(t.kind===`InfiniteSet`)return`<${t.name}>`;if(t.kind===`SequenceSet`)return`<Seq ${$i(t.base)}>`;if(t.kind===`FilteredSet`&&!F(t))throw new e.b(`Attempted to compare the non-enumerable set ${R(t)} with another value`);if(P(t))return F(t)?`{${I(t).elements.map($i).join(`,`)}}`:`<${t.kind} ${R(t)}>`;let n=L(t);return`(${n.domain.map((e,t)=>`${$i(e)}:${$i(n.range[t])}`).join(`,`)})`},ta={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},na=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>ta[e])}"`,ra=1999,ia=e=>e.reduce((e,t)=>e===0?0:e*ai(t),1),aa=e=>{if(e.kind===`Subset`)return ai(e.base)<=6?I(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return I(e);if(e.kind===`FunctionSet`){let t=ni(e.domain)?0:ai(e.domain);return(t===0?1:ai(e.range)**t)<=ra?I(e):void 0}return ia(e.kind===`RecordSet`?e.sets:e.factors)<=ra?I(e):void 0},oa=(t,n)=>{if(n||t.kind===`Union`||t.kind===`Subset`&&Nt(t.base)&&(t.base.kind===`Function`||F(t.base.domain)))return aa(t);if(F(t))try{return aa(t)}catch(t){if(t instanceof e.b)return;throw t}},sa=(e,t)=>{let n=e=>R(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 Lr(e,t)}},ca=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),la=t=>{if(F(t.domain))try{return L(t)}catch(t){if(t instanceof e.b||e.tt(t))return;throw t}},ua=e=>{let t=[],n=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:if(e.elements.forEach(n),e.isNormalized)return;e.isNormalized=!0,t.push(e);return;case`MixedSet`:e.elements.forEach(n),I(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=>R(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1})}},R=(e,t=!1,n=!1)=>{let r=e=>R(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return na(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(I(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=rn.isExpanded?oa(e,t):void 0;return n?r(n):sa(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?rn.isExpanded||!e.source?la(e):void 0:e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${R(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&nn&&An(e)!==`tuple`)return`<< >>`;let a=r=>R(r,t,n&&An(e)!==`lambda`);if(i.domain.length===0&&An(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]]):Ht(i);return An(e)===`record`||i.domain.every(e=>typeof e==`string`&&ca(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},da=(t,n)=>{if(t===void 0)return!1;try{return Rn(t,n)}catch(t){if(t instanceof e.b)return!1;throw t}},fa=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,pa=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(fa,(e,a,o=``,s,c,l=``)=>{let u=e=>o.includes(`-`)?e.padEnd(Number(s)):e.padStart(Number(s??0)),d=o.includes(`<`),f=o.replace(`<`,``);if(l===`n`&&e===`%n`)return`
|
|
74
|
-
`;if(l===`%`&&c===void 0&&/^-?$/.test(f))return f===`-`&&s===void 0&&(i=!1),u(`%`);let p=d?r:a===void 0?n++:Number(a.slice(0,-1))-1;r=p;let m=t[p];if(!`sSbBhH`.includes(l)||l===``||!/^-?$/.test(f)||f===`-`&&s===void 0||m===void 0)return i=!1,e;let h=l.toLowerCase(),g=h===`s`?m:h===`b`?`true`:(Ve(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},ma=(t,n)=>{let r=n?void 0:on.get(t);if(r)return r();let i=Object.entries(t),a=cn.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 ${R(s)}, but it must be a string.`);return i.filter(([e])=>!(o&&e===`_format`)).filter(([e,t])=>!n||!da(n[e],t)).map(([t,n])=>{let r=pa(s,[t,M(R(n))]);if(r===void 0)throw new e.g(`The _format field of the ALIAS ${a} is ${R(s)}, but it must format two strings, the name and the value of a field.`);return r}).join(``)},ha=[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 ga=ha[0];const _a=()=>ga,va=/* @__PURE__ */ new Int32Array(256),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);let Ea=0,Da=0,Oa=0,ka=0;const Aa=e=>{let t=(e^ka)&255;ka=(ka>>>8|Oa<<24)^Sa[t],Oa=Oa>>>8^va[t]},ja=e=>{let t=ha[e];ga=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);va[e]=Number(BigInt.asIntN(32,t>>32n)),Sa[e]=Number(BigInt.asIntN(32,t))}let i=[va,ya,ba,xa],a=[Sa,Ca,wa,Ta];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)^Sa[o],i[e][r]=t[r]>>>8^va[o]}}Ea=Number(BigInt.asIntN(32,t>>32n)),Da=Number(BigInt.asIntN(32,t))};ja(0);const Ma=e=>{let t=ka^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;ka=Oa^Ta[n]^wa[r]^Ca[i]^Sa[a],Oa=xa[n]^ba[r]^ya[i]^va[a]},Na=e=>{if(typeof e==`boolean`)return Aa(0),Aa(e?116:102),2;if(typeof e==`number`)return Aa(1),Ma(e),5;if(typeof e==`string`){Aa(3),Ma(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)Ma(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++)Aa(e.charCodeAt(n));return 5+e.length}return Aa(21),Ma(dn(e.name)+1),5},Pa=e=>{let t=Oa,n=ka;Oa=0,ka=0;let r=[Na(e),Oa,ka];return Oa=t,ka=n,r},Fa=e=>`m = (${e} ^ l) & 255; l = ((l >>> 8) | (h << 24)) ^ L0[m]; h = (h >>> 8) ^ H0[m];`,Ia=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];`,La={integer:e=>`${Fa(`1`)} ${Ia(e)}`,boolean:e=>`${Fa(`0`)} ${Fa(`(${e} ? 116 : 102)`)}`,set:e=>`${Fa(`5`)} ${Ia(e)}`,function:e=>`${Fa(`9`)} ${Ia(e)}`,scalar:(e,t,n)=>`{ let r = ${e}; for (; r >= 4; r -= 4) { ${Ia(`0`)} } for (; r > 0; r--) { ${Fa(`0`)} } h ^= ${t}; l ^= ${n}; }`},Ra=()=>({H0:va,H1:ya,H2:ba,H3:xa,L0:Sa,L1:Ca,L2:wa,L3:Ta,initialHigh:Ea,initialLow:Da}),za=(e,t)=>{let n=Oa,r=ka;ka=e[0],Oa=e[1],Ha(t),e[0]=ka,e[1]=Oa,Oa=n,ka=r},Ba=e=>{Aa(5),Ma(e)},Va=e=>{Aa(9),Ma(e)},Ha=e=>{if(typeof e!=`object`||Pt(e))Na(e);else if(Nt(e)){let t=L(e);Va(t.domain.length);for(let e=0;e<t.domain.length;e++)Ha(t.domain[e]),Ha(t.range[e])}else{let t=I(e).elements;Ba(t.length);for(let e of t)Ha(e)}},Ua=e=>{let t=Oa,n=ka;Oa=Ea,ka=Da;for(let t of e)Ha(t);let r=BigInt(Oa>>>0)<<32n|BigInt(ka>>>0);return Oa=t,ka=n,r},Wa=(e,t)=>{let n=new BigInt64Array(e),r=new Int32Array(n.buffer),i=Oa,a=ka;for(let n=0;n<e;n++)Oa=Ea,ka=Da,t(n),r[2*n]=ka,r[2*n+1]=Oa;return Oa=i,ka=a,n},Ga=(e,t)=>Wa(e.length,n=>{for(let r of t)Ha(e[n][r])}),Ka=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),qa=1024,Ja=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*qa),relations:[]}),Ya=(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},Xa=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,Za=(e,t,n,r,i)=>{let a=t===`next`?Xa(e,t,r):void 0;if(a!==void 0)return a;let o=Ya(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},Qa=(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,$a=(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`}`:Qa(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})`},eo=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,to=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,no=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},ro=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[(Ve(t.name)&2147483647)%e.length].unshift(t));t=e}t[(Ve(e.name)&2147483647)%t.length].unshift(e)}),t.toReversed().flat()},io=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),ao=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),oo=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),so=(e,t,n)=>{let r=new Set(n.map(eo)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(j(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&&!Ka.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=Ya(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(eo(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`?oo(t.bounds):t.params.map(e=>e.name);m(t.body,ao(n,e.scope)),t.kind===`Function`&&io(t.bounds).forEach(t=>m(t,e.scope)),o.pop()},d=e=>e?.definition.kind===`Operator`&&e.definition.params.length>0,f=(e,t,n,r)=>{if(e.kind===`Lambda`)m(e.body,ao(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:case`Lambda`:m(e.body,ao(e.params,t));return;case`Let`:{let n=e.definitions.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),ro(e.definitions).forEach(e=>u({definition:e,scope:n})),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,to(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,no(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,to(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,ao(oo(e.bounds),t)),r(io(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,ao(oo(e.bounds),t)),r(io(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,ao(oo([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,ao(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,ao(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}};e.relations.forEach(e=>{i.push(e.node),m(e.expression,void 0),i.pop()})},co=(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=co(e,r,n);if(t!==-1)return t}}return-1},lo=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=co(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:co(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},uo=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},fo=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},po=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},mo=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},ho=(e,t)=>t.forEach((t,n)=>{let r=Ua([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*qa+i;e.registers[o]=Math.max(e.registers[o],mo(a)+1)}),go=(e,t)=>{let n=e.registers.subarray(t*qa,(t+1)*qa),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*qa*qa/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*qa?a===0?i:qa*Math.log(qa/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},_o=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},vo=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>_o(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},yo=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},bo=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],xo=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},So=(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}},Co=(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||bo(t,e))&&yo(n,r),xo(t,e).forEach(e=>a(e).forEach(e=>yo(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=xo(t,e),l=[];r.forEach(e=>(i.get(e)??a(e)).forEach(e=>yo(l,e)));let u={primary:t.primary[e],secondary:t.secondary[e]},d=bo(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,vo(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 xo(t,n).forEach(e=>{a(e),c(e,0)}),r},wo=[`init`,`next`,`invariant`,`constraint`,`implied`],To=(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,Eo=e=>wo.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>To(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||To(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),Do=(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:go(t,i)}}),relations:Eo(t).map(e=>({kind:e.kind,label:e.label,...So(t,e),expressions:Co(t,e.node)}))}),Oo=(e,t,n)=>{let r=Xa(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]]]},ko=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),Ao=(t,n)=>ko.has(t)?new e.b(n):new e.k(n),jo=(t,n,r,i)=>new e.k(`The ${t} argument of ${n} should be a ${r}, but instead it is:\n${R(i)}`),Mo=(t,n,r=t)=>{if(!P(t)||pn(t))throw new e.k(`Applying ${n} to the following value,\nwhich is not a finite set:\n${R(r)}`);return I(t)},No=e=>typeof e==`object`&&e.kind===`Operator`,z=(e,t,n)=>{let r=e[t];if(r===void 0||No(r))throw Ao(n,`${n} expects a value as argument ${t+1}`);return r},Po=(e,t,n)=>{let r=z(e,t,n);if(typeof r!=`boolean`)throw Ao(n,`${n} expects a boolean but received ${R(r)}`);return r},Fo=(e,t,n)=>{let r=e[t];if(r===void 0||!No(r))throw Ao(n,`${n} expects an operator as argument ${t+1}`);return r},Io=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),B=(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}),Lo=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Ro=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),zo=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(z(n,0,e),z(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Bo=e=>e>2147483647||e<-2147483648,Vo=t=>new e.k(`Overflow when computing ${t}`),Ho={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`},Uo={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Wo={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`},Go={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Ko=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Uo[e.operator];if(e.kind!==`Function`)return Ho[e.kind];let t=An(e);return t===void 0?`FcnRcdValue`:Go[t]},qo=e=>Wo[Ko(e)],Jo=(t,n)=>new e.b(`Attempted to apply the operator overridden by the Java method\n${t},\nbut it produced the following error:\n${n}`),Yo=(t,n)=>{let r=r=>(...i)=>{let a=fi.sets?.length??0;try{return r(...i)}catch(r){if(!(r instanceof e.b)||r instanceof e.v)throw r;let i=mi(a);throw fi.sets&&(fi.sets.length=a),t.isLazy!==!0&&r instanceof e.k&&!i?r:Jo(n,r.message)}},i=r(t.evaluate);return{...t,evaluate:(e,r)=>{if(e.length!==t.arity)throw Jo(n,`array is not of length ${t.arity}`);return i(e,r)},evaluateUnary:t.evaluateUnary&&r(t.evaluateUnary),evaluateBinary:t.evaluateBinary&&r(t.evaluateBinary)}},Xo=(e,t)=>{if(typeof e!=`number`)throw Jo(t,`Cannot cast tlc2.value.impl.${Ko(e)} to tlc2.value.impl.IntValue`);return e},Zo=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Qo=(e,t,n,r)=>{let i=Zo(e,n,`IntValue`,2);return zo(t,(e,n)=>{let a=Xo(n,i),o=Xo(e,i),s=r(o,a);if(Bo(s))throw Vo(`${o}${t}${a}`);return s})},$o=(t,n,r)=>{if(typeof t!=`number`)throw new e.k(`The ${n} argument of ${r} should be an integer, but instead it is:\n${R(t)}`);return t},es=(e,t,n=e)=>zo(e,(e,r)=>t($o(e,`first`,n),$o(r,`second`,n))),ts=(e,t,n)=>({...Ro(e,t,n),isLazy:!0}),ns=(e,t,n)=>{let r=Fo(e,t,n);return()=>r.call([])},rs=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),is=()=>({implication:Nh,negate:Ph,equivalent:Fh,body:Ih,condition:(e,t)=>{if(typeof e!=`boolean`)throw gh(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw _h(t,n,e);return e},apply:Mi,expectFunction:kh,tuple:Nr,set:_r,record:Fr,writtenRecord:Ut,equal:Rn,enumerate:Uh,choiceElements:h_,noChoice:e=>{throw g_(e)},filterPredicate:m_,isReducible:Mt,finiteElements:e=>I(e).elements,addBounded:kt,normalizedSet:En,isBeyondBound:At,cardinality:ai,functionDomain:jr,sortedFunction:Dn,unassigned:(e,t)=>{throw wh(e,t)},prime:zg,keepLazyContext:Ah,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>Dh(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let as,os;const ss=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},cs=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),ls=e=>`local${e.counter++}`,us=(e,t=/* @__PURE__ */ new Set)=>{let n=Be(e);return n!==void 0&&t.add(n),ze(e).forEach(e=>us(e,t)),t},ds=(e,t,n)=>{let r=us(t),i=[...n.locals].filter(([e])=>r.has(e));if(i.length===0)return n.context;let a=cs(e,i.map(([e])=>e));return`extend(${n.context}, ${a}, [${i.map(([,e])=>e).join(`, `)}])`},fs=(e,t,n)=>`${cs(e,qg(t,e.environment))}(${ds(e,t,n)})`,ps=(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})`},ms=(e,t,n,r)=>{let i=ls(e),a=ls(e),o=ls(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} }`},hs=(e,t,n)=>{let r=t.kind===`Forall`;return ps(e,n,n=>{let i=t.bounds.map(()=>ls(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(${Ss(e,r.set,n)}, ${cs(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=ls(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${Ss(e,t.body,n)}, ${cs(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>ms(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},gs=(e,t,n,r,i)=>ps(e,i,i=>{let a=ls(e),o=ls(e),s=cs(e,t),c=`choiceElements(${Ss(e,n,i)}, ${s}, ${cs(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${Ss(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${ms(e,a,o,l)} return noChoice(${s});`}),_s=(e,t,n,r)=>ps(e,r,r=>{let i=ls(e),a=ls(e),o=ls(e),s=ls(e),c=cs(e,t),l=`if (!isReducible(${i})) return ${cs(e,p_(t,e.environment))}(${i}, ${ds(e,t,r)});`,u=Ss(e,t.bound.set,r);r.locals.set(n,s);let d=`if (filterPredicate(${Ss(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${ms(e,a,s,d)} return normalizedSet(${o});`}),vs=(e,t,n,r)=>ps(e,r,r=>{let i=ls(e),a=ls(e),o=ls(e),s=ls(e),c=ls(e),l=ls(e),u=cs(e,u_(t,e.environment)),d=ds(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=Ss(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${Ss(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} = []; ${ms(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),ys=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=Ss(e,r[0],n),a=Ss(e,r[1],n),o=cs(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${Ss(e,r[0],n)}, ${cs(e,t)})`;if(t.operator===`<=>`)return`equivalent(${Ss(e,r[0],n)}, ${Ss(e,r[1],n)}, ${cs(e,t)})`;if(j(t))return fs(e,t,n);let i=gg(t.operator,e.environment);if(i?.kind!==`Builtin`)return fs(e,t,n);if(i.name===`DOMAIN`)return`${cs(e,bh(t))}(${Ss(e,r[0],n)})`;if(i.name===`TLCEval`)return fs(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${cs(e,xh(t,i))}(${Ss(e,r[0],n)}, ${Ss(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Xg(r[0],a))return`${cs(e,i.evaluateUnary)}(${Ss(e,r[0],n)})`;let o=r.length===2&&Xg(r[0],a)&&Xg(r[1],a);return i.evaluateBinary&&o?`${cs(e,i.evaluateBinary)}(${Ss(e,r[0],n)}, ${Ss(e,r[1],n)})`:fs(e,t,n)},bs=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(j(e))return!1;let r=Dg(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return bs(e.expression,t,n);case`FieldAccess`:return bs(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>bs(e,t,n));default:return!1}},xs=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return xs(e.record);case`FunctionApplication`:return[e.function,...e.args].every(xs);default:return!1}},Ss=(e,t,n)=>{let r=(t,r=n)=>Ss(e,t,r);switch(t.kind){case`Number`:return Lt(t.value)?String(t.value):fs(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(j(t))return fs(e,t,n);let i=Dg(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=cs(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?cs(e,i.value):fs(e,t,n)}case`Apply`:return ys(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=cs(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)}, ${cs(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{a_(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${bs(t.function,n,e.environment)?r(t.function):xs(t.function)?r(t.function,i):fs(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${cs(e,t)}))`,o=yh(e.environment.runtime.version),s=o?`, ${cs(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`${cs(e,vh(t))}(${r(t.record)})`;case`Record`:{let i=v_(t.fields);if(y_(i))return fs(e,t,n);let a=cs(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}, ${cs(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?fs(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`)?hs(e,t,n):fs(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?gs(e,t,t.set,t.pattern.name,n):fs(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!l_(t)?vs(e,t,r.pattern.name,n):fs(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?_s(e,t,t.bound.pattern.name,n):fs(e,t,n);default:return fs(e,t,n)}},Cs=(e,t)=>{if(!rs.has(e.kind)||(os??=ss(),!os))return;let n={environment:t,references:[],helpers:[],counter:0},r=Ss(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
|
|
77
|
-
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return as??=is(),Function(...Object.keys(as),...i,a)(...Object.values(as),...n.references)},ws={kind:`Local`},Ts=/* @__PURE__ */ new WeakSet,Es=/* @__PURE__ */ new WeakMap,Ds=/* @__PURE__ */ new WeakMap,Os=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ks=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),As=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,js=e=>e.kind===`Operator`?e.params.length:0,Ms=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Ns=e=>e.name.includes(`!`),Ps=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Fs=(e,t,n)=>{let r=t.bindings.get(e);return r&&As(r.position,t.location)&&(!n||As(r.position,n.start))?r:void 0},Is=(t,n)=>t!==void 0&&n!==void 0&&e.X(t)===e.X(n),Ls=(t,n,r,i)=>{if(n===void 0)return!0;if(Is(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},Rs=(e,t,n,r)=>Ls(t,Ps(e,t)??Fs(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,zs=(e,t,n)=>{Ls(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Bs=(e,t,n,r)=>t.reduce((e,t,i)=>Rs(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Vs=(e,t,n)=>t.reduce((e,t)=>Rs(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Hs=e=>e.kind===`Name`?[e.name]:e.names,Us=e=>e.flatMap(e=>Hs(e.pattern)),Ws=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||As(n.location,t.location))?n:void 0},Gs=(e,t)=>{let n=Ws(e,t);return n?{key:t.getKey(n),arity:js(n),params:Ms(n),kind:`Definition`}:t.imported.get(e)},Ks=(e,t,n)=>Ps(t,e)??Gs(e,n),qs=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Js=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:qs(e.location,e.spelling??t)},Ys=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return As(e.location,e.args[0].location)?`prefix`:`postfix`}},Xs=e=>!/^[\p{L}\d_]/u.test(e),Zs=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Qs=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,$s=(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])}})},ec=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?$s(e.name,[],void 0):$s(e.operator,e.args,e.argumentCounts),tc=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),nc=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Us(e.bounds),body:e.body,sets:tc(e.bounds)};case`SetMap`:return{names:Us(e.bounds),body:e.expression,sets:tc(e.bounds)};case`SetFilter`:return{names:Hs(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Hs(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}},rc=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}},ic=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,ac=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),oc=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?oc(e.body,t):ze(e).reduce((e,n)=>e??oc(n,t),void 0)},sc=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??sc(i,t,n||ac(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&oc(e.set,t):oc(e,t)},cc=e=>e.kind===`Label`?cc(e.body):e,lc=e=>typeof e==`number`?`argument selector ${e}`:e,uc=`within the scope of a declaration
|
|
78
|
-
from outside that declaration's scope.`,dc=(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`&&cc(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:sc(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:o.kind===`Label`?oc(o.body,t.name):void 0};if(!i?.label)return s(r,`Cannot find label \`${t.name}'.`);if(r===1&&l.kind===`AssumeProve`&&ac(l,i.position)&&c)return s(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${uc}`);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=lc(t.operand);if(u.isSufficesOpen){if(Qs(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=cc(o);if([`Number`,`Decimal`,`String`].includes(e.kind))return s(r,`Selecting subexpression of expression that has none.`);let n=e.kind===`Identifier`?Ks(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=nc(e)?.sets,l=e.kind===`Identifier`?[]:c?c.length>0?c:void 0:e.kind===`Except`?void 0:rc(e);if(!l)return;let f=Qs(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=Qs(t.operand,f.length);if(p===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);if(ac(o,p)&&(!u.isGoal||c))return s(r,`Accessing ASSUME/PROVE clause ${uc}`);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.`))},fc=(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)},pc=(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=Ps(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)},mc=(e,t,n,r)=>{if(!ic(e))return!1;let i=ec(e),a=i[0],o=i.length>1&&a.kind===`Name`?Ps(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&dc(e,i,o,t,n,r),o!==void 0},hc=(t,n,r,i)=>{let a=t.location;if(Tc(t,r,i))return;let o=Ds.get(t);if(o!==void 0)return o;if(Os(n))return t.kind===`Apply`?t.args.length:0;let s=Ps(r,n);if(s?.isNonFact){i.errors.push({location:e.X(Js(t,n)),message:`Step number of non-expression step used as an expression.`});return}if(mc(t,r,i,!1)||Zs(n)&&s)return t.kind===`Apply`?t.args.length:0;if(s&&t.kind!==`OperatorReference`&&(t.resolution=ws),s)return s.arity;let c=Gs(n,i);if(c)return t.kind===`Identifier`?t.name=c.key:t.operator=c.key,Ds.set(t,c.arity),c.arity;let l=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``;if(l!==``&&(Ps(r,l)!==void 0||Gs(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===`-.`?qs(a,`-`):Js(t,n));if(!Xs(n)||Zs(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=Ys(t);f&&a.range&&i.errors.push({location:e.X(a.range),message:`Couldn't resolve ${f} operator symbol \`${u}'.`})},gc=(e,t,n)=>(e.forEach(e=>V(e.set,t,n)),e.reduce((e,t)=>Bs(e,Hs(t.pattern),t.pattern.ranges,n),t)),_c=(e,t)=>e.kind===`Identifier`&&e.name===t&&j(e)||ze(e).some(e=>_c(e,t)),vc=(e,t)=>{e.kind===`FunctionConstruction`&&_c(e.body,t)&&(e.isRecursive=!0),ze(e).forEach(e=>vc(e,t))},yc=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?Us(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`?gc(t.bounds,n,a):Vs(n,t.params,a),u=Ps(l,o)??Fs(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`?(V(t.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),vc(t.body,o),t.isSelfReferential=_c(t.body,o)):V(t.body,l,a),u&&d?(u.isPending=!1,u.range=s,!1):t.kind===`Function`?u===void 0:Ls(o,Ps(n,o)??Fs(o,a,s),{kind:`Definition`,arity:js(t),range:s},a)},bc=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Ps(e,t.name)?.isPending)return e;let n={name:t.name,arity:js(t),params:Ms(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)=>jc(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Os(t.name)?e:s(e,e=>!As(t.location,e.location)),o={name:t.name,arity:js(t),kind:`Definition`,range:t.location.range,parent:a};if(Ns(t))return{...o,params:Ms(t)};let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Os(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return yc(t,a,u,i)?{...o,params:Ms(t)}:a},a),()=>!0)},xc=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Ps(t,r)??Fs(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},Sc=(t,n,r)=>{if(t.kind!==`Identifier`&&t.kind!==`Apply`)return!1;let i=xc(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},Cc=(t,n,r)=>{if(Sc(t,n,r))return;let i=t.operator,a=Ks(i,n,r),o=hc(t,i,n,r);if(o===void 0)return;if(o!==t.args.length){r.errors.push({location:e.X(t.argumentsRange??Js(t,i)),message:`The operator ${i} requires ${o-(xc(i,n,r)?.arity??0)} arguments.`});return}let s=a&&(a.kind===`Definition`?a.params:[]);if(s===void 0){t.args.forEach(e=>wc(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=hc(e,e.operator,n,r);t!==void 0&&c(l,`The operator ${e.operator} requires ${t} arguments.`)}else V(e,n,r);return!0}if(e.kind===`Lambda`){V(e,n,r);let s=e.params.length===o;return!s&&Ts.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)??Js(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 V(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=Ks(u,n,r)?.params??[],f=hc(e,u,n,r);return e.kind===`Identifier`&&f!==void 0&&f!==o&&c(Js(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.`)})},wc=(e,t,n)=>{e.kind===`Identifier`?hc(e,e.name,t,n):V(e,t,n)},Tc=(e,t,n)=>{let r=Es.get(e);return r?(r.args.forEach(e=>wc(e,t,n)),n.errors.push(r.error),!0):!1},V=(t,n,r)=>{if(Ts.has(t)&&!r.isGenerated){V(t,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>V(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(Sc(t,n,r))return;let i=t.name,a=hc(t,i,n,r);a!==void 0&&a>0&&r.errors.push({location:e.X(Js(t,i)),message:`The operator ${i} requires ${a} arguments.`});return}case`OperatorReference`:hc(t,t.operator,n,r);return;case`Apply`:Cc(t,n,r);return;case`Lambda`:V(t.body,Bs(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`:V(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&&V(t.other,n,r);return;case`Let`:V(t.body,bc(t.definitions,n,r,t.instances),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:V(t.body,gc(t.bounds,n,r),a(Us(t.bounds)));return;case`UnboundedQuantifier`:V(t.body,Bs(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&V(t.set,n,r),V(t.body,Bs(n,Hs(t.pattern),t.pattern.ranges,r),a(Hs(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:V(t.predicate,gc([t.bound],n,r),a(Hs(t.bound.pattern)));return;case`SetMap`:V(t.expression,gc(t.bounds,n,r),a(Us(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??qs(i.location,i.name)),message:`Non-unique fields in constructor.`}),V(i.value,n,r)});return;case`Except`:V(t.function,n,r),t.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),V(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:i([t.function,...t.args]);return;case`FieldAccess`:V(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(fc(t,r))return;V(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),pc(t,n,r);return;case`Subexpression`:if(Tc(t,n,r))return;t.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>wc(e,n,r)),mc(t,n,r,!1)}},Ec=(t,n,r)=>t.forEach(t=>{if(t.kind===`ModuleFact`||Sc(t,n,r)||mc(t,n,r,!0))return;let i=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;t.kind===`Identifier`&&Ps(n,i)?.isNonFact?r.errors.push({location:e.X(Js(t,i)),message:`Step number of non-fact used as a fact`}):r.facts.has(i)||V(t,n,r)}),Dc=(e,t,n)=>(e.set&&V(e.set,t,n),Rs(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Oc=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Dc(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Oc(t,e.scope,e.unit,!0):V(t,e.scope,e.unit),e),{scope:t,unit:n});return V(e.conclusion,i.scope,i.unit),i.scope},kc=(e,t,n)=>e.kind===`AssumeProve`?Oc(e,t,n):(V(e,t,n),t),Ac=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Ec(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Mc(t,e,r),t)},jc=(e,t,n)=>{let r=Rc(e,t,n);return e.name===void 0?r:Rs(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Mc=(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=kc(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Ac(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Ac(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 Ec(r.facts,t,n),o(t);case`Instance`:return o(jc(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?jc(t,e,i):bc([t],e,n),t));case`Have`:case`Case`:return V(r.expression,t,i),Ac(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>V(e,t,i)),a(t);case`Take`:return a(Bs(gc(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Bs(gc(r.bounds,t,i),r.names,r.nameRanges,i);return V(r.body,o,{...i,labelParams:[...i.labelParams,...Us(r.bounds),...r.names]}),Ac(e.proof,a(t),n),a(o)}default:return Ac(e.proof,a(t),n),a(t)}},Nc=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:kc(e.statement,void 0,t);e.name!==void 0&&zs(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Ac(e.proof,n,t),r&&(r.isInProof=!1)},Pc={line:0,column:0},Fc=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Ic=(e,t)=>{let n=new Map([...ks,...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},Lc=(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`){V(r,o,a);return}let i=hc(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=>!Ps(o,e.name)&&!Gs(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},Rc=(e,t,n)=>{let r=n.getInstance(e);return Lc(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Rs(e,t,r,n),t)},zc=(e,t,n,r)=>{let i=Ic(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Lc(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:Pc}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Bc=(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)=>As(e.location,t.location)?-1:+!!As(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},Vc=(t,n)=>{let r=Ic(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([...ks,...n.bound].map(([e,t])=>[e,{...t,position:Pc}])),s=/* @__PURE__ */ new Set,c=[],l=(e,t,s,c)=>({location:e,check:(l,u)=>c({imported:r,getInstance:n.getInstance,definitions:n.definitions,getKey:n.getKey,location:e,self:t,facts:i,goals:a,bindings:o,errors:l,warnings:u,hasLabelScope:s,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})}),u=(e,t)=>e.map(e=>l(e.location,void 0,!1,n=>zs(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return Bc([...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=>l(e.location,void 0,!1,t=>{let n={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},r=Ls(e.name,o.get(e.name),n,t);r&&(o.set(e.name,n),s.add(n)),c.push({declaration:e,binding:r?n:void 0})})),...t.definitions.map(e=>l(e.location,e,!0,n=>{Fc(t,e)?V(e.body,void 0,n):yc(e,void 0,n,s)&&o.set(e.name,{kind:`Definition`,arity:js(e),range:e.location.range,position:e.location})})),...t.instances.map(e=>l(e.location,void 0,!1,t=>{Vs(void 0,e.params,t),n.instanced.get(e)?.forEach((e,n)=>zs(n,e,t)),e.name!==void 0&&zs(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},t)})),...t.assumptions.map(e=>l(e.location,void 0,e.name!==void 0,t=>{V(e.expression,void 0,t),e.name!==void 0&&zs(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t)})),...t.theorems.map(e=>l(e.location,void 0,e.name!==void 0,t=>Nc(e,t))),...t.uses.map(e=>l(e.location,void 0,!1,t=>Ec(e.facts,void 0,t))),{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)},Hc=/* @__PURE__ */ new WeakSet,Uc=/* @__PURE__ */ new WeakMap,Wc=(e,t)=>{if(t.length===0)return e;let n={...e};return Hc.has(e)&&Hc.add(n),Uc.set(n,[...t,...Uc.get(e)??[]]),n},Gc=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Zc(e,(e,r)=>Gc(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&j(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&j(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Kc=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),qc=/* @__PURE__ */ new WeakMap,Jc=e=>qc.get(e)??e.name,Yc=(e,t)=>(Jc(t)!==e.name&&qc.set(e,Jc(t)),e),Xc=(e,t)=>Yc(e.kind===`Function`?{...e,bounds:Kc(e.bounds,e=>t(e,[])),body:t(e.body,Us(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Zc=(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=>Xc(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Kc(e.bounds,n),body:t(e.body,Us(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,Hs(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,Hs(e.bound.pattern))};case`SetMap`:return{...e,bounds:Kc(e.bounds,n),expression:t(e.expression,Us(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)}}},Qc=(e,t)=>{Zc(e,(e,n)=>(t(e,n),e))},$c=`LAMBDA`,el=e=>`${e}@SUBSTITUTION`,tl=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(tl),nl=(e,t)=>{if(e.kind!==`Identifier`)return!tl(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=j(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!tl(n.body)},rl=(e,t=/* @__PURE__ */ new Set)=>{let n=Be(e),r=n===void 0||t.has(n)?[]:[n];return Qc(e,(e,n)=>r.push(...rl(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},il=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}},al=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),ol=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},sl=(e,t)=>e.map(e=>({pattern:ol(e.pattern,t),set:e.set})),cl=(e,t)=>e.kind===`Function`?{...e,bounds:sl(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},ll=(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=>Yc({...cl(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:sl(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:ol(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:ol(e.bound.pattern,n),set:e.bound.set}};default:return e}},ul=e=>`${e}@ENABLED`,dl=(e,t)=>e.modes.get(t)??e,fl=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!j(e)&&t.instantiation.variables.has(e.name),pl=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>pl(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(fl(e,t,n))return[e.name];let r=j(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?pl(r.body,t,/* @__PURE__ */ new Map):void 0},ml=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return fl(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:ul(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:bl(e.expression,dl(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[bl(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:bl(e.subscript,dl(t,`Primed`),n),location:r},bl(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=pl(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:ul(r),location:e.location},location:e.location},bl({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},hl=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:ws}),gl=(e,t)=>e.map(e=>hl(e.name,t)),_l=(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:gl(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),vl=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...gl(t,r),...i.map(e=>hl(e,r))],location:r},location:r}},yl=(e,t)=>e.instantiation.isParameterized(t)?Sl(e,t):void 0,bl=(t,n,r)=>{let i=e=>bl(e,n,r),a=n.instantiation,o=a.params,s=e=>!r.has(e)&&!j(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:bl(t.expression,dl(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:bl(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},dl(n,`Enabled`),r)};let c=ml(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||!nl(e,a)))return Wc(e,[t]);if(e&&r){let n=el(t.name);return r.set(n,e),hl(n,t.location)}let i=yl(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&&js(s)>0?vl(i,o,js(s),t.location):{kind:`Apply`,operator:i,args:gl(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||Hc.has(t),l=e=>(c&&Hc.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:$c,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:$c,args:r,resolution:ws},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=yl(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[...gl(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 Wc(e,[t]);let r=yl(n,t.operator);if(r===void 0)return t;let i=a.getDefinition(t.operator);return o.length>0&&i?vl(r,o,js(i),t.location):{...t,operator:r}}let l=il(n),u=Zc(t,(e,t)=>t.length===0?i(e):bl(e,n,al(r,t,l)));return ll(u,r,l)},xl=(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:hl(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Sl=(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=il(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=cl(Xc(i,(e,t)=>bl(e,s,al(/* @__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&&Uc.set(l,[u,...Uc.get(i.body)??[]]),xl({...c,body:l},r.params,i.location)}):t},Cl=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>rl(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=>yl(i,e)??e,getQualifiedKey:t=>{let n=yl(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>xl(r,e.params,r.location)):t}}},wl=e=>e.kind===`Let`&&e.instances!==void 0||ze(e).some(wl),Tl=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Zc(e,e=>Tl(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>As(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}},El=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Dl=(e,t)=>e.definitions.some(e=>wl(e.body))||e.assumptions.some(e=>wl(e.expression))||e.theorems.some(e=>{let t=El(e);return t!==void 0&&wl(t)})?{...e,definitions:e.definitions.map(e=>Xc(e,e=>Tl(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Tl(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=El(e);return n===void 0?e:{...e,statement:Tl(n,t,[])}})}:e,Ol=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],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}])),kl={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]}},Al=(e,t)=>{let n=kl[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},jl=(e,t)=>`${e}${t}`,Ml=(e,t,n)=>`${e}${t}${n}`,Nl=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Pl=(e,t,n)=>`${e},${t},${n}`,Fl=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Il=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Ll=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Rl=(e,t)=>{t.constraints.forEach((t,n)=>Il(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>Ll(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},zl=(e,t,n,r)=>({...Fl(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Bl=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Vl=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Hl=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,{...zl(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Ul=zl(`$Set`,0,[2],[1]),Wl=zl(`$Junction`,0,[3],[1]),Gl=zl(`$Choose`,0,[2],[1]),Kl=zl(`$Function`,0,[3],[1]),ql=zl(`$FcnApply`,0,[2,2],[1,1]),Jl=zl(`$RcdSelect`,0,[2,0],[1,1]),Yl=zl(`'`,2,[1],[0]),Xl=zl(`ENABLED`,1,[2],[0]),Zl=zl(`[]`,3,[3],[0]),Ql=zl(`$SquareAct`,2,[2,1],[0,0]),$l=zl(`$WF`,3,[1,2],[0,0]),eu=zl(`$TemporalExists`,3,[3],[0]),tu=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),nu=e=>e.map(e=>({name:e,arity:0})),ru=(t,n)=>n.location.range?e.J(`${t}.`,n.location.range):new e.F(`${t} at line ${n.location.line}, column ${n.location.column}`),iu=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),au=e=>e.kind!==`Let`&&e.kind!==`Label`,ou=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:v(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=v(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Hl.get(e)??Ol.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},i=(e,t,n)=>{let r=Fl(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(Ml(e,n,t))}),Ll(r.argConstraints,jl(e,n),t.data.level),Rl(r,t.data)}),r},a=(t,n,r=[],i=[])=>{let a=e=>i.includes(e);if(n.forEach((n,r)=>{if(n.kind===`Value`&&n.data.level>Bl(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(Pl(e,n,r)),c=Fl(Math.max(t.level,...n.filter((e,n)=>Vl(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)=>{Vl(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)=>Il(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||Il(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>Il(c.constraints,t,e))),n.forEach((e,n)=>e.data.params.forEach(e=>{a(e)||Il(c.constraints,e,Bl(t,n))})),n.forEach((e,t)=>{if(e.kind!==`Operator`)return;let r=e.data;n.forEach((e,n)=>r.formals.forEach((i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>Il(c.constraints,e,Bl(r,a)))}))}),t.argParams.forEach(e=>{let t=Nl(e),n=o(t.operator);n?.kind===`Operator`&&Il(c.constraints,t.param,Bl(n.data,t.index))}),[t.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Ll(c.argConstraints,t,e))),n.forEach((e,r)=>{if(e.kind!==`Declared`)return;let i=e.declared;Array.from({length:i.arity},(e,n)=>Ll(c.argConstraints,jl(i.name,n),t.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&Ll(c.argConstraints,jl(i.name,a),e.data.level)}))}),t.argParams.forEach(e=>{let t=Nl(e),n=o(t.operator);n&&Ll(c.argConstraints,jl(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a(Nl(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),t.argParams.forEach(e=>{let t=Nl(e),n=o(t.operator);if(n)n.kind===`Declared`&&c.argParams.add(Ml(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(Ml(t.operator,t.index,e)))}}),n.forEach((e,t)=>{if(e.kind!==`Declared`)return;let r=e.declared;n.forEach((e,n)=>Array.from({length:r.arity},(i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>c.argParams.add(Ml(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:_(`LAMBDA`,nu(e.params),e.body,t)};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{kind:`Operator`,data:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=Fl();return e.params.add(n),{kind:`Declared`,data:e,declared:{name:n,arity:i.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:Fl()}}return{kind:`Value`,data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=tu(n,nu(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 ru(`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 ru(`Action used where only temporal formula or state predicate allowed`,e);iu.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&au(n)&&n.kind!==r)throw ru(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=>Rl(i,v(e,n))),i},m=(t,n)=>{try{return h(t,n)}catch(n){throw!(n instanceof e.F)||n.sany?n:ru(n.message,t)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Fl();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(Wl,n)}case`Prime`:case`Unchanged`:return c(Yl,[e.expression],t);case`Enabled`:return c(Xl,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(Zl,[n])}case`If`:return c(Wl,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(Wl,[...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(Wl,[e.body],t,e.bounds.map(e=>e.set),Us(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw ru(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?eu:Wl,[e.body],t,[],e.names);case`Choose`:return c(Gl,[e.body],t,e.set?[e.set]:[],Hs(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(Ul,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(Ul,[e.predicate],t,[e.bound.set],Hs(e.bound.pattern));case`SetMap`:return c(Ul,[e.expression],t,e.bounds.map(e=>e.set),Us(e.bounds));case`FunctionConstruction`:return c(Kl,[e.body],t,e.bounds.map(e=>e.set),Us(e.bounds));case`Record`:return c(Kl,e.fields.map(e=>e.value),t);case`RecordSet`:return c(Ul,e.fields.map(e=>e.value),t);case`Except`:return c(Ul,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(ql,[o(e.function,t),e.args.length===1?o(e.args[0],t):{kind:`Value`,data:c(Ul,e.args,t)}]);case`Bracket`:return Fl();case`FieldAccess`:return a(Jl,[o(e.record,t),{kind:`Value`,data:Fl()}]);case`BoxAction`:case`AngleAction`:return c(Ql,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c($l,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Fl()}},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 ze(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,tu(t,nu(e.names))),i;default:return Qc(e,(e,r)=>a(e,n,tu(t,nu(r)))),i}},_=(e,t,n,r)=>{let i=tu(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...Fl(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(jl(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(Ml(e.name,n,t.name))).map(e=>Pl(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(Nl(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Nl(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},v=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{...Fl(),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:v,toOperand:o}},su=(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`?su(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Fl(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),Rl(a,e)}),a},cu=(t,n,r,i)=>{let a=ou(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`?su(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=Bc([...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`?su(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)},lu=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),uu=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),du=/* @__PURE__ */ new Set([...lu,...uu,`Enabled`]),fu=/* @__PURE__ */ new Set([`~>`,`-+->`]),pu=/* @__PURE__ */ new Set([...fu,`\\cdot`]),mu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),hu=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),gu=/* @__PURE__ */ new Set([`RandomSubset`,`RandomSetOfSubsets`,`TestRandomSetOfSubsets`,`RandomSubsetSet`]),_u=(e,t)=>mu.has(e)||t.builtins.get(e)?.isStateLevel===!0,vu=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(lu.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(uu.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&fu.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(du.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&pu.has(e.operator))&&(r[0]|=1),du.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=Be(e);if(u!==void 0&&!j(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{_u(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),hu.has(u)&&(r[0]|=8),gu.has(u)&&(r[0]|=256),!a&&_u(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)}}ze(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},yu=(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},bu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),xu=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=vu(Re(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&270,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=yu(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=yu(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!bu(t[e],l[e*r])))),p=yu(a,r,f,270);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|d[t]&224|p[t]&270:e),words:r}},Su=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?Cu(Re(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},Cu=(e,t)=>{let n=t.facts.words,r=vu(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=Su(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]}bu(e.callee,r[0])||(i[0]|=r[0]&270)}),i},wu=(e,t)=>!(Su(e,t)[0]&1),Tu={any:2,repeated:4,streamed:8,replayed:260},Eu=(e,t,n)=>(Cu(e,t)[0]&Tu[n])!==0,Du=(e,t,n=`any`)=>(Su(e,t)[0]&Tu[n])!==0,Ou=(e,t)=>{let n=Su(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},ku=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},Au=(e,t)=>{let n=Cu([e],t);return n[0]&16?void 0:ku(n)},ju=(e,t)=>!!(Cu([e],t)[0]&1),Mu=(t,n,r)=>new e.k(`Applying ${t} to the following value,\nwhich is not ${n}:\n${R(r)}`),Nu=e=>Nt(e)?L(e):void 0,Pu=`a function with a finite domain`,Fu=(e,t,n)=>{let r=z(e,t,n),i=Nu(r);if(!i)throw Mu(n,Pu,r);return i},Iu=(e,t)=>{let n=z(e,1,t),r=Nu(n),i=r&&Bu(r,z(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw jo(`second`,t,`bag`,n);return i},Lu=(e,t,n)=>{let r=t[n];if(!r||!zu(r))throw jo(n===0?`first`:`second`,`(+)`,`bag`,z(e,n,`(+)`));return r},Ru=(e,t)=>{if(!P(e)||!F(e))throw t();return I(e).elements},zu=e=>e.range.every(e=>typeof e==`number`&&e>0),Bu=(e,t)=>{let n=e.domain.findIndex(e=>pr(t,e));return n===-1?void 0:e.range[n]},Vu=t=>{if(typeof t==`number`)return t;let n=`tlc2.value.impl.${Ko(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')`)},Hu=(e,t)=>{let n=Vu(e)+Vu(t);if(Bo(n))throw Vo(`${e}+${t}`);return n},Uu=(e,t,n)=>{let r=Vu(e.range[t]),i=Bu(n,e.domain[t]);if(i===void 0)return r;let a=r-Vu(i);if(Bo(a))throw Vo(`${r}-${i}`);return a},Wu=(e,t,n,r=e.length)=>{let i=e.slice(0,r).find(e=>pr(t,e[0]));i?i[1]=Hu(i[1],n):e.push([t,n])},Gu=e=>e.domain.map((t,n)=>[t,e.range[n]]),Ku=Dn([],[]),qu=t=>[Io(`EmptyBag`,Ku),B(`IsABag`,1,e=>{let t=Nu(z(e,0,`IsABag`));return t!==void 0&&zu(t)}),B(`BagCardinality`,1,e=>{let t=z(e,0,`BagCardinality`);return Fu(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Mu(`BagCardinality`,`a bag`,t);return Hu(e,n)},0)}),B(`BagIn`,2,e=>{let t=Iu(e,`BagIn`);return t!==void 0&&t>0}),B(`CopiesIn`,2,e=>Iu(e,`CopiesIn`)??0),B(`\\oplus`,2,e=>{let t=[0,1].map(t=>Nu(z(e,t,`(+)`))),n=Lu(e,t,0),r=Lu(e,t,1),i=Gu(n);return r.domain.forEach((e,t)=>Wu(i,e,r.range[t],n.domain.length)),Sr(i)}),B(`\\ominus`,2,e=>{let t=z(e,0,`(-)`),n=z(e,1,`(-)`),r=Nu(t),i=Nu(n);if(!r)throw jo(`first`,`(-)`,`bag`,t);if(!i)throw jo(`second`,`(-)`,`bag`,n);return Sr(r.domain.flatMap((e,t)=>{let n=Uu(r,t,i);return n>0?[[e,n]]:[]}))}),B(`BagUnion`,1,t=>{let n=z(t,0,`BagUnion`),r=Ru(n,()=>Mu(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??Ku;let i=t=>{let r=Nu(t);if(!r)throw new e.k(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${R(n)}`);return r},a=Gu(i(r[0]));return r.slice(1).forEach(e=>{let t=i(e);t.domain.forEach((e,n)=>Wu(a,e,t.range[n]))}),Sr(a)}),B(`\\sqsubseteq`,2,e=>{let t=z(e,0,`\\sqsubseteq`),n=z(e,1,`\\sqsubseteq`),r=Nu(t),i=Nu(n);if(!r)throw Mu(`\\sqsubseteq`,Pu,t);if(!i)throw Mu(`\\sqsubseteq`,Pu,n);return r.domain.every((e,t)=>{let n=Bu(i,e);return Vu(r.range[t])<=(n===void 0?0:Vu(n))})}),Lo(`BagOfAll`,2,e=>{let t=Fo(e,0,`BagOfAll`),n=z(e,1,`BagOfAll`),r=Nu(n);if(!r)throw jo(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[];return r.domain.forEach((e,n)=>Wu(i,t.call([e]),r.range[n])),Sr(i)}),B(`SubBag`,1,n=>{let r=z(n,0,`SubBag`);if(!Nt(r))throw new e.b(`Attempted to apply the operator DOMAIN to a non-function\n(${qo(r)})\nline 106, col 58 to line 106, col 65 of module Bags`);let i=L(r),a=I(_r(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 ${R(i)}, which is not in its domain`);return gr(i.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:s[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Dn(e.map(e=>e[0]),e.map(e=>e[1]))))}),B(`BagToSet`,1,e=>Pi(Fu(e,0,`BagToSet`))),B(`SetToBag`,1,e=>{let t=z(e,0,`SetToBag`),n=Ru(t,()=>Mu(`BagToSet`,Pu,t));return Dn([...n],n.map(()=>1))})],Ju={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},H={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},Yu={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},Xu=[{lower:`true`,upper:`TRUE`,token:H.true},{lower:`false`,upper:`FALSE`,token:H.false},{lower:`null`,upper:`NULL`,token:H.null}],Zu=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
|
|
79
|
-
`],[`r`,`\r`],[`f`,`\f`]]),Qu=1024,$u=t=>{let n=+!!t.startsWith(``),r=n,i=0,a=n,o=!0,s=H.none,c=0,l=[Ju.emptyDocument],u=[void 0],d=[0],f=()=>`$${l.map((e,t)=>e===Ju.emptyArray||e===Ju.nonemptyArray?`[${d[t]}]`:e===Ju.emptyDocument||e===Ju.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),v=()=>{for(;r<t.length;){let e=t[r++];if(e===`
|
|
82
|
-
`){i++,a=r;return}if(e===`\r`)return}},y=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},b=()=>{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===`/`)v();else if(y(`*/`))r+=2;else throw m(`Unterminated comment`)}else if(e===`#`)g(),v();else if(e!==` `&&e!==`\r`&&e!==` `)return e}},x=()=>{let e=b();if(e===void 0)throw h();return e},ee=()=>{let e=Xu.find(e=>t[r]===e.lower[0]||t[r]===e.upper[0]);if(!e)return H.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 H.none}return r+n<t.length&&_(t[r+n])?H.none:(r+=n,e.token)},te=()=>{let e=Yu.none,n=!1,i=0;for(;r+i<t.length;i++){if(i===Qu)return H.none;let a=t[r+i];if(a===`-`){if(e===Yu.none)e=Yu.sign;else if(e===Yu.exponentE)e=Yu.exponentSign;else return H.none}else if(a===`+`){if(e!==Yu.exponentE)return H.none;e=Yu.exponentSign}else if(a===`e`||a===`E`){if(e!==Yu.digit&&e!==Yu.fractionDigit)return H.none;e=Yu.exponentE}else if(a===`.`){if(e!==Yu.digit)return H.none;e=Yu.decimal}else if(a<`0`||a>`9`){if(_(a))return H.none;break}else if(e===Yu.sign||e===Yu.none)n=a===`0`,e=Yu.digit;else if(e===Yu.digit){if(n)return H.none}else e===Yu.decimal?e=Yu.fractionDigit:(e===Yu.exponentE||e===Yu.exponentSign)&&(e=Yu.exponentDigit)}return i===Qu||e!==Yu.digit&&e!==Yu.fractionDigit&&e!==Yu.exponentDigit?H.none:(c=i,H.number)},ne=()=>{let e=l.length-1,n=l[e];if(n===Ju.emptyArray)l[e]=Ju.nonemptyArray;else if(n===Ju.nonemptyArray){let e=x();if(e===`]`)return H.endArray;if(e===`;`)g();else if(e!==`,`)throw m(`Unterminated array`)}else if(n===Ju.emptyObject||n===Ju.nonemptyObject){if(l[e]=Ju.danglingName,n===Ju.nonemptyObject){let e=x();if(e===`}`)return H.endObject;if(e===`;`)g();else if(e!==`,`)throw m(`Unterminated object`)}let t=x();if(t===`"`)return H.doubleQuotedName;if(t===`'`)return g(),H.singleQuotedName;if(t===`}`){if(n!==Ju.nonemptyObject)return H.endObject;throw m(`Expected name`)}if(g(),r--,_(t))return H.unquotedName;throw m(`Expected name`)}else if(n===Ju.danglingName){l[e]=Ju.nonemptyObject;let n=x();if(n===`=`)g(),t[r]===`>`&&r++;else if(n!==`:`)throw m(`Expected ':'`)}else if(n===Ju.emptyDocument){if(b()===void 0)return H.eof;r--,t.startsWith(`)]}'
|
|
85
|
-
`,r)&&(r+=5),l[e]=Ju.nonemptyDocument}else if(n===Ju.nonemptyDocument){if(b()===void 0)return H.eof;g(),r--}let i=b();if(i===void 0){if(n===Ju.emptyDocument)return H.eof;throw h()}if(i===`]`&&n===Ju.emptyArray)return H.endArray;if(i===`]`||i===`;`||i===`,`){if(n!==Ju.emptyArray&&n!==Ju.nonemptyArray)throw m(`Unexpected value`);return g(),r--,H.null}if(i===`'`)return g(),H.singleQuoted;if(i===`"`)return H.doubleQuoted;if(i===`[`)return H.beginArray;if(i===`{`)return H.beginObject;r--;let a=ee();if(a!==H.none)return a;let o=te();if(o!==H.none)return o;if(!_(t[r]))throw m(`Expected value`);return g(),H.unquoted},S=()=>(s===H.none&&(s=ne()),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=Zu.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`)},C=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===`
|
|
87
|
-
`&&(i++,a=r)}throw m(`Unterminated string`)},w=()=>{let e=r;for(;r<t.length&&_(t[r]);)r++;return t.slice(e,r)},T=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=H.none},E=()=>{l.pop(),u.pop(),d.pop(),d[l.length-1]++,s=H.none},ie=()=>{let e=S();return e!==H.endObject&&e!==H.endArray&&e!==H.eof},ae=()=>{let e=S(),t=e===H.unquotedName?w():C(e===H.singleQuotedName?`'`:`"`);return s=H.none,u[l.length-1]=t,t},oe=e=>e===H.true||e===H.false?e===H.true:e===H.null?null:e===H.number?(r+=c,{literal:t.slice(r-c,r)}):e===H.unquoted?w():C(e===H.singleQuoted?`'`:`"`),se=()=>{let e=S();if(e===H.beginArray){T(Ju.emptyArray);let e=[];for(;ie();)e.push(se());return E(),e}if(e===H.beginObject){T(Ju.emptyObject);let e=/* @__PURE__ */ new Map;for(;ie();)e.set(ae(),se());return E(),e}let t=oe(e);return s=H.none,d[l.length-1]++,t};if(S()===H.eof)return null;let ce=se();return o=!1,ce!==null&&S(),ce},ed=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),td=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),nd=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),rd=e=>{if(!Nt(e))return;let t=L(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?Pr(n):void 0},id=(t,n)=>{let r=`tlc2.value.impl.${Ko(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')`)},ad=t=>new e.b(`Cannot convert value: unsupported value type tlc2.value.impl.${Ko(t)}`),od=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),sd=e=>`[${e.map(dd).join(`,`)}]`,cd=e=>`{${Ht(e).map(e=>`${od(typeof e[0]==`string`?e[0]:R(e[0]))}:${dd(e[1])}`).join(`,`)}}`,ld=e=>{let t=L(e),n=ui(t);return n?sd(n):cd(t)},ud=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,dd=e=>typeof e==`string`?od(e):typeof e==`object`?e.kind===`ModelValue`?od(e.name):Ko(e)===`RecordValue`?cd(L(e)):fd(e):String(e),fd=e=>{let t=Ko(e);if(t===`TupleValue`)return sd(L(e).range);if(ud(t))return ld(e);if(Ir(e))return sd(I(e).elements);throw ad(e)},pd=e=>e.map(e=>`${dd(e)}\n`).join(``),md=e=>{let t=Ko(e);if(t===`RecordValue`)return cd(L(e));if(t===`TupleValue`)return`{${L(e).range.map((e,t)=>`"${t}":${dd(e)}`).join(`,`)}}`;if(ud(t))return ld(e);throw ad(e)},hd=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 un(t);if(Array.isArray(t))return Nr(t.map(hd));if(t instanceof Map)return Pr([...t].map(e=>[un(e[0]),hd(e[1])]));let n=Number(t.literal);if(!/^-?\d+$/.test(t.literal)||Bo(n))throw new e.b(`Cannot convert value: expected a 32-bit integer JSON number, but found ${t.literal}`);return n||0},gd=t=>{if(typeof t!=`string`)throw new e.b(`Cannot cast tlc2.value.impl.${Ko(t)} to tlc2.value.impl.StringValue`);return t},_d=(e,t)=>{let n=Mi(e,t);if(typeof n!=`string`)throw id(n,`StringValue`);return n},vd=t=>{if(!td.has(t.toLowerCase()))throw nd.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}`)},yd=(t,n,r,i)=>{let a=r.find(e=>!ed.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))},bd=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},xd=(t,n)=>{let r=t.readFile?.(n);if(r===void 0)throw new e.b(`${n} (No such file or directory)`);return r},Sd=e=>[Yo(Ro(`ToJson`,1,e=>un(dd(z(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),Yo(Ro(`ToJsonArray`,1,e=>un(fd(z(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),Yo(Ro(`ToJsonObject`,1,e=>un(md(z(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),Yo(Ro(`JsonSerialize`,2,t=>{let n=gd(z(t,0,`JsonSerialize`)),r=z(t,1,`JsonSerialize`);if(!ui(r)&&!rd(r))throw jo(`second`,`JsonSerialize`,`sequence or record`,r);return bd(e,n),e.writeFile?.(n,dd(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`),Yo(Ro(`ndJsonSerialize`,2,t=>{let n=gd(z(t,0,`ndJsonSerialize`)),r=z(t,1,`ndJsonSerialize`),i=ui(r);if(!i)throw jo(`second`,`ndJsonSerialize`,`sequence`,r);return bd(e,n),e.writeFile?.(n,pd(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`),Yo(Ro(`JsonDeserialize`,1,t=>hd($u(xd(e,gd(z(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),Yo(Ro(`ndJsonDeserialize`,1,t=>Nr(xd(e,gd(z(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>hd($u(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],Cd=(e,t)=>[Yo(ts(`Serialize`,3,(n,r)=>{let i=ns(n,2,`Serialize`)(),a=rd(i);if(!a)throw jo(`third`,`ndJsonSerialize`,`sequence`,i);if(_d(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=ns(n,0,`Serialize`)(),s=ui(o);if(!s)throw jo(`first`,`Serialize`,`sequence`,o);let c=ns(n,1,`Serialize`)();if(typeof c!=`string`)throw jo(`second`,`ndJsonSerialize`,`sequence`,c);let l=Mi(a,`openOptions`);if(Ko(l)!==`TupleValue`)throw id(l,`TupleValue`);let u=_d(a,`charset`),d=L(l).range.map(e=>{if(typeof e!=`string`)throw id(e,`StringValue`);return e});return vd(u),yd(e,c,d,pd(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)`)],wd={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},Td=e=>{let n=[],r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=0,o=wn(),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(wd.string),l(0),l(-1),l(e.length),e.split(``).forEach(e=>s(e.charCodeAt(0)))},f=e=>{s(wd.handle),u(e)},p=e=>{if(typeof e==`boolean`){s(wd.boolean),s(+!!e);return}if(typeof e==`number`){s(wd.integer),l(e);return}if(typeof e==`string`){a++,d(e);return}if(e.kind===`ModelValue`){s(wd.modelValue),c(o.indexOf(e));return}if(e.kind===`Interval`){s(wd.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++),P(e)){let t=I(e).elements;s(wd.set),l(t.length),t.forEach(p);return}let n=L(e),m=An(e);m===`tuple`?(s(wd.tuple),u(n.range.length),n.range.forEach(p)):m===`record`?(s(wd.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(wd.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))},Ed=e=>[Yo(Ro(`_TLCTraceSerialize`,2,t=>{let n=gd(z(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,Td(z(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`)],Dd=25214903917n,Od=(1n<<48n)-1n,kd=e=>{let t=(BigInt.asUintN(64,e)^Dd)&Od,n=e=>(t=t*Dd+11n&Od,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^Dd)&Od},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}},Ad=[],jd=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Md=()=>{for(let e=1277011;Ad.length<1341;e++)jd(e)&&Ad.push(e);return Ad},Nd=e=>{let t=Md(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},Pd=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},Fd=e=>{for(let t=Math.max(e,9);;t++){let e=Pd(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)}}},Id=(e,t,n)=>{if(t<=0)return[];let r=Fd(t),i=BigInt(n.nextInt(t)),a=BigInt(Nd(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},Ld=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Ct),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},Rd=(1n<<63n)-1n-24n,zd=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Rd*BigInt(n)+i)%t;return r<0n?r+t:r})},Bd=(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,Vd=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=jr(e.domain),n=I(e.range).elements;return{lists:t.map(()=>n),create:e=>Dn(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>I(e).elements),create:t=>Pr(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>I(e).elements),create:Nr}}},Hd=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,Ud=(e,t,n,r)=>{if(ni(t))return[];let i=r===`1.7.4`?Ld:Id;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=Hd(t,r)?void 0:Vd(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?zd(e,t,n):i(e,Number(t),n)).map(e=>a.create(Bd(a.lists,e)))}let o=I(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},Wd=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[...Mo(t.domain,`RandomElement`,t).elements];return Dn(e,e.map(()=>Wd(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return Pr(t.names.map((e,r)=>[e,Wd(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return Nr(t.factors.map(e=>Wd(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 ${R(t)}.`);return t.low+i}let r=Mo(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]},Gd=(e,t,n)=>{if(typeof e!=`number`||e<0)throw jo(t,n,`nonnegative integer`,e);return e},Kd=(e,t,n,r)=>gr(Array.from({length:t},()=>gr(e.filter(()=>r.nextDouble()<n)))),qd=(e,t)=>{let n=`RandomSetOfSubsets`,r=Gd(z(e,0,n),`first`,n),i=Gd(z(e,1,n),`second`,n),a=z(e,2,n);if(!P(a)||!F(a))throw jo(`third`,n,`finite set`,a);let o=I(a).elements;if(o.length<31&&r>2**o.length)throw jo(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw jo(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return Kd(o,r,o.length===0?0:i/o.length,t.getRandom())},Jd=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,Yd=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,Xd=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(Jd.test(t))return Number(t.replace(/[fFdD]$/,``));let n=Yd.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},Zd=e=>B(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=Gd(z(t,0,n),`first`,n),i=z(t,1,n);if(typeof i!=`string`)throw jo(`second`,n,`string literal representing a probability`,i);let a=Xd(i);if(a===void 0||a<0||a>1)throw jo(`second`,n,`string literal does not represent a parsable probability`,i);let o=z(t,2,n);if(!P(o)||pn(o)||!si(o))throw jo(`third`,n,`finite set`,o);let s=ai(o);if(32-Math.clz32(r)>s&&r>1<<s)throw jo(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return Kd(I(o).elements,r,a,e.getRandom())}),Qd=t=>[Yo(B(`RandomSubset`,2,n=>{let r=Gd(z(n,0,`RandomSubset`),`first`,`RandomSubset`),i=z(n,1,`RandomSubset`);if(!Ir(i)||!si(i))throw jo(`second`,`RandomSubset`,`a finite set`,i);let a=Hd(i,t.version);if(a&&a.reduce((e,t)=>e*I(t).elements.length,1)>Dt())throw new e.b(Ot());return gr(Ud(r,i,t.getRandom(),t.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),B(`RandomSetOfSubsets`,3,e=>qd(e,t)),B(`TestRandomSetOfSubsets`,3,e=>Nr(Array.from({length:5},()=>I(qd(e,t)).elements.length)))],$d=(e,t=0n)=>{let n=kd(t),r=kd(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Pr([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,getSuccessorAction:()=>void 0,toRecord:()=>({}),setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Ua,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,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},ef=e=>Sr([...e.possibleCounts].map(([e,t])=>[e,t])),tf=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,ef(e)]]),nf=e=>Pr([[`name`,e??`UnnamedAction`],[`location`,Pr([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),rf=/* @__PURE__ */ new WeakSet,af=(e,t)=>{let n=Pr([[`action`,gr(e)],[`state`,gr(t)]]);return rf.add(n),n},of=(e,t,n)=>{let r=e.map((e,t)=>Nr([t+1,Pr(Object.entries(e))])),i=r.slice(1).map((e,n)=>Nr([r[n],t[n],e])),a=n?[Nr([r[r.length-1],n.action,r[n.start]])]:[];return af([...i,...a],r)},sf=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return tf(e).get(t)},cf=(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),R(i));else throw new e.k(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${R(r)}`)},lf=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:U(e),uf=e=>e.every(e=>e!==void 0),df=(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&&!j(e);if(i&&t.variableIndex.has(r))return 1;let a=ze(e).map(e=>df(e,t,n)),o=i?Lh(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(df(o.body,t,n))),Math.max(0,...a)},ff=(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[ts(`AssertError`,2,t=>{let r=Fo(t,0,`AssertError`).expression;if(r&&r.kind!==`String`)throw new e.b(`In computing AssertError, a non-string expression (${lf(r)}) was used as the err of an AssertError(err, exp).`);let i=ns(t,0,`AssertError`)();try{ns(t,1,`AssertError`)()}catch(t){if(t instanceof e.b)return ot(t.message,n.isTool)===i;throw t}return!1}),Ro(`TLCGetOrDefault`,2,e=>sf(n,z(e,0,`TLCGetOrDefault`))??z(e,1,`TLCGetOrDefault`)),Ro(`Trace`,0,(t,r)=>{let i=r?.environment.variables??[],a=r?.state??i.map(()=>void 0);if(!r||!uf(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?Nr(n.getBehavior(a).map(e=>{let t=r.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return Pr(i===void 0?t:[[`_action`,i],...t])})):Nr([Pr([])])}),Ro(`CounterExample`,0,()=>n.counterExample??af([],[])),B(`ToTrace`,1,t=>{let n=z(t,0,`ToTrace`);if(typeof n!=`object`||!rf.has(n))throw new e.k(`The argument of ToTrace should be a CounterExample, but instead it is:\n${R(n)}`);let r=I(Mi(n,`state`)).elements.map(e=>ui(e)??[]);return Nr(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),B(`TLCModelValue`,1,t=>{let n=z(t,0,`TLCModelValue`);if(typeof n!=`string`)throw new e.k(`The argument of ModelValue should be a string, but instead it is:\n${R(n)}`);return Cn(n)}),ts(`TLCDefer`,1,(e,t)=>{let r=Fo(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{W(r,{...t,next:e})}),!0}),B(`TLCNoOp`,1,e=>z(e,0,`TLCNoOp`)),{...ts(`PickSuccessor`,1,(r,i)=>{let a=i?.next??(i?.environment.variables??[]).map(()=>void 0);if(!uf(a)||i?.next&&n.isSeen(a))return!0;let o=Fo(r,0,`PickSuccessor`),s=o.call([]);if(typeof s!=`boolean`)throw new e.b(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${qo(s)}) was used as the condition of an IF.\n${o.expression?lf(o.expression):``}`);if(s||!i?.next||!i.state||!uf(i.state))return!0;let c=i.state,l=n.getSuccessorAction(c,a),u=e=>t(Xe(n.isTool,qe.moduleOverrideStdout,Je.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.v;if(/^[\0-\x20]*$/.test(t)||t.toLowerCase().startsWith(`y`))return!0;if(t[0]===`s`)u(`${ma(n.toRecord(c)).trimEnd()}\n~>\n${ma(n.toRecord(a)).trimEnd()}`);else if(t[0]===`d`)u(ma(n.toRecord(a),n.toRecord(c)));else if(t[0]===`e`){if(n.getSimulationValue===void 0)throw new e.B(`tla-ts can't mark a state explored while it checks a model.`);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},ts(`TLCCache`,2,(e,t)=>{let i=Fo(e,0,`TLCCache`),o=$i(ns(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=df(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}),B(`TLCFP`,1,e=>{let t=z(e,0,`TLCFP`),n=Wi(t);if(n)throw n;return Number(BigInt.asIntN(32,Ua([t])))}),ts(`TLCEvalDefinition`,1,(t,n)=>{let r=ns(t,0,`TLCEvalDefinition`)();if(typeof r!=`string`)throw new e.k(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${R(r)}`);let i=n?Lh(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.k(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${R(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.k(`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)})]},pf=(e,t)=>[Ro(`_Track`,2,e=>{let n=String(z(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,z(e,0,`_Track`)===!0?r+1:r),!0}),Ro(`_Counts`,0,()=>ef(t)),Ro(`_CheckName`,1,n=>{let r=String(z(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(R(ef(t),!0)),!1)}),Ro(`_PrintCounts`,0,()=>(e(R(ef(t),!0)),!0))],mf=e=>`${e.getUTCFullYear()}.${st(e.getUTCMonth()+1)}.${st(e.getUTCDate())}.${st(e.getUTCHours())}${st(e.getUTCMinutes())}${st(e.getUTCSeconds())}`,hf=e=>Sr([...e].map(([e,t])=>[e,Nr([t])])),gf=e=>kn(Cr(e),`record`),_f=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),vf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),yf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),bf=(t,n,r)=>{if(t.version===`1.7.4`?!vf.has(n)||!t.isStarted&&yf.has(n):!t.isStarted&&_f.has(n))throw new e.k(`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 gf([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,a],[`worker`,0]]);case`config`:return gf([[`mode`,`bfs`],[`deadlock`,t.checkDeadlock],[`worker`,1],[`seed`,String(t.seed)],[`fingerprint`,String(BigInt.asIntN(64,_a()))],[`install`,`unknown`]]);case`revision`:{let e=/* @__PURE__ */ new Date;return gf([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,un(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,un(mf(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return nf(void 0);case`all`:return hf(t.registers);case`all:named`:return hf(tf(t))}if(n.startsWith(`s:`)){let r=tf(t).get(n);if(r===void 0)throw new e.k(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return un(t.properties.get(n.slice(2))??n);throw new e.k(`TLCGet(${n}) was undefined.`)},xf=(t,n,r)=>{if(typeof n==`number`&&n>=0){let r=t.registers.get(n);if(r===void 0)throw new e.k(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new e.k(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${R(n)}`);return bf(t,n,r?.state)},Sf=e=>e.length===0?[[]]:e.flatMap((t,n)=>Sf([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Cf=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&I(e).elements.forEach(Cf),e.kind===`Function`&&e.range.forEach(Cf))},wf=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 L(e);default:return I(e)}},Tf=(t,n)=>[B(`Print`,2,e=>(t(ua([z(e,0,`Print`),z(e,1,`Print`)]).map(M).join(` `)),z(e,1,`Print`))),B(`PrintT`,1,e=>(t(M(ua([z(e,0,`PrintT`)])[0])),!0)),B(`Assert`,2,t=>{if(z(t,0,`Assert`)!==!0)throw new e.k(`The first argument of Assert evaluated to FALSE; the second argument was:\n${M(R(z(t,1,`Assert`)))}`,e.nt.assertViolation);return!0}),B(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),B(`:>`,2,e=>Sr([[z(e,0,`:>`),z(e,1,`:>`)]])),B(`@@`,2,e=>{let t=z(e,0,`@@`),n=z(e,1,`@@`),r=Nt(t)?L(t):void 0,i=Nt(n)?L(n):void 0;if(!r)throw jo(`first`,`@@`,`function`,t);if(!i)throw jo(`second`,`@@`,`function`,n);let a=Vt(r),o=Vt(i).filter(e=>!a.some(t=>pr(e[0],t[0])));return Cr([...a,...o])}),B(`ToString`,1,e=>un(R(z(e,0,`ToString`),!0))),{...ts(`TLCEval`,1,(e,t)=>{let n=wf(ns(e,0,`TLCEval`)());return t===void 0&&Cf(n),n}),isStateLevel:!1},B(`Permutations`,1,e=>{let t=Mo(z(e,0,`Permutations`),`Permutations`).elements;return gr(Sf(t).map(e=>Sr(t.map((t,n)=>[t,e[n]]))))}),Lo(`SortSeq`,2,e=>{let t=z(e,0,`SortSeq`),n=ui(t);if(!n)throw jo(`first`,`SortSeq`,`natural number`,t);let r=Fo(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw jo(`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)}),Nr(a)}),n.version===`1.7.4`?Yo({...Ro(`TLCGet`,1,(e,t)=>xf(n,z(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Yo(ts(`TLCGet`,1,(e,t)=>xf(n,ns(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)`),Ro(`TLCSet`,2,e=>(cf(n,t,z(e,0,`TLCSet`),z(e,1,`TLCSet`)),!0)),Io(`Any`,_n),B(`RandomElement`,1,e=>Wd(z(e,0,`RandomElement`),n.getRandom()))],Ef=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),Df=[[`\\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`,`≀`],[`^+`,`⁺`]],Of=/* @__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(`,`),kf=/* @__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(`.`),Af=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),jf=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
19
|
+
`);s(e===-1?i:i.slice(0,e));continue}if(i.startsWith(`(*`)){let e=Me(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=Te(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=ve(e,n)??_e(e,n),m=je.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},Pe=(t,n)=>new e.v(`TLC found an error in the configuration file at line ${t}\n${n}`),Fe=(e,t)=>Pe(e,`The keyword ${t} appeared twice.`),Ie=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),Le=/* @__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`]]),Re=(t,n=`master`)=>{let r=n===`1.7.4`?Ae:Oe,i=Ne(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 Pe(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 Pe(t.line,`It was expecting a value, but did not find it.`)},d=e=>{let t=l();if(t.kind===`End`)throw Pe(t.line,`Expected an identifier after ${e}[.`);let n=l();if(n.text!==`]`)throw Pe(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 Pe(t.line,`Expected an identifier after <-[mod].`);o.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw Pe(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 Pe(t,``);r=l()}if(r.text!==`=`)throw Pe(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)?Ie.get(e):void 0,i=r.has(e)?Le.get(e):void 0,a=()=>{let n=l();if(n.kind===`End`)throw Pe(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 Fe(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 Pe(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(s)throw Fe(t,e);s=!0,o.checkDeadlock=n.text===`TRUE`,h=l()}else{if(!r.has(e)||!ke.includes(e))throw Pe(t,`It was expecting a keyword, but did not find it.`);if(a(),c.has(e))throw Fe(t,e);c.add(e),h=l()}}return o},ze=/* @__PURE__ */ new WeakMap,Be=(e,t)=>{let n=ze.get(e);if(n)return n;let r={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:t};return ze.set(e,r),r},Ve=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],He=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(Ve),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]}},Ue=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},j=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,We=/* @__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(`,`),Ge=[[`\\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`,`≀`],[`^+`,`⁺`]],Ke=new Map(Ge.flatMap(e=>e.slice(1).map(t=>[t,e[0]]))),M=e=>e.split(`!`).map(e=>Ke.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),qe=/* @__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(`,`),Je=/* @__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(`.`),Ye=/* @__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(`.`),Xe=/* @__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
|
-
`]]),Mf=/* @__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)`]])]]),Nf=`----------------------------- MODULE Bags --------------------------------
|
|
335
|
+
`]]),Ze=/* @__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)`]])]]),Qe=a(`EOF`),$e=a(`IDENTIFIER`),et=a(`DEFBREAK`),tt=(e,t)=>Array.from({length:a(t)-a(e)+1},(t,n)=>a(e)+n),nt=new Set(tt(`op_57`,`op_119`)),rt=new Set(tt(`op_1`,`op_119`)),it=new Set(tt(`op_57`,`op_70`)),N=/* @__PURE__ */ new Set([...tt(`ACTION`,`EXCEPT`),a(`EXTENDS`),...tt(`IF`,`SF`),a(`STATE`),...tt(`THEN`,`WITH`),a(`US`),...tt(`op_112`,`op_116`)]),at=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),ot=new Map([...at(`postfix`,160,160,!0,`[`),...at(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...at(`prefix`,120,120,!1,`-.`),...at(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...at(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...at(`prefix`,40,40,!0,`\\lnot`),...at(`nfix`,100,130,!0,`\\times`),...at(`infix`,140,140,!1,`^`,`^^`),...at(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...at(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...at(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...at(`infix`,100,110,!0,`|`,`||`,`%%`),...at(`infix`,100,110,!1,`%`),...at(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...at(`infix`,90,140,!1,`\\wr`),...at(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...at(`infix`,90,130,!1,`!!`),...at(`infix`,90,90,!1,`...`,`..`),...at(`infix`,80,80,!0,`\\intersect`,`\\union`),...at(`infix`,80,80,!1,`\\`),...at(`infix`,70,70,!1,`<:`,`:>`),...at(`infix`,60,60,!0,`@@`),...at(`infix`,50,140,!0,`\\cdot`),...at(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...at(`infix`,30,30,!0,`\\land`,`\\lor`),...at(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...at(`infix`,10,10,!1,`=>`)]),st=new Map([...ot,...Ge.flatMap(e=>e.slice(1).map(t=>[t,ot.get(e[0])]))]),ct=st.get(`[`),lt={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},ut=e=>({type:`tokens`,kinds:new Set(e)}),dt=e=>typeof e==`string`?e.startsWith(`<`)?ut([a(e.slice(1,-1))]):{type:`call`,name:e}:e,P=(...e)=>({type:`sequence`,units:e.map(dt)}),F=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:P(e))}),ft=e=>(...t)=>({type:e,body:P(...t)}),I=ft(`zeroOrMore`),pt=ft(`oneOrMore`),L=ft(`optional`),R=e=>({type:`action`,run:t=>e(t)??void 0}),z=e=>R(t=>{t.expecting=e}),B=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&P(...e.expansion),semantic:e.semantic}),mt=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),ht=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=mt(e,n);return n},gt=(...e)=>{let t=e.map(a);return e=>t.includes(ht(e,1).kind)},_t=(e,t=ht(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},vt=e=>{let t=ht(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},yt=e=>gt(`CASESEP`)(e)&&_t(e),bt=e=>{let t=ht(e,1);N.has(t.kind)&&(t.kind=$e)},xt=(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}`,St=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),Ct=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},wt=e=>e.operatorStacks[e.operatorStacks.length-1],Tt=(e,t)=>e.low>t.high,Et=(e,t)=>e.high<t.low,Dt=e=>e.fix===`prefix`?e:st.get(`${e.name}.`),Ot=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===ct?St(`FcnAppl`,[n,...r.node.heirs]):St(`PostfixExpr`,[n,r.node]),operator:void 0})},kt=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:St(`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:St(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},At=e=>{let t=wt(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 Ot(t,n),At(e);if(i.operator!==void 0){let t=Dt(r.operator);return t!==void 0&&Tt(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${xt(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 ${xt(e,a.node.first,a.node.last)} and expression at location ${xt(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Et(a.operator,r.operator)?void 0:Tt(a.operator,r.operator)?(kt(t,a.operator),At(e)):`Precedence conflict between ops ${a.operator.name} in block ${xt(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Dt(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Et(s,r.operator))return;if(!Tt(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${xt(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return kt(t,s),At(e);let c=xt(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===lt?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},jt=e=>R(t=>{let n=wt(t),r=Ct(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:At(t)}),Mt=jt(()=>!1),Nt=jt(()=>!0),Pt=R(e=>{e.lastOperator=st.get(e.token.image)}),Ft=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},It=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?Ft(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Lt=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!_t(e,n.first.beginColumn))return n;let t=Lt(e,n);if(t!==void 0)return t}},Rt=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&&nt.has(e.kind),i=e.token,o=mt(e,i);i.next=void 0;let s=mt(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===$e&&(e=e.next)}else if(e.kind===$e){let t=e.next;!r(t)||it.has(t.kind)||rt.has(t.kind)&&t.next?.kind!==$e||(e=t.next?.kind===a(`SUBSTITUTE`)?i:rt.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==et&&(e.next={kind:et,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=o,o=s,s=mt(e,o),o.next=i}for(;i!==void 0;)o.next=s,s=o,o=i,i=o.next;o.next=s},zt=e=>{let t=ht(e,1);if(t.kind===a(`LAB`)){let n=1;for(;n!==0;)if(t=mt(e,t),t.kind===a(`LAB`)&&n++,t.kind===a(`RAB`)&&n--,t.kind===Qe)return!1;return mt(e,t).kind===a(`IN`)}if(t.kind!==$e)return!1;for(t=mt(e,t);t.kind===a(`COMMA`);){if(t=mt(e,t),t.kind!==$e)return!1;t=mt(e,t)}return t.kind===a(`IN`)},Bt=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Vt=e=>e.proofLevels.at(-1)??-1,Ht=e=>{let t=ht(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:gt(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Vt(e)>=0&&Bt(t)>Vt(e):gt(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Ut=(e,t)=>{let n=Bt(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},Wt=e=>R(t=>Ut(t,t.token)?void 0:`${xt(t,t.token)}: ${e}`),Gt=ut([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(a)),Kt=ut([...Gt.kinds,a(`op_76`)]),qt=ut(rt),Jt=ut(it),Yt=ut([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(a)),Xt=()=>I(B({expansion:[F(Gt,`<op_77>`)],semantic:_t}),F(`PrefixOp`,`InfixOp`),Nt),Zt=()=>F(P(B({expansion:[`OpenStart`],semantic:_t}),`OpenExpression`,Mt),P(B({semantic:_t}),`ExtendableExpr`)),Qt=()=>F(P(`<MODULE>`,z(`identifier`),`Identifier`),`Expression`),$t=()=>F(P(B({semantic:e=>gt(`ASSUME`,`BOXASSUME`)(e)||ht(e,2).kind===a(`COLONCOLON`)&&[a(`ASSUME`),a(`BOXASSUME`)].includes(ht(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),en=()=>[`JuncItem`,I(B({semantic:vt}),`JuncItem`)],tn=e=>R(t=>{t.expecting=e,bt(t)}),nn=e=>R(t=>{t.isTerminalProof=e}),rn=(e,...t)=>P(...t.slice(0,-1),z(`==`),`<DEF>`,R(t=>{Rt(t),t.expecting=e}),t[t.length-1]),V=(e,t,n)=>({message:e,body:P(...t),exit:n}),an={CompilationUnit:V(void 0,[R(Rt),L(`Prelude`),`Module`]),Prelude:V(void 0,[`<BEGIN_PRAGMA>`,I(F(`<NUMBER>`,`<IDENTIFIER>`))]),Module:V(`Module definition`,[z(`---- MODULE`),`BeginModule`,z(`EXTENDS clause or module body`),`Extends`,z(`Module body`),`Body`,z(`==== or more Module body`),`EndModule`]),BeginModule:V(`Begin module`,[z(`---- MODULE (beginning of module)`),F(`<_BM0>`,`<_BM1>`,`<_BM2>`),tn(`Identifier`),`Identifier`,R(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:V(void 0,[`<END_MODULE>`]),Extends:V(`Extends`,[L(`<EXTENDS>`,tn(`Identifier`),`Identifier`,z(`comma or module body`),I(`<COMMA>`,tn(`Identifier`),`Identifier`))]),Body:V(`Module body`,[z(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),I(F(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,P(B({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,P(B({amount:2}),`Instance`),P(B({amount:2}),`Assumption`),P(B({amount:2}),`Theorem`),P(B({amount:1}),`Module`,R(Rt)),P(B({semantic:e=>gt(`USE`)(e)&&ht(e,2).kind!==a(`ONLY`)||gt(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:V(`variable declaration`,[`<VARIABLE>`,z(`Identifier`),`Identifier`,z(`comma or module body`),I(`<COMMA>`,z(`Identifier`),`Identifier`)]),ParamDeclaration:V(`Parameter declaration`,[z(`CONSTANT`),`ParamSubDecl`,z(`Identifier, operator or _`),`ConstantDeclarationItems`,z(`,`),I(`<COMMA>`,z(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:V(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:V(`Recursive`,[z(`RECURSIVE`),`<RECURSIVE>`,z(`Identifier, operator or _`),`ConstantDeclarationItems`,z(`,`),I(`<COMMA>`,z(`Identifier, operator or _`),`ConstantDeclarationItems`,z("`,' or `)'"))]),ConstantDeclarationItems:V(`Constant declaration items`,[z(`Identifier, _ or prefix op`),F(P(`Identifier`,z(`(, comma, or Module Body`),L(B({amount:2}),`<LBR>`,z(`_`),`<US>`,z(`comma or )`),I(`<COMMA>`,z(`_`),`<US>`,z(`comma or )`)),`<RBR>`)),P(`NonExpPrefixOp`,z(`_`),`<US>`),P(`<US>`,z(`prefix or postfix operator`),F(P(`InfixOp`,z(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:V(`Definition`,[z(`LOCAL, Identifier or Operator Symbol`),L(`<LOCAL>`),`<DEFBREAK>`,z(`LOCAL, Identifier or Operator Symbol`),F(rn(`Expression`,B({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,z(`[`),`<LSB>`,z(`Identifier`),`QuantBound`,z(`COMMA or ]`),I(`<COMMA>`,z(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),rn(`Expression`,B({expansion:[`<IDENTIFIER>`,Jt]}),`PostfixLHS`,`Expression`),rn(`Expression`,B({expansion:[`<IDENTIFIER>`,qt]}),`InfixLHS`,`Expression`),rn(`Expression or Instance`,B({expansion:[`<IDENTIFIER>`,F(`<LBR>`,`<DEF>`)]}),`IdentLHS`,F(`Expression`,`Instantiation`)),rn(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:V(`Identifier tuple`,[`<LAB>`,z(`Identifier or >>`),L(`Identifier`,z(`COMMA or >>`),I(`<COMMA>`,z(`COMMA or >>`),`Identifier`,z(`COMMA or >>`))),`<RAB>`]),IdentLHS:V(`Identifier LHS`,[`Identifier`,z(`( or ==`),L(`<LBR>`,z(`Identifier Declaration, prefix op, _ or )`),F(`IdentDecl`,`SomeFixDecl`),z(`COMMA or )`),I(`<COMMA>`,z(`Identifier Declaration, prefix op or _`),F(`IdentDecl`,`SomeFixDecl`),z(`COMMA or )`)),`<RBR>`)]),PrefixLHS:V(`Prefix LHS`,[Kt,z(`Identifier`),`Identifier`]),InfixLHS:V(`Infix LHS`,[`Identifier`,qt,`Identifier`]),PostfixLHS:V(`Postfix LHS`,[`Identifier`,Jt]),IdentDecl:V(`Identifier Declation`,[`Identifier`,z(`( or ...`),L(`<LBR>`,z(`_`),`<US>`,z(`COMMA or )`),I(`<COMMA>`,z(`_`),`<US>`,z(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:V(`Op. Symbol Declaration`,[F(P(`NonExpPrefixOp`,z(`_`),`<US>`),P(`<US>`,z(`infix or postfix operator`),F(P(`InfixOp`,z(`_`),`<US>`),`PostfixOp`)))]),Instance:V(`Instance`,[z(`LOCAL or instance`),L(`<LOCAL>`),`Instantiation`,z(`COMMA or Module Body`)]),Instantiation:V(`NonLocalInstance`,[`<INSTANCE>`,tn(`Module identifier`),`Identifier`,z(`WITH or another definition.`),L(`<WITH>`,z(``),`Substitution`,z(``),I(B({amount:3}),`<COMMA>`,z(``),`Substitution`,z(``)))]),Substitution:V(`Substitution`,[F(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),z(`<-`),`<SUBSTITUTE>`,z(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:V(void 0,[Gt,Pt]),NonExpPrefixOp:V(void 0,[Kt,Pt]),InfixOp:V(`Infix Op`,[qt,Pt]),PostfixOp:V(void 0,[Jt,Pt]),Identifier:V(void 0,[`<IDENTIFIER>`]),Assumption:V(`Assumption`,[z(`ASSUM...`),F(`<ASSUMPTION>`,`<ASSUME>`),L(B({amount:2}),L(`<DEFBREAK>`),`Identifier`,z(`==`),`<DEF>`),R(e=>{Rt(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:V(`Assume-Prove`,[F(P(`Identifier`,`<COLONCOLON>`,`AssumeProve`),P(F(`<ASSUME>`,`<BOXASSUME>`),z(`Expression, Declaration, or AssumeProve`),$t(),z("PROVE or `,'"),I(`<COMMA>`,z(`Expression, Declaration, or AssumeProve`),$t(),z("PROVE or `,'")),F(`<PROVE>`,`<BOXPROVE>`),z(`Expression`),`Expression`))]),NewSymb:V(`NEW symbol declaration`,[z(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),F(P(B({amount:2}),F(P(B({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),z(`Constant declaration`),F(P(B({amount:2}),`IdentDecl`,L(`<IN>`,R(e=>{let t=Ct(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${xt(e,t.first,t.last)}`:void 0}),z(`Expression`),`Expression`)),`SomeFixDecl`)),P(B({amount:2}),L(`<NEW>`),`<VARIABLE>`,z(`Identifier`),`Identifier`),P(B({amount:2}),L(`<NEW>`),F(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),z(`Declaration`),F(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:V(`Domain binding`,[L(`<IN>`,z(`Expression`),`Expression`)]),Theorem:V(`Theorem`,[z(`THEOREM, PROPOSITION`),F(`<THEOREM>`,`<PROPOSITION>`),z(`Identifier, Assume-Prove or Expression`),L(B({amount:2}),`Identifier`,z(`==`),`<DEF>`),R(Rt),F(P(B({amount:3}),B({semantic:gt(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),L(B({semantic:Ht}),`Proof`)]),Proof:V(`Proof`,[R(e=>{e.proofLevels.push(-1)}),F(P(B({semantic:e=>gt(`BY`)(e)||ht(e,2).kind===a(`BY`)}),`UseOrHideOrBy`),P(B({amount:2}),L(`<PROOF>`),F(`<OBVIOUS>`,`<OMITTED>`)),P(L(B({amount:2}),`<PROOF>`),I(B({semantic:e=>ht(e,2).kind!==a(`QED`)}),`Step`,z(`a proof step`)),`QEDStep`)),R(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:V(`UseOrHideOrBy`,[F(P(L(`<PROOF>`),`<BY>`,nn(!0),L(`<ONLY>`)),P(`<USE>`,nn(!1),L(`<ONLY>`)),P(`<HIDE>`,nn(!1))),z("an expression, `MODULE' or `DEF'"),L(Qt(),I(`<COMMA>`,z(`MODULE or expression`),Qt(),R(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),L(`<DF>`,z(`MODULE or expression`),Qt(),I(`<COMMA>`,z(`MODULE or expression`),Qt(),R(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),R(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:V(`QED step`,[z(`Step number`),Yt,Wt(`QED step's number has bad level.`),z(`QED`),`<QED>`,L(B({semantic:Ht}),`Proof`)]),Step:V(`Step`,[z(`Step number`),Yt,Wt(`step's number has bad level.`),z(`proof step`),F(P(B({semantic:gt(`USE`,`HIDE`)}),`UseOrHideOrBy`),P(B({semantic:gt(`INSTANCE`)}),`Instantiation`),P(B({semantic:gt(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),L(B({semantic:Ht}),R(e=>{let t=Ct(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${xt(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:V(`DefStep`,[L(`<DEFINE>`),pt(B({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:V(`HaveStep`,[`<HAVE>`,z(`expression`),`Expression`]),TakeStep:V(`TakeStep`,[`<TAKE>`,z(`identifier`),F(P(B({expansion:[F(P(`<IDENTIFIER>`,I(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,z(`comma or step`),I(`<COMMA>`,z(`identifier or tuple of identifiers`),`QuantBound`,z(`comma or proof step`))),P(`Identifier`,z(`comma or proof step`),I(`<COMMA>`,z(`identifier`),`Identifier`,z(`comma or proof step`))))]),WitnessStep:V(`WitnessStep`,[`<WITNESS>`,z(`expression`),`Expression`,I(`<COMMA>`,z(`expression`),`Expression`,z(`comma or colon`))]),PickStep:V(`PickStep`,[`<PICK>`,z(`identifier`),F(P(B({expansion:[`<IDENTIFIER>`,I(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,z(`comma, or colon`),I(`<COMMA>`,z(`identifier`),`Identifier`,z(`comma or colon`))),P(`QuantBound`,z(`comma or colon`),I(`<COMMA>`,z(`identifier or tuple of identifiers`),`QuantBound`,z(`comma or colon`)))),`<COLON>`,z(`expression`),`Expression`]),CaseStep:V(`CaseStep`,[`<CASE>`,z(`expression`),`Expression`]),AssertStep:V(`AssertStep`,[L(`<SUFFICES>`,z(`expression or ASSUME/PROVE`)),F(`Expression`,P(B({semantic:gt(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:V(void 0,[F(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:V(void 0,[F(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:V(`String`,[`<STRING_LITERAL>`]),Number:V(void 0,[`<NUMBER_LITERAL>`,L(B({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:V(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,I(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:V(void 0,[F(P(B({amount:2,expansion:[F(Kt,qt,Jt),ut([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(a))],semantic:_t}),F(`NonExpPrefixOp`,P(`InfixOp`,R(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${xt(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),P(B({expansion:[`<LAMBDA>`],semantic:_t}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:V(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:V(`Quantified form`,[F(`<EXISTS>`,`<FORALL>`),F(P(B({expansion:[`<IDENTIFIER>`,I(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,I(`<COMMA>`,`Identifier`)),P(`QuantBound`,I(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:V(`Bound Quantified Expression`,[F(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,I(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:V(`Quant Bound`,[F(`IdentifierTuple`,P(`Identifier`,I(`<COMMA>`,`Identifier`,z(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:V(`Some { } form`,[`<LBC>`,L(F(P(B({semantic:zt}),F(`IdentifierTuple`,`Identifier`),z(`\\in`),`<IN>`,`Expression`,z(`':', ',' or '}'`),L(F(P(`<COLON>`,`Expression`),pt(`<COMMA>`,`Expression`)))),P(B({expansion:[F(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,I(`<COMMA>`,`Expression`)),P(B({expansion:[F(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,I(`<COMMA>`,`QuantBound`)),P(`Expression`,L(F(P(`<COLON>`,R(e=>{let t=Ct(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`,I(`<COMMA>`,`QuantBound`)),pt(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:V(`Some [] Form`,[`<LSB>`,F(P(B({semantic:zt}),`QuantBound`,I(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),P(B({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,I(`<COMMA>`,`FieldVal`),`<RSB>`),P(B({semantic:e=>ht(e,2).kind===a(`MAPTO`)&&N.has(ht(e,1).kind)}),R(e=>{ht(e,1).kind=$e}),`FieldVal`,I(`<COMMA>`,`FieldVal`),`<RSB>`),P(B({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,I(`<COMMA>`,`FieldSet`),`<RSB>`),P(`Expression`,F(P(I(`<COMMA>`,`Expression`),`<RSB>`,R(e=>{let t=e.frames[e.frames.length-1];t.node=St(`FcnAppl`,t.heirs),e.lastOperator=ct})),P(`<ARROW>`,`Expression`,`<RSB>`),P(`<EXCEPT>`,`ExceptSpec`,I(`<COMMA>`,`ExceptSpec`),`<RSB>`),P(`<ARSB>`,`ReducedExpression`))))]),FieldVal:V(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:V(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:V(`Except Spec`,[`<BANG>`,pt(`ExceptComponent`,z(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:V(`Except Component`,[F(P(`<DOT>`,R(bt),`Identifier`,R(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),P(`<LSB>`,`Expression`,I(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:V(`Some << -- >> or >>_ Form`,[`<LAB>`,L(`Expression`,I(`<COMMA>`,`Expression`)),F(`<RAB>`,P(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:V(void 0,[`Identifier`,L(B({amount:2}),`OpArgs`),F(P(`<BANG>`,`NoOpExtension`),R(e=>{e.isFairnessHooked=e.token.kind===a(`RBR`)}))]),ReducedExpression:V(`restricted form of expression`,[F(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:V(`Fairness Expression`,[R(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),F(`<WF>`,`<SF>`),`ReducedExpression`,L(B({amount:2}),`<LBR>`,`Expression`,`<RBR>`,R(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:V(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:V(`CASE Expression`,[`<CASE>`,`CaseArm`,I(B({semantic:e=>yt(e)&&ht(e,2).kind!==a(`OTHER`)}),`<CASESEP>`,`CaseArm`),L(B({semantic:yt}),`<CASESEP>`,`OtherArm`)]),CaseArm:V(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:V(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:V(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:V(`Let Definitions`,[pt(F(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:V(`AND-OR Junction`,[R(e=>{let t=ht(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),F(P(B({expansion:[`<OR>`]}),...en()),P(B({expansion:[`<AND>`]}),...en())),R(e=>{e.junctions.pop()})]),JuncItem:V(`Junction Item`,[F(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Lt(t,e.heirs[1]);return n&&`Item at ${xt(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${xt(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:V(`(Un)Bounded Choose`,[`<CHOOSE>`,F(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:V(`Lambda`,[`<LAMBDA>`,z(`Identifier`),`Identifier`,z("`,' or `:'"),I(`<COMMA>`,z(`Identifier`),`Identifier`,z("`,' or `:'")),`<COLON>`,z(`Expression`),`Expression`]),Expression:V(`Expression`,[R(e=>{e.operatorStacks.push([])}),Xt(),Zt()],(e,t)=>{let n=wt(t);n.push({node:e.heirs[0],operator:lt});let r=At(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:V(`ExtendableExpr`,[F(P(B({expansion:[F(`<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`),Mt,I(F(P(B({expansion:[`PostfixOp`],semantic:_t}),`PostfixOp`,Nt),P(B({expansion:[`<DOT>`],semantic:_t}),`<DOT>`,R(bt),B({semantic:_t}),`Identifier`,R(e=>{let t=wt(e);t[t.length-1].operator!==void 0&&Ot(t,t.length),t[t.length-1]={node:St(`RecordComponent`,[t[t.length-1].node,Ct(e,2),Ct(e,1)]),operator:void 0}})),P(B({expansion:[`<LSB>`],semantic:_t}),z(`function argument`),`SBracketCases`,jt(e=>e.kind===`FcnAppl`)))),L(F(P(B({expansion:[`InfixOp`],semantic:_t}),`InfixOp`,Nt,Xt(),Zt()),P(B({expansion:[`<COLONCOLON>`],semantic:_t}),`<COLONCOLON>`,R(e=>{let t=wt(e);if(!It(t[t.length-1].node))return`\`::' at ${xt(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,R(e=>{let t=wt(e),n=Ct(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Et(r,e.lastOperator)){let t=Ct(e,3);return`Removing label at ${xt(e,t.first,t.last)} would change expression parsing.`}t.push({node:St(`Label`,[Ct(e,3),Ct(e,2),n]),operator:void 0})}))))]),PrimitiveExp:V(`Primitive expression`,[F(P(B({expansion:[`String`],semantic:_t}),`String`),P(B({expansion:[`<NUMBER_LITERAL>`],semantic:_t}),`Number`),P(F(`Identifier`,P(F(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),R(e=>Vt(e)<0&&e.proofLevels.length<=1?`${xt(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${xt(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,P(B({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),L(B({amount:2}),`OpArgs`),I(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:Ft(e.heirs)===void 0?e.heirs.length===1?St(`GeneralId`,e.heirs):void 0:St(`OpApplication`,e.heirs)}),BangExt:V(`Bang Extension`,[`<BANG>`,F(P(F(P(B({expansion:[`Identifier`],semantic:e=>ht(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),L(B({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:V(`StructOp`,[z("`<<' , `>>' , `:' , `@' , or number"),F(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,P(B({semantic:e=>ht(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${xt(t,n.first,n.last)}`:void 0}),OpenStart:V(void 0,[F(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},on=/* @__PURE__ */ new Map,sn=e=>{let t=on.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=sn(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,sn(an[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 on.set(e,n),n},cn=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},ln=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=mt(e,e.scanPosition)),e.scanPosition=mt(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`},un=(e,t)=>{if(t.type===`tokens`)return ln(e,t.kinds);if(t.type===`call`)return un(e,an[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||cn(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=un(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||cn(e,t.semantic)?un(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=un(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=un(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},dn=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=un(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},fn=(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||sn(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!sn(a).hasSemanticStart?sn(a).first.has(ht(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):dn(e,i,a)&&(o===void 0||o(e))}),pn=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,un(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=mt(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Qe){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=mt(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${ae(e.token.image)}" `},mn=(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??pn(e)}\n\nResidual stack trace follows:\n${r}`,!1},hn=(e,t)=>{let n=mt(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,mn(e))},gn=(e,t)=>{let n=an[t];n.message!==void 0&&(e.messages.push({name:n.message,token:ht(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!_n(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 mn(e,i);let a=r.node??(r.heirs.length===0?void 0:St(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},_n=(e,t)=>{if(t.type===`tokens`)return hn(e,t.kinds);if(t.type===`call`)return gn(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||mn(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||mn(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||_n(e,t));if(t.type===`choice`){let n=fn(e,t.alternatives);return n===-1?mn(e):_n(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!_n(e,t.body))return!1;if(t.type===`optional`)return fn(e,[t.body])===-1||_n(e,t.body);for(;fn(e,[t.body])===0;)if(!_n(e,t.body))return!1;return!0},vn=e=>{let t=ie(e),n={kind:Qe,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=_n(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
|
+
`)},yn=/* @__PURE__ */ new Map([[`(`,`)`],[`[`,`]`],[`{`,`}`],[`<<`,`>>`]]),bn=(e,t)=>`${e}:${t}`,xn=(e,t)=>{let n=Ee(t).filter(e=>e.kind!==`End`).map(xe),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)=>[bn(e.line,e.column),t]))}},Sn=(e,t,n)=>e.tokens[t]!==void 0&&e.tokens[t].text===n&&e.tokens[t].kind!==`String`,Cn=(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},wn=(e,t)=>e.tokenIndexes.get(bn(t.line,t.column))??Math.min(Cn(e,t,!1),e.tokens.length-1),Tn=(e,t)=>Math.max(Cn(e,t,!0)-1,0),En=(e,t)=>{let n=e.tokens[t].text,r=yn.get(n);if(r===void 0)return t;let i=0;for(let a=t;a<e.tokens.length;a++)if(Sn(e,a,n))i++;else if(Sn(e,a,r)&&(i--,i===0))return a;return t},Dn=(e,t)=>({start:wn(e,t.start),end:Tn(e,t.end)}),On=(e,t)=>{let n=t.location.range;if(n)return Dn(e,n);let r=wn(e,t.location);return{start:r,end:En(e,r)}},kn=(e,t)=>{let n=t.start-1,r=t.end+1;return Sn(e,n,`(`)&&Sn(e,r,`)`)&&En(e,n)===r?kn(e,{start:n,end:r}):t},An=(e,t)=>{let n=t.start-1,r=t.end+1;return Sn(e,n,`(`)&&En(e,n)===r&&(Sn(e,n-1,`(`)||Sn(e,n-1,`,`))?An(e,{start:n,end:r}):t},jn=(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}),Mn=(e,t)=>jn(e,{start:t,end:t}),Nn=(e,t,n)=>{let r=0,i=e.lineOffsets[t];for(;i<e.source.length;){if(r=e.source[i]===` `?S(r):r+1,r>=n)return i;i++}return i},Pn=(e,t)=>{let n=e.tokens[t],r=Nn(e,n.line,n.column);return e.source.slice(r,Nn(e,n.line,n.endColumn)+1)},Fn=(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},In=t=>{let n=xn(``,t),r=n.tokens.reduce((e,t,r)=>{if(!Fn(n,r))return e;let i=Nn(n,t.line,t.column);return`${e.slice(0,i)} ${e.slice(i+2)}`},t);if(r!==t&&vn(t)!==void 0)throw new e.I(`SANY rejects a []ASSUME or []PROVE outside an ASSUME/PROVE`);return r},Ln=(e,t)=>{let n=e.tokens[t-1],r=e.tokens[t],i=n===void 0?0:Nn(e,n.line,n.endColumn)+1,a=e.source.slice(i,Nn(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},Rn=(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},zn=(e,t,n,r)=>{for(let i=t;i<=n;i++)if(Sn(e,i,r))return i;return-1},Bn=/* @__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`]]),Vn=/* @__PURE__ */ new Set([`N_GeneralId`,`N_OpApplication`,`N_PrefixExpr`,`N_InfixExpr`,`N_PostfixExpr`,`N_FcnAppl`,`N_RecordComponent`]),Hn=(e,t)=>Sn(e,t.start,`(`)&&En(e,t.start)===t.end,Un=(e,t)=>kn(e,On(e,t)),Wn=(e,t,n)=>Un(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`,Gn=(e,t,n)=>Hn(e,n)?`N_ParenExpr`:t.kind===`String`?Pn(e,n.start):t.kind===`Apply`?Wn(e,t,n):t.kind===`And`||t.kind===`Or`?t.isBulleted?t.kind===`And`?`N_ConjList`:`N_DisjList`:`N_InfixExpr`:Bn.get(t.kind),Kn=(e,t,n)=>{if(t.kind===`String`&&!Hn(e,n))return!1;if(t.kind===`Identifier`&&!t.name.includes(`!`))return!0;let r=Gn(e,t,n);return r===void 0||Vn.has(r)?void 0:!0},qn=(e,t,n)=>{let r=(t,n=t)=>jn(e,{start:t,end:n}),i=(t,n=Un(e,t))=>({last:jn(e,n),lastKind:Gn(e,t,n)}),a=(e,t)=>({hasChildlessFirstChild:!1,last:r(n.start+1,e),lastKind:t}),o=(t,n)=>{let i=Un(e,t);return{hasChildlessFirstChild:Kn(e,t,i),last:r(i.end+1),lastKind:n}};if(Hn(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(Un(e,t.arms[0].body).end,`N_CaseArm`);case`Record`:case`RecordSet`:return a(Un(e,t.fields[0].value).end,t.kind===`Record`?`N_FieldVal`:`N_FieldSet`);case`FunctionConstruction`:case`Forall`:case`Exists`:return a(Un(e,t.bounds[0].set).end,`N_QuantBound`);case`Choose`:case`SetFilter`:return(t.kind===`Choose`?t.pattern:t.bound.pattern).kind===`Tuple`?a(En(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(Un(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(Un(e,t.operands[t.operands.length-1]).start-1),lastKind:`N_GenInfixOp`};if(!t.isBulleted)return o(t.operands[0],`N_GenInfixOp`);let n=Un(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:Kn(e,t.expression,Un(e,t.expression)),last:r(n.end),lastKind:`N_GenPostfixOp`};case`FunctionApplication`:case`FieldAccess`:{let n=t.kind===`FunctionApplication`?t.function:t.record,i=Un(e,n),a=i.end+1;return{hasChildlessFirstChild:Kn(e,n,i),last:r(a),lastKind:e.tokens[a].text}}case`Apply`:{let a=Wn(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`)}}},Jn=(e,t)=>{let n=Un(e,t),r=jn(e,n),i=qn(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.`}]},Yn={low:15,high:15},Xn={low:16,high:16},H=(e,t,n)=>({low:e,high:t,isAssociative:n}),Zn=new Map([[`=>`,H(1,1,!1)],[`<=>`,H(2,2,!1)],[`~>`,H(2,2,!1)],[`-+->`,H(2,2,!1)],[`/\\`,H(3,3,!0)],[`\\/`,H(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,H(5,5,!1)]),[`\\cdot`,H(5,14,!0)],[`@@`,H(6,6,!0)],[`:>`,H(7,7,!1)],[`<:`,H(7,7,!1)],[`\\cup`,H(8,8,!0)],[`\\cap`,H(8,8,!0)],[`\\`,H(8,8,!1)],[`..`,H(9,9,!1)],[`...`,H(9,9,!1)],[`##`,H(9,13,!0)],[`$`,H(9,13,!0)],[`$$`,H(9,13,!0)],[`??`,H(9,13,!0)],[`!!`,H(9,13,!1)],[`\\sqcap`,H(9,13,!0)],[`\\sqcup`,H(9,13,!0)],[`\\uplus`,H(9,13,!0)],[`\\wr`,H(9,14,!1)],[`+`,H(10,10,!0)],[`++`,H(10,10,!0)],[`(+)`,H(10,10,!0)],[`\\oplus`,H(10,10,!0)],[`%`,H(10,11,!1)],[`%%`,H(10,11,!0)],[`|`,H(10,11,!0)],[`||`,H(10,11,!0)],[`\\X`,H(10,13,!1)],[`-`,H(11,11,!0)],[`--`,H(11,11,!0)],[`(-)`,H(11,11,!0)],[`\\ominus`,H(11,11,!0)],[`*`,H(13,13,!0)],[`**`,H(13,13,!0)],[`/`,H(13,13,!1)],[`//`,H(13,13,!1)],[`\\div`,H(13,13,!1)],[`\\o`,H(13,13,!0)],[`(.)`,H(13,13,!0)],[`\\odot`,H(13,13,!0)],[`(/)`,H(13,13,!1)],[`\\oslash`,H(13,13,!1)],[`(\\X)`,H(13,13,!0)],[`\\otimes`,H(13,13,!0)],[`&`,H(13,13,!0)],[`&&`,H(13,13,!0)],[`\\star`,H(13,13,!0)],[`\\bullet`,H(13,13,!0)],[`\\bigcirc`,H(13,13,!0)],[`^`,H(14,14,!1)],[`^^`,H(14,14,!1)]]),Qn=(e,t)=>t.isAssociative||e===`%`||e===`\\X`,$n=/* @__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}]]),er={low:17,high:17},tr=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`@`,`\\A`,`\\E`,`\\AA`,`\\EE`,`IF`,`CASE`,`LET`,`CHOOSE`,`LAMBDA`,`WF_`,`SF_`]),nr=/* @__PURE__ */ new Set([`(`,`{`,`<<`]),rr=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),ir=/* @__PURE__ */ new Set([...rr,`'`]),ar=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),or=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),sr=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),cr=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),lr=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...ir]),ur=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),dr=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),fr=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),pr=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),mr=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),hr=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),gr=/* @__PURE__ */ new Set([``,`*`,`-`]),_r={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},vr=(e,t)=>e.line-t.line||e.column-t.column,yr=(e,t)=>({start:vr(e.start,t.start)<=0?e.start:t.start,stop:vr(e.stop,t.stop)>=0?e.stop:t.stop}),br=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),xr={printed:``,set:``},Sr={printed:`
|
|
339
|
+
`,set:``},Cr={printed:`
|
|
340
|
+
`,set:`
|
|
341
|
+
`},wr=(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}`}}),Tr=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),Er=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),Dr=/* @__PURE__ */ new Set([`NEW`,...Er.keys()]),Or=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),kr=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Ar=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),jr=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Zn.has(e.operator):rr.has(e.operator)),Mr=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,Nr=e=>Zn.has(e)||rr.has(e)||e===`-.`,Pr=(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}}},Fr=/* @__PURE__ */ new WeakMap,Ir=/* @__PURE__ */ new WeakMap,Lr=e=>{if(Fr.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},Rr=(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`},zr=(t,n,r=Ee(t,n===`tlapm`))=>{let i=n===`tlapm`,a=i?r:r.map(xe),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=[],y=[],b=[],x=(e,t=o-1)=>{let n=e===t?b[e]:void 0;if(n)return n;let r=a[t];v[e]??=_(a[e]),y[t]??={line:r.line,column:r.endColumn};let i={module:d[0].name,start:v[e],end:y[t]};return e===t&&(b[e]=i),i},S=(e,t)=>(e.location.range=x(t),e),ee=(e=0)=>a[Math.min(o+e,a.length-1)],C=(e=0)=>{let t=ee(e),n=s[s.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},te=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ne=e=>i&&(e.kind===`Keyword`||Ar.has(e.text)),re=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},ie=e=>e.kind===`End`?`EOF`:/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:hr.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:ne(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,w=(t,n=ee(),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,ae(t,n,o,r));return f!==void 0&&h.set(s,f),s},ae=(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 ${ie(r)}`:e;if(o)return{reason:s,line:o.line,column:o.endColumn+1,isEnd:n};let c=r?re(r):t;return{reason:s,line:c.line,column:c.column,isEnd:n}},T=(e,t=ee())=>w(e,t,t),oe=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}},se=e=>{let t=f;f=void 0;let n=e();return f=t,n},ce=e=>{m.push(o);let t=e();return m.pop(),t},le=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ne(e),E=(e,t=0)=>{let n=C(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},D=()=>{let e=C();if(e.kind===`End`)throw T(`Unexpected end of expression`);return o++,e},O=e=>E(e)?(o++,!0):!1,k=e=>{if(!E(e))throw T(`Expected ${JSON.stringify(e)} but found ${te(C())}`);return D()},de=()=>{let e=C();if(e.kind!==`Identifier`)throw T(`Expected an identifier but found ${te(e)}`);if(ne(e))throw T(`Unexpected keyword ${e.text}`);return o++,e.text},fe=()=>{let e=o;return{name:de(),range:x(e)}},pe=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),me=()=>{let e=C();return e.kind!==`String`&&(or.has(e.text)||Zn.has(e.text)||ir.has(e.text))?(o++,e.text):de()},he=!1,ge=()=>C().kind===`Identifier`||!le(C())?de():(he=!0,D().text),_e=e=>{if(!i)return e();s.push(-1);let t=e();return s.pop(),t},A=(e,t=`,`)=>{let n=[e()];for(;O(t);)n.push(e());return n},ve=(e=0)=>{if(E(`<<`,e)){let t=e+1;for(;C(t).kind===`Identifier`||E(`,`,t);)t++;return E(`>>`,t)&&E(`\\in`,t+1)}let t=e;for(;C(t).kind===`Identifier`;){if(E(`\\in`,t+1))return!0;if(!E(`,`,t+1))return!1;t+=2}return!1},ye=()=>{if(E(`::`))return!0;if(!E(`(`))return!1;let e=1;for(;C(e).kind===`Identifier`&&E(`,`,e+1);)e+=2;return C(e).kind===`Identifier`&&E(`)`,e+1)&&E(`::`,e+2)},be=()=>{if(!O(`<<`)){let e=fe();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=pe(E(`>>`)?[]:A(fe));return k(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Se=()=>{let e=()=>{let e=A(be);k(`\\in`);let t=se(N);return e.map(e=>({pattern:e,set:t}))},t=[e()];for(;E(`,`)&&(!i||ve(1));)D(),t.push(e());return t.flat()},Ce=()=>{let e=C();if(i&&Ar.has(e.text)){let t=o;D();let n={kind:`Identifier`,name:e.text,location:_(e)};return{subscript:S(n,t),lastArgs:[]}}let t=i&&(e.kind===`Number`||e.kind===`String`||E(`@`));if(e.kind===`Identifier`){let t=o,n=[],r=[],a=e=>(r.push(x(o,o)),n.push(de()),e&&E(`(`)?ke():[]),s=[a(!i)];for(;E(`!`)&&C(1).kind===`Identifier`;)D(),s.push(a(!0));let c=s.slice(0,-1),l=_(e);l.range={...x(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(E(`<<`)||E(`(`)||E(`{`)||E(`[`)||t){let e=o,t=Be();return{subscript:t.location.range?t:S(t,e),lastArgs:[]}}throw T(`Expected a subscript but found ${te(e)}`)},we=e=>{let t=C(1),n=C(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`&&E(`==`,ir.has(n.text)?3:4))},Te=e=>{let t=C(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||E(`,`,1)||E(`)`,1)||t.kind===`Keyword`&&dr.has(t.text)||we(e)},De=()=>{let e=C(),t=e.kind===`Operator`&&(Zn.has(e.text)||ar.has(e.text))&&Te(e);if(i&&e.kind!==`String`&&(ar.has(e.text)||lr.has(e.text)&&e.text!==`'`&&!rr.has(e.text)||cr.has(e.text)&&C(-1).text===`(`&&C(-1).line===e.line&&C(-1).endColumn+1===e.column&&C(1).text===`)`&&C(1).line===e.line&&C(1).column===e.endColumn+1)&&Te(e))throw w(`incomplete expression`,e);if(t&&!i&&e.text===`\\X`&&e.spelling!==`×`)throw w(`\\X may not be used as an infix operator`,e);if(t)return o++,S({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:_(e)},o-1);if(e.kind!==`String`&&lr.has(e.text)&&Te(e)){o++;let t=_(e);if(rr.has(e.text))return S({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o-1);let n={kind:`Identifier`,name:`argument`,location:t};return S({kind:`Lambda`,params:[n.name],body:Pr(e.text,n,t),operator:e.text,location:_(e)},o-1)}if(E(`LAMBDA`)){let t=o;D();let n=pe(A(fe));k(`:`);let r=N();return S({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:_(e)},t)}if(!i)return N();let n=oe(N);if(n)return n;throw T(`Unexpected ${te(C())}`)},Oe,ke=()=>_e(()=>{let e=o;k(`(`);let t=A(De);return k(`)`),Oe=x(e),t}),Ae=()=>{let e=D();s.push(e.column);let t=[N()],n=()=>{for(;Mr(ee())&&ee().text===e.text&&ee().column===e.column;)o++,t.push(N())};return i?se(n):n(),s.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:_(e)}},je=e=>_e(()=>{let t=_(e),n=C().kind===`Identifier`,r=E(`|->`,1)&&(n||le(C()));if(r||n&&E(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o,n=_(C()),i=e();return n.range=x(t),k(r?`|->`:`:`),{name:i,value:N(),location:n}},a=[i(()=>n?de():D().text),...O(`,`)?A(()=>i(de)):[]];return k(`]`),{kind:e,fields:a,location:t}}if(ve()){let e=o,n=Se();if(!i||E(`|->`)){k(`|->`);let e=N();return k(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}o=e}let a=N();if(O(`->`)){let e=N();return k(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(O(`EXCEPT`)){let e=A(()=>{let e=[o];k(`!`);let t=[];for(;E(`.`)||E(`[`);)if(e.push(o),O(`.`)){if(!le(C()))throw T(`Expected a field name but found ${te(C())}`);if(!i&&E(`@`))throw T(`@ used in !.@`);t.push(D().text)}else k(`[`),t.push(A(()=>N())),k(`]`);e.push(o,o+1),k(`=`);let n=N();e.push(o);let r=t=>x(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:x(e[0])}});return k(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!E(`]_`)){let e=[a];for(;O(`,`);)e.push(N());return k(`]`),{kind:`Bracket`,args:e,location:t}}return k(`]_`),{kind:`BoxAction`,action:a,subscript:Ce().subscript,location:t}}),Me=()=>{let e=o,t=S(He(),e),n=_(D());return S({kind:`Apply`,operator:`\\in`,args:[t,se(N)],location:n},e)},Ne=e=>_e(()=>{let t=_(e);if(O(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ve()&&(C(1).text===`\\in`||E(`<<`))){let e=o,n=be();k(`\\in`);let r=se(N);if(O(`:`)){let e=se(N);return k(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o=e}let n=C().kind===`Identifier`&&E(`\\in`,1)?Me():N();if(O(`:`)){let e=Se();return k(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;O(`,`);)r.push(N());return k(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Pe=e=>{let t=_(e),n=_e(()=>E(`>>`)||E(`>>_`)?[]:A(()=>N()));if(O(`>>_`)){if(n.length!==1)throw w(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:se(Ce).subscript,location:t}}return k(`>>`),{kind:`Tuple`,elements:n,location:t}},Fe=e=>{let t=_(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ve()){let e=Se();return k(`:`),{kind:n,bounds:e,body:N(),location:t}}let i=pe(A(fe));return k(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:N(),isTemporal:r,location:t}},Ie=e=>{let t=[];do{let n=o;if(O(`OTHER`))return k(`->`),{kind:`Case`,arms:t,other:N(),otherRange:x(n),location:_(e)};let r=N();k(`->`),t.push({condition:r,body:N()})}while(O(`[]`));return{kind:`Case`,arms:t,other:void 0,location:_(e)}},Le=()=>{let e=C(1);return E(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||ur.has(e.text)||e.kind===`Operator`&&(Zn.has(e.text)||ir.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&or.has(e.text))},Re=()=>{let e=D();if(e.kind===`Number`)return{kind:`Operand`,operand:ue(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:E(`(`)?ke():[]}},ze=(e,t,n,r,i)=>{let a=[{kind:`Name`,name:e,args:t}],s=[x(r,r)],c=[n];for(;Le();){D();let e=o;Oe=void 0;let t=Re();s.push(t.kind===`Bound`?x(e):x(e,e)),a.push(t),c.push(Oe)}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)??x(r),selectorRanges:s,argumentRanges:c,location:i}},Be=e=>{let t=o,r=D(),a=_(r);if(i&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=A(de);return k(`:`),{kind:`Lambda`,params:e,body:N(),location:a}}if(r.kind===`Number`)return{kind:`Number`,value:ue(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`&&mt(r);if(!i&&s&&R()<0&&L.length<=1)throw w(`Step number used outside proof`,r);if(s&&r.text[1]===`+`)throw w(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||s){let n=s?ht(r)??r.text:r.text;if(ye()){let o=pe(O(`(`)?A(fe):[]);o.names.length>0&&k(`)`),k(`::`);let s=x(t),l=N();if(!i&&e!==void 0&&c!==void 0&&jr(l)&&e.high>=c.low)throw w(`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=E(`(`);if(n===`@`&&!o&&!Le())return{kind:`ExceptAt`,location:a};let l=o?ke():[];return Le()?ze(n,l,o?Oe:void 0,t,a):o?{kind:`Apply`,operator:n,args:l,argumentsRange:Oe,location:a}:{kind:`Identifier`,name:n,location:a}}let l=r.kind===`Operator`&&(Nr(r.text)||r.text===`'`&&!i);if(l&&E(`(`)){let e=ke();return!i&&Le()?ze(r.text,e,Oe,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:Oe,location:a}}if(l&&!i)return Le()?ze(r.text,[],void 0,t,a):{kind:`Identifier`,name:r.text,spelling:r.spelling,location:a};switch(r.text){case`(`:{let e=_e(()=>N());return k(`)`),Fr.set(e,x(t)),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=N();k(`THEN`);let t=N();return k(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:N(),location:a}}case`CASE`:return Ie(r);case`LET`:{let e=[],t=[],n=[];for(u.push(/* @__PURE__ */ new Set);!O(`IN`);){if(i&&E(`RECURSIVE`))throw T(`Unexpected keyword RECURSIVE`);if(O(`RECURSIVE`)){n.push(...ft()),d[d.length-1].hasRecursiveLet=!0;continue}let r=st(!i&&O(`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:N(),location:a}}case`CHOOSE`:{let e=be(),t=O(`\\in`)?N():void 0;return k(`:`),{kind:`Choose`,pattern:e,set:t,body:N(),location:a}}case`WF_`:case`SF_`:{let e=Ce(),t=!E(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:_e(()=>{k(`(`);let e=N();return k(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:a}}}throw T(`Unexpected ${te(r)}`,r)},Ve=(e,t,n)=>{c=l={low:t,high:n};let r=N(n+1),i=C(),a=ir.has(i.text)?Yn.high:Zn.get(i.text)?.high;if(i.kind===`Operator`&&a!==void 0&&a>=t)throw w(`Precedence conflict between ${e.text} and ${i.text}`,i);return r},He=()=>{let e=l;l=void 0;let t=C(),n=_(t);if(t.kind===`Operator`&&Mr(t))return Ae();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return D(),{kind:`Apply`,operator:`~`,args:[Ve(t,4,4)],location:n};case`-`:return D(),{kind:`Apply`,operator:`-.`,args:[Ve(t,12,12)],location:n};case`[]`:case`<>`:case`ENABLED`:case`UNCHANGED`:return D(),Pr(t.text,Ve(t,4,15),n);case`SUBSET`:case`UNION`:case`DOMAIN`:return D(),{kind:`Apply`,operator:t.text,args:[Ve(t,10,13)],location:n}}return Be(e)},Ue=(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}},j=(e,t)=>e.text===`'`?{kind:`Prime`,expression:t,location:_(e)}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t],location:_(e)},We=()=>{D();let e=_e(()=>A(()=>N()));return _e(()=>k(`]`)),e},Ge=e=>{let t=o,n=He(),r=n.location.range?n:S(n,t),i;for(;;){let n=C();if(n.kind!==`Operator`)break;let a=_(n);if(ir.has(n.text)&&e<=15){D(),c=Yn,r=S(j(n,r),t);continue}if(n.text===`[`){let e=We();c=Xn,r=S({kind:`FunctionApplication`,function:r,args:e,location:a},t);continue}if(n.text===`.`&&le(C(1))){D();let e=D().text;r=S({kind:`FieldAccess`,record:r,field:e,location:a},t);continue}let o=Zn.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 w(`Precedence conflict between ${i.text} and ${n.text}`,n)}if(D(),o.low>12&&E(`-`))throw w(`Precedence conflict between ${n.text} and -`,C());c=l=o;let s=N(o.high+1),u=i?.text===n.text;r=S(Ue(n,r,s,u,x(t).end),t),i={...o,text:n.text}}return r},Ke=e=>e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`||e.kind===`Identifier`||e.kind===`Step`&&mt(e)&&/^<\d/.test(e.text)||(e.kind===`Operator`||e.kind===`Keyword`)&&tr.has(e.text),M=(e,t)=>({start:t,end:o-1,expression:e.location.range?e:S(e,t)}),qe=(e,t,n,r)=>({...n,start:e,end:o-1,fixity:t,isLeft:!1,apply:r}),Je=e=>e.kind===`Operator`&&ir.has(e.text)&&E(`(`,1)?oe(()=>_e(()=>{D(),D();let t=N(),n=o-1;return k(`)`),{end:n,expression:j(e,t)}})):void 0,Ye=()=>{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!==`!`&&(Or.has(n.text)&&e++,kr.has(n.text)&&--e===0))return!1}}return!1},Xe=e=>E(`(`,1)&&Ye()?oe(()=>_e(()=>{D(),D();let t=N();k(`,`);let n=N();return k(`)`),{kind:`Apply`,operator:e.text,args:[t,n],location:_(e)}})):void 0,Ze=e=>{let t=o,n=C(),r=_(n),i=n.kind===`Operator`||n.kind===`Keyword`,a=i?Zn.get(n.text):void 0;if(!e){if(E(`[`)){let e=We();return qe(t,`Postfix`,er,t=>({kind:`FunctionApplication`,function:t[0].expression,args:e,location:r}))}if(E(`.`)&&le(C(1))){D();let e=D().text;return qe(t,`Postfix`,er,t=>({kind:`FieldAccess`,record:t[0].expression,field:e,location:r}))}if(a){if(Xe(n)){o=t;return}return D(),{...qe(t,`Infix`,a,e=>Ue(n,e[0].expression,e[1].expression,e[0].joinedBy===n.text,x(e[0].start,e[1].end).end)),isLeft:Qn(n.text,a),joins:n.text}}if(n.kind!==`Operator`||!ir.has(n.text))return;if(Je(n)){o=t;return}return D(),qe(t,`Postfix`,Yn,e=>j(n,e[0].expression))}if(n.kind===`Operator`&&Mr(n))return M(Ae(),t);let s=a?Xe(n):void 0;if(s)return M(s,t);let c=Je(n);if(c)return c.expression.location.range=x(t,c.end),{start:t,end:c.end,expression:c.expression};let l=i?$n.get(n.text):void 0;if(l)return D(),qe(t,`Prefix`,l,e=>Pr(n.text===`-`?`-.`:n.text,e[0].expression,r));if(!Ke(n))return;let u=n.kind===`Operator`&&nr.has(n.text);return M(u?Be():se(Be),t)},Qe=e=>e!==void 0&&`fixity`in e,$e=e=>e!==void 0&&!(`fixity`in e),et=(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=x(n,r),{start:n,end:r,expression:i,joinedBy:e.joins}},tt=e=>{let t=e.pop(),n=e.pop();if(!$e(t)||!Qe(n))throw w(`incomplete expression`);let r=n.fixity===`Infix`?e.pop():void 0;e.push(et(n,$e(r)?[r,t]:[t]))},nt=e=>{let t=e[e.length-2];return Qe(t)?t:void 0},rt=(e,t)=>t!==void 0&&e.high<t.low,it=()=>ce(()=>{let e=oe(()=>Ze(!0));if(e===void 0){let e=ee();throw e.kind===`End`?T(`Unexpected end of expression`,e):w(`required expressions(s) missing before '${ie(e)}'`,e)}return se(()=>{let t=[e];for(;;){let e=oe(()=>Ze(Qe(t[t.length-1])));if(e===void 0)break;if($e(e)||e.fixity===`Prefix`){t.push(e);continue}for(;rt(e,nt(t));)tt(t);let n=t[t.length-1];if(e.fixity===`Postfix`&&$e(n)){t.splice(-1,1,et(e,[n]));continue}let r=nt(t);r?.fixity===`Infix`&&r.isLeft&&e.isLeft&&!rt(r,e)&&tt(t),t.push(e)}for(;t.length>1;)tt(t);let n=t[0];if(!$e(n))throw w(`incomplete expression`);return n.expression})}),N=(e=0)=>i?it():Ge(e),at=()=>{if(!O(`(`))return[];let e=F();return k(`)`),e},ot=()=>{let e=_(C()),t=N(),n=a[o-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:d[0].name,start:e,end:r}}},st=e=>{let t=o;return S(lt(e),t)},ct=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),lt=e=>{let t=C(),n=o,r=_(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:x(n,o-2),...ot(),isLocal:e,isRecursive:g(t),location:r});if(t.kind===`Identifier`&&C(1).kind===`Operator`&&Zn.has(C(1).text)&&C(2).kind===`Identifier`&&E(`==`,3)){let e=fe(),t=D().text,n=fe();return k(`==`),i(t,[ct(e),ct(n)])}let a=t.kind!==`String`&&or.has(t.text),s=t.kind===`Identifier`&&ir.has(C(1).text)&&E(`==`,2);if(a||s){let e=a?t.text:C(1).text;a&&D();let n=fe();return s&&D(),k(`==`),i(e,[ct(n)])}let c=de();if(O(`[`)){let t=_e(()=>Se());return k(`]`),k(`==`),{kind:`Function`,name:c,bounds:t,body:N(),isLocal:e,isRecursive:g(c),location:r}}let l=o,u=at();return k(`==`),E(`INSTANCE`)?{...ut(c,u,e,r),definitionRange:x(l)}:i(c,u)},ut=(e,t,n,r)=>{let i=o;return k(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ge(),substitutions:O(`WITH`)?A(()=>{let e=o,t=me(),n=x(e);return k(`<-`),{name:t,nameRange:n,expression:De()}}):[],isLocal:n,location:r,instanceRange:x(i)}},dt=()=>{let e=o;return S(P(),e)},P=()=>{let e=_(C());if(E(`_`)&&C(1).kind===`Operator`&&(Zn.has(C(1).text)||ir.has(C(1).text)))return D(),{name:D().text,arity:O(`_`)?2:1,location:e};if(C().kind!==`String`&&(or.has(C().text)||i&&C().kind===`Operator`)&&E(`_`,1)){let t=D().text;return D(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=de();if(!O(`(`))return{name:t,arity:0,location:e};let n=A(()=>k(`_`));return k(`)`),{name:t,arity:n.length,location:e}},F=()=>A(dt),ft=()=>{let e=F();return e.forEach(e=>u[u.length-1].add(e.name)),e},I=e=>{let t=0,n=e;do{let e=C(n);if(e.kind===`End`)return n;e.kind===`Operator`&&Or.has(e.text)&&t++,e.kind===`Operator`&&kr.has(e.text)&&t--,n++}while(t>0);return n},pt=()=>{let e=C(),t=C(1);return e.kind===`Identifier`?E(`(`,1)||E(`[`,1)?E(`==`,I(1)):t.kind===`Operator`&&ir.has(t.text)?E(`==`,2):t.kind===`Operator`&&Zn.has(t.text)?C(2).kind===`Identifier`&&E(`==`,3):E(`==`,1):e.kind!==`String`&&or.has(e.text)&&t.kind===`Identifier`&&E(`==`,2)},L=[],R=()=>L[L.length-1]??-1,z=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),B=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},mt=e=>!e.text.endsWith(`.`)&&!gr.has(B(e)),ht=e=>{let t=B(e);if(gr.has(t))return;let n=z(e);if(n>=0)return`<${n}>${t}`;let r=R(),i=L[L.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},gt=e=>{if(e.kind===`Keyword`)return pr.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return L.length===0;if(e.text[1]===`+`||L.length===0)return!0;let t=R();return t>=0&&z(e)>t},_t=e=>{let t=z(e),n=L.length-1,r=L[n-1]??-1,i=L[n]<0;return i&&(L[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:L[n]===t},vt=()=>{let e=C();return e.kind===`Step`?mt(e):e.kind===`Keyword`?Tr.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!pt()},yt=()=>{let e=o,t=C();return t.kind===`Operator`&&!sr.has(t.text)&&Nr(t.text)?(o++,S({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:_(t)},e)):O(`MODULE`)?S({kind:`ModuleFact`,name:de(),location:_(t)},e):N()},bt=()=>{let e=o,t=C(),n=A(()=>{let e=C();if((e.kind!==`Identifier`||ne(e))&&e.kind!==`Operator`)throw T(`Expected a definition name but found ${te(e)}`,e);return o++,e.text},`!`),r=_(t);return S(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},xt=()=>A(()=>{if(i)return bt();let e=yt(),n=(e.kind===`Identifier`||e.kind===`Subexpression`||e.kind===`OperatorReference`)&&!Fr.has(e);return e.kind!==`ModuleFact`&&!n&&Ir.set(e,Jn(xn(d[0].name,t),e)),e}),St=()=>{let e=oe(N);if(!e)return[];let t=[e];return ce(()=>{for(;E(`,`);){let e=oe(()=>(D(),N()));if(!e)return;t.push(e)}}),t},Ct=()=>{let e=i?St():vt()?A(yt):[],t=O(`DEF`)||O(`DEFS`);if(i&&e.length===0&&!t)throw T(`Expected a fact`);return{facts:e,defs:t?xt():[]}},wt=()=>{let e=o,t=D(),n=t.text===`USE`&&O(`ONLY`),r=x(e);return S({kind:t.text===`USE`?`Use`:`Hide`,isOnly:n,...Ct(),keyword:r,location:_(t)},e)},Tt=()=>{let e=o,t=_(C()),n=O(`NEW`),r=i?o:e,a=i?_(C()):t,s=C().kind===`Keyword`?Er.get(C().text):void 0;if(!n&&s===void 0)throw T(`Expected a declaration but found ${te(C())}`);if(s!==void 0&&D(),s===`Variable`){let e=fe();return S({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:a},r)}let c=dt(),l=(s??`Constant`)===`Constant`&&E(`\\in`);if(l&&c.arity>0)throw w(`declared symbol with arguments before \\in`);return l&&D(),S({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?N():void 0,nameRange:c.location.range,location:a},r)},Et=()=>{if(C().kind===`Identifier`&&E(`::`,1)&&E(`ASSUME`,2)&&(D(),D()),E(`ASSUME`))return Ot();if(C().kind===`Keyword`&&Dr.has(C().text))return i?se(Tt):Tt();if(!i)return N();let e=oe(N);if(e===void 0)throw T(`Expected a hypothesis`);return e},Dt=()=>{let e=[Et()];return ce(()=>{for(;;){let t=oe(()=>(k(`,`),Et()));if(t===void 0)break;e.push(t)}}),e},Ot=()=>{let e=o,t=_(k(`ASSUME`)),n=()=>{let n=i?Dt():A(Et);return k(`PROVE`),S({kind:`AssumeProve`,assumptions:n,conclusion:N(),location:t},e)};return i?se(n):n()},kt=e=>{let t=0;for(;C(t).kind===`Identifier`&&E(`,`,t+1);)t+=2;return C(t).kind===`Identifier`&&E(e,t+1)},At=()=>{let e=C();if(E(`USE`)||E(`HIDE`))return wt();if(!i&&E(`INSTANCE`)){let t=o;return S(ut(void 0,[],!1,_(e)),t)}if(E(`DEFINE`)||pt()){let t=o;O(`DEFINE`);let n=[st(!1)];for(;pt();)n.push(st(!1));let r={kind:`Define`,definitions:n,location:_(e)};return S(r,t)}if(O(`HAVE`))return{kind:`Have`,expression:N()};if(O(`TAKE`)){let e=ve(),t=pe(e?[]:A(fe)),n=e?Se():[];return{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(O(`WITNESS`))return{kind:`Witness`,expressions:A(()=>N())};if(O(`PICK`)){let e=kt(`:`),t=pe(e?A(fe):[]),n=e?[]:Se();return k(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:N()}}return O(`CASE`)?{kind:`Case`,expression:N()}:{kind:`Assert`,isSuffices:O(`SUFFICES`),statement:E(`ASSUME`)?Ot():N()}},jt=e=>{let t=C();if(t.kind!==`Step`)throw T(`Expected a step number but found ${te(t)}`,t);if(!_t(t))throw w(`${e?`QED step`:`step`}'s number has bad level`,t);if(n!==`sany`&&z(t)<0&&ht(t)!==void 0)throw w(`<*> and <+> cannot be used for a named step`,t);return o++,{name:ht(t),token:t.text,location:_(t)}},Mt=()=>{let e=o,t=jt(E(`QED`,1)),n=o,r=O(`QED`)?{kind:`Qed`}:At(),i=x(e),a=x(n),s=gt(C());if(s&&!mr.has(r.kind))throw w(`Proof of a step that does not take a proof`);let c=s?Ft():void 0;return S({...t,body:r,head:i,statement:a,proof:c},e)},Nt=e=>{if(O(`BY`)){let t=x(o-1);return{kind:`By`,isOnly:O(`ONLY`),...Ct(),keyword:t,location:e}}let t=C();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;D();let n=x(o-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Pt=()=>{let e=_(C());O(`PROOF`);let t=Nt(e);if(t)return t;let n=[Mt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(Mt());return{kind:`Steps`,level:R(),steps:n,location:e}},Ft=()=>{let e=o;L.push(-1);let t=Pt();return L.pop(),S(t,e)},It=()=>C().kind===`Step`||C().kind===`Keyword`&&pr.has(C().text),Lt=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return br(e);let n=t.defs[t.defs.length-1]?.location.range;return yr(br({...e,end:e.start}),br(n??t.keyword))},Rt=()=>{let e=o,t=_(C()),n=O(`PROOF`),r=Nt(t);if(r){let t=S(r,e);return{kind:`Leaf`,proof:t,span:br(t.keyword),first:e,end:o-1}}let i=C();if(i.kind!==`Step`)throw T(`Expected a step number but found ${te(i)}`);let a=o;D();let s=o,c=O(`QED`)?{kind:`Qed`}:At(),l=x(a);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:x(s),span:Lt(l,c),first:e,start:a,end:o-1}},zt=(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=Bt(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={..._(a[i.first]),range:x(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}},Bt=(e,t,n,r,i)=>{let a=e[t];if(!a)throw wr(`Unexpected end of (sub)proof at level ${n} before QED step`,r,Cr);if(a.kind===`Leaf`)throw wr(`Expecting a proof step but found a${_r[a.proof.kind]} leaf proof`,a.span,Cr);if(!i&&a.isProof)throw wr(`PROOF keyword found in step that does not begin subproof`,a.span,Sr);let o=a.token.text[1];if(o===`+`&&!i)throw wr(`<+> used but no subproof expected`,a.span,Sr);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:z(a.token);if(s<n||!i&&s>n)return;let c=mr.has(a.body.kind)?zt(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:ht(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{..._(a.token),range:x(a.start,l)}},d=yr(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=Bt(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:yr(d,f.span)}},Vt=()=>{if(!It())return;let e=[];for(;It();)e.push(Rt());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=zt(e,0,0,t.span),r=e[n.next];if(r)throw wr(`extra step(s) after finished proof`,r.span,xr,`Proof.Parser.toplevel`);return n.proof},Ht=(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})},Ut=()=>{if(C().kind!==`Identifier`||!E(`==`,1))return;let e=de();return D(),e},Wt=()=>{if(!i)return N();let e=ee(),t=oe(N);if(t)return t;throw T(`Expected "====" but found ${te(e)}`,e)},Gt=e=>{let t=o,n=D(),r=Ut(),a=E(`ASSUME`)?Ot():Wt(),s=i?Vt():gt(C())?Ft():void 0,c=S({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`&&Ht(e,r,a,c.location)},Kt=()=>{let e=o,t=D(),n=Ut();return S({name:n,expression:N(),isAxiom:t.text===`AXIOM`,location:_(t)},e)},qt=()=>{let e=_(k(`----`));k(`MODULE`);let t=ge();k(`----`);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),O(`EXTENDS`)&&A(()=>{let e=o;n.extends.push(ge()),n.extendsRanges.push(x(e))});;){let t=o,r=C();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(E(`MODULE`,1)){let e=qt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),k(`====`);continue}D()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=_(D()),r=F();n.constants.push(...r),e.range=x(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=_(D()),r=A(()=>{let e=o,t=_(C());return S({name:de(),arity:0,location:t},e)});n.variables.push(...r),e.range=x(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Kt();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&Ht(n,e.name,e.expression,e.location);continue}case`USE`:case`HIDE`:{if(E(`USE`)&&E(`ONLY`,1))throw T(`Expected a module unit but found ${te(r)}`);let e=wt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=_(D()),r=ft();e.range=x(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:Jt(n,S(ut(void 0,[],!1,_(r)),t));continue;case`LOCAL`:if(D(),E(`INSTANCE`)){Jt(n,S(ut(void 0,[],!0,_(r)),t));continue}Jt(n,S(lt(!0),t));continue}r.kind===`Keyword`&&fr.has(r.text)?Gt(n):Jt(n,st(!1))}}},Jt=(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}))},Yt=qt(),Xt=he?vn(t):void 0;if(Xt!==void 0)throw new e.I(Xt);return Yt},Br=e=>zr(e,`tlc`),Vr=(e,t)=>zr(e,`tlc`,t),Hr=e=>zr(e,`tlapm`),Ur=e=>zr(e,`sany`),Wr=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},Gr=e=>{let t=Wr(e);return t^t>>>16},Kr=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:Gr(e)&n-1})).sort((e,t)=>e.bucket-t.bucket||e.index-t.index).map(e=>e.name)},qr=(e,t)=>{let n=JSON.stringify(t);e.some(e=>JSON.stringify(e)===n)||e.push(t)},Jr=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}`,Yr=e=>e?.kind===`OpAppl`&&e.nullKind===`absent`,Xr=()=>({buckets:Array.from({length:11},()=>[]),count:0,threshold:8}),Zr=(e,t)=>(e&2147483647)%t,Qr=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[Zr(e.hash,t)].unshift(e));e.buckets=n,e.threshold=Math.floor(t*.75)},$r=(e,t,n=t)=>e.buckets[Zr(Wr(n),e.buckets.length)].find(e=>e.key===t)?.value,ei=(e,t,n,r=t)=>{let i=Wr(r),a=e.buckets[Zr(i,e.buckets.length)].find(e=>e.key===t);a?a.value=n:(e.count>=e.threshold&&Qr(e),e.buckets[Zr(i,e.buckets.length)].unshift({hash:i,key:t,value:n}),e.count++)},ti=e=>e.buckets.toReversed().flatMap(e=>e.map(e=>e.value)),ni=`\0module `,ri=()=>({table:Xr(),symbols:[]}),ii=e=>e.kind===`Module`?ni+e.name:e.name,ai=(e,t)=>{ei(e.table,ii(t),t,t.name),e.symbols.push(t)},oi=e=>e.kind===`ThmOrAssumpDef`?e.params.length:e.kind===`Module`?0:e.arity,si=(e,t)=>$r(e.table,t),ci=(e,t)=>$r(e.table,ni+t,t),li=e=>e.context.symbols.filter(e=>e.kind===`OpDef`&&e.defKind===`UserDefined`),ui=(e,t)=>ti(e.context.table).filter(e=>e.kind===`OpDecl`&&e.declKind===t).toReversed(),di=e=>e.context.symbols.filter(e=>e.kind===`ThmOrAssumpDef`),fi={kind:`Local`},pi=`$subexpression`,mi=/* @__PURE__ */ new WeakMap,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 WeakSet,Si=/* @__PURE__ */ new WeakSet,Ci=e=>Si.has(e)||Ti(yi.get(e))!==void 0,wi=e=>e?.find(e=>e.isEmpty?Si.has(e.node):xi.has(e.node)),Ti=e=>wi(e)?.error,Ei=/* @__PURE__ */ new WeakMap,Di=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Oi=new Map([...[`~>`,`-+->`,`\\cdot`,`\\X`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}]),[`'`,{key:`'`,arity:1,kind:`Builtin`}]]),ki=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Ai=(e,t)=>ki(e,t)?-1:+!!ki(t,e),ji=e=>e.kind===`Operator`?e.params.length:0,Mi=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Ni=e=>e.name.includes(`!`),Pi=e=>e.kind===`Function`&&!Ni(e)?e.bounds.length:void 0,Fi=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Ii=(e,t,n)=>{let r=t.bindings.get(e);return r&&ki(r.position,t.location)&&(!n||ki(r.position,n.start))?r:void 0},Li=(t,n)=>t!==void 0&&n!==void 0&&e.X(t)===e.X(n),Ri=(t,n,r,i)=>{if(n===void 0)return!0;if(Li(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 ${M(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 '${M(t)}': this definition or declaration conflicts \nwith the one at ${s}.`}):i.warnings.push({location:o,message:`Multiple declarations or definitions for symbol ${M(t)}. \nThis duplicates the one at ${s}.`}),!1},zi=(e,t,n,r)=>Ri(t,Fi(e,t)??Ii(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Bi=(e,t,n)=>{Ri(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Vi=(e,t,n,r)=>t.reduce((e,t,i)=>zi(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Hi=(e,t,n)=>t.reduce((e,t)=>zi(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Ui=e=>e.kind===`Name`?[e.name]:e.names,Wi=e=>e.flatMap(e=>Ui(e.pattern)),Gi=(e,t)=>{let n=t.definitions.get(e),r=Ii(e,t,void 0);return n!==void 0&&(n===t.self?n.isRecursive:n.isRecursive?r!==void 0:ki(n.location,t.location)&&(r===void 0||!ki(r.position,n.location)))?n:void 0},Ki=(e,t)=>{let n=Gi(e,t);if(n){let r=n.isRecursive?t.bindings.get(e):void 0;return{key:t.getKey(n),arity:r?.arity??ji(n),params:r?.params??Mi(n),kind:`Definition`,range:n.location.range,functionArity:Pi(n)}}let r=Ii(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},qi=(e,t)=>t.facts.has(e)||t.bindings.get(e)?.kind===`Theorem`,Ji=(e,t)=>t.bindings.get(e)?.kind===`Theorem`?t.goals.get(e):void 0,Yi=(e,t,n)=>Fi(t,e)??Ki(e,n),Xi=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Zi=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Xi(e.location,e.spelling??t)},Qi=e=>{if(!(e.kind!==`Apply`||e.argumentsRange)){if(e.args.length===2)return`infix`;if(e.args.length===1)return e.operator===`-.`?`prefix`:`postfix`}},$i=`In module --TLA+ BUILTINS--`,ea=/* @__PURE__ */ new Set([`Definition`,`Instance`,`Theorem`]),ta=(t,n,r)=>r.errors.push({location:e.X(n),message:`Cannot take subexpression of \`${M(t)}'.`}),na=e=>!/^[\p{L}\d_]/u.test(e),ra=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),ia=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,aa=(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])}})},oa=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?aa(e.name,[],void 0):aa(e.operator,e.args,e.argumentCounts),sa=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),ca=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Wi(e.bounds),body:e.body,sets:sa(e.bounds)};case`SetMap`:return{names:Wi(e.bounds),body:e.expression,sets:sa(e.bounds)};case`SetFilter`:return{names:Ui(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Ui(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}},la=e=>{let t=e.operands,n=e.location.range,r=e.prefixEnds?.[t.length-3];return e.isBulleted||!n||!r?t:[{...e,operands:t.slice(0,-1),prefixEnds:e.prefixEnds?.slice(0,-1),location:{...e.location,range:{...n,end:r}}},t[t.length-1]]},ua=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return la(e);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=bi.get(e);if(!(e.kind===`Apply`&&n===void 0&&Ci(e)))return e.kind===`FunctionApplication`&&Ci(e)?pa(e.function,t):He(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`?ia(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(xi.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(Ci(e))return o(r,`Choosing operand \`${a}' of subexpression with no operands.`);let n=ca(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,xi.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`&&xi.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=Fi(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=oa(e),a=i[0],o=i.length>1&&a.kind===`Name`?Fi(t,a.name)?.goal??Ji(a.name,n):void 0;return o&&{node:va(e,i,o,n,r)}},Sa=(e,t,n)=>{let r=Fi(t,e)??Ii(e,n,void 0);return r?r.kind===`Instance`:Aa(e,t,n)!==void 0&&[...n.bindings.keys()].some(t=>t.startsWith(`${e}!`))},Ca=(t,n,r,i)=>{let a=t.location;if(za(t,r,i))return;let o=Ei.get(t);if(o!==void 0)return o;if(Di(n))return t.kind===`Apply`?t.args.length:0;let s=Fi(r,n);if(s?.nonFactStep){i.errors.push({location:e.X(Zi(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(Zi(t,n)),message:`${c} proof step selected instead of expression.`});return}if(xa(t,r,i,!1)||ra(n)&&s)return t.kind===`Apply`?t.args.length:0;if(Sa(n,r,i)){let a=Fi(r,n)??Ii(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||Zi(t,n)),message:`The operator ${n} requires ${a.arity} arguments.`});return}let s=Zi(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=fi),s)return s.arity;if(Ji(n,i)?.statement.kind===`AssumeProve`)return 0;let l=Ki(n,i);if(l)return t.kind===`Identifier`?t.name=l.key:t.operator=l.key,Ei.set(t,l.arity),l.arity;let u=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``,d=u===``?void 0:Fi(r,u)??Ki(u,i);if(d&&(!ea.has(d.kind)||Fi(r,u)?.nonFactStep)){ta(u,t.kind!==`OperatorReference`&&t.selectorRanges?.[0]||Zi(t,n),i);return}if(t.kind!==`OperatorReference`&&u!==``&&Va(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!==``&&qi(u,i))return t.kind===`Apply`?t.args.length:0;let f=Qi(t),p=t.kind===`OperatorReference`||f!==void 0;if(!na(n)||ra(n)||!p){i.errors.push({location:e.X(Zi(t,n)),message:`Unknown operator: \`${M(n)}'.`});return}let m=t.spelling??n;i.errors.push({location:e.X(f===`prefix`&&m===`-.`?Xi(a,`-`):Zi(t,n)),message:`Could not find declaration or definition of symbol '${m}'.`}),f&&xi.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=>U(e.set,t,n)),e.reduce((e,t)=>Vi(e,Ui(t.pattern),t.pattern.ranges,n),t)),Ta=(e,t)=>e.kind===`Identifier`&&e.name===t&&j(e)||He(e).some(e=>Ta(e,t)),Ea=(e,t)=>{e.kind===`FunctionConstruction`&&Ta(e.body,t)&&(e.isRecursive=!0),He(e).forEach(e=>Ea(e,t))},Da=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?Wi(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):Hi(n,t.params,a),u=Fi(l,o)??Ii(o,a,s),d=u?.isPending===!0&&i.has(u);return u?.isPending&&!d?c(`Recursive ${t.kind===`Function`?`function`:`operator`} ${M(o)} defined at wrong LET/IN level.`):u&&!d?c(t.kind===`Function`?`Function name \`${o}' already defined or declared.`:`Operator ${M(o)} already defined or declared.`):u&&t.kind===`Function`&&u.arity>0?c(`Function ${M(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 ${M(o)} has different arity than its RECURSIVE declaration.`),u&&d&&t.kind===`Operator`&&(u.params=Mi(t)),t.kind===`Function`?(U(t.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),Ea(t.body,o),t.isSelfReferential=Ta(t.body,o)):U(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:Ri(o,Fi(n,o)??Ii(o,a,s),{kind:`Definition`,arity:ji(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(Fi(e,t.name)?.isPending)return e;let n={name:t.name,arity:ji(t),params:Mi(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=Ri(t.name,Fi(e,t.name)??Ii(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)=>Ai(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?eo(t,e,r):l(e,t),e)},f=d(t.reduce((e,t)=>{let n=Di(t.name)?e:d(e,e=>!ki(t.location,e.location)),a={name:t.name,arity:ji(t),kind:`Definition`,range:t.location.range,parent:n,functionArity:Pi(t)};if(Ni(t))return{...a,params:Mi(t),functionArity:Fi(n,t.name)?.functionArity};let s=i.some(e=>e.location===t.location),c=r.isGenerated||t.isLocal||Di(t.name),l=s?{...r,isGenerated:!0,errors:[],warnings:[]}:c?{...r,isGenerated:c}:r;return Da(t,n,l,o)?{...a,params:Mi(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 ${M(n.name)} declared in RECURSIVE statement but not defined.`})}),f},ka=(e,t,n)=>e.slice(0,-1).map((r,i)=>{let a=e.slice(0,i+1).join(`!`),o=Fi(t,a)??Ii(a,n,void 0);return o?.kind===`Instance`?{name:a,arity:o.arity,range:o.range}:void 0}),Aa=(e,t,n)=>ka(e.split(`!`),t,n)[0],ja=(t,n,r)=>{if(!da(t))return!1;let i=oa(t),a=i.findIndex(e=>e.kind!==`Name`),o=i.slice(0,a===-1?i.length:a).flatMap(e=>e.kind===`Name`?[e]:[]),s=ka(o.map(e=>e.name),n,r),c=s.findIndex((e,t)=>e!==void 0&&(s[t-1]?.arity??0)+o[t].args.length!==e.arity),l=s[c];if(!l)return!1;let u=(t.kind===`Identifier`?void 0:t.argumentRanges?.[c])??t.location.range;return u&&r.errors.push({location:e.X(u),message:`The operator ${l.name} requires ${l.arity-(s[c-1]?.arity??0)} arguments.`}),!0},Ma=(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 '${M(n)}', \nwhich requires ${o.length} arguments.`}),!0)},Na=(t,n,r)=>{let i=t.location.range,a=t=>{i&&r.errors.push({location:e.X(i),message:t})},o=gi.get(t);if(t.kind===`Lambda`&&t.operator!==void 0)a(`The operator ${M(t.operator)} requires 1 arguments.`);else if(o)r.errors.push(o);else if(t.kind===`Lambda`&&i)xi.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 ${M(t.operator)} requires ${e} arguments.`)}else U(t,n,r)},Pa=(e,t=!1)=>{if(!da(e))return;let n=t||e.kind===`Subexpression`||e.kind===`Apply`&&e.argumentCounts?.at(-1)===0?oa(e):[],r=n.findIndex(e=>`args`in e&&e.args.length>0);if(r===-1)return;let i=n[r];return{index:r,range:e.selectorRanges?.[r],message:`Selector \`${i.kind===`Name`?i.name:`!(...)`}' should not have argument(s).`}},Fa=(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=Aa(i,o,s)?.range??Yi(i,o,s)?.range;u&&c(a,`Operator with incorrect arity passed as argument. \nOperator '${M(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 Na(t,o,s),!0;let d=Fr.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=mi.get(t)??t,p=Pa(f);if(p)return c(p.range,p.message),!1;if(t.kind===`Lambda`){if(mi.has(t)?U(t,o,s):Ba(t,o,s),Ti(yi.get(t)))return!1;let e=t.params.length===n;return!e&&mi.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=Ti(yi.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 U(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=Yi(m,o,s)?.params??[],g=Ca(t,m,o,s);return t.kind===`Identifier`&&g!==void 0&&g!==n&&c(Zi(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)},Ia=(t,n,r)=>{let i=t.operator,a=Yi(i,n,r),o=ja(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??Zi(t,i)),message:`The operator ${M(i)} requires ${o-(ka(i.split(`!`),n,r).findLast(e=>e!==void 0)?.arity??0)} arguments.`}),o!==t.args.length){Si.add(t);return}let s=a&&(a.kind===`Definition`?a.params:t.args.map(()=>0));if(s===void 0){t.args.forEach(e=>La(e,n,r));return}let c=t.selectorRanges?.at(-1)??Zi(t,i),l=i===pi,u=t.args.slice(0,s.length).map((e,t)=>{let a=l?vi.get(e):void 0;return Fa(e,s[t],a?.index??t,a?.operator??i,a?.range??c,n,l?{...r,isGenerated:!1}:r)});Ma(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.`})})},La=(e,t,n)=>{e.kind===`Identifier`?Ca(e,e.name,t,n):U(e,t,n)},Ra=(e,t,n)=>e.forEach(e=>e.args.slice(0,e.params.length).forEach((r,i)=>Fa(r,e.params[i],i,e.operator,e.range,t,n))),za=(e,t,n)=>{let r=hi.get(e);return r?(Ra(r.applications,t,n),n.errors.push(Ti(r.nulls)??r.error),!0):!1},Ba=(e,t,n)=>U(e.body,Vi(t,e.params,e.paramRanges,n),{...n,labelParams:[...n.labelParams,...e.params]}),U=(t,n,r)=>{if(mi.has(t)&&!r.isGenerated){let e=wi(yi.get(t));if(e){Si.add(t),Ra(e.applications,n,r),r.errors.push(e.error);return}U(t,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>U(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&&(Si.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=ja(t,n,r)?void 0:Ca(t,i,n,r);if(a===0){let a=Yi(i,n,r),o=a?.kind;(o===`Variable`||o===`Theorem`||o?.startsWith(`New`)||qi(i,r))&&Si.add(t);let s=Fi(n,i);if((s?s.goal:Ji(i,r))?.statement.kind===`AssumeProve`){r.errors.push({location:e.X(Zi(t,i)),message:`ASSUME/PROVE used where an expression is required.`});return}Ma(a,i,0,Zi(t,i),r);return}a!==void 0&&r.errors.push({location:e.X(Zi(t,i)),message:`The operator ${M(i)} requires ${a} arguments.`}),Si.add(t);return}case`OperatorReference`:Ca(t,t.operator,n,r);return;case`Apply`:Ia(t,n,r);return;case`Lambda`:mi.has(t)?Ba(t,n,r):t.location.range&&(xi.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`:U(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&&U(t.other,n,r);return;case`Let`:U(t.body,Oa(t.definitions,n,r,t.instances,t.recursive),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:U(t.body,wa(t.bounds,n,r),a(Wi(t.bounds)));return;case`UnboundedQuantifier`:U(t.body,Vi(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&U(t.set,n,r),U(t.body,Vi(n,Ui(t.pattern),t.pattern.ranges,r),a(Ui(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:U(t.predicate,wa([t.bound],n,r),a(Ui(t.bound.pattern)));return;case`SetMap`:U(t.expression,wa(t.bounds,n,r),a(Wi(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??Xi(i.location,i.name)),message:`Non-unique fields in constructor.`}),U(i.value,n,r)});return;case`Except`:U(t.function,n,r),t.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),U(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:Yi(o,n,r)?.functionArity;U(a,n,r);let c=t.args.length;if(s===void 0||c<2||s===c||Ci(a)){i(t.args);return}Si.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`:U(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;U(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),ba(t,n,r);return;case`Subexpression`:Ha(t,n,r)&&Si.add(t);return;case`Selection`:return}},Va=(t,n,r,i,a,o)=>{let s=Fi(a,t)??Ii(t,o,void 0);return!s?.isPending||!r||!i?!1:n.length===s.arity?(n.forEach(e=>U(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)},Ha=(t,n,r)=>{if(ja(t,n,r)||za(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&&(Ki(s.slice(0,t+1).join(`!`),r)?.kind??`Instance`)!==`Instance`),l=s.length>1&&(Fi(n,s[0])??Ii(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: \`${M(s.join(`!`))}'.`}),!0;let d=s.slice(0,c+1).join(`!`),f=c>0?Ki(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 ${M(d)} requires ${f.arity} arguments.`}),!0;if(i.kind===`Name`&&t.selectors[1].kind!==`Name`&&a){let t=Fi(n,i.name),o=t??Ki(i.name,r);if(o===void 0&&!qi(i.name,r)||o?.kind===`Instance`)return r.errors.push({location:e.X(a),message:`Unknown operator: \`${M(i.name)}'.`}),!0;if(o&&(!ea.has(o.kind)||t?.nonFactStep))return ta(i.name,a,r),!0}if(i.kind===`Name`&&Va(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=>La(e,n,r));let h=xa(t,n,r,!1);return h?h.node===void 0:!1},Ua=(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.`})},Wa=(t,n,r,i)=>{if(t.kind===`ModuleFact`){Ua(t,i);return}if(t.kind===`ExceptAt`&&t.location.range)return i.errors.push({location:e.X(t.location.range),message:"Unknown operator: `@'."}),$i;let a=Ja(t,n,r,i);if(mi.has(t))return U(t,r,i),a;if(ja(t,r,i))return a;let o=xa(t,r,i,!0);if(o){let n=o.node?.kind;return n===void 0?$i:n===`AssumeProve`||n===`NewSymbol`?void 0:t.location.range&&e.X(t.location.range)}if(t.kind===`Subexpression`)return Ha(t,r,i)?$i:a;let s=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;return t.kind===`Identifier`&&Fi(r,s)?.nonFactStep?(i.errors.push({location:e.X(Zi(t,s)),message:`Step number of non-fact used as a fact`}),$i):(qi(s,i)||Fi(r,s)?.goal||t.kind===`Identifier`&&Sa(s,r,i)||U(t,r,i),a)},Ga=(t,n,r)=>{if(t.kind===`ModuleFact`)return Ua(t,r),r.isModuleKnown(t.name,t.location);let i=Ir.get(t)??[];if(r.errors.push(...i.map(e=>({location:Jr(e.location),message:e.message}))),i.length>0)return!1;let a=Lr(t),o=a??mi.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=Fi(n,c),u=l??Ki(c,r)??Ii(c,r,s);return u===void 0&&qi(c,r)||(da(o)&&oa(o).length>1&&(u===void 0||Pa(o,!0))?qa(t,o,n,r):c===``||Ka(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)},Ka=(t,n,r,i,a)=>(r===void 0&&a.errors.push({location:e.X(i),message:`Unknown operator: \`${M(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&&ea.has(r.kind)&&!ra(t))),qa=(t,n,r,i)=>{let a=(t,n)=>(t&&i.errors.push({location:e.X(t),message:n}),!1),o=Pa(n,!0);if(o?.index===0)return a(o.range,o.message);let s=oa(n),c=n.selectorRanges,l=hi.get(t);if(!l&&!mi.has(t)){let e=s[0],t=e.kind===`Name`?e.name:``,l=Fi(r,t),u=l??Ki(t,i);if(u&&(!ea.has(u.kind)||l?.nonFactStep)&&c?.[0])return ta(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: \`${M(p.join(`!`))}'.`)}if(o)return a(o.range,o.message);let u=l?Ti(l.nulls)??l.error:Ti(yi.get(t));return u?(i.errors.push(u),!1):s.at(-1)?.kind===`Name`&&s.at(-2)?.kind!==`Name`},Ja=(t,n,r,i)=>{let a=t.location.range&&e.X(t.location.range);if(mi.has(t))return Ti(yi.get(t))?$i:n.location.range&&e.X(n.location.range);if(hi.has(t)||t.kind===`ExceptAt`)return $i;switch(t.kind){case`Number`:case`String`:case`Decimal`:case`Let`:case`Label`:return;case`Identifier`:case`Apply`:case`Subexpression`:{let e=oa(t)[0];if(t.kind===`Subexpression`||e.kind!==`Name`)return;let n=t.kind===`Identifier`?t.name:t.operator,o=Fi(r,e.name)?.goal??Ji(e.name,i);if(qi(n,i)||o||ra(n)&&Fi(r,n)||t.kind===`Identifier`&&Sa(n,r,i))return;let s=Yi(n,r,i),c=t.kind===`Apply`?t.args.length:0;return s?.arity===c?a:$i}default:return a}},Ya=(t,n,r)=>{let i=_i.get(t.facts)??t.facts,a=t.facts.map((e,t)=>Wa(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=>Ga(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.`})},Xa=(e,t,n)=>(e.set&&U(e.set,t,n),zi(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Za=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Xa(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Za(t,e.scope,e.unit,!0):U(t,e.scope,e.unit),e),{scope:t,unit:n});return U(e.conclusion,i.scope,i.unit),i.scope},Qa=(e,t,n)=>e.kind===`AssumeProve`?Za(e,t,n):(U(e,t,n),t),$a=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Ya(e,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>no(t,e,r),t)},eo=(e,t,n)=>{let r=co(e,t,n);return e.name===void 0?r:zi(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},to=(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:sa(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}},no=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=to(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=Qa(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return $a(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 $a(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 Ya(r,t,n),s(t,r.kind);case`Instance`:return s(eo(r,t,i),r.kind);case`Define`:return s(r.definitions.reduce((e,t)=>t.kind===`Instance`?eo(t,e,i):Oa([t],e,n),t),r.kind);case`Have`:case`Case`:return U(r.expression,t,i),$a(e.proof,o(t),n),o(t);case`Witness`:return r.expressions.forEach(e=>U(e,t,i)),o(t);case`Take`:return o(Vi(wa(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let a=Vi(wa(r.bounds,t,i),r.names,r.nameRanges,i);return U(r.body,a,{...i,labelParams:[...i.labelParams,...Wi(r.bounds),...r.names]}),$a(e.proof,o(t),n),o(a)}default:return $a(e.proof,o(t),n),o(t)}},ro=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Qa(e.statement,void 0,t);e.name!==void 0&&Bi(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),$a(e.proof,n,t),r&&(r.isInProof=!1)},io={line:0,column:0},ao=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),oo=(e,t)=>{let n=new Map([...Oi,...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},so=(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 '${M(e.name)}', and it must have arity ${e.arity}.`}),c=(t,n)=>{let r=n.location.range;if(t.arity===0){Na(n,o,a);return}let i=Fr.get(n),c=i?void 0:mi.get(n);if(c){let r=n.kind===`Lambda`?n.params.length:0,i=Ti(yi.get(n));n.kind===`Lambda`?U(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,$i);return}if(n.kind===`Subexpression`&&!i){U(n,o,a),s(t,$i);return}if(n.kind===`Lambda`&&!i){Ba(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,$i):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 '${M(t.name)}'.`}),s(t,$i);return}let l=Ca(n,n.name,o,a);l!==void 0&&l!==t.arity&&a.errors.push({location:e.X(Zi(n,n.name)),message:`Expected arity ${t.arity} but found operator of arity ${l}.`}),l!==t.arity&&s(t,$i)},l=t.location.range,u=n.filter(e=>Fi(o,e.name)!==void 0||Ki(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 '${M(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 ${M(t.name)} declared at ${e.X(n)} \nand instantiated in module ${r}.`})}),d},co=(e,t,n)=>{let r=n.getInstance(e);return so(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,t)=>zi(e,t[0],t[1],n),t)},lo=(e,t,n,r)=>{let i=oo(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),so(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])??io}])),errors:o.errors,warnings:o.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},uo=(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)=>Ai(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},fo=(t,n)=>{let r=oo(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([...Oi,...n.bound].map(e=>[e[0],{...e[1],position:io}])),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=>Bi(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return uo([...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=Ri(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=>{ao(t,e)?U(e.body,void 0,n):Da(e,void 0,n,o)&&a.set(e.name,{kind:`Definition`,arity:ji(e),range:e.location.range,position:e.location})})),...t.instances.map(e=>c(e.location,void 0,!1,t=>{Hi(void 0,e.params,t),n.instanced.get(e)?.forEach((e,n)=>Bi(n,e,t)),e.name!==void 0&&Bi(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=>{U(e.expression,void 0,t),e.name!==void 0&&Bi(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=>ro(e,t))),...t.uses.map(e=>c(e.location,void 0,!1,t=>Ya(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 ${M(n.declaration.name)} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},po={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:` `}},mo=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},ho=e=>e!==void 0&&/^\p{Nd}$/u.test(e),go=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),_o=e=>{let t=t=>{let n=ye(e,t,mo);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=ye(e,t,ho);if(e.startsWith(`..`,n)&&ho(e[n+2]))return{kind:`Constant`,first:t,last:ye(e,n+2,ho)-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=ho(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:ye(e,t+1,ho)-1,children:[]};if(go(n))return{kind:`Constant`,first:t,last:ye(e,t,go)-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)},W=e=>{let t=e.length===0?void 0:_o(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=po[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},vo={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},yo={none:0,error:1,warning:3,state:4},bo={0:``,1:`Error: `,3:`Warning: `,4:`State `},xo=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${bo[n]}${r}`,So=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===yo.warning;if(o&&t.errorCodes?.includes(r))throw new e.H(r,a);if(o&&t.isWarningEnabled===!1||i!==yo.error&&t.suppressedCodes?.includes(r))return;let s=o&&!t.isTool&&n.size===0?`
|
|
346
|
+
(Use the -nowarning option to disable this warning.)`:``,c=xo(t.isTool,r,i,`${a}${s}`);o&&n.has(c)||(o&&n.add(c),console.log(c))}}},Co=`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.`,wo=[[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,Co,!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 To;const Eo=()=>To??=wo.map(e=>({pattern:RegExp(`^${e[1].split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e[0],isEvalException:e[2]}})),Do=/^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)\)\./,Oo=e=>Do.test(e)?void 0:Eo().find(t=>t.pattern.test(e))?.message,ko=t=>t instanceof e.A||Oo(t.message)?.isEvalException===!0,Ao=/* @__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
|
+
`]]),jo=(e,t,n)=>{let r=n?Ao.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)}${Mo(t.slice(a),n)}`},Mo=(e,t)=>{let n=t?Oo(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${yo.none} @!@!@\n${jo(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},No=(e,t=2)=>String(e).padStart(t,`0`),Po=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 ${No(r%24)}h`:e>36e5?`${No(r%24)}h ${No(n)}min`:e>6e4?`${No(n)}min ${No(t)}s`:`${No(t)}s`},Fo=e=>`${e.getFullYear()}-${No(e.getMonth()+1)}-${No(e.getDate())} ${No(e.getHours())}:${No(e.getMinutes())}:${No(e.getSeconds())}`,Io=/* @__PURE__ */ new WeakMap,Lo=(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 Io.set(i,{code:n,headline:r,inner:t}),i},Ro=e=>Io.has(e),zo=e.$(`util.WrongInvocationException`),Bo=e.K.slice(0,e.K.indexOf(`
|
|
399
|
+
`)),Vo=`${e.K}tlc2.tool.EvalException: `,Ho=`${e.K}util.Assert$TLCRuntimeException: `,Uo=e=>ko(e)?Vo:Ho,Wo=t=>{try{return t()}catch(t){throw t instanceof e.x?ko(t)?new e.x(`${e.G}${t.message}`):Oo(t.message)?t:new e.x(`${e.K}${t.message}`):t}},Go=[Vo,Ho,e.K,e.G],Ko=(t,n)=>{let r=Io.get(t);if(r)return`${r.headline}\n${Ko(r.inner,n)}`;let i=t.message;if(t instanceof e.B)return i;let a=Go.find(e=>i.startsWith(e))??``;return`${a}${Mo(i.slice(a.length),n)}`},qo=(t,n)=>{let r=Io.get(t),i=t.message;if(r)return{code:r.code,message:i,toolMessage:Ko(t,!0)};if(t instanceof e.F)return{code:n?vo.stackOverflow:vo.general,message:i,toolMessage:i};if(n&&ko(t))return{code:Oo(i)?.code??vo.general,message:i,toolMessage:i};let a=n&&!i.startsWith(Bo)&&!(t instanceof e.B),o=t instanceof e.P?zo:e.K,s=a?o:``;return{code:vo.general,message:`${s}${i}`,toolMessage:`${s}${Ko(t,!0)}`}},Jo=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,Yo=2147483647,Xo=1e6;let Zo=Xo;const Qo=()=>Zo,$o=()=>Math.max(Zo,10),es=()=>`Attempted to construct a set with too many elements (>${Zo}).`,ts=(t,n)=>{if(t.length===$o())throw new e.P(es());t.push(n)},ns=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=$o(),rs=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},is=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,as=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),os=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),ss=e=>typeof e==`object`&&e.kind===`ModelValue`,cs=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),ls=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:is(e)?`set`:`function`,us=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let ds=!1;const fs=(e,t)=>(ds=!0,e.writtenKeys=t,e),ps=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,ms=e=>ps(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),hs=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):ms(e),gs=(e,t,n,r)=>fs(cl(e,t.map(e=>n[e])),r),_s=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(_s);e.writtenKeys=void 0,e.range.forEach(_s)}},vs=e=>{ds&&typeof e==`object`&&e.kind===`Function`&&(e.writtenKeys=void 0)},ys=e=>e.every(e=>typeof e==`string`),bs=(e,t)=>e.length>0&&t.length>0&&ys(e)!==ys(t),xs=(e,t)=>{ds&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return bs(n,r)?jc(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=qs(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:qs(t,n);if(r!==0)return r}return 0},Ss=(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=qs(n[e],r[e]);if(t!==0)return t}return 0},Cs=e=>ss(e)?e.type:void 0,ws=(t,n,r)=>{let i=Cs(t),a=Cs(n);if(i===void 0&&a===void 0)return;let o=r?`check equality of`:`compare`;if(ss(t)&&ss(n)){if(i===void 0||a===void 0||i===a)return;throw new e.x(`Attempted to ${o} the differently-typed model values ${W(q(t))} and ${W(q(n))}`)}throw i===void 0?new e.x(`Attempted to ${o} the typed model value ${W(q(n))} and the non-model value\n${W(q(t))}`):new e.x(`Attempted to ${o}${r?``:` the`} typed model value ${W(q(t))} and non-model value\n${W(q(n))}`)},Ts=()=>({ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0}),Es=Ts(),Ds=e=>{Object.assign(Es,Ts()),Js.clear();for(let t of e)Ls(t)},Os=()=>{Es.searchRank=Es.size},ks=()=>Es.unorderedString;let As=!1;const js={isExpanded:!0,isViewPrinted:!1},Ms=e=>{As=e.version===`1.7.4`,Zo=e.maxSetSize??Xo,js.isExpanded=e.isLazyValueExpanded??!0,js.isViewPrinted=e.isViewPrinted??!1},Ns=/* @__PURE__ */ new WeakMap,Ps=(e,t)=>(js.isViewPrinted&&Ns.set(e,t),e),Fs=/* @__PURE__ */ new WeakMap,Is=(e,t)=>(Fs.set(e,t),e),Ls=e=>(Es.ranks[e]===void 0&&(Es.ranks[e]=Es.size++),e),Rs=e=>Es.ranks[Ls(e)],zs=(e,t)=>{if(e===t)return 0;let n=Es.ranks,r=n[e],i=n[t],a=Es.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(Es.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},Bs=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Vs=(e,t)=>(Bs(e)||Bs(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Hs=(t,n)=>new e.x(Bs(t)?`Attempted to compare overridden value ${W(q(t,!0))} with non-overridden value:\n${W(q(n))}`:`Attempted to compare ${ls(t)} ${q(t)} with ${ls(n)} ${q(n)}`),Us=(t,n,r)=>{if(!Bs(t))throw new e.x(`Attempted to ${r} the set ${W(q(pl(t)?G(t):t,!0))} with the value:\n${W(q(n,!0))}`);if(!Bs(n))throw Hs(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 ${W(q(t,!0))} with the value\n${W(q(n,!0))}`)},Ws={kind:`InfiniteSet`,name:`Any`},Gs=t=>{throw new e.A(`Attempted to compare ANY with the value\n${W(q(t))}`)},Ks=e=>{ds&&_s(e),e===Ws&&Gs(e),typeof e==`object`&&e.kind===`LazyFunction`&&K(e)},qs=(e,t)=>{if(e===t)return Ks(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return xs(e,t);if(n===`Set`&&r===`Set`)return Ss(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&&ws(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return ws(e,t,!1),n===`ModelValue`?-1:1;if(e===Ws||t===Ws)return Gs(e===Ws?t:e);if(is(e)&&is(t)&&Vs(e,t))return Us(e,t,`compare`);let i=is(e);if(i!==is(t))throw Hs(e,t);if(n===`Interval`&&r===`Set`){let n=Nl(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-Nl(t);if(n!==0)return n}return i?Ss(G(e),G(t)):xs(K(e),K(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return zs(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(ws(e,t,!1),ss(e))return-1;if(ss(t))return 1;throw Hs(e,t)},Js=/* @__PURE__ */ new Map,Ys=32768,Xs=t=>{let n=Js.get(t);if(n)return n;if(Js.size===Ys)throw new e.S(`TLC supports at most ${Ys} 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:Rs(t),hash:fu(pu(mu(t),109)),fingerprint:Cu(wu(t)^60)};return Js.set(t,r),r},Zs=()=>[...Js.values()],Qs=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),$s=e=>{let t=Qs(e);return t.isNormalized=!0,t},ec=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let tc=!1;const nc=(e,t)=>(t===`lambda`&&(tc=!0),t!==void 0&&(e.functionClass=t),e),rc=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,ic=e=>nc(e,`lambda`),ac=e=>Jo(e)&&e.isCached===!0;let oc=!1;const sc=e=>(oc=!0,e),cc=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),lc=e=>{oc&&typeof e==`object`&&Jo(e)&&cc.has(e.kind)&&(e.isCached=!0)},uc=e=>{(tc||oc)&&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(uc),e.range.forEach(uc)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(uc):is(e)&&pl(e)&&(lc(e),G(e).elements.forEach(uc))))},dc=(e,t)=>{if(lc(e),e===t)return Ks(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&ws(e,t,!0),qs(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return xs(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Ss(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&Nl(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==Nl(t))return!1;if(ss(e)||ss(t))return e.kind===`LazyFunction`&&K(e),ws(e,t,!0),ss(e)&&ss(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return dc(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=Al(e.domain),r=Al(t.domain);if(n||r)return n===r;let i=Al(e.range),a=Al(t.range);return i||a?i===a:dc(e.domain,t.domain)&&dc(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(Al(e))return Al(t);if(Al(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]&&dc(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return Al(e)?Al(t):!Al(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>dc(e,t.factors[n]));let n=is(e)&&is(t)&&!(pl(e)&&pl(t));if(n&&Vs(e,t))return Us(e,t,`check equality of`)===0;if(n){if(!Bs(e)){let n=G(e);if(!Bs(t))return Ss(n,G(t))===0}return ku(e)===ku(t)}return qs(e,t)===0},fc=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):ku(n)===ku(r);return n},pc=fc(!1),mc=fc(!0),hc=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},gc=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Su(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||mc(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||mc(i[e],n))return i[e]}return n.kind===`Set`?hc(n.elements,t):(hc(n.domain,t),hc(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}},_c=(e,t)=>t.length===0||rc(e)===`tuple`?1:lu(t)?.low,vc=e=>{if(!os(e))return;let t=K(e);return{domain:t.domain,range:t.range,low:_c(e,t.domain)}},yc=e=>{if(!os(e))return;let t=K(e);return ys(t.domain)?t:void 0},bc=(e,t,n)=>(ws(t,e,n),1),xc={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`}},Sc=(e,t,n)=>{let r=xc[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${W(q(e))} with ${r.other}:\n${W(q(t))}`},Cc=e=>e?`check equality of`:`compare`,wc=(t,n,r,i)=>{let a=vc(r);if(!a){if(ss(r))return bc(r,n,i);throw new e.x(`Attempted to ${Cc(i)} the function ${W(q(n))} with the value:\n${W(q(r))}`)}if(t.range.length!==a.range.length)return t.range.length-a.range.length;let o=()=>Tc(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 Tc(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${W(q(r))}.`);let a=t.low===void 0?r-(s+n):s+n-r;if(a!==0)return a}return o()},Tc=(e,t,n)=>{for(let r=0;r<e.length;r++){let i=Ac(e[r],t[r],n);if(i!==0)return i}return 0},Ec=(t,n,r)=>{let i=K(t);if(rc(t)===`tuple`){let e=os(n)?Rl(n):void 0;return e?i.range.length-e.length||Tc(i.range,e,r):wc({...i,low:1},t,n,r)}if(rc(t)===`record`){let a=yc(n);if(!a){if(ss(n))return bc(n,t,r);throw new e.x(`Attempted to ${Cc(r)} record:\n${W(q(t))}\nwith non-record\n${W(q(n))}`)}return i.domain.length-a.domain.length||Tc(i.domain,a.domain,r)||Tc(i.range,a.range,r)}return wc({...i,low:_c(t,i.domain)},t,n,r)},Dc=(e,t)=>Bs(e)||Bs(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),Oc=(e,t)=>{let n=cs(t)?t:G(t);return{elements:G(e).elements,otherElements:G(n).elements}},kc=(t,n,r)=>{if(Dc(t,n))return r?+!dc(t,n):qs(t,n);if(!cs(t))return kc(G(t),n,r);if(!is(n)){if(ss(n))return bc(n,t,r);throw new e.x(`Attempted to ${Cc(r)} the set ${W(q(t))} with the value:\n${W(q(n))}`)}let i=Oc(t,n);return i.elements.length-i.otherElements.length||Tc(i.elements,i.otherElements,r)},Ac=(t,n,r)=>{if(typeof t!=`object`){if(typeof n==typeof t)return r?t===n?0:1:qs(t,n);if(ss(n))return bc(n,t,r);throw new e.x(Sc(t,n,r))}return t.kind===`ModelValue`?(t.type!==void 0&&ws(t,n,r),ss(n)?r?t.name===n.name?0:1:t.rank-n.rank:-1):os(t)?Ec(t,n,r):kc(t,n,r)},jc=(e,t)=>Ac(e,t,!1),Mc=(e,t)=>Ac(e,t,!0)===0,Nc=e=>{let t=[];for(let n of e){let e=Fc(n,t);e.isFound||t.splice(e.index,0,n)}return t},Pc=(e,t)=>{let n=Bl.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Fc=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=Pc(e,()=>jc(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},Ic=(e,t)=>t.some(t=>Pc(t,()=>Mc(t,e))),Lc=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,Rc=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(Rc)),e.kind===`Function`&&(e.writtenKeys=void 0,e.domain.forEach(Rc),e.range.forEach(Rc)))},zc=e=>{if(!(typeof e!=`object`||ac(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:G(e);return;case`FilteredSet`:case`Subset`:return zc(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(zc(e.left),zc(e.right));case`FunctionSet`:return zc(e.domain),zc(e.range);case`RecordSet`:return e.sets.forEach(zc);case`ProductSet`:return e.factors.forEach(zc)}},Bc=(e,t)=>Vl(dc,Mc,e,t),Vc=e=>{for(let t=1;t<e.length;t++)if(qs(e[t-1],e[t])>=0)return!1;return!0},Hc=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},Uc=e=>{for(let t=1;t<e.length;t++)lc(e[t]);if(e.length<2||Vc(e))return Qs(e);let t=[...e].sort(qs),n=[t[0]];for(let e=1;e<t.length;e++)qs(n[n.length-1],t[e])!==0&&n.push(t[e]);return Qs(n)},Wc=e=>{if(Hc(e))return Qs(e);let t=Vl(Uc,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},Gc=Qs([]),Kc=(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&&qs(r[a],t)<0;)a++;a<r.length&&qs(r[a],t)===0||i.push(t)}return i.length===n.length?e:Qs(i)},qc=(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&&qs(r[a],t)<0;)a++;a<r.length&&qs(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Qs(i)},Jc=(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=qs(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=Qs(i);if(e.hash!==0&&e.hash!==_u){let t=e.hash,n=0;for(;n<a.length;n++){let e=Su(a[n]);if(e===_u)break;t=t+hu(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+Tu(a[e])|0;c.fingerprint=t}return c},Yc=e=>{let t=e.length<2?e:[...e].sort((e,t)=>qs(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&qs(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return ec(n,r)},Xc=e=>{let t=Yc(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:fs(t,e.map(e=>e[0]))},Zc=[],Qc=/* @__PURE__ */ new Map,$c=[],el=/* @__PURE__ */ new WeakMap,tl=e=>{let t=Zc[e]??Qc.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?Qc.set(e,new WeakRef(n)):Zc[e]=n,n},nl=e=>{if(Nl(e),e.low===1&&e.high>=1)return tl(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},rl=e=>e.length>0&&(e===Zc[e.length]||e===Qc.get(e.length)?.deref())||el.has(e),il=e=>{let t=G(e).elements;return rl(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},al=e=>{let t=$c[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return $c[e]=n,n},ol=e=>nc(ec(tl(e.length),e),`tuple`),sl=e=>nc(Yc(e),`record`),cl=(e,t)=>nc(ec(e,t),`record`),ll=e=>is(e)&&!Bs(e),ul=(e,t=!1)=>`UNION(${q(e.base,t)})`,dl=(t,n=e=>G(e).elements)=>{if(!ll(t.base))throw new e.x(`Attempted to enumerate the nonenumerable set:\n${ul(t)}`);return n(t.base)},fl=(t,n,r)=>{if(ll(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${W(q(t))}\nwhen enumerating:\n${W(ul(r))}`)},pl=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 pl(e.base);case`FunctionSet`:return pl(e.domain)&&pl(e.range)||ml(e.domain)===!0||ml(e)===!0;case`RecordSet`:return e.sets.every(pl)||ml(e)===!0;case`ProductSet`:return e.factors.every(pl)||ml(e)===!0;case`Union`:return pl(e.base)&&(cs(e.base)?Lc(e.base):Tl(e.base)).every(pl);case`SetOperation`:return e.operator===`\\cup`?pl(e.left)&&pl(e.right):e.operator===`\\cap`?pl(e.left)||pl(e.right):pl(e.left);default:return!1}},ml=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=ml(e.domain);return t===void 0?void 0:!t&&ml(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=ml(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return pl(e)?G(e).elements.length===0:void 0;default:return}},hl=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},gl=(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},_l=e=>{if(typeof e!=`object`||e.kind!==`Subset`||Bs(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=[]:gl(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return Qs(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)})},vl=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Qs(r.map(t=>e[t])));while(gl(r,e.length))}return t},yl=(t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){let o=t[a];if(Bs(o))throw new e.x(r(o,a));let s=n(o);if(s.length===0)return[[]];i.push(s)}return i},bl=(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 Nc(t.elements);case`Interval`:{let e=nl(t);return e!==Zc[e.length]&&el.set(e,t),e}case`Subset`:{if(Nl(t.base)===0)return vl([]);if(!is(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${W(q(t.base))}`);let n=G(t.base).elements;if(n.length>30)throw new e.x(Ml(t));return vl(n)}case`FunctionSet`:{if(!As&&Al(t))return[];if(Bs(t.domain))throw new e.x(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${W(q(t.domain))}\ncannot be enumerated.`);let r=il(t.domain);if((r.length>0||As)&&Bs(t.range))throw new e.x(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${W(q(t.range))}\ncannot be enumerated.`);let i=r.length===0?[]:n(t.range);return hl(r.map(()=>i)).map(e=>ec(r,e))}case`RecordSet`:{if(!As&&Al(t))return[];let e=yl(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${W(q(e))}`);return hl(e).map(e=>sl(t.names.map((t,n)=>[t,e[n]])))}case`ProductSet`:{if(!As&&Al(t))return[];let e=yl(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${W(q(e))}`);return hl(e).map(ol)}case`FilteredSet`:if(!is(t.base)||Bs(t.base))throw new e.x(`Attempted to enumerate { x \\in S : p(x) } when S:\n${W(q(t.base))}\nis not enumerable`);return G(Wc(Tl(t.base).filter(t.startPass?.(!0)??(e=>t.test(e,!1))))).elements;case`Union`:{let n=[];return dl(t).forEach((r,i)=>{let a=fl(r,i,t);if(ns(a))throw new e.P(es());Tl(a).forEach(e=>ts(n,e))}),G(Wc(n)).elements}case`SetOperation`:{if(t.operator===`\\cap`&&!ll(t.left)&&!ll(t.right))throw new e.x(`Attempted to enumerate S \\cap T when neither S:\n${W(q(t.left))}\nnor T:\n${W(q(t.right))}\nis enumerable`);if(t.operator===`\\`&&!ll(t.left))throw new e.x(`Attempted to enumerate S \\ T when S:\n${W(q(t.left))}\nis not enumerable.`);if(t.operator===`\\cup`)return G(Wc(Sl(t))).elements;let n=t.operator===`\\`||ll(t.left),r=n?t.left:t.right,i=n?t.right:t.left,a=[];return rs(typeof r==`object`&&r.kind===`Interval`?r:Tl(r),e=>{Ul(e,i)===(t.operator===`\\cap`)&&ts(a,e)}),G(Wc(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 Qs(bl(e));let t=typeof e==`object`&&Jo(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=Bl.sets;n?.push(e);let r=bl(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`)?Qs(r):Uc(r);return t&&(t.enumerated=i),i},xl=e=>{if(!(typeof e!=`object`||ac(e)))switch(e.kind){case`MixedSet`:G(e);return;case`FilteredSet`:return ll(e.base)||G(e),xl(e.base);case`Union`:if(!cs(e.base)&&ll(e.base))return xl(e.base);dl(e).slice(0,1).forEach(t=>xl(fl(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!ll(e.left)&&G(e),e.operator!==`\\cup`||ll(e.left)&&ll(e.right)||G(e),e.operator!==`\\cap`||ll(e.left)?xl(e.left):xl(e.right),e.operator===`\\cup`&&xl(e.right)}},Sl=t=>{if(!ll(t.left)||!ll(t.right))throw new e.x(`Attempted to enumerate S \\cup T when S:\n${W(q(t.left))}\nand T:\n${W(q(t.right))}\nare not both enumerable`);if(xl(t.left),xl(t.right),ns(t.left))throw new e.P(es());let n=Tl(t.left),r=ns(t.right)?void 0:Tl(t.right);if(!r||n.length+r.length>$o())throw new e.P(es());return[...n,...r]},Cl=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return G(e).elements;let t=Pc(e,()=>Sl(e)),n=G(Wc(t)).elements;return e.enumerated=Qs(n),n},wl=(e,t)=>{if(typeof e!=`object`||ac(e))return G(e).elements.some(t);let n=Bl.sets;n?.push(e),xl(e);let r=kl(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},Tl=e=>{let t=[];return wl(e,e=>(t.push(e),!1)),t},El=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,Dl=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(Dl);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(Dl)&&e.range.every(Dl);case`SetOperation`:return e.operator!==`\\cup`&&Dl(e.left)&&Dl(e.right);case`FilteredSet`:return Dl(e.base);case`ProductSet`:return e.factors.every(Dl);default:return!1}},Ol=e=>typeof e!=`object`||ac(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?Ol(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||Ol(e.left)||Ol(e.right):El(e)?.some(Ol)??!1,kl=(e,t)=>{if(e.kind===`Union`)return dl(e,Tl).some((n,r)=>wl(fl(n,r,e),t));if(e.kind===`FilteredSet`&&ll(e.base)){let n=e.startPass?.(!1);return n?wl(e.base,e=>n(e)&&t(e)):wl(e.base,n=>e.test(n,!1)&&t(n))}if(El(e)?.some(Ol))return bl(e,Tl).some(t);if(e.kind!==`SetOperation`)return G(e).elements.some(t);if(e.operator===`\\cup`)return!ll(e.left)||!ll(e.right)?G(e).elements.some(t):wl(e.left,t)||wl(e.right,t);let n=e.operator===`\\`||ll(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return ll(r)?wl(r,n=>Ul(n,i)===(e.operator===`\\cap`)&&t(n)):G(e).elements.some(t)},Al=t=>{if(typeof t!=`object`||!is(t))throw Bl.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(Al);case`RecordSet`:return t.sets.some(Al);case`FunctionSet`:return!Al(t.domain)&&Al(t.range);case`Union`:return dl(t).every((e,n)=>Al(fl(e,n,t)));default:return G(t).elements.length===0}},jl=(t,n,r)=>t.reduce((t,i)=>{let a=t*Nl(i,n);if(a>2147483647)throw new e.x(r());return a},1),Ml=e=>`Overflow when computing the number of elements in:\n${W(q(e))}`,Nl=(t,n)=>{if(typeof t!=`object`)throw new e.x(`Attempted to compute the number of elements in the ${ls(t)} ${W(q(t))}.`);switch(t.kind){case`ModelValue`:throw new e.x(`Attempted to compute the number of elements in the model value ${W(q(t))}.`);case`Function`:return t.domain.length;case`LazyFunction`:return Nl(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 ${W(q(t))}.`);case`Subset`:{let r=Nl(t.base,n);if(r>=31)throw new e.x(Ml(t));return 2**r}case`FunctionSet`:{if(n!==`1.7.4`){if(Al(t.domain))return 1;if(Al(t.range))return 0;if(Nl(t.range,n)===1)return 1}let r=Nl(t.domain,n),i=Nl(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(Ml(t));return a}case`RecordSet`:return n!==`1.7.4`&&Al(t)?0:jl(t.sets,n,()=>Ml(t));case`ProductSet`:return n!==`1.7.4`&&Al(t)?0:jl(t.factors,n,()=>`Overflow when computing the number of elements in ${W(q(t))}`);default:return lc(t),G(t).elements.length}},Pl=e=>`Attempted to check if the set ${W(q(e))}is finite.`,Fl=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)throw new e.x(`Attempted to check if the ${ls(t)} ${W(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${W(q(t))}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Fl(t.base)&&Al(t.base);case`Subset`:return Fl(t.base);case`FunctionSet`:{let e=Fl(t.domain);if(e&&Al(t.domain))return!0;let n=Fl(t.range);return n&&Al(t.range)?!0:n&&(e||Nl(t.range)===1)}case`RecordSet`:case`ProductSet`:{let e=t.kind===`RecordSet`?t.sets:t.factors,n=!0;for(let t of e)if(!Fl(t))n=!1;else if(Al(t))return!0;return n}case`Union`:if(!ll(t.base))throw new e.x(`Attempted to check if the nonenumerable set:\n${ul(t)}\nis a finite set.`);return G(t.base).elements.every(Fl);case`SetOperation`:if(t.operator===`\\cup`)return Fl(t.left)&&Fl(t.right);if(t.operator===`\\cap`){if(!Fl(t.left)&&!Fl(t.right))throw new e.x(Pl(t));return!0}if(Fl(t.left))return!0;if(!Fl(t.right))throw new e.x(Pl(t));return!1;case`FilteredSet`:if(!Fl(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${W(q(t.base))}\nis finite.`);return!0}},Il=(e,t,n=qs)=>{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},Ll=(t,n)=>{let r=t.elements;if(r.length>$o())throw new e.P(es());let i=Array.from({length:r.length},()=>!1),a=n.filter(e=>{let t=Il(r,e);return!i[t]&&(i[t]=!0,!0)}),o=Qs(r);return a.some((e,t)=>e!==r[t])&&(o.writtenElements=a),o},Rl=t=>{if(typeof t!=`object`||!os(t))return;if(t.kind===`LazyFunction`&&(!is(t.domain)||Bs(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},zl=(e,t)=>{let n=`Attempted to check if the value:\n${W(q(e))}\nis an element of the`;if(!os(t))return`${n} ${ls(t)} ${W(q(t))}`;let r=rc(t);return r===`record`?`Attempted to check if element:\n${W(q(e))}\nis in the record:\n${W(q(t))}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${W(q(t))}`},Bl={sets:void 0},Vl=(t,n,r,i)=>{let a=Bl.sets,o=Bl.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)}},Hl=e=>(Bl.sets??[]).slice(e).some(e=>typeof e==`object`&&Bl.callStack?.sources.has(e)===!0),Ul=(e,t)=>{let n=Bl.sets;if(n===void 0)return Jl(e,t);n.push(t);let r=Jl(e,t);return n.pop(),r},Wl=(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},Gl=(e,t)=>Il(t.elements,e)!==-1,Kl=(e,t)=>t.isNormalized?Fc(e,t.elements).isFound:Ic(e,Lc(t)),ql=(t,n)=>{if(t.type!==void 0)throw new e.x(`Attempted to check if the typed model value ${W(q(t))} is an element of\n${W(q(n))}`);return!1},Jl=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return Wl(e,t)??Yl(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return Yl(e,t)},Yl=(t,n)=>{if(!is(n))throw new e.x(zl(t,n));switch(n.kind){case`Set`:return lc(t),Vl(Gl,Kl,t,n);case`MixedSet`:return Ic(t,n.elements);case`Interval`:if(typeof t==`number`)return t>=n.low&&t<=n.high;if(n.low<=n.high&&(!ss(t)||t.type!==void 0))throw new e.x(`Attempted to check if the value:\n${W(q(t))}\nis in the integer interval ${W(q(n))}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(ss(t))return ql(t,n);if(!(n.name===`STRING`?typeof t==`string`:typeof t==`number`))throw new e.A(`Attempted to check if the value:\n${W(q(t))}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof t==`number`&&t>=0;case`Subset`:if(!is(t)||Bs(t))throw new e.x(`Attempted to check if the non-enumerable value\n${W(q(t))}\nis element of\n${W(q(n))}`);return G(t).elements.every(e=>Ul(e,n.base));case`FunctionSet`:{if(!os(t)){if(ss(t))return ql(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${W(q(n))}`)}vs(t);let r=K(t),i=_c(t,r.domain);return(i===void 0?Bc(n.domain,Qs(r.domain)):Bc({kind:`Interval`,low:i,high:i+r.domain.length-1},n.domain))&&r.range.every(e=>Ul(e,n.range))}case`RecordSet`:{vs(t);let r=os(t)?K(t):void 0;if(!r||!ys(r.domain)){if(ss(t))return ql(t,n);throw new e.x(`Attempted to check if non-record\n${q(t)}\nis in the set of records:\n${W(q(n))}`)}return r.domain.length===n.names.length&&n.names.every((e,t)=>{let i=Il(r.domain,e);return i!==-1&&Ul(r.range[i],n.sets[t])})}case`ProductSet`:{let r=os(t)?Rl(t):void 0;if(r===void 0){let r=os(t)&&K(t).domain.every(e=>typeof e==`number`);if(ss(t))return ql(t,n);if(r)return!1;throw new e.x(`Attempted to check if non-tuple\n${W(q(t))}\nis in the set of tuples:\n${W(q(n))}`)}return r.length===n.factors.length&&r.every((e,t)=>Ul(e,n.factors[t]))}case`FilteredSet`:try{return Ul(t,n.base)&&n.test(t,!0)}catch(r){throw!(r instanceof e.x)||!ko(r)?r:new e.x(`Cannot decide if element:\n${W(q(t))}\n is element of:\n${W(q(n.base))}\nand satisfies the predicate ${n.source?.predicate}`)}case`Union`:{if(!ll(n.base))throw new e.x(`Attempted to check if:\n ${W(q(t))}\nis an element of the non-enumerable set:\n ${W(ul(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=>Ul(t,e))}case`SetOperation`:return n.operator===`\\cup`?Ul(t,n.left)||Ul(t,n.right):Ul(t,n.left)&&Ul(t,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=Rl(t);if(r===void 0){if(ss(t))return ql(t,n);throw new e.A(`Attempted to check if the value:\n${W(q(t))}\nis an element of ${W(q(n))}.`)}return r.every(e=>Ul(e,n.base))}default:throw new e.x(zl(t,n))}},Xl=(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?Ul(e,n):e.range.every((e,r)=>Xl(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(pl(t.domain)||Nl(t.domain),!is(t.domain))throw new e.x(`The domains of formal parameters must be enumerable.`);let n=il(t.domain);return t.enumerated=ec(n,n.map(e=>t.apply(e))),t.enumerated}throw new e.x(`Expected a function but found ${q(t)}`)},Zl=(e,t,n)=>{let r=W(q(e)),i=W(q(t)),a=n===`1.7.4`;switch(rc(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.`}},Ql=(e,t)=>{if(!As)return Zl(e,t);let n=W(q(t));return rc(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},$l=(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},eu=t=>new e.x(`Attempted to apply function with integer domain to the non-integer argument ${W(q(t))}`),tu=(e,t)=>Il(e.domain,t),nu=(e,t,n)=>{let r=ps(e);throw As||r!==e.domain||r.length<32?r.forEach(e=>Mc(e,t)):Il(r,t,jc),n},ru=(t,n,r)=>{let i=t.domain;if(typeof n!=typeof i[0]){let a=rc(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&&!As&&typeof n!=`number`&&rl(i))throw eu(n)}let a=$l(i,n);return a===-1?Vl(tu,nu,t,n):a},iu=(e,t,n,r)=>`In applying the function\n${W(q(e))},\nthe ${t} is:\n${W(q(n))}\nwhich ${r}.\n`,au=(t,n)=>new e.x(iu(t,`argument list`,n,`does not match its formal parameter`)),ou=(t,n,r)=>{let i=t.domain,a=Rl(r);if(a===void 0)throw au(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 au(t,r);let s=a[o],c=`argument number ${o+1}`;if(!Ul(s,i.factors[o]))throw new e.x(iu(t,c,s,n===void 0?`is not in the function's domain ${q(i)}`:`is not in its domain`));if(n!==void 0&&Rl(s)?.length!==n)throw new e.x(iu(t,c,s,`does not match its formal parameter`))}),a.length>n.length)throw au(t,r)},su=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!Ul(t,e.lambdaDomain),cu=(t,n,r)=>{if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return cu(t.enumerated,n,r);let i=t.boundTupleLengths;if(i!==void 0)return ou(t,i,n),t.apply(n);if(!Ul(n,t.domain))throw new e.x(rc(t)===`lambda`?Zl(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??Zl;if(su(t,n))throw new e.x(i(t,n));let a=ru(t,n,i);if(a===-1)throw new e.x(i(t,n));return t.range[a]},lu=e=>rl(e)?el.get(e)??al(e.length):void 0,uu=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=lu(t.domain);if(n)return n;let r=Qs(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},du=(t,n,r,i=!1)=>{if(typeof t==`object`&&t.kind===`LazyFunction`&&(i||t.enumerated===void 0)){if(t.boundTupleLengths!==void 0&&Rl(n)===void 0)throw au(t,n);if(!Ul(n,t.domain))return t;let e=r(t.apply(n));return nc({kind:`LazyFunction`,domain:t.domain,apply:r=>Bc(n,r)?e:t.apply(r),source:t.source,boundTupleLengths:t.boundTupleLengths},rc(t))}if(!os(t))throw new e.x(`Attempted to apply EXCEPT construct to the value ${W(q(t))}.`);let a=K(t);if(su(a,n))return a;let o=ru(a,n,Ql);if(o===-1)return a;let s=[...a.range],c=a.range[o],l=r(c);s[o]=l;let u=nc(ec(a.domain,s),rc(a));if(u.writtenKeys=a.writtenKeys,u.lambdaDomain=a.lambdaDomain,a.hash!==0&&a.hash!==_u){let e=Su(l);if(e!==_u){let t=Su(a.domain[o]);u.hash=c===l?a.hash:a.hash-gu(t,Su(c))+gu(t,e)|0}}if(a.fingerprint!==0){let e=a.domain[o];u.fingerprint=c===l?a.fingerprint:a.fingerprint-Eu(e,c)+Eu(e,l)|0}return u},fu=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},pu=(e,t)=>Math.imul(e^t,16777619),mu=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return fu(t)},hu=e=>fu(e+2654435769|0),gu=(e,t)=>fu(Math.imul(e,668265261)+t|0),_u=795548749,vu=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Su(t[e]);if(r===_u)return _u;n=n+hu(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Su(e.domain[n]),i=Su(e.range[n]);if(r===_u||i===_u)return _u;t=t+gu(r,i)|0}return t},yu=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 ${W(q(t))}`);if(is(t)){G(t).elements.forEach(yu);return}let n=K(t);n.domain.forEach(yu),n.range.forEach(yu)},bu=t=>{if(typeof t==`object`&&t.kind!==`ModelValue`)try{Su(t)===_u&&yu(t);return}catch(t){if(!(t instanceof e.x))throw t;return t}},xu=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[]}},Su=e=>typeof e==`number`?fu(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?mu(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=vu(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?pl(e.domain)?Su(K(e)):_u:pl(e)?Su(G(e)):_u,Cu=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},wu=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Cu(t)},Tu=e=>Cu(Ou(e)+2135587861|0),Eu=(e,t)=>Cu(Math.imul(Ou(e),374761393)+Ou(t)|0),Du=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Tu(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Eu(e.domain[n],e.range[n])|0;return t},Ou=e=>typeof e==`number`?Cu(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?wu(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Du(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?Ou(K(e)):pl(e)?Ou(G(e)):wu(ku(e)),ku=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):Au(e),Au=t=>{if(t.kind===`ModelValue`)return`@${t.name}`;if(t.kind===`InfiniteSet`)return`<${t.name}>`;if(t.kind===`SequenceSet`)return`<Seq ${ku(t.base)}>`;if(t.kind===`FilteredSet`&&!pl(t))throw new e.x(`Attempted to compare the non-enumerable set ${q(t)} with another value`);if(is(t))return pl(t)?`{${G(t).elements.map(ku).join(`,`)}}`:`<${t.kind} ${q(t)}>`;let n=K(t);return`(${n.domain.map((e,t)=>`${ku(e)}:${ku(n.range[t])}`).join(`,`)})`},ju={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},Mu=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>ju[e])}"`,Nu=1999,Pu=e=>e.reduce((e,t)=>e===0?0:e*Nl(t),1),Fu=e=>{if(e.kind===`Subset`)return Nl(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=Al(e.domain)?0:Nl(e.domain);return(t===0?1:Nl(e.range)**t)<=Nu?G(e):void 0}return Pu(e.kind===`RecordSet`?e.sets:e.factors)<=Nu?G(e):void 0},Iu=(t,n)=>{if(n||t.kind===`Union`||t.kind===`Subset`&&os(t.base)&&(t.base.kind===`Function`||pl(t.base.domain)))return Fu(t);if(pl(t))try{return Fu(t)}catch(t){if(t instanceof e.x)return;throw t}},Lu=(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 ul(e,t)}},Ru=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),zu=t=>{if(pl(t.domain))try{return K(t)}catch(t){if(t instanceof e.x||e.tt(t))return;throw t}},Bu=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||rc(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 Mu(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=js.isExpanded?Iu(e,t):void 0;return n?r(n):Lu(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?js.isExpanded||!e.source?zu(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&&As&&rc(e)!==`tuple`)return`<< >>`;let a=r=>q(r,t,n&&rc(e)!==`lambda`);if(i.domain.length===0&&rc(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]]):hs(i);return rc(e)===`record`||i.domain.every(e=>typeof e==`string`&&Ru(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},Vu=(t,n)=>{if(t===void 0)return!1;try{return dc(t,n)}catch(t){if(t instanceof e.x)return!1;throw t}},Hu=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,Uu=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(Hu,(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`:(Wr(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},Wu=(t,n)=>{let r=n?void 0:Ns.get(t);if(r)return r();let i=Object.entries(t),a=Fs.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||!Vu(n[e[0]],e[1])).map(t=>{let n=Uu(s,[t[0],W(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(``)},Gu=[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 Ku=Gu[0];const qu=()=>Ku,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),ed=/* @__PURE__ */ new Int32Array(256),td=/* @__PURE__ */ new Int32Array(256);let nd=0,rd=0,id=0,ad=0;const od=e=>{let t=(e^ad)&255;ad=(ad>>>8|id<<24)^Qu[t],id=id>>>8^Ju[t]},sd=e=>{let t=Gu[e];Ku=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);Ju[e]=Number(BigInt.asIntN(32,t>>32n)),Qu[e]=Number(BigInt.asIntN(32,t))}let i=[Ju,Yu,Xu,Zu],a=[Qu,$u,ed,td];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)^Qu[o],i[e][r]=t[r]>>>8^Ju[o]}}nd=Number(BigInt.asIntN(32,t>>32n)),rd=Number(BigInt.asIntN(32,t))};sd(0);const cd=e=>{let t=ad^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;ad=id^td[n]^ed[r]^$u[i]^Qu[a],id=Zu[n]^Xu[r]^Yu[i]^Ju[a]},ld=e=>{if(typeof e==`boolean`)return od(0),od(e?116:102),2;if(typeof e==`number`)return od(1),cd(e),5;if(typeof e==`string`){od(3),cd(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)cd(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++)od(e.charCodeAt(n));return 5+e.length}return od(21),cd(Rs(e.name)+1),5},ud=e=>{let t=id,n=ad;id=0,ad=0;let r=[ld(e),id,ad];return id=t,ad=n,r},dd=e=>`m = (${e} ^ l) & 255; l = ((l >>> 8) | (h << 24)) ^ L0[m]; h = (h >>> 8) ^ H0[m];`,fd=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];`,pd={integer:e=>`${dd(`1`)} ${fd(e)}`,boolean:e=>`${dd(`0`)} ${dd(`(${e} ? 116 : 102)`)}`,set:e=>`${dd(`5`)} ${fd(e)}`,function:e=>`${dd(`9`)} ${fd(e)}`,scalar:(e,t,n)=>`{ let r = ${e}; for (; r >= 4; r -= 4) { ${fd(`0`)} } for (; r > 0; r--) { ${dd(`0`)} } h ^= ${t}; l ^= ${n}; }`},md=()=>({H0:Ju,H1:Yu,H2:Xu,H3:Zu,L0:Qu,L1:$u,L2:ed,L3:td,initialHigh:nd,initialLow:rd}),hd=(e,t)=>{let n=id,r=ad;ad=e[0],id=e[1],vd(t),e[0]=ad,e[1]=id,id=n,ad=r},gd=e=>{od(5),cd(e)},_d=e=>{od(9),cd(e)},vd=e=>{if(typeof e!=`object`||ss(e))ld(e);else if(os(e)){let t=K(e);_d(t.domain.length);for(let e=0;e<t.domain.length;e++)vd(t.domain[e]),vd(t.range[e])}else{let t=G(e).elements;gd(t.length);for(let e of t)vd(e)}},yd=e=>{let t=id,n=ad;id=nd,ad=rd;for(let t of e)vd(t);let r=BigInt(id>>>0)<<32n|BigInt(ad>>>0);return id=t,ad=n,r},bd=(e,t)=>{let n=new BigInt64Array(e),r=new Int32Array(n.buffer),i=id,a=ad;for(let n=0;n<e;n++)id=nd,ad=rd,t(n),r[2*n]=ad,r[2*n+1]=id;return id=i,ad=a,n},xd=(e,t)=>bd(e.length,n=>{for(let r of t)vd(e[n][r])}),Sd=/* @__PURE__ */ new WeakMap,Cd=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),wd=1024,Td=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*wd),relations:[]}),Ed=(e,t)=>({...e,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,coverage:t}),Dd=(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},Od=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,kd=e=>e.location.range??(e.kind===`Let`?e.body.location.range:void 0),Ad=(e,t,n,r,i)=>{let a=t===`next`?Od(e,t,r):void 0;if(a!==void 0)return a;let o=Dd(e,void 0,kd(r),-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},jd=(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,Md=(t,n,r)=>{let i=t===void 0?void 0:r.definitions.get(t),a=i?.kind===`Operator`?i.head:void 0,o=kd(n);return!i||!a?`Action ${o?e.X(o):`Unknown location`}`:jd(kd(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})`},Nd=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,Pd=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,Fd=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},Id=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[(Wr(t.name)&2147483647)%e.length].unshift(t));t=e}t[(Wr(e.name)&2147483647)%t.length].unshift(e)}),t.toReversed().flat()},Ld=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),Rd=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),zd=(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},Bd=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),Vd=(e,t,n)=>{let r=new Set(n.map(Nd)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(j(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&&!Cd.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=Dd(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(Nd(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`?Bd(t.bounds):t.params.map(e=>e.name);if(t.kind===`Function`){let r=e.scope!==void 0;l(Be(t,r),t.location.range,()=>{m(t.body,Rd(n,e.scope)),Ld(t.bounds).forEach(t=>m(t,e.scope))})}else m(t.body,Rd(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,Rd(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,Rd(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=zd(e.definitions,t);e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),Id(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,Pd(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,Fd(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,Pd(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,Rd(Bd(e.bounds),t)),r(Ld(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,Rd(Bd(e.bounds),t)),r(Ld(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,Rd(Bd([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,Rd(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,Rd(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=Sd.get(n);e&&t.unshift(e)}return zd(t,void 0)};e.relations.forEach(e=>{i.push(e.node),m(e.expression,h(e.scope)),i.pop()})},Hd=(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=Hd(e,r,n);if(t!==-1)return t}}return-1},Ud=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=Hd(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:Hd(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},Wd=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},Gd=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},Kd=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},qd=(e,t,n,r,i)=>{let a=as(n)?n:t!==`\\`&&as(r)?r:void 0;if(a===void 0||typeof i!=`object`)return i;let o=a===n?r:n;if(t===`\\cup`){if(Al(a)||!as(o))return i;let t=e.values.get(o);t!==void 0&&(e.secondary[t]+=Nl(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},Jd=(e,t,n)=>{let r=0;return{next:()=>(t!==void 0&&e.secondary[t]++,r++<n),reset:()=>{r=0}}},Yd=(e,t,n)=>{if(n.some(e=>Al(e)))return{next:()=>!1,reset:()=>void 0};let r=n.map(t=>Zd(e,t,Nl(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}}},Xd=(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 Yd(e,n,t.sets);if(t.kind===`FunctionSet`)return Yd(e,n,Array.from({length:Nl(t.domain)},()=>t.range))}},Zd=(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 Jd(e,void 0,n);let a=Xd(e,t);if(!a||i===void 0)return Jd(e,i,n);if(!r)return a;let o=0;for(;a.next();)o++;return e.secondary[i]+=o,Jd(e,i,o)},Qd=(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)},$d=/* @__PURE__ */ new Set([`Set`,`MixedSet`,`Interval`,`FunctionSet`,`RecordSet`,`ProductSet`]),ef=(e,t,n,r)=>{if(typeof t!=`object`||$d.has(t.kind))return;if(t.kind!==`Subset`){let r=Zd(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++)Qd(e,t,r[n])},tf=(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)?Zd(e,t,i,r):(n.forEach(n=>Qd(e,t,n)),Jd(e,void 0,i))},nf=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()}}),rf=(e,t,n)=>nf(t.map((t,r)=>tf(e,t,n[r],!0))),af=(e,t,n)=>{let r=n.map(e=>Nl(e)),i=nf(n.map((t,n)=>Zd(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},of=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},sf=(e,t)=>t.forEach((t,n)=>{let r=yd([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*wd+i;e.registers[o]=Math.max(e.registers[o],of(a)+1)}),cf=(e,t)=>{let n=e.registers.subarray(t*wd,(t+1)*wd),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*wd*wd/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*wd?a===0?i:wd*Math.log(wd/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},lf=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},uf=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>lf(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},df=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},ff=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],pf=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},mf=(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}},hf=(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||ff(t,e))&&df(n,r),pf(t,e).forEach(e=>a(e).forEach(e=>df(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=pf(t,e),l=[];r.forEach(e=>(i.get(e)??a(e)).forEach(e=>df(l,e)));let u={primary:t.primary[e],secondary:t.secondary[e]},d=ff(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,uf(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 pf(t,n).forEach(e=>{a(e),c(e,0)}),r},gf=[`init`,`next`,`invariant`,`constraint`,`implied`],_f=(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,vf=e=>gf.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>_f(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||_f(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),yf=(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:cf(t,i)}}),relations:vf(t).map(e=>({kind:e.kind,label:e.label,...mf(t,e),expressions:hf(t,e.node)}))}),bf=(e,t,n)=>{let r=Od(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]]]},xf=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),Sf=(t,n)=>xf.has(t)?new e.x(n):new e.A(n),Cf=(t,n,r,i)=>new e.A(`The ${t} argument of ${n} should be a ${r}, but instead it is:\n${W(q(i))}`),wf=(t,n,r=t)=>{if(!is(t)||Bs(t))throw new e.A(`Applying ${n} to the following value,\nwhich is not a finite set:\n${W(q(r))}`);return G(t)},Tf=e=>typeof e==`object`&&e.kind===`Operator`,J=(e,t,n)=>{let r=e[t];if(r===void 0||Tf(r))throw Sf(n,`${n} expects a value as argument ${t+1}`);return r},Ef=(e,t,n)=>{let r=J(e,t,n);if(typeof r!=`boolean`)throw Sf(n,`${n} expects a boolean but received ${q(r)}`);return r},Df=(e,t,n)=>{let r=e[t];if(r===void 0||!Tf(r))throw Sf(n,`${n} expects an operator as argument ${t+1}`);return r},Of=(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}),kf=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Af=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),jf=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(J(n,0,e),J(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Mf=e=>e>2147483647||e<-2147483648,Nf=t=>new e.A(`Overflow when computing ${t}`),Pf={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`},Ff={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},If={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`},Lf={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Rf=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Ff[e.operator];if(e.kind!==`Function`)return Pf[e.kind];let t=rc(e);return t===void 0?`FcnRcdValue`:Lf[t]},zf=e=>If[Rf(e)],Bf=(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}`),Vf=(t,n)=>{let r=r=>(...i)=>{let a=Bl.sets?.length??0;try{return r(...i)}catch(r){if(!(r instanceof e.x)||r instanceof e.y)throw r;let i=Hl(a);throw Bl.sets&&(Bl.sets.length=a),t.isLazy!==!0&&r instanceof e.A&&!i?r:Bf(n,r.message)}},i=r(t.evaluate);return{...t,evaluate:(e,r)=>{if(e.length!==t.arity)throw Bf(n,`array is not of length ${t.arity}`);return i(e,r)},evaluateUnary:t.evaluateUnary&&r(t.evaluateUnary),evaluateBinary:t.evaluateBinary&&r(t.evaluateBinary)}},Hf=(e,t)=>{if(typeof e!=`number`)throw Bf(t,`Cannot cast tlc2.value.impl.${Rf(e)} to tlc2.value.impl.IntValue`);return e},Uf=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Wf=(e,t,n,r)=>{let i=Uf(e,n,`IntValue`,2);return jf(t,(e,n)=>{let a=Hf(n,i),o=Hf(e,i),s=r(o,a);if(Mf(s))throw Nf(`${o}${t}${a}`);return s})},Gf=(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${W(q(t))}`);return t},Kf=(e,t,n=e)=>jf(e,(e,r)=>t(Gf(e,`first`,n),Gf(r,`second`,n))),qf=(e,t,n)=>({...Af(e,t,n),isLazy:!0}),Jf=(e,t,n)=>{let r=Df(e,t,n);return()=>r.call([])},Yf=/* @__PURE__ */ new WeakSet,Xf=/* @__PURE__ */ new WeakMap,Zf=(e,t)=>{if(t.length===0)return e;let n={...e};return Yf.has(e)&&Yf.add(n),Xf.set(n,[...t,...Xf.get(e)??[]]),n},Qf=(e,t,n=/* @__PURE__ */ new Set)=>{let r=ip(e,(e,r)=>Qf(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&j(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&j(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},$f=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),ep=/* @__PURE__ */ new WeakMap,tp=e=>ep.get(e)??e.name,np=(e,t)=>(tp(t)!==e.name&&ep.set(e,tp(t)),e),rp=(e,t)=>np(e.kind===`Function`?{...e,bounds:$f(e.bounds,e=>t(e,[])),body:t(e.body,Wi(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),ip=(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=>rp(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:$f(e.bounds,n),body:t(e.body,Wi(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,Ui(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,Ui(e.bound.pattern))};case`SetMap`:return{...e,bounds:$f(e.bounds,n),expression:t(e.expression,Wi(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)}}},ap=[],op=(e,t)=>{for(let n=0;n<e.length;n++)t(e[n],ap)},sp=(e,t)=>{for(let n=0;n<e.length;n++)t(e[n].set,ap)},cp=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return;case`Apply`:case`Bracket`:return op(e.args,t);case`Lambda`:return t(e.body,e.params);case`And`:case`Or`:return op(e.operands,t);case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`Selection`:return t(e.expression,ap);case`If`:return t(e.condition,ap),t(e.consequent,ap),t(e.alternative,ap);case`Case`:for(let n=0;n<e.arms.length;n++)t(e.arms[n].condition,ap),t(e.arms[n].body,ap);e.other&&t(e.other,ap);return;case`Let`:{let n=e.definitions.map(e=>e.name);return e.definitions.forEach(e=>{e.kind===`Function`?(sp(e.bounds,e=>t(e,n)),t(e.body,[...n,...Wi(e.bounds)])):t(e.body,[...n,...e.params.map(e=>e.name)])}),t(e.body,n)}case`Forall`:case`Exists`:case`FunctionConstruction`:return sp(e.bounds,t),t(e.body,Wi(e.bounds));case`UnboundedQuantifier`:return t(e.body,e.names);case`Choose`:return e.set&&t(e.set,ap),t(e.body,Ui(e.pattern));case`SetEnumeration`:case`Tuple`:return op(e.elements,t);case`SetFilter`:return t(e.bound.set,ap),t(e.predicate,Ui(e.bound.pattern));case`SetMap`:return sp(e.bounds,t),t(e.expression,Wi(e.bounds));case`FunctionSet`:return t(e.domain,ap),t(e.range,ap);case`Record`:case`RecordSet`:for(let n=0;n<e.fields.length;n++)t(e.fields[n].value,ap);return;case`Except`:t(e.function,ap);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`&&op(n.args,t)}t(r.value,ap)}return;case`FunctionApplication`:return t(e.function,ap),op(e.args,t);case`FieldAccess`:return t(e.record,ap);case`Product`:return op(e.factors,t);case`BoxAction`:case`AngleAction`:return t(e.action,ap),t(e.subscript,ap);case`WeakFairness`:case`StrongFairness`:return t(e.subscript,ap),t(e.action,ap);case`Label`:return t(e.body,ap);case`Subexpression`:e.selectors.forEach(e=>{`args`in e&&op(e.args,t)})}},lp=`LAMBDA`,up=e=>`${e}@SUBSTITUTION`,dp=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(dp),fp=(e,t)=>{if(e.kind!==`Identifier`)return!dp(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=j(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!dp(n.body)},pp=(e,t=/* @__PURE__ */ new Set)=>{let n=Ue(e),r=n===void 0||t.has(n)?[]:[n];return cp(e,(e,n)=>r.push(...pp(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},mp=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}},hp=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),gp=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},_p=(e,t)=>e.map(e=>({pattern:gp(e.pattern,t),set:e.set})),vp=(e,t)=>e.kind===`Function`?{...e,bounds:_p(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},yp=(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=>np({...vp(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:_p(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:gp(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:gp(e.bound.pattern,n),set:e.bound.set}};default:return e}},bp=e=>`${e}@ENABLED`,xp=(e,t)=>e.modes.get(t)??e,Sp=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!j(e)&&t.instantiation.variables.has(e.name),Cp=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Cp(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Sp(e,t,n))return[e.name];let r=j(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Cp(r.body,t,/* @__PURE__ */ new Map):void 0},wp=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Sp(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:bp(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Ap(e.expression,xp(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Ap(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Ap(e.subscript,xp(t,`Primed`),n),location:r},Ap(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Cp(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:bp(r),location:e.location},location:e.location},Ap({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Tp=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:fi}),Ep=(e,t)=>e.map(e=>Tp(e.name,t)),Dp=(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:Ep(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),Op=(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:[...Ep(t,r),...i.map(e=>Tp(e,r))],location:r},location:r}},kp=(e,t)=>e.instantiation.isParameterized(t)?Np(e,t):void 0,Ap=(t,n,r)=>{let i=e=>Ap(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)&&!j(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:Ap(t.expression,xp(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:Ap(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},xp(n,`Enabled`),r)};let c=wp(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||!fp(e,a)))return Zf(e,[t]);if(e&&r){let n=up(t.name);return r.set(n,e),Tp(n,t.location)}let i=kp(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&&ji(s)>0?Op(i,o,ji(s),t.location):{kind:`Apply`,operator:i,args:Ep(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||Yf.has(t),l=e=>(c&&Yf.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:lp,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:lp,args:r,resolution:fi},location:{line:t.location.line,column:t.location.column}};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=kp(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[...Ep(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 Zf(e,[t]);let r=kp(n,t.operator);if(r===void 0)return t;let i=a.getDefinition(t.operator);return o.length>0&&i?Op(r,o,ji(i),t.location):{...t,operator:r}}let l=mp(n),u=ip(t,(e,t)=>t.length===0?i(e):Ap(e,n,hp(r,t,l)));return yp(u,r,l)},jp=e=>e.isSelfReferential?{kind:`Let`,definitions:[e],body:Tp(e.name,e.location),location:{line:e.location.line,column:e.location.column}}:Be(e,!0),Mp=(e,t)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:jp(e),isLocal:e.isLocal,isRecursive:!1,location:e.location},Np=(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=mp(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o,selections:/* @__PURE__ */ new Map}:e,c=vp(rp(i,(e,t)=>Ap(e,s,hp(/* @__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&&Xf.set(l,[u,...Xf.get(i.body)??[]]),Mp({...c,body:l},r.params)}):t},Pp=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>pp(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=>kp(i,e)??e,getQualifiedKey:t=>{let n=kp(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Mp(r,e.params)):t}}},Fp=e=>e.kind===`Let`&&e.instances!==void 0||He(e).some(Fp),Ip=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=ip(e,e=>Ip(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>ki(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}},Lp=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Rp=(e,t)=>e.definitions.some(e=>Fp(e.body))||e.assumptions.some(e=>Fp(e.expression))||e.theorems.some(e=>{let t=Lp(e);return t!==void 0&&Fp(t)})?{...e,definitions:e.definitions.map(e=>rp(e,e=>Ip(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Ip(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Lp(e);return n===void 0?e:{...e,statement:Ip(n,t,[])}})}:e,zp=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}])),Bp={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]}},Vp=(e,t)=>{let n=Bp[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Hp={Constant:0,Variable:1,State:1,Action:2,Temporal:3},Up=(e,t)=>`${e}${t}`,Wp=(e,t,n)=>`${e}${t}${n}`,Gp=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Kp=(e,t,n)=>`${e},${t},${n}`,qp=(e=0)=>({level:e,isCorrect:!0,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Jp=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Yp=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Xp=(e,t)=>{t.constraints.forEach((t,n)=>Jp(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>Yp(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},X=(e,t,n,r)=>({...qp(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Zp=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Qp=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,$p=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]:[])}])),em=X(`'`,2,[1],[0]),tm=X(`UNCHANGED`,2,[1],[0]),nm=X(`ENABLED`,1,[2],[0]),rm=X(`[]`,3,[3],[0]),im=X(`<>`,3,[3],[0]),am=X(`$ConjList`,0,[3],[1]),om=X(`$DisjList`,0,[3],[1]),sm=X(`$IfThenElse`,0,[3],[1]),cm=X(`$Case`,0,[3],[1]),lm=X(`$BoundedForall`,0,[3],[1]),um=X(`$BoundedExists`,0,[3],[1]),dm=X(`$UnboundedForall`,0,[3],[1]),fm=X(`$UnboundedExists`,0,[3],[1]),pm=X(`$TemporalForall`,3,[3],[0]),mm=X(`$TemporalExists`,3,[3],[0]),hm=X(`$BoundedChoose`,0,[2],[1]),gm=X(`$UnboundedChoose`,0,[2],[1]),_m=X(`$SetEnumerate`,0,[2],[1]),vm=X(`$Tuple`,0,[2],[1]),ym=X(`$SetOfFcns`,0,[2],[1]),bm=X(`$CartesianProd`,0,[2],[1]),xm=X(`$SubsetOf`,0,[2],[1]),Sm=X(`$SetOfAll`,0,[2],[1]),Cm=X(`$FcnConstructor`,0,[3],[1]),wm=X(`$RcdConstructor`,0,[3],[1]),Tm=X(`$SetOfRcds`,0,[2],[1]),Em=X(`$Except`,0,[2],[1]),Dm=X(`$Pair`,0,[3],[1]),Om=X(`$Seq`,0,[2],[1]),km=X(`$FcnApply`,0,[2,2],[1,1]),Am=X(`$RcdSelect`,0,[2,0],[1,1]),jm=X(`$SquareAct`,2,[2,1],[0,0]),Mm=X(`$AngleAct`,2,[2,1],[0,0]),Nm=X(`$WF`,3,[1,2],[0,0]),Pm=X(`$SF`,3,[1,2],[0,0]),Fm=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity,level:0}])]),Im=e=>e.map(e=>({name:e,arity:0})),Lm=e=>e.kind===`Operator`?e.params:[],Rm=e=>e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,zm=(e,t)=>{let n=new Map(t);return e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n})),n},Bm=(e,t,n)=>{let r=Lm(e);return{...qp(),name:e.name,formals:r,maxLevels:r.map(()=>t),weights:r.map(()=>n),minMaxLevels:r.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}},Vm=(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)?Fm(n,Im(t)):t.kind===`Let`?zm(t,n):t.kind===`Function`?Fm(n,Im(Wi(t.bounds))):Fm(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 cp(e,d);if(a.push(e),o.push(void 0),c++,e.recursive)h(Hm(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},Hm=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)=>ki(e.location,t.location)?-1:1).map(e=>e.unit),Um=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Wm=e=>e.includes(2)&&e.includes(3),Gm=e=>Fr.get(e)??e.location.range,Km=e=>e.kind!==`Let`&&e.kind!==`Label`,qm=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:C(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=C(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=$p.get(e)??zp.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},s=(e,t,n)=>{let r=qp(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(Wp(e,n,t))}),Yp(r.argConstraints,Up(e,n),t.data.level),Xp(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>Zp(e,n)?[{operand:t,index:n}]:[]);o.filter(t=>e.isCorrect&&t.operand.data.isCorrect).forEach(t=>a.push(`Level error in applying operator ${M(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(Kp(t,n,r)),l=qp(Math.max(e.level,...t.filter((t,n)=>Qp(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)=>{Qp(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)=>Jp(l.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Jp(l.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Jp(l.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Jp(l.constraints,t,Zp(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=>Jp(l.constraints,e,Zp(r,a)))}))}),e.argParams.forEach(e=>{let t=Gp(e),n=s(t.operator);n?.kind===`Operator`&&Jp(l.constraints,t.param,Zp(n.data,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Yp(l.argConstraints,t,e))),t.forEach((n,r)=>{if(n.kind!==`Declared`)return;let i=n.declared;Array.from({length:i.arity},(t,n)=>Yp(l.argConstraints,Up(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{c(r,t,a)&&Yp(l.argConstraints,Up(i.name,a),e.data.level)}))}),e.argParams.forEach(e=>{let t=Gp(e),n=s(t.operator);n&&Yp(l.argConstraints,Up(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Gp(e).param)||l.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>l.argParams.add(e))),e.argParams.forEach(e=>{let t=Gp(e),n=s(t.operator);if(n)n.kind===`Declared`&&l.argParams.add(Wp(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(Wp(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(Wp(r.name,a,e)))}))}),l},l=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:S(`LAMBDA`,Im(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=qp();return e.params.add(n),{kind:`Declared`,data:e,declared:{name:n,arity:r.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:qp()}}return{kind:`Value`,data:y(e,t)}},u=(e,t)=>e.map(e=>l(e,t)),d=(t,n,r,i=[],o=Wi(i))=>{let s=u(n,Fm(r,Im(o))),l=i.map(e=>y(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):Ui(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)=>{Wm(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`),Um.has(e.operator)&&p(t.map(e=>e.data.level),M(e.operator))},h=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;t===2&&Km(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=zm(e,t);e.recursive&&Vm(t,e).forEach(e=>ne(e.members));let r=e.definitions.map(e=>C(e,n)),i=y(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=>Xp(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())},y=(e,t)=>{let n=a.length;return _(n,e.location.range,b(e,t))},b=(t,n)=>{switch(t.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return qp();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?am:om,e)}let a=r?`\\land`:`\\lor`,o=Gm(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=Gm(r);c===t.operands.length-1||!o||!h?p(m,a):Wm(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?am:om,s);return f?{...m,isCorrect:!1}:m}case`Prime`:return d(em,[t.expression],n);case`Unchanged`:return d(tm,[t.expression],n);case`Enabled`:return d(nm,[t.expression],n);case`Always`:case`Eventually`:{let e=l(t.expression,n);return h(t,e.data.level),c(t.kind===`Always`?rm:im,[e])}case`If`:return d(sm,[t.condition,t.consequent,t.alternative],n);case`Case`:return d(cm,[...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`?lm:um,[t.body],n,t.bounds),a=r.level===3?t.bounds.find(e=>y(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`?pm:mm:t.quantifier===`Forall`?dm:fm,[t.body],n,[],t.names);case`Choose`:return d(t.set?hm:gm,[t.body],n,t.set?[{pattern:t.pattern,set:t.set}]:[],Ui(t.pattern));case`SetEnumeration`:return d(_m,t.elements,n);case`Tuple`:return d(vm,t.elements,n);case`FunctionSet`:return d(ym,[t.domain,t.range],n);case`Product`:return d(bm,t.factors,n);case`SetFilter`:return d(xm,[t.predicate],n,[t.bound]);case`SetMap`:return d(Sm,[t.expression],n,t.bounds);case`FunctionConstruction`:return d(Cm,[t.body],n,t.bounds);case`Record`:return d(wm,t.fields.map(e=>e.value),n);case`RecordSet`:return d(Tm,t.fields.map(e=>e.value),n);case`Except`:return c(Em,[l(t.function,n),...t.updates.map(e=>({kind:`Value`,data:c(Dm,[{kind:`Value`,data:v(e.range,()=>c(Om,e.path.map(e=>e.kind===`Field`?{kind:`Value`,data:qp()}:e.args.length===1?l(e.args[0],n):{kind:`Value`,data:v(e.tupleRange,()=>d(vm,e.args,n))})))},l(e.value,n)])}))]);case`FunctionApplication`:return c(km,[l(t.function,n),t.args.length===1?l(t.args[0],n):{kind:`Value`,data:d(vm,t.args,n)}]);case`Bracket`:return qp();case`FieldAccess`:return c(Am,[l(t.record,n),{kind:`Value`,data:qp()}]);case`BoxAction`:case`AngleAction`:return d(t.kind===`BoxAction`?jm:Mm,[t.action,t.subscript],n);case`WeakFairness`:case`StrongFairness`:return d(t.kind===`WeakFairness`?Nm:Pm,[t.subscript,t.action],n);case`Label`:return y(t.body,n);case`Selection`:{let e=t.expression,i=r.get(e);if(i)return i;let a=y(e,n);return r.set(e,a),a}case`Subexpression`:return qp()}},x=(e,t,n=!1,r=/* @__PURE__ */ new Set)=>{let i=(e,i=n,a=t)=>x(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 He(e).forEach(e=>i(e,!0)),r;case`UnboundedQuantifier`:return i(e.body,n||e.isTemporal===!0,Fm(t,Im(e.names))),r;default:return cp(e,(e,r)=>i(e,n,Fm(t,Im(r)))),r}},S=(e,t,n,r)=>{let i=Fm(r,t),a=y(n,i),o=e=>t.some(t=>t.name===e),s=x(n.kind===`Selection`?n.expression:n,i),c={...qp(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(Up(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(Wp(e.name,n,t.name))).map(e=>Kp(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(Gp(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Gp(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},ee=/* @__PURE__ */ new Set,C=(e,t)=>{let r=n.get(e);if(r&&!ee.delete(e))return r;let i=r??Bm(e,3,0);n.set(e,i);let a=S(e.name,Lm(e),Rm(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},te=t=>t.forEach(t=>{let n=t.definition.location.range;t.definition.isRecursive&&n&&C(t.definition,t.scope).maxLevels.forEach((r,a)=>{r>=2||i.push({location:e.X(n),message:`Argument ${a+1} of recursive operator ${M(t.definition.name)} is primed`})})}),ne=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,Bm(e.definition,2,1)));let r=e=>(e.definition.isRecursive&&ee.add(e.definition),C(e.definition,e.scope));e.forEach(e=>{r(e),te([e])});let i=t.map(e=>C(e.definition,e.scope)),a=Math.max(0,...i.map(e=>e.level)),o=i.flatMap(e=>[...e.params]);e.forEach(e=>{let t=C(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&&ee.add(e.definition)}),e.forEach(r)};return{analyze:y,analyzeDefinition:C,checkPrimedArguments:te,checkRecursiveSection:ne,toOperand:l,errors:i}},Jm=(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:Hp[t.level]}),n?[n]:[]}return[t.kind===`AssumeProve`?Jm(t,i,r):r.analyze(t,i)]});a.push(r.analyze(t.conclusion,i));let o=qp(Math.max(...a.map(e=>e.level)));return a.forEach(e=>{e.params.forEach(e=>o.params.add(e)),Xp(o,e)}),o},Ym=(t,n,r,i)=>{let a=qm(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`?Jm(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`?Jm(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=Vm(/* @__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=>uo(e,i))}},Xm=1024,Zm=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),Qm=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),$m=/* @__PURE__ */ new Set([...Zm,...Qm,`Enabled`]),eh=/* @__PURE__ */ new Set([`~>`,`-+->`]),th=/* @__PURE__ */ new Set([...eh,`\\cdot`]),nh=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),rh=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),ih=/* @__PURE__ */ new Set([`RandomSubset`,`RandomSetOfSubsets`,`TestRandomSetOfSubsets`,`RandomSubsetSet`]),ah=(e,t)=>nh.has(e)||t.builtins.get(e)?.isStateLevel===!0,oh=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(Zm.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(Qm.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&eh.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;($m.has(l)||l===`UnboundedQuantifier`&&e.isTemporal===!0||l===`Apply`&&th.has(e.operator))&&(r[0]|=u),$m.has(l)&&(r[0]|=16);let d=a(e);n&&d!==void 0&&(r[0]|=d);let f=n&&d===void 0,p=Ue(e);if(p!==void 0&&j(e)&&t.variableIndex.has(p)&&(c||(r[0]|=512),f&&(r[0]|=32)),p!==void 0&&!j(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{ah(e,t)&&(r[0]|=2|(e===`Assert`?0:4)),rh.has(e)&&(r[0]|=8),ih.has(e)&&(r[0]|=256),e===`TLCEval`&&(r[0]|=Xm),!a&&ah(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)}}He(e).forEach(e=>s(e,f,c||l===`Lambda`))};return e.forEach(e=>s(e,!0,!1)),{row:r,edges:i}},sh=(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},ch=1294,lh=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&513),uh=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=oh(Ve(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&ch,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=sh(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=sh(i,r,u,224),f=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&!e.isOperatorArgument).map(s))),p=sh(i,r,f,512),m=o.map(e=>new Int32Array(e.map(s).filter(e=>!lh(t[e],l[e*r]|p[e*r])))),h=sh(a,r,m,ch);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|p[t]&512|d[t]&224|h[t]&ch:e),words:r}},dh=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?fh(Ve(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},fh=(e,t)=>{let n=t.facts.words,r=oh(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=dh(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]}lh(e.callee,r[0])||(i[0]|=r[0]&ch)}),i},ph=(e,t)=>!(dh(e,t)[0]&513),mh=(e,t)=>!(dh(e,t)[0]&512),hh={any:2,repeated:4,streamed:8,replayed:260,varying:258},gh=(e,t,n)=>(fh(e,t)[0]&hh[n])!==0,_h=(e,t,n=`any`)=>(dh(e,t)[0]&hh[n])!==0,vh=(e,t)=>!!(fh([e],t)[0]&Xm),yh=(e,t)=>{let n=dh(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},bh=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},xh=(e,t)=>{let n=fh([e],t);return n[0]&16?void 0:bh(n)},Sh=(e,t)=>!!(fh([e],t)[0]&1),Ch=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),wh=()=>({implication:Bb,negate:Vb,equivalent:Hb,body:Ub,condition:(e,t)=>{if(typeof e!=`boolean`)throw Cb(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw wb(t,n,e);return e},apply:cu,expectFunction:Ib,tuple:ol,set:Wc,record:cl,writtenRecord:gs,equal:dc,enumerate:Xb,choiceElements:OS,noChoice:e=>{throw kS(e)},filterPredicate:DS,isReducible:as,finiteElements:e=>G(e).elements,addBounded:ts,normalizedSet:$s,isBeyondBound:ns,cardinality:Nl,functionDomain:il,sortedFunction:ec,unassigned:(e,t)=>{throw jb(e,t)},prime:qx,keepLazyContext:Lb,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>Pb(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let Th,Eh;const Dh=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Oh=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),kh=e=>`local${e.counter++}`,Ah=(e,t=/* @__PURE__ */ new Set)=>{let n=Ue(e);return n!==void 0&&t.add(n),e.kind!==`Selection`&&He(e).forEach(e=>Ah(e,t)),t},jh=(e,t,n)=>{if(n.locals.size===0)return n.context;let r=vh(t,e.environment),i=Ah(t),a=[...n.locals].filter(e=>r||i.has(e[0]));if(a.length===0)return n.context;let o=Oh(e,a.map(e=>e[0]));return`extend(${n.context}, ${o}, [${a.map(e=>e[1]).join(`, `)}])`},Mh=(e,t,n)=>`${Oh(e,nS(t,e.environment))}(${jh(e,t,n)})`,Nh=(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})`},Ph=(e,t,n,r)=>{let i=kh(e),a=kh(e),o=kh(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} }`},Fh=(e,t,n)=>{let r=t.kind===`Forall`;return Nh(e,n,n=>{let i=t.bounds.map(()=>kh(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(${Hh(e,r.set,n)}, ${Oh(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=kh(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${Hh(e,t.body,n)}, ${Oh(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>Ph(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},Ih=(e,t,n,r,i)=>Nh(e,i,i=>{let a=kh(e),o=kh(e),s=Oh(e,t),c=`choiceElements(${Hh(e,n,i)}, ${s}, ${Oh(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${Hh(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${Ph(e,a,o,l)} return noChoice(${s});`}),Lh=(e,t,n,r)=>Nh(e,r,r=>{let i=kh(e),a=kh(e),o=kh(e),s=kh(e),c=Oh(e,t),l=`if (!isReducible(${i})) return ${Oh(e,wS(t,e.environment))}(${i}, ${jh(e,t,r)});`,u=Hh(e,t.bound.set,r);r.locals.set(n,s);let d=ES(t,e.environment)?` else break;`:``,f=`if (filterPredicate(${Hh(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});${d}`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${Ph(e,a,s,f)} return normalizedSet(${o});`}),Rh=(e,t,n,r)=>Nh(e,r,r=>{let i=kh(e),a=kh(e),o=kh(e),s=kh(e),c=kh(e),l=kh(e),u=Oh(e,xS(t,e.environment)),d=jh(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=Hh(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${Hh(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} = []; ${Ph(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),zh=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=Hh(e,r[0],n),a=Hh(e,r[1],n),o=Oh(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${Hh(e,r[0],n)}, ${Oh(e,t)})`;if(t.operator===`<=>`)return`equivalent(${Hh(e,r[0],n)}, ${Hh(e,r[1],n)}, ${Oh(e,t)})`;if(j(t))return Mh(e,t,n);let i=wx(t.operator,e.environment);if(i?.kind!==`Builtin`)return Mh(e,t,n);if(i.name===`DOMAIN`)return`${Oh(e,Db(t))}(${Hh(e,r[0],n)})`;if(i.name===`\\subseteq`&&i.evaluateBinary&&r.length===2)return`${Oh(e,Ob(t,i.evaluateBinary))}(${Hh(e,r[0],n)}, ${Hh(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&aS(r[0],a))return`${Oh(e,i.evaluateUnary)}(${Hh(e,r[0],n)})`;let o=r.length===2&&aS(r[0],a)&&aS(r[1],a);return i.evaluateBinary&&o?`${Oh(e,i.evaluateBinary)}(${Hh(e,r[0],n)}, ${Hh(e,r[1],n)})`:Mh(e,t,n)},Bh=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(j(e))return!1;let r=Fx(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Bh(e.expression,t,n);case`FieldAccess`:return Bh(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Bh(e,t,n));default:return!1}},Vh=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Vh(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Vh);default:return!1}},Hh=(e,t,n)=>{let r=(t,r=n)=>Hh(e,t,r);switch(t.kind){case`Number`:return us(t.value)?String(t.value):Mh(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(j(t))return Mh(e,t,n);let i=Fx(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Oh(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Oh(e,i.value):Mh(e,t,n)}case`Apply`:return zh(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=Oh(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)}, ${Oh(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{gS(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Bh(t.function,n,e.environment)?r(t.function):Vh(t.function)?r(t.function,i):Mh(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Oh(e,t)}))`,o=Eb(e.environment.runtime.version),s=o?`, ${Oh(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`${Oh(e,Tb(t))}(${r(t.record)})`;case`Record`:{let i=jS(t.fields);if(MS(i))return Mh(e,t,n);let a=Oh(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}, ${Oh(e,i.map(e=>t.fields.indexOf(e)))}, ${o}, ${Oh(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?Mh(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`)?Fh(e,t,n):Mh(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?Ih(e,t,t.set,t.pattern.name,n):Mh(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!bS(t)?Rh(e,t,r.pattern.name,n):Mh(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?Lh(e,t,t.bound.pattern.name,n):Mh(e,t,n);default:return Mh(e,t,n)}},Uh=(e,t)=>{if(!Ch.has(e.kind)||(Eh??=Dh(),!Eh))return;let n={environment:t,references:[],helpers:[],counter:0},r=Hh(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 Th??=wh(),Function(...Object.keys(Th),...i,a)(...Object.values(Th),...n.references)},Wh=(t,n,r)=>new e.A(`Applying ${t} to the following value,\nwhich is not ${n}:\n${W(q(r))}`),Gh=e=>os(e)?K(e):void 0,Kh=`a function with a finite domain`,qh=(e,t,n)=>{let r=J(e,t,n),i=Gh(r);if(!i)throw Wh(n,Kh,r);return i},Jh=(e,t)=>{let n=J(e,1,t),r=Gh(n),i=r&&Qh(r,J(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw Cf(`second`,t,`bag`,n);return i},Yh=(e,t,n)=>{let r=t[n];if(!r||!Zh(r))throw Cf(n===0?`first`:`second`,`(+)`,`bag`,J(e,n,`(+)`));return r},Xh=(e,t)=>{if(!is(e)||!pl(e))throw t();return G(e).elements},Zh=e=>e.range.every(e=>typeof e==`number`&&e>0),Qh=(e,t)=>{let n=e.domain.findIndex(e=>Bc(t,e));return n===-1?void 0:e.range[n]},$h=(e,t)=>{if(typeof e==`number`)return e;throw t()},eg=(e,t,n)=>{let r=$h(e,n)+$h(t,n);if(Mf(r))throw Nf(`${e}+${t}`);return r},tg=(e,t,n,r,i)=>{let a=$h(e.range[t],r),o=Qh(n,e.domain[t]);if(o===void 0)return a;let s=a-$h(o,i);if(Mf(s))throw Nf(`${a}-${o}`);return s},ng=(e,t,n,r,i=e.length)=>{let a=e.slice(0,i).find(e=>Bc(t,e[0]));a?a[1]=eg(a[1],n,r):e.push([t,n])},rg=e=>e.domain.map((t,n)=>[t,e.range[n]]),ig=ec([],[]),ag=t=>[Of(`EmptyBag`,ig),Y(`IsABag`,1,e=>{let t=Gh(J(e,0,`IsABag`));return t!==void 0&&Zh(t)}),Y(`BagCardinality`,1,e=>{let t=J(e,0,`BagCardinality`),n=qh(e,0,`BagCardinality`),r=()=>Wh(`BagCardinality`,`a bag`,t);return n.range.reduce((e,t)=>{if(typeof t!=`number`||t<=0)throw r();return eg(e,t,r)},0)}),Y(`BagIn`,2,e=>{let t=Jh(e,`BagIn`);return t!==void 0&&t>0}),Y(`CopiesIn`,2,e=>Jh(e,`CopiesIn`)??0),Y(`\\oplus`,2,e=>{let t=[0,1].map(t=>Gh(J(e,t,`(+)`))),n=Yh(e,t,0),r=Yh(e,t,1),i=rg(n),a=()=>Cf(`second`,`(+)`,`bag`,J(e,1,`(+)`));return r.domain.forEach((e,t)=>ng(i,e,r.range[t],a,n.domain.length)),Yc(i)}),Y(`\\ominus`,2,e=>{let t=J(e,0,`(-)`),n=J(e,1,`(-)`),r=Gh(t),i=Gh(n);if(!r)throw Cf(`first`,`(-)`,`bag`,t);if(!i)throw Cf(`second`,`(-)`,`bag`,n);let a=()=>Cf(`first`,`(-)`,`bag`,t),o=()=>Cf(`second`,`(-)`,`bag`,n);return Yc(r.domain.flatMap((e,t)=>{let n=tg(r,t,i,a,o);return n>0?[[e,n]]:[]}))}),Y(`BagUnion`,1,t=>{let n=J(t,0,`BagUnion`),r=Xh(n,()=>Wh(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??ig;let i=()=>new e.A(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${W(q(n))}`),a=e=>{let t=Gh(e);if(!t)throw i();return t},o=rg(a(r[0]));return r.slice(1).forEach(e=>{let t=a(e);t.domain.forEach((e,n)=>ng(o,e,t.range[n],i))}),Yc(o)}),Y(`\\sqsubseteq`,2,e=>{let t=J(e,0,`\\sqsubseteq`),n=J(e,1,`\\sqsubseteq`),r=Gh(t),i=Gh(n);if(!r)throw Wh(`\\sqsubseteq`,Kh,t);if(!i)throw Wh(`\\sqsubseteq`,Kh,n);let a=()=>Wh(`\\sqsubseteq`,`a bag`,t),o=()=>Wh(`\\sqsubseteq`,`a bag`,n);return r.domain.every((e,t)=>{let n=Qh(i,e);return $h(r.range[t],a)<=(n===void 0?0:$h(n,o))})}),kf(`BagOfAll`,2,e=>{let t=Df(e,0,`BagOfAll`),n=J(e,1,`BagOfAll`),r=Gh(n);if(!r)throw Cf(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[],a=()=>Cf(`second`,`BagOfAll`,`bag`,n);return r.domain.forEach((e,n)=>ng(i,t.call([e]),r.range[n],a)),Yc(i)}),Y(`SubBag`,1,n=>{let r=J(n,0,`SubBag`);if(!os(r))throw new e.x(`Attempted to apply the operator DOMAIN to a non-function\n(${zf(r)})\nline 106, col 58 to line 106, col 65 of module Bags`);let i=K(r),a=G(Wc(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 Uc(i.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:s[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>ec(e.map(e=>e[0]),e.map(e=>e[1]))))}),Y(`BagToSet`,1,e=>uu(qh(e,0,`BagToSet`))),Y(`SetToBag`,1,e=>{let t=J(e,0,`SetToBag`),n=Xh(t,()=>Wh(`BagToSet`,Kh,t));return ec([...n],n.map(()=>1))})],og={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},sg={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},cg=[{lower:`true`,upper:`TRUE`,token:Z.true},{lower:`false`,upper:`FALSE`,token:Z.false},{lower:`null`,upper:`NULL`,token:Z.null}],lg=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
|
|
405
|
+
`],[`r`,`\r`],[`f`,`\f`]]),ug=1024,dg=t=>{let n=+!!t.startsWith(``),r=n,i=0,a=n,o=!0,s=Z.none,c=0,l=[og.emptyDocument],u=[void 0],d=[0],f=()=>`$${l.map((e,t)=>e===og.emptyArray||e===og.nonemptyArray?`[${d[t]}]`:e===og.emptyDocument||e===og.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}},y=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},b=()=>{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(y(`*/`))r+=2;else throw m(`Unterminated comment`)}else if(e===`#`)g(),v();else if(e!==` `&&e!==`\r`&&e!==` `)return e}},x=()=>{let e=b();if(e===void 0)throw h();return e},S=()=>{let e=cg.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)},ee=()=>{let e=sg.none,n=!1,i=0;for(;r+i<t.length;i++){if(i===ug)return Z.none;let a=t[r+i];if(a===`-`){if(e===sg.none)e=sg.sign;else if(e===sg.exponentE)e=sg.exponentSign;else return Z.none}else if(a===`+`){if(e!==sg.exponentE)return Z.none;e=sg.exponentSign}else if(a===`e`||a===`E`){if(e!==sg.digit&&e!==sg.fractionDigit)return Z.none;e=sg.exponentE}else if(a===`.`){if(e!==sg.digit)return Z.none;e=sg.decimal}else if(a<`0`||a>`9`){if(_(a))return Z.none;break}else if(e===sg.sign||e===sg.none)n=a===`0`,e=sg.digit;else if(e===sg.digit){if(n)return Z.none}else e===sg.decimal?e=sg.fractionDigit:(e===sg.exponentE||e===sg.exponentSign)&&(e=sg.exponentDigit)}return i===ug||e!==sg.digit&&e!==sg.fractionDigit&&e!==sg.exponentDigit?Z.none:(c=i,Z.number)},C=()=>{let e=l.length-1,n=l[e];if(n===og.emptyArray)l[e]=og.nonemptyArray;else if(n===og.nonemptyArray){let e=x();if(e===`]`)return Z.endArray;if(e===`;`)g();else if(e!==`,`)throw m(`Unterminated array`)}else if(n===og.emptyObject||n===og.nonemptyObject){if(l[e]=og.danglingName,n===og.nonemptyObject){let e=x();if(e===`}`)return Z.endObject;if(e===`;`)g();else if(e!==`,`)throw m(`Unterminated object`)}let t=x();if(t===`"`)return Z.doubleQuotedName;if(t===`'`)return g(),Z.singleQuotedName;if(t===`}`){if(n!==og.nonemptyObject)return Z.endObject;throw m(`Expected name`)}if(g(),r--,_(t))return Z.unquotedName;throw m(`Expected name`)}else if(n===og.danglingName){l[e]=og.nonemptyObject;let n=x();if(n===`=`)g(),t[r]===`>`&&r++;else if(n!==`:`)throw m(`Expected ':'`)}else if(n===og.emptyDocument){if(b()===void 0)return Z.eof;r--,t.startsWith(`)]}'
|
|
411
|
+
`,r)&&(r+=5),l[e]=og.nonemptyDocument}else if(n===og.nonemptyDocument){if(b()===void 0)return Z.eof;g(),r--}let i=b();if(i===void 0){if(n===og.emptyDocument)return Z.eof;throw h()}if(i===`]`&&n===og.emptyArray)return Z.endArray;if(i===`]`||i===`;`||i===`,`){if(n!==og.emptyArray&&n!==og.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=S();if(a!==Z.none)return a;let o=ee();if(o!==Z.none)return o;if(!_(t[r]))throw m(`Expected value`);return g(),Z.unquoted},te=()=>(s===Z.none&&(s=C()),s),ne=()=>{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=lg.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`)},re=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)+ne(),o=r):s===`
|
|
413
|
+
`&&(i++,a=r)}throw m(`Unterminated string`)},ie=()=>{let e=r;for(;r<t.length&&_(t[r]);)r++;return t.slice(e,r)},w=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},ae=()=>{l.pop(),u.pop(),d.pop(),d[l.length-1]++,s=Z.none},T=()=>{let e=te();return e!==Z.endObject&&e!==Z.endArray&&e!==Z.eof},oe=()=>{let e=te(),t=e===Z.unquotedName?ie():re(e===Z.singleQuotedName?`'`:`"`);return s=Z.none,u[l.length-1]=t,t},se=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?ie():re(e===Z.singleQuoted?`'`:`"`),ce=()=>{let e=te();if(e===Z.beginArray){w(og.emptyArray);let e=[];for(;T();)e.push(ce());return ae(),e}if(e===Z.beginObject){w(og.emptyObject);let e=/* @__PURE__ */ new Map;for(;T();)e.set(oe(),ce());return ae(),e}let t=se(e);return s=Z.none,d[l.length-1]++,t};if(te()===Z.eof)return null;let le=ce();return o=!1,le!==null&&te(),le},fg=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),pg=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),mg=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),hg=e=>{if(!os(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?sl(n):void 0},gg=(t,n)=>{let r=`tlc2.value.impl.${Rf(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')`)},_g=t=>new e.x(`Cannot convert value: unsupported value type tlc2.value.impl.${Rf(t)}`),vg=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),yg=e=>`[${e.map(Cg).join(`,`)}]`,bg=e=>`{${hs(e).map(e=>`${vg(typeof e[0]==`string`?e[0]:q(e[0]))}:${Cg(e[1])}`).join(`,`)}}`,xg=e=>{let t=K(e),n=Rl(t);return n?yg(n):bg(t)},Sg=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,Cg=e=>typeof e==`string`?vg(e):typeof e==`object`?e.kind===`ModelValue`?vg(e.name):Rf(e)===`RecordValue`?bg(K(e)):wg(e):String(e),wg=e=>{let t=Rf(e);if(t===`TupleValue`)return yg(K(e).range);if(Sg(t))return xg(e);if(ll(e))return yg(G(e).elements);throw _g(e)},Tg=e=>e.map(e=>`${Cg(e)}\n`).join(``),Eg=e=>{let t=Rf(e);if(t===`RecordValue`)return bg(K(e));if(t===`TupleValue`)return`{${K(e).range.map((e,t)=>`"${t}":${Cg(e)}`).join(`,`)}}`;if(Sg(t))return xg(e);throw _g(e)},Dg=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 Ls(t);if(Array.isArray(t))return ol(t.map(Dg));if(t instanceof Map)return sl([...t].map(e=>[Ls(e[0]),Dg(e[1])]));let n=Number(t.literal);if(!/^-?\d+$/.test(t.literal)||Mf(n))throw new e.x(`Cannot convert value: expected a 32-bit integer JSON number, but found ${t.literal}`);return n||0},Og=t=>{if(typeof t!=`string`)throw new e.x(`Cannot cast tlc2.value.impl.${Rf(t)} to tlc2.value.impl.StringValue`);return t},kg=(e,t)=>{let n=cu(e,t);if(typeof n!=`string`)throw gg(n,`StringValue`);return n},Ag=t=>{if(!pg.has(t.toLowerCase()))throw mg.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}`)},jg=(t,n,r,i)=>{let a=r.find(e=>!fg.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))},Mg=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},Ng=(t,n)=>{let r=t.readFile?.(n);if(r===void 0)throw new e.x(`${n} (No such file or directory)`);return r},Pg=e=>[Vf(Af(`ToJson`,1,e=>Ls(Cg(J(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),Vf(Af(`ToJsonArray`,1,e=>Ls(wg(J(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),Vf(Af(`ToJsonObject`,1,e=>Ls(Eg(J(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),Vf(Af(`JsonSerialize`,2,t=>{let n=Og(J(t,0,`JsonSerialize`)),r=J(t,1,`JsonSerialize`);if(!Rl(r)&&!hg(r))throw Cf(`second`,`JsonSerialize`,`sequence or record`,r);return Mg(e,n),e.writeFile?.(n,Cg(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`),Vf(Af(`ndJsonSerialize`,2,t=>{let n=Og(J(t,0,`ndJsonSerialize`)),r=J(t,1,`ndJsonSerialize`),i=Rl(r);if(!i)throw Cf(`second`,`ndJsonSerialize`,`sequence`,r);return Mg(e,n),e.writeFile?.(n,Tg(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`),Vf(Af(`JsonDeserialize`,1,t=>Dg(dg(Ng(e,Og(J(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),Vf(Af(`ndJsonDeserialize`,1,t=>ol(Ng(e,Og(J(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>Dg(dg(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],Fg=(e,t)=>[Vf(qf(`Serialize`,3,(n,r)=>{let i=Jf(n,2,`Serialize`)(),a=hg(i);if(!a)throw Cf(`third`,`ndJsonSerialize`,`sequence`,i);if(kg(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Jf(n,0,`Serialize`)(),s=Rl(o);if(!s)throw Cf(`first`,`Serialize`,`sequence`,o);let c=Jf(n,1,`Serialize`)();if(typeof c!=`string`)throw Cf(`second`,`ndJsonSerialize`,`sequence`,c);let l=cu(a,`openOptions`);if(Rf(l)!==`TupleValue`)throw gg(l,`TupleValue`);let u=kg(a,`charset`),d=K(l).range.map(e=>{if(typeof e!=`string`)throw gg(e,`StringValue`);return e});return Ag(u),jg(e,c,d,Tg(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)`)],Ig={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},Lg=e=>{let n=[],r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=0,o=Zs(),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(Ig.string),l(0),l(-1),l(e.length),e.split(``).forEach(e=>s(e.charCodeAt(0)))},f=e=>{s(Ig.handle),u(e)},p=e=>{if(typeof e==`boolean`){s(Ig.boolean),s(+!!e);return}if(typeof e==`number`){s(Ig.integer),l(e);return}if(typeof e==`string`){a++,d(e);return}if(e.kind===`ModelValue`){s(Ig.modelValue),c(o.indexOf(e));return}if(e.kind===`Interval`){s(Ig.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++),is(e)){let t=G(e).elements;s(Ig.set),l(t.length),t.forEach(p);return}let n=K(e),m=rc(e);m===`tuple`?(s(Ig.tuple),u(n.range.length),n.range.forEach(p)):m===`record`?(s(Ig.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(Ig.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))},Rg=e=>[Vf(Af(`_TLCTraceSerialize`,2,t=>{let n=Og(J(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,Lg(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`)],zg=25214903917n,Bg=(1n<<48n)-1n,Vg=e=>{let t=(BigInt.asUintN(64,e)^zg)&Bg,n=e=>(t=t*zg+11n&Bg,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^zg)&Bg},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}},Hg=[],Ug=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Wg=()=>{for(let e=1277011;Hg.length<1341;e++)Ug(e)&&Hg.push(e);return Hg},Gg=e=>{let t=Wg(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},Kg=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},qg=e=>{for(let t=Math.max(e,9);;t++){let e=Kg(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)}}},Jg=(e,t,n)=>{if(t<=0)return[];let r=qg(t),i=BigInt(n.nextInt(t)),a=BigInt(Gg(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},Yg=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Yo),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},Xg=(1n<<63n)-1n-24n,Zg=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Xg*BigInt(n)+i)%t;return r<0n?r+t:r})},Qg=(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,$g=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=il(e.domain),n=G(e.range).elements;return{lists:t.map(()=>n),create:e=>ec(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>G(e).elements),create:t=>sl(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>G(e).elements),create:ol}}},e_=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,t_=(e,t,n,r)=>{if(Al(t))return[];let i=r===`1.7.4`?Yg:Jg;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=e_(t,r)?void 0:$g(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?Zg(e,t,n):i(e,Number(t),n)).map(e=>a.create(Qg(a.lists,e)))}let o=G(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},n_=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[...wf(t.domain,`RandomElement`,t).elements];return ec(e,e.map(()=>n_(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return sl(t.names.map((e,r)=>[e,n_(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return ol(t.factors.map(e=>n_(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 ${W(q(t))}.`);return t.low+i}let r=wf(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]},r_=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Cf(t,n,`nonnegative integer`,e);return e},i_=(e,t,n,r)=>Uc(Array.from({length:t},()=>Uc(e.filter(()=>r.nextDouble()<n)))),a_=(e,t)=>{let n=`RandomSetOfSubsets`,r=r_(J(e,0,n),`first`,n),i=r_(J(e,1,n),`second`,n),a=J(e,2,n);if(!is(a)||!pl(a))throw Cf(`third`,n,`finite set`,a);let o=G(a).elements;if(o.length<31&&r>2**o.length)throw Cf(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw Cf(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return i_(o,r,o.length===0?0:i/o.length,t.getRandom())},o_=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,s_=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,c_=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(o_.test(t))return Number(t.replace(/[fFdD]$/,``));let n=s_.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},l_=e=>Y(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=r_(J(t,0,n),`first`,n),i=J(t,1,n);if(typeof i!=`string`)throw Cf(`second`,n,`string literal representing a probability`,i);let a=c_(i);if(a===void 0||a<0||a>1)throw Cf(`second`,n,`string literal does not represent a parsable probability`,i);let o=J(t,2,n);if(!is(o)||Bs(o)||!Fl(o))throw Cf(`third`,n,`finite set`,o);let s=Nl(o);if(32-Math.clz32(r)>s&&r>1<<s)throw Cf(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return i_(G(o).elements,r,a,e.getRandom())}),u_=t=>[Vf(Y(`RandomSubset`,2,n=>{let r=r_(J(n,0,`RandomSubset`),`first`,`RandomSubset`),i=J(n,1,`RandomSubset`);if(!ll(i)||!Fl(i))throw Cf(`second`,`RandomSubset`,`a finite set`,i);let a=e_(i,t.version);if(a&&a.reduce((e,t)=>e*G(t).elements.length,1)>$o())throw new e.x(es());return Uc(t_(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=>a_(e,t)),Y(`TestRandomSetOfSubsets`,3,e=>ol(Array.from({length:5},()=>G(a_(e,t)).elements.length)))],d_=(e,t=0n)=>{let n=Vg(t),r=Vg(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>sl([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,markExplored:void 0,getSuccessorAction:()=>void 0,toRecord:()=>({}),setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:yd,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=Vg(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},f_=e=>Yc([...e.possibleCounts].map(e=>[e[0],e[1]])),p_=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,f_(e)]]),m_=e=>sl([[`name`,e??`UnnamedAction`],[`location`,sl([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),h_=/* @__PURE__ */ new WeakSet,g_=e=>nc(Xc(e),`record`),__=(e,t,n=!0)=>{[`state`,`action`,`console`].forEach(Ls);let r=[[`action`,Uc(e)],[`state`,Uc(t)]],i=g_(n?r:[...r,[`console`,!1]]);return h_.add(i),i},v_=(e,t,n,r=!0)=>{let i=e.map((e,t)=>ol([t+1,sl(Object.entries(e))])),a=i.slice(1).map((e,n)=>ol([i[n],t[n],e])),o=n?[ol([i[i.length-1],n.action,i[n.start]])]:[];return __([...a,...o],i,r)},y_=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return p_(e).get(t)},b_=(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${W(q(r))}`)},x_=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:Q(e),S_=e=>e.every(e=>e!==void 0),C_=(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&&!j(e);if(i&&t.variableIndex.has(r))return 1;let a=He(e).map(e=>C_(e,t,n)),o=i?Wb(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(C_(o.body,t,n))),Math.max(0,...a)},w_=(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[qf(`AssertError`,2,t=>{let r=Df(t,0,`AssertError`).expression;if(r&&r.kind!==`String`)throw new e.x(`In computing AssertError, a non-string expression (${x_(r)}) was used as the err of an AssertError(err, exp).`);let i=Jf(t,0,`AssertError`)();try{Jf(t,1,`AssertError`)()}catch(t){if(t instanceof e.x)return Mo(t.message,n.isTool)===i;throw t}return!1}),Af(`TLCGetOrDefault`,2,e=>y_(n,J(e,0,`TLCGetOrDefault`))??J(e,1,`TLCGetOrDefault`)),Af(`Trace`,0,(t,r)=>{let i=r?.environment.variables??[],a=r?.state??i.map(()=>void 0);if(!r||!S_(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?ol(n.getBehavior(a).map(e=>{let t=r.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return sl(i===void 0?t:[[`_action`,i],...t])})):ol([sl([])])}),Af(`CounterExample`,0,()=>n.counterExample??__([],[])),Y(`ToTrace`,1,t=>{let n=J(t,0,`ToTrace`);if(typeof n!=`object`||!h_.has(n))throw new e.A(`The argument of ToTrace should be a CounterExample, but instead it is:\n${W(q(n))}`);let r=G(cu(n,`state`)).elements.map(e=>Rl(e)??[]);return ol(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${W(q(n))}`);return Xs(n)}),qf(`TLCDefer`,1,(e,t)=>{let r=Df(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{$(r,{...t,next:e})}),!0}),Y(`TLCNoOp`,1,e=>J(e,0,`TLCNoOp`)),{...qf(`PickSuccessor`,1,(r,i)=>{let a=i?.next??(i?.environment.variables??[]).map(()=>void 0);if(n.getSimulationValue===void 0&&(!S_(a)||i?.next&&n.isSeen(a)))return!0;let o=Df(r,0,`PickSuccessor`),s=o.call([]);if(typeof s!=`boolean`)throw new e.x(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${zf(s)}) was used as the condition of an IF.\n${o.expression?x_(o.expression):``}`);if(s||!i?.next||!S_(a)||!i.state||!S_(i.state))return!0;let c=i.state,l=n.getSuccessorAction(c,a),u=e=>t(xo(n.isTool,vo.moduleOverrideStdout,yo.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(`${Wu(n.toRecord(c)).trimEnd()}\n~>\n${Wu(n.toRecord(a)).trimEnd()}`);else if(t[0]===`d`)u(Wu(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},qf(`TLCCache`,2,(e,t)=>{let i=Df(e,0,`TLCCache`),o=ku(Jf(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=C_(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=bu(t);if(n)throw n;return Number(BigInt.asIntN(32,yd([t])))}),qf(`TLCEvalDefinition`,1,(t,n)=>{let r=Jf(t,0,`TLCEvalDefinition`)();if(typeof r!=`string`)throw new e.A(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${W(q(r))}`);let i=n?Wb(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${W(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)})]},T_=(e,t)=>[Af(`_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}),Af(`_Counts`,0,()=>f_(t)),Af(`_CheckName`,1,n=>{let r=String(J(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(q(f_(t),!0)),!1)}),Af(`_PrintCounts`,0,()=>(e(q(f_(t),!0)),!0))],E_=e=>`${e.getUTCFullYear()}.${No(e.getUTCMonth()+1)}.${No(e.getUTCDate())}.${No(e.getUTCHours())}${No(e.getUTCMinutes())}${No(e.getUTCSeconds())}`,D_=e=>Yc([...e].map(e=>[e[0],ol([e[1]])])),O_=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),k_=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),A_=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),j_=(t,n,r)=>{if(t.version===`1.7.4`?!k_.has(n)||!t.isStarted&&A_.has(n):!t.isStarted&&O_.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 g_([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,a],[`worker`,0]]);case`config`:return g_([[`mode`,`bfs`],[`deadlock`,t.checkDeadlock],[`worker`,1],[`seed`,String(t.seed)],[`fingerprint`,String(BigInt.asIntN(64,qu()))],[`install`,`unknown`]]);case`revision`:{let e=/* @__PURE__ */ new Date;return g_([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,Ls(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Ls(E_(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return m_(void 0);case`all`:return D_(t.registers);case`all:named`:return D_(p_(t))}if(n.startsWith(`s:`)){let r=p_(t).get(n);if(r===void 0)throw new e.A(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return Ls(t.properties.get(n.slice(2))??n);throw new e.A(`TLCGet(${n}) was undefined.`)},M_=(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${W(q(n))}`);return j_(t,n,r?.state)},N_=e=>e.length===0?[[]]:e.flatMap((t,n)=>N_([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),P_=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&G(e).elements.forEach(P_),e.kind===`Function`&&e.range.forEach(P_))},F_=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`Function`:return e.functionClass===void 0?e:ec(e.domain,e.range);case`ModelValue`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return K(e);default:return G(e)}},I_=(t,n)=>[Y(`Print`,2,e=>(t(Bu([J(e,0,`Print`),J(e,1,`Print`)]).map(W).join(` `)),J(e,1,`Print`))),Y(`PrintT`,1,e=>(t(W(Bu([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${W(q(J(t,1,`Assert`)))}`,e.nt.assertViolation);return!0}),Y(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),Y(`:>`,2,e=>Yc([[J(e,0,`:>`),J(e,1,`:>`)]])),Y(`@@`,2,e=>{let t=J(e,0,`@@`),n=J(e,1,`@@`),r=os(t)?K(t):void 0,i=os(n)?K(n):void 0;if(!r)throw Cf(`first`,`@@`,`function`,t);if(!i)throw Cf(`second`,`@@`,`function`,n);let a=ms(r),o=ms(i).filter(e=>!a.some(t=>Bc(e[0],t[0])));return Xc([...a,...o])}),Y(`ToString`,1,e=>Ls(q(J(e,0,`ToString`),!0))),{...qf(`TLCEval`,1,(e,t)=>{let n=F_(Jf(e,0,`TLCEval`)());return t===void 0&&P_(n),n}),isStateLevel:!1},Y(`Permutations`,1,e=>{let t=wf(J(e,0,`Permutations`),`Permutations`).elements;return Uc(N_(t).map(e=>Yc(t.map((t,n)=>[t,e[n]]))))}),kf(`SortSeq`,2,e=>{let t=J(e,0,`SortSeq`),n=Rl(t);if(!n)throw Cf(`first`,`SortSeq`,`natural number`,t);let r=Df(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw Cf(`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)}),ol(a)}),n.version===`1.7.4`?Vf({...Af(`TLCGet`,1,(e,t)=>M_(n,J(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Vf(qf(`TLCGet`,1,(e,t)=>M_(n,Jf(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)`),Af(`TLCSet`,2,e=>(b_(n,t,J(e,0,`TLCSet`),J(e,1,`TLCSet`)),!0)),Of(`Any`,Ws),Y(`RandomElement`,1,e=>n_(J(e,0,`RandomElement`),n.getRandom()))],L_=`----------------------------- 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
|
+
`,R_=/* @__PURE__ */ new Map([[`Bags`,L_],[`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
|
+
`]]),z_=new Map([...[...R_].filter(e=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e[0])),[`Bags`,L_.replace(`
|
|
1689
1699
|
LOCAL INSTANCE Naturals
|
|
1690
1700
|
`,`
|
|
1691
1701
|
EXTENDS TLC
|
|
@@ -1777,17 +1787,12 @@ _TEPosition ==
|
|
|
1777
1787
|
ELSE TLCGet("level") + 1
|
|
1778
1788
|
|
|
1779
1789
|
=============================================================================
|
|
1780
|
-
`]]),If=(e=`master`)=>e===`1.7.4`?Ff:Pf,Lf=(e,t)=>e.every(e=>hi(e,t)),Rf=gr([!1,!0]);dr(Rf);const zf=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return xr(zf(e,t,r),zf(e,r,n))},Bf=[`\\cup`,`\\cap`,`\\`],Vf=e=>typeof e==`object`&&e.kind===`MixedSet`,Hf=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,Uf=(e,t,n)=>{t.kind===`Interval`&&ai(t);let r=t.kind===`Interval`?t:ur(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return jt(r,e=>{hi(e,n)===i&&kt(a,e)}),Hf(t)?En(a):_r(a)}if(ni(t))return n;if(!Mt(n))return Pn({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return jt(r,e=>kt(i,e)),jt(n.kind===`Interval`?n:I(n).elements,e=>{hi(e,t)||kt(i,e)}),_r(i)},Wf=(e,t)=>{let n=(t,n)=>Po([ns(t,n,e)()],0,e);return{...B(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},Gf=[Io(`TRUE`,!0),Io(`FALSE`,!1),Io(`BOOLEAN`,Rf),Io(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),zo(`=`,pr),zo(`#`,(e,t)=>!pr(e,t)),B(`~`,1,e=>!Po(e,0,`~`)),B(`<=>`,2,e=>Po(e,0,`<=>`)===Po(e,1,`<=>`)),Wf(`/\\`,(e,t)=>e&&t()),Wf(`\\/`,(e,t)=>e||t()),Wf(`=>`,(e,t)=>!e||t()),B(`\\in`,2,e=>hi(z(e,0,`\\in`),z(e,1,`\\in`))),B(`\\notin`,2,e=>!hi(z(e,0,`\\notin`),z(e,1,`\\notin`))),zo(`\\subseteq`,(t,n)=>{if(!P(t))throw new e.b(`\\subseteq expects a set but received ${R(t)}`);if(typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&F(t.base))return Lf(I(t.base).elements,n.base);if(typeof t==`object`&&t.kind===`Interval`){if(typeof n==`object`&&n.kind===`Interval`&&n.low<=t.low&&n.high>=t.high)return!0;for(let e=t.low;e<=t.high;e++)if(!hi(e,n))return!1;return!0}return!Xr(t,e=>!hi(e,n))}),...Bf.map(t=>B(t,2,n=>{let r=z(n,0,t),i=z(n,1,t),a=t!==`\\cup`&&typeof i==`object`&&i.kind===`Interval`&&typeof r==`object`&&r.kind!==`Interval`;if(Mt(r)&&Mt(i)&&!Vf(r)&&!Vf(i)&&!a&&!At(r)&&!At(i)){if(t===`\\cup`&&ni(r))return i;let n=t===`\\cup`?xr:t===`\\cap`?br:yr;return pi((r,i)=>{let a=I(r),o=I(i),s=n(a,o);if(t===`\\cup`){let t=ur(a),n=yr(o,a).elements,r=t===a.elements&&(n.length===0||bn(t[t.length-1],n[0])<0);if(t.length+n.length>Dt())throw new e.N(Ot());if(r&&!a.isNormalized)return s;let i=s===a?Tn(s.elements):s;return r||(i.writtenElements=[...t,...n]),i}return s===r||(s.isNormalized=Hf(r),a.writtenElements&&!a.isNormalized&&(s.writtenElements=a.writtenElements.filter(e=>hi(e,s)))),s},(e,n)=>Uf(t,e,n),r,i)}return Mt(r)?Uf(t,r,i):t!==`\\`&&Mt(i)?Uf(t,i,r):Pn({kind:`SetOperation`,operator:t,left:r,right:i})})),B(`SUBSET`,1,e=>({kind:`Subset`,base:z(e,0,`SUBSET`)})),B(`UNION`,1,e=>{let t=z(e,0,`UNION`),n=Ft(t)?ur(t):[],r=n.filter(Ft);if(!Ft(t)||r.length!==n.length)return Pn({kind:`Union`,base:t});let i=r.flatMap(ur),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{hi(t,e)||kt(e.elements,t)}),_r(e.elements)};return Vf(t)||r.some(Vf)?a():r.length===0?vr:pi(e=>li(zf(e,0,e.length),i),a,r.map(I),void 0)}),B(`DOMAIN`,1,t=>{let n=z(t,0,`DOMAIN`);if(!Nt(n))throw new e.b(`DOMAIN expects a function but received ${R(n)}`);return Pi(n)})],Kf=Zo(`Integers`,`Neg`,`IntValue`,1),qf=t=>{let n=Zo(t,`DotDot`,`IntervalValue`,2);return[Qo(t,`+`,`Plus`,(e,t)=>e+t),Qo(t,`-`,`Minus`,(e,t)=>e-t),Qo(t,`*`,`Times`,(e,t)=>e*t),Qo(t,`^`,`Expt`,(t,n)=>{if(n<0)throw new e.k(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(t===0&&n===0)throw new e.k(`0^0 is undefined.`);return t**n}),Qo(t,`\\div`,`Divide`,(t,n)=>{if(n===0)throw new e.k(`The second argument of \\div is 0.`);let r=Math.floor(t/n);if(Bo(r))throw Vo(`${t} \\div ${n}`);return r}),Qo(t,`%`,`Mod`,(t,n)=>{if(n<=0)throw new e.k(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(t%n+n)%n}),B(`..`,2,e=>{let t=z(e,0,`..`),r=Xo(z(e,1,`..`),n);return{kind:`Interval`,low:Xo(t,n),high:r}})]},Jf=qf(`Naturals`),Yf=qf(`Integers`),Xf=e=>{let t=Jf.indexOf(e);return t===-1?void 0:Yf[t]},Zf=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[Yo(es(`<`,(e,t)=>e<t),t(`LT`)),Yo(es(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),Yo(es(`<=`,(e,t)=>e<=t),t(`LE`)),Yo(es(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},Qf=[Io(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Jf,...Zf(`Naturals`)],$f=[Io(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Yf,...Zf(`Integers`),B(`-.`,1,e=>{let t=Xo(z(e,0,`-`),Kf);if(Bo(-t))throw Vo(`-${t}`);return-t})],ep=(t,n,r)=>{let i=z(t,n,r),a=ui(i);if(!a)throw new e.k(`${r}\n${R(i)}`);return a},tp=(e,t,n)=>{let r=z(e,t,n);return typeof r==`string`?r:ep(e,t,n)},np=(e,t,n)=>{let r=z(e,t,`SubSeq`);if(typeof r!=`number`)throw jo(n,`SubSeq`,`natural number`,r);return r},rp=(e,t,n)=>typeof e==`string`?un(e.slice(t,n)):Nr(e.slice(t,n)),ip=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,ap=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,op=(e,t)=>{let n=Mf.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Yo(e,t):e}):t},sp=t=>op(`Sequences`,[B(`Seq`,1,e=>({kind:`SequenceSet`,base:z(e,0,`Seq`)})),B(`Len`,1,e=>tp(e,0,ip(``,`Len`)).length),B(`\\o`,2,t=>{let n=tp(t,0,ap(`s \\o t`,`sequence`));if(typeof n!=`string`){let e=ep(t,1,ap(`t \\o s`,`sequence`));return Nr([...n,...e])}let r=z(t,1,`\\o`);if(typeof r!=`string`)throw new e.k(`${ap(`t \\o s`,`string`)}\n${R(r)}`);return un(n+r)}),B(`Append`,2,e=>Nr([...ep(e,0,ap(t===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),z(e,1,`Append`)])),B(`Head`,1,t=>{let n=ep(t,0,ip(``,`Head`));if(n.length===0)throw new e.k(`Attempted to apply Head to the empty sequence.`);return n[0]}),B(`Tail`,1,t=>{let n=tp(t,0,ip(``,`Tail`));if(n.length===0)throw new e.k(`Attempted to apply Tail to the empty sequence.`);return rp(n,1)}),B(`SubSeq`,3,t=>{let n=tp(t,0,ip(`first `,`SubSeq`)),r=np(t,1,`second`),i=np(t,2,`third`);if(r>i)return rp(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.k(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${R(z(t,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return rp(n,r-1,i)}),Lo(`SelectSeq`,2,t=>{let n=Fo(t,1,`SelectSeq`);return Nr(ep(t,0,ip(`first `,`SelectSeq`)).filter(t=>{let r=n.call([t]);if(typeof r!=`boolean`)throw new e.k(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${n.name}>`);return r}))})]),cp=t=>op(`FiniteSets`,[B(`IsFiniteSet`,1,e=>si(z(e,0,`IsFiniteSet`))),B(`Cardinality`,1,n=>{let r=z(n,0,`Cardinality`);if(!P(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new e.k(`Attempted to compute cardinality of the value\n${R(r)}`);return ai(r,t)})]),lp=[Yo(B(`Warshall`,1,t=>{let n=z(t,0,`Warshall`);if(!P(n)||pn(n))throw new e.k(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${R(n)}`);ai(n);let r=[],i=/* @__PURE__ */ new Map,a=e=>{let t=$i(e),n=i.get(t)??r.length;return n===r.length&&(i.set(t,n),r.push(e)),n},o=I(n).elements.map(t=>{let n=ui(t);if(n?.length!==2)throw new e.k(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${R(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 _r(r.flatMap((e,t)=>r.flatMap((n,r)=>s[t][r]?[Nr([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],up=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return lp;if(e===`AnySet`)return[Io(`ANY`,_n)];if(e===`IOUtils`)return Cd(r,a);if(e===`_TLCTrace`)return Ed(r);if(!If(n.version).has(e))return;let o=pp(e,t,n,r,i);return e===`Randomization`&&o?[...o,Zd(n)]:o},dp=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),fp=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]]]),pp=(e,t,n,r,i)=>{switch(e){case`Naturals`:return Qf;case`Integers`:return $f;case`Sequences`:return sp(n.version);case`FiniteSets`:return cp(n.version);case`TLC`:return op(`TLC`,Tf(t,n));case`Randomization`:return Qd(n);case`_Possible`:return pf(t,n);case`Json`:return Sd(r);case`Bags`:return op(`Bags`,qu(i));case`TLCExt`:return op(`TLCExt`,ff(t,n));default:return}},mp=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&Uc.get(t)||[];r.expressions.push(...i,t);let a=fi.sets,o=a??[],s=o.length;fi.sets=o;try{return n()}catch(e){throw Hg(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,fi.sets=a}},hp=(e,t,n)=>e.coverage?lo(e.coverage,t,n):-1,gp=(e,t,n)=>e.coverage?fo(e.coverage,t,n):n(),_p=(e,t,n,r)=>gp(e,t,()=>W(n,r)),vp=(e,t,n,r)=>{let i=_p(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},yp=(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},bp=e=>!e.includes(void 0),xp=e=>e.variables.map(()=>void 0),Sp=(e,t,n)=>{let r=[...e];return r[t]=n,r},Cp=(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}},wp=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,Tp=e=>e.kind===`Identifier`?e.name:void 0,Ep=(e,t,n)=>{if(t.kind===`Label`)return Ep(e,t.body,n);let r=Tp(t);if(r===void 0)return;let i=Eh(n,r);if(i?.kind===`Thunk`)return Ep(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=gg(r,e);return o?.kind===`Closure`&&o.params.length===0?Ep(e,o.body,o.scope):void 0},Dp=(e,t,n)=>{if(t.kind===`Prime`)return Ep(e,t.expression,n);if(t.kind===`Label`)return Dp(e,t.body,n);let r=Tp(t);if(r===void 0)return;let i=Eh(n,r);if(i?.kind===`Thunk`)return Dp(e,i.expression,i.scope);if(i)return;let a=gg(r,e);return a?.kind===`Closure`&&a.params.length===0?Dp(e,a.body,a.scope):void 0},Op=t=>{if(typeof t!=`boolean`)throw new e.b(`TLC expected a boolean expression.`);return t},kp=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Ap=(e,t,n,r)=>{let i=Mp(e,t,n,r);return i&&e.coverage&&!e.isInit&&uo(e.coverage,r),i},jp=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(uo(r,n),uo(r,r.roots[n])),e.onState(t),!0},Mp=(e,t,n,r)=>t===void 0?bp(n)?jp(e,n,r):(e.onIncomplete?.(n),!1):bp(n)&&kp(e)?Pp(e,t,n,r):t.kind===`Predicate`?Fp(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?Zp(e,t.expression,t.rest,t.scope,n,t.node):Np(e,t,n)&&Ap(e,t.rest,n,t.node),Np=(e,t,n)=>{let r=e.environment,i=_p(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return _p(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?Th(t,r.runtime.version):t}})();try{return!pr(i,a)}catch(t){throw e.callStack&&Hg(e.callStack,[i],t),t}},Pp=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return Zp(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?Np(e,i,n):Op(_p(e,i.node,i.expression,yp(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return jp(e,n,r)},Fp=(e,t,n,r,i,a)=>Ip(e,t,n,r,i,hp(e,a,t)),Ip=(t,n,r,i,a,o)=>mp(t,n,()=>{switch(n.kind){case`Let`:{let e=yp(t,i,a),s=n.definitions,c=t.coverage?Ng(s,e,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):Ng(s,e);return Fp(t,n.body,r,c,a,o)}case`Label`:return Fp(t,n.body,r,i,a,o);default:if(Gp.has(n.kind))throw new e.b(`The state relation is not a boolean expression.`);return mp(t,n,()=>Yp(t,n,r,i,a,o))}}),Lp=(e,t,n,r,i)=>Op(t)&&Ap(e,n,r,i),Rp=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),zp=(e,t,n,r,i,a)=>{let o=yp(e,r,i);if(t.kind===`Identifier`){let s=Eh(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return Fp(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return Fp(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:gg(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&wu(c,e.environment))?Fp(e,l.body,n,l.scope,i,a):Lp(e,vp(e,a,t,o),n,i,a)}let s=_g(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=gp(e,a,()=>kg(s,t.args,o));return Fp(e,s.body,n,r,i,a)}let c=Rp.has(t.operator)?_p(e,a,t,o):vp(e,a,t,o);return Lp(e,c,n,i,a)},Bp=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?Ap(e,t,Sp(n,r,i),a):pr(o,i)&&Ap(e,t,n,a)},Vp=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),Hp=(e,t,n)=>(e.coverage&&po(e.coverage,t,n.length+1),n),Up=(t,n,r,i,a,o)=>{let[s,c]=n.args,l=t.isInit?Ep(t.environment,s,i):Dp(t.environment,s,i),u=yp(t,i,a);if(l===void 0)return _p(t,o,n,u)===!0&&Ap(t,r,a,o);let d=_p(t,o,c,u),f=a[l];if(n.operator===`=`)return Bp(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 _p(t,o,n,u)===!0&&Ap(t,r,a,o);if(!Ir(p))throw new e.b(`The right side of \\IN is not enumerable.`);return Hp(t,p,Zr(p)).reduce((e,n)=>Ap(t,r,Sp(a,l,n),o)||e,!1)},Wp=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Gp=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Kp={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},qp=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:Kp[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${U(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${U(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${U(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${U(e)}`},Jp=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=gp(e,r,()=>Kh(t.bounds,t=>{let r=W(t,n),i=Uh(r,t,a);return Array.isArray(i)&&Hp(e,r,i),i}));return Jh(t.bounds,o,n.scope,e=>(i.push(e),!1)),i},Yp=(t,n,r,i,a,o)=>{let s=yp(t,i,a);switch(n.kind){case`Identifier`:return zp(t,n,r,i,a,o);case`Apply`:return Wp.has(n.operator)&&n.args.length===2?Up(t,n,r,i,a,o):n.operator===`=>`&&n.args.length===2?Op(_p(t,o,n.args[0],s))?Fp(t,n.args[1],r,i,a,o):Ap(t,r,a,o):zp(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)=>Vp(`Predicate`,t,i,o,e),r);return Fp(t,e[0],n,i,a,o)}let s=e[e.length-1];return Ip(t,Cp(n,e.length-1),Vp(`Predicate`,s,i,o,r),i,a,wp(t,o))}case`Or`:{let e=n.operands;if(n.isBulleted||e.length===2)return e.reduce((e,n)=>Fp(t,n,r,i,a,o)||e,!1);let s=Ip(t,Cp(n,e.length-1),r,i,a,wp(t,o)),c=Fp(t,e[e.length-1],r,i,a,o);return s||c}case`Exists`:return Jp(t,n,s,o).reduce((e,i)=>Fp(t,n.body,r,i,a,o)||e,!1);case`Forall`:{let e=Jp(t,n,s,o);if(e.length===0)return Ap(t,r,a,o);let i=e.slice(1).reduce((e,t)=>Vp(`Predicate`,n.body,t,o,e),r);return Fp(t,n.body,i,e[0],a,o)}case`If`:return Fp(t,Op(_p(t,o,n.condition,s))?n.consequent:n.alternative,r,i,a,o);case`Case`:{let c=n.arms.find(e=>Op(_p(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 Fp(t,c,r,i,a,o)}case`FunctionApplication`:{let e=eg(_p(t,o,n.function,t.isInit?s:Ah(s)));if(e){let i=gp(t,o,()=>tg(e,n,s));return Fp(t,e.body,r,i,a,o)}break}case`Unchanged`:if(!t.isInit)return Zp(t,n.expression,r,i,a,o);break;case`BoxAction`:if(!t.isInit){let e=Fp(t,n.action,r,i,a,o);return Zp(t,n.subscript,r,i,a,o)||e}break;case`AngleAction`:if(!t.isInit)return Fp(t,n.action,Vp(`Changed`,n.subscript,i,o,r),i,a,o)}let c=t.isEnabled?qp(n):void 0;if(c!==void 0)throw new e.b(c);return Lp(t,_p(t,o,n,s),r,a,o)},Xp=(e,t,n)=>e.runtime.warn(qe.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${U(n)}`),Zp=(e,t,n,r,i,a)=>mp(e,t,()=>{let o=hp(e,a,t),s=Ep(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&&!pr(a,r)?(Xp(e.environment,s,t),!1):Bp(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return Ap(e,n,i,o);let c=s.reduceRight((e,t)=>Vp(`Unchanged`,t,r,o,e),n);return Zp(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=Eh(r,t.name);if(a?.kind===`Thunk`)return Zp(e,a.expression,n,a.scope,i,o);let s=a?void 0:gg(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return Zp(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=yp(e,r,i),s=_g(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return Zp(e,s.body,n,kg(s,t.args,a),i,o)}let c=e.environment,l=_p(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=_p(e,o,t,{environment:c,scope:r,state:i,next:void 0});return pr(l,u)&&Ap(e,n,i,o)}),Qp=(e,t,n,r,i)=>({environment:e,callStack:e.callStack,coverage:e.coverage,isInit:t===`init`,isEnabled:t===`enabled`,current:n,onState:r,onIncomplete:i}),$p=/* @__PURE__ */ Error(`The replay found a successor`),em=(e,t,n,r)=>{let i=Qp(r,`enabled`,n,()=>{throw $p}),a=i.callStack,o=a?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Vp(`Changed`,e.subscript,t,-1,void 0);Fp(i,e.action,n,t,xp(r),-1)}else Fp(i,e,void 0,t,xp(r),-1);return!1}catch(e){if(e!==$p)throw e;return a&&(a.expressions.length=o,a.isFrozen=!1),!0}},tm=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=Qp(t,`init`,void 0,n,r),s=a.reduceRight((e,t)=>Vp(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);Fp(o,i.expression,s,i.scope,xp(t),i.node??-1)},nm=(e,t,n,r)=>{e.some(e=>Gp.has(e.expression.kind))||e.forEach(e=>{let i=[];rm(e,-1,t,n,e=>i.push(e)),i.forEach(t=>r(t,e))})},rm=(e,t,n,r,i,a)=>{let o=Qp(r,`next`,n,i,a);Fp(o,e.expression,void 0,e.scope,xp(r),t)},im=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(Ep(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=Eh(r,e.name)?void 0:gg(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,Ng(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`){Dp(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=Eh(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?_g(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:gg(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,kg(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??[])},am=/* @__PURE__ */ new WeakMap,om=/* @__PURE__ */ new WeakMap,sm=(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},cm=(e,t,n)=>{let r=e.slice();return r[t]=n,r},lm=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,um=(t,n)=>{let r=new e.b(n);return t.isInit?r:e.at(r,e.nt.error)},dm=(e,t,n,r)=>{let i=hh(n);return r&&Gp.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 ${lm(e)}, TLC expected a boolean expression,\nbut instead found ${R(t)}.\n${i}`},fm=(e,t,n)=>{let r=qo(t),i=U(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 ${lm(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
1781
|
-
`:``}${i}`},pm=(e,t,n)=>gm(e,t,W(t,n)),mm=new Set(Gf.map(e=>e.name)),hm=e=>e.kind===`Apply`?mm.has(e.operator):e.kind!==`Identifier`&&!Gp.has(e.kind),gm=(t,n,r,i=!0)=>{if(typeof r==`boolean`)return r;let a=dm(t,r,n,i);throw t.isInit&&i&&hm(n)?new e.z(a):um(t,a)},_m=(e,t,n,r)=>r.environment.callStack?W(n,r):(e[t]??=Jg(n,r.environment))(r),vm=e=>e===`=`||e===`\\in`||e===`\\subseteq`,ym=(e,t,n)=>{let r=n?am:om,i=r.get(e);if(i)return i;let a=$m(e,t,n),o=n?void 0:Qm(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},bm=(e,t)=>{if(t.constants.has(e))return;let n=Lh(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},xm=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return xm(e.expression,t,!1,r);if(e.kind!==`Identifier`||j(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=bm(e.name,t);if(a&&!r.has(a))return r.add(a),xm(a.body,t,n,r)},Sm=(e,t,n)=>xm(e,t,!n),Cm=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return Cm(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Ng(e.definitions,sm(r,t,n));return Cm(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Eh(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return Cm(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=bm(e.name,r.environment);if(s)return Cm(s.body,void 0,n,r,i)},wm=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||j(e))||!t&&e.kind===`Prime`,Tm=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Tm(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=bm(e.name,t);if(i)return n.add(e.name),Tm(i.body,t,n)},Em=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Dm=(e,t,n)=>Em.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||vm(e.operator)&&(wm(e.args[0],n)||Sm(e.args[0],t,n)!==void 0)||j(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,Om=/* @__PURE__ */ new Set,km=(e,t)=>{if(j(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return Qc(e,(e,i)=>{let a=r?km(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];a?n.push(...a):r=!1}),r?n:void 0},Am=(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||j(e)?void 0:Lh(r,t);return i&&!n.has(i)&&(n.add(i),Am(i.body,t,n))?!0:ze(e).some(e=>Am(e,t,n))},jm=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Sm(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=Tm(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return Dm(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:ym(e,t,n)}},Mm=(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(Au(e,t)===void 0||Am(e,t,/* @__PURE__ */ new Set))return!0;let n=km(e,Om);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)}},Nm=(e,t,n)=>{let r=e.map(e=>jm(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=kp(t);for(let s=e;s<r.length;s++){if(s>0&&f&&th(u)){d??=sm(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&&!pr(t,i[e.index])}):void 0;if(o){Xp(t.environment,o.index,o.expression);return}let s=n.expression,c=_m(a,e,s,d);if(!gm(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=sm(t,n,u);let r=_m(i,s,e.expression,d);if(!gm(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=sm(t,n,u);let r=_m(i,s,e.value,d),a=u[e.index];if(a===void 0)u=cm(u,e.index,r),d=void 0;else if(!pr(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(!pr(e,n[i.index])){Xp(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)},Pm=e=>{let t=qp(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw um(n,t);pm(n,e,sm(n,r,i))&&s(i,a)}},Fm=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=sm(r,i,a);if(a[l]!==void 0){pm(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Ir(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${lm(r)}, the right side of \\IN is not enumerable.`;throw um(r,`${t}\n${U(e)}`)}let p=Zr(f);if(r.generator){for(let e of Ud(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(cm(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(cm(a,l,p[e]),o)}},Im=/* @__PURE__ */ new WeakMap,Lm=e=>{let t=Im.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Lm),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Im.set(e,n),n},Rm=(e,t)=>{let n=e.args[0],r=Pm(e),i=(e,r,i)=>Cm(n,r,i,e,!t)??-1,a=Fm(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],sm(t,n,o));l(cm(o,u,d),s)}},zm=(e,t,n)=>{let r=U(e);return(i,a,o,s,c,l)=>{let u=sm(i,a,o),d=W(e.function,n?u:Ah(u)),f=eg(d);if(f!==void 0){ym(f.body,t,n)(i,tg(f,e,u),o,s,c,l);return}if(!Nt(d))throw um(i,`In computing ${lm(i)}, a non-function (${qo(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw um(i,`In computing ${lm(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Bm=(e,t)=>{let n=Lm(e);return Tm(e,t)?Nm([n],t,!1):e.kind===`Tuple`?ym(n,t,!1):(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Eh(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){ym(Lm(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=sm(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=_g(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){ym(Lm(n.body),t,!1)(r,kg(n,e.args,u),a,o,s,c);return}}pm(r,n,u)&&c(a,o)}},Vm=(e,t,n)=>{let r=e.operator,i=Pm(e),a=j(e)?void 0:gg(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=$g(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=ym(a.body,t,n),o(e,i(sm(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=sm(a,o,s),f=_g(e,d);f?.kind===`Closure`?ym(f.body,t,n)(a,kg(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Hm=(e,t,n)=>{let r=Pm(e),i=j(e)?void 0:bm(e.name,t),a;return(o,s,c,l,u,d)=>{let f=Eh(s,e.name);f?.kind===`Thunk`&&!f.isReleased?ym(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&dg(i,t)!==void 0?r(o,s,c,l,u,d):(a??=ym(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},Um=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||j(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`||!j(i))return;let a=xm(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},Wm=e=>e.kind===`And`?e.operands.flatMap(Wm):[e],Gm=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&Dm(e,t,!1),Km=e=>{let t=[];return(n,r,i)=>{let a=sm(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!gm(n,i,_m(t,r,i,a)))return}}},qm=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=Wm(e),r=n.findIndex(e=>!Gm(e,t)||Um(e,t)),i=r===-1?void 0:Um(n[r],t);return i?{...i,before:r===0?void 0:Km(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>qm(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`||j(e))return;let r=gg(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=qm(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`||!j(o))return;let s=i.before,c=s&&$g(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(sm(e,t,n)),n))}},Jm=(e,t,n)=>{let r=Eh(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},Ym=(e,t,n)=>{let r=e.map(e=>ym(e,t,n)),i=n?[]:e.map(e=>qm(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&&Jm(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)}}},Xm=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=Nd(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},Zm=(e,t)=>{let n=ym(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=sm(r,i,a),u=t.runtime.version,d=Kh(e.bounds,e=>W(e,l)).map((n,r)=>Ud(Vh(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,Oh(i,l,e)))};f(d.length-1,i)}},Qm=(e,t)=>{if(e.kind===`Exists`)return Zm(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>ym(e,t,!1));return e.isBulleted?Xm(n):n.reduce((e,t)=>Xm([e,t]))},$m=(t,n,r)=>{let i=e=>ym(e,n,r);switch(t.kind){case`And`:return Nm(t.operands,n,r);case`Or`:return Ym(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=Vh(W(a.set,sm(r,i,o)),a.set,n.runtime.version);for(let n=0;n<u.length&&!r.isStopped;n++)e(r,Dh(i,t,u[n]),o,s,c,l)}}let o=r?void 0:Mm(t,n);if(o){let e=Nm(o.rest,n,r);return(r,i,a,s,c,l)=>{let u=sm(r,i,a),d=Kh(t.bounds,e=>Vh(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=Dh(n,o.names[t],e);if(t===d.length-1){let e=sm(r,i,a);if(!o.guards.every(t=>pm(r,t,e)))continue}f(t-1,i)}};f(d.length-1,i)}}return(n,r,i,a,o,s)=>{Yh(t.bounds,sm(n,r,i),t=>(e(n,t,i,a,o,s),n.isStopped))}}case`Forall`:{let e=i(t.body),a=!r&&Au(t,n)!==void 0&&!Am(t.body,n,/* @__PURE__ */ new Set)?km(t,Om):void 0;return(n,r,i,o,s,c)=>{let l=[];Yh(t.bounds,sm(n,r,i),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Eh(r,e)?.kind===`Value`)){u.every(e=>pm(n,t.body,sm(n,e,i)))&&c(i,o);return}let d=(r,i,a)=>{r===u.length?c(i,a):r>0&&n.isInit&&th(i)?u.slice(r).every(e=>pm(n,t.body,sm(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,sm(r,i,a));if(typeof l!=`boolean`)throw um(r,fm(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=sm(r,i,a),u=e.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw um(r,`In computing ${lm(r)}, a non-boolean expression${r.isEnabled?``:` `}(${qo(t)}) was used as a guard condition of a CASE.\n${hh(e.source)}`)})?.body??n;if(!u)throw um(r,`In computing ${lm(r)}, TLC encountered a CASE with no conditions true.\n${U(t)}`);u(r,i,a,o,s,c)}}case`Let`:{let e=i(t.body),r=Fg(t.definitions,n);return(n,i,a,o,s,c)=>e(n,Ng(t.definitions,sm(n,i,a),r),a,o,s,c)}case`Unchanged`:return r?()=>{throw new e.b(`UNCHANGED appears in an initial predicate at ${fh(t)}`)}:Bm(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 pm(e,r,sm(e,t,i))}catch(t){throw e.isEnabled?Th(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 Ym([t.action,Lm(t.subscript)],n,r);case`Label`:return i(t.body);case`Identifier`:return Hm(t,n,r);case`FunctionApplication`:return zm(t,n,r);case`Apply`:{let e=t.args;if(vm(t.operator)){let i=Sm(e[0],n,r);if(i!==void 0)return t.operator===`=`?Nm([t],n,r):Fm(t,()=>i);if(wm(e[0],r))return Rm(t,r)}if(t.operator===`=>`){let n=i(e[1]);return(r,i,a,o,s,c)=>{let l=W(e[0],sm(r,i,a));if(typeof l!=`boolean`){let e=qo(l),n=U(t);throw um(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 Vm(t,n,r)}default:return Pm(t)}},eh=e=>e.variables.map(()=>void 0),th=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},nh=(t,n)=>{let r=n.state;if(!r||!th(r))throw new e.b(`ENABLED needs a complete state at ${fh(t)}`);let i=n.environment;if(i.callStack)return em(t,n.scope,r,i);let a={environment:i,isInit:!1,isEnabled:!0,current:r,isStopped:!1,generator:void 0,successors:0};return ym(t,i,!1)(a,n.scope,eh(i),void 0,!1,()=>{a.isStopped=!0}),a.isStopped},rh=(t,n,r,i,a)=>{let o={environment:n,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};ym(t,n,!0)(o,i,eh(n),void 0,!1,t=>{if(!o.isStopped){if(!th(t)){if(a){o.isStopped=a([...t]);return}throw e.at(new e.S([...t]),e.nt.error)}o.isStopped=r(t)}})},ih=(e,t,n)=>{let r=[];return rh(e,t,e=>(r.push(e),!1),n),r},ah=(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 ym(t,r,!1)(c,a,eh(r),void 0,!1,(t,n)=>{if(!c.isStopped){if(!th(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},oh=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return ym(e,n,!1)(i,r,eh(n),void 0,!1,e=>{th(e)||(i.isStopped=!0)}),i.isStopped},sh=(e,t,n,r)=>{let i=[];return ah(e,t,n,e=>(i.push(e),!1),r),i},ch=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),lh=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),uh=e=>lh.has(e.kind)||e.kind===`Apply`&&ch.has(e.operator),dh=(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&&Mt(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},fh=e=>`line ${e.location.line}, column ${e.location.column}`,U=t=>{let n=t.location.range;return n?e.X(n):fh(t)},ph={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},mh=(t,n)=>new e.b(`TLC encountered a temporal formula (${t}) when evaluating a predicate or action.\n${U(n)}`),hh=e=>e.kind===`Number`?e.text??String(e.value):U(e),gh=(t,n)=>new e.b(`A non-boolean expression (${qo(n)}) was used as the condition of an IF.\n${U(t)}`),_h=(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 (${qo(r)}) was used as a formula in a ${t.kind===`And`?`conjunction`:`disjunction`}.\n${hh(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${qo(r)}.\n${U({...t,location:{...t.location,range:{...i,end:a}}})}`)},vh=t=>{let n=t.field,r=e=>`Attempted to select nonexistent field "${n}" from the record\n${M(R(e))}\n${U(t)}`,i=e=>`Attempted to apply function:\n${M(R(e))}\nto argument "${n}", which is not in the domain of the function.`;return a=>{if(!Nt(a))throw new e.b(`Attempted to select field "${n}" from a non-record value ${M(R(a))}\n${U(t)}`);let o=An(a);if(o===`tuple`)throw Ei(n);return Mi(a.kind===`LazyFunction`?L(a):a,n,o===`record`?r:i)}},yh=e=>e===`1.7.4`?(t,n)=>Ci(t,n,e):void 0,bh=t=>n=>{if(!Nt(n))throw new e.b(`Attempted to apply the operator DOMAIN to a non-function\n(${qo(n)})\n${U(t)}`);return Pi(n)},xh=(t,n)=>(r,i)=>{if(!P(r)||pn(r))throw new e.b(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${U(t)}`);return n.evaluateBinary?n.evaluateBinary(r,i):n.evaluate([r,i])},Sh=t=>e.at(new e.b(`TLC can't handle real numbers.\n${t.text}`),e.nt.configParseError),Ch=t=>e.at(new e.b(`TLC can't handle a number this big.\n${t.text??t.value}`),e.nt.error),wh=(t,n)=>new e.R(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${U(n)}`,t),Th=(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,Eh=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},Dh=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Oh=(t,n,r)=>{if(n.kind===`Name`)return Dh(t,n.name,r);let i=ui(r);if(!i||i.length!==n.names.length){let t=n.ranges?.[0];throw new e.b(`Argument mismatch in operator application.${t?e.X(t):``}`)}return n.names.reduce((e,t,n)=>Dh(e,t,i[n]),t)},kh=(t,n)=>{if(Nt(t))return t;throw new e.b(`A non-function (${qo(t)}) was applied as a function.\n${U(n)}`)},Ah=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},jh=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),Mh=(t,n)=>{if(typeof t!=`boolean`)throw new e.b(`Expected ${n} to be a boolean but found ${R(t)}`);return t},Nh=(t,n,r)=>{if(typeof t!=`boolean`)throw new e.b(`Attempted to evaluate an expression of form P => Q when ${r} was\n${qo(t)}.\n${U(n)}`);return t},Ph=(t,n)=>{if(typeof t!=`boolean`)throw new e.b(`Attempted to apply the operator ~ to a non-boolean\n(${qo(t)})\n${U(n)}`);return!t},Fh=(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${U(r)}`);return t===n},Ih=(t,n)=>{if(typeof t!=`boolean`)throw new e.b(`TLC expected a boolean value, but did not find one. ${hh(n)}`);return t},Lh=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),Rh=(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.`},zh=(t,n,r)=>{if(!P(t)||pn(t)){let i=R(t),a=r===`1.7.4`?void 0:Rh(t,i);throw new e.b(a===void 0?`TLC encountered a non-enumerable quantifier bound\n${i}.\n${hh(n)}`:`TLC encountered the non-enumerable quantifier bound\n${i}\n${hh(n)}\n${a}`)}},Bh=(e,t,n)=>(zh(e,t,n),typeof e==`object`&&e.kind===`Interval`?kr(e):Ur(e)??Yr(e)),Vh=(e,t,n)=>n===`1.7.4`?(zh(e,t,n),Ur(e)??Zr(e)):Bh(e,t,n),Hh=e=>{if(typeof e==`object`&&e.kind===`Interval`)return ai(e),e},Uh=(e,t,n)=>Hh(e)??Vh(e,t,n),Wh=(e,t,n)=>Hh(e)??Bh(e,t,n),Gh=(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},Kh=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set)),n),[]),qh=(e,t)=>Kh(e,e=>Uh(W(e,t),e,t.environment.runtime.version)),Jh=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Gh(t[n],t=>i(n-1,Oh(a,e[n].pattern,t)));return i(e.length-1,n)},Yh=(e,t,n)=>Jh(e,qh(e,t),t.scope,n),Xh=(e,t)=>{let n=Kh(e,e=>W(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Zh=(e,t,n)=>{if(e.length===1)return Oh(t,e[0].pattern,n);let r=ui(n)??[];return e.reduce((e,t,n)=>Oh(e,t.pattern,r[n]),t)},Qh=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,$h=e=>Object.assign(e.value,{lambda:e}),eg=e=>Qh(e)?e.lambda:void 0,tg=(t,n,r)=>{let i=t.value,a=n.args.map(e=>W(e,r)),o=a.length===1?a[0]:Nr(a),s=(e,t,r)=>`In applying the function\n${M(R(i))},\nthe ${e} is:\n${M(R(t))}${r}.\n${U(n.function)}`,c=t.bounds;if(c.length===1){if(!hi(o,i.domain))throw new e.b(s(`first argument`,o,`which is not in its domain`));return Zh(c,t.scope,o)}let l=ui(o),u=typeof i.domain==`object`&&i.domain.kind===`ProductSet`?i.domain.factors:[],d=()=>new e.b(`In applying the function\n${M(R(i))},\nthe argument list is:\n${M(R(o))}\nwhich does not match its formal parameter.\n`);if(l===void 0||(c.forEach((t,n)=>{if(n>=l.length)throw d();let r=l[n],i=`argument number ${n+1}`;if(!hi(r,u[n]))throw new e.b(s(i,r,`${t.pattern.kind===`Name`?``:`
|
|
1782
|
-
`}which is not in its domain`));if(t.pattern.kind===`Tuple`&&ui(r)?.length!==t.pattern.names.length)throw new e.b(s(i,r,`which does not match its formal parameter`))}),l.length>c.length))throw d();return Zh(c,t.scope,o)},ng=(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)}},rg=(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}},ig=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},ag=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),og=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),sg=(e,t)=>{let n=Xh(e.bounds,t),r=ig(n,(n,r)=>W(e.body,jh(t,Zh(e.bounds,Dh(void 0,e.name,r),n))),rg(ng(e.bounds,e.body),e.bounds,n),ag(e.bounds));$h({value:r,bounds:e.bounds,body:e.body,scope:Dh(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=sg(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?jn(i):i},cg=(t,n)=>{if(typeof n!=`object`||An(n)!==`lambda`||t.kind===`Operator`||t.isSelfReferential||n.kind!==`LazyFunction`||!Mt(n.domain))return n;try{let e=L(n);return Dn(e.domain,e.range)}catch(t){if(t instanceof e.b)return n;throw t}},lg=(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=>sg(t,e):Jg(og(t),n):Jg(t.body,n),ug=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=lg(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(jh(e,void 0)):e=>a[i]??r(jh(e,void 0));return t.definitionEvaluators.set(e,o),o},dg=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},fg=(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)||!wu(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(()=>cg(t,lg(t,n)(a)));dr(e),n.startupValues[i]=e}catch(t){if(!(t instanceof e.b)&&!e.tt(t))throw t}}),pg=(t,n)=>{if(n===void 0||t===n)return!0;try{return n.every((e,n)=>e===void 0||t?.[n]!==void 0&&Rn(t[n],e))}catch(t){if(t instanceof e.b)return!1;throw t}},mg=(e,t)=>{let n=e.cache;if(n!==void 0&&pg(t.state,e.state)&&pg(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?fo(r,i,()=>W(e.expression,jh(t,e.scope))):W(e.expression,jh(t,e.scope));return(!e.isStreamed||$r(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},hg=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),gg=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return gg(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?hg(r):t.builtins.get(e)},_g=(e,t)=>j(e)?vg(e.operator,t):gg(e.operator,t.environment)??vg(e.operator,t),vg=(e,t)=>{let n=Eh(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return gg(e,t.environment)},yg=e=>e.kind===`Closure`?e.params.length:e.arity,bg=(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:vg(r,n);if(!i)throw new e.b(`Expected an operator argument at ${fh(t)}`);return i},xg=(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)=>Dh(e,n.name,t[r]),e.scope);return W(e.body,jh(n,r))},Sg=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:yg(e),call:n=>xg(e,n,t)},Cg=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=vg(e.name,t);return n!==void 0&&yg(n)>0},wg=(e,t)=>e.map(e=>Cg(e,t)?Sg(bg(e,t),t):W(e,t)),Tg=(t,n)=>new e.b(`Operator ${t.name} expects ${t.params.length} arguments but received ${n}`),Eg=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),Dg=(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 Dg(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([])}},Og=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Lt(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=Eg(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=j(e)?void 0:Dg(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=Eh(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:Eg(e,t)}}return t=>Eg(e,t)},kg=(e,t,n,r)=>{if(t.length!==e.params.length)throw Tg(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:bg(t[a],n)}:(r?.[a]??Og(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},Ag=(e,t,n,r)=>e.kind===`Closure`?W(e.body,jh(n,kg(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(Zg(t,n),n):e.evaluate(wg(t,n),n),jg=/* @__PURE__ */ new WeakMap,Mg=e=>{let t=jg.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return jg.set(e,n),n},Ng=(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:Mg(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},Pg=(t,n,r)=>{let i=Eh(r.scope,t);if(i?.kind===`Value`)return i.value;if(i?.kind===`Thunk`)return mg(i,r);if(i?.kind===`Operator`){if(yg(i.operator)===0)return xg(i.operator,[],r);throw new e.b(`Operator ${t} is used without arguments`)}let a=Dg(t,r.environment);if(a?.kind===`Variable`){let e=r.state?.[a.index];if(e===void 0)throw wh(t,n);return e}if(a?.kind===`Value`)return a.value;if(a?.kind===`Definition`)return ug(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 ${fh(n)}`)},Fg=(e,t)=>({impure:new Set(e.filter(e=>Du(e,t))),streamed:new Set(e.filter(e=>Du(e,t,`streamed`)))}),Ig=e=>[...e.facts.ids.keys()].some(t=>Du(t,e)),Lg=e=>[...e.facts.ids.keys()].some(t=>Du(t,e,`repeated`)),Rg=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,zg=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),Bg=e=>t=>{let n=e(t);return Rn(n,e(zg(t)))},Vg=(t,n,r,i)=>a=>{i.expressions.push(t);let o=fi.sets,s=fi.callStack,c=o??[],l=c.length;fi.sets=c,fi.callStack=i;try{let e=n(a),o=Rg(e)?e.rebind(r):e;return i.values.set(t,o),typeof o==`object`&&o.kind!==`FilteredSet`&&uh(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=dh(t,i.values),o=a&&!ze(t).some(e=>e===r)?i.values.get(a):void 0,s=t.kind===`FunctionApplication`&&o!==void 0&&!Nt(o)?void 0:o;throw Hg(i,[s,...c.slice(l).filter(e=>e!==s)],n),n}finally{i.isFrozen||i.expressions.pop(),c.length=l,fi.sets=o,fi.callStack=s}},Hg=(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},Ug=(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}},Wg=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}}),Gg=(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)}},Kg=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=lo(n,i,e);uo(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}},qg=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=x_(e,t),i=t.callStack,a=i&&Uc.get(e),o=i?Vg(e,r,t,i):r,s=i&&a?Gg(e,a,o,i):o,c=t.coverage,l=c?Kg(e,s,c):s;return t.evaluators.set(e,l),l},Jg=(e,t)=>{if(t.callStack||t.coverage)return qg(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=Cs(e,t)??qg(e,t);return t.entryEvaluators.set(e,r),r},W=(e,t)=>Jg(e,t.environment)(t),Yg=(e,t)=>{let n=e.name,r=j(e)?void 0:Dg(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw wh(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??=ug(e,t))(r)}return t=>Pg(n,e,t)},Xg=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||j(e))return!0;let n=gg(e.name,t);return n===void 0||yg(n)===0},Zg=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),Qg=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Zg(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Xg(t[0],n)){let e=qg(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Xg(t[0],n)&&Xg(t[1],n);if(i&&a){let e=qg(t[0],n),r=qg(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(wg(t,n),n)},$g=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw Tg(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Og(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:bg(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},e_=(e,t,n)=>{let r=$g(e,t,n),i;return t=>(i??=Jg(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},t_=(t,n)=>{let r=t.args;if(t.operator===`=>`){let e=qg(r[0],n),i=qg(r[1],n);return n=>!Nh(e(n),t,`P`)||Nh(i(n),t,`Q`)}if(t.operator===`~`&&r.length===1){let e=qg(r[0],n);return n=>Ph(e(n),t)}if(t.operator===`<=>`){let e=qg(r[0],n),i=qg(r[1],n);return n=>Fh(e(n),i(n),t)}if(t.operator===`~>`||t.operator===`-+->`)return()=>{throw mh(t.operator===`~>`?`a ~> b`:`a -+-> formula`,t)};let i=j(t)?void 0:gg(t.operator,n);if(i?.kind===`Closure`)return e_(i,r,n);if(i?.kind===`Builtin`&&i.name===`DOMAIN`){let e=qg(r[0],n),i=bh(t);return t=>i(e(t))}if(i?.kind===`Builtin`&&i.name===`TLCEval`&&r.length===1){let e=!Hc.has(t)&&!ju(r[0],n);return t=>i.evaluate(Zg(r,t),e&&t.scope===void 0?void 0:t)}if(i?.kind===`Builtin`&&i.name===`\\subseteq`&&r.length===2){let e=qg(r[0],n),a=qg(r[1],n),o=xh(t,i);return t=>o(e(t),a(t))}if(i?.kind===`Builtin`)return Qg(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=>Og(e,n));return i=>{let o=vg(t.operator,i);if(o)return Ag(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 ${fh(t)}`)}},n_=(e,t)=>{let n=e.kind===`Forall`,r=qg(e.body,t),i=e.bounds[0];if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=qg(i.set,t);return s=>Gh(Uh(o(s),i.set,t.runtime.version),t=>Ih(r(jh(s,Dh(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=Kh(a,e=>Uh(qg(e,t)(o),e,t.runtime.version)),c=(t,a)=>t<0?Ih(r(jh(o,a)),e)!==n:Gh(s[t],e=>c(t-1,Dh(a,i[t],e)));return c(a.length-1,o.scope)?!n:n}}return t=>Yh(a,t,i=>Ih(r(jh(t,i)),e)!==n)?!n:n},r_=(e,t)=>{if(e.kind===`Tuple`)return Nr(e.names.map(e=>{let n=Eh(t,e);return n?.kind===`Value`&&n.value}));let n=Eh(t,e.name);return n?.kind===`Value`?n.value:void 0},i_=/* @__PURE__ */ new WeakSet,a_=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&i_.add(e)},o_=/* @__PURE__ */ new WeakMap,s_=e=>{if(o_.has(e))return o_.get(e);let t=/* @__PURE__ */ new Set,n=e=>{if(e.kind===`Subexpression`)return!1;let r=Be(e);return r!==void 0&&t.add(r),e.kind===`ExceptAt`&&t.add(`@`),ze(e).every(n)},r=n(e)?[...t]:void 0;return o_.set(e,r),r},c_=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=Eh(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),l_=e=>i_.has(e),u_=(t,n)=>{let r=l_(t),i=qg(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(jh(t,Dh(t.scope,n,e)));if(At(e))return ai(e),jt(e,r),f(e,t);let a=jr(e),s=Dn(a,a.map(r));return Mt(e)?s:(s.lambdaDomain=e,jn(s))}let n=[],r=Kh(a,e=>Wh(W(e,t),e,t.environment.runtime.version));return Jh(a,r,t.scope,e=>{let r=a.length===1?r_(o.pattern,e)??!1:Nr(a.map(t=>r_(t.pattern,e)??!1));return n.push([r,i(jh(t,e))]),!1}),Sr(n)},l=ng(a,t.body),u=ag(a),d=s_(t.body),f=(e,n)=>{let r=c_(n.scope,d),o=jh(n,r),s=$h({value:ig(e,e=>i(jh(o,Zh(a,r,e))),rg(l,a,e),u),bounds:a,body:t.body,scope:r});return a.length===1?jn(s):s},p=n.callStack;return{build:(n,i)=>{if(t.isRecursive||r||i.isKeepLazy||!F(n))return f(n,i);if(!(a.length===1?Mt(n):typeof n==`object`&&n.kind===`ProductSet`&&n.factors.every(Mt))){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 Ug(p,t,e),e}},createLazy:f}},d_=(e,t)=>{let n=u_(e,t).build,r=e.bounds;if(r.length===1&&r[0].pattern.kind===`Name`){let e=qg(r[0].set,t);return t=>n(e(t),t)}return e=>n(Xh(r,e),e)},f_=(e,t)=>{let n=i_.has(e);n&&a_(e.function);let r=qg(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=>qg(e,t))}),value:qg(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Nr(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(jh(i,Dh(i.scope,`@`,e))):Fi(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i=!1;n=o(n,r.path,0,t,e=>(i=!0,r.value(e))),i||t.environment.runtime.warn(qe.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${U(e.function)}`)}return n}},p_=(t,n)=>{let r=qg(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=hh(t.predicate),c=n.coverage,l=(e,t,n)=>{if(!c||e===-1)return n();t||c.secondary[e]++;let r=fo(c,t?-1:e,n);return!t&&r===!0&&c.secondary[e]++,r},u=(n,r,a,c)=>({kind:`FilteredSet`,base:n,test:(t,n)=>{if(i.kind===`Tuple`&&ui(t)?.length!==i.names.length)throw new e.b(`Attempted to check if the value:\n${M(R(t))}\nis an element of a set of ${i.names.length}-tuples.`);let o=l(c,n,()=>a(jh(r,Oh(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},qg(t.predicate,e),-1)});return(e,t,n=-1)=>u(e,t,r,n)},m_=(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 ${qo(t)}.\n${hh(n.predicate)}`);return t},h_=(t,n,r,i)=>{if(!P(t)||pn(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${U(n)}`);return fr(t),Wh(t,r,i)},g_=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${U(t)}`),__=(t,n)=>{if(t.kind===`SetFilter`){let e=qg(t.predicate,n),r=qg(t.bound.set,n),i=p_(t,n),a=t.bound.pattern,o=n.coverage;return n=>{let s=r(n);if(!Mt(s))return i(s,n,o?.current);let c=[],l=r=>{let i=e(jh(n,Oh(n.scope,a,r)));m_(i,t)&&kt(c,r)},u=s.kind===`Interval`?s:I(s).elements;return jt(u,l),o&&o.current!==-1&&(o.secondary[o.current]+=(Array.isArray(u)?u.length:u.high-u.low+1)+c.length),En(c)}}if(t.kind===`SetMap`){let e=qg(t.expression,n);return n=>{let r=[];return Yh(t.bounds,n,t=>(kt(r,e(jh(n,t))),!1)),_r(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${U(t)}`)};let i=qg(t.body,n),a=qg(r,n);return n=>{let o=h_(a(n),t,r,n.environment.runtime.version),s,c=t.pattern;if(Gh(o,r=>{if(c.kind===`Tuple`&&ui(r)?.length!==c.names.length)throw new e.b(`Attempted to compute the value of an expression of form\nCHOOSE <<x1, ... , xN>> \\in S: P, but S was not a set\nof N-tuples.\n${U(t)}`);let a=Oh(n.scope,c,r);return Ih(i(jh(n,a)),t)?(s=r_(c,a),!0):!1}),s===void 0)throw g_(t);return s}},v_=e=>[...e].sort((e,t)=>bn(e.name,t.name)),y_=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),b_=(e,t)=>{let n=v_(e),r=y_(n),i=n.map(e=>qg(e.value,t));if(r)return e=>Pr(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=>Ut(a,i.map(t=>t(e)),o):e=>Fr(a,i.map(t=>t(e)))},x_=(t,n)=>{let r=e=>qg(e,n);switch(t.kind){case`Number`:{let e=t.value;return Lt(e)?()=>e:()=>{throw Ch(t)}}case`Decimal`:return()=>{throw Sh(t)};case`String`:{let e=t.value;return()=>e}case`Identifier`:return Yg(t,n);case`Apply`:return t_(t,n);case`Bracket`:return()=>{throw new e.b(`A bracket without a function or subscript is not an expression at ${fh(t)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new e.b(`An operator cannot be used as a value at ${fh(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 _h(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 _h(t,r,i);if(i)return!0}return!1}}case`Prime`:{let e=r(t.expression);return t=>e(zg(t))}case`Unchanged`:return Bg(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 gh(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 (${qo(n)}) was used as a condition of a CASE. ${hh(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${U(t)}`)}}case`Let`:{let e=r(t.body);return n=>e(jh(n,Ng(t.definitions,n)))}case`Forall`:case`Exists`:return n_(t,n);case`UnboundedQuantifier`:return()=>{let n=t.quantifier===`Forall`?`\\A`:`\\E`;throw t.isTemporal?mh(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${U(t)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return __(t,n);case`SetEnumeration`:{let e=t.elements.map(r);return t=>_r(e.map(e=>e(t)))}case`Tuple`:{let e=t.elements.map(r);return t=>Nr(e.map(e=>e(t)))}case`FunctionConstruction`:return d_(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 b_(t.fields,n);case`RecordSet`:{let e=v_(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 f_(t,n);case`ExceptAt`:return n=>{let r=Eh(n.scope,`@`);if(r?.kind!==`Value`)throw new e.b(`@ appears outside an EXCEPT at ${fh(t)}`);return r.value};case`FunctionApplication`:{a_(t.function);let e=r(t.function),i=n=>kh(e(Ah(n)),t),a=t.args.map(r),o=yh(n.runtime.version);if(a.length===1){let e=a[0];return t=>Mi(i(t),e(t),o)}return e=>Mi(i(e),Nr(a.map(t=>t(e))),o)}case`FieldAccess`:{let e=r(t.record),n=vh(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=Bg(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${U(t)}`);return a?s||i(r):s&&!i(r)}}case`Enabled`:{let e=t.expression;return t=>nh(e,t)}case`Label`:return r(t.body);case`Subexpression`:return()=>{throw new e.b(`The subexpression reference at ${fh(t)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw mh(ph[t.kind],t)}}},S_=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},C_=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Ki(e[t]),16777619),r=Math.imul(r^Qi(e[t]),1540483477);t[0]=S_(n)||1,t[1]=S_(r)},w_=()=>{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)}}},T_=e=>({slots:new Int32Array(1<<17),size:0,shift:16,states:e}),E_=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Li(t,Ki(e[n]));return t&1073741823},D_=(e,t)=>{for(let n=0;n<t.length;n++)if(!Bn(e[n],t[n]))return!1;return!0},O_=(e,t)=>Math.imul(t,2654435761)>>>e.shift<<1,k_=(e,t,n)=>{let r=e.slots.length-1;for(let i=O_(e,t);;i=i+2&r){let r=e.slots[i+1];if(r===0)return-1;if(e.slots[i]===t&&D_(e.states[r-1],n))return r-1}},A_=(e,t,n)=>{let r=e.slots.length-1,i=O_(e,t);for(;e.slots[i+1]!==0;)i=i+2&r;e.slots[i]=t,e.slots[i+1]=n},j_=(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&&A_(e,t[n],t[n+1])}A_(e,t,n+1)},M_=(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}},N_=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),P_=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return M_(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},F_=e=>Atomics.load(e.used,0)*2>=e.slots.length,I_=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&M_(t,n);return{slots:t,used:e.used}},L_={kind:`Boolean`,value:!0},R_={kind:`Boolean`,value:!1},z_=e=>e?L_:R_,B_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,V_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,H_=(e,t)=>({kind:e,body:t}),U_=(e,t,n)=>({kind:e,operands:[t,n]}),W_=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?W_(e,t.operands).operands:[t])}),G_=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return G_(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,G_(t)),0)}},K_=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 K_(e.body);case`And`:case`Or`:return e.operands.some(K_)}},q_=/* @__PURE__ */ new WeakMap;let J_=0;const Y_=e=>{let t=q_.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`#${J_++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(Y_).join(`,`)})`;default:return`${e.kind}(${Y_(e.body)})`}})();return q_.set(e,n),n},X_=(e,t)=>e===t||Y_(e)===Y_(t),Z_=(e,t)=>{let n=Y_(t);return e.some(e=>e===t||Y_(e)===n)},Q_=e=>e===`And`?`Or`:`And`,$_=(e,t)=>{switch(e.kind){case`Boolean`:return t?z_(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?H_(`Not`,e):e;case`Not`:return $_(e.body,!t);case`And`:case`Or`:return W_(t?Q_(e.kind):e.kind,e.operands.map(e=>$_(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return H_(n,$_(e.body,t))}}},ev=e=>{switch(e.kind){case`Boolean`:return z_(!e.value);case`Not`:return e.body;case`And`:case`Or`:return W_(Q_(e.kind),e.operands.map(ev));case`Always`:return H_(`Eventually`,ev(e.body));case`Eventually`:return H_(`Always`,ev(e.body));default:return H_(`Not`,e)}},tv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=tv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return z_(t)}return n.length===0?z_(!t):n.length===1?n[0]:W_(e.kind,n)}case`Not`:{let t=tv(e.body);return t.kind===`Boolean`?z_(!t.value):H_(`Not`,t)}case`Always`:case`Eventually`:{let t=tv(e.body);return H_(e.kind,t.kind===e.kind?t.body:t)}default:return e}},nv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,rv=t=>{switch(t.kind){case`And`:{let n=[],r=1;for(let i of t.operands){let t=rv(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=>W_(`And`,e))}}case`Or`:{let e=[],n=[];for(let r of t.operands){let t=rv(r);for(let r of t.kind===`Or`?t.operands:[t]){let t=nv(r);t?e.push(t):n.push(r)}}if(e.length>0){let t=e.length===1?e[0]:W_(`Or`,e);n.push(H_(`Always`,H_(`Eventually`,t)))}return W_(`Or`,n)}case`Not`:return B_(t.body)?t:rv(ev(t.body));default:return t}},iv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?iv(e.operands[0]):W_(e.kind,e.operands.map(iv));case`Not`:return e.body.kind===`Not`?iv(e.body.body):H_(`Not`,iv(e.body));case`Always`:case`Eventually`:case`Next`:return H_(e.kind,iv(e.body));default:return e}},av=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return av(e.operands[0]);let t=Math.floor(e.operands.length/2);return U_(e.kind,av(W_(e.kind,e.operands.slice(0,t))),av(W_(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return H_(e.kind,av(e.body));default:return e}},ov=(e,t)=>{e.kind===`Eventually`&&!Z_(t,e)&&t.push(e),`body`in e&&ov(e.body,t),`operands`in e&&e.operands.forEach(e=>ov(e,t))},sv=e=>{let t=e.filter(V_),n=e.flatMap(e=>e.kind===`Not`&&V_(e.body)?[e.body]:[]);return!t.some(e=>Z_(n,e))},cv=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,H_(`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},lv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:H_(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},uv=(e,t,n)=>e.flatMap(e=>{let r=lv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),dv=e=>[...new Set(e.map(Y_))].sort().join(`|`),fv=(e,t)=>{let n=new Set(t.map(dv));return[...e.filter(e=>!n.has(dv(e))),...t]},pv=e=>{let t=cv(e),n=uv(t,`Always`,`And`),r=uv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=lv(t,`Eventually`,`Or`);if(n&&!(Z_(e,n.first)||Z_(e,n.second)))return fv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Z_(e,t.first)||Z_(e,t.second))&&!Z_(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!sv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=lv(t[e],`Always`,`And`);n&&(Z_(t,n.first)||t.push(n.first),Z_(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)Z_(t,e.first)&&Z_(t,e.second)&&!Z_(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!sv(t)?[]:i(t)};return a(e)},mv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>G_(e)<=1)}),hv=e=>{let t=pv([e]).map(mv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=dv(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 pv(n)){let n=dv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(mv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},gv=(e,t)=>!Z_(e,t)||Z_(e,t.body),_v=(t,n)=>{if(t.kind===`Eventually`&&t.body.kind===`Always`&&G_(t.body.body)<3){n.eventuallyAlways.push(t.body.body);return}let r=nv(t);if(r){let e=G_(r);if(e<=1){n.infinitelyOftenStates.push(r);return}if(e===2){n.infinitelyOftenActions.push(r);return}}if(K_(t))throw new e.b(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);n.formulas.push(t)},vv=(e,t)=>{let n=e.findIndex(e=>X_(e,t));return n===-1?(e.push(t),e.length-1):n},yv=e=>{let t=rv(tv($_(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=iv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])_v(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:W_(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:X_(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&av(e.formula),n=[];t&&ov(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>vv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>vv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>vv(i,e))}));return{tableau:t&&hv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},bv=()=>e.at(new e.b(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.nt.livenessEvaluationFailure),xv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Sv=/* @__PURE__ */ new WeakSet,Cv=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),wv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Tv=(t,n)=>new e.b(`TLC cannot handle the temporal formula ${U(t)}${n===void 0?``:`:\n${n}`}`),Ev=(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=Ev(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=Eh(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=Lh(e,n);if(t)return Ou(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:j(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return Zc(e,(e,o)=>(a=Math.max(a,Ev(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(xv.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=j(e)?void 0:gg(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,kg(o,e.args,wv(n,t)))}default:return l(e)}},Dv=(t,n)=>{try{return qh(t,n)}catch(t){if(!(t instanceof e.b))throw t;if(!it(t))return;throw e.at(new e.b(`${e.W}${t.message}`),e.nt.error)}},Ov=(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)=>Ov(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,U(e)));if(t.kind===`Label`)return o(t.body,n);if(t.kind===`Let`)return o(t.body,kv(t,n,r));if(t.kind===`Identifier`){let i=j(t)?Eh(n,t.name):void 0;if(i?.kind===`Thunk`&&!i.isReleased)return o(i.expression,i.scope,Sv.has(i)?t.name:a.name);let s=r.constants.has(t.name)?void 0:Lh(t.name,r);if(!i&&s?.kind===`Operator`&&s.params.length===0&&(Ou(s,r)>0||dg(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=wv(r,n);if(t.kind===`Apply`&&r.runtime.version!==`1.7.4`&&(i||Ev(t,n,r)===3)){let e=_g(t,s),n=j(t)?void 0:Lh(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,kg(e,t.args,s),a.isSubstituted&&n?n.name:t.operator,a.expanding,n)}let c=i&&t.kind===`Forall`&&t.bounds.every(e=>Ev(e.set,n,r)===0),l=c?Dv(t.bounds,s):void 0;if(c&&l){let e=[];if(Jh(t.bounds,l,n,n=>(e.push(...o(t.body,n,U(t.body))),!1)),e.length===0)throw bv();return e}return[{expression:t,scope:n,name:a.name,path:a.path}]},kv=(e,t,n)=>{let r=Ng(e.definitions,wv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Sv.add(e.binding);return r},Av=(t,n,r)=>{let i=r.runtime.version===`1.7.4`,a=(t,n,a)=>{let o=a===0&&!i?Ev(t,n,r):a;if(o===0){let i=W(t,wv(r,n));if(typeof i!=`boolean`)throw new e.b(`TLC expected a boolean value, but did not find one. ${hh(t)}`);return z_(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=f(t,n);o--;let l=G_(c),u=l===0&&Ev(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=wv(r,t),o=j(e)||Lh(n,r)===void 0?Eh(t,n):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&Sv.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:j(e)?vg(n,a):gg(n,r),u=e.kind===`Apply`?e.args:[],p=c?.kind===`Builtin`&&u.length===2?Cv.get(c.name):void 0;if(p){let n=u.map(e=>f(e,t));return d(e,t,W_(p,n))}if(c?.kind!==`Closure`)throw Tv(e);let m=!j(e)&&Lh(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,kg(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:Tv(t)}},u=(t,n)=>{let i=Ev(t,n,r),o=[],s=t.kind===`Forall`;try{Yh(t.bounds,wv(r,n),e=>(o.push(f(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 Tv(t,s&&!it(r)?r.message:void 0)}return o.length===0?z_(s):d(t,n,W_(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=G_(n);return r>2?n:a(e,t,r)},f=(e,t)=>{let n=Ev(e,t,r);switch(e.kind){case`Label`:return f(e.body,t);case`Let`:return f(e.body,kv(e,t,r));case`Apply`:{let n=e.args;if(e.operator===`~`&&!j(e))return d(e,t,H_(`Not`,f(n[0],t)));if(e.operator===`=>`)return d(e,t,U_(`Or`,H_(`Not`,f(n[0],t)),f(n[1],t)));break}case`And`:case`Or`:return d(e,t,W_(e.kind,e.operands.map(e=>f(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&Ev(e.condition,t,r)===0){let n=W(e.condition,wv(r,t));if(typeof n==`boolean`)return f(n?e.consequent:e.alternative,t)}let n=f(e.condition,t);return d(e,t,U_(`Or`,U_(`And`,n,f(e.consequent,t)),U_(`And`,H_(`Not`,n),f(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===`~>`?H_(`Always`,U_(`Or`,H_(`Not`,f(e.args[0],t)),H_(`Eventually`,f(e.args[1],t)))):c(e,t);case`Always`:case`Eventually`:return H_(e.kind,f(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=H_(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?H_(`Always`,H_(`Eventually`,U_(`Or`,i,a))):U_(`Or`,H_(`Eventually`,H_(`Always`,i)),H_(`Always`,H_(`Eventually`,a)))}default:throw Tv(e)}};return f(t,n)},jv=t=>({holdsState:(n,r)=>{let i={environment:t,scope:n.scope,state:r,next:void 0},a=n.kind===`State`?W(n.expression,i):nh(n.step,i);if(typeof a!=`boolean`)throw new e.b(`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&&pr(W(o,{environment:t,scope:a,state:r,next:void 0}),W(o,{environment:t,scope:a,state:i,next:void 0})))return!1;let s=W(n.expression,{environment:t,scope:a,state:r,next:i});if(typeof s!=`boolean`)throw new e.b(`Encountered an action predicate that's not a boolean.`);return s}}),Mv=(t,n,r,i,a)=>{let o=e=>Mv(e,n,r,i,a);switch(t.kind){case`Boolean`:return t.value;case`State`:case`Enabled`:{let e=a.get(t);if(e!==void 0)return e;let r=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 Mv(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`)}},Nv=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>Nv(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return Mv(e,t[r],t[a(r)],jv(i),/* @__PURE__ */ new Map)}},Pv=`UnnamedAction`,Fv={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},Iv=e=>{let t=e.range??Fv;return Pr([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Lv=(e,t)=>{let n=[[`name`,e.name],[`location`,Iv(e.location)]];return e.parameters.length>0&&n.push([`context`,Pr(e.parameters)],[`parameters`,Nr(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),Pr(n)},Rv=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),zv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Bv=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,Vv=e=>e.kind===`Apply`?e.args:[],Hv=(e,t,n)=>{let r=Bv(e);if(r===void 0)return;if(j(e)){let e=Eh(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=gg(r,n);return i?.kind===`Closure`?i:void 0},Uv=(t,n)=>{try{return W(t,zv(n,void 0)),!0}catch(t){if(t instanceof e.y)return!1;throw t}},Wv=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&wu(e,t)&&Uv(e.body,t),Gv=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&Wv(e,t),Kv=(e,t)=>{let n=Lh(e.name,t);return n?.body===e.body&&Gv(n,t)},qv=(e,t)=>{if(e.kind!==`Identifier`||!j(e))return;let n=Eh(t,e.name);return n?.kind===`Thunk`?n:void 0},Jv=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:Ng(e.definitions,zv(n,t))};let r=qv(e,t);return r&&{expression:r.expression,scope:r.scope}},Yv=(e,t,n,r)=>t.kind===`Apply`?kg(e,t.args,zv(r,n)):e.scope,Xv=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Eh(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Zv=(t,n)=>{try{return t()}catch(t){if(t instanceof e.y)return n();throw t}},Qv=(e,t,n,r,i)=>{let a=Vv(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=>Ev(e,n,i)!==0)?o():Zv(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,zv(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},$v=(t,n,r,i,a)=>{let o=()=>({name:r?.name??Pv,location:t.location,parameters:Xv(r,n),expression:t,scope:n});if(Gp.has(t.kind))throw e.at(new e.b(`${e.G}The next state relation is not a boolean expression.\n${hh(t)}`),e.nt.error);switch(t.kind){case`Let`:return $v(t.body,Ng(t.definitions,zv(i,n)),r,i,a);case`Label`:return $v(t.body,n,r,i,a);case`Or`:return t.operands.flatMap(e=>$v(e,n,r,i,a));case`Exists`:return Zv(()=>{let e=[];return Yh(t.bounds,zv(i,n),n=>(e.push(...$v(t.body,n,r,i,a)),!1)),e.length===0?[o()]:e},()=>[o()])}let s=j(t)?void 0:a.get(Bv(t)??``),c=Hv(t,n,i);if(s)return Qv(s,t,n,c,i);if(!c)return[o()];let l=Vv(t),u=j(t)?c.name:i.instanceNames.get(Bv(t)??``)??c.name,d=()=>[{name:u,location:t.location,parameters:[],expression:t,scope:n}];return Kv(c,i)||l.some(e=>Ev(e,n,i)!==0)?d():Zv(()=>{let e=l.reduce((e,t,r)=>({name:c.params[r].name,binding:{kind:`Value`,value:W(t,zv(i,n))},parent:e}),c.scope);return $v(c.body,e,{...c,name:u},i,a)},d)},ey=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>ey(e,t,n,r,i,o),s=(e,t,n)=>Rv(e,Wc(t,a),n),c=Jv(e,t,n);if(c){o(c.expression,c.scope);return}let l=Hv(e,t,n);if(l&&Kv(l,n))return;let u=l?[...a,...Uc.get(l.body)??[]]:a;if(l&&l.params.length===0){if(Ev(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,kg(l,e.args,zv(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(Pv,e,t));return}let d=Ev(e,t,n);d<=1?r.inits.push(s(Pv,e,t)):d===3&&r.temporals.push(s(Pv,e,t))},ty=(e,t,n,r,i)=>{let a=(t,n)=>ty(e,t,n,r,i),o=Jv(t,n,r);if(o){a(o.expression,o.scope);return}let s=Hv(t,n,r);if(s&&Kv(s,r))return;if(s&&s.params.length===Vv(t).length){a(s.body,Yv(s,t,n,r));return}if(t.kind===`Forall`&&Zv(()=>(Yh(t.bounds,zv(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(Rv(e,a)):Ev(a,n,r)<2?i.invariants.push(Rv(e,a)):i.impliedTemporals.push(Rv(e,t));return}let c=Ev(t,n,r);c<=1?i.impliedInits.push(Rv(e,t)):c===3&&i.impliedTemporals.push(Rv(e,t))},ny=(e,t)=>{let n=Lh(e,t);return n?.kind===`Operator`&&!Gv(n,t)?n:void 0},ry=(e,t,n)=>{let r={inits:[],actions:[],temporals:[]},i=[],a=e.specification===void 0?void 0:ny(e.specification,t);a&&(ey(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:Pv,location:e.frames[0].location,parameters:[],expression:Wc(e.expression,e.frames),scope:e.scope}]:$v(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:gg(e.init,t);o?.kind===`Closure`&&r.inits.push(Rv(e.init??``,o.body));let s=e.next===void 0?void 0:gg(e.next,t);return s?.kind===`Closure`&&r.actions.push(...$v(s.body,s.scope,s,t,n)),r},iy=(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=Jv(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&j(e)?Eh(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!j(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=Hv(e,t,n);if(!s||s.params.length!==Vv(e).length)return!0;let c=Lh(s.name,n);return c?.body===s.body&&Wv(c,n)?!0:i(s.body,Yv(s,e,t,n))};return i(e,t)?r:void 0},ay=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>R(e[1])).join(`,`)})`,oy=(t,n,r=!1)=>`${t.name===Pv?r?`Initial predicate`:`Action`:t.name}${n===`1.7.4`?``:ay(t)} ${e.X(t.location.range??Fv)}`,sy=e=>`${e.name}${ay(e)}`,cy=(e,t,n,r)=>{let i={invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]};t.invariants.forEach(e=>{let t=ny(e,n);t&&i.invariants.push(Rv(e,t.body))}),t.properties.forEach(e=>{let t=ny(e,n);t&&ty(e,t.body,void 0,n,i)});let a=n.coverage,o=(e,t)=>gr(e.map(e=>{let n=a&&t&&Oo(a,t,e.expression);return Lv(e,n&&Pr(n))})),s=e=>gr(e.flatMap(e=>{let t=ny(e,n);return t?[Pr([[`name`,t.name],[`location`,Iv(t.location)]])]:[]}));return Pr([[`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`,gr(n.variables.map((e,t)=>Pr([[`name`,e],[`location`,Iv(r[t])],...a?[[`coverage`,Pr([[`distinct`,go(a,t)]])]]:[]])))],[`actionconstraints`,s(t.actionConstraints)],[`constraints`,s(t.constraints)]])},ly=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return ly(e.body);case`And`:case`Or`:return e.operands.some(ly);default:return!1}},uy=e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0,dy=e=>e.promises.some(e=>ly(e.body))||e.models.some(e=>!uy(e)),fy=(e,t)=>e.every((e,n)=>Bn(e,t[n])),py=e=>e.filter((t,n)=>n===0||e[n-1]!==t),my=e=>({data:e(1024),length:0,create:e}),hy=(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)},gy=(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}},_y=e=>new Int32Array(e).fill(-1),vy=(e,t)=>(e.edgeStarts[t]??-1)!==-1,yy=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},by=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,xy=(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),Sy=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},Cy=2**53-1,wy=(e,t,n)=>{let r=t.map(e=>Av(e.expression,e.scope,n)),i=e.map(e=>H_(`Not`,Av(e.expression,e.scope,n))),a=i.length===1?i[0]:W_(`Or`,i);return{formula:r.length===0?a:W_(`And`,[...r,a]),negations:i}},Ty=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}]:[])}},Ey=(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=>Ey(e,t));return;default:Ey(e.body,t)}},Dy=e=>{let t=/* @__PURE__ */ new Set;for(let n of e)[...n.stateChecks,...n.actionChecks,...n.tableau?.nodes.flatMap(e=>e.statePredicates)??[]].forEach(e=>Ey(e,t));return[...t]},Oy=e=>Dy(e).flatMap(e=>Ty(e).map(e=>e.expression)),ky=(e,t,n,r)=>{if(e.length===0)return;let i=wy(e,t,n),a=/* @__PURE__ */ new Set;Ey(i.formula,a);let o=[...a].flatMap(Ty),s=o.every(e=>e.scope===void 0)?!Eu(o.map(e=>e.expression),n,`repeated`):!Lg(n),c={environment:n,atoms:jv(n)},l=yv(i.formula),u=Ay(l,{atoms:{holdsState:(e,t)=>c.atoms.holdsState(e,t),holdsAction:(e,t,n)=>c.atoms.holdsAction(e,t,n)},isShared:s,isSame:fy,evaluateFrom:(e,t)=>{n.runtime.setLivenessSource(e);try{return t()}finally{n.runtime.setLivenessSource(void 0)}}},r,n.runtime.version!==`1.7.4`),d=(e,t)=>{if(e===void 0)return t();c.atoms=jv(e);try{return t()}finally{c.atoms=jv(n)}};return{branches:u.branches,solutions:l,addInitialState:(e,t,n)=>d(n,()=>u.addInitialState(e,t)),addState:(e,t,n,r)=>d(r,()=>u.addState(e,t,n)),storeState:u.storeState,findViolation:u.findViolation,getViolatedProperties:(t,r)=>[...new Set(e.filter((e,a)=>!Nv(i.negations[a].body,t,r,0,n)).map(e=>e.name))]}},Ay=(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.b(`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=Y_(e),n=a.get(t)??a.size;return a.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:my(e=>new Int32Array(e)),edgeActions:my(e=>new Uint8Array(e)),stateResults:my(e=>new Uint8Array(e)),initial:[],firstNodes:my(_y),lastNodes:my(_y),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],errorNode:void 0})),y=(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}),b=(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]}}),x=(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},ee=(e,t,n,r,i,a)=>l(n,()=>x(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},ne=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=gy(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},S=(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),gy(i,e[t]-1,e[t+1]))}if(i.slots.set([t+1,n,r],gy(i,t,n)),t<0)return r;let a=e.lastNodes.data[t]??-1;return a===-1?hy(e.firstNodes,t,[r]):e.nextSiblings[a]=r,hy(e.lastNodes,t,[r]),r},re=(e,t,n)=>S(e,t,n,xy(e,t,n)),C=(e,t,n,r,i,a)=>{let o=e.edgeTargets.length,s=e.solution.actionChecks.length;hy(e.edgeTargets,o,n),i.forEach((t,n)=>hy(e.edgeActions,(o+n)*s,r,t*s,s)),hy(e.stateResults,e.nodeStates[t]*a.length,a),e.edgeStarts[t]=o,e.edgeCounts[t]=n.length},w={slots:/* @__PURE__ */ new Int32Array},T=(e,t,i)=>{let a=[...i,{index:e,state:t}],s=16*o;w.slots=w.slots.length===s?w.slots.fill(0):new Int32Array(s);let c=e=>{let t=w.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>=w.slots.length>>1){let e=w.slots;w.slots=new Int32Array(2*e.length+1);for(let t of e)t!==0&&c(t-1)}c(e)&&l++}w.slots.length>s&&o++;let u=[];for(let e of w.slots)e!==0&&u.push(a[e-1]);return u},E=(e,t,n,i,o,s,c)=>{let l=y(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&&b(e,i,n,s,c,n,h(1),0,g,0);for(let r of u.successors){if(!ee(e,r,i,n,s,c))continue;if(te(t,r)&&e.errorNode===void 0&&e.solution.models.some(uy)){e.errorNode=o;return}let a=ne(e,i,r);if(a!==void 0&&p.includes(a))continue;let l=a??re(e,i,r);p.push(l),f.push(0),a===void 0&&E(e,t,n,i,l,s,c)}let _=r.getSuccessors(i,n),v=new Uint8Array((_.length+1)*d);v.set(g);let x=h(_.length);_.forEach((r,o)=>{let l=m(1);b(e,i,n,s,c,r.state,x,o*a.size,v,(o+1)*d);let h=e.isDone[r.index]===!0;for(let n of u.successors){if(!ee(e,n,i,r.state,l,0))continue;let a=ne(e,r.index,n);if(a!==void 0&&p.includes(a))continue;let s=a??re(e,r.index,n);p.push(s),f.push(o+1),a===void 0&&h&&E(e,t,r.state,r.index,s,l,0)}}),p.length>0&&C(e,o,p,v,f,l)},ie=(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++)x(e,i,n[t].state,r,t*s)&&(c[i*n.length+t]=1)}),e.isDone[o]=!0;for(let l of Sy(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=ne(e,i.index,f);if(l!==void 0&&o.includes(l))continue;let p=l??re(e,i.index,f);o.push(p),u.push(a),l===void 0&&d&&E(e,t,i.state,i.index,p,r,a*s)}}),C(e,l,o,i,u,a)}return e.errorNode===void 0?void 0:se(e,e.errorNode)},ae=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)xy(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,n)=>{vy(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n))}),C(e,i,a,n,o,r)},oe=(t,n)=>{if(t.initial.includes(n))return[n];let r=/* @__PURE__ */ new Map,i=[];for(let e of t.initial)vy(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 yy(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}vy(t,e)&&!r.has(e)&&(r.set(e,a),i.push(e))}}throw new e.b(`Couldn't re-create liveness trace (path) starting at: ${n}`)},se=(e,t)=>py(oe(e,t).reverse().map(t=>e.nodeStates[t])),ce=(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=>vy(t,e)),l=[],u=e=>{let n=yy(t,e).indexOf(e);return n!==-1&&o(e,n)},d=(e,n)=>r.tableau!==void 0&&gv(r.tableau.nodes[t.nodeTableaux[e]].particle,n),f=e=>{let i=l.pop()??e;if(i===e&&!u(i)){s[i]=Cy;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]=Cy,n===e)break}let m=n.infinitelyOftenStates.every(e=>[...c].some(n=>by(t,n,e))),h=n.infinitelyOftenActions.every(e=>[...c].some(n=>yy(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=se(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,y=e=>{u.push(v),v=e};for(;_>0;){let i=_;for(;n.infinitelyOftenStates.forEach((e,n)=>{!p[n]&&by(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(yy(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?(y(e),f.clear(),!0):(s.has(e)&&!f.has(e)&&(l=e),!1)}))break;if(_<i){y(r),f.clear();break}for(;l===-1;){let n=u.pop();if(n===void 0)throw new e.b(`TLC failed to build the counterexample of a liveness property`);v=n,l=yy(t,n).find(e=>s.has(e)&&!f.has(e))??-1}y(l),f.add(l)}}let b=m(i,v,c);for(let e=u.length-1;e>=0;e--){let n=t.nodeStates[u[e]];b[b.length-1]!==n&&b.push(n)}let x=l[l.length-1];return b[b.length-1]===x&&b.pop(),{prefix:l.slice(0,-1),cycle:[x,...b.reverse()],isCycleConstrained:dy(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 yy(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.b(`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++;yy(t,a).forEach((e,r)=>{vy(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++)ee(r,a,void 0,t,n,0)&&r.initial.push(ne(r,e,a)??re(r,e,a))}},addState:(e,t,n)=>{let r=T(e,t,n),i=m(r.length),o=r.findIndex(t=>t.index===e)*u.size,s=h(r.length);for(let n of v){let c=n.checks.actions.length,l=new Uint8Array(r.length*c);r.forEach((r,u)=>b(n,e,t,i,o,r.state,s,u*a.size,l,u*c));let u=y(n,e,t,i,o),d=n.solution.tableau;if(!d){ae(n,r,l,u,e);continue}let f=ie(n,d,r,i,l,u,e);if(f)return f}},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=ne(n,e,t);r!==void 0&&i.push(r)}for(let e of i.sort((e,t)=>e-t))n.nodeStates[e]=t,S(n,t,n.nodeTableaux[e],e)}},findViolation:()=>{for(let e of v)for(let t of e.solution.models){let n=ce(e,t);if(n)return n}}}},jy=t=>{switch(t.kind){case`Number`:if(!Lt(t.value))throw e.at(new e.k(`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 Cn(t.name);case`Set`:return I({kind:`MixedSet`,elements:t.elements.map(jy)})}},My=t=>{try{return jy(t)}catch(t){throw!(t instanceof e.b)||t instanceof e.k||t instanceof e.x?t:e.at(new e.b(`${e.G}${t.message}`),e.nt.error)}},Ny=(t,n,r)=>{let i=`{ ${r.map(e=>`<${[...e[0],e[1]].map(e=>R(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`)&&Rn(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:R(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},Py=t=>new e._(`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.`),Fy=(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=My(e.value);dr(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._(`The arity of the operator ${t.name} is inconsistent in the configuration file.`);r.rows.push([t.args.map(jy),jy(t.value)]),p.set(n,r)}),p.forEach(e=>c(e).forEach(t=>f(t,Ny(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._(`The configuration file substitutes for ${t} with the undefined identifier ${o}.`);if(l?.kind===`Operator`&&l.params.length!==s)throw new e._(`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._(`In the configuration file, the identifier ${a} does not appear in the specification.`);if(t.substitutions.some(e=>e.name===o))throw Py(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 Py(e.target);h(e.name,e.target,t.arity)}});let r=n.find(e=>!o(e));if(r)throw new e._(`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._(`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)),y=(e,t)=>{if(v.has(e))return{key:e,prefix:t};let r=n.copySources.get(e);return r&&y(r.source,t+r.prefix)};n.copySources.forEach((e,t)=>{let r=y(e.source,e.prefix),i=n.definitions.get(t);if(!r||!i)return;let a=i.kind===`Operator`?i.params:[],o=_l(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 b=i.filter(e=>!u.has(e)&&!m.has(e)&&!d.has(e));if(b.length>0){let t=n.order.getDeclarationOrder(`constant`).find(e=>b.includes(e))??b[0];throw new e._(`The constant parameter ${t} is not assigned a value by the configuration file.`)}return{constants:u,substitutions:m}},Iy=`tlc2/value/impl/`,Ly={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},Ry={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},zy=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)}},By=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),Vy=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],Hy=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??By.get(e[3])}${`[]`.repeat(e[1].length)}`),Uy=(e,t)=>e[e[t].first].text,Wy=(e,t)=>Uy(e,t).replaceAll(`/`,`.`),Gy=t=>{let n=zy(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===Ly.utf8?i.text=a.decode(n.readBytes(n.readUint16())):t===Ly.integer?i.value=n.readInt32():t===Ly.float?n.readUint32():t===Ly.long||t===Ly.double?(n.readBytes(8),e++):t===Ly.class||t===Ly.string||t===Ly.methodType||t===Ly.module||t===Ly.package?i.first=n.readUint16():t===Ly.methodHandle?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=Wy(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=Hy(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:zy(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()},()=>Wy(r,d.readUint16())):[],p=Vy.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=Hy(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}},Ky=(e,t)=>{let n=e[t],r=e[n.second];return{className:Uy(e,n.first),name:e[r.first].text}},qy=(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===Ly.integer)return t.value;if(t.tag===Ly.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>=Ry.iconstM1&&t<=Ry.iconst5)s.push(t-Ry.iconst0),e+=1;else if(t===Ry.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===Ry.sipush)s.push(r()<<16>>16),e+=3;else if(t===Ry.ldc)s.push(l(o[e+1])),e+=2;else if(t===Ry.ldcW)s.push(l(r())),e+=3;else if(t===Ry.dup){let t=c();s.push(t,t),e+=1}else if(t===Ry.getstatic){let t=Ky(n,r());if(t.className!==`${Iy}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===Ry.invokestatic){let t=Ky(n,r()),o=c();if(t.className!==`${Iy}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===Ry.new)s.push({className:Uy(n,r()),value:void 0}),e+=3;else if(t===Ry.invokespecial){let t=Ky(n,r()),o=c(),s=c();if(!(t.className===`${Iy}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===Ry.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()},Jy=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Gy(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:qy(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)}))}},Yy=E(`EOF`),Xy=E(`IDENTIFIER`),Zy=E(`DEFBREAK`),Qy=(e,t)=>Array.from({length:E(t)-E(e)+1},(t,n)=>E(e)+n),$y=new Set(Qy(`op_57`,`op_119`)),eb=new Set(Qy(`op_1`,`op_119`)),tb=new Set(Qy(`op_57`,`op_70`)),nb=/* @__PURE__ */ new Set([...Qy(`ACTION`,`EXCEPT`),E(`EXTENDS`),...Qy(`IF`,`SF`),E(`STATE`),...Qy(`THEN`,`WITH`),E(`US`),...Qy(`op_112`,`op_116`)]),rb=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),ib=new Map([...rb(`postfix`,160,160,!0,`[`),...rb(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...rb(`prefix`,120,120,!1,`-.`),...rb(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...rb(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...rb(`prefix`,40,40,!0,`\\lnot`),...rb(`nfix`,100,130,!0,`\\times`),...rb(`infix`,140,140,!1,`^`,`^^`),...rb(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...rb(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...rb(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...rb(`infix`,100,110,!0,`|`,`||`,`%%`),...rb(`infix`,100,110,!1,`%`),...rb(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...rb(`infix`,90,140,!1,`\\wr`),...rb(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...rb(`infix`,90,130,!1,`!!`),...rb(`infix`,90,90,!1,`...`,`..`),...rb(`infix`,80,80,!0,`\\intersect`,`\\union`),...rb(`infix`,80,80,!1,`\\`),...rb(`infix`,70,70,!1,`<:`,`:>`),...rb(`infix`,60,60,!0,`@@`),...rb(`infix`,50,140,!0,`\\cdot`),...rb(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...rb(`infix`,30,30,!0,`\\land`,`\\lor`),...rb(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...rb(`infix`,10,10,!1,`=>`)]),ab=new Map([...ib,...Df.flatMap(e=>e.slice(1).map(t=>[t,ib.get(e[0])]))]),ob=ab.get(`[`),sb={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},cb=e=>({type:`tokens`,kinds:new Set(e)}),lb=e=>typeof e==`string`?e.startsWith(`<`)?cb([E(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(lb)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),ub=e=>(...t)=>({type:e,body:G(...t)}),q=ub(`zeroOrMore`),db=ub(`oneOrMore`),J=ub(`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}),fb=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),pb=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=fb(e,n);return n},mb=(...e)=>{let t=e.map(E);return e=>t.includes(pb(e,1).kind)},hb=(e,t=pb(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},gb=e=>{let t=pb(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},_b=e=>mb(`CASESEP`)(e)&&hb(e),vb=e=>{let t=pb(e,1);nb.has(t.kind)&&(t.kind=Xy)},yb=(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}`,bb=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),xb=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Sb=e=>e.operatorStacks[e.operatorStacks.length-1],Cb=(e,t)=>e.low>t.high,wb=(e,t)=>e.high<t.low,Tb=e=>e.fix===`prefix`?e:ab.get(`${e.name}.`),Eb=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===ob?bb(`FcnAppl`,[n,...r.node.heirs]):bb(`PostfixExpr`,[n,r.node]),operator:void 0})},Db=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:bb(`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:bb(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Ob=e=>{let t=Sb(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 Eb(t,n),Ob(e);if(i.operator!==void 0){let t=Tb(r.operator);return t!==void 0&&Cb(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${yb(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 ${yb(e,a.node.first,a.node.last)} and expression at location ${yb(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return wb(a.operator,r.operator)?void 0:Cb(a.operator,r.operator)?(Db(t,a.operator),Ob(e)):`Precedence conflict between ops ${a.operator.name} in block ${yb(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Tb(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(wb(s,r.operator))return;if(!Cb(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${yb(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Db(t,s),Ob(e);let c=yb(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===sb?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},kb=e=>Y(t=>{let n=Sb(t),r=xb(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:Ob(t)}),Ab=kb(()=>!1),jb=kb(()=>!0),Mb=Y(e=>{e.lastOperator=ab.get(e.token.image)}),Nb=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},Pb=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?Nb(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Fb=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!hb(e,n.first.beginColumn))return n;let t=Fb(e,n);if(t!==void 0)return t}},Ib=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(E),n=(e,...t)=>t.some(t=>e.kind===E(t)),r=e=>e!==void 0&&$y.has(e.kind),i=e.token,a=fb(e,i);i.next=void 0;let o=fb(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===Xy&&(e=e.next)}else if(e.kind===Xy){let t=e.next;!r(t)||tb.has(t.kind)||eb.has(t.kind)&&t.next?.kind!==Xy||(e=t.next?.kind===E(`SUBSTITUTE`)?i:eb.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Zy&&(e.next={kind:Zy,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=fb(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Lb=e=>{let t=pb(e,1);if(t.kind===E(`LAB`)){let n=1;for(;n!==0;)if(t=fb(e,t),t.kind===E(`LAB`)&&n++,t.kind===E(`RAB`)&&n--,t.kind===Yy)return!1;return fb(e,t).kind===E(`IN`)}if(t.kind!==Xy)return!1;for(t=fb(e,t);t.kind===E(`COMMA`);){if(t=fb(e,t),t.kind!==Xy)return!1;t=fb(e,t)}return t.kind===E(`IN`)},Rb=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),zb=e=>e.proofLevels.at(-1)??-1,Bb=e=>{let t=pb(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:mb(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||zb(e)>=0&&Rb(t)>zb(e):mb(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Vb=(e,t)=>{let n=Rb(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},Hb=e=>Y(t=>Vb(t,t.token)?void 0:`${yb(t,t.token)}: ${e}`),Ub=cb([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(E)),Wb=cb([...Ub.kinds,E(`op_76`)]),Gb=cb(eb),Kb=cb(tb),qb=cb([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(E)),Jb=()=>q(Z({expansion:[K(Ub,`<op_77>`)],semantic:hb}),K(`PrefixOp`,`InfixOp`),jb),Yb=()=>K(G(Z({expansion:[`OpenStart`],semantic:hb}),`OpenExpression`,Ab),G(Z({semantic:hb}),`ExtendableExpr`)),Xb=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),Zb=()=>K(G(Z({semantic:e=>mb(`ASSUME`,`BOXASSUME`)(e)||pb(e,2).kind===E(`COLONCOLON`)&&[E(`ASSUME`),E(`BOXASSUME`)].includes(pb(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Qb=()=>[`JuncItem`,q(Z({semantic:gb}),`JuncItem`)],$b=e=>Y(t=>{t.expecting=e,vb(t)}),ex=e=>Y(t=>{t.isTerminalProof=e}),tx=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{Ib(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),nx={CompilationUnit:Q(void 0,[Y(Ib),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>`),$b(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,$b(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,$b(`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(Ib)),G(Z({semantic:e=>mb(`USE`)(e)&&pb(e,2).kind!==E(`ONLY`)||mb(`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(tx(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),tx(`Expression`,Z({expansion:[`<IDENTIFIER>`,Kb]}),`PostfixLHS`,`Expression`),tx(`Expression`,Z({expansion:[`<IDENTIFIER>`,Gb]}),`InfixLHS`,`Expression`),tx(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),tx(`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`,[Wb,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,Gb,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,Kb]),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>`,$b(`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,[Ub,Mb]),NonExpPrefixOp:Q(void 0,[Wb,Mb]),InfixOp:Q(`Infix Op`,[Gb,Mb]),PostfixOp:Q(void 0,[Kb,Mb]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{Ib(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),Zb(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),Zb(),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=xb(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${yb(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(Ib),K(G(Z({amount:3}),Z({semantic:mb(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:Bb}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>mb(`BY`)(e)||pb(e,2).kind===E(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>pb(e,2).kind!==E(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,ex(!0),J(`<ONLY>`)),G(`<USE>`,ex(!1),J(`<ONLY>`)),G(`<HIDE>`,ex(!1))),X("an expression, `MODULE' or `DEF'"),J(Xb(),q(`<COMMA>`,X(`MODULE or expression`),Xb(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),Xb(),q(`<COMMA>`,X(`MODULE or expression`),Xb(),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`),qb,Hb(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:Bb}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),qb,Hb(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:mb(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:mb(`INSTANCE`)}),`Instantiation`),G(Z({semantic:mb(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:Bb}),Y(e=>{let t=xb(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${yb(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),db(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:mb(`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(Wb,Gb,Kb),cb([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(E))],semantic:hb}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${yb(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:hb}),`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:Lb}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),db(`<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=xb(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`)),db(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:Lb}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>pb(e,2).kind===E(`MAPTO`)&&nb.has(pb(e,1).kind)}),Y(e=>{pb(e,1).kind=Xy}),`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=bb(`FcnAppl`,t.heirs),e.lastOperator=ob})),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>`,db(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(vb),`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===E(`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=>_b(e)&&pb(e,2).kind!==E(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:_b}),`<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`,[db(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=pb(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...Qb()),G(Z({expansion:[`<AND>`]}),...Qb())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Fb(t,e.heirs[1]);return n&&`Item at ${yb(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${yb(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([])}),Jb(),Yb()],(e,t)=>{let n=Sb(t);n.push({node:e.heirs[0],operator:sb});let r=Ob(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`),Ab,q(K(G(Z({expansion:[`PostfixOp`],semantic:hb}),`PostfixOp`,jb),G(Z({expansion:[`<DOT>`],semantic:hb}),`<DOT>`,Y(vb),Z({semantic:hb}),`Identifier`,Y(e=>{let t=Sb(e);t[t.length-1].operator!==void 0&&Eb(t,t.length),t[t.length-1]={node:bb(`RecordComponent`,[t[t.length-1].node,xb(e,2),xb(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:hb}),X(`function argument`),`SBracketCases`,kb(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:hb}),`InfixOp`,jb,Jb(),Yb()),G(Z({expansion:[`<COLONCOLON>`],semantic:hb}),`<COLONCOLON>`,Y(e=>{let t=Sb(e);if(!Pb(t[t.length-1].node))return`\`::' at ${yb(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=Sb(e),n=xb(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!wb(r,e.lastOperator)){let t=xb(e,3);return`Removing label at ${yb(e,t.first,t.last)} would change expression parsing.`}t.push({node:bb(`Label`,[xb(e,3),xb(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:hb}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:hb}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>zb(e)<0&&e.proofLevels.length<=1?`${yb(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${yb(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:Nb(e.heirs)===void 0?e.heirs.length===1?bb(`GeneralId`,e.heirs):void 0:bb(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>pb(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=>pb(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${yb(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},rx=/* @__PURE__ */ new Map,ix=e=>{let t=rx.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=ix(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,ix(nx[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 rx.set(e,n),n},ax=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},ox=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=fb(e,e.scanPosition)),e.scanPosition=fb(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`},sx=(e,t)=>{if(t.type===`tokens`)return ox(e,t.kinds);if(t.type===`call`)return sx(e,nx[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||ax(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=sx(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||ax(e,t.semantic)?sx(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=sx(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=sx(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},cx=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=sx(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},lx=(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||ix(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!ix(a).hasSemanticStart?ix(a).first.has(pb(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):cx(e,i,a)&&(o===void 0||o(e))}),ux=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,sx(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=fb(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Yy){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=fb(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Ce(e.token.image)}" `},dx=(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??ux(e)}\n\nResidual stack trace follows:\n${r}`,!1},fx=(e,t)=>{let n=fb(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,dx(e))},px=(e,t)=>{let n=nx[t];n.message!==void 0&&(e.messages.push({name:n.message,token:pb(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!mx(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 dx(e,i);let a=r.node??(r.heirs.length===0?void 0:bb(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},mx=(e,t)=>{if(t.type===`tokens`)return fx(e,t.kinds);if(t.type===`call`)return px(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||dx(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||dx(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||mx(e,t));if(t.type===`choice`){let n=lx(e,t.alternatives);return n===-1?dx(e):mx(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!mx(e,t.body))return!1;if(t.type===`optional`)return lx(e,[t.body])===-1||mx(e,t.body);for(;lx(e,[t.body])===0;)if(!mx(e,t.body))return!1;return!0},hx=e=>{let t=xe(e),n={kind:Yy,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=mx(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
|
-
`)},gx={low:15,high:15},_x={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),vx=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)]]),yx=(e,t)=>t.isAssociative||e===`%`||e===`\\X`,bx=/* @__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}]]),xx={low:17,high:17},Sx=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`@`,`\\A`,`\\E`,`\\AA`,`\\EE`,`IF`,`CASE`,`LET`,`CHOOSE`,`LAMBDA`,`WF_`,`SF_`]),Cx=/* @__PURE__ */ new Set([`(`,`{`,`<<`]),wx=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Tx=/* @__PURE__ */ new Set([...wx,`'`]),Ex=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Dx=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),Ox=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),kx=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),Ax=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...Tx]),jx=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),Mx=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Nx=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Px=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Fx=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Ix=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Lx=/* @__PURE__ */ new Set([``,`*`,`-`]),Rx={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},zx=(e,t)=>e.line-t.line||e.column-t.column,Bx=(e,t)=>({start:zx(e.start,t.start)<=0?e.start:t.start,stop:zx(e.stop,t.stop)>=0?e.stop:t.stop}),Vx=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),Hx={printed:``,set:``},Ux={printed:`
|
|
1784
|
-
`,set:``},Wx={printed:`
|
|
1785
|
-
`,set:`
|
|
1786
|
-
`},Gx=(t,n,r,i=`Proof.Parser`)=>new e.F(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}`}}),Kx=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),qx=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),Jx=/* @__PURE__ */ new Set([`NEW`,...qx.keys()]),Yx=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Xx=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Zx=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Qx=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?vx.has(e.operator):wx.has(e.operator)),$x=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,eS=e=>vx.has(e)||wx.has(e)||e===`-.`,tS=(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}}},nS=(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(`
|
|
1787
|
-
`)}\n`},rS=(t,n,r=re(t,n===`tlapm`))=>{let i=n===`tlapm`,a=i?r:r.map(x),o=0,s=[],l,u,d=[],f=/* @__PURE__ */ new Set,p=[],m=[],h,g=0,_=[],v=/* @__PURE__ */ new WeakMap,y=e=>d[d.length-1].has(e),b=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),ee=[],te=[],ne=[],S=(e,t=o-1)=>{let n=e===t?ne[e]:void 0;if(n)return n;let r=a[t];ee[e]??=b(a[e]),te[t]??={line:r.line,column:r.endColumn};let i={module:m[0].name,start:ee[e],end:te[t]};return e===t&&(ne[e]=i),i},C=(e,t)=>(e.location.range=S(t),e),w=(e=0)=>a[Math.min(o+e,a.length-1)],T=(e=0)=>{let t=w(e),n=s[s.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},E=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ie=e=>i&&(e.kind===`Keyword`||Zx.has(e.text)),ae=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},oe=e=>e.kind===`End`?`EOF`:/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Ix.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:ie(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,se=(t,n=w(),r)=>{let i=a[a.length-1],o=n.line===i.line&&n.column===i.column,s=new e.F(`${t} at line ${n.line}, column ${n.column}`,void 0,ce(t,n,o,r));return h!==void 0&&v.set(s,h),s},ce=(e,t,n,r)=>{if(!i)return{reason:e,line:t.line,column:t.column,isEnd:n};let o=a[_[0]-1],s=r?`Unexpected ${oe(r)}`:e;if(o)return{reason:s,line:o.line,column:o.endColumn+1,isEnd:n};let c=r?ae(r):t;return{reason:s,line:c.line,column:c.column,isEnd:n}},le=(e,t=w())=>se(e,t,t),ue=t=>{let n={cursor:o,frame:h,restorePoints:_.length,offsideColumns:s.length,recursiveScopes:d.length},r=++g;h=r;try{let e=t();return h=n.frame,e}catch(t){if(!(t instanceof e.F)||v.get(t)!==r)throw t;o=n.cursor,h=n.frame,_.length=n.restorePoints,s.length=n.offsideColumns,d.length=n.recursiveScopes;return}},de=e=>{let t=h;h=void 0;let n=e();return h=t,n},fe=e=>{_.push(o);let t=e();return _.pop(),t},pe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ie(e),D=(e,t=0)=>{let n=T(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},O=()=>{let e=T();if(e.kind===`End`)throw le(`Unexpected end of expression`);return o++,e},k=e=>D(e)?(o++,!0):!1,A=e=>{if(!D(e))throw le(`Expected ${JSON.stringify(e)} but found ${E(T())}`);return O()},me=()=>{let e=T();if(e.kind!==`Identifier`)throw le(`Expected an identifier but found ${E(e)}`);if(ie(e))throw le(`Unexpected keyword ${e.text}`);return o++,e.text},he=()=>{let e=o;return{name:me(),range:S(e)}},ge=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),_e=()=>{let e=T();return e.kind!==`String`&&(Dx.has(e.text)||vx.has(e.text)||Tx.has(e.text))?(o++,e.text):me()},ve=!1,ye=()=>T().kind===`Identifier`||!pe(T())?me():(ve=!0,O().text),be=e=>{if(!i)return e();s.push(-1);let t=e();return s.pop(),t},xe=(e,t=`,`)=>{let n=[e()];for(;k(t);)n.push(e());return n},Se=(e=0)=>{if(D(`<<`,e)){let t=e+1;for(;T(t).kind===`Identifier`||D(`,`,t);)t++;return D(`>>`,t)&&D(`\\in`,t+1)}let t=e;for(;T(t).kind===`Identifier`;){if(D(`\\in`,t+1))return!0;if(!D(`,`,t+1))return!1;t+=2}return!1},Ce=()=>{if(D(`::`))return!0;if(!D(`(`))return!1;let e=1;for(;T(e).kind===`Identifier`&&D(`,`,e+1);)e+=2;return T(e).kind===`Identifier`&&D(`)`,e+1)&&D(`::`,e+2)},we=()=>{if(!k(`<<`)){let e=he();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=ge(D(`>>`)?[]:xe(he));return A(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Te=()=>{let e=()=>{let e=xe(we);A(`\\in`);let t=de(N);return e.map(e=>({pattern:e,set:t}))},t=[e()];for(;D(`,`)&&(!i||Se(1));)O(),t.push(e());return t.flat()},Ee=()=>{let e=T();if(i&&Zx.has(e.text)){let t=o;O();let n={kind:`Identifier`,name:e.text,location:b(e)};return{subscript:C(n,t),lastArgs:[]}}let t=i&&(e.kind===`Number`||e.kind===`String`||D(`@`));if(e.kind===`Identifier`){let t=o,n=[],r=[],a=e=>(r.push(S(o,o)),n.push(me()),e&&D(`(`)?je():[]),s=[a(!i)];for(;D(`!`)&&T(1).kind===`Identifier`;)O(),s.push(a(!0));let c=s.slice(0,-1),l=b(e);l.range={...S(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(D(`<<`)||D(`(`)||D(`{`)||D(`[`)||t){let e=o,t=j();return{subscript:t.location.range?t:C(t,e),lastArgs:[]}}throw le(`Expected a subscript but found ${E(e)}`)},De=e=>{let t=T(1),n=T(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`&&D(`==`,Tx.has(n.text)?3:4))},Oe=e=>{let t=T(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||D(`,`,1)||D(`)`,1)||t.kind===`Keyword`&&Mx.has(t.text)||De(e)},ke=()=>{let e=T(),t=e.kind===`Operator`&&(vx.has(e.text)||Ex.has(e.text))&&Oe(e);if(i&&e.kind!==`String`&&(Ex.has(e.text)||Ax.has(e.text)&&e.text!==`'`&&!wx.has(e.text)||kx.has(e.text)&&T(-1).text===`(`&&T(-1).line===e.line&&T(-1).endColumn+1===e.column&&T(1).text===`)`&&T(1).line===e.line&&T(1).column===e.endColumn+1)&&Oe(e))throw se(`incomplete expression`,e);if(t&&!i&&e.text===`\\X`&&e.spelling!==`×`)throw se(`\\X may not be used as an infix operator`,e);if(t)return o++,C({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:b(e)},o-1);if(e.kind!==`String`&&Ax.has(e.text)&&Oe(e)){o++;let t=b(e);if(wx.has(e.text))return C({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o-1);let n={kind:`Identifier`,name:`argument`,location:t};return C({kind:`Lambda`,params:[n.name],body:tS(e.text,n,t),operator:e.text,location:b(e)},o-1)}if(D(`LAMBDA`)){let t=o;O();let n=ge(xe(he));A(`:`);let r=N();return C({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:b(e)},t)}if(!i)return N();let n=ue(N);if(n)return n;throw le(`Unexpected ${E(T())}`)},Ae,je=()=>be(()=>{let e=o;A(`(`);let t=xe(ke);return A(`)`),Ae=S(e),t}),Me=()=>{let e=O();s.push(e.column);let t=[N()],n=()=>{for(;$x(w())&&w().text===e.text&&w().column===e.column;)o++,t.push(N())};return i?de(n):n(),s.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:b(e)}},Ne=e=>be(()=>{let t=b(e),n=T().kind===`Identifier`,r=D(`|->`,1)&&(n||pe(T()));if(r||n&&D(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o,n=b(T()),i=e();return n.range=S(t),A(r?`|->`:`:`),{name:i,value:N(),location:n}},a=[i(()=>n?me():O().text),...k(`,`)?xe(()=>i(me)):[]];return A(`]`),{kind:e,fields:a,location:t}}if(Se()){let e=o,n=Te();if(!i||D(`|->`)){A(`|->`);let e=N();return A(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}o=e}let a=N();if(k(`->`)){let e=N();return A(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(k(`EXCEPT`)){let e=xe(()=>{A(`!`);let e=[];for(;D(`.`)||D(`[`);)if(k(`.`)){if(!pe(T()))throw le(`Expected a field name but found ${E(T())}`);if(!i&&D(`@`))throw le(`@ used in !.@`);e.push({kind:`Field`,name:O().text})}else A(`[`),e.push({kind:`Index`,args:xe(()=>N())}),A(`]`);return A(`=`),{path:e,value:N()}});return A(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!D(`]_`)){let e=[a];for(;k(`,`);)e.push(N());return A(`]`),{kind:`Bracket`,args:e,location:t}}return A(`]_`),{kind:`BoxAction`,action:a,subscript:Ee().subscript,location:t}}),Pe=()=>{let e=o,t=C(He(),e),n=b(O());return C({kind:`Apply`,operator:`\\in`,args:[t,de(N)],location:n},e)},Fe=e=>be(()=>{let t=b(e);if(k(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(Se()&&(T(1).text===`\\in`||D(`<<`))){let e=o,n=we();A(`\\in`);let r=de(N);if(k(`:`)){let e=de(N);return A(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o=e}let n=T().kind===`Identifier`&&D(`\\in`,1)?Pe():N();if(k(`:`)){let e=Te();return A(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;k(`,`);)r.push(N());return A(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Ie=e=>{let t=b(e),n=be(()=>D(`>>`)||D(`>>_`)?[]:xe(()=>N()));if(k(`>>_`)){if(n.length!==1)throw se(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:de(Ee).subscript,location:t}}return A(`>>`),{kind:`Tuple`,elements:n,location:t}},Le=e=>{let t=b(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&Se()){let e=Te();return A(`:`),{kind:n,bounds:e,body:N(),location:t}}let i=ge(xe(he));return A(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:N(),isTemporal:r,location:t}},Re=e=>{let t=[];do{let n=o;if(k(`OTHER`))return A(`->`),{kind:`Case`,arms:t,other:N(),otherRange:S(n),location:b(e)};let r=N();A(`->`),t.push({condition:r,body:N()})}while(k(`[]`));return{kind:`Case`,arms:t,other:void 0,location:b(e)}},ze=()=>{let e=T(1);return D(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||jx.has(e.text)||e.kind===`Operator`&&(vx.has(e.text)||Tx.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&Dx.has(e.text))},Be=()=>{let e=O();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:je()}}return{kind:`Name`,name:e.text,args:D(`(`)?je():[]}},j=e=>{let t=o,r=O(),a=b(r);if(i&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=xe(me);return A(`:`),{kind:`Lambda`,params:e,body:N(),location:a}}if(r.kind===`Number`)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`&&St(r);if(!i&&s&&yt()<0&&vt.length<=1)throw se(`Step number used outside proof`,r);if(s&&r.text[1]===`+`)throw se(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||s){let n=s?Ct(r)??r.text:r.text;if(Ce()){let o=ge(k(`(`)?xe(he):[]);o.names.length>0&&A(`)`),A(`::`);let s=S(t),c=N();if(!i&&e!==void 0&&l!==void 0&&Qx(c)&&e.high>=l.low)throw se(`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=D(`(`);if(n===`@`&&!c&&!ze())return{kind:`ExceptAt`,location:a};let u=c?je():[],d=[c?Ae:void 0];if(!ze())return c?{kind:`Apply`,operator:n,args:u,argumentsRange:Ae,location:a}:{kind:`Identifier`,name:n,location:a};let f=[{kind:`Name`,name:n,args:u}],p=[S(t,t)];for(;ze();)O(),p.push(S(o,o)),Ae=void 0,f.push(Be()),d.push(Ae);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),v=d.at(-1)??S(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:v,selectorRanges:p,argumentRanges:d,location:a}}if(r.kind===`Operator`&&eS(r.text)&&D(`(`)){let e=je();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`&&eS(r.text)&&!i)return{kind:`Identifier`,name:r.text,spelling:r.spelling,location:a};switch(r.text){case`(`:{let e=be(()=>N());return A(`)`),e}case`[`:return Ne(r);case`{`:return Fe(r);case`<<`:return Ie(r);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Le(r);case`IF`:{let e=N();A(`THEN`);let t=N();return A(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:N(),location:a}}case`CASE`:return Re(r);case`LET`:{let e=[],t=[];for(d.push(/* @__PURE__ */ new Set);!k(`IN`);){if(i&&D(`RECURSIVE`))throw le(`Unexpected keyword RECURSIVE`);if(k(`RECURSIVE`)){ht();continue}let n=ct(!i&&k(`LOCAL`));n.kind===`Instance`?t.push(n):e.push(n)}d.pop();let n=N();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=we(),t=k(`\\in`)?N():void 0;return A(`:`),{kind:`Choose`,pattern:e,set:t,body:N(),location:a}}case`WF_`:case`SF_`:{let e=Ee(),t=!D(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:be(()=>{A(`(`);let e=N();return A(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:a}}}throw le(`Unexpected ${E(r)}`,r)},Ve=(e,t,n)=>{l=u={low:t,high:n};let r=N(n+1),i=T(),a=Tx.has(i.text)?gx.high:vx.get(i.text)?.high;if(i.kind===`Operator`&&a!==void 0&&a>=t)throw se(`Precedence conflict between ${e.text} and ${i.text}`,i);return r},He=()=>{let e=u;u=void 0;let t=T(),n=b(t);if(t.kind===`Operator`&&$x(t))return Me();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return O(),{kind:`Apply`,operator:`~`,args:[Ve(t,4,4)],location:n};case`-`:return O(),{kind:`Apply`,operator:`-.`,args:[Ve(t,12,12)],location:n};case`[]`:case`<>`:case`ENABLED`:case`UNCHANGED`:return O(),tS(t.text,Ve(t,4,15),n);case`SUBSET`:case`UNION`:case`DOMAIN`:return O(),{kind:`Apply`,operator:t.text,args:[Ve(t,10,13)],location:n}}return j(e)},Ue=(e,t,n,r,i)=>{let a=b(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}},We=(e,t)=>e.text===`'`?{kind:`Prime`,expression:t,location:b(e)}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t],location:b(e)},Ge=()=>{O();let e=be(()=>xe(()=>N()));return be(()=>A(`]`)),e},Ke=e=>{let t=o,n=He(),r=n.location.range?n:C(n,t),i;for(;;){let n=T();if(n.kind!==`Operator`)break;let a=b(n);if(Tx.has(n.text)&&e<=15){O(),l=gx,r=C(We(n,r),t);continue}if(n.text===`[`){let e=Ge();l=_x,r=C({kind:`FunctionApplication`,function:r,args:e,location:a},t);continue}if(n.text===`.`&&pe(T(1))){O();let e=O().text;r=C({kind:`FieldAccess`,record:r,field:e,location:a},t);continue}let o=vx.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 se(`Precedence conflict between ${i.text} and ${n.text}`,n)}if(O(),o.low>12&&D(`-`))throw se(`Precedence conflict between ${n.text} and -`,T());l=u=o;let s=N(o.high+1),c=i?.text===n.text;r=C(Ue(n,r,s,c,S(t).end),t),i={...o,text:n.text}}return r},M=e=>e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`||e.kind===`Identifier`||e.kind===`Step`&&St(e)&&/^<\d/.test(e.text)||(e.kind===`Operator`||e.kind===`Keyword`)&&Sx.has(e.text),qe=(e,t)=>({start:t,end:o-1,expression:e.location.range?e:C(e,t)}),Je=(e,t,n,r)=>({...n,start:e,end:o-1,fixity:t,isLeft:!1,apply:r}),Ye=e=>e.kind===`Operator`&&Tx.has(e.text)&&D(`(`,1)?ue(()=>be(()=>{O(),O();let t=N(),n=o-1;return A(`)`),{end:n,expression:We(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!==`!`&&(Yx.has(n.text)&&e++,Xx.has(n.text)&&--e===0))return!1}}return!1},Ze=e=>D(`(`,1)&&Xe()?ue(()=>be(()=>{O(),O();let t=N();A(`,`);let n=N();return A(`)`),{kind:`Apply`,operator:e.text,args:[t,n],location:b(e)}})):void 0,Qe=e=>{let t=o,n=T(),r=b(n),i=n.kind===`Operator`||n.kind===`Keyword`,a=i?vx.get(n.text):void 0;if(!e){if(D(`[`)){let e=Ge();return Je(t,`Postfix`,xx,t=>({kind:`FunctionApplication`,function:t[0].expression,args:e,location:r}))}if(D(`.`)&&pe(T(1))){O();let e=O().text;return Je(t,`Postfix`,xx,t=>({kind:`FieldAccess`,record:t[0].expression,field:e,location:r}))}if(a){if(Ze(n)){o=t;return}return O(),{...Je(t,`Infix`,a,e=>Ue(n,e[0].expression,e[1].expression,e[0].joinedBy===n.text,S(e[0].start,e[1].end).end)),isLeft:yx(n.text,a),joins:n.text}}if(n.kind!==`Operator`||!Tx.has(n.text))return;if(Ye(n)){o=t;return}return O(),Je(t,`Postfix`,gx,e=>We(n,e[0].expression))}if(n.kind===`Operator`&&$x(n))return qe(Me(),t);let s=a?Ze(n):void 0;if(s)return qe(s,t);let c=Ye(n);if(c)return c.expression.location.range=S(t,c.end),{start:t,end:c.end,expression:c.expression};let l=i?bx.get(n.text):void 0;if(l)return O(),Je(t,`Prefix`,l,e=>tS(n.text===`-`?`-.`:n.text,e[0].expression,r));if(!M(n))return;let u=n.kind===`Operator`&&Cx.has(n.text);return qe(u?j():de(j),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=S(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 se(`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=()=>fe(()=>{let e=ue(()=>Qe(!0));if(e===void 0){let e=w();throw e.kind===`End`?le(`Unexpected end of expression`,e):se(`required expressions(s) missing before '${oe(e)}'`,e)}return de(()=>{let t=[e];for(;;){let e=ue(()=>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 se(`incomplete expression`);return n.expression})}),N=(e=0)=>i?at():Ke(e),ot=()=>{if(!k(`(`))return[];let e=mt();return A(`)`),e},st=()=>{let e=b(T()),t=N(),n=a[o-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:m[0].name,start:e,end:r}}},ct=e=>{let t=o;return C(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=T(),n=o,r=b(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:S(n,o-2),...st(),isLocal:e,isRecursive:y(t),location:r});if(t.kind===`Identifier`&&T(1).kind===`Operator`&&vx.has(T(1).text)&&T(2).kind===`Identifier`&&D(`==`,3)){let e=he(),t=O().text,n=he();return A(`==`),i(t,[lt(e),lt(n)])}let a=t.kind!==`String`&&Dx.has(t.text),s=t.kind===`Identifier`&&Tx.has(T(1).text)&&D(`==`,2);if(a||s){let e=a?t.text:T(1).text;a&&O();let n=he();return s&&O(),A(`==`),i(e,[lt(n)])}let c=me();if(k(`[`)){let t=be(()=>Te());return A(`]`),A(`==`),{kind:`Function`,name:c,bounds:t,body:N(),isLocal:e,isRecursive:y(c),location:r}}let l=o,u=ot();return A(`==`),D(`INSTANCE`)?{...dt(c,u,e,r),definitionRange:S(l)}:i(c,u)},dt=(e,t,n,r)=>{let i=o;return A(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ye(),substitutions:k(`WITH`)?xe(()=>{let e=o,t=_e(),n=S(e);return A(`<-`),{name:t,nameRange:n,expression:ke()}}):[],isLocal:n,location:r,instanceRange:S(i)}},ft=()=>{let e=o;return C(pt(),e)},pt=()=>{let e=b(T());if(D(`_`)&&T(1).kind===`Operator`)return O(),{name:O().text,arity:k(`_`)?2:1,location:e};if(T().kind!==`String`&&(Dx.has(T().text)||i&&T().kind===`Operator`)&&D(`_`,1)){let t=O().text;return O(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=me();if(!k(`(`))return{name:t,arity:0,location:e};let n=xe(()=>A(`_`));return A(`)`),{name:t,arity:n.length,location:e}},mt=()=>xe(ft),ht=()=>{let e=mt();return e.forEach(e=>d[d.length-1].add(e.name)),e},gt=e=>{let t=0,n=e;do{let e=T(n);if(e.kind===`End`)return n;e.kind===`Operator`&&Yx.has(e.text)&&t++,e.kind===`Operator`&&Xx.has(e.text)&&t--,n++}while(t>0);return n},_t=()=>{let e=T(),t=T(1);return e.kind===`Identifier`?D(`(`,1)||D(`[`,1)?D(`==`,gt(1)):t.kind===`Operator`&&Tx.has(t.text)?D(`==`,2):t.kind===`Operator`&&vx.has(t.text)?T(2).kind===`Identifier`&&D(`==`,3):D(`==`,1):e.kind!==`String`&&Dx.has(e.text)&&t.kind===`Identifier`&&D(`==`,2)},vt=[],yt=()=>vt[vt.length-1]??-1,bt=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),xt=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},St=e=>!e.text.endsWith(`.`)&&!Lx.has(xt(e)),Ct=e=>{let t=xt(e);if(Lx.has(t))return;let n=bt(e);if(n>=0)return`<${n}>${t}`;let r=yt(),i=vt[vt.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},wt=e=>{if(e.kind===`Keyword`)return Px.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return vt.length===0;if(e.text[1]===`+`||vt.length===0)return!0;let t=yt();return t>=0&&bt(e)>t},Tt=e=>{let t=bt(e),n=vt.length-1,r=vt[n-1]??-1,i=vt[n]<0;return i&&(vt[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:vt[n]===t},Et=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)),Dt=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Zx.has(e.name)&&!Et(e.name):!1,Ot=()=>{let e=T();return e.kind===`Step`?St(e):e.kind===`Keyword`?Kx.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!_t()},kt=()=>{let e=o,t=T();return t.kind===`Operator`&&!Ox.has(t.text)&&eS(t.text)?(o++,C({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:b(t)},e)):k(`MODULE`)?C({kind:`ModuleFact`,name:me(),location:b(t)},e):N()},At=e=>p[p.length-1]?.add(e),jt=e=>{p.push(/* @__PURE__ */ new Set);let t=e();return p.pop(),t},P=e=>p.some(t=>t.has(e))||m.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),Mt=()=>{let e=o,t=T(),n=xe(()=>{let e=T();if((e.kind!==`Identifier`||ie(e))&&e.kind!==`Operator`)throw le(`Expected a definition name but found ${E(e)}`,e);return o++,e.text},`!`),r=b(t);return C(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},Nt=()=>{if(i)return xe(Mt);let e=xe(kt),t=n===`tlc`?e.find(e=>e.kind===`Identifier`&&P(e.name)):void 0;if(t)throw se(`DEF clause entry should describe a defined operator`,t.location);return e},Pt=()=>{let e=ue(N);if(!e)return[];let t=[e];return fe(()=>{for(;D(`,`);){let e=ue(()=>(O(),N()));if(!e)return;t.push(e)}}),t},Ft=()=>{let e=i?Pt():Ot()?xe(kt):[],t=k(`DEF`)||k(`DEFS`);if(i&&e.length===0&&!t)throw le(`Expected a fact`);return{facts:e,defs:t?Nt():[]}},It=()=>{let t=o,r=O(),i=r.text===`USE`&&k(`ONLY`),a=S(t),s={kind:r.text===`USE`?`Use`:`Hide`,isOnly:i,...Ft(),keyword:a,location:b(r)},c=s.kind===`Hide`&&n===`tlc`?s.facts.filter(e=>!Dt(e)):[];if(c.length>0)throw e.q(c.map(n=>({location:e.X(n.location.range??S(t)),message:`The only expression allowed as a fact in a HIDE is
|
|
1788
|
-
the name of a theorem, assumption, or step.`})));return C(s,t)},Lt=()=>{let e=o,t=b(T()),n=k(`NEW`),r=i?o:e,a=i?b(T()):t,s=T().kind===`Keyword`?qx.get(T().text):void 0;if(!n&&s===void 0)throw le(`Expected a declaration but found ${E(T())}`);if(s!==void 0&&O(),s===`Variable`){let e=he();return At(e.name),C({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:a},r)}let c=ft();At(c.name);let l=(s??`Constant`)===`Constant`&&D(`\\in`);if(l&&c.arity>0)throw se(`declared symbol with arguments before \\in`);return l&&O(),C({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?N():void 0,nameRange:c.location.range,location:a},r)},Rt=()=>{if(T().kind===`Identifier`&&D(`::`,1)&&D(`ASSUME`,2)&&(O(),O()),D(`ASSUME`))return jt(Bt);if(T().kind===`Keyword`&&Jx.has(T().text))return i?de(Lt):Lt();if(!i)return N();let e=ue(N);if(e===void 0)throw le(`Expected a hypothesis`);return e},zt=()=>{let e=[Rt()];return fe(()=>{for(;;){let t=ue(()=>(A(`,`),Rt()));if(t===void 0)break;e.push(t)}}),e},Bt=()=>{let e=o,t=b(A(`ASSUME`)),n=()=>{let n=i?zt():xe(Rt);return A(`PROVE`),C({kind:`AssumeProve`,assumptions:n,conclusion:N(),location:t},e)};return i?de(n):n()},Vt=e=>{let t=0;for(;T(t).kind===`Identifier`&&D(`,`,t+1);)t+=2;return T(t).kind===`Identifier`&&D(e,t+1)},Ht=(e,t)=>{e.forEach(At),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(At))},Ut=()=>{let e=T();if(D(`USE`)||D(`HIDE`))return It();if(!i&&D(`INSTANCE`)){let t=o;return C(dt(void 0,[],!1,b(e)),t)}if(D(`DEFINE`)||_t()){let t=o;k(`DEFINE`);let n=[ct(!1)];for(;_t();)n.push(ct(!1));let r={kind:`Define`,definitions:n,location:b(e)};return C(r,t)}if(k(`HAVE`))return{kind:`Have`,expression:N()};if(k(`TAKE`)){let e=Se(),t=ge(e?[]:xe(he)),n=e?Te():[];return Ht(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(k(`WITNESS`))return{kind:`Witness`,expressions:xe(()=>N())};if(k(`PICK`)){let e=Vt(`:`),t=ge(e?xe(he):[]),n=e?[]:Te();return Ht(t.names,n),A(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:N()}}return k(`CASE`)?{kind:`Case`,expression:N()}:{kind:`Assert`,isSuffices:k(`SUFFICES`),statement:D(`ASSUME`)?Bt():N()}},Wt=e=>{let t=T();if(t.kind!==`Step`)throw le(`Expected a step number but found ${E(t)}`,t);if(!Tt(t))throw se(`${e?`QED step`:`step`}'s number has bad level`,t);if(n!==`sany`&&bt(t)<0&&Ct(t)!==void 0)throw se(`<*> and <+> cannot be used for a named step`,t);return o++,{name:Ct(t),token:t.text,location:b(t)}},Gt=()=>{let e=o,t=Wt(D(`QED`,1)),n=o,r=/* @__PURE__ */ new Set;p.push(r);let i=k(`QED`)?{kind:`Qed`}:Ut(),a=S(e),s=S(n),c=wt(T());if(c&&!Fx.has(i.kind))throw se(`Proof of a step that does not take a proof`);let l=c?Jt():void 0;return p.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(At),C({...t,body:i,head:a,statement:s,proof:l},e)},Kt=e=>{if(k(`BY`)){let t=S(o-1);return{kind:`By`,isOnly:k(`ONLY`),...Ft(),keyword:t,location:e}}let t=T();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;O();let n=S(o-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},qt=()=>{let e=b(T());k(`PROOF`);let t=Kt(e);if(t)return t;let n=[Gt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(Gt());return{kind:`Steps`,level:yt(),steps:n,location:e}},Jt=()=>{let e=o;vt.push(-1);let t=jt(qt);return vt.pop(),C(t,e)},Yt=()=>T().kind===`Step`||T().kind===`Keyword`&&Px.has(T().text),Xt=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return Vx(e);let n=t.defs[t.defs.length-1]?.location.range;return Bx(Vx({...e,end:e.start}),Vx(n??t.keyword))},Zt=()=>{let e=o,t=b(T()),n=k(`PROOF`),r=Kt(t);if(r){let t=C(r,e);return{kind:`Leaf`,proof:t,span:Vx(t.keyword),first:e,end:o-1}}let i=T();if(i.kind!==`Step`)throw le(`Expected a step number but found ${E(i)}`);let a=o;O();let s=o,c=k(`QED`)?{kind:`Qed`}:Ut(),l=S(a);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:S(s),span:Xt(l,c),first:e,start:a,end:o-1}},Qt=(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=$t(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={...b(a[i.first]),range:S(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}},$t=(e,t,n,r,i)=>{let a=e[t];if(!a)throw Gx(`Unexpected end of (sub)proof at level ${n} before QED step`,r,Wx);if(a.kind===`Leaf`)throw Gx(`Expecting a proof step but found a${Rx[a.proof.kind]} leaf proof`,a.span,Wx);if(!i&&a.isProof)throw Gx(`PROOF keyword found in step that does not begin subproof`,a.span,Ux);let o=a.token.text[1];if(o===`+`&&!i)throw Gx(`<+> used but no subproof expected`,a.span,Ux);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:bt(a.token);if(s<n||!i&&s>n)return;let c=Fx.has(a.body.kind)?Qt(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:Ct(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{...b(a.token),range:S(a.start,l)}},d=Bx(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=$t(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:Bx(d,f.span)}},en=()=>{if(!Yt())return;let e=[];for(;Yt();)e.push(Zt());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=Qt(e,0,0,t.span),r=e[n.next];if(r)throw Gx(`extra step(s) after finished proof`,r.span,Hx,`Proof.Parser.toplevel`);return n.proof},tn=(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})},nn=()=>{if(T().kind!==`Identifier`||!D(`==`,1))return;let e=me();return f.add(e),O(),e},rn=()=>{if(!i)return N();let e=w(),t=ue(N);if(t)return t;throw le(`Expected "====" but found ${E(e)}`,e)},an=e=>{let t=o,n=O(),r=nn(),a=jt(()=>{let e=D(`ASSUME`)?Bt():rn();return i?{statement:e,proof:en()}:{statement:e,proof:wt(T())?Jt():void 0}}),s=a.statement,c=C({name:r,statement:s,proof:a.proof,location:b(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&s.kind!==`AssumeProve`&&tn(e,r,s,c.location)},on=()=>{let e=o,t=O(),n=nn();return C({name:n,expression:N(),isAxiom:t.text===`AXIOM`,location:b(t)},e)},sn=()=>{let e=b(A(`----`));A(`MODULE`);let t=ye();A(`----`);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),k(`EXTENDS`)&&xe(()=>{let e=o;n.extends.push(ye()),n.extendsRanges.push(S(e))});;){let t=o,r=T();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(D(`MODULE`,1)){let e=sn();n.modules.push(e),n.units.push({kind:`Module`,module:e}),A(`====`);continue}O()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=b(O()),r=mt();n.constants.push(...r),e.range=S(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=b(O()),r=xe(()=>{let e=o,t=b(T());return C({name:me(),arity:0,location:t},e)});n.variables.push(...r),e.range=S(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=on();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&tn(n,e.name,e.expression,e.location);continue}case`USE`:case`HIDE`:{if(D(`USE`)&&D(`ONLY`,1))throw le(`Expected a module unit but found ${E(r)}`);let e=It();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=b(O()),r=ht();e.range=S(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:cn(n,C(dt(void 0,[],!1,b(r)),t));continue;case`LOCAL`:if(O(),D(`INSTANCE`)){cn(n,C(dt(void 0,[],!0,b(r)),t));continue}cn(n,C(ut(!0),t));continue}r.kind===`Keyword`&&Nx.has(r.text)?an(n):cn(n,ct(!1))}}},cn=(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}))},ln=sn(),un=ve?hx(t):void 0;if(un!==void 0)throw new e.F(un);return ln},iS=e=>rS(e,`tlc`),aS=(e,t)=>rS(e,`tlc`,t),oS=e=>rS(e,`tlapm`),sS=e=>rS(e,`sany`),cS=`$subexpression`,lS=(t,n)=>new e.F(`${t} at line ${n.line}, column ${n.column}`),uS=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return uS(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of ze(e)){let e=uS(r,t,n);if(e)return e}},dS=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),fS=(e,t)=>{let n=e.location,r=dS(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 lS(`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 lS(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:cS,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:cS,args:e.args,location:n,resolution:ws},location:n}},pS=(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:ws})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:ws}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:ws};return fS({...t,params:[...t.params,...r]},a)},mS=(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 lS(i,a);Es.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 lS(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=e?e.find(e=>Jc(e)===c):n(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s++}throw lS(`Unknown operator ${r.join(`!`)}`,a)},f=e=>{let n=d(e),l=n.definition,f=js(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 lS(`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&&uS(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 lS(`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`||Qs(e.operand,1)!==0)throw lS(`A LET/IN expression has only one operand`,a);o.lets.push(c.definitions),c=c.body;return}let n=nc(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[Qs(e.operand,n.length)],i=t[s+1];if(!r||i?.kind!==`Operand`)throw lS(`A subexpression of CASE must have the form !i!j`,a);s++;let o=Qs(i.operand,2),l=o===0?r.condition:o===1?r.body:void 0;if(!l)throw lS(`Nonexistent CASE operand`,a);c=l;return}if(e.kind!==`Operand`)throw lS(`Unexpected subexpression selector`,a);let r=n?n.sets:rc(c),i=r?.[Qs(e.operand,r.length)];if(!i)throw lS(`Nonexistent operand specified by the selector`,a);c=i},h=f(void 0);if(l)return r;if(h)return pS(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 lS(`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 pS(e.definition,{...o,args:[...o.args,...e.args]});p()}else m(e),s++}if(l)return r;if(!c)throw lS(`Subexpression selection failed`,a);return fS(o,c)},hS=(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 $s(e,t,n)},gS=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||ze(e).some(gS),_S=(e,t,n,r=!1)=>{if(!gS(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Zc(e,e=>_S(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>vS(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)=>_S(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Zc(e,e=>_S(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?hS(a.name,[],void 0,t):a.kind===`Apply`?hS(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=mS(o,t,a,r);return c!==a&&Ts.add(c),c},vS=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:_S(e.expression,t,n,!0)}))}),yS=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},bS=(e,t)=>vS(e,yS(t.definitions),()=>!1),xS=(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=yS([...t,...e.definitions]),a=e=>n.has(e),o=yS([...t,...e.definitions,...r]),s=e=>_S(e,o,e=>a(e)&&r.every(t=>t.name!==e)),c=e=>a(e)||!i(e),l=e=>_S(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 vS(e,i,c);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?vS(e,i,c):Xc(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=>gS(e.body))||e.assumptions.some(e=>gS(e.expression))?{...h,definitions:e.definitions.map(e=>Xc(e,s)),assumptions:e.assumptions.map(e=>({...e,expression:s(e.expression)}))}:h},SS=(e,t)=>e.maxLevels[t]??3,CS=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=ou({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=>Il(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Il(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ll(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Nl(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)&&Il(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(su(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(jl(e.name,t));i!==void 0&&SS(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=Nl(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=SS(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()])}},wS=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],TS=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),ES=new Map(Df.flatMap(e=>e.map(t=>[t,e[0]]))),DS=e=>ES.get(e)??e,OS=()=>{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}}},kS=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:Ve(e)&2147483647,kind:t,isLocal:n}),AS=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:DS(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:DS(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}},jS=(e,t)=>{let n=[];for(let r=t;;){let t=AS(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},MS=e=>({line:e.line,column:e.column}),NS=(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=jS(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},PS=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,FS={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},IS=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&PS(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&PS(e[n+1],e[n+2])?n+=PS(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=>FS[e])}"`:r.text)}return t},LS=e=>e[2]?.text,RS=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},zS=(e,t)=>e.find(e=>e.name===t)??e.map(e=>zS(e.modules,t)).find(Boolean),BS=e=>{let t=e===void 0?[]:re(e),n;return{tokens:t,ranges:RS(t),getModule:()=>n??=e===void 0?iS(``):aS(e,t)}},VS=(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=BS(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)??jf.get(i)??Pf.get(i)??nS(e,i),c=a(s),l=c.tokens,u=c.ranges.get(LS(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:()=>zS(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()}},HS=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=jS(t,e+1);i.push({location:MS(t[e]),apply:e=>r.forEach(t=>e.put(kS(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:MS(n),apply:t=>t.put(kS(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`&&jS(t,u+1).every(e=>s.has(e))&&o(u,`definition`),TS.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(MS(n)),i.push({location:MS(n),apply:e=>e.put(kS(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(kS(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=DS(e.name);i.push({location:e.location,apply:n=>n.put(kS(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(kS(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(kS(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>As(e.location,t.location)?-1:+!!As(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=OS();n.set(i??``,o),Ef.toReversed().forEach(e=>o.put(kS(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)}}},US=(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)}),Of.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=NS(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]),v=/* @__PURE__ */ new Map;IS(o(void 0)).forEach((e,t)=>{t===3&&Af.forEach(i),i(e)});let y=l(void 0);for(;;){let n=h(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!n)break;let[r,a]=n;if(d.add(`${r.key}>${a}`),v.set(r.unit,[...v.get(r.unit)??[],a]),!_.has(a)){if(_.add(a),t(a).tokens.length===0){let n=r.unit??LS(t(void 0).tokens);throw e.K(a,n)}IS(o(a)).forEach(i)}}wS.forEach(i);let b=/* @__PURE__ */ new Set,x=e=>{if(b.has(e))return;b.add(e);let t=v.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(x),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return x(void 0),kf.forEach(i),[...r]},WS=(e,t)=>{let n=VS(e,t),r=n.getParsed,i,a=()=>i??=HS(r);return{getStringOrder:e=>US(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)}}},GS=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),KS=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],qS=(t,n,r)=>{try{return r.parseModule(t)}catch(r){if(!(r instanceof e.F))throw r;let i=hx(t);throw i===void 0?r:e.q([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},JS=t=>new e.F(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),YS=(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)}.`},XS=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,ZS=e=>e===`Theorem`?`ThmOrAssumpDefNode`:XS(e),QS=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:hl(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),$S=(e,t)=>{let n=Be(e);return n!==void 0&&t.has(n)||ze(e).some(e=>$S(e,t))},eC=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(ul(e),n.get(e)??n.size)),n},tC=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),nC=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Sh(e);if(e.kind===`Number`&&!Lt(e.value))throw Ch(e);nC(e.kind===`Let`?[...ze(e),...tC(e.instances??[])]:ze(e))}),rC=(t,n)=>{let r=n.order??WS(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(Gf.map(e=>[e.name,e])),d=/* @__PURE__ */ new Map,f=$d(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=[],y=(e,t)=>_.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),b=0,x=e=>`${e}#${b++}`,ee=[],te=[],ne=CS(e=>{let t=m.get(e)??oe(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)}}),S=/* @__PURE__ */ new Map,re=/* @__PURE__ */ new Map,C=/* @__PURE__ */ new Map,w=e=>{let t=d.get(e);if(t)return t;let r=pp(e,n.print,f,n.files,u);if(!r)return;dp.get(e)?.forEach(w);let i=/* @__PURE__ */ new Map;return fp.get(e)?.forEach(e=>w(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:Ol.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Al(e,t.name)??i.get(t.name)?.range})}),d.set(e,i),i},T=e=>{let t=dp.get(e)??[];if(e===`TLCExt`||[e,...t].some(e=>n.loadModule?.(e)!==void 0))return;let r=w(e);return r&&y(e,t),r&&t.includes(`Integers`)&&w(`Integers`),r},E=e=>(nC([...e.definitions.flatMap(Re),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...tC(e.instances)]),e.modules.forEach(E),e);E(i);let ie=(t,i)=>{let a=n.loadModule?.(t)??If(f.version).get(t)??nS(n.source,t);if(a===void 0)throw e.K(t,i);let o=qS(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 E(o)},ae=t=>{let n=v.indexOf(t.name);if(n!==-1){let r=[...v.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=[];v.push(t.name),_.push(r);let s=O(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:te,levelChecks:o});if(_.pop(),v.pop(),a.length>0)throw e.q(a,!1,void 0,te);let c=i.find(e=>r.has(e.name)),l=c&&p.get(c.name),u=l&&YS(c,l.module);if(u)throw e.q([u],!1,void 0,te);if(c)throw JS(c);return o.forEach(e=>e()),{linked:s,closure:r}},oe=(t,r)=>{let i=p.get(t);if(i)return y(t,g.get(t)??[]),i;let o=ae(ie(t,r)),s=/* @__PURE__ */ new Map;return up(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`);return W(i.body,{environment:r.environment,scope:kg(hg(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&&GS.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},se=(e,t,n,r,i)=>{let u=i?void 0:T(e.module);if(u)return ce(e,u);let d=i??oe(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=KS(d),p=`#${b++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=zc(bS(e,t),f,t,n);ee.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=Cl({params:g,substitutions:new Map([...h].map(([e,t])=>[e,Gc(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=x(`${i}@${t.name}`),d=l(u);return a.set(u,d),f.length>0&&c.add(d),e.name!==void 0&&re.set(u,`${e.name}!${re.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 le(e,d.exported,f,(t,n)=>{let r=e.name===void 0?v.getKey(t):v.getQualifiedKey(t);return f.length>0&&S.set(r,{name:n,location:e.location}),e.name!==void 0&&C.set(r,n),r})},ce=(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}])),le=(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}]}))},ue=(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=ue(t.arity,void 0);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:gl(r,n),location:n}}},fe=(e,t,n,r)=>{let i=e.location,s=r?void 0:T(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=ue(n.arity,n.params);return _l(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??oe(e.module,n),l=`#${b++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=KS(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};ee.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=>$S(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=[],_=Cl({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:gl(e.params,i),location:i,resolution:ws}:hl(`${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}:QS(a,i)),i},createName:x}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),a=ue(n.arity,n.params),o=[...e.params,...a];return _l(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...g,...y]},pe=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),D=/* @__PURE__ */ new Map,O=(t,r)=>{let s=Jy(t,n.loadClass?.(t.name),t===i);D.set(t.name,s.overrides);let c=s.module,l=ee.length,u=new Map([...Gf.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:Pc,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);ZS(r.kind)===ZS(t.kind)?f.warnings.push({location:i,message:`Warning: the ${XS(r.kind)} of '${n}' conflicts with \nits ${XS(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${XS(t.kind)} of '${n}' conflicts with \nits ${XS(r.kind)} at ${a}.`})}),_=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,b=[],x=[...c.constants],S=c.variables.filter((e,t)=>c.variables.findIndex(t=>t.name===e.name)===t),re=S.map(e=>e.name),w=S.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:T(e);if(n){g(n);return}let i=t??oe(e,c.name);x.push(...i.constants.filter(e=>x.every(t=>t.name!==e.name)&&!re.includes(e.name))),i.variables.forEach((e,t)=>{re.includes(e)||x.some(t=>t.name===e)||(re.push(e),w.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 E=new Map(u),ie=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],ae=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});ie.forEach(e=>_.set(e.name,ae(e)));let ue=e=>({key:k(e),arity:js(e),params:Ms(e),kind:Fc(c,e)?`Theorem`:`Definition`,range:e.location.range}),de=x.length===0&&re.length===0,k=e=>c===i?e.name:`${e.name}@${r.id}`,A=/* @__PURE__ */ new Map,me=()=>new Map([...r.modules,...y]),he=e=>{let t=c.modules.find(t=>t.name===e.module);return t?As(t.location,e.location)?y.get(t.name):void 0:me().get(e.module)},ge=e=>({imported:u,getInstance:e=>{let t=he(e),n=t?void 0:T(e.module);if(n)return{declarations:[],symbols:ce(e,n),instancer:c.name};let r=t??oe(e.module,c.name),i=KS(r);return{declarations:i,symbols:le(e,r.exported,i,e=>e),instancer:c.name}},bound:E,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:k,instanced:A,facts:v,reports:p,warnings:r.warnings}),_e=e=>[...ie.filter(t=>As(t.location,e)).map(e=>[e.name,ae(e)]),...c.definitions.filter(t=>As(t.location,e)).map(e=>[e.name,ue(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(u)),ve=e=>{let t=me(),n=t.get(e.name),i=n&&YS(e,n.module);if(n&&!i)throw JS(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};p.push(a);let o=O(e,{id:`${r.id}/${e.name}`,symbols:_e(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=se(e,c,ge(c),de,me().get(e.module));A.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:()=>ve(e)}))].sort((e,t)=>As(e.location,t.location)?-1:1).forEach(e=>e.link());let ye=xS(Dl(c,(e,t)=>fe(e,t,c.name,he(e))),pe(u));r.errors.push(...Vc(ye,ge(ye))),ye.definitions.forEach(e=>{let t=k(e);a.set(t,e),o.set(t,!de);let n=ue(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!As(r,e.location))&&(u.set(e.name,n),e.isLocal||_.set(e.name,n))});let be={module:ye,constants:x,variables:re,variableLocations:w,visible:u,exported:_,modules:y,extended:b,facts:/* @__PURE__ */ new Set([...v,...[...ye.theorems,...ye.assumptions].flatMap(e=>e.name??[])])};m.has(c.name)||m.set(c.name,be);let xe=ee.splice(l).map(e=>({location:e.location,check:()=>ne(e)}));return r.levelChecks.push(()=>cu(ye,{constants:new Set(x.map(e=>e.name)),variables:new Set(re),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>C.get(u.get(e)?.key??e)},xe,te)),h.push(be),be},k=ae(i).linked,A=n.traceFile,me=A===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:A}}],he=[...n.moduleOperators??[],...me].map(e=>{let t=oe(e.module,i.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});h.push(...h.splice(h.indexOf(k),1)),te.length>0&&!n.isSanyReported&&n.print(e.Z(te)),k.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)}),he.forEach(e=>{let t=e.key===void 0?void 0:a.get(e.key);e.kind!==`postcondition`&&t&&a.set(e.operator,t)});let ge=[],_e=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>_e(e,t)),ge.push(...e.module.assumptions))};_e(k,/* @__PURE__ */ new Set);let ve=k.constants.map(e=>e.name),ye=k.variables,be=Fy(t,{root:k,moduleSymbols:new Map([...d,...[...p].map(([e,t])=>[e,t.visible]),[i.name,k.visible]]),definitions:a,builtins:u,copySources:s,operatorConstants:new Map(he.flatMap(e=>oe(e.module,i.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:r}),xe=be.constants,Se=be.substitutions;A!==void 0&&u.forEach((e,t)=>{let n=Xf(e);n&&u.set(t,n)});let Ce=eC(ye,h.flatMap(e=>e.module.variables.map(e=>e.name))),we=xu({definitions:a,substitutions:Se,constants:xe,variableIndex:Ce,builtins:u,variables:ye}),Te={runtime:f,definitions:a,builtins:u,constants:xe,substitutions:Se,instanceNames:re,variables:ye,variableIndex:Ce,facts:we,startupValues:Array.from({length:we.ids.size},()=>void 0),substitutedDefinitions:c,instanceParams:l,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Ee=ou({constants:new Set(xe.keys()),variables:/* @__PURE__ */ new Set([...ye,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>u.has(e))]),getDefinition:e=>Lh(e,Te)}),De=t=>{try{W(t,{environment:Te,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e.b)return t;throw t}};Se.forEach((t,n)=>{let r=a.get(t),i=ve.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&Ee.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?De(r.body):void 0;if(i){let r=it(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 Oe=new Set(h.flatMap(e=>e.module.instances.map(e=>e.module))),ke=r.createDefinitionOrder();return{environment:Te,assumptions:ge,variableLocations:k.variableLocations,instanceActions:S,startupDefinitions:h.filter(e=>!Oe.has(e.module.name)||KS(e).length===0).flatMap(e=>ke(e===k?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:h.flatMap(e=>D.get(e.module.name)??[]),moduleOperators:he,rootName:i.name}},iC=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),aC=(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},oC=t=>e.at(new e.b(`${e.G}${t}`),e.nt.error),sC=e=>{let t=L(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!Pt(e)||!Pt(i))throw oC(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},cC=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${lC(t)}`:n},lC=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(lC).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${cC(e.pattern,e.set)}:${lC(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(lC).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${lC(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>cC(e.pattern,e.set)).join(`,`)}|->${lC(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(lC);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},uC=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,dC=(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 oC(`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(!P(o)||!F(o))throw oC(`The symmetry operator must specify a set of functions.`);let s=I(o).elements;if(!s.every(Nt))throw oC(`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=lC(uC(e)?e.args[0]:e);return u.get(t)??t}),r=e.length>1;n.runtime.warn(qe.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(sC).forEach(e=>{e.size>0&&f.set(iC(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=aC(n,e),r=iC(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(!uC(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=>Pt(e)&&h.has(e.name))})),f.size!==0)return[...f.values()]},fC=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=mC(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(mC(e[r],t));return a}},pC=(e,t)=>{let n=[],r=[];for(let i of e){let e=mC(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(bn);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(bn(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},mC=(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=pC(e.elements,t);return n?Tn(n):e}if(n===`Function`||n===`LazyFunction`&&F(e.domain)){let n=L(e),r=fC(n.domain,t),i=fC(n.range,t)??n.range;if(r){let e=Sr(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Dn(n.domain,e.range):e}return i===n.range?n:Dn(n.domain,i)}if(n===`Interval`||!P(e)||!F(e))return e;let r=I(e),i=fC(r.elements,t);return i?gr(i):r},hC=(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]=mC(e[o],i),a===0&&(a=bn(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},gC={line:0,column:0},_C=e=>({kind:`Identifier`,name:e,location:gC}),vC=e=>({name:e,expression:_C(e),scope:void 0}),yC=/* @__PURE__ */ new Set([`name`,`property`]),bC=(t,n,r)=>{let i=Lh(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._(yC.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},xC=e=>e.body.kind===`Number`||e.body.kind===`String`,SC=(t,n,r)=>{if(r.constants.has(t))return r.constants.get(t);if(wu(n,r)&&!xC(n))try{return W(_C(t),qC(r,void 0,void 0))}catch(t){if(t instanceof e.b||e.tt(t))return;throw t}},CC=(t,n,r)=>{if(r.constants.has(n))throw new e._(`The ${t} ${n} cannot be a constant.`);let i=bC(t,n,r);if(SC(n,i,r)!==void 0)throw new e._(`The ${t} ${n} cannot be a constant.`);return i},wC=(t,n,r)=>{let i=r.constants.has(n)?void 0:bC(t,n,r),a=i?SC(n,i,r):r.constants.get(n);if(a!==void 0&&a!==!0)throw new e._(`The ${t} of ${n} is equal to ${R(a)}`);return a===void 0?i:void 0},TC=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},EC=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),fg(e.startupDefinitions,r),t.invariants.forEach(e=>{wC(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},DC=(t,n)=>{let r=ou({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>n.definitions.get(e)});return t.flatMap(t=>{let i=wC(`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
|
+
`]]),B_=(e=`master`)=>e===`1.7.4`?z_:R_,V_=(e,t)=>e.every(e=>Ul(e,t)),H_=Uc([!1,!0]);Rc(H_);const U_=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Jc(U_(e,t,r),U_(e,r,n))},W_=[`\\cup`,`\\cap`,`\\`],G_=e=>typeof e==`object`&&e.kind===`MixedSet`,K_=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,q_=(e,t,n)=>{t.kind===`Interval`&&Nl(t);let r=t.kind===`Interval`?t:Lc(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return rs(r,e=>{Ul(e,n)===i&&ts(a,e)}),K_(t)?$s(a):Wc(a)}if(Al(t))return n;if(!as(n))return sc({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return rs(r,e=>ts(i,e)),rs(n.kind===`Interval`?n:G(n).elements,e=>{Ul(e,t)||ts(i,e)}),Wc(i)},J_=(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},Y_=(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`?J_(e,t):void 0;if(n!==void 0)return n;for(let n=e.low;n<=e.high;n++)if(!Ul(n,t))return!1;return!0},X_=(e,t)=>{let n=(t,n)=>Ef([Jf(t,n,e)()],0,e);return{...Y(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},Z_=[Of(`TRUE`,!0),Of(`FALSE`,!1),Of(`BOOLEAN`,H_),Of(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),jf(`=`,Bc),jf(`#`,(e,t)=>!Bc(e,t)),Y(`~`,1,e=>!Ef(e,0,`~`)),Y(`<=>`,2,e=>Ef(e,0,`<=>`)===Ef(e,1,`<=>`)),X_(`/\\`,(e,t)=>e&&t()),X_(`\\/`,(e,t)=>e||t()),X_(`=>`,(e,t)=>!e||t()),Y(`\\in`,2,e=>Ul(J(e,0,`\\in`),J(e,1,`\\in`))),Y(`\\notin`,2,e=>!Ul(J(e,0,`\\notin`),J(e,1,`\\notin`))),jf(`\\subseteq`,(t,n)=>{if(typeof t==`object`&&t.kind===`Interval`)return Y_(t,n);if(!is(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`&&pl(t.base)?V_(G(t.base).elements,n.base):!wl(t,e=>!Ul(e,n))}),...W_.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(as(r)&&as(i)&&!G_(r)&&!G_(i)&&!a&&!ns(r)&&!ns(i)){if(t===`\\cup`&&Al(r))return i;let n=t===`\\cup`?Jc:t===`\\cap`?qc:Kc;return Vl((r,i)=>{let a=G(r),o=G(i),s=n(a,o);if(t===`\\cup`){let t=Lc(a),n=Kc(o,a).elements,r=t===a.elements&&(n.length===0||qs(t[t.length-1],n[0])<0);if(t.length+n.length>$o())throw new e.P(es());if(r&&!a.isNormalized)return s;let i=s===a?Qs(s.elements):s;return r||(i.writtenElements=[...t,...n]),i}return s===r||(s.isNormalized=K_(r),a.writtenElements&&!a.isNormalized&&(s.writtenElements=a.writtenElements.filter(e=>Ul(e,s)))),s},(e,n)=>q_(t,e,n),r,i)}return as(r)?q_(t,r,i):t!==`\\`&&as(i)?q_(t,i,r):sc({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=cs(t)?Lc(t):[],r=n.filter(cs);if(!cs(t)||r.length!==n.length)return sc({kind:`Union`,base:t});let i=r.flatMap(Lc),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{Ul(t,e)||ts(e.elements,t)}),Wc(e.elements)};return G_(t)||r.some(G_)?a():r.length===0?Gc:Vl(e=>Ll(U_(e,0,e.length),i),a,r.map(G),void 0)}),Y(`DOMAIN`,1,t=>{let n=J(t,0,`DOMAIN`);if(!os(n))throw new e.x(`DOMAIN expects a function but received ${q(n)}`);return uu(n)})],Q_=Uf(`Integers`,`Neg`,`IntValue`,1),$_=t=>{let n=Uf(t,`DotDot`,`IntervalValue`,2);return[Wf(t,`+`,`Plus`,(e,t)=>e+t),Wf(t,`-`,`Minus`,(e,t)=>e-t),Wf(t,`*`,`Times`,(e,t)=>e*t),Wf(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}),Wf(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(Mf(r))throw Nf(`${t} \\div ${n}`);return r}),Wf(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}),jf(`..`,(e,t)=>{let r=Hf(t,n);return{kind:`Interval`,low:Hf(e,n),high:r}})]},ev=$_(`Naturals`),tv=$_(`Integers`),nv=e=>{let t=ev.indexOf(e);return t===-1?void 0:tv[t]},rv=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[Vf(Kf(`<`,(e,t)=>e<t),t(`LT`)),Vf(Kf(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),Vf(Kf(`<=`,(e,t)=>e<=t),t(`LE`)),Vf(Kf(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},iv=[Of(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...ev,...rv(`Naturals`)],av=[Of(`Int`,{kind:`InfiniteSet`,name:`Int`}),...tv,...rv(`Integers`),Y(`-.`,1,e=>{let t=Hf(J(e,0,`-`),Q_);if(Mf(-t))throw Nf(`-${t}`);return-t})],ov=(t,n,r)=>{let i=J(t,n,r),a=Rl(i);if(!a)throw new e.A(`${r}\n${W(q(i))}`);return a},sv=(e,t,n)=>{let r=J(e,t,n);return typeof r==`string`?r:ov(e,t,n)},cv=(e,t,n)=>{let r=J(e,t,`SubSeq`);if(typeof r!=`number`)throw Cf(n,`SubSeq`,`natural number`,r);return r},lv=(e,t,n)=>typeof e==`string`?Ls(e.slice(t,n)):ol(e.slice(t,n)),uv=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,dv=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,fv=(e,t)=>{let n=Ze.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Vf(e,t):e}):t},pv=t=>fv(`Sequences`,[Y(`Seq`,1,e=>({kind:`SequenceSet`,base:J(e,0,`Seq`)})),Y(`Len`,1,e=>sv(e,0,uv(``,`Len`)).length),Y(`\\o`,2,t=>{let n=sv(t,0,dv(`s \\o t`,`sequence`));if(typeof n!=`string`){let e=ov(t,1,dv(`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&&rc(r)===`tuple`?r:ol([...n,...e])}let r=J(t,1,`\\o`);if(typeof r!=`string`)throw new e.A(`${dv(`t \\o s`,`string`)}\n${W(q(r))}`);return Ls(n+r)}),Y(`Append`,2,e=>ol([...ov(e,0,dv(t===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),J(e,1,`Append`)])),Y(`Head`,1,t=>{let n=ov(t,0,uv(``,`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=sv(t,0,uv(``,`Tail`));if(n.length===0)throw new e.A(`Attempted to apply Tail to the empty sequence.`);return lv(n,1)}),Y(`SubSeq`,3,t=>{let n=sv(t,0,uv(`first `,`SubSeq`)),r=cv(t,1,`second`),i=cv(t,2,`third`);if(r>i)return lv(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${W(q(J(t,0,`SubSeq`)))}\n, but instead it is\n${a.value}`);return lv(n,r-1,i)}),kf(`SelectSeq`,2,t=>{let n=Df(t,1,`SelectSeq`);return ol(ov(t,0,uv(`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}))})]),mv=t=>fv(`FiniteSets`,[Y(`IsFiniteSet`,1,e=>Fl(J(e,0,`IsFiniteSet`))),Y(`Cardinality`,1,n=>{let r=J(n,0,`Cardinality`);if(!is(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new e.A(`Attempted to compute cardinality of the value\n${W(q(r))}`);return Nl(r,t)})]),hv=[Vf(Y(`Warshall`,1,t=>{let n=J(t,0,`Warshall`);if(!is(n)||Bs(n))throw new e.A(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${W(q(n))}`);Nl(n);let r=[],i=/* @__PURE__ */ new Map,a=e=>{let t=ku(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=Rl(t);if(n?.length!==2)throw new e.A(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${W(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 Wc(r.flatMap((e,t)=>r.flatMap((n,r)=>s[t][r]?[ol([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],gv=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return hv;if(e===`AnySet`)return[Of(`ANY`,Ws)];if(e===`IOUtils`)return Fg(r,a);if(e===`_TLCTrace`)return Rg(r);if(!B_(n.version).has(e))return;let o=yv(e,t,n,r,i);return e===`Randomization`&&o?[...o,l_(n)]:o},_v=/* @__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`]]]),vv=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]]]),yv=(e,t,n,r,i)=>{switch(e){case`Naturals`:return iv;case`Integers`:return av;case`Sequences`:return pv(n.version);case`FiniteSets`:return mv(n.version);case`TLC`:return fv(`TLC`,I_(t,n));case`Randomization`:return u_(n);case`_Possible`:return T_(t,n);case`Json`:return Pg(r);case`Bags`:return fv(`Bags`,ag(i));case`TLCExt`:return fv(`TLCExt`,w_(t,n));default:return}},bv=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&Xf.get(t)||[];r.expressions.push(...i,t);let a=Bl.sets,o=a??[],s=o.length;Bl.sets=o;try{return n()}catch(e){throw Xx(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,Bl.sets=a}},xv=(e,t,n)=>e.coverage?Ud(e.coverage,t,n):-1,Sv=(e,t,n)=>e.coverage?Gd(e.coverage,t,n):n(),Cv=(e,t,n,r)=>Sv(e,t,()=>$(n,r)),wv=(e,t,n,r)=>{let i=Cv(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},Tv=(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},Ev=e=>!e.includes(void 0),Dv=e=>e.variables.map(()=>void 0),Ov=(e,t,n)=>{let r=[...e];return r[t]=n,r},kv=(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}},Av=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,jv=e=>e.kind===`Identifier`?e.name:void 0,Mv=(e,t,n)=>{if(t.kind===`Label`)return Mv(e,t.body,n);let r=jv(t);if(r===void 0)return;let i=Nb(n,r);if(i?.kind===`Thunk`)return Mv(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=wx(r,e);return o?.kind===`Closure`&&o.params.length===0?Mv(e,o.body,o.scope):void 0},Nv=(e,t,n)=>{if(t.kind===`Prime`)return Mv(e,t.expression,n);if(t.kind===`Label`)return Nv(e,t.body,n);let r=jv(t);if(r===void 0)return;let i=Nb(n,r);if(i?.kind===`Thunk`)return Nv(e,i.expression,i.scope);if(i)return;let a=wx(r,e);return a?.kind===`Closure`&&a.params.length===0?Nv(e,a.body,a.scope):void 0},Pv=t=>{if(typeof t!=`boolean`)throw new e.x(`TLC expected a boolean expression.`);return t},Fv=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Iv=(e,t,n,r)=>{let i=Rv(e,t,n,r);return i&&e.coverage&&!e.isInit&&Wd(e.coverage,r),i},Lv=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(Wd(r,n),Wd(r,r.roots[n])),e.onState(t),!0},Rv=(e,t,n,r)=>t===void 0?Ev(n)?Lv(e,n,r):e.onIncomplete?.(n)??!1:Ev(n)&&Fv(e)?Bv(e,t,n,r):t.kind===`Predicate`?Vv(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?ry(e,t.expression,t.rest,t.scope,n,t.node):zv(e,t,n)&&Iv(e,t.rest,n,t.node),zv=(e,t,n)=>{let r=e.environment,i=Cv(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return Cv(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?Mb(t,r.runtime.version):t}})();try{return!Bc(i,a)}catch(t){throw e.callStack&&Xx(e.callStack,[i],t),t}},Bv=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return ry(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?zv(e,i,n):Pv(Cv(e,i.node,i.expression,Tv(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return Lv(e,n,r)},Vv=(e,t,n,r,i,a)=>Hv(e,t,n,r,i,xv(e,a,t)),Hv=(t,n,r,i,a,o)=>bv(t,n,()=>{switch(n.kind){case`Let`:{let e=Tv(t,i,a),s=n.definitions,c=t.coverage&&!t.isEnabled?Vx(s,e,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):Vx(s,e);return Vv(t,n.body,r,c,a,o)}case`Label`:return Vv(t,n.body,r,i,a,o);case`Selection`:return Vv(t,n.expression,r,i,a,o);default:if(Xv.has(n.kind))throw new e.x(`The state relation is not a boolean expression.`);return bv(t,n,()=>ty(t,n,r,i,a,o))}}),Uv=(e,t,n,r,i)=>Pv(t)&&Iv(e,n,r,i),Wv=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),Gv=(e,t,n,r,i,a)=>{let o=Tv(e,r,i);if(t.kind===`Identifier`){let s=Nb(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return Vv(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return Vv(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:wx(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&ph(c,e.environment))?Vv(e,l.body,n,l.scope,i,a):Uv(e,wv(e,a,t,o),n,i,a)}let s=Tx(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=Sv(e,a,()=>Lx(s,t.args,o));return Vv(e,s.body,n,r,i,a)}let c=Wv.has(t.operator)?Cv(e,a,t,o):wv(e,a,t,o);return Uv(e,c,n,i,a)},Kv=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?Iv(e,t,Ov(n,r,i),a):Bc(o,i)&&Iv(e,t,n,a)},qv=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),Jv=(t,n,r,i,a,o)=>{let[s,c]=n.args,l=t.isInit?Mv(t.environment,s,i):Nv(t.environment,s,i),u=Tv(t,i,a);if(l===void 0)return Cv(t,o,n,u)===!0&&Iv(t,r,a,o);let d=Cv(t,o,c,u),f=a[l];if(n.operator===`=`)return Kv(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 Cv(t,o,n,u)===!0&&Iv(t,r,a,o);if(!ll(p))throw new e.x(`The right side of \\IN is not enumerable.`);let m=Tl(p),h=t.generator;if(h){let e=$v(t,p,m);for(let n=0;n<e.length;n++){let i=Iv(t,r,Ov(a,l,e[n]),o);if(h.kept>0)return i}}let g=t.coverage&&tf(t.coverage,p,m,!1),_=m.reduce((e,n)=>(g?.next(),Iv(t,r,Ov(a,l,n),o)||e),!1);return g?.next(),_},Yv=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Xv=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Zv={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},Qv=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:Zv[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)}`},$v=(e,t,n)=>{let r=e.environment.runtime,i=t_(n.length,t,r.getRandom(),r.version);return e.coverage&&ef(e.coverage,t,n.length,i),i},ey=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=Sv(e,r,()=>$b(t.bounds,e=>{let t=$(e,n);return{value:t,elements:Xb(t,e,a)}})),s=o.map(e=>e.elements);tx(t.bounds,s,n.scope,e=>(i.push(e),!1));let c=e.coverage;return{bindings:i,charge:c&&rf(c,o.map(e=>e.value),s)}},ty=(t,n,r,i,a,o)=>{let s=Tv(t,i,a);switch(n.kind){case`Identifier`:return Gv(t,n,r,i,a,o);case`Apply`:return Yv.has(n.operator)&&n.args.length===2?Jv(t,n,r,i,a,o):n.operator===`=>`&&n.args.length===2?Pv(Cv(t,o,n.args[0],s))?Vv(t,n.args[1],r,i,a,o):Iv(t,r,a,o):Gv(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)=>qv(`Predicate`,t,i,o,e),r);return Vv(t,e[0],n,i,a,o)}let s=e[e.length-1];return Hv(t,kv(n,e.length-1),qv(`Predicate`,s,i,o,r),i,a,Av(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=Gg(c.random),f=!1;for(let p=0;p<l;p++){let m=(u+p*d)%l;if(f=(s||m===1?Vv(t,e[s?m:e.length-1],r,i,a,o):Hv(t,kv(n,e.length-1),r,i,a,Av(t,o)))||f,c.kept>0)return f}return f}if(s)return e.reduce((e,n)=>Vv(t,n,r,i,a,o)||e,!1);let l=Hv(t,kv(n,e.length-1),r,i,a,Av(t,o)),u=Vv(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=Sv(t,o,()=>$b(n.bounds,e=>$(e,s))).map((e,r)=>$v(t,e,Jb(e,n.bounds[r].set,i))),l=!1;return tx(n.bounds,c,s.scope,i=>(l=Vv(t,n.body,r,i,a,o)||l,e.kept>0)),l}let i=ey(t,n,s,o);return i.bindings.reduce((e,s)=>(i.charge?.(),Vv(t,n.body,r,s,a,o)||e),!1)}case`Forall`:{let e=ey(t,n,s,o),i=e.bindings;if(i.forEach(()=>e.charge?.()),i.length===0)return Iv(t,r,a,o);let c=i.slice(1).reduce((e,t)=>qv(`Predicate`,n.body,t,o,e),r);return Vv(t,n.body,c,i[0],a,o)}case`If`:return Vv(t,Pv(Cv(t,o,n.condition,s))?n.consequent:n.alternative,r,i,a,o);case`Case`:{let c=n.arms.find(e=>Pv(Cv(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 Vv(t,c,r,i,a,o)}case`FunctionApplication`:{let e=cx(Cv(t,o,n.function,t.isInit?s:Lb(s)));if(e){let i=Sv(t,o,()=>lx(e,n,s));return Vv(t,e.body,r,i,a,o)}break}case`Unchanged`:if(!t.isInit)return ry(t,n.expression,r,i,a,o);break;case`BoxAction`:if(!t.isInit){let e=Vv(t,n.action,r,i,a,o);return ry(t,n.subscript,r,i,a,o)||e}break;case`AngleAction`:if(!t.isInit)return Vv(t,n.action,qv(`Changed`,n.subscript,i,o,r),i,a,o)}let c=t.isEnabled?Qv(n):void 0;if(c!==void 0)throw new e.x(c);return Uv(t,Cv(t,o,n,s),r,a,o)},ny=(e,t,n)=>e.runtime.warn(vo.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${Q(n)}`),ry=(e,t,n,r,i,a)=>bv(e,t,()=>{let o=xv(e,a,t),s=Mv(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;e.isEnabled&&e.coverage&&Wd(e.coverage,o);let a=i[s];return a!==void 0&&!Bc(a,r)?(ny(e.environment,s,t),!1):Kv(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return Iv(e,n,i,o);let c=s.reduceRight((e,t)=>qv(`Unchanged`,t,r,o,e),n);return ry(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=Nb(r,t.name);if(a?.kind===`Thunk`)return ry(e,a.expression,n,a.scope,i,o);let s=a?void 0:wx(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return ry(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=Tv(e,r,i),s=Tx(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return ry(e,s.body,n,Lx(s,t.args,a),i,o)}let c=e.environment,l=Cv(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=Cv(e,o,t,{environment:c,scope:r,state:i,next:void 0});return Bc(l,u)&&Iv(e,n,i,o)}),iy=(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}),ay=/* @__PURE__ */ Error(`The replay found a successor`),oy=(e,t,n,r)=>{let i=()=>{throw ay},a=r.coverage?.current??-1,o=iy(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=qv(`Changed`,e.subscript,t,a,void 0);Vv(o,e.action,n,t,Dv(r),a)}else Vv(o,e,void 0,t,Dv(r),a);return!1}catch(e){if(e!==ay)throw e;return s&&(s.expressions.length=c,s.isFrozen=!1),!0}},sy=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=iy(t,`init`,void 0,n,r),s=a.reduceRight((e,t)=>qv(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);Vv(o,i.expression,s,i.scope,Dv(t),i.node??-1)},cy=(e,t,n,r)=>{if(e.some(e=>Xv.has(e.expression.kind)))return;let i=n.coverage;e.forEach(e=>{let a=[],o=e.node??-1;ly(e,o,t,n,e=>{i&&o!==-1&&i.primary[o]++,a.push(e)}),a.forEach(t=>r(t,e))})},ly=(e,t,n,r,i,a,o)=>{let s=iy(r,`next`,n,i,a,o);Vv(s,e.expression,void 0,e.scope,Dv(r),t)},uy=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(Mv(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=Nb(r,e.name)?void 0:wx(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,Vx(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`){Nv(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=Nb(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?Tx(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:wx(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,Lx(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??[])},dy=/* @__PURE__ */ new WeakMap,fy=/* @__PURE__ */ new WeakMap,py=(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},my=(e,t,n)=>{let r=e.slice();return r[t]=n,r},hy=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,gy=(t,n)=>{let r=new e.x(n);return t.isInit?r:e.at(r,e.nt.error)},_y=(e,t,n,r)=>{let i=Sb(n);return r&&Xv.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 ${hy(e)}, TLC expected a boolean expression,\nbut instead found ${q(t)}.\n${i}`},vy=(e,t,n)=>{let r=zf(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 ${hy(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
1791
|
+
`:``}${i}`},yy=(e,t,n)=>Sy(e,t,$(t,n)),by=new Set(Z_.map(e=>e.name)),xy=e=>e.kind===`Apply`?by.has(e.operator):e.kind!==`Identifier`&&!Xv.has(e.kind),Sy=(t,n,r,i=!0)=>{if(typeof r==`boolean`)return r;let a=_y(t,r,n,i);throw t.isInit&&i&&xy(n)?new e.B(a):gy(t,a)},Cy=(e,t,n,r)=>r.environment.callStack?$(n,r):(e[t]??=rS(n,r.environment))(r),wy=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Ty=(e,t,n)=>{let r=n?dy:fy,i=r.get(e);if(i)return i;let a=ab(e,t,n),o=n?void 0:ib(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},Ey=(e,t)=>{if(t.constants.has(e))return;let n=Wb(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},Dy=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return Dy(e.expression,t,!1,r);if(e.kind!==`Identifier`||j(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Ey(e.name,t);if(a&&!r.has(a))return r.add(a),Dy(a.body,t,n,r)},Oy=(e,t,n)=>Dy(e,t,!n),ky=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return ky(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Vx(e.definitions,py(r,t,n));return ky(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Nb(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return ky(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=Ey(e.name,r.environment);if(s)return ky(s.body,void 0,n,r,i)},Ay=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||j(e))||!t&&e.kind===`Prime`,jy=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>jy(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=Ey(e.name,t);if(i)return n.add(e.name),jy(i.body,t,n)},My=/* @__PURE__ */ new Set([`Label`,`Selection`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Ny=(e,t,n)=>My.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||wy(e.operator)&&(Ay(e.args[0],n)||Oy(e.args[0],t,n)!==void 0)||j(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,Py=/* @__PURE__ */ new Set,Fy=(e,t)=>{if(j(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return cp(e,(e,i)=>{let a=r?Fy(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];a?n.push(...a):r=!1}),r?n:void 0},Iy=(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||j(e)?void 0:Wb(r,t);return i&&!n.has(i)&&(n.add(i),Iy(i.body,t,n))?!0:He(e).some(e=>Iy(e,t,n))},Ly=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Oy(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=jy(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return Ny(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Ty(e,t,n)}},Ry=(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(xh(e,t)===void 0||Iy(e,t,/* @__PURE__ */ new Set))return!0;let n=Fy(e,Py);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)}},zy=(e,t,n)=>{let r=e.map(e=>Ly(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Fv(t);for(let s=e;s<r.length;s++){if(s>0&&f&&sb(u)){d??=py(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&&!Bc(t,i[e.index])}):void 0;if(o){ny(t.environment,o.index,o.expression);return}let s=n.expression,c=Cy(a,e,s,d);if(!Sy(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=py(t,n,u);let r=Cy(i,s,e.expression,d);if(!Sy(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=py(t,n,u);let r=Cy(i,s,e.value,d),a=u[e.index];if(a===void 0)u=my(u,e.index,r),d=void 0;else if(!Bc(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(!Bc(e,n[i.index])){ny(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)},By=e=>{let t=Qv(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw gy(n,t);yy(n,e,py(n,r,i))&&s(i,a)}},Vy=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=py(r,i,a);if(a[l]!==void 0){yy(r,e,u)&&c(a,o);return}let d=$(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!ll(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${hy(r)}, the right side of \\IN is not enumerable.`;throw gy(r,`${t}\n${Q(e)}`)}let p=Tl(f);if(r.generator){for(let e of t_(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(my(a,l,e),o),r.generator.kept>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(my(a,l,p[e]),o)}},Hy=/* @__PURE__ */ new WeakMap,Uy=e=>{let t=Hy.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Uy),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Hy.set(e,n),n},Wy=(e,t)=>{let n=e.args[0],r=By(e),i=(e,r,i)=>ky(n,r,i,e,!t)??-1,a=Vy(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],py(t,n,o));l(my(o,u,d),s)}},Gy=(e,t,n)=>{let r=Q(e);return(i,a,o,s,c,l)=>{let u=py(i,a,o),d=$(e.function,n?u:Lb(u)),f=cx(d);if(f!==void 0){Ty(f.body,t,n)(i,lx(f,e,u),o,s,c,l);return}if(!os(d))throw gy(i,`In computing ${hy(i)}, a non-function (${zf(d)}) was applied as a function.\n${r}`);let p=$(e,u);if(typeof p!=`boolean`)throw gy(i,`In computing ${hy(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Ky=(e,t)=>{let n=Uy(e);return jy(e,t)?zy([n],t,!1):e.kind===`Tuple`?Ty(n,t,!1):(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Nb(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){Ty(Uy(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=py(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=Tx(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){Ty(Uy(n.body),t,!1)(r,Lx(n,e.args,u),a,o,s,c);return}}yy(r,n,u)&&c(a,o)}},qy=(e,t,n)=>{let r=e.operator,i=By(e),a=j(e)?void 0:wx(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=cS(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=Ty(a.body,t,n),o(e,i(py(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=py(a,o,s),f=Tx(e,d);f?.kind===`Closure`?Ty(f.body,t,n)(a,Lx(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Jy=(e,t,n)=>{let r=By(e),i=j(e)?void 0:Ey(e.name,t),a;return(o,s,c,l,u,d)=>{let f=Nb(s,e.name);f?.kind===`Thunk`&&!f.isReleased?Ty(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&yx(i,t)!==void 0?r(o,s,c,l,u,d):(a??=Ty(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},Yy=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||j(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`||!j(i))return;let a=Dy(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},Xy=e=>e.kind===`And`?e.operands.flatMap(Xy):[e],Zy=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&Ny(e,t,!1),Qy=e=>{let t=[];return(n,r,i)=>{let a=py(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!Sy(n,i,Cy(t,r,i,a)))return}}},$y=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=Xy(e),r=n.findIndex(e=>!Zy(e,t)||Yy(e,t)),i=r===-1?void 0:Yy(n[r],t);return i?{...i,before:r===0?void 0:Qy(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>$y(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`||j(e))return;let r=wx(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=$y(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`||!j(o))return;let s=i.before,c=s&&cS(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(py(e,t,n)),n))}},eb=(e,t,n)=>{let r=Nb(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},tb=(e,t,n)=>{let r=e.map(e=>Ty(e,t,n)),i=n?[]:e.map(e=>$y(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&&eb(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)}}},nb=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=Gg(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},rb=(e,t)=>{let n=Ty(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=py(r,i,a),u=t.runtime.version,d=$b(e.bounds,e=>$(e,l)).map((n,r)=>t_(Jb(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,Fb(i,l,e)))};f(d.length-1,i)}},ib=(e,t)=>{if(e.kind===`Exists`)return rb(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>Ty(e,t,!1));return e.isBulleted?nb(n):n.reduce((e,t)=>nb([e,t]))},ab=(t,n,r)=>{let i=e=>Ty(e,n,r);switch(t.kind){case`And`:return zy(t.operands,n,r);case`Or`:return tb(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=Jb($(a.set,py(r,i,o)),a.set,n.runtime.version);for(let n=0;n<u.length&&!r.isStopped;n++)e(r,Pb(i,t,u[n]),o,s,c,l)}}let o=r?void 0:Ry(t,n);if(o){let e=zy(o.rest,n,r);return(r,i,a,s,c,l)=>{let u=py(r,i,a),d=$b(t.bounds,e=>Jb($(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=Pb(n,o.names[t],e);if(t===d.length-1){let e=py(r,i,a);if(!o.guards.every(t=>yy(r,t,e)))continue}f(t-1,i)}};f(d.length-1,i)}}return(n,r,i,a,o,s)=>{nx(t.bounds,py(n,r,i),t=>(e(n,t,i,a,o,s),n.isStopped))}}case`Forall`:{let e=i(t.body),a=!r&&xh(t,n)!==void 0&&!Iy(t.body,n,/* @__PURE__ */ new Set)?Fy(t,Py):void 0;return(n,r,i,o,s,c)=>{let l=[];nx(t.bounds,py(n,r,i),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Nb(r,e)?.kind===`Value`)){u.every(e=>yy(n,t.body,py(n,e,i)))&&c(i,o);return}let d=(r,i,a)=>{r===u.length?c(i,a):r>0&&n.isInit&&sb(i)?u.slice(r).every(e=>yy(n,t.body,py(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,py(r,i,a));if(typeof l!=`boolean`)throw gy(r,vy(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=py(r,i,a),u=e.find(e=>{let t=$(e.condition,l);if(typeof t==`boolean`)return t;throw gy(r,`In computing ${hy(r)}, a non-boolean expression${r.isEnabled?``:` `}(${zf(t)}) was used as a guard condition of a CASE.\n${Sb(e.source)}`)})?.body??n;if(!u)throw gy(r,`In computing ${hy(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=Ux(t.definitions,n),a={impure:/* @__PURE__ */ new Set,streamed:r.streamed};return(n,i,o,s,c,l)=>e(n,Vx(t.definitions,py(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 ${yb(t)}`)}:Ky(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 yy(e,r,py(e,t,i))}catch(t){throw e.isEnabled?Mb(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 tb([t.action,Uy(t.subscript)],n,r);case`Label`:return i(t.body);case`Selection`:return i(t.expression);case`Identifier`:return Jy(t,n,r);case`FunctionApplication`:return Gy(t,n,r);case`Apply`:{let e=t.args;if(wy(t.operator)){let i=Oy(e[0],n,r);if(i!==void 0)return t.operator===`=`?zy([t],n,r):Vy(t,()=>i);if(Ay(e[0],r))return Wy(t,r)}if(t.operator===`=>`){let n=i(e[1]);return(r,i,a,o,s,c)=>{let l=$(e[0],py(r,i,a));if(typeof l!=`boolean`){let e=zf(l),n=Q(t);throw gy(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 qy(t,n,r)}default:return By(t)}},ob=e=>e.variables.map(()=>void 0),sb=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},cb=(t,n)=>{let r=n.state;if(!r||!sb(r))throw new e.x(`ENABLED needs a complete state at ${yb(t)}`);let i=n.environment;if(i.callStack||i.coverage&&i.coverage.current!==-1)return oy(t,n.scope,r,i);let a={environment:i,isInit:!1,isEnabled:!0,current:r,isStopped:!1,generator:void 0,successors:0};return Ty(t,i,!1)(a,n.scope,ob(i),void 0,!1,()=>{a.isStopped=!0}),a.isStopped},lb=(t,n,r,i,a)=>{let o={environment:n,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};Ty(t,n,!0)(o,i,ob(n),void 0,!1,t=>{if(!o.isStopped){if(!sb(t)){if(a){o.isStopped=a([...t]);return}throw e.at(new e.C([...t]),e.nt.error)}o.isStopped=r(t)}})},ub=(e,t,n)=>{let r=[];return lb(e,t,e=>(r.push(e),!1),n),r},db=(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)},fb=(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 Ty(e,n,!1)(c,i,ob(n),void 0,!1,(e,t)=>{if(!c.isStopped){if(!sb(e)){if(s){s(e,t);return}throw db(e,t,n)}c.successors++,c.isStopped=r({state:e,action:t})}}),c.successors},pb=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return Ty(e,n,!1)(i,r,ob(n),void 0,!1,e=>{sb(e)||i.successors++}),i.successors>0},mb=(e,t,n,r)=>{let i=[];return fb(e,t,n,e=>(i.push(e),!1),r),i},hb=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),gb=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),_b=e=>gb.has(e.kind)||e.kind===`Apply`&&hb.has(e.operator),vb=(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&&as(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},yb=e=>`line ${e.location.line}, column ${e.location.column}`,Q=t=>{let n=t.location.range;return n?e.X(n):yb(t)},bb={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},xb=(t,n)=>new e.x(`TLC encountered a temporal formula (${t}) when evaluating a predicate or action.\n${Q(n)}`),Sb=e=>e.kind===`Number`?e.text??String(e.value):Q(e),Cb=(t,n)=>new e.x(`A non-boolean expression (${zf(n)}) was used as the condition of an IF.\n${Q(t)}`),wb=(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 (${zf(r)}) was used as a formula in a ${t.kind===`And`?`conjunction`:`disjunction`}.\n${Sb(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${zf(r)}.\n${Q({...t,location:{...t.location,range:{...i,end:a}}})}`)},Tb=t=>{let n=t.field,r=e=>`Attempted to select nonexistent field "${n}" from the record\n${W(q(e))}\n${Q(t)}`,i=e=>`Attempted to apply function:\n${W(q(e))}\nto argument "${n}", which is not in the domain of the function.`;return a=>{if(!os(a))throw new e.x(`Attempted to select field "${n}" from a non-record value ${W(q(a))}\n${Q(t)}`);let o=rc(a);if(o===`tuple`)throw eu(n);return cu(a.kind===`LazyFunction`?K(a):a,n,o===`record`?r:i)}},Eb=e=>e===`1.7.4`?(t,n)=>Zl(t,n,e):void 0,Db=t=>n=>{if(!os(n))throw new e.x(`Attempted to apply the operator DOMAIN to a non-function\n(${zf(n)})\n${Q(t)}`);return uu(n)},Ob=(t,n)=>(r,i)=>{if(!is(r)||Bs(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)},kb=t=>e.at(new e.x(`TLC can't handle real numbers.\n${t.text}`),e.nt.configParseError),Ab=t=>e.at(new e.x(`TLC can't handle a number this big.\n${t.text??t.value}`),e.nt.error),jb=(t,n)=>new e.z(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${Q(n)}`,t),Mb=(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,Nb=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},Pb=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Fb=(t,n,r)=>{if(n.kind===`Name`)return Pb(t,n.name,r);let i=Rl(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)=>Pb(e,t,i[n]),t)},Ib=(t,n)=>{if(os(t))return t;throw new e.x(`A non-function (${zf(t)}) was applied as a function.\n${Q(n)}`)},Lb=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},Rb=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),zb=(t,n)=>{if(typeof t!=`boolean`)throw new e.x(`Expected ${n} to be a boolean but found ${q(t)}`);return t},Bb=(t,n,r)=>{if(typeof t!=`boolean`)throw new e.x(`Attempted to evaluate an expression of form P => Q when ${r} was\n${zf(t)}.\n${Q(n)}`);return t},Vb=(t,n)=>{if(typeof t!=`boolean`)throw new e.x(`Attempted to apply the operator ~ to a non-boolean\n(${zf(t)})\n${Q(n)}`);return!t},Hb=(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},Ub=(t,n)=>{if(typeof t!=`boolean`)throw new e.x(`TLC expected a boolean value, but did not find one. ${Sb(n)}`);return t},Wb=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),Gb=(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.`},Kb=(t,n,r)=>{if(!is(t)||Bs(t)){let i=q(t),a=r===`1.7.4`?void 0:Gb(t,i);throw new e.x(a===void 0?`TLC encountered a non-enumerable quantifier bound\n${i}.\n${Sb(n)}`:`TLC encountered the non-enumerable quantifier bound\n${i}\n${Sb(n)}\n${a}`)}},qb=(e,t,n)=>(Kb(e,t,n),typeof e==`object`&&e.kind===`Interval`?nl(e):_l(e)??Cl(e)),Jb=(e,t,n)=>n===`1.7.4`?(Kb(e,t,n),_l(e)??Tl(e)):qb(e,t,n),Yb=e=>{if(typeof e==`object`&&e.kind===`Interval`)return Nl(e),e},Xb=(e,t,n)=>Yb(e)??Jb(e,t,n),Zb=(e,t,n)=>Yb(e)??qb(e,t,n),Qb=(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},$b=(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),[]),ex=(e,t)=>$b(e,e=>Xb($(e,t),e,t.environment.runtime.version)),tx=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Qb(t[n],t=>i(n-1,Fb(a,e[n].pattern,t)));return i(e.length-1,n)},nx=(e,t,n)=>tx(e,ex(e,t),t.scope,n),rx=(e,t,n,r)=>{let i=$b(e,e=>{let n=$(e,t);return{value:n,elements:Xb(n,e,t.environment.runtime.version)}}),a=i.map(e=>e.elements),o=rf(n,i.map(e=>e.value),a);return tx(e,a,t.scope,e=>(o(),r(e)))},ix=(e,t)=>{let n=$b(e,e=>$(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},ax=(e,t,n)=>{if(e.length===1)return Fb(t,e[0].pattern,n);let r=Rl(n)??[];return e.reduce((e,t,n)=>Fb(e,t.pattern,r[n]),t)},ox=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,sx=e=>Object.assign(e.value,{lambda:e}),cx=e=>ox(e)?e.lambda:void 0,lx=(t,n,r)=>{let i=t.value,a=n.args.map(e=>$(e,r)),o=a.length===1?a[0]:ol(a),s=(e,t,r)=>`In applying the function\n${W(q(i))},\nthe ${e} is:\n${W(q(t))}${r}.\n${Q(n.function)}`,c=t.bounds;if(c.length===1){if(!Ul(o,i.domain))throw new e.x(s(`first argument`,o,`which is not in its domain`));return ax(c,t.scope,o)}let l=Rl(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${W(q(i))},\nthe argument list is:\n${W(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(!Ul(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`&&Rl(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 ax(c,t.scope,o)},ux=(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:Sb(t)}},dx=(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}},fx=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},px=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),mx=(e,t)=>{let n=ix(e.bounds,t),r=(n,r)=>$(e.body,Rb(t,ax(e.bounds,Pb(void 0,e.name,r),n))),i=t.environment.coverage,a=i&&!t.environment.callStack?i.current:-1,o=fx(n,i?(e,t)=>i.current===-1?r(e,t):Gd(i,a,()=>r(e,t)):r,dx(ux(e.bounds,e.body),e.bounds,n),px(e.bounds));sx({value:o,bounds:e.bounds,body:e.body,scope:Pb(void 0,e.name,o)});let s=Object.assign(o,{rebind:n=>{let r=mx(e,{...t,environment:n});return r.enumerated=o.enumerated,r}});return e.bounds.length===1?ic(s):s},hx=(t,n)=>{if(typeof n!=`object`||rc(n)!==`lambda`||t.kind===`Operator`||t.isSelfReferential||n.kind!==`LazyFunction`||!as(n.domain))return n;try{let e=K(n);return ec(e.domain,e.range)}catch(t){if(t instanceof e.x)return n;throw t}},gx=(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 rS(t.body,n);let r=Be(t,!1);if(!t.isSelfReferential)return rS(r,n);let i=e=>mx(t,e),a=n.coverage;return a?tS(r,i,a):i},_x={name:``,binding:{kind:`Value`,value:!1},parent:void 0},vx=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=gx(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=e.kind===`Operator`&&e.params.length===0&&vh(e.body,t)?e=>(i===void 0?void 0:a[i])??r(Rb(e,uS(e.scope)?void 0:_x)):i===void 0?e=>r(Rb(e,void 0)):e=>a[i]??r(Rb(e,void 0));return t.definitionEvaluators.set(e,o),o},yx=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},bx=(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)||!mh(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(()=>hx(t,gx(t,n)(a)));Rc(e),n.startupValues[i]=e}catch(t){if(!(t instanceof e.x)&&!e.tt(t))throw t}}),xx=(t,n)=>{if(n===void 0||t===n)return!0;try{return n.every((e,n)=>e===void 0||t?.[n]!==void 0&&dc(t[n],e))}catch(t){if(t instanceof e.x)return!1;throw t}},Sx=(e,t)=>{let n=e.cache;if(n!==void 0&&xx(t.state,e.state)&&xx(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?Gd(r,i,()=>$(e.expression,Rb(t,e.scope))):$(e.expression,Rb(t,e.scope));return(!e.isStreamed||Dl(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},Cx=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),wx=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return wx(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Cx(r):t.builtins.get(e)},Tx=(e,t)=>j(e)?Ex(e.operator,t):wx(e.operator,t.environment)??Ex(e.operator,t),Ex=(e,t)=>{let n=Nb(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return wx(e,t.environment)},Dx=e=>e.kind===`Closure`?e.params.length:e.arity,Ox=(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:Ex(r,n);if(!i)throw new e.x(`Expected an operator argument at ${yb(t)}`);return i},kx=(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)=>Pb(e,n.name,t[r]),e.scope);return $(e.body,Rb(n,r))},Ax=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Dx(e),call:n=>kx(e,n,t)},jx=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Ex(e.name,t);return n!==void 0&&Dx(n)>0},Mx=(e,t)=>e.map(e=>jx(e,t)?Ax(Ox(e,t),t):$(e,t)),Nx=(t,n)=>new e.x(`Operator ${t.name} expects ${t.params.length} arguments but received ${n}`),Px=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),Fx=(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 Fx(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([])}},Ix=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&us(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=Px(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=j(e)?void 0:Fx(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=Nb(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:Px(e,t)}}return t=>Px(e,t)},Lx=(e,t,n,r)=>{if(t.length!==e.params.length)throw Nx(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:Ox(t[a],n)}:(r?.[a]??Ix(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},Rx=(e,t,n,r)=>e.kind===`Closure`?$(e.body,Rb(n,Lx(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>$(e,n))):e.isLazy?e.evaluate(oS(t,n),n):e.evaluate(Mx(t,n),n),zx=e=>e.kind===`Operator`&&e.isRecursive&&e.params.length>0,Bx=(e,t,n)=>{let r=n;for(let n=0;n<e.length;n++)zx(e[n])&&(t[n].parent=r,r=t[n]);for(let n=0;n<e.length;n++)zx(e[n])||(t[n].parent=r,r=t[n]);return r},Vx=(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=Bx(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:Be(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},Hx=(t,n,r)=>{let i=Nb(r.scope,t);if(i?.kind===`Value`)return i.value;if(i?.kind===`Thunk`)return Sx(i,r);if(i?.kind===`Operator`){if(Dx(i.operator)===0)return kx(i.operator,[],r);throw new e.x(`Operator ${t} is used without arguments`)}let a=Fx(t,r.environment);if(a?.kind===`Variable`){let e=r.state?.[a.index];if(e===void 0)throw jb(t,n);return e}if(a?.kind===`Value`)return a.value;if(a?.kind===`Definition`)return vx(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)}`)},Ux=(e,t)=>({impure:new Set(e.filter(e=>_h(e,t,`varying`))),streamed:new Set(e.filter(e=>_h(e,t,`streamed`)))}),Wx=e=>[...e.facts.ids.keys()].some(t=>_h(t,e)),Gx=e=>[...e.facts.ids.keys()].some(t=>_h(t,e,`repeated`)),Kx=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,qx=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),Jx=e=>t=>{let n=e(t);return dc(n,e(qx(t)))},Yx=(t,n,r,i)=>a=>{i.expressions.push(t);let o=Bl.sets,s=Bl.callStack,c=o??[],l=c.length;Bl.sets=c,Bl.callStack=i;try{let e=n(a),o=Kx(e)?e.rebind(r):e;return i.values.set(t,o),typeof o==`object`&&o.kind!==`FilteredSet`&&_b(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=vb(t,i.values),o=a&&!He(t).some(e=>e===r)?i.values.get(a):void 0,s=t.kind===`FunctionApplication`&&o!==void 0&&!os(o)?void 0:o;throw Xx(i,[s,...c.slice(l).filter(e=>e!==s)],n),n}finally{i.isFrozen||i.expressions.pop(),c.length=l,Bl.sets=o,Bl.callStack=s}},Xx=(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},Zx=(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}},Qx=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}}),$x=(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 wb(e,i,s);if(s!==o)return n.isFrozen||(n.expressions.length-=a.length-Math.max(i-1,0)),s}return o}},eS=(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)}},tS=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=Ud(n,i,e);Wd(n,a),n.current=a;try{let i=t(r),o=e.kind===`SetEnumeration`||(e.kind===`SetFilter`||e.kind===`SetMap`)&&as(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}},nS=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=PS(e,t),i=t.callStack,a=i&&Xf.get(e),o=i?Yx(e,r,t,i):r,s=i&&a?eS(e,a,o,i):o,c=t.coverage,l=c?tS(e,s,c):s;return t.evaluators.set(e,l),l},rS=(e,t)=>{if(t.callStack||t.coverage)return nS(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=Uh(e,t)??nS(e,t);return t.entryEvaluators.set(e,r),r},$=(e,t)=>rS(e,t.environment)(t),iS=(e,t)=>{let n=e.name,r=j(e)?void 0:Fx(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw jb(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??=vx(e,t))(r)}return t=>Hx(n,e,t)},aS=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||j(e))return!0;let n=wx(e.name,t);return n===void 0||Dx(n)===0},oS=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>$(e,t),expression:e})),sS=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(oS(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&aS(t[0],n)){let e=nS(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&aS(t[0],n)&&aS(t[1],n);if(i&&a){let e=nS(t[0],n),r=nS(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(Mx(t,n),n)},cS=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw Nx(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Ix(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:Ox(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},lS=(e,t,n)=>{let r=cS(e,t,n),i;return t=>(i??=rS(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},uS=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},dS=/* @__PURE__ */ new Set([`\\cup`,`\\cap`,`\\`]),fS=(t,n)=>{let r=t.args;if(t.operator===`=>`){let e=nS(r[0],n),i=nS(r[1],n);return n=>!Bb(e(n),t,`P`)||Bb(i(n),t,`Q`)}if(t.operator===`~`&&r.length===1){let e=nS(r[0],n);return n=>Vb(e(n),t)}if(t.operator===`<=>`){let e=nS(r[0],n),i=nS(r[1],n);return n=>Hb(e(n),i(n),t)}if(t.operator===`~>`||t.operator===`-+->`)return()=>{throw xb(t.operator===`~>`?`a ~> b`:`a -+-> formula`,t)};let i=j(t)?void 0:wx(t.operator,n);if(i?.kind===`Closure`)return lS(i,r,n);if(i?.kind===`Builtin`&&i.name===`DOMAIN`){let e=nS(r[0],n),i=Db(t);return t=>i(e(t))}if(i?.kind===`Builtin`&&i.name===`TLCEval`&&r.length===1){let e=!Yf.has(t)&&!Sh(r[0],n),a=n.tlcEvalValues;return n=>{if(!e||!uS(n.scope))return i.evaluate(oS(r,n),n);let o=a.get(t);if(o!==void 0)return o;let s=i.evaluate(oS(r,n),void 0);return a.set(t,s),s}}if(i?.kind===`Builtin`&&i.name===`\\subseteq`&&i.evaluateBinary&&r.length===2){let e=nS(r[0],n),a=nS(r[1],n),o=Ob(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=>!Ul(e,r));return Kd(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&&dS.has(t.operator)&&r.length===2){let e=nS(r[0],n),i=nS(r[1],n);return n=>{let r=e(n),s=i(n);return qd(a,t.operator,r,s,o(r,s))}}if(i?.kind===`Builtin`)return sS(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=>Ix(e,n));return i=>{let a=Ex(t.operator,i);if(a)return Rx(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 ${yb(t)}`)}},pS=(e,t)=>{let n=e.kind===`Forall`,r=nS(e.body,t),i=e.bounds[0],a=t.coverage;if(a)return t=>rx(e.bounds,t,a,i=>Ub(r(Rb(t,i)),e)!==n)?!n:n;if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=nS(i.set,t);return s=>Qb(Xb(o(s),i.set,t.runtime.version),t=>Ub(r(Rb(s,Pb(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=$b(o,e=>Xb(nS(e,t)(a),e,t.runtime.version)),c=(t,o)=>t<0?Ub(r(Rb(a,o)),e)!==n:Qb(s[t],e=>c(t-1,Pb(o,i[t],e)));return c(o.length-1,a.scope)?!n:n}}return t=>nx(o,t,i=>Ub(r(Rb(t,i)),e)!==n)?!n:n},mS=(e,t)=>{if(e.kind===`Tuple`)return ol(e.names.map(e=>{let n=Nb(t,e);return n?.kind===`Value`&&n.value}));let n=Nb(t,e.name);return n?.kind===`Value`?n.value:void 0},hS=/* @__PURE__ */ new WeakSet,gS=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&hS.add(e)},_S=/* @__PURE__ */ new WeakMap,vS=e=>{if(_S.has(e))return _S.get(e);let t=/* @__PURE__ */ new Set,n=e=>{if(e.kind===`Subexpression`)return!1;let r=Ue(e);return r!==void 0&&t.add(r),e.kind===`ExceptAt`&&t.add(`@`),He(e).every(n)},r=n(e)?[...t]:void 0;return _S.set(e,r),r},yS=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=Nb(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),bS=e=>hS.has(e),xS=(t,n)=>{let r=bS(t),i=nS(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(Rb(t,Pb(t.scope,n,e)));if(ns(e))return Nl(e),rs(e,r),p(e,t);let a=il(e),s=ec(a,a.map(r));return as(e)?s:(s.lambdaDomain=e,ic(s))}let n=[],r=$b(a,(n,r)=>Zb(a.length>1&&typeof e==`object`&&e.kind===`ProductSet`?e.factors[r]:e,n,t.environment.runtime.version));return tx(a,r,t.scope,e=>{let r=a.length===1?mS(o.pattern,e)??!1:ol(a.map(t=>mS(t.pattern,e)??!1));return n.push([r,i(Rb(t,e))]),!1}),Yc(n)},l=ux(a,t.body),u=px(a),d=vS(t.body),f=n.coverage,p=(e,r)=>{let o=yS(r.scope,d),s=Rb(r,o),c=e=>i(Rb(s,ax(a,o,e))),p=f&&!n.callStack?f.current:-1,m=sx({value:fx(e,f?e=>f.current===-1?c(e):Gd(f,p,()=>c(e)):c,dx(l,a,e),u),bounds:a,body:t.body,scope:o});return a.length===1?ic(m):m},m=n.callStack;return{build:(n,i)=>{if(t.isRecursive||r||i.isKeepLazy||!pl(n))return p(n,i);if(!(a.length===1?as(n):typeof n==`object`&&n.kind===`ProductSet`&&n.factors.every(as))){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 Zx(m,t,e),e}},createLazy:p}},SS=(e,t)=>{let n=xS(e,t).build,r=e.bounds,i=t.coverage;if(i)return t=>{let a=ix(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(as)&&i.current!==-1&&i.covered.has(e)&&af(i,i.current,s),o};if(r.length===1&&r[0].pattern.kind===`Name`){let e=nS(r[0].set,t);return t=>n(e(t),t)}return e=>n(ix(r,e),e)},CS=(e,t)=>{let n=hS.has(e);n&&gS(e.function);let r=nS(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=>nS(e,t))}),value:nS(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):ol(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Rb(i,Pb(i.scope,`@`,e))):du(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(vo.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${Q(e.function)}`)}return n}},wS=(t,n)=>{let r=nS(t.predicate,n),i=t.bound.pattern,a=Sb(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`&&Rl(t)?.length!==i.names.length)throw new e.x(`Attempted to check if the value:\n${W(q(t))}\nis an element of a set of ${i.names.length}-tuples.`);let o=l(Rb(r,Fb(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},nS(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)=>Gd(s,t?-1:u,()=>d(e,t)),startPass:e=>{let t=Xd(s,n);return r=>{t?.next(),Qd(s,n,r),s.secondary[u]++;let i=Gd(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)},TS=e=>j(e)||e.kind===`OperatorReference`||He(e).some(TS),ES=(e,t)=>e.bound.pattern.kind===`Name`&&!t.coverage&&!TS(e.predicate)&&!gh([e.predicate],t,`varying`),DS=(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 ${zf(t)}.\n${Sb(n.predicate)}`);return t},OS=(t,n,r,i)=>{if(!is(t)||Bs(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 zc(t),Zb(t,r,i)},kS=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)}`),AS=(t,n)=>{if(t.kind===`SetFilter`){let e=nS(t.predicate,n),r=nS(t.bound.set,n),i=wS(t,n),a=t.bound.pattern,o=n.coverage,s=ES(t,n);return n=>{let c=r(n);if(!as(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(Rb(n,Fb(n.scope,a,i)));if(DS(o,t))ts(l,i);else if(s)break}return o&&Kd(o,c,d+1),$s(l)}}if(t.kind===`SetMap`){let e=nS(t.expression,n),r=n.coverage;return n=>{let i=[],a=t=>(ts(i,e(Rb(n,t))),!1);return r?rx(t.bounds,n,r,a):nx(t.bounds,n,a),Wc(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=nS(t.body,n),a=nS(r,n),o=n.coverage;return n=>{let s=a(n),c=OS(s,t,r,n.environment.runtime.version),l=o&&tf(o,s,c,!0),u,d=t.pattern;if(Qb(c,r=>{if(l?.next(),d.kind===`Tuple`&&Rl(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=Fb(n.scope,d,r);return Ub(i(Rb(n,a)),t)?(u=mS(d,a),!0):!1}),u!==void 0)return u;throw l?.next(),kS(t)}},jS=e=>[...e].sort((e,t)=>qs(e.name,t.name)),MS=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),NS=(e,t)=>{let n=jS(e),r=e.map(e=>nS(e.value,t));if(MS(n))return t=>sl(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=>gs(i,t,r.map(t=>t(e)),a)}return e=>cl(i,r.map(t=>t(e)))},PS=(t,n)=>{let r=e=>nS(e,n);switch(t.kind){case`Number`:{let e=t.value;return us(e)?()=>e:()=>{throw Ab(t)}}case`Decimal`:return()=>{throw kb(t)};case`String`:{let e=t.value;return()=>e}case`Identifier`:return iS(t,n);case`Apply`:return fS(t,n);case`Bracket`:return()=>{throw new e.x(`A bracket without a function or subscript is not an expression at ${yb(t)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new e.x(`An operator cannot be used as a value at ${yb(t)}`)};case`And`:{let e=t.operands.map(r);return $x(t,e,n.callStack)??(n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw wb(t,r,i);if(!i)return!1}return!0})}case`Or`:{let e=t.operands.map(r);return $x(t,e,n.callStack)??(n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw wb(t,r,i);if(i)return!0}return!1})}case`Prime`:{let e=r(t.expression);return t=>e(qx(t))}case`Unchanged`:return Jx(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 Cb(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 (${zf(n)}) was used as a condition of a CASE. ${Sb(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(Rb(n,Vx(t.definitions,n)))}case`Forall`:case`Exists`:return pS(t,n);case`UnboundedQuantifier`:return()=>{let n=t.quantifier===`Forall`?`\\A`:`\\E`;throw t.isTemporal?xb(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 AS(t,n);case`SetEnumeration`:{let e=t.elements.map(r);return t=>Wc(e.map(e=>e(t)))}case`Tuple`:{let e=t.elements.map(r);return t=>ol(e.map(e=>e(t)))}case`FunctionConstruction`:return SS(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 NS(t.fields,n);case`RecordSet`:{let e=jS(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 CS(t,n);case`ExceptAt`:return n=>{let r=Nb(n.scope,`@`);if(r?.kind!==`Value`)throw new e.x(`@ appears outside an EXCEPT at ${yb(t)}`);return r.value};case`FunctionApplication`:{gS(t.function);let e=r(t.function),i=n=>Ib(e(Lb(n)),t),a=t.args.map(r),o=Eb(n.runtime.version);if(a.length===1){let e=a[0];return t=>cu(i(t),e(t),o)}return e=>cu(i(e),ol(a.map(t=>t(e))),o)}case`FieldAccess`:{let e=r(t.record),n=Tb(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=Jx(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=>cb(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 ${yb(t)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw xb(bb[t.kind],t)}}},FS=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},IS=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Su(e[t]),16777619),r=Math.imul(r^Ou(e[t]),1540483477);t[0]=FS(n)||1,t[1]=FS(r)},LS=()=>{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)}}},RS=e=>({slots:new Int32Array(1<<17),size:0,shift:16,states:e}),zS=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=pu(t,Su(e[n]));return t&1073741823},BS=(e,t)=>{for(let n=0;n<t.length;n++)if(!pc(e[n],t[n]))return!1;return!0},VS=(e,t)=>Math.imul(t,2654435761)>>>e.shift<<1,HS=(e,t,n)=>{let r=e.slots.length-1;for(let i=VS(e,t);;i=i+2&r){let r=e.slots[i+1];if(r===0)return-1;if(e.slots[i]===t&&BS(e.states[r-1],n))return r-1}},US=(e,t,n)=>{let r=e.slots.length-1,i=VS(e,t);for(;e.slots[i+1]!==0;)i=i+2&r;e.slots[i]=t,e.slots[i+1]=n},WS=(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&&US(e,t[n],t[n+1])}US(e,t,n+1)},GS=(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}},KS=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),qS=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return GS(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},JS=e=>Atomics.load(e.used,0)*2>=e.slots.length,YS=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&GS(t,n);return{slots:t,used:e.used}},XS={kind:`Boolean`,value:!0},ZS={kind:`Boolean`,value:!1},QS=e=>e?XS:ZS,$S=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,eC=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,tC=(e,t)=>({kind:e,body:t}),nC=(e,t,n)=>({kind:e,operands:[t,n]}),rC=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?rC(e,t.operands).operands:[t])}),iC=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return iC(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,iC(t)),0)}},aC=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 aC(e.body);case`And`:case`Or`:return e.operands.some(aC)}},oC=/* @__PURE__ */ new WeakMap;let sC=0;const cC=e=>{let t=oC.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`#${sC++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(cC).join(`,`)})`;default:return`${e.kind}(${cC(e.body)})`}})();return oC.set(e,n),n},lC=(e,t)=>e===t||cC(e)===cC(t),uC=(e,t)=>{let n=cC(t);return e.some(e=>e===t||cC(e)===n)},dC=e=>e===`And`?`Or`:`And`,fC=(e,t)=>{switch(e.kind){case`Boolean`:return t?QS(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?tC(`Not`,e):e;case`Not`:return fC(e.body,!t);case`And`:case`Or`:return rC(t?dC(e.kind):e.kind,e.operands.map(e=>fC(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return tC(n,fC(e.body,t))}}},pC=e=>{switch(e.kind){case`Boolean`:return QS(!e.value);case`Not`:return e.body;case`And`:case`Or`:return rC(dC(e.kind),e.operands.map(pC));case`Always`:return tC(`Eventually`,pC(e.body));case`Eventually`:return tC(`Always`,pC(e.body));default:return tC(`Not`,e)}},mC=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=mC(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return QS(t)}return n.length===0?QS(!t):n.length===1?n[0]:rC(e.kind,n)}case`Not`:{let t=mC(e.body);return t.kind===`Boolean`?QS(!t.value):tC(`Not`,t)}case`Always`:case`Eventually`:{let t=mC(e.body);return tC(e.kind,t.kind===e.kind?t.body:t)}default:return e}},hC=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,gC=t=>{switch(t.kind){case`And`:{let n=[],r=1;for(let i of t.operands){let t=gC(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=>rC(`And`,e))}}case`Or`:{let e=[],n=[];for(let r of t.operands){let t=gC(r);for(let r of t.kind===`Or`?t.operands:[t]){let t=hC(r);t?e.push(t):n.push(r)}}if(e.length>0){let t=e.length===1?e[0]:rC(`Or`,e);n.push(tC(`Always`,tC(`Eventually`,t)))}return rC(`Or`,n)}case`Not`:return $S(t.body)?t:gC(pC(t.body));default:return t}},_C=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?_C(e.operands[0]):rC(e.kind,e.operands.map(_C));case`Not`:return e.body.kind===`Not`?_C(e.body.body):tC(`Not`,_C(e.body));case`Always`:case`Eventually`:case`Next`:return tC(e.kind,_C(e.body));default:return e}},vC=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return vC(e.operands[0]);let t=Math.floor(e.operands.length/2);return nC(e.kind,vC(rC(e.kind,e.operands.slice(0,t))),vC(rC(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return tC(e.kind,vC(e.body));default:return e}},yC=(e,t)=>{e.kind===`Eventually`&&!uC(t,e)&&t.push(e),`body`in e&&yC(e.body,t),`operands`in e&&e.operands.forEach(e=>yC(e,t))},bC=e=>{let t=e.filter(eC),n=e.flatMap(e=>e.kind===`Not`&&eC(e.body)?[e.body]:[]);return!t.some(e=>uC(n,e))},xC=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,tC(`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},SC=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:tC(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},CC=(e,t,n)=>e.flatMap(e=>{let r=SC(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),wC=e=>[...new Set(e.map(cC))].sort().join(`|`),TC=(e,t)=>{let n=new Set(t.map(wC));return[...e.filter(e=>!n.has(wC(e))),...t]},EC=e=>{let t=xC(e),n=CC(t,`Always`,`And`),r=CC(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=SC(t,`Eventually`,`Or`);if(n&&!(uC(e,n.first)||uC(e,n.second)))return TC(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(uC(e,t.first)||uC(e,t.second))&&!uC(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!bC(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=SC(t[e],`Always`,`And`);n&&(uC(t,n.first)||t.push(n.first),uC(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)uC(t,e.first)&&uC(t,e.second)&&!uC(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!bC(t)?[]:i(t)};return a(e)},DC=e=>({particle:e,successors:[],statePredicates:e.filter(e=>iC(e)<=1)}),OC=e=>{let t=EC([e]).map(DC),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=wC(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 EC(n)){let n=wC(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(DC(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},kC=(e,t)=>!uC(e,t)||uC(e,t.body),AC=(t,n)=>{if(t.kind===`Eventually`&&t.body.kind===`Always`&&iC(t.body.body)<3){n.eventuallyAlways.push(t.body.body);return}let r=hC(t);if(r){let e=iC(r);if(e<=1){n.infinitelyOftenStates.push(r);return}if(e===2){n.infinitelyOftenActions.push(r);return}}if(aC(t))throw new e.x(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);n.formulas.push(t)},jC=(e,t)=>{let n=e.findIndex(e=>lC(e,t));return n===-1?(e.push(t),e.length-1):n},MC=e=>{let t=gC(mC(fC(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=_C(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])AC(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:rC(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:lC(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&vC(e.formula),n=[];t&&yC(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>jC(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>jC(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>jC(i,e))}));return{tableau:t&&OC(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},NC=()=>e.at(new e.x(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.nt.livenessEvaluationFailure),PC=/* @__PURE__ */ new Set([`~>`,`-+->`]),FC=/* @__PURE__ */ new WeakSet,IC=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),LC=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),RC=(t,n)=>new e.x(`TLC cannot handle the temporal formula ${Q(t)}${n===void 0?``:`:\n${n}`}`),zC=(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=zC(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=Nb(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=Wb(e,n);if(t)return yh(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:j(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return ip(e,(e,o)=>(a=Math.max(a,zC(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(PC.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=j(e)?void 0:wx(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,Lx(o,e.args,LC(n,t)))}default:return l(e)}},BC=(t,n)=>{try{return ex(t,n)}catch(t){if(!(t instanceof e.x))throw t;if(!ko(t))return;throw e.at(new e.x(`${e.G}${t.message}`),e.nt.error)}},VC=(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)=>VC(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,HC(t,n,r));if(t.kind===`Identifier`){let i=j(t)?Nb(n,t.name):void 0;if(i?.kind===`Thunk`&&!i.isReleased)return o(i.expression,i.scope,FC.has(i)?t.name:a.name);let s=r.constants.has(t.name)?void 0:Wb(t.name,r);if(!i&&s?.kind===`Operator`&&s.params.length===0&&(yh(s,r)>0||yx(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=LC(r,n);if(t.kind===`Apply`&&r.runtime.version!==`1.7.4`&&(i||zC(t,n,r)===3)){let e=Tx(t,s),n=j(t)?void 0:Wb(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,Lx(e,t.args,s),a.isSubstituted&&n?n.name:t.operator,a.expanding,n)}let c=i&&t.kind===`Forall`&&t.bounds.every(e=>zC(e.set,n,r)===0),l=c?BC(t.bounds,s):void 0;if(c&&l){let e=[];if(tx(t.bounds,l,n,n=>(e.push(...o(t.body,n,Q(t.body))),!1)),e.length===0)throw NC();return e}return[{expression:t,scope:n,name:a.name,path:a.path}]},HC=(e,t,n)=>{let r=Vx(e.definitions,LC(n,t),Ux(e.definitions,n));for(let n=r;n&&n!==t;n=n.parent){n.binding.kind===`Thunk`&&FC.add(n.binding);let t=n.name,r=e.definitions.find(e=>e.name===t);r&&Sd.set(n,r)}return r},UC=(t,n,r)=>{let i=r.runtime.version===`1.7.4`,a=(t,n,a)=>{let o=a===0&&!i?zC(t,n,r):a;if(o===0){let i=$(t,LC(r,n));if(typeof i!=`boolean`)throw new e.x(`TLC expected a boolean value, but did not find one. ${Sb(t)}`);return QS(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=iC(c),u=l===0&&zC(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=LC(r,t),o=j(e)||Wb(n,r)===void 0?Nb(t,n):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&FC.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:j(e)?Ex(n,a):wx(n,r),u=e.kind===`Apply`?e.args:[],f=c?.kind===`Builtin`&&u.length===2?IC.get(c.name):void 0;if(f){let n=u.map(e=>p(e,t));return d(e,t,rC(f,n))}if(c?.kind!==`Closure`)throw RC(e);let m=!j(e)&&Wb(n,r)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>$(e,a)),s(c.body,Lx(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:RC(t)}},u=(t,n)=>{let i=zC(t,n,r),o=[],s=t.kind===`Forall`;try{nx(t.bounds,LC(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 RC(t,s&&!ko(r)?r.message:void 0)}return o.length===0?QS(s):d(t,n,rC(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=iC(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,rC(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,rC(e.kind,[a,p(o,t)]))},p(n[0],t))},p=(e,t)=>{let n=zC(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,HC(e,t,r));case`Apply`:{let n=e.args;if(e.operator===`~`&&!j(e))return d(e,t,tC(`Not`,p(n[0],t)));if(e.operator===`=>`)return d(e,t,nC(`Or`,tC(`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&&zC(e.condition,t,r)===0){let n=$(e.condition,LC(r,t));if(typeof n==`boolean`)return p(n?e.consequent:e.alternative,t)}let n=p(e.condition,t);return d(e,t,nC(`Or`,nC(`And`,n,p(e.consequent,t)),nC(`And`,tC(`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===`~>`?tC(`Always`,nC(`Or`,tC(`Not`,p(e.args[0],t)),tC(`Eventually`,p(e.args[1],t)))):c(e,t);case`Always`:case`Eventually`:return tC(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=tC(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?tC(`Always`,tC(`Eventually`,nC(`Or`,i,a))):nC(`Or`,tC(`Eventually`,tC(`Always`,i)),tC(`Always`,tC(`Eventually`,a)))}default:throw RC(e)}};return p(t,n)},WC=t=>({holdsState:(n,r)=>{let i={environment:t,scope:n.scope,state:r,next:void 0},a=n.kind===`State`?$(n.expression,i):cb(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&&Bc($(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}}),GC=(t,n,r,i,a)=>{let o=e=>GC(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 GC(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`)}},KC=(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)=>KC(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 GC(e,t[r],t[a(r)],WC(i),/* @__PURE__ */ new Map)}},qC=`UnnamedAction`,JC={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},YC=e=>{let t=e.range??JC;return sl([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},XC=(e,t)=>{let n=[[`name`,e.name],[`location`,YC(e.location)]];return e.parameters.length>0&&n.push([`context`,sl(e.parameters)],[`parameters`,ol(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),sl(n)},ZC=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),QC=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),$C=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,ew=e=>e.kind===`Apply`?e.args:[],tw=(e,t,n)=>{let r=$C(e);if(r===void 0)return;if(j(e)){let e=Nb(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=wx(r,n);return i?.kind===`Closure`?i:void 0},nw=(t,n)=>{try{return $(t,QC(n,void 0)),!0}catch(t){if(t instanceof e.b)return!1;throw t}},rw=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&mh(e,t)&&nw(e.body,t),iw=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&rw(e,t),aw=(e,t)=>{let n=Wb(e.name,t);return n?.body===e.body&&iw(n,t)},ow=(e,t)=>{if(e.kind!==`Identifier`||!j(e))return;let n=Nb(t,e.name);return n?.kind===`Thunk`?n:void 0},sw=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:HC(e,t,n)};let r=ow(e,t);return r&&{expression:r.expression,scope:r.scope}},cw=(e,t,n,r)=>t.kind===`Apply`?Lx(e,t.args,QC(r,n)):e.scope,lw=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Nb(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),uw=(t,n)=>{try{return t()}catch(t){if(t instanceof e.b)return n();throw t}},dw=(e,t,n,r,i)=>{let a=ew(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=>zC(e,n,i)!==0)?o():uw(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),$(e,QC(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},fw=(t,n,r,i,a)=>{let o=()=>({name:r?.name??qC,location:t.location,parameters:lw(r,n),expression:t,scope:n});if(Xv.has(t.kind))throw e.at(new e.x(`${e.K}The next state relation is not a boolean expression.\n${Sb(t)}`),e.nt.error);switch(t.kind){case`Let`:return fw(t.body,HC(t,n,i),r,i,a);case`Label`:return fw(t.body,n,r,i,a);case`Selection`:return t.location.range===void 0?fw(t.expression,n,r,i,a):[o()];case`Or`:return t.operands.flatMap(e=>fw(e,n,r,i,a));case`Exists`:return uw(()=>{let e=[];return nx(t.bounds,QC(i,n),n=>(e.push(...fw(t.body,n,r,i,a)),!1)),e.length===0?[o()]:e},()=>[o()])}let s=j(t)?void 0:a.get($C(t)??``),c=tw(t,n,i);if(s)return dw(s,t,n,c,i);if(!c)return[o()];let l=ew(t),u=j(t)?c.name===`$subexpression`?`LAMBDA`:c.name:i.instanceNames.get($C(t)??``)??c.name,d=()=>[{name:u,location:t.location,parameters:[],expression:t,scope:n}];return aw(c,i)||l.some(e=>zC(e,n,i)!==0)?d():uw(()=>{let e=l.reduce((e,t,r)=>({name:c.params[r].name,binding:{kind:`Value`,value:$(t,QC(i,n))},parent:e}),c.scope);return fw(c.body,e,{...c,name:u},i,a)},d)},pw=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>pw(e,t,n,r,i,o),s=(e,t,n)=>ZC(e,Zf(t,a),n),c=sw(e,t,n);if(c){o(c.expression,c.scope);return}let l=tw(e,t,n);if(l&&aw(l,n))return;let u=l?[...a,...Xf.get(l.body)??[]]:a;if(l&&l.params.length===0){if(zC(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,Lx(l,e.args,QC(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(qC,e,t));return}let d=zC(e,t,n);d<=1?r.inits.push(s(qC,e,t)):d===3&&r.temporals.push(s(qC,e,t))},mw=(e,t,n,r,i)=>{let a=(t,n)=>mw(e,t,n,r,i),o=sw(t,n,r);if(o){a(o.expression,o.scope);return}let s=tw(t,n,r);if(s&&aw(s,r))return;if(s&&s.params.length===ew(t).length){a(s.body,cw(s,t,n,r));return}if(t.kind===`Forall`&&uw(()=>(nx(t.bounds,QC(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(ZC(e,a)):zC(a,n,r)<2?i.invariants.push(ZC(e,a)):i.impliedTemporals.push(ZC(e,t));return}let c=zC(t,n,r);c<=1?i.impliedInits.push(ZC(e,t)):c===3&&i.impliedTemporals.push(ZC(e,t))},hw=(e,t)=>{let n=Wb(e,t);return n?.kind===`Operator`&&!iw(n,t)?n:void 0},gw=(e,t,n)=>{let r={inits:[],actions:[],temporals:[]},i=[],a=e.specification===void 0?void 0:hw(e.specification,t);a&&(pw(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:qC,location:e.frames[0].location,parameters:[],expression:Zf(e.expression,e.frames),scope:e.scope}]:fw(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:wx(e.init,t);o?.kind===`Closure`&&r.inits.push(ZC(e.init??``,o.body));let s=e.next===void 0?void 0:wx(e.next,t);return s?.kind===`Closure`&&r.actions.push(...fw(s.body,s.scope,s,t,n)),r},_w=(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=sw(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&j(e)?Nb(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!j(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=tw(e,t,n);if(!s||s.params.length!==ew(e).length)return!0;let c=Wb(s.name,n);return c?.body===s.body&&rw(c,n)?!0:i(s.body,cw(s,e,t,n))};return i(e,t)?r:void 0},vw=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>q(e[1])).join(`,`)})`,yw=(t,n,r=!1)=>`${t.name===qC?r?`Initial predicate`:`Action`:t.name}${n===`1.7.4`?``:vw(t)} ${e.X(t.location.range??JC)}`,bw=e=>`${e.name}${vw(e)}`,xw=(e,t,n,r)=>{let i={invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]};t.invariants.forEach(e=>{let t=hw(e,n);t&&i.invariants.push(ZC(e,t.body))}),t.properties.forEach(e=>{let t=hw(e,n);t&&mw(e,t.body,void 0,n,i)});let a=n.coverage,o=(e,t)=>Uc(e.map(e=>{let n=a&&t&&bf(a,t,e.expression);return XC(e,n&&sl(n))})),s=e=>Uc(e.flatMap(e=>{let t=hw(e,n);return t?[sl([[`name`,t.name],[`location`,YC(t.location)]])]:[]}));return sl([[`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`,Uc(n.variables.map((e,t)=>sl([[`name`,e],[`location`,YC(r[t])],...a?[[`coverage`,sl([[`distinct`,cf(a,t)]])]]:[]])))],[`actionconstraints`,s(t.actionConstraints)],[`constraints`,s(t.constraints)]])},Sw=2**50,Cw=2**51,ww=(e,t,n,r)=>({fingerprint:e,tableau:t,position:n,stateChecks:r,successors:[],actionChecks:[],stepPositions:[],number:0}),Tw=(e,t,n,r)=>{e.successors.push(t),e.actionChecks.push(n),e.stepPositions.push(r)},Ew=(e,t)=>e.stepPositions[e.successors.indexOf(t)],Dw=e=>{let t=e[e.length-1];return--e.length,t},Ow=(e,t,n,r)=>{let i={initial:[],isPartial:!1},a=t.tableau;if(!a){let t=/* @__PURE__ */ new Map,r=ww(e[0],-1,0,n.getStates(0));Tw(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=ww(e[i],-1,i,n.getStates(i));Tw(a,a,n.getStutters(i),i),Tw(r,a,n.getSteps(i),i),t.set(e[i],a),r=a}else r.successors.includes(a)||Tw(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=ww(e[c],a,c,l);Tw(f,t,u,c),o.push(t),s[a]=t}else f.successors.includes(d)||Tw(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=ww(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?Tw(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},kw=(e,t,n)=>{let r=t.promises,i=t.tableau?.nodes??[],a=[],o=1,s=Sw+1,c=Cw+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]&&kC(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=Dw(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=Dw(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(Ew(n[e-1],n[e]));let _=n[n.length-1];return{positions:h,cyclePosition:g,backPosition:_.fingerprint===t.fingerprint?void 0:Ew(_,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=Dw(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++)kC(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)},y=e=>{let t=Dw(a);if(t===e&&!v(e))return e.number=c++,!1;for(t.number=c;t!==e;)t=Dw(a),t.number=c;return!0},b=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=b(r)),i<t&&(t=i))}return t===e.number&&y(e)&&_(e),t},x=e=>{let t=Dw(a);if(t===e&&!e.successors.includes(e)){e.number=Sw;return}let n=[];for(d=s++,f=c,t.number=d,n.push(t);t!==e;)t=Dw(a),t.number=d,n.push(t);return n},S=e=>{let n=x(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&&b(n[e])}},ee=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?ee(r):r.number;i<t&&(t=i)}return t===e.number&&S(e),t};for(let e of n)if(e.number===0&&ee(e),m)return m},Aw=(e,t,n,r,i)=>{let a=/* @__PURE__ */ new Map,o=(t,n,i)=>(a.clear(),GC(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),BS(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=Ow(t,n[e],l[e],!1),i=kw(t,n[e],r.initial);if(i)return i;r.isPartial&&u.push(e)}for(let e of u){let r=Ow(t,n[e],l[e],!0),i=kw(t,n[e],r.initial);if(i)return i}},jw=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return jw(e.body);case`And`:case`Or`:return e.operands.some(jw);default:return!1}},Mw=e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0,Nw=e=>e.promises.some(e=>jw(e.body))||e.models.some(e=>!Mw(e)),Pw=(e,t)=>e.every((e,n)=>pc(e,t[n])),Fw=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Iw=e=>({data:e(1024),length:0,create:e}),Lw=(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)},Rw=(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}},zw=e=>new Int32Array(e).fill(-1),Bw=(e,t)=>(e.edgeStarts[t]??-1)!==-1,Vw=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},Hw=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,Uw=(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),Ww=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},Gw=2**53-1,Kw=(e,t,n)=>{let r=t.map(e=>UC(e.expression,e.scope,n)),i=e.map(e=>UC(e.expression,e.scope,n)),a=i.map(e=>tC(`Not`,e)),o=a.length===1?a[0]:rC(`Or`,a);return{formula:r.length===0?o:rC(`And`,[...r,o]),checks:i}},qw=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}]:[])}},Jw=(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=>Jw(e,t));return;default:Jw(e.body,t)}},Yw=e=>{let t=/* @__PURE__ */ new Set;for(let n of e)[...n.stateChecks,...n.actionChecks,...n.tableau?.nodes.flatMap(e=>e.statePredicates)??[]].forEach(e=>Jw(e,t));return[...t]},Xw=e=>Yw(e).flatMap(e=>qw(e).map(e=>e.expression)),Zw=(e,t)=>{let n=/* @__PURE__ */ new Set;Jw(e,n);let r=[...n].flatMap(qw);return r.every(e=>e.scope===void 0)?!gh(r.map(e=>e.expression),t,`repeated`):!Gx(t)},Qw=(t,n,r,i,a,o)=>[...new Set(t.filter((t,s)=>{try{return!KC(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))],$w=(e,t,n)=>{if(e.length===0)return;let r=Kw(e,t,n),i=MC(r.formula),a=WC(n),o=Zw(r.formula,n);return{solutions:i,findTraceViolation:(t,s)=>{let c=Aw(t,s,i,a,o);if(!c)return;let l=[],u=Qw(e,r.checks,c.positions.map(e=>t[e]),c.cyclePosition-1,n,l);return{...c,properties:u,failures:l}}}},eT=(e,t,n,r)=>{if(e.length===0)return;let i=Kw(e,t,n),a=Zw(i.formula,n),o=MC(i.formula),s={atoms:WC(n),replay:void 0},c=tT(o,{atoms:{holdsState:(e,t)=>s.atoms.holdsState(e,t),holdsAction:(e,t,n)=>s.atoms.holdsAction(e,t,n)},isShared:a,isSame:Pw,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=WC(e),s.replay=e;try{return t()}finally{s.atoms=WC(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)=>Qw(e,i.checks,t,r,n)}},tT=(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=cC(e),n=a.get(t)??a.size;return a.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:Iw(e=>new Int32Array(e)),edgeActions:Iw(e=>new Uint8Array(e)),stateResults:Iw(e=>new Uint8Array(e)),initial:[],firstNodes:Iw(zw),lastNodes:Iw(zw),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],stateCount:0,errorNode:void 0})),y=(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}),b=(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]}}),x=(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},S=(e,t,n,r,i,a)=>l(n,()=>x(e,t,r,i,a)),ee=(e,t)=>{if(!i)return!1;let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},C=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=Rw(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},te=(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),Rw(i,e[t]-1,e[t+1]))}if(i.slots.set([t+1,n,r],Rw(i,t,n)),t<0)return r;let a=e.lastNodes.data[t]??-1;return a===-1?Lw(e.firstNodes,t,[r]):e.nextSiblings[a]=r,Lw(e.lastNodes,t,[r]),r},ne=(e,t)=>t<0?e.checks.nodes.some((n,r)=>C(e,t,r)!==void 0):e.isDone[t]===!0||(e.firstNodes.data[t]??-1)!==-1,re=(e,t,n)=>(ne(e,t)||e.stateCount++,te(e,t,n,Uw(e,t,n))),ie=(e,t,n,r,i,a)=>{let o=e.edgeTargets.length,s=e.solution.actionChecks.length;Lw(e.edgeTargets,o,n),i.forEach((t,n)=>Lw(e.edgeActions,(o+n)*s,r,t*s,s)),Lw(e.stateResults,e.nodeStates[t]*a.length,a),e.edgeStarts[t]=o,e.edgeCounts[t]=n.length},w={slots:/* @__PURE__ */ new Int32Array},ae=(e,t,i)=>{let a=[...i,{index:e,state:t}],s=16*o;w.slots=w.slots.length===s?w.slots.fill(0):new Int32Array(s);let c=e=>{let t=w.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>=w.slots.length>>1){let e=w.slots;w.slots=new Int32Array(2*e.length+1);for(let t of e)t!==0&&c(t-1)}c(e)&&l++}w.slots.length>s&&o++;let u=[];for(let e of w.slots)e!==0&&u.push(a[e-1]);return u},T=(e,t,n,i,o,s,c)=>{let l=y(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&&b(e,i,n,s,c,n,h(1),0,g,0);for(let r of u.successors){if(!S(e,r,i,n,s,c))continue;if(ee(t,r)&&e.errorNode===void 0&&e.solution.models.some(Mw)){e.errorNode=o;return}let a=C(e,i,r);if(a!==void 0&&p.includes(a))continue;let l=a??re(e,i,r);p.push(l),f.push(0),a===void 0&&T(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);b(e,i,n,s,c,g.state,o,h*a.size,l,h*d);let y=e.isDone[g.index]===!0;for(let n of u.successors){if(!S(e,n,i,g.state,_,0))continue;let r=C(e,g.index,n);if(r!==void 0&&p.includes(r))continue;let a=r??re(e,g.index,n);p.push(a),f.push(v+h),r===void 0&&y&&T(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;ie(e,o,p,t,f,l)}},oe=(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++)x(e,i,n[t].state,r,t*s)&&(c[i*n.length+t]=1)}),ne(e,o)||e.stateCount++,e.isDone[o]=!0;for(let l of Ww(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=C(e,i.index,f);if(l!==void 0&&o.includes(l))continue;let p=l??re(e,i.index,f);o.push(p),u.push(a),l===void 0&&d&&T(e,t,i.state,i.index,p,r,a*s)}}),ie(e,l,o,i,u,a)}return e.errorNode===void 0?void 0:le(e,e.errorNode)},se=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)Uw(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,n)=>{Bw(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n))}),Bw(e,i)||e.stateCount++,ie(e,i,a,n,o,r)},ce=(t,n)=>{if(t.initial.includes(n))return[n];let r=/* @__PURE__ */ new Map,i=[];for(let e of t.initial)Bw(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 Vw(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}Bw(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}`)},le=(e,t)=>Fw(ce(e,t).reverse().map(t=>e.nodeStates[t])),E=(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=>Bw(t,e)),l=[],u=e=>{let n=Vw(t,e).indexOf(e);return n!==-1&&o(e,n)},d=(e,n)=>r.tableau!==void 0&&kC(r.tableau.nodes[t.nodeTableaux[e]].particle,n),f=e=>{let i=l.pop()??e;if(i===e&&!u(i)){s[i]=Gw;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]=Gw,n===e)break}let m=n.infinitelyOftenStates.every(e=>[...c].some(n=>Hw(t,n,e))),h=n.infinitelyOftenActions.every(e=>[...c].some(n=>Vw(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=le(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,y=e=>{u.push(v),v=e};for(;_>0;){let i=_;for(;n.infinitelyOftenStates.forEach((e,n)=>{!p[n]&&Hw(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(Vw(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?(y(e),f.clear(),!0):(s.has(e)&&!f.has(e)&&(l=e),!1)}))break;if(_<i){y(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=Vw(t,n).find(e=>s.has(e)&&!f.has(e))??-1}y(l),f.add(l)}}let b=m(i,v,c);for(let e=u.length-1;e>=0;e--){let n=t.nodeStates[u[e]];b[b.length-1]!==n&&b.push(n)}let x=l[l.length-1];return b[b.length-1]===x&&b.pop(),{prefix:l.slice(0,-1),cycle:[x,...b.reverse()],isCycleConstrained:Nw(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 Vw(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++;Vw(t,a).forEach((e,r)=>{Bw(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++)S(r,a,void 0,t,n,0)&&r.initial.push(C(r,e,a)??re(r,e,a))}},addState:(t,n,r,i)=>{let o=ae(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)=>b(r,t,n,s,c,e.state,l,i*a.size,d,i*u));let f=y(r,t,n,s,c),p=r.solution.tableau;if(i&&(p?Ww(r,t).some(e=>r.edgeCounts[e]>0):o.every(e=>Bw(r,e.index))))throw new e.x(`The behavior graph holds every edge of the state already.`);if(!p){se(r,o,d,f,t);continue}let m=oe(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=C(n,e,t);r!==void 0&&i.push(r)}for(let e of i.sort((e,t)=>e-t))n.nodeStates[e]=t,te(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=E(e,t);if(n)return n}}}},nT=t=>{switch(t.kind){case`Number`:if(!us(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 Xs(t.name);case`Set`:return G({kind:`MixedSet`,elements:t.elements.map(nT)})}},rT=t=>{try{return nT(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)}},iT=(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`)&&dc(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}},aT=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.`),oT=(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=rT(e.value);Rc(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(nT),nT(t.value)]),p.set(n,r)}),p.forEach(e=>c(e).forEach(t=>f(t,iT(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 aT(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 aT(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)),y=(e,t)=>{if(v.has(e))return{key:e,prefix:t};let r=n.copySources.get(e);return r&&y(r.source,t+r.prefix)};n.copySources.forEach((e,t)=>{let r=y(e.source,e.prefix),i=n.definitions.get(t);if(!r||!i)return;let a=i.kind===`Operator`?i.params:[],o=Dp(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 b=i.filter(e=>!u.has(e)&&!m.has(e)&&!d.has(e));if(b.length>0){let t=n.order.getDeclarationOrder(`constant`).find(e=>b.includes(e))??b[0];throw new e.v(`The constant parameter ${t} is not assigned a value by the configuration file.`)}return{constants:u,substitutions:m}},sT=`tlc2/value/impl/`,cT={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},lT={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},uT=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)}},dT=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),fT=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],pT=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??dT.get(e[3])}${`[]`.repeat(e[1].length)}`),mT=(e,t)=>e[e[t].first].text,hT=(e,t)=>mT(e,t).replaceAll(`/`,`.`),gT=t=>{let n=uT(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===cT.utf8?i.text=a.decode(n.readBytes(n.readUint16())):t===cT.integer?i.value=n.readInt32():t===cT.float?n.readUint32():t===cT.long||t===cT.double?(n.readBytes(8),e++):t===cT.class||t===cT.string||t===cT.methodType||t===cT.module||t===cT.package?i.first=n.readUint16():t===cT.methodHandle?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=hT(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=pT(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:uT(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()},()=>hT(r,d.readUint16())):[],p=fT.filter(t=>(e&t[0])!==0).map(e=>e[1]),m=pT(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}},_T=(e,t)=>{let n=e[t],r=e[n.second];return{className:mT(e,n.first),name:e[r.first].text}},vT=(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===cT.integer)return t.value;if(t.tag===cT.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>=lT.iconstM1&&t<=lT.iconst5)s.push(t-lT.iconst0),e+=1;else if(t===lT.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===lT.sipush)s.push(r()<<16>>16),e+=3;else if(t===lT.ldc)s.push(l(o[e+1])),e+=2;else if(t===lT.ldcW)s.push(l(r())),e+=3;else if(t===lT.dup){let t=c();s.push(t,t),e+=1}else if(t===lT.getstatic){let t=_T(n,r());if(t.className!==`${sT}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===lT.invokestatic){let t=_T(n,r()),o=c();if(t.className!==`${sT}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===lT.new)s.push({className:mT(n,r()),value:void 0}),e+=3;else if(t===lT.invokespecial){let t=_T(n,r()),o=c(),s=c();if(!(t.className===`${sT}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===lT.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()},yT=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=gT(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:vT(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)}))}},bT=/* @__PURE__ */ new WeakMap,xT=/* @__PURE__ */ new WeakSet,ST=(e,t)=>{let n=rp(e,t),r=bT.get(e);return r!==void 0&&bT.set(n,r),n},CT=(e,t)=>e.forEach(e=>{let n=t.find(t=>t.isRecursive&&t.name===e.name);n&&bT.set(n,e.arity)}),wT=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`:`}},TT=(e,t,n)=>({operator:e,range:t,args:n,params:n.map(()=>0)}),ET=(t,n)=>new e.I(`${t} at line ${n.line}, column ${n.column}`),DT=(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 DT(e.body,t,[...n,e.definitions],r);if(e.kind===`Lambda`||e.kind===`Selection`)return;let i=bi.get(e),a=e.kind===`Apply`&&i===void 0||e.kind===`FunctionApplication`?[...r,e]:r;for(let o of He(e).slice(0,i)){let i=e.kind===`FunctionApplication`&&o===e.function,s=DT(o,t,n,i?r:a);if(s)return s}},OT=e=>({line:e.line,column:e.column}),kT=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:OT(n)}),e),AT=(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 ET(`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 ET(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:pi,params:e.params,body:t,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:pi,args:e.args,location:n,resolution:fi},location:OT(n)}},jT=(e,t)=>t?.kind===`Operator`?t.params:zp.get(e.operator.slice(e.operator.lastIndexOf(`!`)+1))?.formals,MT=(e,t)=>{if(e.kind!==`Identifier`&&e.kind!==`OperatorReference`)return e;let n=e.kind===`Identifier`?e.name:e.operator,r=Array.from({length:t},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:r,body:{kind:`Apply`,operator:n,args:r.map(t=>({kind:`Identifier`,name:t,location:e.location,resolution:fi})),location:e.location,...e.kind===`Identifier`&&{resolution:e.resolution}},operator:n,location:e.location}},NT=(e,t)=>{if(e.kind===`Function`)return Be(e,t);let n=e.body;if(n.kind!==`Let`||n.location.range||n.body.kind!==`Identifier`)return n;let r=n.body.name,i=n.definitions.find(e=>e.name===r);return i?.kind===`Function`?{...n,body:Be(i,!0)}:n},PT=(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:fi})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:fi}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:fi};return AT({...t,params:[...t.params,...r]},kT(a,t.lets,n))},FT=(t,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s=0,c=-1,l,u=!1,d=0,f=[],p=[],m,h=(t,n)=>{!m&&t&&(m={location:e.X(t),message:n})},g=(t,n,i=!1)=>{let a=r.selectorRanges?.[s];t&&a&&f.push({node:t,error:{location:e.X(a),message:n},isEmpty:i,applications:[...p]})},_=(t,n)=>{if(!t)throw ET(n,a);hi.set(r,{applications:p,nulls:f,error:{location:e.X(t),message:n}}),bi.set(r,d),u=!0},v=e=>o.lets.flat().findLast(t=>t.name===e)??n(e),y=e=>e.kind!==`Let`||e.location.range?e:(o.lets.push(e.definitions),y(e.body)),b=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=>tp(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 _(i&&c&&{...i,end:c.end},`Unknown operator: \`${a.join(`!`)}'.`)},x=e=>{let n=b(e);if(!n){u=!0;return}let f=n.definition,m=bT.get(f)??ji(f),g=s===t.length-1;if(n.args.length!==m){let e=r.argumentRanges?.[s]??a.range,t=`The operator ${M(n.name)} requires ${m-n.earlier} arguments.`;if(!i||n.args.length!==0)return d+=n.earlier,_(e,t);h(e,t)}if(d+=n.args.length,n.args.forEach((e,t)=>vi.set(e,{operator:n.name,index:t,range:r.selectorRanges?.[s]})),g)return{definition:f,args:n.args};let v=f.location.range,y=bT.has(f)&&v?.module===a.range?.module&&ki(a,f.location);if(p.push({operator:n.name,range:r.selectorRanges?.[s],args:n.args,params:y?Array(m).fill(0):Mi(f)}),f.isRecursive&&v&&v.module===a.range?.module&&ki(a,v.end))return _(r.selectorRanges?.[s],`Subexpression of \`${n.name}' used inside the operator's definition.`);o.params.push(...f.kind===`Operator`?f.params:[]),o.args.push(...n.args),l=NT(f,e!==void 0||xT.has(f)),c=s,s++},S=()=>{let e=l;for(;s<t.length&&!u;){let n=t[s];if(n.kind!==`Name`)return;let a=r.selectorRanges?.[s],c=e&&DT(e,n.name,[],[]),u=`Cannot find label \`${n.name}'.`;if(!c)return _(a,u);c.applications.forEach(e=>g(e,u,!0));let f=c.label.params;if(n.args.length!==f.length){let e=`Label \`${n.name}' used with wrong number of arguments.`;if(!i)return _(a,e);h(a,e)}d+=n.args.length,o.lets.push(...c.lets),o.params.push(...f.map(e=>({name:e,arity:0}))),o.args.push(...n.args),p.push(TT(n.name,a,n.args));let m=t[s+1];e=c.label.body,l=m===void 0||m.kind===`Name`?c.label:c.label.body,s++}},ee=e=>{if(!l)throw ET(`Subexpression selection failed`,a);if(e.kind===`Colon`)return;let n=r.selectorRanges?.[s],i=`Choosing operand \`${wT(e)}' of subexpression with no operands.`;if(hi.has(l)){_(n,i);return}if(mi.has(l)&&g(l,i,!0),l=y(l),l.kind===`Label`){l=l.body,ee(e);return}let c=`Nonexistent operand specified by \`${wT(e)}'.`;if(l.kind===`Let`){if(e.kind!==`Operand`||ia(e.operand,1)!==0){_(n,`A LET/IN expression has only one operand.`);return}o.lets.push(l.definitions),l=l.body;return}if(l.kind===`Lambda`&&l.operator!==void 0){_(n,`Trying to select subexpression of an operator argument.`);return}if(l.kind===`Lambda`&&e.kind!==`Bound`&&e.kind!==`At`){let t=e.kind===`Operand`?e.operand:wT(e);_(n,`Cannot use !${t} to select subexpression of a LAMBDA.`);return}if(l.kind===`Lambda`&&e.kind===`Bound`&&e.args.length!==l.params.length){_(n,`Selector with ${e.args.length} arguments used for LAMBDA expression taking ${l.params.length} arguments.`);return}let u=ca(l);if(u&&(e.kind===`Bound`||e.kind===`At`)){if(e.kind===`Bound`&&e.args.length!==u.names.length){_(n,`Selector with ${e.args.length} argument(s) used for quantifier with ${u.names.length} bound identifier(s).`);return}o.params.push(...u.names.map(e=>({name:e,arity:0}))),e.kind===`Bound`&&(d+=e.args.length,o.args.push(...e.args),p.push(TT(``,n,e.args))),l=mi.has(l)&&u.body.kind===`Selection`?u.body.expression:u.body;return}if(l.kind===`Case`){let i=[...l.arms,...l.other?[{condition:void 0,body:l.other}]:[]];if(s===t.length-1){_(n,`Subexpression of CASE must have form !i!j.`);return}let a=e.kind===`Operand`?i[ia(e.operand,i.length)]:void 0;if(!a){_(n,c);return}s++;let o=t[s],u=o.kind===`Operand`?ia(o.operand,2):-1,d=r.selectorRanges?.[s];if(u===-1){_(d,`Second selector for CASE subexpression must specify one of two operands.`);return}let f=u===0?a.condition:a.body;if(!f){_(d,`Selecting OTHER in a CASE statement.`);return}l=f;return}if(l.kind===`Except`&&e.kind===`Operand`&&ia(e.operand,l.updates.length+1)>0){_(n,`Selecting subexpression of an EXCEPT not yet implemented.`);return}let f=u?u.sets:ua(l);if(!f&&l.kind!==`Identifier`){_(n,`Selecting subexpression of expression that has none.`);return}if(e.kind!==`Operand`){_(n,c);return}let m=ia(e.operand,f?.length??0),h=f?.[m];if(!h){_(n,c);return}let b=l.kind===`Apply`?jT(l,v(l.operator))?.[m]?.arity??0:0;l=b>0?MT(h,b):h},C=x(void 0);if(u)return r;if(C)return PT(C.definition,{...o,args:C.args});for(S();s<t.length&&!u;){let e=t[s];if(e.kind===`Name`){for(;l?.kind===`Label`;)l=l.body;if(l&&=y(l),l?.kind!==`Let`)return _(r.selectorRanges?.[s-1],`A name selector here must be from a LET clause.`),r;o.lets.push(l.definitions);let e=x(l.definitions);if(u)return r;if(e)return PT(e.definition,{...o,args:[...o.args,...e.args]});S()}else{if(e.kind===`Colon`&&t[s-1].kind!==`Name`)return _(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 _(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`&&(g(l,`Subexpression selection failed, probably due to an error in the selected expression.`),g(l,`Choosing operand \`${wT(e)}' of subexpression with no operands.`,!0)),ee(e),g(l,`An unexpected null node specified by '${wT(t[s])}'.\nThis is probably due to a previous error.`),s++}}if(u)return r;if(!l)throw ET(`Subexpression selection failed`,a);if(l.kind===`Lambda`&&!i)return _(a.range,`Selected operator argument when expression expected.`),r;let te=o.params.length,ne=o.args.length;if(te!==ne){let e=`Expected ${te} arguments but found ${ne}.`;if(!i||ne>0)return _(a.range,e),r;h(a.range,e)}let re=l.kind===`Lambda`?{...l,body:kT(l.body,o.lets,a)}:kT(l,o.lets,a),ie=e=>({kind:`Selection`,expression:e,location:o.params.length===0&&re.kind!==`Lambda`?a:OT(a)}),w=AT(o,re.kind===`Lambda`?{...re,body:mi.has(l)?re.body:ie(re.body),location:a}:ie(re));return yi.set(w,f),m&&gi.set(w,m),w},IT=(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 aa(e,t,n)},LT=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||He(e).some(LT),RT=(e,t,n,r=!1)=>{if(!LT(e))return e;if(e.kind===`Let`){e.recursive&&CT(e.recursive,e.definitions),e.definitions.forEach(e=>xT.add(e));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=>{let t=ST(e,e=>RT(e,i,a));xT.add(t),r.push(t)});let o={...e,definitions:r,body:RT(e.body,i,a)};return o.instances?{...o,instances:o.instances.map(e=>zT(e,i,a))}:o}let i=e.kind===`Apply`?jT(e,t(e.operator)):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>RT(e,t,n,i!==void 0&&i[r]?.arity!==0))}:ip(e,e=>RT(e,t,n)),o=He(e),s=He(a).every((e,t)=>e===o[t])?e:a,c=s.kind===`Subexpression`?s.selectors:s.kind===`Identifier`?IT(s.name,[],void 0,t):s.kind===`Apply`?IT(s.operator,s.args,s.argumentCounts,t):void 0,l=c?.[0],u=t=>{bi.set(e,t),bi.set(s,t)};if(!c)return s.kind===`Apply`&&s.operator.includes(`!`)&&!t(s.operator)&&u(0),s;let d=c.findIndex(e=>e.kind!==`Name`),f=c.slice(0,d===-1?c.length:d),p=f.some((e,n)=>n>0&&t(f.slice(0,n+1).map(wT).join(`!`)));if(l?.kind===`Name`&&n(l.name)&&!p)return s;if(l?.kind===`Name`&&c[1].kind!==`Name`&&!t(l.name))return u(0),s;let m=FT(c,t,s,r),h=bi.get(s);h!==void 0&&u(h);let g=Fr.get(e);return g&&m!==s&&Fr.set(m,g),m!==s&&mi.set(m,s),m},zT=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:RT(e.expression,t,n,!0)}))}),BT=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},VT=(e,t)=>zT(e,BT(t.definitions),()=>!1),HT=(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]);CT(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 ki(e.location,t)||e.isRecursive&&n!==void 0&&ki(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=BT([...t,...e.definitions]),u=e=>n.has(e),d=BT([...t,...e.definitions,...r]),f=(e,t)=>RT(e,c(d,t),e=>u(e)&&r.every(t=>t.name!==e)),p=e=>{let t=t=>u(t)||!e(t),n=n=>RT(n,e,t),r=e=>{let t=e.map(e=>e.kind===`ModuleFact`?e:n(e));return _i.set(t,e),t},i=n=>n.map(n=>n.kind===`ModuleFact`?n:RT(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 zT(s,e,t);case`Define`:{let t=[],n=p(n=>t.find(e=>e.name===n)??e(n));return{...s,definitions:s.definitions.map(e=>{if(e.kind===`Instance`)return zT(e,n.lookup,n.isProofGoal);let r=ST(e,n.resolveInProof);return t.push(r),r})}}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,isProofGoal:t,resolveInProof:n,resolveFacts:r,resolveDefs:i,resolveStatement:o,resolveStep:s,resolveProof:c}},m=e.definitions.some(e=>LT(e.body))||e.assumptions.some(e=>LT(e.expression));m&&[...e.definitions,...r].toSorted((e,t)=>Ai(e.location,t.location)).forEach(e=>s.set(e,ST(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},UT=(e,t)=>e.maxLevels[t]??3,WT=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=qm({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=>Jp(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Jp(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Yp(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Gp(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)&&Jp(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(Jm(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(Up(e.name,t));i!==void 0&&UT(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=Gp(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=UT(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()])}},GT=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],KT=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),qT=new Map(Ge.flatMap(e=>e.map(t=>[t,e[0]]))),JT=e=>qT.get(e)??e,YT=()=>{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}}},XT=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:Wr(e)&2147483647,kind:t,isLocal:n}),ZT=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:JT(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:JT(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}},QT=(e,t)=>{let n=[];for(let r=t;;){let t=ZT(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},$T=e=>({line:e.line,column:e.column}),eE=(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=QT(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},tE=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,nE={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},rE=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&tE(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&tE(e[n+1],e[n+2])?n+=tE(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=>nE[e])}"`:r.text)}return t},iE=e=>e[2]?.text,aE=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},oE=(e,t)=>e.find(e=>e.name===t)??e.map(e=>oE(e.modules,t)).find(Boolean),sE=e=>{let t=e===void 0?[]:Ee(e),n;return{tokens:t,ranges:aE(t),getModule:()=>n??=e===void 0?Br(``):Vr(e,t)}},cE=(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=sE(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)??Xe.get(i)??R_.get(i)??Rr(e,i),c=a(s),l=c.tokens,u=c.ranges.get(iE(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:()=>oE(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()}},lE=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=QT(t,e+1);i.push({location:$T(t[e]),apply:e=>r.forEach(t=>e.put(XT(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:$T(n),apply:t=>t.put(XT(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`&&QT(t,u+1).every(e=>s.has(e))&&o(u,`definition`),KT.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push($T(n)),i.push({location:$T(n),apply:e=>e.put(XT(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(XT(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=JT(e.name);i.push({location:e.location,apply:n=>n.put(XT(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(XT(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(XT(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>ki(e.location,t.location)?-1:+!!ki(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=YT();n.set(i??``,o),We.toReversed().forEach(e=>o.put(XT(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)}}},uE=(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)}),qe.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=eE(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]),y=/* @__PURE__ */ new Map;rE(s(void 0)).forEach((e,t)=>{t===3&&Ye.forEach(a),a(e)});let b=u(void 0);for(;;){let n=g(b,/* @__PURE__ */ new Set)??_(b,/* @__PURE__ */ new Set);if(!n)break;let[r,i]=n;if(f.add(`${r.key}>${i}`),y.set(r.unit,[...y.get(r.unit)??[],i]),!v.has(i)){if(v.add(i),t(i).tokens.length===0){let n=r.unit??iE(t(void 0).tokens);throw e.q(i,n)}rE(s(i)).forEach(a)}}GT.forEach(a);let x=/* @__PURE__ */ new Set,S=e=>{if(x.has(e))return;x.add(e);let t=y.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(S),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return S(void 0),r.forEach(e=>{let t=s(e);rE(t).forEach(a),t.forEach(e=>{e.kind===`String`&&a(e.text)})}),Je.forEach(a),[...i]},dE=(e,t)=>{let n=cE(e,t),r=n.getParsed,i,a=()=>i??=lE(r);return{getStringOrder:(e,t)=>uE(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)}}},fE=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),pE=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],mE=(t,n,r)=>{try{return r.parseModule(t)}catch(r){if(!(r instanceof e.I))throw r;let i=vn(t);throw i===void 0?r:e.J([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},hE=t=>new e.I(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),gE=(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)}.`},_E=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,vE=e=>e===`Theorem`?`ThmOrAssumpDefNode`:_E(e),yE=(e,t)=>({kind:`Operator`,name:t,params:[],body:jp(e),isLocal:!0,isRecursive:!1,location:e.location}),bE=e=>{let t=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange;return{kind:`Identifier`,name:e.name??e.module,location:{...t.start,range:t}}},xE=(e,t)=>{let n=Ue(e);return n!==void 0&&t.has(n)||He(e).some(e=>xE(e,t))},SE=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(bp(e),n.get(e)??n.size)),n},CE=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),wE=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]:[]):[],...wE(e.proof)]):[],TE=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw kb(e);if(e.kind===`Number`&&!us(e.value))throw Ab(e);TE(e.kind===`Let`?[...He(e),...CE(e.instances??[])]:He(e))}),EE=(t,n)=>{let r=n.order??dE(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(Z_.map(e=>[e.name,e])),d=/* @__PURE__ */ new Map,f=d_(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=[],y=/* @__PURE__ */ new Set,b=(e,t)=>[y,..._].forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),x=0,S=e=>`${e}#${x++}`,ee=[],C=[],te=WT(e=>{let t=m.get(e)??ce(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)}}),ne=/* @__PURE__ */ new Map,re=/* @__PURE__ */ new Map,ie=/* @__PURE__ */ new Map,w=e=>{let t=d.get(e);if(t)return t;let r=yv(e,n.print,f,n.files,u);if(!r)return;_v.get(e)?.forEach(w);let i=/* @__PURE__ */ new Map;return vv.get(e)?.forEach(e=>w(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:zp.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Vp(e,t.name)??i.get(t.name)?.range})}),d.set(e,i),i},ae=e=>{let t=_v.get(e)??[];if(e===`TLCExt`||[e,...t].some(e=>n.loadModule?.(e)!==void 0))return;let r=w(e);return r&&b(e,t),r&&t.includes(`Integers`)&&w(`Integers`),r},T=e=>(TE([...e.definitions.flatMap(Ve),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...CE(e.instances)]),e.modules.forEach(T),e);T(i);let oe=(t,i)=>{let a=n.loadModule?.(t)??B_(f.version).get(t)??Rr(n.source,t);if(a===void 0)throw e.q(t,i);let o=mE(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 T(o)},se=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=pe(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:C,levelChecks:o});if(_.pop(),v.pop(),a.length>0)throw e.J(a,!1,void 0,C);let c=i.find(e=>r.has(e.name)),l=c&&p.get(c.name),u=l&&gE(c,l.module);if(u)throw e.J([u],!1,void 0,C);if(c)throw hE(c);let d=[...uo(o.flatMap(e=>e.sections),C),...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,C);return{linked:s,closure:r}},ce=(t,r)=>{let i=p.get(t);if(i)return b(t,g.get(t)??[]),i;let o=se(oe(t,r)),s=/* @__PURE__ */ new Map;return gv(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:Lx(Cx(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&&fE.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),b(t,o.closure),o.linked},le=(e,t,n,r,i)=>{let u=i?void 0:ae(e.module);if(u)return E(e,u);let d=i??ce(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=pE(d),p=`#${x++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=lo(VT(e,t),f,t,n);ee.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 _=Pp({params:g,substitutions:new Map([...h].map(e=>[e[0],Qf(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=S(`${i}@${t.name}`),d=l(u);return a.set(u,d),f.length>0&&c.add(d),e.name!==void 0&&re.set(u,`${e.name}!${re.get(n)??i}`),o.set(u,!r),s.set(u,{source:n,prefix:e.params.length}),u},createName:S,...f.length>0&&{frame:bE(e)}});return D(e,d.exported,f,(t,n)=>{let r=e.name===void 0?_.getKey(t):_.getQualifiedKey(t);return f.length>0&&ne.set(r,{name:n,location:e.location}),e.name!==void 0&&ie.set(r,n),r})},E=(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}])),D=(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}]}))},O=(e,t)=>Array.from({length:e},(e,n)=>({name:`argument${n}`,arity:t?.[n]??0})),ue=(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=O(t.arity,void 0);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:Ep(r,n),location:n}}},k=(e,t,n,r)=>{let i=e.location,s=r?void 0:ae(e.module);if(s)return e.name===void 0?[]:[...s].map(t=>{let n=O(t[1].arity,t[1].params);return Dp(`${e.name}!${t[0]}`,t[1].key,[...e.params,...n],n,i)});let c=r??ce(e.module,n),l=`#${x++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=pE(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};ee.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=>xE(f(e),p),h=d.map(t=>{let n=ue(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=[],_=Pp({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:Ep(e.params,i),location:i,resolution:fi}:Tp(`${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}:yE(a,i)),i},createName:S}),v=d.length>0?[bE(e)]:[],y=new Set(d.map(e=>e.name)),b=[...c.exported].filter(e=>!y.has(e[0])&&e[1].kind!==`Instance`).map(t=>{let n=e.name===void 0?t[0]:`${e.name}!${t[0]}`,r=_.getKey(t[1].key),o=g.find(e=>e.name===r),s=a.get(r),c=o??(s&&Mp(s,e.params));if(c){let e=c.kind===`Operator`?c:yE(c,n);return{...e,name:n,body:Zf(e.body,v)}}let l=O(t[1].arity,t[1].params);return Dp(n,r,[...e.params,...l],l,i)});return[...h,...g,...b]},de=e=>[...e].flatMap(e=>{let t=a.get(e[1].key);return t?[{...t,name:e[0]}]:[]}),fe=/* @__PURE__ */ new Map,pe=(t,r)=>{let s=yT(t,n.loadClass?.(t.name),t===i);fe.set(t.name,s.overrides);let c=s.module,l=ee.length,u=new Map([...Z_.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:io,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);vE(r.kind)===vE(t.kind)?f.warnings.push({location:i,message:`Warning: the ${_E(r.kind)} of '${n}' conflicts with \nits ${_E(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${_E(t.kind)} of '${n}' conflicts with \nits ${_E(r.kind)} at ${a}.`})}),_=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Set,b=/* @__PURE__ */ new Map,x=[],S=[...c.constants],ne=c.variables.filter((e,t)=>c.variables.findIndex(t=>t.name===e.name)===t),re=ne.map(e=>e.name),w=ne.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:ae(e);if(n){g(n);return}let i=t??ce(e,c.name);S.push(...i.constants.filter(e=>S.every(t=>t.name!==e.name)&&!re.includes(e.name))),i.variables.forEach((e,t)=>{re.includes(e)||S.some(t=>t.name===e)||(re.push(e),w.push(i.variableLocations[t]))}),g(i.exported),i.facts.forEach(e=>v.add(e)),i.modules.forEach((e,t)=>b.set(t,e)),x.push(i)});let T=new Map(u),oe=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],se=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});oe.forEach(e=>_.set(e.name,se(e)));let O=e=>({key:me(e),arity:ji(e),params:Mi(e),kind:ao(c,e)?`Theorem`:`Definition`,range:e.location.range,functionArity:Pi(e)}),ue=S.length===0&&re.length===0,me=e=>c===i?e.name:`${e.name}@${r.id}`,he=/* @__PURE__ */ new Map,ge=()=>new Map([...r.modules,...b]),_e=e=>{let t=c.modules.find(t=>t.name===e.module);return t?ki(t.location,e.location)?b.get(t.name):void 0:ge().get(e.module)},A=e=>({imported:u,getInstance:e=>{let t=_e(e),n=t?void 0:ae(e.module);if(n)return{declarations:[],symbols:E(e,n),instancer:c.name};let r=t??ce(e.module,c.name),i=pE(r);return{declarations:i,symbols:D(e,r.exported,i,e=>e),instancer:c.name}},bound:T,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:me,isModuleKnown:(e,t)=>e===c.name||y.has(e)||r.modules.has(e)||c.modules.some(n=>n.name===e&&ki(n.location,t)),instanced:he,facts:v,reports:p,warnings:r.warnings}),ve=e=>[...oe.filter(t=>ki(t.location,e)).map(e=>[e.name,se(e)]),...c.definitions.filter(t=>ki(t.location,e)).map(e=>[e.name,O(e)])].reduce((e,t)=>e.has(t[0])?e:e.set(t[0],t[1]),new Map(u)),ye=e=>{let t=ge(),n=t.get(e.name),i=n&&gE(e,n.module);if(n&&!i)throw hE(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};p.push(a);let o=pe(e,{id:`${r.id}/${e.name}`,symbols:ve(e.location),modules:t,nested:r.nested,errors:a.errors,warnings:a.warnings,levelChecks:r.levelChecks});i&&a.errors.push(i),n||b.set(e.name,o)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=le(e,c,A(c),ue,ge().get(e.module));he.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:()=>ye(e)}))].sort((e,t)=>ki(e.location,t.location)?-1:1).forEach(e=>e.link());let be=HT(Rp(c,(e,t)=>k(e,t,c.name,_e(e))),de(u));c.theorems.flatMap(e=>wE(e.proof)).filter(e=>!ge().has(e.module)).forEach(e=>ae(e.module)??ce(e.module,c.name)),r.errors.push(...fo(be,A(be))),be.definitions.forEach(e=>{let t=me(e);a.set(t,e),o.set(t,!ue);let n=O(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!ki(r,e.location))&&(u.set(e.name,n),e.isLocal||_.set(e.name,n))});let xe={module:be,constants:S,variables:re,variableLocations:w,visible:u,exported:_,modules:b,extended:x,facts:/* @__PURE__ */ new Set([...v,...[...be.theorems,...be.assumptions].flatMap(e=>e.name??[])])};m.has(c.name)||m.set(c.name,xe);let Se=ee.splice(l).map(e=>({location:e.location,check:()=>te(e)}));return r.levelChecks.push(Ym(be,{constants:new Set(S.map(e=>e.name)),variables:new Set(re),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>ie.get(u.get(e)?.key??e)},Se,C)),h.push(xe),xe},me=se(i).linked,he=n.traceFile,ge=he===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:he}}],_e=[...n.moduleOperators??[],...ge].map(e=>{let t=ce(e.module,i.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});h.push(...h.splice(h.indexOf(me),1)),C.length>0&&!n.isSanyReported&&n.print(e.Z(C));let A=n.runtimeInvariants??[];A.forEach(e=>{if(e.module===void 0)return;p.set(i.name,me);let t=ce(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)}),me.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)}),_e.forEach(e=>{let t=e.key===void 0?void 0:a.get(e.key);e.kind!==`postcondition`&&t&&a.set(e.operator,t)});let ve=[],ye=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>ye(e,t)),ve.push(...e.module.assumptions))};ye(me,/* @__PURE__ */ new Set);let be=me.constants.map(e=>e.name),xe=me.variables,Se=oT(t,{root:me,moduleSymbols:new Map([...d,...[...p].map(e=>[e[0],e[1].visible]),[i.name,me.visible]]),definitions:a,builtins:u,copySources:s,operatorConstants:new Map(_e.flatMap(e=>ce(e.module,i.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:r}),Ce=Se.constants,we=Se.substitutions;he!==void 0&&u.forEach((e,t)=>{let n=nv(e);n&&u.set(t,n)});let Te=SE(xe,h.flatMap(e=>e.module.variables.map(e=>e.name))),Ee=uh({definitions:a,substitutions:we,constants:Ce,variableIndex:Te,builtins:u,variables:xe}),De={runtime:f,definitions:a,builtins:u,constants:Ce,substitutions:we,instanceNames:re,variables:xe,variableIndex:Te,facts:Ee,startupValues:Array.from({length:Ee.ids.size},()=>void 0),tlcEvalValues:/* @__PURE__ */ new WeakMap,substitutedDefinitions:c,instanceParams:l,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Oe=qm({constants:new Set(Ce.keys()),variables:/* @__PURE__ */ new Set([...xe,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>u.has(e))]),getDefinition:e=>Wb(e,De)}),ke=t=>{try{$(t,{environment:De,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e.x)return t;throw t}};we.forEach((t,n)=>{let r=a.get(t),i=be.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&Oe.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?ke(r.body):void 0;if(i){let r=ko(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 Ae=new Set(h.flatMap(e=>e.module.instances.map(e=>e.module))),je=r.createDefinitionOrder();return{environment:De,assumptions:ve,variableLocations:me.variableLocations,instanceActions:ne,startupDefinitions:h.filter(e=>!Ae.has(e.module.name)||pE(e).length===0).flatMap(e=>je(e===me?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:h.flatMap(e=>fe.get(e.module.name)??[]),moduleOperators:_e,runtimeInvariants:A,rootName:i.name}},DE=e=>[...e].map(e=>`${e[0]}>${e[1].name}`).sort().join(`,`),OE=(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},kE=t=>e.at(new e.x(`${e.K}${t}`),e.nt.error),AE=e=>{let t=K(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!ss(e)||!ss(i))throw kE(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},jE=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${ME(t)}`:n},ME=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(ME).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${jE(e.pattern,e.set)}:${ME(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(ME).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${ME(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>jE(e.pattern,e.set)).join(`,`)}|->${ME(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(ME);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},NE=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,PE=(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 kE(`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(!is(o)||!pl(o))throw kE(`The symmetry operator must specify a set of functions.`);let s=G(o).elements;if(!s.every(os))throw kE(`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=ME(NE(e)?e.args[0]:e);return u.get(t)??t}),r=e.length>1;n.runtime.warn(vo.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(AE).forEach(e=>{e.size>0&&f.set(DE(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=OE(n,e),r=DE(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(!NE(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=>ss(e)&&h.has(e.name))})),f.size!==0)return[...f.values()]},FE=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=LE(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(LE(e[r],t));return a}},IE=(e,t)=>{let n=[],r=[];for(let i of e){let e=LE(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(qs);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(qs(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},LE=(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=IE(e.elements,t);return n?Qs(n):e}if(n===`Function`||n===`LazyFunction`&&pl(e.domain)){let n=K(e),r=FE(n.domain,t),i=FE(n.range,t)??n.range;if(r){let e=Yc(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?ec(n.domain,e.range):e}return i===n.range?n:ec(n.domain,i)}if(n===`Interval`||!is(e)||!pl(e))return e;let r=G(e),i=FE(r.elements,t);return i?Uc(i):r},RE=(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]=LE(e[o],i),a===0&&(a=qs(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},zE={line:0,column:0},BE=e=>({kind:`Identifier`,name:e,location:zE}),VE=e=>({name:e,expression:BE(e),scope:void 0}),HE=/* @__PURE__ */ new Set([`name`,`property`]),UE=(t,n,r)=>{let i=Wb(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(HE.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},WE=e=>e.body.kind===`Number`||e.body.kind===`String`,GE=(e,t,n)=>n.constants.has(e)?n.constants.get(e):WE(t)?void 0:yx(t,n),KE=(t,n,r)=>{if(r.constants.has(n))throw new e.v(`The ${t} ${n} cannot be a constant.`);let i=UE(t,n,r);if(GE(n,i,r)!==void 0)throw new e.v(`The ${t} ${n} cannot be a constant.`);return i},qE=(t,n,r)=>{let i=r.constants.has(n)?void 0:UE(t,n,r),a=i?GE(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},JE=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},YE=(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})),bx(e.startupDefinitions,r),t.invariants.forEach(e=>{qE(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},XE=(t,n)=>{let r=qm({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>n.definitions.get(e)});return t.flatMap(t=>{let i=qE(`invariant`,t,n);if(!i)return[];let a=r.analyzeDefinition(i,/* @__PURE__ */ new Map);if(a.level>=2){let n=a.params.size===0?``:`
|
|
1789
1794
|
Note that a bug can cause TLC to incorrectly report this error.
|
|
1790
1795
|
If you believe your TLA+ or PlusCal specification to be correct,
|
|
1791
|
-
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw e.at(new e.
|
|
1792
|
-
all state variables. Proceed with fingers crossed.`}),i().filter(e=>r!==void 0&&!r.includes(e)).forEach(e=>a?.({kind:`warning`,code:
|
|
1793
|
-
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`&&Ev(l.expression,t.scope,n)<2)throw e.at(new e.b(`TLC cannot handle the temporal formula ${U(l.expression)}`),e.nt.error);let p=Ev(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${U(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:gC},next:s.length===0?void 0:g(s[0],o.length),scope:h,temporals:c,isPropertyFairness:c.length>0&&!f}},jC=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=wC(`property`,t,n);if(!a)return;Ev(a.body,void 0,n)===1&&r?.({kind:`state-level-property`,name:t});let o=n.runtime.version!==`1.7.4`;Ov(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(kC(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`&&Ev(a.expression,r.scope,n)<=1){let e=a.expression,t=e.kind===`Identifier`&&!j(e)?Lh(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=Ev(a,r.scope,n);if(s<2)i.initialPredicates.push({name:o,expression:a,scope:r.scope});else{if(s===2){let t=U(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},MC=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},NC=(e,t,n)=>t.flatMap(t=>wC(e,t,n)?[vC(t)]:[]),PC=(e,t)=>{let n=Lh(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},FC=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e._(`_POSSIBLE lists ${r} more than once`);CC(`possible`,r,n);let a=vC(r);if(Ev(a.expression,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 a}),IC=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||j(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},LC=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=Lh(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},RC=(e,t)=>e.flatMap(e=>OC(e.expression,t).map(n=>{let r=e.scope===void 0?Au(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:IC(n,r,t),predicate:LC(e.expression,t)}})),zC=(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},BC=/[\u0100-\uffff]/,VC=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),HC=e=>e.kind===`String`?BC.test(e.value):e.kind===`Set`&&e.elements.some(HC),UC=e=>e.kind===`String`&&BC.test(e.value)||e.kind===`Apply`&&VC.has(e.operator)||ze(e).some(UC),WC=(e,t)=>e.constants.some(e=>HC(e.value)||(e.args??[]).some(HC))||[...t.definitions.values()].some(e=>UC(e.body)||e.kind===`Function`&&e.bounds.some(e=>UC(e.set))),GC=e=>{if(!Nt(e))return;let t=Vt(L(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},KC=(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`},qC=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),JC=(e,t,n)=>Mh(W(e,t),n),YC=(t,n,r=ZC)=>{let i=W(t,n);if(typeof i!=`boolean`)throw new e.b(r(t,n.environment));return i},XC=(t,n,r)=>{let i=n.kind===`Identifier`?Lh(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):hh(a)}`},ZC=(e,t)=>XC(`boolean`,e,t),QC=(e,t)=>YC(e.expression,t,(n,r)=>(YC(e.predicate,t),ZC(n,r))),$C=()=>{},ew=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=JC(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),tw=(t,n)=>{try{return t(qC(n,void 0,void 0))?void 0:{message:void 0}}catch(t){if(t instanceof e.b)return{message:t.message};throw t}},nw=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=tw(e=>Ih(W(n.expression,e),n.expression),t);if(e)return{name:hh(n.expression),trace:[],message:e.message}}},rw=(e,t,n,r=!1)=>{let i=WS(t.source,t.loadModule);return $t(i.getStringOrder(e)),an(t),ja(t.fingerprintPolynomial??0),r&&en(),{order:i,specification:rC(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})}},iw=e=>{let t=typeof e.config==`string`?Le(e.config,e.version):e.config,n=rw(t,e,e.onPrint??console.log),r=n.specification;EC(r,t,e.onProgress);let i=r.environment,a,o=()=>a??=ry(t,i,r.instanceActions);return i.runtime.getSpecification=()=>cy(o(),t,i,r.variableLocations),{config:t,specification:r,environment:i,search:sw(t,i,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators),getDescription:o}},aw=(t,n,r)=>{let i=nw(t,n);if(!i)return;if(i.message===void 0){let t=`Assumption ${i.name} is false.`;return r(qe.assumptionFalse,t,t),e.nt.assumptionViolation}let a=`Evaluating assumption ${i.name} failed.\n${i.message}`;return r(qe.assumptionEvaluationError,a,N(qe.assumptionEvaluationError,a,!0)),e.nt.assumptionViolation},ow=t=>e.at(new e.b(`${e.G}Could not find operator: ${t.operator} in module: ${t.module}`),e.nt.error),sw=(t,n,r,i,a,o=[])=>{let s=e=>o.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw ow(e);return{name:e.operator,key:e.key}}),c=DC(t.invariants,n),l=AC(t,n,r,i,a),u=jC(t,n,a),d=t.properties[0],f=d&&Lh(d,n)?.location.range,p=t.specification,m=p&&Lh(p,n)?.location.range;l.isPropertyFairness&&f&&m&&a?.({kind:`warning`,code:qe.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=RC([...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`?Qe:`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 v=NC(`constraint`,[...t.constraints,...s(`constraint`).map(e=>e.name)],n),y=RC(v,n),b=NC(`action constraint`,t.actionConstraints,n),x=n.coverage,ee=(e,t,r=!0)=>t.flatMap(t=>{if(!x)return[];let i=r?LC(t.expression,n):t.expression,a=$a(r?t.name:void 0,i,n),o=Za(x,e,a,i,t.scope);return[{expression:i,scope:t.scope,node:o}]}),te=[...ee(`invariant`,c),...ee(`invariant`,u.invariants,!1)],ne=ee(`constraint`,b),S=ee(`constraint`,v),re=ee(`implied`,u.initialPredicates,!1),C=ee(`implied`,u.actionProperties.map(e=>({...e,expression:e.box})),!1),w=(e,t,r,i)=>{try{return fo(e,t.node,()=>W(t.expression,qC(n,r,i,t.scope)))}catch{return}},T=(e,t,n)=>x!==void 0&&e.every(e=>w(x,e,t,n)===!0),E=(e,t,n)=>{if(x){for(let r of e){let e=w(x,r,t,n);if(typeof e!=`boolean`)return;if(!e)return x.primary[r.node]++,!1;x.secondary[r.node]++}return!0}};t.rlReward!==void 0&&bC(`rlreward`,t.rlReward,n),t.periodic!==void 0&&bC(`periodic`,t.periodic,n);let ie=FC(t.possible,n);if(n.variables.length===0)return;let ae=t.symmetry===void 0?void 0:dC(t.symmetry,n,t.substitutions),oe=t.view===void 0?void 0:CC(`view function`,t.view,n),se=t.view??s(`view`)[0]?.name,ce=se===void 0?void 0:vC(se),le=u.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:gC};return{...e,unchanged:t}}),ue=e=>Ev(e.expression,void 0,n)>=2,de=ie.filter(e=>!ue(e)),fe=ie.filter(ue),pe=n.runtime,D,O=()=>{if(D)return D;let e=i(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return D=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),D},k=(e,t)=>W(e,qC(n,t,void 0)),A=e=>{let t=ae===void 0?e:hC(e,ae,O());return Ua(ce===void 0?O().map(e=>t[e]):[k(ce.expression,t)])},me=e=>T(re,e)?void 0:u.initialPredicates.find(t=>!YC(t.expression,qC(n,e,void 0,t.scope))),he=/* @__PURE__ */ new WeakSet,ge=(t,r,i)=>{let a=i&&!he.has(i)?i:void 0;if(zC(t,r,a))return!1;try{let e=qC(n,r,void 0,t.scope),i=t.membership;return a&&i?!Si(r[i.variable],a[i.variable],W(i.set,e)):!QC(t,e)}catch(n){throw i?dt(e.at(n,e.nt.safetyEvaluationFailure),qe.invariantEvaluationFailed,`Evaluating invariant ${t.name} failed.`):n}},_e=WC(t,n);pe.getFingerprint=A;let ve=()=>{let t=ie.find(e=>!pe.possibleCounts.get(e.name));if(!t)return;let r=PC(t.name,n),i=r?` at ${e.X(r)}`:``;return{name:t.name,code:qe.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:M(R(ef(pe),!0))}},ye=oe?.body.kind===`Tuple`?oe.body.elements:[],be=ye.flatMap(e=>e.kind===`Identifier`&&n.variables.includes(e.name)?[e.name]:[]),xe=oe?.body.kind===`Tuple`&&be.length===ye.length&&new Set(be).size===be.length,Se=(e,t)=>xe?O().filter(e=>be.includes(n.variables[e])).map(e=>`/\\ ${n.variables[e]} = ${M(R(t[e]))}\n`).join(``):M(R(k(e,t))),Ce=(t,r,i)=>YC(t.expression,qC(n,r,i),t=>`${e.G}${ZC(t,n)}`),we=e=>{let t=Object.fromEntries(O().map(t=>[n.variables[t],e[t]]));return ce===void 0?t:sn(t,()=>Se(ce.expression,e))};return pe.toRecord=we,{properties:u,spec:l,toRecord:we,evaluateAlias:(t,r,i,a)=>{try{CC(`alias`,t,n);let e=W(_C(t),qC(n,r,i)),a=GC(e);return a===void 0?we(r):ln(a,t)}catch(t){if(!(t instanceof e._||t instanceof e.b))throw t;return{...we(r),_ALIASEvalError:ot(t.message,a)}}},isSymmetric:ae!==void 0,isConstrained:y.length>0||b.length>0,getTypedChecks:e=>{if(x!==void 0||ie.length>0||t.periodic!==void 0||[...h,...y].some(e=>e.scope!==void 0)||b.length>0||u.actionProperties.some(e=>e.scope!==void 0)||u.liveness.length>0&&(e===void 0||ce!==void 0)||l.init===void 0||l.next===void 0)return;let r=g.map(e=>e.predicate),i=[...new Set(y.map(e=>e.predicate))],a=u.initialPredicates.map(e=>e.expression),o=[...n.facts.ids.keys()],s=MC(l.scope),c=e=>dg(e,n)===void 0&&Du(e,n,`replayed`);return(s===void 0?o.some(c):o.some(e=>!(e.kind===`Operator`&&e.params.length>0)&&wu(e,n)&&c(e))||Eu([l.init,l.next,...r,...i,...a,...u.actionProperties.flatMap(e=>[e.action,e.subscript]),...ce?[ce.expression]:[],...s,...Oy(e??[])],n,`replayed`))?void 0:{init:l.init,next:l.next,scope:l.scope,invariants:r,constraints:i,holdsInitialPredicates:e=>me(e)===void 0,actionProperties:u.actionProperties,symmetry:ae,view:ce?.expression,variableOrder:O(),liveness:e}},getTlcOrder:O,getStoredFingerprints:(e,t)=>ce!==void 0||_e?BigInt64Array.from(e,A):Ga(t,O()),getFingerprintState:e=>{if(_e)return[String(A(e))];let t=ae===void 0?e:hC(e,ae,O());return ce===void 0?t:[k(ce.expression,t)]},findViolatedInvariant:(e,t)=>{if(T(te,e))return;let n=h.find(n=>ge(n,e,t));return n&&he.add(e),n},getViolatedInvariants:e=>{let t=g.filter(t=>h.some(n=>n.predicate===t.predicate&&ge(n,e,void 0)));return t.length>0&&he.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>YC(n,qC(t,e,void 0,r));y.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)=>(!(!(y.every(e=>YC(e.predicate,qC(n,t,void 0,e.scope)))&&b.every(r=>YC(r.expression,qC(n,e,t,r.scope))))||r())||g.every(e=>YC(e.predicate,qC(n,t,void 0,e.scope))))&&le.every(r=>YC(r.box,qC(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>E(S,e)??y.every(r=>zC(r,e,t)||QC(r,qC(n,e,void 0))),findFailedInitialPredicate:me,findViolatedActionProperty:(e,t)=>T(C,e,t)?void 0:le.find(r=>{try{return!YC(r.action,qC(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${U(r.box)}`)&&!JC(r.unchanged,qC(n,e,t,r.scope),`a subscript`)}catch(e){throw dt(cw(e),qe.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>E(ne,e,t)??b.every(n=>Ce(n,e,t)),getExcludingConstraints:(t,r)=>[...y.filter(e=>!QC(e,qC(n,r,void 0))),...b.filter(e=>!Ce(e,t,r))].map(t=>{let r=PC(t.name,n);return r?e.X(r):t.name}),trackStatePossible:de.length===0?$C:e=>ew(de,pe,qC(n,e,void 0)),trackActionPossible:fe.length===0?$C:(e,t)=>ew(fe,pe,qC(n,e,t)),findUnwitnessedPossible:ve,getReward:(r,i,a)=>{if(t.rlReward===void 0)return a;let o=_C(t.rlReward),s=W(o,qC(n,r,i));if(typeof s!=`number`)throw new e.b(XC(`integer`,o,n));return s},findPostconditionViolation:(r=!1)=>{let i=s(`postcondition`),a=t.postconditions.map(e=>{let t=Lh(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}`:!xC(t)&&dg(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.b(a),e.nt.configParseError)}let o=(t,r)=>{let i=tw(e=>YC(_C(r),e),n);if(!i)return;let a=Lh(r,n)?.body,o=PC(r,n),s=o?` at ${a?.kind===`Number`?hh(a):e.X(o)}`:``;return i.message===void 0?{name:t,code:qe.postconditionFalse,message:`Postcondition ${t}${s} is false.`}:{name:t,code:qe.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=ve();if(c)return c;for(let e of t.postconditions){let t=o(e,e);if(t)return t}}}},cw=t=>t instanceof e.k?e.at(t,t.exitCode):t,lw=(e,t)=>e*((t-e)/2**64),uw=e=>e.includes(`.`)?e:`${e}.0`,dw=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return uw(String(e));let[n,r]=e.toExponential().split(`e`);return`${uw(n)}E${r.replace(`+`,``)}`},fw=e=>e!==void 0&&e>=`0`&&e<=`9`,pw=e=>{if(e===0)return`0.0`;let t=dw(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;fw(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;fw(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;fw(t[n])&&r<2;)i+=t[n++],r++;for(fw(t[n])&&Number(t[n])>=5&&(i=mw(i));fw(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},mw=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${mw(r)}.`:n===`9`?`${mw(r)}0`:`${r}${Number(n)+1}`},hw=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}`)},gw=(e,t,n)=>{if(lw(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},_w=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}).`},vw=[void 0,`lambda`,`tuple`,`record`],yw=()=>{let e=/* @__PURE__ */ new Int32Array(1024),t=0,n=0,r=[],i=/* @__PURE__ */ new Map,a=n=>{if(t===e.length){let t=new Int32Array(e.length*2);t.set(e),e=t}e[t++]=n},o=e=>{let t=i.get(e);if(t!==void 0)return a(t);i.set(e,r.length),a(r.length),r.push(e)},s=e=>{if(typeof e==`boolean`)return a(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(a(2),a(e),!0);if(typeof e==`string`)return a(3),o(e),!0;if(e.kind===`ModelValue`)return a(4),o(e.name),!0;if(e.kind===`Set`)return a(5),a(e.elements.length),e.elements.every(s);if(e.kind===`Function`){let t=Ni(e.domain);return t?(a(7),a(vw.indexOf(An(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(vw.indexOf(An(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})}},bw=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 Cn(t.strings[n[r++]]);if(e===5)return Tn(i(n[r++]));let a=vw[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=jr({kind:`Interval`,low:e,high:e+t-1});return kn(Dn(o,i(t)),a)}let o=n[r++],s=i(o);return kn(Dn(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return ah}}),Object.defineProperty(exports,"$t",{enumerable:!0,get:function(){return I}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return ry}}),Object.defineProperty(exports,"At",{enumerable:!0,get:function(){return Ct}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return P_}}),Object.defineProperty(exports,"Bt",{enumerable:!0,get:function(){return Nr}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return oS}}),Object.defineProperty(exports,"Ct",{enumerable:!0,get:function(){return $a}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return Dy}}),Object.defineProperty(exports,"Dt",{enumerable:!0,get:function(){return Ra}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return ky}}),Object.defineProperty(exports,"Et",{enumerable:!0,get:function(){return za}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return N_}}),Object.defineProperty(exports,"Ft",{enumerable:!0,get:function(){return Pr}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return Wg}}),Object.defineProperty(exports,"Gt",{enumerable:!0,get:function(){return Dt}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return F_}}),Object.defineProperty(exports,"Ht",{enumerable:!0,get:function(){return R}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return T_}}),Object.defineProperty(exports,"It",{enumerable:!0,get:function(){return gr}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return Dg}}),Object.defineProperty(exports,"Jt",{enumerable:!0,get:function(){return Zr}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return U}}),Object.defineProperty(exports,"Kt",{enumerable:!0,get:function(){return wn}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return k_}}),Object.defineProperty(exports,"Lt",{enumerable:!0,get:function(){return Dn}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return Lv}}),Object.defineProperty(exports,"Mt",{enumerable:!0,get:function(){return Un}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return bv}}),Object.defineProperty(exports,"Nt",{enumerable:!0,get:function(){return Sr}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return oy}}),Object.defineProperty(exports,"Ot",{enumerable:!0,get:function(){return Pa}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return w_}}),Object.defineProperty(exports,"Pt",{enumerable:!0,get:function(){return Cn}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return rh}}),Object.defineProperty(exports,"Qt",{enumerable:!0,get:function(){return Ln}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return E_}}),Object.defineProperty(exports,"Rt",{enumerable:!0,get:function(){return Fr}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return sS}}),Object.defineProperty(exports,"St",{enumerable:!0,get:function(){return Ja}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Ay}}),Object.defineProperty(exports,"Tt",{enumerable:!0,get:function(){return La}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return j_}}),Object.defineProperty(exports,"Ut",{enumerable:!0,get:function(){return Wi}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return D_}}),Object.defineProperty(exports,"Vt",{enumerable:!0,get:function(){return ma}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return C_}}),Object.defineProperty(exports,"Wt",{enumerable:!0,get:function(){return Gi}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return dg}}),Object.defineProperty(exports,"Xt",{enumerable:!0,get:function(){return F}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return Lh}}),Object.defineProperty(exports,"Yt",{enumerable:!0,get:function(){return tn}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return Ig}}),Object.defineProperty(exports,"Zt",{enumerable:!0,get:function(){return Bn}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return EC}}),Object.defineProperty(exports,"_n",{enumerable:!0,get:function(){return Te}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return Eu}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return gw}}),Object.defineProperty(exports,"an",{enumerable:!0,get:function(){return lt}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return tm}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return nS}}),Object.defineProperty(exports,"bn",{enumerable:!0,get:function(){return re}}),Object.defineProperty(exports,"bt",{enumerable:!0,get:function(){return so}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return rw}}),Object.defineProperty(exports,"cn",{enumerable:!0,get:function(){return xt}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return Ff}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return nw}}),Object.defineProperty(exports,"dn",{enumerable:!0,get:function(){return ft}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return Df}}),Object.defineProperty(exports,"en",{enumerable:!0,get:function(){return qe}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return ih}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return qC}}),Object.defineProperty(exports,"fn",{enumerable:!0,get:function(){return vt}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return nf}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return TC}}),Object.defineProperty(exports,"gn",{enumerable:!0,get:function(){return Le}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return wu}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return aw}}),Object.defineProperty(exports,"hn",{enumerable:!0,get:function(){return ze}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return Nd}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return hw}}),Object.defineProperty(exports,"in",{enumerable:!0,get:function(){return ot}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return im}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return cy}}),Object.defineProperty(exports,"jt",{enumerable:!0,get:function(){return bn}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return sy}}),Object.defineProperty(exports,"kt",{enumerable:!0,get:function(){return Ua}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return ow}}),Object.defineProperty(exports,"ln",{enumerable:!0,get:function(){return _t}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return Pf}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return iw}}),Object.defineProperty(exports,"mn",{enumerable:!0,get:function(){return Ve}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return kd}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return yw}}),Object.defineProperty(exports,"nn",{enumerable:!0,get:function(){return Ze}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return Am}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return lw}}),Object.defineProperty(exports,"on",{enumerable:!0,get:function(){return ct}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return nm}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return KC}}),Object.defineProperty(exports,"pn",{enumerable:!0,get:function(){return st}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return of}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return W}}),Object.defineProperty(exports,"qt",{enumerable:!0,get:function(){return Et}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return pw}}),Object.defineProperty(exports,"rn",{enumerable:!0,get:function(){return N}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return oh}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return _w}}),Object.defineProperty(exports,"sn",{enumerable:!0,get:function(){return rt}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return rm}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return bw}}),Object.defineProperty(exports,"tn",{enumerable:!0,get:function(){return Je}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return sh}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return sw}}),Object.defineProperty(exports,"un",{enumerable:!0,get:function(){return it}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return If}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return cw}}),Object.defineProperty(exports,"vn",{enumerable:!0,get:function(){return ge}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return As}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return hx}}),Object.defineProperty(exports,"wt",{enumerable:!0,get:function(){return Do}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return iS}}),Object.defineProperty(exports,"xt",{enumerable:!0,get:function(){return ho}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return mC}}),Object.defineProperty(exports,"yn",{enumerable:!0,get:function(){return x}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return Za}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return I_}}),Object.defineProperty(exports,"zt",{enumerable:!0,get:function(){return Tn}});
|
|
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[VE(t)]})},ZE=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>ZE(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Wb(e.name,t);if(n?.kind===`Operator`&&n.params.length===0&&yx(n,t)===void 0)return ZE(n.body,t)}return[e]},QE=(t,n,r)=>{let i=t.expression;if(i.kind!==`Identifier`||zC(i,t.scope,n)>0)return!1;let a=$(i,gD(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},$E=(t,n,r,i,a)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return KE(t,e,n),BE(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):GE(t.specification,UE(`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=UE(`name`,t.specification,n),d=t.properties.length===1?t.properties[0]:void 0,f=!1;VC(u.body,void 0,n,!1).forEach(t=>{let l=t.expression,u=t.path.some(e=>{let t=Wb(e,n);return t?.kind===`Operator`&&zC(t.body,void 0,n)===1});if(!u&&QE(t,n,`spec`))return;let p=l.kind===`Identifier`&&!j(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=_w(l.expression.subscript,t.scope,n);if(r===void 0&&a?.({kind:`warning`,code:vo.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:vo.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`&&zC(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=zC(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:zE},next:s.length===0?void 0:g(s[0],o.length),scope:h,temporals:c,isPropertyFairness:c.length>0&&!f}},eD=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=qE(`property`,t,n);if(!a)return;zC(a.body,void 0,n)===1&&r?.({kind:`state-level-property`,name:t});let o=n.runtime.version!==`1.7.4`;VC(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(QE(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`&&zC(a.expression,r.scope,n)<=1){let e=a.expression,t=e.kind===`Identifier`&&!j(e)?Wb(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=zC(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},tD=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},nD=(e,t,n)=>t.flatMap(t=>qE(e,t,n)?[VE(t)]:[]),rD=(e,t)=>{let n=Wb(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},iD=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e.v(`_POSSIBLE lists ${r} more than once`);KE(`possible`,r,n);let a=VE(r);if(zC(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}),aD=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||j(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},oD=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=Wb(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},sD=(e,t)=>e.flatMap(e=>{let n=oD(e.expression,t);return(e.scope===void 0&&xh(n,t)===void 0?[n]:ZE(e.expression,t)).map(r=>{let i=e.scope===void 0?xh(r,t):void 0;return{name:e.name,expression:r,scope:e.scope,variables:i,membership:aD(r,i,t),predicate:n}})}),cD=(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},lD=/[\u0100-\uffff]/,uD=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),dD=e=>e.kind===`String`?lD.test(e.value):e.kind===`Set`&&e.elements.some(dD),fD=(e,t)=>{if(e.kind===`Selection`){if(t.has(e.expression))return!1;t.add(e.expression)}return e.kind===`String`&&lD.test(e.value)||e.kind===`Apply`&&uD.has(e.operator)||He(e).some(e=>fD(e,t))},pD=(e,t)=>{let n=/* @__PURE__ */ new Set;return e.constants.some(e=>dD(e.value)||(e.args??[]).some(dD))||[...t.definitions.values()].some(e=>fD(e.body,n)||e.kind===`Function`&&e.bounds.some(e=>fD(e.set,n)))},mD=e=>{if(!os(e))return;let t=ms(K(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},hD=(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`},gD=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),_D=(e,t,n)=>zb($(e,t),n),vD=(t,n,r=bD)=>{let i=$(t,n);if(typeof i!=`boolean`)throw new e.x(r(t,n.environment));return i},yD=(t,n,r)=>{let i=n.kind===`Identifier`?Wb(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):Sb(a)}`},bD=(e,t)=>yD(`boolean`,e,t),xD=(e,t)=>vD(e.expression,t,(n,r)=>(e.predicate!==e.expression&&vD(e.predicate,t),bD(n,r))),SD=()=>{},CD=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=_D(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),wD=(t,n)=>{try{return t(gD(n,void 0,void 0))?void 0:{message:void 0}}catch(t){if(t instanceof e.x)return{message:t.message};throw t}},TD=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=wD(e=>Ub($(n.expression,e),n.expression),t);if(e)return{name:Sb(n.expression),trace:[],message:e.message}}},ED=(e,t,n,r=!1)=>{let i=dE(t.source,t.loadModule);return Ds(i.getStringOrder(e,(t.runtimeInvariants??[]).flatMap(e=>e.module??[]))),Ms(t),sd(t.fingerprintPolynomial??0),r&&Os(),{order:i,specification:EE(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})}},DD=e=>{let t=typeof e.config==`string`?Re(e.config,e.version):e.config,n=ED(t,e,e.onPrint??console.log),r=n.specification;YE(r,t,e.onProgress);let i=e.coverage===void 0?void 0:Td(r.environment.variables.length),a=i?Ed(r.environment,i):r.environment,o,s=()=>o??=gw(t,a,r.instanceActions);a.runtime.getSpecification=()=>xw(s(),t,a,r.variableLocations);let c=ND(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&&yf(i,a,r.variableLocations,c?.getTlcOrder()??[])}},OD=/* @__PURE__ */ Error(`The walk stopped`),kD=(e,t,n)=>{let r=(n,r)=>r.map(r=>({...r,node:Ad(e,n,Md(r.name,r.expression,t),r.expression,r.scope)})),i=r(`init`,n.inits),a=r(`next`,n.actions);return Vd(e,t,uy(a,t)),{inits:i,actions:a}},AD=(e,t,n,r,i,a=(e,t)=>{throw db(e,t,r)},o)=>ly(t,t.node,n,r,n=>{e.primary[t.node]++,i(n)},n=>(e.primary[t.node]++,a(n,t.name),!0),o),jD=(t,n,r)=>{let i=TD(t,n);if(!i)return;if(i.message===void 0){let t=`Assumption ${i.name} is false.`;return r(vo.assumptionFalse,t,t),e.nt.assumptionViolation}let a=`Evaluating assumption ${i.name} failed.\n${i.message}`;return r(vo.assumptionEvaluationError,a,jo(vo.assumptionEvaluationError,a,!0)),e.nt.assumptionViolation},MD=t=>e.at(new e.x(`${e.K}Could not find operator: ${t.operator} in module: ${t.module}`),e.nt.error),ND=(t,n,r,i,a,o=[],s=[])=>{let c=e=>o.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw MD(e);return{name:e.operator,key:e.key}}),l=XE(t.invariants,n),u=$E(t,n,r,i,a),d=eD(t,n,a),f=t.properties[0],p=f&&Wb(f,n)?.location.range,m=t.specification,h=m&&Wb(m,n)?.location.range;u.isPropertyFairness&&p&&h&&a?.({kind:`warning`,code:vo.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=sD([...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`?Co:`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=sD(s.map(e=>{let t=Wb(e.name,n);return{name:e.name,expression:t?.kind===`Operator`?t.body:BE(e.name),scope:void 0}}),n),y=[...g,...v],b=[...new Map(y.map(e=>[e.predicate,e])).values()],x=nD(`constraint`,[...t.constraints,...c(`constraint`).map(e=>e.name)],n),S=sD(x,n),ee=nD(`action constraint`,t.actionConstraints,n),C=n.coverage,te=(e,t,r=!0)=>t.flatMap(t=>{if(!C)return[];let i=r?oD(t.expression,n):t.expression,a=Md(r?t.name:void 0,i,n),o=Ad(C,e,a,i,t.scope);return[{expression:i,scope:t.scope,node:o}]}),ne=[...te(`invariant`,l),...te(`invariant`,d.invariants,!1)],re=new Map([...l,...d.invariants].map((e,t)=>[oD(e.expression,n),ne[t]])),ie=te(`constraint`,ee),w=te(`constraint`,x),ae=new Map(w.map(e=>[e.expression,e])),T=[...new Map(S.map(e=>[e.predicate,e])).values()],oe=te(`implied`,d.initialPredicates,!1),se=te(`implied`,d.actionProperties.map(e=>({...e,expression:e.box})),!1),ce=(e,t,r,i)=>{try{return Gd(e,t.node,()=>$(t.expression,gD(n,r,i,t.scope)))}catch{return}},le=(e,t,n)=>C&&e?Gd(C,e.node,()=>vD(e.expression,n)):vD(t,n),E=(e,t,n)=>{if(C){for(let r of e){let e=ce(C,r,t,n);if(typeof e!=`boolean`)return;if(!e)return C.primary[r.node]++,!1;C.secondary[r.node]++}return!0}};t.rlReward!==void 0&&UE(`rlreward`,t.rlReward,n),t.periodic!==void 0&&UE(`periodic`,t.periodic,n);let D=iD(t.possible,n);if(n.variables.length===0)return;let O=t.symmetry===void 0?void 0:PE(t.symmetry,n,t.substitutions),ue=t.view===void 0?void 0:KE(`view function`,t.view,n),k=t.view??c(`view`)[0]?.name,de=k===void 0?void 0:VE(k),fe=d.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:zE};return{...e,unchanged:t}}),pe=e=>zC(e.expression,void 0,n)>=2,me=D.filter(e=>!pe(e)),he=D.filter(pe),ge=n.runtime,_e,A=()=>{if(_e)return _e;let e=i(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return _e=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),_e},ve=(e,t)=>$(e,gD(n,t,void 0)),ye=e=>(de!==void 0&&e.forEach(Rc),O===void 0?e:RE(e,O,A())),be=e=>{let t=ye(e);return yd(de===void 0?A().map(e=>t[e]):[ve(de.expression,t)])},xe=e=>d.initialPredicates.find((t,r)=>{let i=C&&ce(C,oe[r],e,void 0);return typeof i==`boolean`?!i:!vD(t.expression,gD(n,e,void 0,t.scope))}),Se=/* @__PURE__ */ new WeakSet,Ce=(t,r,i)=>{let a=i&&!Se.has(i)?i:void 0;if(cD(t,r,a))return!1;try{let e=gD(n,r,void 0,t.scope),i=t.membership;return a&&i?!Xl(r[i.variable],a[i.variable],$(i.set,e)):!xD(t,e)}catch(n){throw i?Lo(e.at(n,e.nt.safetyEvaluationFailure),vo.invariantEvaluationFailed,`Evaluating invariant ${t.name} failed.`):n}},we=(e,t,n)=>{let r=re.get(e.predicate),i=C&&r?ce(C,r,t,void 0):void 0;return typeof i==`boolean`?!i:y.some(r=>r.predicate===e.predicate&&Ce(r,t,n))},Te=pD(t,n);ge.getFingerprint=be;let Ee=()=>{let t=D.find(e=>!ge.possibleCounts.get(e.name));if(!t)return;let r=rD(t.name,n),i=r?` at ${e.X(r)}`:``;return{name:t.name,code:vo.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:W(q(f_(ge),!0))}},De=ue?.body.kind===`Tuple`?ue.body.elements:[],Oe=De.flatMap(e=>e.kind===`Identifier`&&n.variables.includes(e.name)?[e.name]:[]),ke=ue?.body.kind===`Tuple`&&Oe.length===De.length&&new Set(Oe).size===Oe.length,Ae=(e,t)=>ke?A().filter(e=>Oe.includes(n.variables[e])).map(e=>`/\\ ${n.variables[e]} = ${W(q(t[e]))}\n`).join(``):W(q(ve(e,t))),je=(t,r,i)=>vD(t.expression,gD(n,r,i),t=>`${e.K}${bD(t,n)}`),Me=e=>{let t=Object.fromEntries(A().map(t=>[n.variables[t],e[t]]));return de===void 0?t:Ps(t,()=>Ae(de.expression,e))};return ge.toRecord=Me,{properties:d,spec:u,toRecord:Me,evaluateAlias:(t,r,i,a)=>{let o=()=>Me(r.map(e=>e??Xs(`null`)));try{KE(`alias`,t,n);let e=$(BE(t),gD(n,r,i)),a=mD(e);return a===void 0?o():Is(a,t)}catch(t){if(!(t instanceof e.v||t instanceof e.x))throw t;return{...o(),_ALIASEvalError:Mo(t.message,a)}}},isSymmetric:O!==void 0,isConstrained:S.length>0||ee.length>0,getTypedChecks:e=>{if(C!==void 0||D.length>0||t.periodic!==void 0||[...y,...S].some(e=>e.scope!==void 0)||ee.length>0||d.actionProperties.some(e=>e.scope!==void 0)||d.liveness.length>0&&(e===void 0||de!==void 0)||u.init===void 0||u.next===void 0)return;let r=b.map(e=>e.predicate),i=[...new Set(S.map(e=>e.predicate))],a=d.initialPredicates.map(e=>e.expression),o=[...n.facts.ids.keys()],s=tD(u.scope),c=e=>yx(e,n)===void 0&&_h(e,n,`replayed`);return(s===void 0?o.some(c):o.some(e=>!(e.kind===`Operator`&&e.params.length>0)&&ph(e,n)&&c(e))||gh([u.init,u.next,...r,...i,...a,...d.actionProperties.flatMap(e=>[e.action,e.subscript]),...de?[de.expression]:[],...s,...Xw(e??[])],n,`replayed`))?void 0:{init:u.init,next:u.next,scope:u.scope,invariants:r,constraints:i,holdsInitialPredicates:e=>xe(e)===void 0,actionProperties:d.actionProperties,symmetry:O,view:de?.expression,variableOrder:A(),liveness:e}},getTlcOrder:A,getStoredFingerprints:(e,t)=>de!==void 0||Te?BigInt64Array.from(e,be):xd(t,A()),getFingerprintState:e=>{if(Te)return[String(be(e))];let t=ye(e);return de===void 0?t:[ve(de.expression,t)]},findViolatedInvariant:(e,t)=>{let n=C===void 0?y.find(n=>Ce(n,e,t)):b.find(n=>we(n,e,t));return n&&Se.add(e),n},forEachViolatedInvariant:(e,t)=>{for(let n of b)we(n,e,void 0)&&(Se.add(e),t(n))},checkReplayedInitialState:(e,t,n,r)=>{let i=(n,r,i)=>le(n,r,gD(t,e,void 0,i));T.every(e=>i(ae.get(e.predicate),e.predicate,e.scope))&&n();for(let e of b)i(re.get(e.predicate),e.predicate,e.scope)||r({status:`invariant-violation`,name:e.name});let a=d.initialPredicates.find((e,t)=>!i(oe[t],e.expression,e.scope));a&&r({status:`liveness-violation`,name:a.name})},checkReplayedSuccessor:(e,t,n,r)=>(!(!(T.every(e=>le(ae.get(e.predicate),e.predicate,gD(n,t,void 0,e.scope)))&&ee.every((r,i)=>le(ie[i],r.expression,gD(n,e,t,r.scope))))||r())||b.every(e=>le(re.get(e.predicate),e.predicate,gD(n,t,void 0,e.scope))))&&fe.every((r,i)=>le(se[i],r.box,gD(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>E(w,e)??S.every(r=>cD(r,e,t)||xD(r,gD(n,e,void 0))),findFailedInitialPredicate:xe,findViolatedActionProperty:(e,t)=>fe.find((r,i)=>{let a=C&&ce(C,se[i],e,t);if(typeof a==`boolean`)return!a;try{return!vD(r.action,gD(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Q(r.box)}`)&&!_D(r.unchanged,gD(n,e,t,r.scope),`a subscript`)}catch(e){throw Lo(PD(e),vo.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>E(ie,e,t)??ee.every(n=>je(n,e,t)),getExcludingConstraints:(t,r)=>[...S.filter(e=>!xD(e,gD(n,r,void 0))),...ee.filter(e=>!je(e,t,r))].map(t=>{let r=rD(t.name,n);return r?e.X(r):t.name}),trackStatePossible:me.length===0?SD:e=>CD(me,ge,gD(n,e,void 0)),trackActionPossible:he.length===0?SD:(e,t)=>CD(he,ge,gD(n,e,t)),findUnwitnessedPossible:Ee,getReward:(r,i,a)=>{if(t.rlReward===void 0)return a;let o=BE(t.rlReward),s=$(o,gD(n,r,i));if(typeof s!=`number`)throw new e.x(yD(`integer`,o,n));return s},findPostconditionViolation:(r=!1)=>{let i=c(`postcondition`),a=t.postconditions.map(e=>{let t=Wb(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}`:!WE(t)&&yx(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=wD(e=>vD(BE(r),e),n);if(!i)return;let a=Wb(r,n)?.body,o=rD(r,n),s=o?` at ${a?.kind===`Number`?Sb(a):e.X(o)}`:``;return i.message===void 0?{name:t,code:vo.postconditionFalse,message:`Postcondition ${t}${s} is false.`}:{name:t,code:vo.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=Ee();if(s)return s;for(let e of t.postconditions){let t=o(e,e);if(t)return t}}}},PD=t=>t instanceof e.A?e.at(t,t.exitCode):t,FD=(e,t)=>e*((t-e)/2**64),ID=e=>e.includes(`.`)?e:`${e}.0`,LD=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return ID(String(e));let[n,r]=e.toExponential().split(`e`);return`${ID(n)}E${r.replace(`+`,``)}`},RD=e=>e!==void 0&&e>=`0`&&e<=`9`,zD=e=>{if(e===0)return`0.0`;let t=LD(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;RD(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;RD(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;RD(t[n])&&r<2;)i+=t[n++],r++;for(RD(t[n])&&Number(t[n])>=5&&(i=BD(i));RD(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},BD=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${BD(r)}.`:n===`9`?`${BD(r)}0`:`${r}${Number(n)+1}`},VD=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}`)},HD=(e,t,n)=>{if(FD(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},UD=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}).`},WD=[void 0,`lambda`,`tuple`,`record`],GD=()=>{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=lu(e.domain);return t?(a(7),a(WD.indexOf(rc(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(WD.indexOf(rc(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})}},KD=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 Xs(t.strings[n[r++]]);if(e===5)return Qs(i(n[r++]));let a=WD[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=il({kind:`Interval`,low:e,high:e+t-1});return nc(ec(o,i(t)),a)}let o=n[r++],s=i(o);return nc(ec(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return lb}}),Object.defineProperty(exports,"$n",{enumerable:!0,get:function(){return M}}),Object.defineProperty(exports,"$t",{enumerable:!0,get:function(){return dc}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return xw}}),Object.defineProperty(exports,"An",{enumerable:!0,get:function(){return Rr}}),Object.defineProperty(exports,"At",{enumerable:!0,get:function(){return gc}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return BS}}),Object.defineProperty(exports,"Bn",{enumerable:!0,get:function(){return On}}),Object.defineProperty(exports,"Bt",{enumerable:!0,get:function(){return q}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return tT}}),Object.defineProperty(exports,"Cn",{enumerable:!0,get:function(){return li}}),Object.defineProperty(exports,"Ct",{enumerable:!0,get:function(){return hd}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return yw}}),Object.defineProperty(exports,"Dn",{enumerable:!0,get:function(){return Kr}}),Object.defineProperty(exports,"Dt",{enumerable:!0,get:function(){return Yo}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Yw}}),Object.defineProperty(exports,"En",{enumerable:!0,get:function(){return Yr}}),Object.defineProperty(exports,"Et",{enumerable:!0,get:function(){return yd}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return RS}}),Object.defineProperty(exports,"Fn",{enumerable:!0,get:function(){return Un}}),Object.defineProperty(exports,"Ft",{enumerable:!0,get:function(){return ec}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return Q}}),Object.defineProperty(exports,"Gn",{enumerable:!0,get:function(){return jn}}),Object.defineProperty(exports,"Gt",{enumerable:!0,get:function(){return Qo}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return WS}}),Object.defineProperty(exports,"Hn",{enumerable:!0,get:function(){return kn}}),Object.defineProperty(exports,"Ht",{enumerable:!0,get:function(){return xu}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return HS}}),Object.defineProperty(exports,"In",{enumerable:!0,get:function(){return xn}}),Object.defineProperty(exports,"It",{enumerable:!0,get:function(){return cl}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return Wb}}),Object.defineProperty(exports,"Jn",{enumerable:!0,get:function(){return Pn}}),Object.defineProperty(exports,"Jt",{enumerable:!0,get:function(){return pl}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return $}}),Object.defineProperty(exports,"Kn",{enumerable:!0,get:function(){return wn}}),Object.defineProperty(exports,"Kt",{enumerable:!0,get:function(){return Tl}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return zS}}),Object.defineProperty(exports,"Ln",{enumerable:!0,get:function(){return Rn}}),Object.defineProperty(exports,"Lt",{enumerable:!0,get:function(){return Qs}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return NC}}),Object.defineProperty(exports,"Mn",{enumerable:!0,get:function(){return Br}}),Object.defineProperty(exports,"Mt",{enumerable:!0,get:function(){return Xs}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return LS}}),Object.defineProperty(exports,"Nn",{enumerable:!0,get:function(){return Ur}}),Object.defineProperty(exports,"Nt",{enumerable:!0,get:function(){return sl}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return bw}}),Object.defineProperty(exports,"On",{enumerable:!0,get:function(){return Wr}}),Object.defineProperty(exports,"Ot",{enumerable:!0,get:function(){return qs}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return KS}}),Object.defineProperty(exports,"Pn",{enumerable:!0,get:function(){return Hr}}),Object.defineProperty(exports,"Pt",{enumerable:!0,get:function(){return Uc}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return db}}),Object.defineProperty(exports,"Qn",{enumerable:!0,get:function(){return vn}}),Object.defineProperty(exports,"Qt",{enumerable:!0,get:function(){return G}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return YS}}),Object.defineProperty(exports,"Rn",{enumerable:!0,get:function(){return zn}}),Object.defineProperty(exports,"Rt",{enumerable:!0,get:function(){return ol}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return LE}}),Object.defineProperty(exports,"Sn",{enumerable:!0,get:function(){return ti}}),Object.defineProperty(exports,"St",{enumerable:!0,get:function(){return pd}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return $w}}),Object.defineProperty(exports,"Tn",{enumerable:!0,get:function(){return di}}),Object.defineProperty(exports,"Tt",{enumerable:!0,get:function(){return ud}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return IS}}),Object.defineProperty(exports,"Un",{enumerable:!0,get:function(){return Ln}}),Object.defineProperty(exports,"Ut",{enumerable:!0,get:function(){return $o}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return JS}}),Object.defineProperty(exports,"Vn",{enumerable:!0,get:function(){return En}}),Object.defineProperty(exports,"Vt",{enumerable:!0,get:function(){return bu}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return Qx}}),Object.defineProperty(exports,"Wn",{enumerable:!0,get:function(){return Dn}}),Object.defineProperty(exports,"Wt",{enumerable:!0,get:function(){return Zs}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return Wx}}),Object.defineProperty(exports,"Xn",{enumerable:!0,get:function(){return Fn}}),Object.defineProperty(exports,"Xt",{enumerable:!0,get:function(){return uc}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return yx}}),Object.defineProperty(exports,"Yn",{enumerable:!0,get:function(){return In}}),Object.defineProperty(exports,"Yt",{enumerable:!0,get:function(){return pc}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return ES}}),Object.defineProperty(exports,"Zn",{enumerable:!0,get:function(){return Sn}}),Object.defineProperty(exports,"Zt",{enumerable:!0,get:function(){return Rc}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return jD}}),Object.defineProperty(exports,"_n",{enumerable:!0,get:function(){return ri}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return gh}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return HD}}),Object.defineProperty(exports,"an",{enumerable:!0,get:function(){return Fo}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return sy}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return AD}}),Object.defineProperty(exports,"bn",{enumerable:!0,get:function(){return si}}),Object.defineProperty(exports,"bt",{enumerable:!0,get:function(){return Ed}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return OD}}),Object.defineProperty(exports,"cn",{enumerable:!0,get:function(){return qo}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return z_}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return MD}}),Object.defineProperty(exports,"dn",{enumerable:!0,get:function(){return Ro}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return m_}}),Object.defineProperty(exports,"en",{enumerable:!0,get:function(){return vo}}),Object.defineProperty(exports,"er",{enumerable:!0,get:function(){return He}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return fb}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return ND}}),Object.defineProperty(exports,"fn",{enumerable:!0,get:function(){return Wo}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return v_}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return DD}}),Object.defineProperty(exports,"gn",{enumerable:!0,get:function(){return ai}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return ph}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return hD}}),Object.defineProperty(exports,"hn",{enumerable:!0,get:function(){return qr}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return Gg}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return VD}}),Object.defineProperty(exports,"in",{enumerable:!0,get:function(){return Mo}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return pb}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return XC}}),Object.defineProperty(exports,"jn",{enumerable:!0,get:function(){return Lr}}),Object.defineProperty(exports,"jt",{enumerable:!0,get:function(){return Yc}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return gw}}),Object.defineProperty(exports,"kn",{enumerable:!0,get:function(){return Ir}}),Object.defineProperty(exports,"kt",{enumerable:!0,get:function(){return Vl}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return kD}}),Object.defineProperty(exports,"ln",{enumerable:!0,get:function(){return Uo}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return R_}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return gD}}),Object.defineProperty(exports,"mn",{enumerable:!0,get:function(){return ki}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return Vg}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return GD}}),Object.defineProperty(exports,"nn",{enumerable:!0,get:function(){return So}}),Object.defineProperty(exports,"nr",{enumerable:!0,get:function(){return Ee}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return mb}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return FD}}),Object.defineProperty(exports,"on",{enumerable:!0,get:function(){return Po}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return cy}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return TD}}),Object.defineProperty(exports,"pn",{enumerable:!0,get:function(){return No}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return g_}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return Fx}}),Object.defineProperty(exports,"qn",{enumerable:!0,get:function(){return Mn}}),Object.defineProperty(exports,"qt",{enumerable:!0,get:function(){return ks}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return zD}}),Object.defineProperty(exports,"rn",{enumerable:!0,get:function(){return jo}}),Object.defineProperty(exports,"rr",{enumerable:!0,get:function(){return oe}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return Iy}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return UD}}),Object.defineProperty(exports,"sn",{enumerable:!0,get:function(){return Oo}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return ly}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return KD}}),Object.defineProperty(exports,"tn",{enumerable:!0,get:function(){return yo}}),Object.defineProperty(exports,"tr",{enumerable:!0,get:function(){return Re}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return ub}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return ED}}),Object.defineProperty(exports,"un",{enumerable:!0,get:function(){return ko}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return B_}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return JE}}),Object.defineProperty(exports,"vn",{enumerable:!0,get:function(){return Jr}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return sf}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return eT}}),Object.defineProperty(exports,"wn",{enumerable:!0,get:function(){return oi}}),Object.defineProperty(exports,"wt",{enumerable:!0,get:function(){return md}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return PD}}),Object.defineProperty(exports,"xn",{enumerable:!0,get:function(){return ui}}),Object.defineProperty(exports,"xt",{enumerable:!0,get:function(){return yf}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return YE}}),Object.defineProperty(exports,"yn",{enumerable:!0,get:function(){return ci}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return Td}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return qS}}),Object.defineProperty(exports,"zn",{enumerable:!0,get:function(){return An}}),Object.defineProperty(exports,"zt",{enumerable:!0,get:function(){return Wu}});
|