tla-ts 0.0.10-dev.28c823e4b → 0.0.10-dev.b4a856304

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.
Files changed (68) hide show
  1. package/dist/index.cjs +1 -1
  2. package/dist/index.d.cts +0 -34
  3. package/dist/index.d.ts +0 -34
  4. package/dist/index.js +1 -1
  5. package/dist/parallel-worker.cjs +1 -1
  6. package/dist/parallel-worker.js +1 -1
  7. package/dist/prove.cjs +43 -43
  8. package/dist/prove.js +47 -47
  9. package/dist/run.cjs +30 -30
  10. package/dist/run.js +33 -33
  11. package/dist/transfer.cjs +38 -38
  12. package/dist/transfer.js +39 -39
  13. package/package.json +1 -1
  14. package/src/ast.ts +5 -0
  15. package/src/bags.ts +5 -2
  16. package/src/builtins.ts +8 -1
  17. package/src/check.ts +193 -128
  18. package/src/cli/run.ts +2 -0
  19. package/src/cli/runtime-invariants.ts +7 -8
  20. package/src/cli/shared.ts +4 -0
  21. package/src/cli/tlc-arguments.ts +30 -24
  22. package/src/cli/tlc-usage.ts +3 -2
  23. package/src/evaluate.ts +102 -26
  24. package/src/java-overrides.ts +9 -4
  25. package/src/json-reader.ts +2 -1
  26. package/src/json.ts +11 -4
  27. package/src/levels.ts +15 -7
  28. package/src/lexer.ts +83 -72
  29. package/src/liveness-checker.ts +106 -77
  30. package/src/liveness.ts +34 -10
  31. package/src/parallel.ts +33 -26
  32. package/src/parser.ts +226 -163
  33. package/src/pcal/ast.ts +65 -53
  34. package/src/pcal/parse.ts +191 -144
  35. package/src/pcal/tokenize.ts +115 -91
  36. package/src/pcal/translate.ts +98 -83
  37. package/src/pcal/validate.ts +50 -48
  38. package/src/pretty-print.ts +6 -6
  39. package/src/randomization.ts +4 -1
  40. package/src/resolve.ts +70 -12
  41. package/src/runtime.ts +18 -11
  42. package/src/sany/builtins.ts +3 -1
  43. package/src/sany/generator.ts +127 -74
  44. package/src/sany/levels.ts +9 -5
  45. package/src/sany/lexer.ts +44 -40
  46. package/src/sany/linter.ts +1 -0
  47. package/src/search.ts +1 -1
  48. package/src/simulate.ts +59 -50
  49. package/src/spec-description.ts +34 -23
  50. package/src/standard-definitions.ts +3 -0
  51. package/src/standard-modules.ts +12 -1
  52. package/src/state-graph.ts +8 -1
  53. package/src/subexpressions.ts +47 -38
  54. package/src/successors.ts +35 -14
  55. package/src/symmetry.ts +19 -4
  56. package/src/tlc/fingerprint.ts +21 -15
  57. package/src/tlc/jar-data.ts +1 -0
  58. package/src/tlc/messages.ts +21 -2
  59. package/src/tlc/order.ts +38 -20
  60. package/src/tlc/random.ts +30 -18
  61. package/src/tlc/replay.ts +33 -13
  62. package/src/tlc/summary.ts +45 -36
  63. package/src/tlc/tlc-operators.ts +14 -4
  64. package/src/tlc/tlcext-operators.ts +15 -11
  65. package/src/tlc/trace-spec.ts +4 -0
  66. package/src/tlc/value-stream.ts +13 -9
  67. package/src/tlc/version.ts +1 -0
  68. package/src/values.ts +181 -74
package/dist/transfer.cjs CHANGED
@@ -6,20 +6,20 @@
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=/* @__PURE__ */ new Set(/* @__PURE__ */ `ACTION.ACTIONS.ASSUME.ASSUMPTION.AXIOM.BY.CASE.CHOOSE.CONSTANT.CONSTANTS.COROLLARY.DEF.DEFINE.DEFS.DOMAIN.ELSE.ENABLED.EXCEPT.EXTENDS.HAVE.HIDE.IF.IN.INSTANCE.LAMBDA.LEMMA.LET.LOCAL.MODULE.NEW.OBVIOUS.OMITTED.ONLY.OTHER.PICK.PROOF.PROPOSITION.PROVE.QED.RECURSIVE.STATE.SUBSET.SUFFICES.TAKE.TEMPORAL.TEMPORALS.THEN.THEOREM.UNCHANGED.UNION.USE.VARIABLE.VARIABLES.WITH.WITNESS`.split(`.`)),r=/* @__PURE__ */ new Map([[`in`,`\\in`],[`notin`,`\\notin`],[`subseteq`,`\\subseteq`],[`subset`,`\\subset`],[`supseteq`,`\\supseteq`],[`supset`,`\\supset`],[`cup`,`\\cup`],[`union`,`\\cup`],[`cap`,`\\cap`],[`intersect`,`\\cap`],[`X`,`\\X`],[`times`,`\\X`],[`o`,`\\o`],[`circ`,`\\o`],[`div`,`\\div`],[`land`,`/\\`],[`lor`,`\\/`],[`lnot`,`~`],[`neg`,`~`],[`equiv`,`<=>`],[`leq`,`<=`],[`geq`,`>=`],[`A`,`\\A`],[`forall`,`\\A`],[`E`,`\\E`],[`exists`,`\\E`],[`AA`,`\\AA`],[`EE`,`\\EE`],[`cdot`,`\\cdot`],[`sqsubseteq`,`\\sqsubseteq`],[`sqsupseteq`,`\\sqsupseteq`],[`sqsubset`,`\\sqsubset`],[`sqsupset`,`\\sqsupset`],[`sqcap`,`\\sqcap`],[`sqcup`,`\\sqcup`],[`oplus`,`\\oplus`],[`ominus`,`\\ominus`],[`otimes`,`\\otimes`],[`oslash`,`\\oslash`],[`odot`,`\\odot`],[`uplus`,`\\uplus`],[`prec`,`\\prec`],[`preceq`,`\\preceq`],[`succ`,`\\succ`],[`succeq`,`\\succeq`],[`sim`,`\\sim`],[`simeq`,`\\simeq`],[`approx`,`\\approx`],[`cong`,`\\cong`],[`asymp`,`\\asymp`],[`doteq`,`\\doteq`],[`propto`,`\\propto`],[`wr`,`\\wr`],[`star`,`\\star`],[`bullet`,`\\bullet`],[`bigcirc`,`\\bigcirc`],[`ll`,`\\ll`],[`gg`,`\\gg`]]),i=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),a=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),o=/* @__PURE__ */ new Map([[`∃`,`\\E`],[`∀`,`\\A`],[`∷`,`::`],[`≜`,`==`],[`⟨`,`<<`],[`⟩_`,`>>_`],[`⟩`,`>>`],[`→`,`->`],[`←`,`<-`],[`↦`,`|->`],[`⁺`,`^+`],[`¬`,`~`],[`□`,`[]`],[`◇`,`<>`],[`∧`,`/\\`],[`∨`,`\\/`],[`∈`,`\\in`],[`≈`,`\\approx`],[`≔`,`:=`],[`≍`,`\\asymp`],[`◯`,`\\bigcirc`],[`⩴`,`::=`],[`●`,`\\bullet`],[`∩`,`\\cap`],[`⋅`,`\\cdot`],[`∘`,`\\o`],[`≅`,`\\cong`],[`∪`,`\\cup`],[`÷`,`\\div`],[`≐`,`\\doteq`],[`‥`,`..`],[`…`,`...`],[`≡`,`<=>`],[`‼`,`!!`],[`≥`,`>=`],[`≫`,`\\gg`],[`⇔`,`<=>`],[`⇒`,`=>`],[`⫤`,`=|`],[`↝`,`~>`],[`≤`,`<=`],[`≪`,`\\ll`],[`⊣`,`-|`],[`≠`,`#`],[`∉`,`\\notin`],[`⊙`,`\\odot`],[`⊖`,`\\ominus`],[`⊕`,`\\oplus`],[`⊘`,`\\oslash`],[`⊗`,`\\otimes`],[`⇸`,`-+->`],[`≺`,`\\prec`],[`⪯`,`\\preceq`],[`∝`,`\\propto`],[`⁇`,`??`],[`⊨`,`|=`],[`⊢`,`|-`],[`∼`,`\\sim`],[`≃`,`\\simeq`],[`⊓`,`\\sqcap`],[`⊔`,`\\sqcup`],[`⊏`,`\\sqsubset`],[`⊑`,`\\sqsubseteq`],[`⊐`,`\\sqsupset`],[`⊒`,`\\sqsupseteq`],[`⋆`,`\\star`],[`⊂`,`\\subset`],[`⊆`,`\\subseteq`],[`≻`,`\\succ`],[`⪰`,`\\succeq`],[`⊃`,`\\supset`],[`⊇`,`\\supseteq`],[`×`,`\\X`],[`⊎`,`\\uplus`],[`‖`,`||`],[`≀`,`\\wr`]]),s=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),c=e=>e.startsWith(`\\`)?parseInt(e.slice(2),s.get(e[1].toLowerCase())):Number(e),l=/-{4,} *MODULE\b/,u=/* @__PURE__ */ new Uint8Array(128);(/* @__PURE__ */ new Map([[`0123456789`,33],[`abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ`,2],[`_`,4],[`01`,8],[`01234567`,16],[`abcdefABCDEF`,32]])).forEach((e,t)=>{for(let n of t)u[n.charCodeAt(0)]|=e});const d=(e,t)=>e<128&&(u[e]&t)!==0,f=(e,t,n)=>{let r=t;for(;d(e.charCodeAt(r),n);)r++;return r},p=/* @__PURE__ */ new Map;a.forEach(e=>{let t=e.charCodeAt(0),n=p.get(t)??[];n.push(e),p.set(t,n)});const m=(e,t)=>{let n=p.get(e.charCodeAt(t));if(n!==void 0){for(let r=0;r<n.length;r++)if(e.startsWith(n[r],t))return n[r]}},h=(e,t)=>{if(e.charCodeAt(t)<128)return;let n=e.slice(t,t+2);if(o.has(n))return n;let r=e[t];return o.has(r)?r:void 0},g=(e,t)=>{let n=e.charCodeAt(t);if(n===92&&d(e.charCodeAt(t+1),2)){let n=e.slice(t+1,f(e,t+1,2)),i=n.length;for(;i>0&&!r.has(n.slice(0,i));)i--;let a=r.get(n.slice(0,i));return{text:a??`\\`,length:a===void 0?1:i+1}}let a=h(e,t);if(a!==void 0)return{text:o.get(a)??``,length:a.length};let s=m(e,t);return s?{text:i.get(s)??s,length:s.length}:n===92?{text:`\\`,length:1}:void 0},_=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),ee=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>o.has(e)||_.has(e));return n===void 0?void 0:{text:n,length:n.length}},te=(e,t,n)=>{let r=t;for(;r<e.length&&n(e[r]);)r++;return r},v=(e,t,n)=>{let r=e[t+1]===`+`||e[t+1]===`*`,i=r?t+2:f(e,t+1,1);if(i===t+1||e[i]!==`>`)return 0;let a=!r||!n,o=a?f(e,i+1,7):i+1,s=a&&o===i+1&&(e[o]===`*`||e[o]===`-`);return te(e,s?o+1:o,e=>e===`.`)-t},ne=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,y={n:`
10
- `,t:` `,r:`\r`,f:`\f`},re=(e,t)=>t===9?e+8-e%8:e+1,b=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),ie=(e,t)=>{if(e.charCodeAt(t)!==92)return 0;let n=b.get(e.charAt(t+1).toLowerCase());if(n===void 0)return 0;let r=f(e,t+2,n);return r===t+2?0:r-t},ae=(t,r=!1)=>{let i=l.exec(t);if(!i)throw new e.F(`Expected a module header such as ---- MODULE Name ----`);let a=[],o=/* @__PURE__ */ new Map,s=t.slice(0,i.index).split(`
11
- `),c=i.index,u=s.length,p=i.index-s[s.length-1].length,m=0,h=-1,ee=0,ne=0,b=()=>{for((h!==p||ee>c)&&(h=p,ee=p,ne=0);ee<c;ee++)ne=re(ne,t.charCodeAt(ee));return re(ne,t.charCodeAt(c))},ae=(e,t,n,r)=>{let i=b();a.push({kind:e,text:t,spelling:r,line:u,column:i,endColumn:i+n-1}),c+=n},oe=e=>{for(let n=0;n<e;n++)t.charCodeAt(c)===10&&(u++,p=c+1),c++},se=n=>new e.F(`${n} at line ${u}, column ${b()}`,void 0,{reason:n,line:u,column:b(),isEnd:c>=t.length});for(;c<t.length;){let e=t.charCodeAt(c);if(e===10||e===32||e===9||e===13){oe(1);continue}if(e===92&&t.charCodeAt(c+1)===42){oe(te(t,c,e=>e!==`
12
- `&&e!==`\r`)-c);continue}if(e===40&&t.charCodeAt(c+1)===42){let e=0;do{if(c>=t.length)throw se(`Unterminated comment`);t.startsWith(`(*`,c)?(e++,oe(2)):t.startsWith(`*)`,c)?(e--,oe(2)):oe(1)}while(e>0);continue}if(e===45&&t.startsWith(`----`,c)){let e=te(t,c,e=>e===`-`)-c,n=te(t,c+e,e=>e===` `);t.startsWith(`MODULE`,n)&&m++,ae(`Separator`,`----`,e);continue}if(e===61&&t.startsWith(`====`,c)){if(ae(`ModuleEnd`,`====`,te(t,c,e=>e===`=`)-c),m--,m<=0)break;continue}if(e===34){let e=u,n=b(),r=[];for(oe(1);t.charCodeAt(c)!==34;){let e=t.charCodeAt(c);if(c>=t.length||e===10||e===13)throw se(`Unterminated string`);if(e===92){let e=t[c+1];if(e===void 0||!`ntrf\\"`.includes(e))throw se(`Invalid escape in string`);r.push(y[e]??e),oe(2)}else r.push(t[c]),oe(1)}oe(1),a.push({kind:`String`,text:r.join(``),line:e,column:n,endColumn:b()-1});continue}let i=ie(t,c);if(i>0){ae(`Number`,t.slice(c,c+i),i);continue}if(d(e,7)){let r=f(t,c,7),i=t.slice(c,r),a=f(t,c,1);if(a===r){let e=t.charCodeAt(r)===46?f(t,r+1,1):r,n=e>r+1,a=n?t.slice(c,e):i;ae(n?`Decimal`:`Number`,a,a.length);continue}if(!/[A-Za-z]/.test(i)){let n=e===95?`_`:t.slice(c,a);ae(n===`_`?`Operator`:`Number`,n,n.length);continue}if(i.startsWith(`WF_`)||i.startsWith(`SF_`)){ae(`Keyword`,i.slice(0,3),3);continue}let s=o.get(i)??i;o.set(s,s),ae(n.has(i)?`Keyword`:`Identifier`,s,i.length);continue}let s=t[c];if(e>=128&&_.has(s)){ae(`Identifier`,o.get(s)??s,1),o.set(s,s);continue}if(e===60){let e=v(t,c,r);if(e>0){ae(`Step`,t.slice(c,c+e),e);continue}}let l=g(t,c);if(l){let e=t.slice(c,c+l.length);ae(`Operator`,l.text,l.length,e===l.text?void 0:e)}else throw se(`Unexpected character ${JSON.stringify(s)}`)}let ce=b();return a.push({kind:`End`,text:``,line:u,column:ce,endColumn:ce}),a},oe=[[`EOF`],[`BEGIN_PRAGMA`,`--->`],[`_BM1`],[`NUMBER`],[`_BM2`],[`_BM0`],[`SEPARATOR`],[`END_MODULE`],[`ACTION`,`ACTION`,`ACTIONS`],[`ASSUME`,`ASSUME`],[`BOXASSUME`,`[]ASSUME`],[`ASSUMPTION`,`ASSUMPTION`,`AXIOM`],[`CASE`,`CASE`],[`CHOOSE`,`CHOOSE`],[`CONSTANT`,`CONSTANT`,`CONSTANTS`],[`ELSE`,`ELSE`],[`EXCEPT`,`EXCEPT`],[`EXISTS`,`\\E`,`\\exists`,`∃`],[`EXTENDS`,`EXTENDS`],[`FORALL`,`\\A`,`\\forall`,`∀`],[`IF`,`IF`],[`INSTANCE`,`INSTANCE`],[`LET`,`LET`],[`LETIN`,`IN`],[`LOCAL`,`LOCAL`],[`MODULE`,`MODULE`],[`NEW`,`NEW`],[`OTHER`,`OTHER`],[`PROPOSITION`,`PROPOSITION`,`LEMMA`,`COROLLARY`],[`SF`,`SF_`],[`T_EXISTS`,`\\EE`],[`T_FORALL`,`\\AA`],[`THEN`,`THEN`],[`BY`,`BY`],[`ONLY`,`ONLY`],[`DEFINE`,`DEFINE`],[`DF`,`DEF`,`DEFS`],[`THEOREM`,`THEOREM`],[`USE`,`USE`],[`HIDE`,`HIDE`],[`HAVE`,`HAVE`],[`OBVIOUS`,`OBVIOUS`],[`OMITTED`,`OMITTED`],[`LAMBDA`,`LAMBDA`],[`TAKE`,`TAKE`],[`PROOF`,`PROOF`],[`PROVE`,`PROVE`],[`BOXPROVE`,`[]PROVE`],[`QED`,`QED`],[`RECURSIVE`,`RECURSIVE`],[`STATE`,`STATE`],[`TEMPORAL`,`TEMPORAL`,`TEMPORALS`],[`PICK`,`PICK`],[`WITNESS`,`WITNESS`],[`SUFFICES`,`SUFFICES`],[`VARIABLE`,`VARIABLE`,`VARIABLES`],[`WF`,`WF_`],[`WITH`,`WITH`],[`COMMA`,`,`],[`COLON`,`:`],[`COLONCOLON`,`::`,`∷`],[`DOT`,`.`],[`US`,`_`],[`DEF`,`==`,`≜`],[`LBR`,`(`],[`RBR`,`)`],[`DEFBREAK`,`-|-`],[`LSB`,`[`],[`ARSB`,`]_`],[`RSB`,`]`],[`LBC`,`{`],[`RBC`,`}`],[`LAB`,`<<`,`⟨`],[`ARAB`,`>>_`,`⟩_`],[`RAB`,`>>`,`⟩`],[`BANG`,`!`],[`ARROW`,`->`,`→`],[`SUBSTITUTE`,`<-`,`←`],[`MAPTO`,`|->`,`↦`],[`NUMBER_LITERAL`],[`STRING_LITERAL`],[`BAND`],[`BOR`],[`op_57`,`'`],[`op_68`,`^+`,`⁺`],[`op_69`,`^*`],[`op_70`,`^#`],[`op_76`,`-.`],[`op_26`,`\\lnot`,`¬`],[`op_29`,`\\neg`],[`op_58`,`~`],[`CASESEP`,`[]`,`□`],[`op_61`,`<>`,`◇`],[`op_112`,`ENABLED`],[`op_113`,`UNCHANGED`],[`op_114`,`SUBSET`],[`op_115`,`UNION`],[`op_116`,`DOMAIN`],[`op_1`,`//`],[`AND`,`/\\`,`∧`],[`op_3`,`/=`],[`op_4`,`/`],[`OR`,`\\/`,`∨`],...[`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`].map(e=>[`infix`,e]),[`IN`,`\\in`,`∈`],...(/* @__PURE__ */ `\\intersect.\\union.\\land.\\leq.\\ll.\\lor.\\o.\\odot.\\ominus.\\oplus.\\oslash.\\otimes.\\prec.\\preceq.\\propto.\\sim.\\simeq.\\sqcap.\\sqcup.\\sqsubset.\\sqsupset.\\sqsubseteq.\\sqsupseteq.\\star.\\subset.\\subseteq.\\succ.\\succeq.\\supset.\\supseteq.\\uplus.\\wr.\\.~>.=>.=<.=|`.split(`.`)).map(e=>[`infix`,e]),[`EQUALS`,`=`],...[`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`].map(e=>[`infix`,e]),[`op_77`,`-`],...[`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`].map(e=>[`infix`,e]),[`op_119`,`\\X`],[`IDENTIFIER`],[`ProofStepLexeme`],[`ProofImplicitStepLexeme`],[`ProofStepDotLexeme`],[`BareLevelLexeme`],[`UnnumberedStepLexeme`]],se=oe.map(e=>e[0]),ce=new Map(se.map((e,t)=>[e,t]).reverse()),x=t=>{let n=ce.get(t);if(n===void 0)throw new e.y(`Unknown SANY token kind ${t}`);return n},le=new Map(oe.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),S=Math.max(...[...le.keys()].map(e=>e.length)),ue=Array.from({length:S},(e,t)=>S-t),de=/----+ *MODULE/y,fe=[/_\w*[A-Za-z]\w*/y,/[0-9]\w*[A-Za-z]\w*/y,/[WS](?:[a-zA-EG-Z_0-9]\w*)?/y,/[WS]F(?:[A-Za-z0-9]\w*)?/y,/[a-zA-RT-VX-Z]\w*/y,/@|ℕ|ℤ|ℝ/y],C=e=>[/[0-9][A-Za-z0-9]*/,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*/,/[a-zA-RT-VX-Z][A-Za-z0-9]*/].map(t=>RegExp(`${t.source}${e}`,`y`)),w=C(String.raw`\.\/\\`),T=C(String.raw`\.\\\/`),E=String.raw`<(?:[0-9]+|\+|\*)>`,pe=[[`_BM0`,[de]],[`SEPARATOR`,[/----+/y]],[`END_MODULE`,[/====+/y]],[`NUMBER_LITERAL`,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[`STRING_LITERAL`,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[`BAND`,w],[`BOR`,T],[`IDENTIFIER`,fe],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${E}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(E,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${E}(?:\*\.*|-\.*|\.+)`,`y`)]]],me=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[de]]],he=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[de]],[`BAND`,w],[`BOR`,T],[`IDENTIFIER`,fe]],ge=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),_e=(e,t,n)=>e.map(([e,r])=>({kind:x(e),length:Math.max(...r.map(e=>ge(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),ve=(e,t)=>{let n=ue.find(n=>le.has(e.slice(t,t+n))),r=_e(pe,e,t);if(n===void 0)return r;let i={kind:le.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},ye=e=>e+8-e%8,D=e=>{let t=[],n=[],r=1,i=0,a=!1,o=!1;for(let s of e)for(let e=0;e<s.length;e++)i++,o?(o=!1,r++,i=1):a&&(a=!1,s===`
13
- `?o=!0:(r++,i=1)),s===`\r`?a=!0:s===`
14
- `?o=!0:s===` `&&(i=ye(i-1)),t.push(r),n.push(i);return{lines:t,columns:n}},be=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,xe=new Set([...le.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),Se=(e,t)=>{let n=0;for(;xe.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,ge(be,e,t)))},Ce=e=>{let t=D(e),n=0,r=`DEFAULT`,i=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),a=()=>i(x(`EOF`),e.length-1,0),o=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?Ee(o,s,e[a],i):t.lines[n]===o?e[a]===`
15
- `||e[a]===`\r`?Ee(o+1,0,void 0,i):Ee(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},s=()=>{let t=n;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return o(t,e.length,``);n+=r+1;return}let r=0,i=t,a=t;for(;a<e.length;)if(e.startsWith(`(*`,a))r++,a+=2,r>1&&(i=a);else if(e.startsWith(`*)`,a)){if(r--,a+=2,i=a,r===0){n=a;return}}else a++;return n=a,i===e.length?void 0:o(i,a,``)},c=t=>{for(;n<e.length;){let a=_e(t,e,n);if(a.length>0){let e=i(a.kind,n,a.length);return n+=a.length,se[a.kind].startsWith(`_BM`)&&(r=`SPEC`),se[a.kind]===`BEGIN_PRAGMA`&&(r=`PRAGMA`),e}n++}return a()};return()=>{if(r===`DEFAULT`)return c(me);if(r===`PRAGMA`)return c(he);for(;n<e.length;){let t=n;if(`
16
- \r`.includes(e[t]))n++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=s();if(e!==void 0)return e}else{let r=ve(e,t);if(r.length===0){let n=Se(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),a=r<e.length?n:i.length>1?i:``;return o(t,r,a)}let a=i(r.kind,t,r.length);return n+=r.length,a}}return a()}},we=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
17
- `,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),Te=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>we.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),Ee=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${Te(n)}" (${n.charCodeAt(0)}), `}after : "${Te(r)}"`,De=e=>{let t=Ce(e);for(let e=t();typeof e!=`string`&&e.kind!==x(`EOF`);e=t()){let t=e.image.split(``).findIndex(e=>{let t=e.charCodeAt(0);return t>255&&(t&255)<128});if(t===-1)continue;let n=e.image.slice(1,t+1).split(``).reduce((e,t)=>t===` `?ye(e):e+1,e.beginColumn);return Ee(e.beginLine,n,e.image[t],e.image.slice(0,t))}},Oe=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],ke=/* @__PURE__ */ new Set([...Oe,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),Ae=[`TYPE`,`TYPE_CONSTRAINT`],je=/* @__PURE__ */ new Set([...Oe,...Ae]),Me=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],Ne=e=>{let t=0,n=0;do{if(t>=e.length)return;let r=e.slice(t,t+2),i=r===`(*`?1:r===`*)`?-1:0;n+=i,t+=i===0?1:2}while(n>0);return t},Pe=e=>{let t=[],n=0,r=1,i=0,a=(n,a)=>{t.push({kind:`Error`,text:Ee(r,n-i+1,e[n],a),line:r})},o=e=>{t.push({kind:`Error`,text:Ee(r+1,0,void 0,e),line:r})},s=e=>{let t=e.split(`
9
+ const e=require("./worker.cjs");let t=require("node:zlib");const n=/* @__PURE__ */ new Set(/* @__PURE__ */ `ACTION.ACTIONS.ASSUME.ASSUMPTION.AXIOM.BY.CASE.CHOOSE.CONSTANT.CONSTANTS.COROLLARY.DEF.DEFINE.DEFS.DOMAIN.ELSE.ENABLED.EXCEPT.EXTENDS.HAVE.HIDE.IF.IN.INSTANCE.LAMBDA.LEMMA.LET.LOCAL.MODULE.NEW.OBVIOUS.OMITTED.ONLY.OTHER.PICK.PROOF.PROPOSITION.PROVE.QED.RECURSIVE.STATE.SUBSET.SUFFICES.TAKE.TEMPORAL.TEMPORALS.THEN.THEOREM.UNCHANGED.UNION.USE.VARIABLE.VARIABLES.WITH.WITNESS`.split(`.`)),r=/* @__PURE__ */ new Map([[`in`,`\\in`],[`notin`,`\\notin`],[`subseteq`,`\\subseteq`],[`subset`,`\\subset`],[`supseteq`,`\\supseteq`],[`supset`,`\\supset`],[`cup`,`\\cup`],[`union`,`\\cup`],[`cap`,`\\cap`],[`intersect`,`\\cap`],[`X`,`\\X`],[`times`,`\\X`],[`o`,`\\o`],[`circ`,`\\o`],[`div`,`\\div`],[`land`,`/\\`],[`lor`,`\\/`],[`lnot`,`~`],[`neg`,`~`],[`equiv`,`<=>`],[`leq`,`<=`],[`geq`,`>=`],[`A`,`\\A`],[`forall`,`\\A`],[`E`,`\\E`],[`exists`,`\\E`],[`AA`,`\\AA`],[`EE`,`\\EE`],[`cdot`,`\\cdot`],[`sqsubseteq`,`\\sqsubseteq`],[`sqsupseteq`,`\\sqsupseteq`],[`sqsubset`,`\\sqsubset`],[`sqsupset`,`\\sqsupset`],[`sqcap`,`\\sqcap`],[`sqcup`,`\\sqcup`],[`oplus`,`\\oplus`],[`ominus`,`\\ominus`],[`otimes`,`\\otimes`],[`oslash`,`\\oslash`],[`odot`,`\\odot`],[`uplus`,`\\uplus`],[`prec`,`\\prec`],[`preceq`,`\\preceq`],[`succ`,`\\succ`],[`succeq`,`\\succeq`],[`sim`,`\\sim`],[`simeq`,`\\simeq`],[`approx`,`\\approx`],[`cong`,`\\cong`],[`asymp`,`\\asymp`],[`doteq`,`\\doteq`],[`propto`,`\\propto`],[`wr`,`\\wr`],[`star`,`\\star`],[`bullet`,`\\bullet`],[`bigcirc`,`\\bigcirc`],[`ll`,`\\ll`],[`gg`,`\\gg`]]),i=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),a=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),o=/* @__PURE__ */ new Map([[`∃`,`\\E`],[`∀`,`\\A`],[`∷`,`::`],[`≜`,`==`],[`⟨`,`<<`],[`⟩_`,`>>_`],[`⟩`,`>>`],[`→`,`->`],[`←`,`<-`],[`↦`,`|->`],[`⁺`,`^+`],[`¬`,`~`],[`□`,`[]`],[`◇`,`<>`],[`∧`,`/\\`],[`∨`,`\\/`],[`∈`,`\\in`],[`≈`,`\\approx`],[`≔`,`:=`],[`≍`,`\\asymp`],[`◯`,`\\bigcirc`],[`⩴`,`::=`],[`●`,`\\bullet`],[`∩`,`\\cap`],[`⋅`,`\\cdot`],[`∘`,`\\o`],[`≅`,`\\cong`],[`∪`,`\\cup`],[`÷`,`\\div`],[`≐`,`\\doteq`],[`‥`,`..`],[`…`,`...`],[`≡`,`<=>`],[`‼`,`!!`],[`≥`,`>=`],[`≫`,`\\gg`],[`⇔`,`<=>`],[`⇒`,`=>`],[`⫤`,`=|`],[`↝`,`~>`],[`≤`,`<=`],[`≪`,`\\ll`],[`⊣`,`-|`],[`≠`,`#`],[`∉`,`\\notin`],[`⊙`,`\\odot`],[`⊖`,`\\ominus`],[`⊕`,`\\oplus`],[`⊘`,`\\oslash`],[`⊗`,`\\otimes`],[`⇸`,`-+->`],[`≺`,`\\prec`],[`⪯`,`\\preceq`],[`∝`,`\\propto`],[`⁇`,`??`],[`⊨`,`|=`],[`⊢`,`|-`],[`∼`,`\\sim`],[`≃`,`\\simeq`],[`⊓`,`\\sqcap`],[`⊔`,`\\sqcup`],[`⊏`,`\\sqsubset`],[`⊑`,`\\sqsubseteq`],[`⊐`,`\\sqsupset`],[`⊒`,`\\sqsupseteq`],[`⋆`,`\\star`],[`⊂`,`\\subset`],[`⊆`,`\\subseteq`],[`≻`,`\\succ`],[`⪰`,`\\succeq`],[`⊃`,`\\supset`],[`⊇`,`\\supseteq`],[`×`,`\\X`],[`⊎`,`\\uplus`],[`‖`,`||`],[`≀`,`\\wr`]]),s=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),c=e=>e.startsWith(`\\`)?parseInt(e.slice(2),s.get(e[1].toLowerCase())):Number(e),l=/-{4,} *MODULE\b/,u=/* @__PURE__ */ new Uint8Array(128);(/* @__PURE__ */ new Map([[`0123456789`,33],[`abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ`,2],[`_`,4],[`01`,8],[`01234567`,16],[`abcdefABCDEF`,32]])).forEach((e,t)=>{for(let n of t)u[n.charCodeAt(0)]|=e});const d=(e,t)=>e<128&&(u[e]&t)!==0,f=(e,t,n)=>{let r=t;for(;d(e.charCodeAt(r),n);)r++;return r},p=/* @__PURE__ */ new Map;a.forEach(e=>{let t=e.charCodeAt(0),n=p.get(t)??[];n.push(e),p.set(t,n)});const m=(e,t)=>{let n=p.get(e.charCodeAt(t));if(n!==void 0){for(let r=0;r<n.length;r++)if(e.startsWith(n[r],t))return n[r]}},h=(e,t)=>{if(e.charCodeAt(t)<128)return;let n=e.slice(t,t+2);if(o.has(n))return n;let r=e[t];return o.has(r)?r:void 0},g=(e,t)=>{let n=e.charCodeAt(t);if(n===92&&d(e.charCodeAt(t+1),2)){let n=e.slice(t+1,f(e,t+1,2)),i={value:n.length};for(;i.value>0&&!r.has(n.slice(0,i.value));)i.value--;let a=r.get(n.slice(0,i.value));return{text:a??`\\`,length:a===void 0?1:i.value+1}}let a=h(e,t);if(a!==void 0)return{text:o.get(a)??``,length:a.length};let s=m(e,t);return s?{text:i.get(s)??s,length:s.length}:n===92?{text:`\\`,length:1}:void 0},ee=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),_=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>o.has(e)||ee.has(e));return n===void 0?void 0:{text:n,length:n.length}},v=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},te=(e,t,n)=>{let r=e[t+1]===`+`||e[t+1]===`*`,i=r?t+2:f(e,t+1,1);if(i===t+1||e[i]!==`>`)return 0;let a=!r||!n,o=a?f(e,i+1,7):i+1,s=a&&o===i+1&&(e[o]===`*`||e[o]===`-`);return v(e,s?o+1:o,e=>e===`.`)-t},ne=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,y={n:`
10
+ `,t:` `,r:`\r`,f:`\f`},re=(e,t)=>t===9?e+8-e%8:e+1,ie=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),ae=(e,t)=>{if(e.charCodeAt(t)!==92)return 0;let n=ie.get(e.charAt(t+1).toLowerCase());if(n===void 0)return 0;let r=f(e,t+2,n);return r===t+2?0:r-t},oe=(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={index:i.index,line:s.length,lineStart:i.index-s[s.length-1].length,moduleDepth:0},u={lineStart:-1,position:0,width:0},p=()=>{for((u.lineStart!==c.lineStart||u.position>c.index)&&(u.lineStart=c.lineStart,u.position=c.lineStart,u.width=0);u.position<c.index;u.position++)u.width=re(u.width,t.charCodeAt(u.position));return re(u.width,t.charCodeAt(c.index))},m=(e,t,n,r)=>{let i=p();a.push({kind:e,text:t,spelling:r,line:c.line,column:i,endColumn:i+n-1}),c.index+=n},h=e=>{for(let n=0;n<e;n++)t.charCodeAt(c.index)===10&&(c.line++,c.lineStart=c.index+1),c.index++},_=n=>new e.F(`${n} at line ${c.line}, column ${p()}`,void 0,{reason:n,line:c.line,column:p(),isEnd:c.index>=t.length});for(;c.index<t.length;){let e=t.charCodeAt(c.index);if(e===10||e===32||e===9||e===13){h(1);continue}if(e===92&&t.charCodeAt(c.index+1)===42){h(v(t,c.index,e=>e!==`
12
+ `&&e!==`\r`)-c.index);continue}if(e===40&&t.charCodeAt(c.index+1)===42){let e={value:0};do{if(c.index>=t.length)throw _(`Unterminated comment`);t.startsWith(`(*`,c.index)?(e.value++,h(2)):t.startsWith(`*)`,c.index)?(e.value--,h(2)):h(1)}while(e.value>0);continue}if(e===45&&t.startsWith(`----`,c.index)){let e=v(t,c.index,e=>e===`-`)-c.index,n=v(t,c.index+e,e=>e===` `);t.startsWith(`MODULE`,n)&&c.moduleDepth++,m(`Separator`,`----`,e);continue}if(e===61&&t.startsWith(`====`,c.index)){if(m(`ModuleEnd`,`====`,v(t,c.index,e=>e===`=`)-c.index),c.moduleDepth--,c.moduleDepth<=0)break;continue}if(e===34){let e=c.line,n=p(),r=[];for(h(1);t.charCodeAt(c.index)!==34;){let e=t.charCodeAt(c.index);if(c.index>=t.length||e===10||e===13)throw _(`Unterminated string`);if(e===92){let e=t[c.index+1];if(e===void 0||!`ntrf\\"`.includes(e))throw _(`Invalid escape in string`);r.push(y[e]??e),h(2)}else r.push(t[c.index]),h(1)}h(1),a.push({kind:`String`,text:r.join(``),line:e,column:n,endColumn:p()-1});continue}let i=ae(t,c.index);if(i>0){m(`Number`,t.slice(c.index,c.index+i),i);continue}if(d(e,7)){let r=f(t,c.index,7),i=t.slice(c.index,r),a=f(t,c.index,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.index,e):i;m(n?`Decimal`:`Number`,a,a.length);continue}if(!/[A-Za-z]/.test(i)){let n=e===95?`_`:t.slice(c.index,a);m(n===`_`?`Operator`:`Number`,n,n.length);continue}if(i.startsWith(`WF_`)||i.startsWith(`SF_`)){m(`Keyword`,i.slice(0,3),3);continue}let s=o.get(i)??i;o.set(s,s),m(n.has(i)?`Keyword`:`Identifier`,s,i.length);continue}let s=t[c.index];if(e>=128&&ee.has(s)){m(`Identifier`,o.get(s)??s,1),o.set(s,s);continue}if(e===60){let e=te(t,c.index,r);if(e>0){m(`Step`,t.slice(c.index,c.index+e),e);continue}}let l=g(t,c.index);if(l){let e=t.slice(c.index,c.index+l.length);m(`Operator`,l.text,l.length,e===l.text?void 0:e)}else throw _(`Unexpected character ${JSON.stringify(s)}`)}let ne=p();return a.push({kind:`End`,text:``,line:c.line,column:ne,endColumn:ne}),a},se=[[`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`]],ce=se.map(e=>e[0]),le=new Map(ce.map((e,t)=>[e,t]).reverse()),b=t=>{let n=le.get(t);if(n===void 0)throw new e.y(`Unknown SANY token kind ${t}`);return n},ue=new Map(se.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),de=Math.max(...[...ue.keys()].map(e=>e.length)),fe=Array.from({length:de},(e,t)=>de-t),x=/----+ *MODULE/y,S=[/_\w*[A-Za-z]\w*/y,/[0-9]\w*[A-Za-z]\w*/y,/[WS](?:[a-zA-EG-Z_0-9]\w*)?/y,/[WS]F(?:[A-Za-z0-9]\w*)?/y,/[a-zA-RT-VX-Z]\w*/y,/@|ℕ|ℤ|ℝ/y],C=e=>[/[0-9][A-Za-z0-9]*/,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*/,/[a-zA-RT-VX-Z][A-Za-z0-9]*/].map(t=>RegExp(`${t.source}${e}`,`y`)),w=C(String.raw`\.\/\\`),pe=C(String.raw`\.\\\/`),me=String.raw`<(?:[0-9]+|\+|\*)>`,he=[[`_BM0`,[x]],[`SEPARATOR`,[/----+/y]],[`END_MODULE`,[/====+/y]],[`NUMBER_LITERAL`,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[`STRING_LITERAL`,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[`BAND`,w],[`BOR`,pe],[`IDENTIFIER`,S],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${me}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(me,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${me}(?:\*\.*|-\.*|\.+)`,`y`)]]],ge=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[x]]],_e=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[x]],[`BAND`,w],[`BOR`,pe],[`IDENTIFIER`,S]],ve=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),T=(e,t,n)=>e.map(([e,r])=>({kind:b(e),length:Math.max(...r.map(e=>ve(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),E=(e,t)=>{let n=fe.find(n=>ue.has(e.slice(t,t+n))),r=T(he,e,t);if(n===void 0)return r;let i={kind:ue.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},ye=e=>e+8-e%8,be=e=>{let t=[],n=[],r={line:1,column:0,isAfterCr:!1,isAfterLf:!1};for(let i of e)for(let e=0;e<i.length;e++)r.column++,r.isAfterLf?(r.isAfterLf=!1,r.line++,r.column=1):r.isAfterCr&&(r.isAfterCr=!1,i===`
13
+ `?r.isAfterLf=!0:(r.line++,r.column=1)),i===`\r`?r.isAfterCr=!0:i===`
14
+ `?r.isAfterLf=!0:i===` `&&(r.column=ye(r.column-1)),t.push(r.line),n.push(r.column);return{lines:t,columns:n}},xe=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,Se=new Set([...ue.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),Ce=(e,t)=>{let n=0;for(;Se.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,ve(xe,e,t)))},we=e=>{let t=be(e),n={offset:0,mode:`DEFAULT`},r=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),i=()=>r(b(`EOF`),e.length-1,0),a=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?De(o,s,e[a],i):t.lines[n]===o?e[a]===`
15
+ `||e[a]===`\r`?De(o+1,0,void 0,i):De(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},o=()=>{let t=n.offset;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return a(t,e.length,``);n.offset+=r+1;return}let r=0,i=t,o=t;for(;o<e.length;)if(e.startsWith(`(*`,o))r++,o+=2,r>1&&(i=o);else if(e.startsWith(`*)`,o)){if(r--,o+=2,i=o,r===0){n.offset=o;return}}else o++;return n.offset=o,i===e.length?void 0:a(i,o,``)},s=t=>{for(;n.offset<e.length;){let i=T(t,e,n.offset);if(i.length>0){let e=r(i.kind,n.offset,i.length);return n.offset+=i.length,ce[i.kind].startsWith(`_BM`)&&(n.mode=`SPEC`),ce[i.kind]===`BEGIN_PRAGMA`&&(n.mode=`PRAGMA`),e}n.offset++}return i()};return()=>{if(n.mode===`DEFAULT`)return s(ge);if(n.mode===`PRAGMA`)return s(_e);for(;n.offset<e.length;){let t=n.offset;if(`
16
+ \r`.includes(e[t]))n.offset++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=o();if(e!==void 0)return e}else{let i=E(e,t);if(i.length===0){let n=Ce(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),o=r<e.length?n:i.length>1?i:``;return a(t,r,o)}let o=r(i.kind,t,i.length);return n.offset+=i.length,o}}return i()}},Te=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
17
+ `,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),Ee=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>Te.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),De=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${Ee(n)}" (${n.charCodeAt(0)}), `}after : "${Ee(r)}"`,Oe=e=>{let t=we(e);for(let e=t();typeof e!=`string`&&e.kind!==b(`EOF`);e=t()){let t=e.image.split(``).findIndex(e=>{let t=e.charCodeAt(0);return t>255&&(t&255)<128});if(t===-1)continue;let n=e.image.slice(1,t+1).split(``).reduce((e,t)=>t===` `?ye(e):e+1,e.beginColumn);return De(e.beginLine,n,e.image[t],e.image.slice(0,t))}},ke=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],Ae=/* @__PURE__ */ new Set([...ke,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),je=[`TYPE`,`TYPE_CONSTRAINT`],Me=/* @__PURE__ */ new Set([...ke,...je]),Ne=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],Pe=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},Fe=e=>{let t=[],n=0,r=1,i=0,a=(n,a)=>{t.push({kind:`Error`,text:De(r,n-i+1,e[n],a),line:r})},o=e=>{t.push({kind:`Error`,text:De(r+1,0,void 0,e),line:r})},s=e=>{let t=e.split(`
18
18
  `);t.length>1&&(r+=t.length-1,i=n+e.length-t[t.length-1].length),n+=e.length};for(;n<e.length;){let i=e.slice(n),c=/^\s+/.exec(i)?.[0];if(c){s(c);continue}if(i.startsWith(`\\*`)){let e=i.indexOf(`
19
- `);s(e===-1?i:i.slice(0,e));continue}if(i.startsWith(`(*`)){let e=Ne(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=ie(e,n),d=u>0?i.slice(0,u):/^\d+(?![A-Za-z_])/.exec(i)?.[0];if(d){t.push({kind:`Number`,text:d,line:l}),s(d);continue}let f=/^[A-Za-z0-9_]+/.exec(i)?.[0];if(f){t.push({kind:`Word`,text:f,line:l}),s(f);continue}if(i.startsWith(`"`)){let r=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(i),c=r?.[0]??`"`;if(r?.[2]!==`"`)return s(c),n===e.length?o(`${c}\n`):a(n,c),t;t.push({kind:`String`,text:c,line:l}),s(c);continue}let p=ee(e,n)??g(e,n),m=Me.find(e=>i.startsWith(e));if(m&&m.length>=(p?.length??0))t.push({kind:`Symbol`,text:m,line:l}),s(m);else{if(!p)return a(n,``),t;t.push({kind:`Word`,text:p.text,line:l}),s(e.slice(n,n+p.length))}}return t.push({kind:`End`,text:``,line:r}),t},Fe=(t,n)=>new e._(`TLC found an error in the configuration file at line ${t}\n${n}`),Ie=(e,t)=>Fe(e,`The keyword ${t} appeared twice.`),Le=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),Re=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),ze=(t,n=`master`)=>{let r=n===`1.7.4`?je:ke,i=Pe(t),a=0,o={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],rawConstants:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},s=!1,c=/* @__PURE__ */ new Set,l=()=>{let t=i[Math.min(a++,i.length-1)];if(t.kind===`Error`)throw new e._(`TLC found an error in the configuration file:\n${t.text}`);return t},u=t=>{if(t.kind===`Number`&&t.text.startsWith(`\\`))throw e.it(new e._(`${e.$(`java.lang.NumberFormatException`)}For input string: "${t.text}"`),e.tt.error);if(t.kind===`Number`)return{kind:`Number`,value:Number(t.text)};if(t.kind===`String`&&t.text.includes(`\\`))throw new e._(`TLC found an error in the configuration file:\nescape sequences are not supported in strings at line ${t.line}`);if(t.kind===`String`)return{kind:`String`,value:t.text.slice(1,-1)};if(t.text===`TRUE`||t.text===`FALSE`)return{kind:`Boolean`,value:t.text===`TRUE`};if(t.text===`{`){let e=[],t=l();if(t.text!==`}`)for(;e.push(u(t)),t=l(),t.text===`,`;)t=l();if(t.text!==`}`)throw Fe(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(t.kind!==`End`)return{kind:`ModelValue`,name:t.text};throw Fe(t.line,`It was expecting a value, but did not find it.`)},d=e=>{let t=l();if(t.kind===`End`)throw Fe(t.line,`Expected an identifier after ${e}[.`);let n=l();if(n.text!==`]`)throw Fe(n.line,`It was expecting ], but did not find it.`);return t.text},f=(e,t)=>{let n=e.text,r=l();for(;r.text===`!`;)n=`${n}!${l().text}`,r=l();if(r.text===`<-`){if(r=l(),r.text===`[`){let e=d(`<-`),t=l();if(t.kind===`End`)throw Fe(t.line,`Expected an identifier after <-[mod].`);o.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw Fe(r.line,`Expected an identifier after <-.`);o.substitutions.push({name:n,target:r.text});return}let i=[],a=r.text===`(`;if(a){for(;i.push(u(l())),r=l(),r.text===`,`;);if(r.text!==`)`)throw Fe(t,``);r=l()}if(r.text!==`=`)throw Fe(r.line,`It was expecting = or <-, but did not find it.`);r=l();let s=r.text===`[`?d(`=`):void 0,c=u(s===void 0?r:l());o.constants.push({name:n,value:c,...a&&{args:i},...s!==void 0&&{module:s}})},p=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;let n=a-1;f(t,e),o.rawConstants.push(i.slice(n,a).map(e=>e.text).join(` `))}},m=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;e.push(t.text)}},h=l();for(;h.kind!==`End`;){let e=h.text,t=h.line,n=r.has(e)?Le.get(e):void 0,i=r.has(e)?Re.get(e):void 0,a=()=>{let n=l();if(n.kind===`End`)throw Fe(t,`The keyword ${e} was not followed by an identifier.`);return n};if(n!==void 0){let r=a();if(o[n]!==void 0)throw Ie(t,e);o[n]=r.text,h=l()}else if(i!==void 0)h=m(o[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)h=p(t);else if(e===`CHECK_DEADLOCK`){let n=a();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw Fe(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(s)throw Ie(t,e);s=!0,o.checkDeadlock=n.text===`TRUE`,h=l()}else{if(!r.has(e)||!Ae.includes(e))throw Fe(t,`It was expecting a keyword, but did not find it.`);if(a(),c.has(e))throw Ie(t,e);c.add(e),h=l()}}return o},Be=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},O=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,k={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},Ve=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},He=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Ue=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),We=e=>{let t=t=>{let n=te(e,t,Ve);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l=t(i);for(;l!==void 0&&e[l]!==a;){let n=o(l);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l=t(i)}if(l!==void 0)return c.last=l,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=te(e,t,He);if(e.startsWith(`..`,n)&&He(e[n+2]))return{kind:`Constant`,first:t,last:te(e,n+2,He)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=He(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:te(e,t+1,He)-1,children:[]};if(Ue(n))return{kind:`Constant`,first:t,last:te(e,t,Ue)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},A=e=>{let t=e.length===0?void 0:We(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=k[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},Ge={general:1e3,stackOverflow:1005,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,unchangedVariableChanged:2143,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,initialStateIncomplete:2106,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,noInitialStates:2118,errorState:2120,behaviorUpToThisPoint:2121,backToState:2122,subscriptUndetermined:2139,subscriptMissingVariable:2140,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,simulating:2188,finished:2186,traceSpecWritten:2501,traceSpecFailed:2502,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,coverageStart:2201,coverageEnd:2202,coverageValue:2221,depthFirstStats:2204,depthFirstLevel:2205,depthFirstProgress:2206,depthFirstInitGenerated:2208,simulationProgress:2209,simulationStats:2210,temporalBranches:2212,statePrint1:2216,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,noInitialStatesInModel:2256,version:2262,depthFirstModelChecking:2271,noSpecificationButProperty:2257,fairnessTautology:2258,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,coverageNext:2772,coverageInit:2773,coverageProperty:2774,coverageValueCost:2775,coverageEndOverhead:2777,coverageConstraint:2778,coverageVariable:2779,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001,moduleOverrideStdout:2e4},Ke={none:0,error:1,warning:3,state:4},qe={0:``,1:`Error: `,3:`Warning: `,4:`State `},Je=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${qe[n]}${r}`,Ye=(t,n=!0,r=`master`,i=[],a=[])=>{let o=/* @__PURE__ */ new Set;return{isTool:t,version:r,print:(r,s,c)=>{let l=s===Ke.warning;if(l&&a.includes(r))throw new e.V(r,c);if(l&&!n||s!==Ke.error&&i.includes(r))return;let u=l&&!t&&o.size===0?`
20
- (Use the -nowarning option to disable this warning.)`:``,d=Je(t,r,s,`${c}${u}`);l&&o.has(d)||(l&&o.add(d),console.log(d))}}},Xe=`The configuration file did not specify the initial state predicate.
19
+ `);s(e===-1?i:i.slice(0,e));continue}if(i.startsWith(`(*`)){let e=Pe(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=ae(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=_(e,n)??g(e,n),m=Ne.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},Ie=(t,n)=>new e._(`TLC found an error in the configuration file at line ${t}\n${n}`),Le=(e,t)=>Ie(e,`The keyword ${t} appeared twice.`),Re=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),ze=/* @__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`]]),Be=(t,n=`master`)=>{let r=n===`1.7.4`?Me:Ae,i=Fe(t),a=0,o={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],rawConstants:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},s=!1,c=/* @__PURE__ */ new Set,l=()=>{let t=i[Math.min(a++,i.length-1)];if(t.kind===`Error`)throw new e._(`TLC found an error in the configuration file:\n${t.text}`);return t},u=t=>{if(t.kind===`Number`&&t.text.startsWith(`\\`))throw e.it(new e._(`${e.$(`java.lang.NumberFormatException`)}For input string: "${t.text}"`),e.tt.error);if(t.kind===`Number`)return{kind:`Number`,value:Number(t.text)};if(t.kind===`String`&&t.text.includes(`\\`))throw new e._(`TLC found an error in the configuration file:\nescape sequences are not supported in strings at line ${t.line}`);if(t.kind===`String`)return{kind:`String`,value:t.text.slice(1,-1)};if(t.text===`TRUE`||t.text===`FALSE`)return{kind:`Boolean`,value:t.text===`TRUE`};if(t.text===`{`){let e=[],t=l();if(t.text!==`}`)for(;e.push(u(t)),t=l(),t.text===`,`;)t=l();if(t.text!==`}`)throw Ie(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 Ie(t.line,`It was expecting a value, but did not find it.`)},d=e=>{let t=l();if(t.kind===`End`)throw Ie(t.line,`Expected an identifier after ${e}[.`);let n=l();if(n.text!==`]`)throw Ie(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 Ie(t.line,`Expected an identifier after <-[mod].`);o.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw Ie(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 Ie(t,``);r=l()}if(r.text!==`=`)throw Ie(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)?Re.get(e):void 0,i=r.has(e)?ze.get(e):void 0,a=()=>{let n=l();if(n.kind===`End`)throw Ie(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 Le(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 Ie(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(s)throw Le(t,e);s=!0,o.checkDeadlock=n.text===`TRUE`,h=l()}else{if(!r.has(e)||!je.includes(e))throw Ie(t,`It was expecting a keyword, but did not find it.`);if(a(),c.has(e))throw Le(t,e);c.add(e),h=l()}}return o},D=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},O=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,Ve={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},He=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},Ue=e=>e!==void 0&&/^\p{Nd}$/u.test(e),We=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),Ge=e=>{let t=t=>{let n=v(e,t,He);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=v(e,t,Ue);if(e.startsWith(`..`,n)&&Ue(e[n+2]))return{kind:`Constant`,first:t,last:v(e,n+2,Ue)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=Ue(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:v(e,t+1,Ue)-1,children:[]};if(We(n))return{kind:`Constant`,first:t,last:v(e,t,We)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},k=e=>{let t=e.length===0?void 0:Ge(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=Ve[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},Ke={general:1e3,stackOverflow:1005,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,unchangedVariableChanged:2143,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,initialStateIncomplete:2106,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,noInitialStates:2118,errorState:2120,behaviorUpToThisPoint:2121,backToState:2122,subscriptUndetermined:2139,subscriptMissingVariable:2140,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,simulating:2188,finished:2186,traceSpecWritten:2501,traceSpecFailed:2502,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,coverageStart:2201,coverageEnd:2202,coverageValue:2221,depthFirstStats:2204,depthFirstLevel:2205,depthFirstProgress:2206,depthFirstInitGenerated:2208,simulationProgress:2209,simulationStats:2210,temporalBranches:2212,statePrint1:2216,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,noInitialStatesInModel:2256,version:2262,depthFirstModelChecking:2271,noSpecificationButProperty:2257,fairnessTautology:2258,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,coverageNext:2772,coverageInit:2773,coverageProperty:2774,coverageValueCost:2775,coverageEndOverhead:2777,coverageConstraint:2778,coverageVariable:2779,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001,moduleOverrideStdout:2e4},qe={none:0,error:1,warning:3,state:4},Je={0:``,1:`Error: `,3:`Warning: `,4:`State `},Ye=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${Je[n]}${r}`,Xe=(t,n=!0,r=`master`,i=[],a=[])=>{let o=/* @__PURE__ */ new Set;return{isTool:t,version:r,print:(r,s,c)=>{let l=s===qe.warning;if(l&&a.includes(r))throw new e.V(r,c);if(l&&!n||s!==qe.error&&i.includes(r))return;let u=l&&!t&&o.size===0?`
20
+ (Use the -nowarning option to disable this warning.)`:``,d=Ye(t,r,s,`${c}${u}`);l&&o.has(d)||(l&&o.add(d),console.log(d))}}},Ze=`The configuration file did not specify the initial state predicate.
21
21
  Can also be caused by trying to run TLC on a specification from
22
- a module imported with a parameterized INSTANCE statement.`,Ze=[[1005,e.u,!1],[1e3,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable%1% %2% undefined).`,!1],[1e3,`Could not find operator: %1% in module: %2%`,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
22
+ a module imported with a parameterized INSTANCE statement.`,Qe=[[1005,e.u,!1],[1e3,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable%1% %2% undefined).`,!1],[1e3,`Could not find operator: %1% in module: %2%`,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
23
23
  %1%`,!0],[2143,`The variable %1% was changed while it is specified as UNCHANGED at
24
24
  %2%`,!1],[2144,`The EXCEPT was applied to non-existing fields of the value at
25
25
  %1%`,!1],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
@@ -44,7 +44,7 @@ element is not a bag:
44
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
45
  on the right-hand side of a <- after already appearing on the
46
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,Xe,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2236,`The operator %1%, which equals %2%,
47
+ is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,Ze,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2236,`The operator %1%, which equals %2%,
48
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
49
  %1%`,!1],[2240,`The specification contains more than one conjunct of the form [][Next]_v,
50
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.
@@ -64,27 +64,27 @@ The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configurat
64
64
  Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
65
65
  It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
66
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 Qe;const $e=()=>Qe??=Ze.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),et=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+: ))|\nis an element of a set of \d+-tuples\.$|^In computing ENABLED, TLC encountered a temporal formula \(a (~> b|-\+-> formula)\)\./,tt=e=>et.test(e)?void 0:$e().find(t=>t.pattern.test(e))?.message,nt=t=>t instanceof e.O||tt(t.message)?.isEvalException===!0,rt=/* @__PURE__ */ new Map([[1e3,`
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]],$e={value:void 0},et=()=>$e.value??=Qe.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),tt=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+: ))|\nis an element of a set of \d+-tuples\.$|^In computing ENABLED, TLC encountered a temporal formula \(a (~> b|-\+-> formula)\)\./,nt=e=>tt.test(e)?void 0:et().find(t=>t.pattern.test(e))?.message,rt=t=>t instanceof e.O||nt(t.message)?.isEvalException===!0,it=/* @__PURE__ */ new Map([[1e3,`
68
68
  : `],[2105,`failed.
69
69
  `],[2154,`but it produced the following error:
70
70
  `],[2171,`Parsing or semantic analysis failed.`],[2213,`:
71
71
  `],[2281,` - specifically: `],[2405,`failed.
72
- `]]),it=(e,t,n)=>{let r=n?rt.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${at(t.slice(a),n)}`},at=(e,t)=>{let n=t?tt(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Ke.none} @!@!@\n${it(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},ot=e=>String(e).padStart(2,`0`),st=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${ot(r%24)}h`:e>36e5?`${ot(r%24)}h ${ot(n)}min`:e>6e4?`${ot(n)}min ${ot(t)}s`:`${ot(t)}s`},ct=e=>`${e.getFullYear()}-${ot(e.getMonth()+1)}-${ot(e.getDate())} ${ot(e.getHours())}:${ot(e.getMinutes())}:${ot(e.getSeconds())}`,lt=/* @__PURE__ */ new WeakMap,ut=(t,n,r)=>{if(!(t instanceof e.b))return t;let i=e.it(new e.b(`${r}\n${t.message}`,t),e.Q(t));return lt.set(i,{code:n,headline:r,inner:t}),i},dt=e=>lt.has(e),ft=e.$(`util.WrongInvocationException`),pt=e.G.slice(0,e.G.indexOf(`
73
- `)),mt=`${e.G}tlc2.tool.EvalException: `,ht=`${e.G}util.Assert$TLCRuntimeException: `,gt=e=>nt(e)?mt:ht,_t=t=>{try{return t()}catch(t){throw t instanceof e.b?nt(t)?new e.b(`${e.W}${t.message}`):tt(t.message)?t:new e.b(`${e.G}${t.message}`):t}},vt=[mt,ht,e.G,e.W],yt=(t,n)=>{let r=lt.get(t);if(r)return`${r.headline}\n${yt(r.inner,n)}`;let i=t.message;if(t instanceof e.z)return i;let a=vt.find(e=>i.startsWith(e))??``;return`${a}${at(i.slice(a.length),n)}`},bt=(t,n)=>{let r=lt.get(t),i=t.message;if(r)return{code:r.code,message:i,toolMessage:yt(t,!0)};if(t instanceof e.P)return{code:n?Ge.stackOverflow:Ge.general,message:i,toolMessage:i};if(n&&nt(t))return{code:tt(i)?.code??Ge.general,message:i,toolMessage:i};let a=n&&!i.startsWith(pt)&&!(t instanceof e.z),o=t instanceof e.N?ft:e.G,s=a?o:``;return{code:Ge.general,message:`${s}${i}`,toolMessage:`${s}${yt(t,!0)}`}},xt=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,St=1e6;let Ct=St;const wt=()=>Ct,Tt=()=>Math.max(Ct,10),Et=()=>`Attempted to construct a set with too many elements (>${Ct}).`,Dt=(t,n)=>{if(t.length===Tt())throw new e.N(Et());t.push(n)},Ot=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=Tt(),kt=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},j=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,At=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),jt=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),M=e=>typeof e==`object`&&e.kind===`ModelValue`,Mt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),Nt=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:j(e)?`set`:`function`,Pt=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let Ft=!1;const It=(e,t)=>(Ft=!0,e.writtenKeys=t,e),Lt=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,Rt=e=>Lt(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),zt=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):Rt(e),Bt=(e,t,n)=>It(Ir(e,t),n),Vt=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(Vt);e.writtenKeys=void 0,e.range.forEach(Vt)}},Ht=e=>e.every(e=>typeof e==`string`),Ut=(e,t)=>e.length>0&&t.length>0&&Ht(e)!==Ht(t),Wt=(e,t)=>{Ft&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Ut(n,r)?tr(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=gn(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:gn(t,n);if(r!==0)return r}return 0},Gt=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=gn(n[e],r[e]);if(t!==0)return t}return 0},Kt=e=>M(e)?e.type:void 0,qt=(t,n,r)=>{let i=Kt(t),a=Kt(n);if(i===void 0&&a===void 0)return;let o=r?`check equality of`:`compare`;if(M(t)&&M(n)){if(i===void 0||a===void 0||i===a)return;throw new e.b(`Attempted to ${o} the differently-typed model values ${L(t)} and ${L(n)}`)}throw i===void 0?new e.b(`Attempted to ${o} the typed model value ${L(n)} and the non-model value\n${L(t)}`):new e.b(`Attempted to ${o}${r?``:` the`} typed model value ${L(t)} and non-model value\n${L(n)}`)},Jt={ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0},Yt=e=>{Jt.ranks=Object.create(null),Jt.size=0,Jt.searchRank=void 0,Jt.unorderedString=void 0,_n.clear();for(let t of e)on(t)},Xt=()=>{Jt.searchRank=Jt.size},Zt=()=>Jt.unorderedString;let Qt=!1;const $t={isExpanded:!0,isViewPrinted:!1},en=e=>{Qt=e.version===`1.7.4`,Ct=e.maxSetSize??St,$t.isExpanded=e.isLazyValueExpanded??!0,$t.isViewPrinted=e.isViewPrinted??!1},tn=/* @__PURE__ */ new WeakMap,nn=(e,t)=>($t.isViewPrinted&&tn.set(e,t),e),rn=/* @__PURE__ */ new WeakMap,an=(e,t)=>(rn.set(e,t),e),on=e=>(Jt.ranks[e]===void 0&&(Jt.ranks[e]=Jt.size++),e),sn=e=>Jt.ranks[on(e)],cn=(e,t)=>{if(e===t)return 0;let n=Jt.ranks,r=n[e],i=n[t],a=Jt.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(Jt.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},ln=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),un=(e,t)=>(ln(e)||ln(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),dn=(t,n)=>new e.b(ln(t)?`Attempted to compare overridden value ${L(t,!0)} with non-overridden value:\n${L(n)}`:`Attempted to compare ${Nt(t)} ${L(t)} with ${Nt(n)} ${L(n)}`),fn=(t,n,r)=>{if(!ln(t))throw new e.b(`Attempted to ${r} the set ${L(N(t)?P(t):t,!0)} with the value:\n${L(n,!0)}`);if(!ln(n))throw dn(t,n);let i=t.kind===`InfiniteSet`?t.name:void 0,a=n.kind===`InfiniteSet`?n.name:void 0;if(i!==void 0&&i===a)return 0;if(i===`Nat`&&a===`Int`||i===`Int`&&a===`Nat`)return i===`Nat`?-1:1;throw new e.O(`Attempted to compare ${L(t,!0)} with the value\n${L(n,!0)}`)},pn={kind:`InfiniteSet`,name:`Any`},mn=t=>{throw new e.O(`Attempted to compare ANY with the value\n${L(t)}`)},hn=e=>{Ft&&Vt(e),e===pn&&mn(e),typeof e==`object`&&e.kind===`LazyFunction`&&I(e)},gn=(e,t)=>{if(e===t)return hn(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Wt(e,t);if(n===`Set`&&r===`Set`)return Gt(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&qt(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return qt(e,t,!1),n===`ModelValue`?-1:1;if(e===pn||t===pn)return mn(e===pn?t:e);if(j(e)&&j(t)&&un(e,t))return fn(e,t,`compare`);let i=j(e);if(i!==j(t))throw dn(e,t);if(n===`Interval`&&r===`Set`){let n=ai(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-ai(t);if(n!==0)return n}return i?Gt(P(e),P(t)):Wt(I(e),I(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return cn(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(qt(e,t,!1),M(e))return-1;if(M(t))return 1;throw dn(e,t)},_n=/* @__PURE__ */ new Map,vn=32768,yn=t=>{let n=_n.get(t);if(n)return n;if(_n.size===vn)throw new e.x(`TLC supports at most ${vn} model values, but model value ${t} exceeds this limit.`);let r={kind:`ModelValue`,name:t,type:t.length>2&&t[1]===`_`?t[0]:void 0,rank:sn(t),hash:Ii(Li(Ri(t),109)),fingerprint:qi(Ji(t)^60)};return _n.set(t,r),r},bn=()=>[..._n.values()],xn=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),Sn=e=>{let t=xn(e);return t.isNormalized=!0,t},Cn=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let wn=!1;const Tn=(e,t)=>(t===`lambda`&&(wn=!0),t!==void 0&&(e.functionClass=t),e),En=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Dn=e=>Tn(e,`lambda`),On=e=>xt(e)&&e.isCached===!0;let kn=!1;const An=e=>(kn=!0,e),jn=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),Mn=e=>{kn&&typeof e==`object`&&xt(e)&&jn.has(e.kind)&&(e.isCached=!0)},Nn=e=>{(wn||kn)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(Nn),e.range.forEach(Nn)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Nn):j(e)&&N(e)&&(Mn(e),P(e).elements.forEach(Nn))))},Pn=(e,t)=>{if(Mn(e),e===t)return hn(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&qt(e,t,!0),gn(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return Wt(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Gt(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&ai(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==ai(t))return!1;if(M(e)||M(t))return e.kind===`LazyFunction`&&I(e),qt(e,t,!0),M(e)&&M(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Pn(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=F(e.domain),r=F(t.domain);if(n||r)return n===r;let i=F(e.range),a=F(t.range);return i||a?i===a:Pn(e.domain,t.domain)&&Pn(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(F(e))return F(t);if(F(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&Pn(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return F(e)?F(t):!F(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Pn(e,t.factors[n]));let n=j(e)&&j(t)&&!(N(e)&&N(t));if(n&&un(e,t))return fn(e,t,`check equality of`)===0;if(n){if(!ln(e)){let n=P(e);if(!ln(t))return Gt(n,P(t))===0}return $i(e)===$i(t)}return gn(e,t)===0},Fn=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):$i(n)===$i(r);return n},In=Fn(!1),Ln=Fn(!0),Rn=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},zn=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Ki(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Ln(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Ln(i[e],n))return i[e]}return n.kind===`Set`?Rn(n.elements,t):(Rn(n.domain,t),Rn(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},Bn=(e,t)=>t.length===0||En(e)===`tuple`?1:Ni(t)?.low,Vn=e=>{if(!jt(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:Bn(e,t.domain)}},Hn=e=>{if(!jt(e))return;let t=I(e);return Ht(t.domain)?t:void 0},Un=(e,t)=>(qt(t,e,!1),1),Wn=(e,t)=>(qt(t,e,!0),!1),Gn=(e,t)=>(e.type!==void 0&&qt(e,t,!1),M(t)?e.rank-t.rank:-1),Kn=(e,t)=>(e.type!==void 0&&qt(e,t,!0),M(t)&&e.name===t.name),qn={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},Jn=(e,t,n)=>{let r=qn[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${L(e)} with ${r.other}:\n${L(t)}`},Yn=(t,n,r)=>{let i=Vn(r);if(!i){if(M(r))return Un(r,n);throw new e.b(`Attempted to compare the function ${L(n)} with the value:\n${L(r)}`)}if(t.range.length!==i.range.length)return t.range.length-i.range.length;let a=()=>Xn(t.range,i.range);if(t.low!==void 0&&t.range.length===0)return 0;if(t.low!==void 0&&i.low!==void 0)return t.low===i.low?a():t.low-i.low;let o=t.low??i.low;if(o===void 0)return Xn(t.domain,i.domain)||a();let s=t.low===void 0?t.domain:i.domain;for(let n=0;n<s.length;n++){let r=s[n];if(typeof r!=`number`)throw new e.b(`Attempted to compare integer with non-integer${t.low===void 0?``:`:`}\n${L(r)}.`);let i=t.low===void 0?r-(o+n):o+n-r;if(i!==0)return i}return a()},Xn=(e,t)=>{for(let n=0;n<e.length;n++){let r=tr(e[n],t[n]);if(r!==0)return r}return 0},Zn=(t,n)=>{let r=I(t);if(En(t)===`tuple`){let e=jt(n)?ui(n):void 0;return e?r.range.length-e.length||Xn(r.range,e):Yn({...r,low:1},t,n)}if(En(t)===`record`){let i=Hn(n);if(!i){if(M(n))return Un(n,t);throw new e.b(`Attempted to compare record:\n${L(t)}\nwith non-record\n${L(n)}`)}return r.domain.length-i.domain.length||Xn(r.domain,i.domain)||Xn(r.range,i.range)}return Yn({...r,low:Bn(t,r.domain)},t,n)},Qn=(e,t)=>ln(e)||ln(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),$n=(e,t)=>{let n=Mt(t)?t:P(t);return{elements:P(e).elements,otherElements:P(n).elements}},er=(t,n)=>{if(Qn(t,n))return gn(t,n);if(!Mt(t))return er(P(t),n);if(!j(n)){if(M(n))return Un(n,t);throw new e.b(`Attempted to compare the set ${L(t)} with the value:\n${L(n)}`)}let r=$n(t,n);return r.elements.length-r.otherElements.length||Xn(r.elements,r.otherElements)},tr=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return gn(t,n);if(M(n))return Un(n,t);throw new e.b(Jn(t,n,!1))}return t.kind===`ModelValue`?Gn(t,n):jt(t)?Zn(t,n):er(t,n)},nr=(e,t)=>e.every((e,n)=>or(e,t[n])),rr=(t,n,r)=>{let i=Vn(r);if(!i){if(M(r))return Wn(r,n);throw new e.b(`Attempted to check equality of the function ${L(n)} with the value:\n${L(r)}`)}if(t.range.length!==i.range.length)return!1;if(t.low!==void 0&&i.low!==void 0)return(t.range.length===0||t.low===i.low)&&nr(t.range,i.range);let a=t.low??i.low;return a===void 0?nr(t.domain,i.domain)&&nr(t.range,i.range):(t.low===void 0?t.domain:i.domain).every((t,n)=>{if(typeof t!=`number`)throw new e.b(`Attempted to compare an integer with non-integer:\n${L(t)}.`);return t===a+n})&&nr(t.range,i.range)},ir=(t,n)=>{let r=I(t);if(En(t)===`tuple`){let e=jt(n)?ui(n):void 0;return e?r.range.length===e.length&&nr(r.range,e):rr({...r,low:1},t,n)}if(En(t)===`record`){let i=Hn(n);if(!i){if(M(n))return Wn(n,t);throw new e.b(`Attempted to check equality of record:\n${L(t)}\nwith non-record\n${L(n)}`)}return r.domain.length===i.domain.length&&nr(r.domain,i.domain)&&nr(r.range,i.range)}return rr({...r,low:Bn(t,r.domain)},t,n)},ar=(t,n)=>{if(Qn(t,n))return Pn(t,n);if(!Mt(t))return ar(P(t),n);if(!j(n)){if(M(n))return Wn(n,t);throw new e.b(`Attempted to check equality of the set ${L(t)} with the value:\n${L(n)}`)}let r=$n(t,n);return r.elements.length===r.otherElements.length&&nr(r.elements,r.otherElements)},or=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return t===n;if(M(n))return Wn(n,t);throw new e.b(Jn(t,n,!0))}return t.kind===`ModelValue`?Kn(t,n):jt(t)?ir(t,n):ar(t,n)},sr=e=>{let t=[];for(let n of e){let e=lr(n,t);e.isFound||t.splice(e.index,0,n)}return t},cr=(e,t)=>{let n=fi.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},lr=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=cr(e,()=>tr(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},ur=(e,t)=>t.some(t=>cr(t,()=>or(t,e))),dr=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,fr=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(fr)),e.kind===`Function`&&(e.domain.forEach(fr),e.range.forEach(fr)))},pr=e=>{if(!(typeof e!=`object`||On(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:P(e);return;case`FilteredSet`:case`Subset`:return pr(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(pr(e.left),pr(e.right));case`FunctionSet`:return pr(e.domain),pr(e.range);case`RecordSet`:return e.sets.forEach(pr);case`ProductSet`:return e.factors.forEach(pr)}},mr=(e,t)=>pi(Pn,or,e,t),hr=e=>{for(let t=1;t<e.length;t++)if(gn(e[t-1],e[t])>=0)return!1;return!0},gr=e=>{for(let t=0;t<e.length;t++){let n=e[t],r=t>0?e[t-1]:void 0;if(typeof n!=`number`||typeof r==`number`&&r>=n)return!1}return!0},_r=e=>{for(let t=1;t<e.length;t++)Mn(e[t]);if(e.length<2||hr(e))return xn(e);let t=[...e].sort(gn),n=[t[0]];for(let e=1;e<t.length;e++)gn(n[n.length-1],t[e])!==0&&n.push(t[e]);return xn(n)},vr=e=>{if(gr(e))return xn(e);let t=pi(_r,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},yr=xn([]),br=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&gn(r[a],t)<0;)a++;a<r.length&&gn(r[a],t)===0||i.push(t)}return i.length===n.length?e:xn(i)},xr=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&gn(r[a],t)<0;)a++;a<r.length&&gn(r[a],t)===0&&i.push(t)}return i.length===n.length?e:xn(i)},Sr=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=gn(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=xn(i);if(e.hash!==0&&e.hash!==Vi){let t=e.hash,n=0;for(;n<a.length;n++){let e=Ki(a[n]);if(e===Vi)break;t=t+zi(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Yi(a[e])|0;c.fingerprint=t}return c},Cr=e=>{let t=e.length<2?e:[...e].sort((e,t)=>gn(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&gn(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Cn(n,r)},wr=e=>{let t=Cr(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:It(t,e.map(e=>e[0]))},Tr=[],Er=/* @__PURE__ */ new Map,Dr=[],Or=/* @__PURE__ */ new WeakMap,kr=e=>{let t=Tr[e]??Er.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?Er.set(e,new WeakRef(n)):Tr[e]=n,n},Ar=e=>{if(ai(e),e.low===1&&e.high>=1)return kr(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},jr=e=>e.length>0&&(e===Tr[e.length]||e===Er.get(e.length)?.deref())||Or.has(e),Mr=e=>{let t=P(e).elements;return jr(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Nr=e=>{let t=Dr[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Dr[e]=n,n},Pr=e=>Tn(Cn(kr(e.length),e),`tuple`),Fr=e=>Tn(Cr(e),`record`),Ir=(e,t)=>Tn(Cn(e,t),`record`),Lr=e=>j(e)&&!ln(e),Rr=(e,t=!1)=>`UNION(${L(e.base,t)})`,zr=(t,n=e=>P(e).elements)=>{if(!Lr(t.base))throw new e.b(`Attempted to enumerate the nonenumerable set:\n${Rr(t)}`);return n(t.base)},Br=(t,n,r)=>{if(Lr(t))return t;throw new e.b(n===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${L(t)}\nwhen enumerating:\n${Rr(r)}`)},N=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return N(e.base);case`FunctionSet`:return N(e.domain)&&N(e.range)||Vr(e.domain)===!0||Vr(e)===!0;case`RecordSet`:return e.sets.every(N)||Vr(e)===!0;case`ProductSet`:return e.factors.every(N)||Vr(e)===!0;case`Union`:return N(e.base)&&(Mt(e.base)?dr(e.base):Qr(e.base)).every(N);case`SetOperation`:return e.operator===`\\cup`?N(e.left)&&N(e.right):e.operator===`\\cap`?N(e.left)||N(e.right):N(e.left);default:return!1}},Vr=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=Vr(e.domain);return t===void 0?void 0:!t&&Vr(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Vr(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return N(e)?P(e).elements.length===0:void 0;default:return}},Hr=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},Ur=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},Wr=e=>{if(typeof e!=`object`||e.kind!==`Subset`||ln(e.base))return;let t=P(e.base).elements;if(t.length<=20)return;let n=-1,r=[0],i=e=>{for(e<=n&&(n=-1);n<e;)n===-1?r=[]:Ur(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return xn(r.map(e=>t[e]))},a=2**t.length,o=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<a;return new Proxy([],{get:(e,t,n)=>t===`length`?a:o(t)?i(Number(t)):Reflect.get(e,t,n),has:(e,t)=>o(t)||Reflect.has(e,t)})},Gr=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(xn(r.map(t=>e[t])));while(Ur(r,e.length))}return t},Kr=(t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){let o=t[a];if(ln(o))throw new e.b(r(o,a));let s=n(o);if(s.length===0)return[[]];i.push(s)}return i},qr=(t,n=e=>P(e).elements)=>{if(typeof t!=`object`)throw new e.b(`Expected a set but found ${L(t)}`);switch(t.kind){case`Set`:return t.elements;case`MixedSet`:return sr(t.elements);case`Interval`:{let e=Ar(t);return e!==Tr[e.length]&&Or.set(e,t),e}case`Subset`:{if(ai(t.base)===0)return Gr([]);if(!j(t.base))throw new e.b(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${A(L(t.base))}`);let n=P(t.base).elements;if(n.length>30)throw new e.b(ii(t));return Gr(n)}case`FunctionSet`:{if(!Qt&&F(t))return[];if(ln(t.domain))throw new e.b(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${L(t.domain)}\ncannot be enumerated.`);let r=Mr(t.domain);if((r.length>0||Qt)&&ln(t.range))throw new e.b(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${L(t.range)}\ncannot be enumerated.`);let i=r.length===0?[]:n(t.range);return Hr(r.map(()=>i)).map(e=>Cn(r,e))}case`RecordSet`:{if(!Qt&&F(t))return[];let e=Kr(t.sets,n,(e,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${t.names[n]}' field:\n${L(e)}`);return Hr(e).map(e=>Fr(t.names.map((t,n)=>[t,e[n]])))}case`ProductSet`:{if(!Qt&&F(t))return[];let e=Kr(t.factors,n,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${L(e)}`);return Hr(e).map(Pr)}case`FilteredSet`:if(!j(t.base)||ln(t.base))throw new e.b(`Attempted to enumerate { x \\in S : p(x) } when S:\n${L(t.base)}\nis not enumerable`);return P(vr(Qr(t.base).filter(e=>t.test(e,!1)))).elements;case`Union`:{let n=[];return zr(t).forEach((r,i)=>{let a=Br(r,i,t);if(Ot(a))throw new e.N(Et());Qr(a).forEach(e=>Dt(n,e))}),P(vr(n)).elements}case`SetOperation`:{if(t.operator===`\\cap`&&!Lr(t.left)&&!Lr(t.right))throw new e.b(`Attempted to enumerate S \\cap T when neither S:\n${L(t.left)}\nnor T:\n${L(t.right)}\nis enumerable`);if(t.operator===`\\`&&!Lr(t.left))throw new e.b(`Attempted to enumerate S \\ T when S:\n${L(t.left)}\nis not enumerable.`);if(t.operator===`\\cup`)return P(vr(Yr(t))).elements;let n=t.operator===`\\`||Lr(t.left),r=n?t.left:t.right,i=n?t.right:t.left,a=[];return kt(typeof r==`object`&&r.kind===`Interval`?r:Qr(r),e=>{hi(e,i)===(t.operator===`\\cap`)&&Dt(a,e)}),P(vr(a)).elements}case`InfiniteSet`:case`SequenceSet`:throw new e.b(`Attempted to enumerate the non-enumerable set ${L(t)}`);default:throw new e.b(`Expected a set but found ${L(t)}`)}},P=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return xn(qr(e));let t=typeof e==`object`&&xt(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=fi.sets;n?.push(e);let r=qr(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?xn(r):_r(r);return t&&(t.enumerated=i),i},Jr=e=>{if(!(typeof e!=`object`||On(e)))switch(e.kind){case`MixedSet`:P(e);return;case`FilteredSet`:return Lr(e.base)||P(e),Jr(e.base);case`Union`:if(!Mt(e.base)&&Lr(e.base))return Jr(e.base);zr(e).slice(0,1).forEach(t=>Jr(Br(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!Lr(e.left)&&P(e),e.operator!==`\\cup`||Lr(e.left)&&Lr(e.right)||P(e),e.operator!==`\\cap`||Lr(e.left)?Jr(e.left):Jr(e.right),e.operator===`\\cup`&&Jr(e.right)}},Yr=t=>{if(!Lr(t.left)||!Lr(t.right))throw new e.b(`Attempted to enumerate S \\cup T when S:\n${L(t.left)}\nand T:\n${L(t.right)}\nare not both enumerable`);if(Jr(t.left),Jr(t.right),Ot(t.left))throw new e.N(Et());let n=Qr(t.left),r=Ot(t.right)?void 0:Qr(t.right);if(!r||n.length+r.length>Tt())throw new e.N(Et());return[...n,...r]},Xr=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return P(e).elements;let t=cr(e,()=>Yr(e)),n=P(vr(t)).elements;return e.enumerated=xn(n),n},Zr=(e,t)=>{if(typeof e!=`object`||On(e))return P(e).elements.some(t);let n=fi.sets;n?.push(e),Jr(e);let r=ni(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},Qr=e=>{let t=[];return Zr(e,e=>(t.push(e),!1)),t},$r=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,ei=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(ei);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(ei)&&e.range.every(ei);case`SetOperation`:return e.operator!==`\\cup`&&ei(e.left)&&ei(e.right);case`FilteredSet`:return ei(e.base);case`ProductSet`:return e.factors.every(ei);default:return!1}},ti=e=>typeof e!=`object`||On(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?ti(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||ti(e.left)||ti(e.right):$r(e)?.some(ti)??!1,ni=(e,t)=>{if(e.kind===`Union`)return zr(e,Qr).some((n,r)=>Zr(Br(n,r,e),t));if(e.kind===`FilteredSet`&&Lr(e.base))return Zr(e.base,n=>e.test(n,!1)&&t(n));if($r(e)?.some(ti))return qr(e,Qr).some(t);if(e.kind!==`SetOperation`)return P(e).elements.some(t);if(e.operator===`\\cup`)return!Lr(e.left)||!Lr(e.right)?P(e).elements.some(t):Zr(e.left,t)||Zr(e.right,t);let n=e.operator===`\\`||Lr(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return Lr(r)?Zr(r,n=>hi(n,i)===(e.operator===`\\cap`)&&t(n)):P(e).elements.some(t)},F=t=>{if(typeof t!=`object`||!j(t))throw new e.b(`Shouldn't call isEmpty() on value ${L(t)}`);switch(t.kind){case`Set`:case`MixedSet`:return t.elements.length===0;case`Interval`:return t.low>t.high;case`InfiniteSet`:if(t.name===`Any`)throw new e.b(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return t.factors.some(F);case`RecordSet`:return t.sets.some(F);case`FunctionSet`:return!F(t.domain)&&F(t.range);case`Union`:return zr(t).every((e,n)=>F(Br(e,n,t)));default:return P(t).elements.length===0}},ri=(t,n,r)=>t.reduce((t,i)=>{let a=t*ai(i,n);if(a>2147483647)throw new e.b(r());return a},1),ii=e=>`Overflow when computing the number of elements in:\n${L(e)}`,ai=(t,n)=>{if(typeof t!=`object`)throw new e.b(`Attempted to compute the number of elements in the ${Nt(t)} ${L(t)}.`);switch(t.kind){case`ModelValue`:throw new e.b(`Attempted to compute the number of elements in the model value ${L(t)}.`);case`Function`:return t.domain.length;case`LazyFunction`:return ai(t.domain,n);case`Interval`:{let n=Math.max(0,t.high-t.low+1);if(n>2147483647)throw new e.b(`Size of interval value exceeds the maximum representable size (32bits): ${t.low}..${t.high}.`);return n}case`InfiniteSet`:case`SequenceSet`:throw new e.b(`Attempted to compute the number of elements in the overridden value ${L(t)}.`);case`Subset`:{let r=ai(t.base,n);if(r>=31)throw new e.b(ii(t));return 2**r}case`FunctionSet`:{if(n!==`1.7.4`){if(F(t.domain))return 1;if(F(t.range))return 0;if(ai(t.range,n)===1)return 1}let r=ai(t.domain,n),i=ai(t.range,n);if(i<=1)return r===0?1:i;let a=1;for(let n=0;n<r;n++)if(a*=i,a>2147483647)throw new e.b(ii(t));return a}case`RecordSet`:return n!==`1.7.4`&&F(t)?0:ri(t.sets,n,()=>ii(t));case`ProductSet`:return n!==`1.7.4`&&F(t)?0:ri(t.factors,n,()=>`Overflow when computing the number of elements in ${L(t)}`);default:return Mn(t),P(t).elements.length}},oi=e=>`Attempted to check if the set ${L(e)}is finite.`,si=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)throw new e.b(`Attempted to check if the ${Nt(t)} ${L(t)} is a finite set.`);switch(t.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new e.b(`Attempted to check if the function:\n${L(t)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return si(t.base)&&F(t.base);case`Subset`:return si(t.base);case`FunctionSet`:{let e=si(t.domain);if(e&&F(t.domain))return!0;let n=si(t.range);return n&&F(t.range)?!0:n&&(e||ai(t.range)===1)}case`RecordSet`:case`ProductSet`:{let e=t.kind===`RecordSet`?t.sets:t.factors,n=!0;for(let t of e)if(!si(t))n=!1;else if(F(t))return!0;return n}case`Union`:if(!Lr(t.base))throw new e.b(`Attempted to check if the nonenumerable set:\n${Rr(t)}\nis a finite set.`);return P(t.base).elements.every(si);case`SetOperation`:if(t.operator===`\\cup`)return si(t.left)&&si(t.right);if(t.operator===`\\cap`){if(!si(t.left)&&!si(t.right))throw new e.b(oi(t));return!0}if(si(t.left))return!0;if(!si(t.right))throw new e.b(oi(t));return!1;case`FilteredSet`:if(!si(t.base))throw new e.b(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${L(t.base)}\nis finite.`);return!0}},ci=(e,t,n=gn)=>{let r=0,i=e.length-1;for(;r<=i;){let a=r+i>>1,o=n(e[a],t);if(o===0)return a;o<0?r=a+1:i=a-1}return-1},li=(t,n)=>{let r=t.elements;if(r.length>Tt())throw new e.N(Et());let i=Array.from({length:r.length},()=>!1),a=n.filter(e=>{let t=ci(r,e);return!i[t]&&(i[t]=!0,!0)}),o=xn(r);return a.some((e,t)=>e!==r[t])&&(o.writtenElements=a),o},ui=t=>{if(typeof t!=`object`||!jt(t))return;if(t.kind===`LazyFunction`&&(!j(t.domain)||ln(t.domain)))throw new e.b(`To convert a function of form [x \\in S |-> f(x)] to a tuple, the set S must be enumerable.`);let n=I(t);return n.domain.every((e,t)=>e===t+1)?n.range:void 0},di=(e,t)=>{let n=`Attempted to check if the value:\n${L(e)}\nis an element of the`;if(!jt(t))return`${n} ${Nt(t)} ${L(t)}`;let r=En(t);return r===`record`?`Attempted to check if element:\n${L(e)}\nis in the record:\n${L(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${L(t)}`},fi={sets:void 0},pi=(t,n,r,i)=>{let a=fi.sets,o=fi.callStack,s=a?.length??0,c=o&&{...o,length:o.expressions.length};try{return t(r,i)}catch(t){if(!(t instanceof e.b))throw t;return a&&(a.length=s),o&&c&&(o.expressions.length=c.length,o.isFrozen=c.isFrozen,o.fingerprint=c.fingerprint),n(r,i,t)}},mi=e=>(fi.sets??[]).slice(e).some(e=>typeof e==`object`&&fi.callStack?.sources.has(e)===!0),hi=(e,t)=>{let n=fi.sets;if(n===void 0)return bi(e,t);n.push(t);let r=bi(e,t);return n.pop(),r},gi=(e,t)=>{let n=t.elements,r=0,i=n.length-1;for(;r<=i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;if(a===e)return!0;a<e?r=t+1:i=t-1}return!1},_i=(e,t)=>ci(t.elements,e)!==-1,vi=(e,t)=>t.isNormalized?lr(e,t.elements).isFound:ur(e,dr(t)),yi=(t,n)=>{if(t.type!==void 0)throw new e.b(`Attempted to check if the typed model value ${A(L(t))} is an element of\n${A(L(n))}`);return!1},bi=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return gi(e,t)??xi(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return xi(e,t)},xi=(t,n)=>{if(!j(n))throw new e.b(di(t,n));switch(n.kind){case`Set`:return Mn(t),pi(_i,vi,t,n);case`MixedSet`:return ur(t,n.elements);case`Interval`:if(typeof t==`number`)return t>=n.low&&t<=n.high;if(n.low<=n.high&&(!M(t)||t.type!==void 0))throw new e.b(`Attempted to check if the value:\n${L(t)}\nis in the integer interval ${L(n)}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(M(t))return yi(t,n);if(!(n.name===`STRING`?typeof t==`string`:typeof t==`number`))throw new e.O(`Attempted to check if the value:\n${L(t)}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof t==`number`&&t>=0;case`Subset`:if(!j(t)||ln(t))throw new e.b(`Attempted to check if the non-enumerable value\n${A(L(t))}\nis element of\n${A(L(n))}`);return P(t).elements.every(e=>hi(e,n.base));case`FunctionSet`:{if(!jt(t)){if(M(t))return yi(t,n);throw new e.b(`Attempted to check if \n${L(t)}\nwhich is not a TLC function value, is in the set of functions:\n${A(L(n))}`)}let r=I(t),i=Bn(t,r.domain);return(i===void 0?mr(n.domain,xn(r.domain)):mr({kind:`Interval`,low:i,high:i+r.domain.length-1},n.domain))&&r.range.every(e=>hi(e,n.range))}case`RecordSet`:{let r=jt(t)?I(t):void 0;if(!r||!Ht(r.domain)){if(M(t))return yi(t,n);throw new e.b(`Attempted to check if non-record\n${L(t)}\nis in the set of records:\n${L(n)}`)}return r.domain.length===n.names.length&&n.names.every((e,t)=>{let i=ci(r.domain,e);return i!==-1&&hi(r.range[i],n.sets[t])})}case`ProductSet`:{let r=jt(t)?ui(t):void 0;if(r===void 0){let r=jt(t)&&I(t).domain.every(e=>typeof e==`number`);if(M(t))return yi(t,n);if(r)return!1;throw new e.b(`Attempted to check if non-tuple\n${L(t)}\nis in the set of tuples:\n${L(n)}`)}return r.length===n.factors.length&&r.every((e,t)=>hi(e,n.factors[t]))}case`FilteredSet`:try{return hi(t,n.base)&&n.test(t,!0)}catch(r){throw!(r instanceof e.b)||!nt(r)?r:new e.b(`Cannot decide if element:\n${A(L(t))}\n is element of:\n${A(L(n.base))}\nand satisfies the predicate ${n.source?.predicate}`)}case`Union`:{if(!Lr(n.base))throw new e.b(`Attempted to check if:\n ${L(t)}\nis an element of the non-enumerable set:\n ${Rr(n)}`);let r=P(n.base).elements;return r.length>1&&r.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),r.some(e=>hi(t,e))}case`SetOperation`:return n.operator===`\\cup`?hi(t,n.left)||hi(t,n.right):hi(t,n.left)&&hi(t,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=ui(t);if(r===void 0){if(M(t))return yi(t,n);throw new e.O(`Attempted to check if the value:\n${A(L(t))}\nis an element of ${A(L(n))}.`)}return r.every(e=>hi(e,n.base))}default:throw new e.b(di(t,n))}},Si=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?hi(e,n):e.range.every((e,r)=>Si(e,t.range[r],n.range)),I=t=>{if(typeof t==`object`&&t.kind===`Function`)return t;if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return t.enumerated;if(N(t.domain)||ai(t.domain),!j(t.domain))throw new e.b(`The domains of formal parameters must be enumerable.`);let n=Mr(t.domain);return t.enumerated=Tn(Cn(n,n.map(e=>t.apply(e))),En(t)),t.enumerated}throw new e.b(`Expected a function but found ${L(t)}`)},Ci=(e,t,n)=>{let r=A(L(e)),i=A(L(t)),a=n===`1.7.4`;switch(En(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},wi=(e,t)=>{if(!Qt)return Ci(e,t);let n=A(L(t));return En(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Ti=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},Ei=t=>new e.b(`Attempted to apply function with integer domain to the non-integer argument ${A(L(t))}`),Di=(e,t)=>ci(e.domain,t),Oi=(e,t,n)=>{let r=Lt(e);throw Qt||r!==e.domain||r.length<32?r.forEach(e=>or(e,t)):ci(r,t,tr),n},ki=(t,n,r)=>{let i=t.domain;if(typeof n!=typeof i[0]){let a=En(t),o=a===`tuple`?`number`:a===`record`?`string`:void 0;if(o!==void 0&&typeof n!==o)throw new e.b(r(t,n));if(o===void 0&&!Qt&&typeof n!=`number`&&jr(i))throw Ei(n)}let a=Ti(i,n);return a===-1?pi(Di,Oi,t,n):a},Ai=(t,n,r)=>{let i=t.domain,a=ui(r),o=(e,n,r)=>`In applying the function\n${A(L(t))},\nthe ${e} is:\n${A(L(n))}\nwhich ${r}.\n`,s=()=>new e.b(o(`argument list`,r,`does not match its formal parameter`));if(a===void 0)throw s();if(typeof i!=`object`||i.kind!==`ProductSet`)throw new e.b(`Attempted to apply a function to ${L(r)}, which is not in its domain`);if(n.forEach((t,n)=>{if(n>=a.length)throw s();let r=a[n],c=`argument number ${n+1}`;if(!hi(r,i.factors[n]))throw new e.b(o(c,r,t===void 0?`is not in the function's domain ${L(i)}`:`is not in its domain`));if(t!==void 0&&ui(r)?.length!==t)throw new e.b(o(c,r,`does not match its formal parameter`))}),a.length>n.length)throw s()},ji=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!hi(t,e.lambdaDomain),Mi=(t,n,r)=>{if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return Mi(t.enumerated,n,r);let i=t.boundTupleLengths;if(i!==void 0)return Ai(t,i,n),t.apply(n);if(!hi(n,t.domain))throw new e.b(En(t)===`lambda`?Ci(t,n):`Attempted to apply a function to ${L(n)}, which is not in its domain`);return t.apply(n)}if(typeof t!=`object`||t.kind!==`Function`)throw new e.b(`Attempted to apply ${L(t)}, which is not a function`);let i=r??Ci;if(ji(t,n))throw new e.b(i(t,n));let a=ki(t,n,i);if(a===-1)throw new e.b(i(t,n));return t.range[a]},Ni=e=>jr(e)?Or.get(e)??Nr(e.length):void 0,Pi=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=I(e);if(t.functionClass===`lambda`&&t.lambdaDomain)return t.lambdaDomain;let n=Ni(t.domain);if(n)return n;let r=xn(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},Fi=(t,n,r,i=!1)=>{if(typeof t==`object`&&t.kind===`LazyFunction`&&(i||t.enumerated===void 0)){if(!hi(n,t.domain))return t;let e=r(t.apply(n));return Tn({kind:`LazyFunction`,domain:t.domain,apply:r=>mr(n,r)?e:t.apply(r),source:t.source,boundTupleLengths:t.boundTupleLengths},En(t))}if(!jt(t))throw new e.b(`Attempted to apply EXCEPT construct to the value ${A(L(t))}.`);let a=I(t);if(ji(a,n))return a;let o=ki(a,n,wi);if(o===-1)return a;let s=[...a.range],c=a.range[o],l=r(c);s[o]=l;let u=Tn(Cn(a.domain,s),En(a));if(u.writtenKeys=a.writtenKeys,u.lambdaDomain=a.lambdaDomain,a.hash!==0&&a.hash!==Vi){let e=Ki(l);if(e!==Vi){let t=Ki(a.domain[o]);u.hash=c===l?a.hash:a.hash-Bi(t,Ki(c))+Bi(t,e)|0}}if(a.fingerprint!==0){let e=a.domain[o];u.fingerprint=c===l?a.fingerprint:a.fingerprint-Xi(e,c)+Xi(e,l)|0}return u},Ii=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Li=(e,t)=>Math.imul(e^t,16777619),Ri=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Ii(t)},zi=e=>Ii(e+2654435769|0),Bi=(e,t)=>Ii(Math.imul(e,668265261)+t|0),Vi=795548749,Hi=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Ki(t[e]);if(r===Vi)return Vi;n=n+zi(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Ki(e.domain[n]),i=Ki(e.range[n]);if(r===Vi||i===Vi)return Vi;t=t+Bi(r,i)|0}return t},Ui=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)return;if(t.kind===`InfiniteSet`||t.kind===`SequenceSet`)throw new e.b(`TLC has found a state in which the value of a variable contains ${L(t)}`);if(j(t)){P(t).elements.forEach(Ui);return}let n=I(t);n.domain.forEach(Ui),n.range.forEach(Ui)},Wi=t=>{if(typeof t==`object`&&t.kind!==`ModelValue`)try{Ki(t)===Vi&&Ui(t);return}catch(t){if(!(t instanceof e.b))throw t;return t}},Gi=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},Ki=e=>typeof e==`number`?Ii(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?Ri(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=Hi(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?N(e.domain)?Ki(I(e)):Vi:N(e)?Ki(P(e)):Vi,qi=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Ji=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return qi(t)},Yi=e=>qi(Qi(e)+2135587861|0),Xi=(e,t)=>qi(Math.imul(Qi(e),374761393)+Qi(t)|0),Zi=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Yi(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Xi(e.domain[n],e.range[n])|0;return t},Qi=e=>typeof e==`number`?qi(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?Ji(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Zi(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?Qi(I(e)):N(e)?Qi(P(e)):Ji($i(e)),$i=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):ea(e),ea=t=>{if(t.kind===`ModelValue`)return`@${t.name}`;if(t.kind===`InfiniteSet`)return`<${t.name}>`;if(t.kind===`SequenceSet`)return`<Seq ${$i(t.base)}>`;if(t.kind===`FilteredSet`&&!N(t))throw new e.b(`Attempted to compare the non-enumerable set ${L(t)} with another value`);if(j(t))return N(t)?`{${P(t).elements.map($i).join(`,`)}}`:`<${t.kind} ${L(t)}>`;let n=I(t);return`(${n.domain.map((e,t)=>`${$i(e)}:${$i(n.range[t])}`).join(`,`)})`},ta={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},na=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>ta[e])}"`,ra=1999,ia=e=>e.reduce((e,t)=>e===0?0:e*ai(t),1),aa=e=>{if(e.kind===`Subset`)return ai(e.base)<=6?P(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return P(e);if(e.kind===`FunctionSet`){let t=F(e.domain)?0:ai(e.domain);return(t===0?1:ai(e.range)**t)<=ra?P(e):void 0}return ia(e.kind===`RecordSet`?e.sets:e.factors)<=ra?P(e):void 0},oa=(t,n)=>{if(n||t.kind===`Union`||t.kind===`Subset`&&jt(t.base)&&(t.base.kind===`Function`||N(t.base.domain)))return aa(t);if(N(t))try{return aa(t)}catch(t){if(t instanceof e.b)return;throw t}},sa=(e,t)=>{let n=e=>L(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return Rr(e,t)}},ca=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),la=t=>{if(N(t.domain))try{return I(t)}catch(t){if(t instanceof e.b||e.et(t))return;throw t}},ua=e=>{let t=[],n=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:if(e.elements.forEach(n),e.isNormalized)return;e.isNormalized=!0,t.push(e);return;case`MixedSet`:e.elements.forEach(n),P(e);return;case`Function`:e.range.forEach(n);return;case`LazyFunction`:n(e.enumerated??e.domain);return;case`SetOperation`:n(e.left),n(e.right);return;case`FunctionSet`:n(e.domain),n(e.range);return;case`RecordSet`:e.sets.forEach(n);return;case`ProductSet`:e.factors.forEach(n);return;case`Subset`:case`Union`:case`FilteredSet`:case`SequenceSet`:n(e.base);return;default:return}};try{return e.forEach(n),e.map(e=>L(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1})}},L=(e,t=!1,n=!1)=>{let r=e=>L(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return na(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(P(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=$t.isExpanded?oa(e,t):void 0;return n?r(n):sa(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?$t.isExpanded||!e.source?la(e):void 0:e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${L(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Qt&&En(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&En(e)!==`lambda`);if(i.domain.length===0&&En(e)===`record`)return`[]`;if(i.domain.every((e,t)=>e===t+1))return`<<${i.range.map(a).join(`, `)}>>`;let o=n?i.domain.map((e,t)=>[e,i.range[t]]):zt(i);return En(e)===`record`||i.domain.every(e=>typeof e==`string`&&ca(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},da=(t,n)=>{if(t===void 0)return!1;try{return Pn(t,n)}catch(t){if(t instanceof e.b)return!1;throw t}},fa=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,pa=e=>Array.from({length:e.length},(t,n)=>e.charCodeAt(n)).reduce((e,t)=>Math.imul(e,31)+t|0,0),ma=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(fa,(e,a,o=``,s,c,l=``)=>{let u=e=>o.includes(`-`)?e.padEnd(Number(s)):e.padStart(Number(s??0)),d=o.includes(`<`),f=o.replace(`<`,``);if(l===`n`&&e===`%n`)return`
74
- `;if(l===`%`&&c===void 0&&/^-?$/.test(f))return f===`-`&&s===void 0&&(i=!1),u(`%`);let p=d?r:a===void 0?n++:Number(a.slice(0,-1))-1;r=p;let m=t[p];if(!`sSbBhH`.includes(l)||l===``||!/^-?$/.test(f)||f===`-`&&s===void 0||m===void 0)return i=!1,e;let h=l.toLowerCase(),g=h===`s`?m:h===`b`?`true`:(pa(m)>>>0).toString(16),_=u(c===void 0?g:g.slice(0,Number(c.slice(1))));return l===h?_:_.toUpperCase()});return i?a:void 0},ha=(t,n)=>{let r=n?void 0:tn.get(t);if(r)return r();let i=Object.entries(t),a=rn.get(t),o=a!==void 0&&`_format`in t,s=o?t._format:i.length===1?`%s = %s
72
+ `]]),at=(e,t,n)=>{let r=n?it.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${ot(t.slice(a),n)}`},ot=(e,t)=>{let n=t?nt(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${qe.none} @!@!@\n${at(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},st=e=>String(e).padStart(2,`0`),ct=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${st(r%24)}h`:e>36e5?`${st(r%24)}h ${st(n)}min`:e>6e4?`${st(n)}min ${st(t)}s`:`${st(t)}s`},lt=e=>`${e.getFullYear()}-${st(e.getMonth()+1)}-${st(e.getDate())} ${st(e.getHours())}:${st(e.getMinutes())}:${st(e.getSeconds())}`,ut=/* @__PURE__ */ new WeakMap,dt=(t,n,r)=>{if(!(t instanceof e.b))return t;let i=e.it(new e.b(`${r}\n${t.message}`,t),e.Q(t));return ut.set(i,{code:n,headline:r,inner:t}),i},ft=e=>ut.has(e),pt=e.$(`util.WrongInvocationException`),mt=e.G.slice(0,e.G.indexOf(`
73
+ `)),ht=`${e.G}tlc2.tool.EvalException: `,gt=`${e.G}util.Assert$TLCRuntimeException: `,_t=e=>rt(e)?ht:gt,vt=t=>{try{return t()}catch(t){throw t instanceof e.b?rt(t)?new e.b(`${e.W}${t.message}`):nt(t.message)?t:new e.b(`${e.G}${t.message}`):t}},yt=[ht,gt,e.G,e.W],bt=(t,n)=>{let r=ut.get(t);if(r)return`${r.headline}\n${bt(r.inner,n)}`;let i=t.message;if(t instanceof e.z)return i;let a=yt.find(e=>i.startsWith(e))??``;return`${a}${ot(i.slice(a.length),n)}`},xt=(t,n)=>{let r=ut.get(t),i=t.message;if(r)return{code:r.code,message:i,toolMessage:bt(t,!0)};if(t instanceof e.P)return{code:n?Ke.stackOverflow:Ke.general,message:i,toolMessage:i};if(n&&rt(t))return{code:nt(i)?.code??Ke.general,message:i,toolMessage:i};let a=n&&!i.startsWith(mt)&&!(t instanceof e.z),o=t instanceof e.N?pt:e.G,s=a?o:``;return{code:Ke.general,message:`${s}${i}`,toolMessage:`${s}${bt(t,!0)}`}},St=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,Ct=1e6,wt={size:Ct},Tt=()=>wt.size,Et=()=>Math.max(wt.size,10),Dt=()=>`Attempted to construct a set with too many elements (>${wt.size}).`,Ot=(t,n)=>{if(t.length===Et())throw new e.N(Dt());t.push(n)},kt=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=Et(),At=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},A=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,jt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),Mt=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),j=e=>typeof e==`object`&&e.kind===`ModelValue`,Nt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),Pt=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:A(e)?`set`:`function`,Ft=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,It={isUsed:!1},Lt=(e,t)=>(It.isUsed=!0,e.writtenKeys=t,e),Rt=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,zt=e=>Rt(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),Bt=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):zt(e),Vt=(e,t,n)=>Lt(Lr(e,t),n),Ht=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(Ht);e.writtenKeys=void 0,e.range.forEach(Ht)}},Ut=e=>e.every(e=>typeof e==`string`),Wt=(e,t)=>e.length>0&&t.length>0&&Ut(e)!==Ut(t),Gt=(e,t)=>{It.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Wt(n,r)?nr(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=_n(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:_n(t,n);if(r!==0)return r}return 0},Kt=(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=_n(n[e],r[e]);if(t!==0)return t}return 0},qt=e=>j(e)?e.type:void 0,Jt=(t,n,r)=>{let i=qt(t),a=qt(n);if(i===void 0&&a===void 0)return;let o=r?`check equality of`:`compare`;if(j(t)&&j(n)){if(i===void 0||a===void 0||i===a)return;throw new e.b(`Attempted to ${o} the differently-typed model values ${I(t)} and ${I(n)}`)}throw i===void 0?new e.b(`Attempted to ${o} the typed model value ${I(n)} and the non-model value\n${I(t)}`):new e.b(`Attempted to ${o}${r?``:` the`} typed model value ${I(t)} and non-model value\n${I(n)}`)},Yt={ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0},Xt=e=>{Yt.ranks=Object.create(null),Yt.size=0,Yt.searchRank=void 0,Yt.unorderedString=void 0,vn.clear();for(let t of e)sn(t)},Zt=()=>{Yt.searchRank=Yt.size},Qt=()=>Yt.unorderedString,$t={is174:!1},en={isExpanded:!0,isViewPrinted:!1},tn=e=>{$t.is174=e.version===`1.7.4`,wt.size=e.maxSetSize??Ct,en.isExpanded=e.isLazyValueExpanded??!0,en.isViewPrinted=e.isViewPrinted??!1},nn=/* @__PURE__ */ new WeakMap,rn=(e,t)=>(en.isViewPrinted&&nn.set(e,t),e),an=/* @__PURE__ */ new WeakMap,on=(e,t)=>(an.set(e,t),e),sn=e=>(Yt.ranks[e]===void 0&&(Yt.ranks[e]=Yt.size++),e),cn=e=>Yt.ranks[sn(e)],ln=(e,t)=>{if(e===t)return 0;let n=Yt.ranks,r=n[e],i=n[t],a=Yt.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(Yt.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},un=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),dn=(e,t)=>(un(e)||un(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),fn=(t,n)=>new e.b(un(t)?`Attempted to compare overridden value ${I(t,!0)} with non-overridden value:\n${I(n)}`:`Attempted to compare ${Pt(t)} ${I(t)} with ${Pt(n)} ${I(n)}`),pn=(t,n,r)=>{if(!un(t))throw new e.b(`Attempted to ${r} the set ${I(M(t)?N(t):t,!0)} with the value:\n${I(n,!0)}`);if(!un(n))throw fn(t,n);let i=t.kind===`InfiniteSet`?t.name:void 0,a=n.kind===`InfiniteSet`?n.name:void 0;if(i!==void 0&&i===a)return 0;if(i===`Nat`&&a===`Int`||i===`Int`&&a===`Nat`)return i===`Nat`?-1:1;throw new e.O(`Attempted to compare ${I(t,!0)} with the value\n${I(n,!0)}`)},mn={kind:`InfiniteSet`,name:`Any`},hn=t=>{throw new e.O(`Attempted to compare ANY with the value\n${I(t)}`)},gn=e=>{It.isUsed&&Ht(e),e===mn&&hn(e),typeof e==`object`&&e.kind===`LazyFunction`&&F(e)},_n=(e,t)=>{if(e===t)return gn(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Gt(e,t);if(n===`Set`&&r===`Set`)return Kt(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&&Jt(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return Jt(e,t,!1),n===`ModelValue`?-1:1;if(e===mn||t===mn)return hn(e===mn?t:e);if(A(e)&&A(t)&&dn(e,t))return pn(e,t,`compare`);let i=A(e);if(i!==A(t))throw fn(e,t);if(n===`Interval`&&r===`Set`){let n=oi(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-oi(t);if(n!==0)return n}return i?Kt(N(e),N(t)):Gt(F(e),F(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return ln(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(Jt(e,t,!1),j(e))return-1;if(j(t))return 1;throw fn(e,t)},vn=/* @__PURE__ */ new Map,yn=32768,bn=t=>{let n=vn.get(t);if(n)return n;if(vn.size===yn)throw new e.x(`TLC supports at most ${yn} 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:cn(t),hash:Li(Ri(zi(t),109)),fingerprint:Ji(Yi(t)^60)};return vn.set(t,r),r},xn=()=>[...vn.values()],Sn=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),Cn=e=>{let t=Sn(e);return t.isNormalized=!0,t},wn=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1}),Tn={isPresent:!1},En=(e,t)=>(t===`lambda`&&(Tn.isPresent=!0),t!==void 0&&(e.functionClass=t),e),Dn=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,On=e=>En(e,`lambda`),kn=e=>St(e)&&e.isCached===!0,An={isPresent:!1},jn=e=>(An.isPresent=!0,e),Mn=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),Nn=e=>{An.isPresent&&typeof e==`object`&&St(e)&&Mn.has(e.kind)&&(e.isCached=!0)},Pn=e=>{(Tn.isPresent||An.isPresent)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(Pn),e.range.forEach(Pn)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Pn):A(e)&&M(e)&&(Nn(e),N(e).elements.forEach(Pn))))},Fn=(e,t)=>{if(Nn(e),e===t)return gn(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Jt(e,t,!0),_n(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return Gt(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Kt(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&oi(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==oi(t))return!1;if(j(e)||j(t))return e.kind===`LazyFunction`&&F(e),Jt(e,t,!0),j(e)&&j(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Fn(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=P(e.domain),r=P(t.domain);if(n||r)return n===r;let i=P(e.range),a=P(t.range);return i||a?i===a:Fn(e.domain,t.domain)&&Fn(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(P(e))return P(t);if(P(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&Fn(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return P(e)?P(t):!P(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Fn(e,t.factors[n]));let n=A(e)&&A(t)&&!(M(e)&&M(t));if(n&&dn(e,t))return pn(e,t,`check equality of`)===0;if(n){if(!un(e)){let n=N(e);if(!un(t))return Kt(n,N(t))===0}return ea(e)===ea(t)}return _n(e,t)===0},In=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):ea(n)===ea(r);return n},Ln=In(!1),Rn=In(!0),zn=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Bn=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=qi(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Rn(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Rn(i[e],n))return i[e]}return n.kind===`Set`?zn(n.elements,t):(zn(n.domain,t),zn(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}},Vn=(e,t)=>t.length===0||Dn(e)===`tuple`?1:Pi(t)?.low,Hn=e=>{if(!Mt(e))return;let t=F(e);return{domain:t.domain,range:t.range,low:Vn(e,t.domain)}},Un=e=>{if(!Mt(e))return;let t=F(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},Wn=(e,t)=>(Jt(t,e,!1),1),Gn=(e,t)=>(Jt(t,e,!0),!1),Kn=(e,t)=>(e.type!==void 0&&Jt(e,t,!1),j(t)?e.rank-t.rank:-1),qn=(e,t)=>(e.type!==void 0&&Jt(e,t,!0),j(t)&&e.name===t.name),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} ${I(e)} with ${r.other}:\n${I(t)}`},Xn=(t,n,r)=>{let i=Hn(r);if(!i){if(j(r))return Wn(r,n);throw new e.b(`Attempted to compare the function ${I(n)} with the value:\n${I(r)}`)}if(t.range.length!==i.range.length)return t.range.length-i.range.length;let a=()=>Zn(t.range,i.range);if(t.low!==void 0&&t.range.length===0)return 0;if(t.low!==void 0&&i.low!==void 0)return t.low===i.low?a():t.low-i.low;let o=t.low??i.low;if(o===void 0)return Zn(t.domain,i.domain)||a();let s=t.low===void 0?t.domain:i.domain;for(let n=0;n<s.length;n++){let r=s[n];if(typeof r!=`number`)throw new e.b(`Attempted to compare integer with non-integer${t.low===void 0?``:`:`}\n${I(r)}.`);let i=t.low===void 0?r-(o+n):o+n-r;if(i!==0)return i}return a()},Zn=(e,t)=>{for(let n=0;n<e.length;n++){let r=nr(e[n],t[n]);if(r!==0)return r}return 0},Qn=(t,n)=>{let r=F(t);if(Dn(t)===`tuple`){let e=Mt(n)?di(n):void 0;return e?r.range.length-e.length||Zn(r.range,e):Xn({...r,low:1},t,n)}if(Dn(t)===`record`){let i=Un(n);if(!i){if(j(n))return Wn(n,t);throw new e.b(`Attempted to compare record:\n${I(t)}\nwith non-record\n${I(n)}`)}return r.domain.length-i.domain.length||Zn(r.domain,i.domain)||Zn(r.range,i.range)}return Xn({...r,low:Vn(t,r.domain)},t,n)},$n=(e,t)=>un(e)||un(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),er=(e,t)=>{let n=Nt(t)?t:N(t);return{elements:N(e).elements,otherElements:N(n).elements}},tr=(t,n)=>{if($n(t,n))return _n(t,n);if(!Nt(t))return tr(N(t),n);if(!A(n)){if(j(n))return Wn(n,t);throw new e.b(`Attempted to compare the set ${I(t)} with the value:\n${I(n)}`)}let r=er(t,n);return r.elements.length-r.otherElements.length||Zn(r.elements,r.otherElements)},nr=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return _n(t,n);if(j(n))return Wn(n,t);throw new e.b(Yn(t,n,!1))}return t.kind===`ModelValue`?Kn(t,n):Mt(t)?Qn(t,n):tr(t,n)},rr=(e,t)=>e.every((e,n)=>sr(e,t[n])),ir=(t,n,r)=>{let i=Hn(r);if(!i){if(j(r))return Gn(r,n);throw new e.b(`Attempted to check equality of the function ${I(n)} with the value:\n${I(r)}`)}if(t.range.length!==i.range.length)return!1;if(t.low!==void 0&&i.low!==void 0)return(t.range.length===0||t.low===i.low)&&rr(t.range,i.range);let a=t.low??i.low;return a===void 0?rr(t.domain,i.domain)&&rr(t.range,i.range):(t.low===void 0?t.domain:i.domain).every((t,n)=>{if(typeof t!=`number`)throw new e.b(`Attempted to compare an integer with non-integer:\n${I(t)}.`);return t===a+n})&&rr(t.range,i.range)},ar=(t,n)=>{let r=F(t);if(Dn(t)===`tuple`){let e=Mt(n)?di(n):void 0;return e?r.range.length===e.length&&rr(r.range,e):ir({...r,low:1},t,n)}if(Dn(t)===`record`){let i=Un(n);if(!i){if(j(n))return Gn(n,t);throw new e.b(`Attempted to check equality of record:\n${I(t)}\nwith non-record\n${I(n)}`)}return r.domain.length===i.domain.length&&rr(r.domain,i.domain)&&rr(r.range,i.range)}return ir({...r,low:Vn(t,r.domain)},t,n)},or=(t,n)=>{if($n(t,n))return Fn(t,n);if(!Nt(t))return or(N(t),n);if(!A(n)){if(j(n))return Gn(n,t);throw new e.b(`Attempted to check equality of the set ${I(t)} with the value:\n${I(n)}`)}let r=er(t,n);return r.elements.length===r.otherElements.length&&rr(r.elements,r.otherElements)},sr=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return t===n;if(j(n))return Gn(n,t);throw new e.b(Yn(t,n,!0))}return t.kind===`ModelValue`?qn(t,n):Mt(t)?ar(t,n):or(t,n)},cr=e=>{let t=[];for(let n of e){let e=ur(n,t);e.isFound||t.splice(e.index,0,n)}return t},lr=(e,t)=>{let n=pi.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},ur=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=lr(e,()=>nr(e,t[r]));if(i===0)return{index:r,isFound:!0};i<0?n.high=r:n.low=r+1}return{index:n.low,isFound:!1}},dr=(e,t)=>t.some(t=>lr(t,()=>sr(t,e))),fr=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,pr=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(pr)),e.kind===`Function`&&(e.domain.forEach(pr),e.range.forEach(pr)))},mr=e=>{if(!(typeof e!=`object`||kn(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:N(e);return;case`FilteredSet`:case`Subset`:return mr(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(mr(e.left),mr(e.right));case`FunctionSet`:return mr(e.domain),mr(e.range);case`RecordSet`:return e.sets.forEach(mr);case`ProductSet`:return e.factors.forEach(mr)}},hr=(e,t)=>mi(Fn,sr,e,t),gr=e=>{for(let t=1;t<e.length;t++)if(_n(e[t-1],e[t])>=0)return!1;return!0},_r=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},vr=e=>{for(let t=1;t<e.length;t++)Nn(e[t]);if(e.length<2||gr(e))return Sn(e);let t=[...e].sort(_n),n=[t[0]];for(let e=1;e<t.length;e++)_n(n[n.length-1],t[e])!==0&&n.push(t[e]);return Sn(n)},yr=e=>{if(_r(e))return Sn(e);let t=mi(vr,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},br=Sn([]),xr=(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&&_n(r[a],t)<0;)a++;a<r.length&&_n(r[a],t)===0||i.push(t)}return i.length===n.length?e:Sn(i)},Sr=(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&&_n(r[a],t)<0;)a++;a<r.length&&_n(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Sn(i)},Cr=(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=_n(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=Sn(i);if(e.hash!==0&&e.hash!==Hi){let t=e.hash,n=0;for(;n<a.length;n++){let e=qi(a[n]);if(e===Hi)break;t=t+Bi(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Xi(a[e])|0;c.fingerprint=t}return c},wr=e=>{let t=e.length<2?e:[...e].sort((e,t)=>_n(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&_n(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return wn(n,r)},Tr=e=>{let t=wr(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:Lt(t,e.map(e=>e[0]))},Er=[],Dr=/* @__PURE__ */ new Map,Or=[],kr=/* @__PURE__ */ new WeakMap,Ar=e=>{let t=Er[e]??Dr.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?Dr.set(e,new WeakRef(n)):Er[e]=n,n},jr=e=>{if(oi(e),e.low===1&&e.high>=1)return Ar(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Mr=e=>e.length>0&&(e===Er[e.length]||e===Dr.get(e.length)?.deref())||kr.has(e),Nr=e=>{let t=N(e).elements;return Mr(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Pr=e=>{let t=Or[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Or[e]=n,n},Fr=e=>En(wn(Ar(e.length),e),`tuple`),Ir=e=>En(wr(e),`record`),Lr=(e,t)=>En(wn(e,t),`record`),Rr=e=>A(e)&&!un(e),zr=(e,t=!1)=>`UNION(${I(e.base,t)})`,Br=(t,n=e=>N(e).elements)=>{if(!Rr(t.base))throw new e.b(`Attempted to enumerate the nonenumerable set:\n${zr(t)}`);return n(t.base)},Vr=(t,n,r)=>{if(Rr(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${I(t)}\nwhen enumerating:\n${zr(r)}`)},M=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return M(e.base);case`FunctionSet`:return M(e.domain)&&M(e.range)||Hr(e.domain)===!0||Hr(e)===!0;case`RecordSet`:return e.sets.every(M)||Hr(e)===!0;case`ProductSet`:return e.factors.every(M)||Hr(e)===!0;case`Union`:return M(e.base)&&(Nt(e.base)?fr(e.base):$r(e.base)).every(M);case`SetOperation`:return e.operator===`\\cup`?M(e.left)&&M(e.right):e.operator===`\\cap`?M(e.left)||M(e.right):M(e.left);default:return!1}},Hr=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=Hr(e.domain);return t===void 0?void 0:!t&&Hr(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Hr(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return M(e)?N(e).elements.length===0:void 0;default:return}},Ur=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},Wr=(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},Gr=e=>{if(typeof e!=`object`||e.kind!==`Subset`||un(e.base))return;let t=N(e.base).elements;if(t.length<=20)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:Wr(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return Sn(n.indices.map(e=>t[e]))},i=2**t.length,a=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<i;return new Proxy([],{get:(e,t,n)=>t===`length`?i:a(t)?r(Number(t)):Reflect.get(e,t,n),has:(e,t)=>a(t)||Reflect.has(e,t)})},Kr=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Sn(r.map(t=>e[t])));while(Wr(r,e.length))}return t},qr=(t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){let o=t[a];if(un(o))throw new e.b(r(o,a));let s=n(o);if(s.length===0)return[[]];i.push(s)}return i},Jr=(t,n=e=>N(e).elements)=>{if(typeof t!=`object`)throw new e.b(`Expected a set but found ${I(t)}`);switch(t.kind){case`Set`:return t.elements;case`MixedSet`:return cr(t.elements);case`Interval`:{let e=jr(t);return e!==Er[e.length]&&kr.set(e,t),e}case`Subset`:{if(oi(t.base)===0)return Kr([]);if(!A(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${k(I(t.base))}`);let n=N(t.base).elements;if(n.length>30)throw new e.b(ai(t));return Kr(n)}case`FunctionSet`:{if(!$t.is174&&P(t))return[];if(un(t.domain))throw new e.b(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${I(t.domain)}\ncannot be enumerated.`);let r=Nr(t.domain);if((r.length>0||$t.is174)&&un(t.range))throw new e.b(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${I(t.range)}\ncannot be enumerated.`);let i=r.length===0?[]:n(t.range);return Ur(r.map(()=>i)).map(e=>wn(r,e))}case`RecordSet`:{if(!$t.is174&&P(t))return[];let e=qr(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${I(e)}`);return Ur(e).map(e=>Ir(t.names.map((t,n)=>[t,e[n]])))}case`ProductSet`:{if(!$t.is174&&P(t))return[];let e=qr(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${I(e)}`);return Ur(e).map(Fr)}case`FilteredSet`:if(!A(t.base)||un(t.base))throw new e.b(`Attempted to enumerate { x \\in S : p(x) } when S:\n${I(t.base)}\nis not enumerable`);return N(yr($r(t.base).filter(e=>t.test(e,!1)))).elements;case`Union`:{let n=[];return Br(t).forEach((r,i)=>{let a=Vr(r,i,t);if(kt(a))throw new e.N(Dt());$r(a).forEach(e=>Ot(n,e))}),N(yr(n)).elements}case`SetOperation`:{if(t.operator===`\\cap`&&!Rr(t.left)&&!Rr(t.right))throw new e.b(`Attempted to enumerate S \\cap T when neither S:\n${I(t.left)}\nnor T:\n${I(t.right)}\nis enumerable`);if(t.operator===`\\`&&!Rr(t.left))throw new e.b(`Attempted to enumerate S \\ T when S:\n${I(t.left)}\nis not enumerable.`);if(t.operator===`\\cup`)return N(yr(Xr(t))).elements;let n=t.operator===`\\`||Rr(t.left),r=n?t.left:t.right,i=n?t.right:t.left,a=[];return At(typeof r==`object`&&r.kind===`Interval`?r:$r(r),e=>{gi(e,i)===(t.operator===`\\cap`)&&Ot(a,e)}),N(yr(a)).elements}case`InfiniteSet`:case`SequenceSet`:throw new e.b(`Attempted to enumerate the non-enumerable set ${I(t)}`);default:throw new e.b(`Expected a set but found ${I(t)}`)}},N=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Sn(Jr(e));let t=typeof e==`object`&&St(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=pi.sets;n?.push(e);let r=Jr(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`)?Sn(r):vr(r);return t&&(t.enumerated=i),i},Yr=e=>{if(!(typeof e!=`object`||kn(e)))switch(e.kind){case`MixedSet`:N(e);return;case`FilteredSet`:return Rr(e.base)||N(e),Yr(e.base);case`Union`:if(!Nt(e.base)&&Rr(e.base))return Yr(e.base);Br(e).slice(0,1).forEach(t=>Yr(Vr(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!Rr(e.left)&&N(e),e.operator!==`\\cup`||Rr(e.left)&&Rr(e.right)||N(e),e.operator!==`\\cap`||Rr(e.left)?Yr(e.left):Yr(e.right),e.operator===`\\cup`&&Yr(e.right)}},Xr=t=>{if(!Rr(t.left)||!Rr(t.right))throw new e.b(`Attempted to enumerate S \\cup T when S:\n${I(t.left)}\nand T:\n${I(t.right)}\nare not both enumerable`);if(Yr(t.left),Yr(t.right),kt(t.left))throw new e.N(Dt());let n=$r(t.left),r=kt(t.right)?void 0:$r(t.right);if(!r||n.length+r.length>Et())throw new e.N(Dt());return[...n,...r]},Zr=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return N(e).elements;let t=lr(e,()=>Xr(e)),n=N(yr(t)).elements;return e.enumerated=Sn(n),n},Qr=(e,t)=>{if(typeof e!=`object`||kn(e))return N(e).elements.some(t);let n=pi.sets;n?.push(e),Yr(e);let r=ri(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},$r=e=>{let t=[];return Qr(e,e=>(t.push(e),!1)),t},ei=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,ti=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(ti);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(ti)&&e.range.every(ti);case`SetOperation`:return e.operator!==`\\cup`&&ti(e.left)&&ti(e.right);case`FilteredSet`:return ti(e.base);case`ProductSet`:return e.factors.every(ti);default:return!1}},ni=e=>typeof e!=`object`||kn(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?ni(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||ni(e.left)||ni(e.right):ei(e)?.some(ni)??!1,ri=(e,t)=>{if(e.kind===`Union`)return Br(e,$r).some((n,r)=>Qr(Vr(n,r,e),t));if(e.kind===`FilteredSet`&&Rr(e.base))return Qr(e.base,n=>e.test(n,!1)&&t(n));if(ei(e)?.some(ni))return Jr(e,$r).some(t);if(e.kind!==`SetOperation`)return N(e).elements.some(t);if(e.operator===`\\cup`)return!Rr(e.left)||!Rr(e.right)?N(e).elements.some(t):Qr(e.left,t)||Qr(e.right,t);let n=e.operator===`\\`||Rr(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return Rr(r)?Qr(r,n=>gi(n,i)===(e.operator===`\\cap`)&&t(n)):N(e).elements.some(t)},P=t=>{if(typeof t!=`object`||!A(t))throw new e.b(`Shouldn't call isEmpty() on value ${I(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(P);case`RecordSet`:return t.sets.some(P);case`FunctionSet`:return!P(t.domain)&&P(t.range);case`Union`:return Br(t).every((e,n)=>P(Vr(e,n,t)));default:return N(t).elements.length===0}},ii=(t,n,r)=>t.reduce((t,i)=>{let a=t*oi(i,n);if(a>2147483647)throw new e.b(r());return a},1),ai=e=>`Overflow when computing the number of elements in:\n${I(e)}`,oi=(t,n)=>{if(typeof t!=`object`)throw new e.b(`Attempted to compute the number of elements in the ${Pt(t)} ${I(t)}.`);switch(t.kind){case`ModelValue`:throw new e.b(`Attempted to compute the number of elements in the model value ${I(t)}.`);case`Function`:return t.domain.length;case`LazyFunction`:return oi(t.domain,n);case`Interval`:{let n=Math.max(0,t.high-t.low+1);if(n>2147483647)throw new e.b(`Size of interval value exceeds the maximum representable size (32bits): ${t.low}..${t.high}.`);return n}case`InfiniteSet`:case`SequenceSet`:throw new e.b(`Attempted to compute the number of elements in the overridden value ${I(t)}.`);case`Subset`:{let r=oi(t.base,n);if(r>=31)throw new e.b(ai(t));return 2**r}case`FunctionSet`:{if(n!==`1.7.4`){if(P(t.domain))return 1;if(P(t.range))return 0;if(oi(t.range,n)===1)return 1}let r=oi(t.domain,n),i=oi(t.range,n);if(i<=1)return r===0?1:i;let a={value:1};for(let n=0;n<r;n++)if(a.value*=i,a.value>2147483647)throw new e.b(ai(t));return a.value}case`RecordSet`:return n!==`1.7.4`&&P(t)?0:ii(t.sets,n,()=>ai(t));case`ProductSet`:return n!==`1.7.4`&&P(t)?0:ii(t.factors,n,()=>`Overflow when computing the number of elements in ${I(t)}`);default:return Nn(t),N(t).elements.length}},si=e=>`Attempted to check if the set ${I(e)}is finite.`,ci=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)throw new e.b(`Attempted to check if the ${Pt(t)} ${I(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${I(t)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return ci(t.base)&&P(t.base);case`Subset`:return ci(t.base);case`FunctionSet`:{let e=ci(t.domain);if(e&&P(t.domain))return!0;let n=ci(t.range);return n&&P(t.range)?!0:n&&(e||oi(t.range)===1)}case`RecordSet`:case`ProductSet`:{let e=t.kind===`RecordSet`?t.sets:t.factors,n={isAllFinite:!0};for(let t of e)if(!ci(t))n.isAllFinite=!1;else if(P(t))return!0;return n.isAllFinite}case`Union`:if(!Rr(t.base))throw new e.b(`Attempted to check if the nonenumerable set:\n${zr(t)}\nis a finite set.`);return N(t.base).elements.every(ci);case`SetOperation`:if(t.operator===`\\cup`)return ci(t.left)&&ci(t.right);if(t.operator===`\\cap`){if(!ci(t.left)&&!ci(t.right))throw new e.b(si(t));return!0}if(ci(t.left))return!0;if(!ci(t.right))throw new e.b(si(t));return!1;case`FilteredSet`:if(!ci(t.base))throw new e.b(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${I(t.base)}\nis finite.`);return!0}},li=(e,t,n=_n)=>{let r={low:0,high:e.length-1};for(;r.low<=r.high;){let i=r.low+r.high>>1,a=n(e[i],t);if(a===0)return i;a<0?r.low=i+1:r.high=i-1}return-1},ui=(t,n)=>{let r=t.elements;if(r.length>Et())throw new e.N(Dt());let i=Array.from({length:r.length},()=>!1),a=n.filter(e=>{let t=li(r,e);return!i[t]&&(i[t]=!0,!0)}),o=Sn(r);return a.some((e,t)=>e!==r[t])&&(o.writtenElements=a),o},di=t=>{if(typeof t!=`object`||!Mt(t))return;if(t.kind===`LazyFunction`&&(!A(t.domain)||un(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=F(t);return n.domain.every((e,t)=>e===t+1)?n.range:void 0},fi=(e,t)=>{let n=`Attempted to check if the value:\n${I(e)}\nis an element of the`;if(!Mt(t))return`${n} ${Pt(t)} ${I(t)}`;let r=Dn(t);return r===`record`?`Attempted to check if element:\n${I(e)}\nis in the record:\n${I(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${I(t)}`},pi={sets:void 0},mi=(t,n,r,i)=>{let a=pi.sets,o=pi.callStack,s=a?.length??0,c=o&&{...o,length:o.expressions.length};try{return t(r,i)}catch(t){if(!(t instanceof e.b))throw t;return a&&(a.length=s),o&&c&&(o.expressions.length=c.length,o.isFrozen=c.isFrozen,o.fingerprint=c.fingerprint),n(r,i,t)}},hi=e=>(pi.sets??[]).slice(e).some(e=>typeof e==`object`&&pi.callStack?.sources.has(e)===!0),gi=(e,t)=>{let n=pi.sets;if(n===void 0)return xi(e,t);n.push(t);let r=xi(e,t);return n.pop(),r},_i=(e,t)=>{let n=t.elements,r={low:0,high:n.length-1};for(;r.low<=r.high;){let t=r.low+r.high>>1,i=n[t];if(typeof i!=`number`)return;if(i===e)return!0;i<e?r.low=t+1:r.high=t-1}return!1},vi=(e,t)=>li(t.elements,e)!==-1,yi=(e,t)=>t.isNormalized?ur(e,t.elements).isFound:dr(e,fr(t)),bi=(t,n)=>{if(t.type!==void 0)throw new e.b(`Attempted to check if the typed model value ${k(I(t))} is an element of\n${k(I(n))}`);return!1},xi=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return _i(e,t)??Si(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return Si(e,t)},Si=(t,n)=>{if(!A(n))throw new e.b(fi(t,n));switch(n.kind){case`Set`:return Nn(t),mi(vi,yi,t,n);case`MixedSet`:return dr(t,n.elements);case`Interval`:if(typeof t==`number`)return t>=n.low&&t<=n.high;if(n.low<=n.high&&(!j(t)||t.type!==void 0))throw new e.b(`Attempted to check if the value:\n${I(t)}\nis in the integer interval ${I(n)}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(j(t))return bi(t,n);if(!(n.name===`STRING`?typeof t==`string`:typeof t==`number`))throw new e.O(`Attempted to check if the value:\n${I(t)}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof t==`number`&&t>=0;case`Subset`:if(!A(t)||un(t))throw new e.b(`Attempted to check if the non-enumerable value\n${k(I(t))}\nis element of\n${k(I(n))}`);return N(t).elements.every(e=>gi(e,n.base));case`FunctionSet`:{if(!Mt(t)){if(j(t))return bi(t,n);throw new e.b(`Attempted to check if \n${I(t)}\nwhich is not a TLC function value, is in the set of functions:\n${k(I(n))}`)}let r=F(t),i=Vn(t,r.domain);return(i===void 0?hr(n.domain,Sn(r.domain)):hr({kind:`Interval`,low:i,high:i+r.domain.length-1},n.domain))&&r.range.every(e=>gi(e,n.range))}case`RecordSet`:{let r=Mt(t)?F(t):void 0;if(!r||!Ut(r.domain)){if(j(t))return bi(t,n);throw new e.b(`Attempted to check if non-record\n${I(t)}\nis in the set of records:\n${I(n)}`)}return r.domain.length===n.names.length&&n.names.every((e,t)=>{let i=li(r.domain,e);return i!==-1&&gi(r.range[i],n.sets[t])})}case`ProductSet`:{let r=Mt(t)?di(t):void 0;if(r===void 0){let r=Mt(t)&&F(t).domain.every(e=>typeof e==`number`);if(j(t))return bi(t,n);if(r)return!1;throw new e.b(`Attempted to check if non-tuple\n${I(t)}\nis in the set of tuples:\n${I(n)}`)}return r.length===n.factors.length&&r.every((e,t)=>gi(e,n.factors[t]))}case`FilteredSet`:try{return gi(t,n.base)&&n.test(t,!0)}catch(r){throw!(r instanceof e.b)||!rt(r)?r:new e.b(`Cannot decide if element:\n${k(I(t))}\n is element of:\n${k(I(n.base))}\nand satisfies the predicate ${n.source?.predicate}`)}case`Union`:{if(!Rr(n.base))throw new e.b(`Attempted to check if:\n ${I(t)}\nis an element of the non-enumerable set:\n ${zr(n)}`);let r=N(n.base).elements;return r.length>1&&r.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),r.some(e=>gi(t,e))}case`SetOperation`:return n.operator===`\\cup`?gi(t,n.left)||gi(t,n.right):gi(t,n.left)&&gi(t,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=di(t);if(r===void 0){if(j(t))return bi(t,n);throw new e.O(`Attempted to check if the value:\n${k(I(t))}\nis an element of ${k(I(n))}.`)}return r.every(e=>gi(e,n.base))}default:throw new e.b(fi(t,n))}},Ci=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?gi(e,n):e.range.every((e,r)=>Ci(e,t.range[r],n.range)),F=t=>{if(typeof t==`object`&&t.kind===`Function`)return t;if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return t.enumerated;if(M(t.domain)||oi(t.domain),!A(t.domain))throw new e.b(`The domains of formal parameters must be enumerable.`);let n=Nr(t.domain);return t.enumerated=En(wn(n,n.map(e=>t.apply(e))),Dn(t)),t.enumerated}throw new e.b(`Expected a function but found ${I(t)}`)},wi=(e,t,n)=>{let r=k(I(e)),i=k(I(t)),a=n===`1.7.4`;switch(Dn(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},Ti=(e,t)=>{if(!$t.is174)return wi(e,t);let n=k(I(t));return Dn(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Ei=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},Di=t=>new e.b(`Attempted to apply function with integer domain to the non-integer argument ${k(I(t))}`),Oi=(e,t)=>li(e.domain,t),ki=(e,t,n)=>{let r=Rt(e);throw $t.is174||r!==e.domain||r.length<32?r.forEach(e=>sr(e,t)):li(r,t,nr),n},Ai=(t,n,r)=>{let i=t.domain;if(typeof n!=typeof i[0]){let a=Dn(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&&!$t.is174&&typeof n!=`number`&&Mr(i))throw Di(n)}let a=Ei(i,n);return a===-1?mi(Oi,ki,t,n):a},ji=(t,n,r)=>{let i=t.domain,a=di(r),o=(e,n,r)=>`In applying the function\n${k(I(t))},\nthe ${e} is:\n${k(I(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 ${I(r)}, which is not in its domain`);if(n.forEach((t,n)=>{if(n>=a.length)throw s();let r=a[n],c=`argument number ${n+1}`;if(!gi(r,i.factors[n]))throw new e.b(o(c,r,t===void 0?`is not in the function's domain ${I(i)}`:`is not in its domain`));if(t!==void 0&&di(r)?.length!==t)throw new e.b(o(c,r,`does not match its formal parameter`))}),a.length>n.length)throw s()},Mi=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!gi(t,e.lambdaDomain),Ni=(t,n,r)=>{if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return Ni(t.enumerated,n,r);let i=t.boundTupleLengths;if(i!==void 0)return ji(t,i,n),t.apply(n);if(!gi(n,t.domain))throw new e.b(Dn(t)===`lambda`?wi(t,n):`Attempted to apply a function to ${I(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 ${I(t)}, which is not a function`);let i=r??wi;if(Mi(t,n))throw new e.b(i(t,n));let a=Ai(t,n,i);if(a===-1)throw new e.b(i(t,n));return t.range[a]},Pi=e=>Mr(e)?kr.get(e)??Pr(e.length):void 0,Fi=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=F(e);if(t.functionClass===`lambda`&&t.lambdaDomain)return t.lambdaDomain;let n=Pi(t.domain);if(n)return n;let r=Sn(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},Ii=(t,n,r,i=!1)=>{if(typeof t==`object`&&t.kind===`LazyFunction`&&(i||t.enumerated===void 0)){if(!gi(n,t.domain))return t;let e=r(t.apply(n));return En({kind:`LazyFunction`,domain:t.domain,apply:r=>hr(n,r)?e:t.apply(r),source:t.source,boundTupleLengths:t.boundTupleLengths},Dn(t))}if(!Mt(t))throw new e.b(`Attempted to apply EXCEPT construct to the value ${k(I(t))}.`);let a=F(t);if(Mi(a,n))return a;let o=Ai(a,n,Ti);if(o===-1)return a;let s=[...a.range],c=a.range[o],l=r(c);s[o]=l;let u=En(wn(a.domain,s),Dn(a));if(u.writtenKeys=a.writtenKeys,u.lambdaDomain=a.lambdaDomain,a.hash!==0&&a.hash!==Hi){let e=qi(l);if(e!==Hi){let t=qi(a.domain[o]);u.hash=c===l?a.hash:a.hash-Vi(t,qi(c))+Vi(t,e)|0}}if(a.fingerprint!==0){let e=a.domain[o];u.fingerprint=c===l?a.fingerprint:a.fingerprint-Zi(e,c)+Zi(e,l)|0}return u},Li=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Ri=(e,t)=>Math.imul(e^t,16777619),zi=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Li(t)},Bi=e=>Li(e+2654435769|0),Vi=(e,t)=>Li(Math.imul(e,668265261)+t|0),Hi=795548749,Ui=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=qi(t[e]);if(r===Hi)return Hi;n=n+Bi(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=qi(e.domain[n]),i=qi(e.range[n]);if(r===Hi||i===Hi)return Hi;t=t+Vi(r,i)|0}return t},Wi=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)return;if(t.kind===`InfiniteSet`||t.kind===`SequenceSet`)throw new e.b(`TLC has found a state in which the value of a variable contains ${I(t)}`);if(A(t)){N(t).elements.forEach(Wi);return}let n=F(t);n.domain.forEach(Wi),n.range.forEach(Wi)},Gi=t=>{if(typeof t==`object`&&t.kind!==`ModelValue`)try{qi(t)===Hi&&Wi(t);return}catch(t){if(!(t instanceof e.b))throw t;return t}},Ki=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},qi=e=>typeof e==`number`?Li(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?zi(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=Ui(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?M(e.domain)?qi(F(e)):Hi:M(e)?qi(N(e)):Hi,Ji=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Yi=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Ji(t)},Xi=e=>Ji($i(e)+2135587861|0),Zi=(e,t)=>Ji(Math.imul($i(e),374761393)+$i(t)|0),Qi=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Xi(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Zi(e.domain[n],e.range[n])|0;return t},$i=e=>typeof e==`number`?Ji(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?Yi(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Qi(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?$i(F(e)):M(e)?$i(N(e)):Yi(ea(e)),ea=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):ta(e),ta=t=>{if(t.kind===`ModelValue`)return`@${t.name}`;if(t.kind===`InfiniteSet`)return`<${t.name}>`;if(t.kind===`SequenceSet`)return`<Seq ${ea(t.base)}>`;if(t.kind===`FilteredSet`&&!M(t))throw new e.b(`Attempted to compare the non-enumerable set ${I(t)} with another value`);if(A(t))return M(t)?`{${N(t).elements.map(ea).join(`,`)}}`:`<${t.kind} ${I(t)}>`;let n=F(t);return`(${n.domain.map((e,t)=>`${ea(e)}:${ea(n.range[t])}`).join(`,`)})`},na={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},ra=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>na[e])}"`,ia=1999,aa=e=>e.reduce((e,t)=>e===0?0:e*oi(t),1),oa=e=>{if(e.kind===`Subset`)return oi(e.base)<=6?N(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return N(e);if(e.kind===`FunctionSet`){let t=P(e.domain)?0:oi(e.domain);return(t===0?1:oi(e.range)**t)<=ia?N(e):void 0}return aa(e.kind===`RecordSet`?e.sets:e.factors)<=ia?N(e):void 0},sa=(t,n)=>{if(n||t.kind===`Union`||t.kind===`Subset`&&Mt(t.base)&&(t.base.kind===`Function`||M(t.base.domain)))return oa(t);if(M(t))try{return oa(t)}catch(t){if(t instanceof e.b)return;throw t}},ca=(e,t)=>{let n=e=>I(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return zr(e,t)}},la=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),ua=t=>{if(M(t.domain))try{return F(t)}catch(t){if(t instanceof e.b||e.et(t))return;throw t}},da=e=>{let t=[],n=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:if(e.elements.forEach(n),e.isNormalized)return;e.isNormalized=!0,t.push(e);return;case`MixedSet`:e.elements.forEach(n),N(e);return;case`Function`:e.range.forEach(n);return;case`LazyFunction`:n(e.enumerated??e.domain);return;case`SetOperation`:n(e.left),n(e.right);return;case`FunctionSet`:n(e.domain),n(e.range);return;case`RecordSet`:e.sets.forEach(n);return;case`ProductSet`:e.factors.forEach(n);return;case`Subset`:case`Union`:case`FilteredSet`:case`SequenceSet`:n(e.base);return;default:return}};try{return e.forEach(n),e.map(e=>I(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1})}},I=(e,t=!1,n=!1)=>{let r=e=>I(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return ra(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(N(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=en.isExpanded?sa(e,t):void 0;return n?r(n):ca(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?en.isExpanded||!e.source?ua(e):void 0:e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${I(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&$t.is174&&Dn(e)!==`tuple`)return`<< >>`;let a=r=>I(r,t,n&&Dn(e)!==`lambda`);if(i.domain.length===0&&Dn(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]]):Bt(i);return Dn(e)===`record`||i.domain.every(e=>typeof e==`string`&&la(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},fa=(t,n)=>{if(t===void 0)return!1;try{return Fn(t,n)}catch(t){if(t instanceof e.b)return!1;throw t}},pa=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,ma=e=>Array.from({length:e.length},(t,n)=>e.charCodeAt(n)).reduce((e,t)=>Math.imul(e,31)+t|0,0),ha=(e,t)=>{let n={next:0,last:-1},r={value:!0},i=e.replace(pa,(e,i,a=``,o,s,c=``)=>{let l=e=>a.includes(`-`)?e.padEnd(Number(o)):e.padStart(Number(o??0)),u=a.includes(`<`),d=a.replace(`<`,``);if(c===`n`&&e===`%n`)return`
74
+ `;if(c===`%`&&s===void 0&&/^-?$/.test(d))return d===`-`&&o===void 0&&(r.value=!1),l(`%`);let f=u?n.last:i===void 0?n.next++:Number(i.slice(0,-1))-1;n.last=f;let p=t[f];if(!`sSbBhH`.includes(c)||c===``||!/^-?$/.test(d)||d===`-`&&o===void 0||p===void 0)return r.value=!1,e;let m=c.toLowerCase(),h=m===`s`?p:m===`b`?`true`:(ma(p)>>>0).toString(16),g=l(s===void 0?h:h.slice(0,Number(s.slice(1))));return c===m?g:g.toUpperCase()});return r.value?i:void 0},ga=(t,n)=>{let r=n?void 0:nn.get(t);if(r)return r();let i=Object.entries(t),a=an.get(t),o=a!==void 0&&`_format`in t,s=o?t._format:i.length===1?`%s = %s
75
75
  `:`/\\ %s = %s
76
- `;if(typeof s!=`string`)throw new e.g(`The _format field of the ALIAS ${a} is ${L(s)}, but it must be a string.`);return i.filter(([e])=>!(o&&e===`_format`)).filter(([e,t])=>!n||!da(n[e],t)).map(([t,n])=>{let r=ma(s,[t,A(L(n))]);if(r===void 0)throw new e.g(`The _format field of the ALIAS ${a} is ${L(s)}, but it must format two strings, the name and the value of a field.`);return r}).join(``)},ga=[10454148508367108822n,15747411856486957441n,13848313129918172575n,15427004735118145554n,14338780731064426356n,15931650522396165332n,17670238537108149059n,12816660938095048951n,13192168525635896882n,16119298732711755075n,13564417994159519395n,15831473429641889162n,17671735485712653535n,14582471876431321160n,9288673424107444897n,12345523232675890545n,13774063780198914517n,10636128657019767374n,13227535641082688945n,10085966873248490402n,17056045221983369811n,18027133543548002442n,13033986364717636900n,12663388180492401538n,11007194744055901935n,16251515628090973732n,18046429724439772544n,9876734796024595817n,14949643787442512870n,16960057143726945461n,10590203213448744021n,12248592797044284137n,9558805810925624286n,16993321702164258530n,11754329512098378960n,12074934892440206921n,15696745233288286746n,10531590977001201739n,18107999685377398317n,12149369488538049728n,12923655455904407421n,10507099144397364930n,17322088528956367024n,14653973644796244054n,15165509594857513400n,13554280709034297251n,16228911470502883382n,17115369786458865383n,11179220607102683830n,16708422618246866334n,12295941796329322556n,18336630348474106240n,13989616001589685348n,14822072159597151759n,14264172520427195041n,11642530518213145397n,11877331515501935358n,13913116192159715440n,17054474839259161580n,13461230878584418056n,16058025410470398786n,11100471369705097435n,11133782763824505275n,13192312712502684421n,17456091706045076157n,13237272598629075916n,12914531898895761383n,15801841604014567326n,16446055517513626294n,16780923767715884464n,15104658705803254918n,10882049990920163451n,12728112724252049190n,11720209067562733740n,16476221075563830086n,16602801460297162326n,16206898064012585915n,12158475401238648099n,13742285336487677729n,15543703592025073839n,9615783578189153721n,16710542608962839044n,11960730242263336692n,13328718558362718101n,12971616006464047952n,17057853503483465676n,16180230282101315295n,15483523553568578902n,17773465781871025571n,18047252642493037509n,11580640560664688668n,10121963531818974651n,14218267149826330657n,12715294421139777506n,10584764766358778171n,12666843443693621286n,17403948736867619210n,17907955559063099692n,15179434392748515198n,15413469521140985247n,13455040338347572751n,15419348191054617477n,12340568220039846914n,13236419189535069162n,18074463254581147189n,10818750974828329405n,9859349269386152082n,15035006154709018396n,13627907273947709876n,9549035931546940138n,16199589727945564820n,10285831968679942330n,17737018494601061698n,15477896647372134857n,13595764249822586512n,10556855812148546550n,12421897615105552821n,15477767459253848096n,17421607461439241175n,12409061346569762725n,13621778224251023638n,10680972825126675886n,16494492050207190715n,16801324317763555620n,12664650400804916358n,16134230614391269483n,10027806175083075147n,9259037851175017999n,11803214621941906429n,9537357587847606069n,10517495000576890277n];let _a=ga[0];const va=()=>_a,ya=/* @__PURE__ */ new Int32Array(256),ba=/* @__PURE__ */ new Int32Array(256),xa=/* @__PURE__ */ new Int32Array(256),Sa=/* @__PURE__ */ new Int32Array(256),Ca=/* @__PURE__ */ new Int32Array(256),wa=/* @__PURE__ */ new Int32Array(256),Ta=/* @__PURE__ */ new Int32Array(256),Ea=/* @__PURE__ */ new Int32Array(256);let Da=0,Oa=0,ka=0,Aa=0;const ja=e=>{let t=(e^Aa)&255;Aa=(Aa>>>8|ka<<24)^Ca[t],ka=ka>>>8^ya[t]},Ma=e=>{let t=ga[e];_a=t;let n=[];for(let e=1n<<63n;n.length<72;)n.push(e),e=e>>1n^((e&1n)==0n?0n:t);let r=n.slice(64,72).reverse();for(let e=0;e<256;e++){let t=r.reduce((t,n,r)=>e>>r&1?t^n:t,0n);ya[e]=Number(BigInt.asIntN(32,t>>32n)),Ca[e]=Number(BigInt.asIntN(32,t))}let i=[ya,ba,xa,Sa],a=[Ca,wa,Ta,Ea];for(let e=1;e<4;e++){let t=i[e-1],n=a[e-1];for(let r=0;r<256;r++){let o=n[r]&255;a[e][r]=(n[r]>>>8|t[r]<<24)^Ca[o],i[e][r]=t[r]>>>8^ya[o]}}Da=Number(BigInt.asIntN(32,t>>32n)),Oa=Number(BigInt.asIntN(32,t))};Ma(0);const Na=e=>{let t=Aa^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;Aa=ka^Ea[n]^Ta[r]^wa[i]^Ca[a],ka=Sa[n]^xa[r]^ba[i]^ya[a]},Pa=e=>{if(typeof e==`boolean`)return ja(0),ja(e?116:102),2;if(typeof e==`number`)return ja(1),Na(e),5;if(typeof e==`string`){ja(3),Na(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)Na(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)ja(e.charCodeAt(n));return 5+e.length}return ja(21),Na(sn(e.name)+1),5},Fa=e=>{if(typeof e!=`object`||M(e))Pa(e);else if(jt(e)){let t=I(e);ja(9),Na(t.domain.length);for(let e=0;e<t.domain.length;e++)Fa(t.domain[e]),Fa(t.range[e])}else{let t=P(e).elements;ja(5),Na(t.length);for(let e of t)Fa(e)}},Ia=e=>{let t=ka,n=Aa;ka=Da,Aa=Oa;for(let t of e)Fa(t);let r=BigInt(ka>>>0)<<32n|BigInt(Aa>>>0);return ka=t,Aa=n,r},La=(e,t)=>{let n=new BigInt64Array(e.length),r=new Int32Array(n.buffer),i=ka,a=Aa;return e.forEach((e,n)=>{ka=Da,Aa=Oa;for(let n of t)Fa(e[n]);r[2*n]=Aa,r[2*n+1]=ka}),ka=i,Aa=a,n},Ra=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),za=1024,Ba=e=>({current:-1,expressions:[],ranges:[],firstChild:[],lastChild:[],nextSibling:[],prefixes:[],isPart:[],isPrimed:[],isUnchanged:[],recursive:[],lets:[],roots:[],primary:[],secondary:[],covered:/* @__PURE__ */ new WeakSet,values:/* @__PURE__ */ new WeakMap,registers:new Uint8Array(e*za),relations:[]}),Va=(e,t,n,r,i)=>{let a=e.expressions.length;if(e.expressions.push(t),e.ranges.push(n),e.firstChild.push(-1),e.lastChild.push(-1),e.nextSibling.push(-1),e.prefixes.push(-1),e.isPart.push(i),e.isPrimed.push(!1),e.isUnchanged.push(t?.kind===`Unchanged`),e.recursive.push(-1),e.lets.push(void 0),e.roots.push(r===-1?a:e.roots[r]),e.primary.push(0),e.secondary.push(0),t&&e.covered.add(t),r===-1)return a;let o=e.lastChild[r];return o===-1&&(e.firstChild[r]=a),o!==-1&&(e.nextSibling[o]=a),e.lastChild[r]=a,a},Ha=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,Ua=(e,t,n,r,i)=>{let a=t===`next`?Ha(e,t,r):void 0;if(a!==void 0)return a;let o=Va(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},Wa=(e,t)=>e!==void 0&&t!==void 0&&e.module===t.module&&e.start.line===t.start.line&&e.start.column===t.start.column&&e.end.line===t.end.line&&e.end.column===t.end.column,Ga=(t,n,r)=>{let i=t===void 0?void 0:r.definitions.get(t),a=i?.kind===`Operator`?i.head:void 0,o=n.location.range;return!i||!a?`Action ${o?e.X(o):`Unknown location`}`:Wa(i.body.location.range,o)||!o?`${i.name} ${e.X(a)}`:`${i.name} ${e.X(a)} (${o.start.line} ${o.start.column} ${o.end.line} ${o.end.column})`},Ka=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,qa=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,Ja=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},Ya=e=>Array.from({length:e.length},(t,n)=>e.charCodeAt(n)).reduce((e,t)=>Math.imul(e,31)+t|0,0)&2147483647,Xa=e=>{let t=Array.from({length:11},()=>[]);return e.forEach((e,n)=>{if(n>=Math.floor(t.length*.75)){let e=Array.from({length:t.length*2+1},()=>[]);for(let n=t.length-1;n>=0;n--)t[n].forEach(t=>e[Ya(t.name)%e.length].unshift(t));t=e}t[Ya(e.name)%t.length].unshift(e)}),t.toReversed().flat()},Za=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),Qa=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),$a=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),eo=(e,t,n)=>{let r=new Set(n.map(Ka)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(O(e)){for(let e=r;e;e=e.parent)if(e.name===n)return e.definition&&{definition:e.definition,scope:e.scope};return}let i=t.substitutions.get(n)??n;if(t.variableIndex.has(i)||t.constants.has(i))return;let a=t.definitions.get(i),o=a?.location.range?.module??a?.body.location.range?.module;return a&&!Ra.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=Va(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(Ka(n));let d=t&&s.get(t);if(d&&i.forEach(t=>{e.expressions[t]===d&&(e.lets[t]??=[]).push(u)}),l?.kind===`Operator`&&l.isRecursive){let t=i.findLast(e=>a[e]===l);t!==void 0&&(e.recursive[u]=t)}return a[u]=l,i.push(u),o(),i.pop(),u},u=e=>{let t=e.definition;if(o.includes(t))return;o.push(t);let n=t.kind===`Function`?$a(t.bounds):t.params.map(e=>e.name);m(t.body,Qa(n,e.scope)),t.kind===`Function`&&Za(t.bounds).forEach(t=>m(t,e.scope)),o.pop()},d=e=>e?.definition.kind===`Operator`&&e.definition.params.length>0,f=(e,t,n,r)=>{if(e.kind===`Lambda`)m(e.body,Qa(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:m(e.body,Qa(e.params,t));return;case`Lambda`:m(e.body,Qa(e.params,t));return;case`Let`:{let n=e.definitions.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),Xa(e.definitions).forEach(e=>u({definition:e,scope:n})),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,qa(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,Ja(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,qa(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,Qa($a(e.bounds),t)),r(Za(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,Qa($a(e.bounds),t)),r(Za(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,Qa($a([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,Qa(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,Qa(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}};e.relations.forEach(e=>{i.push(e.node),m(e.expression,void 0),i.pop()})},to=(e,t,n)=>{for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r]){if(e.expressions[r]===n)return r;if(e.isPart[r]){let t=to(e,r,n);if(t!==-1)return t}}return-1},no=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=to(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:to(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},ro=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},io=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},ao=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},oo=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},so=(e,t)=>t.forEach((t,n)=>{let r=Ia([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*za+i;e.registers[o]=Math.max(e.registers[o],oo(a)+1)}),co=(e,t)=>{let n=e.registers.subarray(t*za,(t+1)*za),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*za*za/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*za?a===0?i:za*Math.log(za/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},lo=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},uo=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>lo(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},fo=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},po=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],mo=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},ho=(e,t)=>{let n=e.primary[t.node],r=e.secondary[t.node];return t.kind===`init`?{distinct:n,generated:n+r}:t.kind===`next`?{distinct:r,generated:n}:t.kind===`constraint`?{distinct:r,generated:n+r}:{distinct:0,generated:0}},go=(t,n)=>{let r=[],i=/* @__PURE__ */ new Map,a=e=>{let n=[],r={primary:t.primary[e],secondary:t.secondary[e]};return(r.primary>0||r.secondary>0||po(t,e))&&fo(n,r),mo(t,e).forEach(e=>a(e).forEach(e=>fo(n,e))),i.set(e,n),n},o=(n,i,a,o)=>{let s=t.ranges[n];r.push({location:s?e.X(s):`Unknown location`,depth:i,count:a,cost:o})},s=(e,n)=>o(e,n,t.primary[e],t.secondary[e]),c=(e,n)=>{let r=mo(t,e),l=[];r.forEach(e=>(i.get(e)??a(e)).forEach(e=>fo(l,e)));let u={primary:t.primary[e],secondary:t.secondary[e]},d=po(t,e),f=e=>r.forEach(t=>c(t,e));if(t.isUnchanged[e]){let t=l.filter(e=>e.primary!==0||e.secondary!==0);t.length===0?s(e,n):o(e,n,Math.max(u.primary,uo(t).primary),0);return}if(l.length===0){(u.primary!==0||d)&&s(e,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let t=l[0],r=t.primary===0&&t.secondary===0;if(t.primary<u.primary){s(e,n),f(n+1);return}if(!d&&p&&!r){o(e,n,t.primary,t.secondary);return}if(p&&r){d&&s(e,n),f(d?n+1:n);return}if(u.primary===t.primary&&u.secondary===t.secondary){s(e,n);return}}let m=!p||d;m&&s(e,n),f(m?n+1:n)};return mo(t,n).forEach(e=>{a(e),c(e,0)}),r},_o=[`init`,`next`,`invariant`,`constraint`,`implied`],vo=(e,t)=>!e||!t?e?1:t?-1:0:e.module===t.module?e.start.line-t.start.line||e.start.column-t.start.column||e.end.line-t.end.line||e.end.column-t.end.column:e.module<t.module?-1:1,yo=e=>_o.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>vo(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||vo(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),bo=(t,n,r,i)=>({variables:i.map(i=>{let a=r[i]?.range;return{label:`${n.variables[i]} ${a?e.X(a):`Unknown location`}`,distinct:co(t,i)}}),relations:yo(t).map(e=>({kind:e.kind,label:e.label,...ho(t,e),expressions:go(t,e.node)}))}),xo=(e,t,n)=>{let r=Ha(e,t,n);if(r===void 0)return;let i=e.primary[r],a=e.secondary[r];if(t===`init`)return[[`generated`,i+a],[`distinct`,i]];if(t===`next`)return[[`generated`,i],[`distinct`,a]];let o=e.firstChild[r];return[[`count`,o===-1?i:e.primary[o]]]},So=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),Co=(t,n)=>So.has(t)?new e.b(n):new e.O(n),wo=(t,n,r,i)=>new e.O(`The ${t} argument of ${n} should be a ${r}, but instead it is:\n${L(i)}`),To=(t,n,r=t)=>{if(!j(t)||ln(t))throw new e.O(`Applying ${n} to the following value,\nwhich is not a finite set:\n${L(r)}`);return P(t)},Eo=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||Eo(r))throw Co(n,`${n} expects a value as argument ${t+1}`);return r},Do=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw Co(n,`${n} expects a boolean but received ${L(r)}`);return r},Oo=(e,t,n)=>{let r=e[t];if(r===void 0||!Eo(r))throw Co(n,`${n} expects an operator as argument ${t+1}`);return r},ko=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),z=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),Ao=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),jo=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),Mo=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),No=e=>e>2147483647||e<-2147483648,Po=t=>new e.O(`Overflow when computing ${t}`),Fo={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},Io={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Lo={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},Ro={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},zo=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Io[e.operator];if(e.kind!==`Function`)return Fo[e.kind];let t=En(e);return t===void 0?`FcnRcdValue`:Ro[t]},Bo=e=>Lo[zo(e)],Vo=(e,t)=>`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`,Ho=(t,n)=>new e.b(Vo(t,n)),Uo=(t,n)=>{let r=r=>(...i)=>{let a=fi.sets?.length??0;try{return r(...i)}catch(r){if(!(r instanceof e.b)||r instanceof e.v)throw r;let i=mi(a);throw fi.sets&&(fi.sets.length=a),t.isLazy!==!0&&r instanceof e.O&&!i?r:t.isLazy!==!0&&r instanceof e.k?new e.O(Vo(n,r.message)):Ho(n,r.message)}},i=r(t.evaluate);return{...t,evaluate:(e,r)=>{if(e.length!==t.arity)throw Ho(n,`array is not of length ${t.arity}`);return i(e,r)},evaluateUnary:t.evaluateUnary&&r(t.evaluateUnary),evaluateBinary:t.evaluateBinary&&r(t.evaluateBinary)}},Wo=(e,t)=>{if(typeof e!=`number`)throw Ho(t,`Cannot cast tlc2.value.impl.${zo(e)} to tlc2.value.impl.IntValue`);return e},Go=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Ko=(e,t,n,r)=>{let i=Go(e,n,`IntValue`,2);return Mo(t,(e,n)=>{let a=Wo(n,i),o=Wo(e,i),s=r(o,a);if(No(s))throw Po(`${o}${t}${a}`);return s})},qo=(t,n,r)=>{if(typeof t!=`number`)throw new e.O(`The ${n} argument of ${r} should be an integer, but instead it is:\n${L(t)}`);return t},Jo=(e,t,n=e)=>Mo(e,(e,r)=>t(qo(e,`first`,n),qo(r,`second`,n))),Yo=(e,t,n)=>({...jo(e,t,n),isLazy:!0}),Xo=(e,t,n)=>{let r=Oo(e,t,n);return()=>r.call([])},Zo=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),Qo=()=>({implication:wh,negate:Th,equivalent:Eh,body:Dh,condition:(e,t)=>{if(typeof e!=`boolean`)throw sh(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw ch(t,n,e);return e},apply:Mi,expectFunction:bh,tuple:Pr,set:vr,record:Ir,writtenRecord:Bt,equal:Pn,enumerate:Ph,choiceElements:a_,noChoice:e=>{throw o_(e)},filterPredicate:i_,isReducible:At,finiteElements:e=>P(e).elements,addBounded:Dt,normalizedSet:Sn,isBeyondBound:Ot,cardinality:ai,functionDomain:Mr,sortedFunction:Cn,unassigned:(e,t)=>{throw hh(e,t)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:xh,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>vh(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let $o,es;const ts=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},ns=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),rs=e=>`local${e.counter++}`,is=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),Be(e).forEach(e=>is(e,t)),t),as=(e,t,n)=>{let r=is(t),i=[...n.locals].filter(([e])=>r.has(e));if(i.length===0)return n.context;let a=ns(e,i.map(([e])=>e));return`extend(${n.context}, ${a}, [${i.map(([,e])=>e).join(`, `)}])`},os=(e,t,n)=>`${ns(e,U(t,e.environment))}(${as(e,t,n)})`,ss=(e,t,n)=>{let r=`helper${e.counter++}`,i=[...t.locals.values()],a={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(t.locals)},o=i.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${r}(context, state, next${o}) { let primed; let applied; ${n(a)} }`),`${r}(${t.context}, ${t.state}, ${t.isPrimed?`undefined`:t.next}${o})`},cs=(e,t,n,r)=>{let i=rs(e),a=rs(e),o=rs(e);return`for (let ${i} = 0, ${a} = ${t}.low, ${o} = ${a} === undefined ? ${t}.length : ${t}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${t}[${i}] : ${a} + ${i}; ${r} }`},ls=(e,t,n)=>{let r=t.kind===`Forall`;return ss(e,n,n=>{let i=t.bounds.map(()=>rs(e)),a=t.bounds.map((r,a)=>a>0&&t.bounds[a-1].set===r.set?`const ${i[a]} = ${i[a-1]};`:`const ${i[a]} = enumerate(${gs(e,r.set,n)}, ${ns(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=rs(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${gs(e,t.body,n)}, ${ns(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>cs(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},us=(e,t,n,r,i)=>ss(e,i,i=>{let a=rs(e),o=rs(e),s=ns(e,t),c=`choiceElements(${gs(e,n,i)}, ${s}, ${ns(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${gs(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${cs(e,a,o,l)} return noChoice(${s});`}),ds=(e,t,n,r)=>ss(e,r,r=>{let i=rs(e),a=rs(e),o=rs(e),s=rs(e),c=ns(e,t),l=`if (!isReducible(${i})) return ${ns(e,r_(t,e.environment))}(${i}, ${as(e,t,r)});`,u=gs(e,t.bound.set,r);r.locals.set(n,s);let d=`if (filterPredicate(${gs(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${cs(e,a,s,d)} return normalizedSet(${o});`}),fs=(e,t,n,r)=>ss(e,r,r=>{let i=rs(e),a=rs(e),o=rs(e),s=rs(e),c=rs(e),l=rs(e),u=ns(e,e_(t,e.environment)),d=as(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=gs(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${gs(e,t.body,r)}; if (!${a}) ${s}.push(${l});`;return`const ${i} = ${p}; ${f} const ${a} = isBeyondBound(${i}); const ${o} = ${a} ? ${i} : functionDomain(${i}); if (${a}) cardinality(${i}); const ${s} = []; ${cs(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),ps=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=gs(e,r[0],n),a=gs(e,r[1],n),o=ns(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${gs(e,r[0],n)}, ${ns(e,t)})`;if(t.operator===`<=>`)return`equivalent(${gs(e,r[0],n)}, ${gs(e,r[1],n)}, ${ns(e,t)})`;if(O(t))return os(e,t,n);let i=sg(t.operator,e.environment);if(i?.kind!==`Builtin`)return os(e,t,n);if(i.name===`DOMAIN`)return`${ns(e,dh(t))}(${gs(e,r[0],n)})`;if(i.name===`TLCEval`)return os(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${ns(e,fh(t,i))}(${gs(e,r[0],n)}, ${gs(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Bg(r[0],a))return`${ns(e,i.evaluateUnary)}(${gs(e,r[0],n)})`;let o=r.length===2&&Bg(r[0],a)&&Bg(r[1],a);return i.evaluateBinary&&o?`${ns(e,i.evaluateBinary)}(${gs(e,r[0],n)}, ${gs(e,r[1],n)})`:os(e,t,n)},ms=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(O(e))return!1;let r=vg(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return ms(e.expression,t,n);case`FieldAccess`:return ms(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>ms(e,t,n));default:return!1}},hs=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return hs(e.record);case`FunctionApplication`:return[e.function,...e.args].every(hs);default:return!1}},gs=(e,t,n)=>{let r=(t,r=n)=>gs(e,t,r);switch(t.kind){case`Number`:return Pt(t.value)?String(t.value):os(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(O(t))return os(e,t,n);let i=vg(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=ns(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?ns(e,i.value):os(e,t,n)}case`Apply`:return ps(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=ns(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${ns(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Yg(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${ms(t.function,n,e.environment)?r(t.function):hs(t.function)?r(t.function,i):os(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${ns(e,t)}))`,o=uh(e.environment.runtime.version),s=o?`, ${ns(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${ns(e,lh(t))}(${r(t.record)})`;case`Record`:{let i=c_(t.fields);if(l_(i))return os(e,t,n);let a=ns(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${ns(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:return n.isPrimed?os(e,t,n):r(t.expression,{context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals});case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?ls(e,t,n):os(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?us(e,t,t.set,t.pattern.name,n):os(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!$g(t)?fs(e,t,r.pattern.name,n):os(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?ds(e,t,t.bound.pattern.name,n):os(e,t,n);default:return os(e,t,n)}},_s=(e,t)=>{if(!Zo.has(e.kind)||(es??=ts(),!es))return;let n={environment:t,references:[],helpers:[],counter:0},r=gs(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
77
- `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return $o??=Qo(),Function(...Object.keys($o),...i,a)(...Object.values($o),...n.references)},vs={kind:`Local`},ys=/* @__PURE__ */ new WeakSet,bs=/* @__PURE__ */ new WeakMap,xs=/* @__PURE__ */ new WeakMap,Ss=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Cs=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),ws=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Ts=e=>e.kind===`Operator`?e.params.length:0,Es=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Ds=e=>e.name.includes(`!`),Os=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},ks=(e,t,n)=>{let r=t.bindings.get(e);return r&&ws(r.position,t.location)&&(!n||ws(r.position,n.start))?r:void 0},As=(t,n)=>t!==void 0&&n!==void 0&&e.X(t)===e.X(n),js=(t,n,r,i)=>{if(n===void 0)return!0;if(As(n.range,r.range))return!1;let a=r.range;if(a===void 0||i.isGenerated||n.kind!==`Builtin`&&!n.range)return!0;let o=e.X(a),s=n.range&&e.X(n.range);return n.kind===`Builtin`?i.errors.push({location:o,message:`Symbol ${t} is a built-in operator, and cannot be redefined.`}):r.kind===`Parameter`||n.kind!==r.kind||n.arity!==r.arity?i.errors.push({location:o,message:`Multiply-defined symbol '${t}': this definition or declaration conflicts \nwith the one at ${s}.`}):i.warnings.push({location:o,message:`Multiple declarations or definitions for symbol ${t}. \nThis duplicates the one at ${s}.`}),!1},Ms=(e,t,n,r)=>js(t,Os(e,t)??ks(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Ns=(e,t,n)=>{js(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Ps=(e,t,n,r)=>t.reduce((e,t,i)=>Ms(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Fs=(e,t,n)=>t.reduce((e,t)=>Ms(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Is=e=>e.kind===`Name`?[e.name]:e.names,Ls=e=>e.flatMap(e=>Is(e.pattern)),Rs=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||ws(n.location,t.location))?n:void 0},zs=(e,t)=>{let n=Rs(e,t);return n?{key:t.getKey(n),arity:Ts(n),params:Es(n),kind:`Definition`}:t.imported.get(e)},Bs=(e,t,n)=>Os(t,e)??zs(e,n),Vs=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Hs=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Vs(e.location,e.spelling??t)},Us=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return ws(e.location,e.args[0].location)?`prefix`:`postfix`}},Ws=e=>!/^[\p{L}\d_]/u.test(e),Gs=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Ks=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,qs=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},Js=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?qs(e.name,[],void 0):qs(e.operator,e.args,e.argumentCounts),Ys=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Xs=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Ls(e.bounds),body:e.body,sets:Ys(e.bounds)};case`SetMap`:return{names:Ls(e.bounds),body:e.expression,sets:Ys(e.bounds)};case`SetFilter`:return{names:Is(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Is(e.pattern),body:e.body,sets:e.set?[e.set]:[]};case`UnboundedQuantifier`:case`Lambda`:return{names:e.kind===`Lambda`?e.params:e.names,body:e.body,sets:[]};default:return}},Zs=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},Qs=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,$s=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),ec=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?ec(e.body,t):Be(e).reduce((e,n)=>e??ec(n,t),void 0)},tc=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??tc(i,t,n||$s(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&ec(e.set,t):ec(e,t)},nc=e=>e.kind===`Label`?nc(e.body):e,rc=e=>typeof e==`number`?`argument selector ${e}`:e,ic=`within the scope of a declaration
78
- from outside that declaration's scope.`,ac=(t,n,r,i,a,o)=>{let s=(n,r)=>{let i=(n===void 0?void 0:t.selectorRanges?.[n])??t.location.range;i&&a.errors.push({location:e.X(i),message:r})},c=r.isSuffices===r.isInProof,l=r.statement,u={node:l,isGoal:!0,isSufficesOpen:r.isSuffices};for(let[e,t]of n.slice(1).entries()){let r=e+1,o=u.node;if(t.kind===`Name`){if(n[r-1].kind!==`Name`)return o.kind!==`NewSymbol`&&o.kind!==`AssumeProve`&&nc(o).kind===`Let`?void 0:s(r-1,`A name selector here must be from a LET clause.`);let e=l.kind===`AssumeProve`?[...l.assumptions,l.conclusion]:[l],i=r===1?e.map((e,n)=>({position:n,label:tc(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:o.kind===`Label`?ec(o.body,t.name):void 0};if(!i?.label)return s(r,`Cannot find label \`${t.name}'.`);if(r===1&&l.kind===`AssumeProve`&&$s(l,i.position)&&c)return s(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${ic}`);if(t.args.length!==i.label.params.length)return s(r,`Label \`${t.name}' used with wrong number of arguments.`);u.node=i.label,u.isGoal=!1,u.isSufficesOpen=!1;continue}if(t.kind!==`Operand`)return;let d=rc(t.operand);if(u.isSufficesOpen){if(Ks(t.operand,1)!==0)return s(r,o.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);u.isSufficesOpen=!1;continue}if(o.kind===`NewSymbol`)return;if(o.kind!==`AssumeProve`){let e=nc(o);if([`Number`,`Decimal`,`String`].includes(e.kind))return s(r,`Selecting subexpression of expression that has none.`);let n=e.kind===`Identifier`?Bs(e.name,i,a)?.kind:void 0;if(n===`Variable`||n?.startsWith(`New`))return s(r,`Choosing operand \`${d}' of subexpression with no operands.`);let c=Xs(e)?.sets,l=e.kind===`Identifier`?[]:c?c.length>0?c:void 0:e.kind===`Except`?void 0:Zs(e);if(!l)return;let f=Ks(t.operand,l.length);if(f===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);u.node=l[f],u.isGoal=!1;continue}let f=[...o.assumptions,o.conclusion],p=Ks(t.operand,f.length);if(p===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);if($s(o,p)&&(!u.isGoal||c))return s(r,`Accessing ASSUME/PROVE clause ${ic}`);let m=f[p];if(m.kind===`NewSymbol`&&r!==n.length-1)return s(r,`Selected a subexpression of a NEW clause of an ASSUME.`);u.node=m,u.isGoal=!1}o||(u.node.kind===`AssumeProve`&&s(void 0,`Selected ASSUME/PROVE instead of expression.`),u.node.kind===`NewSymbol`&&s(void 0,`Selected a NEW declaration as an expression or operator.`))},oc=(t,n)=>{let r=n.isGenerated?void 0:n.hasLabelScope?n.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:n.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return r===void 0||!t.location.range?!1:(n.errors.push({location:e.X(t.location.range),message:r}),!0)},sc=(t,n,r)=>{let i=t.location.range;if(!i||r.isGenerated)return;let a=e.X(i),o=t.params.filter((i,a)=>{let o=Os(n,i)?.kind===`Parameter`,s=t.paramRanges?.[a];return!o&&s&&r.errors.push({location:e.X(s),message:`Illegal parameter ${i} of label \`${t.name}'.`}),o});o.filter((e,t)=>o.indexOf(e)!==t).forEach(e=>r.errors.push({location:a,message:`Repeated formal parameter ${e} \nin label \`${t.name}'.`})),r.labelParams.filter(e=>!o.includes(e)).forEach(e=>r.errors.push({location:a,message:`Label ${t.name} must contain formal parameter \`${e}'.`}));let s=[...new Set(o.filter(e=>!r.labelParams.includes(e))),...t.params.filter(e=>!o.includes(e))];s.length>0&&r.errors.push({location:a,message:`Label ${t.name} declares extra parameter(s) ${s.map(e=>`${e} `).join(``)}`}),r.labels.has(t.name)&&r.errors.push({location:a,message:`Duplicate label \`${t.name}'.`}),r.labels.add(t.name)},cc=(e,t,n,r)=>{if(!Qs(e))return!1;let i=Js(e),a=i[0],o=i.length>1&&a.kind===`Name`?Os(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&ac(e,i,o,t,n,r),o!==void 0},lc=(t,n,r,i)=>{let a=t.location;if(yc(t,r,i))return;let o=xs.get(t);if(o!==void 0)return o;if(Ss(n))return t.kind===`Apply`?t.args.length:0;let s=Os(r,n);if(s?.isNonFact){i.errors.push({location:e.X(Hs(t,n)),message:`Step number of non-expression step used as an expression.`});return}if(cc(t,r,i,!1)||Gs(n)&&s)return t.kind===`Apply`?t.args.length:0;if(s&&t.kind!==`OperatorReference`&&(t.resolution=vs),s)return s.arity;let c=zs(n,i);if(c)return t.kind===`Identifier`?t.name=c.key:t.operator=c.key,xs.set(t,c.arity),c.arity;let l=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``;if(l!==``&&(Os(r,l)!==void 0||zs(l,i)!==void 0||i.facts.has(l)))return t.kind===`Apply`?t.args.length:0;let u=(t.kind===`Identifier`?void 0:t.spelling)??n,d=e.X(t.kind===`Apply`&&u===`-.`?Vs(a,`-`):Hs(t,n));if(!Ws(n)||Gs(n)){i.errors.push({location:d,message:`Unknown operator: \`${n}'.`});return}i.errors.push({location:d,message:`Could not find declaration or definition of symbol '${u}'.`});let f=Us(t);f&&a.range&&i.errors.push({location:e.X(a.range),message:`Couldn't resolve ${f} operator symbol \`${u}'.`})},uc=(e,t,n)=>(e.forEach(e=>B(e.set,t,n)),e.reduce((e,t)=>Ps(e,Is(t.pattern),t.pattern.ranges,n),t)),dc=(e,t)=>e.kind===`Identifier`&&e.name===t&&O(e)||Be(e).some(e=>dc(e,t)),fc=(e,t)=>{e.kind===`FunctionConstruction`&&dc(e.body,t)&&(e.isRecursive=!0),Be(e).forEach(e=>fc(e,t))},pc=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?Ls(t.bounds):[],labels:/* @__PURE__ */ new Set},o=t.name,s=t.location.range,c=t=>{s&&!a.isGenerated&&a.errors.push({location:e.X(s),message:t})},l=t.kind===`Function`?uc(t.bounds,n,a):Fs(n,t.params,a),u=Os(l,o)??ks(o,a,s),d=u?.isPending===!0&&i.has(u);return u?.isPending&&!d?c(`Recursive ${t.kind===`Function`?`function`:`operator`} ${o} defined at wrong LET/IN level.`):u&&!d&&c(t.kind===`Function`?`Function name \`${o}' already defined or declared.`:`Operator ${o} already defined or declared.`),t.kind===`Function`?(B(t.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),fc(t.body,o),t.isSelfReferential=dc(t.body,o)):B(t.body,l,a),u&&d?(u.isPending=!1,u.range=s,!1):t.kind===`Function`?u===void 0:js(o,Os(n,o)??ks(o,a,s),{kind:`Definition`,arity:Ts(t),range:s},a)},mc=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Os(e,t.name)?.isPending)return e;let n={name:t.name,arity:Ts(t),params:Es(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>Tc(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Ss(t.name)?e:s(e,e=>!ws(t.location,e.location)),o={name:t.name,arity:Ts(t),kind:`Definition`,range:t.location.range,parent:a};if(Ds(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Ss(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return pc(t,a,u,i)?{...o,params:Es(t)}:a},a),()=>!0)},hc=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Os(t,r)??ks(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},gc=(t,n,r)=>{if(t.kind!==`Identifier`&&t.kind!==`Apply`)return!1;let i=hc(t.kind===`Identifier`?t.name:t.operator,n,r),a=t.kind===`Apply`?t.argumentCounts?.[0]??0:0;if(!i||a===i.arity)return!1;let o=(t.kind===`Apply`?t.argumentRanges?.[0]:void 0)??t.location.range;return o&&r.errors.push({location:e.X(o),message:`The operator ${i.name} requires ${i.arity} arguments.`}),!0},_c=(t,n,r)=>{if(gc(t,n,r))return;let i=t.operator,a=Bs(i,n,r),o=lc(t,i,n,r);if(o===void 0)return;if(o!==t.args.length){r.errors.push({location:e.X(t.argumentsRange??Hs(t,i)),message:`The operator ${i} requires ${o-(hc(i,n,r)?.arity??0)} arguments.`});return}let s=a&&(a.kind===`Definition`?a.params:[]);if(s===void 0){t.args.forEach(e=>vc(e,n,r));return}let c=(t,n)=>{t&&r.errors.push({location:e.X(t),message:n})};t.args.map((e,a)=>{let o=s[a]??0,l=e.location.range;if(o===0){if(e.kind===`Lambda`&&e.operator!==void 0)c(l,`The operator ${e.operator} requires 1 arguments.`);else if(e.kind===`Lambda`&&l)c(l,`LAMBDA expression used where an expression is required.`);else if(e.kind===`OperatorReference`){let t=lc(e,e.operator,n,r);t!==void 0&&c(l,`The operator ${e.operator} requires ${t} arguments.`)}else B(e,n,r);return!0}if(e.kind===`Lambda`){B(e,n,r);let s=e.params.length===o;return!s&&ys.has(e)?c(l,`Expected arity ${o} but found operator of arity ${e.params.length}.`):!s&&l&&e.operator===void 0&&c(t.selectorRanges?.at(-1)??Hs(t,i),`Lambda expression with arity ${e.params.length} used as argument ${a+1} of operator \`${i}', \nbut an operator of arity ${o} is required.`),s}if(e.kind===`Subexpression`)return B(e,n,r),!0;if(e.kind===`Apply`&&e.argumentCounts?.at(-1)===0){let t=e.argumentCounts.findIndex(e=>e>0);return c(e.selectorRanges?.[t],`Selector \`${e.operator.split(`!`)[t]}' should not have argument(s).`),!1}if(e.kind!==`Identifier`&&e.kind!==`OperatorReference`)return c(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${i}', in a position an operator is required.`),!1;let u=e.kind===`Identifier`?e.name:e.operator,d=Bs(u,n,r)?.params??[],f=lc(e,u,n,r);return e.kind===`Identifier`&&f!==void 0&&f!==o&&c(Hs(e,u),`Expected arity ${o} but found operator of arity ${f}.`),f===o&&d.every(e=>e===0)}).forEach((e,n)=>{e||c(t.location.range,`Argument number ${n+1} to operator '${i}' \nshould be a ${s[n]}-parameter operator.`)})},vc=(e,t,n)=>{e.kind===`Identifier`?lc(e,e.name,t,n):B(e,t,n)},yc=(e,t,n)=>{let r=bs.get(e);return r?(r.args.forEach(e=>vc(e,t,n)),n.errors.push(r.error),!0):!1},B=(t,n,r)=>{if(ys.has(t)&&!r.isGenerated){B(t,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>B(e,n,r)),a=e=>({...r,labelParams:[...r.labelParams,...e]});switch(t.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(gc(t,n,r))return;let i=t.name,a=lc(t,i,n,r);a!==void 0&&a>0&&r.errors.push({location:e.X(Hs(t,i)),message:`The operator ${i} requires ${a} arguments.`});return}case`OperatorReference`:lc(t,t.operator,n,r);return;case`Apply`:_c(t,n,r);return;case`Lambda`:B(t.body,Ps(n,t.params,t.paramRanges,r),a(t.params));return;case`And`:case`Or`:i(t.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:B(t.expression,n,r);return;case`If`:i([t.condition,t.consequent,t.alternative]);return;case`Case`:i(t.arms.flatMap(e=>[e.condition,e.body])),t.other&&B(t.other,n,r);return;case`Let`:B(t.body,mc(t.definitions,n,r,t.instances),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:B(t.body,uc(t.bounds,n,r),a(Ls(t.bounds)));return;case`UnboundedQuantifier`:B(t.body,Ps(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&B(t.set,n,r),B(t.body,Ps(n,Is(t.pattern),t.pattern.ranges,r),a(Is(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:B(t.predicate,uc([t.bound],n,r),a(Is(t.bound.pattern)));return;case`SetMap`:B(t.expression,uc(t.bounds,n,r),a(Ls(t.bounds)));return;case`FunctionSet`:i([t.domain,t.range]);return;case`Record`:case`RecordSet`:t.fields.forEach((i,a)=>{t.fields.slice(0,a).some(e=>e.name===i.name)&&r.errors.push({location:e.X(i.location.range??Vs(i.location,i.name)),message:`Non-unique fields in constructor.`}),B(i.value,n,r)});return;case`Except`:B(t.function,n,r),t.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),B(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:i([t.function,...t.args]);return;case`FieldAccess`:B(t.record,n,r);return;case`Product`:i(t.factors);return;case`BoxAction`:case`AngleAction`:i([t.action,t.subscript]);return;case`WeakFairness`:case`StrongFairness`:i([t.subscript,t.action]);return;case`Label`:if(oc(t,r))return;B(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),sc(t,n,r);return;case`Subexpression`:if(yc(t,n,r))return;t.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>vc(e,n,r)),cc(t,n,r,!1)}},bc=(t,n,r)=>t.forEach(t=>{if(t.kind===`ModuleFact`||gc(t,n,r)||cc(t,n,r,!0))return;let i=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;t.kind===`Identifier`&&Os(n,i)?.isNonFact?r.errors.push({location:e.X(Hs(t,i)),message:`Step number of non-fact used as a fact`}):r.facts.has(i)||B(t,n,r)}),xc=(e,t,n)=>(e.set&&B(e.set,t,n),Ms(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Sc=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:xc(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Sc(t,e.scope,e.unit,!0):B(t,e.scope,e.unit),e),{scope:t,unit:n});return B(e.conclusion,i.scope,i.unit),i.scope},Cc=(e,t,n)=>e.kind===`AssumeProve`?Sc(e,t,n):(B(e,t,n),t),wc=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&bc(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Ec(t,e,r),t)},Tc=(e,t,n)=>{let r=Mc(e,t,n);return e.name===void 0?r:Ms(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Ec=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=Cc(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return wc(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return wc(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return bc(r.facts,t,n),o(t);case`Instance`:return o(Tc(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?Tc(t,e,i):mc([t],e,n),t));case`Have`:case`Case`:return B(r.expression,t,i),wc(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>B(e,t,i)),a(t);case`Take`:return a(Ps(uc(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Ps(uc(r.bounds,t,i),r.names,r.nameRanges,i);return B(r.body,o,{...i,labelParams:[...i.labelParams,...Ls(r.bounds),...r.names]}),wc(e.proof,a(t),n),a(o)}default:return wc(e.proof,a(t),n),a(t)}},Dc=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Cc(e.statement,void 0,t);e.name!==void 0&&Ns(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),wc(e.proof,n,t),r&&(r.isInProof=!1)},Oc={line:0,column:0},kc=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Ac=(e,t)=>{let n=new Map([...Cs,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},jc=(t,n,r,i,a)=>{let o=t.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(n,r)=>{if(n.arity===0||r.kind!==`Identifier`){B(r,o,a);return}let i=lc(r,r.name,o,a);if(i!==void 0&&i!==n.arity)throw new e.F(`An operator must be substituted for symbol '${n.name}', and it must have arity ${n.arity} in the instance of ${t.module} at line ${t.location.line}, column ${t.location.column}`)},c=/* @__PURE__ */ new Map;t.substitutions.forEach(t=>{let r=t.name,i=n.find(e=>e.name===r);if(!i){a.errors.push({location:e.X(t.nameRange),message:`Identifier '${r}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let o=t.expression;s(i,o);let l=o.location.range;c.has(r)?l&&a.errors.push({location:e.X(l),message:`Multiple substitutions for symbol '${r}' in substitution.`}):c.set(r,o)});let l=n.filter(e=>!c.has(e.name)),u=e=>!Os(o,e.name)&&!zs(e.name,a);return l.filter(e=>!u(e)).forEach(e=>{let n={kind:`Identifier`,name:e.name,location:t.location};s(e,n),c.set(e.name,n)}),l.filter(u).forEach(n=>{let i=t.location.range,o=n.location.range;i&&o&&a.errors.push({location:e.X(i),message:`Substitution missing for symbol ${n.name} declared at ${e.X(o)} \nand instantiated in module ${r}.`})}),c},Mc=(e,t,n)=>{let r=n.getInstance(e);return jc(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Ms(e,t,r,n),t)},Nc=(e,t,n,r)=>{let i=Ac(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),jc(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:Oc}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Pc=(t,n)=>{let r=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return t.toSorted((e,t)=>ws(e.location,t.location)?-1:+!!ws(t.location,e.location)).forEach(t=>{let a=[],o=[];try{t.check(a,o)}catch(t){if(!(t instanceof e.F)||!t.sany&&a.length===0)throw t;a.push(...t.sany?.errors??[])}a.forEach(e=>i(r,e)),o.forEach(e=>i(n,e))}),r},Fc=(t,n)=>{let r=Ac(t,n.imported),i=/* @__PURE__ */ new Set([...n.facts,...[...t.theorems,...t.assumptions].flatMap(e=>e.name??[])]),a=new Map(t.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),o=new Map([...Cs,...n.bound].map(([e,t])=>[e,{...t,position:Oc}])),s=/* @__PURE__ */ new Set,c=[],l=(e,t,s,c,l)=>({imported:r,getInstance:n.getInstance,definitions:n.definitions,getKey:n.getKey,location:e,self:t,facts:i,goals:a,bindings:o,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),u=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>Ns(e.name,{kind:t,arity:e.arity,range:e.location.range},l(e.location,void 0,n,r,!1))}));return Pc([...n.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...u(t.constants,`Constant`),...u(t.variables,`Variable`),...t.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=js(e.name,o.get(e.name),r,l(e.location,void 0,t,n,!1));i&&(o.set(e.name,r),s.add(r)),c.push({declaration:e,binding:i?r:void 0})}})),...t.definitions.map(e=>({location:e.location,check:(n,r)=>{let i=l(e.location,e,n,r,!0);kc(t,e)?B(e.body,void 0,i):pc(e,void 0,i,s)&&o.set(e.name,{kind:`Definition`,arity:Ts(e),range:e.location.range,position:e.location})}})),...t.instances.map(e=>({location:e.location,check:(t,r)=>{let i=l(e.location,void 0,t,r,!1);Fs(void 0,e.params,i),n.instanced.get(e)?.forEach((e,t)=>Ns(t,e,i)),e.name!==void 0&&Ns(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...t.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=l(e.location,void 0,t,n,e.name!==void 0);B(e.expression,void 0,r),e.name!==void 0&&Ns(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...t.theorems.map(e=>({location:e.location,check:(t,n)=>Dc(e,l(e.location,void 0,t,n,e.name!==void 0))})),...t.uses.map(e=>({location:e.location,check:(t,n)=>bc(e.facts,void 0,l(e.location,void 0,t,n,!1))})),{location:t.location.range?.end??t.location,check:t=>c.forEach(n=>{let r=n.declaration.location.range;r&&(!n.binding||n.binding.isPending)&&t.push({location:e.X(r),message:`Symbol ${n.declaration.name} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},Ic=/* @__PURE__ */ new WeakSet,Lc=/* @__PURE__ */ new WeakMap,Rc=(e,t)=>{if(t.length===0)return e;let n={...e};return Ic.has(e)&&Ic.add(n),Lc.set(n,[...t,...Lc.get(e)??[]]),n},zc=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Gc(e,(e,r)=>zc(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&O(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&O(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Bc=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Vc=/* @__PURE__ */ new WeakMap,Hc=e=>Vc.get(e)??e.name,Uc=(e,t)=>(Hc(t)!==e.name&&Vc.set(e,Hc(t)),e),Wc=(e,t)=>Uc(e.kind===`Function`?{...e,bounds:Bc(e.bounds,e=>t(e,[])),body:t(e.body,Ls(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Gc=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>Wc(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Bc(e.bounds,n),body:t(e.body,Ls(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,Is(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,Is(e.bound.pattern))};case`SetMap`:return{...e,bounds:Bc(e.bounds,n),expression:t(e.expression,Ls(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Kc=`LAMBDA`,qc=e=>`${e}@SUBSTITUTION`,Jc=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(Jc),Yc=(e,t)=>{if(e.kind!==`Identifier`)return!Jc(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=O(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!Jc(n.body)},Xc=(e,t=/* @__PURE__ */ new Set)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0,r=n===void 0||t.has(n)?[]:[n];return Gc(e,(e,n)=>(r.push(...Xc(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Zc=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},Qc=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),$c=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},el=(e,t)=>e.map(e=>({pattern:$c(e.pattern,t),set:e.set})),tl=(e,t)=>e.kind===`Function`?{...e,bounds:el(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},nl=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>Uc({...tl(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:el(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:$c(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:$c(e.bound.pattern,n),set:e.bound.set}};default:return e}},rl=e=>`${e}@ENABLED`,il=(e,t)=>e.modes.get(t)??e,al=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!O(e)&&t.instantiation.variables.has(e.name),ol=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>ol(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(al(e,t,n))return[e.name];let r=O(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?ol(r.body,t,/* @__PURE__ */ new Map):void 0},sl=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return al(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:rl(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:fl(e.expression,il(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[fl(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:fl(e.subscript,il(t,`Primed`),n),location:r},fl(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=ol(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:rl(r),location:e.location},location:e.location},fl({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},cl=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:vs}),ll=(e,t)=>e.map(e=>cl(e.name,t)),ul=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...ll(t,r),...i.map(e=>cl(e,r))],location:r},location:r}},dl=(e,t)=>e.instantiation.isParameterized(t)?ml(e,t):void 0,fl=(t,n,r)=>{let i=e=>fl(e,n,r),a=n.instantiation,o=a.params,s=e=>!r.has(e)&&!O(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:fl(t.expression,il(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:fl(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},il(n,`Enabled`),r)};let c=sl(t,n,r);if(c)return c;if(t.kind===`Identifier`&&s(t.name)){let e=a.substitutions.get(t.name),r=n.bindings;if(e&&(r===void 0||!Yc(e,a)))return Rc(e,[t]);if(e&&r){let n=qc(t.name);return r.set(n,e),cl(n,t.location)}let i=dl(n,t.name);if(i===void 0)return t;if(o.length===0)return{...t,name:i};let s=a.getDefinition(t.name);return s&&Ts(s)>0?ul(i,o,Ts(s),t.location):{kind:`Apply`,operator:i,args:ll(o,t.location),location:t.location}}if(t.kind===`Apply`&&s(t.operator)){let r=t.args.map(i),s=a.substitutions.get(t.operator),c=a.substitutions.size>0||o.length>0||Ic.has(t),l=e=>(c&&Ic.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let e=s.kind===`Identifier`?s.name:s.operator;return l({...t,operator:e,args:r,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...t,operator:s.operator,args:[...s.args,...r],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Kc,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:Kc,args:r,resolution:vs},location:t.location};if(s)throw new e.F(`The operator ${t.operator} can only be substituted by an operator at line ${t.location.line}, column ${t.location.column}`);let u=dl(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[...ll(o,t.location),...r]}}if(t.kind===`OperatorReference`&&s(t.operator)){let e=dl(n,t.operator);if(e===void 0)return t;let r=a.getDefinition(t.operator);return o.length>0&&r?ul(e,o,Ts(r),t.location):{...t,operator:e}}let l=Zc(n),u=Gc(t,(e,t)=>t.length===0?i(e):fl(e,n,Qc(r,t,l)));return nl(u,r,l)},pl=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:cl(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},ml=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=Zc(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=tl(Wc(i,(e,t)=>fl(e,s,Qc(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(([e,t])=>({kind:`Operator`,name:e,params:[],body:t,isLocal:!0,isRecursive:!1,location:t.location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&Lc.set(l,[u,...Lc.get(i.body)??[]]),pl({...c,body:l},r.params,i.location)}):t},hl=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Xc(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>dl(i,e)??e,getQualifiedKey:t=>{let n=dl(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>pl(r,e.params,r.location)):t}}},gl=e=>e.kind===`Let`&&e.instances!==void 0||Be(e).some(gl),_l=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Gc(e,e=>_l(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>ws(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},vl=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,yl=(e,t)=>e.definitions.some(e=>gl(e.body))||e.assumptions.some(e=>gl(e.expression))||e.theorems.some(e=>{let t=vl(e);return t!==void 0&&gl(t)})?{...e,definitions:e.definitions.map(e=>Wc(e,e=>_l(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:_l(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=vl(e);return n===void 0?e:{...e,statement:_l(n,t,[])}})}:e,bl=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),xl={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},Sl=(e,t)=>{let n=xl[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Cl=(e,t)=>`${e}${t}`,wl=(e,t,n)=>`${e}${t}${n}`,Tl=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},El=(e,t,n)=>`${e},${t},${n}`,Dl=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Ol=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),kl=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Al=(e,t,n,r)=>({...Dl(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),jl=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Ml=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Nl=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{...Al(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Pl=Al(`$Set`,0,[2],[1]),Fl=Al(`$Junction`,0,[3],[1]),Il=Al(`$Choose`,0,[2],[1]),Ll=Al(`$Function`,0,[3],[1]),Rl=Al(`$FcnApply`,0,[2,2],[1,1]),zl=Al(`$RcdSelect`,0,[2,0],[1,1]),Bl=Al(`'`,2,[1],[0]),Vl=Al(`ENABLED`,1,[2],[0]),Hl=Al(`[]`,3,[3],[0]),Ul=Al(`$SquareAct`,2,[2,1],[0,0]),Wl=Al(`$WF`,3,[1,2],[0,0]),Gl=Al(`$TemporalExists`,3,[3],[0]),Kl=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),ql=e=>e.map(e=>({name:e,arity:0})),Jl=(t,n)=>n.location.range?e.J(`${t}.`,n.location.range):new e.F(`${t} at line ${n.location.line}, column ${n.location.column}`),Yl=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Xl=e=>e.kind!==`Let`&&e.kind!==`Label`,Zl=t=>{let n=/* @__PURE__ */ new Map,r=(e,n)=>{let r=n.get(e);if(r?.kind===`Formal`)return{kind:`Declared`,name:e,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:ee(r.definition,r.scope)};if(t.constants.has(e))return{kind:`Declared`,name:e,level:0,arity:0};if(t.variables.has(e))return{kind:`Declared`,name:e,level:1,arity:0};let i=t.getDefinition(e);if(i){let n=ee(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Nl.get(e)??bl.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},i=(e,t,n)=>{let r=Dl(Math.max(t,...n.map(e=>e.data.level)));return r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(wl(e,n,t))}),t.data.constraints.forEach((e,t)=>Ol(r.constraints,t,e)),kl(r.argConstraints,Cl(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>kl(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},a=(t,n,r=[],i=[])=>{let a=e=>i.includes(e);if(n.forEach((n,r)=>{if(!(n.operator||n.declared)&&n.data.level>jl(t,r))throw new e.F(`Level error in applying operator ${t.name}:\nThe level of argument ${r+1} exceeds the maximum level allowed by the operator`)}),r.some(e=>e.level>2))throw new e.F(`Level error in applying operator ${t.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let o=e=>{let r=t.formals.findIndex(t=>t.name===e);return r===-1?void 0:n[r]},s=(e,n,r)=>t.conditions.has(El(e,n,r)),c=Dl(Math.max(t.level,...n.filter((e,n)=>Ml(t,n)===1).map(e=>e.data.level),...r.map(e=>e.level)));return t.params.forEach(e=>c.params.add(e)),n.forEach((e,n)=>{Ml(t,n)===1&&e.data.params.forEach(e=>c.params.add(e))}),r.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),t.constraints.forEach((e,t)=>Ol(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||Ol(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>Ol(c.constraints,t,e))),n.forEach((e,n)=>e.data.params.forEach(e=>{a(e)||Ol(c.constraints,e,jl(t,n))})),n.forEach((e,t)=>{let r=e.operator;r&&n.forEach((e,n)=>r.formals.forEach((i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>Ol(c.constraints,e,jl(r,a)))}))}),t.argParams.forEach(e=>{let t=Tl(e),n=o(t.operator)?.operator;n&&Ol(c.constraints,t.param,jl(n,t.index))}),[t.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>kl(c.argConstraints,t,e))),n.forEach((e,r)=>{let i=e.declared;i&&(Array.from({length:i.arity},(e,n)=>kl(c.argConstraints,Cl(i.name,n),t.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&kl(c.argConstraints,Cl(i.name,a),e.data.level)})))}),t.argParams.forEach(e=>{let t=Tl(e),n=o(t.operator);n&&kl(c.argConstraints,Cl(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a(Tl(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),t.argParams.forEach(e=>{let t=Tl(e),n=o(t.operator);if(n)n.declared&&c.argParams.add(wl(n.declared.name,t.index,t.param));else{let n=o(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(wl(t.operator,t.index,e)))}}),n.forEach((e,t)=>{let r=e.declared;r&&n.forEach((e,n)=>Array.from({length:r.arity},(i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>c.argParams.add(wl(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,ql(e.params),e.body,t);return{data:n,operator:n}}let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let i=r(n,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=Dl();return e.params.add(n),{data:e,declared:{name:n,arity:i.arity}}}if(e.kind===`OperatorReference`)return{data:Dl()}}return{data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=Kl(n,ql(i));return a(e,s(t,o),r.map(e=>m(e,n)),i)},l=(e,t)=>e.kind===`Declared`?i(e.name,e.level,t):a(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw Jl(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw Jl(`Action used where only temporal formula or state predicate allowed`,e);Yl.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Xl(n)&&n.kind!==r)throw Jl(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=ee(e,n);t.constraints.forEach((e,t)=>Ol(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>kl(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(t,n)=>{try{return h(t,n)}catch(n){throw!(n instanceof e.F)||n.sany?n:Jl(n.message,t)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Dl();case`Identifier`:return l(r(e.name,t),[]);case`Apply`:{let n=s(e.args,t);return d(e,n),l(r(e.operator,t),n)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(Fl,n)}case`Prime`:case`Unchanged`:return c(Bl,[e.expression],t);case`Enabled`:return c(Vl,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(Hl,[n])}case`If`:return c(Fl,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(Fl,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=c(Fl,[e.body],t,e.bounds.map(e=>e.set),Ls(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Jl(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?Gl:Fl,[e.body],t,[],e.names);case`Choose`:return c(Il,[e.body],t,e.set?[e.set]:[],Is(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(Pl,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(Pl,[e.predicate],t,[e.bound.set],Is(e.bound.pattern));case`SetMap`:return c(Pl,[e.expression],t,e.bounds.map(e=>e.set),Ls(e.bounds));case`FunctionConstruction`:return c(Ll,[e.body],t,e.bounds.map(e=>e.set),Ls(e.bounds));case`Record`:return c(Ll,e.fields.map(e=>e.value),t);case`RecordSet`:return c(Pl,e.fields.map(e=>e.value),t);case`Except`:return c(Pl,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(Rl,[o(e.function,t),e.args.length===1?o(e.args[0],t):{data:c(Pl,e.args,t)}]);case`Bracket`:return Dl();case`FieldAccess`:return a(zl,[o(e.record,t),{data:Dl()}]);case`BoxAction`:case`AngleAction`:return c(Ul,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(Wl,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Dl()}},g=(e,t,n=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,r=n,a=t)=>g(e,a,r,i),o=(e,o)=>{let s=r(e,t);s.kind===`Declared`?(n&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,n||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return Be(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,Kl(t,ql(e.names))),i;default:return Gc(e,(e,r)=>(a(e,n,Kl(t,ql(r))),e)),i}},_=(e,t,n,r)=>{let i=Kl(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...Dl(a.level),name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get(Cl(e.name,n))??0)),conditions:new Set(t.flatMap((e,n)=>t.flatMap((t,r)=>Array.from({length:e.arity},(e,t)=>t).filter(n=>a.argParams.has(wl(e.name,n,t.name))).map(e=>El(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(Tl(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Tl(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},ee=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{...Dl(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,t);return n.set(e,o),o};return{analyze:m,analyzeDefinition:ee,toOperand:o}},Ql=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?Ql(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Dl(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Ol(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>kl(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},$l=(t,n,r,i)=>{let a=Zl(n),o=e=>Math.max(0,...e.map(e=>a.analyze(e,/* @__PURE__ */ new Map).level)),s=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?o([t.expression]):t.kind===`Witness`?o(t.expressions):t.kind===`Take`?o(t.bounds.map(e=>e.set)):t.kind===`Pick`?o([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?Ql(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},c=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=e.X(t.statement),r=()=>s(t)===0;return t.body.kind===`Have`||t.body.kind===`Take`||t.body.kind===`Witness`?r()?[]:[{location:n,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:t.body.kind===`Case`?[...r()?[]:[{location:n,message:`Non-constant CASE for temporal goal.`}],...c(t.proof)]:t.body.kind===`Qed`?c(t.proof):[]}):[],l=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=t.body,r=()=>s(t)===3,i=n.kind===`Pick`&&n.bounds.length>0&&r()?n.bounds.filter(e=>o([e.set])!==0).flatMap(t=>t.set.location.range?[{location:e.X(t.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(t.proof),...i,...t.proof?.kind===`Steps`&&r()?c(t.proof):[]]}):[],u=Pc([...t.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>a.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...t.assumptions.map(e=>({location:e.location,check:()=>a.analyze(e.expression,/* @__PURE__ */ new Map)})),...t.theorems.map(t=>({location:t.location,check:()=>{let n=t.statement.kind===`AssumeProve`?Ql(t.statement,/* @__PURE__ */ new Map,a):a.analyze(t.statement,/* @__PURE__ */ new Map),r=[...l(t.proof),...n.level===3?c(t.proof):[]];if(r.length>0)throw e.q(r)}})),...r],i);if(u.length>0)throw e.q(u,!1,void 0,i)},eu=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),tu=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),nu=/* @__PURE__ */ new Set([...eu,...tu,`Enabled`]),ru=/* @__PURE__ */ new Set([`~>`,`-+->`]),iu=/* @__PURE__ */ new Set([...ru,`\\cdot`]),au=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),ou=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),su=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},cu=(e,t)=>au.has(e)||t.builtins.get(e)?.isStateLevel===!0,lu=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(eu.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(tu.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&ru.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(nu.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&iu.has(e.operator))&&(r[0]|=1),nu.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=su(e);if(u!==void 0&&!O(e)){let e=t.substitutions.get(u)??u,n=t.definitions.get(e),a=t.constants.has(u),o=t.variableIndex.get(u);if((o!==void 0||t.builtins.get(u)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=1),o!==void 0&&(l&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:l});else{cu(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),ou.has(u)&&(r[0]|=8),!a&&cu(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}Be(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},uu=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],du=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},fu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),pu=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=lu(uu(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&14,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=du(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=du(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!fu(t[e],l[e*r])))),p=du(a,r,f,14);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|d[t]&224|p[t]&14:e),words:r}},mu=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?hu(uu(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},hu=(e,t)=>{let n=t.facts.words,r=lu(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=mu(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}fu(e.callee,r[0])||(i[0]|=r[0]&14)}),i},gu=(e,t)=>!(mu(e,t)[0]&1),_u={any:2,repeated:4,streamed:8},vu=(e,t,n=`any`)=>(mu(e,t)[0]&_u[n])!==0,yu=(e,t)=>{let n=mu(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},bu=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},xu=(e,t)=>{let n=hu([e],t);return n[0]&16?void 0:bu(n)},Su=(e,t)=>!!(hu([e],t)[0]&1),Cu=(t,n,r)=>new e.O(`Applying ${t} to the following value,\nwhich is not ${n}:\n${L(r)}`),wu=e=>jt(e)?I(e):void 0,Tu=`a function with a finite domain`,Eu=(e,t,n)=>{let r=R(e,t,n),i=wu(r);if(!i)throw Cu(n,Tu,r);return i},Du=(e,t)=>{let n=R(e,1,t),r=wu(n),i=r&&ju(r,R(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw wo(`second`,t,`bag`,n);return i},Ou=(e,t,n)=>{let r=t[n];if(!r||!Au(r))throw wo(n===0?`first`:`second`,`(+)`,`bag`,R(e,n,`(+)`));return r},ku=(e,t)=>{if(!j(e)||!N(e))throw t();return P(e).elements},Au=e=>e.range.every(e=>typeof e==`number`&&e>0),ju=(e,t)=>{let n=e.domain.findIndex(e=>mr(t,e));return n===-1?void 0:e.range[n]},Mu=t=>{if(typeof t==`number`)return t;let n=`tlc2.value.impl.${zo(t)}`;throw new e.b(`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},Nu=(e,t)=>{let n=Mu(e)+Mu(t);if(No(n))throw Po(`${e}+${t}`);return n},Pu=(e,t,n)=>{let r=Mu(e.range[t]),i=ju(n,e.domain[t]);if(i===void 0)return r;let a=r-Mu(i);if(No(a))throw Po(`${r}-${i}`);return a},Fu=(e,t,n,r=e.length)=>{let i=e.slice(0,r).find(e=>mr(t,e[0]));i?i[1]=Nu(i[1],n):e.push([t,n])},Iu=e=>e.domain.map((t,n)=>[t,e.range[n]]),Lu=Cn([],[]),Ru=t=>[ko(`EmptyBag`,Lu),z(`IsABag`,1,e=>{let t=wu(R(e,0,`IsABag`));return t!==void 0&&Au(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`);return Eu(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Cu(`BagCardinality`,`a bag`,t);return Nu(e,n)},0)}),z(`BagIn`,2,e=>{let t=Du(e,`BagIn`);return t!==void 0&&t>0}),z(`CopiesIn`,2,e=>Du(e,`CopiesIn`)??0),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>wu(R(e,t,`(+)`))),n=Ou(e,t,0),r=Ou(e,t,1),i=Iu(n);return r.domain.forEach((e,t)=>Fu(i,e,r.range[t],n.domain.length)),Cr(i)}),z(`\\ominus`,2,e=>{let t=R(e,0,`(-)`),n=R(e,1,`(-)`),r=wu(t),i=wu(n);if(!r)throw wo(`first`,`(-)`,`bag`,t);if(!i)throw wo(`second`,`(-)`,`bag`,n);return Cr(r.domain.flatMap((e,t)=>{let n=Pu(r,t,i);return n>0?[[e,n]]:[]}))}),z(`BagUnion`,1,t=>{let n=R(t,0,`BagUnion`),r=ku(n,()=>Cu(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??Lu;let i=t=>{let r=wu(t);if(!r)throw new e.O(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${L(n)}`);return r},a=Iu(i(r[0]));return r.slice(1).forEach(e=>{let t=i(e);t.domain.forEach((e,n)=>Fu(a,e,t.range[n]))}),Cr(a)}),z(`\\sqsubseteq`,2,e=>{let t=R(e,0,`\\sqsubseteq`),n=R(e,1,`\\sqsubseteq`),r=wu(t),i=wu(n);if(!r)throw Cu(`\\sqsubseteq`,Tu,t);if(!i)throw Cu(`\\sqsubseteq`,Tu,n);return r.domain.every((e,t)=>{let n=ju(i,e);return Mu(r.range[t])<=(n===void 0?0:Mu(n))})}),Ao(`BagOfAll`,2,e=>{let t=Oo(e,0,`BagOfAll`),n=R(e,1,`BagOfAll`),r=wu(n);if(!r)throw wo(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[];return r.domain.forEach((e,n)=>Fu(i,t.call([e]),r.range[n])),Cr(i)}),z(`SubBag`,1,n=>{let r=R(n,0,`SubBag`);if(!jt(r))throw new e.b(`Attempted to apply the operator DOMAIN to a non-function\n(${Bo(r)})\nline 106, col 58 to line 106, col 65 of module Bags`);let i=I(r),a=P(vr(i.range)).elements,o=a.find(e=>typeof e!=`number`);o!==void 0&&t.get(`>=`)?.evaluateBinary?.(a[0],o);let s=i.range.filter(e=>typeof e==`number`);if(s.some(e=>e<1))throw new e.b(`Attempted to apply a function to ${L(i)}, which is not in its domain`);return _r(i.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:s[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Cn(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>Pi(Eu(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=ku(t,()=>Cu(`BagToSet`,Tu,t));return Cn([...n],n.map(()=>1))})],zu={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},V={none:0,beginObject:1,endObject:2,beginArray:3,endArray:4,true:5,false:6,null:7,singleQuoted:8,doubleQuoted:9,unquoted:10,singleQuotedName:12,doubleQuotedName:13,unquotedName:14,number:16,eof:17},Bu={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},Vu=[{lower:`true`,upper:`TRUE`,token:V.true},{lower:`false`,upper:`FALSE`,token:V.false},{lower:`null`,upper:`NULL`,token:V.null}],Hu=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
79
- `],[`r`,`\r`],[`f`,`\f`]]),Uu=1024,Wu=t=>{let n=+!!t.startsWith(``),r=n,i=0,a=n,o=!0,s=V.none,c=0,l=[zu.emptyDocument],u=[void 0],d=[0],f=()=>`$${l.map((e,t)=>e===zu.emptyArray||e===zu.nonemptyArray?`[${d[t]}]`:e===zu.emptyDocument||e===zu.nonemptyDocument?``:`.${u[t]??``}`).join(``)}`,p=()=>` at line ${i+1} column ${r-a+1} path ${f()}`,m=t=>new e.b(`com.google.gson.stream.MalformedJsonException: ${t}${p()}
80
- See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`),h=()=>new e.b(`java.io.EOFException: End of input${p()}`),g=()=>{if(!o)throw m(`Use JsonReader.setStrictness(Strictness.LENIENT) to accept malformed JSON`)},_=e=>`/\\;#=`.includes(e)?(g(),!1):!`{}[]:, \f\r
81
- `.includes(e),ee=()=>{for(;r<t.length;){let e=t[r++];if(e===`
82
- `){i++,a=r;return}if(e===`\r`)return}},te=e=>{for(;r+e.length<=t.length;r++)if(t[r]===`
83
- `)i++,a=r+1;else if(t.startsWith(e,r))return!0;return!1},v=()=>{for(;r<t.length;){let e=t[r++];if(e===`
84
- `)i++,a=r;else if(e===`/`){if(r===t.length)return e;g();let n=t[r];if(n!==`*`&&n!==`/`)return e;if(r++,n===`/`)ee();else if(te(`*/`))r+=2;else throw m(`Unterminated comment`)}else if(e===`#`)g(),ee();else if(e!==` `&&e!==`\r`&&e!==` `)return e}},ne=()=>{let e=v();if(e===void 0)throw h();return e},y=()=>{let e=Vu.find(e=>t[r]===e.lower[0]||t[r]===e.upper[0]);if(!e)return V.none;let n=e.lower.length;for(let i=0;i<n;i++){let n=t[r+i];if(n!==e.lower[i]&&n!==e.upper[i])return V.none}return r+n<t.length&&_(t[r+n])?V.none:(r+=n,e.token)},re=()=>{let e=Bu.none,n=!1,i=0;for(;r+i<t.length;i++){if(i===Uu)return V.none;let a=t[r+i];if(a===`-`){if(e===Bu.none)e=Bu.sign;else if(e===Bu.exponentE)e=Bu.exponentSign;else return V.none}else if(a===`+`){if(e!==Bu.exponentE)return V.none;e=Bu.exponentSign}else if(a===`e`||a===`E`){if(e!==Bu.digit&&e!==Bu.fractionDigit)return V.none;e=Bu.exponentE}else if(a===`.`){if(e!==Bu.digit)return V.none;e=Bu.decimal}else if(a<`0`||a>`9`){if(_(a))return V.none;break}else if(e===Bu.sign||e===Bu.none)n=a===`0`,e=Bu.digit;else if(e===Bu.digit){if(n)return V.none}else e===Bu.decimal?e=Bu.fractionDigit:(e===Bu.exponentE||e===Bu.exponentSign)&&(e=Bu.exponentDigit)}return i===Uu||e!==Bu.digit&&e!==Bu.fractionDigit&&e!==Bu.exponentDigit?V.none:(c=i,V.number)},b=()=>{let e=l.length-1,n=l[e];if(n===zu.emptyArray)l[e]=zu.nonemptyArray;else if(n===zu.nonemptyArray){let e=ne();if(e===`]`)return V.endArray;if(e===`;`)g();else if(e!==`,`)throw m(`Unterminated array`)}else if(n===zu.emptyObject||n===zu.nonemptyObject){if(l[e]=zu.danglingName,n===zu.nonemptyObject){let e=ne();if(e===`}`)return V.endObject;if(e===`;`)g();else if(e!==`,`)throw m(`Unterminated object`)}let t=ne();if(t===`"`)return V.doubleQuotedName;if(t===`'`)return g(),V.singleQuotedName;if(t===`}`){if(n!==zu.nonemptyObject)return V.endObject;throw m(`Expected name`)}if(g(),r--,_(t))return V.unquotedName;throw m(`Expected name`)}else if(n===zu.danglingName){l[e]=zu.nonemptyObject;let n=ne();if(n===`=`)g(),t[r]===`>`&&r++;else if(n!==`:`)throw m(`Expected ':'`)}else if(n===zu.emptyDocument){if(v()===void 0)return V.eof;r--,t.startsWith(`)]}'
85
- `,r)&&(r+=5),l[e]=zu.nonemptyDocument}else if(n===zu.nonemptyDocument){if(v()===void 0)return V.eof;g(),r--}let i=v();if(i===void 0){if(n===zu.emptyDocument)return V.eof;throw h()}if(i===`]`&&n===zu.emptyArray)return V.endArray;if(i===`]`||i===`;`||i===`,`){if(n!==zu.emptyArray&&n!==zu.nonemptyArray)throw m(`Unexpected value`);return g(),r--,V.null}if(i===`'`)return g(),V.singleQuoted;if(i===`"`)return V.doubleQuoted;if(i===`[`)return V.beginArray;if(i===`{`)return V.beginObject;r--;let a=y();if(a!==V.none)return a;let o=re();if(o!==V.none)return o;if(!_(t[r]))throw m(`Expected value`);return g(),V.unquoted},ie=()=>(s===V.none&&(s=b()),s),ae=()=>{if(r===t.length)throw m(`Unterminated escape sequence`);let e=t[r++];if(e===`u`){if(r+4>t.length)throw m(`Unterminated escape sequence`);let e=t.slice(r,r+4);if(!/^[\da-fA-F]{4}$/.test(e))throw m(`Malformed Unicode escape \\u${e}`);return r+=4,String.fromCharCode(Number.parseInt(e,16))}let n=Hu.get(e);if(n!==void 0)return n;if(e===`
86
- `)return i++,a=r,e;if(`'"\\/`.includes(e))return e;throw m(`Invalid escape sequence`)},oe=e=>{let n=``,o=r;for(;r<t.length;){let s=t[r++];if(s===e)return n+t.slice(o,r-1);s===`\\`?(n+=t.slice(o,r-1)+ae(),o=r):s===`
87
- `&&(i++,a=r)}throw m(`Unterminated string`)},se=()=>{let e=r;for(;r<t.length&&_(t[r]);)r++;return t.slice(e,r)},ce=t=>{if(l.length-1>=255)throw new e.b(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${p()}`);l.push(t),u.push(void 0),d.push(0),s=V.none},x=()=>{l.pop(),u.pop(),d.pop(),d[l.length-1]++,s=V.none},le=()=>{let e=ie();return e!==V.endObject&&e!==V.endArray&&e!==V.eof},S=()=>{let e=ie(),t=e===V.unquotedName?se():oe(e===V.singleQuotedName?`'`:`"`);return s=V.none,u[l.length-1]=t,t},ue=e=>e===V.true||e===V.false?e===V.true:e===V.null?null:e===V.number?(r+=c,{literal:t.slice(r-c,r)}):e===V.unquoted?se():oe(e===V.singleQuoted?`'`:`"`),de=()=>{let e=ie();if(e===V.beginArray){ce(zu.emptyArray);let e=[];for(;le();)e.push(de());return x(),e}if(e===V.beginObject){ce(zu.emptyObject);let e=/* @__PURE__ */ new Map;for(;le();)e.set(S(),de());return x(),e}let t=ue(e);return s=V.none,d[l.length-1]++,t};if(ie()===V.eof)return null;let fe=de();return o=!1,fe!==null&&ie(),fe},Gu=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),Ku=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),qu=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),Ju=e=>{if(!jt(e))return;let t=I(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?Fr(n):void 0},Yu=(t,n)=>{let r=`tlc2.value.impl.${zo(t)}`,i=`tlc2.value.impl.${n}`;return new e.b(`class ${r} cannot be cast to class ${i} (${r} and ${i} are in unnamed module of loader 'app')`)},Xu=t=>new e.b(`Cannot convert value: unsupported value type tlc2.value.impl.${zo(t)}`),Zu=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Qu=e=>`[${e.map(nd).join(`,`)}]`,$u=e=>`{${zt(e).map(e=>`${Zu(typeof e[0]==`string`?e[0]:L(e[0]))}:${nd(e[1])}`).join(`,`)}}`,ed=e=>{let t=I(e),n=ui(t);return n?Qu(n):$u(t)},td=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,nd=e=>typeof e==`string`?Zu(e):typeof e==`object`?e.kind===`ModelValue`?Zu(e.name):zo(e)===`RecordValue`?$u(I(e)):rd(e):String(e),rd=e=>{let t=zo(e);if(t===`TupleValue`)return Qu(I(e).range);if(td(t))return ed(e);if(Lr(e))return Qu(P(e).elements);throw Xu(e)},id=e=>{let t=zo(e);if(t===`RecordValue`)return $u(I(e));if(t===`TupleValue`)return`{${I(e).range.map((e,t)=>`"${t}":${nd(e)}`).join(`,`)}}`;if(td(t))return ed(e);throw Xu(e)},ad=t=>{if(t===null)throw new e.b(`Cannot convert value: unsupported JSON value null`);if(typeof t==`boolean`)return t;if(typeof t==`string`)return on(t);if(Array.isArray(t))return Pr(t.map(ad));if(t instanceof Map)return Fr([...t].map(e=>[on(e[0]),ad(e[1])]));let n=Number(t.literal);if(!/^-?\d+$/.test(t.literal)||No(n))throw new e.b(`Cannot convert value: expected a 32-bit integer JSON number, but found ${t.literal}`);return n||0},od=t=>{if(typeof t!=`string`)throw new e.b(`Cannot cast tlc2.value.impl.${zo(t)} to tlc2.value.impl.StringValue`);return t},sd=(e,t)=>{let n=Mi(e,t);if(typeof n!=`string`)throw Yu(n,`StringValue`);return n},cd=t=>{if(!Ku.has(t.toLowerCase()))throw qu.has(t.toLowerCase())?new e.B(`IOUtils!Serialize does not support the charset ${t}`):new e.b(/^[a-zA-Z\d][\w.:+-]*$/.test(t)?`java.nio.charset.UnsupportedCharsetException: ${t}`:`java.nio.charset.IllegalCharsetNameException: ${t}`)},ld=(t,n,r,i)=>{let a=r.find(e=>!Gu.has(e));if(a!==void 0)throw new e.b(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${a}`);if(r.includes(`READ`))throw new e.b(`java.lang.IllegalArgumentException: READ not allowed`);let o=new Set(r.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:r);if(o.has(`APPEND`)&&o.has(`TRUNCATE_EXISTING`))throw new e.b(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(o.has(`DELETE_ON_CLOSE`))throw new e.B(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let s=t.readFile?.(n);if(s===void 0&&!o.has(`CREATE`)&&!o.has(`CREATE_NEW`))throw new e.b(`java.nio.file.NoSuchFileException: ${n}`);if(s!==void 0&&o.has(`CREATE_NEW`))throw new e.b(`java.nio.file.FileAlreadyExistsException: ${n}`);s===void 0||o.has(`TRUNCATE_EXISTING`)?t.writeFile?.(n,i):t.writeFile?.(n,o.has(`APPEND`)?s+i:i+s.slice(i.length))},ud=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},dd=(t,n)=>{let r=t.readFile?.(n);if(r===void 0)throw new e.b(`${n} (No such file or directory)`);return r},fd=e=>[Uo(jo(`ToJson`,1,e=>on(nd(R(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),Uo(jo(`ToJsonArray`,1,e=>on(rd(R(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),Uo(jo(`ToJsonObject`,1,e=>on(id(R(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),Uo(jo(`JsonSerialize`,2,t=>{let n=od(R(t,0,`JsonSerialize`)),r=R(t,1,`JsonSerialize`);if(!ui(r)&&!Ju(r))throw wo(`second`,`JsonSerialize`,`sequence or record`,r);return ud(e,n),e.writeFile?.(n,nd(r)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Uo(jo(`ndJsonSerialize`,2,t=>{let n=od(R(t,0,`ndJsonSerialize`)),r=R(t,1,`ndJsonSerialize`),i=ui(r);if(!i)throw wo(`second`,`ndJsonSerialize`,`sequence`,r);return ud(e,n),e.writeFile?.(n,i.map(e=>`${nd(e)}\n`).join(``)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Uo(jo(`JsonDeserialize`,1,t=>ad(Wu(dd(e,od(R(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),Uo(jo(`ndJsonDeserialize`,1,t=>Pr(dd(e,od(R(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>ad(Wu(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],pd=(e,t)=>[Uo(Yo(`Serialize`,3,(n,r)=>{let i=Xo(n,2,`Serialize`)(),a=Ju(i);if(!a)throw wo(`third`,`ndJsonSerialize`,`sequence`,i);if(sd(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Xo(n,0,`Serialize`)(),s=ui(o);if(!s)throw wo(`first`,`Serialize`,`sequence`,o);let c=Xo(n,1,`Serialize`)();if(typeof c!=`string`)throw wo(`second`,`ndJsonSerialize`,`sequence`,c);let l=Mi(a,`openOptions`);if(zo(l)!==`TupleValue`)throw Yu(l,`TupleValue`);let u=sd(a,`charset`),d=I(l).range.map(e=>{if(typeof e!=`string`)throw Yu(e,`StringValue`);return e});return cd(u),ld(e,c,d,s.map(e=>`${nd(e)}\n`).join(``)),!0}),`public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`)],md={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},hd=e=>{let n=[],r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=0,o=bn(),s=e=>n.push(e&255),c=e=>{s(e>>8),s(e)},l=e=>{c(e>>16),c(e)},u=e=>e>32767?l(-e):c(e),d=e=>{s(md.string),l(0),l(-1),l(e.length),e.split(``).forEach(e=>s(e.charCodeAt(0)))},f=e=>{s(md.handle),u(e)},p=e=>{if(typeof e==`boolean`){s(md.boolean),s(+!!e);return}if(typeof e==`number`){s(md.integer),l(e);return}if(typeof e==`string`){a++,d(e);return}if(e.kind===`ModelValue`){s(md.modelValue),c(o.indexOf(e));return}if(e.kind===`Interval`){s(md.interval),l(e.low),l(e.high);return}let t=r.get(e);if(t!==void 0){f(t);return}if(r.set(e,a++),j(e)){let t=P(e).elements;s(md.set),l(t.length),t.forEach(p);return}let n=I(e),m=En(e);m===`tuple`?(s(md.tuple),u(n.range.length),n.range.forEach(p)):m===`record`?(s(md.record),l(n.domain.length),n.domain.forEach((e,t)=>{let r=String(e),o=i.get(r);o===void 0?(i.set(r,a++),d(r)):f(o),p(n.range[t])})):(s(md.function),u(n.domain.length),s(1),n.domain.forEach((e,t)=>{p(e),p(n.range[t])}))};return p(e),(0,t.gzipSync)(Uint8Array.from(n))},gd=e=>[Uo(jo(`_TLCTraceSerialize`,2,t=>{let n=od(R(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,hd(R(t,0,`_TLCTraceSerialize`))),!0}),`public static final tlc2.value.IValue tlc2.module._TLCTrace.ioSerialize(tlc2.value.IValue,tlc2.value.impl.StringValue) throws java.io.IOException`)],_d=25214903917n,vd=(1n<<48n)-1n,yd=2147483647,bd=e=>{let t=(BigInt.asUintN(64,e)^_d)&vd,n=e=>(t=t*_d+11n&vd,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^_d)&vd},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=yd)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},xd=[],Sd=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Cd=()=>{for(let e=1277011;xd.length<1341;e++)Sd(e)&&xd.push(e);return xd},wd=e=>{let t=Cd(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},Td=e=>{let t=[],n=e;for(let e=2;e*e<=n;e++)for(;n%e===0;)t.push(e),n/=e;return n>1&&t.push(n),t},Ed=e=>{for(let t=Math.max(e,9);;t++){let e=Td(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},Dd=(e,t,n)=>{if(t<=0)return[];let r=Ed(t),i=BigInt(n.nextInt(t)),a=BigInt(wd(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},Od=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:yd),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},kd=(1n<<63n)-1n-24n,Ad=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(kd*BigInt(n)+i)%t;return r<0n?r+t:r})},jd=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,Md=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Mr(e.domain),n=P(e.range).elements;return{lists:t.map(()=>n),create:e=>Cn(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>P(e).elements),create:t=>Fr(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>P(e).elements),create:Pr}}},Nd=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,Pd=(e,t,n,r)=>{if(F(t))return[];let i=r===`1.7.4`?Od:Dd;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=Nd(t,r)?void 0:Md(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(yd)?Ad(e,t,n):i(e,Number(t),n)).map(e=>a.create(jd(a.lists,e)))}let o=P(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},Fd=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[...To(t.domain,`RandomElement`,t).elements];return Cn(e,e.map(()=>Fd(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return Fr(t.names.map((e,r)=>[e,Fd(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return Pr(t.factors.map(e=>Fd(e,n)));if(typeof t==`object`&&t.kind===`Interval`){let r=Math.max(0,t.high-t.low+1),i=Math.floor(n.nextDouble()*r);if(i>=r)throw new e.b(`Attempted to retrieve out-of-bounds element from the interval value ${L(t)}.`);return t.low+i}let r=To(t,`RandomElement`).elements,i=Math.floor(n.nextDouble()*r.length);if(i>=r.length)throw new e.b(`Index ${i} out of bounds for length ${r.length}`);return r[i]},Id=(e,t,n)=>{if(typeof e!=`number`||e<0)throw wo(t,n,`nonnegative integer`,e);return e},Ld=(e,t,n,r)=>_r(Array.from({length:t},()=>_r(e.filter(()=>r.nextDouble()<n)))),Rd=(e,t)=>{let n=`RandomSetOfSubsets`,r=Id(R(e,0,n),`first`,n),i=Id(R(e,1,n),`second`,n),a=R(e,2,n);if(!j(a)||!N(a))throw wo(`third`,n,`finite set`,a);let o=P(a).elements;if(o.length<31&&r>2**o.length)throw wo(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw wo(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return Ld(o,r,o.length===0?0:i/o.length,t.getRandom())},zd=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,Bd=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,Vd=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(zd.test(t))return Number(t.replace(/[fFdD]$/,``));let n=Bd.exec(t);if(!n)return;let r=n[3]??``,i=`${n[2]}${r}`;if(i===``)return;let a=Number.parseInt(i,16)*2**(Number(n[4])-4*r.length);return n[1]===`-`?-a:a},Hd=e=>z(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=Id(R(t,0,n),`first`,n),i=R(t,1,n);if(typeof i!=`string`)throw wo(`second`,n,`string literal representing a probability`,i);let a=Vd(i);if(a===void 0||a<0||a>1)throw wo(`second`,n,`string literal does not represent a parsable probability`,i);let o=R(t,2,n);if(!j(o)||ln(o)||!si(o))throw wo(`third`,n,`finite set`,o);let s=ai(o);if(32-Math.clz32(r)>s&&r>1<<s)throw wo(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return Ld(P(o).elements,r,a,e.getRandom())}),Ud=t=>[Uo(z(`RandomSubset`,2,n=>{let r=Id(R(n,0,`RandomSubset`),`first`,`RandomSubset`),i=R(n,1,`RandomSubset`);if(!Lr(i)||!si(i))throw wo(`second`,`RandomSubset`,`a finite set`,i);let a=Nd(i,t.version);if(a&&a.reduce((e,t)=>e*P(t).elements.length,1)>Tt())throw new e.b(Et());return _r(Pd(r,i,t.getRandom(),t.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),z(`RandomSetOfSubsets`,3,e=>Rd(e,t)),z(`TestRandomSetOfSubsets`,3,e=>Pr(Array.from({length:5},()=>P(Rd(e,t)).elements.length)))],Wd=(e,t=0n)=>{let n=bd(t),r=bd(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Fr([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,getSuccessorAction:()=>void 0,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Ia,getSimulationValue:void 0,getRandom:()=>{let e=a?void 0:o.getCurrentState();return e===void 0?n:(e!==i&&(r.setSeed(o.getFingerprint(e)^BigInt.asUintN(64,t)),i=e),r)},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return o},Gd=e=>Cr([...e.possibleCounts].map(([e,t])=>[e,t])),Kd=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Gd(e)]]),qd=e=>Fr([[`name`,e??`UnnamedAction`],[`location`,Fr([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),Jd=/* @__PURE__ */ new WeakSet,Yd=(e,t)=>{let n=Fr([[`action`,_r(e)],[`state`,_r(t)]]);return Jd.add(n),n},Xd=(e,t,n)=>{let r=e.map((e,t)=>Pr([t+1,Fr(Object.entries(e))])),i=r.slice(1).map((e,n)=>Pr([r[n],t[n],e])),a=n?[Pr([r[r.length-1],n.action,r[n.start]])]:[];return Yd([...i,...a],r)},Zd=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Kd(e).get(t)},Qd=(t,n,r,i)=>{if(typeof r==`number`&&r>=0)t.registers.set(r,i);else if(r===`exit`)i===!0&&(t.isStopped=!0);else if(r===`pause`){if(i!==!0||!t.pause)return;n(`Press enter to resume model checking.`),t.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))t.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))t.properties.set(r.slice(2),L(i));else throw new e.O(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${L(r)}`)},$d=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:H(e),ef=e=>e.every(e=>e!==void 0),tf=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!O(e);if(i&&t.variableIndex.has(r))return 1;let a=Be(e).map(e=>tf(e,t,n)),o=i?Oh(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(tf(o.body,t,n))),Math.max(0,...a)},nf=(t,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[Yo(`AssertError`,2,t=>{let r=Oo(t,0,`AssertError`).expression;if(r&&r.kind!==`String`)throw new e.b(`In computing AssertError, a non-string expression (${$d(r)}) was used as the err of an AssertError(err, exp).`);let i=Xo(t,0,`AssertError`)();try{Xo(t,1,`AssertError`)()}catch(t){if(t instanceof e.b)return at(t.message,n.isTool)===i;throw t}return!1}),jo(`TLCGetOrDefault`,2,e=>Zd(n,R(e,0,`TLCGetOrDefault`))??R(e,1,`TLCGetOrDefault`)),jo(`Trace`,0,(t,r)=>{let i=r?.environment.variables??[],a=r?.state??i.map(()=>void 0);if(!r||!ef(a)){let t=i.filter((e,t)=>a[t]===void 0);throw new e.b(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${t.length>1?`s`:``} ${t.join(`, `)} undefined).`)}return r.state?Pr(n.getBehavior(a).map(e=>{let t=r.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return Fr(i===void 0?t:[[`_action`,i],...t])})):Pr([Fr([])])}),jo(`CounterExample`,0,()=>n.counterExample??Yd([],[])),z(`ToTrace`,1,t=>{let n=R(t,0,`ToTrace`);if(typeof n!=`object`||!Jd.has(n))throw new e.O(`The argument of ToTrace should be a CounterExample, but instead it is:\n${L(n)}`);let r=P(Mi(n,`state`)).elements.map(e=>ui(e)??[]);return Pr(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,t=>{let n=R(t,0,`TLCModelValue`);if(typeof n!=`string`)throw new e.O(`The argument of ModelValue should be a string, but instead it is:\n${L(n)}`);return yn(n)}),Yo(`TLCDefer`,1,(e,t)=>{let r=Oo(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{W(r,{...t,next:e})}),!0}),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),{...Yo(`PickSuccessor`,1,(r,i)=>{let a=i?.next??(i?.environment.variables??[]).map(()=>void 0);if(!ef(a)||i?.next&&n.isSeen(a))return!0;let o=Oo(r,0,`PickSuccessor`),s=o.call([]);if(typeof s!=`boolean`)throw new e.b(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${Bo(s)}) was used as the condition of an IF.\n${o.expression?$d(o.expression):``}`);if(s||!i?.next||!i.state||!ef(i.state))return!0;let c=n.getSuccessorAction(i.state,a);throw t(Je(n.isTool,Ge.moduleOverrideStdout,Ke.none,`Extend behavior of length ${n.getLevel(i.state)} with a "${c?.name}" step [<Action ${c?.location.range&&e.X(c.location.range)}>]? (Yes/no/explored/states/diff):`)),new e.v}),isActionLevel:!0},Yo(`TLCCache`,2,(e,t)=>{let i=Oo(e,0,`TLCCache`),o=$i(Xo(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=tf(s,t.environment,/* @__PURE__ */ new Set);if(c===2)return i.call([]);let l=c===1;if(l&&t.state&&n.getSimulationValue===void 0)return i.call([]),i.call([]);let u=l&&t.state?a(t.state):r,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=i.call([]);return d.set(o,p),p}),z(`TLCFP`,1,e=>{let t=R(e,0,`TLCFP`),n=Wi(t);if(n)throw n;return Number(BigInt.asIntN(32,Ia([t])))}),Yo(`TLCEvalDefinition`,1,(t,n)=>{let r=Xo(t,0,`TLCEvalDefinition`)();if(typeof r!=`string`)throw new e.O(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${L(r)}`);let i=n?Oh(r,n.environment):void 0,a=i?void 0:n?.environment.builtins.get(r);if(a?.arity===0)return a.evaluate([],n);if(!i||!n)throw new e.O(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${L(r)}`);if(i.kind===`Operator`&&i.params.length>0){let t=i.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new e.O(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${r}(${t.join(`, `)})`)}return i.kind===`Operator`?W(i.body,n):W({kind:`Identifier`,name:r,location:i.location},n)})]},rf=(e,t)=>[jo(`_Track`,2,e=>{let n=String(R(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,R(e,0,`_Track`)===!0?r+1:r),!0}),jo(`_Counts`,0,()=>Gd(t)),jo(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(Gd(t),!0)),!1)}),jo(`_PrintCounts`,0,()=>(e(L(Gd(t),!0)),!0))],af=e=>String(e).padStart(2,`0`),of=e=>`${e.getUTCFullYear()}.${af(e.getUTCMonth()+1)}.${af(e.getUTCDate())}.${af(e.getUTCHours())}${af(e.getUTCMinutes())}${af(e.getUTCSeconds())}`,sf=e=>Cr([...e].map(([e,t])=>[e,Pr([t])])),cf=e=>Tn(wr(e),`record`),lf=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),uf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),df=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),ff=(t,n,r)=>{if(t.version===`1.7.4`?!uf.has(n)||!t.isStarted&&df.has(n):!t.isStarted&&lf.has(n))throw new e.O(`TLCGet(${n}) was undefined.`);let i=t.getSimulationValue?.(n,r);if(i!==void 0)return i;let a=Math.floor((Date.now()-t.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:t.getLevel(r);case`diameter`:return t.diameter;case`generated`:return t.generatedStates;case`distinct`:return t.distinctStates;case`queue`:return t.queueSize;case`duration`:return a;case`stats`:return cf([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,a],[`worker`,0]]);case`config`:return cf([[`mode`,`bfs`],[`deadlock`,t.checkDeadlock],[`worker`,1],[`seed`,String(t.seed)],[`fingerprint`,String(BigInt.asIntN(64,va()))],[`install`,`unknown`]]);case`revision`:{let e=/* @__PURE__ */ new Date;return cf([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,on(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,on(of(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return qd(void 0);case`all`:return sf(t.registers);case`all:named`:return sf(Kd(t))}if(n.startsWith(`s:`)){let r=Kd(t).get(n);if(r===void 0)throw new e.O(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return on(t.properties.get(n.slice(2))??n);throw new e.O(`TLCGet(${n}) was undefined.`)},pf=(t,n,r)=>{if(typeof n==`number`&&n>=0){let r=t.registers.get(n);if(r===void 0)throw new e.O(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new e.O(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${L(n)}`);return ff(t,n,r?.state)},mf=e=>e.length===0?[[]]:e.flatMap((t,n)=>mf([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),hf=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&P(e).elements.forEach(hf),e.kind===`Function`&&e.range.forEach(hf))},gf=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`ModelValue`:case`Function`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return I(e);default:return P(e)}},_f=(t,n)=>[z(`Print`,2,e=>(t(ua([R(e,0,`Print`),R(e,1,`Print`)]).map(A).join(` `)),R(e,1,`Print`))),z(`PrintT`,1,e=>(t(A(ua([R(e,0,`PrintT`)])[0])),!0)),z(`Assert`,2,t=>{if(R(t,0,`Assert`)!==!0)throw new e.O(`The first argument of Assert evaluated to FALSE; the second argument was:\n${A(L(R(t,1,`Assert`)))}`,e.tt.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>Cr([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=R(e,0,`@@`),n=R(e,1,`@@`),r=jt(t)?I(t):void 0,i=jt(n)?I(n):void 0;if(!r)throw wo(`first`,`@@`,`function`,t);if(!i)throw wo(`second`,`@@`,`function`,n);let a=Rt(r),o=Rt(i).filter(e=>!a.some(t=>mr(e[0],t[0])));return wr([...a,...o])}),z(`ToString`,1,e=>on(L(R(e,0,`ToString`),!0))),{...Yo(`TLCEval`,1,(e,t)=>{let n=gf(Xo(e,0,`TLCEval`)());return t===void 0&&hf(n),n}),isStateLevel:!1},z(`Permutations`,1,e=>{let t=To(R(e,0,`Permutations`),`Permutations`).elements;return _r(mf(t).map(e=>Cr(t.map((t,n)=>[t,e[n]]))))}),Ao(`SortSeq`,2,e=>{let t=R(e,0,`SortSeq`),n=ui(t);if(!n)throw wo(`first`,`SortSeq`,`natural number`,t);let r=Oo(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw wo(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t=a.length;for(;t>0&&i(e,a[t-1]);)t--;a.splice(t,0,e)}),Pr(a)}),n.version===`1.7.4`?Uo({...jo(`TLCGet`,1,(e,t)=>pf(n,R(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Uo(Yo(`TLCGet`,1,(e,t)=>pf(n,Xo(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),jo(`TLCSet`,2,e=>(Qd(n,t,R(e,0,`TLCSet`),R(e,1,`TLCSet`)),!0)),ko(`Any`,pn),z(`RandomElement`,1,e=>Fd(R(e,0,`RandomElement`),n.getRandom()))],vf=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),yf=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],bf=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),xf=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs.beginLine.beginColumn.endLine.endColumn.module.name.location.context.parameters._action`.split(`.`),Sf=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),Cf=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
76
+ `;if(typeof s!=`string`)throw new e.g(`The _format field of the ALIAS ${a} is ${I(s)}, but it must be a string.`);return i.filter(([e])=>!(o&&e===`_format`)).filter(([e,t])=>!n||!fa(n[e],t)).map(([t,n])=>{let r=ha(s,[t,k(I(n))]);if(r===void 0)throw new e.g(`The _format field of the ALIAS ${a} is ${I(s)}, but it must format two strings, the name and the value of a field.`);return r}).join(``)},_a=[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],va={polynomial:_a[0]},ya=()=>va.polynomial,ba=/* @__PURE__ */ new Int32Array(256),xa=/* @__PURE__ */ new Int32Array(256),Sa=/* @__PURE__ */ new Int32Array(256),Ca=/* @__PURE__ */ new Int32Array(256),wa=/* @__PURE__ */ new Int32Array(256),Ta=/* @__PURE__ */ new Int32Array(256),Ea=/* @__PURE__ */ new Int32Array(256),Da=/* @__PURE__ */ new Int32Array(256),Oa={high:0,low:0};let ka=0,Aa=0;const ja=e=>{let t=(e^Aa)&255;Aa=(Aa>>>8|ka<<24)^wa[t],ka=ka>>>8^ba[t]},Ma=e=>{let t=_a[e];va.polynomial=t;let n=[];for(let e=1n<<63n;n.length<72;)n.push(e),e=e>>1n^((e&1n)==0n?0n:t);let r=n.slice(64,72).reverse();for(let e=0;e<256;e++){let t=r.reduce((t,n,r)=>e>>r&1?t^n:t,0n);ba[e]=Number(BigInt.asIntN(32,t>>32n)),wa[e]=Number(BigInt.asIntN(32,t))}let i=[ba,xa,Sa,Ca],a=[wa,Ta,Ea,Da];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)^wa[o],i[e][r]=t[r]>>>8^ba[o]}}Oa.high=Number(BigInt.asIntN(32,t>>32n)),Oa.low=Number(BigInt.asIntN(32,t))};Ma(0);const Na=e=>{let t=Aa^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;Aa=ka^Da[n]^Ea[r]^Ta[i]^wa[a],ka=Ca[n]^Sa[r]^xa[i]^ba[a]},Pa=e=>{if(typeof e==`boolean`)return ja(0),ja(e?116:102),2;if(typeof e==`number`)return ja(1),Na(e),5;if(typeof e==`string`){ja(3),Na(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)Na(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)ja(e.charCodeAt(n));return 5+e.length}return ja(21),Na(cn(e.name)+1),5},Fa=e=>{if(typeof e!=`object`||j(e))Pa(e);else if(Mt(e)){let t=F(e);ja(9),Na(t.domain.length);for(let e=0;e<t.domain.length;e++)Fa(t.domain[e]),Fa(t.range[e])}else{let t=N(e).elements;ja(5),Na(t.length);for(let e of t)Fa(e)}},Ia=e=>{let t={high:ka,low:Aa};ka=Oa.high,Aa=Oa.low;for(let t of e)Fa(t);let n=BigInt(ka>>>0)<<32n|BigInt(Aa>>>0);return ka=t.high,Aa=t.low,n},La=(e,t)=>{let n=new BigInt64Array(e.length),r=new Int32Array(n.buffer),i=ka,a=Aa;return e.forEach((e,n)=>{ka=Oa.high,Aa=Oa.low;for(let n of t)Fa(e[n]);r[2*n]=Aa,r[2*n+1]=ka}),ka=i,Aa=a,n},Ra=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),za=1024,Ba=e=>({current:-1,expressions:[],ranges:[],firstChild:[],lastChild:[],nextSibling:[],prefixes:[],isPart:[],isPrimed:[],isUnchanged:[],recursive:[],lets:[],roots:[],primary:[],secondary:[],covered:/* @__PURE__ */ new WeakSet,values:/* @__PURE__ */ new WeakMap,registers:new Uint8Array(e*za),relations:[]}),Va=(e,t,n,r,i)=>{let a=e.expressions.length;if(e.expressions.push(t),e.ranges.push(n),e.firstChild.push(-1),e.lastChild.push(-1),e.nextSibling.push(-1),e.prefixes.push(-1),e.isPart.push(i),e.isPrimed.push(!1),e.isUnchanged.push(t?.kind===`Unchanged`),e.recursive.push(-1),e.lets.push(void 0),e.roots.push(r===-1?a:e.roots[r]),e.primary.push(0),e.secondary.push(0),t&&e.covered.add(t),r===-1)return a;let o=e.lastChild[r];return o===-1&&(e.firstChild[r]=a),o!==-1&&(e.nextSibling[o]=a),e.lastChild[r]=a,a},Ha=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,Ua=(e,t,n,r,i)=>{let a=t===`next`?Ha(e,t,r):void 0;if(a!==void 0)return a;let o=Va(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},Wa=(e,t)=>e!==void 0&&t!==void 0&&e.module===t.module&&e.start.line===t.start.line&&e.start.column===t.start.column&&e.end.line===t.end.line&&e.end.column===t.end.column,Ga=(t,n,r)=>{let i=t===void 0?void 0:r.definitions.get(t),a=i?.kind===`Operator`?i.head:void 0,o=n.location.range;return!i||!a?`Action ${o?e.X(o):`Unknown location`}`:Wa(i.body.location.range,o)||!o?`${i.name} ${e.X(a)}`:`${i.name} ${e.X(a)} (${o.start.line} ${o.start.column} ${o.end.line} ${o.end.column})`},Ka=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,qa=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,Ja=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},Ya=e=>Array.from({length:e.length},(t,n)=>e.charCodeAt(n)).reduce((e,t)=>Math.imul(e,31)+t|0,0)&2147483647,Xa=e=>{let t=Array.from({length:11},()=>[]);return e.forEach((e,n)=>{if(n>=Math.floor(t.length*.75)){let e=Array.from({length:t.length*2+1},()=>[]);for(let n=t.length-1;n>=0;n--)t[n].forEach(t=>e[Ya(t.name)%e.length].unshift(t));t=e}t[Ya(e.name)%t.length].unshift(e)}),t.toReversed().flat()},Za=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),Qa=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),$a=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),eo=(e,t,n)=>{let r=new Set(n.map(Ka)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(O(e)){for(let e=r;e;e=e.parent)if(e.name===n)return e.definition&&{definition:e.definition,scope:e.scope};return}let i=t.substitutions.get(n)??n;if(t.variableIndex.has(i)||t.constants.has(i))return;let a=t.definitions.get(i),o=a?.location.range?.module??a?.body.location.range?.module;return a&&!Ra.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=Va(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(Ka(n));let d=t&&s.get(t);if(d&&i.forEach(t=>{e.expressions[t]===d&&(e.lets[t]??=[]).push(u)}),l?.kind===`Operator`&&l.isRecursive){let t=i.findLast(e=>a[e]===l);t!==void 0&&(e.recursive[u]=t)}return a[u]=l,i.push(u),o(),i.pop(),u},u=e=>{let t=e.definition;if(o.includes(t))return;o.push(t);let n=t.kind===`Function`?$a(t.bounds):t.params.map(e=>e.name);m(t.body,Qa(n,e.scope)),t.kind===`Function`&&Za(t.bounds).forEach(t=>m(t,e.scope)),o.pop()},d=e=>e?.definition.kind===`Operator`&&e.definition.params.length>0,f=(e,t,n,r)=>{if(e.kind===`Lambda`)m(e.body,Qa(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:m(e.body,Qa(e.params,t));return;case`Lambda`:m(e.body,Qa(e.params,t));return;case`Let`:{let n=e.definitions.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),Xa(e.definitions).forEach(e=>u({definition:e,scope:n})),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,qa(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,Ja(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,qa(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,Qa($a(e.bounds),t)),r(Za(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,Qa($a(e.bounds),t)),r(Za(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,Qa($a([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,Qa(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,Qa(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}};e.relations.forEach(e=>{i.push(e.node),m(e.expression,void 0),i.pop()})},to=(e,t,n)=>{for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r]){if(e.expressions[r]===n)return r;if(e.isPart[r]){let t=to(e,r,n);if(t!==-1)return t}}return-1},no=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=to(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:to(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},ro=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},io=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},ao=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},oo=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},so=(e,t)=>t.forEach((t,n)=>{let r=Ia([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*za+i;e.registers[o]=Math.max(e.registers[o],oo(a)+1)}),co=(e,t)=>{let n=e.registers.subarray(t*za,(t+1)*za),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*za*za/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*za?a===0?i:za*Math.log(za/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},lo=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},uo=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>lo(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},fo=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},po=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],mo=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},ho=(e,t)=>{let n=e.primary[t.node],r=e.secondary[t.node];return t.kind===`init`?{distinct:n,generated:n+r}:t.kind===`next`?{distinct:r,generated:n}:t.kind===`constraint`?{distinct:r,generated:n+r}:{distinct:0,generated:0}},go=(t,n)=>{let r=[],i=/* @__PURE__ */ new Map,a=e=>{let n=[],r={primary:t.primary[e],secondary:t.secondary[e]};return(r.primary>0||r.secondary>0||po(t,e))&&fo(n,r),mo(t,e).forEach(e=>a(e).forEach(e=>fo(n,e))),i.set(e,n),n},o=(n,i,a,o)=>{let s=t.ranges[n];r.push({location:s?e.X(s):`Unknown location`,depth:i,count:a,cost:o})},s=(e,n)=>o(e,n,t.primary[e],t.secondary[e]),c=(e,n)=>{let r=mo(t,e),l=[];r.forEach(e=>(i.get(e)??a(e)).forEach(e=>fo(l,e)));let u={primary:t.primary[e],secondary:t.secondary[e]},d=po(t,e),f=e=>r.forEach(t=>c(t,e));if(t.isUnchanged[e]){let t=l.filter(e=>e.primary!==0||e.secondary!==0);t.length===0?s(e,n):o(e,n,Math.max(u.primary,uo(t).primary),0);return}if(l.length===0){(u.primary!==0||d)&&s(e,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let t=l[0],r=t.primary===0&&t.secondary===0;if(t.primary<u.primary){s(e,n),f(n+1);return}if(!d&&p&&!r){o(e,n,t.primary,t.secondary);return}if(p&&r){d&&s(e,n),f(d?n+1:n);return}if(u.primary===t.primary&&u.secondary===t.secondary){s(e,n);return}}let m=!p||d;m&&s(e,n),f(m?n+1:n)};return mo(t,n).forEach(e=>{a(e),c(e,0)}),r},_o=[`init`,`next`,`invariant`,`constraint`,`implied`],vo=(e,t)=>!e||!t?e?1:t?-1:0:e.module===t.module?e.start.line-t.start.line||e.start.column-t.start.column||e.end.line-t.end.line||e.end.column-t.end.column:e.module<t.module?-1:1,yo=e=>_o.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>vo(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||vo(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),bo=(t,n,r,i)=>({variables:i.map(i=>{let a=r[i]?.range;return{label:`${n.variables[i]} ${a?e.X(a):`Unknown location`}`,distinct:co(t,i)}}),relations:yo(t).map(e=>({kind:e.kind,label:e.label,...ho(t,e),expressions:go(t,e.node)}))}),xo=(e,t,n)=>{let r=Ha(e,t,n);if(r===void 0)return;let i=e.primary[r],a=e.secondary[r];if(t===`init`)return[[`generated`,i+a],[`distinct`,i]];if(t===`next`)return[[`generated`,i],[`distinct`,a]];let o=e.firstChild[r];return[[`count`,o===-1?i:e.primary[o]]]},So=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),Co=(t,n)=>So.has(t)?new e.b(n):new e.O(n),wo=(t,n,r,i)=>new e.O(`The ${t} argument of ${n} should be a ${r}, but instead it is:\n${I(i)}`),To=(t,n,r=t)=>{if(!A(t)||un(t))throw new e.O(`Applying ${n} to the following value,\nwhich is not a finite set:\n${I(r)}`);return N(t)},Eo=e=>typeof e==`object`&&e.kind===`Operator`,L=(e,t,n)=>{let r=e[t];if(r===void 0||Eo(r))throw Co(n,`${n} expects a value as argument ${t+1}`);return r},Do=(e,t,n)=>{let r=L(e,t,n);if(typeof r!=`boolean`)throw Co(n,`${n} expects a boolean but received ${I(r)}`);return r},Oo=(e,t,n)=>{let r=e[t];if(r===void 0||!Eo(r))throw Co(n,`${n} expects an operator as argument ${t+1}`);return r},ko=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),R=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),Ao=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),jo=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),Mo=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(L(n,0,e),L(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),No=e=>e>2147483647||e<-2147483648,Po=t=>new e.O(`Overflow when computing ${t}`),Fo={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},Io={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Lo={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},Ro={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},zo=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Io[e.operator];if(e.kind!==`Function`)return Fo[e.kind];let t=Dn(e);return t===void 0?`FcnRcdValue`:Ro[t]},Bo=e=>Lo[zo(e)],Vo=(e,t)=>`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`,Ho=(t,n)=>new e.b(Vo(t,n)),Uo=(t,n)=>{let r=r=>(...i)=>{let a=pi.sets?.length??0;try{return r(...i)}catch(r){if(!(r instanceof e.b)||r instanceof e.v)throw r;let i=hi(a);throw pi.sets&&(pi.sets.length=a),t.isLazy!==!0&&r instanceof e.O&&!i?r:t.isLazy!==!0&&r instanceof e.k?new e.O(Vo(n,r.message)):Ho(n,r.message)}},i=r(t.evaluate);return{...t,evaluate:(e,r)=>{if(e.length!==t.arity)throw Ho(n,`array is not of length ${t.arity}`);return i(e,r)},evaluateUnary:t.evaluateUnary&&r(t.evaluateUnary),evaluateBinary:t.evaluateBinary&&r(t.evaluateBinary)}},Wo=(e,t)=>{if(typeof e!=`number`)throw Ho(t,`Cannot cast tlc2.value.impl.${zo(e)} to tlc2.value.impl.IntValue`);return e},Go=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Ko=(e,t,n,r)=>{let i=Go(e,n,`IntValue`,2);return Mo(t,(e,n)=>{let a=Wo(n,i),o=Wo(e,i),s=r(o,a);if(No(s))throw Po(`${o}${t}${a}`);return s})},qo=(t,n,r)=>{if(typeof t!=`number`)throw new e.O(`The ${n} argument of ${r} should be an integer, but instead it is:\n${I(t)}`);return t},Jo=(e,t,n=e)=>Mo(e,(e,r)=>t(qo(e,`first`,n),qo(r,`second`,n))),Yo=(e,t,n)=>({...jo(e,t,n),isLazy:!0}),Xo=(e,t,n)=>{let r=Oo(e,t,n);return()=>r.call([])},Zo=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),Qo=()=>({implication:Th,negate:Eh,equivalent:Dh,body:Oh,condition:(e,t)=>{if(typeof e!=`boolean`)throw ch(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw lh(t,n,e);return e},apply:Ni,expectFunction:xh,tuple:Fr,set:yr,record:Lr,writtenRecord:Vt,equal:Fn,enumerate:Fh,choiceElements:o_,noChoice:e=>{throw s_(e)},filterPredicate:a_,isReducible:jt,finiteElements:e=>N(e).elements,addBounded:Ot,normalizedSet:Cn,isBeyondBound:kt,cardinality:oi,functionDomain:Nr,sortedFunction:wn,unassigned:(e,t)=>{throw gh(e,t)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:Sh,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>yh(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let $o,es;const ts=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},ns=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),rs=e=>`local${e.counter++}`,is=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),D(e).forEach(e=>is(e,t)),t),as=(e,t,n)=>{let r=is(t),i=[...n.locals].filter(([e])=>r.has(e));if(i.length===0)return n.context;let a=ns(e,i.map(([e])=>e));return`extend(${n.context}, ${a}, [${i.map(([,e])=>e).join(`, `)}])`},os=(e,t,n)=>`${ns(e,H(t,e.environment))}(${as(e,t,n)})`,ss=(e,t,n)=>{let r=`helper${e.counter++}`,i=[...t.locals.values()],a={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(t.locals)},o=i.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${r}(context, state, next${o}) { let primed; let applied; ${n(a)} }`),`${r}(${t.context}, ${t.state}, ${t.isPrimed?`undefined`:t.next}${o})`},cs=(e,t,n,r)=>{let i=rs(e),a=rs(e),o=rs(e);return`for (let ${i} = 0, ${a} = ${t}.low, ${o} = ${a} === undefined ? ${t}.length : ${t}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${t}[${i}] : ${a} + ${i}; ${r} }`},ls=(e,t,n)=>{let r=t.kind===`Forall`;return ss(e,n,n=>{let i=t.bounds.map(()=>rs(e)),a=t.bounds.map((r,a)=>a>0&&t.bounds[a-1].set===r.set?`const ${i[a]} = ${i[a-1]};`:`const ${i[a]} = enumerate(${gs(e,r.set,n)}, ${ns(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=rs(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${gs(e,t.body,n)}, ${ns(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>cs(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},us=(e,t,n,r,i)=>ss(e,i,i=>{let a=rs(e),o=rs(e),s=ns(e,t),c=`choiceElements(${gs(e,n,i)}, ${s}, ${ns(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${gs(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${cs(e,a,o,l)} return noChoice(${s});`}),ds=(e,t,n,r)=>ss(e,r,r=>{let i=rs(e),a=rs(e),o=rs(e),s=rs(e),c=ns(e,t),l=`if (!isReducible(${i})) return ${ns(e,i_(t,e.environment))}(${i}, ${as(e,t,r)});`,u=gs(e,t.bound.set,r);r.locals.set(n,s);let d=`if (filterPredicate(${gs(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${cs(e,a,s,d)} return normalizedSet(${o});`}),fs=(e,t,n,r)=>ss(e,r,r=>{let i=rs(e),a=rs(e),o=rs(e),s=rs(e),c=rs(e),l=rs(e),u=ns(e,t_(t,e.environment)),d=as(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=gs(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${gs(e,t.body,r)}; if (!${a}) ${s}.push(${l});`;return`const ${i} = ${p}; ${f} const ${a} = isBeyondBound(${i}); const ${o} = ${a} ? ${i} : functionDomain(${i}); if (${a}) cardinality(${i}); const ${s} = []; ${cs(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),ps=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=gs(e,r[0],n),a=gs(e,r[1],n),o=ns(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${gs(e,r[0],n)}, ${ns(e,t)})`;if(t.operator===`<=>`)return`equivalent(${gs(e,r[0],n)}, ${gs(e,r[1],n)}, ${ns(e,t)})`;if(O(t))return os(e,t,n);let i=cg(t.operator,e.environment);if(i?.kind!==`Builtin`)return os(e,t,n);if(i.name===`DOMAIN`)return`${ns(e,fh(t))}(${gs(e,r[0],n)})`;if(i.name===`TLCEval`)return os(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${ns(e,ph(t,i))}(${gs(e,r[0],n)}, ${gs(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Vg(r[0],a))return`${ns(e,i.evaluateUnary)}(${gs(e,r[0],n)})`;let o=r.length===2&&Vg(r[0],a)&&Vg(r[1],a);return i.evaluateBinary&&o?`${ns(e,i.evaluateBinary)}(${gs(e,r[0],n)}, ${gs(e,r[1],n)})`:os(e,t,n)},ms=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(O(e))return!1;let r=yg(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return ms(e.expression,t,n);case`FieldAccess`:return ms(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>ms(e,t,n));default:return!1}},hs=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return hs(e.record);case`FunctionApplication`:return[e.function,...e.args].every(hs);default:return!1}},gs=(e,t,n)=>{let r=(t,r=n)=>gs(e,t,r);switch(t.kind){case`Number`:return Ft(t.value)?String(t.value):os(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(O(t))return os(e,t,n);let i=yg(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=ns(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?ns(e,i.value):os(e,t,n)}case`Apply`:return ps(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=ns(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${ns(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Xg(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${ms(t.function,n,e.environment)?r(t.function):hs(t.function)?r(t.function,i):os(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${ns(e,t)}))`,o=dh(e.environment.runtime.version),s=o?`, ${ns(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${ns(e,uh(t))}(${r(t.record)})`;case`Record`:{let i=l_(t.fields);if(u_(i))return os(e,t,n);let a=ns(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${ns(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:return n.isPrimed?os(e,t,n):r(t.expression,{context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals});case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?ls(e,t,n):os(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?us(e,t,t.set,t.pattern.name,n):os(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!e_(t)?fs(e,t,r.pattern.name,n):os(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?ds(e,t,t.bound.pattern.name,n):os(e,t,n);default:return os(e,t,n)}},_s=(e,t)=>{if(!Zo.has(e.kind)||(es??=ts(),!es))return;let n={environment:t,references:[],helpers:[],counter:0},r=gs(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
77
+ `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return $o??=Qo(),Function(...Object.keys($o),...i,a)(...Object.values($o),...n.references)},vs={kind:`Local`},ys=/* @__PURE__ */ new WeakSet,bs=/* @__PURE__ */ new WeakMap,xs=/* @__PURE__ */ new WeakMap,Ss=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Cs=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),ws=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Ts=e=>e.kind===`Operator`?e.params.length:0,Es=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Ds=e=>e.name.includes(`!`),Os=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},ks=(e,t,n)=>{let r=t.bindings.get(e);return r&&ws(r.position,t.location)&&(!n||ws(r.position,n.start))?r:void 0},As=(t,n)=>t!==void 0&&n!==void 0&&e.X(t)===e.X(n),js=(t,n,r,i)=>{if(n===void 0)return!0;if(As(n.range,r.range))return!1;let a=r.range;if(a===void 0||i.isGenerated||n.kind!==`Builtin`&&!n.range)return!0;let o=e.X(a),s=n.range&&e.X(n.range);return n.kind===`Builtin`?i.errors.push({location:o,message:`Symbol ${t} is a built-in operator, and cannot be redefined.`}):r.kind===`Parameter`||n.kind!==r.kind||n.arity!==r.arity?i.errors.push({location:o,message:`Multiply-defined symbol '${t}': this definition or declaration conflicts \nwith the one at ${s}.`}):i.warnings.push({location:o,message:`Multiple declarations or definitions for symbol ${t}. \nThis duplicates the one at ${s}.`}),!1},Ms=(e,t,n,r)=>js(t,Os(e,t)??ks(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Ns=(e,t,n)=>{js(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Ps=(e,t,n,r)=>t.reduce((e,t,i)=>Ms(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Fs=(e,t,n)=>t.reduce((e,t)=>Ms(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Is=e=>e.kind===`Name`?[e.name]:e.names,Ls=e=>e.flatMap(e=>Is(e.pattern)),Rs=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||ws(n.location,t.location))?n:void 0},zs=(e,t)=>{let n=Rs(e,t);return n?{key:t.getKey(n),arity:Ts(n),params:Es(n),kind:`Definition`}:t.imported.get(e)},Bs=(e,t,n)=>Os(t,e)??zs(e,n),Vs=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Hs=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Vs(e.location,e.spelling??t)},Us=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return ws(e.location,e.args[0].location)?`prefix`:`postfix`}},Ws=e=>!/^[\p{L}\d_]/u.test(e),Gs=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Ks=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,qs=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},Js=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?qs(e.name,[],void 0):qs(e.operator,e.args,e.argumentCounts),Ys=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Xs=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Ls(e.bounds),body:e.body,sets:Ys(e.bounds)};case`SetMap`:return{names:Ls(e.bounds),body:e.expression,sets:Ys(e.bounds)};case`SetFilter`:return{names:Is(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Is(e.pattern),body:e.body,sets:e.set?[e.set]:[]};case`UnboundedQuantifier`:case`Lambda`:return{names:e.kind===`Lambda`?e.params:e.names,body:e.body,sets:[]};default:return}},Zs=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},Qs=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,$s=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),ec=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?ec(e.body,t):D(e).reduce((e,n)=>e??ec(n,t),void 0)},tc=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??tc(i,t,n||$s(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&ec(e.set,t):ec(e,t)},nc=e=>e.kind===`Label`?nc(e.body):e,rc=e=>typeof e==`number`?`argument selector ${e}`:e,ic=`within the scope of a declaration
78
+ from outside that declaration's scope.`,ac=(t,n,r,i,a,o)=>{let s=(n,r)=>{let i=(n===void 0?void 0:t.selectorRanges?.[n])??t.location.range;i&&a.errors.push({location:e.X(i),message:r})},c=r.isSuffices===r.isInProof,l=r.statement,u={node:l,isGoal:!0,isSufficesOpen:r.isSuffices};for(let[e,t]of n.slice(1).entries()){let r=e+1,o=u.node;if(t.kind===`Name`){if(n[r-1].kind!==`Name`)return o.kind!==`NewSymbol`&&o.kind!==`AssumeProve`&&nc(o).kind===`Let`?void 0:s(r-1,`A name selector here must be from a LET clause.`);let e=l.kind===`AssumeProve`?[...l.assumptions,l.conclusion]:[l],i=r===1?e.map((e,n)=>({position:n,label:tc(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:o.kind===`Label`?ec(o.body,t.name):void 0};if(!i?.label)return s(r,`Cannot find label \`${t.name}'.`);if(r===1&&l.kind===`AssumeProve`&&$s(l,i.position)&&c)return s(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${ic}`);if(t.args.length!==i.label.params.length)return s(r,`Label \`${t.name}' used with wrong number of arguments.`);u.node=i.label,u.isGoal=!1,u.isSufficesOpen=!1;continue}if(t.kind!==`Operand`)return;let d=rc(t.operand);if(u.isSufficesOpen){if(Ks(t.operand,1)!==0)return s(r,o.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);u.isSufficesOpen=!1;continue}if(o.kind===`NewSymbol`)return;if(o.kind!==`AssumeProve`){let e=nc(o);if([`Number`,`Decimal`,`String`].includes(e.kind))return s(r,`Selecting subexpression of expression that has none.`);let n=e.kind===`Identifier`?Bs(e.name,i,a)?.kind:void 0;if(n===`Variable`||n?.startsWith(`New`))return s(r,`Choosing operand \`${d}' of subexpression with no operands.`);let c=Xs(e)?.sets,l=e.kind===`Identifier`?[]:c?c.length>0?c:void 0:e.kind===`Except`?void 0:Zs(e);if(!l)return;let f=Ks(t.operand,l.length);if(f===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);u.node=l[f],u.isGoal=!1;continue}let f=[...o.assumptions,o.conclusion],p=Ks(t.operand,f.length);if(p===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);if($s(o,p)&&(!u.isGoal||c))return s(r,`Accessing ASSUME/PROVE clause ${ic}`);let m=f[p];if(m.kind===`NewSymbol`&&r!==n.length-1)return s(r,`Selected a subexpression of a NEW clause of an ASSUME.`);u.node=m,u.isGoal=!1}o||(u.node.kind===`AssumeProve`&&s(void 0,`Selected ASSUME/PROVE instead of expression.`),u.node.kind===`NewSymbol`&&s(void 0,`Selected a NEW declaration as an expression or operator.`))},oc=(t,n)=>{let r=n.isGenerated?void 0:n.hasLabelScope?n.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:n.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return r===void 0||!t.location.range?!1:(n.errors.push({location:e.X(t.location.range),message:r}),!0)},sc=(t,n,r)=>{let i=t.location.range;if(!i||r.isGenerated)return;let a=e.X(i),o=t.params.filter((i,a)=>{let o=Os(n,i)?.kind===`Parameter`,s=t.paramRanges?.[a];return!o&&s&&r.errors.push({location:e.X(s),message:`Illegal parameter ${i} of label \`${t.name}'.`}),o});o.filter((e,t)=>o.indexOf(e)!==t).forEach(e=>r.errors.push({location:a,message:`Repeated formal parameter ${e} \nin label \`${t.name}'.`})),r.labelParams.filter(e=>!o.includes(e)).forEach(e=>r.errors.push({location:a,message:`Label ${t.name} must contain formal parameter \`${e}'.`}));let s=[...new Set(o.filter(e=>!r.labelParams.includes(e))),...t.params.filter(e=>!o.includes(e))];s.length>0&&r.errors.push({location:a,message:`Label ${t.name} declares extra parameter(s) ${s.map(e=>`${e} `).join(``)}`}),r.labels.has(t.name)&&r.errors.push({location:a,message:`Duplicate label \`${t.name}'.`}),r.labels.add(t.name)},cc=(e,t,n,r)=>{if(!Qs(e))return!1;let i=Js(e),a=i[0],o=i.length>1&&a.kind===`Name`?Os(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&ac(e,i,o,t,n,r),o!==void 0},lc=(t,n,r,i)=>{let a=t.location;if(yc(t,r,i))return;let o=xs.get(t);if(o!==void 0)return o;if(Ss(n))return t.kind===`Apply`?t.args.length:0;let s=Os(r,n);if(s?.isNonFact){i.errors.push({location:e.X(Hs(t,n)),message:`Step number of non-expression step used as an expression.`});return}if(cc(t,r,i,!1)||Gs(n)&&s)return t.kind===`Apply`?t.args.length:0;if(s&&t.kind!==`OperatorReference`&&(t.resolution=vs),s)return s.arity;let c=zs(n,i);if(c)return t.kind===`Identifier`?t.name=c.key:t.operator=c.key,xs.set(t,c.arity),c.arity;let l=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``;if(l!==``&&(Os(r,l)!==void 0||zs(l,i)!==void 0||i.facts.has(l)))return t.kind===`Apply`?t.args.length:0;let u=(t.kind===`Identifier`?void 0:t.spelling)??n,d=e.X(t.kind===`Apply`&&u===`-.`?Vs(a,`-`):Hs(t,n));if(!Ws(n)||Gs(n)){i.errors.push({location:d,message:`Unknown operator: \`${n}'.`});return}i.errors.push({location:d,message:`Could not find declaration or definition of symbol '${u}'.`});let f=Us(t);f&&a.range&&i.errors.push({location:e.X(a.range),message:`Couldn't resolve ${f} operator symbol \`${u}'.`})},uc=(e,t,n)=>(e.forEach(e=>z(e.set,t,n)),e.reduce((e,t)=>Ps(e,Is(t.pattern),t.pattern.ranges,n),t)),dc=(e,t)=>e.kind===`Identifier`&&e.name===t&&O(e)||D(e).some(e=>dc(e,t)),fc=(e,t)=>{e.kind===`FunctionConstruction`&&dc(e.body,t)&&(e.isRecursive=!0),D(e).forEach(e=>fc(e,t))},pc=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?Ls(t.bounds):[],labels:/* @__PURE__ */ new Set},o=t.name,s=t.location.range,c=t=>{s&&!a.isGenerated&&a.errors.push({location:e.X(s),message:t})},l=t.kind===`Function`?uc(t.bounds,n,a):Fs(n,t.params,a),u=Os(l,o)??ks(o,a,s),d=u?.isPending===!0&&i.has(u);return u?.isPending&&!d?c(`Recursive ${t.kind===`Function`?`function`:`operator`} ${o} defined at wrong LET/IN level.`):u&&!d&&c(t.kind===`Function`?`Function name \`${o}' already defined or declared.`:`Operator ${o} already defined or declared.`),t.kind===`Function`?(z(t.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),fc(t.body,o),t.isSelfReferential=dc(t.body,o)):z(t.body,l,a),u&&d?(u.isPending=!1,u.range=s,!1):t.kind===`Function`?u===void 0:js(o,Os(n,o)??ks(o,a,s),{kind:`Definition`,arity:Ts(t),range:s},a)},mc=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Os(e,t.name)?.isPending)return e;let n={name:t.name,arity:Ts(t),params:Es(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>Tc(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Ss(t.name)?e:s(e,e=>!ws(t.location,e.location)),o={name:t.name,arity:Ts(t),kind:`Definition`,range:t.location.range,parent:a};if(Ds(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Ss(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return pc(t,a,u,i)?{...o,params:Es(t)}:a},a),()=>!0)},hc=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Os(t,r)??ks(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},gc=(t,n,r)=>{if(t.kind!==`Identifier`&&t.kind!==`Apply`)return!1;let i=hc(t.kind===`Identifier`?t.name:t.operator,n,r),a=t.kind===`Apply`?t.argumentCounts?.[0]??0:0;if(!i||a===i.arity)return!1;let o=(t.kind===`Apply`?t.argumentRanges?.[0]:void 0)??t.location.range;return o&&r.errors.push({location:e.X(o),message:`The operator ${i.name} requires ${i.arity} arguments.`}),!0},_c=(t,n,r)=>{if(gc(t,n,r))return;let i=t.operator,a=Bs(i,n,r),o=lc(t,i,n,r);if(o===void 0)return;if(o!==t.args.length){r.errors.push({location:e.X(t.argumentsRange??Hs(t,i)),message:`The operator ${i} requires ${o-(hc(i,n,r)?.arity??0)} arguments.`});return}let s=a&&(a.kind===`Definition`?a.params:[]);if(s===void 0){t.args.forEach(e=>vc(e,n,r));return}let c=(t,n)=>{t&&r.errors.push({location:e.X(t),message:n})};t.args.map((e,a)=>{let o=s[a]??0,l=e.location.range;if(o===0){if(e.kind===`Lambda`&&e.operator!==void 0)c(l,`The operator ${e.operator} requires 1 arguments.`);else if(e.kind===`Lambda`&&l)c(l,`LAMBDA expression used where an expression is required.`);else if(e.kind===`OperatorReference`){let t=lc(e,e.operator,n,r);t!==void 0&&c(l,`The operator ${e.operator} requires ${t} arguments.`)}else z(e,n,r);return!0}if(e.kind===`Lambda`){z(e,n,r);let s=e.params.length===o;return!s&&ys.has(e)?c(l,`Expected arity ${o} but found operator of arity ${e.params.length}.`):!s&&l&&e.operator===void 0&&c(t.selectorRanges?.at(-1)??Hs(t,i),`Lambda expression with arity ${e.params.length} used as argument ${a+1} of operator \`${i}', \nbut an operator of arity ${o} is required.`),s}if(e.kind===`Subexpression`)return z(e,n,r),!0;if(e.kind===`Apply`&&e.argumentCounts?.at(-1)===0){let t=e.argumentCounts.findIndex(e=>e>0);return c(e.selectorRanges?.[t],`Selector \`${e.operator.split(`!`)[t]}' should not have argument(s).`),!1}if(e.kind!==`Identifier`&&e.kind!==`OperatorReference`)return c(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${i}', in a position an operator is required.`),!1;let u=e.kind===`Identifier`?e.name:e.operator,d=Bs(u,n,r)?.params??[],f=lc(e,u,n,r);return e.kind===`Identifier`&&f!==void 0&&f!==o&&c(Hs(e,u),`Expected arity ${o} but found operator of arity ${f}.`),f===o&&d.every(e=>e===0)}).forEach((e,n)=>{e||c(t.location.range,`Argument number ${n+1} to operator '${i}' \nshould be a ${s[n]}-parameter operator.`)})},vc=(e,t,n)=>{e.kind===`Identifier`?lc(e,e.name,t,n):z(e,t,n)},yc=(e,t,n)=>{let r=bs.get(e);return r?(r.args.forEach(e=>vc(e,t,n)),n.errors.push(r.error),!0):!1},z=(t,n,r)=>{if(ys.has(t)&&!r.isGenerated){z(t,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>z(e,n,r)),a=e=>({...r,labelParams:[...r.labelParams,...e]});switch(t.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(gc(t,n,r))return;let i=t.name,a=lc(t,i,n,r);a!==void 0&&a>0&&r.errors.push({location:e.X(Hs(t,i)),message:`The operator ${i} requires ${a} arguments.`});return}case`OperatorReference`:lc(t,t.operator,n,r);return;case`Apply`:_c(t,n,r);return;case`Lambda`:z(t.body,Ps(n,t.params,t.paramRanges,r),a(t.params));return;case`And`:case`Or`:i(t.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:z(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&&z(t.other,n,r);return;case`Let`:z(t.body,mc(t.definitions,n,r,t.instances),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:z(t.body,uc(t.bounds,n,r),a(Ls(t.bounds)));return;case`UnboundedQuantifier`:z(t.body,Ps(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&z(t.set,n,r),z(t.body,Ps(n,Is(t.pattern),t.pattern.ranges,r),a(Is(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:z(t.predicate,uc([t.bound],n,r),a(Is(t.bound.pattern)));return;case`SetMap`:z(t.expression,uc(t.bounds,n,r),a(Ls(t.bounds)));return;case`FunctionSet`:i([t.domain,t.range]);return;case`Record`:case`RecordSet`:t.fields.forEach((i,a)=>{t.fields.slice(0,a).some(e=>e.name===i.name)&&r.errors.push({location:e.X(i.location.range??Vs(i.location,i.name)),message:`Non-unique fields in constructor.`}),z(i.value,n,r)});return;case`Except`:z(t.function,n,r),t.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),z(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:i([t.function,...t.args]);return;case`FieldAccess`:z(t.record,n,r);return;case`Product`:i(t.factors);return;case`BoxAction`:case`AngleAction`:i([t.action,t.subscript]);return;case`WeakFairness`:case`StrongFairness`:i([t.subscript,t.action]);return;case`Label`:if(oc(t,r))return;z(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),sc(t,n,r);return;case`Subexpression`:if(yc(t,n,r))return;t.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>vc(e,n,r)),cc(t,n,r,!1)}},bc=(t,n,r)=>t.forEach(t=>{if(t.kind===`ModuleFact`||gc(t,n,r)||cc(t,n,r,!0))return;let i=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;t.kind===`Identifier`&&Os(n,i)?.isNonFact?r.errors.push({location:e.X(Hs(t,i)),message:`Step number of non-fact used as a fact`}):r.facts.has(i)||z(t,n,r)}),xc=(e,t,n)=>(e.set&&z(e.set,t,n),Ms(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Sc=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:xc(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Sc(t,e.scope,e.unit,!0):z(t,e.scope,e.unit),e),{scope:t,unit:n});return z(e.conclusion,i.scope,i.unit),i.scope},Cc=(e,t,n)=>e.kind===`AssumeProve`?Sc(e,t,n):(z(e,t,n),t),wc=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&bc(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Ec(t,e,r),t)},Tc=(e,t,n)=>{let r=Mc(e,t,n);return e.name===void 0?r:Ms(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Ec=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=Cc(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return wc(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return wc(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return bc(r.facts,t,n),o(t);case`Instance`:return o(Tc(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?Tc(t,e,i):mc([t],e,n),t));case`Have`:case`Case`:return z(r.expression,t,i),wc(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>z(e,t,i)),a(t);case`Take`:return a(Ps(uc(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Ps(uc(r.bounds,t,i),r.names,r.nameRanges,i);return z(r.body,o,{...i,labelParams:[...i.labelParams,...Ls(r.bounds),...r.names]}),wc(e.proof,a(t),n),a(o)}default:return wc(e.proof,a(t),n),a(t)}},Dc=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Cc(e.statement,void 0,t);e.name!==void 0&&Ns(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),wc(e.proof,n,t),r&&(r.isInProof=!1)},Oc={line:0,column:0},kc=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Ac=(e,t)=>{let n=new Map([...Cs,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},jc=(t,n,r,i,a)=>{let o=t.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(n,r)=>{if(n.arity===0||r.kind!==`Identifier`){z(r,o,a);return}let i=lc(r,r.name,o,a);if(i!==void 0&&i!==n.arity)throw new e.F(`An operator must be substituted for symbol '${n.name}', and it must have arity ${n.arity} in the instance of ${t.module} at line ${t.location.line}, column ${t.location.column}`)},c=/* @__PURE__ */ new Map;t.substitutions.forEach(t=>{let r=t.name,i=n.find(e=>e.name===r);if(!i){a.errors.push({location:e.X(t.nameRange),message:`Identifier '${r}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let o=t.expression;s(i,o);let l=o.location.range;c.has(r)?l&&a.errors.push({location:e.X(l),message:`Multiple substitutions for symbol '${r}' in substitution.`}):c.set(r,o)});let l=n.filter(e=>!c.has(e.name)),u=e=>!Os(o,e.name)&&!zs(e.name,a);return l.filter(e=>!u(e)).forEach(e=>{let n={kind:`Identifier`,name:e.name,location:t.location};s(e,n),c.set(e.name,n)}),l.filter(u).forEach(n=>{let i=t.location.range,o=n.location.range;i&&o&&a.errors.push({location:e.X(i),message:`Substitution missing for symbol ${n.name} declared at ${e.X(o)} \nand instantiated in module ${r}.`})}),c},Mc=(e,t,n)=>{let r=n.getInstance(e);return jc(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Ms(e,t,r,n),t)},Nc=(e,t,n,r)=>{let i=Ac(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),jc(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:Oc}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Pc=(t,n)=>{let r=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return t.toSorted((e,t)=>ws(e.location,t.location)?-1:+!!ws(t.location,e.location)).forEach(t=>{let a=[],o=[];try{t.check(a,o)}catch(t){if(!(t instanceof e.F)||!t.sany&&a.length===0)throw t;a.push(...t.sany?.errors??[])}a.forEach(e=>i(r,e)),o.forEach(e=>i(n,e))}),r},Fc=(t,n)=>{let r=Ac(t,n.imported),i=/* @__PURE__ */ new Set([...n.facts,...[...t.theorems,...t.assumptions].flatMap(e=>e.name??[])]),a=new Map(t.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),o=new Map([...Cs,...n.bound].map(([e,t])=>[e,{...t,position:Oc}])),s=/* @__PURE__ */ new Set,c=[],l=(e,t,s,c,l)=>({imported:r,getInstance:n.getInstance,definitions:n.definitions,getKey:n.getKey,location:e,self:t,facts:i,goals:a,bindings:o,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),u=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>Ns(e.name,{kind:t,arity:e.arity,range:e.location.range},l(e.location,void 0,n,r,!1))}));return Pc([...n.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...u(t.constants,`Constant`),...u(t.variables,`Variable`),...t.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=js(e.name,o.get(e.name),r,l(e.location,void 0,t,n,!1));i&&(o.set(e.name,r),s.add(r)),c.push({declaration:e,binding:i?r:void 0})}})),...t.definitions.map(e=>({location:e.location,check:(n,r)=>{let i=l(e.location,e,n,r,!0);kc(t,e)?z(e.body,void 0,i):pc(e,void 0,i,s)&&o.set(e.name,{kind:`Definition`,arity:Ts(e),range:e.location.range,position:e.location})}})),...t.instances.map(e=>({location:e.location,check:(t,r)=>{let i=l(e.location,void 0,t,r,!1);Fs(void 0,e.params,i),n.instanced.get(e)?.forEach((e,t)=>Ns(t,e,i)),e.name!==void 0&&Ns(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...t.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=l(e.location,void 0,t,n,e.name!==void 0);z(e.expression,void 0,r),e.name!==void 0&&Ns(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...t.theorems.map(e=>({location:e.location,check:(t,n)=>Dc(e,l(e.location,void 0,t,n,e.name!==void 0))})),...t.uses.map(e=>({location:e.location,check:(t,n)=>bc(e.facts,void 0,l(e.location,void 0,t,n,!1))})),{location:t.location.range?.end??t.location,check:t=>c.forEach(n=>{let r=n.declaration.location.range;r&&(!n.binding||n.binding.isPending)&&t.push({location:e.X(r),message:`Symbol ${n.declaration.name} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},Ic=/* @__PURE__ */ new WeakSet,Lc=/* @__PURE__ */ new WeakMap,Rc=(e,t)=>{if(t.length===0)return e;let n={...e};return Ic.has(e)&&Ic.add(n),Lc.set(n,[...t,...Lc.get(e)??[]]),n},zc=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Gc(e,(e,r)=>zc(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&O(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&O(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Bc=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Vc=/* @__PURE__ */ new WeakMap,Hc=e=>Vc.get(e)??e.name,Uc=(e,t)=>(Hc(t)!==e.name&&Vc.set(e,Hc(t)),e),Wc=(e,t)=>Uc(e.kind===`Function`?{...e,bounds:Bc(e.bounds,e=>t(e,[])),body:t(e.body,Ls(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Gc=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>Wc(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Bc(e.bounds,n),body:t(e.body,Ls(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,Is(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,Is(e.bound.pattern))};case`SetMap`:return{...e,bounds:Bc(e.bounds,n),expression:t(e.expression,Ls(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Kc=`LAMBDA`,qc=e=>`${e}@SUBSTITUTION`,Jc=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(Jc),Yc=(e,t)=>{if(e.kind!==`Identifier`)return!Jc(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=O(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!Jc(n.body)},Xc=(e,t=/* @__PURE__ */ new Set)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0,r=n===void 0||t.has(n)?[]:[n];return Gc(e,(e,n)=>(r.push(...Xc(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Zc=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},Qc=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),$c=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},el=(e,t)=>e.map(e=>({pattern:$c(e.pattern,t),set:e.set})),tl=(e,t)=>e.kind===`Function`?{...e,bounds:el(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},nl=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>Uc({...tl(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:el(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:$c(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:$c(e.bound.pattern,n),set:e.bound.set}};default:return e}},rl=e=>`${e}@ENABLED`,il=(e,t)=>e.modes.get(t)??e,al=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!O(e)&&t.instantiation.variables.has(e.name),ol=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>ol(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(al(e,t,n))return[e.name];let r=O(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?ol(r.body,t,/* @__PURE__ */ new Map):void 0},sl=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return al(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:rl(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:fl(e.expression,il(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[fl(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:fl(e.subscript,il(t,`Primed`),n),location:r},fl(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=ol(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:rl(r),location:e.location},location:e.location},fl({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},cl=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:vs}),ll=(e,t)=>e.map(e=>cl(e.name,t)),ul=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...ll(t,r),...i.map(e=>cl(e,r))],location:r},location:r}},dl=(e,t)=>e.instantiation.isParameterized(t)?ml(e,t):void 0,fl=(t,n,r)=>{let i=e=>fl(e,n,r),a=n.instantiation,o=a.params,s=e=>!r.has(e)&&!O(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:fl(t.expression,il(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:fl(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},il(n,`Enabled`),r)};let c=sl(t,n,r);if(c)return c;if(t.kind===`Identifier`&&s(t.name)){let e=a.substitutions.get(t.name),r=n.bindings;if(e&&(r===void 0||!Yc(e,a)))return Rc(e,[t]);if(e&&r){let n=qc(t.name);return r.set(n,e),cl(n,t.location)}let i=dl(n,t.name);if(i===void 0)return t;if(o.length===0)return{...t,name:i};let s=a.getDefinition(t.name);return s&&Ts(s)>0?ul(i,o,Ts(s),t.location):{kind:`Apply`,operator:i,args:ll(o,t.location),location:t.location}}if(t.kind===`Apply`&&s(t.operator)){let r=t.args.map(i),s=a.substitutions.get(t.operator),c=a.substitutions.size>0||o.length>0||Ic.has(t),l=e=>(c&&Ic.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let e=s.kind===`Identifier`?s.name:s.operator;return l({...t,operator:e,args:r,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...t,operator:s.operator,args:[...s.args,...r],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Kc,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:Kc,args:r,resolution:vs},location:t.location};if(s)throw new e.F(`The operator ${t.operator} can only be substituted by an operator at line ${t.location.line}, column ${t.location.column}`);let u=dl(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[...ll(o,t.location),...r]}}if(t.kind===`OperatorReference`&&s(t.operator)){let e=dl(n,t.operator);if(e===void 0)return t;let r=a.getDefinition(t.operator);return o.length>0&&r?ul(e,o,Ts(r),t.location):{...t,operator:e}}let l=Zc(n),u=Gc(t,(e,t)=>t.length===0?i(e):fl(e,n,Qc(r,t,l)));return nl(u,r,l)},pl=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:cl(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},ml=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=Zc(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=tl(Wc(i,(e,t)=>fl(e,s,Qc(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(([e,t])=>({kind:`Operator`,name:e,params:[],body:t,isLocal:!0,isRecursive:!1,location:t.location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&Lc.set(l,[u,...Lc.get(i.body)??[]]),pl({...c,body:l},r.params,i.location)}):t},hl=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Xc(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>dl(i,e)??e,getQualifiedKey:t=>{let n=dl(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>pl(r,e.params,r.location)):t}}},gl=e=>e.kind===`Let`&&e.instances!==void 0||D(e).some(gl),_l=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Gc(e,e=>_l(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>ws(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},vl=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,yl=(e,t)=>e.definitions.some(e=>gl(e.body))||e.assumptions.some(e=>gl(e.expression))||e.theorems.some(e=>{let t=vl(e);return t!==void 0&&gl(t)})?{...e,definitions:e.definitions.map(e=>Wc(e,e=>_l(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:_l(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=vl(e);return n===void 0?e:{...e,statement:_l(n,t,[])}})}:e,bl=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),xl={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},Sl=(e,t)=>{let n=xl[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Cl=(e,t)=>`${e}${t}`,wl=(e,t,n)=>`${e}${t}${n}`,Tl=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},El=(e,t,n)=>`${e},${t},${n}`,Dl=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Ol=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),kl=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Al=(e,t,n,r)=>({...Dl(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),jl=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Ml=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Nl=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{...Al(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Pl=Al(`$Set`,0,[2],[1]),Fl=Al(`$Junction`,0,[3],[1]),Il=Al(`$Choose`,0,[2],[1]),Ll=Al(`$Function`,0,[3],[1]),Rl=Al(`$FcnApply`,0,[2,2],[1,1]),zl=Al(`$RcdSelect`,0,[2,0],[1,1]),Bl=Al(`'`,2,[1],[0]),Vl=Al(`ENABLED`,1,[2],[0]),Hl=Al(`[]`,3,[3],[0]),Ul=Al(`$SquareAct`,2,[2,1],[0,0]),Wl=Al(`$WF`,3,[1,2],[0,0]),Gl=Al(`$TemporalExists`,3,[3],[0]),Kl=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),ql=e=>e.map(e=>({name:e,arity:0})),Jl=(t,n)=>n.location.range?e.J(`${t}.`,n.location.range):new e.F(`${t} at line ${n.location.line}, column ${n.location.column}`),Yl=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Xl=e=>e.kind!==`Let`&&e.kind!==`Label`,Zl=t=>{let n=/* @__PURE__ */ new Map,r=(e,n)=>{let r=n.get(e);if(r?.kind===`Formal`)return{kind:`Declared`,name:e,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:_(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=_(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Nl.get(e)??bl.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},i=(e,t,n)=>{let r=Dl(Math.max(t,...n.map(e=>e.data.level)));return r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(wl(e,n,t))}),t.data.constraints.forEach((e,t)=>Ol(r.constraints,t,e)),kl(r.argConstraints,Cl(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>kl(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},a=(t,n,r=[],i=[])=>{let a=e=>i.includes(e);if(n.forEach((n,r)=>{if(!(n.operator||n.declared)&&n.data.level>jl(t,r))throw new e.F(`Level error in applying operator ${t.name}:\nThe level of argument ${r+1} exceeds the maximum level allowed by the operator`)}),r.some(e=>e.level>2))throw new e.F(`Level error in applying operator ${t.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let o=e=>{let r=t.formals.findIndex(t=>t.name===e);return r===-1?void 0:n[r]},s=(e,n,r)=>t.conditions.has(El(e,n,r)),c=Dl(Math.max(t.level,...n.filter((e,n)=>Ml(t,n)===1).map(e=>e.data.level),...r.map(e=>e.level)));return t.params.forEach(e=>c.params.add(e)),n.forEach((e,n)=>{Ml(t,n)===1&&e.data.params.forEach(e=>c.params.add(e))}),r.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),t.constraints.forEach((e,t)=>Ol(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||Ol(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>Ol(c.constraints,t,e))),n.forEach((e,n)=>e.data.params.forEach(e=>{a(e)||Ol(c.constraints,e,jl(t,n))})),n.forEach((e,t)=>{let r=e.operator;r&&n.forEach((e,n)=>r.formals.forEach((i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>Ol(c.constraints,e,jl(r,a)))}))}),t.argParams.forEach(e=>{let t=Tl(e),n=o(t.operator)?.operator;n&&Ol(c.constraints,t.param,jl(n,t.index))}),[t.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>kl(c.argConstraints,t,e))),n.forEach((e,r)=>{let i=e.declared;i&&(Array.from({length:i.arity},(e,n)=>kl(c.argConstraints,Cl(i.name,n),t.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&kl(c.argConstraints,Cl(i.name,a),e.data.level)})))}),t.argParams.forEach(e=>{let t=Tl(e),n=o(t.operator);n&&kl(c.argConstraints,Cl(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a(Tl(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),t.argParams.forEach(e=>{let t=Tl(e),n=o(t.operator);if(n)n.declared&&c.argParams.add(wl(n.declared.name,t.index,t.param));else{let n=o(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(wl(t.operator,t.index,e)))}}),n.forEach((e,t)=>{let r=e.declared;r&&n.forEach((e,n)=>Array.from({length:r.arity},(i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>c.argParams.add(wl(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`){let n=ee(`LAMBDA`,ql(e.params),e.body,t);return{data:n,operator:n}}let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let i=r(n,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=Dl();return e.params.add(n),{data:e,declared:{name:n,arity:i.arity}}}if(e.kind===`OperatorReference`)return{data:Dl()}}return{data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=Kl(n,ql(i));return a(e,s(t,o),r.map(e=>m(e,n)),i)},l=(e,t)=>e.kind===`Declared`?i(e.name,e.level,t):a(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw Jl(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw Jl(`Action used where only temporal formula or state predicate allowed`,e);Yl.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Xl(n)&&n.kind!==r)throw Jl(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=_(e,n);t.constraints.forEach((e,t)=>Ol(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>kl(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(t,n)=>{try{return h(t,n)}catch(n){throw!(n instanceof e.F)||n.sany?n:Jl(n.message,t)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Dl();case`Identifier`:return l(r(e.name,t),[]);case`Apply`:{let n=s(e.args,t);return d(e,n),l(r(e.operator,t),n)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(Fl,n)}case`Prime`:case`Unchanged`:return c(Bl,[e.expression],t);case`Enabled`:return c(Vl,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(Hl,[n])}case`If`:return c(Fl,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(Fl,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=c(Fl,[e.body],t,e.bounds.map(e=>e.set),Ls(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Jl(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?Gl:Fl,[e.body],t,[],e.names);case`Choose`:return c(Il,[e.body],t,e.set?[e.set]:[],Is(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(Pl,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(Pl,[e.predicate],t,[e.bound.set],Is(e.bound.pattern));case`SetMap`:return c(Pl,[e.expression],t,e.bounds.map(e=>e.set),Ls(e.bounds));case`FunctionConstruction`:return c(Ll,[e.body],t,e.bounds.map(e=>e.set),Ls(e.bounds));case`Record`:return c(Ll,e.fields.map(e=>e.value),t);case`RecordSet`:return c(Pl,e.fields.map(e=>e.value),t);case`Except`:return c(Pl,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(Rl,[o(e.function,t),e.args.length===1?o(e.args[0],t):{data:c(Pl,e.args,t)}]);case`Bracket`:return Dl();case`FieldAccess`:return a(zl,[o(e.record,t),{data:Dl()}]);case`BoxAction`:case`AngleAction`:return c(Ul,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(Wl,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Dl()}},g=(e,t,n=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,r=n,a=t)=>g(e,a,r,i),o=(e,o)=>{let s=r(e,t);s.kind===`Declared`?(n&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,n||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return D(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,Kl(t,ql(e.names))),i;default:return Gc(e,(e,r)=>(a(e,n,Kl(t,ql(r))),e)),i}},ee=(e,t,n,r)=>{let i=Kl(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...Dl(a.level),name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get(Cl(e.name,n))??0)),conditions:new Set(t.flatMap((e,n)=>t.flatMap((t,r)=>Array.from({length:e.arity},(e,t)=>t).filter(n=>a.argParams.has(wl(e.name,n,t.name))).map(e=>El(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(Tl(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Tl(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},_=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{...Dl(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=ee(e.name,i,a,t);return n.set(e,o),o};return{analyze:m,analyzeDefinition:_,toOperand:o}},Ql=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?Ql(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Dl(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Ol(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>kl(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},$l=(t,n,r,i)=>{let a=Zl(n),o=e=>Math.max(0,...e.map(e=>a.analyze(e,/* @__PURE__ */ new Map).level)),s=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?o([t.expression]):t.kind===`Witness`?o(t.expressions):t.kind===`Take`?o(t.bounds.map(e=>e.set)):t.kind===`Pick`?o([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?Ql(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},c=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=e.X(t.statement),r=()=>s(t)===0;return t.body.kind===`Have`||t.body.kind===`Take`||t.body.kind===`Witness`?r()?[]:[{location:n,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:t.body.kind===`Case`?[...r()?[]:[{location:n,message:`Non-constant CASE for temporal goal.`}],...c(t.proof)]:t.body.kind===`Qed`?c(t.proof):[]}):[],l=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=t.body,r=()=>s(t)===3,i=n.kind===`Pick`&&n.bounds.length>0&&r()?n.bounds.filter(e=>o([e.set])!==0).flatMap(t=>t.set.location.range?[{location:e.X(t.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(t.proof),...i,...t.proof?.kind===`Steps`&&r()?c(t.proof):[]]}):[],u=Pc([...t.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>a.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...t.assumptions.map(e=>({location:e.location,check:()=>a.analyze(e.expression,/* @__PURE__ */ new Map)})),...t.theorems.map(t=>({location:t.location,check:()=>{let n=t.statement.kind===`AssumeProve`?Ql(t.statement,/* @__PURE__ */ new Map,a):a.analyze(t.statement,/* @__PURE__ */ new Map),r=[...l(t.proof),...n.level===3?c(t.proof):[]];if(r.length>0)throw e.q(r)}})),...r],i);if(u.length>0)throw e.q(u,!1,void 0,i)},eu=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),tu=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),nu=/* @__PURE__ */ new Set([...eu,...tu,`Enabled`]),ru=/* @__PURE__ */ new Set([`~>`,`-+->`]),iu=/* @__PURE__ */ new Set([...ru,`\\cdot`]),au=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),ou=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),su=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},cu=(e,t)=>au.has(e)||t.builtins.get(e)?.isStateLevel===!0,lu=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(eu.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(tu.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&ru.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(nu.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&iu.has(e.operator))&&(r[0]|=1),nu.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=su(e);if(u!==void 0&&!O(e)){let e=t.substitutions.get(u)??u,n=t.definitions.get(e),a=t.constants.has(u),o=t.variableIndex.get(u);if((o!==void 0||t.builtins.get(u)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=1),o!==void 0&&(l&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:l});else{cu(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),ou.has(u)&&(r[0]|=8),!a&&cu(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}D(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},uu=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],du=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},fu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),pu=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=lu(uu(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&14,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=du(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=du(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!fu(t[e],l[e*r])))),p=du(a,r,f,14);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|d[t]&224|p[t]&14:e),words:r}},mu=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?hu(uu(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},hu=(e,t)=>{let n=t.facts.words,r=lu(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=mu(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}fu(e.callee,r[0])||(i[0]|=r[0]&14)}),i},gu=(e,t)=>!(mu(e,t)[0]&1),_u={any:2,repeated:4,streamed:8},vu=(e,t,n=`any`)=>(mu(e,t)[0]&_u[n])!==0,yu=(e,t)=>{let n=mu(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},bu=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},xu=(e,t)=>{let n=hu([e],t);return n[0]&16?void 0:bu(n)},Su=(e,t)=>!!(hu([e],t)[0]&1),Cu=(t,n,r)=>new e.O(`Applying ${t} to the following value,\nwhich is not ${n}:\n${I(r)}`),wu=e=>Mt(e)?F(e):void 0,Tu=`a function with a finite domain`,Eu=(e,t,n)=>{let r=L(e,t,n),i=wu(r);if(!i)throw Cu(n,Tu,r);return i},Du=(e,t)=>{let n=L(e,1,t),r=wu(n),i=r&&ju(r,L(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw wo(`second`,t,`bag`,n);return i},Ou=(e,t,n)=>{let r=t[n];if(!r||!Au(r))throw wo(n===0?`first`:`second`,`(+)`,`bag`,L(e,n,`(+)`));return r},ku=(e,t)=>{if(!A(e)||!M(e))throw t();return N(e).elements},Au=e=>e.range.every(e=>typeof e==`number`&&e>0),ju=(e,t)=>{let n=e.domain.findIndex(e=>hr(t,e));return n===-1?void 0:e.range[n]},Mu=t=>{if(typeof t==`number`)return t;let n=`tlc2.value.impl.${zo(t)}`;throw new e.b(`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},Nu=(e,t)=>{let n=Mu(e)+Mu(t);if(No(n))throw Po(`${e}+${t}`);return n},Pu=(e,t,n)=>{let r=Mu(e.range[t]),i=ju(n,e.domain[t]);if(i===void 0)return r;let a=r-Mu(i);if(No(a))throw Po(`${r}-${i}`);return a},Fu=(e,t,n,r=e.length)=>{let i=e.slice(0,r).find(e=>hr(t,e[0]));i?i[1]=Nu(i[1],n):e.push([t,n])},Iu=e=>e.domain.map((t,n)=>[t,e.range[n]]),Lu=wn([],[]),Ru=t=>[ko(`EmptyBag`,Lu),R(`IsABag`,1,e=>{let t=wu(L(e,0,`IsABag`));return t!==void 0&&Au(t)}),R(`BagCardinality`,1,e=>{let t=L(e,0,`BagCardinality`);return Eu(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Cu(`BagCardinality`,`a bag`,t);return Nu(e,n)},0)}),R(`BagIn`,2,e=>{let t=Du(e,`BagIn`);return t!==void 0&&t>0}),R(`CopiesIn`,2,e=>Du(e,`CopiesIn`)??0),R(`\\oplus`,2,e=>{let t=[0,1].map(t=>wu(L(e,t,`(+)`))),n=Ou(e,t,0),r=Ou(e,t,1),i=Iu(n);return r.domain.forEach((e,t)=>Fu(i,e,r.range[t],n.domain.length)),wr(i)}),R(`\\ominus`,2,e=>{let t=L(e,0,`(-)`),n=L(e,1,`(-)`),r=wu(t),i=wu(n);if(!r)throw wo(`first`,`(-)`,`bag`,t);if(!i)throw wo(`second`,`(-)`,`bag`,n);return wr(r.domain.flatMap((e,t)=>{let n=Pu(r,t,i);return n>0?[[e,n]]:[]}))}),R(`BagUnion`,1,t=>{let n=L(t,0,`BagUnion`),r=ku(n,()=>Cu(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??Lu;let i=t=>{let r=wu(t);if(!r)throw new e.O(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${I(n)}`);return r},a=Iu(i(r[0]));return r.slice(1).forEach(e=>{let t=i(e);t.domain.forEach((e,n)=>Fu(a,e,t.range[n]))}),wr(a)}),R(`\\sqsubseteq`,2,e=>{let t=L(e,0,`\\sqsubseteq`),n=L(e,1,`\\sqsubseteq`),r=wu(t),i=wu(n);if(!r)throw Cu(`\\sqsubseteq`,Tu,t);if(!i)throw Cu(`\\sqsubseteq`,Tu,n);return r.domain.every((e,t)=>{let n=ju(i,e);return Mu(r.range[t])<=(n===void 0?0:Mu(n))})}),Ao(`BagOfAll`,2,e=>{let t=Oo(e,0,`BagOfAll`),n=L(e,1,`BagOfAll`),r=wu(n);if(!r)throw wo(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[];return r.domain.forEach((e,n)=>Fu(i,t.call([e]),r.range[n])),wr(i)}),R(`SubBag`,1,n=>{let r=L(n,0,`SubBag`);if(!Mt(r))throw new e.b(`Attempted to apply the operator DOMAIN to a non-function\n(${Bo(r)})\nline 106, col 58 to line 106, col 65 of module Bags`);let i=F(r),a=N(yr(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 ${I(i)}, which is not in its domain`);return vr(i.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:s[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>wn(e.map(e=>e[0]),e.map(e=>e[1]))))}),R(`BagToSet`,1,e=>Fi(Eu(e,0,`BagToSet`))),R(`SetToBag`,1,e=>{let t=L(e,0,`SetToBag`),n=ku(t,()=>Cu(`BagToSet`,Tu,t));return wn([...n],n.map(()=>1))})],zu={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},B={none:0,beginObject:1,endObject:2,beginArray:3,endArray:4,true:5,false:6,null:7,singleQuoted:8,doubleQuoted:9,unquoted:10,singleQuotedName:12,doubleQuotedName:13,unquotedName:14,number:16,eof:17},Bu={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},Vu=[{lower:`true`,upper:`TRUE`,token:B.true},{lower:`false`,upper:`FALSE`,token:B.false},{lower:`null`,upper:`NULL`,token:B.null}],Hu=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
79
+ `],[`r`,`\r`],[`f`,`\f`]]),Uu=1024,Wu=t=>{let n=+!!t.startsWith(``),r=n,i=0,a=n,o=!0,s=B.none,c=0,l=[zu.emptyDocument],u=[void 0],d=[0],f=()=>`$${l.map((e,t)=>e===zu.emptyArray||e===zu.nonemptyArray?`[${d[t]}]`:e===zu.emptyDocument||e===zu.nonemptyDocument?``:`.${u[t]??``}`).join(``)}`,p=()=>` at line ${i+1} column ${r-a+1} path ${f()}`,m=t=>new e.b(`com.google.gson.stream.MalformedJsonException: ${t}${p()}
80
+ See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`),h=()=>new e.b(`java.io.EOFException: End of input${p()}`),g=()=>{if(!o)throw m(`Use JsonReader.setStrictness(Strictness.LENIENT) to accept malformed JSON`)},ee=e=>`/\\;#=`.includes(e)?(g(),!1):!`{}[]:, \f\r
81
+ `.includes(e),_=()=>{for(;r<t.length;){let e=t[r++];if(e===`
82
+ `){i++,a=r;return}if(e===`\r`)return}},v=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},te=()=>{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===`/`)_();else if(v(`*/`))r+=2;else throw m(`Unterminated comment`)}else if(e===`#`)g(),_();else if(e!==` `&&e!==`\r`&&e!==` `)return e}},ne=()=>{let e=te();if(e===void 0)throw h();return e},y=()=>{let e=Vu.find(e=>t[r]===e.lower[0]||t[r]===e.upper[0]);if(!e)return B.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 B.none}return r+n<t.length&&ee(t[r+n])?B.none:(r+=n,e.token)},re=()=>{let e=Bu.none,n=!1,i=0;for(;r+i<t.length;i++){if(i===Uu)return B.none;let a=t[r+i];if(a===`-`){if(e===Bu.none)e=Bu.sign;else if(e===Bu.exponentE)e=Bu.exponentSign;else return B.none}else if(a===`+`){if(e!==Bu.exponentE)return B.none;e=Bu.exponentSign}else if(a===`e`||a===`E`){if(e!==Bu.digit&&e!==Bu.fractionDigit)return B.none;e=Bu.exponentE}else if(a===`.`){if(e!==Bu.digit)return B.none;e=Bu.decimal}else if(a<`0`||a>`9`){if(ee(a))return B.none;break}else if(e===Bu.sign||e===Bu.none)n=a===`0`,e=Bu.digit;else if(e===Bu.digit){if(n)return B.none}else e===Bu.decimal?e=Bu.fractionDigit:(e===Bu.exponentE||e===Bu.exponentSign)&&(e=Bu.exponentDigit)}return i===Uu||e!==Bu.digit&&e!==Bu.fractionDigit&&e!==Bu.exponentDigit?B.none:(c=i,B.number)},ie=()=>{let e=l.length-1,n=l[e];if(n===zu.emptyArray)l[e]=zu.nonemptyArray;else if(n===zu.nonemptyArray){let e=ne();if(e===`]`)return B.endArray;if(e===`;`)g();else if(e!==`,`)throw m(`Unterminated array`)}else if(n===zu.emptyObject||n===zu.nonemptyObject){if(l[e]=zu.danglingName,n===zu.nonemptyObject){let e=ne();if(e===`}`)return B.endObject;if(e===`;`)g();else if(e!==`,`)throw m(`Unterminated object`)}let t=ne();if(t===`"`)return B.doubleQuotedName;if(t===`'`)return g(),B.singleQuotedName;if(t===`}`){if(n!==zu.nonemptyObject)return B.endObject;throw m(`Expected name`)}if(g(),r--,ee(t))return B.unquotedName;throw m(`Expected name`)}else if(n===zu.danglingName){l[e]=zu.nonemptyObject;let n=ne();if(n===`=`)g(),t[r]===`>`&&r++;else if(n!==`:`)throw m(`Expected ':'`)}else if(n===zu.emptyDocument){if(te()===void 0)return B.eof;r--,t.startsWith(`)]}'
85
+ `,r)&&(r+=5),l[e]=zu.nonemptyDocument}else if(n===zu.nonemptyDocument){if(te()===void 0)return B.eof;g(),r--}let i=te();if(i===void 0){if(n===zu.emptyDocument)return B.eof;throw h()}if(i===`]`&&n===zu.emptyArray)return B.endArray;if(i===`]`||i===`;`||i===`,`){if(n!==zu.emptyArray&&n!==zu.nonemptyArray)throw m(`Unexpected value`);return g(),r--,B.null}if(i===`'`)return g(),B.singleQuoted;if(i===`"`)return B.doubleQuoted;if(i===`[`)return B.beginArray;if(i===`{`)return B.beginObject;r--;let a=y();if(a!==B.none)return a;let o=re();if(o!==B.none)return o;if(!ee(t[r]))throw m(`Expected value`);return g(),B.unquoted},ae=()=>(s===B.none&&(s=ie()),s),oe=()=>{if(r===t.length)throw m(`Unterminated escape sequence`);let e=t[r++];if(e===`u`){if(r+4>t.length)throw m(`Unterminated escape sequence`);let e=t.slice(r,r+4);if(!/^[\da-fA-F]{4}$/.test(e))throw m(`Malformed Unicode escape \\u${e}`);return r+=4,String.fromCharCode(Number.parseInt(e,16))}let n=Hu.get(e);if(n!==void 0)return n;if(e===`
86
+ `)return i++,a=r,e;if(`'"\\/`.includes(e))return e;throw m(`Invalid escape sequence`)},se=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)+oe(),o=r):s===`
87
+ `&&(i++,a=r)}throw m(`Unterminated string`)},ce=()=>{let e=r;for(;r<t.length&&ee(t[r]);)r++;return t.slice(e,r)},le=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=B.none},b=()=>{l.pop(),u.pop(),d.pop(),d[l.length-1]++,s=B.none},ue=()=>{let e=ae();return e!==B.endObject&&e!==B.endArray&&e!==B.eof},de=()=>{let e=ae(),t=e===B.unquotedName?ce():se(e===B.singleQuotedName?`'`:`"`);return s=B.none,u[l.length-1]=t,t},fe=e=>e===B.true||e===B.false?e===B.true:e===B.null?null:e===B.number?(r+=c,{literal:t.slice(r-c,r)}):e===B.unquoted?ce():se(e===B.singleQuoted?`'`:`"`),x=()=>{let e=ae();if(e===B.beginArray){le(zu.emptyArray);let e=[];for(;ue();)e.push(x());return b(),e}if(e===B.beginObject){le(zu.emptyObject);let e=/* @__PURE__ */ new Map;for(;ue();)e.set(de(),x());return b(),e}let t=fe(e);return s=B.none,d[l.length-1]++,t};if(ae()===B.eof)return null;let S=x();return o=!1,S!==null&&ae(),S},Gu=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),Ku=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),qu=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),Ju=e=>{if(!Mt(e))return;let t=F(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?Ir(n):void 0},Yu=(t,n)=>{let r=`tlc2.value.impl.${zo(t)}`,i=`tlc2.value.impl.${n}`;return new e.b(`class ${r} cannot be cast to class ${i} (${r} and ${i} are in unnamed module of loader 'app')`)},Xu=t=>new e.b(`Cannot convert value: unsupported value type tlc2.value.impl.${zo(t)}`),Zu=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Qu=e=>`[${e.map(nd).join(`,`)}]`,$u=e=>`{${Bt(e).map(e=>`${Zu(typeof e[0]==`string`?e[0]:I(e[0]))}:${nd(e[1])}`).join(`,`)}}`,ed=e=>{let t=F(e),n=di(t);return n?Qu(n):$u(t)},td=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,nd=e=>{if(typeof e==`string`)return Zu(e);if(typeof e!=`object`)return String(e);if(e.kind===`ModelValue`)return Zu(e.name);let t=zo(e);if(t===`RecordValue`)return $u(F(e));if(t===`TupleValue`)return Qu(F(e).range);if(td(t))return ed(e);if(Rr(e))return Qu(N(e).elements);throw Xu(e)},rd=e=>{let t=zo(e);if(t===`TupleValue`)return Qu(F(e).range);if(td(t))return ed(e);if(Rr(e))return Qu(N(e).elements);throw Xu(e)},id=e=>{let t=zo(e);if(t===`RecordValue`)return $u(F(e));if(t===`TupleValue`)return`{${F(e).range.map((e,t)=>`"${t}":${nd(e)}`).join(`,`)}}`;if(td(t))return ed(e);throw Xu(e)},ad=t=>{if(t===null)throw new e.b(`Cannot convert value: unsupported JSON value null`);if(typeof t==`boolean`)return t;if(typeof t==`string`)return sn(t);if(Array.isArray(t))return Fr(t.map(ad));if(t instanceof Map)return Ir([...t].map(e=>[sn(e[0]),ad(e[1])]));let n=Number(t.literal);if(!/^-?\d+$/.test(t.literal)||No(n))throw new e.b(`Cannot convert value: expected a 32-bit integer JSON number, but found ${t.literal}`);return n||0},od=t=>{if(typeof t!=`string`)throw new e.b(`Cannot cast tlc2.value.impl.${zo(t)} to tlc2.value.impl.StringValue`);return t},sd=(e,t)=>{let n=Ni(e,t);if(typeof n!=`string`)throw Yu(n,`StringValue`);return n},cd=t=>{if(!Ku.has(t.toLowerCase()))throw qu.has(t.toLowerCase())?new e.B(`IOUtils!Serialize does not support the charset ${t}`):new e.b(/^[a-zA-Z\d][\w.:+-]*$/.test(t)?`java.nio.charset.UnsupportedCharsetException: ${t}`:`java.nio.charset.IllegalCharsetNameException: ${t}`)},ld=(t,n,r,i)=>{let a=r.find(e=>!Gu.has(e));if(a!==void 0)throw new e.b(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${a}`);if(r.includes(`READ`))throw new e.b(`java.lang.IllegalArgumentException: READ not allowed`);let o=new Set(r.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:r);if(o.has(`APPEND`)&&o.has(`TRUNCATE_EXISTING`))throw new e.b(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(o.has(`DELETE_ON_CLOSE`))throw new e.B(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let s=t.readFile?.(n);if(s===void 0&&!o.has(`CREATE`)&&!o.has(`CREATE_NEW`))throw new e.b(`java.nio.file.NoSuchFileException: ${n}`);if(s!==void 0&&o.has(`CREATE_NEW`))throw new e.b(`java.nio.file.FileAlreadyExistsException: ${n}`);s===void 0||o.has(`TRUNCATE_EXISTING`)?t.writeFile?.(n,i):t.writeFile?.(n,o.has(`APPEND`)?s+i:i+s.slice(i.length))},ud=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},dd=(t,n)=>{let r=t.readFile?.(n);if(r===void 0)throw new e.b(`${n} (No such file or directory)`);return r},fd=e=>[Uo(jo(`ToJson`,1,e=>sn(nd(L(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),Uo(jo(`ToJsonArray`,1,e=>sn(rd(L(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),Uo(jo(`ToJsonObject`,1,e=>sn(id(L(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),Uo(jo(`JsonSerialize`,2,t=>{let n=od(L(t,0,`JsonSerialize`)),r=L(t,1,`JsonSerialize`);if(!di(r)&&!Ju(r))throw wo(`second`,`JsonSerialize`,`sequence or record`,r);return ud(e,n),e.writeFile?.(n,nd(r)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Uo(jo(`ndJsonSerialize`,2,t=>{let n=od(L(t,0,`ndJsonSerialize`)),r=L(t,1,`ndJsonSerialize`),i=di(r);if(!i)throw wo(`second`,`ndJsonSerialize`,`sequence`,r);return ud(e,n),e.writeFile?.(n,i.map(e=>`${nd(e)}\n`).join(``)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Uo(jo(`JsonDeserialize`,1,t=>ad(Wu(dd(e,od(L(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),Uo(jo(`ndJsonDeserialize`,1,t=>Fr(dd(e,od(L(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>ad(Wu(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],pd=(e,t)=>[Uo(Yo(`Serialize`,3,(n,r)=>{let i=Xo(n,2,`Serialize`)(),a=Ju(i);if(!a)throw wo(`third`,`ndJsonSerialize`,`sequence`,i);if(sd(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Xo(n,0,`Serialize`)(),s=di(o);if(!s)throw wo(`first`,`Serialize`,`sequence`,o);let c=Xo(n,1,`Serialize`)();if(typeof c!=`string`)throw wo(`second`,`ndJsonSerialize`,`sequence`,c);let l=Ni(a,`openOptions`);if(zo(l)!==`TupleValue`)throw Yu(l,`TupleValue`);let u=sd(a,`charset`),d=F(l).range.map(e=>{if(typeof e!=`string`)throw Yu(e,`StringValue`);return e});return cd(u),ld(e,c,d,s.map(e=>`${nd(e)}\n`).join(``)),!0}),`public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`)],md={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},hd=e=>{let n=[],r={objects:/* @__PURE__ */ new Map,names:/* @__PURE__ */ new Map,count:0},i=xn(),a=e=>n.push(e&255),o=e=>{a(e>>8),a(e)},s=e=>{o(e>>16),o(e)},c=e=>e>32767?s(-e):o(e),l=e=>{a(md.string),s(0),s(-1),s(e.length),e.split(``).forEach(e=>a(e.charCodeAt(0)))},u=e=>{a(md.handle),c(e)},d=e=>{if(typeof e==`boolean`){a(md.boolean),a(+!!e);return}if(typeof e==`number`){a(md.integer),s(e);return}if(typeof e==`string`){r.count++,l(e);return}if(e.kind===`ModelValue`){a(md.modelValue),o(i.indexOf(e));return}if(e.kind===`Interval`){a(md.interval),s(e.low),s(e.high);return}let t=r.objects.get(e);if(t!==void 0){u(t);return}if(r.objects.set(e,r.count++),A(e)){let t=N(e).elements;a(md.set),s(t.length),t.forEach(d);return}let n=F(e),f=Dn(e);f===`tuple`?(a(md.tuple),c(n.range.length),n.range.forEach(d)):f===`record`?(a(md.record),s(n.domain.length),n.domain.forEach((e,t)=>{let i=String(e),a=r.names.get(i);a===void 0?(r.names.set(i,r.count++),l(i)):u(a),d(n.range[t])})):(a(md.function),c(n.domain.length),a(1),n.domain.forEach((e,t)=>{d(e),d(n.range[t])}))};return d(e),(0,t.gzipSync)(Uint8Array.from(n))},gd=e=>[Uo(jo(`_TLCTraceSerialize`,2,t=>{let n=od(L(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,hd(L(t,0,`_TLCTraceSerialize`))),!0}),`public static final tlc2.value.IValue tlc2.module._TLCTrace.ioSerialize(tlc2.value.IValue,tlc2.value.impl.StringValue) throws java.io.IOException`)],_d=25214903917n,vd=(1n<<48n)-1n,yd=2147483647,bd=e=>{let t={value:(BigInt.asUintN(64,e)^_d)&vd},n=e=>(t.value=t.value*_d+11n&vd,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^_d)&vd},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=yd)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},xd=[],Sd=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Cd=()=>{for(let e=1277011;xd.length<1341;e++)Sd(e)&&xd.push(e);return xd},wd=e=>{let t=Cd(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},Td=e=>{let t=[],n={value:e};for(let e=2;e*e<=n.value;e++)for(;n.value%e===0;)t.push(e),n.value/=e;return n.value>1&&t.push(n.value),t},Ed=e=>{for(let t=Math.max(e,9);;t++){let e=Td(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},Dd=(e,t,n)=>{if(t<=0)return[];let r=Ed(t),i={index:BigInt(n.nextInt(t))},a=BigInt(wd(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},Od=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:yd),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},kd=(1n<<63n)-1n-24n,Ad=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(kd*BigInt(n)+i)%t;return r<0n?r+t:r})},jd=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,Md=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Nr(e.domain),n=N(e.range).elements;return{lists:t.map(()=>n),create:e=>wn(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>N(e).elements),create:t=>Ir(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>N(e).elements),create:Fr}}},Nd=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,Pd=(e,t,n,r)=>{if(P(t))return[];let i=r===`1.7.4`?Od:Dd;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=Nd(t,r)?void 0:Md(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(yd)?Ad(e,t,n):i(e,Number(t),n)).map(e=>a.create(jd(a.lists,e)))}let o=N(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},Fd=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[...To(t.domain,`RandomElement`,t).elements];return wn(e,e.map(()=>Fd(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return Ir(t.names.map((e,r)=>[e,Fd(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return Fr(t.factors.map(e=>Fd(e,n)));if(typeof t==`object`&&t.kind===`Interval`){let r=Math.max(0,t.high-t.low+1),i=Math.floor(n.nextDouble()*r);if(i>=r)throw new e.b(`Attempted to retrieve out-of-bounds element from the interval value ${I(t)}.`);return t.low+i}let r=To(t,`RandomElement`).elements,i=Math.floor(n.nextDouble()*r.length);if(i>=r.length)throw new e.b(`Index ${i} out of bounds for length ${r.length}`);return r[i]},Id=(e,t,n)=>{if(typeof e!=`number`||e<0)throw wo(t,n,`nonnegative integer`,e);return e},Ld=(e,t,n,r)=>vr(Array.from({length:t},()=>vr(e.filter(()=>r.nextDouble()<n)))),Rd=(e,t)=>{let n=`RandomSetOfSubsets`,r=Id(L(e,0,n),`first`,n),i=Id(L(e,1,n),`second`,n),a=L(e,2,n);if(!A(a)||!M(a))throw wo(`third`,n,`finite set`,a);let o=N(a).elements;if(o.length<31&&r>2**o.length)throw wo(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw wo(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return Ld(o,r,o.length===0?0:i/o.length,t.getRandom())},zd=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,Bd=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,Vd=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(zd.test(t))return Number(t.replace(/[fFdD]$/,``));let n=Bd.exec(t);if(!n)return;let r=n[3]??``,i=`${n[2]}${r}`;if(i===``)return;let a=Number.parseInt(i,16)*2**(Number(n[4])-4*r.length);return n[1]===`-`?-a:a},Hd=e=>R(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=Id(L(t,0,n),`first`,n),i=L(t,1,n);if(typeof i!=`string`)throw wo(`second`,n,`string literal representing a probability`,i);let a=Vd(i);if(a===void 0||a<0||a>1)throw wo(`second`,n,`string literal does not represent a parsable probability`,i);let o=L(t,2,n);if(!A(o)||un(o)||!ci(o))throw wo(`third`,n,`finite set`,o);let s=oi(o);if(32-Math.clz32(r)>s&&r>1<<s)throw wo(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return Ld(N(o).elements,r,a,e.getRandom())}),Ud=t=>[Uo(R(`RandomSubset`,2,n=>{let r=L(n,0,`RandomSubset`);if(typeof r!=`number`||r<0)throw wo(`first`,`RandomSubset`,`nonnegative integer`,r);let i=L(n,1,`RandomSubset`);if(!Rr(i)||!ci(i))throw wo(`second`,`RandomSubset`,`a finite set`,i);let a=Nd(i,t.version);if(a&&a.reduce((e,t)=>e*N(t).elements.length,1)>Et())throw new e.b(Dt());return vr(Pd(r,i,t.getRandom(),t.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),R(`RandomSetOfSubsets`,3,e=>Rd(e,t)),R(`TestRandomSetOfSubsets`,3,e=>Fr(Array.from({length:5},()=>N(Rd(e,t)).elements.length)))],Wd=(e,t=0n)=>{let n=bd(t),r={random:bd(t),seededState:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Ir([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,getSuccessorAction:()=>void 0,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Ia,getSimulationValue:void 0,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.seededState&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.seededState=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},Gd=e=>wr([...e.possibleCounts].map(([e,t])=>[e,t])),Kd=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Gd(e)]]),qd=e=>Ir([[`name`,e??`UnnamedAction`],[`location`,Ir([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),Jd=/* @__PURE__ */ new WeakSet,Yd=(e,t)=>{let n=Ir([[`action`,vr(e)],[`state`,vr(t)]]);return Jd.add(n),n},Xd=(e,t,n)=>{let r=e.map((e,t)=>Fr([t+1,Ir(Object.entries(e))])),i=r.slice(1).map((e,n)=>Fr([r[n],t[n],e])),a=n?[Fr([r[r.length-1],n.action,r[n.start]])]:[];return Yd([...i,...a],r)},Zd=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Kd(e).get(t)},Qd=(t,n,r,i)=>{if(typeof r==`number`&&r>=0)t.registers.set(r,i);else if(r===`exit`)i===!0&&(t.isStopped=!0);else if(r===`pause`){if(i!==!0||!t.pause)return;n(`Press enter to resume model checking.`),t.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))t.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))t.properties.set(r.slice(2),I(i));else throw new e.O(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${I(r)}`)},$d=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:V(e),ef=e=>e.every(e=>e!==void 0),tf=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!O(e);if(i&&t.variableIndex.has(r))return 1;let a=D(e).map(e=>tf(e,t,n)),o=i?kh(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(tf(o.body,t,n))),Math.max(0,...a)},nf=(t,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[Yo(`AssertError`,2,t=>{let r=Oo(t,0,`AssertError`).expression;if(r&&r.kind!==`String`)throw new e.b(`In computing AssertError, a non-string expression (${$d(r)}) was used as the err of an AssertError(err, exp).`);let i=Xo(t,0,`AssertError`)();try{Xo(t,1,`AssertError`)()}catch(t){if(t instanceof e.b)return ot(t.message,n.isTool)===i;throw t}return!1}),jo(`TLCGetOrDefault`,2,e=>{let t=L(e,0,`TLCGetOrDefault`);return Zd(n,t)??L(e,1,`TLCGetOrDefault`)}),jo(`Trace`,0,(t,r)=>{let i=r?.environment.variables??[],a=r?.state??i.map(()=>void 0);if(!r||!ef(a)){let t=i.filter((e,t)=>a[t]===void 0);throw new e.b(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${t.length>1?`s`:``} ${t.join(`, `)} undefined).`)}return r.state?Fr(n.getBehavior(a).map(e=>{let t=r.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return Ir(i===void 0?t:[[`_action`,i],...t])})):Fr([Ir([])])}),jo(`CounterExample`,0,()=>n.counterExample??Yd([],[])),R(`ToTrace`,1,t=>{let n=L(t,0,`ToTrace`);if(typeof n!=`object`||!Jd.has(n))throw new e.O(`The argument of ToTrace should be a CounterExample, but instead it is:\n${I(n)}`);let r=N(Ni(n,`state`)).elements.map(e=>di(e)??[]);return Fr(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),R(`TLCModelValue`,1,t=>{let n=L(t,0,`TLCModelValue`);if(typeof n!=`string`)throw new e.O(`The argument of ModelValue should be a string, but instead it is:\n${I(n)}`);return bn(n)}),Yo(`TLCDefer`,1,(e,t)=>{let r=Oo(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{U(r,{...t,next:e})}),!0}),R(`TLCNoOp`,1,e=>L(e,0,`TLCNoOp`)),{...Yo(`PickSuccessor`,1,(r,i)=>{let a=i?.next??(i?.environment.variables??[]).map(()=>void 0);if(!ef(a)||i?.next&&n.isSeen(a))return!0;let o=Oo(r,0,`PickSuccessor`),s=o.call([]);if(typeof s!=`boolean`)throw new e.b(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${Bo(s)}) was used as the condition of an IF.\n${o.expression?$d(o.expression):``}`);if(s||!i?.next||!i.state||!ef(i.state))return!0;let c=n.getSuccessorAction(i.state,a);throw t(Ye(n.isTool,Ke.moduleOverrideStdout,qe.none,`Extend behavior of length ${n.getLevel(i.state)} with a "${c?.name}" step [<Action ${c?.location.range&&e.X(c.location.range)}>]? (Yes/no/explored/states/diff):`)),new e.v}),isActionLevel:!0},Yo(`TLCCache`,2,(e,t)=>{let i=Oo(e,0,`TLCCache`),o=ea(Xo(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=tf(s,t.environment,/* @__PURE__ */ new Set);if(c===2)return i.call([]);let l=c===1;if(l&&t.state&&n.getSimulationValue===void 0)return i.call([]),i.call([]);let u=l&&t.state?a(t.state):r,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=i.call([]);return d.set(o,p),p}),R(`TLCFP`,1,e=>{let t=L(e,0,`TLCFP`),n=Gi(t);if(n)throw n;return Number(BigInt.asIntN(32,Ia([t])))}),Yo(`TLCEvalDefinition`,1,(t,n)=>{let r=Xo(t,0,`TLCEvalDefinition`)();if(typeof r!=`string`)throw new e.O(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${I(r)}`);let i=n?kh(r,n.environment):void 0,a=i?void 0:n?.environment.builtins.get(r);if(a?.arity===0)return a.evaluate([],n);if(!i||!n)throw new e.O(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${I(r)}`);if(i.kind===`Operator`&&i.params.length>0){let t=i.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new e.O(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${r}(${t.join(`, `)})`)}return i.kind===`Operator`?U(i.body,n):U({kind:`Identifier`,name:r,location:i.location},n)})]},rf=(e,t)=>[jo(`_Track`,2,e=>{let n=String(L(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,L(e,0,`_Track`)===!0?r+1:r),!0}),jo(`_Counts`,0,()=>Gd(t)),jo(`_CheckName`,1,n=>{let r=String(L(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(I(Gd(t),!0)),!1)}),jo(`_PrintCounts`,0,()=>(e(I(Gd(t),!0)),!0))],af=e=>String(e).padStart(2,`0`),of=e=>`${e.getUTCFullYear()}.${af(e.getUTCMonth()+1)}.${af(e.getUTCDate())}.${af(e.getUTCHours())}${af(e.getUTCMinutes())}${af(e.getUTCSeconds())}`,sf=e=>wr([...e].map(([e,t])=>[e,Fr([t])])),cf=e=>En(Tr(e),`record`),lf=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),uf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),df=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),ff=(t,n,r)=>{if(t.version===`1.7.4`?!uf.has(n)||!t.isStarted&&df.has(n):!t.isStarted&&lf.has(n))throw new e.O(`TLCGet(${n}) was undefined.`);let i=t.getSimulationValue?.(n,r);if(i!==void 0)return i;let a=Math.floor((Date.now()-t.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:t.getLevel(r);case`diameter`:return t.diameter;case`generated`:return t.generatedStates;case`distinct`:return t.distinctStates;case`queue`:return t.queueSize;case`duration`:return a;case`stats`:return cf([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,a],[`worker`,0]]);case`config`:return cf([[`mode`,`bfs`],[`deadlock`,t.checkDeadlock],[`worker`,1],[`seed`,String(t.seed)],[`fingerprint`,String(BigInt.asIntN(64,ya()))],[`install`,`unknown`]]);case`revision`:{let e=/* @__PURE__ */ new Date;return cf([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,sn(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,sn(of(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return qd(void 0);case`all`:return sf(t.registers);case`all:named`:return sf(Kd(t))}if(n.startsWith(`s:`)){let r=Kd(t).get(n);if(r===void 0)throw new e.O(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return sn(t.properties.get(n.slice(2))??n);throw new e.O(`TLCGet(${n}) was undefined.`)},pf=(t,n,r)=>{if(typeof n==`number`&&n>=0){let r=t.registers.get(n);if(r===void 0)throw new e.O(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new e.O(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${I(n)}`);return ff(t,n,r?.state)},mf=e=>e.length===0?[[]]:e.flatMap((t,n)=>mf([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),hf=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&N(e).elements.forEach(hf),e.kind===`Function`&&e.range.forEach(hf))},gf=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`ModelValue`:case`Function`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return F(e);default:return N(e)}},_f=(t,n)=>[R(`Print`,2,e=>(t(da([L(e,0,`Print`),L(e,1,`Print`)]).map(k).join(` `)),L(e,1,`Print`))),R(`PrintT`,1,e=>(t(k(da([L(e,0,`PrintT`)])[0])),!0)),R(`Assert`,2,t=>{if(L(t,0,`Assert`)!==!0)throw new e.O(`The first argument of Assert evaluated to FALSE; the second argument was:\n${k(I(L(t,1,`Assert`)))}`,e.tt.assertViolation);return!0}),R(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),R(`:>`,2,e=>wr([[L(e,0,`:>`),L(e,1,`:>`)]])),R(`@@`,2,e=>{let t=L(e,0,`@@`),n=L(e,1,`@@`),r=Mt(t)?F(t):void 0,i=Mt(n)?F(n):void 0;if(!r)throw wo(`first`,`@@`,`function`,t);if(!i)throw wo(`second`,`@@`,`function`,n);let a=zt(r),o=zt(i).filter(e=>!a.some(t=>hr(e[0],t[0])));return Tr([...a,...o])}),R(`ToString`,1,e=>sn(I(L(e,0,`ToString`),!0))),{...Yo(`TLCEval`,1,(e,t)=>{let n=gf(Xo(e,0,`TLCEval`)());return t===void 0&&hf(n),n}),isStateLevel:!1},R(`Permutations`,1,e=>{let t=To(L(e,0,`Permutations`),`Permutations`).elements;return vr(mf(t).map(e=>wr(t.map((t,n)=>[t,e[n]]))))}),Ao(`SortSeq`,2,e=>{let t=L(e,0,`SortSeq`),n=di(t);if(!n)throw wo(`first`,`SortSeq`,`natural number`,t);let r=Oo(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw wo(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t={index:a.length};for(;t.index>0&&i(e,a[t.index-1]);)t.index--;a.splice(t.index,0,e)}),Fr(a)}),n.version===`1.7.4`?Uo({...jo(`TLCGet`,1,(e,t)=>pf(n,L(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Uo(Yo(`TLCGet`,1,(e,t)=>pf(n,Xo(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),jo(`TLCSet`,2,e=>{let r=L(e,0,`TLCSet`);return Qd(n,t,r,L(e,1,`TLCSet`)),!0}),ko(`Any`,mn),R(`RandomElement`,1,e=>Fd(L(e,0,`RandomElement`),n.getRandom()))],vf=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),yf=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],bf=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),xf=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs.beginLine.beginColumn.endLine.endColumn.module.name.location.context.parameters._action`.split(`.`),Sf=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),Cf=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
88
88
  Nat == { }
89
89
  a+b == {a, b}
90
90
  a-b == CHOOSE n : b + n = a
@@ -1777,14 +1777,14 @@ _TEPosition ==
1777
1777
  ELSE TLCGet("level") + 1
1778
1778
 
1779
1779
  =============================================================================
1780
- `]]),Of=(e=`master`)=>e===`1.7.4`?Df:Ef,kf=(e,t)=>e.every(e=>hi(e,t)),Af=_r([!1,!0]);fr(Af);const jf=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Sr(jf(e,t,r),jf(e,r,n))},Mf=[`\\cup`,`\\cap`,`\\`],Nf=e=>typeof e==`object`&&e.kind===`MixedSet`,Pf=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,Ff=(e,t,n)=>{t.kind===`Interval`&&ai(t);let r=t.kind===`Interval`?t:dr(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return kt(r,e=>{hi(e,n)===i&&Dt(a,e)}),Pf(t)?Sn(a):vr(a)}if(F(t))return n;if(!At(n))return An({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return kt(r,e=>Dt(i,e)),kt(n.kind===`Interval`?n:P(n).elements,e=>{hi(e,t)||Dt(i,e)}),vr(i)},If=(e,t)=>{let n=(t,n)=>Do([Xo(t,n,e)()],0,e);return{...z(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},Lf=[ko(`TRUE`,!0),ko(`FALSE`,!1),ko(`BOOLEAN`,Af),ko(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Mo(`=`,mr),Mo(`#`,(e,t)=>!mr(e,t)),z(`~`,1,e=>!Do(e,0,`~`)),z(`<=>`,2,e=>Do(e,0,`<=>`)===Do(e,1,`<=>`)),If(`/\\`,(e,t)=>e&&t()),If(`\\/`,(e,t)=>e||t()),If(`=>`,(e,t)=>!e||t()),z(`\\in`,2,e=>hi(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!hi(R(e,0,`\\notin`),R(e,1,`\\notin`))),Mo(`\\subseteq`,(t,n)=>{if(!j(t))throw new e.b(`\\subseteq expects a set but received ${L(t)}`);if(typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&N(t.base))return kf(P(t.base).elements,n.base);if(typeof t==`object`&&t.kind===`Interval`){if(typeof n==`object`&&n.kind===`Interval`&&n.low<=t.low&&n.high>=t.high)return!0;for(let e=t.low;e<=t.high;e++)if(!hi(e,n))return!1;return!0}return!Zr(t,e=>!hi(e,n))}),...Mf.map(t=>z(t,2,n=>{let r=R(n,0,t),i=R(n,1,t),a=t!==`\\cup`&&typeof i==`object`&&i.kind===`Interval`&&typeof r==`object`&&r.kind!==`Interval`;if(At(r)&&At(i)&&!Nf(r)&&!Nf(i)&&!a&&!Ot(r)&&!Ot(i)){if(t===`\\cup`&&F(r))return i;let n=t===`\\cup`?Sr:t===`\\cap`?xr:br;return pi((r,i)=>{let a=P(r),o=P(i),s=n(a,o);if(t===`\\cup`){let t=dr(a),n=br(o,a).elements,r=t===a.elements&&(n.length===0||gn(t[t.length-1],n[0])<0);if(t.length+n.length>Tt())throw new e.N(Et());if(r&&!a.isNormalized)return s;let i=s===a?xn(s.elements):s;return r||(i.writtenElements=[...t,...n]),i}return s===r||(s.isNormalized=Pf(r),a.writtenElements&&!a.isNormalized&&(s.writtenElements=a.writtenElements.filter(e=>hi(e,s)))),s},(e,n)=>Ff(t,e,n),r,i)}return At(r)?Ff(t,r,i):t!==`\\`&&At(i)?Ff(t,i,r):An({kind:`SetOperation`,operator:t,left:r,right:i})})),z(`SUBSET`,1,e=>({kind:`Subset`,base:R(e,0,`SUBSET`)})),z(`UNION`,1,e=>{let t=R(e,0,`UNION`),n=Mt(t)?dr(t):[],r=n.filter(Mt);if(!Mt(t)||r.length!==n.length)return An({kind:`Union`,base:t});let i=r.flatMap(dr),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{hi(t,e)||Dt(e.elements,t)}),vr(e.elements)};return Nf(t)||r.some(Nf)?a():r.length===0?yr:pi(e=>li(jf(e,0,e.length),i),a,r.map(P),void 0)}),z(`DOMAIN`,1,t=>{let n=R(t,0,`DOMAIN`);if(!jt(n))throw new e.b(`DOMAIN expects a function but received ${L(n)}`);return Pi(n)})],Rf=Go(`Integers`,`Neg`,`IntValue`,1),zf=t=>{let n=Go(t,`DotDot`,`IntervalValue`,2);return[Ko(t,`+`,`Plus`,(e,t)=>e+t),Ko(t,`-`,`Minus`,(e,t)=>e-t),Ko(t,`*`,`Times`,(e,t)=>e*t),Ko(t,`^`,`Expt`,(t,n)=>{if(n<0)throw new e.O(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(t===0&&n===0)throw new e.O(`0^0 is undefined.`);return t**n}),Ko(t,`\\div`,`Divide`,(t,n)=>{if(n===0)throw new e.O(`The second argument of \\div is 0.`);let r=Math.floor(t/n);if(No(r))throw Po(`${t} \\div ${n}`);return r}),Ko(t,`%`,`Mod`,(t,n)=>{if(n<=0)throw new e.O(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(t%n+n)%n}),z(`..`,2,e=>{let t=R(e,0,`..`),r=Wo(R(e,1,`..`),n);return{kind:`Interval`,low:Wo(t,n),high:r}})]},Bf=zf(`Naturals`),Vf=zf(`Integers`),Hf=e=>{let t=Bf.indexOf(e);return t===-1?void 0:Vf[t]},Uf=e=>{let t=(t,n=`tlc2.value.IBoolValue`)=>`public static ${n} tlc2.module.${e}.${t}(tlc2.value.impl.Value,tlc2.value.impl.Value)`,n=e===`Integers`;return[Uo(Jo(`<`,(e,t)=>e<t),t(`LT`)),Uo(Jo(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),Uo(Jo(`<=`,(e,t)=>e<=t),t(`LE`)),Uo(Jo(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},Wf=[ko(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Bf,...Uf(`Naturals`)],Gf=[ko(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Vf,...Uf(`Integers`),z(`-.`,1,e=>{let t=Wo(R(e,0,`-`),Rf);if(No(-t))throw Po(`-${t}`);return-t})],Kf=(t,n,r)=>{let i=R(t,n,r),a=ui(i);if(!a)throw new e.O(`${r}\n${L(i)}`);return a},qf=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:Kf(e,t,n)},Jf=(e,t,n)=>{let r=R(e,t,`SubSeq`);if(typeof r!=`number`)throw wo(n,`SubSeq`,`natural number`,r);return r},Yf=(e,t,n)=>typeof e==`string`?on(e.slice(t,n)):Pr(e.slice(t,n)),Xf=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Zf=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Qf=(e,t)=>{let n=wf.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Uo(e,t):e}):t},$f=t=>Qf(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>qf(e,0,Xf(``,`Len`)).length),z(`\\o`,2,t=>{let n=qf(t,0,Zf(`s \\o t`,`sequence`));if(typeof n!=`string`){let e=Kf(t,1,Zf(`t \\o s`,`sequence`));return Pr([...n,...e])}let r=R(t,1,`\\o`);if(typeof r!=`string`)throw new e.O(`${Zf(`t \\o s`,`string`)}\n${L(r)}`);return on(n+r)}),z(`Append`,2,e=>Pr([...Kf(e,0,Zf(t===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(e,1,`Append`)])),z(`Head`,1,t=>{let n=Kf(t,0,Xf(``,`Head`));if(n.length===0)throw new e.O(`Attempted to apply Head to the empty sequence.`);return n[0]}),z(`Tail`,1,t=>{let n=qf(t,0,Xf(``,`Tail`));if(n.length===0)throw new e.O(`Attempted to apply Tail to the empty sequence.`);return Yf(n,1)}),z(`SubSeq`,3,t=>{let n=qf(t,0,Xf(`first `,`SubSeq`)),r=Jf(t,1,`second`),i=Jf(t,2,`third`);if(r>i)return Yf(n,0,0);let a=r<1||r>n.length?{position:`second`,value:r}:i>n.length?{position:`third`,value:i}:void 0;if(a)throw new e.O(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${L(R(t,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return Yf(n,r-1,i)}),Ao(`SelectSeq`,2,t=>{let n=Oo(t,1,`SelectSeq`);return Pr(Kf(t,0,Xf(`first `,`SelectSeq`)).filter(t=>{let r=n.call([t]);if(typeof r!=`boolean`)throw new e.O(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${n.name}>`);return r}))})]),ep=t=>Qf(`FiniteSets`,[z(`IsFiniteSet`,1,t=>{let n=R(t,0,`IsFiniteSet`);if(j(n))return si(n);if(typeof n==`object`&&n.kind===`Function`)return!0;throw new e.b(typeof n==`object`&&n.kind===`LazyFunction`?`Attempted to check if the function:\n${L(n)}\nis a finite set.`:`Attempted to check if the ${Nt(n)} ${L(n)} is a finite set.`)}),z(`Cardinality`,1,n=>{let r=R(n,0,`Cardinality`);if(!j(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new e.O(`Attempted to compute cardinality of the value\n${L(r)}`);return ai(r,t)})]),tp=[Uo(z(`Warshall`,1,t=>{let n=R(t,0,`Warshall`);if(!j(n)||ln(n))throw new e.O(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${L(n)}`);ai(n);let r=[],i=/* @__PURE__ */ new Map,a=e=>{let t=$i(e),n=i.get(t)??r.length;return n===r.length&&(i.set(t,n),r.push(e)),n},o=P(n).elements.map(t=>{let n=ui(t);if(n?.length!==2)throw new e.O(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${L(t)}`);return[a(n[0]),a(n[1])]}),s=r.map(()=>r.map(()=>!1));o.forEach(e=>{s[e[0]][e[1]]=!0});for(let e=0;e<r.length;e++)for(let t=0;t<r.length;t++)if(s[t][e])for(let n=0;n<r.length;n++)s[e][n]&&(s[t][n]=!0);return vr(r.flatMap((e,t)=>r.flatMap((n,r)=>s[t][r]?[Pr([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],np=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return tp;if(e===`AnySet`)return[ko(`ANY`,pn)];if(e===`IOUtils`)return pd(r,a);if(e===`_TLCTrace`)return gd(r);if(!Of(n.version).has(e))return;let o=ip(e,t,n,r,i)?.operators;return e===`Randomization`&&o?[...o,Hd(n)]:o},rp=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),ip=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:Wf};case`Integers`:return{extends:[`Naturals`],operators:Gf};case`Sequences`:return{extends:[],operators:$f(n.version)};case`FiniteSets`:return{extends:[],operators:ep(n.version)};case`TLC`:return{extends:[],operators:Qf(`TLC`,_f(t,n))};case`Randomization`:return{extends:[],operators:Ud(n)};case`_Possible`:return{extends:[],operators:rf(t,n)};case`Json`:return{extends:[],operators:fd(r)};case`Bags`:return{extends:[],operators:Qf(`Bags`,Ru(i))};case`TLCExt`:return{extends:[],operators:Qf(`TLCExt`,nf(t,n))};default:return}},ap=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&Lc.get(t)||[];r.expressions.push(...i,t);let a=fi.sets,o=a??[],s=o.length;fi.sets=o;try{return n()}catch(e){throw Ng(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,fi.sets=a}},op=(e,t,n)=>e.coverage?no(e.coverage,t,n):-1,sp=(e,t,n)=>e.coverage?io(e.coverage,t,n):n(),cp=(e,t,n,r)=>sp(e,t,()=>W(n,r)),lp=(e,t,n,r)=>{let i=cp(e,t,n,r),a=e.coverage;if(a?.covered.has(n))for(let e=t;e!==-1;e=a.prefixes[e])a.primary[e]--;return i},up=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},dp=e=>!e.includes(void 0),fp=e=>e.variables.map(()=>void 0),pp=(e,t,n)=>{let r=[...e];return r[t]=n,r},mp=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},hp=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,gp=e=>e.kind===`Identifier`?e.name:void 0,_p=(e,t,n)=>{if(t.kind===`Label`)return _p(e,t.body,n);let r=gp(t);if(r===void 0)return;let i=_h(n,r);if(i?.kind===`Thunk`)return _p(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=sg(r,e);return o?.kind===`Closure`&&o.params.length===0?_p(e,o.body,o.scope):void 0},vp=(e,t,n)=>{if(t.kind===`Prime`)return _p(e,t.expression,n);if(t.kind===`Label`)return vp(e,t.body,n);let r=gp(t);if(r===void 0)return;let i=_h(n,r);if(i?.kind===`Thunk`)return vp(e,i.expression,i.scope);if(i)return;let a=sg(r,e);return a?.kind===`Closure`&&a.params.length===0?vp(e,a.body,a.scope):void 0},yp=t=>{if(typeof t!=`boolean`)throw new e.b(`TLC expected a boolean expression.`);return t},bp=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),xp=(e,t,n,r)=>{let i=Cp(e,t,n,r);return i&&e.coverage&&!e.isInit&&ro(e.coverage,r),i},Sp=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(ro(r,n),ro(r,r.roots[n])),e.onState(t),!0},Cp=(e,t,n,r)=>t===void 0?dp(n)?Sp(e,n,r):(e.onIncomplete?.(n),!1):dp(n)&&bp(e)?Tp(e,t,n,r):t.kind===`Predicate`?Ep(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?Hp(e,t.expression,t.rest,t.scope,n,t.node):wp(e,t,n)&&xp(e,t.rest,n,t.node),wp=(e,t,n)=>{let r=e.environment,i=cp(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return cp(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?gh(t,r.runtime.version):t}})();try{return!mr(i,a)}catch(t){throw e.callStack&&Ng(e.callStack,[i],t),t}},Tp=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return Hp(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?wp(e,i,n):yp(cp(e,i.node,i.expression,up(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return Sp(e,n,r)},Ep=(e,t,n,r,i,a)=>Dp(e,t,n,r,i,op(e,a,t)),Dp=(t,n,r,i,a,o)=>ap(t,n,()=>{switch(n.kind){case`Let`:{let e=up(t,i,a),s=n.definitions,c=t.coverage?wg(s,e,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):wg(s,e);return Ep(t,n.body,r,c,a,o)}case`Label`:return Ep(t,n.body,r,i,a,o);default:if(Ip.has(n.kind))throw new e.b(`The state relation is not a boolean expression.`);return ap(t,n,()=>Bp(t,n,r,i,a,o))}}),Op=(e,t,n,r,i)=>yp(t)&&xp(e,n,r,i),kp=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),Ap=(e,t,n,r,i,a)=>{let o=up(e,r,i);if(t.kind===`Identifier`){let s=_h(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return Ep(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return Ep(e,s.operator.body,n,s.operator.scope,i,a);let c=s?void 0:e.environment.definitions.get(t.name),l=s?void 0:sg(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&gu(c,e.environment))?Ep(e,l.body,n,l.scope,i,a):Op(e,lp(e,a,t,o),n,i,a)}let s=cg(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=sp(e,a,()=>bg(s,t.args,o));return Ep(e,s.body,n,r,i,a)}let c=kp.has(t.operator)?cp(e,a,t,o):lp(e,a,t,o);return Op(e,c,n,i,a)},jp=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?xp(e,t,pp(n,r,i),a):mr(o,i)&&xp(e,t,n,a)},Mp=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),Np=(e,t,n)=>(e.coverage&&ao(e.coverage,t,n.length+1),n),Pp=(t,n,r,i,a,o)=>{let[s,c]=n.args,l=t.isInit?_p(t.environment,s,i):vp(t.environment,s,i),u=up(t,i,a);if(l===void 0)return cp(t,o,n,u)===!0&&xp(t,r,a,o);let d=cp(t,o,c,u),f=a[l];if(n.operator===`=`)return jp(t,r,a,l,d,o);let p=n.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(typeof p==`object`&&p!==d&&t.callStack?.sources.set(p,c),f!==void 0)return cp(t,o,n,u)===!0&&xp(t,r,a,o);if(!Lr(p))throw new e.b(`The right side of \\IN is not enumerable.`);return Np(t,p,Qr(p)).reduce((e,n)=>xp(t,r,pp(a,l,n),o)||e,!1)},Fp=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Ip=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Lp={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},Rp=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:Lp[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${H(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${H(e)}`:`In computing ENABLED, TLC encountered unbounded quantifier. Make sure that the expression is of form ${e.quantifier===`Forall`?`\\A`:`\\E`} x \\in S: P(x).\n${H(e)}`;if(e.kind===`Choose`&&e.set===void 0)return`In computing ENABLED, TLC encountered unbounded CHOOSE. Make sure that the expression is of form CHOOSE x \\in S: P(x).\n${H(e)}`},zp=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=sp(e,r,()=>Lh(t.bounds,t=>{let r=W(t,n),i=Ph(r,t,a);return Array.isArray(i)&&Np(e,r,i),i}));return zh(t.bounds,o,n.scope,e=>(i.push(e),!1)),i},Bp=(t,n,r,i,a,o)=>{let s=up(t,i,a);switch(n.kind){case`Identifier`:return Ap(t,n,r,i,a,o);case`Apply`:return Fp.has(n.operator)&&n.args.length===2?Pp(t,n,r,i,a,o):n.operator===`=>`&&n.args.length===2?yp(cp(t,o,n.args[0],s))?Ep(t,n.args[1],r,i,a,o):xp(t,r,a,o):Ap(t,n,r,i,a,o);case`And`:{let e=n.operands;if(n.isBulleted||e.length===2){let n=e.slice(1).reduceRight((e,t)=>Mp(`Predicate`,t,i,o,e),r);return Ep(t,e[0],n,i,a,o)}let s=e[e.length-1];return Dp(t,mp(n,e.length-1),Mp(`Predicate`,s,i,o,r),i,a,hp(t,o))}case`Or`:{let e=n.operands;if(n.isBulleted||e.length===2)return e.reduce((e,n)=>Ep(t,n,r,i,a,o)||e,!1);let s=Dp(t,mp(n,e.length-1),r,i,a,hp(t,o)),c=Ep(t,e[e.length-1],r,i,a,o);return s||c}case`Exists`:return zp(t,n,s,o).reduce((e,i)=>Ep(t,n.body,r,i,a,o)||e,!1);case`Forall`:{let e=zp(t,n,s,o);if(e.length===0)return xp(t,r,a,o);let i=e.slice(1).reduce((e,t)=>Mp(`Predicate`,n.body,t,o,e),r);return Ep(t,n.body,i,e[0],a,o)}case`If`:return Ep(t,yp(cp(t,o,n.condition,s))?n.consequent:n.alternative,r,i,a,o);case`Case`:{let c=n.arms.find(e=>yp(cp(t,o,e.condition,s)))?.body??n.other;if(c===void 0)throw new e.b(`TLC encountered a CASE with no conditions true.`);return Ep(t,c,r,i,a,o)}case`FunctionApplication`:{let e=Gh(cp(t,o,n.function,t.isInit?s:xh(s)));if(e){let i=sp(t,o,()=>Kh(e,n,s));return Ep(t,e.body,r,i,a,o)}break}case`Unchanged`:if(!t.isInit)return Hp(t,n.expression,r,i,a,o);break;case`BoxAction`:if(!t.isInit){let e=Ep(t,n.action,r,i,a,o);return Hp(t,n.subscript,r,i,a,o)||e}break;case`AngleAction`:if(!t.isInit)return Ep(t,n.action,Mp(`Changed`,n.subscript,i,o,r),i,a,o)}let c=t.isEnabled?Rp(n):void 0;if(c!==void 0)throw new e.b(c);return Op(t,cp(t,o,n,s),r,a,o)},Vp=(e,t,n)=>e.runtime.warn(Ge.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${H(n)}`),Hp=(e,t,n,r,i,a)=>ap(e,t,()=>{let o=op(e,a,t),s=_p(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;let a=i[s];return a!==void 0&&!mr(a,r)?(Vp(e.environment,s,t),!1):jp(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return xp(e,n,i,o);let c=s.reduceRight((e,t)=>Mp(`Unchanged`,t,r,o,e),n);return Hp(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=_h(r,t.name);if(a?.kind===`Thunk`)return Hp(e,a.expression,n,a.scope,i,o);let s=a?void 0:sg(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return Hp(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=up(e,r,i),s=cg(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return Hp(e,s.body,n,bg(s,t.args,a),i,o)}let c=e.environment,l=cp(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=cp(e,o,t,{environment:c,scope:r,state:i,next:void 0});return mr(l,u)&&xp(e,n,i,o)}),Up=(e,t,n,r,i=!1,a)=>({environment:e,callStack:e.callStack,coverage:e.coverage,isInit:t,isEnabled:i,current:n,onState:r,onIncomplete:a}),Wp=/* @__PURE__ */ Error(`The replay found a successor`),Gp=(e,t,n,r)=>{let i=Up(r,!1,n,()=>{throw Wp},!0),a=i.callStack,o=a?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Mp(`Changed`,e.subscript,t,-1,void 0);Ep(i,e.action,n,t,fp(r),-1)}else Ep(i,e,void 0,t,fp(r),-1);return!1}catch(e){if(e!==Wp)throw e;return a&&(a.expressions.length=o,a.isFrozen=!1),!0}},Kp=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=Up(t,!0,void 0,n,!1,r),s=a.reduceRight((e,t)=>Mp(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);Ep(o,i.expression,s,i.scope,fp(t),i.node??-1)},qp=(e,t,n,r)=>{e.some(e=>Ip.has(e.expression.kind))||e.forEach(e=>{let i=[];Jp(e,-1,t,n,e=>i.push(e)),i.forEach(t=>r(t,e))})},Jp=(e,t,n,r,i,a)=>{let o=Up(r,!1,n,i,!1,a);Ep(o,e.expression,void 0,e.scope,fp(r),t)},Yp=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(_p(t,e,void 0)!==void 0&&e.kind===`Identifier`){n.push(e);return}if(e.kind===`Tuple`){e.elements.forEach(e=>i(e,r));return}if(e.kind!==`Identifier`)return;let a=_h(r,e.name)?void 0:sg(e.name,t);a?.kind===`Closure`&&a.params.length===0&&i(a.body,a.scope)},a=(e,o,s)=>{switch(e.kind){case`Let`:a(e.body,wg(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`FunctionApplication`:a(e.function,o,s);return;case`If`:a(e.consequent,o,s),a(e.alternative,o,s);return;case`Case`:e.arms.forEach(e=>a(e.body,o,s)),e.other&&a(e.other,o,s);return;case`And`:case`Or`:e.operands.forEach(e=>a(e,o,s));return;case`Exists`:case`Forall`:a(e.body,o,s);return;case`Unchanged`:i(e.expression,o);return;case`AngleAction`:a(e.action,o,s);return;case`BoxAction`:a(e.action,o,s),n.push(e.subscript);return;case`Identifier`:case`Apply`:{if(e.kind===`Apply`){if(e.operator===`=>`){e.args.forEach(e=>a(e,o,s));return}if(e.operator===`=`||e.operator===`\\in`){vp(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=_h(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?cg(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:sg(i,t);if(l?.kind!==`Closure`||s.has(l.body)||t.definitions.get(i)?.isRecursive)return;let u=e.kind===`Apply`?e.args:[];if(l.params.length!==u.length)return;s.add(l.body),a(l.body,bg(l,u,r(o)),s),s.delete(l.body)}}};return e.forEach(e=>a(e.expression,e.scope,/* @__PURE__ */ new Set)),n.flatMap(e=>e.location.range??[])},Xp=/* @__PURE__ */ new WeakMap,Zp=/* @__PURE__ */ new WeakMap,Qp=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},$p=(e,t,n)=>{let r=e.slice();return r[t]=n,r},em=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,tm=(t,n)=>{let r=new e.b(n);return t.isInit?r:e.it(r,e.tt.error)},nm=(e,t,n,r)=>{let i=oh(n);return r&&Ip.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${em(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},rm=(e,t,n)=>{let r=Bo(t),i=H(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${em(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
1781
- `:``}${i}`},im=(e,t,n)=>sm(e,t,W(t,n)),am=new Set(Lf.map(e=>e.name)),om=e=>e.kind===`Apply`?am.has(e.operator):e.kind!==`Identifier`&&!Ip.has(e.kind),sm=(t,n,r,i=!0)=>{if(typeof r==`boolean`)return r;let a=nm(t,r,n,i);throw t.isInit&&i&&om(n)?new e.z(a):tm(t,a)},cm=(e,t,n,r)=>r.environment.callStack?W(n,r):(e[t]??=Rg(n,r.environment))(r),lm=e=>e===`=`||e===`\\in`||e===`\\subseteq`,um=(e,t,n)=>{let r=n?Xp:Zp,i=r.get(e);if(i)return i;let a=Wm(e,t,n),o=n?void 0:Um(e,t),s=o?(e,t,n,r,i,s)=>(e.generator?o:a)(e,t,n,r,i,s):a;return r.set(e,s),s},dm=(e,t)=>{if(t.constants.has(e))return;let n=Oh(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},fm=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return fm(e.expression,t,!1,r);if(e.kind!==`Identifier`||O(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=dm(e.name,t);if(a&&!r.has(a))return r.add(a),fm(a.body,t,n,r)},pm=(e,t,n)=>fm(e,t,!n),mm=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return mm(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=wg(e.definitions,Qp(r,t,n));return mm(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=_h(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return mm(a.expression,a.scope,n,r,i);if(a)return;let o=r.environment.variableIndex.get(e.name);if(o!==void 0)return i?void 0:o;let s=dm(e.name,r.environment);if(s)return mm(s.body,void 0,n,r,i)},hm=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||O(e))||!t&&e.kind===`Prime`,gm=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>gm(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[{index:r,expression:e}];let i=dm(e.name,t);if(i)return n.add(e.name),gm(i.body,t,n)},_m=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),vm=(e,t,n)=>_m.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||lm(e.operator)&&(hm(e.args[0],n)||pm(e.args[0],t,n)!==void 0)||O(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,ym=/* @__PURE__ */ new Set,bm=(e,t)=>{if(O(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return Gc(e,(e,i)=>{let a=r?bm(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r=!1,e}),r?n:void 0},xm=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||O(e)?void 0:Oh(r,t);return i&&!n.has(i)&&(n.add(i),xm(i.body,t,n))?!0:Be(e).some(e=>xm(e,t,n))},Sm=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=pm(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=gm(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return vm(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:um(e,t,n)}},Cm=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(xu(e,t)===void 0||xm(e,t,/* @__PURE__ */ new Set))return!0;let n=bm(e,ym);return!n||n.some(e=>r.has(e))}),o=a===-1?i.length:a;if(o!==0)return{names:n,guards:i.slice(0,o),rest:i.slice(o)}},wm=(e,t,n)=>{let r=e.map(e=>Sm(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=bp(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Km(u)){d??=Qp(t,n,u);for(let e=s;e<r.length;e++){let n=r[e],i=t.current,o=i&&n.kind===`Unchanged`?n.variables.find(e=>{let t=u[e.index];return t!==void 0&&!mr(t,i[e.index])}):void 0;if(o){Vp(t.environment,o.index,o.expression);return}let s=n.expression,c=cm(a,e,s,d);if(!sm(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=Qp(t,n,u);let r=cm(i,s,e.expression,d);if(!sm(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=Qp(t,n,u);let r=cm(i,s,e.value,d),a=u[e.index];if(a===void 0)u=$p(u,e.index,r),d=void 0;else if(!mr(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let i of e.variables){let e=(r??u)[i.index];if(e===void 0)r??=u.slice(),r[i.index]=n[i.index];else if(!mr(e,n[i.index])){Vp(t.environment,i.index,i.expression);return}}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},Tm=e=>{let t=Rp(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw tm(n,t);im(n,e,Qp(n,r,i))&&s(i,a)}},Em=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Qp(r,i,a);if(a[l]!==void 0){im(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Lr(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${em(r)}, the right side of \\IN is not enumerable.`;throw tm(r,`${t}\n${H(e)}`)}let p=Qr(f);if(r.generator){for(let e of Pd(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c($p(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c($p(a,l,p[e]),o)}},Dm=/* @__PURE__ */ new WeakMap,Om=e=>{let t=Dm.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Om),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Dm.set(e,n),n},km=(e,t)=>{let n=e.args[0],r=Tm(e),i=(e,r,i)=>mm(n,r,i,e,!t)??-1,a=Em(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=W(e.args[1],Qp(t,n,o));l($p(o,u,d),s)}},Am=(e,t,n)=>{let r=H(e);return(i,a,o,s,c,l)=>{let u=Qp(i,a,o),d=W(e.function,n?u:xh(u)),f=Gh(d);if(f!==void 0){um(f.body,t,n)(i,Kh(f,e,u),o,s,c,l);return}if(!jt(d))throw tm(i,`In computing ${em(i)}, a non-function (${Bo(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw tm(i,`In computing ${em(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},jm=(e,t)=>{if(gm(e,t))return wm([Om(e)],t,!1);if(e.kind===`Tuple`)return um(Om(e),t,!1);let n=Om(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?_h(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){um(Om(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=Qp(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=cg(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){um(Om(n.body),t,!1)(r,bg(n,e.args,u),a,o,s,c);return}}im(r,n,u)&&c(a,o)}},Mm=(e,t,n)=>{let r=e.operator,i=Tm(e),a=O(e)?void 0:sg(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Ug(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=um(a.body,t,n),o(e,i(Qp(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Qp(a,o,s),f=cg(e,d);f?.kind===`Closure`?um(f.body,t,n)(a,bg(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Nm=(e,t,n)=>{let r=Tm(e),i=O(e)?void 0:dm(e.name,t),a;return(o,s,c,l,u,d)=>{let f=_h(s,e.name);f?.kind===`Thunk`&&!f.isReleased?um(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&ng(i,t)!==void 0?r(o,s,c,l,u,d):(a??=um(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},Pm=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||O(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!O(i))return;let a=fm(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},Fm=e=>e.kind===`And`?e.operands.flatMap(Fm):[e],Im=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&vm(e,t,!1),Lm=e=>{let t=[];return(n,r,i)=>{let a=Qp(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!sm(n,i,cm(t,r,i,a)))return}}},Rm=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=Fm(e),r=n.findIndex(e=>!Im(e,t)||Pm(e,t)),i=r===-1?void 0:Pm(n[r],t);return i?{...i,before:r===0?void 0:Lm(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>Rm(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||O(e))return;let r=sg(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Rm(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(!i||o?.kind!==`Identifier`||!O(o))return;let s=i.before,c=s&&Ug(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(Qp(e,t,n)),n))}},zm=(e,t,n)=>{let r=_h(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},Bm=(e,t,n)=>{let r=e.map(e=>um(e,t,n)),i=n?[]:e.map(e=>Rm(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&zm(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},Vm=e=>(t,n,r,i,a,o)=>{let s=t.generator;if(!s)throw Error(`A random choice needs the run's generator`);let c=Math.floor(s.nextDouble()*e.length),l=wd(s);for(let s=0;s<e.length;s++)if(e[(c+s*l)%e.length](t,n,r,i,a,o),t.successors>0||t.isStopped)return},Hm=(e,t)=>{let n=um(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=Qp(r,i,a),u=t.runtime.version,d=Lh(e.bounds,e=>W(e,l)).map((n,r)=>Pd(Mh(n,e.bounds[r].set,u).length,n,t.runtime.getRandom(),u)),f=(t,i)=>{if(t<0)return n(r,i,a,o,s,c),r.successors>0||r.isStopped;let l=e.bounds[t].pattern;return d[t].some(e=>f(t-1,yh(i,l,e)))};f(d.length-1,i)}},Um=(e,t)=>{if(e.kind===`Exists`)return Hm(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>um(e,t,!1));return e.isBulleted?Vm(n):n.reduce((e,t)=>Vm([e,t]))},Wm=(t,n,r)=>{let i=e=>um(e,n,r);switch(t.kind){case`And`:return wm(t.operands,n,r);case`Or`:return Bm(t.operands,n,r);case`Exists`:{let e=i(t.body),a=t.bounds[0];if(t.bounds.length===1&&a.pattern.kind===`Name`){let t=a.pattern.name;return(r,i,o,s,c,l)=>{let u=Mh(W(a.set,Qp(r,i,o)),a.set,n.runtime.version);for(let n=0;n<u.length&&!r.isStopped;n++)e(r,vh(i,t,u[n]),o,s,c,l)}}let o=r?void 0:Cm(t,n);if(o){let e=wm(o.rest,n,r);return(r,i,a,s,c,l)=>{let u=Qp(r,i,a),d=Lh(t.bounds,e=>Mh(W(e,u),e,n.runtime.version));if(d.some(e=>e.length===0))return;let f=(t,n)=>{if(t<0)e(r,n,a,s,c,l);else for(let e of d[t]){if(r.isStopped)return;let i=vh(n,o.names[t],e);if(t===d.length-1){let e=Qp(r,i,a);if(!o.guards.every(t=>im(r,t,e)))continue}f(t-1,i)}};f(d.length-1,i)}}return(n,r,i,a,o,s)=>{Bh(t.bounds,Qp(n,r,i),t=>(e(n,t,i,a,o,s),n.isStopped))}}case`Forall`:{let e=i(t.body),a=!r&&xu(t,n)!==void 0&&!xm(t.body,n,/* @__PURE__ */ new Set)?bm(t,ym):void 0;return(n,r,i,o,s,c)=>{let l=[];Bh(t.bounds,Qp(n,r,i),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>_h(r,e)?.kind===`Value`)){u.every(e=>im(n,t.body,Qp(n,e,i)))&&c(i,o);return}let d=(r,i,a)=>{r===u.length?c(i,a):r>0&&n.isInit&&Km(i)?u.slice(r).every(e=>im(n,t.body,Qp(n,e,i)))&&c(i,a):e(n,u[r],i,a,!0,(e,t)=>d(r+1,e,t))};d(0,i,o)}}case`If`:{let e=i(t.consequent),n=i(t.alternative);return(r,i,a,o,s,c)=>{let l=W(t.condition,Qp(r,i,a));if(typeof l!=`boolean`)throw tm(r,rm(r,l,t));(l?e:n)(r,i,a,o,s,c)}}case`Case`:{let e=t.arms.map(e=>({condition:e.condition,source:e.body,body:i(e.body)})),n=t.other?i(t.other):void 0;return(r,i,a,o,s,c)=>{let l=Qp(r,i,a),u=e.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw tm(r,`In computing ${em(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Bo(t)}) was used as a guard condition of a CASE.\n${oh(e.source)}`)})?.body??n;if(!u)throw tm(r,`In computing ${em(r)}, TLC encountered a CASE with no conditions true.\n${H(t)}`);u(r,i,a,o,s,c)}}case`Let`:{let e=i(t.body),r=Eg(t.definitions,n);return(n,i,a,o,s,c)=>e(n,wg(t.definitions,Qp(n,i,a),r),a,o,s,c)}case`Unchanged`:return r?()=>{throw new e.b(`UNCHANGED appears in an initial predicate at ${rh(t)}`)}:jm(t.expression,n);case`AngleAction`:{let e=i(t.action),r={kind:`Unchanged`,expression:t.subscript,location:t.subscript.location},a=(e,t,i)=>{try{return im(e,r,Qp(e,t,i))}catch(t){throw e.isEnabled?gh(t,n.runtime.version):t}};return(t,n,r,i,o,s)=>e(t,n,r,i,o,(e,r)=>{a(t,n,e)||s(e,r)})}case`BoxAction`:return Bm([t.action,Om(t.subscript)],n,r);case`Label`:return i(t.body);case`Identifier`:return Nm(t,n,r);case`FunctionApplication`:return Am(t,n,r);case`Apply`:{let e=t.args;if(lm(t.operator)){let i=pm(e[0],n,r);if(i!==void 0)return t.operator===`=`?wm([t],n,r):Em(t,()=>i);if(hm(e[0],r))return km(t,r)}if(t.operator===`=>`){let n=i(e[1]);return(r,i,a,o,s,c)=>{let l=W(e[0],Qp(r,i,a));if(typeof l!=`boolean`){let e=Bo(l),n=H(t);throw tm(r,r.isInit?`In computing initial states of a predicate of form P => Q, P was ${e}\n.${n}`:r.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${e}.\n${n}`:`In computing next states of a predicate of the form P => Q, P was\n${e}.\n${n}`)}l?n(r,i,a,o,s,c):c(a,o)}}return Mm(t,n,r)}default:return Tm(t)}},Gm=e=>e.variables.map(()=>void 0),Km=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},qm=(t,n)=>{let r=n.state;if(!r||!Km(r))throw new e.b(`ENABLED needs a complete state at ${rh(t)}`);let i=n.environment;if(i.callStack)return Gp(t,n.scope,r,i);let a={environment:i,isInit:!1,isEnabled:!0,current:r,isStopped:!1,generator:void 0,successors:0};return um(t,i,!1)(a,n.scope,Gm(i),void 0,!1,()=>{a.isStopped=!0}),a.isStopped},Jm=(t,n,r,i,a)=>{let o={environment:n,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};um(t,n,!0)(o,i,Gm(n),void 0,!1,t=>{if(!o.isStopped){if(!Km(t)){if(a){o.isStopped=a([...t]);return}throw e.it(new e.S([...t]),e.tt.error)}o.isStopped=r(t)}})},Ym=(e,t,n)=>{let r=[];return Jm(e,t,e=>(r.push(e),!1),n),r},Xm=(t,n,r,i,a,o,s)=>{let c={environment:r,isInit:!1,isEnabled:!1,current:n,isStopped:!1,generator:o,successors:0,onUnsatisfied:s};return um(t,r,!1)(c,a,Gm(r),void 0,!1,(t,n)=>{if(!c.isStopped){if(!Km(t)){let i=r.variables.filter((e,n)=>t[n]===void 0);throw new e.C(`Successor state is not completely specified by action ${n??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,t,n,i)}c.successors++,c.isStopped=i({state:t,action:n})}}),c.successors},Zm=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return um(e,n,!1)(i,r,Gm(n),void 0,!1,e=>{Km(e)||(i.isStopped=!0)}),i.isStopped},Qm=(e,t,n,r)=>{let i=[];return Xm(e,t,n,e=>(i.push(e),!1),r),i},$m=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),eh=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),th=e=>eh.has(e.kind)||e.kind===`Apply`&&$m.has(e.operator),nh=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&At(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},rh=e=>`line ${e.location.line}, column ${e.location.column}`,H=t=>{let n=t.location.range;return n?e.X(n):rh(t)},ih={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},ah=(t,n)=>new e.b(`TLC encountered a temporal formula (${t}) when evaluating a predicate or action.\n${H(n)}`),oh=e=>e.kind===`Number`?e.text??String(e.value):H(e),sh=(t,n)=>new e.b(`A non-boolean expression (${Bo(n)}) was used as the condition of an IF.\n${H(t)}`),ch=(t,n,r)=>{let i=t.location.range;if(i?.start.line===t.location.line&&i.start.column===t.location.column||!i)return new e.b(`A non-boolean expression (${Bo(r)}) was used as a formula in a ${t.kind===`And`?`conjunction`:`disjunction`}.\n${oh(t.operands[n])}`);let a=t.prefixEnds?.[Math.max(n,1)-1]??i.end;return new e.b(`Attempted to evaluate an expression of form P ${t.kind===`And`?`/\\`:`\\/`} Q when ${n===0?`P`:`Q`} was\n${Bo(r)}.\n${H({...t,location:{...t.location,range:{...i,end:a}}})}`)},lh=t=>{let n=t.field,r=e=>`Attempted to select nonexistent field "${n}" from the record\n${A(L(e))}\n${H(t)}`,i=e=>`Attempted to apply function:\n${A(L(e))}\nto argument "${n}", which is not in the domain of the function.`;return a=>{if(!jt(a))throw new e.b(`Attempted to select field "${n}" from a non-record value ${A(L(a))}\n${H(t)}`);let o=En(a);if(o===`tuple`)throw Ei(n);return Mi(a.kind===`LazyFunction`?I(a):a,n,o===`record`?r:i)}},uh=e=>e===`1.7.4`?(t,n)=>Ci(t,n,e):void 0,dh=t=>n=>{if(!jt(n))throw new e.b(`Attempted to apply the operator DOMAIN to a non-function\n(${Bo(n)})\n${H(t)}`);return Pi(n)},fh=(t,n)=>(r,i)=>{if(!j(r)||ln(r))throw new e.b(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${H(t)}`);return n.evaluateBinary?n.evaluateBinary(r,i):n.evaluate([r,i])},ph=t=>e.it(new e.b(`TLC can't handle real numbers.\n${t.text}`),e.tt.configParseError),mh=t=>e.it(new e.b(`TLC can't handle a number this big.\n${t.text??t.value}`),e.tt.error),hh=(t,n)=>new e.R(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${H(n)}`,t),gh=(t,n)=>t instanceof e.R&&n!==`1.7.4`?new e.b(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${t.variable} occurring in the state formula v.\n`):t,_h=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},vh=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),yh=(t,n,r)=>{if(n.kind===`Name`)return vh(t,n.name,r);let i=ui(r);if(!i||i.length!==n.names.length){let t=n.ranges?.[0];throw new e.b(`Argument mismatch in operator application.${t?e.X(t):``}`)}return n.names.reduce((e,t,n)=>vh(e,t,i[n]),t)},bh=(t,n)=>{if(jt(t))return t;throw new e.b(`A non-function (${Bo(t)}) was applied as a function.\n${H(n)}`)},xh=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},Sh=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),Ch=(t,n)=>{if(typeof t!=`boolean`)throw new e.b(`Expected ${n} to be a boolean but found ${L(t)}`);return t},wh=(t,n,r)=>{if(typeof t!=`boolean`)throw new e.b(`Attempted to evaluate an expression of form P => Q when ${r} was\n${Bo(t)}.\n${H(n)}`);return t},Th=(t,n)=>{if(typeof t!=`boolean`)throw new e.b(`Attempted to apply the operator ~ to a non-boolean\n(${Bo(t)})\n${H(n)}`);return!t},Eh=(t,n,r)=>{if(typeof t!=`boolean`||typeof n!=`boolean`)throw new e.b(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${H(r)}`);return t===n},Dh=(t,n)=>{if(typeof t!=`boolean`)throw new e.b(`TLC expected a boolean value, but did not find one. ${oh(n)}`);return t},Oh=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),kh=(e,t)=>{let n=`universally (\\A) or existentially (\\E) quantify over ${t}, because this would require checking an\ninfinite number of cases.`;if(typeof e==`object`&&e.kind===`SequenceSet`)return`In TLA+, Seq(S) represents the set of all finite sequences whose elements come from the set S. Even when S\nis a finite set, the number of possible sequences in Seq(S) is unbounded because sequences can have any\nfinite length (e.g., length 0, 1, 2, and so on). As a result, TLC cannot evaluate expressions that\n${n} Note that for a finite set of sequences s, TLC handles s \\subseteq Seq(S).\nSee https://explain.tlapl.us/seq-unenumerable for additional details.`;if(typeof e==`object`&&e.kind===`InfiniteSet`&&e.name!==`STRING`&&e.name!==`Any`)return`The set ${e.name} contains infinitely many elements. As a result, TLC cannot evaluate expressions that\n${n} Note that TLC handles set membership like T \\subseteq ${e.name} for any finite set T.`},Ah=(t,n,r)=>{if(!j(t)||ln(t)){let i=L(t),a=r===`1.7.4`?void 0:kh(t,i);throw new e.b(a===void 0?`TLC encountered a non-enumerable quantifier bound\n${i}.\n${oh(n)}`:`TLC encountered the non-enumerable quantifier bound\n${i}\n${oh(n)}\n${a}`)}},jh=(e,t,n)=>(Ah(e,t,n),typeof e==`object`&&e.kind===`Interval`?Ar(e):Wr(e)??Xr(e)),Mh=(e,t,n)=>n===`1.7.4`?(Ah(e,t,n),Wr(e)??Qr(e)):jh(e,t,n),Nh=e=>{if(typeof e==`object`&&e.kind===`Interval`)return ai(e),e},Ph=(e,t,n)=>Nh(e)??Mh(e,t,n),Fh=(e,t,n)=>Nh(e)??jh(e,t,n),Ih=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},Lh=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set)),n),[]),Rh=(e,t)=>Lh(e,e=>Ph(W(e,t),e,t.environment.runtime.version)),zh=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Ih(t[n],t=>i(n-1,yh(a,e[n].pattern,t)));return i(e.length-1,n)},Bh=(e,t,n)=>zh(e,Rh(e,t),t.scope,n),Vh=(e,t)=>{let n=Lh(e,e=>W(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Hh=(e,t,n)=>{if(e.length===1)return yh(t,e[0].pattern,n);let r=ui(n)??[];return e.reduce((e,t,n)=>yh(e,t.pattern,r[n]),t)},Uh=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Wh=e=>Object.assign(e.value,{lambda:e}),Gh=e=>Uh(e)?e.lambda:void 0,Kh=(t,n,r)=>{let i=t.value,a=n.args.map(e=>W(e,r)),o=a.length===1?a[0]:Pr(a),s=(e,t,r)=>`In applying the function\n${A(L(i))},\nthe ${e} is:\n${A(L(t))}${r}.\n${H(n.function)}`,c=t.bounds;if(c.length===1){if(!hi(o,i.domain))throw new e.b(s(`first argument`,o,`which is not in its domain`));return Hh(c,t.scope,o)}let l=ui(o),u=typeof i.domain==`object`&&i.domain.kind===`ProductSet`?i.domain.factors:[],d=()=>new e.b(`In applying the function\n${A(L(i))},\nthe argument list is:\n${A(L(o))}\nwhich does not match its formal parameter.\n`);if(l===void 0||(c.forEach((t,n)=>{if(n>=l.length)throw d();let r=l[n],i=`argument number ${n+1}`;if(!hi(r,u[n]))throw new e.b(s(i,r,`${t.pattern.kind===`Name`?``:`
1782
- `}which is not in its domain`));if(t.pattern.kind===`Tuple`&&ui(r)?.length!==t.pattern.names.length)throw new e.b(s(i,r,`which does not match its formal parameter`))}),l.length>c.length))throw d();return Hh(c,t.scope,o)},qh=(t,n)=>{let r=n.location.range;if(r)return{parameters:t.flatMap((e,n)=>n>0&&t[n-1].set===e.set?[]:[{index:n,name:e.pattern.kind===`Name`?e.pattern.name:`<<${e.pattern.names.join(`, `)}>>`}]),body:e.X(r)}},Jh=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},Yh=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},Xh=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),Zh=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),Qh=(e,t)=>{let n=Vh(e.bounds,t),r=Yh(n,(n,r)=>W(e.body,Sh(t,Hh(e.bounds,vh(void 0,e.name,r),n))),Jh(qh(e.bounds,e.body),e.bounds,n),Xh(e.bounds));Wh({value:r,bounds:e.bounds,body:e.body,scope:vh(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=Qh(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?Dn(i):i},$h=(t,n)=>{if(typeof n!=`object`||En(n)!==`lambda`||t.kind===`Operator`||t.isSelfReferential||n.kind!==`LazyFunction`||!At(n.domain))return n;try{let e=I(n);return Cn(e.domain,e.range)}catch(t){if(t instanceof e.b)return n;throw t}},eg=(t,n)=>t.kind===`Operator`&&t.params.length>0?()=>{throw new e.b(`Operator ${t.name} requires ${t.params.length} arguments`)}:t.kind===`Function`?t.isSelfReferential?e=>Qh(t,e):Rg(Zh(t),n):Rg(t.body,n),tg=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=eg(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(Sh(e,void 0)):e=>a[i]??r(Sh(e,void 0));return t.definitionEvaluators.set(e,o),o},ng=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},rg=(t,n)=>t.forEach(t=>{if(t.kind===`Operator`&&t.params.length>0)return;let r=t.name;if(n.constants.has(r)||n.substitutions.has(r)||!gu(t,n))return;let i=n.facts.ids.get(t);if(i===void 0||n.startupValues[i]!==void 0)return;let a={environment:n,scope:void 0,state:void 0,next:void 0};try{let e=n.runtime.evaluateAtStartup(()=>$h(t,eg(t,n)(a)));fr(e),n.startupValues[i]=e}catch(t){if(!(t instanceof e.b)&&!e.et(t))throw t}}),ig=(t,n)=>{if(n===void 0||t===n)return!0;try{return n.every((e,n)=>e===void 0||t?.[n]!==void 0&&Pn(t[n],e))}catch(t){if(t instanceof e.b)return!1;throw t}},ag=(e,t)=>{let n=e.cache;if(n!==void 0&&ig(t.state,e.state)&&ig(t.next,e.next))return n;let r=t.environment.coverage,i=r?.current===-1?void 0:r?.values.get(e),a=r&&i!==void 0?io(r,i,()=>W(e.expression,Sh(t,e.scope))):W(e.expression,Sh(t,e.scope));return(!e.isStreamed||ei(a))&&(e.cache=a,e.state=t.state,e.next=t.next),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),a},og=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),sg=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return sg(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?og(r):t.builtins.get(e)},cg=(e,t)=>O(e)?lg(e.operator,t):sg(e.operator,t.environment)??lg(e.operator,t),lg=(e,t)=>{let n=_h(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return sg(e,t.environment)},ug=e=>e.kind===`Closure`?e.params.length:e.arity,dg=(t,n)=>{if(t.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:t.params.map(e=>({name:e,arity:0})),body:t.body,scope:n.scope};let r=t.kind===`OperatorReference`?t.operator:t.kind===`Identifier`?t.name:void 0,i=r===void 0?void 0:lg(r,n);if(!i)throw new e.b(`Expected an operator argument at ${rh(t)}`);return i},fg=(e,t,n)=>{if(e.kind===`Builtin`&&e.isLazy)return e.evaluate(t.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>e})),n);if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>vh(e,n.name,t[r]),e.scope);return W(e.body,Sh(n,r))},pg=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:ug(e),call:n=>fg(e,n,t)},mg=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=lg(e.name,t);return n!==void 0&&ug(n)>0},hg=(e,t)=>e.map(e=>mg(e,t)?pg(dg(e,t),t):W(e,t)),gg=(t,n)=>new e.b(`Operator ${t.name} expects ${t.params.length} arguments but received ${n}`),_g=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),vg=(e,t)=>{let n=t.variableIndex.get(e);if(n!==void 0)return{kind:`Variable`,index:n};let r=t.constants.get(e);if(r!==void 0)return{kind:`Value`,value:r};let i=t.substitutions.get(e);if(i!==void 0)return vg(i,t);let a=t.definitions.get(e);if(a)return{kind:`Definition`,definition:a};let o=t.builtins.get(e);if(o&&o.arity===0&&!o.isStateLevel)return{kind:`Value`,value:o.evaluate([])}},yg=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Pt(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=_g(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=O(e)?void 0:vg(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0&&!t.callStack)return t=>{let n=_h(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:_g(e,t)}}return t=>_g(e,t)},bg=(e,t,n,r)=>{if(t.length!==e.params.length)throw gg(e,t.length);let i=e.scope;for(let a=0;a<t.length;a++){let o=e.params[a],s=o.arity>0?{kind:`Operator`,operator:dg(t[a],n)}:(r?.[a]??yg(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},xg=(e,t,n,r)=>e.kind===`Closure`?W(e.body,Sh(n,bg(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(Vg(t,n),n):e.evaluate(hg(t,n),n),Sg=/* @__PURE__ */ new WeakMap,Cg=e=>{let t=Sg.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return Sg.set(e,n),n},wg=(e,t,n)=>{let r=e.map(e=>({name:e.name,binding:{kind:`Value`,value:!1},parent:void 0})),i=r.reduce((e,t)=>(t.parent=e,t),t.scope);e.forEach((e,a)=>{r[a].binding=e.kind===`Function`?{kind:`Thunk`,expression:Cg(e),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1}:e.params.length>0||n?.impure.has(e)?{kind:`Operator`,operator:{kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:i}}:{kind:`Thunk`,expression:e.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(e)??!1}});let a=t.environment.coverage;return a&&a.current!==-1&&r.forEach(e=>{e.binding.kind===`Thunk`&&a.values.set(e.binding,a.current)}),i},Tg=(t,n,r)=>{let i=_h(r.scope,t);if(i?.kind===`Value`)return i.value;if(i?.kind===`Thunk`)return ag(i,r);if(i?.kind===`Operator`){if(ug(i.operator)===0)return fg(i.operator,[],r);throw new e.b(`Operator ${t} is used without arguments`)}let a=vg(t,r.environment);if(a?.kind===`Variable`){let e=r.state?.[a.index];if(e===void 0)throw hh(t,n);return e}if(a?.kind===`Value`)return a.value;if(a?.kind===`Definition`)return tg(a.definition,r.environment)(r);let o=r.environment.builtins.get(t);if(o?.arity===0)return o.evaluate([],r);throw new e.b(`Unknown identifier ${t} at ${rh(n)}`)},Eg=(e,t)=>({impure:new Set(e.filter(e=>vu(e,t))),streamed:new Set(e.filter(e=>vu(e,t,`streamed`)))}),Dg=e=>[...e.facts.ids.keys()].some(t=>vu(t,e)),Og=e=>[...e.facts.ids.keys()].some(t=>vu(t,e,`repeated`)),kg=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,Ag=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),jg=e=>t=>{let n=e(t);return Pn(n,e(Ag(t)))},Mg=(t,n,r,i)=>a=>{i.expressions.push(t);let o=fi.sets,s=fi.callStack,c=o??[],l=c.length;fi.sets=c,fi.callStack=i;try{let e=n(a),o=kg(e)?e.rebind(r):e;return i.values.set(t,o),typeof o==`object`&&o.kind!==`FilteredSet`&&th(t)&&i.sources.set(o,t),o}catch(n){n instanceof e.N&&!i.isFrozen&&(i.expressions.length=0,i.isFrozen=!0);let r=n instanceof Error?i.failures.get(n):void 0;n instanceof Error&&i.failures.set(n,t);let a=nh(t,i.values),o=a&&!Be(t).some(e=>e===r)?i.values.get(a):void 0,s=t.kind===`FunctionApplication`&&o!==void 0&&!jt(o)?void 0:o;throw Ng(i,[s,...c.slice(l).filter(e=>e!==s)],n),n}finally{i.isFrozen||i.expressions.pop(),c.length=l,fi.sets=o,fi.callStack=s}},Ng=(t,n,r)=>{let i=[...new Set(n)].flatMap(e=>{let n=typeof e==`object`?t.sources.get(e):void 0;return n?[n]:[]});if(i.length>0&&r instanceof e.b){t.isFrozen||t.expressions.push(...i);let e=t.fingerprint;t.fingerprint={sources:[...i,...e?.sources??[]],reason:e?.reason??r.message}}t.isFrozen=!0},Pg=(t,n,r)=>{if(!(r instanceof e.b))return;t.isFrozen||t.expressions.push(n),t.isFrozen=!0;let i=t.fingerprint;t.fingerprint={sources:[n,...i?.sources??[]],reason:i?.reason??r.message}},Fg=e=>({...e,coverage:void 0,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),Ig=(e,t,n,r)=>i=>{if(r.expressions.at(-1)===e)return n(i);r.expressions.push(...t);try{return n(i)}finally{r.isFrozen||(r.expressions.length-=t.length)}},Lg=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=no(n,i,e);ro(n,a),n.current=a;try{let i=t(r);return typeof i==`object`&&e.kind===`SetEnumeration`&&n.values.set(i,a),i}finally{n.current=i}},U=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=d_(e,t),i=t.callStack,a=i&&Lc.get(e),o=i?Mg(e,r,t,i):r,s=i&&a?Ig(e,a,o,i):o,c=t.coverage,l=c?Lg(e,s,c):s;return t.evaluators.set(e,l),l},Rg=(e,t)=>{if(t.callStack||t.coverage)return U(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=_s(e,t)??U(e,t);return t.entryEvaluators.set(e,r),r},W=(e,t)=>Rg(e,t.environment)(t),zg=(e,t)=>{let n=e.name,r=O(e)?void 0:vg(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw hh(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n;return r=>(n??=tg(e,t))(r)}return t=>Tg(n,e,t)},Bg=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||O(e))return!0;let n=sg(e.name,t);return n===void 0||ug(n)===0},Vg=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),Hg=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Vg(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Bg(t[0],n)){let e=U(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Bg(t[0],n)&&Bg(t[1],n);if(i&&a){let e=U(t[0],n),r=U(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(hg(t,n),n)},Ug=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw gg(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:yg(e,n));return n=>{let a=e.scope;for(let e=0;e<t.length;e++){let o=i[e],s=o?o(n):{kind:`Operator`,operator:dg(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Wg=(e,t,n)=>{let r=Ug(e,t,n),i;return t=>(i??=Rg(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},Gg=(t,n)=>{let r=t.args;if(t.operator===`=>`){let e=U(r[0],n),i=U(r[1],n);return n=>!wh(e(n),t,`P`)||wh(i(n),t,`Q`)}if(t.operator===`~`&&r.length===1){let e=U(r[0],n);return n=>Th(e(n),t)}if(t.operator===`<=>`){let e=U(r[0],n),i=U(r[1],n);return n=>Eh(e(n),i(n),t)}if(t.operator===`~>`||t.operator===`-+->`)return()=>{throw ah(t.operator===`~>`?`a ~> b`:`a -+-> formula`,t)};let i=O(t)?void 0:sg(t.operator,n);if(i?.kind===`Closure`)return Wg(i,r,n);if(i?.kind===`Builtin`&&i.name===`DOMAIN`){let e=U(r[0],n),i=dh(t);return t=>i(e(t))}if(i?.kind===`Builtin`&&i.name===`TLCEval`&&r.length===1){let e=!Ic.has(t)&&!Su(r[0],n);return t=>i.evaluate(Vg(r,t),e&&t.scope===void 0?void 0:t)}if(i?.kind===`Builtin`&&i.name===`\\subseteq`&&r.length===2){let e=U(r[0],n),a=U(r[1],n),o=fh(t,i);return t=>o(e(t),a(t))}if(i?.kind===`Builtin`)return Hg(i,r,n);if(t.operator===`\\cdot`&&r.length===2)return()=>{throw new e.b(n.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let a=r.map(e=>yg(e,n));return i=>{let o=lg(t.operator,i);if(o)return xg(o,r,i,a);throw n.definitions.get(t.operator)?.kind===`Function`?new e.b(`${t.operator} is a function; apply it with brackets`):new e.b(`Unknown operator ${t.operator} at ${rh(t)}`)}},Kg=(e,t)=>{let n=e.kind===`Forall`,r=U(e.body,t),i=e.bounds[0];if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=U(i.set,t);return s=>Ih(Ph(o(s),i.set,t.runtime.version),t=>Dh(r(Sh(s,vh(s.scope,a,t))),e)!==n)?!n:n}let a=e.bounds;if(a.every(e=>e.pattern.kind===`Name`)){let i=a.map(e=>e.pattern.kind===`Name`?e.pattern.name:``);return o=>{let s=Lh(a,e=>Ph(U(e,t)(o),e,t.runtime.version)),c=(t,a)=>t<0?Dh(r(Sh(o,a)),e)!==n:Ih(s[t],e=>c(t-1,vh(a,i[t],e)));return c(a.length-1,o.scope)?!n:n}}return t=>Bh(a,t,i=>Dh(r(Sh(t,i)),e)!==n)?!n:n},qg=(e,t)=>{if(e.kind===`Tuple`)return Pr(e.names.map(e=>{let n=_h(t,e);return n?.kind===`Value`&&n.value}));let n=_h(t,e.name);return n?.kind===`Value`?n.value:void 0},Jg=/* @__PURE__ */ new WeakSet,Yg=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&Jg.add(e)},Xg=/* @__PURE__ */ new WeakMap,Zg=e=>{if(Xg.has(e))return Xg.get(e);let t=/* @__PURE__ */ new Set,n=e=>e.kind!==`Subexpression`&&(e.kind===`Identifier`&&t.add(e.name),(e.kind===`Apply`||e.kind===`OperatorReference`)&&t.add(e.operator),e.kind===`ExceptAt`&&t.add(`@`),Be(e).every(n)),r=n(e)?[...t]:void 0;return Xg.set(e,r),r},Qg=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=_h(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),$g=e=>Jg.has(e),e_=(t,n)=>{let r=$g(t),i=U(t.body,n),a=t.bounds,o=a[0],s=a.length===1&&o.pattern.kind===`Name`,c=(e,t)=>{if(s&&o.pattern.kind===`Name`){let n=o.pattern.name,r=e=>i(Sh(t,vh(t.scope,n,e)));if(Ot(e))return ai(e),kt(e,r),f(e,t);let a=Mr(e),s=Cn(a,a.map(r));return At(e)?s:(s.lambdaDomain=e,Dn(s))}let n=[],r=Lh(a,e=>Fh(W(e,t),e,t.environment.runtime.version));return zh(a,r,t.scope,e=>{let r=a.length===1?qg(o.pattern,e)??!1:Pr(a.map(t=>qg(t.pattern,e)??!1));return n.push([r,i(Sh(t,e))]),!1}),Cr(n)},l=qh(a,t.body),u=Xh(a),d=Zg(t.body),f=(e,n)=>{let r=Qg(n.scope,d),o=Sh(n,r),s=Wh({value:Yh(e,e=>i(Sh(o,Hh(a,r,e))),Jh(l,a,e),u),bounds:a,body:t.body,scope:r});return a.length===1?Dn(s):s},p=n.callStack;return{build:(n,i)=>{if(t.isRecursive||r||i.isKeepLazy||!N(n))return f(n,i);if(!(a.length===1?At(n):typeof n==`object`&&n.kind===`ProductSet`&&n.factors.every(At))){if(p)return f(n,i);try{return c(n,i)}catch(t){if(!(t instanceof e.b))throw t;return f(n,i)}}if(!p)return c(n,i);try{return c(n,i)}catch(e){throw Pg(p,t,e),e}},createLazy:f}},t_=(e,t)=>{let n=e_(e,t).build,r=e.bounds;if(r.length===1&&r[0].pattern.kind===`Name`){let e=U(r[0].set,t);return t=>n(e(t),t)}return e=>n(Vh(r,e),e)},n_=(e,t)=>{let n=Jg.has(e);n&&Yg(e.function);let r=U(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>U(e,t))}),value:U(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Pr(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Sh(i,vh(i.scope,`@`,e))):Fi(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i=!1;n=o(n,r.path,0,t,e=>(i=!0,r.value(e))),i||t.environment.runtime.warn(Ge.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${H(e.function)}`)}return n}},r_=(t,n)=>{let r=U(t.predicate,n),i=t.bound.pattern,a=t.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:e.X(a)},s=oh(t.predicate),c=n.coverage,l=(e,t,n)=>{if(!c||e===-1)return n();t||c.secondary[e]++;let r=io(c,t?-1:e,n);return!t&&r===!0&&c.secondary[e]++,r},u=(n,r,a,c)=>({kind:`FilteredSet`,base:n,test:(t,n)=>{if(i.kind===`Tuple`&&ui(t)?.length!==i.names.length)throw new e.b(`Attempted to check if the value:\n${A(L(t))}\nis an element of a set of ${i.names.length}-tuples.`);let o=l(c,n,()=>a(Sh(r,yh(r.scope,i,t))));if(typeof o!=`boolean`)throw new e.b(`${n?`The evaluation of predicate`:`Evaluating predicate`} ${s} yielded non-Boolean value.`);return o},source:o,rebind:e=>u(n,{...r,environment:e},U(t.predicate,e),-1)});return(e,t,n=-1)=>u(e,t,r,n)},i_=(t,n)=>{if(typeof t!=`boolean`)throw new e.b(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${Bo(t)}.\n${oh(n.predicate)}`);return t},a_=(t,n,r,i)=>{if(!j(t)||ln(t))throw new e.b(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${H(n)}`);return pr(t),Fh(t,r,i)},o_=t=>new e.b(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${H(t)}`),s_=(t,n)=>{if(t.kind===`SetFilter`){let e=U(t.predicate,n),r=U(t.bound.set,n),i=r_(t,n),a=t.bound.pattern,o=n.coverage;return n=>{let s=r(n);if(!At(s))return i(s,n,o?.current);let c=[],l=r=>{let i=e(Sh(n,yh(n.scope,a,r)));i_(i,t)&&Dt(c,r)},u=s.kind===`Interval`?s:P(s).elements;return kt(u,l),o&&o.current!==-1&&(o.secondary[o.current]+=(Array.isArray(u)?u.length:u.high-u.low+1)+c.length),Sn(c)}}if(t.kind===`SetMap`){let e=U(t.expression,n);return n=>{let r=[];return Bh(t.bounds,n,t=>(Dt(r,e(Sh(n,t))),!1)),vr(r)}}let r=t.set;if(!r)return()=>{throw new e.b(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${H(t)}`)};let i=U(t.body,n),a=U(r,n);return n=>{let o=a_(a(n),t,r,n.environment.runtime.version),s,c=t.pattern;if(Ih(o,r=>{if(c.kind===`Tuple`&&ui(r)?.length!==c.names.length)throw new e.b(`Attempted to compute the value of an expression of form\nCHOOSE <<x1, ... , xN>> \\in S: P, but S was not a set\nof N-tuples.\n${H(t)}`);let a=yh(n.scope,c,r);return Dh(i(Sh(n,a)),t)?(s=qg(c,a),!0):!1}),s===void 0)throw o_(t);return s}},c_=e=>[...e].sort((e,t)=>gn(e.name,t.name)),l_=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),u_=(e,t)=>{let n=c_(e),r=l_(n),i=n.map(e=>U(e.value,t));if(r)return e=>Fr(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>Bt(a,i.map(t=>t(e)),o):e=>Ir(a,i.map(t=>t(e)))},d_=(t,n)=>{let r=e=>U(e,n);switch(t.kind){case`Number`:{let e=t.value;return Pt(e)?()=>e:()=>{throw mh(t)}}case`Decimal`:return()=>{throw ph(t)};case`String`:{let e=t.value;return()=>e}case`Identifier`:return zg(t,n);case`Apply`:return Gg(t,n);case`Bracket`:return()=>{throw new e.b(`A bracket without a function or subscript is not an expression at ${rh(t)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new e.b(`An operator cannot be used as a value at ${rh(t)}`)};case`And`:{let e=t.operands.map(r);return n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw ch(t,r,i);if(!i)return!1}return!0}}case`Or`:{let e=t.operands.map(r);return n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw ch(t,r,i);if(i)return!0}return!1}}case`Prime`:{let e=r(t.expression);return t=>e(Ag(t))}case`Unchanged`:return jg(r(t.expression));case`If`:{let e=r(t.condition),n=r(t.consequent),i=r(t.alternative);return r=>{let a=e(r);if(typeof a!=`boolean`)throw sh(t,a);return a?n(r):i(r)}}case`Case`:{let n=t.arms.map(e=>({source:e.condition,condition:r(e.condition),body:r(e.body)})),i=t.other?r(t.other):void 0;return r=>{for(let t of n){let n=t.condition(r);if(typeof n!=`boolean`)throw new e.b(`A non-boolean expression (${Bo(n)}) was used as a condition of a CASE. ${oh(t.source)}`);if(n)return t.body(r)}if(i)return i(r);throw new e.b(`Attempted to evaluate a CASE with no conditions true.\n${H(t)}`)}}case`Let`:{let e=r(t.body);return n=>e(Sh(n,wg(t.definitions,n)))}case`Forall`:case`Exists`:return Kg(t,n);case`UnboundedQuantifier`:return()=>{let n=t.quantifier===`Forall`?`\\A`:`\\E`;throw t.isTemporal?ah(t.quantifier===`Forall`?`\\AA`:`\\EE`,t):new e.b(`TLC attempted to evaluate an unbounded ${n}.\nMake sure that the expression is of form ${n} x \\in S: P(x).\n${H(t)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return s_(t,n);case`SetEnumeration`:{let e=t.elements.map(r);return t=>vr(e.map(e=>e(t)))}case`Tuple`:{let e=t.elements.map(r);return t=>Pr(e.map(e=>e(t)))}case`FunctionConstruction`:return t_(t,n);case`FunctionSet`:{let e=r(t.domain),n=r(t.range);return t=>({kind:`FunctionSet`,domain:e(t),range:n(t)})}case`Record`:return u_(t.fields,n);case`RecordSet`:{let e=c_(t.fields),n=e.map(e=>e.name),i=e.map(e=>r(e.value));return e=>({kind:`RecordSet`,names:n,sets:i.map(t=>t(e))})}case`Except`:return n_(t,n);case`ExceptAt`:return n=>{let r=_h(n.scope,`@`);if(r?.kind!==`Value`)throw new e.b(`@ appears outside an EXCEPT at ${rh(t)}`);return r.value};case`FunctionApplication`:{Yg(t.function);let e=r(t.function),i=n=>bh(e(xh(n)),t),a=t.args.map(r),o=uh(n.runtime.version);if(a.length===1){let e=a[0];return t=>Mi(i(t),e(t),o)}return e=>Mi(i(e),Pr(a.map(t=>t(e))),o)}case`FieldAccess`:{let e=r(t.record),n=lh(t);return t=>n(e(t))}case`Product`:{let e=t.factors.map(r);return t=>({kind:`ProductSet`,factors:e.map(e=>e(t))})}case`BoxAction`:case`AngleAction`:{let n=r(t.action),i=jg(r(t.subscript)),a=t.kind===`BoxAction`,o=a?`[A]_e`:`<A>_e`;return r=>{let s=n(r);if(typeof s!=`boolean`)throw new e.b(`Attempted to evaluate an expression of form ${o}, but A was not a boolean.\n${H(t)}`);return a?s||i(r):s&&!i(r)}}case`Enabled`:{let e=t.expression;return t=>qm(e,t)}case`Label`:return r(t.body);case`Subexpression`:return()=>{throw new e.b(`The subexpression reference at ${rh(t)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw ah(ih[t.kind],t)}}},f_=`tlc2/value/impl/`,p_={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},m_={iconstM1:2,iconst0:3,iconst5:8,bipush:16,sipush:17,ldc:18,ldcW:19,dup:89,areturn:176,getstatic:178,invokespecial:183,invokestatic:184,new:187},h_=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n=0,r=e=>{let t=n;return n+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n)}},g_=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),__=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],v_=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??g_.get(e[3])}${`[]`.repeat(e[1].length)}`),y_=(e,t)=>e[e[t].first].text,b_=(e,t)=>y_(e,t).replaceAll(`/`,`.`),x_=t=>{let n=h_(t);if(n.readUint32()!==3405691582)throw new e.F(`A module override is not a class file`);n.readUint16(),n.readUint16();let r=[],i=n.readUint16(),a=new TextDecoder;for(let e=1;e<i;e++){let t=n.readUint8(),i={tag:t,text:``,value:0,first:0,second:0};r[e]=i,t===p_.utf8?i.text=a.decode(n.readBytes(n.readUint16())):t===p_.integer?i.value=n.readInt32():t===p_.float?n.readUint32():t===p_.long||t===p_.double?(n.readBytes(8),e++):t===p_.class||t===p_.string||t===p_.methodType||t===p_.module||t===p_.package?i.first=n.readUint16():t===p_.methodHandle?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=b_(r,n.readUint16());n.readUint16(),n.readBytes(n.readUint16()*2);for(let e=n.readUint16();e>0;e--){n.readBytes(6);for(let e=n.readUint16();e>0;e--)n.readUint16(),n.readBytes(n.readUint32())}let s=[];for(let e=n.readUint16();e>0;e--){let e=n.readUint16(),t=r[n.readUint16()].text,i=r[n.readUint16()].text,a=i.indexOf(`)`),c=v_(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:h_(n.readBytes(n.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>b_(r,d.readUint16())):[],p=__.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=v_(i.slice(a+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;s.push({name:t,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${o}.${t}(${c.join(`,`)})${h}`})}return{pool:r,methods:s}},S_=(e,t)=>{let n=e[t],r=e[n.second];return{className:y_(e,n.first),name:e[r.first].text}},C_=(t,n,r,i)=>{let a=()=>new e.B(`The Java override ${r}.${t.name} computes its value, which tla-ts cannot run`),o=t.code;if(!o)throw a();let s=[],c=()=>{let e=s.pop();if(e===void 0)throw a();return e},l=e=>{let t=n[e];if(t.tag===p_.integer)return t.value;if(t.tag===p_.string)return n[t.first].text;throw a()};for(let e=0;e<o.length;){let t=o[e],r=()=>o[e+1]<<8|o[e+2];if(t>=m_.iconstM1&&t<=m_.iconst5)s.push(t-m_.iconst0),e+=1;else if(t===m_.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===m_.sipush)s.push(r()<<16>>16),e+=3;else if(t===m_.ldc)s.push(l(o[e+1])),e+=2;else if(t===m_.ldcW)s.push(l(r())),e+=3;else if(t===m_.dup){let t=c();s.push(t,t),e+=1}else if(t===m_.getstatic){let t=S_(n,r());if(t.className!==`${f_}BoolValue`||t.name!==`ValTrue`&&t.name!==`ValFalse`)throw a();s.push({kind:`Identifier`,name:t.name===`ValTrue`?`TRUE`:`FALSE`,location:i}),e+=3}else if(t===m_.invokestatic){let t=S_(n,r()),o=c();if(t.className!==`${f_}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===m_.new)s.push({className:y_(n,r()),value:void 0}),e+=3;else if(t===m_.invokespecial){let t=S_(n,r()),o=c(),s=c();if(!(t.className===`${f_}StringValue`&&t.name===`<init>`&&typeof o==`string`&&typeof s==`object`&&`className`in s))throw a();s.value={kind:`String`,value:o,location:i},e+=3}else if(t===m_.areturn){let e=c();if(typeof e!=`object`)throw a();if(`className`in e){if(!e.value)throw a();return e.value}return e}else throw a()}throw a()},w_=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=x_(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:C_(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},T_=x(`EOF`),E_=x(`IDENTIFIER`),D_=x(`DEFBREAK`),O_=(e,t)=>Array.from({length:x(t)-x(e)+1},(t,n)=>x(e)+n),k_=new Set(O_(`op_57`,`op_119`)),A_=new Set(O_(`op_1`,`op_119`)),j_=new Set(O_(`op_57`,`op_70`)),M_=/* @__PURE__ */ new Set([...O_(`ACTION`,`EXCEPT`),x(`EXTENDS`),...O_(`IF`,`SF`),x(`STATE`),...O_(`THEN`,`WITH`),x(`US`),...O_(`op_112`,`op_116`)]),N_=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),P_=new Map([...N_(`postfix`,160,160,!0,`[`),...N_(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...N_(`prefix`,120,120,!1,`-.`),...N_(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...N_(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...N_(`prefix`,40,40,!0,`\\lnot`),...N_(`nfix`,100,130,!0,`\\times`),...N_(`infix`,140,140,!1,`^`,`^^`),...N_(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...N_(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...N_(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...N_(`infix`,100,110,!0,`|`,`||`,`%%`),...N_(`infix`,100,110,!1,`%`),...N_(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...N_(`infix`,90,140,!1,`\\wr`),...N_(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...N_(`infix`,90,130,!1,`!!`),...N_(`infix`,90,90,!1,`...`,`..`),...N_(`infix`,80,80,!0,`\\intersect`,`\\union`),...N_(`infix`,80,80,!1,`\\`),...N_(`infix`,70,70,!1,`<:`,`:>`),...N_(`infix`,60,60,!0,`@@`),...N_(`infix`,50,140,!0,`\\cdot`),...N_(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...N_(`infix`,30,30,!0,`\\land`,`\\lor`),...N_(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...N_(`infix`,10,10,!1,`=>`)]),F_=new Map([...P_,...yf.flatMap(e=>e.slice(1).map(t=>[t,P_.get(e[0])]))]),I_=F_.get(`[`),L_={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},R_=e=>({type:`tokens`,kinds:new Set(e)}),z_=e=>typeof e==`string`?e.startsWith(`<`)?R_([x(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(z_)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),B_=e=>(...t)=>({type:e,body:G(...t)}),q=B_(`zeroOrMore`),V_=B_(`oneOrMore`),J=B_(`optional`),Y=e=>({type:`action`,run:t=>e(t)??void 0}),X=e=>Y(t=>{t.expecting=e}),Z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&G(...e.expansion),semantic:e.semantic}),H_=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),U_=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=H_(e,n);return n},W_=(...e)=>{let t=e.map(x);return e=>t.includes(U_(e,1).kind)},G_=(e,t=U_(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},K_=e=>{let t=U_(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},q_=e=>W_(`CASESEP`)(e)&&G_(e),J_=e=>{let t=U_(e,1);M_.has(t.kind)&&(t.kind=E_)},Y_=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,X_=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),Z_=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Q_=e=>e.operatorStacks[e.operatorStacks.length-1],$_=(e,t)=>e.low>t.high,ev=(e,t)=>e.high<t.low,tv=e=>e.fix===`prefix`?e:F_.get(`${e.name}.`),nv=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===I_?X_(`FcnAppl`,[n,...r.node.heirs]):X_(`PostfixExpr`,[n,r.node]),operator:void 0})},rv=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:X_(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:X_(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},iv=e=>{let t=Q_(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return nv(t,n),iv(e);if(i.operator!==void 0){let t=tv(r.operator);return t!==void 0&&$_(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Y_(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${Y_(e,a.node.first,a.node.last)} and expression at location ${Y_(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return ev(a.operator,r.operator)?void 0:$_(a.operator,r.operator)?(rv(t,a.operator),iv(e)):`Precedence conflict between ops ${a.operator.name} in block ${Y_(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=tv(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(ev(s,r.operator))return;if(!$_(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Y_(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return rv(t,s),iv(e);let c=Y_(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===L_?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},av=e=>Y(t=>{let n=Q_(t),r=Z_(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:iv(t)}),ov=av(()=>!1),sv=av(()=>!0),cv=Y(e=>{e.lastOperator=F_.get(e.token.image)}),lv=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},uv=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?lv(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},dv=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!G_(e,n.first.beginColumn))return n;let t=dv(e,n);if(t!==void 0)return t}},fv=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(x),n=(e,...t)=>t.some(t=>e.kind===x(t)),r=e=>e!==void 0&&k_.has(e.kind),i=e.token,a=H_(e,i);i.next=void 0;let o=H_(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===E_&&(e=e.next)}else if(e.kind===E_){let t=e.next;!r(t)||j_.has(t.kind)||A_.has(t.kind)&&t.next?.kind!==E_||(e=t.next?.kind===x(`SUBSTITUTE`)?i:A_.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==D_&&(e.next={kind:D_,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=H_(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},pv=e=>{let t=U_(e,1);if(t.kind===x(`LAB`)){let n=1;for(;n!==0;)if(t=H_(e,t),t.kind===x(`LAB`)&&n++,t.kind===x(`RAB`)&&n--,t.kind===T_)return!1;return H_(e,t).kind===x(`IN`)}if(t.kind!==E_)return!1;for(t=H_(e,t);t.kind===x(`COMMA`);){if(t=H_(e,t),t.kind!==E_)return!1;t=H_(e,t)}return t.kind===x(`IN`)},mv=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),hv=e=>e.proofLevels.at(-1)??-1,gv=e=>{let t=U_(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:W_(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||hv(e)>=0&&mv(t)>hv(e):W_(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},_v=(e,t)=>{let n=mv(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},vv=e=>Y(t=>_v(t,t.token)?void 0:`${Y_(t,t.token)}: ${e}`),yv=R_([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(x)),bv=R_([...yv.kinds,x(`op_76`)]),xv=R_(A_),Sv=R_(j_),Cv=R_([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(x)),wv=()=>q(Z({expansion:[K(yv,`<op_77>`)],semantic:G_}),K(`PrefixOp`,`InfixOp`),sv),Tv=()=>K(G(Z({expansion:[`OpenStart`],semantic:G_}),`OpenExpression`,ov),G(Z({semantic:G_}),`ExtendableExpr`)),Ev=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),Dv=()=>K(G(Z({semantic:e=>W_(`ASSUME`,`BOXASSUME`)(e)||U_(e,2).kind===x(`COLONCOLON`)&&[x(`ASSUME`),x(`BOXASSUME`)].includes(U_(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Ov=()=>[`JuncItem`,q(Z({semantic:K_}),`JuncItem`)],kv=e=>Y(t=>{t.expecting=e,J_(t)}),Av=e=>Y(t=>{t.isTerminalProof=e}),jv=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{fv(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),Mv={CompilationUnit:Q(void 0,[Y(fv),J(`Prelude`),`Module`]),Prelude:Q(void 0,[`<BEGIN_PRAGMA>`,q(K(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Q(`Module definition`,[X(`---- MODULE`),`BeginModule`,X(`EXTENDS clause or module body`),`Extends`,X(`Module body`),`Body`,X(`==== or more Module body`),`EndModule`]),BeginModule:Q(`Begin module`,[X(`---- MODULE (beginning of module)`),K(`<_BM0>`,`<_BM1>`,`<_BM2>`),kv(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,kv(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,kv(`Identifier`),`Identifier`))]),Body:Q(`Module body`,[X(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),q(K(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,G(Z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,G(Z({amount:2}),`Instance`),G(Z({amount:2}),`Assumption`),G(Z({amount:2}),`Theorem`),G(Z({amount:1}),`Module`,Y(fv)),G(Z({semantic:e=>W_(`USE`)(e)&&U_(e,2).kind!==x(`ONLY`)||W_(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Q(`variable declaration`,[`<VARIABLE>`,X(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,X(`Identifier`),`Identifier`)]),ParamDeclaration:Q(`Parameter declaration`,[X(`CONSTANT`),`ParamSubDecl`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Q(`Recursive`,[X(`RECURSIVE`),`<RECURSIVE>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X("`,' or `)'"))]),ConstantDeclarationItems:Q(`Constant declaration items`,[X(`Identifier, _ or prefix op`),K(G(`Identifier`,X(`(, comma, or Module Body`),J(Z({amount:2}),`<LBR>`,X(`_`),`<US>`,X(`comma or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`comma or )`)),`<RBR>`)),G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`prefix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Q(`Definition`,[X(`LOCAL, Identifier or Operator Symbol`),J(`<LOCAL>`),`<DEFBREAK>`,X(`LOCAL, Identifier or Operator Symbol`),K(jv(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),jv(`Expression`,Z({expansion:[`<IDENTIFIER>`,Sv]}),`PostfixLHS`,`Expression`),jv(`Expression`,Z({expansion:[`<IDENTIFIER>`,xv]}),`InfixLHS`,`Expression`),jv(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),jv(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Q(`Identifier tuple`,[`<LAB>`,X(`Identifier or >>`),J(`Identifier`,X(`COMMA or >>`),q(`<COMMA>`,X(`COMMA or >>`),`Identifier`,X(`COMMA or >>`))),`<RAB>`]),IdentLHS:Q(`Identifier LHS`,[`Identifier`,X(`( or ==`),J(`<LBR>`,X(`Identifier Declaration, prefix op, _ or )`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`),q(`<COMMA>`,X(`Identifier Declaration, prefix op or _`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Q(`Prefix LHS`,[bv,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,xv,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,Sv]),IdentDecl:Q(`Identifier Declation`,[`Identifier`,X(`( or ...`),J(`<LBR>`,X(`_`),`<US>`,X(`COMMA or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Q(`Op. Symbol Declaration`,[K(G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`infix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),Instance:Q(`Instance`,[X(`LOCAL or instance`),J(`<LOCAL>`),`Instantiation`,X(`COMMA or Module Body`)]),Instantiation:Q(`NonLocalInstance`,[`<INSTANCE>`,kv(`Module identifier`),`Identifier`,X(`WITH or another definition.`),J(`<WITH>`,X(``),`Substitution`,X(``),q(Z({amount:3}),`<COMMA>`,X(``),`Substitution`,X(``)))]),Substitution:Q(`Substitution`,[K(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),X(`<-`),`<SUBSTITUTE>`,X(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Q(void 0,[yv,cv]),NonExpPrefixOp:Q(void 0,[bv,cv]),InfixOp:Q(`Infix Op`,[xv,cv]),PostfixOp:Q(void 0,[Sv,cv]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{fv(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),Dv(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),Dv(),X("PROVE or `,'")),K(`<PROVE>`,`<BOXPROVE>`),X(`Expression`),`Expression`))]),NewSymb:Q(`NEW symbol declaration`,[X(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),K(G(Z({amount:2}),K(G(Z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),X(`Constant declaration`),K(G(Z({amount:2}),`IdentDecl`,J(`<IN>`,Y(e=>{let t=Z_(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Y_(e,t.first,t.last)}`:void 0}),X(`Expression`),`Expression`)),`SomeFixDecl`)),G(Z({amount:2}),J(`<NEW>`),`<VARIABLE>`,X(`Identifier`),`Identifier`),G(Z({amount:2}),J(`<NEW>`),K(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),X(`Declaration`),K(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Q(`Domain binding`,[J(`<IN>`,X(`Expression`),`Expression`)]),Theorem:Q(`Theorem`,[X(`THEOREM, PROPOSITION`),K(`<THEOREM>`,`<PROPOSITION>`),X(`Identifier, Assume-Prove or Expression`),J(Z({amount:2}),`Identifier`,X(`==`),`<DEF>`),Y(fv),K(G(Z({amount:3}),Z({semantic:W_(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:gv}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>W_(`BY`)(e)||U_(e,2).kind===x(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>U_(e,2).kind!==x(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,Av(!0),J(`<ONLY>`)),G(`<USE>`,Av(!1),J(`<ONLY>`)),G(`<HIDE>`,Av(!1))),X("an expression, `MODULE' or `DEF'"),J(Ev(),q(`<COMMA>`,X(`MODULE or expression`),Ev(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),Ev(),q(`<COMMA>`,X(`MODULE or expression`),Ev(),Y(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),Y(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Q(`QED step`,[X(`Step number`),Cv,vv(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:gv}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),Cv,vv(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:W_(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:W_(`INSTANCE`)}),`Instantiation`),G(Z({semantic:W_(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:gv}),Y(e=>{let t=Z_(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Y_(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),V_(Z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Q(`HaveStep`,[`<HAVE>`,X(`expression`),`Expression`]),TakeStep:Q(`TakeStep`,[`<TAKE>`,X(`identifier`),K(G(Z({expansion:[K(G(`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,X(`comma or step`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or proof step`))),G(`Identifier`,X(`comma or proof step`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or proof step`))))]),WitnessStep:Q(`WitnessStep`,[`<WITNESS>`,X(`expression`),`Expression`,q(`<COMMA>`,X(`expression`),`Expression`,X(`comma or colon`))]),PickStep:Q(`PickStep`,[`<PICK>`,X(`identifier`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,X(`comma, or colon`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or colon`))),G(`QuantBound`,X(`comma or colon`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or colon`)))),`<COLON>`,X(`expression`),`Expression`]),CaseStep:Q(`CaseStep`,[`<CASE>`,X(`expression`),`Expression`]),AssertStep:Q(`AssertStep`,[J(`<SUFFICES>`,X(`expression or ASSUME/PROVE`)),K(`Expression`,G(Z({semantic:W_(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Q(void 0,[K(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Q(void 0,[K(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Q(`String`,[`<STRING_LITERAL>`]),Number:Q(void 0,[`<NUMBER_LITERAL>`,J(Z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,q(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Q(void 0,[K(G(Z({amount:2,expansion:[K(bv,xv,Sv),R_([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(x))],semantic:G_}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Y_(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:G_}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Q(`Quantified form`,[K(`<EXISTS>`,`<FORALL>`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,q(`<COMMA>`,`Identifier`)),G(`QuantBound`,q(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Q(`Bound Quantified Expression`,[K(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,q(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Q(`Quant Bound`,[K(`IdentifierTuple`,G(`Identifier`,q(`<COMMA>`,`Identifier`,X(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Q(`Some { } form`,[`<LBC>`,J(K(G(Z({semantic:pv}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),V_(`<COMMA>`,`Expression`)))),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,q(`<COMMA>`,`Expression`)),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,q(`<COMMA>`,`QuantBound`)),G(`Expression`,J(K(G(`<COLON>`,Y(e=>{let t=Z_(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,q(`<COMMA>`,`QuantBound`)),V_(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:pv}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>U_(e,2).kind===x(`MAPTO`)&&M_.has(U_(e,1).kind)}),Y(e=>{U_(e,1).kind=E_}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,q(`<COMMA>`,`FieldSet`),`<RSB>`),G(`Expression`,K(G(q(`<COMMA>`,`Expression`),`<RSB>`,Y(e=>{let t=e.frames[e.frames.length-1];t.node=X_(`FcnAppl`,t.heirs),e.lastOperator=I_})),G(`<ARROW>`,`Expression`,`<RSB>`),G(`<EXCEPT>`,`ExceptSpec`,q(`<COMMA>`,`ExceptSpec`),`<RSB>`),G(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Q(`Except Spec`,[`<BANG>`,V_(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(J_),`Identifier`,Y(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===x(`RBR`)}))]),ReducedExpression:Q(`restricted form of expression`,[K(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Q(`Fairness Expression`,[Y(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),K(`<WF>`,`<SF>`),`ReducedExpression`,J(Z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,Y(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Q(`CASE Expression`,[`<CASE>`,`CaseArm`,q(Z({semantic:e=>q_(e)&&U_(e,2).kind!==x(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:q_}),`<CASESEP>`,`OtherArm`)]),CaseArm:Q(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Q(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Q(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Q(`Let Definitions`,[V_(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=U_(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...Ov()),G(Z({expansion:[`<AND>`]}),...Ov())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=dv(t,e.heirs[1]);return n&&`Item at ${Y_(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Y_(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Q(`(Un)Bounded Choose`,[`<CHOOSE>`,K(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Q(`Lambda`,[`<LAMBDA>`,X(`Identifier`),`Identifier`,X("`,' or `:'"),q(`<COMMA>`,X(`Identifier`),`Identifier`,X("`,' or `:'")),`<COLON>`,X(`Expression`),`Expression`]),Expression:Q(`Expression`,[Y(e=>{e.operatorStacks.push([])}),wv(),Tv()],(e,t)=>{let n=Q_(t);n.push({node:e.heirs[0],operator:L_});let r=iv(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Q(`ExtendableExpr`,[K(G(Z({expansion:[K(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),ov,q(K(G(Z({expansion:[`PostfixOp`],semantic:G_}),`PostfixOp`,sv),G(Z({expansion:[`<DOT>`],semantic:G_}),`<DOT>`,Y(J_),Z({semantic:G_}),`Identifier`,Y(e=>{let t=Q_(e);t[t.length-1].operator!==void 0&&nv(t,t.length),t[t.length-1]={node:X_(`RecordComponent`,[t[t.length-1].node,Z_(e,2),Z_(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:G_}),X(`function argument`),`SBracketCases`,av(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:G_}),`InfixOp`,sv,wv(),Tv()),G(Z({expansion:[`<COLONCOLON>`],semantic:G_}),`<COLONCOLON>`,Y(e=>{let t=Q_(e);if(!uv(t[t.length-1].node))return`\`::' at ${Y_(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=Q_(e),n=Z_(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!ev(r,e.lastOperator)){let t=Z_(e,3);return`Removing label at ${Y_(e,t.first,t.last)} would change expression parsing.`}t.push({node:X_(`Label`,[Z_(e,3),Z_(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:G_}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:G_}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>hv(e)<0&&e.proofLevels.length<=1?`${Y_(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Y_(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,G(Z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),J(Z({amount:2}),`OpArgs`),q(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:lv(e.heirs)===void 0?e.heirs.length===1?X_(`GeneralId`,e.heirs):void 0:X_(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>U_(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),J(Z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Q(`StructOp`,[X("`<<' , `>>' , `:' , `@' , or number"),K(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,G(Z({semantic:e=>U_(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Y_(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},Nv=/* @__PURE__ */ new Map,Pv=e=>{let t=Nv.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=Pv(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,Pv(Mv[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return Nv.set(e,n),n},Fv=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},Iv=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=H_(e,e.scanPosition)),e.scanPosition=H_(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},Lv=(e,t)=>{if(t.type===`tokens`)return Iv(e,t.kinds);if(t.type===`call`)return Lv(e,Mv[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||Fv(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=Lv(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||Fv(e,t.semantic)?Lv(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=Lv(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=Lv(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},Rv=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=Lv(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},zv=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||Pv(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!Pv(a).hasSemanticStart?Pv(a).first.has(U_(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):Rv(e,i,a)&&(o===void 0||o(e))}),Bv=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,Lv(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=H_(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===T_){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=H_(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Te(e.token.image)}" `},Vv=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??Bv(e)}\n\nResidual stack trace follows:\n${r}`,!1},Hv=(e,t)=>{let n=H_(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,Vv(e))},Uv=(e,t)=>{let n=Mv[t];n.message!==void 0&&(e.messages.push({name:n.message,token:U_(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!Wv(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return Vv(e,i);let a=r.node??(r.heirs.length===0?void 0:X_(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},Wv=(e,t)=>{if(t.type===`tokens`)return Hv(e,t.kinds);if(t.type===`call`)return Uv(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||Vv(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||Vv(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||Wv(e,t));if(t.type===`choice`){let n=zv(e,t.alternatives);return n===-1?Vv(e):Wv(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!Wv(e,t.body))return!1;if(t.type===`optional`)return zv(e,[t.body])===-1||Wv(e,t.body);for(;zv(e,[t.body])===0;)if(!Wv(e,t.body))return!1;return!0},Gv=e=>{let t=Ce(e),n={kind:T_,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],pushedErrors:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=Wv(r,{type:`call`,name:`CompilationUnit`});if(r.lexicalError!==void 0)return r.lexicalError;let a=[...r.pushedErrors,...i||r.report===void 0?[]:[`***Parse Error***\n${r.report}`]];return a.length===0?void 0:a.join(`
1783
- `)},Kv={low:15,high:15},qv={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),Jv=new Map([[`=>`,$(1,1,!1)],[`<=>`,$(2,2,!1)],[`~>`,$(2,2,!1)],[`-+->`,$(2,2,!1)],[`/\\`,$(3,3,!0)],[`\\/`,$(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,$(5,5,!1)]),[`\\cdot`,$(5,14,!0)],[`@@`,$(6,6,!0)],[`:>`,$(7,7,!1)],[`<:`,$(7,7,!1)],[`\\cup`,$(8,8,!0)],[`\\cap`,$(8,8,!0)],[`\\`,$(8,8,!1)],[`..`,$(9,9,!1)],[`...`,$(9,9,!1)],[`##`,$(9,13,!0)],[`$`,$(9,13,!0)],[`$$`,$(9,13,!0)],[`??`,$(9,13,!0)],[`!!`,$(9,13,!1)],[`\\sqcap`,$(9,13,!0)],[`\\sqcup`,$(9,13,!0)],[`\\uplus`,$(9,13,!0)],[`\\wr`,$(9,14,!1)],[`+`,$(10,10,!0)],[`++`,$(10,10,!0)],[`(+)`,$(10,10,!0)],[`\\oplus`,$(10,10,!0)],[`%`,$(10,11,!1)],[`%%`,$(10,11,!0)],[`|`,$(10,11,!0)],[`||`,$(10,11,!0)],[`\\X`,$(10,13,!1)],[`-`,$(11,11,!0)],[`--`,$(11,11,!0)],[`(-)`,$(11,11,!0)],[`\\ominus`,$(11,11,!0)],[`*`,$(13,13,!0)],[`**`,$(13,13,!0)],[`/`,$(13,13,!1)],[`//`,$(13,13,!1)],[`\\div`,$(13,13,!1)],[`\\o`,$(13,13,!0)],[`(.)`,$(13,13,!0)],[`\\odot`,$(13,13,!0)],[`(/)`,$(13,13,!1)],[`\\oslash`,$(13,13,!1)],[`(\\X)`,$(13,13,!0)],[`\\otimes`,$(13,13,!0)],[`&`,$(13,13,!0)],[`&&`,$(13,13,!0)],[`\\star`,$(13,13,!0)],[`\\bullet`,$(13,13,!0)],[`\\bigcirc`,$(13,13,!0)],[`^`,$(14,14,!1)],[`^^`,$(14,14,!1)]]),Yv=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Xv=/* @__PURE__ */ new Set([...Yv,`'`]),Zv=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Qv=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),$v=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),ey=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),ty=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...Xv]),ny=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),ry=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),iy=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),ay=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),oy=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),sy=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),cy=/* @__PURE__ */ new Set([``,`*`,`-`]),ly={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},uy=(e,t)=>e.line-t.line||e.column-t.column,dy=(e,t)=>({start:uy(e.start,t.start)<=0?e.start:t.start,stop:uy(e.stop,t.stop)>=0?e.stop:t.stop}),fy=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),py=(t,n,r=`Proof.Parser`)=>new e.F(t,void 0,{reason:t,line:n.start.line,column:n.start.column,isEnd:!1,proof:{stop:n.stop,exception:r}}),my=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),hy=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),gy=/* @__PURE__ */ new Set([`NEW`,...hy.keys()]),_y=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),vy=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),yy=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),by=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Jv.has(e.operator):Yv.has(e.operator)),xy=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,Sy=e=>Jv.has(e)||Yv.has(e)||e===`-.`,Cy=(e,t,n)=>{switch(e){case`ENABLED`:return{kind:`Enabled`,expression:t,location:n};case`UNCHANGED`:return{kind:`Unchanged`,expression:t,location:n};case`[]`:return{kind:`Always`,expression:t,location:n};case`<>`:return{kind:`Eventually`,expression:t,location:n};case`'`:return{kind:`Prime`,expression:t,location:n};default:return{kind:`Apply`,operator:e,args:[t],location:n}}},wy=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.replace(/\r?\n$/,``).split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
1784
- `)}\n`},Ty=(t,n,r=ae(t,n===`tlapm`))=>{let i=n===`tlapm`,a=i?r:r.map(ne),o=0,s=[],l,u,d=[],f=/* @__PURE__ */ new Set,p=[],m=[],h=e=>d[d.length-1].has(e),g=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),_=[],ee=[],te=[],v=(e,t=o-1)=>{let n=e===t?te[e]:void 0;if(n)return n;let r=a[t];_[e]??=g(a[e]),ee[t]??={line:r.line,column:r.endColumn};let i={module:m[0].name,start:_[e],end:ee[t]};return e===t&&(te[e]=i),i},y=(e,t)=>(e.location.range=v(t),e),re=(e=0)=>a[Math.min(o+e,a.length-1)],b=(e=0)=>{let t=re(e),n=s[s.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ie=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),oe=0,se=e=>{let t=a.slice(oe,o).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ce=e=>i&&(e.kind===`Keyword`||yy.has(e.text)),x=e=>{let t=a.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},le=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:sy.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:ce(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,S=(t,n=re(),r)=>{let i=a[a.length-1],o=n.line===i.line&&n.column===i.column;return new e.F(`${t} at line ${n.line}, column ${n.column}`,void 0,ue(t,n,o,r))},ue=(e,t,n,r)=>{if(i&&n){let e=a[a.length-1];return{reason:`Unexpected EOF`,...se(x(e)),isEnd:n}}return i&&r?{reason:`Unexpected ${le(r)}`,...x(r),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},de=(e,t=re())=>S(e,t,t),fe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ce(e),C=(e,t=0)=>{let n=b(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},w=()=>{let e=b();if(e.kind===`End`)throw S(`Unexpected end of expression`);return o++,e},T=e=>C(e)?(o++,!0):!1,E=e=>{if(!C(e))throw de(`Expected ${JSON.stringify(e)} but found ${ie(b())}`);return w()},pe=()=>{let e=b();if(e.kind!==`Identifier`)throw de(`Expected an identifier but found ${ie(e)}`);if(ce(e))throw de(`Unexpected keyword ${e.text}`);return o++,e.text},me=()=>{let e=o;return{name:pe(),range:v(e)}},he=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),ge=()=>{let e=b();return e.kind!==`String`&&(Qv.has(e.text)||Jv.has(e.text)||Xv.has(e.text))?(o++,e.text):pe()},_e=!1,ve=()=>b().kind===`Identifier`||!fe(b())?pe():(_e=!0,w().text),ye=e=>{if(!i)return e();s.push(-1);let t=e();return s.pop(),t},D=(e,t=`,`)=>{let n=[e()];for(;T(t);)n.push(e());return n},be=()=>{if(C(`<<`)){let e=1;for(;b(e).kind===`Identifier`||C(`,`,e);)e++;return C(`>>`,e)&&C(`\\in`,e+1)}let e=0;for(;b(e).kind===`Identifier`;){if(C(`\\in`,e+1))return!0;if(!C(`,`,e+1))return!1;e+=2}return!1},xe=()=>{if(C(`::`))return!0;if(!C(`(`))return!1;let e=1;for(;b(e).kind===`Identifier`&&C(`,`,e+1);)e+=2;return b(e).kind===`Identifier`&&C(`)`,e+1)&&C(`::`,e+2)},Se=()=>{if(!T(`<<`)){let e=me();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=he(C(`>>`)?[]:D(me));return E(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Ce=()=>D(()=>{let e=D(Se);E(`\\in`);let t=k();return e.map(e=>({pattern:e,set:t}))}).flat(),we=()=>{let e=b();if(i&&yy.has(e.text)){let t=o;w();let n={kind:`Identifier`,name:e.text,location:g(e)};return{subscript:y(n,t),lastArgs:[]}}let t=i&&(e.kind===`Number`||e.kind===`String`||C(`@`));if(e.kind===`Identifier`){let t=o,n=[],r=[],a=e=>(r.push(v(o,o)),n.push(pe()),e&&C(`(`)?ke():[]),s=[a(!i)];for(;C(`!`)&&b(1).kind===`Identifier`;)w(),s.push(a(!0));let c=s.slice(0,-1),l=g(e);l.range={...v(t),end:r[r.length-1].end};let u=n.join(`!`);return{subscript:c.every(e=>e.length===0)?{kind:`Identifier`,name:u,location:l}:{kind:`Apply`,operator:u,args:c.flat(),argumentCounts:[...c.map(e=>e.length),0],argumentsRange:l.range,selectorRanges:r,location:l},lastArgs:s[s.length-1]}}if(C(`<<`)||C(`(`)||C(`{`)||C(`[`)||t){let e=o,t=ze();return{subscript:t.location.range?t:y(t,e),lastArgs:[]}}throw de(`Expected a subscript but found ${ie(e)}`)},Te=e=>{let t=b(1),n=b(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&C(`==`,Xv.has(n.text)?3:4))},Ee=e=>{let t=b(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||C(`,`,1)||C(`)`,1)||t.kind===`Keyword`&&ry.has(t.text)||Te(e)},De=()=>{let e=b(),t=e.kind===`Operator`&&(Jv.has(e.text)||Zv.has(e.text))&&Ee(e);if(i&&e.kind!==`String`&&(Zv.has(e.text)||ty.has(e.text)&&e.text!==`'`&&!Yv.has(e.text)||ey.has(e.text)&&b(-1).text===`(`&&b(-1).line===e.line&&b(-1).endColumn+1===e.column&&b(1).text===`)`&&b(1).line===e.line&&b(1).column===e.endColumn+1)&&Ee(e))throw S(`incomplete expression`,e);if(t&&!i&&e.text===`\\X`&&e.spelling!==`×`)throw S(`\\X may not be used as an infix operator`,e);if(t)return o++,y({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:g(e)},o-1);if(e.kind!==`String`&&ty.has(e.text)&&Ee(e)){o++;let t=g(e);if(Yv.has(e.text))return y({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o-1);let n={kind:`Identifier`,name:`argument`,location:t};return y({kind:`Lambda`,params:[n.name],body:Cy(e.text,n,t),operator:e.text,location:g(e)},o-1)}if(C(`LAMBDA`)){let t=o;w();let n=he(D(me));E(`:`);let r=k();return y({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:g(e)},t)}return k()},Oe,ke=()=>ye(()=>{let e=o;E(`(`);let t=D(De);return E(`)`),Oe=v(e),t}),Ae=()=>{let e=w();s.push(e.column);let t=[k()];for(;xy(re())&&re().text===e.text&&re().column===e.column;)o++,t.push(k());return s.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:g(e)}},je=e=>ye(()=>{let t=g(e),n=b().kind===`Identifier`,r=C(`|->`,1)&&(n||fe(b()));if(r||n&&C(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o,n=g(b()),i=e();return n.range=v(t),E(r?`|->`:`:`),{name:i,value:k(),location:n}},a=[i(()=>n?pe():w().text),...T(`,`)?D(()=>i(pe)):[]];return E(`]`),{kind:e,fields:a,location:t}}if(be()){let e=o,n=Ce();if(!i||C(`|->`)){E(`|->`);let e=k();return E(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}o=e}let a=k();if(T(`->`)){let e=k();return E(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(T(`EXCEPT`)){let e=D(()=>{E(`!`);let e=[];for(;C(`.`)||C(`[`);)if(T(`.`)){if(!fe(b()))throw de(`Expected a field name but found ${ie(b())}`);if(!i&&C(`@`))throw de(`@ used in !.@`);e.push({kind:`Field`,name:w().text})}else E(`[`),e.push({kind:`Index`,args:D(()=>k())}),E(`]`);return E(`=`),{path:e,value:k()}});return E(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!C(`]_`)){let e=[a];for(;T(`,`);)e.push(k());return E(`]`),{kind:`Bracket`,args:e,location:t}}return E(`]_`),{kind:`BoxAction`,action:a,subscript:we().subscript,location:t}}),Me=()=>{let e=o,t=y(O(),e),n=g(w());return y({kind:`Apply`,operator:`\\in`,args:[t,k()],location:n},e)},Ne=e=>ye(()=>{let t=g(e);if(T(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(be()&&(b(1).text===`\\in`||C(`<<`))){let e=o,n=Se();E(`\\in`);let r=k();if(T(`:`)){let e=k();return E(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o=e}let n=b().kind===`Identifier`&&C(`\\in`,1)?Me():k();if(T(`:`)){let e=Ce();return E(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;T(`,`);)r.push(k());return E(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Pe=e=>{let t=g(e),n=ye(()=>C(`>>`)||C(`>>_`)?[]:D(()=>k()));if(T(`>>_`)){if(n.length!==1)throw S(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:we().subscript,location:t}}return E(`>>`),{kind:`Tuple`,elements:n,location:t}},Fe=e=>{let t=g(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&be()){let e=Ce();return E(`:`),{kind:n,bounds:e,body:k(),location:t}}let i=he(D(me));return E(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:k(),isTemporal:r,location:t}},Ie=e=>{let t=[];do{let n=o;if(T(`OTHER`))return E(`->`),{kind:`Case`,arms:t,other:k(),otherRange:v(n),location:g(e)};let r=k();E(`->`),t.push({condition:r,body:k()})}while(T(`[]`));return{kind:`Case`,arms:t,other:void 0,location:g(e)}},Le=()=>{let e=b(1);return C(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||ny.has(e.text)||e.kind===`Operator`&&(Jv.has(e.text)||Xv.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&Qv.has(e.text))},Re=()=>{let e=w();if(e.kind===`Number`)return{kind:`Operand`,operand:c(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return o--,{kind:`Bound`,args:ke()}}return{kind:`Name`,name:e.text,args:C(`(`)?ke():[]}},ze=e=>{let t=o,r=w(),a=g(r);if(i&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=D(pe);return E(`:`),{kind:`Lambda`,params:e,body:k(),location:a}}if(r.kind===`Number`){if(i&&/^\\[BOH]/.test(r.text))throw S(`incomplete expression`,r);return{kind:`Number`,value:c(r.text),text:r.text,location:a}}if(r.kind===`Decimal`)return{kind:`Decimal`,text:r.text,location:a};if(r.kind===`String`)return{kind:`String`,value:r.text,location:a};let s=r.kind===`Step`&&nt(r);if(!i&&s&&$e()<0&&Qe.length<=1)throw S(`Step number used outside proof`,r);if(s&&r.text[1]===`+`)throw S(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||s){let n=s?rt(r)??r.text:r.text;if(xe()){let o=he(T(`(`)?D(me):[]);o.names.length>0&&E(`)`),E(`::`);let s=v(t),c=k();if(!i&&e!==void 0&&l!==void 0&&by(c)&&e.high>=l.low)throw S(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:n,params:o.names,paramRanges:o.ranges,head:s,body:c,location:a}}let c=C(`(`);if(n===`@`&&!c&&!Le())return{kind:`ExceptAt`,location:a};let u=c?ke():[],d=[c?Oe:void 0];if(!Le())return c?{kind:`Apply`,operator:n,args:u,argumentsRange:Oe,location:a}:{kind:`Identifier`,name:n,location:a};let f=[{kind:`Name`,name:n,args:u}],p=[v(t,t)];for(;Le();)w(),p.push(v(o,o)),Oe=void 0,f.push(Re()),d.push(Oe);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),g=f.flatMap(e=>`args`in e?e.args:[]),_=f.map(e=>`args`in e?e.args.length:0),ee=d.at(-1)??v(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:a}:g.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:a}:{kind:`Apply`,operator:h,args:g,..._.slice(0,-1).some(e=>e>0)&&{argumentCounts:_},argumentsRange:ee,selectorRanges:p,argumentRanges:d,location:a}}if(r.kind===`Operator`&&Sy(r.text)&&C(`(`)){let e=ke();return n===`tlc`&&r.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:a}:{kind:`Apply`,operator:r.text,spelling:r.spelling,args:e,location:a}}if(r.kind===`Operator`&&Sy(r.text)&&!i)return{kind:`Identifier`,name:r.text,spelling:r.spelling,location:a};switch(r.text){case`(`:{let e=ye(()=>k());return E(`)`),e}case`[`:return je(r);case`{`:return Ne(r);case`<<`:return Pe(r);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Fe(r);case`IF`:{let e=k();E(`THEN`);let t=k();return E(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:k(),location:a}}case`CASE`:return Ie(r);case`LET`:{let e=[],t=[];for(d.push(/* @__PURE__ */ new Set);!T(`IN`);){if(i&&C(`RECURSIVE`))throw S(`Unexpected keyword RECURSIVE`,se(re()));if(T(`RECURSIVE`)){Ye();continue}let n=Ue(!i&&T(`LOCAL`));n.kind===`Instance`?t.push(n):e.push(n)}d.pop();let n=k();return t.length===0?{kind:`Let`,definitions:e,body:n,location:a}:{kind:`Let`,definitions:e,instances:t,body:n,location:a}}case`CHOOSE`:{let e=Se(),t=T(`\\in`)?k():void 0;return E(`:`),{kind:`Choose`,pattern:e,set:t,body:k(),location:a}}case`WF_`:case`SF_`:{let e=we(),t=!C(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:ye(()=>{E(`(`);let e=k();return E(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:a}}}throw de(`Unexpected ${ie(r)}`,r)},Be=(e,t,n)=>{l=u={low:t,high:n};let r=k(i?Math.min(n+1,Kv.low):n+1),a=b(),o=Xv.has(a.text)?Kv.high:Jv.get(a.text)?.high;if(!i&&a.kind===`Operator`&&o!==void 0&&o>=t)throw S(`Precedence conflict between ${e.text} and ${a.text}`,a);return r},O=()=>{let e=u;u=void 0;let t=b(),n=g(t);if(t.kind===`Operator`&&xy(t))return Ae();if(i&&Jv.has(t.text)&&C(`(`,1)){let e=o,r=ye(()=>{w(),w();let r=k();if(!T(`,`))return;let i=k();E(`)`);let a={kind:`Apply`,operator:t.text,args:[r,i],location:n};return y(a,e)});if(r!==void 0)return r;o=e}if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return w(),{kind:`Apply`,operator:`~`,args:[Be(t,4,4)],location:n};case`-`:case`-.`:if(t.text===`-.`&&!i)break;return w(),{kind:`Apply`,operator:`-.`,args:[Be(t,12,12)],location:n};case`[]`:return w(),{kind:`Always`,expression:Be(t,4,15),location:n};case`<>`:return w(),{kind:`Eventually`,expression:Be(t,4,15),location:n};case`ENABLED`:return w(),{kind:`Enabled`,expression:Be(t,4,15),location:n};case`UNCHANGED`:return w(),{kind:`Unchanged`,expression:Be(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return w(),{kind:`Apply`,operator:t.text,args:[i?k(9):Be(t,10,13)],location:n}}return ze(e)},k=(e=0)=>{let t=o,n=O(),r=n.location.range?n:y(n,t),a;for(;;){let n=b();if(n.kind!==`Operator`)break;let o=g(n);if(n.text===`'`&&e<=15){w(),l=Kv,r=y({kind:`Prime`,expression:r,location:o},t);continue}if(Yv.has(n.text)&&e<=15){w(),l=Kv,r=y({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r],location:o},t);continue}if(n.text===`[`){w();let e=ye(()=>D(()=>k()));ye(()=>E(`]`)),l=qv,r=y({kind:`FunctionApplication`,function:r,args:e,location:o},t);continue}if(n.text===`.`&&fe(b(1))){w();let e=w().text;r=y({kind:`FieldAccess`,record:r,field:e,location:o},t);continue}let s=Jv.get(n.text);if(!s||s.low<e)break;if(a){let e=!(a.low>s.high||a.high<s.low),t=a.text===n.text&&s.isAssociative;if(e&&!t&&(a.text!==`\\X`||n.text!==`\\X`))throw S(`Precedence conflict between ${a.text} and ${n.text}`,n)}if(w(),!i&&s.low>12&&C(`-`))throw S(`Precedence conflict between ${n.text} and -`,b());l=u=s;let c=k(s.high+1);if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,i=[v(t).end];r=r.kind===e&&a?.text===n.text?{...r,operands:[...r.operands,c],prefixEnds:[...r.prefixEnds??[],...i]}:{kind:e,operands:[r,c],prefixEnds:i,location:o}}else r=n.text===`\\X`?r.kind===`Product`&&a?.text===`\\X`?{...r,factors:[...r.factors,c]}:{kind:`Product`,factors:[r,c],location:o}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r,c],location:o};r=y(r,t),a={...s,text:n.text}}return r},Ve=()=>{if(!T(`(`))return[];let e=Je();return E(`)`),e},He=()=>{let e=g(b()),t=k(),n=a[o-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:m[0].name,start:e,end:r}}},Ue=e=>{let t=o;return y(A(e),t)},We=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),A=e=>{let t=b(),n=o,r=g(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:v(n,o-2),...He(),isLocal:e,isRecursive:h(t),location:r});if(t.kind===`Identifier`&&b(1).kind===`Operator`&&Jv.has(b(1).text)&&b(2).kind===`Identifier`&&C(`==`,3)){let e=me(),t=w().text,n=me();return E(`==`),i(t,[We(e),We(n)])}let a=t.kind!==`String`&&Qv.has(t.text),s=t.kind===`Identifier`&&Xv.has(b(1).text)&&C(`==`,2);if(a||s){let e=a?t.text:b(1).text;a&&w();let n=me();return s&&w(),E(`==`),i(e,[We(n)])}let c=pe();if(T(`[`)){let t=ye(()=>Ce());return E(`]`),E(`==`),{kind:`Function`,name:c,bounds:t,body:k(),isLocal:e,isRecursive:h(c),location:r}}let l=o,u=Ve();return E(`==`),C(`INSTANCE`)?{...Ge(c,u,e,r),definitionRange:v(l)}:i(c,u)},Ge=(e,t,n,r)=>{let i=o;return E(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ve(),substitutions:T(`WITH`)?D(()=>{let e=o,t=ge(),n=v(e);return E(`<-`),{name:t,nameRange:n,expression:De()}}):[],isLocal:n,location:r,instanceRange:v(i)}},Ke=()=>{let e=o;return y(qe(),e)},qe=()=>{let e=g(b());if(C(`_`)&&b(1).kind===`Operator`)return w(),{name:w().text,arity:T(`_`)?2:1,location:e};if(b().kind!==`String`&&(Qv.has(b().text)||i&&b().kind===`Operator`)&&C(`_`,1)){let t=w().text;return w(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=pe();if(!T(`(`))return{name:t,arity:0,location:e};let n=D(()=>E(`_`));return E(`)`),{name:t,arity:n.length,location:e}},Je=()=>D(Ke),Ye=()=>{let e=Je();return e.forEach(e=>d[d.length-1].add(e.name)),e},Xe=e=>{let t=0,n=e;do{let e=b(n);if(e.kind===`End`)return n;e.kind===`Operator`&&_y.has(e.text)&&t++,e.kind===`Operator`&&vy.has(e.text)&&t--,n++}while(t>0);return n},Ze=()=>{let e=b(),t=b(1);return e.kind===`Identifier`?C(`(`,1)||C(`[`,1)?C(`==`,Xe(1)):t.kind===`Operator`&&Xv.has(t.text)?C(`==`,2):t.kind===`Operator`&&Jv.has(t.text)?b(2).kind===`Identifier`&&C(`==`,3):C(`==`,1):e.kind!==`String`&&Qv.has(e.text)&&t.kind===`Identifier`&&C(`==`,2)},Qe=[],$e=()=>Qe[Qe.length-1]??-1,et=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),tt=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},nt=e=>!e.text.endsWith(`.`)&&!cy.has(tt(e)),rt=e=>{let t=tt(e);if(cy.has(t))return;let n=et(e);if(n>=0)return`<${n}>${t}`;let r=$e(),i=Qe[Qe.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},it=e=>{if(e.kind===`Keyword`)return ay.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Qe.length===0;if(e.text[1]===`+`||Qe.length===0)return!0;let t=$e();return t>=0&&et(e)>t},at=e=>{let t=et(e),n=Qe.length-1,r=Qe[n-1]??-1,i=Qe[n]<0;return i&&(Qe[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Qe[n]===t},ot=e=>!f.has(e)&&m.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),st=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!yy.has(e.name)&&!ot(e.name):!1,ct=()=>{let e=b();return e.kind===`Step`?nt(e):e.kind===`Keyword`?my.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Ze()},lt=()=>{let e=o,t=b();return t.kind===`Operator`&&!$v.has(t.text)&&Sy(t.text)?(o++,y({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:g(t)},e)):T(`MODULE`)?y({kind:`ModuleFact`,name:pe(),location:g(t)},e):k()},ut=e=>p[p.length-1]?.add(e),dt=e=>{p.push(/* @__PURE__ */ new Set);let t=e();return p.pop(),t},ft=e=>p.some(t=>t.has(e))||m.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),pt=()=>{let e=o,t=b(),n=D(()=>{let e=b();if((e.kind!==`Identifier`||ce(e))&&e.kind!==`Operator`)throw de(`Expected a definition name but found ${ie(e)}`,e);return o++,e.text},`!`),r=g(t);return y(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},mt=()=>{if(i)return D(pt);let e=D(lt),t=n===`tlc`?e.find(e=>e.kind===`Identifier`&&ft(e.name)):void 0;if(t)throw S(`DEF clause entry should describe a defined operator`,t.location);return e},ht=()=>{let e=ct()?D(lt):[],t=T(`DEF`)||T(`DEFS`);if(i&&e.length===0&&!t)throw de(`Expected a fact`);return{facts:e,defs:t?mt():[]}},gt=()=>{let t=o,r=w(),i=r.text===`USE`&&T(`ONLY`),a=v(t),s={kind:r.text===`USE`?`Use`:`Hide`,isOnly:i,...ht(),keyword:a,location:g(r)},c=s.kind===`Hide`&&n===`tlc`?s.facts.filter(e=>!st(e)):[];if(c.length>0)throw e.q(c.map(n=>({location:e.X(n.location.range??v(t)),message:`The only expression allowed as a fact in a HIDE is
1785
- the name of a theorem, assumption, or step.`})));return y(s,t)},_t=()=>{let e=o,t=g(b()),n=T(`NEW`),r=i?o:e,a=i?g(b()):t,s=b().kind===`Keyword`?hy.get(b().text):void 0;if(!n&&s===void 0)throw de(`Expected a declaration but found ${ie(b())}`);if(s!==void 0&&w(),s===`Variable`){let e=me();return ut(e.name),y({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:a},r)}let c=Ke();ut(c.name);let l=(s??`Constant`)===`Constant`&&C(`\\in`);if(l&&c.arity>0)throw S(`declared symbol with arguments before \\in`);return l&&w(),y({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?k():void 0,nameRange:c.location.range,location:a},r)},vt=()=>{let e=o,t=g(E(`ASSUME`)),n=D(()=>(b().kind===`Identifier`&&C(`::`,1)&&C(`ASSUME`,2)&&(w(),w()),C(`ASSUME`)?dt(vt):b().kind===`Keyword`&&gy.has(b().text)?_t():k()));return E(`PROVE`),y({kind:`AssumeProve`,assumptions:n,conclusion:k(),location:t},e)},yt=e=>{let t=0;for(;b(t).kind===`Identifier`&&C(`,`,t+1);)t+=2;return b(t).kind===`Identifier`&&C(e,t+1)},bt=(e,t)=>{e.forEach(ut),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(ut))},xt=()=>{let e=b();if(C(`USE`)||C(`HIDE`))return gt();if(C(`INSTANCE`)){let t=o;return y(Ge(void 0,[],!1,g(e)),t)}if(C(`DEFINE`)||Ze()){let t=o;T(`DEFINE`);let n=[Ue(!1)];for(;Ze();)n.push(Ue(!1));let r={kind:`Define`,definitions:n,location:g(e)};return y(r,t)}if(T(`HAVE`))return{kind:`Have`,expression:k()};if(T(`TAKE`)){let e=be(),t=he(e?[]:D(me)),n=e?Ce():[];return bt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(T(`WITNESS`))return{kind:`Witness`,expressions:D(()=>k())};if(T(`PICK`)){let e=yt(`:`),t=he(e?D(me):[]),n=e?[]:Ce();return bt(t.names,n),E(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:k()}}return T(`CASE`)?{kind:`Case`,expression:k()}:{kind:`Assert`,isSuffices:T(`SUFFICES`),statement:C(`ASSUME`)?vt():k()}},St=e=>{let t=b();if(t.kind!==`Step`)throw de(`Expected a step number but found ${ie(t)}`,t);if(!at(t))throw S(`${e?`QED step`:`step`}'s number has bad level`,t);if(n!==`sany`&&et(t)<0&&rt(t)!==void 0)throw S(`<*> and <+> cannot be used for a named step`,t);return o++,{name:rt(t),token:t.text,location:g(t)}},Ct=()=>{let e=o,t=St(C(`QED`,1)),n=o,r=/* @__PURE__ */ new Set;p.push(r);let i=T(`QED`)?{kind:`Qed`}:xt(),a=v(e),s=v(n),c=it(b());if(c&&!oy.has(i.kind))throw S(`Proof of a step that does not take a proof`);let l=c?Et():void 0;return p.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(ut),y({...t,body:i,head:a,statement:s,proof:l},e)},wt=e=>{if(T(`BY`)){let t=v(o-1);return{kind:`By`,isOnly:T(`ONLY`),...ht(),keyword:t,location:e}}let t=b();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;w();let n=v(o-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Tt=()=>{let e=g(b());T(`PROOF`);let t=wt(e);if(t)return t;let n=[Ct()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(Ct());return{kind:`Steps`,level:$e(),steps:n,location:e}},Et=()=>{let e=o;Qe.push(-1);let t=dt(Tt);return Qe.pop(),y(t,e)},Dt=()=>b().kind===`Step`||b().kind===`Keyword`&&ay.has(b().text),Ot=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return fy(e);let n=t.defs[t.defs.length-1]?.location.range;return dy(fy({...e,end:e.start}),fy(n??t.keyword))},kt=()=>{let e=o,t=g(b()),n=T(`PROOF`),r=wt(t);if(r){let t=y(r,e);return{kind:`Leaf`,proof:t,span:fy(t.keyword),first:e,end:o-1}}let i=b();if(i.kind!==`Step`)throw de(`Expected a step number but found ${ie(i)}`);let a=o;w();let s=o,c=T(`QED`)?{kind:`Qed`}:xt(),l=v(a);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:v(s),span:Ot(l,c),first:e,start:a,end:o-1}},j=(e,t,n,r)=>{let i=e[t];if(!i)return{proof:void 0,span:r,next:t,end:void 0};if(i.kind===`Leaf`)return{proof:i.proof,span:i.span,next:t+1,end:i.end};let o=At(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={...g(a[i.first]),range:v(i.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},At=(e,t,n,r,i)=>{let a=e[t];if(!a)throw py(`Unexpected end of (sub)proof at level ${n} before QED step`,r);if(a.kind===`Leaf`)throw py(`Expecting a proof step but found a${ly[a.proof.kind]} leaf proof`,a.span);if(!i&&a.isProof)throw py(`PROOF keyword found in step that does not begin subproof`,a.span);let o=a.token.text[1];if(o===`+`&&!i)throw py(`<+> used but no subproof expected`,a.span);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:et(a.token);if(s<n||!i&&s>n)return;let c=oy.has(a.body.kind)?j(e,t+1,s+1,a.span):{proof:void 0,span:a.span,next:t+1,end:void 0},l=c.end??a.end,u={name:rt(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{...g(a.token),range:v(a.start,l)}},d=dy(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=At(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:dy(d,f.span)}},jt=()=>{if(!Dt())return;let e=[];for(;Dt();)e.push(kt());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=j(e,0,0,t.span),r=e[n.next];if(r)throw py(`extra step(s) after finished proof`,r.span,`Proof.Parser.toplevel`);return n.proof},M=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},Mt=()=>{if(b().kind!==`Identifier`||!C(`==`,1))return;let e=pe();return f.add(e),w(),e},Nt=e=>{let t=o,n=w(),r=Mt(),a=dt(()=>{let e=C(`ASSUME`)?vt():k();return i?{statement:e,proof:jt()}:{statement:e,proof:it(b())?Et():void 0}}),s=a.statement,c=y({name:r,statement:s,proof:a.proof,location:g(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&s.kind!==`AssumeProve`&&M(e,y({kind:`Operator`,name:r,params:[],body:s,isLocal:!1,isRecursive:!1,location:g(n)},t))},Pt=()=>{let e=o,t=w(),n=Mt();return y({name:n,expression:k(),isAxiom:t.text===`AXIOM`,location:g(t)},e)},Ft=()=>{let e=g(E(`----`));E(`MODULE`);let t=ve();E(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(m.push(n),d.push(/* @__PURE__ */ new Set),T(`EXTENDS`)&&D(()=>{let e=o;n.extends.push(ve()),n.extendsRanges.push(v(e))});;){let t=o;oe=t;let r=b();if(r.kind===`ModuleEnd`)return e.range={module:m[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},m.pop(),d.pop(),n;if(r.kind===`Separator`){if(C(`MODULE`,1)){let e=Ft();n.modules.push(e),n.units.push({kind:`Module`,module:e}),E(`====`);continue}w()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=g(w()),r=Je();n.constants.push(...r),e.range=v(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=g(w()),r=D(()=>{let e=o,t=g(b());return y({name:pe(),arity:0,location:t},e)});n.variables.push(...r),e.range=v(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Pt();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&M(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(C(`USE`)&&C(`ONLY`,1))throw de(`Expected a module unit but found ${ie(r)}`);let e=gt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=g(w()),r=Ye();e.range=v(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:It(n,y(Ge(void 0,[],!1,g(r)),t));continue;case`LOCAL`:if(w(),C(`INSTANCE`)){It(n,y(Ge(void 0,[],!0,g(r)),t));continue}It(n,y(A(!0),t));continue}r.kind===`Keyword`&&iy.has(r.text)?Nt(n):It(n,Ue(!1))}}},It=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},Lt=Ft(),Rt=_e?Gv(t):void 0;if(Rt!==void 0)throw new e.F(Rt);return Lt},Ey=e=>Ty(e,`tlc`),Dy=(e,t)=>Ty(e,`tlc`,t),Oy=e=>Ty(e,`tlapm`),ky=e=>Ty(e,`sany`),Ay=`$subexpression`,jy=(t,n)=>new e.F(`${t} at line ${n.line}, column ${n.column}`),My=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return My(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of Be(e)){let e=My(r,t,n);if(e)return e}},Ny=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Py=(e,t)=>{let n=e.location,r=Ny(t,e.lets,n);if(e.params.length===0)return r;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw jy(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:r,location:n}}if(e.args.length!==e.params.length)throw jy(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Ay,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Ay,args:e.args,location:n,resolution:vs},location:n}},Fy=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:vs})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:vs}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:vs};return Py({...t,params:[...t.params,...r]},a)},Iy=(t,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s=0,c,l=!1,u=(n,i)=>{if(!n)throw jy(i,a);bs.set(r,{args:t.slice(0,s).flatMap(e=>`args`in e?e.args:[]),error:{location:e.X(n),message:i}}),l=!0},d=e=>{let r=[],i=[];for(;s<t.length;){let o=t[s];if(o.kind!==`Name`)throw jy(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=e?e.find(e=>Hc(e)===c):n(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s++}throw jy(`Unknown operator ${r.join(`!`)}`,a)},f=e=>{let n=d(e),l=n.definition,f=Ts(l),p=s===t.length-1;if(n.args.length!==f&&(!i||n.args.length!==0))return u(r.argumentRanges?.[s]??a.range,`The operator ${n.name} requires ${f-n.earlier} arguments.`);if(p)return{definition:l,args:n.args};if(l.kind!==`Operator`)throw jy(`Cannot select a subexpression of ${l.name}`,a);o.params.push(...l.params),o.args.push(...n.args),c=l.body,s++},p=()=>{for(;s<t.length&&!l;){let e=t[s];if(e.kind!==`Name`)return;let n=r.selectorRanges?.[s],a=c&&My(c,e.name,[]);if(!a)return u(n,`Cannot find label \`${e.name}'.`);let l=a.label.params;if(!i&&e.args.length!==l.length)return u(n,`Label \`${e.name}' used with wrong number of arguments.`);o.lets.push(...a.lets),o.params.push(...l.map(e=>({name:e,arity:0}))),o.args.push(...e.args),c=a.label.body,s++}},m=e=>{if(!c)throw jy(`Subexpression selection failed`,a);if(e.kind===`Colon`)return;if(c.kind===`Label`){c=c.body,m(e);return}if(c.kind===`Let`){if(e.kind!==`Operand`||Ks(e.operand,1)!==0)throw jy(`A LET/IN expression has only one operand`,a);o.lets.push(c.definitions),c=c.body;return}let n=Xs(c);if(n&&(e.kind===`Bound`||e.kind===`At`)){o.params.push(...n.names.map(e=>({name:e,arity:0}))),e.kind===`Bound`&&o.args.push(...e.args),c=n.body;return}if(c.kind===`Case`&&e.kind===`Operand`){let n=[...c.arms,...c.other?[{condition:void 0,body:c.other}]:[]],r=n[Ks(e.operand,n.length)],i=t[s+1];if(!r||i?.kind!==`Operand`)throw jy(`A subexpression of CASE must have the form !i!j`,a);s++;let o=Ks(i.operand,2),l=o===0?r.condition:o===1?r.body:void 0;if(!l)throw jy(`Nonexistent CASE operand`,a);c=l;return}if(e.kind!==`Operand`)throw jy(`Unexpected subexpression selector`,a);let r=n?n.sets:Zs(c),i=r?.[Ks(e.operand,r.length)];if(!i)throw jy(`Nonexistent operand specified by the selector`,a);c=i},h=f(void 0);if(l)return r;if(h)return Fy(h.definition,{...o,args:h.args});for(p();s<t.length&&!l;){let e=t[s];if(e.kind===`Name`){for(;c?.kind===`Label`;)c=c.body;if(c?.kind!==`Let`)throw jy(`A name selector here must be from a LET clause`,a);o.lets.push(c.definitions);let e=f(c.definitions);if(l)return r;if(e)return Fy(e.definition,{...o,args:[...o.args,...e.args]});p()}else m(e),s++}if(l)return r;if(!c)throw jy(`Subexpression selection failed`,a);return Py(o,c)},Ly=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return qs(e,t,n)},Ry=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Be(e).some(Ry),zy=(e,t,n,r=!1)=>{if(!Ry(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Gc(e,e=>zy(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>By(e,r,n))}:i}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>zy(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Gc(e,e=>zy(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?Ly(a.name,[],void 0,t):a.kind===`Apply`?Ly(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Iy(o,t,a,r);return c!==a&&ys.add(c),c},By=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:zy(e.expression,t,n,!0)}))}),Vy=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Hy=(e,t)=>By(e,Vy(t.definitions),()=>!1),Uy=(e,t)=>{let n=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),r=e.theorems.flatMap(e=>{let t=e.statement;if(e.name===void 0||t.kind!==`AssumeProve`)return[];let n=t.assumptions.filter(e=>e.kind!==`NewSymbol`&&e.kind!==`AssumeProve`);return n.length===t.assumptions.length?[{kind:`Operator`,name:e.name,params:[],body:{kind:`Tuple`,elements:[...n,t.conclusion],location:t.location},isLocal:!0,isRecursive:!1,location:e.location}]:[]}),i=Vy([...t,...e.definitions]),a=e=>n.has(e),o=Vy([...t,...e.definitions,...r]),s=e=>zy(e,o,e=>a(e)&&r.every(t=>t.name!==e)),c=e=>a(e)||!i(e),l=e=>zy(e,i,c),u=e=>e.map(e=>e.kind===`ModuleFact`?e:l(e)),d=e=>e.map(e=>({...e,set:l(e.set)})),f=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&l(e.set)}:f(e)),conclusion:l(e.conclusion)}:l(e),p=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:u(e.facts)};case`Instance`:return By(e,i,c);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?By(e,i,c):Wc(e,l))};case`Have`:case`Case`:return{...e,expression:l(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(l)};case`Take`:return{...e,bounds:d(e.bounds)};case`Pick`:return{...e,bounds:d(e.bounds),body:l(e.body)};case`Assert`:return{...e,statement:f(e.statement)};default:return e}},m=e=>e?.kind===`By`?{...e,facts:u(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:p(e.body),proof:m(e.proof)}))}:e,h={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:f(e.statement),proof:m(e.proof)})),uses:e.uses.map(e=>({...e,facts:u(e.facts)}))};return e.definitions.some(e=>Ry(e.body))||e.assumptions.some(e=>Ry(e.expression))?{...h,definitions:e.definitions.map(e=>Wc(e,s)),assumptions:e.assumptions.map(e=>({...e,expression:s(e.expression)}))}:h},Wy=(e,t)=>e.maxLevels[t]??3,Gy=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=Zl({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(e,a),a},i=/* @__PURE__ */ new Map,a=e=>{let n=i.get(e);if(n)return n;let a=t(e),o=r(e),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Ol(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Ol(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>kl(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Tl(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&Ol(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(Ql(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c};return n=>{let i=/* @__PURE__ */ new Map,o=e.X(n.location.range??{module:n.instancer,start:n.location,end:n.location}),s=e=>i.set(`${o}\n${e}`,{location:o,message:e}),c=t(n.module),l=a(n.module),u=r(n.instancer),d=/* @__PURE__ */ new Map;n.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...c.constants.map(e=>({...e,maximumLevel:0})),...c.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let t=n.substitutions.get(e.name);if(!t)return[];if(e.arity===0){let n=u.analyze(t,d);return[{...e,level:n.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(t,d);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),p=(e,t)=>`Level error in instantiating module '${n.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${t}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&s(p(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${n.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let t=l.constraints.get(e.name);t!==void 0&&e.level>t&&s(p(e.name,t));let r=e.operator;r&&Array.from({length:e.arity},(t,i)=>{let a=l.argConstraints.get(Cl(e.name,i));a!==void 0&&Wy(r,i)<a&&s(`Level error in instantiating module '${n.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),l.argParams.forEach(e=>{let t=Tl(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=Wy(r,t.index);i.level>a&&s(`Level error when instantiating module '${n.module}':\nThe level of the argument ${t.index} of the operator ${t.operator}' \nmust be at most ${a}.`)}),i.size>0)throw e.q([...i.values()])}},Ky=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],qy=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Jy=new Map(yf.flatMap(e=>e.map(t=>[t,e[0]]))),Yy=e=>Jy.get(e)??e,Xy=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},Zy=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},Qy=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:Xy(e)&2147483647,kind:t,isLocal:n}),$y=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:Yy(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:Yy(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},eb=(e,t)=>{let n=[];for(let r=t;;){let t=$y(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},tb=e=>({line:e.line,column:e.column}),nb=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text!==`.`){if(a.text===`EXTENDS`){let n=eb(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}}return{references:s,end:e.length}};return i(0,t??``).references},rb=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,ib={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},ab=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&rb(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&rb(e[n+1],e[n+2])?n+=rb(e[n+2],e[n+3])?3:2:(r.text!==`MODULE`||e[n-1]?.kind!==`Separator`)&&t.push(r.kind===`String`?`"${r.text.replace(/[\\"\n\t\r\f]/g,e=>ib[e])}"`:r.text)}return t},ob=e=>e[2]?.text,sb=e=>{let t=/* @__PURE__ */ new Map,n=[];return e.forEach((r,i)=>{r.kind===`Separator`&&e[i+1]?.text===`MODULE`&&n.push({name:e[i+2].text,start:i});let a=r.kind===`ModuleEnd`?n.pop():void 0;a&&!t.has(a.name)&&t.set(a.name,{start:a.start,end:i+1})}),t},cb=(e,t)=>e.find(e=>e.name===t)??e.map(e=>cb(e.modules,t)).find(Boolean),lb=e=>{let t=e===void 0?[]:ae(e),n;return{tokens:t,ranges:sb(t),getModule:()=>n??=e===void 0?Ey(``):Dy(e,t)}},ub=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=lb(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:t?.(i)??Cf.get(i)??Ef.get(i)??wy(e,i),c=a(s),l=c.tokens,u=c.ranges.get(ob(l)??``)??{start:0,end:0},d={tokens:l,...u,getModule:c.getModule};return n.set(i??``,d),c.ranges.forEach((e,t)=>{e.start===u.start||r.has(t)||r.set(t,{tokens:l,...e,getModule:()=>cb(d.getModule().modules,t)??d.getModule()})}),d};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},db=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=eb(t,e+1);i.push({location:tb(t[e]),apply:e=>r.forEach(t=>e.put(Qy(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c=new Set(n.units.flatMap(e=>e.kind===`Constants`||e.kind===`Variables`?[`${e.location.line}:${e.location.column}`]:[])),l=0;t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r;if(n.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l++,l===2){let e=t[u+2].text;i.push({location:tb(n),apply:t=>t.put(Qy(e,`module`,!1))})}return}if(n.kind===`ModuleEnd`&&l--,l!==1||n.kind!==`Keyword`)return;let d=c.has(`${n.line}:${n.column}`);d&&(n.text===`CONSTANT`||n.text===`CONSTANTS`)&&o(u,`constant`),d&&(n.text===`VARIABLE`||n.text===`VARIABLES`)&&o(u,`variable`),n.text===`RECURSIVE`&&eb(t,u+1).every(e=>s.has(e))&&o(u,`definition`),qy.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(tb(n)),i.push({location:tb(n),apply:e=>e.put(Qy(t[u+1].text,`theorem`,!1))}))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(Qy(t,`theorem`,!1))})});let u=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(u(e.location))return;let t=Yy(e.name);i.push({location:e.location,apply:n=>n.put(Qy(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(Qy(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(Qy(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>ws(e.location,t.location)?-1:+!!ws(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=Zy();n.set(i??``,o),vf.toReversed().forEach(e=>o.put(Qy(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},fb=(t,n)=>{let r=/* @__PURE__ */ new Set,i=e=>{r.add(e)},a=e=>{e.kind===`ModelValue`&&i(e.name),e.kind===`String`&&i(e.value),e.kind===`Set`&&e.elements.forEach(a)};n.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),bf.forEach(i);let o=e=>{let n=t(e);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=nb(o(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),g=m(e=>e.instances),_=/* @__PURE__ */ new Set([void 0]),ee=/* @__PURE__ */ new Map;ab(o(void 0)).forEach((e,t)=>{t===3&&Sf.forEach(i),i(e)});let te=l(void 0);for(;;){let n=h(te,/* @__PURE__ */ new Set)??g(te,/* @__PURE__ */ new Set);if(!n)break;let[r,a]=n;if(d.add(`${r.key}>${a}`),ee.set(r.unit,[...ee.get(r.unit)??[],a]),!_.has(a)){if(_.add(a),t(a).tokens.length===0){let n=r.unit??ob(t(void 0).tokens);throw e.K(a,n)}ab(o(a)).forEach(i)}}Ky.forEach(i);let v=/* @__PURE__ */ new Set,ne=e=>{if(v.has(e))return;v.add(e);let t=ee.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(ne),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return ne(void 0),xf.forEach(i),[...r]},pb=(e,t)=>{let n=ub(e,t),r=n.getParsed,i,a=()=>i??=db(r);return{getStringOrder:e=>fb(r,e),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},mb=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),hb=t=>{switch(t.kind){case`Number`:if(!Pt(t.value))throw e.it(new e.O(`TLC can't handle a number this big.\n${t.value}`),e.tt.error);return t.value;case`String`:case`Boolean`:return t.value;case`ModelValue`:return yn(t.name);case`Set`:return P({kind:`MixedSet`,elements:t.elements.map(hb)})}},gb=t=>{try{return hb(t)}catch(t){throw!(t instanceof e.b)||t instanceof e.O||t instanceof e.x?t:e.it(new e.b(`${e.G}${t.message}`),e.tt.error)}},_b=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],vb=(t,n,r)=>{try{return r.parseModule(t)}catch(r){if(!(r instanceof e.F))throw r;let i=Gv(t);throw i===void 0?r:e.q([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},yb=t=>new e.F(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),bb=(t,n)=>t.location.range&&n.location.range&&{location:e.X(t.location.range),message:`Multiply-defined module '${t.name}': this definition or declaration conflicts \nwith the one at ${e.X(n.location.range)}.`},xb=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,Sb=e=>e===`Theorem`?`ThmOrAssumpDefNode`:xb(e),Cb=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:cl(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),wb=(t,n,r)=>{let i=`{ ${r.map(e=>`<${[...e[0],e[1]].map(e=>L(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:t,arity:n,evaluate:t=>{let n=r.find(n=>{if(n[0].length!==t.length)throw new e.b(`Attempted to apply the operator ${i}\nwith wrong number of arguments.`);return n[0].every((e,n)=>{let r=t[n];return(typeof r!=`object`||r.kind!==`Operator`)&&Pn(e,r)})});if(n)return n[1];throw new e.b(`Attempted to apply operator:\n${i}\nto arguments (${t.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:L(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},Tb=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||Be(e).some(e=>Tb(e,t)),Eb=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(rl(e),n.get(e)??n.size)),n},Db=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Ob=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw ph(e);if(e.kind===`Number`&&!Pt(e.value))throw mh(e);Ob(e.kind===`Let`?[...Be(e),...Db(e.instances??[])]:Be(e))}),kb=(t,n)=>{let r=n.order??pb(n.source,n.loadModule),i=r.parseModule(n.source),a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Set,l=/* @__PURE__ */ new Set,u=new Map(Lf.map(e=>[e.name,e])),d=/* @__PURE__ */ new Map,f=Wd(t.checkDeadlock,n.seed);f.isWarningEnabled=n.isWarningEnabled??!0,f.isTool=n.isTool??!1,f.version=n.version??`master`;let p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,h=[],g=/* @__PURE__ */ new Map,_=[],ee=[],te=(e,t)=>_.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),v=0,ne=e=>`${e}#${v++}`,y=[],re=[],b=Gy(e=>{let t=m.get(e)??ue(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>a.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>a.get(t.visible.get(e)?.key??e)}}),ie=/* @__PURE__ */ new Map,ae=/* @__PURE__ */ new Map,oe=/* @__PURE__ */ new Map,se=e=>{let t=d.get(e);if(t)return t;let r=ip(e,n.print,f,n.files,u);if(!r)return;rp.get(e)?.forEach(se);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>se(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{u.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:bl.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Sl(e,t.name)??i.get(t.name)?.range})}),d.set(e,i),i},ce=e=>{let t=rp.get(e)??[];if(e===`TLCExt`||[e,...t].some(e=>n.loadModule?.(e)!==void 0))return;let r=se(e);return r&&te(e,t),r&&t.includes(`Integers`)&&se(`Integers`),r},x=e=>(Ob([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...Db(e.instances)]),e.modules.forEach(x),e);x(i);let le=(t,i)=>{let a=n.loadModule?.(t)??Of(f.version).get(t)??wy(n.source,t);if(a===void 0)throw e.K(t,i);let o=vb(a,t,r);if(o.name!==t)throw e.q([{location:`Unknown location`,message:`File name '${t}' does not match the name '${o.name}' of the top level module it contains.`}],!0);return x(o)},S=t=>{let n=ee.indexOf(t.name);if(n!==-1){let r=[...ee.slice(n),t.name].map(e=>`${e}.tla`);throw new e.F(`Circular dependency among .tla files; dependency cycle is: ${r.join(` --> `)}`)}let r=/* @__PURE__ */ new Set,i=[],a=[],o=[];ee.push(t.name),_.push(r);let s=ge(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:re,levelChecks:o});if(_.pop(),ee.pop(),a.length>0)throw e.q(a,!1,void 0,re);let c=i.find(e=>r.has(e.name)),l=c&&p.get(c.name),u=l&&bb(c,l.module);if(u)throw e.q([u],!1,void 0,re);if(c)throw yb(c);return o.forEach(e=>e()),{linked:s,closure:r}},ue=(t,r)=>{let i=p.get(t);if(i)return te(t,g.get(t)??[]),i;let o=S(le(t,r)),s=/* @__PURE__ */ new Map;return np(t,n.print,f,n.files,u,(t,n,r)=>{let i=s.get(t),a=n.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(i?.kind!==`Operator`||!r||a.length!==n.length)throw new e.b(`No definition of ${t} to fall back to`);let o={kind:`Closure`,name:i.name,params:i.params,body:i.body,scope:void 0};return W(i.body,{environment:r.environment,scope:bg(o,a,r),state:r.state,next:r.next,isKeepLazy:r.isKeepLazy})})?.forEach(e=>{let n=o.linked.visible.get(e.name);if(n?.kind!==`Definition`||n.arity!==e.arity&&mb.has(t))return;let r=a.get(n.key);r&&s.set(e.name,r),u.set(n.key,e),a.delete(n.key)}),p.set(t,o.linked),g.set(t,o.closure),te(t,o.closure),o.linked},de=(e,t,n,r,i)=>{let u=i?void 0:ce(e.module);if(u)return fe(e,u);let d=i??ue(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=_b(d),p=`#${v++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=Nc(Hy(e,t),f,t,n);y.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>l.add(e));let _=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,ee=hl({params:g,substitutions:new Map([...h].map(([e,t])=>[e,zc(t,m)])),variables:new Set(d.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>o.get(e)===!0,addDefinition:(n,i,l)=>{let u=ne(`${i}@${t.name}`),d=l(u);return a.set(u,d),f.length>0&&c.add(d),e.name!==void 0&&ae.set(u,`${e.name}!${ae.get(n)??i}`),o.set(u,!r),s.set(u,{source:n,prefix:e.params.length}),u},createName:ne,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return C(e,d.exported,f,(t,n)=>{let r=e.name===void 0?ee.getKey(t):ee.getQualifiedKey(t);return f.length>0&&ie.set(r,{name:n,location:e.location}),e.name!==void 0&&oe.set(r,n),r})},fe=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),C=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:o.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},w=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:ll(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),T=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),E=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=T(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:ll(r,n),location:n}}},pe=(e,t,n,r)=>{let i=e.location,s=r?void 0:ce(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=T(n.arity);return w(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??ue(e.module,n),l=`#${v++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=_b(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};y.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>Tb(f(e),p),h=d.map(t=>{let n=E(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),g=[],_=hl({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:ll(e.params,i),location:i,resolution:vs}:cl(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>o.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:Cb(a,i)),i},createName:ne}),ee=new Set(d.map(e=>e.name)),te=[...c.exported].filter(([e])=>!ee.has(e)).map(([t,n])=>{let r=_.getKey(n.key),a=T(n.arity),o=[...e.params,...a];return w(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...g,...te]},me=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),he=/* @__PURE__ */ new Map,ge=(t,r)=>{let s=w_(t,n.loadClass?.(t.name),t===i);he.set(t.name,s.overrides);let c=s.module,l=y.length,u=new Map([...Lf.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:Oc,errors:[],warnings:[]},p=[f],g=t=>t.forEach((t,n)=>{let r=_.get(n);if(!r){u.set(n,t),_.set(n,t);return}if(!r.range||!t.range||e.X(r.range)===e.X(t.range))return;let i=e.X(t.range),a=e.X(r.range);Sb(r.kind)===Sb(t.kind)?f.warnings.push({location:i,message:`Warning: the ${xb(r.kind)} of '${n}' conflicts with \nits ${xb(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${xb(t.kind)} of '${n}' conflicts with \nits ${xb(r.kind)} at ${a}.`})}),_=/* @__PURE__ */ new Map,ee=/* @__PURE__ */ new Set,te=/* @__PURE__ */ new Map,v=[],ne=[...c.constants],ie=c.variables.filter((e,t)=>c.variables.findIndex(t=>t.name===e.name)===t),ae=ie.map(e=>e.name),se=ie.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:ce(e);if(n){g(n);return}let i=t??ue(e,c.name);ne.push(...i.constants.filter(e=>ne.every(t=>t.name!==e.name)&&!ae.includes(e.name))),i.variables.forEach((e,t)=>{ae.includes(e)||ne.some(t=>t.name===e)||(ae.push(e),se.push(i.variableLocations[t]))}),g(i.exported),i.facts.forEach(e=>ee.add(e)),i.modules.forEach((e,t)=>te.set(t,e)),v.push(i)});let x=new Map(u),le=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],S=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});le.forEach(e=>_.set(e.name,S(e)));let w=e=>({key:E(e),arity:Ts(e),params:Es(e),kind:kc(c,e)?`Theorem`:`Definition`,range:e.location.range}),T=ne.length===0&&ae.length===0,E=e=>c===i?e.name:`${e.name}@${r.id}`,_e=/* @__PURE__ */ new Map,ve=()=>new Map([...r.modules,...te]),ye=e=>{let t=c.modules.find(t=>t.name===e.module);return t?ws(t.location,e.location)?te.get(t.name):void 0:ve().get(e.module)},D=e=>({imported:u,getInstance:e=>{let t=ye(e),n=t?void 0:ce(e.module);if(n)return{declarations:[],symbols:fe(e,n),instancer:c.name};let r=t??ue(e.module,c.name),i=_b(r);return{declarations:i,symbols:C(e,r.exported,i,e=>e),instancer:c.name}},bound:x,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:E,instanced:_e,facts:ee,reports:p,warnings:r.warnings}),be=e=>[...le.filter(t=>ws(t.location,e)).map(e=>[e.name,S(e)]),...c.definitions.filter(t=>ws(t.location,e)).map(e=>[e.name,w(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(u)),xe=e=>{let t=ve(),n=t.get(e.name),i=n&&bb(e,n.module);if(n&&!i)throw yb(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};p.push(a);let o=ge(e,{id:`${r.id}/${e.name}`,symbols:be(e.location),modules:t,nested:r.nested,errors:a.errors,warnings:a.warnings,levelChecks:r.levelChecks});i&&a.errors.push(i),n||te.set(e.name,o)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=de(e,c,D(c),T,ve().get(e.module));_e.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||_.set(n,t))})}})),...c.modules.map(e=>({location:e.location,link:()=>xe(e)}))].sort((e,t)=>ws(e.location,t.location)?-1:1).forEach(e=>e.link());let Se=Uy(yl(c,(e,t)=>pe(e,t,c.name,ye(e))),me(u));r.errors.push(...Fc(Se,D(Se))),Se.definitions.forEach(e=>{let t=E(e);a.set(t,e),o.set(t,!T);let n=w(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!ws(r,e.location))&&(u.set(e.name,n),e.isLocal||_.set(e.name,n))});let Ce={module:Se,constants:ne,variables:ae,variableLocations:se,visible:u,exported:_,modules:te,extended:v,facts:/* @__PURE__ */ new Set([...ee,...[...Se.theorems,...Se.assumptions].flatMap(e=>e.name??[])])};m.has(c.name)||m.set(c.name,Ce);let we=y.splice(l).map(e=>({location:e.location,check:()=>b(e)}));return r.levelChecks.push(()=>$l(Se,{constants:new Set(ne.map(e=>e.name)),variables:new Set(ae),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>oe.get(u.get(e)?.key??e)},we,re)),h.push(Ce),Ce},_e=S(i).linked,ve=n.traceFile,ye=ve===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:ve}}],D=[...n.moduleOperators??[],...ye].map(e=>{let t=ue(e.module,i.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});h.push(...h.splice(h.indexOf(_e),1)),re.length>0&&!n.isSanyReported&&n.print(e.Z(re));let be=e=>_e.visible.get(e)?.key??e;_e.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)}),D.forEach(e=>{let t=e.key===void 0?void 0:a.get(e.key);e.kind!==`postcondition`&&t&&a.set(e.operator,t)});let xe=[],Se=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Se(e,t)),xe.push(...e.module.assumptions))};Se(_e,/* @__PURE__ */ new Set);let Ce=_e.constants.map(e=>e.name),we=_e.variables,Te=new Map([...d,...[...p].map(([e,t])=>[e,t.visible]),[i.name,_e.visible]]),Ee=e=>{let t=Te.get(e.module??``)?.get(e.name);return t?.kind===`Definition`?t:void 0},De=e=>{if(e.module===void 0)return[e.name,be(e.name)];let t=Ee(e);return t?[t.key]:[]},Oe=e=>e.module===i.name?[]:De(e),ke=e=>{let t=a.get(e);return t?.kind===`Operator`?t.params.length:_e.constants.find(t=>t.name===e)?.arity??u.get(e)?.arity??0},Ae=/* @__PURE__ */ new Map,je=/* @__PURE__ */ new Set,Me=(e,t)=>{u.set(e,t),a.delete(e),Ae.delete(e),je.add(e)};t.constants.filter(e=>e.args===void 0).forEach(e=>{let t=gb(e.value);fr(t),Oe(e).forEach(e=>{let n=ke(e);n===0?Ae.set(e,t):Me(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ne=/* @__PURE__ */ new Map;t.constants.forEach(t=>{if(t.args===void 0)return;let n=`${t.module??``}!${t.name}`,r=Ne.get(n)??{name:t.name,module:t.module,rows:[]};if(r.rows.length>0&&r.rows[0][0].length!==t.args.length)throw new e._(`The arity of the operator ${t.name} is inconsistent in the configuration file.`);r.rows.push([t.args.map(hb),hb(t.value)]),Ne.set(n,r)}),Ne.forEach(e=>Oe(e).forEach(t=>Me(t,wb(e.name,ke(t),e.rows))));let Pe=new Map(t.substitutions.flatMap(e=>De(e).map(t=>[t,be(e.target)])));[...Pe.keys()].forEach(e=>Ae.delete(e));let Fe=(t,n,r)=>{let i=be(n),o=a.get(i);if(!(o!==void 0||u.has(i)||Ae.has(i)||Ce.includes(n)||we.includes(n)))throw new e._(`The configuration file substitutes for ${t} with the undefined identifier ${n}.`);if(o?.kind===`Operator`&&o.params.length!==r)throw new e._(`The configuration file substitutes for ${t} with ${n} of different number of arguments.`)};t.substitutions.filter(e=>e.module===void 0).forEach(n=>{let r=n.name,i=n.target;if(!Ce.includes(r)&&!_e.visible.has(r))throw new e._(`In the configuration file, the identifier ${r} does not appear in the specification.`);if(t.substitutions.some(e=>e.name===i))throw new e._(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);Fe(r,i,_e.constants.find(e=>e.name===r)?.arity??_e.visible.get(r)?.arity)});let Ie=t.substitutions.filter(e=>e.module!==void 0);[...Te.keys()].forEach(t=>{let n=Ie.filter(e=>e.module===t);n.forEach(t=>{let r=Ee(t);if(r){if(n.some(e=>e.name===t.target))throw new e._(`In the configuration file, the identifier ${t.target} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);Fe(t.name,t.target,r.arity)}});let r=n.find(e=>!Ee(e));if(r)throw new e._(`In the configuration file, the identifier ${r.name} does not appear in the specification.`)});let Le=Ie.find(e=>!Te.has(e.module??``));if(Le)throw new e._(`In the configuration file, the module name ${Le.module} is not a module in the specification.`);let Re=new Set([...t.constants,...t.substitutions].filter(e=>e.module!==void 0).flatMap(Oe)),ze=(e,t)=>{if(Re.has(e))return{key:e,prefix:t};let n=s.get(e);return n&&ze(n.source,t+n.prefix)};s.forEach((e,t)=>{let n=ze(e.source,e.prefix),r=a.get(t);if(!n||!r)return;let i=r.kind===`Operator`?r.params:[],o=w(t,n.key,i,i.slice(n.prefix),r.location);a.set(t,o),_e.visible.forEach((e,n)=>{e.key===t&&n!==t&&a.set(n,o)})}),D.forEach(e=>ue(e.module,i.name).constants.forEach(t=>{let n=e.constants?.[t.name];n!==void 0&&Ae.set(t.name,n)}));let Be=Ce.filter(e=>!Ae.has(e)&&!Pe.has(e)&&!je.has(e));if(Be.length>0){let t=r.getDeclarationOrder(`constant`).find(e=>Be.includes(e))??Be[0];throw new e._(`The constant parameter ${t} is not assigned a value by the configuration file.`)}ve!==void 0&&u.forEach((e,t)=>{let n=Hf(e);n&&u.set(t,n)});let O=Eb(we,h.flatMap(e=>e.module.variables.map(e=>e.name))),k=pu({definitions:a,substitutions:Pe,constants:Ae,variableIndex:O,builtins:u,variables:we}),Ve={runtime:f,definitions:a,builtins:u,constants:Ae,substitutions:Pe,instanceNames:ae,variables:we,variableIndex:O,facts:k,startupValues:Array.from({length:k.ids.size},()=>void 0),substitutedDefinitions:c,instanceParams:l,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},He=Zl({constants:new Set(Ae.keys()),variables:/* @__PURE__ */ new Set([...we,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>u.has(e))]),getDefinition:e=>Oh(e,Ve)}),Ue=t=>{try{W(t,{environment:Ve,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e.b)return t;throw t}};Pe.forEach((t,n)=>{let r=a.get(t),i=Ce.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&He.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?Ue(r.body):void 0;if(i){let r=nt(i)?``:` - specifically: ${i.message}`;throw new e._(`The configuration file substitutes constant ${n} with non-constant ${t}${r}`)}}),f.version!==`1.7.4`&&(f.isStarted=!0);let We=new Set(h.flatMap(e=>e.module.instances.map(e=>e.module))),A=r.createDefinitionOrder();return{environment:Ve,assumptions:xe,variableLocations:_e.variableLocations,instanceActions:ie,startupDefinitions:h.filter(e=>!We.has(e.module.name)||_b(e).length===0).flatMap(e=>A(e===_e?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:h.flatMap(e=>he.get(e.module.name)??[]),moduleOperators:D,rootName:i.name}},Ab={kind:`Boolean`,value:!0},jb={kind:`Boolean`,value:!1},Mb=e=>e?Ab:jb,Nb=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,Pb=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,Fb=(e,t)=>({kind:e,body:t}),Ib=(e,t,n)=>({kind:e,operands:[t,n]}),Lb=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?Lb(e,t.operands).operands:[t])}),Rb=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return Rb(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,Rb(t)),0)}},zb=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return zb(e.body);case`And`:case`Or`:return e.operands.some(zb)}},Bb=/* @__PURE__ */ new WeakMap;let Vb=0;const Hb=e=>{let t=Bb.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${Vb++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(Hb).join(`,`)})`;default:return`${e.kind}(${Hb(e.body)})`}})();return Bb.set(e,n),n},Ub=(e,t)=>e===t||Hb(e)===Hb(t),Wb=(e,t)=>{let n=Hb(t);return e.some(e=>e===t||Hb(e)===n)},Gb=e=>e===`And`?`Or`:`And`,Kb=(e,t)=>{switch(e.kind){case`Boolean`:return t?Mb(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?Fb(`Not`,e):e;case`Not`:return Kb(e.body,!t);case`And`:case`Or`:return Lb(t?Gb(e.kind):e.kind,e.operands.map(e=>Kb(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return Fb(n,Kb(e.body,t))}}},qb=e=>{switch(e.kind){case`Boolean`:return Mb(!e.value);case`Not`:return e.body;case`And`:case`Or`:return Lb(Gb(e.kind),e.operands.map(qb));case`Always`:return Fb(`Eventually`,qb(e.body));case`Eventually`:return Fb(`Always`,qb(e.body));default:return Fb(`Not`,e)}},Jb=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Jb(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return Mb(t)}return n.length===0?Mb(!t):n.length===1?n[0]:Lb(e.kind,n)}case`Not`:{let t=Jb(e.body);return t.kind===`Boolean`?Mb(!t.value):Fb(`Not`,t)}case`Always`:case`Eventually`:{let t=Jb(e.body);return Fb(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Yb=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Xb=t=>{switch(t.kind){case`And`:{let n=[],r=1;for(let i of t.operands){let t=Xb(i);if(t.kind===`And`)n.push(...t.operands);else{if(t.kind===`Or`&&(r*=t.operands.length,r>2147483647))throw new e.b(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);n.push(t)}}if(r===1)return{kind:`And`,operands:n};let i=Array.from({length:r},()=>[]),a=1,o=r;for(let e of n){if(e.kind!==`Or`){i.forEach(t=>t.push(e));continue}o/=e.operands.length;let t=0;for(let n=0;n<a;n++)for(let n of e.operands)for(let e=0;e<o;e++)i[t++].push(n);a*=e.operands.length}return{kind:`Or`,operands:i.map(e=>Lb(`And`,e))}}case`Or`:{let e=[],n=[];for(let r of t.operands){let t=Xb(r);for(let r of t.kind===`Or`?t.operands:[t]){let t=Yb(r);t?e.push(t):n.push(r)}}if(e.length>0){let t=e.length===1?e[0]:Lb(`Or`,e);n.push(Fb(`Always`,Fb(`Eventually`,t)))}return Lb(`Or`,n)}case`Not`:return Nb(t.body)?t:Xb(qb(t.body));default:return t}},Zb=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Zb(e.operands[0]):Lb(e.kind,e.operands.map(Zb));case`Not`:return e.body.kind===`Not`?Zb(e.body.body):Fb(`Not`,Zb(e.body));case`Always`:case`Eventually`:case`Next`:return Fb(e.kind,Zb(e.body));default:return e}},Qb=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Qb(e.operands[0]);let t=Math.floor(e.operands.length/2);return Ib(e.kind,Qb(Lb(e.kind,e.operands.slice(0,t))),Qb(Lb(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return Fb(e.kind,Qb(e.body));default:return e}},$b=(e,t)=>{e.kind===`Eventually`&&!Wb(t,e)&&t.push(e),`body`in e&&$b(e.body,t),`operands`in e&&e.operands.forEach(e=>$b(e,t))},ex=e=>{let t=e.filter(Pb),n=e.flatMap(e=>e.kind===`Not`&&Pb(e.body)?[e.body]:[]);return!t.some(e=>Wb(n,e))},tx=t=>{let n=[...t],r=[];for(;n.length>0;){let t=n.pop();if(!t)break;switch(t.kind){case`Not`:n.push(t.body);break;case`Next`:r.push(t),n.push(t.body);break;case`Always`:case`Eventually`:r.push(t,Fb(`Next`,t)),n.push(t.body);break;case`And`:case`Or`:n.push(...t.operands),r.push(t);break;case`Action`:throw new e.b(`TLC encountered actions while constructing the tableau`);default:r.push(t)}}return r},nx=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:Fb(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},rx=(e,t,n)=>e.flatMap(e=>{let r=nx(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),ix=e=>[...new Set(e.map(Hb))].sort().join(`|`),ax=(e,t)=>{let n=new Set(t.map(ix));return[...e.filter(e=>!n.has(ix(e))),...t]},ox=e=>{let t=tx(e),n=rx(t,`Always`,`And`),r=rx(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=nx(t,`Eventually`,`Or`);if(n&&!(Wb(e,n.first)||Wb(e,n.second)))return ax(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Wb(e,t.first)||Wb(e,t.second))&&!Wb(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!ex(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=nx(t[e],`Always`,`And`);n&&(Wb(t,n.first)||t.push(n.first),Wb(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)Wb(t,e.first)&&Wb(t,e.second)&&!Wb(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!ex(t)?[]:i(t)};return a(e)},sx=e=>({particle:e,successors:[],statePredicates:e.filter(e=>Rb(e)<=1)}),cx=e=>{let t=ox([e]).map(sx),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=ix(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of ox(n)){let n=ix(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(sx(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},lx=(e,t)=>!Wb(e,t)||Wb(e,t.body),ux=(t,n)=>{if(t.kind===`Eventually`&&t.body.kind===`Always`&&Rb(t.body.body)<3){n.eventuallyAlways.push(t.body.body);return}let r=Yb(t);if(r){let e=Rb(r);if(e<=1){n.infinitelyOftenStates.push(r);return}if(e===2){n.infinitelyOftenActions.push(r);return}}if(zb(t))throw new e.b(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);n.formulas.push(t)},dx=(e,t)=>{let n=e.findIndex(e=>Ub(e,t));return n===-1?(e.push(t),e.length-1):n},fx=e=>{let t=Xb(Jb(Kb(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Zb(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])ux(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:Lb(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Ub(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Qb(e.formula),n=[];t&&$b(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>dx(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>dx(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>dx(i,e))}));return{tableau:t&&cx(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},px=()=>e.it(new e.b(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.tt.livenessEvaluationFailure),mx=/* @__PURE__ */ new Set([`~>`,`-+->`]),hx=/* @__PURE__ */ new WeakSet,gx=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),_x=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),vx=(t,n)=>new e.b(`TLC cannot handle the temporal formula ${H(t)}${n===void 0?``:`:\n${n}`}`),yx=(e,t,n,r=/* @__PURE__ */ new Set,i=/* @__PURE__ */ new Set)=>{let a=(e,t,r)=>{if(i.has(e))return 0;i.add(e);let a=yx(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=_h(t,e);if(!n)return;if(n.kind===`Value`)return 0;if(n.kind===`Thunk`)return n.isReleased?0:a(n,n.expression,n.scope);let r=n.operator;return r.kind===`Closure`?a(r,r.body,r.scope):0},s=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=Oh(e,n);if(t)return yu(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isActionLevel?2:r.isStateLevel&&!r.isLevelConstant?1:0},c=(e,t)=>r.has(e)?0:O(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return Gc(e,(e,o)=>(a=Math.max(a,yx(e,t,n,o.length===0?r:/* @__PURE__ */ new Set([...r,...o]),i)),e)),a};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:l(e);case`Identifier`:return c(e.name,e);case`OperatorReference`:return c(e.operator,e);case`Apply`:{if(mx.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=O(e)?void 0:sg(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,bg(o,e.args,_x(n,t)))}default:return l(e)}},bx=(t,n)=>{try{return Rh(t,n)}catch(t){if(!(t instanceof e.b))throw t;if(!nt(t))return;throw e.it(new e.b(`${e.W}${t.message}`),e.tt.error)}},xx=(t,n,r,i,a=/* @__PURE__ */ new Set,o=!1,s,c=[])=>{let l=(e,t,n=s,l=a,u)=>xx(e,t,r,i,l,o||u!==void 0&&r.substitutedDefinitions.has(u),n,u?.kind===`Operator`&&u.params.length===0?[...c,u.name]:c);if(t.kind===`And`)return t.operands.flatMap(e=>l(e,n,H(e)));if(t.kind===`Label`)return l(t.body,n);if(t.kind===`Let`)return l(t.body,Sx(t,n,r));if(t.kind===`Identifier`){let i=O(t)?_h(n,t.name):void 0;if(i?.kind===`Thunk`&&!i.isReleased)return l(i.expression,i.scope,hx.has(i)?t.name:s);let c=r.constants.has(t.name)?void 0:Oh(t.name,r);if(!i&&c?.kind===`Operator`&&c.params.length===0&&(yu(c,r)>0||ng(c,r)===void 0)){if(a.has(c))throw e.Y();return l(c.body,void 0,!o&&r.instanceNames.get(t.name)||c.name,/* @__PURE__ */ new Set([...a,c]),c)}}let u=_x(r,n);if(t.kind===`Apply`&&r.runtime.version!==`1.7.4`&&(i||yx(t,n,r)===3)){let e=cg(t,u),n=O(t)?void 0:Oh(t.operator,r),i=e?.kind===`Closure`&&e.params.every(e=>r.instanceParams.has(e));if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive&&(!o||i))return l(e.body,bg(e,t.args,u),o&&n?n.name:t.operator,a,n)}let d=i&&t.kind===`Forall`&&t.bounds.every(e=>yx(e.set,n,r)===0),f=d?bx(t.bounds,u):void 0;if(d&&f){let e=[];if(zh(t.bounds,f,n,n=>(e.push(...l(t.body,n,H(t.body))),!1)),e.length===0)throw px();return e}return[{expression:t,scope:n,name:s,path:c}]},Sx=(e,t,n)=>{let r=wg(e.definitions,_x(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&hx.add(e.binding);return r},Cx=(t,n,r)=>{let i=r.runtime.version===`1.7.4`,a=(t,n,a)=>{let o=a===0&&!i?yx(t,n,r):a;if(o===0){let i=W(t,_x(r,n));if(typeof i!=`boolean`)throw new e.b(`TLC expected a boolean value, but did not find one. ${oh(t)}`);return Mb(i)}return o===1?{kind:`State`,expression:t,scope:n}:t.kind===`AngleAction`?{kind:`Action`,expression:t.action,subscript:t.subscript,scope:n}:{kind:`Action`,expression:t,subscript:void 0,scope:n}},o=0,s=(t,n,i,s)=>{if(o>=100)throw e.Y();o++;let c=p(t,n);o--;let l=Rb(c),u=l===0&&yx(i,s,r)>2;return l>2||u?c:a(i,s,l)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,a=_x(r,t),o=O(e)||Oh(n,r)===void 0?_h(t,n):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&hx.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:O(e)?lg(n,a):sg(n,r),u=e.kind===`Apply`?e.args:[],f=c?.kind===`Builtin`&&u.length===2?gx.get(c.name):void 0;if(f){let n=u.map(e=>p(e,t));return d(e,t,Lb(f,n))}if(c?.kind!==`Closure`)throw vx(e);let m=!O(e)&&Oh(n,r)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),s(c.body,bg(c,u,a),e,t)),m)},l=(t,n,r=!1)=>{try{return n()}catch(n){let a=n instanceof e.P||r&&!i;throw!(n instanceof e.b)||a?n:vx(t)}},u=(t,n)=>{let i=yx(t,n,r),o=[],s=t.kind===`Forall`;try{Bh(t.bounds,_x(r,n),e=>(o.push(p(t.body,e)),!1))}catch(r){if(!(r instanceof e.b)||r instanceof e.P)throw r;if(i<=2)return a(t,n,i);throw vx(t,s&&!nt(r)?r.message:void 0)}return o.length===0?Mb(s):d(t,n,Lb(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=Rb(n);return r>2?n:a(e,t,r)},f=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!O(e)||e.operator===`=>`),p=(e,t)=>{let n=yx(e,t,r);if(n<=2&&!f(e))return a(e,t,n);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,Sx(e,t,r));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?Fb(`Always`,Ib(`Or`,Fb(`Not`,p(n[0],t)),Fb(`Eventually`,p(n[1],t)))):e.operator===`~`&&!O(e)?d(e,t,Fb(`Not`,p(n[0],t))):e.operator===`=>`?d(e,t,Ib(`Or`,Fb(`Not`,p(n[0],t)),p(n[1],t))):c(e,t)}case`And`:case`Or`:return d(e,t,Lb(e.kind,e.operands.map(e=>p(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&yx(e.condition,t,r)===0){let n=W(e.condition,_x(r,t));if(typeof n==`boolean`)return p(n?e.consequent:e.alternative,t)}let n=p(e.condition,t);return d(e,t,Ib(`Or`,Ib(`And`,n,p(e.consequent,t)),Ib(`And`,Fb(`Not`,n),p(e.alternative,t))))}case`Always`:case`Eventually`:return Fb(e.kind,p(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=Fb(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?Fb(`Always`,Fb(`Eventually`,Ib(`Or`,i,a))):Ib(`Or`,Fb(`Eventually`,Fb(`Always`,i)),Fb(`Always`,Fb(`Eventually`,a)))}default:throw vx(e)}};return p(t,n)},wx=(t,n,r,i,a)=>{let o=e=>wx(e,n,r,i,a);switch(t.kind){case`Boolean`:return t.value;case`State`:case`Enabled`:{let r=a.get(t);if(r!==void 0)return r;let o={environment:i,scope:t.scope,state:n,next:void 0},s=t.kind===`State`?W(t.expression,o):qm(t.step,o);if(typeof s!=`boolean`)throw new e.b(`A state predicate was evaluated to a non-boolean value.`);return a.set(t,s),s}case`Action`:{if(t.enabled&&a.get(t.enabled)===!1)return!1;let o=t.scope,s=t.subscript;if(s&&mr(W(s,{environment:i,scope:o,state:n,next:void 0}),W(s,{environment:i,scope:o,state:r,next:void 0})))return!1;let c=W(t.expression,{environment:i,scope:o,state:n,next:r});if(typeof c!=`boolean`)throw new e.b(`Encountered an action predicate that's not a boolean.`);return c}case`Not`:return!o(t.body);case`And`:return t.operands.every(o);case`Or`:return t.operands.some(o);case`Next`:return wx(t.body,r??n,void 0,i,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new e.b(`TLC cannot evaluate a temporal formula in a single step`)}},Tx=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>Tx(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return wx(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Ex=`UnnamedAction`,Dx={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},Ox=e=>{let t=e.range??Dx;return Fr([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},kx=(e,t)=>{let n=[[`name`,e.name],[`location`,Ox(e.location)]];return e.parameters.length>0&&n.push([`context`,Fr(e.parameters)],[`parameters`,Pr(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),Fr(n)},Ax=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),jx=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Mx=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,Nx=e=>e.kind===`Apply`?e.args:[],Px=(e,t,n)=>{let r=Mx(e);if(r===void 0)return;if(O(e)){let e=_h(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=sg(r,n);return i?.kind===`Closure`?i:void 0},Fx=(t,n)=>{try{return W(t,jx(n,void 0)),!0}catch(t){if(t instanceof e.y)return!1;throw t}},Ix=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&gu(e,t)&&Fx(e.body,t),Lx=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&Ix(e,t),Rx=(e,t)=>{let n=Oh(e.name,t);return n?.body===e.body&&Lx(n,t)},zx=(e,t)=>{if(e.kind!==`Identifier`||!O(e))return;let n=_h(t,e.name);return n?.kind===`Thunk`?n:void 0},Bx=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:wg(e.definitions,jx(n,t))};let r=zx(e,t);return r&&{expression:r.expression,scope:r.scope}},Vx=(e,t)=>(e?.params??[]).flatMap(e=>{let n=_h(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Hx=(t,n)=>{try{return t()}catch(t){if(t instanceof e.y)return n();throw t}},Ux=(e,t,n,r,i)=>{let a=Nx(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return r&&a.length===0?[{...e,parameters:[],expression:r.body,scope:r.scope}]:r?a.some(e=>yx(e,n,i)!==0)?o():Hx(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,jx(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},Wx=(t,n,r,i,a)=>{let o=()=>({name:r?.name??Ex,location:t.location,parameters:Vx(r,n),expression:t,scope:n});if(Ip.has(t.kind))throw e.it(new e.b(`${e.G}The next state relation is not a boolean expression.\n${oh(t)}`),e.tt.error);switch(t.kind){case`Let`:return Wx(t.body,wg(t.definitions,jx(i,n)),r,i,a);case`Label`:return Wx(t.body,n,r,i,a);case`Or`:return t.operands.flatMap(e=>Wx(e,n,r,i,a));case`Exists`:return Hx(()=>{let e=[];return Bh(t.bounds,jx(i,n),n=>(e.push(...Wx(t.body,n,r,i,a)),!1)),e.length===0?[o()]:e},()=>[o()])}let s=O(t)?void 0:a.get(Mx(t)??``),c=Px(t,n,i);if(s)return Ux(s,t,n,c,i);if(!c)return[o()];let l=Nx(t),u=O(t)?c.name:i.instanceNames.get(Mx(t)??``)??c.name,d=()=>[{name:u,location:t.location,parameters:[],expression:t,scope:n}];return Rx(c,i)||l.some(e=>yx(e,n,i)!==0)?d():Hx(()=>{let e=l.reduce((e,t,r)=>({name:c.params[r].name,binding:{kind:`Value`,value:W(t,jx(i,n))},parent:e}),c.scope);return Wx(c.body,e,{...c,name:u},i,a)},d)},Gx=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>Gx(e,t,n,r,i,o),s=(e,t,n)=>Ax(e,Rc(t,a),n),c=Bx(e,t,n);if(c){o(c.expression,c.scope);return}let l=Px(e,t,n);if(l&&Rx(l,n))return;let u=l?[...a,...Lc.get(l.body)??[]]:a;if(l&&l.params.length===0){if(yx(l.body,l.scope,n)===1){r.inits.push(s(l.name,l.body,l.scope));return}o(l.body,l.scope,u);return}if(l&&e.kind===`Apply`&&l.params.length===e.args.length){o(l.body,bg(l,e.args,jx(n,t)),u);return}if(e.kind===`And`){e.operands.forEach(e=>o(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t,frames:a});return}r.temporals.push(s(Ex,e,t));return}let d=yx(e,t,n);d<=1?r.inits.push(s(Ex,e,t)):d===3&&r.temporals.push(s(Ex,e,t))},Kx=(e,t,n,r,i)=>{let a=(t,n)=>Kx(e,t,n,r,i),o=Bx(t,n,r);if(o){a(o.expression,o.scope);return}let s=Px(t,n,r);if(s&&Rx(s,r))return;if(s&&s.params.length===Nx(t).length){a(s.body,t.kind===`Apply`?bg(s,t.args,jx(r,n)):s.scope);return}if(t.kind===`Forall`&&Hx(()=>(Bh(t.bounds,jx(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(Ax(e,a)):yx(a,n,r)<2?i.invariants.push(Ax(e,a)):i.impliedTemporals.push(Ax(e,t));return}let c=yx(t,n,r);c<=1?i.impliedInits.push(Ax(e,t)):c===3&&i.impliedTemporals.push(Ax(e,t))},qx=(e,t)=>{let n=Oh(e,t);return n?.kind===`Operator`&&!Lx(n,t)?n:void 0},Jx=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:qx(e.specification,t);a&&(Gx(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:Ex,location:e.frames[0].location,parameters:[],expression:Rc(e.expression,e.frames),scope:e.scope}]:Wx(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:sg(e.init,t);o?.kind===`Closure`&&r.inits.push(Ax(e.init??``,o.body));let s=e.next===void 0?void 0:sg(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Wx(s.body,s.scope,s,t,n)),r},Yx=(e,t,n)=>{let r=[],i=(e,t)=>{if(e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`)return!1;if(e.kind===`Tuple`)return e.elements.every(e=>i(e,t));if(e.kind===`Label`)return i(e.body,t);let a=Bx(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&O(e)?_h(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!O(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=Px(e,t,n);if(!s||s.params.length!==Nx(e).length)return!0;let c=Oh(s.name,n);return c?.body===s.body&&Ix(c,n)?!0:i(s.body,e.kind===`Apply`?bg(s,e.args,jx(n,t)):s.scope)};return i(e,t)?r:void 0},Xx=(e,t,n)=>Jx(e,t,n).inits,Zx=(e,t,n)=>Jx(e,t,n).actions,Qx=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>L(e[1])).join(`,`)})`,$x=(t,n,r=!1)=>`${t.name===Ex?r?`Initial predicate`:`Action`:t.name}${n===`1.7.4`?``:Qx(t)} ${e.X(t.location.range??Dx)}`,eS=e=>`${e.name}${Qx(e)}`,tS=(e,t,n,r)=>{let i=Jx(e,t,r);e.invariants.forEach(e=>{let n=qx(e,t);n&&i.invariants.push(Ax(e,n.body))}),e.properties.forEach(e=>{let n=qx(e,t);n&&Kx(e,n.body,void 0,t,i)});let a=t.coverage,o=(e,t)=>_r(e.map(e=>{let n=a&&t&&xo(a,t,e.expression);return kx(e,n&&Fr(n))})),s=e=>_r(e.flatMap(e=>{let n=qx(e,t);return n?[Fr([[`name`,n.name],[`location`,Ox(n.location)]])]:[]}));return Fr([[`inits`,o(i.inits,`init`)],[`actions`,o(i.actions,`next`)],[`temporals`,o(i.temporals)],[`invariants`,o(i.invariants,`invariant`)],[`impliedinits`,o(i.impliedInits,`implied`)],[`impliedactions`,o(i.impliedActions,`implied`)],[`impliedtemporals`,o(i.impliedTemporals)],[`variables`,_r(t.variables.map((e,t)=>Fr([[`name`,e],[`location`,Ox(n[t])],...a?[[`coverage`,Fr([[`distinct`,co(a,t)]])]]:[]])))],[`actionconstraints`,s(e.actionConstraints)],[`constraints`,s(e.constraints)]])},nS=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),rS=(e,t)=>{let n=/* @__PURE__ */ new Map;return(/* @__PURE__ */ new Set([...e.keys(),...t.keys()])).forEach(r=>{let i=e.get(r),a=i?t.get(i.name)??i:t.get(r);a&&a.name!==r&&n.set(r,a)}),n},iS=t=>e.it(new e.b(`${e.G}${t}`),e.tt.error),aS=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!M(e)||!M(i))throw iS(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},oS=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${sS(t)}`:n},sS=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Number`)return e.text??String(e.value);if(e.kind===`SetEnumeration`)return`{${e.elements.map(sS).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${oS(e.pattern,e.set)}:${sS(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(sS).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${sS(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>oS(e.pattern,e.set)).join(`,`)}|->${sS(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(sS);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},cS=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,lS=(t,n,r)=>{let i=n.definitions.get(t);if(i===void 0&&!n.constants.has(t))throw new e._(`The symmetry function ${t} specified in the configuration file\nis not defined in the specification.`);if(i?.kind!==`Operator`||i.params.length>0)throw iS(`The symmetry function ${t} must specify a set of permutations.`);let a=e=>W(e,{environment:n,scope:void 0,state:void 0,next:void 0}),o=a(i.body);if(!j(o)||!N(o))throw iS(`The symmetry operator must specify a set of functions.`);let s=P(o).elements;if(!s.every(jt))throw iS(`The symmetry values must be function records.`);let c=i.body,l=c.kind===`Apply`?c.args:c.kind===`SetEnumeration`?c.elements:[],u=new Map(r.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),d=e=>{if(e.length===0)return;let t=e.map(e=>{let t=sS(cS(e)?e.args[0]:e);return u.get(t)??t}),r=e.length>1;n.runtime.warn(Ge.symmetrySetTooSmall,`The set${r?`s`:``} ${t.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(l.length>=s.length){d(l);return}let f=/* @__PURE__ */ new Map;s.map(aS).forEach(e=>{e.size>0&&f.set(nS(e),e)});let p=[...f.values()],m=0;for(;m<f.size;){let e=[...f.values()],t=e.length;p.forEach(n=>e.slice(m,t).forEach(e=>{let t=rS(n,e),r=nS(t);t.size>0&&!f.has(r)&&f.set(r,t)})),m=t}let h=new Set([...f.values()].flatMap(e=>[...e.values()].map(e=>e.name))),g=new Set(r.map(e=>e.name));if(d(l.filter(e=>{if(!cS(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||g.has(t.name))return!1;let n=a(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>M(e)&&h.has(e.name))})),f.size!==0)return[...f.values()]},uS=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=fS(r,t);if(i===r)continue;let a=e.slice(0,n);a.push(i);for(let r=n+1;r<e.length;r++)a.push(fS(e[r],t));return a}},dS=(e,t)=>{let n=[],r=[];for(let i of e){let e=fS(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(gn);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(gn(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},fS=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=dS(e.elements,t);return n?xn(n):e}if(n===`Function`||n===`LazyFunction`&&N(e.domain)){let n=I(e),r=uS(n.domain,t),i=uS(n.range,t)??n.range;if(r){let e=Cr(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Cn(n.domain,e.range):e}return i===n.range?n:Cn(n.domain,i)}if(n===`Interval`||!j(e)||!N(e))return e;let r=P(e),i=uS(r.elements,t);return i?_r(i):r},pS=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=fS(e[o],i),a===0&&(a=gn(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},mS={line:0,column:0},hS=e=>({kind:`Identifier`,name:e,location:mS}),gS=/* @__PURE__ */ new Set([`name`,`property`]),_S=(t,n,r)=>{let i=Oh(n,r);if(!i)throw new e._(`The ${t} ${n} specified in the configuration file\nis not defined in the specification.`);if(i.kind===`Operator`&&i.params.length>0)throw new e._(gS.has(t)?`TLC requires ${n} not to take any argument.`:`TLC requires ${t} not to take any argument, but one was given: ${n}`);return i},vS=e=>e.body.kind===`Number`||e.body.kind===`String`,yS=(t,n,r)=>{if(r.constants.has(t))return r.constants.get(t);if(gu(n,r)&&!vS(n))try{return W(hS(t),US(r,void 0,void 0))}catch(t){if(t instanceof e.b||e.et(t))return;throw t}},bS=(t,n,r)=>{if(r.constants.has(n))throw new e._(`The ${t} ${n} cannot be a constant.`);let i=_S(t,n,r);if(yS(n,i,r)!==void 0)throw new e._(`The ${t} ${n} cannot be a constant.`);return i},xS=(t,n,r)=>{let i=r.constants.has(n)?void 0:_S(t,n,r),a=i?yS(n,i,r):r.constants.get(n);if(a!==void 0&&a!==!0)throw new e._(`The ${t} of ${n} is equal to ${L(a)}`);return a===void 0?i:void 0},SS=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},CS=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),rg(e.startupDefinitions,r),t.invariants.forEach(e=>{xS(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},wS=(t,n)=>{let r=Zl({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>n.definitions.get(e)});return t.flatMap(t=>{let i=xS(`invariant`,t,n);if(!i)return[];let a=r.analyzeDefinition(i,/* @__PURE__ */ new Map);if(a.level>=2){let n=a.params.size===0?``:`
1780
+ `]]),Of=(e=`master`)=>e===`1.7.4`?Df:Ef,kf=(e,t)=>e.every(e=>gi(e,t)),Af=vr([!1,!0]);pr(Af);const jf=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Cr(jf(e,t,r),jf(e,r,n))},Mf=[`\\cup`,`\\cap`,`\\`],Nf=e=>typeof e==`object`&&e.kind===`MixedSet`,Pf=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,Ff=(e,t,n)=>{t.kind===`Interval`&&oi(t);let r=t.kind===`Interval`?t:fr(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return At(r,e=>{gi(e,n)===i&&Ot(a,e)}),Pf(t)?Cn(a):yr(a)}if(P(t))return n;if(!jt(n))return jn({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return At(r,e=>Ot(i,e)),At(n.kind===`Interval`?n:N(n).elements,e=>{gi(e,t)||Ot(i,e)}),yr(i)},If=(e,t)=>{let n=(t,n)=>Do([Xo(t,n,e)()],0,e);return{...R(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},Lf=[ko(`TRUE`,!0),ko(`FALSE`,!1),ko(`BOOLEAN`,Af),ko(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Mo(`=`,hr),Mo(`#`,(e,t)=>!hr(e,t)),R(`~`,1,e=>!Do(e,0,`~`)),R(`<=>`,2,e=>Do(e,0,`<=>`)===Do(e,1,`<=>`)),If(`/\\`,(e,t)=>e&&t()),If(`\\/`,(e,t)=>e||t()),If(`=>`,(e,t)=>!e||t()),R(`\\in`,2,e=>gi(L(e,0,`\\in`),L(e,1,`\\in`))),R(`\\notin`,2,e=>!gi(L(e,0,`\\notin`),L(e,1,`\\notin`))),Mo(`\\subseteq`,(t,n)=>{if(!A(t))throw new e.b(`\\subseteq expects a set but received ${I(t)}`);if(typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&M(t.base))return kf(N(t.base).elements,n.base);if(typeof t==`object`&&t.kind===`Interval`){if(typeof n==`object`&&n.kind===`Interval`&&n.low<=t.low&&n.high>=t.high)return!0;for(let e=t.low;e<=t.high;e++)if(!gi(e,n))return!1;return!0}return!Qr(t,e=>!gi(e,n))}),...Mf.map(t=>R(t,2,n=>{let r=L(n,0,t),i=L(n,1,t),a=t!==`\\cup`&&typeof i==`object`&&i.kind===`Interval`&&typeof r==`object`&&r.kind!==`Interval`;if(jt(r)&&jt(i)&&!Nf(r)&&!Nf(i)&&!a&&!kt(r)&&!kt(i)){if(t===`\\cup`&&P(r))return i;let n=t===`\\cup`?Cr:t===`\\cap`?Sr:xr;return mi((r,i)=>{let a=N(r),o=N(i),s=n(a,o);if(t===`\\cup`){let t=fr(a),n=xr(o,a).elements,r=t===a.elements&&(n.length===0||_n(t[t.length-1],n[0])<0);if(t.length+n.length>Et())throw new e.N(Dt());if(r&&!a.isNormalized)return s;let i=s===a?Sn(s.elements):s;return r||(i.writtenElements=[...t,...n]),i}return s===r||(s.isNormalized=Pf(r),a.writtenElements&&!a.isNormalized&&(s.writtenElements=a.writtenElements.filter(e=>gi(e,s)))),s},(e,n)=>Ff(t,e,n),r,i)}return jt(r)?Ff(t,r,i):t!==`\\`&&jt(i)?Ff(t,i,r):jn({kind:`SetOperation`,operator:t,left:r,right:i})})),R(`SUBSET`,1,e=>({kind:`Subset`,base:L(e,0,`SUBSET`)})),R(`UNION`,1,e=>{let t=L(e,0,`UNION`),n=Nt(t)?fr(t):[],r=n.filter(Nt);if(!Nt(t)||r.length!==n.length)return jn({kind:`Union`,base:t});let i=r.flatMap(fr),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{gi(t,e)||Ot(e.elements,t)}),yr(e.elements)};return Nf(t)||r.some(Nf)?a():r.length===0?br:mi(e=>ui(jf(e,0,e.length),i),a,r.map(N),void 0)}),R(`DOMAIN`,1,t=>{let n=L(t,0,`DOMAIN`);if(!Mt(n))throw new e.b(`DOMAIN expects a function but received ${I(n)}`);return Fi(n)})],Rf=Go(`Integers`,`Neg`,`IntValue`,1),zf=t=>{let n=Go(t,`DotDot`,`IntervalValue`,2);return[Ko(t,`+`,`Plus`,(e,t)=>e+t),Ko(t,`-`,`Minus`,(e,t)=>e-t),Ko(t,`*`,`Times`,(e,t)=>e*t),Ko(t,`^`,`Expt`,(t,n)=>{if(n<0)throw new e.O(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(t===0&&n===0)throw new e.O(`0^0 is undefined.`);return t**n}),Ko(t,`\\div`,`Divide`,(t,n)=>{if(n===0)throw new e.O(`The second argument of \\div is 0.`);let r=Math.floor(t/n);if(No(r))throw Po(`${t} \\div ${n}`);return r}),Ko(t,`%`,`Mod`,(t,n)=>{if(n<=0)throw new e.O(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(t%n+n)%n}),R(`..`,2,e=>{let t=L(e,0,`..`),r=Wo(L(e,1,`..`),n);return{kind:`Interval`,low:Wo(t,n),high:r}})]},Bf=zf(`Naturals`),Vf=zf(`Integers`),Hf=e=>{let t=Bf.indexOf(e);return t===-1?void 0:Vf[t]},Uf=e=>{let t=(t,n=`tlc2.value.IBoolValue`)=>`public static ${n} tlc2.module.${e}.${t}(tlc2.value.impl.Value,tlc2.value.impl.Value)`,n=e===`Integers`;return[Uo(Jo(`<`,(e,t)=>e<t),t(`LT`)),Uo(Jo(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),Uo(Jo(`<=`,(e,t)=>e<=t),t(`LE`)),Uo(Jo(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},Wf=[ko(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Bf,...Uf(`Naturals`)],Gf=[ko(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Vf,...Uf(`Integers`),R(`-.`,1,e=>{let t=Wo(L(e,0,`-`),Rf);if(No(-t))throw Po(`-${t}`);return-t})],Kf=(t,n,r)=>{let i=L(t,n,r),a=di(i);if(!a)throw new e.O(`${r}\n${I(i)}`);return a},qf=(e,t,n)=>{let r=L(e,t,n);return typeof r==`string`?r:Kf(e,t,n)},Jf=(e,t,n)=>{let r=L(e,t,`SubSeq`);if(typeof r!=`number`)throw wo(n,`SubSeq`,`natural number`,r);return r},Yf=(e,t,n)=>typeof e==`string`?sn(e.slice(t,n)):Fr(e.slice(t,n)),Xf=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Zf=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Qf=(e,t)=>{let n=wf.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Uo(e,t):e}):t},$f=t=>Qf(`Sequences`,[R(`Seq`,1,e=>({kind:`SequenceSet`,base:L(e,0,`Seq`)})),R(`Len`,1,e=>qf(e,0,Xf(``,`Len`)).length),R(`\\o`,2,t=>{let n=qf(t,0,Zf(`s \\o t`,`sequence`));if(typeof n!=`string`){let e=Kf(t,1,Zf(`t \\o s`,`sequence`));return Fr([...n,...e])}let r=L(t,1,`\\o`);if(typeof r!=`string`)throw new e.O(`${Zf(`t \\o s`,`string`)}\n${I(r)}`);return sn(n+r)}),R(`Append`,2,e=>Fr([...Kf(e,0,Zf(t===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),L(e,1,`Append`)])),R(`Head`,1,t=>{let n=Kf(t,0,Xf(``,`Head`));if(n.length===0)throw new e.O(`Attempted to apply Head to the empty sequence.`);return n[0]}),R(`Tail`,1,t=>{let n=qf(t,0,Xf(``,`Tail`));if(n.length===0)throw new e.O(`Attempted to apply Tail to the empty sequence.`);return Yf(n,1)}),R(`SubSeq`,3,t=>{let n=qf(t,0,Xf(`first `,`SubSeq`)),r=Jf(t,1,`second`),i=Jf(t,2,`third`);if(r>i)return Yf(n,0,0);let a=r<1||r>n.length?{position:`second`,value:r}:i>n.length?{position:`third`,value:i}:void 0;if(a)throw new e.O(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${I(L(t,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return Yf(n,r-1,i)}),Ao(`SelectSeq`,2,t=>{let n=Oo(t,1,`SelectSeq`);return Fr(Kf(t,0,Xf(`first `,`SelectSeq`)).filter(t=>{let r=n.call([t]);if(typeof r!=`boolean`)throw new e.O(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${n.name}>`);return r}))})]),ep=t=>Qf(`FiniteSets`,[R(`IsFiniteSet`,1,t=>{let n=L(t,0,`IsFiniteSet`);if(A(n))return ci(n);if(typeof n==`object`&&n.kind===`Function`)return!0;throw new e.b(typeof n==`object`&&n.kind===`LazyFunction`?`Attempted to check if the function:\n${I(n)}\nis a finite set.`:`Attempted to check if the ${Pt(n)} ${I(n)} is a finite set.`)}),R(`Cardinality`,1,n=>{let r=L(n,0,`Cardinality`);if(!A(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new e.O(`Attempted to compute cardinality of the value\n${I(r)}`);return oi(r,t)})]),tp=[Uo(R(`Warshall`,1,t=>{let n=L(t,0,`Warshall`);if(!A(n)||un(n))throw new e.O(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${I(n)}`);oi(n);let r=[],i=/* @__PURE__ */ new Map,a=e=>{let t=ea(e),n=i.get(t)??r.length;return n===r.length&&(i.set(t,n),r.push(e)),n},o=N(n).elements.map(t=>{let n=di(t);if(n?.length!==2)throw new e.O(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${I(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 yr(r.flatMap((e,t)=>r.flatMap((n,r)=>s[t][r]?[Fr([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],np=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return tp;if(e===`AnySet`)return[ko(`ANY`,mn)];if(e===`IOUtils`)return pd(r,a);if(e===`_TLCTrace`)return gd(r);if(!Of(n.version).has(e))return;let o=ip(e,t,n,r,i)?.operators;return e===`Randomization`&&o?[...o,Hd(n)]:o},rp=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),ip=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:Wf};case`Integers`:return{extends:[`Naturals`],operators:Gf};case`Sequences`:return{extends:[],operators:$f(n.version)};case`FiniteSets`:return{extends:[],operators:ep(n.version)};case`TLC`:return{extends:[],operators:Qf(`TLC`,_f(t,n))};case`Randomization`:return{extends:[],operators:Ud(n)};case`_Possible`:return{extends:[],operators:rf(t,n)};case`Json`:return{extends:[],operators:fd(r)};case`Bags`:return{extends:[],operators:Qf(`Bags`,Ru(i))};case`TLCExt`:return{extends:[],operators:Qf(`TLCExt`,nf(t,n))};default:return}},ap=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&Lc.get(t)||[];r.expressions.push(...i,t);let a=pi.sets,o=a??[],s=o.length;pi.sets=o;try{return n()}catch(e){throw Pg(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,pi.sets=a}},op=(e,t,n)=>e.coverage?no(e.coverage,t,n):-1,sp=(e,t,n)=>e.coverage?io(e.coverage,t,n):n(),cp=(e,t,n,r)=>sp(e,t,()=>U(n,r)),lp=(e,t,n,r)=>{let i=cp(e,t,n,r),a=e.coverage;if(a?.covered.has(n))for(let e=t;e!==-1;e=a.prefixes[e])a.primary[e]--;return i},up=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},dp=e=>!e.includes(void 0),fp=e=>e.variables.map(()=>void 0),pp=(e,t,n)=>{let r=[...e];return r[t]=n,r},mp=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},hp=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,gp=e=>e.kind===`Identifier`?e.name:void 0,_p=(e,t,n)=>{if(t.kind===`Label`)return _p(e,t.body,n);let r=gp(t);if(r===void 0)return;let i=vh(n,r);if(i?.kind===`Thunk`)return _p(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=cg(r,e);return o?.kind===`Closure`&&o.params.length===0?_p(e,o.body,o.scope):void 0},vp=(e,t,n)=>{if(t.kind===`Prime`)return _p(e,t.expression,n);if(t.kind===`Label`)return vp(e,t.body,n);let r=gp(t);if(r===void 0)return;let i=vh(n,r);if(i?.kind===`Thunk`)return vp(e,i.expression,i.scope);if(i)return;let a=cg(r,e);return a?.kind===`Closure`&&a.params.length===0?vp(e,a.body,a.scope):void 0},yp=t=>{if(typeof t!=`boolean`)throw new e.b(`TLC expected a boolean expression.`);return t},bp=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),xp=(e,t,n,r)=>{let i=Cp(e,t,n,r);return i&&e.coverage&&!e.isInit&&ro(e.coverage,r),i},Sp=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(ro(r,n),ro(r,r.roots[n])),e.onState(t),!0},Cp=(e,t,n,r)=>t===void 0?dp(n)?Sp(e,n,r):(e.onIncomplete?.(n),!1):dp(n)&&bp(e)?Tp(e,t,n,r):t.kind===`Predicate`?Ep(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?Hp(e,t.expression,t.rest,t.scope,n,t.node):wp(e,t,n)&&xp(e,t.rest,n,t.node),wp=(e,t,n)=>{let r=e.environment,i=cp(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return cp(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?_h(t,r.runtime.version):t}})();try{return!hr(i,a)}catch(t){throw e.callStack&&Pg(e.callStack,[i],t),t}},Tp=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return Hp(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?wp(e,i,n):yp(cp(e,i.node,i.expression,up(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return Sp(e,n,r)},Ep=(e,t,n,r,i,a)=>Dp(e,t,n,r,i,op(e,a,t)),Dp=(t,n,r,i,a,o)=>ap(t,n,()=>{switch(n.kind){case`Let`:{let e=up(t,i,a),s=n.definitions,c=t.coverage?Tg(s,e,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):Tg(s,e);return Ep(t,n.body,r,c,a,o)}case`Label`:return Ep(t,n.body,r,i,a,o);default:if(Ip.has(n.kind))throw new e.b(`The state relation is not a boolean expression.`);return ap(t,n,()=>Bp(t,n,r,i,a,o))}}),Op=(e,t,n,r,i)=>yp(t)&&xp(e,n,r,i),kp=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),Ap=(e,t,n,r,i,a)=>{let o=up(e,r,i);if(t.kind===`Identifier`){let s=vh(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return Ep(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return Ep(e,s.operator.body,n,s.operator.scope,i,a);let c=s?void 0:e.environment.definitions.get(t.name),l=s?void 0:cg(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&gu(c,e.environment))?Ep(e,l.body,n,l.scope,i,a):Op(e,lp(e,a,t,o),n,i,a)}let s=lg(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=sp(e,a,()=>xg(s,t.args,o));return Ep(e,s.body,n,r,i,a)}let c=kp.has(t.operator)?cp(e,a,t,o):lp(e,a,t,o);return Op(e,c,n,i,a)},jp=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?xp(e,t,pp(n,r,i),a):hr(o,i)&&xp(e,t,n,a)},Mp=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),Np=(e,t,n)=>(e.coverage&&ao(e.coverage,t,n.length+1),n),Pp=(t,n,r,i,a,o)=>{let[s,c]=n.args,l=t.isInit?_p(t.environment,s,i):vp(t.environment,s,i),u=up(t,i,a);if(l===void 0)return cp(t,o,n,u)===!0&&xp(t,r,a,o);let d=cp(t,o,c,u),f=a[l];if(n.operator===`=`)return jp(t,r,a,l,d,o);let p=n.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(typeof p==`object`&&p!==d&&t.callStack?.sources.set(p,c),f!==void 0)return cp(t,o,n,u)===!0&&xp(t,r,a,o);if(!Rr(p))throw new e.b(`The right side of \\IN is not enumerable.`);return Np(t,p,$r(p)).reduce((e,n)=>xp(t,r,pp(a,l,n),o)||e,!1)},Fp=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Ip=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Lp={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},Rp=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:Lp[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${V(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${V(e)}`:`In computing ENABLED, TLC encountered unbounded quantifier. Make sure that the expression is of form ${e.quantifier===`Forall`?`\\A`:`\\E`} x \\in S: P(x).\n${V(e)}`;if(e.kind===`Choose`&&e.set===void 0)return`In computing ENABLED, TLC encountered unbounded CHOOSE. Make sure that the expression is of form CHOOSE x \\in S: P(x).\n${V(e)}`},zp=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=sp(e,r,()=>Rh(t.bounds,t=>{let r=U(t,n),i=Fh(r,t,a);return Array.isArray(i)&&Np(e,r,i),i}));return Bh(t.bounds,o,n.scope,e=>(i.push(e),!1)),i},Bp=(t,n,r,i,a,o)=>{let s=up(t,i,a);switch(n.kind){case`Identifier`:return Ap(t,n,r,i,a,o);case`Apply`:return Fp.has(n.operator)&&n.args.length===2?Pp(t,n,r,i,a,o):n.operator===`=>`&&n.args.length===2?yp(cp(t,o,n.args[0],s))?Ep(t,n.args[1],r,i,a,o):xp(t,r,a,o):Ap(t,n,r,i,a,o);case`And`:{let e=n.operands;if(n.isBulleted||e.length===2){let n=e.slice(1).reduceRight((e,t)=>Mp(`Predicate`,t,i,o,e),r);return Ep(t,e[0],n,i,a,o)}let s=e[e.length-1];return Dp(t,mp(n,e.length-1),Mp(`Predicate`,s,i,o,r),i,a,hp(t,o))}case`Or`:{let e=n.operands;if(n.isBulleted||e.length===2)return e.reduce((e,n)=>Ep(t,n,r,i,a,o)||e,!1);let s=Dp(t,mp(n,e.length-1),r,i,a,hp(t,o)),c=Ep(t,e[e.length-1],r,i,a,o);return s||c}case`Exists`:return zp(t,n,s,o).reduce((e,i)=>Ep(t,n.body,r,i,a,o)||e,!1);case`Forall`:{let e=zp(t,n,s,o);if(e.length===0)return xp(t,r,a,o);let i=e.slice(1).reduce((e,t)=>Mp(`Predicate`,n.body,t,o,e),r);return Ep(t,n.body,i,e[0],a,o)}case`If`:return Ep(t,yp(cp(t,o,n.condition,s))?n.consequent:n.alternative,r,i,a,o);case`Case`:{let c=n.arms.find(e=>yp(cp(t,o,e.condition,s)))?.body??n.other;if(c===void 0)throw new e.b(`TLC encountered a CASE with no conditions true.`);return Ep(t,c,r,i,a,o)}case`FunctionApplication`:{let e=Kh(cp(t,o,n.function,t.isInit?s:Sh(s)));if(e){let i=sp(t,o,()=>qh(e,n,s));return Ep(t,e.body,r,i,a,o)}break}case`Unchanged`:if(!t.isInit)return Hp(t,n.expression,r,i,a,o);break;case`BoxAction`:if(!t.isInit){let e=Ep(t,n.action,r,i,a,o);return Hp(t,n.subscript,r,i,a,o)||e}break;case`AngleAction`:if(!t.isInit)return Ep(t,n.action,Mp(`Changed`,n.subscript,i,o,r),i,a,o)}let c=t.isEnabled?Rp(n):void 0;if(c!==void 0)throw new e.b(c);return Op(t,cp(t,o,n,s),r,a,o)},Vp=(e,t,n)=>e.runtime.warn(Ke.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${V(n)}`),Hp=(e,t,n,r,i,a)=>ap(e,t,()=>{let o=op(e,a,t),s=_p(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;let a=i[s];return a!==void 0&&!hr(a,r)?(Vp(e.environment,s,t),!1):jp(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return xp(e,n,i,o);let c=s.reduceRight((e,t)=>Mp(`Unchanged`,t,r,o,e),n);return Hp(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=vh(r,t.name);if(a?.kind===`Thunk`)return Hp(e,a.expression,n,a.scope,i,o);let s=a?void 0:cg(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return Hp(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=up(e,r,i),s=lg(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return Hp(e,s.body,n,xg(s,t.args,a),i,o)}let c=e.environment,l=cp(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=cp(e,o,t,{environment:c,scope:r,state:i,next:void 0});return hr(l,u)&&xp(e,n,i,o)}),Up=(e,t,n,r,i=!1,a)=>({environment:e,callStack:e.callStack,coverage:e.coverage,isInit:t,isEnabled:i,current:n,onState:r,onIncomplete:a}),Wp=/* @__PURE__ */ Error(`The replay found a successor`),Gp=(e,t,n,r)=>{let i=Up(r,!1,n,()=>{throw Wp},!0),a=i.callStack,o=a?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Mp(`Changed`,e.subscript,t,-1,void 0);Ep(i,e.action,n,t,fp(r),-1)}else Ep(i,e,void 0,t,fp(r),-1);return!1}catch(e){if(e!==Wp)throw e;return a&&(a.expressions.length=o,a.isFrozen=!1),!0}},Kp=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=Up(t,!0,void 0,n,!1,r),s=a.reduceRight((e,t)=>Mp(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);Ep(o,i.expression,s,i.scope,fp(t),i.node??-1)},qp=(e,t,n,r)=>{e.some(e=>Ip.has(e.expression.kind))||e.forEach(e=>{let i=[];Jp(e,-1,t,n,e=>i.push(e)),i.forEach(t=>r(t,e))})},Jp=(e,t,n,r,i,a)=>{let o=Up(r,!1,n,i,!1,a);Ep(o,e.expression,void 0,e.scope,fp(r),t)},Yp=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(_p(t,e,void 0)!==void 0&&e.kind===`Identifier`){n.push(e);return}if(e.kind===`Tuple`){e.elements.forEach(e=>i(e,r));return}if(e.kind!==`Identifier`)return;let a=vh(r,e.name)?void 0:cg(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,Tg(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`FunctionApplication`:a(e.function,o,s);return;case`If`:a(e.consequent,o,s),a(e.alternative,o,s);return;case`Case`:e.arms.forEach(e=>a(e.body,o,s)),e.other&&a(e.other,o,s);return;case`And`:case`Or`:e.operands.forEach(e=>a(e,o,s));return;case`Exists`:case`Forall`:a(e.body,o,s);return;case`Unchanged`:i(e.expression,o);return;case`AngleAction`:a(e.action,o,s);return;case`BoxAction`:a(e.action,o,s),n.push(e.subscript);return;case`Identifier`:case`Apply`:{if(e.kind===`Apply`){if(e.operator===`=>`){e.args.forEach(e=>a(e,o,s));return}if(e.operator===`=`||e.operator===`\\in`){vp(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=vh(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?lg(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:cg(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,xg(l,u,r(o)),s),s.delete(l.body)}}};return e.forEach(e=>a(e.expression,e.scope,/* @__PURE__ */ new Set)),n.flatMap(e=>e.location.range??[])},Xp=/* @__PURE__ */ new WeakMap,Zp=/* @__PURE__ */ new WeakMap,Qp=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},$p=(e,t,n)=>{let r=e.slice();return r[t]=n,r},em=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,tm=(t,n)=>{let r=new e.b(n);return t.isInit?r:e.it(r,e.tt.error)},nm=(e,t,n,r)=>{let i=sh(n);return r&&Ip.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${em(e)}, TLC expected a boolean expression,\nbut instead found ${I(t)}.\n${i}`},rm=(e,t,n)=>{let r=Bo(t),i=V(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${em(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
1781
+ `:``}${i}`},im=(e,t,n)=>sm(e,t,U(t,n)),am=new Set(Lf.map(e=>e.name)),om=e=>e.kind===`Apply`?am.has(e.operator):e.kind!==`Identifier`&&!Ip.has(e.kind),sm=(t,n,r,i=!0)=>{if(typeof r==`boolean`)return r;let a=nm(t,r,n,i);throw t.isInit&&i&&om(n)?new e.z(a):tm(t,a)},cm=(e,t,n,r)=>r.environment.callStack?U(n,r):(e[t]??=zg(n,r.environment))(r),lm=e=>e===`=`||e===`\\in`||e===`\\subseteq`,um=(e,t,n)=>{let r=n?Xp:Zp,i=r.get(e);if(i)return i;let a=Wm(e,t,n),o=n?void 0:Um(e,t),s=o?(e,t,n,r,i,s)=>(e.generator?o:a)(e,t,n,r,i,s):a;return r.set(e,s),s},dm=(e,t)=>{if(t.constants.has(e))return;let n=kh(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},fm=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return fm(e.expression,t,!1,r);if(e.kind!==`Identifier`||O(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=dm(e.name,t);if(a&&!r.has(a))return r.add(a),fm(a.body,t,n,r)},pm=(e,t,n)=>fm(e,t,!n),mm=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return mm(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Tg(e.definitions,Qp(r,t,n));return mm(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=vh(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return mm(a.expression,a.scope,n,r,i);if(a)return;let o=r.environment.variableIndex.get(e.name);if(o!==void 0)return i?void 0:o;let s=dm(e.name,r.environment);if(s)return mm(s.body,void 0,n,r,i)},hm=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||O(e))||!t&&e.kind===`Prime`,gm=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>gm(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[{index:r,expression:e}];let i=dm(e.name,t);if(i)return n.add(e.name),gm(i.body,t,n)},_m=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),vm=(e,t,n)=>_m.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||lm(e.operator)&&(hm(e.args[0],n)||pm(e.args[0],t,n)!==void 0)||O(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,ym=/* @__PURE__ */ new Set,bm=(e,t)=>{if(O(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Gc(e,(e,i)=>{let a=r.isReadOnly?bm(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},xm=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||O(e)?void 0:kh(r,t);return i&&!n.has(i)&&(n.add(i),xm(i.body,t,n))?!0:D(e).some(e=>xm(e,t,n))},Sm=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=pm(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=gm(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return vm(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:um(e,t,n)}},Cm=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(xu(e,t)===void 0||xm(e,t,/* @__PURE__ */ new Set))return!0;let n=bm(e,ym);return!n||n.some(e=>r.has(e))}),o=a===-1?i.length:a;if(o!==0)return{names:n,guards:i.slice(0,o),rest:i.slice(o)}},wm=(e,t,n)=>{let r=e.map(e=>Sm(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=bp(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Km(u)){d??=Qp(t,n,u);for(let e=s;e<r.length;e++){let n=r[e],i=t.current,o=i&&n.kind===`Unchanged`?n.variables.find(e=>{let t=u[e.index];return t!==void 0&&!hr(t,i[e.index])}):void 0;if(o){Vp(t.environment,o.index,o.expression);return}let s=n.expression,c=cm(a,e,s,d);if(!sm(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=Qp(t,n,u);let r=cm(i,s,e.expression,d);if(!sm(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=Qp(t,n,u);let r=cm(i,s,e.value,d),a=u[e.index];if(a===void 0)u=$p(u,e.index,r),d=void 0;else if(!hr(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(!hr(e,n[i.index])){Vp(t.environment,i.index,i.expression);return}}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},Tm=e=>{let t=Rp(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw tm(n,t);im(n,e,Qp(n,r,i))&&s(i,a)}},Em=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Qp(r,i,a);if(a[l]!==void 0){im(r,e,u)&&c(a,o);return}let d=U(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Rr(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${em(r)}, the right side of \\IN is not enumerable.`;throw tm(r,`${t}\n${V(e)}`)}let p=$r(f);if(r.generator){for(let e of Pd(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c($p(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c($p(a,l,p[e]),o)}},Dm=/* @__PURE__ */ new WeakMap,Om=e=>{let t=Dm.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Om),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Dm.set(e,n),n},km=(e,t)=>{let n=e.args[0],r=Tm(e),i=(e,r,i)=>mm(n,r,i,e,!t)??-1,a=Em(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=U(e.args[1],Qp(t,n,o));l($p(o,u,d),s)}},Am=(e,t,n)=>{let r=V(e);return(i,a,o,s,c,l)=>{let u=Qp(i,a,o),d=U(e.function,n?u:Sh(u)),f=Kh(d);if(f!==void 0){um(f.body,t,n)(i,qh(f,e,u),o,s,c,l);return}if(!Mt(d))throw tm(i,`In computing ${em(i)}, a non-function (${Bo(d)}) was applied as a function.\n${r}`);let p=U(e,u);if(typeof p!=`boolean`)throw tm(i,`In computing ${em(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},jm=(e,t)=>{if(gm(e,t))return wm([Om(e)],t,!1);if(e.kind===`Tuple`)return um(Om(e),t,!1);let n=Om(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?vh(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){um(Om(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=Qp(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=lg(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){um(Om(n.body),t,!1)(r,xg(n,e.args,u),a,o,s,c);return}}im(r,n,u)&&c(a,o)}},Mm=(e,t,n)=>{let r=e.operator,i=Tm(e),a=O(e)?void 0:cg(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Wg(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=um(a.body,t,n),o.body(e,i(Qp(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Qp(a,o,s),f=lg(e,d);f?.kind===`Closure`?um(f.body,t,n)(a,xg(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Nm=(e,t,n)=>{let r=Tm(e),i=O(e)?void 0:dm(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=vh(s,e.name);f?.kind===`Thunk`&&!f.isReleased?um(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&rg(i,t)!==void 0?r(o,s,c,l,u,d):(a.body??=um(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Pm=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||O(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!O(i))return;let a=fm(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},Fm=e=>e.kind===`And`?e.operands.flatMap(Fm):[e],Im=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&vm(e,t,!1),Lm=e=>{let t=[];return(n,r,i)=>{let a=Qp(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!sm(n,i,cm(t,r,i,a)))return}}},Rm=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=Fm(e),r=n.findIndex(e=>!Im(e,t)||Pm(e,t)),i=r===-1?void 0:Pm(n[r],t);return i?{...i,before:r===0?void 0:Lm(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>Rm(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||O(e))return;let r=cg(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Rm(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(!i||o?.kind!==`Identifier`||!O(o))return;let s=i.before,c=s&&Wg(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(Qp(e,t,n)),n))}},zm=(e,t,n)=>{let r=vh(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},Bm=(e,t,n)=>{let r=e.map(e=>um(e,t,n)),i=n?[]:e.map(e=>Rm(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&zm(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},Vm=e=>(t,n,r,i,a,o)=>{let s=t.generator;if(!s)throw Error(`A random choice needs the run's generator`);let c=Math.floor(s.nextDouble()*e.length),l=wd(s);for(let s=0;s<e.length;s++)if(e[(c+s*l)%e.length](t,n,r,i,a,o),t.successors>0||t.isStopped)return},Hm=(e,t)=>{let n=um(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=Qp(r,i,a),u=t.runtime.version,d=Rh(e.bounds,e=>U(e,l)).map((n,r)=>Pd(Nh(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,bh(i,l,e)))};f(d.length-1,i)}},Um=(e,t)=>{if(e.kind===`Exists`)return Hm(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>um(e,t,!1));return e.isBulleted?Vm(n):n.reduce((e,t)=>Vm([e,t]))},Wm=(t,n,r)=>{let i=e=>um(e,n,r);switch(t.kind){case`And`:return wm(t.operands,n,r);case`Or`:return Bm(t.operands,n,r);case`Exists`:{let e=i(t.body),a=t.bounds[0];if(t.bounds.length===1&&a.pattern.kind===`Name`){let t=a.pattern.name;return(r,i,o,s,c,l)=>{let u=Nh(U(a.set,Qp(r,i,o)),a.set,n.runtime.version);for(let n=0;n<u.length&&!r.isStopped;n++)e(r,yh(i,t,u[n]),o,s,c,l)}}let o=r?void 0:Cm(t,n);if(o){let e=wm(o.rest,n,r);return(r,i,a,s,c,l)=>{let u=Qp(r,i,a),d=Rh(t.bounds,e=>Nh(U(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=yh(n,o.names[t],e);if(t===d.length-1){let e=Qp(r,i,a);if(!o.guards.every(t=>im(r,t,e)))continue}f(t-1,i)}};f(d.length-1,i)}}return(n,r,i,a,o,s)=>{Vh(t.bounds,Qp(n,r,i),t=>(e(n,t,i,a,o,s),n.isStopped))}}case`Forall`:{let e=i(t.body),a=!r&&xu(t,n)!==void 0&&!xm(t.body,n,/* @__PURE__ */ new Set)?bm(t,ym):void 0;return(n,r,i,o,s,c)=>{let l=[];Vh(t.bounds,Qp(n,r,i),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>vh(r,e)?.kind===`Value`)){u.every(e=>im(n,t.body,Qp(n,e,i)))&&c(i,o);return}let d=(r,i,a)=>{r===u.length?c(i,a):r>0&&n.isInit&&Km(i)?u.slice(r).every(e=>im(n,t.body,Qp(n,e,i)))&&c(i,a):e(n,u[r],i,a,!0,(e,t)=>d(r+1,e,t))};d(0,i,o)}}case`If`:{let e=i(t.consequent),n=i(t.alternative);return(r,i,a,o,s,c)=>{let l=U(t.condition,Qp(r,i,a));if(typeof l!=`boolean`)throw tm(r,rm(r,l,t));(l?e:n)(r,i,a,o,s,c)}}case`Case`:{let e=t.arms.map(e=>({condition:e.condition,source:e.body,body:i(e.body)})),n=t.other?i(t.other):void 0;return(r,i,a,o,s,c)=>{let l=Qp(r,i,a),u=e.find(e=>{let t=U(e.condition,l);if(typeof t==`boolean`)return t;throw tm(r,`In computing ${em(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Bo(t)}) was used as a guard condition of a CASE.\n${sh(e.source)}`)})?.body??n;if(!u)throw tm(r,`In computing ${em(r)}, TLC encountered a CASE with no conditions true.\n${V(t)}`);u(r,i,a,o,s,c)}}case`Let`:{let e=i(t.body),r=Dg(t.definitions,n);return(n,i,a,o,s,c)=>e(n,Tg(t.definitions,Qp(n,i,a),r),a,o,s,c)}case`Unchanged`:return r?()=>{throw new e.b(`UNCHANGED appears in an initial predicate at ${rh(t)}`)}:jm(t.expression,n);case`AngleAction`:{let e=i(t.action),r={kind:`Unchanged`,expression:t.subscript,location:t.subscript.location},a=(e,t,i)=>{try{return im(e,r,Qp(e,t,i))}catch(t){throw e.isEnabled?_h(t,n.runtime.version):t}};return(t,n,r,i,o,s)=>e(t,n,r,i,o,(e,r)=>{a(t,n,e)||s(e,r)})}case`BoxAction`:return Bm([t.action,Om(t.subscript)],n,r);case`Label`:return i(t.body);case`Identifier`:return Nm(t,n,r);case`FunctionApplication`:return Am(t,n,r);case`Apply`:{let e=t.args;if(lm(t.operator)){let i=pm(e[0],n,r);if(i!==void 0)return t.operator===`=`?wm([t],n,r):Em(t,()=>i);if(hm(e[0],r))return km(t,r)}if(t.operator===`=>`){let n=i(e[1]);return(r,i,a,o,s,c)=>{let l=U(e[0],Qp(r,i,a));if(typeof l!=`boolean`){let e=Bo(l),n=V(t);throw tm(r,r.isInit?`In computing initial states of a predicate of form P => Q, P was ${e}\n.${n}`:r.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${e}.\n${n}`:`In computing next states of a predicate of the form P => Q, P was\n${e}.\n${n}`)}l?n(r,i,a,o,s,c):c(a,o)}}return Mm(t,n,r)}default:return Tm(t)}},Gm=e=>e.variables.map(()=>void 0),Km=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},qm=(t,n)=>{let r=n.state;if(!r||!Km(r))throw new e.b(`ENABLED needs a complete state at ${rh(t)}`);let i=n.environment;if(i.callStack)return Gp(t,n.scope,r,i);let a={environment:i,isInit:!1,isEnabled:!0,current:r,isStopped:!1,generator:void 0,successors:0};return um(t,i,!1)(a,n.scope,Gm(i),void 0,!1,()=>{a.isStopped=!0}),a.isStopped},Jm=(t,n,r,i,a)=>{let o={environment:n,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};um(t,n,!0)(o,i,Gm(n),void 0,!1,t=>{if(!o.isStopped){if(!Km(t)){if(a){o.isStopped=a([...t]);return}throw e.it(new e.S([...t]),e.tt.error)}o.isStopped=r(t)}})},Ym=(e,t,n)=>{let r=[];return Jm(e,t,e=>(r.push(e),!1),n),r},Xm=(t,n,r,i,a,o,s)=>{let c={environment:r,isInit:!1,isEnabled:!1,current:n,isStopped:!1,generator:o,successors:0,onUnsatisfied:s};return um(t,r,!1)(c,a,Gm(r),void 0,!1,(t,n)=>{if(!c.isStopped){if(!Km(t)){let i=r.variables.filter((e,n)=>t[n]===void 0);throw new e.C(`Successor state is not completely specified by action ${n??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,t,n,i)}c.successors++,c.isStopped=i({state:t,action:n})}}),c.successors},Zm=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return um(e,n,!1)(i,r,Gm(n),void 0,!1,e=>{Km(e)||(i.isStopped=!0)}),i.isStopped},Qm=(e,t,n,r)=>{let i=[];return Xm(e,t,n,e=>(i.push(e),!1),r),i},$m=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),eh=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),th=e=>eh.has(e.kind)||e.kind===`Apply`&&$m.has(e.operator),nh=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&jt(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},rh=e=>`line ${e.location.line}, column ${e.location.column}`,ih=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,V=e=>{let t=e.location.range;return t?ih(t):rh(e)},ah={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},oh=(t,n)=>new e.b(`TLC encountered a temporal formula (${t}) when evaluating a predicate or action.\n${V(n)}`),sh=e=>e.kind===`Number`?e.text??String(e.value):V(e),ch=(t,n)=>new e.b(`A non-boolean expression (${Bo(n)}) was used as the condition of an IF.\n${V(t)}`),lh=(t,n,r)=>{let i=t.location.range;if(i?.start.line===t.location.line&&i.start.column===t.location.column||!i)return new e.b(`A non-boolean expression (${Bo(r)}) was used as a formula in a ${t.kind===`And`?`conjunction`:`disjunction`}.\n${sh(t.operands[n])}`);let a=t.prefixEnds?.[Math.max(n,1)-1]??i.end;return new e.b(`Attempted to evaluate an expression of form P ${t.kind===`And`?`/\\`:`\\/`} Q when ${n===0?`P`:`Q`} was\n${Bo(r)}.\n${V({...t,location:{...t.location,range:{...i,end:a}}})}`)},uh=t=>{let n=t.field,r=e=>`Attempted to select nonexistent field "${n}" from the record\n${k(I(e))}\n${V(t)}`,i=e=>`Attempted to apply function:\n${k(I(e))}\nto argument "${n}", which is not in the domain of the function.`;return a=>{if(!Mt(a))throw new e.b(`Attempted to select field "${n}" from a non-record value ${k(I(a))}\n${V(t)}`);let o=Dn(a);if(o===`tuple`)throw Di(n);return Ni(a.kind===`LazyFunction`?F(a):a,n,o===`record`?r:i)}},dh=e=>e===`1.7.4`?(t,n)=>wi(t,n,e):void 0,fh=t=>n=>{if(!Mt(n))throw new e.b(`Attempted to apply the operator DOMAIN to a non-function\n(${Bo(n)})\n${V(t)}`);return Fi(n)},ph=(t,n)=>(r,i)=>{if(!A(r)||un(r))throw new e.b(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${V(t)}`);return n.evaluateBinary?n.evaluateBinary(r,i):n.evaluate([r,i])},mh=t=>e.it(new e.b(`TLC can't handle real numbers.\n${t.text}`),e.tt.configParseError),hh=t=>e.it(new e.b(`TLC can't handle a number this big.\n${t.text??t.value}`),e.tt.error),gh=(t,n)=>new e.R(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${V(n)}`,t),_h=(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,vh=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},yh=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),bh=(t,n,r)=>{if(n.kind===`Name`)return yh(t,n.name,r);let i=di(r);if(!i||i.length!==n.names.length){let t=n.ranges?.[0];throw new e.b(`Argument mismatch in operator application.${t?ih(t):``}`)}return n.names.reduce((e,t,n)=>yh(e,t,i[n]),t)},xh=(t,n)=>{if(Mt(t))return t;throw new e.b(`A non-function (${Bo(t)}) was applied as a function.\n${V(n)}`)},Sh=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},Ch=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),wh=(t,n)=>{if(typeof t!=`boolean`)throw new e.b(`Expected ${n} to be a boolean but found ${I(t)}`);return t},Th=(t,n,r)=>{if(typeof t!=`boolean`)throw new e.b(`Attempted to evaluate an expression of form P => Q when ${r} was\n${Bo(t)}.\n${V(n)}`);return t},Eh=(t,n)=>{if(typeof t!=`boolean`)throw new e.b(`Attempted to apply the operator ~ to a non-boolean\n(${Bo(t)})\n${V(n)}`);return!t},Dh=(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${V(r)}`);return t===n},Oh=(t,n)=>{if(typeof t!=`boolean`)throw new e.b(`TLC expected a boolean value, but did not find one. ${sh(n)}`);return t},kh=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),Ah=(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.`},jh=(t,n,r)=>{if(!A(t)||un(t)){let i=I(t),a=r===`1.7.4`?void 0:Ah(t,i);throw new e.b(a===void 0?`TLC encountered a non-enumerable quantifier bound\n${i}.\n${sh(n)}`:`TLC encountered the non-enumerable quantifier bound\n${i}\n${sh(n)}\n${a}`)}},Mh=(e,t,n)=>(jh(e,t,n),typeof e==`object`&&e.kind===`Interval`?jr(e):Gr(e)??Zr(e)),Nh=(e,t,n)=>n===`1.7.4`?(jh(e,t,n),Gr(e)??$r(e)):Mh(e,t,n),Ph=e=>{if(typeof e==`object`&&e.kind===`Interval`)return oi(e),e},Fh=(e,t,n)=>Ph(e)??Nh(e,t,n),Ih=(e,t,n)=>Ph(e)??Mh(e,t,n),Lh=(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},Rh=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set)),n),[]),zh=(e,t)=>Rh(e,e=>Fh(U(e,t),e,t.environment.runtime.version)),Bh=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Lh(t[n],t=>i(n-1,bh(a,e[n].pattern,t)));return i(e.length-1,n)},Vh=(e,t,n)=>Bh(e,zh(e,t),t.scope,n),Hh=(e,t)=>{let n=Rh(e,e=>U(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Uh=(e,t,n)=>{if(e.length===1)return bh(t,e[0].pattern,n);let r=di(n)??[];return e.reduce((e,t,n)=>bh(e,t.pattern,r[n]),t)},Wh=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Gh=e=>Object.assign(e.value,{lambda:e}),Kh=e=>Wh(e)?e.lambda:void 0,qh=(t,n,r)=>{let i=t.value,a=n.args.map(e=>U(e,r)),o=a.length===1?a[0]:Fr(a),s=(e,t,r)=>`In applying the function\n${k(I(i))},\nthe ${e} is:\n${k(I(t))}${r}.\n${V(n.function)}`,c=t.bounds;if(c.length===1){if(!gi(o,i.domain))throw new e.b(s(`first argument`,o,`which is not in its domain`));return Uh(c,t.scope,o)}let l=di(o),u=typeof i.domain==`object`&&i.domain.kind===`ProductSet`?i.domain.factors:[],d=()=>new e.b(`In applying the function\n${k(I(i))},\nthe argument list is:\n${k(I(o))}\nwhich does not match its formal parameter.\n`);if(l===void 0||(c.forEach((t,n)=>{if(n>=l.length)throw d();let r=l[n],i=`argument number ${n+1}`;if(!gi(r,u[n]))throw new e.b(s(i,r,`${t.pattern.kind===`Name`?``:`
1782
+ `}which is not in its domain`));if(t.pattern.kind===`Tuple`&&di(r)?.length!==t.pattern.names.length)throw new e.b(s(i,r,`which does not match its formal parameter`))}),l.length>c.length))throw d();return Uh(c,t.scope,o)},Jh=(e,t)=>{let n=t.location.range;if(n)return{parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:ih(n)}},Yh=(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}},Xh=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},Zh=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),Qh=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),$h=(e,t)=>{let n=Hh(e.bounds,t),r=Xh(n,(n,r)=>U(e.body,Ch(t,Uh(e.bounds,yh(void 0,e.name,r),n))),Yh(Jh(e.bounds,e.body),e.bounds,n),Zh(e.bounds));Gh({value:r,bounds:e.bounds,body:e.body,scope:yh(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=$h(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?On(i):i},eg=(t,n)=>{if(typeof n!=`object`||Dn(n)!==`lambda`||t.kind===`Operator`||t.isSelfReferential||n.kind!==`LazyFunction`||!jt(n.domain))return n;try{let e=F(n);return wn(e.domain,e.range)}catch(t){if(t instanceof e.b)return n;throw t}},tg=(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=>$h(t,e):zg(Qh(t),n):zg(t.body,n),ng=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=tg(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(Ch(e,void 0)):e=>a[i]??r(Ch(e,void 0));return t.definitionEvaluators.set(e,o),o},rg=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},ig=(t,n)=>t.forEach(t=>{if(t.kind===`Operator`&&t.params.length>0)return;let r=t.name;if(n.constants.has(r)||n.substitutions.has(r)||!gu(t,n))return;let i=n.facts.ids.get(t);if(i===void 0||n.startupValues[i]!==void 0)return;let a={environment:n,scope:void 0,state:void 0,next:void 0};try{let e=n.runtime.evaluateAtStartup(()=>eg(t,tg(t,n)(a)));pr(e),n.startupValues[i]=e}catch(t){if(!(t instanceof e.b)&&!e.et(t))throw t}}),ag=(t,n)=>{if(n===void 0||t===n)return!0;try{return n.every((e,n)=>e===void 0||t?.[n]!==void 0&&Fn(t[n],e))}catch(t){if(t instanceof e.b)return!1;throw t}},og=(e,t)=>{let n=e.cache;if(n!==void 0&&ag(t.state,e.state)&&ag(t.next,e.next))return n;let r=t.environment.coverage,i=r?.current===-1?void 0:r?.values.get(e),a=r&&i!==void 0?io(r,i,()=>U(e.expression,Ch(t,e.scope))):U(e.expression,Ch(t,e.scope));return(!e.isStreamed||ti(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},sg=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),cg=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return cg(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?sg(r):t.builtins.get(e)},lg=(e,t)=>O(e)?ug(e.operator,t):cg(e.operator,t.environment)??ug(e.operator,t),ug=(e,t)=>{let n=vh(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return cg(e,t.environment)},dg=e=>e.kind===`Closure`?e.params.length:e.arity,fg=(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:ug(r,n);if(!i)throw new e.b(`Expected an operator argument at ${rh(t)}`);return i},pg=(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)=>yh(e,n.name,t[r]),e.scope);return U(e.body,Ch(n,r))},mg=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:dg(e),call:n=>pg(e,n,t)},hg=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=ug(e.name,t);return n!==void 0&&dg(n)>0},gg=(e,t)=>e.map(e=>hg(e,t)?mg(fg(e,t),t):U(e,t)),_g=(t,n)=>new e.b(`Operator ${t.name} expects ${t.params.length} arguments but received ${n}`),vg=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),yg=(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 yg(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([])}},bg=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Ft(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=vg(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=O(e)?void 0:yg(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=vh(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:vg(e,t)}}return t=>vg(e,t)},xg=(e,t,n,r)=>{if(t.length!==e.params.length)throw _g(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:fg(t[a],n)}:(r?.[a]??bg(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},Sg=(e,t,n,r)=>e.kind===`Closure`?U(e.body,Ch(n,xg(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>U(e,n))):e.isLazy?e.evaluate(Hg(t,n),n):e.evaluate(gg(t,n),n),Cg=/* @__PURE__ */ new WeakMap,wg=e=>{let t=Cg.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return Cg.set(e,n),n},Tg=(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:wg(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},Eg=(t,n,r)=>{let i=vh(r.scope,t);if(i?.kind===`Value`)return i.value;if(i?.kind===`Thunk`)return og(i,r);if(i?.kind===`Operator`){if(dg(i.operator)===0)return pg(i.operator,[],r);throw new e.b(`Operator ${t} is used without arguments`)}let a=yg(t,r.environment);if(a?.kind===`Variable`){let e=r.state?.[a.index];if(e===void 0)throw gh(t,n);return e}if(a?.kind===`Value`)return a.value;if(a?.kind===`Definition`)return ng(a.definition,r.environment)(r);let o=r.environment.builtins.get(t);if(o?.arity===0)return o.evaluate([],r);throw new e.b(`Unknown identifier ${t} at ${rh(n)}`)},Dg=(e,t)=>({impure:new Set(e.filter(e=>vu(e,t))),streamed:new Set(e.filter(e=>vu(e,t,`streamed`)))}),Og=e=>[...e.facts.ids.keys()].some(t=>vu(t,e)),kg=e=>[...e.facts.ids.keys()].some(t=>vu(t,e,`repeated`)),Ag=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,jg=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),Mg=e=>t=>{let n=e(t);return Fn(n,e(jg(t)))},Ng=(t,n,r,i)=>a=>{i.expressions.push(t);let o=pi.sets,s=pi.callStack,c=o??[],l=c.length;pi.sets=c,pi.callStack=i;try{let e=n(a),o=Ag(e)?e.rebind(r):e;return i.values.set(t,o),typeof o==`object`&&o.kind!==`FilteredSet`&&th(t)&&i.sources.set(o,t),o}catch(n){n instanceof e.N&&!i.isFrozen&&(i.expressions.length=0,i.isFrozen=!0);let r=n instanceof Error?i.failures.get(n):void 0;n instanceof Error&&i.failures.set(n,t);let a=nh(t,i.values),o=a&&!D(t).some(e=>e===r)?i.values.get(a):void 0,s=t.kind===`FunctionApplication`&&o!==void 0&&!Mt(o)?void 0:o;throw Pg(i,[s,...c.slice(l).filter(e=>e!==s)],n),n}finally{i.isFrozen||i.expressions.pop(),c.length=l,pi.sets=o,pi.callStack=s}},Pg=(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},Fg=(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}},Ig=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}}),Lg=(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)}},Rg=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=no(n,i,e);ro(n,a),n.current=a;try{let i=t(r);return typeof i==`object`&&e.kind===`SetEnumeration`&&n.values.set(i,a),i}finally{n.current=i}},H=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=f_(e,t),i=t.callStack,a=i&&Lc.get(e),o=i?Ng(e,r,t,i):r,s=i&&a?Lg(e,a,o,i):o,c=t.coverage,l=c?Rg(e,s,c):s;return t.evaluators.set(e,l),l},zg=(e,t)=>{if(t.callStack||t.coverage)return H(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=_s(e,t)??H(e,t);return t.entryEvaluators.set(e,r),r},U=(e,t)=>zg(e,t.environment)(t),Bg=(e,t)=>{let n=e.name,r=O(e)?void 0:yg(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw gh(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n={reference:void 0};return r=>(n.reference??=ng(e,t))(r)}return t=>Eg(n,e,t)},Vg=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||O(e))return!0;let n=cg(e.name,t);return n===void 0||dg(n)===0},Hg=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>U(e,t),expression:e})),Ug=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Hg(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Vg(t[0],n)){let e=H(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Vg(t[0],n)&&Vg(t[1],n);if(i&&a){let e=H(t[0],n),r=H(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(gg(t,n),n)},Wg=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw _g(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:bg(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:fg(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Gg=(e,t,n)=>{let r=Wg(e,t,n),i={body:void 0};return t=>(i.body??=zg(e.body,n),i.body({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},Kg=(t,n)=>{let r=t.args;if(t.operator===`=>`){let e=H(r[0],n),i=H(r[1],n);return n=>!Th(e(n),t,`P`)||Th(i(n),t,`Q`)}if(t.operator===`~`&&r.length===1){let e=H(r[0],n);return n=>Eh(e(n),t)}if(t.operator===`<=>`){let e=H(r[0],n),i=H(r[1],n);return n=>Dh(e(n),i(n),t)}if(t.operator===`~>`||t.operator===`-+->`)return()=>{throw oh(t.operator===`~>`?`a ~> b`:`a -+-> formula`,t)};let i=O(t)?void 0:cg(t.operator,n);if(i?.kind===`Closure`)return Gg(i,r,n);if(i?.kind===`Builtin`&&i.name===`DOMAIN`){let e=H(r[0],n),i=fh(t);return t=>i(e(t))}if(i?.kind===`Builtin`&&i.name===`TLCEval`&&r.length===1){let e=!Ic.has(t)&&!Su(r[0],n);return t=>i.evaluate(Hg(r,t),e&&t.scope===void 0?void 0:t)}if(i?.kind===`Builtin`&&i.name===`\\subseteq`&&r.length===2){let e=H(r[0],n),a=H(r[1],n),o=ph(t,i);return t=>o(e(t),a(t))}if(i?.kind===`Builtin`)return Ug(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=>bg(e,n));return i=>{let o=ug(t.operator,i);if(o)return Sg(o,r,i,a);throw n.definitions.get(t.operator)?.kind===`Function`?new e.b(`${t.operator} is a function; apply it with brackets`):new e.b(`Unknown operator ${t.operator} at ${rh(t)}`)}},qg=(e,t)=>{let n=e.kind===`Forall`,r=H(e.body,t),i=e.bounds[0];if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=H(i.set,t);return s=>Lh(Fh(o(s),i.set,t.runtime.version),t=>Oh(r(Ch(s,yh(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=Rh(a,e=>Fh(H(e,t)(o),e,t.runtime.version)),c=(t,a)=>t<0?Oh(r(Ch(o,a)),e)!==n:Lh(s[t],e=>c(t-1,yh(a,i[t],e)));return c(a.length-1,o.scope)?!n:n}}return t=>Vh(a,t,i=>Oh(r(Ch(t,i)),e)!==n)?!n:n},Jg=(e,t)=>{if(e.kind===`Tuple`)return Fr(e.names.map(e=>{let n=vh(t,e);return n?.kind===`Value`&&n.value}));let n=vh(t,e.name);return n?.kind===`Value`?n.value:void 0},Yg=/* @__PURE__ */ new WeakSet,Xg=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&Yg.add(e)},Zg=/* @__PURE__ */ new WeakMap,Qg=e=>{if(Zg.has(e))return Zg.get(e);let t=/* @__PURE__ */ new Set,n=e=>e.kind!==`Subexpression`&&(e.kind===`Identifier`&&t.add(e.name),(e.kind===`Apply`||e.kind===`OperatorReference`)&&t.add(e.operator),e.kind===`ExceptAt`&&t.add(`@`),D(e).every(n)),r=n(e)?[...t]:void 0;return Zg.set(e,r),r},$g=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=vh(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),e_=e=>Yg.has(e),t_=(t,n)=>{let r=e_(t),i=H(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(Ch(t,yh(t.scope,n,e)));if(kt(e))return oi(e),At(e,r),f(e,t);let a=Nr(e),s=wn(a,a.map(r));return jt(e)?s:(s.lambdaDomain=e,On(s))}let n=[],r=Rh(a,e=>Ih(U(e,t),e,t.environment.runtime.version));return Bh(a,r,t.scope,e=>{let r=a.length===1?Jg(o.pattern,e)??!1:Fr(a.map(t=>Jg(t.pattern,e)??!1));return n.push([r,i(Ch(t,e))]),!1}),wr(n)},l=Jh(a,t.body),u=Zh(a),d=Qg(t.body),f=(e,n)=>{let r=$g(n.scope,d),o=Ch(n,r),s=Gh({value:Xh(e,e=>i(Ch(o,Uh(a,r,e))),Yh(l,a,e),u),bounds:a,body:t.body,scope:r});return a.length===1?On(s):s},p=n.callStack;return{build:(n,i)=>{if(t.isRecursive||r||i.isKeepLazy||!M(n))return f(n,i);if(!(a.length===1?jt(n):typeof n==`object`&&n.kind===`ProductSet`&&n.factors.every(jt))){if(p)return f(n,i);try{return c(n,i)}catch(t){if(!(t instanceof e.b))throw t;return f(n,i)}}if(!p)return c(n,i);try{return c(n,i)}catch(e){throw Fg(p,t,e),e}},createLazy:f}},n_=(e,t)=>{let n=t_(e,t).build,r=e.bounds;if(r.length===1&&r[0].pattern.kind===`Name`){let e=H(r[0].set,t);return t=>n(e(t),t)}return e=>n(Hh(r,e),e)},r_=(e,t)=>{let n=Yg.has(e);n&&Xg(e.function);let r=H(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>H(e,t))}),value:H(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Fr(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Ch(i,yh(i.scope,`@`,e))):Ii(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i={value:!1};n=o(n,r.path,0,t,e=>(i.value=!0,r.value(e))),i.value||t.environment.runtime.warn(Ke.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${V(e.function)}`)}return n}},i_=(t,n)=>{let r=H(t.predicate,n),i=t.bound.pattern,a=t.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:ih(a)},s=sh(t.predicate),c=n.coverage,l=(e,t,n)=>{if(!c||e===-1)return n();t||c.secondary[e]++;let r=io(c,t?-1:e,n);return!t&&r===!0&&c.secondary[e]++,r},u=(n,r,a,c)=>({kind:`FilteredSet`,base:n,test:(t,n)=>{if(i.kind===`Tuple`&&di(t)?.length!==i.names.length)throw new e.b(`Attempted to check if the value:\n${k(I(t))}\nis an element of a set of ${i.names.length}-tuples.`);let o=l(c,n,()=>a(Ch(r,bh(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},H(t.predicate,e),-1)});return(e,t,n=-1)=>u(e,t,r,n)},a_=(t,n)=>{if(typeof t!=`boolean`)throw new e.b(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${Bo(t)}.\n${sh(n.predicate)}`);return t},o_=(t,n,r,i)=>{if(!A(t)||un(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${V(n)}`);return mr(t),Ih(t,r,i)},s_=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${V(t)}`),c_=(t,n)=>{if(t.kind===`SetFilter`){let e=H(t.predicate,n),r=H(t.bound.set,n),i=i_(t,n),a=t.bound.pattern,o=n.coverage;return n=>{let s=r(n);if(!jt(s))return i(s,n,o?.current);let c=[],l=r=>{let i=e(Ch(n,bh(n.scope,a,r)));a_(i,t)&&Ot(c,r)},u=s.kind===`Interval`?s:N(s).elements;return At(u,l),o&&o.current!==-1&&(o.secondary[o.current]+=(Array.isArray(u)?u.length:u.high-u.low+1)+c.length),Cn(c)}}if(t.kind===`SetMap`){let e=H(t.expression,n);return n=>{let r=[];return Vh(t.bounds,n,t=>(Ot(r,e(Ch(n,t))),!1)),yr(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${V(t)}`)};let i=H(t.body,n),a=H(r,n);return n=>{let o=o_(a(n),t,r,n.environment.runtime.version),s={value:void 0},c=t.pattern;if(Lh(o,r=>{if(c.kind===`Tuple`&&di(r)?.length!==c.names.length)throw new e.b(`Attempted to compute the value of an expression of form\nCHOOSE <<x1, ... , xN>> \\in S: P, but S was not a set\nof N-tuples.\n${V(t)}`);let a=bh(n.scope,c,r);return Oh(i(Ch(n,a)),t)?(s.value=Jg(c,a),!0):!1}),s.value===void 0)throw s_(t);return s.value}},l_=e=>[...e].sort((e,t)=>_n(e.name,t.name)),u_=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),d_=(e,t)=>{let n=l_(e),r=u_(n),i=n.map(e=>H(e.value,t));if(r)return e=>Ir(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=>Vt(a,i.map(t=>t(e)),o):e=>Lr(a,i.map(t=>t(e)))},f_=(t,n)=>{let r=e=>H(e,n);switch(t.kind){case`Number`:{let e=t.value;return Ft(e)?()=>e:()=>{throw hh(t)}}case`Decimal`:return()=>{throw mh(t)};case`String`:{let e=t.value;return()=>e}case`Identifier`:return Bg(t,n);case`Apply`:return Kg(t,n);case`Bracket`:return()=>{throw new e.b(`A bracket without a function or subscript is not an expression at ${rh(t)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new e.b(`An operator cannot be used as a value at ${rh(t)}`)};case`And`:{let e=t.operands.map(r);return n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw lh(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 lh(t,r,i);if(i)return!0}return!1}}case`Prime`:{let e=r(t.expression);return t=>e(jg(t))}case`Unchanged`:return Mg(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 ch(t,a);return a?n(r):i(r)}}case`Case`:{let n=t.arms.map(e=>({source:e.condition,condition:r(e.condition),body:r(e.body)})),i=t.other?r(t.other):void 0;return r=>{for(let t of n){let n=t.condition(r);if(typeof n!=`boolean`)throw new e.b(`A non-boolean expression (${Bo(n)}) was used as a condition of a CASE. ${sh(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${V(t)}`)}}case`Let`:{let e=r(t.body);return n=>e(Ch(n,Tg(t.definitions,n)))}case`Forall`:case`Exists`:return qg(t,n);case`UnboundedQuantifier`:return()=>{let n=t.quantifier===`Forall`?`\\A`:`\\E`;throw t.isTemporal?oh(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${V(t)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return c_(t,n);case`SetEnumeration`:{let e=t.elements.map(r);return t=>yr(e.map(e=>e(t)))}case`Tuple`:{let e=t.elements.map(r);return t=>Fr(e.map(e=>e(t)))}case`FunctionConstruction`:return n_(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 d_(t.fields,n);case`RecordSet`:{let e=l_(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 r_(t,n);case`ExceptAt`:return n=>{let r=vh(n.scope,`@`);if(r?.kind!==`Value`)throw new e.b(`@ appears outside an EXCEPT at ${rh(t)}`);return r.value};case`FunctionApplication`:{Xg(t.function);let e=r(t.function),i=n=>xh(e(Sh(n)),t),a=t.args.map(r),o=dh(n.runtime.version);if(a.length===1){let e=a[0];return t=>Ni(i(t),e(t),o)}return e=>Ni(i(e),Fr(a.map(t=>t(e))),o)}case`FieldAccess`:{let e=r(t.record),n=uh(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=Mg(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${V(t)}`);return a?s||i(r):s&&!i(r)}}case`Enabled`:{let e=t.expression;return t=>qm(e,t)}case`Label`:return r(t.body);case`Subexpression`:return()=>{throw new e.b(`The subexpression reference at ${rh(t)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw oh(ah[t.kind],t)}}},p_=`tlc2/value/impl/`,m_={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},h_={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},g_=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n={offset:0},r=e=>{let t=n.offset;return n.offset+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n.offset)}},__=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),v_=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],y_=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??__.get(e[3])}${`[]`.repeat(e[1].length)}`),b_=(e,t)=>e[e[t].first].text,x_=(e,t)=>b_(e,t).replaceAll(`/`,`.`),S_=t=>{let n=g_(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===m_.utf8?i.text=a.decode(n.readBytes(n.readUint16())):t===m_.integer?i.value=n.readInt32():t===m_.float?n.readUint32():t===m_.long||t===m_.double?(n.readBytes(8),e++):t===m_.class||t===m_.string||t===m_.methodType||t===m_.module||t===m_.package?i.first=n.readUint16():t===m_.methodHandle?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=x_(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=y_(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:g_(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()},()=>x_(r,d.readUint16())):[],p=v_.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=y_(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}},C_=(e,t)=>{let n=e[t],r=e[n.second];return{className:b_(e,n.first),name:e[r.first].text}},w_=(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===m_.integer)return t.value;if(t.tag===m_.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>=h_.iconstM1&&t<=h_.iconst5)s.push(t-h_.iconst0),e+=1;else if(t===h_.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===h_.sipush)s.push(r()<<16>>16),e+=3;else if(t===h_.ldc)s.push(l(o[e+1])),e+=2;else if(t===h_.ldcW)s.push(l(r())),e+=3;else if(t===h_.dup){let t=c();s.push(t,t),e+=1}else if(t===h_.getstatic){let t=C_(n,r());if(t.className!==`${p_}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===h_.invokestatic){let t=C_(n,r()),o=c();if(t.className!==`${p_}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===h_.new)s.push({className:b_(n,r()),value:void 0}),e+=3;else if(t===h_.invokespecial){let t=C_(n,r()),o=c(),s=c();if(!(t.className===`${p_}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===h_.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()},T_=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=S_(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:w_(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)}))}},E_=b(`EOF`),D_=b(`IDENTIFIER`),O_=b(`DEFBREAK`),k_=(e,t)=>Array.from({length:b(t)-b(e)+1},(t,n)=>b(e)+n),A_=new Set(k_(`op_57`,`op_119`)),j_=new Set(k_(`op_1`,`op_119`)),M_=new Set(k_(`op_57`,`op_70`)),N_=/* @__PURE__ */ new Set([...k_(`ACTION`,`EXCEPT`),b(`EXTENDS`),...k_(`IF`,`SF`),b(`STATE`),...k_(`THEN`,`WITH`),b(`US`),...k_(`op_112`,`op_116`)]),P_=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),F_=new Map([...P_(`postfix`,160,160,!0,`[`),...P_(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...P_(`prefix`,120,120,!1,`-.`),...P_(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...P_(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...P_(`prefix`,40,40,!0,`\\lnot`),...P_(`nfix`,100,130,!0,`\\times`),...P_(`infix`,140,140,!1,`^`,`^^`),...P_(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...P_(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...P_(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...P_(`infix`,100,110,!0,`|`,`||`,`%%`),...P_(`infix`,100,110,!1,`%`),...P_(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...P_(`infix`,90,140,!1,`\\wr`),...P_(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...P_(`infix`,90,130,!1,`!!`),...P_(`infix`,90,90,!1,`...`,`..`),...P_(`infix`,80,80,!0,`\\intersect`,`\\union`),...P_(`infix`,80,80,!1,`\\`),...P_(`infix`,70,70,!1,`<:`,`:>`),...P_(`infix`,60,60,!0,`@@`),...P_(`infix`,50,140,!0,`\\cdot`),...P_(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...P_(`infix`,30,30,!0,`\\land`,`\\lor`),...P_(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...P_(`infix`,10,10,!1,`=>`)]),I_=new Map([...F_,...yf.flatMap(e=>e.slice(1).map(t=>[t,F_.get(e[0])]))]),L_=I_.get(`[`),R_={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},z_=e=>({type:`tokens`,kinds:new Set(e)}),B_=e=>typeof e==`string`?e.startsWith(`<`)?z_([b(e.slice(1,-1))]):{type:`call`,name:e}:e,W=(...e)=>({type:`sequence`,units:e.map(B_)}),G=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:W(e))}),V_=e=>(...t)=>({type:e,body:W(...t)}),K=V_(`zeroOrMore`),H_=V_(`oneOrMore`),q=V_(`optional`),J=e=>({type:`action`,run:t=>e(t)??void 0}),Y=e=>J(t=>{t.expecting=e}),X=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&W(...e.expansion),semantic:e.semantic}),U_=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),W_=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=U_(e,n);return n},G_=(...e)=>{let t=e.map(b);return e=>t.includes(W_(e,1).kind)},K_=(e,t=W_(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},q_=e=>{let t=W_(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},J_=e=>G_(`CASESEP`)(e)&&K_(e),Y_=e=>{let t=W_(e,1);N_.has(t.kind)&&(t.kind=D_)},X_=(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}`,Z_=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),Q_=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},$_=e=>e.operatorStacks[e.operatorStacks.length-1],ev=(e,t)=>e.low>t.high,tv=(e,t)=>e.high<t.low,nv=e=>e.fix===`prefix`?e:I_.get(`${e.name}.`),rv=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===L_?Z_(`FcnAppl`,[n,...r.node.heirs]):Z_(`PostfixExpr`,[n,r.node]),operator:void 0})},iv=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Z_(`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:Z_(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},av=e=>{let t=$_(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 rv(t,n),av(e);if(i.operator!==void 0){let t=nv(r.operator);return t!==void 0&&ev(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${X_(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 ${X_(e,a.node.first,a.node.last)} and expression at location ${X_(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return tv(a.operator,r.operator)?void 0:ev(a.operator,r.operator)?(iv(t,a.operator),av(e)):`Precedence conflict between ops ${a.operator.name} in block ${X_(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=nv(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(tv(s,r.operator))return;if(!ev(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${X_(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return iv(t,s),av(e);let c=X_(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===R_?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},ov=e=>J(t=>{let n=$_(t),r=Q_(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:av(t)}),sv=ov(()=>!1),cv=ov(()=>!0),lv=J(e=>{e.lastOperator=I_.get(e.token.image)}),uv=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},dv=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?uv(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},fv=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!K_(e,n.first.beginColumn))return n;let t=fv(e,n);if(t!==void 0)return t}},pv=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(b),n=(e,...t)=>t.some(t=>e.kind===b(t)),r=e=>e!==void 0&&A_.has(e.kind),i=e.token,a=U_(e,i);i.next=void 0;let o=U_(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===D_&&(e=e.next)}else if(e.kind===D_){let t=e.next;!r(t)||M_.has(t.kind)||j_.has(t.kind)&&t.next?.kind!==D_||(e=t.next?.kind===b(`SUBSTITUTE`)?i:j_.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==O_&&(e.next={kind:O_,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=U_(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},mv=e=>{let t=W_(e,1);if(t.kind===b(`LAB`)){let n=1;for(;n!==0;)if(t=U_(e,t),t.kind===b(`LAB`)&&n++,t.kind===b(`RAB`)&&n--,t.kind===E_)return!1;return U_(e,t).kind===b(`IN`)}if(t.kind!==D_)return!1;for(t=U_(e,t);t.kind===b(`COMMA`);){if(t=U_(e,t),t.kind!==D_)return!1;t=U_(e,t)}return t.kind===b(`IN`)},hv=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),gv=e=>e.proofLevels.at(-1)??-1,_v=e=>{let t=W_(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:G_(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||gv(e)>=0&&hv(t)>gv(e):G_(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},vv=(e,t)=>{let n=hv(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},yv=e=>J(t=>vv(t,t.token)?void 0:`${X_(t,t.token)}: ${e}`),bv=z_([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(b)),xv=z_([...bv.kinds,b(`op_76`)]),Sv=z_(j_),Cv=z_(M_),wv=z_([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(b)),Tv=()=>K(X({expansion:[G(bv,`<op_77>`)],semantic:K_}),G(`PrefixOp`,`InfixOp`),cv),Ev=()=>G(W(X({expansion:[`OpenStart`],semantic:K_}),`OpenExpression`,sv),W(X({semantic:K_}),`ExtendableExpr`)),Dv=()=>G(W(`<MODULE>`,Y(`identifier`),`Identifier`),`Expression`),Ov=()=>G(W(X({semantic:e=>G_(`ASSUME`,`BOXASSUME`)(e)||W_(e,2).kind===b(`COLONCOLON`)&&[b(`ASSUME`),b(`BOXASSUME`)].includes(W_(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),kv=()=>[`JuncItem`,K(X({semantic:q_}),`JuncItem`)],Av=e=>J(t=>{t.expecting=e,Y_(t)}),jv=e=>J(t=>{t.isTerminalProof=e}),Mv=(e,...t)=>W(...t.slice(0,-1),Y(`==`),`<DEF>`,J(t=>{pv(t),t.expecting=e}),t[t.length-1]),Z=(e,t,n)=>({message:e,body:W(...t),exit:n}),Nv={CompilationUnit:Z(void 0,[J(pv),q(`Prelude`),`Module`]),Prelude:Z(void 0,[`<BEGIN_PRAGMA>`,K(G(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Z(`Module definition`,[Y(`---- MODULE`),`BeginModule`,Y(`EXTENDS clause or module body`),`Extends`,Y(`Module body`),`Body`,Y(`==== or more Module body`),`EndModule`]),BeginModule:Z(`Begin module`,[Y(`---- MODULE (beginning of module)`),G(`<_BM0>`,`<_BM1>`,`<_BM2>`),Av(`Identifier`),`Identifier`,J(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Z(void 0,[`<END_MODULE>`]),Extends:Z(`Extends`,[q(`<EXTENDS>`,Av(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,Av(`Identifier`),`Identifier`))]),Body:Z(`Module body`,[Y(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),K(G(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,W(X({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,W(X({amount:2}),`Instance`),W(X({amount:2}),`Assumption`),W(X({amount:2}),`Theorem`),W(X({amount:1}),`Module`,J(pv)),W(X({semantic:e=>G_(`USE`)(e)&&W_(e,2).kind!==b(`ONLY`)||G_(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Z(`variable declaration`,[`<VARIABLE>`,Y(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,Y(`Identifier`),`Identifier`)]),ParamDeclaration:Z(`Parameter declaration`,[Y(`CONSTANT`),`ParamSubDecl`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y(`,`),K(`<COMMA>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Z(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Z(`Recursive`,[Y(`RECURSIVE`),`<RECURSIVE>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y(`,`),K(`<COMMA>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y("`,' or `)'"))]),ConstantDeclarationItems:Z(`Constant declaration items`,[Y(`Identifier, _ or prefix op`),G(W(`Identifier`,Y(`(, comma, or Module Body`),q(X({amount:2}),`<LBR>`,Y(`_`),`<US>`,Y(`comma or )`),K(`<COMMA>`,Y(`_`),`<US>`,Y(`comma or )`)),`<RBR>`)),W(`NonExpPrefixOp`,Y(`_`),`<US>`),W(`<US>`,Y(`prefix or postfix operator`),G(W(`InfixOp`,Y(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Z(`Definition`,[Y(`LOCAL, Identifier or Operator Symbol`),q(`<LOCAL>`),`<DEFBREAK>`,Y(`LOCAL, Identifier or Operator Symbol`),G(Mv(`Expression`,X({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,Y(`[`),`<LSB>`,Y(`Identifier`),`QuantBound`,Y(`COMMA or ]`),K(`<COMMA>`,Y(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),Mv(`Expression`,X({expansion:[`<IDENTIFIER>`,Cv]}),`PostfixLHS`,`Expression`),Mv(`Expression`,X({expansion:[`<IDENTIFIER>`,Sv]}),`InfixLHS`,`Expression`),Mv(`Expression or Instance`,X({expansion:[`<IDENTIFIER>`,G(`<LBR>`,`<DEF>`)]}),`IdentLHS`,G(`Expression`,`Instantiation`)),Mv(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Z(`Identifier tuple`,[`<LAB>`,Y(`Identifier or >>`),q(`Identifier`,Y(`COMMA or >>`),K(`<COMMA>`,Y(`COMMA or >>`),`Identifier`,Y(`COMMA or >>`))),`<RAB>`]),IdentLHS:Z(`Identifier LHS`,[`Identifier`,Y(`( or ==`),q(`<LBR>`,Y(`Identifier Declaration, prefix op, _ or )`),G(`IdentDecl`,`SomeFixDecl`),Y(`COMMA or )`),K(`<COMMA>`,Y(`Identifier Declaration, prefix op or _`),G(`IdentDecl`,`SomeFixDecl`),Y(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Z(`Prefix LHS`,[xv,Y(`Identifier`),`Identifier`]),InfixLHS:Z(`Infix LHS`,[`Identifier`,Sv,`Identifier`]),PostfixLHS:Z(`Postfix LHS`,[`Identifier`,Cv]),IdentDecl:Z(`Identifier Declation`,[`Identifier`,Y(`( or ...`),q(`<LBR>`,Y(`_`),`<US>`,Y(`COMMA or )`),K(`<COMMA>`,Y(`_`),`<US>`,Y(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Z(`Op. Symbol Declaration`,[G(W(`NonExpPrefixOp`,Y(`_`),`<US>`),W(`<US>`,Y(`infix or postfix operator`),G(W(`InfixOp`,Y(`_`),`<US>`),`PostfixOp`)))]),Instance:Z(`Instance`,[Y(`LOCAL or instance`),q(`<LOCAL>`),`Instantiation`,Y(`COMMA or Module Body`)]),Instantiation:Z(`NonLocalInstance`,[`<INSTANCE>`,Av(`Module identifier`),`Identifier`,Y(`WITH or another definition.`),q(`<WITH>`,Y(``),`Substitution`,Y(``),K(X({amount:3}),`<COMMA>`,Y(``),`Substitution`,Y(``)))]),Substitution:Z(`Substitution`,[G(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),Y(`<-`),`<SUBSTITUTE>`,Y(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Z(void 0,[bv,lv]),NonExpPrefixOp:Z(void 0,[xv,lv]),InfixOp:Z(`Infix Op`,[Sv,lv]),PostfixOp:Z(void 0,[Cv,lv]),Identifier:Z(void 0,[`<IDENTIFIER>`]),Assumption:Z(`Assumption`,[Y(`ASSUM...`),G(`<ASSUMPTION>`,`<ASSUME>`),q(X({amount:2}),q(`<DEFBREAK>`),`Identifier`,Y(`==`),`<DEF>`),J(e=>{pv(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Z(`Assume-Prove`,[G(W(`Identifier`,`<COLONCOLON>`,`AssumeProve`),W(G(`<ASSUME>`,`<BOXASSUME>`),Y(`Expression, Declaration, or AssumeProve`),Ov(),Y("PROVE or `,'"),K(`<COMMA>`,Y(`Expression, Declaration, or AssumeProve`),Ov(),Y("PROVE or `,'")),G(`<PROVE>`,`<BOXPROVE>`),Y(`Expression`),`Expression`))]),NewSymb:Z(`NEW symbol declaration`,[Y(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),G(W(X({amount:2}),G(W(X({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),Y(`Constant declaration`),G(W(X({amount:2}),`IdentDecl`,q(`<IN>`,J(e=>{let t=Q_(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${X_(e,t.first,t.last)}`:void 0}),Y(`Expression`),`Expression`)),`SomeFixDecl`)),W(X({amount:2}),q(`<NEW>`),`<VARIABLE>`,Y(`Identifier`),`Identifier`),W(X({amount:2}),q(`<NEW>`),G(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),Y(`Declaration`),G(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Z(`Domain binding`,[q(`<IN>`,Y(`Expression`),`Expression`)]),Theorem:Z(`Theorem`,[Y(`THEOREM, PROPOSITION`),G(`<THEOREM>`,`<PROPOSITION>`),Y(`Identifier, Assume-Prove or Expression`),q(X({amount:2}),`Identifier`,Y(`==`),`<DEF>`),J(pv),G(W(X({amount:3}),X({semantic:G_(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),q(X({semantic:_v}),`Proof`)]),Proof:Z(`Proof`,[J(e=>{e.proofLevels.push(-1)}),G(W(X({semantic:e=>G_(`BY`)(e)||W_(e,2).kind===b(`BY`)}),`UseOrHideOrBy`),W(X({amount:2}),q(`<PROOF>`),G(`<OBVIOUS>`,`<OMITTED>`)),W(q(X({amount:2}),`<PROOF>`),K(X({semantic:e=>W_(e,2).kind!==b(`QED`)}),`Step`,Y(`a proof step`)),`QEDStep`)),J(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Z(`UseOrHideOrBy`,[G(W(q(`<PROOF>`),`<BY>`,jv(!0),q(`<ONLY>`)),W(`<USE>`,jv(!1),q(`<ONLY>`)),W(`<HIDE>`,jv(!1))),Y("an expression, `MODULE' or `DEF'"),q(Dv(),K(`<COMMA>`,Y(`MODULE or expression`),Dv(),J(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),q(`<DF>`,Y(`MODULE or expression`),Dv(),K(`<COMMA>`,Y(`MODULE or expression`),Dv(),J(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),J(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Z(`QED step`,[Y(`Step number`),wv,yv(`QED step's number has bad level.`),Y(`QED`),`<QED>`,q(X({semantic:_v}),`Proof`)]),Step:Z(`Step`,[Y(`Step number`),wv,yv(`step's number has bad level.`),Y(`proof step`),G(W(X({semantic:G_(`USE`,`HIDE`)}),`UseOrHideOrBy`),W(X({semantic:G_(`INSTANCE`)}),`Instantiation`),W(X({semantic:G_(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),q(X({semantic:_v}),J(e=>{let t=Q_(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${X_(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Z(`DefStep`,[q(`<DEFINE>`),H_(X({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Z(`HaveStep`,[`<HAVE>`,Y(`expression`),`Expression`]),TakeStep:Z(`TakeStep`,[`<TAKE>`,Y(`identifier`),G(W(X({expansion:[G(W(`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,Y(`comma or step`),K(`<COMMA>`,Y(`identifier or tuple of identifiers`),`QuantBound`,Y(`comma or proof step`))),W(`Identifier`,Y(`comma or proof step`),K(`<COMMA>`,Y(`identifier`),`Identifier`,Y(`comma or proof step`))))]),WitnessStep:Z(`WitnessStep`,[`<WITNESS>`,Y(`expression`),`Expression`,K(`<COMMA>`,Y(`expression`),`Expression`,Y(`comma or colon`))]),PickStep:Z(`PickStep`,[`<PICK>`,Y(`identifier`),G(W(X({expansion:[`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,Y(`comma, or colon`),K(`<COMMA>`,Y(`identifier`),`Identifier`,Y(`comma or colon`))),W(`QuantBound`,Y(`comma or colon`),K(`<COMMA>`,Y(`identifier or tuple of identifiers`),`QuantBound`,Y(`comma or colon`)))),`<COLON>`,Y(`expression`),`Expression`]),CaseStep:Z(`CaseStep`,[`<CASE>`,Y(`expression`),`Expression`]),AssertStep:Z(`AssertStep`,[q(`<SUFFICES>`,Y(`expression or ASSUME/PROVE`)),G(`Expression`,W(X({semantic:G_(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Z(void 0,[G(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Z(void 0,[G(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Z(`String`,[`<STRING_LITERAL>`]),Number:Z(void 0,[`<NUMBER_LITERAL>`,q(X({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Z(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,K(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Z(void 0,[G(W(X({amount:2,expansion:[G(xv,Sv,Cv),z_([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(b))],semantic:K_}),G(`NonExpPrefixOp`,W(`InfixOp`,J(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${X_(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),W(X({expansion:[`<LAMBDA>`],semantic:K_}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Z(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Z(`Quantified form`,[G(`<EXISTS>`,`<FORALL>`),G(W(X({expansion:[`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,K(`<COMMA>`,`Identifier`)),W(`QuantBound`,K(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Z(`Bound Quantified Expression`,[G(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,K(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Z(`Quant Bound`,[G(`IdentifierTuple`,W(`Identifier`,K(`<COMMA>`,`Identifier`,Y(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Z(`Some { } form`,[`<LBC>`,q(G(W(X({semantic:mv}),G(`IdentifierTuple`,`Identifier`),Y(`\\in`),`<IN>`,`Expression`,Y(`':', ',' or '}'`),q(G(W(`<COLON>`,`Expression`),H_(`<COMMA>`,`Expression`)))),W(X({expansion:[G(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,K(`<COMMA>`,`Expression`)),W(X({expansion:[G(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,K(`<COMMA>`,`QuantBound`)),W(`Expression`,q(G(W(`<COLON>`,J(e=>{let t=Q_(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,K(`<COMMA>`,`QuantBound`)),H_(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Z(`Some [] Form`,[`<LSB>`,G(W(X({semantic:mv}),`QuantBound`,K(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({semantic:e=>W_(e,2).kind===b(`MAPTO`)&&N_.has(W_(e,1).kind)}),J(e=>{W_(e,1).kind=D_}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,K(`<COMMA>`,`FieldSet`),`<RSB>`),W(`Expression`,G(W(K(`<COMMA>`,`Expression`),`<RSB>`,J(e=>{let t=e.frames[e.frames.length-1];t.node=Z_(`FcnAppl`,t.heirs),e.lastOperator=L_})),W(`<ARROW>`,`Expression`,`<RSB>`),W(`<EXCEPT>`,`ExceptSpec`,K(`<COMMA>`,`ExceptSpec`),`<RSB>`),W(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Z(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Z(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Z(`Except Spec`,[`<BANG>`,H_(`ExceptComponent`,Y(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Z(`Except Component`,[G(W(`<DOT>`,J(Y_),`Identifier`,J(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),W(`<LSB>`,`Expression`,K(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Z(`Some << -- >> or >>_ Form`,[`<LAB>`,q(`Expression`,K(`<COMMA>`,`Expression`)),G(`<RAB>`,W(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Z(void 0,[`Identifier`,q(X({amount:2}),`OpArgs`),G(W(`<BANG>`,`NoOpExtension`),J(e=>{e.isFairnessHooked=e.token.kind===b(`RBR`)}))]),ReducedExpression:Z(`restricted form of expression`,[G(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Z(`Fairness Expression`,[J(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),G(`<WF>`,`<SF>`),`ReducedExpression`,q(X({amount:2}),`<LBR>`,`Expression`,`<RBR>`,J(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Z(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Z(`CASE Expression`,[`<CASE>`,`CaseArm`,K(X({semantic:e=>J_(e)&&W_(e,2).kind!==b(`OTHER`)}),`<CASESEP>`,`CaseArm`),q(X({semantic:J_}),`<CASESEP>`,`OtherArm`)]),CaseArm:Z(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Z(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Z(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Z(`Let Definitions`,[H_(G(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Z(`AND-OR Junction`,[J(e=>{let t=W_(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),G(W(X({expansion:[`<OR>`]}),...kv()),W(X({expansion:[`<AND>`]}),...kv())),J(e=>{e.junctions.pop()})]),JuncItem:Z(`Junction Item`,[G(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=fv(t,e.heirs[1]);return n&&`Item at ${X_(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${X_(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Z(`(Un)Bounded Choose`,[`<CHOOSE>`,G(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Z(`Lambda`,[`<LAMBDA>`,Y(`Identifier`),`Identifier`,Y("`,' or `:'"),K(`<COMMA>`,Y(`Identifier`),`Identifier`,Y("`,' or `:'")),`<COLON>`,Y(`Expression`),`Expression`]),Expression:Z(`Expression`,[J(e=>{e.operatorStacks.push([])}),Tv(),Ev()],(e,t)=>{let n=$_(t);n.push({node:e.heirs[0],operator:R_});let r=av(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Z(`ExtendableExpr`,[G(W(X({expansion:[G(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),sv,K(G(W(X({expansion:[`PostfixOp`],semantic:K_}),`PostfixOp`,cv),W(X({expansion:[`<DOT>`],semantic:K_}),`<DOT>`,J(Y_),X({semantic:K_}),`Identifier`,J(e=>{let t=$_(e);t[t.length-1].operator!==void 0&&rv(t,t.length),t[t.length-1]={node:Z_(`RecordComponent`,[t[t.length-1].node,Q_(e,2),Q_(e,1)]),operator:void 0}})),W(X({expansion:[`<LSB>`],semantic:K_}),Y(`function argument`),`SBracketCases`,ov(e=>e.kind===`FcnAppl`)))),q(G(W(X({expansion:[`InfixOp`],semantic:K_}),`InfixOp`,cv,Tv(),Ev()),W(X({expansion:[`<COLONCOLON>`],semantic:K_}),`<COLONCOLON>`,J(e=>{let t=$_(e);if(!dv(t[t.length-1].node))return`\`::' at ${X_(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,J(e=>{let t=$_(e),n=Q_(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!tv(r,e.lastOperator)){let t=Q_(e,3);return`Removing label at ${X_(e,t.first,t.last)} would change expression parsing.`}t.push({node:Z_(`Label`,[Q_(e,3),Q_(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Z(`Primitive expression`,[G(W(X({expansion:[`String`],semantic:K_}),`String`),W(X({expansion:[`<NUMBER_LITERAL>`],semantic:K_}),`Number`),W(G(`Identifier`,W(G(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),J(e=>gv(e)<0&&e.proofLevels.length<=1?`${X_(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${X_(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,W(X({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),q(X({amount:2}),`OpArgs`),K(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:uv(e.heirs)===void 0?e.heirs.length===1?Z_(`GeneralId`,e.heirs):void 0:Z_(`OpApplication`,e.heirs)}),BangExt:Z(`Bang Extension`,[`<BANG>`,G(W(G(W(X({expansion:[`Identifier`],semantic:e=>W_(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),q(X({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Z(`StructOp`,[Y("`<<' , `>>' , `:' , `@' , or number"),G(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,W(X({semantic:e=>W_(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${X_(t,n.first,n.last)}`:void 0}),OpenStart:Z(void 0,[G(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},Pv=/* @__PURE__ */ new Map,Fv=e=>{let t=Pv.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=Fv(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,Fv(Nv[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 Pv.set(e,n),n},Iv=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},Lv=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=U_(e,e.scanPosition)),e.scanPosition=U_(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`},Rv=(e,t)=>{if(t.type===`tokens`)return Lv(e,t.kinds);if(t.type===`call`)return Rv(e,Nv[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||Iv(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=Rv(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||Iv(e,t.semantic)?Rv(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=Rv(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=Rv(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},zv=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=Rv(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},Bv=(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||Fv(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!Fv(a).hasSemanticStart?Fv(a).first.has(W_(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):zv(e,i,a)&&(o===void 0||o(e))}),Vv=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,Rv(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=U_(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===E_){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=U_(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Ee(e.token.image)}" `},Hv=(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??Vv(e)}\n\nResidual stack trace follows:\n${r}`,!1},Uv=(e,t)=>{let n=U_(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,Hv(e))},Wv=(e,t)=>{let n=Nv[t];n.message!==void 0&&(e.messages.push({name:n.message,token:W_(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!Gv(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 Hv(e,i);let a=r.node??(r.heirs.length===0?void 0:Z_(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},Gv=(e,t)=>{if(t.type===`tokens`)return Uv(e,t.kinds);if(t.type===`call`)return Wv(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||Hv(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||Hv(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||Gv(e,t));if(t.type===`choice`){let n=Bv(e,t.alternatives);return n===-1?Hv(e):Gv(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!Gv(e,t.body))return!1;if(t.type===`optional`)return Bv(e,[t.body])===-1||Gv(e,t.body);for(;Bv(e,[t.body])===0;)if(!Gv(e,t.body))return!1;return!0},Kv=e=>{let t=we(e),n={kind:E_,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],pushedErrors:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=Gv(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
+ `)},qv={low:15,high:15},Jv={low:16,high:16},Q=(e,t,n)=>({low:e,high:t,isAssociative:n}),Yv=new Map([[`=>`,Q(1,1,!1)],[`<=>`,Q(2,2,!1)],[`~>`,Q(2,2,!1)],[`-+->`,Q(2,2,!1)],[`/\\`,Q(3,3,!0)],[`\\/`,Q(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,Q(5,5,!1)]),[`\\cdot`,Q(5,14,!0)],[`@@`,Q(6,6,!0)],[`:>`,Q(7,7,!1)],[`<:`,Q(7,7,!1)],[`\\cup`,Q(8,8,!0)],[`\\cap`,Q(8,8,!0)],[`\\`,Q(8,8,!1)],[`..`,Q(9,9,!1)],[`...`,Q(9,9,!1)],[`##`,Q(9,13,!0)],[`$`,Q(9,13,!0)],[`$$`,Q(9,13,!0)],[`??`,Q(9,13,!0)],[`!!`,Q(9,13,!1)],[`\\sqcap`,Q(9,13,!0)],[`\\sqcup`,Q(9,13,!0)],[`\\uplus`,Q(9,13,!0)],[`\\wr`,Q(9,14,!1)],[`+`,Q(10,10,!0)],[`++`,Q(10,10,!0)],[`(+)`,Q(10,10,!0)],[`\\oplus`,Q(10,10,!0)],[`%`,Q(10,11,!1)],[`%%`,Q(10,11,!0)],[`|`,Q(10,11,!0)],[`||`,Q(10,11,!0)],[`\\X`,Q(10,13,!1)],[`-`,Q(11,11,!0)],[`--`,Q(11,11,!0)],[`(-)`,Q(11,11,!0)],[`\\ominus`,Q(11,11,!0)],[`*`,Q(13,13,!0)],[`**`,Q(13,13,!0)],[`/`,Q(13,13,!1)],[`//`,Q(13,13,!1)],[`\\div`,Q(13,13,!1)],[`\\o`,Q(13,13,!0)],[`(.)`,Q(13,13,!0)],[`\\odot`,Q(13,13,!0)],[`(/)`,Q(13,13,!1)],[`\\oslash`,Q(13,13,!1)],[`(\\X)`,Q(13,13,!0)],[`\\otimes`,Q(13,13,!0)],[`&`,Q(13,13,!0)],[`&&`,Q(13,13,!0)],[`\\star`,Q(13,13,!0)],[`\\bullet`,Q(13,13,!0)],[`\\bigcirc`,Q(13,13,!0)],[`^`,Q(14,14,!1)],[`^^`,Q(14,14,!1)]]),Xv=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Zv=/* @__PURE__ */ new Set([...Xv,`'`]),Qv=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),$v=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),ey=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),ty=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),ny=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...Zv]),ry=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),iy=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),ay=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),oy=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),sy=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),cy=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),ly=/* @__PURE__ */ new Set([``,`*`,`-`]),uy={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},dy=(e,t)=>e.line-t.line||e.column-t.column,fy=(e,t)=>({start:dy(e.start,t.start)<=0?e.start:t.start,stop:dy(e.stop,t.stop)>=0?e.stop:t.stop}),py=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),my=(t,n,r=`Proof.Parser`)=>new e.F(t,void 0,{reason:t,line:n.start.line,column:n.start.column,isEnd:!1,proof:{stop:n.stop,exception:r}}),hy=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),gy=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),_y=/* @__PURE__ */ new Set([`NEW`,...gy.keys()]),vy=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),yy=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),by=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),xy=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Yv.has(e.operator):Xv.has(e.operator)),Sy=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,Cy=e=>Yv.has(e)||Xv.has(e)||e===`-.`,wy=(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}}},Ty=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.replace(/\r?\n$/,``).split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
1784
+ `)}\n`},Ey=(t,n,r=oe(t,n===`tlapm`))=>{let i=n===`tlapm`,a=i?r:r.map(ne),o={index:0,offsideColumns:[]},s={},l=[],u=/* @__PURE__ */ new Set,d=[],f=[],p=e=>l[l.length-1].has(e),m=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),h=[],g=[],ee=[],_=(e,t=o.index-1)=>{let n=e===t?ee[e]:void 0;if(n)return n;let r=a[t];h[e]??=m(a[e]),g[t]??={line:r.line,column:r.endColumn};let i={module:f[0].name,start:h[e],end:g[t]};return e===t&&(ee[e]=i),i},v=(e,t)=>(e.location.range=_(t),e),te=(e=0)=>a[Math.min(o.index+e,a.length-1)],y=(e=0)=>{let t=te(e),n=o.offsideColumns[o.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},re=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ie={index:0},ae=e=>{let t=a.slice(ie.index,o.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},se=e=>i&&(e.kind===`Keyword`||by.has(e.text)),ce=e=>{let t=a.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},le=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:cy.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:se(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,b=(t,n=te(),r)=>{let i=a[a.length-1],o=n.line===i.line&&n.column===i.column;return new e.F(`${t} at line ${n.line}, column ${n.column}`,void 0,ue(t,n,o,r))},ue=(e,t,n,r)=>{if(i&&n){let e=a[a.length-1];return{reason:`Unexpected EOF`,...ae(ce(e)),isEnd:n}}return i&&r?{reason:`Unexpected ${le(r)}`,...ce(r),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},de=(e,t=te())=>b(e,t,t),fe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!se(e),x=(e,t=0)=>{let n=y(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},S=()=>{let e=y();if(e.kind===`End`)throw b(`Unexpected end of expression`);return o.index++,e},C=e=>x(e)?(o.index++,!0):!1,w=e=>{if(!x(e))throw de(`Expected ${JSON.stringify(e)} but found ${re(y())}`);return S()},pe=()=>{let e=y();if(e.kind!==`Identifier`)throw de(`Expected an identifier but found ${re(e)}`);if(se(e))throw de(`Unexpected keyword ${e.text}`);return o.index++,e.text},me=()=>{let e=o.index;return{name:pe(),range:_(e)}},he=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),ge=()=>{let e=y();return e.kind!==`String`&&($v.has(e.text)||Yv.has(e.text)||Zv.has(e.text))?(o.index++,e.text):pe()},_e={isUsed:!1},ve=()=>y().kind===`Identifier`||!fe(y())?pe():(_e.isUsed=!0,S().text),T=e=>{if(!i)return e();o.offsideColumns.push(-1);let t=e();return o.offsideColumns.pop(),t},E=(e,t=`,`)=>{let n=[e()];for(;C(t);)n.push(e());return n},ye=()=>{if(x(`<<`)){let e={value:1};for(;y(e.value).kind===`Identifier`||x(`,`,e.value);)e.value++;return x(`>>`,e.value)&&x(`\\in`,e.value+1)}let e={value:0};for(;y(e.value).kind===`Identifier`;){if(x(`\\in`,e.value+1))return!0;if(!x(`,`,e.value+1))return!1;e.value+=2}return!1},be=()=>{if(x(`::`))return!0;if(!x(`(`))return!1;let e={value:1};for(;y(e.value).kind===`Identifier`&&x(`,`,e.value+1);)e.value+=2;return y(e.value).kind===`Identifier`&&x(`)`,e.value+1)&&x(`::`,e.value+2)},xe=()=>{if(!C(`<<`)){let e=me();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=he(x(`>>`)?[]:E(me));return w(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Se=()=>E(()=>{let e=E(xe);w(`\\in`);let t=D();return e.map(e=>({pattern:e,set:t}))}).flat(),Ce=()=>{let e=y();if(i&&by.has(e.text)){let t=o.index;S();let n={kind:`Identifier`,name:e.text,location:m(e)};return{subscript:v(n,t),lastArgs:[]}}let t=i&&(e.kind===`Number`||e.kind===`String`||x(`@`));if(e.kind===`Identifier`){let t=o.index,n=[],r=[],a=e=>(r.push(_(o.index,o.index)),n.push(pe()),e&&x(`(`)?Oe():[]),s=[a(!i)];for(;x(`!`)&&y(1).kind===`Identifier`;)S(),s.push(a(!0));let c=s.slice(0,-1),l=m(e);l.range={..._(t),end:r[r.length-1].end};let u=n.join(`!`);return{subscript:c.every(e=>e.length===0)?{kind:`Identifier`,name:u,location:l}:{kind:`Apply`,operator:u,args:c.flat(),argumentCounts:[...c.map(e=>e.length),0],argumentsRange:l.range,selectorRanges:r,location:l},lastArgs:s[s.length-1]}}if(x(`<<`)||x(`(`)||x(`{`)||x(`[`)||t){let e=o.index,t=Re();return{subscript:t.location.range?t:v(t,e),lastArgs:[]}}throw de(`Expected a subscript but found ${re(e)}`)},we=e=>{let t=y(1),n=y(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&x(`==`,Zv.has(n.text)?3:4))},Te=e=>{let t=y(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||x(`,`,1)||x(`)`,1)||t.kind===`Keyword`&&iy.has(t.text)||we(e)},Ee=()=>{let e=y(),t=e.kind===`Operator`&&(Yv.has(e.text)||Qv.has(e.text))&&Te(e);if(i&&e.kind!==`String`&&(Qv.has(e.text)||ny.has(e.text)&&e.text!==`'`&&!Xv.has(e.text)||ty.has(e.text)&&y(-1).text===`(`&&y(-1).line===e.line&&y(-1).endColumn+1===e.column&&y(1).text===`)`&&y(1).line===e.line&&y(1).column===e.endColumn+1)&&Te(e))throw b(`incomplete expression`,e);if(t&&!i&&e.text===`\\X`&&e.spelling!==`×`)throw b(`\\X may not be used as an infix operator`,e);if(t)return o.index++,v({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:m(e)},o.index-1);if(e.kind!==`String`&&ny.has(e.text)&&Te(e)){o.index++;let t=m(e);if(Xv.has(e.text))return v({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return v({kind:`Lambda`,params:[n.name],body:wy(e.text,n,t),operator:e.text,location:m(e)},o.index-1)}if(x(`LAMBDA`)){let t=o.index;S();let n=he(E(me));w(`:`);let r=D();return v({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:m(e)},t)}return D()},De={range:void 0},Oe=()=>T(()=>{let e=o.index;w(`(`);let t=E(Ee);return w(`)`),De.range=_(e),t}),ke=()=>{let e=S();o.offsideColumns.push(e.column);let t=[D()];for(;Sy(te())&&te().text===e.text&&te().column===e.column;)o.index++,t.push(D());return o.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:m(e)}},Ae=e=>T(()=>{let t=m(e),n=y().kind===`Identifier`,r=x(`|->`,1)&&(n||fe(y()));if(r||n&&x(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o.index,n=m(y()),i=e();return n.range=_(t),w(r?`|->`:`:`),{name:i,value:D(),location:n}},a=[i(()=>n?pe():S().text),...C(`,`)?E(()=>i(pe)):[]];return w(`]`),{kind:e,fields:a,location:t}}if(ye()){let e=o.index,n=Se();if(!i||x(`|->`)){w(`|->`);let e=D();return w(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}o.index=e}let a=D();if(C(`->`)){let e=D();return w(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(C(`EXCEPT`)){let e=E(()=>{w(`!`);let e=[];for(;x(`.`)||x(`[`);)if(C(`.`)){if(!fe(y()))throw de(`Expected a field name but found ${re(y())}`);if(!i&&x(`@`))throw de(`@ used in !.@`);e.push({kind:`Field`,name:S().text})}else w(`[`),e.push({kind:`Index`,args:E(()=>D())}),w(`]`);return w(`=`),{path:e,value:D()}});return w(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!x(`]_`)){let e=[a];for(;C(`,`);)e.push(D());return w(`]`),{kind:`Bracket`,args:e,location:t}}return w(`]_`),{kind:`BoxAction`,action:a,subscript:Ce().subscript,location:t}}),je=()=>{let e=o.index,t=v(Be(),e),n=m(S());return v({kind:`Apply`,operator:`\\in`,args:[t,D()],location:n},e)},Me=e=>T(()=>{let t=m(e);if(C(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ye()&&(y(1).text===`\\in`||x(`<<`))){let e=o.index,n=xe();w(`\\in`);let r=D();if(C(`:`)){let e=D();return w(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o.index=e}let n=y().kind===`Identifier`&&x(`\\in`,1)?je():D();if(C(`:`)){let e=Se();return w(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;C(`,`);)r.push(D());return w(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Ne=e=>{let t=m(e),n=T(()=>x(`>>`)||x(`>>_`)?[]:E(()=>D()));if(C(`>>_`)){if(n.length!==1)throw b(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:Ce().subscript,location:t}}return w(`>>`),{kind:`Tuple`,elements:n,location:t}},Pe=e=>{let t=m(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ye()){let e=Se();return w(`:`),{kind:n,bounds:e,body:D(),location:t}}let i=he(E(me));return w(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:D(),isTemporal:r,location:t}},Fe=e=>{let t=[];do{let n=o.index;if(C(`OTHER`))return w(`->`),{kind:`Case`,arms:t,other:D(),otherRange:_(n),location:m(e)};let r=D();w(`->`),t.push({condition:r,body:D()})}while(C(`[]`));return{kind:`Case`,arms:t,other:void 0,location:m(e)}},Ie=()=>{let e=y(1);return x(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||ry.has(e.text)||e.kind===`Operator`&&(Yv.has(e.text)||Zv.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&$v.has(e.text))},Le=()=>{let e=S();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.index--,{kind:`Bound`,args:Oe()}}return{kind:`Name`,name:e.text,args:x(`(`)?Oe():[]}},Re=e=>{let t=o.index,r=S(),a=m(r);if(i&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=E(pe);return w(`:`),{kind:`Lambda`,params:e,body:D(),location:a}}if(r.kind===`Number`){if(i&&/^\\[BOH]/.test(r.text))throw b(`incomplete expression`,r);return{kind:`Number`,value:c(r.text),text:r.text,location:a}}if(r.kind===`Decimal`)return{kind:`Decimal`,text:r.text,location:a};if(r.kind===`String`)return{kind:`String`,value:r.text,location:a};let u=r.kind===`Step`&&tt(r);if(!i&&u&&Qe()<0&&Ze.length<=1)throw b(`Step number used outside proof`,r);if(u&&r.text[1]===`+`)throw b(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||u){let n=u?nt(r)??r.text:r.text;if(be()){let o=he(C(`(`)?E(me):[]);o.names.length>0&&w(`)`),w(`::`);let c=_(t),l=D();if(!i&&e!==void 0&&s.last!==void 0&&xy(l)&&e.high>=s.last.low)throw b(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:n,params:o.names,paramRanges:o.ranges,head:c,body:l,location:a}}let c=x(`(`);if(n===`@`&&!c&&!Ie())return{kind:`ExceptAt`,location:a};let l=c?Oe():[],d=[c?De.range:void 0];if(!Ie())return c?{kind:`Apply`,operator:n,args:l,argumentsRange:De.range,location:a}:{kind:`Identifier`,name:n,location:a};let f=[{kind:`Name`,name:n,args:l}],p=[_(t,t)];for(;Ie();)S(),p.push(_(o.index,o.index)),De.range=void 0,f.push(Le()),d.push(De.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),g=f.flatMap(e=>`args`in e?e.args:[]),ee=f.map(e=>`args`in e?e.args.length:0),v=d.at(-1)??_(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:a}:g.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:a}:{kind:`Apply`,operator:h,args:g,...ee.slice(0,-1).some(e=>e>0)&&{argumentCounts:ee},argumentsRange:v,selectorRanges:p,argumentRanges:d,location:a}}if(r.kind===`Operator`&&Cy(r.text)&&x(`(`)){let e=Oe();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`&&Cy(r.text)&&!i)return{kind:`Identifier`,name:r.text,spelling:r.spelling,location:a};switch(r.text){case`(`:{let e=T(()=>D());return w(`)`),e}case`[`:return Ae(r);case`{`:return Me(r);case`<<`:return Ne(r);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Pe(r);case`IF`:{let e=D();w(`THEN`);let t=D();return w(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:D(),location:a}}case`CASE`:return Fe(r);case`LET`:{let e=[],t=[];for(l.push(/* @__PURE__ */ new Set);!C(`IN`);){if(i&&x(`RECURSIVE`))throw b(`Unexpected keyword RECURSIVE`,ae(te()));if(C(`RECURSIVE`)){Je();continue}let n=He(!i&&C(`LOCAL`));n.kind===`Instance`?t.push(n):e.push(n)}l.pop();let n=D();return t.length===0?{kind:`Let`,definitions:e,body:n,location:a}:{kind:`Let`,definitions:e,instances:t,body:n,location:a}}case`CHOOSE`:{let e=xe(),t=C(`\\in`)?D():void 0;return w(`:`),{kind:`Choose`,pattern:e,set:t,body:D(),location:a}}case`WF_`:case`SF_`:{let e=Ce(),t=!x(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:T(()=>{w(`(`);let e=D();return w(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:a}}}throw de(`Unexpected ${re(r)}`,r)},ze=(e,t,n)=>{s.last=s.preceding={low:t,high:n};let r=D(i?Math.min(n+1,qv.low):n+1),a=y(),o=Zv.has(a.text)?qv.high:Yv.get(a.text)?.high;if(!i&&a.kind===`Operator`&&o!==void 0&&o>=t)throw b(`Precedence conflict between ${e.text} and ${a.text}`,a);return r},Be=()=>{let e=s.preceding;s.preceding=void 0;let t=y(),n=m(t);if(t.kind===`Operator`&&Sy(t))return ke();if(i&&Yv.has(t.text)&&x(`(`,1)){let e=o.index,r=T(()=>{S(),S();let r=D();if(!C(`,`))return;let i=D();w(`)`);let a={kind:`Apply`,operator:t.text,args:[r,i],location:n};return v(a,e)});if(r!==void 0)return r;o.index=e}if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return S(),{kind:`Apply`,operator:`~`,args:[ze(t,4,4)],location:n};case`-`:case`-.`:if(t.text===`-.`&&!i)break;return S(),{kind:`Apply`,operator:`-.`,args:[ze(t,12,12)],location:n};case`[]`:return S(),{kind:`Always`,expression:ze(t,4,15),location:n};case`<>`:return S(),{kind:`Eventually`,expression:ze(t,4,15),location:n};case`ENABLED`:return S(),{kind:`Enabled`,expression:ze(t,4,15),location:n};case`UNCHANGED`:return S(),{kind:`Unchanged`,expression:ze(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return S(),{kind:`Apply`,operator:t.text,args:[i?D(9):ze(t,10,13)],location:n}}return Re(e)},D=(e=0)=>{let t=o.index,n=Be(),r={left:n.location.range?n:v(n,t),previous:void 0};for(;;){let n=y();if(n.kind!==`Operator`)break;let a=m(n);if(n.text===`'`&&e<=15){S(),s.last=qv,r.left=v({kind:`Prime`,expression:r.left,location:a},t);continue}if(Xv.has(n.text)&&e<=15){S(),s.last=qv,r.left=v({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:a},t);continue}if(n.text===`[`){S();let e=T(()=>E(()=>D()));T(()=>w(`]`)),s.last=Jv,r.left=v({kind:`FunctionApplication`,function:r.left,args:e,location:a},t);continue}if(n.text===`.`&&fe(y(1))){S();let e=S().text;r.left=v({kind:`FieldAccess`,record:r.left,field:e,location:a},t);continue}let o=Yv.get(n.text);if(!o||o.low<e)break;let c=r.previous;if(c){let e=!(c.low>o.high||c.high<o.low),t=c.text===n.text&&o.isAssociative;if(e&&!t&&(c.text!==`\\X`||n.text!==`\\X`))throw b(`Precedence conflict between ${c.text} and ${n.text}`,n)}if(S(),!i&&o.low>12&&x(`-`))throw b(`Precedence conflict between ${n.text} and -`,y());s.last=s.preceding=o;let l=D(o.high+1),u=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,i=[_(t).end];r.left=u.kind===e&&c?.text===n.text?{...u,operands:[...u.operands,l],prefixEnds:[...u.prefixEnds??[],...i]}:{kind:e,operands:[u,l],prefixEnds:i,location:a}}else r.left=n.text===`\\X`?u.kind===`Product`&&c?.text===`\\X`?{...u,factors:[...u.factors,l]}:{kind:`Product`,factors:[u,l],location:a}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[u,l],location:a};r.left=v(r.left,t),r.previous={...o,text:n.text}}return r.left},O=()=>{if(!C(`(`))return[];let e=qe();return w(`)`),e},Ve=()=>{let e=m(y()),t=D(),n=a[o.index-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:f[0].name,start:e,end:r}}},He=e=>{let t=o.index;return v(We(e),t)},Ue=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),We=e=>{let t=y(),n=o.index,r=m(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:_(n,o.index-2),...Ve(),isLocal:e,isRecursive:p(t),location:r});if(t.kind===`Identifier`&&y(1).kind===`Operator`&&Yv.has(y(1).text)&&y(2).kind===`Identifier`&&x(`==`,3)){let e=me(),t=S().text,n=me();return w(`==`),i(t,[Ue(e),Ue(n)])}let a=t.kind!==`String`&&$v.has(t.text),s=t.kind===`Identifier`&&Zv.has(y(1).text)&&x(`==`,2);if(a||s){let e=a?t.text:y(1).text;a&&S();let n=me();return s&&S(),w(`==`),i(e,[Ue(n)])}let c=pe();if(C(`[`)){let t=T(()=>Se());return w(`]`),w(`==`),{kind:`Function`,name:c,bounds:t,body:D(),isLocal:e,isRecursive:p(c),location:r}}let l=o.index,u=O();return w(`==`),x(`INSTANCE`)?{...Ge(c,u,e,r),definitionRange:_(l)}:i(c,u)},Ge=(e,t,n,r)=>{let i=o.index;return w(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ve(),substitutions:C(`WITH`)?E(()=>{let e=o.index,t=ge(),n=_(e);return w(`<-`),{name:t,nameRange:n,expression:Ee()}}):[],isLocal:n,location:r,instanceRange:_(i)}},k=()=>{let e=o.index;return v(Ke(),e)},Ke=()=>{let e=m(y());if(x(`_`)&&y(1).kind===`Operator`)return S(),{name:S().text,arity:C(`_`)?2:1,location:e};if(y().kind!==`String`&&($v.has(y().text)||i&&y().kind===`Operator`)&&x(`_`,1)){let t=S().text;return S(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=pe();if(!C(`(`))return{name:t,arity:0,location:e};let n=E(()=>w(`_`));return w(`)`),{name:t,arity:n.length,location:e}},qe=()=>E(k),Je=()=>{let e=qe();return e.forEach(e=>l[l.length-1].add(e.name)),e},Ye=e=>{let t={value:0,offset:e};do{let e=y(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&vy.has(e.text)&&t.value++,e.kind===`Operator`&&yy.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Xe=()=>{let e=y(),t=y(1);return e.kind===`Identifier`?x(`(`,1)||x(`[`,1)?x(`==`,Ye(1)):t.kind===`Operator`&&Zv.has(t.text)?x(`==`,2):t.kind===`Operator`&&Yv.has(t.text)?y(2).kind===`Identifier`&&x(`==`,3):x(`==`,1):e.kind!==`String`&&$v.has(e.text)&&t.kind===`Identifier`&&x(`==`,2)},Ze=[],Qe=()=>Ze[Ze.length-1]??-1,$e=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),et=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},tt=e=>!e.text.endsWith(`.`)&&!ly.has(et(e)),nt=e=>{let t=et(e);if(ly.has(t))return;let n=$e(e);if(n>=0)return`<${n}>${t}`;let r=Qe(),i=Ze[Ze.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},rt=e=>{if(e.kind===`Keyword`)return oy.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Ze.length===0;if(e.text[1]===`+`||Ze.length===0)return!0;let t=Qe();return t>=0&&$e(e)>t},it=e=>{let t=$e(e),n=Ze.length-1,r=Ze[n-1]??-1,i=Ze[n]<0;return i&&(Ze[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Ze[n]===t},at=e=>!u.has(e)&&f.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),ot=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!by.has(e.name)&&!at(e.name):!1,st=()=>{let e=y();return e.kind===`Step`?tt(e):e.kind===`Keyword`?hy.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Xe()},ct=()=>{let e=o.index,t=y();return t.kind===`Operator`&&!ey.has(t.text)&&Cy(t.text)?(o.index++,v({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:m(t)},e)):C(`MODULE`)?v({kind:`ModuleFact`,name:pe(),location:m(t)},e):D()},lt=e=>d[d.length-1]?.add(e),ut=e=>{d.push(/* @__PURE__ */ new Set);let t=e();return d.pop(),t},dt=e=>d.some(t=>t.has(e))||f.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),ft=()=>{let e=o.index,t=y(),n=E(()=>{let e=y();if((e.kind!==`Identifier`||se(e))&&e.kind!==`Operator`)throw de(`Expected a definition name but found ${re(e)}`,e);return o.index++,e.text},`!`),r=m(t);return v(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},pt=()=>{if(i)return E(ft);let e=E(ct),t=n===`tlc`?e.find(e=>e.kind===`Identifier`&&dt(e.name)):void 0;if(t)throw b(`DEF clause entry should describe a defined operator`,t.location);return e},mt=()=>{let e=st()?E(ct):[],t=C(`DEF`)||C(`DEFS`);if(i&&e.length===0&&!t)throw de(`Expected a fact`);return{facts:e,defs:t?pt():[]}},ht=()=>{let t=o.index,r=S(),i=r.text===`USE`&&C(`ONLY`),a=_(t),s={kind:r.text===`USE`?`Use`:`Hide`,isOnly:i,...mt(),keyword:a,location:m(r)},c=s.kind===`Hide`&&n===`tlc`?s.facts.filter(e=>!ot(e)):[];if(c.length>0)throw e.q(c.map(n=>({location:e.X(n.location.range??_(t)),message:`The only expression allowed as a fact in a HIDE is
1785
+ the name of a theorem, assumption, or step.`})));return v(s,t)},gt=()=>{let e=o.index,t=m(y()),n=C(`NEW`),r=i?o.index:e,a=i?m(y()):t,s=y().kind===`Keyword`?gy.get(y().text):void 0;if(!n&&s===void 0)throw de(`Expected a declaration but found ${re(y())}`);if(s!==void 0&&S(),s===`Variable`){let e=me();return lt(e.name),v({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:a},r)}let c=k();lt(c.name);let l=(s??`Constant`)===`Constant`&&x(`\\in`);if(l&&c.arity>0)throw b(`declared symbol with arguments before \\in`);return l&&S(),v({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?D():void 0,nameRange:c.location.range,location:a},r)},_t=()=>{let e=o.index,t=m(w(`ASSUME`)),n=E(()=>(y().kind===`Identifier`&&x(`::`,1)&&x(`ASSUME`,2)&&(S(),S()),x(`ASSUME`)?ut(_t):y().kind===`Keyword`&&_y.has(y().text)?gt():D()));return w(`PROVE`),v({kind:`AssumeProve`,assumptions:n,conclusion:D(),location:t},e)},vt=e=>{let t={value:0};for(;y(t.value).kind===`Identifier`&&x(`,`,t.value+1);)t.value+=2;return y(t.value).kind===`Identifier`&&x(e,t.value+1)},yt=(e,t)=>{e.forEach(lt),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(lt))},bt=()=>{let e=y();if(x(`USE`)||x(`HIDE`))return ht();if(x(`INSTANCE`)){let t=o.index;return v(Ge(void 0,[],!1,m(e)),t)}if(x(`DEFINE`)||Xe()){let t=o.index;C(`DEFINE`);let n=[He(!1)];for(;Xe();)n.push(He(!1));let r={kind:`Define`,definitions:n,location:m(e)};return v(r,t)}if(C(`HAVE`))return{kind:`Have`,expression:D()};if(C(`TAKE`)){let e=ye(),t=he(e?[]:E(me)),n=e?Se():[];return yt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(C(`WITNESS`))return{kind:`Witness`,expressions:E(()=>D())};if(C(`PICK`)){let e=vt(`:`),t=he(e?E(me):[]),n=e?[]:Se();return yt(t.names,n),w(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:D()}}return C(`CASE`)?{kind:`Case`,expression:D()}:{kind:`Assert`,isSuffices:C(`SUFFICES`),statement:x(`ASSUME`)?_t():D()}},xt=e=>{let t=y();if(t.kind!==`Step`)throw de(`Expected a step number but found ${re(t)}`,t);if(!it(t))throw b(`${e?`QED step`:`step`}'s number has bad level`,t);if(n!==`sany`&&$e(t)<0&&nt(t)!==void 0)throw b(`<*> and <+> cannot be used for a named step`,t);return o.index++,{name:nt(t),token:t.text,location:m(t)}},St=()=>{let e=o.index,t=xt(x(`QED`,1)),n=o.index,r=/* @__PURE__ */ new Set;d.push(r);let i=C(`QED`)?{kind:`Qed`}:bt(),a=_(e),s=_(n),c=rt(y());if(c&&!sy.has(i.kind))throw b(`Proof of a step that does not take a proof`);let l=c?Tt():void 0;return d.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(lt),v({...t,body:i,head:a,statement:s,proof:l},e)},Ct=e=>{if(C(`BY`)){let t=_(o.index-1);return{kind:`By`,isOnly:C(`ONLY`),...mt(),keyword:t,location:e}}let t=y();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;S();let n=_(o.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},wt=()=>{let e=m(y());C(`PROOF`);let t=Ct(e);if(t)return t;let n=[St()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(St());return{kind:`Steps`,level:Qe(),steps:n,location:e}},Tt=()=>{let e=o.index;Ze.push(-1);let t=ut(wt);return Ze.pop(),v(t,e)},Et=()=>y().kind===`Step`||y().kind===`Keyword`&&oy.has(y().text),Dt=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return py(e);let n=t.defs[t.defs.length-1]?.location.range;return fy(py({...e,end:e.start}),py(n??t.keyword))},Ot=()=>{let e=o.index,t=m(y()),n=C(`PROOF`),r=Ct(t);if(r){let t=v(r,e);return{kind:`Leaf`,proof:t,span:py(t.keyword),first:e,end:o.index-1}}let i=y();if(i.kind!==`Step`)throw de(`Expected a step number but found ${re(i)}`);let a=o.index;S();let s=o.index,c=C(`QED`)?{kind:`Qed`}:bt(),l=_(a);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:_(s),span:Dt(l,c),first:e,start:a,end:o.index-1}},kt=(e,t,n,r)=>{let i=e[t];if(!i)return{proof:void 0,span:r,next:t,end:void 0};if(i.kind===`Leaf`)return{proof:i.proof,span:i.span,next:t+1,end:i.end};let o=At(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={...m(a[i.first]),range:_(i.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},At=(e,t,n,r,i)=>{let a=e[t];if(!a)throw my(`Unexpected end of (sub)proof at level ${n} before QED step`,r);if(a.kind===`Leaf`)throw my(`Expecting a proof step but found a${uy[a.proof.kind]} leaf proof`,a.span);if(!i&&a.isProof)throw my(`PROOF keyword found in step that does not begin subproof`,a.span);let o=a.token.text[1];if(o===`+`&&!i)throw my(`<+> used but no subproof expected`,a.span);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:$e(a.token);if(s<n||!i&&s>n)return;let c=sy.has(a.body.kind)?kt(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:nt(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{...m(a.token),range:_(a.start,l)}},d=fy(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=At(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:fy(d,f.span)}},A=()=>{if(!Et())return;let e=[];for(;Et();)e.push(Ot());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=kt(e,0,0,t.span),r=e[n.next];if(r)throw my(`extra step(s) after finished proof`,r.span,`Proof.Parser.toplevel`);return n.proof},jt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},Mt=e=>{let t=o.index,n=S(),r=y().kind===`Identifier`&&x(`==`,1)?pe():void 0;r!==void 0&&(u.add(r),S());let a=ut(()=>{let e=x(`ASSUME`)?_t():D();return i?{statement:e,proof:A()}:{statement:e,proof:rt(y())?Tt():void 0}}),s=a.statement,c=v({name:r,statement:s,proof:a.proof,location:m(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&s.kind!==`AssumeProve`&&jt(e,v({kind:`Operator`,name:r,params:[],body:s,isLocal:!1,isRecursive:!1,location:m(n)},t))},j=()=>{let e=o.index,t=S(),n=y().kind===`Identifier`&&x(`==`,1)?pe():void 0;return n!==void 0&&(u.add(n),S()),v({name:n,expression:D(),isAxiom:t.text===`AXIOM`,location:m(t)},e)},Nt=()=>{let e=m(w(`----`));w(`MODULE`);let t=ve();w(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(f.push(n),l.push(/* @__PURE__ */ new Set),C(`EXTENDS`)&&E(()=>{let e=o.index;n.extends.push(ve()),n.extendsRanges.push(_(e))});;){let t=o.index;ie.index=t;let r=y();if(r.kind===`ModuleEnd`)return e.range={module:f[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},f.pop(),l.pop(),n;if(r.kind===`Separator`){if(x(`MODULE`,1)){let e=Nt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),w(`====`);continue}S()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=m(S()),r=qe();n.constants.push(...r),e.range=_(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=m(S()),r=E(()=>{let e=o.index,t=m(y());return v({name:pe(),arity:0,location:t},e)});n.variables.push(...r),e.range=_(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=j();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&jt(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(x(`USE`)&&x(`ONLY`,1))throw de(`Expected a module unit but found ${re(r)}`);let e=ht();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=m(S()),r=Je();e.range=_(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:Pt(n,v(Ge(void 0,[],!1,m(r)),t));continue;case`LOCAL`:if(S(),x(`INSTANCE`)){Pt(n,v(Ge(void 0,[],!0,m(r)),t));continue}Pt(n,v(We(!0),t));continue}r.kind===`Keyword`&&ay.has(r.text)?Mt(n):Pt(n,He(!1))}}},Pt=(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}))},Ft=Nt(),It=_e.isUsed?Kv(t):void 0;if(It!==void 0)throw new e.F(It);return Ft},Dy=e=>Ey(e,`tlc`),Oy=(e,t)=>Ey(e,`tlc`,t),ky=e=>Ey(e,`tlapm`),Ay=e=>Ey(e,`sany`),jy=`$subexpression`,My=(t,n)=>new e.F(`${t} at line ${n.line}, column ${n.column}`),Ny=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Ny(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of D(e)){let e=Ny(r,t,n);if(e)return e}},Py=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Fy=(e,t)=>{let n=e.location,r=Py(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 My(`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 My(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:jy,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:jy,args:e.args,location:n,resolution:vs},location:n}},Iy=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:vs})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:vs}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:vs};return Fy({...t,params:[...t.params,...r]},a)},Ly=(t,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s={index:0,current:void 0,isFailed:!1},c=(n,i)=>{if(!n)throw My(i,a);bs.set(r,{args:t.slice(0,s.index).flatMap(e=>`args`in e?e.args:[]),error:{location:e.X(n),message:i}}),s.isFailed=!0},l=e=>{let r=[],i=[];for(;s.index<t.length;){let o=t[s.index];if(o.kind!==`Name`)throw My(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=e?e.find(e=>Hc(e)===c):n(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s.index++}throw My(`Unknown operator ${r.join(`!`)}`,a)},u=e=>{let n=l(e),u=n.definition,d=Ts(u),f=s.index===t.length-1;if(n.args.length!==d&&(!i||n.args.length!==0))return c(r.argumentRanges?.[s.index]??a.range,`The operator ${n.name} requires ${d-n.earlier} arguments.`);if(f)return{definition:u,args:n.args};if(u.kind!==`Operator`)throw My(`Cannot select a subexpression of ${u.name}`,a);o.params.push(...u.params),o.args.push(...n.args),s.current=u.body,s.index++},d=()=>{for(;s.index<t.length&&!s.isFailed;){let e=t[s.index];if(e.kind!==`Name`)return;let n=r.selectorRanges?.[s.index],a=s.current&&Ny(s.current,e.name,[]);if(!a)return c(n,`Cannot find label \`${e.name}'.`);let l=a.label.params;if(!i&&e.args.length!==l.length)return c(n,`Label \`${e.name}' used with wrong number of arguments.`);o.lets.push(...a.lets),o.params.push(...l.map(e=>({name:e,arity:0}))),o.args.push(...e.args),s.current=a.label.body,s.index++}},f=e=>{let n=s.current;if(!n)throw My(`Subexpression selection failed`,a);if(e.kind===`Colon`)return;if(n.kind===`Label`){s.current=n.body,f(e);return}if(n.kind===`Let`){if(e.kind!==`Operand`||Ks(e.operand,1)!==0)throw My(`A LET/IN expression has only one operand`,a);o.lets.push(n.definitions),s.current=n.body;return}let r=Xs(n);if(r&&(e.kind===`Bound`||e.kind===`At`)){o.params.push(...r.names.map(e=>({name:e,arity:0}))),e.kind===`Bound`&&o.args.push(...e.args),s.current=r.body;return}if(n.kind===`Case`&&e.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],i=r[Ks(e.operand,r.length)],o=t[s.index+1];if(!i||o?.kind!==`Operand`)throw My(`A subexpression of CASE must have the form !i!j`,a);s.index++;let c=Ks(o.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw My(`Nonexistent CASE operand`,a);s.current=l;return}if(e.kind!==`Operand`)throw My(`Unexpected subexpression selector`,a);let i=r?r.sets:Zs(n),c=i?.[Ks(e.operand,i.length)];if(!c)throw My(`Nonexistent operand specified by the selector`,a);s.current=c},p=u(void 0);if(s.isFailed)return r;if(p)return Iy(p.definition,{...o,args:p.args});for(d();s.index<t.length&&!s.isFailed;){let e=t[s.index];if(e.kind===`Name`){for(;s.current?.kind===`Label`;)s.current=s.current.body;if(s.current?.kind!==`Let`)throw My(`A name selector here must be from a LET clause`,a);o.lets.push(s.current.definitions);let e=u(s.current.definitions);if(s.isFailed)return r;if(e)return Iy(e.definition,{...o,args:[...o.args,...e.args]});d()}else f(e),s.index++}if(s.isFailed)return r;if(!s.current)throw My(`Subexpression selection failed`,a);return Fy(o,s.current)},Ry=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return qs(e,t,n)},zy=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||D(e).some(zy),By=(e,t,n,r=!1)=>{if(!zy(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Gc(e,e=>By(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>Vy(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)=>By(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Gc(e,e=>By(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?Ry(a.name,[],void 0,t):a.kind===`Apply`?Ry(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Ly(o,t,a,r);return c!==a&&ys.add(c),c},Vy=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:By(e.expression,t,n,!0)}))}),Hy=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Uy=(e,t)=>Vy(e,Hy(t.definitions),()=>!1),Wy=(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=Hy([...t,...e.definitions]),a=e=>n.has(e),o=Hy([...t,...e.definitions,...r]),s=e=>By(e,o,e=>a(e)&&r.every(t=>t.name!==e)),c=e=>a(e)||!i(e),l=e=>By(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 Vy(e,i,c);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?Vy(e,i,c):Wc(e,l))};case`Have`:case`Case`:return{...e,expression:l(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(l)};case`Take`:return{...e,bounds:d(e.bounds)};case`Pick`:return{...e,bounds:d(e.bounds),body:l(e.body)};case`Assert`:return{...e,statement:f(e.statement)};default:return e}},m=e=>e?.kind===`By`?{...e,facts:u(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:p(e.body),proof:m(e.proof)}))}:e,h={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:f(e.statement),proof:m(e.proof)})),uses:e.uses.map(e=>({...e,facts:u(e.facts)}))};return e.definitions.some(e=>zy(e.body))||e.assumptions.some(e=>zy(e.expression))?{...h,definitions:e.definitions.map(e=>Wc(e,s)),assumptions:e.assumptions.map(e=>({...e,expression:s(e.expression)}))}:h},Gy=(e,t)=>e.maxLevels[t]??3,Ky=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=Zl({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(e,a),a},i=/* @__PURE__ */ new Map,a=e=>{let n=i.get(e);if(n)return n;let a=t(e),o=r(e),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Ol(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Ol(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>kl(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Tl(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&Ol(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(Ql(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c};return n=>{let i=/* @__PURE__ */ new Map,o=e.X(n.location.range??{module:n.instancer,start:n.location,end:n.location}),s=e=>i.set(`${o}\n${e}`,{location:o,message:e}),c=t(n.module),l=a(n.module),u=r(n.instancer),d=/* @__PURE__ */ new Map;n.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...c.constants.map(e=>({...e,maximumLevel:0})),...c.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let t=n.substitutions.get(e.name);if(!t)return[];if(e.arity===0){let n=u.analyze(t,d);return[{...e,level:n.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(t,d);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),p=(e,t)=>`Level error in instantiating module '${n.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${t}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&s(p(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${n.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let t=l.constraints.get(e.name);t!==void 0&&e.level>t&&s(p(e.name,t));let r=e.operator;r&&Array.from({length:e.arity},(t,i)=>{let a=l.argConstraints.get(Cl(e.name,i));a!==void 0&&Gy(r,i)<a&&s(`Level error in instantiating module '${n.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),l.argParams.forEach(e=>{let t=Tl(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=Gy(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()])}},qy=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],Jy=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Yy=new Map(yf.flatMap(e=>e.map(t=>[t,e[0]]))),Xy=e=>Yy.get(e)??e,Zy=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},Qy=()=>{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}}},$y=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:Zy(e)&2147483647,kind:t,isLocal:n}),eb=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:Xy(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:Xy(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}},tb=(e,t)=>{let n=[];for(let r=t;;){let t=eb(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},nb=e=>({line:e.line,column:e.column}),rb=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text===`.`)continue;else if(a.text===`EXTENDS`){let n=tb(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},ib=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,ab={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},ob=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&ib(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&ib(e[n+1],e[n+2])?n+=ib(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=>ab[e])}"`:r.text)}return t},sb=e=>e[2]?.text,cb=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},lb=(e,t)=>e.find(e=>e.name===t)??e.map(e=>lb(e.modules,t)).find(Boolean),ub=e=>{let t=e===void 0?[]:oe(e),n={module:void 0};return{tokens:t,ranges:cb(t),getModule:()=>n.module??=e===void 0?Dy(``):Oy(e,t)}},db=(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=ub(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:t?.(i)??Cf.get(i)??Ef.get(i)??Ty(e,i),{tokens:c,ranges:l,getModule:u}=a(s),d=l.get(sb(c)??``)??{start:0,end:0},f={tokens:c,...d,getModule:u};return n.set(i??``,f),l.forEach((e,t)=>{e.start===d.start||r.has(t)||r.set(t,{tokens:c,...e,getModule:()=>lb(f.getModule().modules,t)??f.getModule()})}),f};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},fb=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=tb(t,e+1);i.push({location:nb(t[e]),apply:e=>r.forEach(t=>e.put($y(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c=new Set(n.units.flatMap(e=>e.kind===`Constants`||e.kind===`Variables`?[`${e.location.line}:${e.location.column}`]:[])),l={value:0};t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r,d=t[u];if(d.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l.value++,l.value===2){let e=t[u+2].text;i.push({location:nb(d),apply:t=>t.put($y(e,`module`,!1))})}return}if(d.kind===`ModuleEnd`&&l.value--,l.value!==1||d.kind!==`Keyword`)return;let f=c.has(`${d.line}:${d.column}`);f&&(d.text===`CONSTANT`||d.text===`CONSTANTS`)&&o(u,`constant`),f&&(d.text===`VARIABLE`||d.text===`VARIABLES`)&&o(u,`variable`),d.text===`RECURSIVE`&&tb(t,u+1).every(e=>s.has(e))&&o(u,`definition`),Jy.has(d.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(nb(d)),i.push({location:nb(d),apply:e=>e.put($y(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($y(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=Xy(e.name);i.push({location:e.location,apply:n=>n.put($y(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($y(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put($y(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>ws(e.location,t.location)?-1:+!!ws(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=Qy();n.set(i??``,o),vf.toReversed().forEach(e=>o.put($y(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)}}},pb=(t,n)=>{let r=/* @__PURE__ */ new Set,i=e=>{r.add(e)},a=e=>{e.kind===`ModelValue`&&i(e.name),e.kind===`String`&&i(e.value),e.kind===`Set`&&e.elements.forEach(a)};n.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),bf.forEach(i);let o=e=>{let n=t(e);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=rb(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),ee=/* @__PURE__ */ new Set([void 0]),_=/* @__PURE__ */ new Map;ob(o(void 0)).forEach((e,t)=>{t===3&&Sf.forEach(i),i(e)});let v=l(void 0);for(;;){let n=h(v,/* @__PURE__ */ new Set)??g(v,/* @__PURE__ */ new Set);if(!n)break;let[r,a]=n;if(d.add(`${r.key}>${a}`),_.set(r.unit,[..._.get(r.unit)??[],a]),!ee.has(a)){if(ee.add(a),t(a).tokens.length===0){let n=r.unit??sb(t(void 0).tokens);throw e.K(a,n)}ob(o(a)).forEach(i)}}qy.forEach(i);let te=/* @__PURE__ */ new Set,ne=e=>{if(te.has(e))return;te.add(e);let t=_.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(ne),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return ne(void 0),xf.forEach(i),[...r]},mb=(e,t)=>{let n=db(e,t),r=n.getParsed,i,a=()=>i??=fb(r);return{getStringOrder:e=>pb(r,e),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let{getContext:e,getOwnEntries:t}=a();return e(void 0),e=>t(e).filter(e=>e.kind===`definition`).map(e=>e.name)}}},hb=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),gb=t=>{switch(t.kind){case`Number`:if(!Ft(t.value))throw e.it(new e.O(`TLC can't handle a number this big.\n${t.value}`),e.tt.error);return t.value;case`String`:case`Boolean`:return t.value;case`ModelValue`:return bn(t.name);case`Set`:return N({kind:`MixedSet`,elements:t.elements.map(gb)})}},_b=t=>{try{return gb(t)}catch(t){throw!(t instanceof e.b)||t instanceof e.O||t instanceof e.x?t:e.it(new e.b(`${e.G}${t.message}`),e.tt.error)}},vb=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],yb=(t,n,r)=>{try{return r.parseModule(t)}catch(r){if(!(r instanceof e.F))throw r;let i=Kv(t);throw i===void 0?r:e.q([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},bb=t=>new e.F(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),xb=(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)}.`},Sb=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,Cb=e=>e===`Theorem`?`ThmOrAssumpDefNode`:Sb(e),wb=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:cl(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),Tb=(t,n,r)=>{let i=`{ ${r.map(e=>`<${[...e[0],e[1]].map(e=>I(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`)&&Fn(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:I(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},Eb=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||D(e).some(e=>Eb(e,t)),Db=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(rl(e),n.get(e)??n.size)),n},Ob=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),kb=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw mh(e);if(e.kind===`Number`&&!Ft(e.value))throw hh(e);kb(e.kind===`Let`?[...D(e),...Ob(e.instances??[])]:D(e))}),Ab=(t,n)=>{let r=n.order??mb(n.source,n.loadModule),i=r.parseModule(n.source),a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Set,l=/* @__PURE__ */ new Set,u=new Map(Lf.map(e=>[e.name,e])),d=/* @__PURE__ */ new Map,f=Wd(t.checkDeadlock,n.seed);f.isWarningEnabled=n.isWarningEnabled??!0,f.isTool=n.isTool??!1,f.version=n.version??`master`;let p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,h=[],g=/* @__PURE__ */ new Map,ee=[],_=[],v=(e,t)=>ee.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),te=0,ne=e=>`${e}#${te++}`,y=[],re=[],ie=Ky(e=>{let t=m.get(e)??fe(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)}}),ae=/* @__PURE__ */ new Map,oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,ce=e=>{let t=d.get(e);if(t)return t;let r=ip(e,n.print,f,n.files,u);if(!r)return;rp.get(e)?.forEach(ce);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>ce(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{u.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:bl.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Sl(e,t.name)??i.get(t.name)?.range})}),d.set(e,i),i},le=e=>{let t=rp.get(e)??[];if(e===`TLCExt`||[e,...t].some(e=>n.loadModule?.(e)!==void 0))return;let r=ce(e);return r&&v(e,t),r&&t.includes(`Integers`)&&ce(`Integers`),r},b=e=>(kb([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...Ob(e.instances)]),e.modules.forEach(b),e);b(i);let ue=(t,i)=>{let a=n.loadModule?.(t)??Of(f.version).get(t)??Ty(n.source,t);if(a===void 0)throw e.K(t,i);let o=yb(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 b(o)},de=t=>{let n=_.indexOf(t.name);if(n!==-1){let r=[..._.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=[];_.push(t.name),ee.push(r);let s=ve(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:re,levelChecks:o});if(ee.pop(),_.pop(),a.length>0)throw e.q(a,!1,void 0,re);let c=i.find(e=>r.has(e.name)),l=c&&p.get(c.name),u=l&&xb(c,l.module);if(u)throw e.q([u],!1,void 0,re);if(c)throw bb(c);return o.forEach(e=>e()),{linked:s,closure:r}},fe=(t,r)=>{let i=p.get(t);if(i)return v(t,g.get(t)??[]),i;let o=de(ue(t,r)),s=/* @__PURE__ */ new Map;return np(t,n.print,f,n.files,u,(t,n,r)=>{let i=s.get(t),a=n.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(i?.kind!==`Operator`||!r||a.length!==n.length)throw new e.b(`No definition of ${t} to fall back to`);let o={kind:`Closure`,name:i.name,params:i.params,body:i.body,scope:void 0};return U(i.body,{environment:r.environment,scope:xg(o,a,r),state:r.state,next:r.next,isKeepLazy:r.isKeepLazy})})?.forEach(e=>{let n=o.linked.visible.get(e.name);if(n?.kind!==`Definition`||n.arity!==e.arity&&hb.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),v(t,o.closure),o.linked},x=(e,t,n,r,i)=>{let u=i?void 0:le(e.module);if(u)return S(e,u);let d=i??fe(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=vb(d),p=`#${te++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=Nc(Uy(e,t),f,t,n);y.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>l.add(e));let ee=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,_=hl({params:g,substitutions:new Map([...h].map(([e,t])=>[e,zc(t,m)])),variables:new Set(d.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>o.get(e)===!0,addDefinition:(n,i,l)=>{let u=ne(`${i}@${t.name}`),d=l(u);return a.set(u,d),f.length>0&&c.add(d),e.name!==void 0&&oe.set(u,`${e.name}!${oe.get(n)??i}`),o.set(u,!r),s.set(u,{source:n,prefix:e.params.length}),u},createName:ne,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{...ee.start,range:ee}}}});return C(e,d.exported,f,(t,n)=>{let r=e.name===void 0?_.getKey(t):_.getQualifiedKey(t);return f.length>0&&ae.set(r,{name:n,location:e.location}),e.name!==void 0&&se.set(r,n),r})},S=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),C=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:o.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},w=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:ll(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),pe=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),me=(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=pe(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:ll(r,n),location:n}}},he=(e,t,n,r)=>{let i=e.location,s=r?void 0:le(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=pe(n.arity);return w(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??fe(e.module,n),l=`#${te++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=vb(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};y.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>Eb(f(e),p),h=d.map(t=>{let n=me(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=[],ee=hl({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:ll(e.params,i),location:i,resolution:vs}:cl(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>o.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:wb(a,i)),i},createName:ne}),_=new Set(d.map(e=>e.name)),v=[...c.exported].filter(([e])=>!_.has(e)).map(([t,n])=>{let r=ee.getKey(n.key),a=pe(n.arity),o=[...e.params,...a];return w(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...g,...v]},ge=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),_e=/* @__PURE__ */ new Map,ve=(t,r)=>{let s=T_(t,n.loadClass?.(t.name),t===i);_e.set(t.name,s.overrides);let c=s.module,l=y.length,u=new Map([...Lf.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:Oc,errors:[],warnings:[]},p=[f],g=t=>t.forEach((t,n)=>{let r=ee.get(n);if(!r){u.set(n,t),ee.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);Cb(r.kind)===Cb(t.kind)?f.warnings.push({location:i,message:`Warning: the ${Sb(r.kind)} of '${n}' conflicts with \nits ${Sb(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${Sb(t.kind)} of '${n}' conflicts with \nits ${Sb(r.kind)} at ${a}.`})}),ee=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Set,v=/* @__PURE__ */ new Map,te=[],ne=[...c.constants],ae=c.variables.filter((e,t)=>c.variables.findIndex(t=>t.name===e.name)===t),oe=ae.map(e=>e.name),ce=ae.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:le(e);if(n){g(n);return}let i=t??fe(e,c.name);ne.push(...i.constants.filter(e=>ne.every(t=>t.name!==e.name)&&!oe.includes(e.name))),i.variables.forEach((e,t)=>{oe.includes(e)||ne.some(t=>t.name===e)||(oe.push(e),ce.push(i.variableLocations[t]))}),g(i.exported),i.facts.forEach(e=>_.add(e)),i.modules.forEach((e,t)=>v.set(t,e)),te.push(i)});let b=new Map(u),ue=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],de=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});ue.forEach(e=>ee.set(e.name,de(e)));let w=e=>({key:me(e),arity:Ts(e),params:Es(e),kind:kc(c,e)?`Theorem`:`Definition`,range:e.location.range}),pe=ne.length===0&&oe.length===0,me=e=>c===i?e.name:`${e.name}@${r.id}`,T=/* @__PURE__ */ new Map,E=()=>new Map([...r.modules,...v]),ye=e=>{let t=c.modules.find(t=>t.name===e.module);return t?ws(t.location,e.location)?v.get(t.name):void 0:E().get(e.module)},be=e=>({imported:u,getInstance:e=>{let t=ye(e),n=t?void 0:le(e.module);if(n)return{declarations:[],symbols:S(e,n),instancer:c.name};let r=t??fe(e.module,c.name),i=vb(r);return{declarations:i,symbols:C(e,r.exported,i,e=>e),instancer:c.name}},bound:b,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:me,instanced:T,facts:_,reports:p,warnings:r.warnings}),xe=e=>[...ue.filter(t=>ws(t.location,e)).map(e=>[e.name,de(e)]),...c.definitions.filter(t=>ws(t.location,e)).map(e=>[e.name,w(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(u)),Se=e=>{let t=E(),n=t.get(e.name),i=n&&xb(e,n.module);if(n&&!i)throw bb(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};p.push(a);let o=ve(e,{id:`${r.id}/${e.name}`,symbols:xe(e.location),modules:t,nested:r.nested,errors:a.errors,warnings:a.warnings,levelChecks:r.levelChecks});i&&a.errors.push(i),n||v.set(e.name,o)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=x(e,c,be(c),pe,E().get(e.module));T.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||ee.set(n,t))})}})),...c.modules.map(e=>({location:e.location,link:()=>Se(e)}))].sort((e,t)=>ws(e.location,t.location)?-1:1).forEach(e=>e.link());let Ce=Wy(yl(c,(e,t)=>he(e,t,c.name,ye(e))),ge(u));r.errors.push(...Fc(Ce,be(Ce))),Ce.definitions.forEach(e=>{let t=me(e);a.set(t,e),o.set(t,!pe);let n=w(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!ws(r,e.location))&&(u.set(e.name,n),e.isLocal||ee.set(e.name,n))});let we={module:Ce,constants:ne,variables:oe,variableLocations:ce,visible:u,exported:ee,modules:v,extended:te,facts:/* @__PURE__ */ new Set([..._,...[...Ce.theorems,...Ce.assumptions].flatMap(e=>e.name??[])])};m.has(c.name)||m.set(c.name,we);let Te=y.splice(l).map(e=>({location:e.location,check:()=>ie(e)}));return r.levelChecks.push(()=>$l(Ce,{constants:new Set(ne.map(e=>e.name)),variables:new Set(oe),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>se.get(u.get(e)?.key??e)},Te,re)),h.push(we),we},T=de(i).linked,E=n.traceFile,ye=E===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:E}}],be=[...n.moduleOperators??[],...ye].map(e=>{let t=fe(e.module,i.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});h.push(...h.splice(h.indexOf(T),1)),re.length>0&&!n.isSanyReported&&n.print(e.Z(re));let xe=e=>T.visible.get(e)?.key??e;T.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)}),be.forEach(e=>{let t=e.key===void 0?void 0:a.get(e.key);e.kind!==`postcondition`&&t&&a.set(e.operator,t)});let Se=[],Ce=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Ce(e,t)),Se.push(...e.module.assumptions))};Ce(T,/* @__PURE__ */ new Set);let we=T.constants.map(e=>e.name),Te=T.variables,Ee=new Map([...d,...[...p].map(([e,t])=>[e,t.visible]),[i.name,T.visible]]),De=e=>{let t=Ee.get(e.module??``)?.get(e.name);return t?.kind===`Definition`?t:void 0},Oe=e=>{if(e.module===void 0)return[e.name,xe(e.name)];let t=De(e);return t?[t.key]:[]},ke=e=>e.module===i.name?[]:Oe(e),Ae=e=>{let t=a.get(e);return t?.kind===`Operator`?t.params.length:T.constants.find(t=>t.name===e)?.arity??u.get(e)?.arity??0},je=/* @__PURE__ */ new Map,Me=/* @__PURE__ */ new Set,Ne=(e,t)=>{u.set(e,t),a.delete(e),je.delete(e),Me.add(e)};t.constants.filter(e=>e.args===void 0).forEach(e=>{let t=_b(e.value);pr(t),ke(e).forEach(e=>{let n=Ae(e);n===0?je.set(e,t):Ne(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Pe=/* @__PURE__ */ new Map;t.constants.forEach(t=>{if(t.args===void 0)return;let n=`${t.module??``}!${t.name}`,r=Pe.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(gb),gb(t.value)]),Pe.set(n,r)}),Pe.forEach(e=>ke(e).forEach(t=>Ne(t,Tb(e.name,Ae(t),e.rows))));let Fe=new Map(t.substitutions.flatMap(e=>Oe(e).map(t=>[t,xe(e.target)])));[...Fe.keys()].forEach(e=>je.delete(e));let Ie=(t,n,r)=>{let i=xe(n),o=a.get(i);if(!(o!==void 0||u.has(i)||je.has(i)||we.includes(n)||Te.includes(n)))throw new e._(`The configuration file substitutes for ${t} with the undefined identifier ${n}.`);if(o?.kind===`Operator`&&o.params.length!==r)throw new e._(`The configuration file substitutes for ${t} with ${n} of different number of arguments.`)};t.substitutions.filter(e=>e.module===void 0).forEach(n=>{let r=n.name,i=n.target;if(!we.includes(r)&&!T.visible.has(r))throw new e._(`In the configuration file, the identifier ${r} does not appear in the specification.`);if(t.substitutions.some(e=>e.name===i))throw new e._(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);Ie(r,i,T.constants.find(e=>e.name===r)?.arity??T.visible.get(r)?.arity)});let Le=t.substitutions.filter(e=>e.module!==void 0);[...Ee.keys()].forEach(t=>{let n=Le.filter(e=>e.module===t);n.forEach(t=>{let r=De(t);if(r){if(n.some(e=>e.name===t.target))throw new e._(`In the configuration file, the identifier ${t.target} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);Ie(t.name,t.target,r.arity)}});let r=n.find(e=>!De(e));if(r)throw new e._(`In the configuration file, the identifier ${r.name} does not appear in the specification.`)});let Re=Le.find(e=>!Ee.has(e.module??``));if(Re)throw new e._(`In the configuration file, the module name ${Re.module} is not a module in the specification.`);let ze=new Set([...t.constants,...t.substitutions].filter(e=>e.module!==void 0).flatMap(ke)),Be=(e,t)=>{if(ze.has(e))return{key:e,prefix:t};let n=s.get(e);return n&&Be(n.source,t+n.prefix)};s.forEach((e,t)=>{let n=Be(e.source,e.prefix),r=a.get(t);if(!n||!r)return;let i=r.kind===`Operator`?r.params:[],o=w(t,n.key,i,i.slice(n.prefix),r.location);a.set(t,o),T.visible.forEach((e,n)=>{e.key===t&&n!==t&&a.set(n,o)})}),be.forEach(e=>fe(e.module,i.name).constants.forEach(t=>{let n=e.constants?.[t.name];n!==void 0&&je.set(t.name,n)}));let D=we.filter(e=>!je.has(e)&&!Fe.has(e)&&!Me.has(e));if(D.length>0){let t=r.getDeclarationOrder(`constant`).find(e=>D.includes(e))??D[0];throw new e._(`The constant parameter ${t} is not assigned a value by the configuration file.`)}E!==void 0&&u.forEach((e,t)=>{let n=Hf(e);n&&u.set(t,n)});let O=Db(Te,h.flatMap(e=>e.module.variables.map(e=>e.name))),Ve=pu({definitions:a,substitutions:Fe,constants:je,variableIndex:O,builtins:u,variables:Te}),He={runtime:f,definitions:a,builtins:u,constants:je,substitutions:Fe,instanceNames:oe,variables:Te,variableIndex:O,facts:Ve,startupValues:Array.from({length:Ve.ids.size},()=>void 0),substitutedDefinitions:c,instanceParams:l,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Ue=Zl({constants:new Set(je.keys()),variables:/* @__PURE__ */ new Set([...Te,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>u.has(e))]),getDefinition:e=>kh(e,He)}),We=t=>{try{U(t,{environment:He,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e.b)return t;throw t}};Fe.forEach((t,n)=>{let r=a.get(t),i=we.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&Ue.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?We(r.body):void 0;if(i){let r=rt(i)?``:` - specifically: ${i.message}`;throw new e._(`The configuration file substitutes constant ${n} with non-constant ${t}${r}`)}}),f.version!==`1.7.4`&&(f.isStarted=!0);let Ge=new Set(h.flatMap(e=>e.module.instances.map(e=>e.module))),k=r.createDefinitionOrder();return{environment:He,assumptions:Se,variableLocations:T.variableLocations,instanceActions:ae,startupDefinitions:h.filter(e=>!Ge.has(e.module.name)||vb(e).length===0).flatMap(e=>k(e===T?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:h.flatMap(e=>_e.get(e.module.name)??[]),moduleOperators:be,rootName:i.name}},jb={kind:`Boolean`,value:!0},Mb={kind:`Boolean`,value:!1},Nb=e=>e?jb:Mb,Pb=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,Fb=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),Ib=(e,t,n)=>({kind:e,operands:[t,n]}),Lb=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?Lb(e,t.operands).operands:[t])}),Rb=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return Rb(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,Rb(t)),0)}},zb=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return zb(e.body);case`And`:case`Or`:return e.operands.some(zb)}},Bb=/* @__PURE__ */ new WeakMap;let Vb=0;const Hb=e=>{let t=Bb.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${Vb++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(Hb).join(`,`)})`;default:return`${e.kind}(${Hb(e.body)})`}})();return Bb.set(e,n),n},Ub=(e,t)=>e===t||Hb(e)===Hb(t),Wb=(e,t)=>{let n=Hb(t);return e.some(e=>e===t||Hb(e)===n)},Gb=e=>e===`And`?`Or`:`And`,Kb=(e,t)=>{switch(e.kind){case`Boolean`:return t?Nb(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return Kb(e.body,!t);case`And`:case`Or`:return Lb(t?Gb(e.kind):e.kind,e.operands.map(e=>Kb(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,Kb(e.body,t))}}},qb=e=>{switch(e.kind){case`Boolean`:return Nb(!e.value);case`Not`:return e.body;case`And`:case`Or`:return Lb(Gb(e.kind),e.operands.map(qb));case`Always`:return $(`Eventually`,qb(e.body));case`Eventually`:return $(`Always`,qb(e.body));default:return $(`Not`,e)}},Jb=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Jb(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return Nb(t)}return n.length===0?Nb(!t):n.length===1?n[0]:Lb(e.kind,n)}case`Not`:{let t=Jb(e.body);return t.kind===`Boolean`?Nb(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=Jb(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Yb=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Xb=t=>{switch(t.kind){case`And`:{let n=[],r=1;for(let i of t.operands){let t=Xb(i);if(t.kind===`And`)n.push(...t.operands);else{if(t.kind===`Or`&&(r*=t.operands.length,r>2147483647))throw new e.b(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);n.push(t)}}if(r===1)return{kind:`And`,operands:n};let i=Array.from({length:r},()=>[]),a=1,o=r;for(let e of n){if(e.kind!==`Or`){i.forEach(t=>t.push(e));continue}o/=e.operands.length;let t=0;for(let n=0;n<a;n++)for(let n of e.operands)for(let e=0;e<o;e++)i[t++].push(n);a*=e.operands.length}return{kind:`Or`,operands:i.map(e=>Lb(`And`,e))}}case`Or`:{let e=[],n=[];for(let r of t.operands){let t=Xb(r);for(let r of t.kind===`Or`?t.operands:[t]){let t=Yb(r);t?e.push(t):n.push(r)}}if(e.length>0){let t=e.length===1?e[0]:Lb(`Or`,e);n.push($(`Always`,$(`Eventually`,t)))}return Lb(`Or`,n)}case`Not`:return Pb(t.body)?t:Xb(qb(t.body));default:return t}},Zb=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Zb(e.operands[0]):Lb(e.kind,e.operands.map(Zb));case`Not`:return e.body.kind===`Not`?Zb(e.body.body):$(`Not`,Zb(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,Zb(e.body));default:return e}},Qb=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Qb(e.operands[0]);let t=Math.floor(e.operands.length/2);return Ib(e.kind,Qb(Lb(e.kind,e.operands.slice(0,t))),Qb(Lb(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,Qb(e.body));default:return e}},$b=(e,t)=>{e.kind===`Eventually`&&!Wb(t,e)&&t.push(e),`body`in e&&$b(e.body,t),`operands`in e&&e.operands.forEach(e=>$b(e,t))},ex=e=>{let t=e.filter(Fb),n=e.flatMap(e=>e.kind===`Not`&&Fb(e.body)?[e.body]:[]);return!t.some(e=>Wb(n,e))},tx=t=>{let n=[...t],r=[];for(;n.length>0;){let t=n.pop();if(!t)break;switch(t.kind){case`Not`:n.push(t.body);break;case`Next`:r.push(t),n.push(t.body);break;case`Always`:case`Eventually`:r.push(t,$(`Next`,t)),n.push(t.body);break;case`And`:case`Or`:n.push(...t.operands),r.push(t);break;case`Action`:throw new e.b(`TLC encountered actions while constructing the tableau`);default:r.push(t)}}return r},nx=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:$(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},rx=(e,t,n)=>e.flatMap(e=>{let r=nx(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),ix=e=>[...new Set(e.map(Hb))].sort().join(`|`),ax=(e,t)=>{let n=new Set(t.map(ix));return[...e.filter(e=>!n.has(ix(e))),...t]},ox=e=>{let t=tx(e),n=rx(t,`Always`,`And`),r=rx(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=nx(t,`Eventually`,`Or`);if(n&&!(Wb(e,n.first)||Wb(e,n.second)))return ax(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Wb(e,t.first)||Wb(e,t.second))&&!Wb(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!ex(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=nx(t[e],`Always`,`And`);n&&(Wb(t,n.first)||t.push(n.first),Wb(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)Wb(t,e.first)&&Wb(t,e.second)&&!Wb(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!ex(t)?[]:i(t)};return a(e)},sx=e=>({particle:e,successors:[],statePredicates:e.filter(e=>Rb(e)<=1)}),cx=e=>{let t=ox([e]).map(sx),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=ix(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of ox(n)){let n=ix(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(sx(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},lx=(e,t)=>!Wb(e,t)||Wb(e,t.body),ux=(t,n)=>{if(t.kind===`Eventually`&&t.body.kind===`Always`&&Rb(t.body.body)<3){n.eventuallyAlways.push(t.body.body);return}let r=Yb(t);if(r){let e=Rb(r);if(e<=1){n.infinitelyOftenStates.push(r);return}if(e===2){n.infinitelyOftenActions.push(r);return}}if(zb(t))throw new e.b(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);n.formulas.push(t)},dx=(e,t)=>{let n=e.findIndex(e=>Ub(e,t));return n===-1?(e.push(t),e.length-1):n},fx=e=>{let t=Xb(Jb(Kb(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Zb(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])ux(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:Lb(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Ub(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Qb(e.formula),n=[];t&&$b(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>dx(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>dx(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>dx(i,e))}));return{tableau:t&&cx(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},px=()=>e.it(new e.b(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.tt.livenessEvaluationFailure),mx=/* @__PURE__ */ new Set([`~>`,`-+->`]),hx=/* @__PURE__ */ new WeakSet,gx=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),_x=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),vx=(t,n)=>new e.b(`TLC cannot handle the temporal formula ${V(t)}${n===void 0?``:`:\n${n}`}`),yx=(e,t,n,r=/* @__PURE__ */ new Set,i=/* @__PURE__ */ new Set)=>{let a=(e,t,r)=>{if(i.has(e))return 0;i.add(e);let a=yx(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=vh(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=kh(e,n);if(t)return yu(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isActionLevel?2:r.isStateLevel&&!r.isLevelConstant?1:0},c=(e,t)=>r.has(e)?0:O(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a={value:0};return Gc(e,(e,o)=>(a.value=Math.max(a.value,yx(e,t,n,o.length===0?r:/* @__PURE__ */ new Set([...r,...o]),i)),e)),a.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:l(e);case`Identifier`:return c(e.name,e);case`OperatorReference`:return c(e.operator,e);case`Apply`:{if(mx.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=O(e)?void 0:cg(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,xg(o,e.args,_x(n,t)))}default:return l(e)}},bx=(t,n)=>{try{return zh(t,n)}catch(t){if(!(t instanceof e.b))throw t;if(!rt(t))return;throw e.it(new e.b(`${e.W}${t.message}`),e.tt.error)}},xx=(t,n,r,i,a=/* @__PURE__ */ new Set,o=!1,s,c=[])=>{let l=(e,t,n=s,l=a,u)=>xx(e,t,r,i,l,o||u!==void 0&&r.substitutedDefinitions.has(u),n,u?.kind===`Operator`&&u.params.length===0?[...c,u.name]:c);if(t.kind===`And`)return t.operands.flatMap(e=>l(e,n,V(e)));if(t.kind===`Label`)return l(t.body,n);if(t.kind===`Let`)return l(t.body,Sx(t,n,r));if(t.kind===`Identifier`){let i=O(t)?vh(n,t.name):void 0;if(i?.kind===`Thunk`&&!i.isReleased)return l(i.expression,i.scope,hx.has(i)?t.name:s);let c=r.constants.has(t.name)?void 0:kh(t.name,r);if(!i&&c?.kind===`Operator`&&c.params.length===0&&(yu(c,r)>0||rg(c,r)===void 0)){if(a.has(c))throw e.Y();return l(c.body,void 0,!o&&r.instanceNames.get(t.name)||c.name,/* @__PURE__ */ new Set([...a,c]),c)}}let u=_x(r,n);if(t.kind===`Apply`&&r.runtime.version!==`1.7.4`&&(i||yx(t,n,r)===3)){let e=lg(t,u),n=O(t)?void 0:kh(t.operator,r),i=e?.kind===`Closure`&&e.params.every(e=>r.instanceParams.has(e));if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive&&(!o||i))return l(e.body,xg(e,t.args,u),o&&n?n.name:t.operator,a,n)}let d=i&&t.kind===`Forall`&&t.bounds.every(e=>yx(e.set,n,r)===0),f=d?bx(t.bounds,u):void 0;if(d&&f){let e=[];if(Bh(t.bounds,f,n,n=>(e.push(...l(t.body,n,V(t.body))),!1)),e.length===0)throw px();return e}return[{expression:t,scope:n,name:s,path:c}]},Sx=(e,t,n)=>{let r=Tg(e.definitions,_x(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&hx.add(e.binding);return r},Cx=(t,n,r)=>{let i=r.runtime.version===`1.7.4`,a=(t,n,a)=>{let o=a===0&&!i?yx(t,n,r):a;if(o===0){let i=U(t,_x(r,n));if(typeof i!=`boolean`)throw new e.b(`TLC expected a boolean value, but did not find one. ${sh(t)}`);return Nb(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={depth:0},s=(t,n,i,s)=>{if(o.depth>=100)throw e.Y();o.depth++;let c=p(t,n);o.depth--;let l=Rb(c),u=l===0&&yx(i,s,r)>2;return l>2||u?c:a(i,s,l)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,a=_x(r,t),o=O(e)||kh(n,r)===void 0?vh(t,n):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&hx.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:O(e)?ug(n,a):cg(n,r),u=e.kind===`Apply`?e.args:[],f=c?.kind===`Builtin`&&u.length===2?gx.get(c.name):void 0;if(f){let n=u.map(e=>p(e,t));return d(e,t,Lb(f,n))}if(c?.kind!==`Closure`)throw vx(e);let m=!O(e)&&kh(n,r)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>U(e,a)),s(c.body,xg(c,u,a),e,t)),m)},l=(t,n,r=!1)=>{try{return n()}catch(n){let a=n instanceof e.P||r&&!i;throw!(n instanceof e.b)||a?n:vx(t)}},u=(t,n)=>{let i=yx(t,n,r),o=[],s=t.kind===`Forall`;try{Vh(t.bounds,_x(r,n),e=>(o.push(p(t.body,e)),!1))}catch(r){if(!(r instanceof e.b)||r instanceof e.P)throw r;if(i<=2)return a(t,n,i);throw vx(t,s&&!rt(r)?r.message:void 0)}return o.length===0?Nb(s):d(t,n,Lb(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=Rb(n);return r>2?n:a(e,t,r)},f=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!O(e)||e.operator===`=>`),p=(e,t)=>{let n=yx(e,t,r);if(n<=2&&!f(e))return a(e,t,n);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,Sx(e,t,r));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,Ib(`Or`,$(`Not`,p(n[0],t)),$(`Eventually`,p(n[1],t)))):e.operator===`~`&&!O(e)?d(e,t,$(`Not`,p(n[0],t))):e.operator===`=>`?d(e,t,Ib(`Or`,$(`Not`,p(n[0],t)),p(n[1],t))):c(e,t)}case`And`:case`Or`:return d(e,t,Lb(e.kind,e.operands.map(e=>p(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&yx(e.condition,t,r)===0){let n=U(e.condition,_x(r,t));if(typeof n==`boolean`)return p(n?e.consequent:e.alternative,t)}let n=p(e.condition,t);return d(e,t,Ib(`Or`,Ib(`And`,n,p(e.consequent,t)),Ib(`And`,$(`Not`,n),p(e.alternative,t))))}case`Always`:case`Eventually`:return $(e.kind,p(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=$(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?$(`Always`,$(`Eventually`,Ib(`Or`,i,a))):Ib(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw vx(e)}};return p(t,n)},wx=(t,n,r,i,a)=>{let o=e=>wx(e,n,r,i,a);switch(t.kind){case`Boolean`:return t.value;case`State`:case`Enabled`:{let r=a.get(t);if(r!==void 0)return r;let o={environment:i,scope:t.scope,state:n,next:void 0},s=t.kind===`State`?U(t.expression,o):qm(t.step,o);if(typeof s!=`boolean`)throw new e.b(`A state predicate was evaluated to a non-boolean value.`);return a.set(t,s),s}case`Action`:{if(t.enabled&&a.get(t.enabled)===!1)return!1;let o=t.scope,s=t.subscript;if(s&&hr(U(s,{environment:i,scope:o,state:n,next:void 0}),U(s,{environment:i,scope:o,state:r,next:void 0})))return!1;let c=U(t.expression,{environment:i,scope:o,state:n,next:r});if(typeof c!=`boolean`)throw new e.b(`Encountered an action predicate that's not a boolean.`);return c}case`Not`:return!o(t.body);case`And`:return t.operands.every(o);case`Or`:return t.operands.some(o);case`Next`:return wx(t.body,r??n,void 0,i,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new e.b(`TLC cannot evaluate a temporal formula in a single step`)}},Tx=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>Tx(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return wx(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Ex=`UnnamedAction`,Dx={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},Ox=e=>{let t=e.range??Dx;return Ir([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},kx=(e,t)=>{let n=[[`name`,e.name],[`location`,Ox(e.location)]];return e.parameters.length>0&&n.push([`context`,Ir(e.parameters)],[`parameters`,Fr(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),Ir(n)},Ax=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),jx=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Mx=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,Nx=e=>e.kind===`Apply`?e.args:[],Px=(e,t,n)=>{let r=Mx(e);if(r===void 0)return;if(O(e)){let e=vh(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=cg(r,n);return i?.kind===`Closure`?i:void 0},Fx=(t,n)=>{try{return U(t,jx(n,void 0)),!0}catch(t){if(t instanceof e.y)return!1;throw t}},Ix=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&gu(e,t)&&Fx(e.body,t),Lx=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&Ix(e,t),Rx=(e,t)=>{let n=kh(e.name,t);return n?.body===e.body&&Lx(n,t)},zx=(e,t)=>{if(e.kind!==`Identifier`||!O(e))return;let n=vh(t,e.name);return n?.kind===`Thunk`?n:void 0},Bx=(e,t)=>(e?.params??[]).flatMap(e=>{let n=vh(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Vx=(t,n)=>{try{return t()}catch(t){if(t instanceof e.y)return n();throw t}},Hx=(e,t,n,r,i)=>{let a=Nx(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return r&&a.length===0?[{...e,parameters:[],expression:r.body,scope:r.scope}]:r?a.some(e=>yx(e,n,i)!==0)?o():Vx(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),U(e,jx(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},Ux=(t,n,r,i,a)=>{let o=()=>({name:r?.name??Ex,location:t.location,parameters:Bx(r,n),expression:t,scope:n});if(Ip.has(t.kind))throw e.it(new e.b(`${e.G}The next state relation is not a boolean expression.\n${sh(t)}`),e.tt.error);switch(t.kind){case`Let`:return Ux(t.body,Tg(t.definitions,jx(i,n)),r,i,a);case`Label`:return Ux(t.body,n,r,i,a);case`Or`:return t.operands.flatMap(e=>Ux(e,n,r,i,a));case`Exists`:return Vx(()=>{let e=[];return Vh(t.bounds,jx(i,n),n=>(e.push(...Ux(t.body,n,r,i,a)),!1)),e.length===0?[o()]:e},()=>[o()])}let s=O(t)?void 0:a.get(Mx(t)??``),c=Px(t,n,i);if(s)return Hx(s,t,n,c,i);if(!c)return[o()];let l=Nx(t),u=O(t)?c.name:i.instanceNames.get(Mx(t)??``)??c.name,d=()=>[{name:u,location:t.location,parameters:[],expression:t,scope:n}];return Rx(c,i)||l.some(e=>yx(e,n,i)!==0)?d():Vx(()=>{let e=l.reduce((e,t,r)=>({name:c.params[r].name,binding:{kind:`Value`,value:U(t,jx(i,n))},parent:e}),c.scope);return Ux(c.body,e,{...c,name:u},i,a)},d)},Wx=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>Wx(e,t,n,r,i,o),s=(e,t,n)=>Ax(e,Rc(t,a),n);if(e.kind===`Let`){o(e.body,Tg(e.definitions,jx(n,t)));return}let c=zx(e,t);if(c){o(c.expression,c.scope);return}let l=Px(e,t,n);if(l&&Rx(l,n))return;let u=l?[...a,...Lc.get(l.body)??[]]:a;if(l&&l.params.length===0){if(yx(l.body,l.scope,n)===1){r.inits.push(s(l.name,l.body,l.scope));return}o(l.body,l.scope,u);return}if(l&&e.kind===`Apply`&&l.params.length===e.args.length){o(l.body,xg(l,e.args,jx(n,t)),u);return}if(e.kind===`And`){e.operands.forEach(e=>o(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t,frames:a});return}r.temporals.push(s(Ex,e,t));return}let d=yx(e,t,n);d<=1?r.inits.push(s(Ex,e,t)):d===3&&r.temporals.push(s(Ex,e,t))},Gx=(e,t,n,r,i)=>{let a=(t,n)=>Gx(e,t,n,r,i);if(t.kind===`Let`){a(t.body,Tg(t.definitions,jx(r,n)));return}let o=zx(t,n);if(o){a(o.expression,o.scope);return}let s=Px(t,n,r);if(s&&Rx(s,r))return;if(s&&s.params.length===Nx(t).length){a(s.body,t.kind===`Apply`?xg(s,t.args,jx(r,n)):s.scope);return}if(t.kind===`Forall`&&Vx(()=>(Vh(t.bounds,jx(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(Ax(e,a)):yx(a,n,r)<2?i.invariants.push(Ax(e,a)):i.impliedTemporals.push(Ax(e,t));return}let c=yx(t,n,r);c<=1?i.impliedInits.push(Ax(e,t)):c===3&&i.impliedTemporals.push(Ax(e,t))},Kx=(e,t)=>{let n=kh(e,t);return n?.kind===`Operator`&&!Lx(n,t)?n:void 0},qx=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:Kx(e.specification,t);a&&(Wx(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:Ex,location:e.frames[0].location,parameters:[],expression:Rc(e.expression,e.frames),scope:e.scope}]:Ux(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:cg(e.init,t);o?.kind===`Closure`&&r.inits.push(Ax(e.init??``,o.body));let s=e.next===void 0?void 0:cg(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Ux(s.body,s.scope,s,t,n)),r},Jx=(e,t,n)=>{let r=[],i=(e,t)=>{if(e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`)return!1;if(e.kind===`Tuple`)return e.elements.every(e=>i(e,t));if(e.kind===`Label`)return i(e.body,t);if(e.kind===`Let`)return i(e.body,Tg(e.definitions,jx(n,t)));let a=zx(e,t);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&O(e)?vh(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!O(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=Px(e,t,n);if(!s||s.params.length!==Nx(e).length)return!0;let c=kh(s.name,n);return c?.body===s.body&&Ix(c,n)?!0:i(s.body,e.kind===`Apply`?xg(s,e.args,jx(n,t)):s.scope)};return i(e,t)?r:void 0},Yx=(e,t,n)=>qx(e,t,n).inits,Xx=(e,t,n)=>qx(e,t,n).actions,Zx=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>I(e[1])).join(`,`)})`,Qx=(t,n,r=!1)=>`${t.name===Ex?r?`Initial predicate`:`Action`:t.name}${n===`1.7.4`?``:Zx(t)} ${e.X(t.location.range??Dx)}`,$x=e=>`${e.name}${Zx(e)}`,eS=(e,t,n,r)=>{let i=qx(e,t,r);e.invariants.forEach(e=>{let n=Kx(e,t);n&&i.invariants.push(Ax(e,n.body))}),e.properties.forEach(e=>{let n=Kx(e,t);n&&Gx(e,n.body,void 0,t,i)});let a=t.coverage,o=(e,t)=>vr(e.map(e=>{let n=a&&t&&xo(a,t,e.expression);return kx(e,n&&Ir(n))})),s=e=>vr(e.flatMap(e=>{let n=Kx(e,t);return n?[Ir([[`name`,n.name],[`location`,Ox(n.location)]])]:[]}));return Ir([[`inits`,o(i.inits,`init`)],[`actions`,o(i.actions,`next`)],[`temporals`,o(i.temporals)],[`invariants`,o(i.invariants,`invariant`)],[`impliedinits`,o(i.impliedInits,`implied`)],[`impliedactions`,o(i.impliedActions,`implied`)],[`impliedtemporals`,o(i.impliedTemporals)],[`variables`,vr(t.variables.map((e,t)=>Ir([[`name`,e],[`location`,Ox(n[t])],...a?[[`coverage`,Ir([[`distinct`,co(a,t)]])]]:[]])))],[`actionconstraints`,s(e.actionConstraints)],[`constraints`,s(e.constraints)]])},tS=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),nS=(e,t)=>{let n=/* @__PURE__ */ new Map;return(/* @__PURE__ */ new Set([...e.keys(),...t.keys()])).forEach(r=>{let i=e.get(r),a=i?t.get(i.name)??i:t.get(r);a&&a.name!==r&&n.set(r,a)}),n},rS=t=>e.it(new e.b(`${e.G}${t}`),e.tt.error),iS=e=>{let t=F(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!j(e)||!j(i))throw rS(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},aS=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${oS(t)}`:n},oS=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(oS).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${aS(e.pattern,e.set)}:${oS(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(oS).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${oS(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>aS(e.pattern,e.set)).join(`,`)}|->${oS(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(oS);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},sS=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,cS=(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 rS(`The symmetry function ${t} must specify a set of permutations.`);let a=e=>U(e,{environment:n,scope:void 0,state:void 0,next:void 0}),o=a(i.body);if(!A(o)||!M(o))throw rS(`The symmetry operator must specify a set of functions.`);let s=N(o).elements;if(!s.every(Mt))throw rS(`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=oS(sS(e)?e.args[0]:e);return u.get(t)??t}),r=e.length>1;n.runtime.warn(Ke.symmetrySetTooSmall,`The set${r?`s`:``} ${t.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(l.length>=s.length){d(l);return}let f=/* @__PURE__ */ new Map;s.map(iS).forEach(e=>{e.size>0&&f.set(tS(e),e)});let p=[...f.values()],m={start:0};for(;m.start<f.size;){let e=[...f.values()],t=e.length;p.forEach(n=>e.slice(m.start,t).forEach(e=>{let t=nS(n,e),r=tS(t);t.size>0&&!f.has(r)&&f.set(r,t)})),m.start=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(!sS(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=>j(e)&&h.has(e.name))})),f.size!==0)return[...f.values()]},lS=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=dS(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(dS(e[r],t));return a}},uS=(e,t)=>{let n=[],r=[];for(let i of e){let e=dS(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(_n);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(_n(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},dS=(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=uS(e.elements,t);return n?Sn(n):e}if(n===`Function`||n===`LazyFunction`&&M(e.domain)){let n=F(e),r=lS(n.domain,t),i=lS(n.range,t)??n.range;if(r){let e=wr(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?wn(n.domain,e.range):e}return i===n.range?n:wn(n.domain,i)}if(n===`Interval`||!A(e)||!M(e))return e;let r=N(e),i=lS(r.elements,t);return i?vr(i):r},fS=(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]=dS(e[o],i),a===0&&(a=_n(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},pS={line:0,column:0},mS=e=>({kind:`Identifier`,name:e,location:pS}),hS=/* @__PURE__ */ new Set([`name`,`property`]),gS=(t,n,r)=>{let i=kh(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._(hS.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},_S=e=>e.body.kind===`Number`||e.body.kind===`String`,vS=(t,n,r)=>{if(r.constants.has(t))return r.constants.get(t);if(gu(n,r)&&!_S(n))try{return U(mS(t),HS(r,void 0,void 0))}catch(t){if(t instanceof e.b||e.et(t))return;throw t}},yS=(t,n,r)=>{if(r.constants.has(n))throw new e._(`The ${t} ${n} cannot be a constant.`);let i=gS(t,n,r);if(vS(n,i,r)!==void 0)throw new e._(`The ${t} ${n} cannot be a constant.`);return i},bS=(t,n,r)=>{let i=r.constants.has(n)?void 0:gS(t,n,r),a=i?vS(n,i,r):r.constants.get(n);if(a!==void 0&&a!==!0)throw new e._(`The ${t} of ${n} is equal to ${I(a)}`);return a===void 0?i:void 0},xS=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},SS=(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})),ig(e.startupDefinitions,r),t.invariants.forEach(e=>{bS(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},CS=(t,n)=>{let r=Zl({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>n.definitions.get(e)});return t.flatMap(t=>{let i=bS(`invariant`,t,n);if(!i)return[];let a=r.analyzeDefinition(i,/* @__PURE__ */ new Map);if(a.level>=2){let n=a.params.size===0?``:`
1786
1786
  Note that a bug can cause TLC to incorrectly report this error.
1787
1787
  If you believe your TLA+ or PlusCal specification to be correct,
1788
- please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw e.it(new e._(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${n}`),e.tt.safetyEvaluationFailure)}return[{name:t,expression:hS(t),scope:void 0}]})},TS=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>TS(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Oh(e.name,t);if(n?.kind===`Operator`&&n.params.length===0&&ng(n,t)===void 0)return TS(n.body,t)}return[e]},ES=(t,n,r)=>{let i=t.expression;if(i.kind!==`Identifier`||yx(i,t.scope,n)>0)return!1;let a=W(i,US(n,void 0,void 0,t.scope));if(a===!1)throw new e._(`The spec is trivially false because ${i.name} is false.`);if(a!==!0)throw new e._(`The operator ${i.name}, which equals ${L(a)},\ncannot be used as a ${r}`);return!0},DS=(t,n,r,i,a)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return bS(t,e,n),hS(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[],isPropertyFairness:!1}}if(t.init!==void 0||t.next!==void 0)throw new e._(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let o=[],s=[],c=[],l=n.constants.has(t.specification)?n.constants.get(t.specification):yS(t.specification,_S(`name`,t.specification,n),n);if(l!==void 0)throw new e._(`The value of ${t.specification} is equal to ${L(l)}`);let u=_S(`name`,t.specification,n),d=t.properties.length===1?t.properties[0]:void 0,f=!1;xx(u.body,void 0,n,!1).forEach(t=>{let l=t.expression;if(ES(t,n,`spec`))return;let u=l.kind===`Identifier`&&!O(l)?n.variableIndex.get(l.name):void 0;if(l.kind===`Identifier`&&u!==void 0){let t=r[u].range;throw new e._(`The operator ${l.name}, which equals ${t?e.X(t):l.name},\ncannot be used as a spec`)}if(l.kind===`UnboundedQuantifier`&&l.isTemporal)throw e.it(new e._(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.tt.error);if(l.kind===`Always`&&l.expression.kind===`BoxAction`){let r=Yx(l.expression.subscript,t.scope,n);if(r===void 0&&a?.({kind:`warning`,code:Ge.subscriptUndetermined,text:`TLC could not determine if the subscript of the next-state relation contains
1789
- all state variables. Proceed with fingers crossed.`}),i().filter(e=>r!==void 0&&!r.includes(e)).forEach(e=>a?.({kind:`warning`,code:Ge.subscriptMissingVariable,text:`The subscript of the next-state relation specified by the specification\ndoes not seem to contain the state variable ${e}`})),s.length>0)throw new e._(`The specification contains more than one conjunct of the form [][Next]_v,
1790
- but TLC can handle only specifications with one next-state relation.`);s.push({expression:l.expression.action,scope:t.scope});return}if(l.kind===`Always`&&l.expression.kind!==`Let`&&l.expression.kind!==`Label`&&yx(l.expression,t.scope,n)<2)throw e.it(new e.b(`TLC cannot handle the temporal formula ${H(l.expression)}`),e.tt.error);let p=yx(l,t.scope,n);if(p===3)d!==void 0&&t.path.includes(d)||(f=!0),c.push(t);else{if(p===2)throw new e._(`TLC cannot handle this conjunct of the spec:\n${H(l)}`);o.push(t)}});let p=[...o,...s],m=e=>`$specification${e}`,h=p.reduce((e,t,n)=>t.scope===void 0?e:{name:m(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),g=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:m(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:o.length===0?void 0:{kind:`And`,operands:o.map(g),location:mS},next:s.length===0?void 0:g(s[0],o.length),scope:h,temporals:c,isPropertyFairness:c.length>0&&!f}},OS=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=xS(`property`,t,n);if(!a)return;yx(a.body,void 0,n)===1&&r?.({kind:`state-level-property`,name:t});let o=n.runtime.version!==`1.7.4`;xx(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(ES(r,n,`property`))return;let o=r.name??t;if(a.kind===`Always`&&a.expression.kind===`BoxAction`){i.actionProperties.push({name:o,box:a.expression,action:a.expression.action,subscript:a.expression.subscript,scope:r.scope});return}if(a.kind===`Always`&&yx(a.expression,r.scope,n)<=1){let e=a.expression,t=e.kind===`Identifier`&&!O(e)?Oh(e.name,n):void 0;i.invariants.push({name:t?.name??(e.kind===`Identifier`?e.name:o),expression:e,scope:r.scope});return}let s=yx(a,r.scope,n);if(s<2)i.initialPredicates.push({name:o,expression:a,scope:r.scope});else{if(s===2){let t=H(a),n=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,r=a.kind===`BoxAction`?`To check that action ${o} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${t} (compare page 90 of ${n}).`:a.kind===`AngleAction`?`To check that infinitely many ${o} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${t} (compare page 91 of ${n}).`:`To check that action ${o} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${t}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${n}).`;throw new e._(`The formula ${o} at ${t} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${r}`)}i.liveness.push({name:t,expression:a,scope:r.scope})}})}),i},kS=(e,t,n)=>t.flatMap(t=>xS(e,t,n)?[{name:t,expression:hS(t),scope:void 0}]:[]),AS=(e,t)=>{let n=Oh(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},jS=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e._(`_POSSIBLE lists ${r} more than once`);bS(`possible`,r,n);let a=hS(r);if(yx(a,void 0,n)===3)throw new e._(`The possible of ${r} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:r,expression:a,scope:void 0}}),MS=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||O(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},NS=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=Oh(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},PS=(e,t)=>e.flatMap(e=>TS(e.expression,t).map(n=>{let r=e.scope===void 0?xu(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:MS(n,r,t),predicate:NS(e.expression,t)}})),FS=(e,t,n)=>{let r=e.variables;if(!n||!r)return!1;for(let e=0;e<r.length;e++)if(t[r[e]]!==n[r[e]])return!1;return!0},IS=/[\u0100-\uffff]/,LS=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),RS=e=>e.kind===`String`?IS.test(e.value):e.kind===`Set`&&e.elements.some(RS),zS=e=>e.kind===`String`&&IS.test(e.value)||e.kind===`Apply`&&LS.has(e.operator)||Be(e).some(zS),BS=(e,t)=>e.constants.some(e=>RS(e.value)||(e.args??[]).some(RS))||[...t.definitions.values()].some(e=>zS(e.body)||e.kind===`Function`&&e.bounds.some(e=>zS(e.set))),VS=e=>{if(!jt(e))return;let t=Rt(I(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},HS=(e,t,n,r)=>{let i=n===1?`the next-state action`:`action ${t} of the next-state relation`,a=r===`1.7.4`?`assigned`:`defined`;return`Successor state is not completely specified by ${i}. The following variable${e.length>1?`s are`:` is`} not ${a}: ${e.join(`, `)}.\n`},US=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),WS=(e,t,n)=>Ch(W(e,t),n),GS=(t,n,r=qS)=>{let i=W(t,n);if(typeof i!=`boolean`)throw new e.b(r(t,n.environment));return i},KS=(t,n,r)=>{let i=n.kind===`Identifier`?Oh(n.name,r):void 0,a=i?.kind===`Operator`?i.body:n,o=i?.kind===`Operator`?i.bodyRange:void 0;return`TLC expected a ${t} value, but did not find one. ${o&&a.kind!==`Number`?e.X(o):oh(a)}`},qS=(e,t)=>KS(`boolean`,e,t),JS=(e,t)=>GS(e.expression,t,(n,r)=>(GS(e.predicate,t),qS(n,r))),YS=()=>{},XS=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=WS(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),ZS=(t,n)=>{try{return t(US(n,void 0,void 0))?void 0:{message:void 0}}catch(t){if(t instanceof e.b)return{message:t.message};throw t}},QS=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=ZS(e=>Dh(W(n.expression,e),n.expression),t);if(e)return{name:oh(n.expression),trace:[],message:e.message}}},$S=e=>{let t=typeof e.config==`string`?ze(e.config,e.version):e.config,n=pb(e.source,e.loadModule);Yt(n.getStringOrder(t)),en(e),Ma(e.fingerprintPolynomial??0);let r=kb(t,{source:e.source,loadModule:e.loadModule,order:n,loadClass:e.loadClass,print:e.onPrint??console.log,files:{readFile:e.readFile,writeFile:e.writeFile,makeDirectory:e.makeDirectory},seed:e.seed,isTool:e.isTool,traceFile:e.traceSpec?.traceFile,isSanyReported:e.isSanyReported,isWarningEnabled:e.isWarningEnabled,version:e.version,moduleOperators:e.moduleOperators});CS(r,t,e.onProgress);let i=r.environment;return i.runtime.getSpecification=()=>tS(t,i,r.variableLocations,r.instanceActions),{config:t,specification:r,environment:i,search:nC(t,i,r.variableLocations,()=>n.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators)}},eC=(t,n,r)=>{let i=QS(t,n);if(!i)return;if(i.message===void 0){let t=`Assumption ${i.name} is false.`;return r(Ge.assumptionFalse,t,t),e.tt.assumptionViolation}let a=`Evaluating assumption ${i.name} failed.\n${i.message}`;return r(Ge.assumptionEvaluationError,a,it(Ge.assumptionEvaluationError,a,!0)),e.tt.assumptionViolation},tC=t=>e.it(new e.b(`${e.G}Could not find operator: ${t.operator} in module: ${t.module}`),e.tt.error),nC=(t,n,r,i,a,o=[])=>{let s=e=>o.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw tC(e);return{name:e.operator,key:e.key}}),c=wS(t.invariants,n),l=DS(t,n,r,i,a),u=OS(t,n,a),d=t.properties[0],f=d&&Oh(d,n)?.location.range,p=t.specification,m=p&&Oh(p,n)?.location.range;l.isPropertyFairness&&f&&m&&a?.({kind:`warning`,code:Ge.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${d} at ${e.X(f)} equals\nthe fairness constraints of the behavior specification ${p} at ${e.X(m)}.\nTherefore, checking whether ${p} => ${d} using TLC will never result in a violation of ${d}.`});let h=PS([...c,...u.invariants],n),g=[...new Map(h.map(e=>[e.predicate,e])).values()],_=h.length>0||u.actionProperties.length>0||u.liveness.length>0;if(l.init===void 0&&(_||u.initialPredicates.length>0||n.variables.length>0))throw new e._(n.runtime.version===`1.7.4`?Xe:`The configuration file did not specify the initial state predicate.`);if(l.next===void 0&&_)throw new e._(`The configuration file did not specify the next state predicate.`);let ee=kS(`constraint`,[...t.constraints,...s(`constraint`).map(e=>e.name)],n),te=PS(ee,n),v=kS(`action constraint`,t.actionConstraints,n),ne=n.coverage,y=(e,t,r=!0)=>t.flatMap(t=>{if(!ne)return[];let i=r?NS(t.expression,n):t.expression,a=Ga(r?t.name:void 0,i,n),o=Ua(ne,e,a,i,t.scope);return[{expression:i,scope:t.scope,node:o}]}),re=[...y(`invariant`,c),...y(`invariant`,u.invariants,!1)],b=y(`constraint`,v),ie=y(`constraint`,ee),ae=y(`implied`,u.initialPredicates,!1),oe=y(`implied`,u.actionProperties.map(e=>({...e,expression:e.box})),!1),se=(e,t,r,i)=>{try{return io(e,t.node,()=>W(t.expression,US(n,r,i,t.scope)))}catch{return}},ce=(e,t,n)=>ne!==void 0&&e.every(e=>se(ne,e,t,n)===!0),x=(e,t,n)=>{if(ne){for(let r of e){let e=se(ne,r,t,n);if(typeof e!=`boolean`)return;if(!e)return ne.primary[r.node]++,!1;ne.secondary[r.node]++}return!0}};t.rlReward!==void 0&&_S(`rlreward`,t.rlReward,n),t.periodic!==void 0&&_S(`periodic`,t.periodic,n);let le=jS(t.possible,n);if(n.variables.length===0)return;let S=t.symmetry===void 0?void 0:lS(t.symmetry,n,t.substitutions),ue=t.view===void 0?void 0:bS(`view function`,t.view,n),de=t.view??s(`view`)[0]?.name,fe=de===void 0?void 0:{name:de,expression:hS(de),scope:void 0},C=u.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:mS};return{...e,unchanged:t}}),w=e=>yx(e.expression,void 0,n)>=2,T=le.filter(e=>!w(e)),E=le.filter(w),pe=n.runtime,me,he=()=>{if(me)return me;let e=i(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return me=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),me},ge=(e,t)=>W(e,US(n,t,void 0)),_e=e=>{let t=he(),n=S===void 0?e:pS(e,S,t);return Ia(fe===void 0?t.map(e=>n[e]):[ge(fe.expression,n)])},ve=/* @__PURE__ */ new WeakSet,ye=(t,r,i)=>{let a=i&&!ve.has(i)?i:void 0;if(FS(t,r,a))return!1;try{let e=US(n,r,void 0,t.scope),i=t.membership;return a&&i?!Si(r[i.variable],a[i.variable],W(i.set,e)):!JS(t,e)}catch(n){throw i?ut(e.it(n,e.tt.safetyEvaluationFailure),Ge.invariantEvaluationFailed,`Evaluating invariant ${t.name} failed.`):n}},D=BS(t,n);pe.getFingerprint=_e;let be=()=>{let t=le.find(e=>!pe.possibleCounts.get(e.name));if(!t)return;let r=AS(t.name,n),i=r?` at ${e.X(r)}`:``;return{name:t.name,code:Ge.possibleUnwitnessed,message:`The _POSSIBLE predicate ${t.name}${i} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:A(L(Gd(pe),!0))}},xe=ue?.body.kind===`Tuple`?ue.body.elements:[],Se=xe.flatMap(e=>e.kind===`Identifier`&&n.variables.includes(e.name)?[e.name]:[]),Ce=ue?.body.kind===`Tuple`&&Se.length===xe.length&&new Set(Se).size===Se.length,we=(e,t)=>Ce?he().filter(e=>Se.includes(n.variables[e])).map(e=>`/\\ ${n.variables[e]} = ${A(L(t[e]))}\n`).join(``):A(L(ge(e,t))),Te=(t,r,i)=>GS(t.expression,US(n,r,i),t=>`${e.G}${qS(t,n)}`),Ee=e=>{let t=Object.fromEntries(he().map(t=>[n.variables[t],e[t]]));return fe===void 0?t:nn(t,()=>we(fe.expression,e))};return{properties:u,spec:l,toRecord:Ee,evaluateAlias:(t,r,i,a)=>{try{bS(`alias`,t,n);let e=W(hS(t),US(n,r,i)),a=VS(e);return a===void 0?Ee(r):an(a,t)}catch(t){if(!(t instanceof e._||t instanceof e.b))throw t;return{...Ee(r),_ALIASEvalError:at(t.message,a)}}},isSymmetric:S!==void 0,isConstrained:te.length>0||v.length>0,getTlcOrder:he,getStoredFingerprints:(e,t)=>fe!==void 0||D?BigInt64Array.from(e,_e):La(t,he()),getFingerprintState:e=>{if(D)return[String(_e(e))];let t=S===void 0?e:pS(e,S,he());return fe===void 0?t:[ge(fe.expression,t)]},findViolatedInvariant:(e,t)=>{if(ce(re,e))return;let n=h.find(n=>ye(n,e,t));return n&&ve.add(e),n},getViolatedInvariants:e=>{let t=g.filter(t=>h.some(n=>n.predicate===t.predicate&&ye(n,e,void 0)));return t.length>0&&ve.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>GS(n,US(t,e,void 0,r));te.every(e=>r(e.predicate,e.scope))&&n();let i=g.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=u.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(te.every(e=>GS(e.predicate,US(n,t,void 0,e.scope)))&&v.every(r=>GS(r.expression,US(n,e,t,r.scope))))||r())||g.every(e=>GS(e.predicate,US(n,t,void 0,e.scope))))&&C.every(r=>GS(r.box,US(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>x(ie,e)??te.every(r=>FS(r,e,t)||JS(r,US(n,e,void 0))),findFailedInitialPredicate:e=>ce(ae,e)?void 0:u.initialPredicates.find(t=>!GS(t.expression,US(n,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>ce(oe,e,t)?void 0:C.find(r=>{try{return!GS(r.action,US(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${H(r.box)}`)&&!WS(r.unchanged,US(n,e,t,r.scope),`a subscript`)}catch(e){throw ut(rC(e),Ge.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>x(b,e,t)??v.every(n=>Te(n,e,t)),getExcludingConstraints:(t,r)=>[...te.filter(e=>!JS(e,US(n,r,void 0))),...v.filter(e=>!Te(e,t,r))].map(t=>{let r=AS(t.name,n);return r?e.X(r):t.name}),trackStatePossible:T.length===0?YS:e=>XS(T,pe,US(n,e,void 0)),trackActionPossible:E.length===0?YS:(e,t)=>XS(E,pe,US(n,e,t)),findUnwitnessedPossible:be,getReward:(r,i,a)=>{if(t.rlReward===void 0)return a;let o=hS(t.rlReward),s=W(o,US(n,r,i));if(typeof s!=`number`)throw new e.b(KS(`integer`,o,n));return s},findPostconditionViolation:(r=!1)=>{let i=s(`postcondition`),a=t.postconditions.map(e=>{let t=Oh(e,n);return t?t.kind===`Operator`&&t.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!vS(t)&&ng(t,n)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(a!==void 0){if(r)return;throw e.it(new e.b(a),e.tt.configParseError)}let o=(t,r)=>{let i=ZS(e=>GS(hS(r),e),n);if(!i)return;let a=Oh(r,n)?.body,o=AS(r,n),s=o?` at ${a?.kind===`Number`?oh(a):e.X(o)}`:``;return i.message===void 0?{name:t,code:Ge.postconditionFalse,message:`Postcondition ${t}${s} is false.`}:{name:t,code:Ge.postconditionFailed,message:`Evaluating postcondition ${t}${s} failed.\n${i.message}`}};for(let e of i){let t=o(e.name,e.key);if(t)return t}let c=be();if(c)return c;for(let e of t.postconditions){let t=o(e,e);if(t)return t}}}},rC=t=>t instanceof e.O?e.it(t,t.exitCode):t,iC=(e,t)=>e*((t-e)/2**64),aC=e=>e.includes(`.`)?e:`${e}.0`,oC=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return aC(String(e));let[n,r]=e.toExponential().split(`e`);return`${aC(n)}E${r.replace(`+`,``)}`},sC=e=>e!==void 0&&e>=`0`&&e<=`9`,cC=e=>{if(e===0)return`0.0`;let t=oC(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;sC(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;sC(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;sC(t[n])&&r<2;)i+=t[n++],r++;for(sC(t[n])&&Number(t[n])>=5&&(i=lC(i));sC(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},lC=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${lC(r)}.`:n===`9`?`${lC(r)}0`:`${r}${Number(n)+1}`},uC=e=>{let t=0;for(;10n**BigInt(t+1)<e*10n;)t++;let n=10n**BigInt(t+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t+1}`)},dC=(e,t,n)=>{if(iC(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a=1/0,o=9223372036854775807n;for(let e=1;e<r.length;e++){let t=i[2*e+1],n=i[2*e-1];if(t<0!=n<0)continue;let s=t-n;if(s<=1048576){let t=s*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a=Math.min(a,t)}else{let t=r[e]-r[e-1];t<o&&(o=t)}}if(a===1/0)return o;let s=BigInt(a);return s<o?s:o},fC=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a=0,o=n.find(t=>(a+=e[t],a>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},pC=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},mC=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Ki(e[t]),16777619),r=Math.imul(r^Qi(e[t]),1540483477);t[0]=pC(n)||1,t[1]=pC(r)},hC=()=>{let e=/* @__PURE__ */ new Int32Array(8192),t=0,n=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},r=()=>{let t=e,r=new Int32Array(t.length*2);for(let e=0;e<t.length;e+=2){if(t[e]===0)continue;let i=n(r,t[e],t[e+1]);r[i*2]=t[e],r[i*2+1]=t[e+1]}e=r};return{insert:(i,a)=>{t*4>=e.length&&r();let o=n(e,i,a);return e[o*2]!==i&&(e[o*2]=i,e[o*2+1]=a,t++,!0)}}},gC=(e,t)=>{let n=e.length-1;for(let r=Number(t>>32n)&n;;r=r+1&n){let n=Atomics.load(e,r);if(n===t)return!1;if(n!==0n)continue;let i=Atomics.compareExchange(e,r,0n,t);if(i===0n)return!0;if(i===t)return!1}},_C=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),vC=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return gC(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},yC=e=>Atomics.load(e.used,0)*2>=e.slots.length,bC=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&gC(t,n);return{slots:t,used:e.used}},xC=[void 0,`lambda`,`tuple`,`record`],SC=()=>{let e=/* @__PURE__ */ new Int32Array(1024),t=0,n=0,r=[],i=/* @__PURE__ */ new Map,a=n=>{if(t===e.length){let t=new Int32Array(e.length*2);t.set(e),e=t}e[t++]=n},o=e=>{let t=i.get(e);if(t!==void 0)return a(t);i.set(e,r.length),a(r.length),r.push(e)},s=e=>{if(typeof e==`boolean`)return a(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(a(2),a(e),!0);if(typeof e==`string`)return a(3),o(e),!0;if(e.kind===`ModelValue`)return a(4),o(e.name),!0;if(e.kind===`Set`)return a(5),a(e.elements.length),e.elements.every(s);if(e.kind===`Function`){let t=Ni(e.domain);return t?(a(7),a(xC.indexOf(En(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(xC.indexOf(En(e))),a(e.domain.length),e.domain.every(s)&&e.range.every(s))}return!1};return{encode:e=>{let r=t;return e.every(s)?(n++,!0):(t=r,!1)},finish:()=>({words:e.slice(0,t),strings:r,count:n})}},CC=e=>t=>{let n=t.words,r=0,i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r++];if(e===3)return t.strings[n[r++]];if(e===4)return yn(t.strings[n[r++]]);if(e===5)return xn(i(n[r++]));let a=xC[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=Mr({kind:`Interval`,low:e,high:e+t-1});return Tn(Cn(o,i(t)),a)}let o=n[r++],s=i(o);return Tn(Cn(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return Qm}}),Object.defineProperty(exports,"$t",{enumerable:!0,get:function(){return ze}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return wx}}),Object.defineProperty(exports,"At",{enumerable:!0,get:function(){return Gi}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return wy}}),Object.defineProperty(exports,"Bt",{enumerable:!0,get:function(){return Ke}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return $x}}),Object.defineProperty(exports,"Ct",{enumerable:!0,get:function(){return zn}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return tS}}),Object.defineProperty(exports,"Dt",{enumerable:!0,get:function(){return L}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Zx}}),Object.defineProperty(exports,"Et",{enumerable:!0,get:function(){return ha}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return fx}}),Object.defineProperty(exports,"Ft",{enumerable:!0,get:function(){return In}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return Fg}}),Object.defineProperty(exports,"Gt",{enumerable:!0,get:function(){return st}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return ky}}),Object.defineProperty(exports,"Ht",{enumerable:!0,get:function(){return it}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return Hb}}),Object.defineProperty(exports,"It",{enumerable:!0,get:function(){return Nn}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return Og}}),Object.defineProperty(exports,"Jt",{enumerable:!0,get:function(){return gt}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return H}}),Object.defineProperty(exports,"Kt",{enumerable:!0,get:function(){return tt}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return lx}}),Object.defineProperty(exports,"Lt",{enumerable:!0,get:function(){return Yt}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return Cx}}),Object.defineProperty(exports,"Mt",{enumerable:!0,get:function(){return wt}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return Lb}}),Object.defineProperty(exports,"Nt",{enumerable:!0,get:function(){return Zt}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return kx}}),Object.defineProperty(exports,"Ot",{enumerable:!0,get:function(){return Xt}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return Fb}}),Object.defineProperty(exports,"Pt",{enumerable:!0,get:function(){return Ki}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return Ym}}),Object.defineProperty(exports,"Qt",{enumerable:!0,get:function(){return Be}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return kb}}),Object.defineProperty(exports,"Rt",{enumerable:!0,get:function(){return en}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return rC}}),Object.defineProperty(exports,"St",{enumerable:!0,get:function(){return Li}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Xx}}),Object.defineProperty(exports,"Tt",{enumerable:!0,get:function(){return Fr}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return Oy}}),Object.defineProperty(exports,"Ut",{enumerable:!0,get:function(){return at}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return Ey}}),Object.defineProperty(exports,"Vt",{enumerable:!0,get:function(){return Ye}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return Gv}}),Object.defineProperty(exports,"Wt",{enumerable:!0,get:function(){return ct}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return Jm}}),Object.defineProperty(exports,"Xt",{enumerable:!0,get:function(){return dt}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return Dg}}),Object.defineProperty(exports,"Yt",{enumerable:!0,get:function(){return nt}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return Xm}}),Object.defineProperty(exports,"Zt",{enumerable:!0,get:function(){return _t}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return HS}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return Ba}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return bC}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return Df}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return SS}}),Object.defineProperty(exports,"bt",{enumerable:!0,get:function(){return Ia}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return mC}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return yf}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return dC}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return bd}}),Object.defineProperty(exports,"en",{enumerable:!0,get:function(){return De}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return Zm}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return iC}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return wd}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return QS}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return so}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return nC}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return eo}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return _C}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return Jp}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return Tx}}),Object.defineProperty(exports,"jt",{enumerable:!0,get:function(){return bn}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return px}}),Object.defineProperty(exports,"kt",{enumerable:!0,get:function(){return Wi}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return cC}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return qd}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return tC}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return Ua}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return SC}}),Object.defineProperty(exports,"nn",{enumerable:!0,get:function(){return ne}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return Kp}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return vC}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return Ef}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return fC}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return ws}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return Oh}}),Object.defineProperty(exports,"qt",{enumerable:!0,get:function(){return bt}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return hC}}),Object.defineProperty(exports,"rn",{enumerable:!0,get:function(){return ae}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return qp}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return yC}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return Of}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return CC}}),Object.defineProperty(exports,"tn",{enumerable:!0,get:function(){return ye}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return Yp}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return uC}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return Xd}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return $S}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return Ga}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return eS}}),Object.defineProperty(exports,"wt",{enumerable:!0,get:function(){return yn}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return CS}}),Object.defineProperty(exports,"xt",{enumerable:!0,get:function(){return Ma}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return eC}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return bo}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return pb}}),Object.defineProperty(exports,"zt",{enumerable:!0,get:function(){return Ge}});
1788
+ please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw e.it(new e._(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${n}`),e.tt.safetyEvaluationFailure)}return[{name:t,expression:mS(t),scope:void 0}]})},wS=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>wS(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=kh(e.name,t);if(n?.kind===`Operator`&&n.params.length===0&&rg(n,t)===void 0)return wS(n.body,t)}return[e]},TS=(t,n,r)=>{let i=t.expression;if(i.kind!==`Identifier`||yx(i,t.scope,n)>0)return!1;let a=U(i,HS(n,void 0,void 0,t.scope));if(a===!1)throw new e._(`The spec is trivially false because ${i.name} is false.`);if(a!==!0)throw new e._(`The operator ${i.name}, which equals ${I(a)},\ncannot be used as a ${r}`);return!0},ES=(t,n,r,i,a)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return yS(t,e,n),mS(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[],isPropertyFairness:!1}}if(t.init!==void 0||t.next!==void 0)throw new e._(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let o=[],s=[],c=[],l=n.constants.has(t.specification)?n.constants.get(t.specification):vS(t.specification,gS(`name`,t.specification,n),n);if(l!==void 0)throw new e._(`The value of ${t.specification} is equal to ${I(l)}`);let u=gS(`name`,t.specification,n),d=t.properties.length===1?t.properties[0]:void 0,f=!1;xx(u.body,void 0,n,!1).forEach(t=>{let l=t.expression;if(TS(t,n,`spec`))return;let u=l.kind===`Identifier`&&!O(l)?n.variableIndex.get(l.name):void 0;if(l.kind===`Identifier`&&u!==void 0){let t=r[u].range;throw new e._(`The operator ${l.name}, which equals ${t?ih(t):l.name},\ncannot be used as a spec`)}if(l.kind===`UnboundedQuantifier`&&l.isTemporal)throw e.it(new e._(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.tt.error);if(l.kind===`Always`&&l.expression.kind===`BoxAction`){let r=Jx(l.expression.subscript,t.scope,n);if(r===void 0&&a?.({kind:`warning`,code:Ke.subscriptUndetermined,text:`TLC could not determine if the subscript of the next-state relation contains
1789
+ all state variables. Proceed with fingers crossed.`}),i().filter(e=>r!==void 0&&!r.includes(e)).forEach(e=>a?.({kind:`warning`,code:Ke.subscriptMissingVariable,text:`The subscript of the next-state relation specified by the specification\ndoes not seem to contain the state variable ${e}`})),s.length>0)throw new e._(`The specification contains more than one conjunct of the form [][Next]_v,
1790
+ but TLC can handle only specifications with one next-state relation.`);s.push({expression:l.expression.action,scope:t.scope});return}if(l.kind===`Always`&&l.expression.kind!==`Let`&&l.expression.kind!==`Label`&&yx(l.expression,t.scope,n)<2)throw e.it(new e.b(`TLC cannot handle the temporal formula ${V(l.expression)}`),e.tt.error);let p=yx(l,t.scope,n);if(p===3)d!==void 0&&t.path.includes(d)||(f=!0),c.push(t);else{if(p===2)throw new e._(`TLC cannot handle this conjunct of the spec:\n${V(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:pS},next:s.length===0?void 0:g(s[0],o.length),scope:h,temporals:c,isPropertyFairness:c.length>0&&!f}},DS=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=bS(`property`,t,n);if(!a)return;yx(a.body,void 0,n)===1&&r?.({kind:`state-level-property`,name:t});let o=n.runtime.version!==`1.7.4`;xx(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(TS(r,n,`property`))return;let o=r.name??t;if(a.kind===`Always`&&a.expression.kind===`BoxAction`){i.actionProperties.push({name:o,box:a.expression,action:a.expression.action,subscript:a.expression.subscript,scope:r.scope});return}if(a.kind===`Always`&&yx(a.expression,r.scope,n)<=1){let e=a.expression,t=e.kind===`Identifier`&&!O(e)?kh(e.name,n):void 0;i.invariants.push({name:t?.name??(e.kind===`Identifier`?e.name:o),expression:e,scope:r.scope});return}let s=yx(a,r.scope,n);if(s<2)i.initialPredicates.push({name:o,expression:a,scope:r.scope});else{if(s===2){let t=V(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},OS=(e,t,n)=>t.flatMap(t=>bS(e,t,n)?[{name:t,expression:mS(t),scope:void 0}]:[]),kS=(e,t)=>{let n=kh(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},AS=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e._(`_POSSIBLE lists ${r} more than once`);yS(`possible`,r,n);let a=mS(r);if(yx(a,void 0,n)===3)throw new e._(`The possible of ${r} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:r,expression:a,scope:void 0}}),jS=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||O(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},MS=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=kh(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},NS=(e,t)=>e.flatMap(e=>wS(e.expression,t).map(n=>{let r=e.scope===void 0?xu(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:jS(n,r,t),predicate:MS(e.expression,t)}})),PS=(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},FS=/[\u0100-\uffff]/,IS=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),LS=e=>e.kind===`String`?FS.test(e.value):e.kind===`Set`&&e.elements.some(LS),RS=e=>e.kind===`String`&&FS.test(e.value)||e.kind===`Apply`&&IS.has(e.operator)||D(e).some(RS),zS=(e,t)=>e.constants.some(e=>LS(e.value)||(e.args??[]).some(LS))||[...t.definitions.values()].some(e=>RS(e.body)||e.kind===`Function`&&e.bounds.some(e=>RS(e.set))),BS=e=>{if(!Mt(e))return;let t=zt(F(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},VS=(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`},HS=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),US=(e,t,n)=>wh(U(e,t),n),WS=(t,n,r=KS)=>{let i=U(t,n);if(typeof i!=`boolean`)throw new e.b(r(t,n.environment));return i},GS=(e,t,n)=>{let r=t.kind===`Identifier`?kh(t.name,n):void 0,i=r?.kind===`Operator`?r.body:t,a=r?.kind===`Operator`?r.bodyRange:void 0;return`TLC expected a ${e} value, but did not find one. ${a&&i.kind!==`Number`?ih(a):sh(i)}`},KS=(e,t)=>GS(`boolean`,e,t),qS=(e,t)=>WS(e.expression,t,(n,r)=>(WS(e.predicate,t),KS(n,r))),JS=()=>{},YS=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=US(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),XS=(t,n)=>{try{return t(HS(n,void 0,void 0))?void 0:{message:void 0}}catch(t){if(t instanceof e.b)return{message:t.message};throw t}},ZS=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=XS(e=>Oh(U(n.expression,e),n.expression),t);if(e)return{name:sh(n.expression),trace:[],message:e.message}}},QS=e=>{let t=typeof e.config==`string`?Be(e.config,e.version):e.config,n=mb(e.source,e.loadModule);Xt(n.getStringOrder(t)),tn(e),Ma(e.fingerprintPolynomial??0);let r=Ab(t,{source:e.source,loadModule:e.loadModule,order:n,loadClass:e.loadClass,print:e.onPrint??console.log,files:{readFile:e.readFile,writeFile:e.writeFile,makeDirectory:e.makeDirectory},seed:e.seed,isTool:e.isTool,traceFile:e.traceSpec?.traceFile,isSanyReported:e.isSanyReported,isWarningEnabled:e.isWarningEnabled,version:e.version,moduleOperators:e.moduleOperators});SS(r,t,e.onProgress);let i=r.environment;return i.runtime.getSpecification=()=>eS(t,i,r.variableLocations,r.instanceActions),{config:t,specification:r,environment:i,search:tC(t,i,r.variableLocations,()=>n.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators)}},$S=(t,n,r)=>{let i=ZS(t,n);if(!i)return;if(i.message===void 0){let t=`Assumption ${i.name} is false.`;return r(Ke.assumptionFalse,t,t),e.tt.assumptionViolation}let a=`Evaluating assumption ${i.name} failed.\n${i.message}`;return r(Ke.assumptionEvaluationError,a,at(Ke.assumptionEvaluationError,a,!0)),e.tt.assumptionViolation},eC=t=>e.it(new e.b(`${e.G}Could not find operator: ${t.operator} in module: ${t.module}`),e.tt.error),tC=(t,n,r,i,a,o=[])=>{let s=e=>o.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw eC(e);return{name:e.operator,key:e.key}}),c=CS(t.invariants,n),l=ES(t,n,r,i,a),u=DS(t,n,a),d=t.properties[0],f=d&&kh(d,n)?.location.range,p=t.specification,m=p&&kh(p,n)?.location.range;l.isPropertyFairness&&f&&m&&a?.({kind:`warning`,code:Ke.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${d} at ${ih(f)} equals\nthe fairness constraints of the behavior specification ${p} at ${ih(m)}.\nTherefore, checking whether ${p} => ${d} using TLC will never result in a violation of ${d}.`});let h=NS([...c,...u.invariants],n),g=[...new Map(h.map(e=>[e.predicate,e])).values()],ee=h.length>0||u.actionProperties.length>0||u.liveness.length>0;if(l.init===void 0&&(ee||u.initialPredicates.length>0||n.variables.length>0))throw new e._(n.runtime.version===`1.7.4`?Ze:`The configuration file did not specify the initial state predicate.`);if(l.next===void 0&&ee)throw new e._(`The configuration file did not specify the next state predicate.`);let _=OS(`constraint`,[...t.constraints,...s(`constraint`).map(e=>e.name)],n),v=NS(_,n),te=OS(`action constraint`,t.actionConstraints,n),ne=n.coverage,y=(e,t,r=!0)=>t.flatMap(t=>{if(!ne)return[];let i=r?MS(t.expression,n):t.expression,a=Ga(r?t.name:void 0,i,n),o=Ua(ne,e,a,i,t.scope);return[{expression:i,scope:t.scope,node:o}]}),re=[...y(`invariant`,c),...y(`invariant`,u.invariants,!1)],ie=y(`constraint`,te),ae=y(`constraint`,_),oe=y(`implied`,u.initialPredicates,!1),se=y(`implied`,u.actionProperties.map(e=>({...e,expression:e.box})),!1),ce=(e,t,r,i)=>{try{return io(e,t.node,()=>U(t.expression,HS(n,r,i,t.scope)))}catch{return}},le=(e,t,n)=>ne!==void 0&&e.every(e=>ce(ne,e,t,n)===!0),b=(e,t,n)=>{if(ne){for(let r of e){let e=ce(ne,r,t,n);if(typeof e!=`boolean`)return;if(!e)return ne.primary[r.node]++,!1;ne.secondary[r.node]++}return!0}};t.rlReward!==void 0&&gS(`rlreward`,t.rlReward,n),t.periodic!==void 0&&gS(`periodic`,t.periodic,n);let ue=AS(t.possible,n);if(n.variables.length===0)return;let de=t.symmetry===void 0?void 0:cS(t.symmetry,n,t.substitutions),fe=t.view===void 0?void 0:yS(`view function`,t.view,n),x=t.view??s(`view`)[0]?.name,S=x===void 0?void 0:{name:x,expression:mS(x),scope:void 0},C=u.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:pS};return{...e,unchanged:t}}),w=e=>yx(e.expression,void 0,n)>=2,pe=ue.filter(e=>!w(e)),me=ue.filter(w),he=n.runtime,ge,_e=()=>{if(ge)return ge;let e=i(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return ge=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),ge},ve=(e,t)=>U(e,HS(n,t,void 0)),T=e=>{let t=_e(),n=de===void 0?e:fS(e,de,t);return Ia(S===void 0?t.map(e=>n[e]):[ve(S.expression,n)])},E=/* @__PURE__ */ new WeakSet,ye=(t,r,i)=>{let a=i&&!E.has(i)?i:void 0;if(PS(t,r,a))return!1;try{let e=HS(n,r,void 0,t.scope),i=t.membership;return a&&i?!Ci(r[i.variable],a[i.variable],U(i.set,e)):!qS(t,e)}catch(n){throw i?dt(e.it(n,e.tt.safetyEvaluationFailure),Ke.invariantEvaluationFailed,`Evaluating invariant ${t.name} failed.`):n}},be=zS(t,n);he.getFingerprint=T;let xe=()=>{let e=ue.find(e=>!he.possibleCounts.get(e.name));if(!e)return;let t=kS(e.name,n),r=t?` at ${ih(t)}`:``;return{name:e.name,code:Ke.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:k(I(Gd(he),!0))}},Se=fe?.body.kind===`Tuple`?fe.body.elements:[],Ce=Se.flatMap(e=>e.kind===`Identifier`&&n.variables.includes(e.name)?[e.name]:[]),we=fe?.body.kind===`Tuple`&&Ce.length===Se.length&&new Set(Ce).size===Ce.length,Te=(e,t)=>we?_e().filter(e=>Ce.includes(n.variables[e])).map(e=>`/\\ ${n.variables[e]} = ${k(I(t[e]))}\n`).join(``):k(I(ve(e,t))),Ee=(t,r,i)=>WS(t.expression,HS(n,r,i),t=>`${e.G}${KS(t,n)}`),De=e=>{let t=Object.fromEntries(_e().map(t=>[n.variables[t],e[t]]));return S===void 0?t:rn(t,()=>Te(S.expression,e))};return{properties:u,spec:l,toRecord:De,evaluateAlias:(t,r,i,a)=>{try{yS(`alias`,t,n);let e=U(mS(t),HS(n,r,i)),a=BS(e);return a===void 0?De(r):on(a,t)}catch(t){if(!(t instanceof e._||t instanceof e.b))throw t;return{...De(r),_ALIASEvalError:ot(t.message,a)}}},isSymmetric:de!==void 0,isConstrained:v.length>0||te.length>0,getTlcOrder:_e,getStoredFingerprints:(e,t)=>S!==void 0||be?BigInt64Array.from(e,T):La(t,_e()),getFingerprintState:e=>{if(be)return[String(T(e))];let t=de===void 0?e:fS(e,de,_e());return S===void 0?t:[ve(S.expression,t)]},findViolatedInvariant:(e,t)=>{if(le(re,e))return;let n=h.find(n=>ye(n,e,t));return n&&E.add(e),n},getViolatedInvariants:e=>{let t=g.filter(t=>h.some(n=>n.predicate===t.predicate&&ye(n,e,void 0)));return t.length>0&&E.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>WS(n,HS(t,e,void 0,r));v.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)=>(!(!(v.every(e=>WS(e.predicate,HS(n,t,void 0,e.scope)))&&te.every(r=>WS(r.expression,HS(n,e,t,r.scope))))||r())||g.every(e=>WS(e.predicate,HS(n,t,void 0,e.scope))))&&C.every(r=>WS(r.box,HS(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>b(ae,e)??v.every(r=>PS(r,e,t)||qS(r,HS(n,e,void 0))),findFailedInitialPredicate:e=>le(oe,e)?void 0:u.initialPredicates.find(t=>!WS(t.expression,HS(n,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>le(se,e,t)?void 0:C.find(r=>{try{return!WS(r.action,HS(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${V(r.box)}`)&&!US(r.unchanged,HS(n,e,t,r.scope),`a subscript`)}catch(e){throw dt(nC(e),Ke.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>b(ie,e,t)??te.every(n=>Ee(n,e,t)),getExcludingConstraints:(e,t)=>[...v.filter(e=>!qS(e,HS(n,t,void 0))),...te.filter(n=>!Ee(n,e,t))].map(e=>{let t=kS(e.name,n);return t?ih(t):e.name}),trackStatePossible:pe.length===0?JS:e=>YS(pe,he,HS(n,e,void 0)),trackActionPossible:me.length===0?JS:(e,t)=>YS(me,he,HS(n,e,t)),findUnwitnessedPossible:xe,getReward:(r,i,a)=>{if(t.rlReward===void 0)return a;let o=mS(t.rlReward),s=U(o,HS(n,r,i));if(typeof s!=`number`)throw new e.b(GS(`integer`,o,n));return s},findPostconditionViolation:(r=!1)=>{let i=s(`postcondition`),a=t.postconditions.map(e=>{let t=kh(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}`:!_S(t)&&rg(t,n)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(a!==void 0){if(r)return;throw e.it(new e.b(a),e.tt.configParseError)}let o=(e,t)=>{let r=XS(e=>WS(mS(t),e),n);if(!r)return;let i=kh(t,n)?.body,a=kS(t,n),o=a?` at ${i?.kind===`Number`?sh(i):ih(a)}`:``;return r.message===void 0?{name:e,code:Ke.postconditionFalse,message:`Postcondition ${e}${o} is false.`}:{name:e,code:Ke.postconditionFailed,message:`Evaluating postcondition ${e}${o} failed.\n${r.message}`}};for(let e of i){let t=o(e.name,e.key);if(t)return t}let c=xe();if(c)return c;for(let e of t.postconditions){let t=o(e,e);if(t)return t}}}},nC=t=>t instanceof e.O?e.it(t,t.exitCode):t,rC=(e,t)=>e*((t-e)/2**64),iC=e=>e.includes(`.`)?e:`${e}.0`,aC=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return iC(String(e));let[n,r]=e.toExponential().split(`e`);return`${iC(n)}E${r.replace(`+`,``)}`},oC=e=>e!==void 0&&e>=`0`&&e<=`9`,sC=e=>{if(e===0)return`0.0`;let t=aC(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;oC(t[n.next]);)n.result+=t[n.next++],n.digits++;if(n.next===t.length)return n.result;if(t[n.next]!==`.`)return t;if(n.next++,n.digits>=2)for(;oC(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;oC(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(oC(t[n.next])&&Number(t[n.next])>=5&&(n.result=cC(n.result));oC(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},cC=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${cC(r)}.`:n===`9`?`${cC(r)}0`:`${r}${Number(n)+1}`},lC=e=>{let t={value:0};for(;10n**BigInt(t.value+1)<e*10n;)t.value++;let n=10n**BigInt(t.value+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t.value+1}`)},uC=(e,t,n)=>{if(rC(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a={narrow:1/0,wide:9223372036854775807n};for(let e=1;e<r.length;e++){let t=i[2*e+1],n=i[2*e-1];if(t<0!=n<0)continue;let o=t-n;if(o<=1048576){let t=o*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a.narrow=Math.min(a.narrow,t)}else{let t=r[e]-r[e-1];t<a.wide&&(a.wide=t)}}if(a.narrow===1/0)return a.wide;let o=BigInt(a.narrow);return o<a.wide?o:a.wide},dC=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a={count:0},o=n.find(t=>(a.count+=e[t],a.count>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},fC=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},pC=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^qi(e[t]),16777619),r=Math.imul(r^$i(e[t]),1540483477);t[0]=fC(n)||1,t[1]=fC(r)},mC=()=>{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)}}},hC=(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}},gC=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),_C=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return hC(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},vC=e=>Atomics.load(e.used,0)*2>=e.slots.length,yC=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&hC(t,n);return{slots:t,used:e.used}},bC=[void 0,`lambda`,`tuple`,`record`],xC=()=>{let e=/* @__PURE__ */ new Int32Array(1024),t=0,n=0,r=[],i=/* @__PURE__ */ new Map,a=n=>{if(t===e.length){let t=new Int32Array(e.length*2);t.set(e),e=t}e[t++]=n},o=e=>{let t=i.get(e);if(t!==void 0)return a(t);i.set(e,r.length),a(r.length),r.push(e)},s=e=>{if(typeof e==`boolean`)return a(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(a(2),a(e),!0);if(typeof e==`string`)return a(3),o(e),!0;if(e.kind===`ModelValue`)return a(4),o(e.name),!0;if(e.kind===`Set`)return a(5),a(e.elements.length),e.elements.every(s);if(e.kind===`Function`){let t=Pi(e.domain);return t?(a(7),a(bC.indexOf(Dn(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(bC.indexOf(Dn(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})}},SC=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 bn(t.strings[n[r++]]);if(e===5)return Sn(i(n[r++]));let a=bC[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=Nr({kind:`Interval`,low:e,high:e+t-1});return En(wn(o,i(t)),a)}let o=n[r++],s=i(o);return En(wn(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return Ym}}),Object.defineProperty(exports,"$t",{enumerable:!0,get:function(){return D}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return wx}}),Object.defineProperty(exports,"At",{enumerable:!0,get:function(){return Gi}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return Ty}}),Object.defineProperty(exports,"Bt",{enumerable:!0,get:function(){return Ke}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Qx}}),Object.defineProperty(exports,"Ct",{enumerable:!0,get:function(){return Ri}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return eS}}),Object.defineProperty(exports,"Dt",{enumerable:!0,get:function(){return ga}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Xx}}),Object.defineProperty(exports,"Et",{enumerable:!0,get:function(){return Ir}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return fx}}),Object.defineProperty(exports,"Ft",{enumerable:!0,get:function(){return qi}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return Ig}}),Object.defineProperty(exports,"Gt",{enumerable:!0,get:function(){return lt}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return Ay}}),Object.defineProperty(exports,"Ht",{enumerable:!0,get:function(){return Xe}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return Hb}}),Object.defineProperty(exports,"It",{enumerable:!0,get:function(){return Ln}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return kh}}),Object.defineProperty(exports,"Jt",{enumerable:!0,get:function(){return xt}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return V}}),Object.defineProperty(exports,"Kt",{enumerable:!0,get:function(){return ct}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return lx}}),Object.defineProperty(exports,"Lt",{enumerable:!0,get:function(){return Pn}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return Cx}}),Object.defineProperty(exports,"Mt",{enumerable:!0,get:function(){return xn}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return Lb}}),Object.defineProperty(exports,"Nt",{enumerable:!0,get:function(){return Tt}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return kx}}),Object.defineProperty(exports,"Ot",{enumerable:!0,get:function(){return I}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return $}}),Object.defineProperty(exports,"Pt",{enumerable:!0,get:function(){return Qt}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return Xm}}),Object.defineProperty(exports,"Qt",{enumerable:!0,get:function(){return vt}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return Ab}}),Object.defineProperty(exports,"Rt",{enumerable:!0,get:function(){return Xt}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return nC}}),Object.defineProperty(exports,"St",{enumerable:!0,get:function(){return Ma}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Yx}}),Object.defineProperty(exports,"Tt",{enumerable:!0,get:function(){return bn}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return ky}}),Object.defineProperty(exports,"Ut",{enumerable:!0,get:function(){return at}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return Dy}}),Object.defineProperty(exports,"Vt",{enumerable:!0,get:function(){return qe}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return Kv}}),Object.defineProperty(exports,"Wt",{enumerable:!0,get:function(){return ot}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return Og}}),Object.defineProperty(exports,"Xt",{enumerable:!0,get:function(){return rt}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return kg}}),Object.defineProperty(exports,"Yt",{enumerable:!0,get:function(){return _t}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return Jm}}),Object.defineProperty(exports,"Zt",{enumerable:!0,get:function(){return ft}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return VS}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return so}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return yC}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return Jp}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return xS}}),Object.defineProperty(exports,"bt",{enumerable:!0,get:function(){return bo}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return pC}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return Of}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return uC}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return Xd}}),Object.defineProperty(exports,"en",{enumerable:!0,get:function(){return Be}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return Qm}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return rC}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return bd}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return ZS}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return eo}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return tC}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return Ua}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return gC}}),Object.defineProperty(exports,"in",{enumerable:!0,get:function(){return oe}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return qp}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return Tx}}),Object.defineProperty(exports,"jt",{enumerable:!0,get:function(){return Ki}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return px}}),Object.defineProperty(exports,"kt",{enumerable:!0,get:function(){return Zt}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return sC}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return yf}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return eC}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return ws}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return xC}}),Object.defineProperty(exports,"nn",{enumerable:!0,get:function(){return ye}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return Yp}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return _C}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return Df}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return dC}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return wd}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return ih}}),Object.defineProperty(exports,"qt",{enumerable:!0,get:function(){return nt}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return mC}}),Object.defineProperty(exports,"rn",{enumerable:!0,get:function(){return ne}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return Kp}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return vC}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return Ef}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return SC}}),Object.defineProperty(exports,"tn",{enumerable:!0,get:function(){return Oe}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return Zm}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return lC}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return qd}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return QS}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return Ba}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return $x}}),Object.defineProperty(exports,"wt",{enumerable:!0,get:function(){return Bn}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return SS}}),Object.defineProperty(exports,"xt",{enumerable:!0,get:function(){return Ia}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return $S}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return Ga}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return mb}}),Object.defineProperty(exports,"zt",{enumerable:!0,get:function(){return tn}});