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.
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +0 -34
- package/dist/index.d.ts +0 -34
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +43 -43
- package/dist/prove.js +47 -47
- package/dist/run.cjs +30 -30
- package/dist/run.js +33 -33
- package/dist/transfer.cjs +38 -38
- package/dist/transfer.js +39 -39
- package/package.json +1 -1
- package/src/ast.ts +5 -0
- package/src/bags.ts +5 -2
- package/src/builtins.ts +8 -1
- package/src/check.ts +193 -128
- package/src/cli/run.ts +2 -0
- package/src/cli/runtime-invariants.ts +7 -8
- package/src/cli/shared.ts +4 -0
- package/src/cli/tlc-arguments.ts +30 -24
- package/src/cli/tlc-usage.ts +3 -2
- package/src/evaluate.ts +102 -26
- package/src/java-overrides.ts +9 -4
- package/src/json-reader.ts +2 -1
- package/src/json.ts +11 -4
- package/src/levels.ts +15 -7
- package/src/lexer.ts +83 -72
- package/src/liveness-checker.ts +106 -77
- package/src/liveness.ts +34 -10
- package/src/parallel.ts +33 -26
- package/src/parser.ts +226 -163
- package/src/pcal/ast.ts +65 -53
- package/src/pcal/parse.ts +191 -144
- package/src/pcal/tokenize.ts +115 -91
- package/src/pcal/translate.ts +98 -83
- package/src/pcal/validate.ts +50 -48
- package/src/pretty-print.ts +6 -6
- package/src/randomization.ts +4 -1
- package/src/resolve.ts +70 -12
- package/src/runtime.ts +18 -11
- package/src/sany/builtins.ts +3 -1
- package/src/sany/generator.ts +127 -74
- package/src/sany/levels.ts +9 -5
- package/src/sany/lexer.ts +44 -40
- package/src/sany/linter.ts +1 -0
- package/src/search.ts +1 -1
- package/src/simulate.ts +59 -50
- package/src/spec-description.ts +34 -23
- package/src/standard-definitions.ts +3 -0
- package/src/standard-modules.ts +12 -1
- package/src/state-graph.ts +8 -1
- package/src/subexpressions.ts +47 -38
- package/src/successors.ts +35 -14
- package/src/symmetry.ts +19 -4
- package/src/tlc/fingerprint.ts +21 -15
- package/src/tlc/jar-data.ts +1 -0
- package/src/tlc/messages.ts +21 -2
- package/src/tlc/order.ts +38 -20
- package/src/tlc/random.ts +30 -18
- package/src/tlc/replay.ts +33 -13
- package/src/tlc/summary.ts +45 -36
- package/src/tlc/tlc-operators.ts +14 -4
- package/src/tlc/tlcext-operators.ts +15 -11
- package/src/tlc/trace-spec.ts +4 -0
- package/src/tlc/value-stream.ts +13 -9
- package/src/tlc/version.ts +1 -0
- package/src/values.ts +181 -74
package/dist/transfer.js
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
|
-
import{$ as e,B as t,C as n,F as r,G as i,J as a,K as o,N as s,O as c,P as l,Q as u,R as d,S as f,V as p,W as m,X as h,Y as
|
|
10
|
-
`,t:` `,r:`\r`,f:`\f`},
|
|
11
|
-
`),s=n.index,
|
|
12
|
-
`&&e!==`\r`)-s);continue}if(n===40&&e.charCodeAt(s+1)===42){let t=0;do{if(s>=e.length)throw
|
|
13
|
-
`?
|
|
14
|
-
`?
|
|
15
|
-
`||e[a]===`\r`?
|
|
16
|
-
\r`.includes(e[t]))n++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=
|
|
17
|
-
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),
|
|
9
|
+
import{$ as e,B as t,C as n,F as r,G as i,J as a,K as o,N as s,O as c,P as l,Q as u,R as d,S as f,V as p,W as m,X as h,Y as ee,Z as te,_ as g,b as _,et as ne,g as v,h as re,it as y,k as ie,q as ae,tt as b,u as oe,v as se,x as ce,y as le,z as ue}from"./worker.js";import{gzipSync as de}from"node:zlib";const x=/* @__PURE__ */ new Set(/* @__PURE__ */ `ACTION.ACTIONS.ASSUME.ASSUMPTION.AXIOM.BY.CASE.CHOOSE.CONSTANT.CONSTANTS.COROLLARY.DEF.DEFINE.DEFS.DOMAIN.ELSE.ENABLED.EXCEPT.EXTENDS.HAVE.HIDE.IF.IN.INSTANCE.LAMBDA.LEMMA.LET.LOCAL.MODULE.NEW.OBVIOUS.OMITTED.ONLY.OTHER.PICK.PROOF.PROPOSITION.PROVE.QED.RECURSIVE.STATE.SUBSET.SUFFICES.TAKE.TEMPORAL.TEMPORALS.THEN.THEOREM.UNCHANGED.UNION.USE.VARIABLE.VARIABLES.WITH.WITNESS`.split(`.`)),S=/* @__PURE__ */ new Map([[`in`,`\\in`],[`notin`,`\\notin`],[`subseteq`,`\\subseteq`],[`subset`,`\\subset`],[`supseteq`,`\\supseteq`],[`supset`,`\\supset`],[`cup`,`\\cup`],[`union`,`\\cup`],[`cap`,`\\cap`],[`intersect`,`\\cap`],[`X`,`\\X`],[`times`,`\\X`],[`o`,`\\o`],[`circ`,`\\o`],[`div`,`\\div`],[`land`,`/\\`],[`lor`,`\\/`],[`lnot`,`~`],[`neg`,`~`],[`equiv`,`<=>`],[`leq`,`<=`],[`geq`,`>=`],[`A`,`\\A`],[`forall`,`\\A`],[`E`,`\\E`],[`exists`,`\\E`],[`AA`,`\\AA`],[`EE`,`\\EE`],[`cdot`,`\\cdot`],[`sqsubseteq`,`\\sqsubseteq`],[`sqsupseteq`,`\\sqsupseteq`],[`sqsubset`,`\\sqsubset`],[`sqsupset`,`\\sqsupset`],[`sqcap`,`\\sqcap`],[`sqcup`,`\\sqcup`],[`oplus`,`\\oplus`],[`ominus`,`\\ominus`],[`otimes`,`\\otimes`],[`oslash`,`\\oslash`],[`odot`,`\\odot`],[`uplus`,`\\uplus`],[`prec`,`\\prec`],[`preceq`,`\\preceq`],[`succ`,`\\succ`],[`succeq`,`\\succeq`],[`sim`,`\\sim`],[`simeq`,`\\simeq`],[`approx`,`\\approx`],[`cong`,`\\cong`],[`asymp`,`\\asymp`],[`doteq`,`\\doteq`],[`propto`,`\\propto`],[`wr`,`\\wr`],[`star`,`\\star`],[`bullet`,`\\bullet`],[`bigcirc`,`\\bigcirc`],[`ll`,`\\ll`],[`gg`,`\\gg`]]),C=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),w=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),fe=/* @__PURE__ */ new Map([[`∃`,`\\E`],[`∀`,`\\A`],[`∷`,`::`],[`≜`,`==`],[`⟨`,`<<`],[`⟩_`,`>>_`],[`⟩`,`>>`],[`→`,`->`],[`←`,`<-`],[`↦`,`|->`],[`⁺`,`^+`],[`¬`,`~`],[`□`,`[]`],[`◇`,`<>`],[`∧`,`/\\`],[`∨`,`\\/`],[`∈`,`\\in`],[`≈`,`\\approx`],[`≔`,`:=`],[`≍`,`\\asymp`],[`◯`,`\\bigcirc`],[`⩴`,`::=`],[`●`,`\\bullet`],[`∩`,`\\cap`],[`⋅`,`\\cdot`],[`∘`,`\\o`],[`≅`,`\\cong`],[`∪`,`\\cup`],[`÷`,`\\div`],[`≐`,`\\doteq`],[`‥`,`..`],[`…`,`...`],[`≡`,`<=>`],[`‼`,`!!`],[`≥`,`>=`],[`≫`,`\\gg`],[`⇔`,`<=>`],[`⇒`,`=>`],[`⫤`,`=|`],[`↝`,`~>`],[`≤`,`<=`],[`≪`,`\\ll`],[`⊣`,`-|`],[`≠`,`#`],[`∉`,`\\notin`],[`⊙`,`\\odot`],[`⊖`,`\\ominus`],[`⊕`,`\\oplus`],[`⊘`,`\\oslash`],[`⊗`,`\\otimes`],[`⇸`,`-+->`],[`≺`,`\\prec`],[`⪯`,`\\preceq`],[`∝`,`\\propto`],[`⁇`,`??`],[`⊨`,`|=`],[`⊢`,`|-`],[`∼`,`\\sim`],[`≃`,`\\simeq`],[`⊓`,`\\sqcap`],[`⊔`,`\\sqcup`],[`⊏`,`\\sqsubset`],[`⊑`,`\\sqsubseteq`],[`⊐`,`\\sqsupset`],[`⊒`,`\\sqsupseteq`],[`⋆`,`\\star`],[`⊂`,`\\subset`],[`⊆`,`\\subseteq`],[`≻`,`\\succ`],[`⪰`,`\\succeq`],[`⊃`,`\\supset`],[`⊇`,`\\supseteq`],[`×`,`\\X`],[`⊎`,`\\uplus`],[`‖`,`||`],[`≀`,`\\wr`]]),pe=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),me=e=>e.startsWith(`\\`)?parseInt(e.slice(2),pe.get(e[1].toLowerCase())):Number(e),he=/-{4,} *MODULE\b/,ge=/* @__PURE__ */ new Uint8Array(128);(/* @__PURE__ */ new Map([[`0123456789`,33],[`abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ`,2],[`_`,4],[`01`,8],[`01234567`,16],[`abcdefABCDEF`,32]])).forEach((e,t)=>{for(let n of t)ge[n.charCodeAt(0)]|=e});const _e=(e,t)=>e<128&&(ge[e]&t)!==0,ve=(e,t,n)=>{let r=t;for(;_e(e.charCodeAt(r),n);)r++;return r},ye=/* @__PURE__ */ new Map;w.forEach(e=>{let t=e.charCodeAt(0),n=ye.get(t)??[];n.push(e),ye.set(t,n)});const T=(e,t)=>{let n=ye.get(e.charCodeAt(t));if(n!==void 0){for(let r=0;r<n.length;r++)if(e.startsWith(n[r],t))return n[r]}},be=(e,t)=>{if(e.charCodeAt(t)<128)return;let n=e.slice(t,t+2);if(fe.has(n))return n;let r=e[t];return fe.has(r)?r:void 0},xe=(e,t)=>{let n=e.charCodeAt(t);if(n===92&&_e(e.charCodeAt(t+1),2)){let n=e.slice(t+1,ve(e,t+1,2)),r={value:n.length};for(;r.value>0&&!S.has(n.slice(0,r.value));)r.value--;let i=S.get(n.slice(0,r.value));return{text:i??`\\`,length:i===void 0?1:r.value+1}}let r=be(e,t);if(r!==void 0)return{text:fe.get(r)??``,length:r.length};let i=T(e,t);return i?{text:C.get(i)??i,length:i.length}:n===92?{text:`\\`,length:1}:void 0},Se=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),Ce=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>fe.has(e)||Se.has(e));return n===void 0?void 0:{text:n,length:n.length}},E=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},we=(e,t,n)=>{let r=e[t+1]===`+`||e[t+1]===`*`,i=r?t+2:ve(e,t+1,1);if(i===t+1||e[i]!==`>`)return 0;let a=!r||!n,o=a?ve(e,i+1,7):i+1,s=a&&o===i+1&&(e[o]===`*`||e[o]===`-`);return E(e,s?o+1:o,e=>e===`.`)-t},Te=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,Ee={n:`
|
|
10
|
+
`,t:` `,r:`\r`,f:`\f`},De=(e,t)=>t===9?e+8-e%8:e+1,Oe=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),ke=(e,t)=>{if(e.charCodeAt(t)!==92)return 0;let n=Oe.get(e.charAt(t+1).toLowerCase());if(n===void 0)return 0;let r=ve(e,t+2,n);return r===t+2?0:r-t},Ae=(e,t=!1)=>{let n=he.exec(e);if(!n)throw new r(`Expected a module header such as ---- MODULE Name ----`);let i=[],a=/* @__PURE__ */ new Map,o=e.slice(0,n.index).split(`
|
|
11
|
+
`),s={index:n.index,line:o.length,lineStart:n.index-o[o.length-1].length,moduleDepth:0},c={lineStart:-1,position:0,width:0},l=()=>{for((c.lineStart!==s.lineStart||c.position>s.index)&&(c.lineStart=s.lineStart,c.position=s.lineStart,c.width=0);c.position<s.index;c.position++)c.width=De(c.width,e.charCodeAt(c.position));return De(c.width,e.charCodeAt(s.index))},u=(e,t,n,r)=>{let a=l();i.push({kind:e,text:t,spelling:r,line:s.line,column:a,endColumn:a+n-1}),s.index+=n},d=t=>{for(let n=0;n<t;n++)e.charCodeAt(s.index)===10&&(s.line++,s.lineStart=s.index+1),s.index++},f=t=>new r(`${t} at line ${s.line}, column ${l()}`,void 0,{reason:t,line:s.line,column:l(),isEnd:s.index>=e.length});for(;s.index<e.length;){let n=e.charCodeAt(s.index);if(n===10||n===32||n===9||n===13){d(1);continue}if(n===92&&e.charCodeAt(s.index+1)===42){d(E(e,s.index,e=>e!==`
|
|
12
|
+
`&&e!==`\r`)-s.index);continue}if(n===40&&e.charCodeAt(s.index+1)===42){let t={value:0};do{if(s.index>=e.length)throw f(`Unterminated comment`);e.startsWith(`(*`,s.index)?(t.value++,d(2)):e.startsWith(`*)`,s.index)?(t.value--,d(2)):d(1)}while(t.value>0);continue}if(n===45&&e.startsWith(`----`,s.index)){let t=E(e,s.index,e=>e===`-`)-s.index,n=E(e,s.index+t,e=>e===` `);e.startsWith(`MODULE`,n)&&s.moduleDepth++,u(`Separator`,`----`,t);continue}if(n===61&&e.startsWith(`====`,s.index)){if(u(`ModuleEnd`,`====`,E(e,s.index,e=>e===`=`)-s.index),s.moduleDepth--,s.moduleDepth<=0)break;continue}if(n===34){let t=s.line,n=l(),r=[];for(d(1);e.charCodeAt(s.index)!==34;){let t=e.charCodeAt(s.index);if(s.index>=e.length||t===10||t===13)throw f(`Unterminated string`);if(t===92){let t=e[s.index+1];if(t===void 0||!`ntrf\\"`.includes(t))throw f(`Invalid escape in string`);r.push(Ee[t]??t),d(2)}else r.push(e[s.index]),d(1)}d(1),i.push({kind:`String`,text:r.join(``),line:t,column:n,endColumn:l()-1});continue}let r=ke(e,s.index);if(r>0){u(`Number`,e.slice(s.index,s.index+r),r);continue}if(_e(n,7)){let t=ve(e,s.index,7),r=e.slice(s.index,t),i=ve(e,s.index,1);if(i===t){let n=e.charCodeAt(t)===46?ve(e,t+1,1):t,i=n>t+1,a=i?e.slice(s.index,n):r;u(i?`Decimal`:`Number`,a,a.length);continue}if(!/[A-Za-z]/.test(r)){let t=n===95?`_`:e.slice(s.index,i);u(t===`_`?`Operator`:`Number`,t,t.length);continue}if(r.startsWith(`WF_`)||r.startsWith(`SF_`)){u(`Keyword`,r.slice(0,3),3);continue}let o=a.get(r)??r;a.set(o,o),u(x.has(r)?`Keyword`:`Identifier`,o,r.length);continue}let o=e[s.index];if(n>=128&&Se.has(o)){u(`Identifier`,a.get(o)??o,1),a.set(o,o);continue}if(n===60){let n=we(e,s.index,t);if(n>0){u(`Step`,e.slice(s.index,s.index+n),n);continue}}let c=xe(e,s.index);if(c){let t=e.slice(s.index,s.index+c.length);u(`Operator`,c.text,c.length,t===c.text?void 0:t)}else throw f(`Unexpected character ${JSON.stringify(o)}`)}let p=l();return i.push({kind:`End`,text:``,line:s.line,column:p,endColumn:p}),i},je=[[`EOF`],[`BEGIN_PRAGMA`,`--->`],[`_BM1`],[`NUMBER`],[`_BM2`],[`_BM0`],[`SEPARATOR`],[`END_MODULE`],[`ACTION`,`ACTION`,`ACTIONS`],[`ASSUME`,`ASSUME`],[`BOXASSUME`,`[]ASSUME`],[`ASSUMPTION`,`ASSUMPTION`,`AXIOM`],[`CASE`,`CASE`],[`CHOOSE`,`CHOOSE`],[`CONSTANT`,`CONSTANT`,`CONSTANTS`],[`ELSE`,`ELSE`],[`EXCEPT`,`EXCEPT`],[`EXISTS`,`\\E`,`\\exists`,`∃`],[`EXTENDS`,`EXTENDS`],[`FORALL`,`\\A`,`\\forall`,`∀`],[`IF`,`IF`],[`INSTANCE`,`INSTANCE`],[`LET`,`LET`],[`LETIN`,`IN`],[`LOCAL`,`LOCAL`],[`MODULE`,`MODULE`],[`NEW`,`NEW`],[`OTHER`,`OTHER`],[`PROPOSITION`,`PROPOSITION`,`LEMMA`,`COROLLARY`],[`SF`,`SF_`],[`T_EXISTS`,`\\EE`],[`T_FORALL`,`\\AA`],[`THEN`,`THEN`],[`BY`,`BY`],[`ONLY`,`ONLY`],[`DEFINE`,`DEFINE`],[`DF`,`DEF`,`DEFS`],[`THEOREM`,`THEOREM`],[`USE`,`USE`],[`HIDE`,`HIDE`],[`HAVE`,`HAVE`],[`OBVIOUS`,`OBVIOUS`],[`OMITTED`,`OMITTED`],[`LAMBDA`,`LAMBDA`],[`TAKE`,`TAKE`],[`PROOF`,`PROOF`],[`PROVE`,`PROVE`],[`BOXPROVE`,`[]PROVE`],[`QED`,`QED`],[`RECURSIVE`,`RECURSIVE`],[`STATE`,`STATE`],[`TEMPORAL`,`TEMPORAL`,`TEMPORALS`],[`PICK`,`PICK`],[`WITNESS`,`WITNESS`],[`SUFFICES`,`SUFFICES`],[`VARIABLE`,`VARIABLE`,`VARIABLES`],[`WF`,`WF_`],[`WITH`,`WITH`],[`COMMA`,`,`],[`COLON`,`:`],[`COLONCOLON`,`::`,`∷`],[`DOT`,`.`],[`US`,`_`],[`DEF`,`==`,`≜`],[`LBR`,`(`],[`RBR`,`)`],[`DEFBREAK`,`-|-`],[`LSB`,`[`],[`ARSB`,`]_`],[`RSB`,`]`],[`LBC`,`{`],[`RBC`,`}`],[`LAB`,`<<`,`⟨`],[`ARAB`,`>>_`,`⟩_`],[`RAB`,`>>`,`⟩`],[`BANG`,`!`],[`ARROW`,`->`,`→`],[`SUBSTITUTE`,`<-`,`←`],[`MAPTO`,`|->`,`↦`],[`NUMBER_LITERAL`],[`STRING_LITERAL`],[`BAND`],[`BOR`],[`op_57`,`'`],[`op_68`,`^+`,`⁺`],[`op_69`,`^*`],[`op_70`,`^#`],[`op_76`,`-.`],[`op_26`,`\\lnot`,`¬`],[`op_29`,`\\neg`],[`op_58`,`~`],[`CASESEP`,`[]`,`□`],[`op_61`,`<>`,`◇`],[`op_112`,`ENABLED`],[`op_113`,`UNCHANGED`],[`op_114`,`SUBSET`],[`op_115`,`UNION`],[`op_116`,`DOMAIN`],[`op_1`,`//`],[`AND`,`/\\`,`∧`],[`op_3`,`/=`],[`op_4`,`/`],[`OR`,`\\/`,`∨`],...[`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`].map(e=>[`infix`,e]),[`IN`,`\\in`,`∈`],...(/* @__PURE__ */ `\\intersect.\\union.\\land.\\leq.\\ll.\\lor.\\o.\\odot.\\ominus.\\oplus.\\oslash.\\otimes.\\prec.\\preceq.\\propto.\\sim.\\simeq.\\sqcap.\\sqcup.\\sqsubset.\\sqsupset.\\sqsubseteq.\\sqsupseteq.\\star.\\subset.\\subseteq.\\succ.\\succeq.\\supset.\\supseteq.\\uplus.\\wr.\\.~>.=>.=<.=|`.split(`.`)).map(e=>[`infix`,e]),[`EQUALS`,`=`],...[`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`].map(e=>[`infix`,e]),[`op_77`,`-`],...[`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`].map(e=>[`infix`,e]),[`op_119`,`\\X`],[`IDENTIFIER`],[`ProofStepLexeme`],[`ProofImplicitStepLexeme`],[`ProofStepDotLexeme`],[`BareLevelLexeme`],[`UnnumberedStepLexeme`]],Me=je.map(e=>e[0]),Ne=new Map(Me.map((e,t)=>[e,t]).reverse()),D=e=>{let t=Ne.get(e);if(t===void 0)throw new le(`Unknown SANY token kind ${e}`);return t},Pe=new Map(je.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),Fe=Math.max(...[...Pe.keys()].map(e=>e.length)),Ie=Array.from({length:Fe},(e,t)=>Fe-t),Le=/----+ *MODULE/y,Re=[/_\w*[A-Za-z]\w*/y,/[0-9]\w*[A-Za-z]\w*/y,/[WS](?:[a-zA-EG-Z_0-9]\w*)?/y,/[WS]F(?:[A-Za-z0-9]\w*)?/y,/[a-zA-RT-VX-Z]\w*/y,/@|ℕ|ℤ|ℝ/y],ze=e=>[/[0-9][A-Za-z0-9]*/,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*/,/[a-zA-RT-VX-Z][A-Za-z0-9]*/].map(t=>RegExp(`${t.source}${e}`,`y`)),Be=ze(String.raw`\.\/\\`),Ve=ze(String.raw`\.\\\/`),O=String.raw`<(?:[0-9]+|\+|\*)>`,He=[[`_BM0`,[Le]],[`SEPARATOR`,[/----+/y]],[`END_MODULE`,[/====+/y]],[`NUMBER_LITERAL`,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[`STRING_LITERAL`,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[`BAND`,Be],[`BOR`,Ve],[`IDENTIFIER`,Re],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${O}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(O,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${O}(?:\*\.*|-\.*|\.+)`,`y`)]]],Ue=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[Le]]],We=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[Le]],[`BAND`,Be],[`BOR`,Ve],[`IDENTIFIER`,Re]],Ge=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),Ke=(e,t,n)=>e.map(([e,r])=>({kind:D(e),length:Math.max(...r.map(e=>Ge(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),qe=(e,t)=>{let n=Ie.find(n=>Pe.has(e.slice(t,t+n))),r=Ke(He,e,t);if(n===void 0)return r;let i={kind:Pe.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},Je=e=>e+8-e%8,Ye=e=>{let t=[],n=[],r={line:1,column:0,isAfterCr:!1,isAfterLf:!1};for(let i of e)for(let e=0;e<i.length;e++)r.column++,r.isAfterLf?(r.isAfterLf=!1,r.line++,r.column=1):r.isAfterCr&&(r.isAfterCr=!1,i===`
|
|
13
|
+
`?r.isAfterLf=!0:(r.line++,r.column=1)),i===`\r`?r.isAfterCr=!0:i===`
|
|
14
|
+
`?r.isAfterLf=!0:i===` `&&(r.column=Je(r.column-1)),t.push(r.line),n.push(r.column);return{lines:t,columns:n}},Xe=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,Ze=new Set([...Pe.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),Qe=(e,t)=>{let n=0;for(;Ze.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,Ge(Xe,e,t)))},$e=e=>{let t=Ye(e),n={offset:0,mode:`DEFAULT`},r=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),i=()=>r(D(`EOF`),e.length-1,0),a=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?nt(o,s,e[a],i):t.lines[n]===o?e[a]===`
|
|
15
|
+
`||e[a]===`\r`?nt(o+1,0,void 0,i):nt(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},o=()=>{let t=n.offset;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return a(t,e.length,``);n.offset+=r+1;return}let r=0,i=t,o=t;for(;o<e.length;)if(e.startsWith(`(*`,o))r++,o+=2,r>1&&(i=o);else if(e.startsWith(`*)`,o)){if(r--,o+=2,i=o,r===0){n.offset=o;return}}else o++;return n.offset=o,i===e.length?void 0:a(i,o,``)},s=t=>{for(;n.offset<e.length;){let i=Ke(t,e,n.offset);if(i.length>0){let e=r(i.kind,n.offset,i.length);return n.offset+=i.length,Me[i.kind].startsWith(`_BM`)&&(n.mode=`SPEC`),Me[i.kind]===`BEGIN_PRAGMA`&&(n.mode=`PRAGMA`),e}n.offset++}return i()};return()=>{if(n.mode===`DEFAULT`)return s(Ue);if(n.mode===`PRAGMA`)return s(We);for(;n.offset<e.length;){let t=n.offset;if(`
|
|
16
|
+
\r`.includes(e[t]))n.offset++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=o();if(e!==void 0)return e}else{let i=qe(e,t);if(i.length===0){let n=Qe(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),o=r<e.length?n:i.length>1?i:``;return a(t,r,o)}let o=r(i.kind,t,i.length);return n.offset+=i.length,o}}return i()}},et=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
|
|
17
|
+
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),tt=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>et.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),nt=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${tt(n)}" (${n.charCodeAt(0)}), `}after : "${tt(r)}"`,rt=e=>{let t=$e(e);for(let e=t();typeof e!=`string`&&e.kind!==D(`EOF`);e=t()){let t=e.image.split(``).findIndex(e=>{let t=e.charCodeAt(0);return t>255&&(t&255)<128});if(t===-1)continue;let n=e.image.slice(1,t+1).split(``).reduce((e,t)=>t===` `?Je(e):e+1,e.beginColumn);return nt(e.beginLine,n,e.image[t],e.image.slice(0,t))}},it=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],at=/* @__PURE__ */ new Set([...it,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),ot=[`TYPE`,`TYPE_CONSTRAINT`],st=/* @__PURE__ */ new Set([...it,...ot]),ct=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],lt=e=>{let t=0,n=0;do{if(t>=e.length)return;let r=e.slice(t,t+2),i=r===`(*`?1:r===`*)`?-1:0;n+=i,t+=i===0?1:2}while(n>0);return t},ut=e=>{let t=[],n=0,r=1,i=0,a=(n,a)=>{t.push({kind:`Error`,text:nt(r,n-i+1,e[n],a),line:r})},o=e=>{t.push({kind:`Error`,text:nt(r+1,0,void 0,e),line:r})},s=e=>{let t=e.split(`
|
|
18
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=ct(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=Oe(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=Se(e,n)??E(e,n),m=st.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},ut=(e,t)=>new _(`TLC found an error in the configuration file at line ${e}\n${t}`),dt=(e,t)=>ut(e,`The keyword ${t} appeared twice.`),ft=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),pt=/* @__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`]]),mt=(t,n=`master`)=>{let r=n===`1.7.4`?ot:it,i=lt(t),a=0,o={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],rawConstants:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},s=!1,c=/* @__PURE__ */ new Set,l=()=>{let e=i[Math.min(a++,i.length-1)];if(e.kind===`Error`)throw new _(`TLC found an error in the configuration file:\n${e.text}`);return e},u=t=>{if(t.kind===`Number`&&t.text.startsWith(`\\`))throw x(new _(`${e(`java.lang.NumberFormatException`)}For input string: "${t.text}"`),ie.error);if(t.kind===`Number`)return{kind:`Number`,value:Number(t.text)};if(t.kind===`String`&&t.text.includes(`\\`))throw new _(`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 ut(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 ut(t.line,`It was expecting a value, but did not find it.`)},d=e=>{let t=l();if(t.kind===`End`)throw ut(t.line,`Expected an identifier after ${e}[.`);let n=l();if(n.text!==`]`)throw ut(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 ut(t.line,`Expected an identifier after <-[mod].`);o.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw ut(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 ut(t,``);r=l()}if(r.text!==`=`)throw ut(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)?ft.get(e):void 0,i=r.has(e)?pt.get(e):void 0,a=()=>{let n=l();if(n.kind===`End`)throw ut(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 dt(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 ut(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(s)throw dt(t,e);s=!0,o.checkDeadlock=n.text===`TRUE`,h=l()}else{if(!r.has(e)||!at.includes(e))throw ut(t,`It was expecting a keyword, but did not find it.`);if(a(),c.has(e))throw dt(t,e);c.add(e),h=l()}}return o},ht=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:[])}},A=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,gt={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:` `}},_t=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},vt=e=>e!==void 0&&/^\p{Nd}$/u.test(e),yt=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),bt=e=>{let t=t=>{let n=D(e,t,_t);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=D(e,t,vt);if(e.startsWith(`..`,n)&&vt(e[n+2]))return{kind:`Constant`,first:t,last:D(e,n+2,vt)-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=vt(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:D(e,t+1,vt)-1,children:[]};if(yt(n))return{kind:`Constant`,first:t,last:D(e,t,yt)-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)},j=e=>{let t=e.length===0?void 0:bt(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=gt[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},xt={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},St={none:0,error:1,warning:3,state:4},Ct={0:``,1:`Error: `,3:`Warning: `,4:`State `},wt=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${Ct[n]}${r}`,Tt=(e,t=!0,n=`master`,r=[],i=[])=>{let a=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,o,s)=>{let c=o===St.warning;if(c&&i.includes(n))throw new p(n,s);if(c&&!t||o!==St.error&&r.includes(n))return;let l=c&&!e&&a.size===0?`
|
|
20
|
-
(Use the -nowarning option to disable this warning.)`:``,u=
|
|
19
|
+
`);s(e===-1?i:i.slice(0,e));continue}if(i.startsWith(`(*`)){let e=lt(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=ke(e,n),d=u>0?i.slice(0,u):/^\d+(?![A-Za-z_])/.exec(i)?.[0];if(d){t.push({kind:`Number`,text:d,line:l}),s(d);continue}let f=/^[A-Za-z0-9_]+/.exec(i)?.[0];if(f){t.push({kind:`Word`,text:f,line:l}),s(f);continue}if(i.startsWith(`"`)){let r=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(i),c=r?.[0]??`"`;if(r?.[2]!==`"`)return s(c),n===e.length?o(`${c}\n`):a(n,c),t;t.push({kind:`String`,text:c,line:l}),s(c);continue}let p=Ce(e,n)??xe(e,n),m=ct.find(e=>i.startsWith(e));if(m&&m.length>=(p?.length??0))t.push({kind:`Symbol`,text:m,line:l}),s(m);else{if(!p)return a(n,``),t;t.push({kind:`Word`,text:p.text,line:l}),s(e.slice(n,n+p.length))}}return t.push({kind:`End`,text:``,line:r}),t},dt=(e,t)=>new g(`TLC found an error in the configuration file at line ${e}\n${t}`),ft=(e,t)=>dt(e,`The keyword ${t} appeared twice.`),pt=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),mt=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),ht=(t,n=`master`)=>{let r=n===`1.7.4`?st:at,i=ut(t),a=0,o={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],rawConstants:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},s=!1,c=/* @__PURE__ */ new Set,l=()=>{let e=i[Math.min(a++,i.length-1)];if(e.kind===`Error`)throw new g(`TLC found an error in the configuration file:\n${e.text}`);return e},u=t=>{if(t.kind===`Number`&&t.text.startsWith(`\\`))throw y(new g(`${e(`java.lang.NumberFormatException`)}For input string: "${t.text}"`),b.error);if(t.kind===`Number`)return{kind:`Number`,value:Number(t.text)};if(t.kind===`String`&&t.text.includes(`\\`))throw new g(`TLC found an error in the configuration file:\nescape sequences are not supported in strings at line ${t.line}`);if(t.kind===`String`)return{kind:`String`,value:t.text.slice(1,-1)};if(t.text===`TRUE`||t.text===`FALSE`)return{kind:`Boolean`,value:t.text===`TRUE`};if(t.text===`{`){let e=[],t=l();if(t.text!==`}`)for(;e.push(u(t)),t=l(),t.text===`,`;)t=l();if(t.text!==`}`)throw dt(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(t.kind!==`End`)return{kind:`ModelValue`,name:t.text};throw dt(t.line,`It was expecting a value, but did not find it.`)},d=e=>{let t=l();if(t.kind===`End`)throw dt(t.line,`Expected an identifier after ${e}[.`);let n=l();if(n.text!==`]`)throw dt(n.line,`It was expecting ], but did not find it.`);return t.text},f=(e,t)=>{let n=e.text,r=l();for(;r.text===`!`;)n=`${n}!${l().text}`,r=l();if(r.text===`<-`){if(r=l(),r.text===`[`){let e=d(`<-`),t=l();if(t.kind===`End`)throw dt(t.line,`Expected an identifier after <-[mod].`);o.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw dt(r.line,`Expected an identifier after <-.`);o.substitutions.push({name:n,target:r.text});return}let i=[],a=r.text===`(`;if(a){for(;i.push(u(l())),r=l(),r.text===`,`;);if(r.text!==`)`)throw dt(t,``);r=l()}if(r.text!==`=`)throw dt(r.line,`It was expecting = or <-, but did not find it.`);r=l();let s=r.text===`[`?d(`=`):void 0,c=u(s===void 0?r:l());o.constants.push({name:n,value:c,...a&&{args:i},...s!==void 0&&{module:s}})},p=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;let n=a-1;f(t,e),o.rawConstants.push(i.slice(n,a).map(e=>e.text).join(` `))}},m=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;e.push(t.text)}},h=l();for(;h.kind!==`End`;){let e=h.text,t=h.line,n=r.has(e)?pt.get(e):void 0,i=r.has(e)?mt.get(e):void 0,a=()=>{let n=l();if(n.kind===`End`)throw dt(t,`The keyword ${e} was not followed by an identifier.`);return n};if(n!==void 0){let r=a();if(o[n]!==void 0)throw ft(t,e);o[n]=r.text,h=l()}else if(i!==void 0)h=m(o[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)h=p(t);else if(e===`CHECK_DEADLOCK`){let n=a();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw dt(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(s)throw ft(t,e);s=!0,o.checkDeadlock=n.text===`TRUE`,h=l()}else{if(!r.has(e)||!ot.includes(e))throw dt(t,`It was expecting a keyword, but did not find it.`);if(a(),c.has(e))throw ft(t,e);c.add(e),h=l()}}return o},gt=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},k=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,_t={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},vt=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},yt=e=>e!==void 0&&/^\p{Nd}$/u.test(e),bt=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),xt=e=>{let t=t=>{let n=E(e,t,vt);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=E(e,t,yt);if(e.startsWith(`..`,n)&&yt(e[n+2]))return{kind:`Constant`,first:t,last:E(e,n+2,yt)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=yt(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:E(e,t+1,yt)-1,children:[]};if(bt(n))return{kind:`Constant`,first:t,last:E(e,t,bt)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},A=e=>{let t=e.length===0?void 0:xt(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=_t[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),ee=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||ee===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${ee}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},St={general:1e3,stackOverflow:1005,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,unchangedVariableChanged:2143,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,initialStateIncomplete:2106,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,noInitialStates:2118,errorState:2120,behaviorUpToThisPoint:2121,backToState:2122,subscriptUndetermined:2139,subscriptMissingVariable:2140,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,simulating:2188,finished:2186,traceSpecWritten:2501,traceSpecFailed:2502,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,coverageStart:2201,coverageEnd:2202,coverageValue:2221,depthFirstStats:2204,depthFirstLevel:2205,depthFirstProgress:2206,depthFirstInitGenerated:2208,simulationProgress:2209,simulationStats:2210,temporalBranches:2212,statePrint1:2216,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,noInitialStatesInModel:2256,version:2262,depthFirstModelChecking:2271,noSpecificationButProperty:2257,fairnessTautology:2258,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,coverageNext:2772,coverageInit:2773,coverageProperty:2774,coverageValueCost:2775,coverageEndOverhead:2777,coverageConstraint:2778,coverageVariable:2779,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001,moduleOverrideStdout:2e4},Ct={none:0,error:1,warning:3,state:4},wt={0:``,1:`Error: `,3:`Warning: `,4:`State `},Tt=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${wt[n]}${r}`,Et=(e,t=!0,n=`master`,r=[],i=[])=>{let a=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,o,s)=>{let c=o===Ct.warning;if(c&&i.includes(n))throw new p(n,s);if(c&&!t||o!==Ct.error&&r.includes(n))return;let l=c&&!e&&a.size===0?`
|
|
20
|
+
(Use the -nowarning option to disable this warning.)`:``,u=Tt(e,n,o,`${s}${l}`);c&&a.has(u)||(c&&a.add(u),console.log(u))}}},Dt=`The configuration file did not specify the initial state predicate.
|
|
21
21
|
Can also be caused by trying to run TLC on a specification from
|
|
22
|
-
a module imported with a parameterized INSTANCE statement.`,
|
|
22
|
+
a module imported with a parameterized INSTANCE statement.`,Ot=[[1005,oe,!1],[1e3,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable%1% %2% undefined).`,!1],[1e3,`Could not find operator: %1% in module: %2%`,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
|
|
23
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
|
|
@@ -32,7 +32,7 @@ but it produced the following error:
|
|
|
32
32
|
is an element of %2%.`,!0],[2157,`Attempted to apply TransitiveClosure to a set containing
|
|
33
33
|
the following value:
|
|
34
34
|
%1%`,!0],[2156,`TLC supports at most %1% model values, but model value %2% exceeds this limit.`,!1],[2156,`tla-ts can't recover a model check from the checkpoint in %1%.`,!1],[2165,`Choose can only deal with numbers up to %1%`,!1],[2169,`The %1% argument of %2% should be a %3%, but instead it is:
|
|
35
|
-
%4%`,!0],[2170,`Argument mismatch in operator application.%1%`,!1],[2171,`Parsing or semantic analysis failed.%1%`,!1],[2172,
|
|
35
|
+
%4%`,!0],[2170,`Argument mismatch in operator application.%1%`,!1],[2171,`Parsing or semantic analysis failed.%1%`,!1],[2172,re,!1],[2176,`Applying %1% to the following value,
|
|
36
36
|
which is not %2%:
|
|
37
37
|
%3%`,!0],[2177,`Attempted to apply BagUnion to the following set, whose
|
|
38
38
|
element is not a bag:
|
|
@@ -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,
|
|
47
|
+
is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,Dt,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2236,`The operator %1%, which equals %2%,
|
|
48
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]]
|
|
67
|
+
`,!1],[2250,`A state predicate was evaluated to a non-boolean value.`,!1],[2252,`Encountered an action predicate that's not a boolean.`,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]],kt={value:void 0},At=()=>kt.value??=Ot.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),jt=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+: ))|\nis an element of a set of \d+-tuples\.$|^In computing ENABLED, TLC encountered a temporal formula \(a (~> b|-\+-> formula)\)\./,Mt=e=>jt.test(e)?void 0:At().find(t=>t.pattern.test(e))?.message,Nt=e=>e instanceof c||Mt(e.message)?.isEvalException===!0,Pt=/* @__PURE__ */ new Map([[1e3,`
|
|
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
|
-
`]]),
|
|
73
|
-
`)),Wt=`${i}tlc2.tool.EvalException: `,Gt=`${i}util.Assert$TLCRuntimeException: `,Kt=e=>Mt(e)?Wt:Gt,qt=e=>{try{return e()}catch(e){throw e instanceof v?Mt(e)?new v(`${m}${e.message}`):jt(e.message)?e:new v(`${i}${e.message}`):e}},Jt=[Wt,Gt,i,m],Yt=(e,t)=>{let n=zt.get(e);if(n)return`${n.headline}\n${Yt(n.inner,t)}`;let r=e.message;if(e instanceof le)return r;let i=Jt.find(e=>r.startsWith(e))??``;return`${i}${Ft(r.slice(i.length),t)}`},Xt=(e,t)=>{let n=zt.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:Yt(e,!0)};if(e instanceof l)return{code:t?xt.stackOverflow:xt.general,message:r,toolMessage:r};if(t&&Mt(e))return{code:jt(r)?.code??xt.general,message:r,toolMessage:r};let a=t&&!r.startsWith(Ut)&&!(e instanceof le),o=e instanceof s?Ht:i,c=a?o:``;return{code:xt.general,message:`${c}${r}`,toolMessage:`${c}${Yt(e,!0)}`}},Zt=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,Qt=1e6;let $t=Qt;const en=()=>$t,tn=()=>Math.max($t,10),nn=()=>`Attempted to construct a set with too many elements (>${$t}).`,rn=(e,t)=>{if(e.length===tn())throw new s(nn());e.push(t)},an=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=tn(),on=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},M=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,sn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),cn=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),ln=e=>typeof e==`object`&&e.kind===`ModelValue`,un=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),dn=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:M(e)?`set`:`function`,fn=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let pn=!1;const mn=(e,t)=>(pn=!0,e.writtenKeys=t,e),hn=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,gn=e=>hn(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),_n=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):gn(e),vn=(e,t,n)=>mn(pi(e,t),n),yn=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(yn);e.writtenKeys=void 0,e.range.forEach(yn)}},bn=e=>e.every(e=>typeof e==`string`),xn=(e,t)=>e.length>0&&t.length>0&&bn(e)!==bn(t),Sn=(e,t)=>{pn&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return xn(n,r)?Mr(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=qn(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:qn(t,n);if(r!==0)return r}return 0},Cn=(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=qn(n[e],r[e]);if(t!==0)return t}return 0},wn=e=>ln(e)?e.type:void 0,Tn=(e,t,n)=>{let r=wn(e),i=wn(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(ln(e)&&ln(t)){if(r===void 0||i===void 0||r===i)return;throw new v(`Attempted to ${a} the differently-typed model values ${L(e)} and ${L(t)}`)}throw r===void 0?new v(`Attempted to ${a} the typed model value ${L(t)} and the non-model value\n${L(e)}`):new v(`Attempted to ${a}${n?``:` the`} typed model value ${L(e)} and non-model value\n${L(t)}`)},En={ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0},Dn=e=>{En.ranks=Object.create(null),En.size=0,En.searchRank=void 0,En.unorderedString=void 0,Jn.clear();for(let t of e)Ln(t)},On=()=>{En.searchRank=En.size},kn=()=>En.unorderedString;let An=!1;const jn={isExpanded:!0,isViewPrinted:!1},Mn=e=>{An=e.version===`1.7.4`,$t=e.maxSetSize??Qt,jn.isExpanded=e.isLazyValueExpanded??!0,jn.isViewPrinted=e.isViewPrinted??!1},Nn=/* @__PURE__ */ new WeakMap,Pn=(e,t)=>(jn.isViewPrinted&&Nn.set(e,t),e),Fn=/* @__PURE__ */ new WeakMap,In=(e,t)=>(Fn.set(e,t),e),Ln=e=>(En.ranks[e]===void 0&&(En.ranks[e]=En.size++),e),Rn=e=>En.ranks[Ln(e)],zn=(e,t)=>{if(e===t)return 0;let n=En.ranks,r=n[e],i=n[t],a=En.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(En.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},Bn=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Vn=(e,t)=>(Bn(e)||Bn(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Hn=(e,t)=>new v(Bn(e)?`Attempted to compare overridden value ${L(e,!0)} with non-overridden value:\n${L(t)}`:`Attempted to compare ${dn(e)} ${L(e)} with ${dn(t)} ${L(t)}`),Un=(e,t,n)=>{if(!Bn(e))throw new v(`Attempted to ${n} the set ${L(N(e)?P(e):e,!0)} with the value:\n${L(t,!0)}`);if(!Bn(t))throw Hn(e,t);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new c(`Attempted to compare ${L(e,!0)} with the value\n${L(t,!0)}`)},Wn={kind:`InfiniteSet`,name:`Any`},Gn=e=>{throw new c(`Attempted to compare ANY with the value\n${L(e)}`)},Kn=e=>{pn&&yn(e),e===Wn&&Gn(e),typeof e==`object`&&e.kind===`LazyFunction`&&I(e)},qn=(e,t)=>{if(e===t)return Kn(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Sn(e,t);if(n===`Set`&&r===`Set`)return Cn(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&&Tn(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return Tn(e,t,!1),n===`ModelValue`?-1:1;if(e===Wn||t===Wn)return Gn(e===Wn?t:e);if(M(e)&&M(t)&&Vn(e,t))return Un(e,t,`compare`);let i=M(e);if(i!==M(t))throw Hn(e,t);if(n===`Interval`&&r===`Set`){let n=Ii(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-Ii(t);if(n!==0)return n}return i?Cn(P(e),P(t)):Sn(I(e),I(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return zn(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(Tn(e,t,!1),ln(e))return-1;if(ln(t))return 1;throw Hn(e,t)},Jn=/* @__PURE__ */ new Map,Yn=32768,Xn=e=>{let t=Jn.get(e);if(t)return t;if(Jn.size===Yn)throw new se(`TLC supports at most ${Yn} model values, but model value ${e} exceeds this limit.`);let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Rn(e),hash:pa(ma(ha(e),109)),fingerprint:wa(Ta(e)^60)};return Jn.set(e,n),n},Zn=()=>[...Jn.values()],Qn=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),$n=e=>{let t=Qn(e);return t.isNormalized=!0,t},er=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let tr=!1;const nr=(e,t)=>(t===`lambda`&&(tr=!0),t!==void 0&&(e.functionClass=t),e),rr=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,ir=e=>nr(e,`lambda`),ar=e=>Zt(e)&&e.isCached===!0;let or=!1;const sr=e=>(or=!0,e),cr=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),lr=e=>{or&&typeof e==`object`&&Zt(e)&&cr.has(e.kind)&&(e.isCached=!0)},ur=e=>{(tr||or)&&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(ur),e.range.forEach(ur)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(ur):M(e)&&N(e)&&(lr(e),P(e).elements.forEach(ur))))},dr=(e,t)=>{if(lr(e),e===t)return Kn(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Tn(e,t,!0),qn(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return Sn(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Cn(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&Ii(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==Ii(t))return!1;if(ln(e)||ln(t))return e.kind===`LazyFunction`&&I(e),Tn(e,t,!0),ln(e)&&ln(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return dr(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:dr(e.domain,t.domain)&&dr(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]&&dr(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)=>dr(e,t.factors[n]));let n=M(e)&&M(t)&&!(N(e)&&N(t));if(n&&Vn(e,t))return Un(e,t,`check equality of`)===0;if(n){if(!Bn(e)){let n=P(e);if(!Bn(t))return Cn(n,P(t))===0}return Aa(e)===Aa(t)}return qn(e,t)===0},fr=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):Aa(n)===Aa(r);return n},pr=fr(!1),mr=fr(!0),hr=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},gr=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Ca(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||mr(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||mr(i[e],n))return i[e]}return n.kind===`Set`?hr(n.elements,t):(hr(n.domain,t),hr(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}},_r=(e,t)=>t.length===0||rr(e)===`tuple`?1:ua(t)?.low,vr=e=>{if(!cn(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:_r(e,t.domain)}},yr=e=>{if(!cn(e))return;let t=I(e);return bn(t.domain)?t:void 0},br=(e,t)=>(Tn(t,e,!1),1),xr=(e,t)=>(Tn(t,e,!0),!1),Sr=(e,t)=>(e.type!==void 0&&Tn(e,t,!1),ln(t)?e.rank-t.rank:-1),Cr=(e,t)=>(e.type!==void 0&&Tn(e,t,!0),ln(t)&&e.name===t.name),wr={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`}},Tr=(e,t,n)=>{let r=wr[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)}`},Er=(e,t,n)=>{let r=vr(n);if(!r){if(ln(n))return br(n,t);throw new v(`Attempted to compare the function ${L(t)} with the value:\n${L(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>Dr(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return Dr(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new v(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${L(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},Dr=(e,t)=>{for(let n=0;n<e.length;n++){let r=Mr(e[n],t[n]);if(r!==0)return r}return 0},Or=(e,t)=>{let n=I(e);if(rr(e)===`tuple`){let r=cn(t)?Vi(t):void 0;return r?n.range.length-r.length||Dr(n.range,r):Er({...n,low:1},e,t)}if(rr(e)===`record`){let r=yr(t);if(!r){if(ln(t))return br(t,e);throw new v(`Attempted to compare record:\n${L(e)}\nwith non-record\n${L(t)}`)}return n.domain.length-r.domain.length||Dr(n.domain,r.domain)||Dr(n.range,r.range)}return Er({...n,low:_r(e,n.domain)},e,t)},kr=(e,t)=>Bn(e)||Bn(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),Ar=(e,t)=>{let n=un(t)?t:P(t);return{elements:P(e).elements,otherElements:P(n).elements}},jr=(e,t)=>{if(kr(e,t))return qn(e,t);if(!un(e))return jr(P(e),t);if(!M(t)){if(ln(t))return br(t,e);throw new v(`Attempted to compare the set ${L(e)} with the value:\n${L(t)}`)}let n=Ar(e,t);return n.elements.length-n.otherElements.length||Dr(n.elements,n.otherElements)},Mr=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return qn(e,t);if(ln(t))return br(t,e);throw new v(Tr(e,t,!1))}return e.kind===`ModelValue`?Sr(e,t):cn(e)?Or(e,t):jr(e,t)},Nr=(e,t)=>e.every((e,n)=>Lr(e,t[n])),Pr=(e,t,n)=>{let r=vr(n);if(!r){if(ln(n))return xr(n,t);throw new v(`Attempted to check equality of the function ${L(t)} with the value:\n${L(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&Nr(e.range,r.range);let i=e.low??r.low;return i===void 0?Nr(e.domain,r.domain)&&Nr(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new v(`Attempted to compare an integer with non-integer:\n${L(e)}.`);return e===i+t})&&Nr(e.range,r.range)},Fr=(e,t)=>{let n=I(e);if(rr(e)===`tuple`){let r=cn(t)?Vi(t):void 0;return r?n.range.length===r.length&&Nr(n.range,r):Pr({...n,low:1},e,t)}if(rr(e)===`record`){let r=yr(t);if(!r){if(ln(t))return xr(t,e);throw new v(`Attempted to check equality of record:\n${L(e)}\nwith non-record\n${L(t)}`)}return n.domain.length===r.domain.length&&Nr(n.domain,r.domain)&&Nr(n.range,r.range)}return Pr({...n,low:_r(e,n.domain)},e,t)},Ir=(e,t)=>{if(kr(e,t))return dr(e,t);if(!un(e))return Ir(P(e),t);if(!M(t)){if(ln(t))return xr(t,e);throw new v(`Attempted to check equality of the set ${L(e)} with the value:\n${L(t)}`)}let n=Ar(e,t);return n.elements.length===n.otherElements.length&&Nr(n.elements,n.otherElements)},Lr=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(ln(t))return xr(t,e);throw new v(Tr(e,t,!0))}return e.kind===`ModelValue`?Cr(e,t):cn(e)?Fr(e,t):Ir(e,t)},Rr=e=>{let t=[];for(let n of e){let e=Br(n,t);e.isFound||t.splice(e.index,0,n)}return t},zr=(e,t)=>{let n=Ui.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Br=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=zr(e,()=>Mr(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},Vr=(e,t)=>t.some(t=>zr(t,()=>Lr(t,e))),Hr=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,Ur=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(Ur)),e.kind===`Function`&&(e.domain.forEach(Ur),e.range.forEach(Ur)))},Wr=e=>{if(!(typeof e!=`object`||ar(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:P(e);return;case`FilteredSet`:case`Subset`:return Wr(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(Wr(e.left),Wr(e.right));case`FunctionSet`:return Wr(e.domain),Wr(e.range);case`RecordSet`:return e.sets.forEach(Wr);case`ProductSet`:return e.factors.forEach(Wr)}},Gr=(e,t)=>Wi(dr,Lr,e,t),Kr=e=>{for(let t=1;t<e.length;t++)if(qn(e[t-1],e[t])>=0)return!1;return!0},qr=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},Jr=e=>{for(let t=1;t<e.length;t++)lr(e[t]);if(e.length<2||Kr(e))return Qn(e);let t=[...e].sort(qn),n=[t[0]];for(let e=1;e<t.length;e++)qn(n[n.length-1],t[e])!==0&&n.push(t[e]);return Qn(n)},Yr=e=>{if(qr(e))return Qn(e);let t=Wi(Jr,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},Xr=Qn([]),Zr=(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&&qn(r[a],t)<0;)a++;a<r.length&&qn(r[a],t)===0||i.push(t)}return i.length===n.length?e:Qn(i)},Qr=(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&&qn(r[a],t)<0;)a++;a<r.length&&qn(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Qn(i)},$r=(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=qn(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=Qn(i);if(e.hash!==0&&e.hash!==va){let t=e.hash,n=0;for(;n<a.length;n++){let e=Ca(a[n]);if(e===va)break;t=t+ga(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+Ea(a[e])|0;c.fingerprint=t}return c},ei=e=>{let t=e.length<2?e:[...e].sort((e,t)=>qn(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&qn(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return er(n,r)},ti=e=>{let t=ei(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:mn(t,e.map(e=>e[0]))},ni=[],ri=/* @__PURE__ */ new Map,ii=[],ai=/* @__PURE__ */ new WeakMap,oi=e=>{let t=ni[e]??ri.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?ri.set(e,new WeakRef(n)):ni[e]=n,n},si=e=>{if(Ii(e),e.low===1&&e.high>=1)return oi(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},ci=e=>e.length>0&&(e===ni[e.length]||e===ri.get(e.length)?.deref())||ai.has(e),li=e=>{let t=P(e).elements;return ci(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},ui=e=>{let t=ii[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return ii[e]=n,n},di=e=>nr(er(oi(e.length),e),`tuple`),fi=e=>nr(ei(e),`record`),pi=(e,t)=>nr(er(e,t),`record`),mi=e=>M(e)&&!Bn(e),hi=(e,t=!1)=>`UNION(${L(e.base,t)})`,gi=(e,t=e=>P(e).elements)=>{if(!mi(e.base))throw new v(`Attempted to enumerate the nonenumerable set:\n${hi(e)}`);return t(e.base)},_i=(e,t,n)=>{if(mi(e))return e;throw new v(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${L(e)}\nwhen enumerating:\n${hi(n)}`)},N=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return N(e.base);case`FunctionSet`:return N(e.domain)&&N(e.range)||vi(e.domain)===!0||vi(e)===!0;case`RecordSet`:return e.sets.every(N)||vi(e)===!0;case`ProductSet`:return e.factors.every(N)||vi(e)===!0;case`Union`:return N(e.base)&&(un(e.base)?Hr(e.base):ki(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}},vi=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=vi(e.domain);return t===void 0?void 0:!t&&vi(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=vi(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}},yi=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},bi=(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},xi=e=>{if(typeof e!=`object`||e.kind!==`Subset`||Bn(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=[]:bi(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return Qn(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)})},Si=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Qn(r.map(t=>e[t])));while(bi(r,e.length))}return t},Ci=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(Bn(a))throw new v(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},wi=(e,t=e=>P(e).elements)=>{if(typeof e!=`object`)throw new v(`Expected a set but found ${L(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return Rr(e.elements);case`Interval`:{let t=si(e);return t!==ni[t.length]&&ai.set(t,e),t}case`Subset`:{if(Ii(e.base)===0)return Si([]);if(!M(e.base))throw new v(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${j(L(e.base))}`);let t=P(e.base).elements;if(t.length>30)throw new v(Fi(e));return Si(t)}case`FunctionSet`:{if(!An&&F(e))return[];if(Bn(e.domain))throw new v(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${L(e.domain)}\ncannot be enumerated.`);let n=li(e.domain);if((n.length>0||An)&&Bn(e.range))throw new v(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${L(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return yi(n.map(()=>r)).map(e=>er(n,e))}case`RecordSet`:{if(!An&&F(e))return[];let n=Ci(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${L(t)}`);return yi(n).map(t=>fi(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!An&&F(e))return[];let n=Ci(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${L(e)}`);return yi(n).map(di)}case`FilteredSet`:if(!M(e.base)||Bn(e.base))throw new v(`Attempted to enumerate { x \\in S : p(x) } when S:\n${L(e.base)}\nis not enumerable`);return P(Yr(ki(e.base).filter(t=>e.test(t,!1)))).elements;case`Union`:{let t=[];return gi(e).forEach((n,r)=>{let i=_i(n,r,e);if(an(i))throw new s(nn());ki(i).forEach(e=>rn(t,e))}),P(Yr(t)).elements}case`SetOperation`:{if(e.operator===`\\cap`&&!mi(e.left)&&!mi(e.right))throw new v(`Attempted to enumerate S \\cap T when neither S:\n${L(e.left)}\nnor T:\n${L(e.right)}\nis enumerable`);if(e.operator===`\\`&&!mi(e.left))throw new v(`Attempted to enumerate S \\ T when S:\n${L(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return P(Yr(Ei(e))).elements;let t=e.operator===`\\`||mi(e.left),n=t?e.left:e.right,r=t?e.right:e.left,i=[];return on(typeof n==`object`&&n.kind===`Interval`?n:ki(n),t=>{Ki(t,r)===(e.operator===`\\cap`)&&rn(i,t)}),P(Yr(i)).elements}case`InfiniteSet`:case`SequenceSet`:throw new v(`Attempted to enumerate the non-enumerable set ${L(e)}`);default:throw new v(`Expected a set but found ${L(e)}`)}},P=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Qn(wi(e));let t=typeof e==`object`&&Zt(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=Ui.sets;n?.push(e);let r=wi(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`)?Qn(r):Jr(r);return t&&(t.enumerated=i),i},Ti=e=>{if(!(typeof e!=`object`||ar(e)))switch(e.kind){case`MixedSet`:P(e);return;case`FilteredSet`:return mi(e.base)||P(e),Ti(e.base);case`Union`:if(!un(e.base)&&mi(e.base))return Ti(e.base);gi(e).slice(0,1).forEach(t=>Ti(_i(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!mi(e.left)&&P(e),e.operator!==`\\cup`||mi(e.left)&&mi(e.right)||P(e),e.operator!==`\\cap`||mi(e.left)?Ti(e.left):Ti(e.right),e.operator===`\\cup`&&Ti(e.right)}},Ei=e=>{if(!mi(e.left)||!mi(e.right))throw new v(`Attempted to enumerate S \\cup T when S:\n${L(e.left)}\nand T:\n${L(e.right)}\nare not both enumerable`);if(Ti(e.left),Ti(e.right),an(e.left))throw new s(nn());let t=ki(e.left),n=an(e.right)?void 0:ki(e.right);if(!n||t.length+n.length>tn())throw new s(nn());return[...t,...n]},Di=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return P(e).elements;let t=zr(e,()=>Ei(e)),n=P(Yr(t)).elements;return e.enumerated=Qn(n),n},Oi=(e,t)=>{if(typeof e!=`object`||ar(e))return P(e).elements.some(t);let n=Ui.sets;n?.push(e),Ti(e);let r=Ni(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},ki=e=>{let t=[];return Oi(e,e=>(t.push(e),!1)),t},Ai=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,ji=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(ji);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(ji)&&e.range.every(ji);case`SetOperation`:return e.operator!==`\\cup`&&ji(e.left)&&ji(e.right);case`FilteredSet`:return ji(e.base);case`ProductSet`:return e.factors.every(ji);default:return!1}},Mi=e=>typeof e!=`object`||ar(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?Mi(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||Mi(e.left)||Mi(e.right):Ai(e)?.some(Mi)??!1,Ni=(e,t)=>{if(e.kind===`Union`)return gi(e,ki).some((n,r)=>Oi(_i(n,r,e),t));if(e.kind===`FilteredSet`&&mi(e.base))return Oi(e.base,n=>e.test(n,!1)&&t(n));if(Ai(e)?.some(Mi))return wi(e,ki).some(t);if(e.kind!==`SetOperation`)return P(e).elements.some(t);if(e.operator===`\\cup`)return!mi(e.left)||!mi(e.right)?P(e).elements.some(t):Oi(e.left,t)||Oi(e.right,t);let n=e.operator===`\\`||mi(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return mi(r)?Oi(r,n=>Ki(n,i)===(e.operator===`\\cap`)&&t(n)):P(e).elements.some(t)},F=e=>{if(typeof e!=`object`||!M(e))throw new v(`Shouldn't call isEmpty() on value ${L(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new v(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(F);case`RecordSet`:return e.sets.some(F);case`FunctionSet`:return!F(e.domain)&&F(e.range);case`Union`:return gi(e).every((t,n)=>F(_i(t,n,e)));default:return P(e).elements.length===0}},Pi=(e,t,n)=>e.reduce((e,r)=>{let i=e*Ii(r,t);if(i>2147483647)throw new v(n());return i},1),Fi=e=>`Overflow when computing the number of elements in:\n${L(e)}`,Ii=(e,t)=>{if(typeof e!=`object`)throw new v(`Attempted to compute the number of elements in the ${dn(e)} ${L(e)}.`);switch(e.kind){case`ModelValue`:throw new v(`Attempted to compute the number of elements in the model value ${L(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return Ii(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new v(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new v(`Attempted to compute the number of elements in the overridden value ${L(e)}.`);case`Subset`:{let n=Ii(e.base,t);if(n>=31)throw new v(Fi(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(F(e.domain))return 1;if(F(e.range))return 0;if(Ii(e.range,t)===1)return 1}let n=Ii(e.domain,t),r=Ii(e.range,t);if(r<=1)return n===0?1:r;let i=1;for(let t=0;t<n;t++)if(i*=r,i>2147483647)throw new v(Fi(e));return i}case`RecordSet`:return t!==`1.7.4`&&F(e)?0:Pi(e.sets,t,()=>Fi(e));case`ProductSet`:return t!==`1.7.4`&&F(e)?0:Pi(e.factors,t,()=>`Overflow when computing the number of elements in ${L(e)}`);default:return lr(e),P(e).elements.length}},Li=e=>`Attempted to check if the set ${L(e)}is finite.`,Ri=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new v(`Attempted to check if the ${dn(e)} ${L(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new v(`Attempted to check if the function:\n${L(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Ri(e.base)&&F(e.base);case`Subset`:return Ri(e.base);case`FunctionSet`:{let t=Ri(e.domain);if(t&&F(e.domain))return!0;let n=Ri(e.range);return n&&F(e.range)?!0:n&&(t||Ii(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n=!0;for(let e of t)if(!Ri(e))n=!1;else if(F(e))return!0;return n}case`Union`:if(!mi(e.base))throw new v(`Attempted to check if the nonenumerable set:\n${hi(e)}\nis a finite set.`);return P(e.base).elements.every(Ri);case`SetOperation`:if(e.operator===`\\cup`)return Ri(e.left)&&Ri(e.right);if(e.operator===`\\cap`){if(!Ri(e.left)&&!Ri(e.right))throw new v(Li(e));return!0}if(Ri(e.left))return!0;if(!Ri(e.right))throw new v(Li(e));return!1;case`FilteredSet`:if(!Ri(e.base))throw new v(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${L(e.base)}\nis finite.`);return!0}},zi=(e,t,n=qn)=>{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},Bi=(e,t)=>{let n=e.elements;if(n.length>tn())throw new s(nn());let r=Array.from({length:n.length},()=>!1),i=t.filter(e=>{let t=zi(n,e);return!r[t]&&(r[t]=!0,!0)}),a=Qn(n);return i.some((e,t)=>e!==n[t])&&(a.writtenElements=i),a},Vi=e=>{if(typeof e!=`object`||!cn(e))return;if(e.kind===`LazyFunction`&&(!M(e.domain)||Bn(e.domain)))throw new v(`To convert a function of form [x \\in S |-> f(x)] to a tuple, the set S must be enumerable.`);let t=I(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Hi=(e,t)=>{let n=`Attempted to check if the value:\n${L(e)}\nis an element of the`;if(!cn(t))return`${n} ${dn(t)} ${L(t)}`;let r=rr(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)}`},Ui={sets:void 0},Wi=(e,t,n,r)=>{let i=Ui.sets,a=Ui.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof v))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},Gi=e=>(Ui.sets??[]).slice(e).some(e=>typeof e==`object`&&Ui.callStack?.sources.has(e)===!0),Ki=(e,t)=>{let n=Ui.sets;if(n===void 0)return Zi(e,t);n.push(t);let r=Zi(e,t);return n.pop(),r},qi=(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},Ji=(e,t)=>zi(t.elements,e)!==-1,Yi=(e,t)=>t.isNormalized?Br(e,t.elements).isFound:Vr(e,Hr(t)),Xi=(e,t)=>{if(e.type!==void 0)throw new v(`Attempted to check if the typed model value ${j(L(e))} is an element of\n${j(L(t))}`);return!1},Zi=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return qi(e,t)??Qi(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return Qi(e,t)},Qi=(e,t)=>{if(!M(t))throw new v(Hi(e,t));switch(t.kind){case`Set`:return lr(e),Wi(Ji,Yi,e,t);case`MixedSet`:return Vr(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&(!ln(e)||e.type!==void 0))throw new v(`Attempted to check if the value:\n${L(e)}\nis in the integer interval ${L(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(ln(e))return Xi(e,t);if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new c(`Attempted to check if the value:\n${L(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!M(e)||Bn(e))throw new v(`Attempted to check if the non-enumerable value\n${j(L(e))}\nis element of\n${j(L(t))}`);return P(e).elements.every(e=>Ki(e,t.base));case`FunctionSet`:{if(!cn(e)){if(ln(e))return Xi(e,t);throw new v(`Attempted to check if \n${L(e)}\nwhich is not a TLC function value, is in the set of functions:\n${j(L(t))}`)}let n=I(e),r=_r(e,n.domain);return(r===void 0?Gr(t.domain,Qn(n.domain)):Gr({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>Ki(e,t.range))}case`RecordSet`:{let n=cn(e)?I(e):void 0;if(!n||!bn(n.domain)){if(ln(e))return Xi(e,t);throw new v(`Attempted to check if non-record\n${L(e)}\nis in the set of records:\n${L(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=zi(n.domain,e);return i!==-1&&Ki(n.range[i],t.sets[r])})}case`ProductSet`:{let n=cn(e)?Vi(e):void 0;if(n===void 0){let n=cn(e)&&I(e).domain.every(e=>typeof e==`number`);if(ln(e))return Xi(e,t);if(n)return!1;throw new v(`Attempted to check if non-tuple\n${L(e)}\nis in the set of tuples:\n${L(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>Ki(e,t.factors[n]))}case`FilteredSet`:try{return Ki(e,t.base)&&t.test(e,!0)}catch(n){throw!(n instanceof v)||!Mt(n)?n:new v(`Cannot decide if element:\n${j(L(e))}\n is element of:\n${j(L(t.base))}\nand satisfies the predicate ${t.source?.predicate}`)}case`Union`:{if(!mi(t.base))throw new v(`Attempted to check if:\n ${L(e)}\nis an element of the non-enumerable set:\n ${hi(t)}`);let n=P(t.base).elements;return n.length>1&&n.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),n.some(t=>Ki(e,t))}case`SetOperation`:return t.operator===`\\cup`?Ki(e,t.left)||Ki(e,t.right):Ki(e,t.left)&&Ki(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Vi(e);if(n===void 0){if(ln(e))return Xi(e,t);throw new c(`Attempted to check if the value:\n${j(L(e))}\nis an element of ${j(L(t))}.`)}return n.every(e=>Ki(e,t.base))}default:throw new v(Hi(e,t))}},$i=(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?Ki(e,n):e.range.every((e,r)=>$i(e,t.range[r],n.range)),I=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return e.enumerated;if(N(e.domain)||Ii(e.domain),!M(e.domain))throw new v(`The domains of formal parameters must be enumerable.`);let t=li(e.domain);return e.enumerated=nr(er(t,t.map(t=>e.apply(t))),rr(e)),e.enumerated}throw new v(`Expected a function but found ${L(e)}`)},ea=(e,t,n)=>{let r=j(L(e)),i=j(L(t)),a=n===`1.7.4`;switch(rr(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.`}},ta=(e,t)=>{if(!An)return ea(e,t);let n=j(L(t));return rr(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},na=(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},ra=e=>new v(`Attempted to apply function with integer domain to the non-integer argument ${j(L(e))}`),ia=(e,t)=>zi(e.domain,t),aa=(e,t,n)=>{let r=hn(e);throw An||r!==e.domain||r.length<32?r.forEach(e=>Lr(e,t)):zi(r,t,Mr),n},oa=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=rr(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new v(n(e,t));if(a===void 0&&!An&&typeof t!=`number`&&ci(r))throw ra(t)}let i=na(r,t);return i===-1?Wi(ia,aa,e,t):i},sa=(e,t,n)=>{let r=e.domain,i=Vi(n),a=(t,n,r)=>`In applying the function\n${j(L(e))},\nthe ${t} is:\n${j(L(n))}\nwhich ${r}.\n`,o=()=>new v(a(`argument list`,n,`does not match its formal parameter`));if(i===void 0)throw o();if(typeof r!=`object`||r.kind!==`ProductSet`)throw new v(`Attempted to apply a function to ${L(n)}, which is not in its domain`);if(t.forEach((e,t)=>{if(t>=i.length)throw o();let n=i[t],s=`argument number ${t+1}`;if(!Ki(n,r.factors[t]))throw new v(a(s,n,e===void 0?`is not in the function's domain ${L(r)}`:`is not in its domain`));if(e!==void 0&&Vi(n)?.length!==e)throw new v(a(s,n,`does not match its formal parameter`))}),i.length>t.length)throw o()},ca=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!Ki(t,e.lambdaDomain),la=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return la(e.enumerated,t,n);let r=e.boundTupleLengths;if(r!==void 0)return sa(e,r,t),e.apply(t);if(!Ki(t,e.domain))throw new v(rr(e)===`lambda`?ea(e,t):`Attempted to apply a function to ${L(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new v(`Attempted to apply ${L(e)}, which is not a function`);let r=n??ea;if(ca(e,t))throw new v(r(e,t));let i=oa(e,t,r);if(i===-1)throw new v(r(e,t));return e.range[i]},ua=e=>ci(e)?ai.get(e)??ui(e.length):void 0,da=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=ua(t.domain);if(n)return n;let r=Qn(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},fa=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||e.enumerated===void 0)){if(!Ki(t,e.domain))return e;let r=n(e.apply(t));return nr({kind:`LazyFunction`,domain:e.domain,apply:n=>Gr(t,n)?r:e.apply(n),source:e.source,boundTupleLengths:e.boundTupleLengths},rr(e))}if(!cn(e))throw new v(`Attempted to apply EXCEPT construct to the value ${j(L(e))}.`);let i=I(e);if(ca(i,t))return i;let a=oa(i,t,ta);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=nr(er(i.domain,o),rr(i));if(l.writtenKeys=i.writtenKeys,l.lambdaDomain=i.lambdaDomain,i.hash!==0&&i.hash!==va){let e=Ca(c);if(e!==va){let t=Ca(i.domain[a]);l.hash=s===c?i.hash:i.hash-_a(t,Ca(s))+_a(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Da(e,s)+Da(e,c)|0}return l},pa=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},ma=(e,t)=>Math.imul(e^t,16777619),ha=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return pa(t)},ga=e=>pa(e+2654435769|0),_a=(e,t)=>pa(Math.imul(e,668265261)+t|0),va=795548749,ya=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Ca(t[e]);if(r===va)return va;n=n+ga(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Ca(e.domain[n]),i=Ca(e.range[n]);if(r===va||i===va)return va;t=t+_a(r,i)|0}return t},ba=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new v(`TLC has found a state in which the value of a variable contains ${L(e)}`);if(M(e)){P(e).elements.forEach(ba);return}let t=I(e);t.domain.forEach(ba),t.range.forEach(ba)},xa=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Ca(e)===va&&ba(e);return}catch(e){if(!(e instanceof v))throw e;return e}},Sa=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[]}},Ca=e=>typeof e==`number`?pa(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?ha(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=ya(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?N(e.domain)?Ca(I(e)):va:N(e)?Ca(P(e)):va,wa=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Ta=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return wa(t)},Ea=e=>wa(ka(e)+2135587861|0),Da=(e,t)=>wa(Math.imul(ka(e),374761393)+ka(t)|0),Oa=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Ea(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Da(e.domain[n],e.range[n])|0;return t},ka=e=>typeof e==`number`?wa(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?Ta(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Oa(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?ka(I(e)):N(e)?ka(P(e)):Ta(Aa(e)),Aa=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):ja(e),ja=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${Aa(e.base)}>`;if(e.kind===`FilteredSet`&&!N(e))throw new v(`Attempted to compare the non-enumerable set ${L(e)} with another value`);if(M(e))return N(e)?`{${P(e).elements.map(Aa).join(`,`)}}`:`<${e.kind} ${L(e)}>`;let t=I(e);return`(${t.domain.map((e,n)=>`${Aa(e)}:${Aa(t.range[n])}`).join(`,`)})`},Ma={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},Na=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>Ma[e])}"`,Pa=1999,Fa=e=>e.reduce((e,t)=>e===0?0:e*Ii(t),1),Ia=e=>{if(e.kind===`Subset`)return Ii(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:Ii(e.domain);return(t===0?1:Ii(e.range)**t)<=Pa?P(e):void 0}return Fa(e.kind===`RecordSet`?e.sets:e.factors)<=Pa?P(e):void 0},La=(e,t)=>{if(t||e.kind===`Union`||e.kind===`Subset`&&cn(e.base)&&(e.base.kind===`Function`||N(e.base.domain)))return Ia(e);if(N(e))try{return Ia(e)}catch(e){if(e instanceof v)return;throw e}},Ra=(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 hi(e,t)}},za=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Ba=e=>{if(N(e.domain))try{return I(e)}catch(e){if(e instanceof v||y(e))return;throw e}},Va=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=jn.isExpanded?La(e,t):void 0;return n?r(n):Ra(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?jn.isExpanded||!e.source?Ba(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&&An&&rr(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&rr(e)!==`lambda`);if(i.domain.length===0&&rr(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]]):_n(i);return rr(e)===`record`||i.domain.every(e=>typeof e==`string`&&za(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},Ha=(e,t)=>{if(e===void 0)return!1;try{return dr(e,t)}catch(e){if(e instanceof v)return!1;throw e}},Ua=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,Wa=e=>Array.from({length:e.length},(t,n)=>e.charCodeAt(n)).reduce((e,t)=>Math.imul(e,31)+t|0,0),Ga=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(Ua,(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(
|
|
72
|
+
`]]),Ft=(e,t,n)=>{let r=n?Pt.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${It(t.slice(a),n)}`},It=(e,t)=>{let n=t?Mt(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Ct.none} @!@!@\n${Ft(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},Lt=e=>String(e).padStart(2,`0`),Rt=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${Lt(r%24)}h`:e>36e5?`${Lt(r%24)}h ${Lt(n)}min`:e>6e4?`${Lt(n)}min ${Lt(t)}s`:`${Lt(t)}s`},zt=e=>`${e.getFullYear()}-${Lt(e.getMonth()+1)}-${Lt(e.getDate())} ${Lt(e.getHours())}:${Lt(e.getMinutes())}:${Lt(e.getSeconds())}`,Bt=/* @__PURE__ */ new WeakMap,Vt=(e,t,n)=>{if(!(e instanceof _))return e;let r=y(new _(`${n}\n${e.message}`,e),u(e));return Bt.set(r,{code:t,headline:n,inner:e}),r},Ht=e=>Bt.has(e),Ut=e(`util.WrongInvocationException`),Wt=i.slice(0,i.indexOf(`
|
|
73
|
+
`)),Gt=`${i}tlc2.tool.EvalException: `,Kt=`${i}util.Assert$TLCRuntimeException: `,qt=e=>Nt(e)?Gt:Kt,Jt=e=>{try{return e()}catch(e){throw e instanceof _?Nt(e)?new _(`${m}${e.message}`):Mt(e.message)?e:new _(`${i}${e.message}`):e}},Yt=[Gt,Kt,i,m],Xt=(e,t)=>{let n=Bt.get(e);if(n)return`${n.headline}\n${Xt(n.inner,t)}`;let r=e.message;if(e instanceof ue)return r;let i=Yt.find(e=>r.startsWith(e))??``;return`${i}${It(r.slice(i.length),t)}`},Zt=(e,t)=>{let n=Bt.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:Xt(e,!0)};if(e instanceof l)return{code:t?St.stackOverflow:St.general,message:r,toolMessage:r};if(t&&Nt(e))return{code:Mt(r)?.code??St.general,message:r,toolMessage:r};let a=t&&!r.startsWith(Wt)&&!(e instanceof ue),o=e instanceof s?Ut:i,c=a?o:``;return{code:St.general,message:`${c}${r}`,toolMessage:`${c}${Xt(e,!0)}`}},Qt=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,$t=1e6,en={size:$t},tn=()=>en.size,nn=()=>Math.max(en.size,10),rn=()=>`Attempted to construct a set with too many elements (>${en.size}).`,an=(e,t)=>{if(e.length===nn())throw new s(rn());e.push(t)},on=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=nn(),sn=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},j=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,cn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),ln=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),un=e=>typeof e==`object`&&e.kind===`ModelValue`,dn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),fn=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:j(e)?`set`:`function`,pn=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,mn={isUsed:!1},hn=(e,t)=>(mn.isUsed=!0,e.writtenKeys=t,e),gn=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,_n=e=>gn(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),vn=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):_n(e),yn=(e,t,n)=>hn(mi(e,t),n),bn=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(bn);e.writtenKeys=void 0,e.range.forEach(bn)}},xn=e=>e.every(e=>typeof e==`string`),Sn=(e,t)=>e.length>0&&t.length>0&&xn(e)!==xn(t),Cn=(e,t)=>{mn.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Sn(n,r)?Nr(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Jn(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:Jn(t,n);if(r!==0)return r}return 0},wn=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=Jn(n[e],r[e]);if(t!==0)return t}return 0},Tn=e=>un(e)?e.type:void 0,En=(e,t,n)=>{let r=Tn(e),i=Tn(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(un(e)&&un(t)){if(r===void 0||i===void 0||r===i)return;throw new _(`Attempted to ${a} the differently-typed model values ${I(e)} and ${I(t)}`)}throw r===void 0?new _(`Attempted to ${a} the typed model value ${I(t)} and the non-model value\n${I(e)}`):new _(`Attempted to ${a}${n?``:` the`} typed model value ${I(e)} and non-model value\n${I(t)}`)},Dn={ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0},On=e=>{Dn.ranks=Object.create(null),Dn.size=0,Dn.searchRank=void 0,Dn.unorderedString=void 0,Yn.clear();for(let t of e)Rn(t)},kn=()=>{Dn.searchRank=Dn.size},An=()=>Dn.unorderedString,jn={is174:!1},Mn={isExpanded:!0,isViewPrinted:!1},Nn=e=>{jn.is174=e.version===`1.7.4`,en.size=e.maxSetSize??$t,Mn.isExpanded=e.isLazyValueExpanded??!0,Mn.isViewPrinted=e.isViewPrinted??!1},Pn=/* @__PURE__ */ new WeakMap,Fn=(e,t)=>(Mn.isViewPrinted&&Pn.set(e,t),e),In=/* @__PURE__ */ new WeakMap,Ln=(e,t)=>(In.set(e,t),e),Rn=e=>(Dn.ranks[e]===void 0&&(Dn.ranks[e]=Dn.size++),e),zn=e=>Dn.ranks[Rn(e)],Bn=(e,t)=>{if(e===t)return 0;let n=Dn.ranks,r=n[e],i=n[t],a=Dn.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(Dn.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},Vn=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Hn=(e,t)=>(Vn(e)||Vn(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Un=(e,t)=>new _(Vn(e)?`Attempted to compare overridden value ${I(e,!0)} with non-overridden value:\n${I(t)}`:`Attempted to compare ${fn(e)} ${I(e)} with ${fn(t)} ${I(t)}`),Wn=(e,t,n)=>{if(!Vn(e))throw new _(`Attempted to ${n} the set ${I(M(e)?N(e):e,!0)} with the value:\n${I(t,!0)}`);if(!Vn(t))throw Un(e,t);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new c(`Attempted to compare ${I(e,!0)} with the value\n${I(t,!0)}`)},Gn={kind:`InfiniteSet`,name:`Any`},Kn=e=>{throw new c(`Attempted to compare ANY with the value\n${I(e)}`)},qn=e=>{mn.isUsed&&bn(e),e===Gn&&Kn(e),typeof e==`object`&&e.kind===`LazyFunction`&&F(e)},Jn=(e,t)=>{if(e===t)return qn(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Cn(e,t);if(n===`Set`&&r===`Set`)return wn(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&En(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return En(e,t,!1),n===`ModelValue`?-1:1;if(e===Gn||t===Gn)return Kn(e===Gn?t:e);if(j(e)&&j(t)&&Hn(e,t))return Wn(e,t,`compare`);let i=j(e);if(i!==j(t))throw Un(e,t);if(n===`Interval`&&r===`Set`){let n=Li(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-Li(t);if(n!==0)return n}return i?wn(N(e),N(t)):Cn(F(e),F(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Bn(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(En(e,t,!1),un(e))return-1;if(un(t))return 1;throw Un(e,t)},Yn=/* @__PURE__ */ new Map,Xn=32768,Zn=e=>{let t=Yn.get(e);if(t)return t;if(Yn.size===Xn)throw new ce(`TLC supports at most ${Xn} model values, but model value ${e} exceeds this limit.`);let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:zn(e),hash:ma(ha(ga(e),109)),fingerprint:Ta(Ea(e)^60)};return Yn.set(e,n),n},Qn=()=>[...Yn.values()],$n=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),er=e=>{let t=$n(e);return t.isNormalized=!0,t},tr=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1}),nr={isPresent:!1},rr=(e,t)=>(t===`lambda`&&(nr.isPresent=!0),t!==void 0&&(e.functionClass=t),e),ir=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,ar=e=>rr(e,`lambda`),or=e=>Qt(e)&&e.isCached===!0,sr={isPresent:!1},cr=e=>(sr.isPresent=!0,e),lr=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),ur=e=>{sr.isPresent&&typeof e==`object`&&Qt(e)&&lr.has(e.kind)&&(e.isCached=!0)},dr=e=>{(nr.isPresent||sr.isPresent)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(dr),e.range.forEach(dr)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(dr):j(e)&&M(e)&&(ur(e),N(e).elements.forEach(dr))))},fr=(e,t)=>{if(ur(e),e===t)return qn(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&En(e,t,!0),Jn(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return Cn(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return wn(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&Li(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==Li(t))return!1;if(un(e)||un(t))return e.kind===`LazyFunction`&&F(e),En(e,t,!0),un(e)&&un(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return fr(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=P(e.domain),r=P(t.domain);if(n||r)return n===r;let i=P(e.range),a=P(t.range);return i||a?i===a:fr(e.domain,t.domain)&&fr(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(P(e))return P(t);if(P(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&fr(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return P(e)?P(t):!P(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>fr(e,t.factors[n]));let n=j(e)&&j(t)&&!(M(e)&&M(t));if(n&&Hn(e,t))return Wn(e,t,`check equality of`)===0;if(n){if(!Vn(e)){let n=N(e);if(!Vn(t))return wn(n,N(t))===0}return ja(e)===ja(t)}return Jn(e,t)===0},pr=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):ja(n)===ja(r);return n},mr=pr(!1),hr=pr(!0),gr=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},_r=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=wa(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||hr(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||hr(i[e],n))return i[e]}return n.kind===`Set`?gr(n.elements,t):(gr(n.domain,t),gr(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},vr=(e,t)=>t.length===0||ir(e)===`tuple`?1:da(t)?.low,yr=e=>{if(!ln(e))return;let t=F(e);return{domain:t.domain,range:t.range,low:vr(e,t.domain)}},br=e=>{if(!ln(e))return;let t=F(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},xr=(e,t)=>(En(t,e,!1),1),Sr=(e,t)=>(En(t,e,!0),!1),Cr=(e,t)=>(e.type!==void 0&&En(e,t,!1),un(t)?e.rank-t.rank:-1),wr=(e,t)=>(e.type!==void 0&&En(e,t,!0),un(t)&&e.name===t.name),Tr={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},Er=(e,t,n)=>{let r=Tr[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${I(e)} with ${r.other}:\n${I(t)}`},Dr=(e,t,n)=>{let r=yr(n);if(!r){if(un(n))return xr(n,t);throw new _(`Attempted to compare the function ${I(t)} with the value:\n${I(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>Or(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return Or(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new _(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${I(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},Or=(e,t)=>{for(let n=0;n<e.length;n++){let r=Nr(e[n],t[n]);if(r!==0)return r}return 0},kr=(e,t)=>{let n=F(e);if(ir(e)===`tuple`){let r=ln(t)?Hi(t):void 0;return r?n.range.length-r.length||Or(n.range,r):Dr({...n,low:1},e,t)}if(ir(e)===`record`){let r=br(t);if(!r){if(un(t))return xr(t,e);throw new _(`Attempted to compare record:\n${I(e)}\nwith non-record\n${I(t)}`)}return n.domain.length-r.domain.length||Or(n.domain,r.domain)||Or(n.range,r.range)}return Dr({...n,low:vr(e,n.domain)},e,t)},Ar=(e,t)=>Vn(e)||Vn(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),jr=(e,t)=>{let n=dn(t)?t:N(t);return{elements:N(e).elements,otherElements:N(n).elements}},Mr=(e,t)=>{if(Ar(e,t))return Jn(e,t);if(!dn(e))return Mr(N(e),t);if(!j(t)){if(un(t))return xr(t,e);throw new _(`Attempted to compare the set ${I(e)} with the value:\n${I(t)}`)}let n=jr(e,t);return n.elements.length-n.otherElements.length||Or(n.elements,n.otherElements)},Nr=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return Jn(e,t);if(un(t))return xr(t,e);throw new _(Er(e,t,!1))}return e.kind===`ModelValue`?Cr(e,t):ln(e)?kr(e,t):Mr(e,t)},Pr=(e,t)=>e.every((e,n)=>Rr(e,t[n])),Fr=(e,t,n)=>{let r=yr(n);if(!r){if(un(n))return Sr(n,t);throw new _(`Attempted to check equality of the function ${I(t)} with the value:\n${I(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&Pr(e.range,r.range);let i=e.low??r.low;return i===void 0?Pr(e.domain,r.domain)&&Pr(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new _(`Attempted to compare an integer with non-integer:\n${I(e)}.`);return e===i+t})&&Pr(e.range,r.range)},Ir=(e,t)=>{let n=F(e);if(ir(e)===`tuple`){let r=ln(t)?Hi(t):void 0;return r?n.range.length===r.length&&Pr(n.range,r):Fr({...n,low:1},e,t)}if(ir(e)===`record`){let r=br(t);if(!r){if(un(t))return Sr(t,e);throw new _(`Attempted to check equality of record:\n${I(e)}\nwith non-record\n${I(t)}`)}return n.domain.length===r.domain.length&&Pr(n.domain,r.domain)&&Pr(n.range,r.range)}return Fr({...n,low:vr(e,n.domain)},e,t)},Lr=(e,t)=>{if(Ar(e,t))return fr(e,t);if(!dn(e))return Lr(N(e),t);if(!j(t)){if(un(t))return Sr(t,e);throw new _(`Attempted to check equality of the set ${I(e)} with the value:\n${I(t)}`)}let n=jr(e,t);return n.elements.length===n.otherElements.length&&Pr(n.elements,n.otherElements)},Rr=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(un(t))return Sr(t,e);throw new _(Er(e,t,!0))}return e.kind===`ModelValue`?wr(e,t):ln(e)?Ir(e,t):Lr(e,t)},zr=e=>{let t=[];for(let n of e){let e=Vr(n,t);e.isFound||t.splice(e.index,0,n)}return t},Br=(e,t)=>{let n=Wi.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Vr=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=Br(e,()=>Nr(e,t[r]));if(i===0)return{index:r,isFound:!0};i<0?n.high=r:n.low=r+1}return{index:n.low,isFound:!1}},Hr=(e,t)=>t.some(t=>Br(t,()=>Rr(t,e))),Ur=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,Wr=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(Wr)),e.kind===`Function`&&(e.domain.forEach(Wr),e.range.forEach(Wr)))},Gr=e=>{if(!(typeof e!=`object`||or(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:N(e);return;case`FilteredSet`:case`Subset`:return Gr(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(Gr(e.left),Gr(e.right));case`FunctionSet`:return Gr(e.domain),Gr(e.range);case`RecordSet`:return e.sets.forEach(Gr);case`ProductSet`:return e.factors.forEach(Gr)}},Kr=(e,t)=>Gi(fr,Rr,e,t),qr=e=>{for(let t=1;t<e.length;t++)if(Jn(e[t-1],e[t])>=0)return!1;return!0},Jr=e=>{for(let t=0;t<e.length;t++){let n=e[t],r=t>0?e[t-1]:void 0;if(typeof n!=`number`||typeof r==`number`&&r>=n)return!1}return!0},Yr=e=>{for(let t=1;t<e.length;t++)ur(e[t]);if(e.length<2||qr(e))return $n(e);let t=[...e].sort(Jn),n=[t[0]];for(let e=1;e<t.length;e++)Jn(n[n.length-1],t[e])!==0&&n.push(t[e]);return $n(n)},Xr=e=>{if(Jr(e))return $n(e);let t=Gi(Yr,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},Zr=$n([]),Qr=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&Jn(r[a],t)<0;)a++;a<r.length&&Jn(r[a],t)===0||i.push(t)}return i.length===n.length?e:$n(i)},$r=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&Jn(r[a],t)<0;)a++;a<r.length&&Jn(r[a],t)===0&&i.push(t)}return i.length===n.length?e:$n(i)},ei=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=Jn(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=$n(i);if(e.hash!==0&&e.hash!==ya){let t=e.hash,n=0;for(;n<a.length;n++){let e=wa(a[n]);if(e===ya)break;t=t+_a(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Da(a[e])|0;c.fingerprint=t}return c},ti=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Jn(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Jn(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return tr(n,r)},ni=e=>{let t=ti(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:hn(t,e.map(e=>e[0]))},ri=[],ii=/* @__PURE__ */ new Map,ai=[],oi=/* @__PURE__ */ new WeakMap,si=e=>{let t=ri[e]??ii.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?ii.set(e,new WeakRef(n)):ri[e]=n,n},ci=e=>{if(Li(e),e.low===1&&e.high>=1)return si(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},li=e=>e.length>0&&(e===ri[e.length]||e===ii.get(e.length)?.deref())||oi.has(e),ui=e=>{let t=N(e).elements;return li(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},di=e=>{let t=ai[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return ai[e]=n,n},fi=e=>rr(tr(si(e.length),e),`tuple`),pi=e=>rr(ti(e),`record`),mi=(e,t)=>rr(tr(e,t),`record`),hi=e=>j(e)&&!Vn(e),gi=(e,t=!1)=>`UNION(${I(e.base,t)})`,_i=(e,t=e=>N(e).elements)=>{if(!hi(e.base))throw new _(`Attempted to enumerate the nonenumerable set:\n${gi(e)}`);return t(e.base)},vi=(e,t,n)=>{if(hi(e))return e;throw new _(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${I(e)}\nwhen enumerating:\n${gi(n)}`)},M=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return M(e.base);case`FunctionSet`:return M(e.domain)&&M(e.range)||yi(e.domain)===!0||yi(e)===!0;case`RecordSet`:return e.sets.every(M)||yi(e)===!0;case`ProductSet`:return e.factors.every(M)||yi(e)===!0;case`Union`:return M(e.base)&&(dn(e.base)?Ur(e.base):Ai(e.base)).every(M);case`SetOperation`:return e.operator===`\\cup`?M(e.left)&&M(e.right):e.operator===`\\cap`?M(e.left)||M(e.right):M(e.left);default:return!1}},yi=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=yi(e.domain);return t===void 0?void 0:!t&&yi(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=yi(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return M(e)?N(e).elements.length===0:void 0;default:return}},bi=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},xi=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},Si=e=>{if(typeof e!=`object`||e.kind!==`Subset`||Vn(e.base))return;let t=N(e.base).elements;if(t.length<=20)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:xi(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return $n(n.indices.map(e=>t[e]))},i=2**t.length,a=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<i;return new Proxy([],{get:(e,t,n)=>t===`length`?i:a(t)?r(Number(t)):Reflect.get(e,t,n),has:(e,t)=>a(t)||Reflect.has(e,t)})},Ci=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push($n(r.map(t=>e[t])));while(xi(r,e.length))}return t},wi=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(Vn(a))throw new _(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},Ti=(e,t=e=>N(e).elements)=>{if(typeof e!=`object`)throw new _(`Expected a set but found ${I(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return zr(e.elements);case`Interval`:{let t=ci(e);return t!==ri[t.length]&&oi.set(t,e),t}case`Subset`:{if(Li(e.base)===0)return Ci([]);if(!j(e.base))throw new _(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${A(I(e.base))}`);let t=N(e.base).elements;if(t.length>30)throw new _(Ii(e));return Ci(t)}case`FunctionSet`:{if(!jn.is174&&P(e))return[];if(Vn(e.domain))throw new _(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${I(e.domain)}\ncannot be enumerated.`);let n=ui(e.domain);if((n.length>0||jn.is174)&&Vn(e.range))throw new _(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${I(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return bi(n.map(()=>r)).map(e=>tr(n,e))}case`RecordSet`:{if(!jn.is174&&P(e))return[];let n=wi(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${I(t)}`);return bi(n).map(t=>pi(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!jn.is174&&P(e))return[];let n=wi(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${I(e)}`);return bi(n).map(fi)}case`FilteredSet`:if(!j(e.base)||Vn(e.base))throw new _(`Attempted to enumerate { x \\in S : p(x) } when S:\n${I(e.base)}\nis not enumerable`);return N(Xr(Ai(e.base).filter(t=>e.test(t,!1)))).elements;case`Union`:{let t=[];return _i(e).forEach((n,r)=>{let i=vi(n,r,e);if(on(i))throw new s(rn());Ai(i).forEach(e=>an(t,e))}),N(Xr(t)).elements}case`SetOperation`:{if(e.operator===`\\cap`&&!hi(e.left)&&!hi(e.right))throw new _(`Attempted to enumerate S \\cap T when neither S:\n${I(e.left)}\nnor T:\n${I(e.right)}\nis enumerable`);if(e.operator===`\\`&&!hi(e.left))throw new _(`Attempted to enumerate S \\ T when S:\n${I(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return N(Xr(Di(e))).elements;let t=e.operator===`\\`||hi(e.left),n=t?e.left:e.right,r=t?e.right:e.left,i=[];return sn(typeof n==`object`&&n.kind===`Interval`?n:Ai(n),t=>{qi(t,r)===(e.operator===`\\cap`)&&an(i,t)}),N(Xr(i)).elements}case`InfiniteSet`:case`SequenceSet`:throw new _(`Attempted to enumerate the non-enumerable set ${I(e)}`);default:throw new _(`Expected a set but found ${I(e)}`)}},N=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return $n(Ti(e));let t=typeof e==`object`&&Qt(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=Wi.sets;n?.push(e);let r=Ti(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?$n(r):Yr(r);return t&&(t.enumerated=i),i},Ei=e=>{if(!(typeof e!=`object`||or(e)))switch(e.kind){case`MixedSet`:N(e);return;case`FilteredSet`:return hi(e.base)||N(e),Ei(e.base);case`Union`:if(!dn(e.base)&&hi(e.base))return Ei(e.base);_i(e).slice(0,1).forEach(t=>Ei(vi(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!hi(e.left)&&N(e),e.operator!==`\\cup`||hi(e.left)&&hi(e.right)||N(e),e.operator!==`\\cap`||hi(e.left)?Ei(e.left):Ei(e.right),e.operator===`\\cup`&&Ei(e.right)}},Di=e=>{if(!hi(e.left)||!hi(e.right))throw new _(`Attempted to enumerate S \\cup T when S:\n${I(e.left)}\nand T:\n${I(e.right)}\nare not both enumerable`);if(Ei(e.left),Ei(e.right),on(e.left))throw new s(rn());let t=Ai(e.left),n=on(e.right)?void 0:Ai(e.right);if(!n||t.length+n.length>nn())throw new s(rn());return[...t,...n]},Oi=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return N(e).elements;let t=Br(e,()=>Di(e)),n=N(Xr(t)).elements;return e.enumerated=$n(n),n},ki=(e,t)=>{if(typeof e!=`object`||or(e))return N(e).elements.some(t);let n=Wi.sets;n?.push(e),Ei(e);let r=Pi(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},Ai=e=>{let t=[];return ki(e,e=>(t.push(e),!1)),t},ji=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,Mi=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(Mi);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(Mi)&&e.range.every(Mi);case`SetOperation`:return e.operator!==`\\cup`&&Mi(e.left)&&Mi(e.right);case`FilteredSet`:return Mi(e.base);case`ProductSet`:return e.factors.every(Mi);default:return!1}},Ni=e=>typeof e!=`object`||or(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?Ni(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||Ni(e.left)||Ni(e.right):ji(e)?.some(Ni)??!1,Pi=(e,t)=>{if(e.kind===`Union`)return _i(e,Ai).some((n,r)=>ki(vi(n,r,e),t));if(e.kind===`FilteredSet`&&hi(e.base))return ki(e.base,n=>e.test(n,!1)&&t(n));if(ji(e)?.some(Ni))return Ti(e,Ai).some(t);if(e.kind!==`SetOperation`)return N(e).elements.some(t);if(e.operator===`\\cup`)return!hi(e.left)||!hi(e.right)?N(e).elements.some(t):ki(e.left,t)||ki(e.right,t);let n=e.operator===`\\`||hi(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return hi(r)?ki(r,n=>qi(n,i)===(e.operator===`\\cap`)&&t(n)):N(e).elements.some(t)},P=e=>{if(typeof e!=`object`||!j(e))throw new _(`Shouldn't call isEmpty() on value ${I(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new _(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(P);case`RecordSet`:return e.sets.some(P);case`FunctionSet`:return!P(e.domain)&&P(e.range);case`Union`:return _i(e).every((t,n)=>P(vi(t,n,e)));default:return N(e).elements.length===0}},Fi=(e,t,n)=>e.reduce((e,r)=>{let i=e*Li(r,t);if(i>2147483647)throw new _(n());return i},1),Ii=e=>`Overflow when computing the number of elements in:\n${I(e)}`,Li=(e,t)=>{if(typeof e!=`object`)throw new _(`Attempted to compute the number of elements in the ${fn(e)} ${I(e)}.`);switch(e.kind){case`ModelValue`:throw new _(`Attempted to compute the number of elements in the model value ${I(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return Li(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new _(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new _(`Attempted to compute the number of elements in the overridden value ${I(e)}.`);case`Subset`:{let n=Li(e.base,t);if(n>=31)throw new _(Ii(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(P(e.domain))return 1;if(P(e.range))return 0;if(Li(e.range,t)===1)return 1}let n=Li(e.domain,t),r=Li(e.range,t);if(r<=1)return n===0?1:r;let i={value:1};for(let t=0;t<n;t++)if(i.value*=r,i.value>2147483647)throw new _(Ii(e));return i.value}case`RecordSet`:return t!==`1.7.4`&&P(e)?0:Fi(e.sets,t,()=>Ii(e));case`ProductSet`:return t!==`1.7.4`&&P(e)?0:Fi(e.factors,t,()=>`Overflow when computing the number of elements in ${I(e)}`);default:return ur(e),N(e).elements.length}},Ri=e=>`Attempted to check if the set ${I(e)}is finite.`,zi=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new _(`Attempted to check if the ${fn(e)} ${I(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new _(`Attempted to check if the function:\n${I(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return zi(e.base)&&P(e.base);case`Subset`:return zi(e.base);case`FunctionSet`:{let t=zi(e.domain);if(t&&P(e.domain))return!0;let n=zi(e.range);return n&&P(e.range)?!0:n&&(t||Li(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n={isAllFinite:!0};for(let e of t)if(!zi(e))n.isAllFinite=!1;else if(P(e))return!0;return n.isAllFinite}case`Union`:if(!hi(e.base))throw new _(`Attempted to check if the nonenumerable set:\n${gi(e)}\nis a finite set.`);return N(e.base).elements.every(zi);case`SetOperation`:if(e.operator===`\\cup`)return zi(e.left)&&zi(e.right);if(e.operator===`\\cap`){if(!zi(e.left)&&!zi(e.right))throw new _(Ri(e));return!0}if(zi(e.left))return!0;if(!zi(e.right))throw new _(Ri(e));return!1;case`FilteredSet`:if(!zi(e.base))throw new _(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${I(e.base)}\nis finite.`);return!0}},Bi=(e,t,n=Jn)=>{let r={low:0,high:e.length-1};for(;r.low<=r.high;){let i=r.low+r.high>>1,a=n(e[i],t);if(a===0)return i;a<0?r.low=i+1:r.high=i-1}return-1},Vi=(e,t)=>{let n=e.elements;if(n.length>nn())throw new s(rn());let r=Array.from({length:n.length},()=>!1),i=t.filter(e=>{let t=Bi(n,e);return!r[t]&&(r[t]=!0,!0)}),a=$n(n);return i.some((e,t)=>e!==n[t])&&(a.writtenElements=i),a},Hi=e=>{if(typeof e!=`object`||!ln(e))return;if(e.kind===`LazyFunction`&&(!j(e.domain)||Vn(e.domain)))throw new _(`To convert a function of form [x \\in S |-> f(x)] to a tuple, the set S must be enumerable.`);let t=F(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Ui=(e,t)=>{let n=`Attempted to check if the value:\n${I(e)}\nis an element of the`;if(!ln(t))return`${n} ${fn(t)} ${I(t)}`;let r=ir(t);return r===`record`?`Attempted to check if element:\n${I(e)}\nis in the record:\n${I(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${I(t)}`},Wi={sets:void 0},Gi=(e,t,n,r)=>{let i=Wi.sets,a=Wi.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof _))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},Ki=e=>(Wi.sets??[]).slice(e).some(e=>typeof e==`object`&&Wi.callStack?.sources.has(e)===!0),qi=(e,t)=>{let n=Wi.sets;if(n===void 0)return Qi(e,t);n.push(t);let r=Qi(e,t);return n.pop(),r},Ji=(e,t)=>{let n=t.elements,r={low:0,high:n.length-1};for(;r.low<=r.high;){let t=r.low+r.high>>1,i=n[t];if(typeof i!=`number`)return;if(i===e)return!0;i<e?r.low=t+1:r.high=t-1}return!1},Yi=(e,t)=>Bi(t.elements,e)!==-1,Xi=(e,t)=>t.isNormalized?Vr(e,t.elements).isFound:Hr(e,Ur(t)),Zi=(e,t)=>{if(e.type!==void 0)throw new _(`Attempted to check if the typed model value ${A(I(e))} is an element of\n${A(I(t))}`);return!1},Qi=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return Ji(e,t)??$i(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return $i(e,t)},$i=(e,t)=>{if(!j(t))throw new _(Ui(e,t));switch(t.kind){case`Set`:return ur(e),Gi(Yi,Xi,e,t);case`MixedSet`:return Hr(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&(!un(e)||e.type!==void 0))throw new _(`Attempted to check if the value:\n${I(e)}\nis in the integer interval ${I(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(un(e))return Zi(e,t);if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new c(`Attempted to check if the value:\n${I(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!j(e)||Vn(e))throw new _(`Attempted to check if the non-enumerable value\n${A(I(e))}\nis element of\n${A(I(t))}`);return N(e).elements.every(e=>qi(e,t.base));case`FunctionSet`:{if(!ln(e)){if(un(e))return Zi(e,t);throw new _(`Attempted to check if \n${I(e)}\nwhich is not a TLC function value, is in the set of functions:\n${A(I(t))}`)}let n=F(e),r=vr(e,n.domain);return(r===void 0?Kr(t.domain,$n(n.domain)):Kr({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>qi(e,t.range))}case`RecordSet`:{let n=ln(e)?F(e):void 0;if(!n||!xn(n.domain)){if(un(e))return Zi(e,t);throw new _(`Attempted to check if non-record\n${I(e)}\nis in the set of records:\n${I(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=Bi(n.domain,e);return i!==-1&&qi(n.range[i],t.sets[r])})}case`ProductSet`:{let n=ln(e)?Hi(e):void 0;if(n===void 0){let n=ln(e)&&F(e).domain.every(e=>typeof e==`number`);if(un(e))return Zi(e,t);if(n)return!1;throw new _(`Attempted to check if non-tuple\n${I(e)}\nis in the set of tuples:\n${I(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>qi(e,t.factors[n]))}case`FilteredSet`:try{return qi(e,t.base)&&t.test(e,!0)}catch(n){throw!(n instanceof _)||!Nt(n)?n:new _(`Cannot decide if element:\n${A(I(e))}\n is element of:\n${A(I(t.base))}\nand satisfies the predicate ${t.source?.predicate}`)}case`Union`:{if(!hi(t.base))throw new _(`Attempted to check if:\n ${I(e)}\nis an element of the non-enumerable set:\n ${gi(t)}`);let n=N(t.base).elements;return n.length>1&&n.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),n.some(t=>qi(e,t))}case`SetOperation`:return t.operator===`\\cup`?qi(e,t.left)||qi(e,t.right):qi(e,t.left)&&qi(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Hi(e);if(n===void 0){if(un(e))return Zi(e,t);throw new c(`Attempted to check if the value:\n${A(I(e))}\nis an element of ${A(I(t))}.`)}return n.every(e=>qi(e,t.base))}default:throw new _(Ui(e,t))}},ea=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?qi(e,n):e.range.every((e,r)=>ea(e,t.range[r],n.range)),F=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return e.enumerated;if(M(e.domain)||Li(e.domain),!j(e.domain))throw new _(`The domains of formal parameters must be enumerable.`);let t=ui(e.domain);return e.enumerated=rr(tr(t,t.map(t=>e.apply(t))),ir(e)),e.enumerated}throw new _(`Expected a function but found ${I(e)}`)},ta=(e,t,n)=>{let r=A(I(e)),i=A(I(t)),a=n===`1.7.4`;switch(ir(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},na=(e,t)=>{if(!jn.is174)return ta(e,t);let n=A(I(t));return ir(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},ra=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},ia=e=>new _(`Attempted to apply function with integer domain to the non-integer argument ${A(I(e))}`),aa=(e,t)=>Bi(e.domain,t),oa=(e,t,n)=>{let r=gn(e);throw jn.is174||r!==e.domain||r.length<32?r.forEach(e=>Rr(e,t)):Bi(r,t,Nr),n},sa=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=ir(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new _(n(e,t));if(a===void 0&&!jn.is174&&typeof t!=`number`&&li(r))throw ia(t)}let i=ra(r,t);return i===-1?Gi(aa,oa,e,t):i},ca=(e,t,n)=>{let r=e.domain,i=Hi(n),a=(t,n,r)=>`In applying the function\n${A(I(e))},\nthe ${t} is:\n${A(I(n))}\nwhich ${r}.\n`,o=()=>new _(a(`argument list`,n,`does not match its formal parameter`));if(i===void 0)throw o();if(typeof r!=`object`||r.kind!==`ProductSet`)throw new _(`Attempted to apply a function to ${I(n)}, which is not in its domain`);if(t.forEach((e,t)=>{if(t>=i.length)throw o();let n=i[t],s=`argument number ${t+1}`;if(!qi(n,r.factors[t]))throw new _(a(s,n,e===void 0?`is not in the function's domain ${I(r)}`:`is not in its domain`));if(e!==void 0&&Hi(n)?.length!==e)throw new _(a(s,n,`does not match its formal parameter`))}),i.length>t.length)throw o()},la=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!qi(t,e.lambdaDomain),ua=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return ua(e.enumerated,t,n);let r=e.boundTupleLengths;if(r!==void 0)return ca(e,r,t),e.apply(t);if(!qi(t,e.domain))throw new _(ir(e)===`lambda`?ta(e,t):`Attempted to apply a function to ${I(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new _(`Attempted to apply ${I(e)}, which is not a function`);let r=n??ta;if(la(e,t))throw new _(r(e,t));let i=sa(e,t,r);if(i===-1)throw new _(r(e,t));return e.range[i]},da=e=>li(e)?oi.get(e)??di(e.length):void 0,fa=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=F(e);if(t.functionClass===`lambda`&&t.lambdaDomain)return t.lambdaDomain;let n=da(t.domain);if(n)return n;let r=$n(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},pa=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||e.enumerated===void 0)){if(!qi(t,e.domain))return e;let r=n(e.apply(t));return rr({kind:`LazyFunction`,domain:e.domain,apply:n=>Kr(t,n)?r:e.apply(n),source:e.source,boundTupleLengths:e.boundTupleLengths},ir(e))}if(!ln(e))throw new _(`Attempted to apply EXCEPT construct to the value ${A(I(e))}.`);let i=F(e);if(la(i,t))return i;let a=sa(i,t,na);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=rr(tr(i.domain,o),ir(i));if(l.writtenKeys=i.writtenKeys,l.lambdaDomain=i.lambdaDomain,i.hash!==0&&i.hash!==ya){let e=wa(c);if(e!==ya){let t=wa(i.domain[a]);l.hash=s===c?i.hash:i.hash-va(t,wa(s))+va(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Oa(e,s)+Oa(e,c)|0}return l},ma=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},ha=(e,t)=>Math.imul(e^t,16777619),ga=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return ma(t)},_a=e=>ma(e+2654435769|0),va=(e,t)=>ma(Math.imul(e,668265261)+t|0),ya=795548749,ba=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=wa(t[e]);if(r===ya)return ya;n=n+_a(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=wa(e.domain[n]),i=wa(e.range[n]);if(r===ya||i===ya)return ya;t=t+va(r,i)|0}return t},xa=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new _(`TLC has found a state in which the value of a variable contains ${I(e)}`);if(j(e)){N(e).elements.forEach(xa);return}let t=F(e);t.domain.forEach(xa),t.range.forEach(xa)},Sa=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{wa(e)===ya&&xa(e);return}catch(e){if(!(e instanceof _))throw e;return e}},Ca=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},wa=e=>typeof e==`number`?ma(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?ga(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=ba(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?M(e.domain)?wa(F(e)):ya:M(e)?wa(N(e)):ya,Ta=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Ea=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Ta(t)},Da=e=>Ta(Aa(e)+2135587861|0),Oa=(e,t)=>Ta(Math.imul(Aa(e),374761393)+Aa(t)|0),ka=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Da(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Oa(e.domain[n],e.range[n])|0;return t},Aa=e=>typeof e==`number`?Ta(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?Ea(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=ka(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?Aa(F(e)):M(e)?Aa(N(e)):Ea(ja(e)),ja=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):Ma(e),Ma=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${ja(e.base)}>`;if(e.kind===`FilteredSet`&&!M(e))throw new _(`Attempted to compare the non-enumerable set ${I(e)} with another value`);if(j(e))return M(e)?`{${N(e).elements.map(ja).join(`,`)}}`:`<${e.kind} ${I(e)}>`;let t=F(e);return`(${t.domain.map((e,n)=>`${ja(e)}:${ja(t.range[n])}`).join(`,`)})`},Na={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},Pa=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>Na[e])}"`,Fa=1999,Ia=e=>e.reduce((e,t)=>e===0?0:e*Li(t),1),La=e=>{if(e.kind===`Subset`)return Li(e.base)<=6?N(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return N(e);if(e.kind===`FunctionSet`){let t=P(e.domain)?0:Li(e.domain);return(t===0?1:Li(e.range)**t)<=Fa?N(e):void 0}return Ia(e.kind===`RecordSet`?e.sets:e.factors)<=Fa?N(e):void 0},Ra=(e,t)=>{if(t||e.kind===`Union`||e.kind===`Subset`&&ln(e.base)&&(e.base.kind===`Function`||M(e.base.domain)))return La(e);if(M(e))try{return La(e)}catch(e){if(e instanceof _)return;throw e}},za=(e,t)=>{let n=e=>I(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return gi(e,t)}},Ba=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Va=e=>{if(M(e.domain))try{return F(e)}catch(e){if(e instanceof _||ne(e))return;throw e}},Ha=e=>{let t=[],n=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:if(e.elements.forEach(n),e.isNormalized)return;e.isNormalized=!0,t.push(e);return;case`MixedSet`:e.elements.forEach(n),N(e);return;case`Function`:e.range.forEach(n);return;case`LazyFunction`:n(e.enumerated??e.domain);return;case`SetOperation`:n(e.left),n(e.right);return;case`FunctionSet`:n(e.domain),n(e.range);return;case`RecordSet`:e.sets.forEach(n);return;case`ProductSet`:e.factors.forEach(n);return;case`Subset`:case`Union`:case`FilteredSet`:case`SequenceSet`:n(e.base);return;default:return}};try{return e.forEach(n),e.map(e=>I(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1})}},I=(e,t=!1,n=!1)=>{let r=e=>I(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Pa(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(N(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=Mn.isExpanded?Ra(e,t):void 0;return n?r(n):za(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?Mn.isExpanded||!e.source?Va(e):void 0:e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${I(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&jn.is174&&ir(e)!==`tuple`)return`<< >>`;let a=r=>I(r,t,n&&ir(e)!==`lambda`);if(i.domain.length===0&&ir(e)===`record`)return`[]`;if(i.domain.every((e,t)=>e===t+1))return`<<${i.range.map(a).join(`, `)}>>`;let o=n?i.domain.map((e,t)=>[e,i.range[t]]):vn(i);return ir(e)===`record`||i.domain.every(e=>typeof e==`string`&&Ba(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},Ua=(e,t)=>{if(e===void 0)return!1;try{return fr(e,t)}catch(e){if(e instanceof _)return!1;throw e}},Wa=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,Ga=e=>Array.from({length:e.length},(t,n)=>e.charCodeAt(n)).reduce((e,t)=>Math.imul(e,31)+t|0,0),Ka=(e,t)=>{let n={next:0,last:-1},r={value:!0},i=e.replace(Wa,(e,i,a=``,o,s,c=``)=>{let l=e=>a.includes(`-`)?e.padEnd(Number(o)):e.padStart(Number(o??0)),u=a.includes(`<`),d=a.replace(`<`,``);if(c===`n`&&e===`%n`)return`
|
|
74
|
+
`;if(c===`%`&&s===void 0&&/^-?$/.test(d))return d===`-`&&o===void 0&&(r.value=!1),l(`%`);let f=u?n.last:i===void 0?n.next++:Number(i.slice(0,-1))-1;n.last=f;let p=t[f];if(!`sSbBhH`.includes(c)||c===``||!/^-?$/.test(d)||d===`-`&&o===void 0||p===void 0)return r.value=!1,e;let m=c.toLowerCase(),h=m===`s`?p:m===`b`?`true`:(Ga(p)>>>0).toString(16),ee=l(s===void 0?h:h.slice(0,Number(s.slice(1))));return c===m?ee:ee.toUpperCase()});return r.value?i:void 0},qa=(e,t)=>{let n=t?void 0:Pn.get(e);if(n)return n();let r=Object.entries(e),i=In.get(e),a=i!==void 0&&`_format`in e,o=a?e._format:r.length===1?`%s = %s
|
|
75
75
|
`:`/\\ %s = %s
|
|
76
|
-
`;if(typeof o!=`string`)throw new b(`The _format field of the ALIAS ${i} is ${L(o)}, but it must be a string.`);return r.filter(([e])=>!(a&&e===`_format`)).filter(([e,n])=>!t||!Ha(t[e],n)).map(([e,t])=>{let n=Ga(o,[e,j(L(t))]);if(n===void 0)throw new b(`The _format field of the ALIAS ${i} is ${L(o)}, but it must format two strings, the name and the value of a field.`);return n}).join(``)},qa=[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 Ja=qa[0];const Ya=()=>Ja,Xa=/* @__PURE__ */ new Int32Array(256),Za=/* @__PURE__ */ new Int32Array(256),Qa=/* @__PURE__ */ new Int32Array(256),$a=/* @__PURE__ */ new Int32Array(256),eo=/* @__PURE__ */ new Int32Array(256),to=/* @__PURE__ */ new Int32Array(256),no=/* @__PURE__ */ new Int32Array(256),ro=/* @__PURE__ */ new Int32Array(256);let io=0,ao=0,oo=0,so=0;const co=e=>{let t=(e^so)&255;so=(so>>>8|oo<<24)^eo[t],oo=oo>>>8^Xa[t]},lo=e=>{let t=qa[e];Ja=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);Xa[e]=Number(BigInt.asIntN(32,t>>32n)),eo[e]=Number(BigInt.asIntN(32,t))}let i=[Xa,Za,Qa,$a],a=[eo,to,no,ro];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)^eo[o],i[e][r]=t[r]>>>8^Xa[o]}}io=Number(BigInt.asIntN(32,t>>32n)),ao=Number(BigInt.asIntN(32,t))};lo(0);const uo=e=>{let t=so^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;so=oo^ro[n]^no[r]^to[i]^eo[a],oo=$a[n]^Qa[r]^Za[i]^Xa[a]},fo=e=>{if(typeof e==`boolean`)return co(0),co(e?116:102),2;if(typeof e==`number`)return co(1),uo(e),5;if(typeof e==`string`){co(3),uo(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)uo(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)co(e.charCodeAt(n));return 5+e.length}return co(21),uo(Rn(e.name)+1),5},po=e=>{if(typeof e!=`object`||ln(e))fo(e);else if(cn(e)){let t=I(e);co(9),uo(t.domain.length);for(let e=0;e<t.domain.length;e++)po(t.domain[e]),po(t.range[e])}else{let t=P(e).elements;co(5),uo(t.length);for(let e of t)po(e)}},mo=e=>{let t=oo,n=so;oo=io,so=ao;for(let t of e)po(t);let r=BigInt(oo>>>0)<<32n|BigInt(so>>>0);return oo=t,so=n,r},ho=(e,t)=>{let n=new BigInt64Array(e.length),r=new Int32Array(n.buffer),i=oo,a=so;return e.forEach((e,n)=>{oo=io,so=ao;for(let n of t)po(e[n]);r[2*n]=so,r[2*n+1]=oo}),oo=i,so=a,n},go=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),_o=1024,vo=e=>({current:-1,expressions:[],ranges:[],firstChild:[],lastChild:[],nextSibling:[],prefixes:[],isPart:[],isPrimed:[],isUnchanged:[],recursive:[],lets:[],roots:[],primary:[],secondary:[],covered:/* @__PURE__ */ new WeakSet,values:/* @__PURE__ */ new WeakMap,registers:new Uint8Array(e*_o),relations:[]}),yo=(e,t,n,r,i)=>{let a=e.expressions.length;if(e.expressions.push(t),e.ranges.push(n),e.firstChild.push(-1),e.lastChild.push(-1),e.nextSibling.push(-1),e.prefixes.push(-1),e.isPart.push(i),e.isPrimed.push(!1),e.isUnchanged.push(t?.kind===`Unchanged`),e.recursive.push(-1),e.lets.push(void 0),e.roots.push(r===-1?a:e.roots[r]),e.primary.push(0),e.secondary.push(0),t&&e.covered.add(t),r===-1)return a;let o=e.lastChild[r];return o===-1&&(e.firstChild[r]=a),o!==-1&&(e.nextSibling[o]=a),e.lastChild[r]=a,a},bo=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,xo=(e,t,n,r,i)=>{let a=t===`next`?bo(e,t,r):void 0;if(a!==void 0)return a;let o=yo(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},So=(e,t)=>e!==void 0&&t!==void 0&&e.module===t.module&&e.start.line===t.start.line&&e.start.column===t.start.column&&e.end.line===t.end.line&&e.end.column===t.end.column,Co=(e,t,n)=>{let r=e===void 0?void 0:n.definitions.get(e),i=r?.kind===`Operator`?r.head:void 0,a=t.location.range;return!r||!i?`Action ${a?h(a):`Unknown location`}`:So(r.body.location.range,a)||!a?`${r.name} ${h(i)}`:`${r.name} ${h(i)} (${a.start.line} ${a.start.column} ${a.end.line} ${a.end.column})`},wo=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,To=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,Eo=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},Do=e=>Array.from({length:e.length},(t,n)=>e.charCodeAt(n)).reduce((e,t)=>Math.imul(e,31)+t|0,0)&2147483647,Oo=e=>{let t=Array.from({length:11},()=>[]);return e.forEach((e,n)=>{if(n>=Math.floor(t.length*.75)){let e=Array.from({length:t.length*2+1},()=>[]);for(let n=t.length-1;n>=0;n--)t[n].forEach(t=>e[Do(t.name)%e.length].unshift(t));t=e}t[Do(e.name)%t.length].unshift(e)}),t.toReversed().flat()},ko=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),Ao=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),jo=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),Mo=(e,t,n)=>{let r=new Set(n.map(wo)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(A(e)){for(let e=r;e;e=e.parent)if(e.name===n)return e.definition&&{definition:e.definition,scope:e.scope};return}let i=t.substitutions.get(n)??n;if(t.variableIndex.has(i)||t.constants.has(i))return;let a=t.definitions.get(i),o=a?.location.range?.module??a?.body.location.range?.module;return a&&!go.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=yo(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(wo(n));let d=t&&s.get(t);if(d&&i.forEach(t=>{e.expressions[t]===d&&(e.lets[t]??=[]).push(u)}),l?.kind===`Operator`&&l.isRecursive){let t=i.findLast(e=>a[e]===l);t!==void 0&&(e.recursive[u]=t)}return a[u]=l,i.push(u),o(),i.pop(),u},u=e=>{let t=e.definition;if(o.includes(t))return;o.push(t);let n=t.kind===`Function`?jo(t.bounds):t.params.map(e=>e.name);m(t.body,Ao(n,e.scope)),t.kind===`Function`&&ko(t.bounds).forEach(t=>m(t,e.scope)),o.pop()},d=e=>e?.definition.kind===`Operator`&&e.definition.params.length>0,f=(e,t,n,r)=>{if(e.kind===`Lambda`)m(e.body,Ao(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:m(e.body,Ao(e.params,t));return;case`Lambda`:m(e.body,Ao(e.params,t));return;case`Let`:{let n=e.definitions.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),Oo(e.definitions).forEach(e=>u({definition:e,scope:n})),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,To(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,Eo(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,To(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,Ao(jo(e.bounds),t)),r(ko(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,Ao(jo(e.bounds),t)),r(ko(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,Ao(jo([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,Ao(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,Ao(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}};e.relations.forEach(e=>{i.push(e.node),m(e.expression,void 0),i.pop()})},No=(e,t,n)=>{for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r]){if(e.expressions[r]===n)return r;if(e.isPart[r]){let t=No(e,r,n);if(t!==-1)return t}}return-1},Po=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=No(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:No(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},Fo=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},Io=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},Lo=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},Ro=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},zo=(e,t)=>t.forEach((t,n)=>{let r=mo([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*_o+i;e.registers[o]=Math.max(e.registers[o],Ro(a)+1)}),Bo=(e,t)=>{let n=e.registers.subarray(t*_o,(t+1)*_o),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*_o*_o/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*_o?a===0?i:_o*Math.log(_o/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},Vo=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},Ho=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>Vo(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},Uo=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},Wo=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],Go=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},Ko=(e,t)=>{let n=e.primary[t.node],r=e.secondary[t.node];return t.kind===`init`?{distinct:n,generated:n+r}:t.kind===`next`?{distinct:r,generated:n}:t.kind===`constraint`?{distinct:r,generated:n+r}:{distinct:0,generated:0}},qo=(e,t)=>{let n=[],r=/* @__PURE__ */ new Map,i=t=>{let n=[],a={primary:e.primary[t],secondary:e.secondary[t]};return(a.primary>0||a.secondary>0||Wo(e,t))&&Uo(n,a),Go(e,t).forEach(e=>i(e).forEach(e=>Uo(n,e))),r.set(t,n),n},a=(t,r,i,a)=>{let o=e.ranges[t];n.push({location:o?h(o):`Unknown location`,depth:r,count:i,cost:a})},o=(t,n)=>a(t,n,e.primary[t],e.secondary[t]),s=(t,n)=>{let c=Go(e,t),l=[];c.forEach(e=>(r.get(e)??i(e)).forEach(e=>Uo(l,e)));let u={primary:e.primary[t],secondary:e.secondary[t]},d=Wo(e,t),f=e=>c.forEach(t=>s(t,e));if(e.isUnchanged[t]){let e=l.filter(e=>e.primary!==0||e.secondary!==0);e.length===0?o(t,n):a(t,n,Math.max(u.primary,Ho(e).primary),0);return}if(l.length===0){(u.primary!==0||d)&&o(t,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let e=l[0],r=e.primary===0&&e.secondary===0;if(e.primary<u.primary){o(t,n),f(n+1);return}if(!d&&p&&!r){a(t,n,e.primary,e.secondary);return}if(p&&r){d&&o(t,n),f(d?n+1:n);return}if(u.primary===e.primary&&u.secondary===e.secondary){o(t,n);return}}let m=!p||d;m&&o(t,n),f(m?n+1:n)};return Go(e,t).forEach(e=>{i(e),s(e,0)}),n},Jo=[`init`,`next`,`invariant`,`constraint`,`implied`],Yo=(e,t)=>!e||!t?e?1:t?-1:0:e.module===t.module?e.start.line-t.start.line||e.start.column-t.start.column||e.end.line-t.end.line||e.end.column-t.end.column:e.module<t.module?-1:1,Xo=e=>Jo.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>Yo(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||Yo(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),Zo=(e,t,n,r)=>({variables:r.map(r=>{let i=n[r]?.range;return{label:`${t.variables[r]} ${i?h(i):`Unknown location`}`,distinct:Bo(e,r)}}),relations:Xo(e).map(t=>({kind:t.kind,label:t.label,...Ko(e,t),expressions:qo(e,t.node)}))}),Qo=(e,t,n)=>{let r=bo(e,t,n);if(r===void 0)return;let i=e.primary[r],a=e.secondary[r];if(t===`init`)return[[`generated`,i+a],[`distinct`,i]];if(t===`next`)return[[`generated`,i],[`distinct`,a]];let o=e.firstChild[r];return[[`count`,o===-1?i:e.primary[o]]]},$o=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),es=(e,t)=>$o.has(e)?new v(t):new c(t),ts=(e,t,n,r)=>new c(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${L(r)}`),ns=(e,t,n=e)=>{if(!M(e)||Bn(e))throw new c(`Applying ${t} to the following value,\nwhich is not a finite set:\n${L(n)}`);return P(e)},rs=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||rs(r))throw es(n,`${n} expects a value as argument ${t+1}`);return r},is=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw es(n,`${n} expects a boolean but received ${L(r)}`);return r},as=(e,t,n)=>{let r=e[t];if(r===void 0||!rs(r))throw es(n,`${n} expects an operator as argument ${t+1}`);return r},os=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),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}),ss=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),cs=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),ls=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),us=e=>e>2147483647||e<-2147483648,ds=e=>new c(`Overflow when computing ${e}`),fs={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},ps={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},ms={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},hs={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},gs=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return ps[e.operator];if(e.kind!==`Function`)return fs[e.kind];let t=rr(e);return t===void 0?`FcnRcdValue`:hs[t]},_s=e=>ms[gs(e)],vs=(e,t)=>`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`,ys=(e,t)=>new v(vs(e,t)),bs=(e,t)=>{let n=n=>(...r)=>{let i=Ui.sets?.length??0;try{return n(...r)}catch(n){if(!(n instanceof v)||n instanceof oe)throw n;let r=Gi(i);throw Ui.sets&&(Ui.sets.length=i),e.isLazy!==!0&&n instanceof c&&!r?n:e.isLazy!==!0&&n instanceof ne?new c(vs(t,n.message)):ys(t,n.message)}},r=n(e.evaluate);return{...e,evaluate:(n,i)=>{if(n.length!==e.arity)throw ys(t,`array is not of length ${e.arity}`);return r(n,i)},evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},xs=(e,t)=>{if(typeof e!=`number`)throw ys(t,`Cannot cast tlc2.value.impl.${gs(e)} to tlc2.value.impl.IntValue`);return e},Ss=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Cs=(e,t,n,r)=>{let i=Ss(e,n,`IntValue`,2);return ls(t,(e,n)=>{let a=xs(n,i),o=xs(e,i),s=r(o,a);if(us(s))throw ds(`${o}${t}${a}`);return s})},ws=(e,t,n)=>{if(typeof e!=`number`)throw new c(`The ${t} argument of ${n} should be an integer, but instead it is:\n${L(e)}`);return e},Ts=(e,t,n=e)=>ls(e,(e,r)=>t(ws(e,`first`,n),ws(r,`second`,n))),Es=(e,t,n)=>({...cs(e,t,n),isLazy:!0}),Ds=(e,t,n)=>{let r=as(e,t,n);return()=>r.call([])},Os=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),ks=()=>({implication:tg,negate:ng,equivalent:rg,body:ig,condition:(e,t)=>{if(typeof e!=`boolean`)throw Rh(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw zh(t,n,e);return e},apply:la,expectFunction:Zh,tuple:di,set:Yr,record:pi,writtenRecord:vn,equal:dr,enumerate:dg,choiceElements:I_,noChoice:e=>{throw L_(e)},filterPredicate:F_,isReducible:sn,finiteElements:e=>P(e).elements,addBounded:rn,normalizedSet:$n,isBeyondBound:an,cardinality:Ii,functionDomain:li,sortedFunction:er,unassigned:(e,t)=>{throw Kh(e,t)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:Qh,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 As,js;const Ms=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Ns=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Ps=e=>`local${e.counter++}`,Fs=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),ht(e).forEach(e=>Fs(e,t)),t),Is=(e,t,n)=>{let r=Fs(t),i=[...n.locals].filter(([e])=>r.has(e));if(i.length===0)return n.context;let a=Ns(e,i.map(([e])=>e));return`extend(${n.context}, ${a}, [${i.map(([,e])=>e).join(`, `)}])`},Ls=(e,t,n)=>`${Ns(e,U(t,e.environment))}(${Is(e,t,n)})`,Rs=(e,t,n)=>{let r=`helper${e.counter++}`,i=[...t.locals.values()],a={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(t.locals)},o=i.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${r}(context, state, next${o}) { let primed; let applied; ${n(a)} }`),`${r}(${t.context}, ${t.state}, ${t.isPrimed?`undefined`:t.next}${o})`},zs=(e,t,n,r)=>{let i=Ps(e),a=Ps(e),o=Ps(e);return`for (let ${i} = 0, ${a} = ${t}.low, ${o} = ${a} === undefined ? ${t}.length : ${t}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${t}[${i}] : ${a} + ${i}; ${r} }`},Bs=(e,t,n)=>{let r=t.kind===`Forall`;return Rs(e,n,n=>{let i=t.bounds.map(()=>Ps(e)),a=t.bounds.map((r,a)=>a>0&&t.bounds[a-1].set===r.set?`const ${i[a]} = ${i[a-1]};`:`const ${i[a]} = enumerate(${qs(e,r.set,n)}, ${Ns(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=Ps(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${qs(e,t.body,n)}, ${Ns(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>zs(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},Vs=(e,t,n,r,i)=>Rs(e,i,i=>{let a=Ps(e),o=Ps(e),s=Ns(e,t),c=`choiceElements(${qs(e,n,i)}, ${s}, ${Ns(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${qs(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${zs(e,a,o,l)} return noChoice(${s});`}),Hs=(e,t,n,r)=>Rs(e,r,r=>{let i=Ps(e),a=Ps(e),o=Ps(e),s=Ps(e),c=Ns(e,t),l=`if (!isReducible(${i})) return ${Ns(e,P_(t,e.environment))}(${i}, ${Is(e,t,r)});`,u=qs(e,t.bound.set,r);r.locals.set(n,s);let d=`if (filterPredicate(${qs(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${zs(e,a,s,d)} return normalizedSet(${o});`}),Us=(e,t,n,r)=>Rs(e,r,r=>{let i=Ps(e),a=Ps(e),o=Ps(e),s=Ps(e),c=Ps(e),l=Ps(e),u=Ns(e,j_(t,e.environment)),d=Is(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=qs(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${qs(e,t.body,r)}; if (!${a}) ${s}.push(${l});`;return`const ${i} = ${p}; ${f} const ${a} = isBeyondBound(${i}); const ${o} = ${a} ? ${i} : functionDomain(${i}); if (${a}) cardinality(${i}); const ${s} = []; ${zs(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),Ws=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=qs(e,r[0],n),a=qs(e,r[1],n),o=Ns(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${qs(e,r[0],n)}, ${Ns(e,t)})`;if(t.operator===`<=>`)return`equivalent(${qs(e,r[0],n)}, ${qs(e,r[1],n)}, ${Ns(e,t)})`;if(A(t))return Ls(e,t,n);let i=Rg(t.operator,e.environment);if(i?.kind!==`Builtin`)return Ls(e,t,n);if(i.name===`DOMAIN`)return`${Ns(e,Hh(t))}(${qs(e,r[0],n)})`;if(i.name===`TLCEval`)return Ls(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Ns(e,Uh(t,i))}(${qs(e,r[0],n)}, ${qs(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&__(r[0],a))return`${Ns(e,i.evaluateUnary)}(${qs(e,r[0],n)})`;let o=r.length===2&&__(r[0],a)&&__(r[1],a);return i.evaluateBinary&&o?`${Ns(e,i.evaluateBinary)}(${qs(e,r[0],n)}, ${qs(e,r[1],n)})`:Ls(e,t,n)},Gs=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(A(e))return!1;let r=Yg(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Gs(e.expression,t,n);case`FieldAccess`:return Gs(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Gs(e,t,n));default:return!1}},Ks=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Ks(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Ks);default:return!1}},qs=(e,t,n)=>{let r=(t,r=n)=>qs(e,t,r);switch(t.kind){case`Number`:return fn(t.value)?String(t.value):Ls(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(A(t))return Ls(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):Ls(e,t,n)}case`Apply`:return Ws(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=Ns(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${Ns(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{E_(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Gs(t.function,n,e.environment)?r(t.function):Ks(t.function)?r(t.function,i):Ls(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Ns(e,t)}))`,o=Vh(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,Bh(t))}(${r(t.record)})`;case`Record`:{let i=z_(t.fields);if(B_(i))return Ls(e,t,n);let a=Ns(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${Ns(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:return n.isPrimed?Ls(e,t,n):r(t.expression,{context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals});case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?Bs(e,t,n):Ls(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?Vs(e,t,t.set,t.pattern.name,n):Ls(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!A_(t)?Us(e,t,r.pattern.name,n):Ls(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?Hs(e,t,t.bound.pattern.name,n):Ls(e,t,n);default:return Ls(e,t,n)}},Js=(e,t)=>{if(!Os.has(e.kind)||(js??=Ms(),!js))return;let n={environment:t,references:[],helpers:[],counter:0},r=qs(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
|
|
77
|
-
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return As??=ks(),Function(...Object.keys(As),...i,a)(...Object.values(As),...n.references)},Ys={kind:`Local`},Xs=/* @__PURE__ */ new WeakSet,Zs=/* @__PURE__ */ new WeakMap,Qs=/* @__PURE__ */ new WeakMap,$s=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ec=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),tc=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,nc=e=>e.kind===`Operator`?e.params.length:0,rc=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],ic=e=>e.name.includes(`!`),ac=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},oc=(e,t,n)=>{let r=t.bindings.get(e);return r&&tc(r.position,t.location)&&(!n||tc(r.position,n.start))?r:void 0},sc=(e,t)=>e!==void 0&&t!==void 0&&h(e)===h(t),cc=(e,t,n,r)=>{if(t===void 0)return!0;if(sc(t.range,n.range))return!1;let i=n.range;if(i===void 0||r.isGenerated||t.kind!==`Builtin`&&!t.range)return!0;let a=h(i),o=t.range&&h(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${e} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${e}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${e}. \nThis duplicates the one at ${o}.`}),!1},lc=(e,t,n,r)=>cc(t,ac(e,t)??oc(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,uc=(e,t,n)=>{cc(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},dc=(e,t,n,r)=>t.reduce((e,t,i)=>lc(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),fc=(e,t,n)=>t.reduce((e,t)=>lc(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),pc=e=>e.kind===`Name`?[e.name]:e.names,mc=e=>e.flatMap(e=>pc(e.pattern)),hc=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||tc(n.location,t.location))?n:void 0},gc=(e,t)=>{let n=hc(e,t);return n?{key:t.getKey(n),arity:nc(n),params:rc(n),kind:`Definition`}:t.imported.get(e)},_c=(e,t,n)=>ac(t,e)??gc(e,n),vc=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),yc=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:vc(e.location,e.spelling??t)},bc=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return tc(e.location,e.args[0].location)?`prefix`:`postfix`}},xc=e=>!/^[\p{L}\d_]/u.test(e),Sc=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Cc=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,wc=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},Tc=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?wc(e.name,[],void 0):wc(e.operator,e.args,e.argumentCounts),Ec=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Dc=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:mc(e.bounds),body:e.body,sets:Ec(e.bounds)};case`SetMap`:return{names:mc(e.bounds),body:e.expression,sets:Ec(e.bounds)};case`SetFilter`:return{names:pc(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:pc(e.pattern),body:e.body,sets:e.set?[e.set]:[]};case`UnboundedQuantifier`:case`Lambda`:return{names:e.kind===`Lambda`?e.params:e.names,body:e.body,sets:[]};default:return}},Oc=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},kc=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Ac=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),jc=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?jc(e.body,t):
|
|
78
|
-
from outside that declaration's scope.`,Ic=(e,t,n,r,i,a)=>{let o=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:h(r),message:n})},s=n.isSuffices===n.isInProof,c=n.statement,l={node:c,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,u=l.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return u.kind!==`NewSymbol`&&u.kind!==`AssumeProve`&&Nc(u).kind===`Let`?void 0:o(a-1,`A name selector here must be from a LET clause.`);let e=c.kind===`AssumeProve`?[...c.assumptions,c.conclusion]:[c],r=a===1?e.map((e,t)=>({position:t,label:Mc(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?jc(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&Ac(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${Fc}`);if(n.args.length!==r.label.params.length)return o(a,`Label \`${n.name}' used with wrong number of arguments.`);l.node=r.label,l.isGoal=!1,l.isSufficesOpen=!1;continue}if(n.kind!==`Operand`)return;let d=Pc(n.operand);if(l.isSufficesOpen){if(Cc(n.operand,1)!==0)return o(a,u.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);l.isSufficesOpen=!1;continue}if(u.kind===`NewSymbol`)return;if(u.kind!==`AssumeProve`){let e=Nc(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?_c(e.name,r,i)?.kind:void 0;if(t===`Variable`||t?.startsWith(`New`))return o(a,`Choosing operand \`${d}' of subexpression with no operands.`);let s=Dc(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:Oc(e);if(!c)return;let f=Cc(n.operand,c.length);if(f===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);l.node=c[f],l.isGoal=!1;continue}let f=[...u.assumptions,u.conclusion],p=Cc(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(Ac(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${Fc}`);let m=f[p];if(m.kind===`NewSymbol`&&a!==t.length-1)return o(a,`Selected a subexpression of a NEW clause of an ASSUME.`);l.node=m,l.isGoal=!1}a||(l.node.kind===`AssumeProve`&&o(void 0,`Selected ASSUME/PROVE instead of expression.`),l.node.kind===`NewSymbol`&&o(void 0,`Selected a NEW declaration as an expression or operator.`))},Lc=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:h(e.location.range),message:n}),!0)},Rc=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=h(r),a=e.params.filter((r,i)=>{let a=ac(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:h(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},zc=(e,t,n,r)=>{if(!kc(e))return!1;let i=Tc(e),a=i[0],o=i.length>1&&a.kind===`Name`?ac(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&Ic(e,i,o,t,n,r),o!==void 0},Bc=(e,t,n,r)=>{let i=e.location;if(Xc(e,n,r))return;let a=Qs.get(e);if(a!==void 0)return a;if($s(t))return e.kind===`Apply`?e.args.length:0;let o=ac(n,t);if(o?.isNonFact){r.errors.push({location:h(yc(e,t)),message:`Step number of non-expression step used as an expression.`});return}if(zc(e,n,r,!1)||Sc(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=Ys),o)return o.arity;let s=gc(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Qs.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(ac(n,c)!==void 0||gc(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=(e.kind===`Identifier`?void 0:e.spelling)??t,u=h(e.kind===`Apply`&&l===`-.`?vc(i,`-`):yc(e,t));if(!xc(t)||Sc(t)){r.errors.push({location:u,message:`Unknown operator: \`${t}'.`});return}r.errors.push({location:u,message:`Could not find declaration or definition of symbol '${l}'.`});let d=bc(e);d&&i.range&&r.errors.push({location:h(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},Vc=(e,t,n)=>(e.forEach(e=>B(e.set,t,n)),e.reduce((e,t)=>dc(e,pc(t.pattern),t.pattern.ranges,n),t)),Hc=(e,t)=>e.kind===`Identifier`&&e.name===t&&A(e)||ht(e).some(e=>Hc(e,t)),Uc=(e,t)=>{e.kind===`FunctionConstruction`&&Hc(e.body,t)&&(e.isRecursive=!0),ht(e).forEach(e=>Uc(e,t))},Wc=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?mc(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:h(o),message:e})},c=e.kind===`Function`?Vc(e.bounds,t,i):fc(t,e.params,i),l=ac(c,a)??oc(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${a} defined at wrong LET/IN level.`):l&&!u&&s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${a} already defined or declared.`),e.kind===`Function`?(B(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),Uc(e.body,a),e.isSelfReferential=Hc(e.body,a)):B(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:cc(a,ac(t,a)??oc(a,i,o),{kind:`Definition`,arity:nc(e),range:o},i)},Gc=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(ac(e,t.name)?.isPending)return e;let n={name:t.name,arity:nc(t),params:rc(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>nl(t,e,n),e)};return s(e.reduce((e,t)=>{let a=$s(t.name)?e:s(e,e=>!tc(t.location,e.location)),o={name:t.name,arity:nc(t),kind:`Definition`,range:t.location.range,parent:a};if(ic(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||$s(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return Wc(t,a,u,i)?{...o,params:rc(t)}:a},a),()=>!0)},Kc=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:ac(t,r)??oc(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},qc=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=Kc(e.kind===`Identifier`?e.name:e.operator,t,n),i=e.kind===`Apply`?e.argumentCounts?.[0]??0:0;if(!r||i===r.arity)return!1;let a=(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??e.location.range;return a&&n.errors.push({location:h(a),message:`The operator ${r.name} requires ${r.arity} arguments.`}),!0},Jc=(e,t,n)=>{if(qc(e,t,n))return;let r=e.operator,i=_c(r,t,n),a=Bc(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:h(e.argumentsRange??yc(e,r)),message:`The operator ${r} requires ${a-(Kc(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>Yc(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:h(e),message:t})};e.args.map((i,a)=>{let c=o[a]??0,l=i.location.range;if(c===0){if(i.kind===`Lambda`&&i.operator!==void 0)s(l,`The operator ${i.operator} requires 1 arguments.`);else if(i.kind===`Lambda`&&l)s(l,`LAMBDA expression used where an expression is required.`);else if(i.kind===`OperatorReference`){let e=Bc(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else B(i,t,n);return!0}if(i.kind===`Lambda`){B(i,t,n);let o=i.params.length===c;return!o&&Xs.has(i)?s(l,`Expected arity ${c} but found operator of arity ${i.params.length}.`):!o&&l&&i.operator===void 0&&s(e.selectorRanges?.at(-1)??yc(e,r),`Lambda expression with arity ${i.params.length} used as argument ${a+1} of operator \`${r}', \nbut an operator of arity ${c} is required.`),o}if(i.kind===`Subexpression`)return B(i,t,n),!0;if(i.kind===`Apply`&&i.argumentCounts?.at(-1)===0){let e=i.argumentCounts.findIndex(e=>e>0);return s(i.selectorRanges?.[e],`Selector \`${i.operator.split(`!`)[e]}' should not have argument(s).`),!1}if(i.kind!==`Identifier`&&i.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=i.kind===`Identifier`?i.name:i.operator,d=_c(u,t,n)?.params??[],f=Bc(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(yc(i,u),`Expected arity ${c} but found operator of arity ${f}.`),f===c&&d.every(e=>e===0)}).forEach((t,n)=>{t||s(e.location.range,`Argument number ${n+1} to operator '${r}' \nshould be a ${o[n]}-parameter operator.`)})},Yc=(e,t,n)=>{e.kind===`Identifier`?Bc(e,e.name,t,n):B(e,t,n)},Xc=(e,t,n)=>{let r=Zs.get(e);return r?(r.args.forEach(e=>Yc(e,t,n)),n.errors.push(r.error),!0):!1},B=(e,t,n)=>{if(Xs.has(e)&&!n.isGenerated){B(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>B(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(qc(e,t,n))return;let r=e.name,i=Bc(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:h(yc(e,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:Bc(e,e.operator,t,n);return;case`Apply`:Jc(e,t,n);return;case`Lambda`:B(e.body,dc(t,e.params,e.paramRanges,n),i(e.params));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:B(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&B(e.other,t,n);return;case`Let`:B(e.body,Gc(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:B(e.body,Vc(e.bounds,t,n),i(mc(e.bounds)));return;case`UnboundedQuantifier`:B(e.body,dc(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&B(e.set,t,n),B(e.body,dc(t,pc(e.pattern),e.pattern.ranges,n),i(pc(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:B(e.predicate,Vc([e.bound],t,n),i(pc(e.bound.pattern)));return;case`SetMap`:B(e.expression,Vc(e.bounds,t,n),i(mc(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:h(r.location.range??vc(r.location,r.name)),message:`Non-unique fields in constructor.`}),B(r.value,t,n)});return;case`Except`:B(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),B(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:B(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(Lc(e,n))return;B(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),Rc(e,t,n);return;case`Subexpression`:if(Xc(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Yc(e,t,n)),zc(e,t,n,!1)}},Zc=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||qc(e,t,n)||zc(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&ac(t,r)?.isNonFact?n.errors.push({location:h(yc(e,r)),message:`Step number of non-fact used as a fact`}):n.facts.has(r)||B(e,t,n)}),Qc=(e,t,n)=>(e.set&&B(e.set,t,n),lc(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),$c=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Qc(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?$c(t,e.scope,e.unit,!0):B(t,e.scope,e.unit),e),{scope:t,unit:n});return B(e.conclusion,i.scope,i.unit),i.scope},el=(e,t,n)=>e.kind===`AssumeProve`?$c(e,t,n):(B(e,t,n),t),tl=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Zc(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>rl(t,e,r),t)},nl=(e,t,n)=>{let r=ll(e,t,n);return e.name===void 0?r:lc(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},rl=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=el(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return tl(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return tl(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return Zc(r.facts,t,n),o(t);case`Instance`:return o(nl(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?nl(t,e,i):Gc([t],e,n),t));case`Have`:case`Case`:return B(r.expression,t,i),tl(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>B(e,t,i)),a(t);case`Take`:return a(dc(Vc(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=dc(Vc(r.bounds,t,i),r.names,r.nameRanges,i);return B(r.body,o,{...i,labelParams:[...i.labelParams,...mc(r.bounds),...r.names]}),tl(e.proof,a(t),n),a(o)}default:return tl(e.proof,a(t),n),a(t)}},il=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:el(e.statement,void 0,t);e.name!==void 0&&uc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),tl(e.proof,n,t),r&&(r.isInProof=!1)},al={line:0,column:0},ol=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),sl=(e,t)=>{let n=new Map([...ec,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},cl=(e,t,n,i,a)=>{let o=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){B(n,o,a);return}let i=Bc(n,n.name,o,a);if(i!==void 0&&i!==t.arity)throw new r(`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},c=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){a.errors.push({location:h(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let i=e.expression;s(r,i);let o=i.location.range;c.has(n)?o&&a.errors.push({location:h(o),message:`Multiple substitutions for symbol '${n}' in substitution.`}):c.set(n,i)});let l=t.filter(e=>!c.has(e.name)),u=e=>!ac(o,e.name)&&!gc(e.name,a);return l.filter(e=>!u(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};s(t,n),c.set(t.name,n)}),l.filter(u).forEach(t=>{let r=e.location.range,i=t.location.range;r&&i&&a.errors.push({location:h(r),message:`Substitution missing for symbol ${t.name} declared at ${h(i)} \nand instantiated in module ${n}.`})}),c},ll=(e,t,n)=>{let r=n.getInstance(e);return cl(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>lc(e,t,r,n),t)},ul=(e,t,n,r)=>{let i=sl(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),cl(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:al}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},dl=(e,t)=>{let n=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>tc(e.location,t.location)?-1:+!!tc(t.location,e.location)).forEach(e=>{let a=[],o=[];try{e.check(a,o)}catch(e){if(!(e instanceof r)||!e.sany&&a.length===0)throw e;a.push(...e.sany?.errors??[])}a.forEach(e=>i(n,e)),o.forEach(e=>i(t,e))}),n},fl=(e,t)=>{let n=sl(e,t.imported),r=/* @__PURE__ */ new Set([...t.facts,...[...e.theorems,...e.assumptions].flatMap(e=>e.name??[])]),i=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),a=new Map([...ec,...t.bound].map(([e,t])=>[e,{...t,position:al}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c,l)=>({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),l=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>uc(e.name,{kind:t,arity:e.arity,range:e.location.range},c(e.location,void 0,n,r,!1))}));return dl([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=cc(e.name,a.get(e.name),r,c(e.location,void 0,t,n,!1));i&&(a.set(e.name,r),o.add(r)),s.push({declaration:e,binding:i?r:void 0})}})),...e.definitions.map(t=>({location:t.location,check:(n,r)=>{let i=c(t.location,t,n,r,!0);ol(e,t)?B(t.body,void 0,i):Wc(t,void 0,i,o)&&a.set(t.name,{kind:`Definition`,arity:nc(t),range:t.location.range,position:t.location})}})),...e.instances.map(e=>({location:e.location,check:(n,r)=>{let i=c(e.location,void 0,n,r,!1);fc(void 0,e.params,i),t.instanced.get(e)?.forEach((e,t)=>uc(t,e,i)),e.name!==void 0&&uc(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...e.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=c(e.location,void 0,t,n,e.name!==void 0);B(e.expression,void 0,r),e.name!==void 0&&uc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>il(e,c(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>Zc(e.facts,void 0,c(e.location,void 0,t,n,!1))})),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:h(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},pl=/* @__PURE__ */ new WeakSet,ml=/* @__PURE__ */ new WeakMap,hl=(e,t)=>{if(t.length===0)return e;let n={...e};return pl.has(e)&&pl.add(n),ml.set(n,[...t,...ml.get(e)??[]]),n},gl=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Sl(e,(e,r)=>gl(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&A(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&A(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},_l=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),vl=/* @__PURE__ */ new WeakMap,yl=e=>vl.get(e)??e.name,bl=(e,t)=>(yl(t)!==e.name&&vl.set(e,yl(t)),e),xl=(e,t)=>bl(e.kind===`Function`?{...e,bounds:_l(e.bounds,e=>t(e,[])),body:t(e.body,mc(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Sl=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>xl(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:_l(e.bounds,n),body:t(e.body,mc(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,pc(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,pc(e.bound.pattern))};case`SetMap`:return{...e,bounds:_l(e.bounds,n),expression:t(e.expression,mc(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Cl=`LAMBDA`,wl=e=>`${e}@SUBSTITUTION`,Tl=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(Tl),El=(e,t)=>{if(e.kind!==`Identifier`)return!Tl(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=A(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!Tl(n.body)},Dl=(e,t=/* @__PURE__ */ new Set)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0,r=n===void 0||t.has(n)?[]:[n];return Sl(e,(e,n)=>(r.push(...Dl(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Ol=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},kl=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Al=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},jl=(e,t)=>e.map(e=>({pattern:Al(e.pattern,t),set:e.set})),Ml=(e,t)=>e.kind===`Function`?{...e,bounds:jl(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Nl=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>bl({...Ml(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:jl(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Al(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Al(e.bound.pattern,n),set:e.bound.set}};default:return e}},Pl=e=>`${e}@ENABLED`,Fl=(e,t)=>e.modes.get(t)??e,Il=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!A(e)&&t.instantiation.variables.has(e.name),Ll=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Ll(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Il(e,t,n))return[e.name];let r=A(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Ll(r.body,t,/* @__PURE__ */ new Map):void 0},Rl=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Il(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Pl(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Ul(e.expression,Fl(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Ul(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Ul(e.subscript,Fl(t,`Primed`),n),location:r},Ul(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Ll(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:Pl(r),location:e.location},location:e.location},Ul({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},zl=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:Ys}),Bl=(e,t)=>e.map(e=>zl(e.name,t)),Vl=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...Bl(t,r),...i.map(e=>zl(e,r))],location:r},location:r}},Hl=(e,t)=>e.instantiation.isParameterized(t)?Gl(e,t):void 0,Ul=(e,t,n)=>{let i=e=>Ul(e,t,n),a=t.instantiation,o=a.params,s=t=>!n.has(t)&&!A(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Ul(e.expression,Fl(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:i(e.subscript),action:i(e.action),enabled:Ul(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Fl(t,`Enabled`),n)};let c=Rl(e,t,n);if(c)return c;if(e.kind===`Identifier`&&s(e.name)){let n=a.substitutions.get(e.name),r=t.bindings;if(n&&(r===void 0||!El(n,a)))return hl(n,[e]);if(n&&r){let t=wl(e.name);return r.set(t,n),zl(t,e.location)}let i=Hl(t,e.name);if(i===void 0)return e;if(o.length===0)return{...e,name:i};let s=a.getDefinition(e.name);return s&&nc(s)>0?Vl(i,o,nc(s),e.location):{kind:`Apply`,operator:i,args:Bl(o,e.location),location:e.location}}if(e.kind===`Apply`&&s(e.operator)){let n=e.args.map(i),s=a.substitutions.get(e.operator),c=a.substitutions.size>0||o.length>0||pl.has(e),l=e=>(c&&pl.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let t=s.kind===`Identifier`?s.name:s.operator;return l({...e,operator:t,args:n,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...e,operator:s.operator,args:[...s.args,...n],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Cl,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...e,operator:Cl,args:n,resolution:Ys},location:e.location};if(s)throw new r(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=Hl(t,e.operator);return u===void 0?l({...e,args:n}):{...e,operator:u,args:[...Bl(o,e.location),...n]}}if(e.kind===`OperatorReference`&&s(e.operator)){let n=Hl(t,e.operator);if(n===void 0)return e;let r=a.getDefinition(e.operator);return o.length>0&&r?Vl(n,o,nc(r),e.location):{...e,operator:n}}let l=Ol(t),u=Sl(e,(e,r)=>r.length===0?i(e):Ul(e,t,kl(n,r,l)));return Nl(u,n,l)},Wl=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:zl(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Gl=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=Ol(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=Ml(xl(i,(e,t)=>Ul(e,s,kl(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(([e,t])=>({kind:`Operator`,name:e,params:[],body:t,isLocal:!0,isRecursive:!1,location:t.location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&ml.set(l,[u,...ml.get(i.body)??[]]),Wl({...c,body:l},r.params,i.location)}):t},Kl=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Dl(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>Hl(i,e)??e,getQualifiedKey:t=>{let n=Hl(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Wl(r,e.params,r.location)):t}}},ql=e=>e.kind===`Let`&&e.instances!==void 0||ht(e).some(ql),Jl=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Sl(e,e=>Jl(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>tc(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},Yl=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Xl=(e,t)=>e.definitions.some(e=>ql(e.body))||e.assumptions.some(e=>ql(e.expression))||e.theorems.some(e=>{let t=Yl(e);return t!==void 0&&ql(t)})?{...e,definitions:e.definitions.map(e=>xl(e,e=>Jl(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Jl(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Yl(e);return n===void 0?e:{...e,statement:Jl(n,t,[])}})}:e,Zl=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),Ql={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},$l=(e,t)=>{let n=Ql[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},eu=(e,t)=>`${e}${t}`,tu=(e,t,n)=>`${e}${t}${n}`,nu=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},ru=(e,t,n)=>`${e},${t},${n}`,iu=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),au=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),ou=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),su=(e,t,n,r)=>({...iu(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),cu=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,lu=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,uu=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{...su(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),du=su(`$Set`,0,[2],[1]),fu=su(`$Junction`,0,[3],[1]),pu=su(`$Choose`,0,[2],[1]),mu=su(`$Function`,0,[3],[1]),hu=su(`$FcnApply`,0,[2,2],[1,1]),gu=su(`$RcdSelect`,0,[2,0],[1,1]),_u=su(`'`,2,[1],[0]),vu=su(`ENABLED`,1,[2],[0]),yu=su(`[]`,3,[3],[0]),bu=su(`$SquareAct`,2,[2,1],[0,0]),xu=su(`$WF`,3,[1,2],[0,0]),Su=su(`$TemporalExists`,3,[3],[0]),Cu=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),wu=e=>e.map(e=>({name:e,arity:0})),Tu=(e,t)=>t.location.range?a(`${e}.`,t.location.range):new r(`${e} at line ${t.location.line}, column ${t.location.column}`),Eu=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Du=e=>e.kind!==`Let`&&e.kind!==`Label`,Ou=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:_(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=_(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=uu.get(t)??Zl.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},i=(e,t,n)=>{let r=iu(Math.max(t,...n.map(e=>e.data.level)));return r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(tu(e,n,t))}),t.data.constraints.forEach((e,t)=>au(r.constraints,t,e)),ou(r.argConstraints,eu(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>ou(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},a=(e,t,n=[],i=[])=>{let a=e=>i.includes(e);if(t.forEach((t,n)=>{if(!(t.operator||t.declared)&&t.data.level>cu(e,n))throw new r(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new r(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let o=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},s=(t,n,r)=>e.conditions.has(ru(t,n,r)),c=iu(Math.max(e.level,...t.filter((t,n)=>lu(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>c.params.add(e)),t.forEach((t,n)=>{lu(e,n)===1&&t.data.params.forEach(e=>c.params.add(e))}),n.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),e.constraints.forEach((e,t)=>au(c.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||au(c.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>au(c.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{a(t)||au(c.constraints,t,cu(e,n))})),t.forEach((e,n)=>{let r=e.operator;r&&t.forEach((e,t)=>r.formals.forEach((i,a)=>{s(n,t,a)&&e.data.params.forEach(e=>au(c.constraints,e,cu(r,a)))}))}),e.argParams.forEach(e=>{let t=nu(e),n=o(t.operator)?.operator;n&&au(c.constraints,t.param,cu(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>ou(c.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>ou(c.argConstraints,eu(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&ou(c.argConstraints,eu(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=nu(e),n=o(t.operator);n&&ou(c.argConstraints,eu(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{a(nu(e).param)||c.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),e.argParams.forEach(e=>{let t=nu(e),n=o(t.operator);if(n)n.declared&&c.argParams.add(tu(n.declared.name,t.index,t.param));else{let n=o(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(tu(t.operator,t.index,e)))}}),t.forEach((e,n)=>{let r=e.declared;r&&t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{s(n,t,a)&&e.data.params.forEach(e=>c.argParams.add(tu(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`){let n=ee(`LAMBDA`,wu(e.params),e.body,t);return{data:n,operator:n}}let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=iu();return e.params.add(r),{data:e,declared:{name:r,arity:i.arity}}}if(e.kind===`OperatorReference`)return{data:iu()}}return{data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=Cu(n,wu(i));return a(e,s(t,o),r.map(e=>m(e,n)),i)},l=(e,t)=>e.kind===`Declared`?i(e.name,e.level,t):a(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw Tu(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw Tu(`Action used where only temporal formula or state predicate allowed`,e);Eu.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Du(n)&&n.kind!==r)throw Tu(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=_(e,n);t.constraints.forEach((e,t)=>au(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>ou(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof r)||t.sany?t:Tu(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return iu();case`Identifier`:return l(n(e.name,t),[]);case`Apply`:{let r=s(e.args,t);return d(e,r),l(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(fu,n)}case`Prime`:case`Unchanged`:return c(_u,[e.expression],t);case`Enabled`:return c(vu,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(yu,[n])}case`If`:return c(fu,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(fu,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=c(fu,[e.body],t,e.bounds.map(e=>e.set),mc(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Tu(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?Su:fu,[e.body],t,[],e.names);case`Choose`:return c(pu,[e.body],t,e.set?[e.set]:[],pc(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(du,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(du,[e.predicate],t,[e.bound.set],pc(e.bound.pattern));case`SetMap`:return c(du,[e.expression],t,e.bounds.map(e=>e.set),mc(e.bounds));case`FunctionConstruction`:return c(mu,[e.body],t,e.bounds.map(e=>e.set),mc(e.bounds));case`Record`:return c(mu,e.fields.map(e=>e.value),t);case`RecordSet`:return c(du,e.fields.map(e=>e.value),t);case`Except`:return c(du,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(hu,[o(e.function,t),e.args.length===1?o(e.args[0],t):{data:c(du,e.args,t)}]);case`Bracket`:return iu();case`FieldAccess`:return a(gu,[o(e.record,t),{data:iu()}]);case`BoxAction`:case`AngleAction`:return c(bu,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(xu,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return iu()}},g=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>g(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return ht(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,Cu(t,wu(e.names))),i;default:return Sl(e,(e,n)=>(a(e,r,Cu(t,wu(n))),e)),i}},ee=(e,t,n,r)=>{let i=Cu(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...iu(a.level),name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get(eu(e.name,n))??0)),conditions:new Set(t.flatMap((e,n)=>t.flatMap((t,r)=>Array.from({length:e.arity},(e,t)=>t).filter(n=>a.argParams.has(tu(e.name,n,t.name))).map(e=>ru(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(nu(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=nu(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},_=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...iu(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=ee(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:_,toOperand:o}},ku=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?ku(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=iu(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>au(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>ou(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},Au=(e,t,n,r)=>{let i=Ou(t),a=e=>Math.max(0,...e.map(e=>i.analyze(e,/* @__PURE__ */ new Map).level)),o=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?a([t.expression]):t.kind===`Witness`?a(t.expressions):t.kind===`Take`?a(t.bounds.map(e=>e.set)):t.kind===`Pick`?a([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?ku(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=h(e.statement),n=()=>o(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...s(e.proof)]:e.body.kind===`Qed`?s(e.proof):[]}):[],c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>o(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>a([e.set])!==0).flatMap(e=>e.set.location.range?[{location:h(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...c(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[],l=dl([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>i.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?ku(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...c(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw re(n)}})),...n],r);if(l.length>0)throw re(l,!1,void 0,r)},ju=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),Mu=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Nu=/* @__PURE__ */ new Set([...ju,...Mu,`Enabled`]),Pu=/* @__PURE__ */ new Set([`~>`,`-+->`]),Fu=/* @__PURE__ */ new Set([...Pu,`\\cdot`]),Iu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Lu=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),Ru=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},zu=(e,t)=>Iu.has(e)||t.builtins.get(e)?.isStateLevel===!0,Bu=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(ju.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(Mu.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&Pu.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(Nu.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&Fu.has(e.operator))&&(r[0]|=1),Nu.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=Ru(e);if(u!==void 0&&!A(e)){let e=t.substitutions.get(u)??u,n=t.definitions.get(e),a=t.constants.has(u),o=t.variableIndex.get(u);if((o!==void 0||t.builtins.get(u)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=1),o!==void 0&&(l&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:l});else{zu(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),Lu.has(u)&&(r[0]|=8),!a&&zu(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}ht(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},Vu=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],Hu=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},Uu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),Wu=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=Bu(Vu(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&14,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=Hu(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=Hu(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!Uu(t[e],l[e*r])))),p=Hu(a,r,f,14);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|d[t]&224|p[t]&14:e),words:r}},Gu=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?Ku(Vu(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},Ku=(e,t)=>{let n=t.facts.words,r=Bu(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=Gu(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}Uu(e.callee,r[0])||(i[0]|=r[0]&14)}),i},qu=(e,t)=>!(Gu(e,t)[0]&1),Ju={any:2,repeated:4,streamed:8},Yu=(e,t,n=`any`)=>(Gu(e,t)[0]&Ju[n])!==0,Xu=(e,t)=>{let n=Gu(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},Zu=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},Qu=(e,t)=>{let n=Ku([e],t);return n[0]&16?void 0:Zu(n)},$u=(e,t)=>!!(Ku([e],t)[0]&1),ed=(e,t,n)=>new c(`Applying ${e} to the following value,\nwhich is not ${t}:\n${L(n)}`),td=e=>cn(e)?I(e):void 0,nd=`a function with a finite domain`,rd=(e,t,n)=>{let r=R(e,t,n),i=td(r);if(!i)throw ed(n,nd,r);return i},id=(e,t)=>{let n=R(e,1,t),r=td(n),i=r&&cd(r,R(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw ts(`second`,t,`bag`,n);return i},ad=(e,t,n)=>{let r=t[n];if(!r||!sd(r))throw ts(n===0?`first`:`second`,`(+)`,`bag`,R(e,n,`(+)`));return r},od=(e,t)=>{if(!M(e)||!N(e))throw t();return P(e).elements},sd=e=>e.range.every(e=>typeof e==`number`&&e>0),cd=(e,t)=>{let n=e.domain.findIndex(e=>Gr(t,e));return n===-1?void 0:e.range[n]},ld=e=>{if(typeof e==`number`)return e;let t=`tlc2.value.impl.${gs(e)}`;throw new v(`class ${t} cannot be cast to class tlc2.value.impl.IntValue (${t} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},ud=(e,t)=>{let n=ld(e)+ld(t);if(us(n))throw ds(`${e}+${t}`);return n},dd=(e,t,n)=>{let r=ld(e.range[t]),i=cd(n,e.domain[t]);if(i===void 0)return r;let a=r-ld(i);if(us(a))throw ds(`${r}-${i}`);return a},fd=(e,t,n,r=e.length)=>{let i=e.slice(0,r).find(e=>Gr(t,e[0]));i?i[1]=ud(i[1],n):e.push([t,n])},pd=e=>e.domain.map((t,n)=>[t,e.range[n]]),md=er([],[]),hd=e=>[os(`EmptyBag`,md),z(`IsABag`,1,e=>{let t=td(R(e,0,`IsABag`));return t!==void 0&&sd(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`);return rd(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw ed(`BagCardinality`,`a bag`,t);return ud(e,n)},0)}),z(`BagIn`,2,e=>{let t=id(e,`BagIn`);return t!==void 0&&t>0}),z(`CopiesIn`,2,e=>id(e,`CopiesIn`)??0),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>td(R(e,t,`(+)`))),n=ad(e,t,0),r=ad(e,t,1),i=pd(n);return r.domain.forEach((e,t)=>fd(i,e,r.range[t],n.domain.length)),ei(i)}),z(`\\ominus`,2,e=>{let t=R(e,0,`(-)`),n=R(e,1,`(-)`),r=td(t),i=td(n);if(!r)throw ts(`first`,`(-)`,`bag`,t);if(!i)throw ts(`second`,`(-)`,`bag`,n);return ei(r.domain.flatMap((e,t)=>{let n=dd(r,t,i);return n>0?[[e,n]]:[]}))}),z(`BagUnion`,1,e=>{let t=R(e,0,`BagUnion`),n=od(t,()=>ed(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??md;let r=e=>{let n=td(e);if(!n)throw new c(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${L(t)}`);return n},i=pd(r(n[0]));return n.slice(1).forEach(e=>{let t=r(e);t.domain.forEach((e,n)=>fd(i,e,t.range[n]))}),ei(i)}),z(`\\sqsubseteq`,2,e=>{let t=R(e,0,`\\sqsubseteq`),n=R(e,1,`\\sqsubseteq`),r=td(t),i=td(n);if(!r)throw ed(`\\sqsubseteq`,nd,t);if(!i)throw ed(`\\sqsubseteq`,nd,n);return r.domain.every((e,t)=>{let n=cd(i,e);return ld(r.range[t])<=(n===void 0?0:ld(n))})}),ss(`BagOfAll`,2,e=>{let t=as(e,0,`BagOfAll`),n=R(e,1,`BagOfAll`),r=td(n);if(!r)throw ts(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[];return r.domain.forEach((e,n)=>fd(i,t.call([e]),r.range[n])),ei(i)}),z(`SubBag`,1,t=>{let n=R(t,0,`SubBag`);if(!cn(n))throw new v(`Attempted to apply the operator DOMAIN to a non-function\n(${_s(n)})\nline 106, col 58 to line 106, col 65 of module Bags`);let r=I(n),i=P(Yr(r.range)).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new v(`Attempted to apply a function to ${L(r)}, which is not in its domain`);return Jr(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>er(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>da(rd(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=od(t,()=>ed(`BagToSet`,nd,t));return er([...n],n.map(()=>1))})],gd={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},_d={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},vd=[{lower:`true`,upper:`TRUE`,token:V.true},{lower:`false`,upper:`FALSE`,token:V.false},{lower:`null`,upper:`NULL`,token:V.null}],yd=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
|
|
79
|
-
`],[`r`,`\r`],[`f`,`\f`]]),bd=1024,xd=e=>{let t=+!!e.startsWith(``),n=t,r=0,i=t,a=!0,o=
|
|
80
|
-
See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`),m=()=>new
|
|
81
|
-
`.includes(e),
|
|
82
|
-
`){r++,i=n;return}if(t===`\r`)return}},
|
|
83
|
-
`)r++,i=n+1;else if(e.startsWith(t,n))return!0;return!1},
|
|
84
|
-
`)r++,i=n;else if(t===`/`){if(n===e.length)return t;h();let r=e[n];if(r!==`*`&&r!==`/`)return t;if(n++,r===`/`)
|
|
85
|
-
`,n)&&(n+=5),c[t]=gd.nonemptyDocument}else if(r===gd.nonemptyDocument){if(
|
|
86
|
-
`)return r++,i=n,t;if(`'"\\/`.includes(t))return t;throw p(`Invalid escape sequence`)},
|
|
87
|
-
`&&(r++,i=n)}throw p(`Unterminated string`)},oe=()=>{let t=n;for(;n<e.length&&g(e[n]);)n++;return e.slice(t,n)},se=e=>{if(c.length-1>=255)throw new v(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${f()}`);c.push(e),l.push(void 0),u.push(0),o=V.none},ce=()=>{c.pop(),l.pop(),u.pop(),u[c.length-1]++,o=V.none},le=()=>{let e=re();return e!==V.endObject&&e!==V.endArray&&e!==V.eof},ue=()=>{let e=re(),t=e===V.unquotedName?oe():ae(e===V.singleQuotedName?`'`:`"`);return o=V.none,l[c.length-1]=t,t},de=t=>t===V.true||t===V.false?t===V.true:t===V.null?null:t===V.number?(n+=s,{literal:e.slice(n-s,n)}):t===V.unquoted?oe():ae(t===V.singleQuoted?`'`:`"`),fe=()=>{let e=re();if(e===V.beginArray){se(gd.emptyArray);let e=[];for(;le();)e.push(fe());return ce(),e}if(e===V.beginObject){se(gd.emptyObject);let e=/* @__PURE__ */ new Map;for(;le();)e.set(ue(),fe());return ce(),e}let t=de(e);return o=V.none,u[c.length-1]++,t};if(re()===V.eof)return null;let S=fe();return a=!1,S!==null&&re(),S},Sd=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),Cd=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),wd=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),Td=e=>{if(!cn(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?fi(n):void 0},Ed=(e,t)=>{let n=`tlc2.value.impl.${gs(e)}`,r=`tlc2.value.impl.${t}`;return new v(`class ${n} cannot be cast to class ${r} (${n} and ${r} are in unnamed module of loader 'app')`)},Dd=e=>new v(`Cannot convert value: unsupported value type tlc2.value.impl.${gs(e)}`),Od=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),kd=e=>`[${e.map(Nd).join(`,`)}]`,Ad=e=>`{${_n(e).map(e=>`${Od(typeof e[0]==`string`?e[0]:L(e[0]))}:${Nd(e[1])}`).join(`,`)}}`,jd=e=>{let t=I(e),n=Vi(t);return n?kd(n):Ad(t)},Md=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,Nd=e=>typeof e==`string`?Od(e):typeof e==`object`?e.kind===`ModelValue`?Od(e.name):gs(e)===`RecordValue`?Ad(I(e)):Pd(e):String(e),Pd=e=>{let t=gs(e);if(t===`TupleValue`)return kd(I(e).range);if(Md(t))return jd(e);if(mi(e))return kd(P(e).elements);throw Dd(e)},Fd=e=>{let t=gs(e);if(t===`RecordValue`)return Ad(I(e));if(t===`TupleValue`)return`{${I(e).range.map((e,t)=>`"${t}":${Nd(e)}`).join(`,`)}}`;if(Md(t))return jd(e);throw Dd(e)},Id=e=>{if(e===null)throw new v(`Cannot convert value: unsupported JSON value null`);if(typeof e==`boolean`)return e;if(typeof e==`string`)return Ln(e);if(Array.isArray(e))return di(e.map(Id));if(e instanceof Map)return fi([...e].map(e=>[Ln(e[0]),Id(e[1])]));let t=Number(e.literal);if(!/^-?\d+$/.test(e.literal)||us(t))throw new v(`Cannot convert value: expected a 32-bit integer JSON number, but found ${e.literal}`);return t||0},Ld=e=>{if(typeof e!=`string`)throw new v(`Cannot cast tlc2.value.impl.${gs(e)} to tlc2.value.impl.StringValue`);return e},Rd=(e,t)=>{let n=la(e,t);if(typeof n!=`string`)throw Ed(n,`StringValue`);return n},zd=e=>{if(!Cd.has(e.toLowerCase()))throw wd.has(e.toLowerCase())?new t(`IOUtils!Serialize does not support the charset ${e}`):new v(/^[a-zA-Z\d][\w.:+-]*$/.test(e)?`java.nio.charset.UnsupportedCharsetException: ${e}`:`java.nio.charset.IllegalCharsetNameException: ${e}`)},Bd=(e,n,r,i)=>{let a=r.find(e=>!Sd.has(e));if(a!==void 0)throw new v(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${a}`);if(r.includes(`READ`))throw new v(`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 v(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(o.has(`DELETE_ON_CLOSE`))throw new t(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let s=e.readFile?.(n);if(s===void 0&&!o.has(`CREATE`)&&!o.has(`CREATE_NEW`))throw new v(`java.nio.file.NoSuchFileException: ${n}`);if(s!==void 0&&o.has(`CREATE_NEW`))throw new v(`java.nio.file.FileAlreadyExistsException: ${n}`);s===void 0||o.has(`TRUNCATE_EXISTING`)?e.writeFile?.(n,i):e.writeFile?.(n,o.has(`APPEND`)?s+i:i+s.slice(i.length))},Vd=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},Hd=(e,t)=>{let n=e.readFile?.(t);if(n===void 0)throw new v(`${t} (No such file or directory)`);return n},Ud=e=>[bs(cs(`ToJson`,1,e=>Ln(Nd(R(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),bs(cs(`ToJsonArray`,1,e=>Ln(Pd(R(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),bs(cs(`ToJsonObject`,1,e=>Ln(Fd(R(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),bs(cs(`JsonSerialize`,2,t=>{let n=Ld(R(t,0,`JsonSerialize`)),r=R(t,1,`JsonSerialize`);if(!Vi(r)&&!Td(r))throw ts(`second`,`JsonSerialize`,`sequence or record`,r);return Vd(e,n),e.writeFile?.(n,Nd(r)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),bs(cs(`ndJsonSerialize`,2,t=>{let n=Ld(R(t,0,`ndJsonSerialize`)),r=R(t,1,`ndJsonSerialize`),i=Vi(r);if(!i)throw ts(`second`,`ndJsonSerialize`,`sequence`,r);return Vd(e,n),e.writeFile?.(n,i.map(e=>`${Nd(e)}\n`).join(``)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),bs(cs(`JsonDeserialize`,1,t=>Id(xd(Hd(e,Ld(R(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),bs(cs(`ndJsonDeserialize`,1,t=>di(Hd(e,Ld(R(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>Id(xd(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],Wd=(e,t)=>[bs(Es(`Serialize`,3,(n,r)=>{let i=Ds(n,2,`Serialize`)(),a=Td(i);if(!a)throw ts(`third`,`ndJsonSerialize`,`sequence`,i);if(Rd(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Ds(n,0,`Serialize`)(),s=Vi(o);if(!s)throw ts(`first`,`Serialize`,`sequence`,o);let c=Ds(n,1,`Serialize`)();if(typeof c!=`string`)throw ts(`second`,`ndJsonSerialize`,`sequence`,c);let l=la(a,`openOptions`);if(gs(l)!==`TupleValue`)throw Ed(l,`TupleValue`);let u=Rd(a,`charset`),d=I(l).range.map(e=>{if(typeof e!=`string`)throw Ed(e,`StringValue`);return e});return zd(u),Bd(e,c,d,s.map(e=>`${Nd(e)}\n`).join(``)),!0}),`public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`)],Gd={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},Kd=e=>{let t=[],n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=0,a=Zn(),o=e=>t.push(e&255),s=e=>{o(e>>8),o(e)},c=e=>{s(e>>16),s(e)},l=e=>e>32767?c(-e):s(e),u=e=>{o(Gd.string),c(0),c(-1),c(e.length),e.split(``).forEach(e=>o(e.charCodeAt(0)))},d=e=>{o(Gd.handle),l(e)},f=e=>{if(typeof e==`boolean`){o(Gd.boolean),o(+!!e);return}if(typeof e==`number`){o(Gd.integer),c(e);return}if(typeof e==`string`){i++,u(e);return}if(e.kind===`ModelValue`){o(Gd.modelValue),s(a.indexOf(e));return}if(e.kind===`Interval`){o(Gd.interval),c(e.low),c(e.high);return}let t=n.get(e);if(t!==void 0){d(t);return}if(n.set(e,i++),M(e)){let t=P(e).elements;o(Gd.set),c(t.length),t.forEach(f);return}let p=I(e),m=rr(e);m===`tuple`?(o(Gd.tuple),l(p.range.length),p.range.forEach(f)):m===`record`?(o(Gd.record),c(p.domain.length),p.domain.forEach((e,t)=>{let n=String(e),a=r.get(n);a===void 0?(r.set(n,i++),u(n)):d(a),f(p.range[t])})):(o(Gd.function),l(p.domain.length),o(1),p.domain.forEach((e,t)=>{f(e),f(p.range[t])}))};return f(e),ue(Uint8Array.from(t))},qd=e=>[bs(cs(`_TLCTraceSerialize`,2,t=>{let n=Ld(R(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,Kd(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`)],Jd=25214903917n,Yd=(1n<<48n)-1n,Xd=2147483647,Zd=e=>{let t=(BigInt.asUintN(64,e)^Jd)&Yd,n=e=>(t=t*Jd+11n&Yd,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^Jd)&Yd},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=Xd)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Qd=[],$d=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},ef=()=>{for(let e=1277011;Qd.length<1341;e++)$d(e)&&Qd.push(e);return Qd},tf=e=>{let t=ef(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},nf=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},rf=e=>{for(let t=Math.max(e,9);;t++){let e=nf(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},af=(e,t,n)=>{if(t<=0)return[];let r=rf(t),i=BigInt(n.nextInt(t)),a=BigInt(tf(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},of=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Xd),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},sf=(1n<<63n)-1n-24n,cf=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(sf*BigInt(n)+i)%t;return r<0n?r+t:r})},lf=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,uf=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=li(e.domain),n=P(e.range).elements;return{lists:t.map(()=>n),create:e=>er(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>P(e).elements),create:t=>fi(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>P(e).elements),create:di}}},df=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,ff=(e,t,n,r)=>{if(F(t))return[];let i=r===`1.7.4`?of:af;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=df(t,r)?void 0:uf(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Xd)?cf(e,t,n):i(e,Number(t),n)).map(e=>a.create(lf(a.lists,e)))}let o=P(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},pf=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...ns(e.domain,`RandomElement`,e).elements];return er(n,n.map(()=>pf(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return fi(e.names.map((n,r)=>[n,pf(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return di(e.factors.map(e=>pf(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new v(`Attempted to retrieve out-of-bounds element from the interval value ${L(e)}.`);return e.low+r}let n=ns(e,`RandomElement`).elements,r=Math.floor(t.nextDouble()*n.length);if(r>=n.length)throw new v(`Index ${r} out of bounds for length ${n.length}`);return n[r]},mf=(e,t,n)=>{if(typeof e!=`number`||e<0)throw ts(t,n,`nonnegative integer`,e);return e},hf=(e,t,n,r)=>Jr(Array.from({length:t},()=>Jr(e.filter(()=>r.nextDouble()<n)))),gf=(e,t)=>{let n=`RandomSetOfSubsets`,r=mf(R(e,0,n),`first`,n),i=mf(R(e,1,n),`second`,n),a=R(e,2,n);if(!M(a)||!N(a))throw ts(`third`,n,`finite set`,a);let o=P(a).elements;if(o.length<31&&r>2**o.length)throw ts(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw ts(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return hf(o,r,o.length===0?0:i/o.length,t.getRandom())},_f=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,vf=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,yf=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(_f.test(t))return Number(t.replace(/[fFdD]$/,``));let n=vf.exec(t);if(!n)return;let r=n[3]??``,i=`${n[2]}${r}`;if(i===``)return;let a=Number.parseInt(i,16)*2**(Number(n[4])-4*r.length);return n[1]===`-`?-a:a},bf=e=>z(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=mf(R(t,0,n),`first`,n),i=R(t,1,n);if(typeof i!=`string`)throw ts(`second`,n,`string literal representing a probability`,i);let a=yf(i);if(a===void 0||a<0||a>1)throw ts(`second`,n,`string literal does not represent a parsable probability`,i);let o=R(t,2,n);if(!M(o)||Bn(o)||!Ri(o))throw ts(`third`,n,`finite set`,o);let s=Ii(o);if(32-Math.clz32(r)>s&&r>1<<s)throw ts(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return hf(P(o).elements,r,a,e.getRandom())}),xf=e=>[bs(z(`RandomSubset`,2,t=>{let n=mf(R(t,0,`RandomSubset`),`first`,`RandomSubset`),r=R(t,1,`RandomSubset`);if(!mi(r)||!Ri(r))throw ts(`second`,`RandomSubset`,`a finite set`,r);let i=df(r,e.version);if(i&&i.reduce((e,t)=>e*P(t).elements.length,1)>tn())throw new v(nn());return Jr(ff(n,r,e.getRandom(),e.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),z(`RandomSetOfSubsets`,3,t=>gf(t,e)),z(`TestRandomSetOfSubsets`,3,t=>di(Array.from({length:5},()=>P(gf(t,e)).elements.length)))],Sf=(e,t=0n)=>{let n=Zd(t),r=Zd(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>fi([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,getSuccessorAction:()=>void 0,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:mo,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},Cf=e=>ei([...e.possibleCounts].map(([e,t])=>[e,t])),wf=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Cf(e)]]),Tf=e=>fi([[`name`,e??`UnnamedAction`],[`location`,fi([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),Ef=/* @__PURE__ */ new WeakSet,Df=(e,t)=>{let n=fi([[`action`,Jr(e)],[`state`,Jr(t)]]);return Ef.add(n),n},Of=(e,t,n)=>{let r=e.map((e,t)=>di([t+1,fi(Object.entries(e))])),i=r.slice(1).map((e,n)=>di([r[n],t[n],e])),a=n?[di([r[r.length-1],n.action,r[n.start]])]:[];return Df([...i,...a],r)},kf=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return wf(e).get(t)},Af=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0||!e.pause)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),L(r));else throw new c(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${L(n)}`)},jf=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:H(e),Mf=e=>e.every(e=>e!==void 0),Nf=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!A(e);if(i&&t.variableIndex.has(r))return 1;let a=ht(e).map(e=>Nf(e,t,n)),o=i?ag(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(Nf(o.body,t,n))),Math.max(0,...a)},Pf=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[Es(`AssertError`,2,e=>{let n=as(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw new v(`In computing AssertError, a non-string expression (${jf(n)}) was used as the err of an AssertError(err, exp).`);let r=Ds(e,0,`AssertError`)();try{Ds(e,1,`AssertError`)()}catch(e){if(e instanceof v)return Ft(e.message,t.isTool)===r;throw e}return!1}),cs(`TLCGetOrDefault`,2,e=>kf(t,R(e,0,`TLCGetOrDefault`))??R(e,1,`TLCGetOrDefault`)),cs(`Trace`,0,(e,n)=>{let r=n?.environment.variables??[],i=n?.state??r.map(()=>void 0);if(!n||!Mf(i)){let e=r.filter((e,t)=>i[t]===void 0);throw new v(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return n.state?di(t.getBehavior(i).map(e=>{let r=n.environment.variables.map((t,n)=>[t,e[n]]),i=t.getSimulationValue?.(`action`,e);return fi(i===void 0?r:[[`_action`,i],...r])})):di([fi([])])}),cs(`CounterExample`,0,()=>t.counterExample??Df([],[])),z(`ToTrace`,1,e=>{let t=R(e,0,`ToTrace`);if(typeof t!=`object`||!Ef.has(t))throw new c(`The argument of ToTrace should be a CounterExample, but instead it is:\n${L(t)}`);let n=P(la(t,`state`)).elements.map(e=>Vi(e)??[]);return di(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,e=>{let t=R(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new c(`The argument of ModelValue should be a string, but instead it is:\n${L(t)}`);return Xn(t)}),Es(`TLCDefer`,1,(e,n)=>{let r=as(e,0,`TLCDefer`).expression;return n&&r&&(t.deferred=e=>{W(r,{...n,next:e})}),!0}),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),{...Es(`PickSuccessor`,1,(n,r)=>{let i=r?.next??(r?.environment.variables??[]).map(()=>void 0);if(!Mf(i)||r?.next&&t.isSeen(i))return!0;let a=as(n,0,`PickSuccessor`),o=a.call([]);if(typeof o!=`boolean`)throw new v(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${_s(o)}) was used as the condition of an IF.\n${a.expression?jf(a.expression):``}`);if(o||!r?.next||!r.state||!Mf(r.state))return!0;let s=t.getSuccessorAction(r.state,i);throw e(wt(t.isTool,xt.moduleOverrideStdout,St.none,`Extend behavior of length ${t.getLevel(r.state)} with a "${s?.name}" step [<Action ${s?.location.range&&h(s.location.range)}>]? (Yes/no/explored/states/diff):`)),new oe}),isActionLevel:!0},Es(`TLCCache`,2,(e,r)=>{let a=as(e,0,`TLCCache`),o=Aa(Ds(e,1,`TLCCache`)()),s=a.expression;if(!s||!r)return a.call([]);let c=Nf(s,r.environment,/* @__PURE__ */ new Set);if(c===2)return a.call([]);let l=c===1;if(l&&r.state&&t.getSimulationValue===void 0)return a.call([]),a.call([]);let u=l&&r.state?i(r.state):n,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=a.call([]);return d.set(o,p),p}),z(`TLCFP`,1,e=>{let t=R(e,0,`TLCFP`),n=xa(t);if(n)throw n;return Number(BigInt.asIntN(32,mo([t])))}),Es(`TLCEvalDefinition`,1,(e,t)=>{let n=Ds(e,0,`TLCEvalDefinition`)();if(typeof n!=`string`)throw new c(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${L(n)}`);let r=t?ag(n,t.environment):void 0,i=r?void 0:t?.environment.builtins.get(n);if(i?.arity===0)return i.evaluate([],t);if(!r||!t)throw new c(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${L(n)}`);if(r.kind===`Operator`&&r.params.length>0){let e=r.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new c(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${n}(${e.join(`, `)})`)}return r.kind===`Operator`?W(r.body,t):W({kind:`Identifier`,name:n,location:r.location},t)})]},Ff=(e,t)=>[cs(`_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}),cs(`_Counts`,0,()=>Cf(t)),cs(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(Cf(t),!0)),!1)}),cs(`_PrintCounts`,0,()=>(e(L(Cf(t),!0)),!0))],If=e=>String(e).padStart(2,`0`),Lf=e=>`${e.getUTCFullYear()}.${If(e.getUTCMonth()+1)}.${If(e.getUTCDate())}.${If(e.getUTCHours())}${If(e.getUTCMinutes())}${If(e.getUTCSeconds())}`,Rf=e=>ei([...e].map(([e,t])=>[e,di([t])])),zf=e=>nr(ti(e),`record`),Bf=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Vf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Hf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Uf=(e,t,n)=>{if(e.version===`1.7.4`?!Vf.has(t)||!e.isStarted&&Hf.has(t):!e.isStarted&&Bf.has(t))throw new c(`TLCGet(${t}) was undefined.`);let r=e.getSimulationValue?.(t,n);if(r!==void 0)return r;let i=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return i;case`stats`:return zf([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,i],[`worker`,0]]);case`config`:return zf([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,String(BigInt.asIntN(64,Ya()))],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return zf([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Ln(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Ln(Lf(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Tf(void 0);case`all`:return Rf(e.registers);case`all:named`:return Rf(wf(e))}if(t.startsWith(`s:`)){let n=wf(e).get(t);if(n===void 0)throw new c(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Ln(e.properties.get(t.slice(2))??t);throw new c(`TLCGet(${t}) was undefined.`)},Wf=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new c(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new c(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${L(t)}`);return Uf(e,t,n?.state)},Gf=e=>e.length===0?[[]]:e.flatMap((t,n)=>Gf([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Kf=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&P(e).elements.forEach(Kf),e.kind===`Function`&&e.range.forEach(Kf))},qf=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`ModelValue`:case`Function`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return I(e);default:return P(e)}},Jf=(e,t)=>[z(`Print`,2,t=>(e(Va([R(t,0,`Print`),R(t,1,`Print`)]).map(j).join(` `)),R(t,1,`Print`))),z(`PrintT`,1,t=>(e(j(Va([R(t,0,`PrintT`)])[0])),!0)),z(`Assert`,2,e=>{if(R(e,0,`Assert`)!==!0)throw new c(`The first argument of Assert evaluated to FALSE; the second argument was:\n${j(L(R(e,1,`Assert`)))}`,ie.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>ei([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=R(e,0,`@@`),n=R(e,1,`@@`),r=cn(t)?I(t):void 0,i=cn(n)?I(n):void 0;if(!r)throw ts(`first`,`@@`,`function`,t);if(!i)throw ts(`second`,`@@`,`function`,n);let a=gn(r),o=gn(i).filter(e=>!a.some(t=>Gr(e[0],t[0])));return ti([...a,...o])}),z(`ToString`,1,e=>Ln(L(R(e,0,`ToString`),!0))),{...Es(`TLCEval`,1,(e,t)=>{let n=qf(Ds(e,0,`TLCEval`)());return t===void 0&&Kf(n),n}),isStateLevel:!1},z(`Permutations`,1,e=>{let t=ns(R(e,0,`Permutations`),`Permutations`).elements;return Jr(Gf(t).map(e=>ei(t.map((t,n)=>[t,e[n]]))))}),ss(`SortSeq`,2,e=>{let t=R(e,0,`SortSeq`),n=Vi(t);if(!n)throw ts(`first`,`SortSeq`,`natural number`,t);let r=as(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw ts(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t=a.length;for(;t>0&&i(e,a[t-1]);)t--;a.splice(t,0,e)}),di(a)}),t.version===`1.7.4`?bs({...cs(`TLCGet`,1,(e,n)=>Wf(t,R(e,0,`TLCGet`),n)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):bs(Es(`TLCGet`,1,(e,n)=>Wf(t,Ds(e,0,`TLCGet`)(),n)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),cs(`TLCSet`,2,n=>(Af(t,e,R(n,0,`TLCSet`),R(n,1,`TLCSet`)),!0)),os(`Any`,Wn),z(`RandomElement`,1,e=>pf(R(e,0,`RandomElement`),t.getRandom()))],Yf=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),Xf=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],Zf=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),Qf=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs.beginLine.beginColumn.endLine.endColumn.module.name.location.context.parameters._action`.split(`.`),$f=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),ep=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
76
|
+
`;if(typeof o!=`string`)throw new v(`The _format field of the ALIAS ${i} is ${I(o)}, but it must be a string.`);return r.filter(([e])=>!(a&&e===`_format`)).filter(([e,n])=>!t||!Ua(t[e],n)).map(([e,t])=>{let n=Ka(o,[e,A(I(t))]);if(n===void 0)throw new v(`The _format field of the ALIAS ${i} is ${I(o)}, but it must format two strings, the name and the value of a field.`);return n}).join(``)},Ja=[10454148508367108822n,15747411856486957441n,13848313129918172575n,15427004735118145554n,14338780731064426356n,15931650522396165332n,17670238537108149059n,12816660938095048951n,13192168525635896882n,16119298732711755075n,13564417994159519395n,15831473429641889162n,17671735485712653535n,14582471876431321160n,9288673424107444897n,12345523232675890545n,13774063780198914517n,10636128657019767374n,13227535641082688945n,10085966873248490402n,17056045221983369811n,18027133543548002442n,13033986364717636900n,12663388180492401538n,11007194744055901935n,16251515628090973732n,18046429724439772544n,9876734796024595817n,14949643787442512870n,16960057143726945461n,10590203213448744021n,12248592797044284137n,9558805810925624286n,16993321702164258530n,11754329512098378960n,12074934892440206921n,15696745233288286746n,10531590977001201739n,18107999685377398317n,12149369488538049728n,12923655455904407421n,10507099144397364930n,17322088528956367024n,14653973644796244054n,15165509594857513400n,13554280709034297251n,16228911470502883382n,17115369786458865383n,11179220607102683830n,16708422618246866334n,12295941796329322556n,18336630348474106240n,13989616001589685348n,14822072159597151759n,14264172520427195041n,11642530518213145397n,11877331515501935358n,13913116192159715440n,17054474839259161580n,13461230878584418056n,16058025410470398786n,11100471369705097435n,11133782763824505275n,13192312712502684421n,17456091706045076157n,13237272598629075916n,12914531898895761383n,15801841604014567326n,16446055517513626294n,16780923767715884464n,15104658705803254918n,10882049990920163451n,12728112724252049190n,11720209067562733740n,16476221075563830086n,16602801460297162326n,16206898064012585915n,12158475401238648099n,13742285336487677729n,15543703592025073839n,9615783578189153721n,16710542608962839044n,11960730242263336692n,13328718558362718101n,12971616006464047952n,17057853503483465676n,16180230282101315295n,15483523553568578902n,17773465781871025571n,18047252642493037509n,11580640560664688668n,10121963531818974651n,14218267149826330657n,12715294421139777506n,10584764766358778171n,12666843443693621286n,17403948736867619210n,17907955559063099692n,15179434392748515198n,15413469521140985247n,13455040338347572751n,15419348191054617477n,12340568220039846914n,13236419189535069162n,18074463254581147189n,10818750974828329405n,9859349269386152082n,15035006154709018396n,13627907273947709876n,9549035931546940138n,16199589727945564820n,10285831968679942330n,17737018494601061698n,15477896647372134857n,13595764249822586512n,10556855812148546550n,12421897615105552821n,15477767459253848096n,17421607461439241175n,12409061346569762725n,13621778224251023638n,10680972825126675886n,16494492050207190715n,16801324317763555620n,12664650400804916358n,16134230614391269483n,10027806175083075147n,9259037851175017999n,11803214621941906429n,9537357587847606069n,10517495000576890277n],Ya={polynomial:Ja[0]},Xa=()=>Ya.polynomial,Za=/* @__PURE__ */ new Int32Array(256),Qa=/* @__PURE__ */ new Int32Array(256),$a=/* @__PURE__ */ new Int32Array(256),eo=/* @__PURE__ */ new Int32Array(256),to=/* @__PURE__ */ new Int32Array(256),no=/* @__PURE__ */ new Int32Array(256),ro=/* @__PURE__ */ new Int32Array(256),io=/* @__PURE__ */ new Int32Array(256),ao={high:0,low:0};let oo=0,so=0;const co=e=>{let t=(e^so)&255;so=(so>>>8|oo<<24)^to[t],oo=oo>>>8^Za[t]},lo=e=>{let t=Ja[e];Ya.polynomial=t;let n=[];for(let e=1n<<63n;n.length<72;)n.push(e),e=e>>1n^((e&1n)==0n?0n:t);let r=n.slice(64,72).reverse();for(let e=0;e<256;e++){let t=r.reduce((t,n,r)=>e>>r&1?t^n:t,0n);Za[e]=Number(BigInt.asIntN(32,t>>32n)),to[e]=Number(BigInt.asIntN(32,t))}let i=[Za,Qa,$a,eo],a=[to,no,ro,io];for(let e=1;e<4;e++){let t=i[e-1],n=a[e-1];for(let r=0;r<256;r++){let o=n[r]&255;a[e][r]=(n[r]>>>8|t[r]<<24)^to[o],i[e][r]=t[r]>>>8^Za[o]}}ao.high=Number(BigInt.asIntN(32,t>>32n)),ao.low=Number(BigInt.asIntN(32,t))};lo(0);const uo=e=>{let t=so^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;so=oo^io[n]^ro[r]^no[i]^to[a],oo=eo[n]^$a[r]^Qa[i]^Za[a]},fo=e=>{if(typeof e==`boolean`)return co(0),co(e?116:102),2;if(typeof e==`number`)return co(1),uo(e),5;if(typeof e==`string`){co(3),uo(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)uo(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)co(e.charCodeAt(n));return 5+e.length}return co(21),uo(zn(e.name)+1),5},po=e=>{if(typeof e!=`object`||un(e))fo(e);else if(ln(e)){let t=F(e);co(9),uo(t.domain.length);for(let e=0;e<t.domain.length;e++)po(t.domain[e]),po(t.range[e])}else{let t=N(e).elements;co(5),uo(t.length);for(let e of t)po(e)}},mo=e=>{let t={high:oo,low:so};oo=ao.high,so=ao.low;for(let t of e)po(t);let n=BigInt(oo>>>0)<<32n|BigInt(so>>>0);return oo=t.high,so=t.low,n},ho=(e,t)=>{let n=new BigInt64Array(e.length),r=new Int32Array(n.buffer),i=oo,a=so;return e.forEach((e,n)=>{oo=ao.high,so=ao.low;for(let n of t)po(e[n]);r[2*n]=so,r[2*n+1]=oo}),oo=i,so=a,n},go=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),_o=1024,vo=e=>({current:-1,expressions:[],ranges:[],firstChild:[],lastChild:[],nextSibling:[],prefixes:[],isPart:[],isPrimed:[],isUnchanged:[],recursive:[],lets:[],roots:[],primary:[],secondary:[],covered:/* @__PURE__ */ new WeakSet,values:/* @__PURE__ */ new WeakMap,registers:new Uint8Array(e*_o),relations:[]}),yo=(e,t,n,r,i)=>{let a=e.expressions.length;if(e.expressions.push(t),e.ranges.push(n),e.firstChild.push(-1),e.lastChild.push(-1),e.nextSibling.push(-1),e.prefixes.push(-1),e.isPart.push(i),e.isPrimed.push(!1),e.isUnchanged.push(t?.kind===`Unchanged`),e.recursive.push(-1),e.lets.push(void 0),e.roots.push(r===-1?a:e.roots[r]),e.primary.push(0),e.secondary.push(0),t&&e.covered.add(t),r===-1)return a;let o=e.lastChild[r];return o===-1&&(e.firstChild[r]=a),o!==-1&&(e.nextSibling[o]=a),e.lastChild[r]=a,a},bo=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,xo=(e,t,n,r,i)=>{let a=t===`next`?bo(e,t,r):void 0;if(a!==void 0)return a;let o=yo(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},So=(e,t)=>e!==void 0&&t!==void 0&&e.module===t.module&&e.start.line===t.start.line&&e.start.column===t.start.column&&e.end.line===t.end.line&&e.end.column===t.end.column,Co=(e,t,n)=>{let r=e===void 0?void 0:n.definitions.get(e),i=r?.kind===`Operator`?r.head:void 0,a=t.location.range;return!r||!i?`Action ${a?h(a):`Unknown location`}`:So(r.body.location.range,a)||!a?`${r.name} ${h(i)}`:`${r.name} ${h(i)} (${a.start.line} ${a.start.column} ${a.end.line} ${a.end.column})`},wo=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,To=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,Eo=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},Do=e=>Array.from({length:e.length},(t,n)=>e.charCodeAt(n)).reduce((e,t)=>Math.imul(e,31)+t|0,0)&2147483647,Oo=e=>{let t=Array.from({length:11},()=>[]);return e.forEach((e,n)=>{if(n>=Math.floor(t.length*.75)){let e=Array.from({length:t.length*2+1},()=>[]);for(let n=t.length-1;n>=0;n--)t[n].forEach(t=>e[Do(t.name)%e.length].unshift(t));t=e}t[Do(e.name)%t.length].unshift(e)}),t.toReversed().flat()},ko=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),Ao=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),jo=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),Mo=(e,t,n)=>{let r=new Set(n.map(wo)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(k(e)){for(let e=r;e;e=e.parent)if(e.name===n)return e.definition&&{definition:e.definition,scope:e.scope};return}let i=t.substitutions.get(n)??n;if(t.variableIndex.has(i)||t.constants.has(i))return;let a=t.definitions.get(i),o=a?.location.range?.module??a?.body.location.range?.module;return a&&!go.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=yo(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(wo(n));let d=t&&s.get(t);if(d&&i.forEach(t=>{e.expressions[t]===d&&(e.lets[t]??=[]).push(u)}),l?.kind===`Operator`&&l.isRecursive){let t=i.findLast(e=>a[e]===l);t!==void 0&&(e.recursive[u]=t)}return a[u]=l,i.push(u),o(),i.pop(),u},u=e=>{let t=e.definition;if(o.includes(t))return;o.push(t);let n=t.kind===`Function`?jo(t.bounds):t.params.map(e=>e.name);m(t.body,Ao(n,e.scope)),t.kind===`Function`&&ko(t.bounds).forEach(t=>m(t,e.scope)),o.pop()},d=e=>e?.definition.kind===`Operator`&&e.definition.params.length>0,f=(e,t,n,r)=>{if(e.kind===`Lambda`)m(e.body,Ao(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:m(e.body,Ao(e.params,t));return;case`Lambda`:m(e.body,Ao(e.params,t));return;case`Let`:{let n=e.definitions.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),Oo(e.definitions).forEach(e=>u({definition:e,scope:n})),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,To(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,Eo(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,To(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,Ao(jo(e.bounds),t)),r(ko(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,Ao(jo(e.bounds),t)),r(ko(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,Ao(jo([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,Ao(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,Ao(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}};e.relations.forEach(e=>{i.push(e.node),m(e.expression,void 0),i.pop()})},No=(e,t,n)=>{for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r]){if(e.expressions[r]===n)return r;if(e.isPart[r]){let t=No(e,r,n);if(t!==-1)return t}}return-1},Po=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=No(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:No(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},Fo=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},Io=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},Lo=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},Ro=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},zo=(e,t)=>t.forEach((t,n)=>{let r=mo([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*_o+i;e.registers[o]=Math.max(e.registers[o],Ro(a)+1)}),Bo=(e,t)=>{let n=e.registers.subarray(t*_o,(t+1)*_o),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*_o*_o/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*_o?a===0?i:_o*Math.log(_o/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},Vo=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},Ho=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>Vo(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},Uo=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},Wo=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],Go=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},Ko=(e,t)=>{let n=e.primary[t.node],r=e.secondary[t.node];return t.kind===`init`?{distinct:n,generated:n+r}:t.kind===`next`?{distinct:r,generated:n}:t.kind===`constraint`?{distinct:r,generated:n+r}:{distinct:0,generated:0}},qo=(e,t)=>{let n=[],r=/* @__PURE__ */ new Map,i=t=>{let n=[],a={primary:e.primary[t],secondary:e.secondary[t]};return(a.primary>0||a.secondary>0||Wo(e,t))&&Uo(n,a),Go(e,t).forEach(e=>i(e).forEach(e=>Uo(n,e))),r.set(t,n),n},a=(t,r,i,a)=>{let o=e.ranges[t];n.push({location:o?h(o):`Unknown location`,depth:r,count:i,cost:a})},o=(t,n)=>a(t,n,e.primary[t],e.secondary[t]),s=(t,n)=>{let c=Go(e,t),l=[];c.forEach(e=>(r.get(e)??i(e)).forEach(e=>Uo(l,e)));let u={primary:e.primary[t],secondary:e.secondary[t]},d=Wo(e,t),f=e=>c.forEach(t=>s(t,e));if(e.isUnchanged[t]){let e=l.filter(e=>e.primary!==0||e.secondary!==0);e.length===0?o(t,n):a(t,n,Math.max(u.primary,Ho(e).primary),0);return}if(l.length===0){(u.primary!==0||d)&&o(t,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let e=l[0],r=e.primary===0&&e.secondary===0;if(e.primary<u.primary){o(t,n),f(n+1);return}if(!d&&p&&!r){a(t,n,e.primary,e.secondary);return}if(p&&r){d&&o(t,n),f(d?n+1:n);return}if(u.primary===e.primary&&u.secondary===e.secondary){o(t,n);return}}let m=!p||d;m&&o(t,n),f(m?n+1:n)};return Go(e,t).forEach(e=>{i(e),s(e,0)}),n},Jo=[`init`,`next`,`invariant`,`constraint`,`implied`],Yo=(e,t)=>!e||!t?e?1:t?-1:0:e.module===t.module?e.start.line-t.start.line||e.start.column-t.start.column||e.end.line-t.end.line||e.end.column-t.end.column:e.module<t.module?-1:1,Xo=e=>Jo.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>Yo(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||Yo(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),Zo=(e,t,n,r)=>({variables:r.map(r=>{let i=n[r]?.range;return{label:`${t.variables[r]} ${i?h(i):`Unknown location`}`,distinct:Bo(e,r)}}),relations:Xo(e).map(t=>({kind:t.kind,label:t.label,...Ko(e,t),expressions:qo(e,t.node)}))}),Qo=(e,t,n)=>{let r=bo(e,t,n);if(r===void 0)return;let i=e.primary[r],a=e.secondary[r];if(t===`init`)return[[`generated`,i+a],[`distinct`,i]];if(t===`next`)return[[`generated`,i],[`distinct`,a]];let o=e.firstChild[r];return[[`count`,o===-1?i:e.primary[o]]]},$o=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),es=(e,t)=>$o.has(e)?new _(t):new c(t),ts=(e,t,n,r)=>new c(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${I(r)}`),ns=(e,t,n=e)=>{if(!j(e)||Vn(e))throw new c(`Applying ${t} to the following value,\nwhich is not a finite set:\n${I(n)}`);return N(e)},rs=e=>typeof e==`object`&&e.kind===`Operator`,L=(e,t,n)=>{let r=e[t];if(r===void 0||rs(r))throw es(n,`${n} expects a value as argument ${t+1}`);return r},is=(e,t,n)=>{let r=L(e,t,n);if(typeof r!=`boolean`)throw es(n,`${n} expects a boolean but received ${I(r)}`);return r},as=(e,t,n)=>{let r=e[t];if(r===void 0||!rs(r))throw es(n,`${n} expects an operator as argument ${t+1}`);return r},os=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),R=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),ss=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),cs=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),ls=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(L(n,0,e),L(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),us=e=>e>2147483647||e<-2147483648,ds=e=>new c(`Overflow when computing ${e}`),fs={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},ps={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},ms={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},hs={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},gs=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return ps[e.operator];if(e.kind!==`Function`)return fs[e.kind];let t=ir(e);return t===void 0?`FcnRcdValue`:hs[t]},_s=e=>ms[gs(e)],vs=(e,t)=>`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`,ys=(e,t)=>new _(vs(e,t)),bs=(e,t)=>{let n=n=>(...r)=>{let i=Wi.sets?.length??0;try{return n(...r)}catch(n){if(!(n instanceof _)||n instanceof se)throw n;let r=Ki(i);throw Wi.sets&&(Wi.sets.length=i),e.isLazy!==!0&&n instanceof c&&!r?n:e.isLazy!==!0&&n instanceof ie?new c(vs(t,n.message)):ys(t,n.message)}},r=n(e.evaluate);return{...e,evaluate:(n,i)=>{if(n.length!==e.arity)throw ys(t,`array is not of length ${e.arity}`);return r(n,i)},evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},xs=(e,t)=>{if(typeof e!=`number`)throw ys(t,`Cannot cast tlc2.value.impl.${gs(e)} to tlc2.value.impl.IntValue`);return e},Ss=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Cs=(e,t,n,r)=>{let i=Ss(e,n,`IntValue`,2);return ls(t,(e,n)=>{let a=xs(n,i),o=xs(e,i),s=r(o,a);if(us(s))throw ds(`${o}${t}${a}`);return s})},ws=(e,t,n)=>{if(typeof e!=`number`)throw new c(`The ${t} argument of ${n} should be an integer, but instead it is:\n${I(e)}`);return e},Ts=(e,t,n=e)=>ls(e,(e,r)=>t(ws(e,`first`,n),ws(r,`second`,n))),Es=(e,t,n)=>({...cs(e,t,n),isLazy:!0}),Ds=(e,t,n)=>{let r=as(e,t,n);return()=>r.call([])},Os=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),ks=()=>({implication:ng,negate:rg,equivalent:ig,body:ag,condition:(e,t)=>{if(typeof e!=`boolean`)throw zh(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw Bh(t,n,e);return e},apply:ua,expectFunction:Qh,tuple:fi,set:Xr,record:mi,writtenRecord:yn,equal:fr,enumerate:fg,choiceElements:L_,noChoice:e=>{throw R_(e)},filterPredicate:I_,isReducible:cn,finiteElements:e=>N(e).elements,addBounded:an,normalizedSet:er,isBeyondBound:on,cardinality:Li,functionDomain:ui,sortedFunction:tr,unassigned:(e,t)=>{throw qh(e,t)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:$h,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>Xh(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let As,js;const Ms=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Ns=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Ps=e=>`local${e.counter++}`,Fs=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),gt(e).forEach(e=>Fs(e,t)),t),Is=(e,t,n)=>{let r=Fs(t),i=[...n.locals].filter(([e])=>r.has(e));if(i.length===0)return n.context;let a=Ns(e,i.map(([e])=>e));return`extend(${n.context}, ${a}, [${i.map(([,e])=>e).join(`, `)}])`},Ls=(e,t,n)=>`${Ns(e,H(t,e.environment))}(${Is(e,t,n)})`,Rs=(e,t,n)=>{let r=`helper${e.counter++}`,i=[...t.locals.values()],a={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(t.locals)},o=i.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${r}(context, state, next${o}) { let primed; let applied; ${n(a)} }`),`${r}(${t.context}, ${t.state}, ${t.isPrimed?`undefined`:t.next}${o})`},zs=(e,t,n,r)=>{let i=Ps(e),a=Ps(e),o=Ps(e);return`for (let ${i} = 0, ${a} = ${t}.low, ${o} = ${a} === undefined ? ${t}.length : ${t}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${t}[${i}] : ${a} + ${i}; ${r} }`},Bs=(e,t,n)=>{let r=t.kind===`Forall`;return Rs(e,n,n=>{let i=t.bounds.map(()=>Ps(e)),a=t.bounds.map((r,a)=>a>0&&t.bounds[a-1].set===r.set?`const ${i[a]} = ${i[a-1]};`:`const ${i[a]} = enumerate(${qs(e,r.set,n)}, ${Ns(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=Ps(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${qs(e,t.body,n)}, ${Ns(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>zs(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},Vs=(e,t,n,r,i)=>Rs(e,i,i=>{let a=Ps(e),o=Ps(e),s=Ns(e,t),c=`choiceElements(${qs(e,n,i)}, ${s}, ${Ns(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${qs(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${zs(e,a,o,l)} return noChoice(${s});`}),Hs=(e,t,n,r)=>Rs(e,r,r=>{let i=Ps(e),a=Ps(e),o=Ps(e),s=Ps(e),c=Ns(e,t),l=`if (!isReducible(${i})) return ${Ns(e,F_(t,e.environment))}(${i}, ${Is(e,t,r)});`,u=qs(e,t.bound.set,r);r.locals.set(n,s);let d=`if (filterPredicate(${qs(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${zs(e,a,s,d)} return normalizedSet(${o});`}),Us=(e,t,n,r)=>Rs(e,r,r=>{let i=Ps(e),a=Ps(e),o=Ps(e),s=Ps(e),c=Ps(e),l=Ps(e),u=Ns(e,M_(t,e.environment)),d=Is(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=qs(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${qs(e,t.body,r)}; if (!${a}) ${s}.push(${l});`;return`const ${i} = ${p}; ${f} const ${a} = isBeyondBound(${i}); const ${o} = ${a} ? ${i} : functionDomain(${i}); if (${a}) cardinality(${i}); const ${s} = []; ${zs(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),Ws=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=qs(e,r[0],n),a=qs(e,r[1],n),o=Ns(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${qs(e,r[0],n)}, ${Ns(e,t)})`;if(t.operator===`<=>`)return`equivalent(${qs(e,r[0],n)}, ${qs(e,r[1],n)}, ${Ns(e,t)})`;if(k(t))return Ls(e,t,n);let i=zg(t.operator,e.environment);if(i?.kind!==`Builtin`)return Ls(e,t,n);if(i.name===`DOMAIN`)return`${Ns(e,Uh(t))}(${qs(e,r[0],n)})`;if(i.name===`TLCEval`)return Ls(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Ns(e,Wh(t,i))}(${qs(e,r[0],n)}, ${qs(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&v_(r[0],a))return`${Ns(e,i.evaluateUnary)}(${qs(e,r[0],n)})`;let o=r.length===2&&v_(r[0],a)&&v_(r[1],a);return i.evaluateBinary&&o?`${Ns(e,i.evaluateBinary)}(${qs(e,r[0],n)}, ${qs(e,r[1],n)})`:Ls(e,t,n)},Gs=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(k(e))return!1;let r=Xg(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Gs(e.expression,t,n);case`FieldAccess`:return Gs(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Gs(e,t,n));default:return!1}},Ks=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Ks(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Ks);default:return!1}},qs=(e,t,n)=>{let r=(t,r=n)=>qs(e,t,r);switch(t.kind){case`Number`:return pn(t.value)?String(t.value):Ls(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(k(t))return Ls(e,t,n);let i=Xg(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Ns(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Ns(e,i.value):Ls(e,t,n)}case`Apply`:return Ws(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=Ns(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${Ns(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{D_(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Gs(t.function,n,e.environment)?r(t.function):Ks(t.function)?r(t.function,i):Ls(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Ns(e,t)}))`,o=Hh(e.environment.runtime.version),s=o?`, ${Ns(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${Ns(e,Vh(t))}(${r(t.record)})`;case`Record`:{let i=B_(t.fields);if(V_(i))return Ls(e,t,n);let a=Ns(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${Ns(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:return n.isPrimed?Ls(e,t,n):r(t.expression,{context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals});case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?Bs(e,t,n):Ls(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?Vs(e,t,t.set,t.pattern.name,n):Ls(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!j_(t)?Us(e,t,r.pattern.name,n):Ls(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?Hs(e,t,t.bound.pattern.name,n):Ls(e,t,n);default:return Ls(e,t,n)}},Js=(e,t)=>{if(!Os.has(e.kind)||(js??=Ms(),!js))return;let n={environment:t,references:[],helpers:[],counter:0},r=qs(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
|
|
77
|
+
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return As??=ks(),Function(...Object.keys(As),...i,a)(...Object.values(As),...n.references)},Ys={kind:`Local`},Xs=/* @__PURE__ */ new WeakSet,Zs=/* @__PURE__ */ new WeakMap,Qs=/* @__PURE__ */ new WeakMap,$s=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ec=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),tc=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,nc=e=>e.kind===`Operator`?e.params.length:0,rc=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],ic=e=>e.name.includes(`!`),ac=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},oc=(e,t,n)=>{let r=t.bindings.get(e);return r&&tc(r.position,t.location)&&(!n||tc(r.position,n.start))?r:void 0},sc=(e,t)=>e!==void 0&&t!==void 0&&h(e)===h(t),cc=(e,t,n,r)=>{if(t===void 0)return!0;if(sc(t.range,n.range))return!1;let i=n.range;if(i===void 0||r.isGenerated||t.kind!==`Builtin`&&!t.range)return!0;let a=h(i),o=t.range&&h(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${e} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${e}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${e}. \nThis duplicates the one at ${o}.`}),!1},lc=(e,t,n,r)=>cc(t,ac(e,t)??oc(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,uc=(e,t,n)=>{cc(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},dc=(e,t,n,r)=>t.reduce((e,t,i)=>lc(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),fc=(e,t,n)=>t.reduce((e,t)=>lc(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),pc=e=>e.kind===`Name`?[e.name]:e.names,mc=e=>e.flatMap(e=>pc(e.pattern)),hc=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||tc(n.location,t.location))?n:void 0},gc=(e,t)=>{let n=hc(e,t);return n?{key:t.getKey(n),arity:nc(n),params:rc(n),kind:`Definition`}:t.imported.get(e)},_c=(e,t,n)=>ac(t,e)??gc(e,n),vc=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),yc=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:vc(e.location,e.spelling??t)},bc=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return tc(e.location,e.args[0].location)?`prefix`:`postfix`}},xc=e=>!/^[\p{L}\d_]/u.test(e),Sc=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Cc=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,wc=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},Tc=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?wc(e.name,[],void 0):wc(e.operator,e.args,e.argumentCounts),Ec=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Dc=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:mc(e.bounds),body:e.body,sets:Ec(e.bounds)};case`SetMap`:return{names:mc(e.bounds),body:e.expression,sets:Ec(e.bounds)};case`SetFilter`:return{names:pc(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:pc(e.pattern),body:e.body,sets:e.set?[e.set]:[]};case`UnboundedQuantifier`:case`Lambda`:return{names:e.kind===`Lambda`?e.params:e.names,body:e.body,sets:[]};default:return}},Oc=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},kc=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Ac=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),jc=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?jc(e.body,t):gt(e).reduce((e,n)=>e??jc(n,t),void 0)},Mc=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??Mc(i,t,n||Ac(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&jc(e.set,t):jc(e,t)},Nc=e=>e.kind===`Label`?Nc(e.body):e,Pc=e=>typeof e==`number`?`argument selector ${e}`:e,Fc=`within the scope of a declaration
|
|
78
|
+
from outside that declaration's scope.`,Ic=(e,t,n,r,i,a)=>{let o=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:h(r),message:n})},s=n.isSuffices===n.isInProof,c=n.statement,l={node:c,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,u=l.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return u.kind!==`NewSymbol`&&u.kind!==`AssumeProve`&&Nc(u).kind===`Let`?void 0:o(a-1,`A name selector here must be from a LET clause.`);let e=c.kind===`AssumeProve`?[...c.assumptions,c.conclusion]:[c],r=a===1?e.map((e,t)=>({position:t,label:Mc(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?jc(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&Ac(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${Fc}`);if(n.args.length!==r.label.params.length)return o(a,`Label \`${n.name}' used with wrong number of arguments.`);l.node=r.label,l.isGoal=!1,l.isSufficesOpen=!1;continue}if(n.kind!==`Operand`)return;let d=Pc(n.operand);if(l.isSufficesOpen){if(Cc(n.operand,1)!==0)return o(a,u.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);l.isSufficesOpen=!1;continue}if(u.kind===`NewSymbol`)return;if(u.kind!==`AssumeProve`){let e=Nc(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?_c(e.name,r,i)?.kind:void 0;if(t===`Variable`||t?.startsWith(`New`))return o(a,`Choosing operand \`${d}' of subexpression with no operands.`);let s=Dc(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:Oc(e);if(!c)return;let f=Cc(n.operand,c.length);if(f===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);l.node=c[f],l.isGoal=!1;continue}let f=[...u.assumptions,u.conclusion],p=Cc(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(Ac(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${Fc}`);let m=f[p];if(m.kind===`NewSymbol`&&a!==t.length-1)return o(a,`Selected a subexpression of a NEW clause of an ASSUME.`);l.node=m,l.isGoal=!1}a||(l.node.kind===`AssumeProve`&&o(void 0,`Selected ASSUME/PROVE instead of expression.`),l.node.kind===`NewSymbol`&&o(void 0,`Selected a NEW declaration as an expression or operator.`))},Lc=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:h(e.location.range),message:n}),!0)},Rc=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=h(r),a=e.params.filter((r,i)=>{let a=ac(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:h(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},zc=(e,t,n,r)=>{if(!kc(e))return!1;let i=Tc(e),a=i[0],o=i.length>1&&a.kind===`Name`?ac(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&Ic(e,i,o,t,n,r),o!==void 0},Bc=(e,t,n,r)=>{let i=e.location;if(Xc(e,n,r))return;let a=Qs.get(e);if(a!==void 0)return a;if($s(t))return e.kind===`Apply`?e.args.length:0;let o=ac(n,t);if(o?.isNonFact){r.errors.push({location:h(yc(e,t)),message:`Step number of non-expression step used as an expression.`});return}if(zc(e,n,r,!1)||Sc(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=Ys),o)return o.arity;let s=gc(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Qs.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(ac(n,c)!==void 0||gc(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=(e.kind===`Identifier`?void 0:e.spelling)??t,u=h(e.kind===`Apply`&&l===`-.`?vc(i,`-`):yc(e,t));if(!xc(t)||Sc(t)){r.errors.push({location:u,message:`Unknown operator: \`${t}'.`});return}r.errors.push({location:u,message:`Could not find declaration or definition of symbol '${l}'.`});let d=bc(e);d&&i.range&&r.errors.push({location:h(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},Vc=(e,t,n)=>(e.forEach(e=>z(e.set,t,n)),e.reduce((e,t)=>dc(e,pc(t.pattern),t.pattern.ranges,n),t)),Hc=(e,t)=>e.kind===`Identifier`&&e.name===t&&k(e)||gt(e).some(e=>Hc(e,t)),Uc=(e,t)=>{e.kind===`FunctionConstruction`&&Hc(e.body,t)&&(e.isRecursive=!0),gt(e).forEach(e=>Uc(e,t))},Wc=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?mc(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:h(o),message:e})},c=e.kind===`Function`?Vc(e.bounds,t,i):fc(t,e.params,i),l=ac(c,a)??oc(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${a} defined at wrong LET/IN level.`):l&&!u&&s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${a} already defined or declared.`),e.kind===`Function`?(z(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),Uc(e.body,a),e.isSelfReferential=Hc(e.body,a)):z(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:cc(a,ac(t,a)??oc(a,i,o),{kind:`Definition`,arity:nc(e),range:o},i)},Gc=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(ac(e,t.name)?.isPending)return e;let n={name:t.name,arity:nc(t),params:rc(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>nl(t,e,n),e)};return s(e.reduce((e,t)=>{let a=$s(t.name)?e:s(e,e=>!tc(t.location,e.location)),o={name:t.name,arity:nc(t),kind:`Definition`,range:t.location.range,parent:a};if(ic(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||$s(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return Wc(t,a,u,i)?{...o,params:rc(t)}:a},a),()=>!0)},Kc=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:ac(t,r)??oc(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},qc=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=Kc(e.kind===`Identifier`?e.name:e.operator,t,n),i=e.kind===`Apply`?e.argumentCounts?.[0]??0:0;if(!r||i===r.arity)return!1;let a=(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??e.location.range;return a&&n.errors.push({location:h(a),message:`The operator ${r.name} requires ${r.arity} arguments.`}),!0},Jc=(e,t,n)=>{if(qc(e,t,n))return;let r=e.operator,i=_c(r,t,n),a=Bc(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:h(e.argumentsRange??yc(e,r)),message:`The operator ${r} requires ${a-(Kc(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>Yc(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:h(e),message:t})};e.args.map((i,a)=>{let c=o[a]??0,l=i.location.range;if(c===0){if(i.kind===`Lambda`&&i.operator!==void 0)s(l,`The operator ${i.operator} requires 1 arguments.`);else if(i.kind===`Lambda`&&l)s(l,`LAMBDA expression used where an expression is required.`);else if(i.kind===`OperatorReference`){let e=Bc(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else z(i,t,n);return!0}if(i.kind===`Lambda`){z(i,t,n);let o=i.params.length===c;return!o&&Xs.has(i)?s(l,`Expected arity ${c} but found operator of arity ${i.params.length}.`):!o&&l&&i.operator===void 0&&s(e.selectorRanges?.at(-1)??yc(e,r),`Lambda expression with arity ${i.params.length} used as argument ${a+1} of operator \`${r}', \nbut an operator of arity ${c} is required.`),o}if(i.kind===`Subexpression`)return z(i,t,n),!0;if(i.kind===`Apply`&&i.argumentCounts?.at(-1)===0){let e=i.argumentCounts.findIndex(e=>e>0);return s(i.selectorRanges?.[e],`Selector \`${i.operator.split(`!`)[e]}' should not have argument(s).`),!1}if(i.kind!==`Identifier`&&i.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=i.kind===`Identifier`?i.name:i.operator,d=_c(u,t,n)?.params??[],f=Bc(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(yc(i,u),`Expected arity ${c} but found operator of arity ${f}.`),f===c&&d.every(e=>e===0)}).forEach((t,n)=>{t||s(e.location.range,`Argument number ${n+1} to operator '${r}' \nshould be a ${o[n]}-parameter operator.`)})},Yc=(e,t,n)=>{e.kind===`Identifier`?Bc(e,e.name,t,n):z(e,t,n)},Xc=(e,t,n)=>{let r=Zs.get(e);return r?(r.args.forEach(e=>Yc(e,t,n)),n.errors.push(r.error),!0):!1},z=(e,t,n)=>{if(Xs.has(e)&&!n.isGenerated){z(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>z(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(qc(e,t,n))return;let r=e.name,i=Bc(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:h(yc(e,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:Bc(e,e.operator,t,n);return;case`Apply`:Jc(e,t,n);return;case`Lambda`:z(e.body,dc(t,e.params,e.paramRanges,n),i(e.params));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:z(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&z(e.other,t,n);return;case`Let`:z(e.body,Gc(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:z(e.body,Vc(e.bounds,t,n),i(mc(e.bounds)));return;case`UnboundedQuantifier`:z(e.body,dc(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&z(e.set,t,n),z(e.body,dc(t,pc(e.pattern),e.pattern.ranges,n),i(pc(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:z(e.predicate,Vc([e.bound],t,n),i(pc(e.bound.pattern)));return;case`SetMap`:z(e.expression,Vc(e.bounds,t,n),i(mc(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:h(r.location.range??vc(r.location,r.name)),message:`Non-unique fields in constructor.`}),z(r.value,t,n)});return;case`Except`:z(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),z(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:z(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(Lc(e,n))return;z(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),Rc(e,t,n);return;case`Subexpression`:if(Xc(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Yc(e,t,n)),zc(e,t,n,!1)}},Zc=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||qc(e,t,n)||zc(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&ac(t,r)?.isNonFact?n.errors.push({location:h(yc(e,r)),message:`Step number of non-fact used as a fact`}):n.facts.has(r)||z(e,t,n)}),Qc=(e,t,n)=>(e.set&&z(e.set,t,n),lc(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),$c=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Qc(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?$c(t,e.scope,e.unit,!0):z(t,e.scope,e.unit),e),{scope:t,unit:n});return z(e.conclusion,i.scope,i.unit),i.scope},el=(e,t,n)=>e.kind===`AssumeProve`?$c(e,t,n):(z(e,t,n),t),tl=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Zc(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>rl(t,e,r),t)},nl=(e,t,n)=>{let r=ll(e,t,n);return e.name===void 0?r:lc(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},rl=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=el(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return tl(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return tl(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return Zc(r.facts,t,n),o(t);case`Instance`:return o(nl(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?nl(t,e,i):Gc([t],e,n),t));case`Have`:case`Case`:return z(r.expression,t,i),tl(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>z(e,t,i)),a(t);case`Take`:return a(dc(Vc(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=dc(Vc(r.bounds,t,i),r.names,r.nameRanges,i);return z(r.body,o,{...i,labelParams:[...i.labelParams,...mc(r.bounds),...r.names]}),tl(e.proof,a(t),n),a(o)}default:return tl(e.proof,a(t),n),a(t)}},il=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:el(e.statement,void 0,t);e.name!==void 0&&uc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),tl(e.proof,n,t),r&&(r.isInProof=!1)},al={line:0,column:0},ol=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),sl=(e,t)=>{let n=new Map([...ec,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},cl=(e,t,n,i,a)=>{let o=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){z(n,o,a);return}let i=Bc(n,n.name,o,a);if(i!==void 0&&i!==t.arity)throw new r(`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},c=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){a.errors.push({location:h(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let i=e.expression;s(r,i);let o=i.location.range;c.has(n)?o&&a.errors.push({location:h(o),message:`Multiple substitutions for symbol '${n}' in substitution.`}):c.set(n,i)});let l=t.filter(e=>!c.has(e.name)),u=e=>!ac(o,e.name)&&!gc(e.name,a);return l.filter(e=>!u(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};s(t,n),c.set(t.name,n)}),l.filter(u).forEach(t=>{let r=e.location.range,i=t.location.range;r&&i&&a.errors.push({location:h(r),message:`Substitution missing for symbol ${t.name} declared at ${h(i)} \nand instantiated in module ${n}.`})}),c},ll=(e,t,n)=>{let r=n.getInstance(e);return cl(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>lc(e,t,r,n),t)},ul=(e,t,n,r)=>{let i=sl(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),cl(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:al}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},dl=(e,t)=>{let n=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>tc(e.location,t.location)?-1:+!!tc(t.location,e.location)).forEach(e=>{let a=[],o=[];try{e.check(a,o)}catch(e){if(!(e instanceof r)||!e.sany&&a.length===0)throw e;a.push(...e.sany?.errors??[])}a.forEach(e=>i(n,e)),o.forEach(e=>i(t,e))}),n},fl=(e,t)=>{let n=sl(e,t.imported),r=/* @__PURE__ */ new Set([...t.facts,...[...e.theorems,...e.assumptions].flatMap(e=>e.name??[])]),i=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),a=new Map([...ec,...t.bound].map(([e,t])=>[e,{...t,position:al}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c,l)=>({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),l=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>uc(e.name,{kind:t,arity:e.arity,range:e.location.range},c(e.location,void 0,n,r,!1))}));return dl([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=cc(e.name,a.get(e.name),r,c(e.location,void 0,t,n,!1));i&&(a.set(e.name,r),o.add(r)),s.push({declaration:e,binding:i?r:void 0})}})),...e.definitions.map(t=>({location:t.location,check:(n,r)=>{let i=c(t.location,t,n,r,!0);ol(e,t)?z(t.body,void 0,i):Wc(t,void 0,i,o)&&a.set(t.name,{kind:`Definition`,arity:nc(t),range:t.location.range,position:t.location})}})),...e.instances.map(e=>({location:e.location,check:(n,r)=>{let i=c(e.location,void 0,n,r,!1);fc(void 0,e.params,i),t.instanced.get(e)?.forEach((e,t)=>uc(t,e,i)),e.name!==void 0&&uc(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...e.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=c(e.location,void 0,t,n,e.name!==void 0);z(e.expression,void 0,r),e.name!==void 0&&uc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>il(e,c(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>Zc(e.facts,void 0,c(e.location,void 0,t,n,!1))})),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:h(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},pl=/* @__PURE__ */ new WeakSet,ml=/* @__PURE__ */ new WeakMap,hl=(e,t)=>{if(t.length===0)return e;let n={...e};return pl.has(e)&&pl.add(n),ml.set(n,[...t,...ml.get(e)??[]]),n},gl=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Sl(e,(e,r)=>gl(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&k(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&k(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},_l=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),vl=/* @__PURE__ */ new WeakMap,yl=e=>vl.get(e)??e.name,bl=(e,t)=>(yl(t)!==e.name&&vl.set(e,yl(t)),e),xl=(e,t)=>bl(e.kind===`Function`?{...e,bounds:_l(e.bounds,e=>t(e,[])),body:t(e.body,mc(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Sl=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>xl(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:_l(e.bounds,n),body:t(e.body,mc(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,pc(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,pc(e.bound.pattern))};case`SetMap`:return{...e,bounds:_l(e.bounds,n),expression:t(e.expression,mc(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Cl=`LAMBDA`,wl=e=>`${e}@SUBSTITUTION`,Tl=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(Tl),El=(e,t)=>{if(e.kind!==`Identifier`)return!Tl(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=k(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!Tl(n.body)},Dl=(e,t=/* @__PURE__ */ new Set)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0,r=n===void 0||t.has(n)?[]:[n];return Sl(e,(e,n)=>(r.push(...Dl(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Ol=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},kl=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Al=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},jl=(e,t)=>e.map(e=>({pattern:Al(e.pattern,t),set:e.set})),Ml=(e,t)=>e.kind===`Function`?{...e,bounds:jl(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Nl=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>bl({...Ml(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:jl(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Al(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Al(e.bound.pattern,n),set:e.bound.set}};default:return e}},Pl=e=>`${e}@ENABLED`,Fl=(e,t)=>e.modes.get(t)??e,Il=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!k(e)&&t.instantiation.variables.has(e.name),Ll=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Ll(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Il(e,t,n))return[e.name];let r=k(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Ll(r.body,t,/* @__PURE__ */ new Map):void 0},Rl=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Il(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Pl(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Ul(e.expression,Fl(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Ul(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Ul(e.subscript,Fl(t,`Primed`),n),location:r},Ul(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Ll(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:Pl(r),location:e.location},location:e.location},Ul({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},zl=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:Ys}),Bl=(e,t)=>e.map(e=>zl(e.name,t)),Vl=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...Bl(t,r),...i.map(e=>zl(e,r))],location:r},location:r}},Hl=(e,t)=>e.instantiation.isParameterized(t)?Gl(e,t):void 0,Ul=(e,t,n)=>{let i=e=>Ul(e,t,n),a=t.instantiation,o=a.params,s=t=>!n.has(t)&&!k(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Ul(e.expression,Fl(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:i(e.subscript),action:i(e.action),enabled:Ul(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Fl(t,`Enabled`),n)};let c=Rl(e,t,n);if(c)return c;if(e.kind===`Identifier`&&s(e.name)){let n=a.substitutions.get(e.name),r=t.bindings;if(n&&(r===void 0||!El(n,a)))return hl(n,[e]);if(n&&r){let t=wl(e.name);return r.set(t,n),zl(t,e.location)}let i=Hl(t,e.name);if(i===void 0)return e;if(o.length===0)return{...e,name:i};let s=a.getDefinition(e.name);return s&&nc(s)>0?Vl(i,o,nc(s),e.location):{kind:`Apply`,operator:i,args:Bl(o,e.location),location:e.location}}if(e.kind===`Apply`&&s(e.operator)){let n=e.args.map(i),s=a.substitutions.get(e.operator),c=a.substitutions.size>0||o.length>0||pl.has(e),l=e=>(c&&pl.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let t=s.kind===`Identifier`?s.name:s.operator;return l({...e,operator:t,args:n,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...e,operator:s.operator,args:[...s.args,...n],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Cl,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...e,operator:Cl,args:n,resolution:Ys},location:e.location};if(s)throw new r(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=Hl(t,e.operator);return u===void 0?l({...e,args:n}):{...e,operator:u,args:[...Bl(o,e.location),...n]}}if(e.kind===`OperatorReference`&&s(e.operator)){let n=Hl(t,e.operator);if(n===void 0)return e;let r=a.getDefinition(e.operator);return o.length>0&&r?Vl(n,o,nc(r),e.location):{...e,operator:n}}let l=Ol(t),u=Sl(e,(e,r)=>r.length===0?i(e):Ul(e,t,kl(n,r,l)));return Nl(u,n,l)},Wl=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:zl(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Gl=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=Ol(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=Ml(xl(i,(e,t)=>Ul(e,s,kl(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(([e,t])=>({kind:`Operator`,name:e,params:[],body:t,isLocal:!0,isRecursive:!1,location:t.location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&ml.set(l,[u,...ml.get(i.body)??[]]),Wl({...c,body:l},r.params,i.location)}):t},Kl=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Dl(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>Hl(i,e)??e,getQualifiedKey:t=>{let n=Hl(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Wl(r,e.params,r.location)):t}}},ql=e=>e.kind===`Let`&&e.instances!==void 0||gt(e).some(ql),Jl=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Sl(e,e=>Jl(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>tc(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},Yl=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Xl=(e,t)=>e.definitions.some(e=>ql(e.body))||e.assumptions.some(e=>ql(e.expression))||e.theorems.some(e=>{let t=Yl(e);return t!==void 0&&ql(t)})?{...e,definitions:e.definitions.map(e=>xl(e,e=>Jl(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Jl(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Yl(e);return n===void 0?e:{...e,statement:Jl(n,t,[])}})}:e,Zl=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),Ql={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},$l=(e,t)=>{let n=Ql[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},eu=(e,t)=>`${e}${t}`,tu=(e,t,n)=>`${e}${t}${n}`,nu=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},ru=(e,t,n)=>`${e},${t},${n}`,iu=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),au=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),ou=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),su=(e,t,n,r)=>({...iu(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),cu=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,lu=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,uu=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{...su(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),du=su(`$Set`,0,[2],[1]),fu=su(`$Junction`,0,[3],[1]),pu=su(`$Choose`,0,[2],[1]),mu=su(`$Function`,0,[3],[1]),hu=su(`$FcnApply`,0,[2,2],[1,1]),gu=su(`$RcdSelect`,0,[2,0],[1,1]),_u=su(`'`,2,[1],[0]),vu=su(`ENABLED`,1,[2],[0]),yu=su(`[]`,3,[3],[0]),bu=su(`$SquareAct`,2,[2,1],[0,0]),xu=su(`$WF`,3,[1,2],[0,0]),Su=su(`$TemporalExists`,3,[3],[0]),Cu=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),wu=e=>e.map(e=>({name:e,arity:0})),Tu=(e,t)=>t.location.range?a(`${e}.`,t.location.range):new r(`${e} at line ${t.location.line}, column ${t.location.column}`),Eu=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Du=e=>e.kind!==`Let`&&e.kind!==`Label`,Ou=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:g(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=g(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=uu.get(t)??Zl.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},i=(e,t,n)=>{let r=iu(Math.max(t,...n.map(e=>e.data.level)));return r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(tu(e,n,t))}),t.data.constraints.forEach((e,t)=>au(r.constraints,t,e)),ou(r.argConstraints,eu(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>ou(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},a=(e,t,n=[],i=[])=>{let a=e=>i.includes(e);if(t.forEach((t,n)=>{if(!(t.operator||t.declared)&&t.data.level>cu(e,n))throw new r(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new r(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let o=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},s=(t,n,r)=>e.conditions.has(ru(t,n,r)),c=iu(Math.max(e.level,...t.filter((t,n)=>lu(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>c.params.add(e)),t.forEach((t,n)=>{lu(e,n)===1&&t.data.params.forEach(e=>c.params.add(e))}),n.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),e.constraints.forEach((e,t)=>au(c.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||au(c.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>au(c.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{a(t)||au(c.constraints,t,cu(e,n))})),t.forEach((e,n)=>{let r=e.operator;r&&t.forEach((e,t)=>r.formals.forEach((i,a)=>{s(n,t,a)&&e.data.params.forEach(e=>au(c.constraints,e,cu(r,a)))}))}),e.argParams.forEach(e=>{let t=nu(e),n=o(t.operator)?.operator;n&&au(c.constraints,t.param,cu(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>ou(c.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>ou(c.argConstraints,eu(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&ou(c.argConstraints,eu(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=nu(e),n=o(t.operator);n&&ou(c.argConstraints,eu(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{a(nu(e).param)||c.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),e.argParams.forEach(e=>{let t=nu(e),n=o(t.operator);if(n)n.declared&&c.argParams.add(tu(n.declared.name,t.index,t.param));else{let n=o(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(tu(t.operator,t.index,e)))}}),t.forEach((e,n)=>{let r=e.declared;r&&t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{s(n,t,a)&&e.data.params.forEach(e=>c.argParams.add(tu(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`){let n=te(`LAMBDA`,wu(e.params),e.body,t);return{data:n,operator:n}}let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=iu();return e.params.add(r),{data:e,declared:{name:r,arity:i.arity}}}if(e.kind===`OperatorReference`)return{data:iu()}}return{data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=Cu(n,wu(i));return a(e,s(t,o),r.map(e=>m(e,n)),i)},l=(e,t)=>e.kind===`Declared`?i(e.name,e.level,t):a(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw Tu(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw Tu(`Action used where only temporal formula or state predicate allowed`,e);Eu.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Du(n)&&n.kind!==r)throw Tu(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=g(e,n);t.constraints.forEach((e,t)=>au(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>ou(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof r)||t.sany?t:Tu(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return iu();case`Identifier`:return l(n(e.name,t),[]);case`Apply`:{let r=s(e.args,t);return d(e,r),l(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(fu,n)}case`Prime`:case`Unchanged`:return c(_u,[e.expression],t);case`Enabled`:return c(vu,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(yu,[n])}case`If`:return c(fu,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(fu,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=c(fu,[e.body],t,e.bounds.map(e=>e.set),mc(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Tu(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?Su:fu,[e.body],t,[],e.names);case`Choose`:return c(pu,[e.body],t,e.set?[e.set]:[],pc(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(du,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(du,[e.predicate],t,[e.bound.set],pc(e.bound.pattern));case`SetMap`:return c(du,[e.expression],t,e.bounds.map(e=>e.set),mc(e.bounds));case`FunctionConstruction`:return c(mu,[e.body],t,e.bounds.map(e=>e.set),mc(e.bounds));case`Record`:return c(mu,e.fields.map(e=>e.value),t);case`RecordSet`:return c(du,e.fields.map(e=>e.value),t);case`Except`:return c(du,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(hu,[o(e.function,t),e.args.length===1?o(e.args[0],t):{data:c(du,e.args,t)}]);case`Bracket`:return iu();case`FieldAccess`:return a(gu,[o(e.record,t),{data:iu()}]);case`BoxAction`:case`AngleAction`:return c(bu,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(xu,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return iu()}},ee=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>ee(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return gt(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,Cu(t,wu(e.names))),i;default:return Sl(e,(e,n)=>(a(e,r,Cu(t,wu(n))),e)),i}},te=(e,t,n,r)=>{let i=Cu(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=ee(n,i),c={...iu(a.level),name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get(eu(e.name,n))??0)),conditions:new Set(t.flatMap((e,n)=>t.flatMap((t,r)=>Array.from({length:e.arity},(e,t)=>t).filter(n=>a.argParams.has(tu(e.name,n,t.name))).map(e=>ru(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(nu(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=nu(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},g=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...iu(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=te(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:g,toOperand:o}},ku=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?ku(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=iu(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>au(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>ou(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},Au=(e,t,n,r)=>{let i=Ou(t),a=e=>Math.max(0,...e.map(e=>i.analyze(e,/* @__PURE__ */ new Map).level)),o=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?a([t.expression]):t.kind===`Witness`?a(t.expressions):t.kind===`Take`?a(t.bounds.map(e=>e.set)):t.kind===`Pick`?a([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?ku(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=h(e.statement),n=()=>o(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...s(e.proof)]:e.body.kind===`Qed`?s(e.proof):[]}):[],c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>o(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>a([e.set])!==0).flatMap(e=>e.set.location.range?[{location:h(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...c(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[],l=dl([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>i.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?ku(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...c(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw ae(n)}})),...n],r);if(l.length>0)throw ae(l,!1,void 0,r)},ju=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),Mu=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Nu=/* @__PURE__ */ new Set([...ju,...Mu,`Enabled`]),Pu=/* @__PURE__ */ new Set([`~>`,`-+->`]),Fu=/* @__PURE__ */ new Set([...Pu,`\\cdot`]),Iu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Lu=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),Ru=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},zu=(e,t)=>Iu.has(e)||t.builtins.get(e)?.isStateLevel===!0,Bu=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(ju.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(Mu.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&Pu.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(Nu.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&Fu.has(e.operator))&&(r[0]|=1),Nu.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=Ru(e);if(u!==void 0&&!k(e)){let e=t.substitutions.get(u)??u,n=t.definitions.get(e),a=t.constants.has(u),o=t.variableIndex.get(u);if((o!==void 0||t.builtins.get(u)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=1),o!==void 0&&(l&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:l});else{zu(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),Lu.has(u)&&(r[0]|=8),!a&&zu(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}gt(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},Vu=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],Hu=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},Uu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),Wu=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=Bu(Vu(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&14,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=Hu(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=Hu(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!Uu(t[e],l[e*r])))),p=Hu(a,r,f,14);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|d[t]&224|p[t]&14:e),words:r}},Gu=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?Ku(Vu(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},Ku=(e,t)=>{let n=t.facts.words,r=Bu(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=Gu(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}Uu(e.callee,r[0])||(i[0]|=r[0]&14)}),i},qu=(e,t)=>!(Gu(e,t)[0]&1),Ju={any:2,repeated:4,streamed:8},Yu=(e,t,n=`any`)=>(Gu(e,t)[0]&Ju[n])!==0,Xu=(e,t)=>{let n=Gu(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},Zu=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},Qu=(e,t)=>{let n=Ku([e],t);return n[0]&16?void 0:Zu(n)},$u=(e,t)=>!!(Ku([e],t)[0]&1),ed=(e,t,n)=>new c(`Applying ${e} to the following value,\nwhich is not ${t}:\n${I(n)}`),td=e=>ln(e)?F(e):void 0,nd=`a function with a finite domain`,rd=(e,t,n)=>{let r=L(e,t,n),i=td(r);if(!i)throw ed(n,nd,r);return i},id=(e,t)=>{let n=L(e,1,t),r=td(n),i=r&&cd(r,L(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw ts(`second`,t,`bag`,n);return i},ad=(e,t,n)=>{let r=t[n];if(!r||!sd(r))throw ts(n===0?`first`:`second`,`(+)`,`bag`,L(e,n,`(+)`));return r},od=(e,t)=>{if(!j(e)||!M(e))throw t();return N(e).elements},sd=e=>e.range.every(e=>typeof e==`number`&&e>0),cd=(e,t)=>{let n=e.domain.findIndex(e=>Kr(t,e));return n===-1?void 0:e.range[n]},ld=e=>{if(typeof e==`number`)return e;let t=`tlc2.value.impl.${gs(e)}`;throw new _(`class ${t} cannot be cast to class tlc2.value.impl.IntValue (${t} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},ud=(e,t)=>{let n=ld(e)+ld(t);if(us(n))throw ds(`${e}+${t}`);return n},dd=(e,t,n)=>{let r=ld(e.range[t]),i=cd(n,e.domain[t]);if(i===void 0)return r;let a=r-ld(i);if(us(a))throw ds(`${r}-${i}`);return a},fd=(e,t,n,r=e.length)=>{let i=e.slice(0,r).find(e=>Kr(t,e[0]));i?i[1]=ud(i[1],n):e.push([t,n])},pd=e=>e.domain.map((t,n)=>[t,e.range[n]]),md=tr([],[]),hd=e=>[os(`EmptyBag`,md),R(`IsABag`,1,e=>{let t=td(L(e,0,`IsABag`));return t!==void 0&&sd(t)}),R(`BagCardinality`,1,e=>{let t=L(e,0,`BagCardinality`);return rd(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw ed(`BagCardinality`,`a bag`,t);return ud(e,n)},0)}),R(`BagIn`,2,e=>{let t=id(e,`BagIn`);return t!==void 0&&t>0}),R(`CopiesIn`,2,e=>id(e,`CopiesIn`)??0),R(`\\oplus`,2,e=>{let t=[0,1].map(t=>td(L(e,t,`(+)`))),n=ad(e,t,0),r=ad(e,t,1),i=pd(n);return r.domain.forEach((e,t)=>fd(i,e,r.range[t],n.domain.length)),ti(i)}),R(`\\ominus`,2,e=>{let t=L(e,0,`(-)`),n=L(e,1,`(-)`),r=td(t),i=td(n);if(!r)throw ts(`first`,`(-)`,`bag`,t);if(!i)throw ts(`second`,`(-)`,`bag`,n);return ti(r.domain.flatMap((e,t)=>{let n=dd(r,t,i);return n>0?[[e,n]]:[]}))}),R(`BagUnion`,1,e=>{let t=L(e,0,`BagUnion`),n=od(t,()=>ed(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??md;let r=e=>{let n=td(e);if(!n)throw new c(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${I(t)}`);return n},i=pd(r(n[0]));return n.slice(1).forEach(e=>{let t=r(e);t.domain.forEach((e,n)=>fd(i,e,t.range[n]))}),ti(i)}),R(`\\sqsubseteq`,2,e=>{let t=L(e,0,`\\sqsubseteq`),n=L(e,1,`\\sqsubseteq`),r=td(t),i=td(n);if(!r)throw ed(`\\sqsubseteq`,nd,t);if(!i)throw ed(`\\sqsubseteq`,nd,n);return r.domain.every((e,t)=>{let n=cd(i,e);return ld(r.range[t])<=(n===void 0?0:ld(n))})}),ss(`BagOfAll`,2,e=>{let t=as(e,0,`BagOfAll`),n=L(e,1,`BagOfAll`),r=td(n);if(!r)throw ts(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[];return r.domain.forEach((e,n)=>fd(i,t.call([e]),r.range[n])),ti(i)}),R(`SubBag`,1,t=>{let n=L(t,0,`SubBag`);if(!ln(n))throw new _(`Attempted to apply the operator DOMAIN to a non-function\n(${_s(n)})\nline 106, col 58 to line 106, col 65 of module Bags`);let r=F(n),i=N(Xr(r.range)).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new _(`Attempted to apply a function to ${I(r)}, which is not in its domain`);return Yr(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>tr(e.map(e=>e[0]),e.map(e=>e[1]))))}),R(`BagToSet`,1,e=>fa(rd(e,0,`BagToSet`))),R(`SetToBag`,1,e=>{let t=L(e,0,`SetToBag`),n=od(t,()=>ed(`BagToSet`,nd,t));return tr([...n],n.map(()=>1))})],gd={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},B={none:0,beginObject:1,endObject:2,beginArray:3,endArray:4,true:5,false:6,null:7,singleQuoted:8,doubleQuoted:9,unquoted:10,singleQuotedName:12,doubleQuotedName:13,unquotedName:14,number:16,eof:17},_d={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},vd=[{lower:`true`,upper:`TRUE`,token:B.true},{lower:`false`,upper:`FALSE`,token:B.false},{lower:`null`,upper:`NULL`,token:B.null}],yd=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
|
|
79
|
+
`],[`r`,`\r`],[`f`,`\f`]]),bd=1024,xd=e=>{let t=+!!e.startsWith(``),n=t,r=0,i=t,a=!0,o=B.none,s=0,c=[gd.emptyDocument],l=[void 0],u=[0],d=()=>`$${c.map((e,t)=>e===gd.emptyArray||e===gd.nonemptyArray?`[${u[t]}]`:e===gd.emptyDocument||e===gd.nonemptyDocument?``:`.${l[t]??``}`).join(``)}`,f=()=>` at line ${r+1} column ${n-i+1} path ${d()}`,p=e=>new _(`com.google.gson.stream.MalformedJsonException: ${e}${f()}
|
|
80
|
+
See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`),m=()=>new _(`java.io.EOFException: End of input${f()}`),h=()=>{if(!a)throw p(`Use JsonReader.setStrictness(Strictness.LENIENT) to accept malformed JSON`)},ee=e=>`/\\;#=`.includes(e)?(h(),!1):!`{}[]:, \f\r
|
|
81
|
+
`.includes(e),te=()=>{for(;n<e.length;){let t=e[n++];if(t===`
|
|
82
|
+
`){r++,i=n;return}if(t===`\r`)return}},g=t=>{for(;n+t.length<=e.length;n++)if(e[n]===`
|
|
83
|
+
`)r++,i=n+1;else if(e.startsWith(t,n))return!0;return!1},ne=()=>{for(;n<e.length;){let t=e[n++];if(t===`
|
|
84
|
+
`)r++,i=n;else if(t===`/`){if(n===e.length)return t;h();let r=e[n];if(r!==`*`&&r!==`/`)return t;if(n++,r===`/`)te();else if(g(`*/`))n+=2;else throw p(`Unterminated comment`)}else if(t===`#`)h(),te();else if(t!==` `&&t!==`\r`&&t!==` `)return t}},v=()=>{let e=ne();if(e===void 0)throw m();return e},re=()=>{let t=vd.find(t=>e[n]===t.lower[0]||e[n]===t.upper[0]);if(!t)return B.none;let r=t.lower.length;for(let i=0;i<r;i++){let r=e[n+i];if(r!==t.lower[i]&&r!==t.upper[i])return B.none}return n+r<e.length&&ee(e[n+r])?B.none:(n+=r,t.token)},y=()=>{let t=_d.none,r=!1,i=0;for(;n+i<e.length;i++){if(i===bd)return B.none;let a=e[n+i];if(a===`-`){if(t===_d.none)t=_d.sign;else if(t===_d.exponentE)t=_d.exponentSign;else return B.none}else if(a===`+`){if(t!==_d.exponentE)return B.none;t=_d.exponentSign}else if(a===`e`||a===`E`){if(t!==_d.digit&&t!==_d.fractionDigit)return B.none;t=_d.exponentE}else if(a===`.`){if(t!==_d.digit)return B.none;t=_d.decimal}else if(a<`0`||a>`9`){if(ee(a))return B.none;break}else if(t===_d.sign||t===_d.none)r=a===`0`,t=_d.digit;else if(t===_d.digit){if(r)return B.none}else t===_d.decimal?t=_d.fractionDigit:(t===_d.exponentE||t===_d.exponentSign)&&(t=_d.exponentDigit)}return i===bd||t!==_d.digit&&t!==_d.fractionDigit&&t!==_d.exponentDigit?B.none:(s=i,B.number)},ie=()=>{let t=c.length-1,r=c[t];if(r===gd.emptyArray)c[t]=gd.nonemptyArray;else if(r===gd.nonemptyArray){let e=v();if(e===`]`)return B.endArray;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated array`)}else if(r===gd.emptyObject||r===gd.nonemptyObject){if(c[t]=gd.danglingName,r===gd.nonemptyObject){let e=v();if(e===`}`)return B.endObject;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated object`)}let e=v();if(e===`"`)return B.doubleQuotedName;if(e===`'`)return h(),B.singleQuotedName;if(e===`}`){if(r!==gd.nonemptyObject)return B.endObject;throw p(`Expected name`)}if(h(),n--,ee(e))return B.unquotedName;throw p(`Expected name`)}else if(r===gd.danglingName){c[t]=gd.nonemptyObject;let r=v();if(r===`=`)h(),e[n]===`>`&&n++;else if(r!==`:`)throw p(`Expected ':'`)}else if(r===gd.emptyDocument){if(ne()===void 0)return B.eof;n--,e.startsWith(`)]}'
|
|
85
|
+
`,n)&&(n+=5),c[t]=gd.nonemptyDocument}else if(r===gd.nonemptyDocument){if(ne()===void 0)return B.eof;h(),n--}let i=ne();if(i===void 0){if(r===gd.emptyDocument)return B.eof;throw m()}if(i===`]`&&r===gd.emptyArray)return B.endArray;if(i===`]`||i===`;`||i===`,`){if(r!==gd.emptyArray&&r!==gd.nonemptyArray)throw p(`Unexpected value`);return h(),n--,B.null}if(i===`'`)return h(),B.singleQuoted;if(i===`"`)return B.doubleQuoted;if(i===`[`)return B.beginArray;if(i===`{`)return B.beginObject;n--;let a=re();if(a!==B.none)return a;let o=y();if(o!==B.none)return o;if(!ee(e[n]))throw p(`Expected value`);return h(),B.unquoted},ae=()=>(o===B.none&&(o=ie()),o),b=()=>{if(n===e.length)throw p(`Unterminated escape sequence`);let t=e[n++];if(t===`u`){if(n+4>e.length)throw p(`Unterminated escape sequence`);let t=e.slice(n,n+4);if(!/^[\da-fA-F]{4}$/.test(t))throw p(`Malformed Unicode escape \\u${t}`);return n+=4,String.fromCharCode(Number.parseInt(t,16))}let a=yd.get(t);if(a!==void 0)return a;if(t===`
|
|
86
|
+
`)return r++,i=n,t;if(`'"\\/`.includes(t))return t;throw p(`Invalid escape sequence`)},oe=t=>{let a=``,o=n;for(;n<e.length;){let s=e[n++];if(s===t)return a+e.slice(o,n-1);s===`\\`?(a+=e.slice(o,n-1)+b(),o=n):s===`
|
|
87
|
+
`&&(r++,i=n)}throw p(`Unterminated string`)},se=()=>{let t=n;for(;n<e.length&&ee(e[n]);)n++;return e.slice(t,n)},ce=e=>{if(c.length-1>=255)throw new _(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${f()}`);c.push(e),l.push(void 0),u.push(0),o=B.none},le=()=>{c.pop(),l.pop(),u.pop(),u[c.length-1]++,o=B.none},ue=()=>{let e=ae();return e!==B.endObject&&e!==B.endArray&&e!==B.eof},de=()=>{let e=ae(),t=e===B.unquotedName?se():oe(e===B.singleQuotedName?`'`:`"`);return o=B.none,l[c.length-1]=t,t},x=t=>t===B.true||t===B.false?t===B.true:t===B.null?null:t===B.number?(n+=s,{literal:e.slice(n-s,n)}):t===B.unquoted?se():oe(t===B.singleQuoted?`'`:`"`),S=()=>{let e=ae();if(e===B.beginArray){ce(gd.emptyArray);let e=[];for(;ue();)e.push(S());return le(),e}if(e===B.beginObject){ce(gd.emptyObject);let e=/* @__PURE__ */ new Map;for(;ue();)e.set(de(),S());return le(),e}let t=x(e);return o=B.none,u[c.length-1]++,t};if(ae()===B.eof)return null;let C=S();return a=!1,C!==null&&ae(),C},Sd=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),Cd=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),wd=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),Td=e=>{if(!ln(e))return;let t=F(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?pi(n):void 0},Ed=(e,t)=>{let n=`tlc2.value.impl.${gs(e)}`,r=`tlc2.value.impl.${t}`;return new _(`class ${n} cannot be cast to class ${r} (${n} and ${r} are in unnamed module of loader 'app')`)},Dd=e=>new _(`Cannot convert value: unsupported value type tlc2.value.impl.${gs(e)}`),Od=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),kd=e=>`[${e.map(Nd).join(`,`)}]`,Ad=e=>`{${vn(e).map(e=>`${Od(typeof e[0]==`string`?e[0]:I(e[0]))}:${Nd(e[1])}`).join(`,`)}}`,jd=e=>{let t=F(e),n=Hi(t);return n?kd(n):Ad(t)},Md=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,Nd=e=>{if(typeof e==`string`)return Od(e);if(typeof e!=`object`)return String(e);if(e.kind===`ModelValue`)return Od(e.name);let t=gs(e);if(t===`RecordValue`)return Ad(F(e));if(t===`TupleValue`)return kd(F(e).range);if(Md(t))return jd(e);if(hi(e))return kd(N(e).elements);throw Dd(e)},Pd=e=>{let t=gs(e);if(t===`TupleValue`)return kd(F(e).range);if(Md(t))return jd(e);if(hi(e))return kd(N(e).elements);throw Dd(e)},Fd=e=>{let t=gs(e);if(t===`RecordValue`)return Ad(F(e));if(t===`TupleValue`)return`{${F(e).range.map((e,t)=>`"${t}":${Nd(e)}`).join(`,`)}}`;if(Md(t))return jd(e);throw Dd(e)},Id=e=>{if(e===null)throw new _(`Cannot convert value: unsupported JSON value null`);if(typeof e==`boolean`)return e;if(typeof e==`string`)return Rn(e);if(Array.isArray(e))return fi(e.map(Id));if(e instanceof Map)return pi([...e].map(e=>[Rn(e[0]),Id(e[1])]));let t=Number(e.literal);if(!/^-?\d+$/.test(e.literal)||us(t))throw new _(`Cannot convert value: expected a 32-bit integer JSON number, but found ${e.literal}`);return t||0},Ld=e=>{if(typeof e!=`string`)throw new _(`Cannot cast tlc2.value.impl.${gs(e)} to tlc2.value.impl.StringValue`);return e},Rd=(e,t)=>{let n=ua(e,t);if(typeof n!=`string`)throw Ed(n,`StringValue`);return n},zd=e=>{if(!Cd.has(e.toLowerCase()))throw wd.has(e.toLowerCase())?new t(`IOUtils!Serialize does not support the charset ${e}`):new _(/^[a-zA-Z\d][\w.:+-]*$/.test(e)?`java.nio.charset.UnsupportedCharsetException: ${e}`:`java.nio.charset.IllegalCharsetNameException: ${e}`)},Bd=(e,n,r,i)=>{let a=r.find(e=>!Sd.has(e));if(a!==void 0)throw new _(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${a}`);if(r.includes(`READ`))throw new _(`java.lang.IllegalArgumentException: READ not allowed`);let o=new Set(r.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:r);if(o.has(`APPEND`)&&o.has(`TRUNCATE_EXISTING`))throw new _(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(o.has(`DELETE_ON_CLOSE`))throw new t(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let s=e.readFile?.(n);if(s===void 0&&!o.has(`CREATE`)&&!o.has(`CREATE_NEW`))throw new _(`java.nio.file.NoSuchFileException: ${n}`);if(s!==void 0&&o.has(`CREATE_NEW`))throw new _(`java.nio.file.FileAlreadyExistsException: ${n}`);s===void 0||o.has(`TRUNCATE_EXISTING`)?e.writeFile?.(n,i):e.writeFile?.(n,o.has(`APPEND`)?s+i:i+s.slice(i.length))},Vd=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},Hd=(e,t)=>{let n=e.readFile?.(t);if(n===void 0)throw new _(`${t} (No such file or directory)`);return n},Ud=e=>[bs(cs(`ToJson`,1,e=>Rn(Nd(L(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),bs(cs(`ToJsonArray`,1,e=>Rn(Pd(L(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),bs(cs(`ToJsonObject`,1,e=>Rn(Fd(L(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),bs(cs(`JsonSerialize`,2,t=>{let n=Ld(L(t,0,`JsonSerialize`)),r=L(t,1,`JsonSerialize`);if(!Hi(r)&&!Td(r))throw ts(`second`,`JsonSerialize`,`sequence or record`,r);return Vd(e,n),e.writeFile?.(n,Nd(r)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),bs(cs(`ndJsonSerialize`,2,t=>{let n=Ld(L(t,0,`ndJsonSerialize`)),r=L(t,1,`ndJsonSerialize`),i=Hi(r);if(!i)throw ts(`second`,`ndJsonSerialize`,`sequence`,r);return Vd(e,n),e.writeFile?.(n,i.map(e=>`${Nd(e)}\n`).join(``)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),bs(cs(`JsonDeserialize`,1,t=>Id(xd(Hd(e,Ld(L(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),bs(cs(`ndJsonDeserialize`,1,t=>fi(Hd(e,Ld(L(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>Id(xd(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],Wd=(e,t)=>[bs(Es(`Serialize`,3,(n,r)=>{let i=Ds(n,2,`Serialize`)(),a=Td(i);if(!a)throw ts(`third`,`ndJsonSerialize`,`sequence`,i);if(Rd(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Ds(n,0,`Serialize`)(),s=Hi(o);if(!s)throw ts(`first`,`Serialize`,`sequence`,o);let c=Ds(n,1,`Serialize`)();if(typeof c!=`string`)throw ts(`second`,`ndJsonSerialize`,`sequence`,c);let l=ua(a,`openOptions`);if(gs(l)!==`TupleValue`)throw Ed(l,`TupleValue`);let u=Rd(a,`charset`),d=F(l).range.map(e=>{if(typeof e!=`string`)throw Ed(e,`StringValue`);return e});return zd(u),Bd(e,c,d,s.map(e=>`${Nd(e)}\n`).join(``)),!0}),`public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`)],Gd={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},Kd=e=>{let t=[],n={objects:/* @__PURE__ */ new Map,names:/* @__PURE__ */ new Map,count:0},r=Qn(),i=e=>t.push(e&255),a=e=>{i(e>>8),i(e)},o=e=>{a(e>>16),a(e)},s=e=>e>32767?o(-e):a(e),c=e=>{i(Gd.string),o(0),o(-1),o(e.length),e.split(``).forEach(e=>i(e.charCodeAt(0)))},l=e=>{i(Gd.handle),s(e)},u=e=>{if(typeof e==`boolean`){i(Gd.boolean),i(+!!e);return}if(typeof e==`number`){i(Gd.integer),o(e);return}if(typeof e==`string`){n.count++,c(e);return}if(e.kind===`ModelValue`){i(Gd.modelValue),a(r.indexOf(e));return}if(e.kind===`Interval`){i(Gd.interval),o(e.low),o(e.high);return}let t=n.objects.get(e);if(t!==void 0){l(t);return}if(n.objects.set(e,n.count++),j(e)){let t=N(e).elements;i(Gd.set),o(t.length),t.forEach(u);return}let d=F(e),f=ir(e);f===`tuple`?(i(Gd.tuple),s(d.range.length),d.range.forEach(u)):f===`record`?(i(Gd.record),o(d.domain.length),d.domain.forEach((e,t)=>{let r=String(e),i=n.names.get(r);i===void 0?(n.names.set(r,n.count++),c(r)):l(i),u(d.range[t])})):(i(Gd.function),s(d.domain.length),i(1),d.domain.forEach((e,t)=>{u(e),u(d.range[t])}))};return u(e),de(Uint8Array.from(t))},qd=e=>[bs(cs(`_TLCTraceSerialize`,2,t=>{let n=Ld(L(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,Kd(L(t,0,`_TLCTraceSerialize`))),!0}),`public static final tlc2.value.IValue tlc2.module._TLCTrace.ioSerialize(tlc2.value.IValue,tlc2.value.impl.StringValue) throws java.io.IOException`)],Jd=25214903917n,Yd=(1n<<48n)-1n,Xd=2147483647,Zd=e=>{let t={value:(BigInt.asUintN(64,e)^Jd)&Yd},n=e=>(t.value=t.value*Jd+11n&Yd,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Jd)&Yd},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=Xd)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Qd=[],$d=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},ef=()=>{for(let e=1277011;Qd.length<1341;e++)$d(e)&&Qd.push(e);return Qd},tf=e=>{let t=ef(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},nf=e=>{let t=[],n={value:e};for(let e=2;e*e<=n.value;e++)for(;n.value%e===0;)t.push(e),n.value/=e;return n.value>1&&t.push(n.value),t},rf=e=>{for(let t=Math.max(e,9);;t++){let e=nf(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},af=(e,t,n)=>{if(t<=0)return[];let r=rf(t),i={index:BigInt(n.nextInt(t))},a=BigInt(tf(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},of=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Xd),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},sf=(1n<<63n)-1n-24n,cf=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(sf*BigInt(n)+i)%t;return r<0n?r+t:r})},lf=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,uf=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=ui(e.domain),n=N(e.range).elements;return{lists:t.map(()=>n),create:e=>tr(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>N(e).elements),create:t=>pi(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>N(e).elements),create:fi}}},df=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,ff=(e,t,n,r)=>{if(P(t))return[];let i=r===`1.7.4`?of:af;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=df(t,r)?void 0:uf(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Xd)?cf(e,t,n):i(e,Number(t),n)).map(e=>a.create(lf(a.lists,e)))}let o=N(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},pf=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...ns(e.domain,`RandomElement`,e).elements];return tr(n,n.map(()=>pf(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return pi(e.names.map((n,r)=>[n,pf(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return fi(e.factors.map(e=>pf(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new _(`Attempted to retrieve out-of-bounds element from the interval value ${I(e)}.`);return e.low+r}let n=ns(e,`RandomElement`).elements,r=Math.floor(t.nextDouble()*n.length);if(r>=n.length)throw new _(`Index ${r} out of bounds for length ${n.length}`);return n[r]},mf=(e,t,n)=>{if(typeof e!=`number`||e<0)throw ts(t,n,`nonnegative integer`,e);return e},hf=(e,t,n,r)=>Yr(Array.from({length:t},()=>Yr(e.filter(()=>r.nextDouble()<n)))),gf=(e,t)=>{let n=`RandomSetOfSubsets`,r=mf(L(e,0,n),`first`,n),i=mf(L(e,1,n),`second`,n),a=L(e,2,n);if(!j(a)||!M(a))throw ts(`third`,n,`finite set`,a);let o=N(a).elements;if(o.length<31&&r>2**o.length)throw ts(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw ts(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return hf(o,r,o.length===0?0:i/o.length,t.getRandom())},_f=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,vf=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,yf=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(_f.test(t))return Number(t.replace(/[fFdD]$/,``));let n=vf.exec(t);if(!n)return;let r=n[3]??``,i=`${n[2]}${r}`;if(i===``)return;let a=Number.parseInt(i,16)*2**(Number(n[4])-4*r.length);return n[1]===`-`?-a:a},bf=e=>R(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=mf(L(t,0,n),`first`,n),i=L(t,1,n);if(typeof i!=`string`)throw ts(`second`,n,`string literal representing a probability`,i);let a=yf(i);if(a===void 0||a<0||a>1)throw ts(`second`,n,`string literal does not represent a parsable probability`,i);let o=L(t,2,n);if(!j(o)||Vn(o)||!zi(o))throw ts(`third`,n,`finite set`,o);let s=Li(o);if(32-Math.clz32(r)>s&&r>1<<s)throw ts(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return hf(N(o).elements,r,a,e.getRandom())}),xf=e=>[bs(R(`RandomSubset`,2,t=>{let n=L(t,0,`RandomSubset`);if(typeof n!=`number`||n<0)throw ts(`first`,`RandomSubset`,`nonnegative integer`,n);let r=L(t,1,`RandomSubset`);if(!hi(r)||!zi(r))throw ts(`second`,`RandomSubset`,`a finite set`,r);let i=df(r,e.version);if(i&&i.reduce((e,t)=>e*N(t).elements.length,1)>nn())throw new _(rn());return Yr(ff(n,r,e.getRandom(),e.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),R(`RandomSetOfSubsets`,3,t=>gf(t,e)),R(`TestRandomSetOfSubsets`,3,t=>fi(Array.from({length:5},()=>N(gf(t,e)).elements.length)))],Sf=(e,t=0n)=>{let n=Zd(t),r={random:Zd(t),seededState:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>pi([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,getSuccessorAction:()=>void 0,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:mo,getSimulationValue:void 0,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.seededState&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.seededState=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},Cf=e=>ti([...e.possibleCounts].map(([e,t])=>[e,t])),wf=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Cf(e)]]),Tf=e=>pi([[`name`,e??`UnnamedAction`],[`location`,pi([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),Ef=/* @__PURE__ */ new WeakSet,Df=(e,t)=>{let n=pi([[`action`,Yr(e)],[`state`,Yr(t)]]);return Ef.add(n),n},Of=(e,t,n)=>{let r=e.map((e,t)=>fi([t+1,pi(Object.entries(e))])),i=r.slice(1).map((e,n)=>fi([r[n],t[n],e])),a=n?[fi([r[r.length-1],n.action,r[n.start]])]:[];return Df([...i,...a],r)},kf=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return wf(e).get(t)},Af=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0||!e.pause)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),I(r));else throw new c(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${I(n)}`)},jf=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:V(e),Mf=e=>e.every(e=>e!==void 0),Nf=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!k(e);if(i&&t.variableIndex.has(r))return 1;let a=gt(e).map(e=>Nf(e,t,n)),o=i?og(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(Nf(o.body,t,n))),Math.max(0,...a)},Pf=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[Es(`AssertError`,2,e=>{let n=as(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw new _(`In computing AssertError, a non-string expression (${jf(n)}) was used as the err of an AssertError(err, exp).`);let r=Ds(e,0,`AssertError`)();try{Ds(e,1,`AssertError`)()}catch(e){if(e instanceof _)return It(e.message,t.isTool)===r;throw e}return!1}),cs(`TLCGetOrDefault`,2,e=>{let n=L(e,0,`TLCGetOrDefault`);return kf(t,n)??L(e,1,`TLCGetOrDefault`)}),cs(`Trace`,0,(e,n)=>{let r=n?.environment.variables??[],i=n?.state??r.map(()=>void 0);if(!n||!Mf(i)){let e=r.filter((e,t)=>i[t]===void 0);throw new _(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return n.state?fi(t.getBehavior(i).map(e=>{let r=n.environment.variables.map((t,n)=>[t,e[n]]),i=t.getSimulationValue?.(`action`,e);return pi(i===void 0?r:[[`_action`,i],...r])})):fi([pi([])])}),cs(`CounterExample`,0,()=>t.counterExample??Df([],[])),R(`ToTrace`,1,e=>{let t=L(e,0,`ToTrace`);if(typeof t!=`object`||!Ef.has(t))throw new c(`The argument of ToTrace should be a CounterExample, but instead it is:\n${I(t)}`);let n=N(ua(t,`state`)).elements.map(e=>Hi(e)??[]);return fi(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),R(`TLCModelValue`,1,e=>{let t=L(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new c(`The argument of ModelValue should be a string, but instead it is:\n${I(t)}`);return Zn(t)}),Es(`TLCDefer`,1,(e,n)=>{let r=as(e,0,`TLCDefer`).expression;return n&&r&&(t.deferred=e=>{U(r,{...n,next:e})}),!0}),R(`TLCNoOp`,1,e=>L(e,0,`TLCNoOp`)),{...Es(`PickSuccessor`,1,(n,r)=>{let i=r?.next??(r?.environment.variables??[]).map(()=>void 0);if(!Mf(i)||r?.next&&t.isSeen(i))return!0;let a=as(n,0,`PickSuccessor`),o=a.call([]);if(typeof o!=`boolean`)throw new _(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${_s(o)}) was used as the condition of an IF.\n${a.expression?jf(a.expression):``}`);if(o||!r?.next||!r.state||!Mf(r.state))return!0;let s=t.getSuccessorAction(r.state,i);throw e(Tt(t.isTool,St.moduleOverrideStdout,Ct.none,`Extend behavior of length ${t.getLevel(r.state)} with a "${s?.name}" step [<Action ${s?.location.range&&h(s.location.range)}>]? (Yes/no/explored/states/diff):`)),new se}),isActionLevel:!0},Es(`TLCCache`,2,(e,r)=>{let a=as(e,0,`TLCCache`),o=ja(Ds(e,1,`TLCCache`)()),s=a.expression;if(!s||!r)return a.call([]);let c=Nf(s,r.environment,/* @__PURE__ */ new Set);if(c===2)return a.call([]);let l=c===1;if(l&&r.state&&t.getSimulationValue===void 0)return a.call([]),a.call([]);let u=l&&r.state?i(r.state):n,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=a.call([]);return d.set(o,p),p}),R(`TLCFP`,1,e=>{let t=L(e,0,`TLCFP`),n=Sa(t);if(n)throw n;return Number(BigInt.asIntN(32,mo([t])))}),Es(`TLCEvalDefinition`,1,(e,t)=>{let n=Ds(e,0,`TLCEvalDefinition`)();if(typeof n!=`string`)throw new c(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${I(n)}`);let r=t?og(n,t.environment):void 0,i=r?void 0:t?.environment.builtins.get(n);if(i?.arity===0)return i.evaluate([],t);if(!r||!t)throw new c(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${I(n)}`);if(r.kind===`Operator`&&r.params.length>0){let e=r.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new c(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${n}(${e.join(`, `)})`)}return r.kind===`Operator`?U(r.body,t):U({kind:`Identifier`,name:n,location:r.location},t)})]},Ff=(e,t)=>[cs(`_Track`,2,e=>{let n=String(L(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,L(e,0,`_Track`)===!0?r+1:r),!0}),cs(`_Counts`,0,()=>Cf(t)),cs(`_CheckName`,1,n=>{let r=String(L(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(I(Cf(t),!0)),!1)}),cs(`_PrintCounts`,0,()=>(e(I(Cf(t),!0)),!0))],If=e=>String(e).padStart(2,`0`),Lf=e=>`${e.getUTCFullYear()}.${If(e.getUTCMonth()+1)}.${If(e.getUTCDate())}.${If(e.getUTCHours())}${If(e.getUTCMinutes())}${If(e.getUTCSeconds())}`,Rf=e=>ti([...e].map(([e,t])=>[e,fi([t])])),zf=e=>rr(ni(e),`record`),Bf=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Vf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Hf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Uf=(e,t,n)=>{if(e.version===`1.7.4`?!Vf.has(t)||!e.isStarted&&Hf.has(t):!e.isStarted&&Bf.has(t))throw new c(`TLCGet(${t}) was undefined.`);let r=e.getSimulationValue?.(t,n);if(r!==void 0)return r;let i=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return i;case`stats`:return zf([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,i],[`worker`,0]]);case`config`:return zf([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,String(BigInt.asIntN(64,Xa()))],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return zf([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Rn(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Rn(Lf(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Tf(void 0);case`all`:return Rf(e.registers);case`all:named`:return Rf(wf(e))}if(t.startsWith(`s:`)){let n=wf(e).get(t);if(n===void 0)throw new c(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Rn(e.properties.get(t.slice(2))??t);throw new c(`TLCGet(${t}) was undefined.`)},Wf=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new c(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new c(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${I(t)}`);return Uf(e,t,n?.state)},Gf=e=>e.length===0?[[]]:e.flatMap((t,n)=>Gf([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Kf=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&N(e).elements.forEach(Kf),e.kind===`Function`&&e.range.forEach(Kf))},qf=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`ModelValue`:case`Function`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return F(e);default:return N(e)}},Jf=(e,t)=>[R(`Print`,2,t=>(e(Ha([L(t,0,`Print`),L(t,1,`Print`)]).map(A).join(` `)),L(t,1,`Print`))),R(`PrintT`,1,t=>(e(A(Ha([L(t,0,`PrintT`)])[0])),!0)),R(`Assert`,2,e=>{if(L(e,0,`Assert`)!==!0)throw new c(`The first argument of Assert evaluated to FALSE; the second argument was:\n${A(I(L(e,1,`Assert`)))}`,b.assertViolation);return!0}),R(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),R(`:>`,2,e=>ti([[L(e,0,`:>`),L(e,1,`:>`)]])),R(`@@`,2,e=>{let t=L(e,0,`@@`),n=L(e,1,`@@`),r=ln(t)?F(t):void 0,i=ln(n)?F(n):void 0;if(!r)throw ts(`first`,`@@`,`function`,t);if(!i)throw ts(`second`,`@@`,`function`,n);let a=_n(r),o=_n(i).filter(e=>!a.some(t=>Kr(e[0],t[0])));return ni([...a,...o])}),R(`ToString`,1,e=>Rn(I(L(e,0,`ToString`),!0))),{...Es(`TLCEval`,1,(e,t)=>{let n=qf(Ds(e,0,`TLCEval`)());return t===void 0&&Kf(n),n}),isStateLevel:!1},R(`Permutations`,1,e=>{let t=ns(L(e,0,`Permutations`),`Permutations`).elements;return Yr(Gf(t).map(e=>ti(t.map((t,n)=>[t,e[n]]))))}),ss(`SortSeq`,2,e=>{let t=L(e,0,`SortSeq`),n=Hi(t);if(!n)throw ts(`first`,`SortSeq`,`natural number`,t);let r=as(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw ts(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t={index:a.length};for(;t.index>0&&i(e,a[t.index-1]);)t.index--;a.splice(t.index,0,e)}),fi(a)}),t.version===`1.7.4`?bs({...cs(`TLCGet`,1,(e,n)=>Wf(t,L(e,0,`TLCGet`),n)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):bs(Es(`TLCGet`,1,(e,n)=>Wf(t,Ds(e,0,`TLCGet`)(),n)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),cs(`TLCSet`,2,n=>{let r=L(n,0,`TLCSet`);return Af(t,e,r,L(n,1,`TLCSet`)),!0}),os(`Any`,Gn),R(`RandomElement`,1,e=>pf(L(e,0,`RandomElement`),t.getRandom()))],Yf=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),Xf=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],Zf=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),Qf=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs.beginLine.beginColumn.endLine.endColumn.module.name.location.context.parameters._action`.split(`.`),$f=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),ep=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
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
|
-
`]]),ap=(e=`master`)=>e===`1.7.4`?ip:rp,op=(e,t)=>e.every(e=>Ki(e,t)),sp=Jr([!1,!0]);Ur(sp);const cp=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return $r(cp(e,t,r),cp(e,r,n))},lp=[`\\cup`,`\\cap`,`\\`],up=e=>typeof e==`object`&&e.kind===`MixedSet`,dp=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,fp=(e,t,n)=>{t.kind===`Interval`&&Ii(t);let r=t.kind===`Interval`?t:Hr(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return on(r,e=>{Ki(e,n)===i&&rn(a,e)}),dp(t)?$n(a):Yr(a)}if(F(t))return n;if(!sn(n))return sr({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return on(r,e=>rn(i,e)),on(n.kind===`Interval`?n:P(n).elements,e=>{Ki(e,t)||rn(i,e)}),Yr(i)},pp=(e,t)=>{let n=(t,n)=>is([Ds(t,n,e)()],0,e);return{...z(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},mp=[os(`TRUE`,!0),os(`FALSE`,!1),os(`BOOLEAN`,sp),os(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ls(`=`,Gr),ls(`#`,(e,t)=>!Gr(e,t)),z(`~`,1,e=>!is(e,0,`~`)),z(`<=>`,2,e=>is(e,0,`<=>`)===is(e,1,`<=>`)),pp(`/\\`,(e,t)=>e&&t()),pp(`\\/`,(e,t)=>e||t()),pp(`=>`,(e,t)=>!e||t()),z(`\\in`,2,e=>Ki(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!Ki(R(e,0,`\\notin`),R(e,1,`\\notin`))),ls(`\\subseteq`,(e,t)=>{if(!M(e))throw new v(`\\subseteq expects a set but received ${L(e)}`);if(typeof e==`object`&&e.kind===`Subset`&&typeof t==`object`&&t.kind===`Subset`&&N(e.base))return op(P(e.base).elements,t.base);if(typeof e==`object`&&e.kind===`Interval`){if(typeof t==`object`&&t.kind===`Interval`&&t.low<=e.low&&t.high>=e.high)return!0;for(let n=e.low;n<=e.high;n++)if(!Ki(n,t))return!1;return!0}return!Oi(e,e=>!Ki(e,t))}),...lp.map(e=>z(e,2,t=>{let n=R(t,0,e),r=R(t,1,e),i=e!==`\\cup`&&typeof r==`object`&&r.kind===`Interval`&&typeof n==`object`&&n.kind!==`Interval`;if(sn(n)&&sn(r)&&!up(n)&&!up(r)&&!i&&!an(n)&&!an(r)){if(e===`\\cup`&&F(n))return r;let t=e===`\\cup`?$r:e===`\\cap`?Qr:Zr;return Wi((n,r)=>{let i=P(n),a=P(r),o=t(i,a);if(e===`\\cup`){let e=Hr(i),t=Zr(a,i).elements,n=e===i.elements&&(t.length===0||qn(e[e.length-1],t[0])<0);if(e.length+t.length>tn())throw new s(nn());if(n&&!i.isNormalized)return o;let r=o===i?Qn(o.elements):o;return n||(r.writtenElements=[...e,...t]),r}return o===n||(o.isNormalized=dp(n),i.writtenElements&&!i.isNormalized&&(o.writtenElements=i.writtenElements.filter(e=>Ki(e,o)))),o},(t,n)=>fp(e,t,n),n,r)}return sn(n)?fp(e,n,r):e!==`\\`&&sn(r)?fp(e,r,n):sr({kind:`SetOperation`,operator:e,left:n,right:r})})),z(`SUBSET`,1,e=>({kind:`Subset`,base:R(e,0,`SUBSET`)})),z(`UNION`,1,e=>{let t=R(e,0,`UNION`),n=un(t)?Hr(t):[],r=n.filter(un);if(!un(t)||r.length!==n.length)return sr({kind:`Union`,base:t});let i=r.flatMap(Hr),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{Ki(t,e)||rn(e.elements,t)}),Yr(e.elements)};return up(t)||r.some(up)?a():r.length===0?Xr:Wi(e=>Bi(cp(e,0,e.length),i),a,r.map(P),void 0)}),z(`DOMAIN`,1,e=>{let t=R(e,0,`DOMAIN`);if(!cn(t))throw new v(`DOMAIN expects a function but received ${L(t)}`);return da(t)})],hp=Ss(`Integers`,`Neg`,`IntValue`,1),gp=e=>{let t=Ss(e,`DotDot`,`IntervalValue`,2);return[Cs(e,`+`,`Plus`,(e,t)=>e+t),Cs(e,`-`,`Minus`,(e,t)=>e-t),Cs(e,`*`,`Times`,(e,t)=>e*t),Cs(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new c(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new c(`0^0 is undefined.`);return e**t}),Cs(e,`\\div`,`Divide`,(e,t)=>{if(t===0)throw new c(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if(us(n))throw ds(`${e} \\div ${t}`);return n}),Cs(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new c(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),z(`..`,2,e=>{let n=R(e,0,`..`),r=xs(R(e,1,`..`),t);return{kind:`Interval`,low:xs(n,t),high:r}})]},_p=gp(`Naturals`),vp=gp(`Integers`),yp=e=>{let t=_p.indexOf(e);return t===-1?void 0:vp[t]},bp=e=>{let t=(t,n=`tlc2.value.IBoolValue`)=>`public static ${n} tlc2.module.${e}.${t}(tlc2.value.impl.Value,tlc2.value.impl.Value)`,n=e===`Integers`;return[bs(Ts(`<`,(e,t)=>e<t),t(`LT`)),bs(Ts(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),bs(Ts(`<=`,(e,t)=>e<=t),t(`LE`)),bs(Ts(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},xp=[os(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),..._p,...bp(`Naturals`)],Sp=[os(`Int`,{kind:`InfiniteSet`,name:`Int`}),...vp,...bp(`Integers`),z(`-.`,1,e=>{let t=xs(R(e,0,`-`),hp);if(us(-t))throw ds(`-${t}`);return-t})],Cp=(e,t,n)=>{let r=R(e,t,n),i=Vi(r);if(!i)throw new c(`${n}\n${L(r)}`);return i},wp=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:Cp(e,t,n)},Tp=(e,t,n)=>{let r=R(e,t,`SubSeq`);if(typeof r!=`number`)throw ts(n,`SubSeq`,`natural number`,r);return r},Ep=(e,t,n)=>typeof e==`string`?Ln(e.slice(t,n)):di(e.slice(t,n)),Dp=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Op=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,kp=(e,t)=>{let n=tp.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?bs(e,t):e}):t},Ap=e=>kp(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>wp(e,0,Dp(``,`Len`)).length),z(`\\o`,2,e=>{let t=wp(e,0,Op(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Cp(e,1,Op(`t \\o s`,`sequence`));return di([...t,...n])}let n=R(e,1,`\\o`);if(typeof n!=`string`)throw new c(`${Op(`t \\o s`,`string`)}\n${L(n)}`);return Ln(t+n)}),z(`Append`,2,t=>di([...Cp(t,0,Op(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(t,1,`Append`)])),z(`Head`,1,e=>{let t=Cp(e,0,Dp(``,`Head`));if(t.length===0)throw new c(`Attempted to apply Head to the empty sequence.`);return t[0]}),z(`Tail`,1,e=>{let t=wp(e,0,Dp(``,`Tail`));if(t.length===0)throw new c(`Attempted to apply Tail to the empty sequence.`);return Ep(t,1)}),z(`SubSeq`,3,e=>{let t=wp(e,0,Dp(`first `,`SubSeq`)),n=Tp(e,1,`second`),r=Tp(e,2,`third`);if(n>r)return Ep(t,0,0);let i=n<1||n>t.length?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new c(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${L(R(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Ep(t,n-1,r)}),ss(`SelectSeq`,2,e=>{let t=as(e,1,`SelectSeq`);return di(Cp(e,0,Dp(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new c(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${t.name}>`);return n}))})]),jp=e=>kp(`FiniteSets`,[z(`IsFiniteSet`,1,e=>{let t=R(e,0,`IsFiniteSet`);if(M(t))return Ri(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new v(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${L(t)}\nis a finite set.`:`Attempted to check if the ${dn(t)} ${L(t)} is a finite set.`)}),z(`Cardinality`,1,t=>{let n=R(t,0,`Cardinality`);if(!M(n)||typeof n==`object`&&(n.kind===`InfiniteSet`||n.kind===`SequenceSet`))throw new c(`Attempted to compute cardinality of the value\n${L(n)}`);return Ii(n,e)})]),Mp=[bs(z(`Warshall`,1,e=>{let t=R(e,0,`Warshall`);if(!M(t)||Bn(t))throw new c(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${L(t)}`);Ii(t);let n=[],r=/* @__PURE__ */ new Map,i=e=>{let t=Aa(e),i=r.get(t)??n.length;return i===n.length&&(r.set(t,i),n.push(e)),i},a=P(t).elements.map(e=>{let t=Vi(e);if(t?.length!==2)throw new c(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${L(e)}`);return[i(t[0]),i(t[1])]}),o=n.map(()=>n.map(()=>!1));a.forEach(e=>{o[e[0]][e[1]]=!0});for(let e=0;e<n.length;e++)for(let t=0;t<n.length;t++)if(o[t][e])for(let r=0;r<n.length;r++)o[e][r]&&(o[t][r]=!0);return Yr(n.flatMap((e,t)=>n.flatMap((n,r)=>o[t][r]?[di([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],Np=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return Mp;if(e===`AnySet`)return[os(`ANY`,Wn)];if(e===`IOUtils`)return Wd(r,a);if(e===`_TLCTrace`)return qd(r);if(!ap(n.version).has(e))return;let o=Fp(e,t,n,r,i)?.operators;return e===`Randomization`&&o?[...o,bf(n)]:o},Pp=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),Fp=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:xp};case`Integers`:return{extends:[`Naturals`],operators:Sp};case`Sequences`:return{extends:[],operators:Ap(n.version)};case`FiniteSets`:return{extends:[],operators:jp(n.version)};case`TLC`:return{extends:[],operators:kp(`TLC`,Jf(t,n))};case`Randomization`:return{extends:[],operators:xf(n)};case`_Possible`:return{extends:[],operators:Ff(t,n)};case`Json`:return{extends:[],operators:Ud(r)};case`Bags`:return{extends:[],operators:kp(`Bags`,hd(i))};case`TLCExt`:return{extends:[],operators:kp(`TLCExt`,Pf(t,n))};default:return}},Ip=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&ml.get(t)||[];r.expressions.push(...i,t);let a=Ui.sets,o=a??[],s=o.length;Ui.sets=o;try{return n()}catch(e){throw u_(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,Ui.sets=a}},Lp=(e,t,n)=>e.coverage?Po(e.coverage,t,n):-1,Rp=(e,t,n)=>e.coverage?Io(e.coverage,t,n):n(),zp=(e,t,n,r)=>Rp(e,t,()=>W(n,r)),Bp=(e,t,n,r)=>{let i=zp(e,t,n,r),a=e.coverage;if(a?.covered.has(n))for(let e=t;e!==-1;e=a.prefixes[e])a.primary[e]--;return i},Vp=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Hp=e=>!e.includes(void 0),Up=e=>e.variables.map(()=>void 0),Wp=(e,t,n)=>{let r=[...e];return r[t]=n,r},Gp=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},Kp=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,qp=e=>e.kind===`Identifier`?e.name:void 0,Jp=(e,t,n)=>{if(t.kind===`Label`)return Jp(e,t.body,n);let r=qp(t);if(r===void 0)return;let i=Jh(n,r);if(i?.kind===`Thunk`)return Jp(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=Rg(r,e);return o?.kind===`Closure`&&o.params.length===0?Jp(e,o.body,o.scope):void 0},Yp=(e,t,n)=>{if(t.kind===`Prime`)return Jp(e,t.expression,n);if(t.kind===`Label`)return Yp(e,t.body,n);let r=qp(t);if(r===void 0)return;let i=Jh(n,r);if(i?.kind===`Thunk`)return Yp(e,i.expression,i.scope);if(i)return;let a=Rg(r,e);return a?.kind===`Closure`&&a.params.length===0?Yp(e,a.body,a.scope):void 0},Xp=e=>{if(typeof e!=`boolean`)throw new v(`TLC expected a boolean expression.`);return e},Zp=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Qp=(e,t,n,r)=>{let i=em(e,t,n,r);return i&&e.coverage&&!e.isInit&&Fo(e.coverage,r),i},$p=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(Fo(r,n),Fo(r,r.roots[n])),e.onState(t),!0},em=(e,t,n,r)=>t===void 0?Hp(n)?$p(e,n,r):(e.onIncomplete?.(n),!1):Hp(n)&&Zp(e)?nm(e,t,n,r):t.kind===`Predicate`?rm(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?ym(e,t.expression,t.rest,t.scope,n,t.node):tm(e,t,n)&&Qp(e,t.rest,n,t.node),tm=(e,t,n)=>{let r=e.environment,i=zp(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return zp(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?qh(t,r.runtime.version):t}})();try{return!Gr(i,a)}catch(t){throw e.callStack&&u_(e.callStack,[i],t),t}},nm=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return ym(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?tm(e,i,n):Xp(zp(e,i.node,i.expression,Vp(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return $p(e,n,r)},rm=(e,t,n,r,i,a)=>im(e,t,n,r,i,Lp(e,a,t)),im=(e,t,n,r,i,a)=>Ip(e,t,()=>{switch(t.kind){case`Let`:{let o=Vp(e,r,i),s=t.definitions,c=e.coverage?t_(s,o,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):t_(s,o);return rm(e,t.body,n,c,i,a)}case`Label`:return rm(e,t.body,n,r,i,a);default:if(pm.has(t.kind))throw new v(`The state relation is not a boolean expression.`);return Ip(e,t,()=>_m(e,t,n,r,i,a))}}),am=(e,t,n,r,i)=>Xp(t)&&Qp(e,n,r,i),om=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),sm=(e,t,n,r,i,a)=>{let o=Vp(e,r,i);if(t.kind===`Identifier`){let s=Jh(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return rm(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return rm(e,s.operator.body,n,s.operator.scope,i,a);let c=s?void 0:e.environment.definitions.get(t.name),l=s?void 0:Rg(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&qu(c,e.environment))?rm(e,l.body,n,l.scope,i,a):am(e,Bp(e,a,t,o),n,i,a)}let s=zg(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=Rp(e,a,()=>Zg(s,t.args,o));return rm(e,s.body,n,r,i,a)}let c=om.has(t.operator)?zp(e,a,t,o):Bp(e,a,t,o);return am(e,c,n,i,a)},cm=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?Qp(e,t,Wp(n,r,i),a):Gr(o,i)&&Qp(e,t,n,a)},lm=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),um=(e,t,n)=>(e.coverage&&Lo(e.coverage,t,n.length+1),n),dm=(e,t,n,r,i,a)=>{let[o,s]=t.args,c=e.isInit?Jp(e.environment,o,r):Yp(e.environment,o,r),l=Vp(e,r,i);if(c===void 0)return zp(e,a,t,l)===!0&&Qp(e,n,i,a);let u=zp(e,a,s,l),d=i[c];if(t.operator===`=`)return cm(e,n,i,c,u,a);let f=t.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(typeof f==`object`&&f!==u&&e.callStack?.sources.set(f,s),d!==void 0)return zp(e,a,t,l)===!0&&Qp(e,n,i,a);if(!mi(f))throw new v(`The right side of \\IN is not enumerable.`);return um(e,f,ki(f)).reduce((t,r)=>Qp(e,n,Wp(i,c,r),a)||t,!1)},fm=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),pm=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),mm={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},hm=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:mm[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${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)}`},gm=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=Rp(e,r,()=>mg(t.bounds,t=>{let r=W(t,n),i=dg(r,t,a);return Array.isArray(i)&&um(e,r,i),i}));return gg(t.bounds,o,n.scope,e=>(i.push(e),!1)),i},_m=(e,t,n,r,i,a)=>{let o=Vp(e,r,i);switch(t.kind){case`Identifier`:return sm(e,t,n,r,i,a);case`Apply`:return fm.has(t.operator)&&t.args.length===2?dm(e,t,n,r,i,a):t.operator===`=>`&&t.args.length===2?Xp(zp(e,a,t.args[0],o))?rm(e,t.args[1],n,r,i,a):Qp(e,n,i,a):sm(e,t,n,r,i,a);case`And`:{let o=t.operands;if(t.isBulleted||o.length===2){let t=o.slice(1).reduceRight((e,t)=>lm(`Predicate`,t,r,a,e),n);return rm(e,o[0],t,r,i,a)}let s=o[o.length-1];return im(e,Gp(t,o.length-1),lm(`Predicate`,s,r,a,n),r,i,Kp(e,a))}case`Or`:{let o=t.operands;if(t.isBulleted||o.length===2)return o.reduce((t,o)=>rm(e,o,n,r,i,a)||t,!1);let s=im(e,Gp(t,o.length-1),n,r,i,Kp(e,a)),c=rm(e,o[o.length-1],n,r,i,a);return s||c}case`Exists`:return gm(e,t,o,a).reduce((r,o)=>rm(e,t.body,n,o,i,a)||r,!1);case`Forall`:{let r=gm(e,t,o,a);if(r.length===0)return Qp(e,n,i,a);let s=r.slice(1).reduce((e,n)=>lm(`Predicate`,t.body,n,a,e),n);return rm(e,t.body,s,r[0],i,a)}case`If`:return rm(e,Xp(zp(e,a,t.condition,o))?t.consequent:t.alternative,n,r,i,a);case`Case`:{let s=t.arms.find(t=>Xp(zp(e,a,t.condition,o)))?.body??t.other;if(s===void 0)throw new v(`TLC encountered a CASE with no conditions true.`);return rm(e,s,n,r,i,a)}case`FunctionApplication`:{let r=Sg(zp(e,a,t.function,e.isInit?o:Qh(o)));if(r){let s=Rp(e,a,()=>Cg(r,t,o));return rm(e,r.body,n,s,i,a)}break}case`Unchanged`:if(!e.isInit)return ym(e,t.expression,n,r,i,a);break;case`BoxAction`:if(!e.isInit){let o=rm(e,t.action,n,r,i,a);return ym(e,t.subscript,n,r,i,a)||o}break;case`AngleAction`:if(!e.isInit)return rm(e,t.action,lm(`Changed`,t.subscript,r,a,n),r,i,a)}let s=e.isEnabled?hm(t):void 0;if(s!==void 0)throw new v(s);return am(e,zp(e,a,t,o),n,i,a)},vm=(e,t,n)=>e.runtime.warn(xt.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${H(n)}`),ym=(e,t,n,r,i,a)=>Ip(e,t,()=>{let o=Lp(e,a,t),s=Jp(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;let a=i[s];return a!==void 0&&!Gr(a,r)?(vm(e.environment,s,t),!1):cm(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return Qp(e,n,i,o);let c=s.reduceRight((e,t)=>lm(`Unchanged`,t,r,o,e),n);return ym(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=Jh(r,t.name);if(a?.kind===`Thunk`)return ym(e,a.expression,n,a.scope,i,o);let s=a?void 0:Rg(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return ym(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=Vp(e,r,i),s=zg(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return ym(e,s.body,n,Zg(s,t.args,a),i,o)}let c=e.environment,l=zp(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=zp(e,o,t,{environment:c,scope:r,state:i,next:void 0});return Gr(l,u)&&Qp(e,n,i,o)}),bm=(e,t,n,r,i=!1,a)=>({environment:e,callStack:e.callStack,coverage:e.coverage,isInit:t,isEnabled:i,current:n,onState:r,onIncomplete:a}),xm=/* @__PURE__ */ Error(`The replay found a successor`),Sm=(e,t,n,r)=>{let i=bm(r,!1,n,()=>{throw xm},!0),a=i.callStack,o=a?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=lm(`Changed`,e.subscript,t,-1,void 0);rm(i,e.action,n,t,Up(r),-1)}else rm(i,e,void 0,t,Up(r),-1);return!1}catch(e){if(e!==xm)throw e;return a&&(a.expressions.length=o,a.isFrozen=!1),!0}},Cm=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=bm(t,!0,void 0,n,!1,r),s=a.reduceRight((e,t)=>lm(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);rm(o,i.expression,s,i.scope,Up(t),i.node??-1)},wm=(e,t,n,r)=>{e.some(e=>pm.has(e.expression.kind))||e.forEach(e=>{let i=[];Tm(e,-1,t,n,e=>i.push(e)),i.forEach(t=>r(t,e))})},Tm=(e,t,n,r,i,a)=>{let o=bm(r,!1,n,i,!1,a);rm(o,e.expression,void 0,e.scope,Up(r),t)},Em=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(Jp(t,e,void 0)!==void 0&&e.kind===`Identifier`){n.push(e);return}if(e.kind===`Tuple`){e.elements.forEach(e=>i(e,r));return}if(e.kind!==`Identifier`)return;let a=Jh(r,e.name)?void 0:Rg(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,t_(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`FunctionApplication`:a(e.function,o,s);return;case`If`:a(e.consequent,o,s),a(e.alternative,o,s);return;case`Case`:e.arms.forEach(e=>a(e.body,o,s)),e.other&&a(e.other,o,s);return;case`And`:case`Or`:e.operands.forEach(e=>a(e,o,s));return;case`Exists`:case`Forall`:a(e.body,o,s);return;case`Unchanged`:i(e.expression,o);return;case`AngleAction`:a(e.action,o,s);return;case`BoxAction`:a(e.action,o,s),n.push(e.subscript);return;case`Identifier`:case`Apply`:{if(e.kind===`Apply`){if(e.operator===`=>`){e.args.forEach(e=>a(e,o,s));return}if(e.operator===`=`||e.operator===`\\in`){Yp(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=Jh(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?zg(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:Rg(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,Zg(l,u,r(o)),s),s.delete(l.body)}}};return e.forEach(e=>a(e.expression,e.scope,/* @__PURE__ */ new Set)),n.flatMap(e=>e.location.range??[])},Dm=/* @__PURE__ */ new WeakMap,Om=/* @__PURE__ */ new WeakMap,km=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Am=(e,t,n)=>{let r=e.slice();return r[t]=n,r},jm=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,Mm=(e,t)=>{let n=new v(t);return e.isInit?n:x(n,ie.error)},Nm=(e,t,n,r)=>{let i=Lh(n);return r&&pm.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${jm(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},Pm=(e,t,n)=>{let r=_s(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 ${jm(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
1781
|
-
`:``}${i}`},Fm=(e,t,n)=>Rm(e,t,W(t,n)),Im=new Set(mp.map(e=>e.name)),Lm=e=>e.kind===`Apply`?Im.has(e.operator):e.kind!==`Identifier`&&!pm.has(e.kind),Rm=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;let i=Nm(e,n,t,r);throw e.isInit&&r&&Lm(t)?new le(i):Mm(e,i)},zm=(e,t,n,r)=>r.environment.callStack?W(n,r):(e[t]??=h_(n,r.environment))(r),Bm=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Vm=(e,t,n)=>{let r=n?Dm:Om,i=r.get(e);if(i)return i;let a=xh(e,t,n),o=n?void 0:bh(e,t),s=o?(e,t,n,r,i,s)=>(e.generator?o:a)(e,t,n,r,i,s):a;return r.set(e,s),s},Hm=(e,t)=>{if(t.constants.has(e))return;let n=ag(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},Um=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return Um(e.expression,t,!1,r);if(e.kind!==`Identifier`||A(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Hm(e.name,t);if(a&&!r.has(a))return r.add(a),Um(a.body,t,n,r)},Wm=(e,t,n)=>Um(e,t,!n),Gm=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return Gm(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=t_(e.definitions,km(r,t,n));return Gm(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Jh(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return Gm(a.expression,a.scope,n,r,i);if(a)return;let o=r.environment.variableIndex.get(e.name);if(o!==void 0)return i?void 0:o;let s=Hm(e.name,r.environment);if(s)return Gm(s.body,void 0,n,r,i)},Km=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||A(e))||!t&&e.kind===`Prime`,qm=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>qm(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[{index:r,expression:e}];let i=Hm(e.name,t);if(i)return n.add(e.name),qm(i.body,t,n)},Jm=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Ym=(e,t,n)=>Jm.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Bm(e.operator)&&(Km(e.args[0],n)||Wm(e.args[0],t,n)!==void 0)||A(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,Xm=/* @__PURE__ */ new Set,Zm=(e,t)=>{if(A(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return Sl(e,(e,i)=>{let a=r?Zm(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r=!1,e}),r?n:void 0},Qm=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||A(e)?void 0:ag(r,t);return i&&!n.has(i)&&(n.add(i),Qm(i.body,t,n))?!0:ht(e).some(e=>Qm(e,t,n))},$m=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Wm(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=qm(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return Ym(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Vm(e,t,n)}},eh=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(Qu(e,t)===void 0||Qm(e,t,/* @__PURE__ */ new Set))return!0;let n=Zm(e,Xm);return!n||n.some(e=>r.has(e))}),o=a===-1?i.length:a;if(o!==0)return{names:n,guards:i.slice(0,o),rest:i.slice(o)}},th=(e,t,n)=>{let r=e.map(e=>$m(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Zp(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Ch(u)){d??=km(t,n,u);for(let e=s;e<r.length;e++){let n=r[e],i=t.current,o=i&&n.kind===`Unchanged`?n.variables.find(e=>{let t=u[e.index];return t!==void 0&&!Gr(t,i[e.index])}):void 0;if(o){vm(t.environment,o.index,o.expression);return}let s=n.expression,c=zm(a,e,s,d);if(!Rm(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=km(t,n,u);let r=zm(i,s,e.expression,d);if(!Rm(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=km(t,n,u);let r=zm(i,s,e.value,d),a=u[e.index];if(a===void 0)u=Am(u,e.index,r),d=void 0;else if(!Gr(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(!Gr(e,n[i.index])){vm(t.environment,i.index,i.expression);return}}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},nh=e=>{let t=hm(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw Mm(n,t);Fm(n,e,km(n,r,i))&&s(i,a)}},rh=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=km(r,i,a);if(a[l]!==void 0){Fm(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!mi(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${jm(r)}, the right side of \\IN is not enumerable.`;throw Mm(r,`${t}\n${H(e)}`)}let p=ki(f);if(r.generator){for(let e of ff(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(Am(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(Am(a,l,p[e]),o)}},ih=/* @__PURE__ */ new WeakMap,ah=e=>{let t=ih.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(ah),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return ih.set(e,n),n},oh=(e,t)=>{let n=e.args[0],r=nh(e),i=(e,r,i)=>Gm(n,r,i,e,!t)??-1,a=rh(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=W(e.args[1],km(t,n,o));l(Am(o,u,d),s)}},sh=(e,t,n)=>{let r=H(e);return(i,a,o,s,c,l)=>{let u=km(i,a,o),d=W(e.function,n?u:Qh(u)),f=Sg(d);if(f!==void 0){Vm(f.body,t,n)(i,Cg(f,e,u),o,s,c,l);return}if(!cn(d))throw Mm(i,`In computing ${jm(i)}, a non-function (${_s(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw Mm(i,`In computing ${jm(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},ch=(e,t)=>{if(qm(e,t))return th([ah(e)],t,!1);if(e.kind===`Tuple`)return Vm(ah(e),t,!1);let n=ah(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Jh(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){Vm(ah(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=km(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=zg(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){Vm(ah(n.body),t,!1)(r,Zg(n,e.args,u),a,o,s,c);return}}Fm(r,n,u)&&c(a,o)}},lh=(e,t,n)=>{let r=e.operator,i=nh(e),a=A(e)?void 0:Rg(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=b_(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=Vm(a.body,t,n),o(e,i(km(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=km(a,o,s),f=zg(e,d);f?.kind===`Closure`?Vm(f.body,t,n)(a,Zg(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},uh=(e,t,n)=>{let r=nh(e),i=A(e)?void 0:Hm(e.name,t),a;return(o,s,c,l,u,d)=>{let f=Jh(s,e.name);f?.kind===`Thunk`&&!f.isReleased?Vm(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&Ng(i,t)!==void 0?r(o,s,c,l,u,d):(a??=Vm(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},dh=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||A(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!A(i))return;let a=Um(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},fh=e=>e.kind===`And`?e.operands.flatMap(fh):[e],ph=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&Ym(e,t,!1),mh=e=>{let t=[];return(n,r,i)=>{let a=km(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!Rm(n,i,zm(t,r,i,a)))return}}},hh=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=fh(e),r=n.findIndex(e=>!ph(e,t)||dh(e,t)),i=r===-1?void 0:dh(n[r],t);return i?{...i,before:r===0?void 0:mh(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>hh(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||A(e))return;let r=Rg(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=hh(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(!i||o?.kind!==`Identifier`||!A(o))return;let s=i.before,c=s&&b_(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(km(e,t,n)),n))}},gh=(e,t,n)=>{let r=Jh(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},_h=(e,t,n)=>{let r=e.map(e=>Vm(e,t,n)),i=n?[]:e.map(e=>hh(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&gh(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},vh=e=>(t,n,r,i,a,o)=>{let s=t.generator;if(!s)throw Error(`A random choice needs the run's generator`);let c=Math.floor(s.nextDouble()*e.length),l=tf(s);for(let s=0;s<e.length;s++)if(e[(c+s*l)%e.length](t,n,r,i,a,o),t.successors>0||t.isStopped)return},yh=(e,t)=>{let n=Vm(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=km(r,i,a),u=t.runtime.version,d=mg(e.bounds,e=>W(e,l)).map((n,r)=>ff(lg(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,Xh(i,l,e)))};f(d.length-1,i)}},bh=(e,t)=>{if(e.kind===`Exists`)return yh(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>Vm(e,t,!1));return e.isBulleted?vh(n):n.reduce((e,t)=>vh([e,t]))},xh=(e,t,n)=>{let r=e=>Vm(e,t,n);switch(e.kind){case`And`:return th(e.operands,t,n);case`Or`:return _h(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(n,r,o,s,c,l)=>{let u=lg(W(a.set,km(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,Yh(r,e,u[t]),o,s,c,l)}}let o=n?void 0:eh(e,t);if(o){let r=th(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=km(n,i,a),d=mg(e.bounds,e=>lg(W(e,u),e,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=Yh(t,o.names[e],r);if(e===d.length-1){let e=km(n,i,a);if(!o.guards.every(t=>Fm(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{_g(e.bounds,km(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Qu(e,t)!==void 0&&!Qm(e.body,t,/* @__PURE__ */ new Set)?Zm(e,Xm):void 0;return(t,n,r,o,s,c)=>{let l=[];_g(e.bounds,km(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Jh(n,e)?.kind===`Value`)){u.every(n=>Fm(t,e.body,km(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Ch(r)?u.slice(n).every(n=>Fm(t,e.body,km(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=W(e.condition,km(r,i,a));if(typeof l!=`boolean`)throw Mm(r,Pm(r,l,e));(l?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,source:e.body,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=km(r,i,a),u=t.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw Mm(r,`In computing ${jm(r)}, a non-boolean expression${r.isEnabled?``:` `}(${_s(t)}) was used as a guard condition of a CASE.\n${Lh(e.source)}`)})?.body??n;if(!u)throw Mm(r,`In computing ${jm(r)}, TLC encountered a CASE with no conditions true.\n${H(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=r_(e.definitions,t);return(t,r,a,o,s,c)=>n(t,t_(e.definitions,km(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new v(`UNCHANGED appears in an initial predicate at ${Ph(e)}`)}:ch(e.expression,t);case`AngleAction`:{let n=r(e.action),i={kind:`Unchanged`,expression:e.subscript,location:e.subscript.location},a=(e,n,r)=>{try{return Fm(e,i,km(e,n,r))}catch(n){throw e.isEnabled?qh(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return _h([e.action,ah(e.subscript)],t,n);case`Label`:return r(e.body);case`Identifier`:return uh(e,t,n);case`FunctionApplication`:return sh(e,t,n);case`Apply`:{let i=e.args;if(Bm(e.operator)){let r=Wm(i[0],t,n);if(r!==void 0)return e.operator===`=`?th([e],t,n):rh(e,()=>r);if(Km(i[0],n))return oh(e,n)}if(e.operator===`=>`){let t=r(i[1]);return(n,r,a,o,s,c)=>{let l=W(i[0],km(n,r,a));if(typeof l!=`boolean`){let t=_s(l),r=H(e);throw Mm(n,n.isInit?`In computing initial states of a predicate of form P => Q, P was ${t}\n.${r}`:n.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${t}.\n${r}`:`In computing next states of a predicate of the form P => Q, P was\n${t}.\n${r}`)}l?t(n,r,a,o,s,c):c(a,o)}}return lh(e,t,n)}default:return nh(e)}},Sh=e=>e.variables.map(()=>void 0),Ch=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},wh=(e,t)=>{let n=t.state;if(!n||!Ch(n))throw new v(`ENABLED needs a complete state at ${Ph(e)}`);let r=t.environment;if(r.callStack)return Sm(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1,generator:void 0,successors:0};return Vm(e,r,!1)(i,t.scope,Sh(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Th=(e,t,n,r,i)=>{let a={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};Vm(e,t,!0)(a,r,Sh(t),void 0,!1,e=>{if(!a.isStopped){if(!Ch(e)){if(i){a.isStopped=i([...e]);return}throw x(new f([...e]),ie.error)}a.isStopped=n(e)}})},Eh=(e,t,n)=>{let r=[];return Th(e,t,e=>(r.push(e),!1),n),r},Dh=(e,t,r,i,a,o,s)=>{let c={environment:r,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:o,successors:0,onUnsatisfied:s};return Vm(e,r,!1)(c,a,Sh(r),void 0,!1,(e,t)=>{if(!c.isStopped){if(!Ch(e)){let i=r.variables.filter((t,n)=>e[n]===void 0);throw new n(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,e,t,i)}c.successors++,c.isStopped=i({state:e,action:t})}}),c.successors},Oh=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return Vm(e,n,!1)(i,r,Sh(n),void 0,!1,e=>{Ch(e)||(i.isStopped=!0)}),i.isStopped},kh=(e,t,n,r)=>{let i=[];return Dh(e,t,n,e=>(i.push(e),!1),r),i},Ah=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),jh=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Mh=e=>jh.has(e.kind)||e.kind===`Apply`&&Ah.has(e.operator),Nh=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&sn(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Ph=e=>`line ${e.location.line}, column ${e.location.column}`,H=e=>{let t=e.location.range;return t?h(t):Ph(e)},Fh={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},Ih=(e,t)=>new v(`TLC encountered a temporal formula (${e}) when evaluating a predicate or action.\n${H(t)}`),Lh=e=>e.kind===`Number`?e.text??String(e.value):H(e),Rh=(e,t)=>new v(`A non-boolean expression (${_s(t)}) was used as the condition of an IF.\n${H(e)}`),zh=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new v(`A non-boolean expression (${_s(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${Lh(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new v(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${_s(n)}.\n${H({...e,location:{...e.location,range:{...r,end:i}}})}`)},Bh=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${j(L(n))}\n${H(e)}`,r=e=>`Attempted to apply function:\n${j(L(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!cn(i))throw new v(`Attempted to select field "${t}" from a non-record value ${j(L(i))}\n${H(e)}`);let a=rr(i);if(a===`tuple`)throw ra(t);return la(i.kind===`LazyFunction`?I(i):i,t,a===`record`?n:r)}},Vh=e=>e===`1.7.4`?(t,n)=>ea(t,n,e):void 0,Hh=e=>t=>{if(!cn(t))throw new v(`Attempted to apply the operator DOMAIN to a non-function\n(${_s(t)})\n${H(e)}`);return da(t)},Uh=(e,t)=>(n,r)=>{if(!M(n)||Bn(n))throw new v(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${H(e)}`);return t.evaluateBinary?t.evaluateBinary(n,r):t.evaluate([n,r])},Wh=e=>x(new v(`TLC can't handle real numbers.\n${e.text}`),ie.configParseError),Gh=e=>x(new v(`TLC can't handle a number this big.\n${e.text??e.value}`),ie.error),Kh=(e,t)=>new d(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${H(t)}`,e),qh=(e,t)=>e instanceof d&&t!==`1.7.4`?new v(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,Jh=(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}),Xh=(e,t,n)=>{if(t.kind===`Name`)return Yh(e,t.name,n);let r=Vi(n);if(!r||r.length!==t.names.length){let e=t.ranges?.[0];throw new v(`Argument mismatch in operator application.${e?h(e):``}`)}return t.names.reduce((e,t,n)=>Yh(e,t,r[n]),e)},Zh=(e,t)=>{if(cn(e))return e;throw new v(`A non-function (${_s(e)}) was applied as a function.\n${H(t)}`)},Qh=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},$h=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),eg=(e,t)=>{if(typeof e!=`boolean`)throw new v(`Expected ${t} to be a boolean but found ${L(e)}`);return e},tg=(e,t,n)=>{if(typeof e!=`boolean`)throw new v(`Attempted to evaluate an expression of form P => Q when ${n} was\n${_s(e)}.\n${H(t)}`);return e},ng=(e,t)=>{if(typeof e!=`boolean`)throw new v(`Attempted to apply the operator ~ to a non-boolean\n(${_s(e)})\n${H(t)}`);return!e},rg=(e,t,n)=>{if(typeof e!=`boolean`||typeof t!=`boolean`)throw new v(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${H(n)}`);return e===t},ig=(e,t)=>{if(typeof e!=`boolean`)throw new v(`TLC expected a boolean value, but did not find one. ${Lh(t)}`);return e},ag=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),og=(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.`},sg=(e,t,n)=>{if(!M(e)||Bn(e)){let r=L(e),i=n===`1.7.4`?void 0:og(e,r);throw new v(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${Lh(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${Lh(t)}\n${i}`)}},cg=(e,t,n)=>(sg(e,t,n),typeof e==`object`&&e.kind===`Interval`?si(e):xi(e)??Di(e)),lg=(e,t,n)=>n===`1.7.4`?(sg(e,t,n),xi(e)??ki(e)):cg(e,t,n),ug=e=>{if(typeof e==`object`&&e.kind===`Interval`)return Ii(e),e},dg=(e,t,n)=>ug(e)??lg(e,t,n),fg=(e,t,n)=>ug(e)??cg(e,t,n),pg=(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},mg=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set)),n),[]),hg=(e,t)=>mg(e,e=>dg(W(e,t),e,t.environment.runtime.version)),gg=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):pg(t[n],t=>i(n-1,Xh(a,e[n].pattern,t)));return i(e.length-1,n)},_g=(e,t,n)=>gg(e,hg(e,t),t.scope,n),vg=(e,t)=>{let n=mg(e,e=>W(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},yg=(e,t,n)=>{if(e.length===1)return Xh(t,e[0].pattern,n);let r=Vi(n)??[];return e.reduce((e,t,n)=>Xh(e,t.pattern,r[n]),t)},bg=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,xg=e=>Object.assign(e.value,{lambda:e}),Sg=e=>bg(e)?e.lambda:void 0,Cg=(e,t,n)=>{let r=e.value,i=t.args.map(e=>W(e,n)),a=i.length===1?i[0]:di(i),o=(e,n,i)=>`In applying the function\n${j(L(r))},\nthe ${e} is:\n${j(L(n))}${i}.\n${H(t.function)}`,s=e.bounds;if(s.length===1){if(!Ki(a,r.domain))throw new v(o(`first argument`,a,`which is not in its domain`));return yg(s,e.scope,a)}let c=Vi(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[],u=()=>new v(`In applying the function\n${j(L(r))},\nthe argument list is:\n${j(L(a))}\nwhich does not match its formal parameter.\n`);if(c===void 0||(s.forEach((e,t)=>{if(t>=c.length)throw u();let n=c[t],r=`argument number ${t+1}`;if(!Ki(n,l[t]))throw new v(o(r,n,`${e.pattern.kind===`Name`?``:`
|
|
1782
|
-
`}which is not in its domain`));if(e.pattern.kind===`Tuple`&&Vi(n)?.length!==e.pattern.names.length)throw new v(o(r,n,`which does not match its formal parameter`))}),c.length>s.length))throw u();return yg(s,e.scope,a)},wg=(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:h(n)}},Tg=(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}},Eg=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},Dg=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),Og=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),kg=(e,t)=>{let n=vg(e.bounds,t),r=Eg(n,(n,r)=>W(e.body,$h(t,yg(e.bounds,Yh(void 0,e.name,r),n))),Tg(wg(e.bounds,e.body),e.bounds,n),Dg(e.bounds));xg({value:r,bounds:e.bounds,body:e.body,scope:Yh(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=kg(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?ir(i):i},Ag=(e,t)=>{if(typeof t!=`object`||rr(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!sn(t.domain))return t;try{let e=I(t);return er(e.domain,e.range)}catch(e){if(e instanceof v)return t;throw e}},jg=(e,t)=>e.kind===`Operator`&&e.params.length>0?()=>{throw new v(`Operator ${e.name} requires ${e.params.length} arguments`)}:e.kind===`Function`?e.isSelfReferential?t=>kg(e,t):h_(Og(e),t):h_(e.body,t),Mg=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=jg(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r($h(e,void 0)):e=>a[i]??r($h(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]},Pg=(e,t)=>e.forEach(e=>{if(e.kind===`Operator`&&e.params.length>0)return;let n=e.name;if(t.constants.has(n)||t.substitutions.has(n)||!qu(e,t))return;let r=t.facts.ids.get(e);if(r===void 0||t.startupValues[r]!==void 0)return;let i={environment:t,scope:void 0,state:void 0,next:void 0};try{let n=t.runtime.evaluateAtStartup(()=>Ag(e,jg(e,t)(i)));Ur(n),t.startupValues[r]=n}catch(e){if(!(e instanceof v)&&!y(e))throw e}}),Fg=(e,t)=>{if(t===void 0||e===t)return!0;try{return t.every((t,n)=>t===void 0||e?.[n]!==void 0&&dr(e[n],t))}catch(e){if(e instanceof v)return!1;throw e}},Ig=(e,t)=>{let n=e.cache;if(n!==void 0&&Fg(t.state,e.state)&&Fg(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,$h(t,e.scope))):W(e.expression,$h(t,e.scope));return(!e.isStreamed||ji(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},Lg=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),Rg=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Rg(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Lg(r):t.builtins.get(e)},zg=(e,t)=>A(e)?Bg(e.operator,t):Rg(e.operator,t.environment)??Bg(e.operator,t),Bg=(e,t)=>{let n=Jh(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Rg(e,t.environment)},Vg=e=>e.kind===`Closure`?e.params.length:e.arity,Hg=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:e.params.map(e=>({name:e,arity:0})),body:e.body,scope:t.scope};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0,r=n===void 0?void 0:Bg(n,t);if(!r)throw new v(`Expected an operator argument at ${Ph(e)}`);return r},Ug=(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 W(e.body,$h(n,r))},Wg=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Vg(e),call:n=>Ug(e,n,t)},Gg=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Bg(e.name,t);return n!==void 0&&Vg(n)>0},Kg=(e,t)=>e.map(e=>Gg(e,t)?Wg(Hg(e,t),t):W(e,t)),qg=(e,t)=>new v(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),Jg=(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([])}},Xg=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&fn(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=Jg(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=A(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=Jh(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:Jg(e,t)}}return t=>Jg(e,t)},Zg=(e,t,n,r)=>{if(t.length!==e.params.length)throw qg(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:Hg(t[a],n)}:(r?.[a]??Xg(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},Qg=(e,t,n,r)=>e.kind===`Closure`?W(e.body,$h(n,Zg(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(v_(t,n),n):e.evaluate(Kg(t,n),n),$g=/* @__PURE__ */ new WeakMap,e_=e=>{let t=$g.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return $g.set(e,n),n},t_=(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:e_(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},n_=(e,t,n)=>{let r=Jh(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Ig(r,n);if(r?.kind===`Operator`){if(Vg(r.operator)===0)return Ug(r.operator,[],n);throw new v(`Operator ${e} is used without arguments`)}let i=Yg(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Kh(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Mg(i.definition,n.environment)(n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new v(`Unknown identifier ${e} at ${Ph(t)}`)},r_=(e,t)=>({impure:new Set(e.filter(e=>Yu(e,t))),streamed:new Set(e.filter(e=>Yu(e,t,`streamed`)))}),i_=e=>[...e.facts.ids.keys()].some(t=>Yu(t,e)),a_=e=>[...e.facts.ids.keys()].some(t=>Yu(t,e,`repeated`)),o_=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,s_=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),c_=e=>t=>{let n=e(t);return dr(n,e(s_(t)))},l_=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Ui.sets,o=Ui.callStack,c=a??[],l=c.length;Ui.sets=c,Ui.callStack=r;try{let a=t(i),o=o_(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Mh(e)&&r.sources.set(o,e),o}catch(t){t instanceof s&&!r.isFrozen&&(r.expressions.length=0,r.isFrozen=!0);let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Nh(e,r.values),a=i&&!ht(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!cn(a)?void 0:a;throw u_(r,[o,...c.slice(l).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),c.length=l,Ui.sets=a,Ui.callStack=o}},u_=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof v){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},d_=(e,t,n)=>{if(!(n instanceof v))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},f_=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}}),p_=(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)}},m_=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=Po(n,i,e);Fo(n,a),n.current=a;try{let i=t(r);return typeof i==`object`&&e.kind===`SetEnumeration`&&n.values.set(i,a),i}finally{n.current=i}},U=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=H_(e,t),i=t.callStack,a=i&&ml.get(e),o=i?l_(e,r,t,i):r,s=i&&a?p_(e,a,o,i):o,c=t.coverage,l=c?m_(e,s,c):s;return t.evaluators.set(e,l),l},h_=(e,t)=>{if(t.callStack||t.coverage)return U(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=Js(e,t)??U(e,t);return t.entryEvaluators.set(e,r),r},W=(e,t)=>h_(e,t.environment)(t),g_=(e,t)=>{let n=e.name,r=A(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 Kh(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??=Mg(e,t))(r)}return t=>n_(n,e,t)},__=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||A(e))return!0;let n=Rg(e.name,t);return n===void 0||Vg(n)===0},v_=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),y_=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(v_(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&__(t[0],n)){let e=U(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&__(t[0],n)&&__(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(Kg(t,n),n)},b_=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw qg(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Xg(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:Hg(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},x_=(e,t,n)=>{let r=b_(e,t,n),i;return t=>(i??=h_(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},S_=(e,t)=>{let n=e.args;if(e.operator===`=>`){let r=U(n[0],t),i=U(n[1],t);return t=>!tg(r(t),e,`P`)||tg(i(t),e,`Q`)}if(e.operator===`~`&&n.length===1){let r=U(n[0],t);return t=>ng(r(t),e)}if(e.operator===`<=>`){let r=U(n[0],t),i=U(n[1],t);return t=>rg(r(t),i(t),e)}if(e.operator===`~>`||e.operator===`-+->`)return()=>{throw Ih(e.operator===`~>`?`a ~> b`:`a -+-> formula`,e)};let r=A(e)?void 0:Rg(e.operator,t);if(r?.kind===`Closure`)return x_(r,n,t);if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=U(n[0],t),i=Hh(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=!pl.has(e)&&!$u(n[0],t);return e=>r.evaluate(v_(n,e),i&&e.scope===void 0?void 0:e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=U(n[0],t),a=U(n[1],t),o=Uh(e,r);return e=>o(i(e),a(e))}if(r?.kind===`Builtin`)return y_(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new v(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let i=n.map(e=>Xg(e,t));return r=>{let a=Bg(e.operator,r);if(a)return Qg(a,n,r,i);throw t.definitions.get(e.operator)?.kind===`Function`?new v(`${e.operator} is a function; apply it with brackets`):new v(`Unknown operator ${e.operator} at ${Ph(e)}`)}},C_=(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=>pg(dg(o(s),i.set,t.runtime.version),t=>ig(r($h(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=mg(a,e=>dg(U(e,t)(o),e,t.runtime.version)),c=(t,a)=>t<0?ig(r($h(o,a)),e)!==n:pg(s[t],e=>c(t-1,Yh(a,i[t],e)));return c(a.length-1,o.scope)?!n:n}}return t=>_g(a,t,i=>ig(r($h(t,i)),e)!==n)?!n:n},w_=(e,t)=>{if(e.kind===`Tuple`)return di(e.names.map(e=>{let n=Jh(t,e);return n?.kind===`Value`&&n.value}));let n=Jh(t,e.name);return n?.kind===`Value`?n.value:void 0},T_=/* @__PURE__ */ new WeakSet,E_=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&T_.add(e)},D_=/* @__PURE__ */ new WeakMap,O_=e=>{if(D_.has(e))return D_.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(`@`),ht(e).every(n)),r=n(e)?[...t]:void 0;return D_.set(e,r),r},k_=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=Jh(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),A_=e=>T_.has(e),j_=(e,t)=>{let n=A_(e),r=U(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=e=>r($h(t,Yh(t.scope,n,e)));if(an(e))return Ii(e),on(e,i),d(e,t);let o=li(e),s=er(o,o.map(i));return sn(e)?s:(s.lambdaDomain=e,ir(s))}let n=[],s=mg(i,e=>fg(W(e,t),e,t.environment.runtime.version));return gg(i,s,t.scope,e=>{let o=i.length===1?w_(a.pattern,e)??!1:di(i.map(t=>w_(t.pattern,e)??!1));return n.push([o,r($h(t,e))]),!1}),ei(n)},c=wg(i,e.body),l=Dg(i),u=O_(e.body),d=(t,n)=>{let a=k_(n.scope,u),o=$h(n,a),s=xg({value:Eg(t,e=>r($h(o,yg(i,a,e))),Tg(c,i,t),l),bounds:i,body:e.body,scope:a});return i.length===1?ir(s):s},f=t.callStack;return{build:(t,r)=>{if(e.isRecursive||n||r.isKeepLazy||!N(t))return d(t,r);if(!(i.length===1?sn(t):typeof t==`object`&&t.kind===`ProductSet`&&t.factors.every(sn))){if(f)return d(t,r);try{return s(t,r)}catch(e){if(!(e instanceof v))throw e;return d(t,r)}}if(!f)return s(t,r);try{return s(t,r)}catch(t){throw d_(f,e,t),t}},createLazy:d}},M_=(e,t)=>{let n=j_(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(vg(r,e),e)},N_=(e,t)=>{let n=T_.has(e);n&&E_(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):di(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s($h(i,Yh(i.scope,`@`,e))):fa(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(xt.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${H(e.function)}`)}return n}},P_=(e,t)=>{let n=U(e.predicate,t),r=e.bound.pattern,i=e.predicate.location.range,a=i&&{names:r.kind===`Name`?r.name:r.names.join(`, `),predicate:h(i)},o=Lh(e.predicate),s=t.coverage,c=(e,t,n)=>{if(!s||e===-1)return n();t||s.secondary[e]++;let r=Io(s,t?-1:e,n);return!t&&r===!0&&s.secondary[e]++,r},l=(t,n,i,s)=>({kind:`FilteredSet`,base:t,test:(e,t)=>{if(r.kind===`Tuple`&&Vi(e)?.length!==r.names.length)throw new v(`Attempted to check if the value:\n${j(L(e))}\nis an element of a set of ${r.names.length}-tuples.`);let a=c(s,t,()=>i($h(n,Xh(n.scope,r,e))));if(typeof a!=`boolean`)throw new v(`${t?`The evaluation of predicate`:`Evaluating predicate`} ${o} yielded non-Boolean value.`);return a},source:a,rebind:r=>l(t,{...n,environment:r},U(e.predicate,r),-1)});return(e,t,r=-1)=>l(e,t,n,r)},F_=(e,t)=>{if(typeof e!=`boolean`)throw new v(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${_s(e)}.\n${Lh(t.predicate)}`);return e},I_=(e,t,n,r)=>{if(!M(e)||Bn(e))throw new v(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${H(t)}`);return Wr(e),fg(e,n,r)},L_=e=>new v(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${H(e)}`),R_=(e,t)=>{if(e.kind===`SetFilter`){let n=U(e.predicate,t),r=U(e.bound.set,t),i=P_(e,t),a=e.bound.pattern,o=t.coverage;return t=>{let s=r(t);if(!sn(s))return i(s,t,o?.current);let c=[],l=r=>{let i=n($h(t,Xh(t.scope,a,r)));F_(i,e)&&rn(c,r)},u=s.kind===`Interval`?s:P(s).elements;return on(u,l),o&&o.current!==-1&&(o.secondary[o.current]+=(Array.isArray(u)?u.length:u.high-u.low+1)+c.length),$n(c)}}if(e.kind===`SetMap`){let n=U(e.expression,t);return t=>{let r=[];return _g(e.bounds,t,e=>(rn(r,n($h(t,e))),!1)),Yr(r)}}let n=e.set;if(!n)return()=>{throw new v(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${H(e)}`)};let r=U(e.body,t),i=U(n,t);return t=>{let a=I_(i(t),e,n,t.environment.runtime.version),o,s=e.pattern;if(pg(a,n=>{if(s.kind===`Tuple`&&Vi(n)?.length!==s.names.length)throw new v(`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(e)}`);let i=Xh(t.scope,s,n);return ig(r($h(t,i)),e)?(o=w_(s,i),!0):!1}),o===void 0)throw L_(e);return o}},z_=e=>[...e].sort((e,t)=>qn(e.name,t.name)),B_=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),V_=(e,t)=>{let n=z_(e),r=B_(n),i=n.map(e=>U(e.value,t));if(r)return e=>fi(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=>vn(a,i.map(t=>t(e)),o):e=>pi(a,i.map(t=>t(e)))},H_=(e,t)=>{let n=e=>U(e,t);switch(e.kind){case`Number`:{let t=e.value;return fn(t)?()=>t:()=>{throw Gh(e)}}case`Decimal`:return()=>{throw Wh(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return g_(e,t);case`Apply`:return S_(e,t);case`Bracket`:return()=>{throw new v(`A bracket without a function or subscript is not an expression at ${Ph(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new v(`An operator cannot be used as a value at ${Ph(e)}`)};case`And`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw zh(e,r,i);if(!i)return!1}return!0}}case`Or`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw zh(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return e=>t(s_(e))}case`Unchanged`:return c_(n(e.expression));case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw Rh(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new v(`A non-boolean expression (${_s(t)}) was used as a condition of a CASE. ${Lh(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new v(`Attempted to evaluate a CASE with no conditions true.\n${H(e)}`)}}case`Let`:{let t=n(e.body);return n=>t($h(n,t_(e.definitions,n)))}case`Forall`:case`Exists`:return C_(e,t);case`UnboundedQuantifier`:return()=>{let t=e.quantifier===`Forall`?`\\A`:`\\E`;throw e.isTemporal?Ih(e.quantifier===`Forall`?`\\AA`:`\\EE`,e):new v(`TLC attempted to evaluate an unbounded ${t}.\nMake sure that the expression is of form ${t} x \\in S: P(x).\n${H(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return R_(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Yr(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>di(t.map(t=>t(e)))}case`FunctionConstruction`:return M_(e,t);case`FunctionSet`:{let t=n(e.domain),r=n(e.range);return e=>({kind:`FunctionSet`,domain:t(e),range:r(e)})}case`Record`:return V_(e.fields,t);case`RecordSet`:{let t=z_(e.fields),r=t.map(e=>e.name),i=t.map(e=>n(e.value));return e=>({kind:`RecordSet`,names:r,sets:i.map(t=>t(e))})}case`Except`:return N_(e,t);case`ExceptAt`:return t=>{let n=Jh(t.scope,`@`);if(n?.kind!==`Value`)throw new v(`@ appears outside an EXCEPT at ${Ph(e)}`);return n.value};case`FunctionApplication`:{E_(e.function);let r=n(e.function),i=t=>Zh(r(Qh(t)),e),a=e.args.map(n),o=Vh(t.runtime.version);if(a.length===1){let e=a[0];return t=>la(i(t),e(t),o)}return e=>la(i(e),di(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=Bh(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=c_(n(e.subscript)),i=e.kind===`BoxAction`,a=i?`[A]_e`:`<A>_e`;return n=>{let o=t(n);if(typeof o!=`boolean`)throw new v(`Attempted to evaluate an expression of form ${a}, but A was not a boolean.\n${H(e)}`);return i?o||r(n):o&&!r(n)}}case`Enabled`:{let t=e.expression;return e=>wh(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new v(`The subexpression reference at ${Ph(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw Ih(Fh[e.kind],e)}}},U_=`tlc2/value/impl/`,W_={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},G_={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},K_=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)}},q_=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),J_=[[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(`/`,`.`)??q_.get(e[3])}${`[]`.repeat(e[1].length)}`),X_=(e,t)=>e[e[t].first].text,Z_=(e,t)=>X_(e,t).replaceAll(`/`,`.`),Q_=e=>{let t=K_(e);if(t.readUint32()!==3405691582)throw new r(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],i=t.readUint16(),a=new TextDecoder;for(let e=1;e<i;e++){let r=t.readUint8(),i={tag:r,text:``,value:0,first:0,second:0};n[e]=i,r===W_.utf8?i.text=a.decode(t.readBytes(t.readUint16())):r===W_.integer?i.value=t.readInt32():r===W_.float?t.readUint32():r===W_.long||r===W_.double?(t.readBytes(8),e++):r===W_.class||r===W_.string||r===W_.methodType||r===W_.module||r===W_.package?i.first=t.readUint16():r===W_.methodHandle?(t.readUint8(),i.first=t.readUint16()):(i.first=t.readUint16(),i.second=t.readUint16())}t.readUint16();let o=Z_(n,t.readUint16());t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let s=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,a=i.indexOf(`)`),c=Y_(i.slice(1,a)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:K_(t.readBytes(t.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>Z_(n,d.readUint16())):[],p=J_.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:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${o}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:s}},$_=(e,t)=>{let n=e[t],r=e[n.second];return{className:X_(e,n.first),name:e[r.first].text}},ev=(e,n,r,i)=>{let a=()=>new t(`The Java override ${r}.${e.name} computes its value, which tla-ts cannot run`),o=e.code;if(!o)throw a();let s=[],c=()=>{let e=s.pop();if(e===void 0)throw a();return e},l=e=>{let t=n[e];if(t.tag===W_.integer)return t.value;if(t.tag===W_.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>=G_.iconstM1&&t<=G_.iconst5)s.push(t-G_.iconst0),e+=1;else if(t===G_.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===G_.sipush)s.push(r()<<16>>16),e+=3;else if(t===G_.ldc)s.push(l(o[e+1])),e+=2;else if(t===G_.ldcW)s.push(l(r())),e+=3;else if(t===G_.dup){let t=c();s.push(t,t),e+=1}else if(t===G_.getstatic){let t=$_(n,r());if(t.className!==`${U_}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===G_.invokestatic){let t=$_(n,r()),o=c();if(t.className!==`${U_}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===G_.new)s.push({className:X_(n,r()),value:void 0}),e+=3;else if(t===G_.invokespecial){let t=$_(n,r()),o=c(),s=c();if(!(t.className===`${U_}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===G_.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()},tv=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Q_(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:ev(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)}))}},nv=O(`EOF`),rv=O(`IDENTIFIER`),iv=O(`DEFBREAK`),av=(e,t)=>Array.from({length:O(t)-O(e)+1},(t,n)=>O(e)+n),ov=new Set(av(`op_57`,`op_119`)),sv=new Set(av(`op_1`,`op_119`)),cv=new Set(av(`op_57`,`op_70`)),lv=/* @__PURE__ */ new Set([...av(`ACTION`,`EXCEPT`),O(`EXTENDS`),...av(`IF`,`SF`),O(`STATE`),...av(`THEN`,`WITH`),O(`US`),...av(`op_112`,`op_116`)]),uv=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),dv=new Map([...uv(`postfix`,160,160,!0,`[`),...uv(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...uv(`prefix`,120,120,!1,`-.`),...uv(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...uv(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...uv(`prefix`,40,40,!0,`\\lnot`),...uv(`nfix`,100,130,!0,`\\times`),...uv(`infix`,140,140,!1,`^`,`^^`),...uv(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...uv(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...uv(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...uv(`infix`,100,110,!0,`|`,`||`,`%%`),...uv(`infix`,100,110,!1,`%`),...uv(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...uv(`infix`,90,140,!1,`\\wr`),...uv(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...uv(`infix`,90,130,!1,`!!`),...uv(`infix`,90,90,!1,`...`,`..`),...uv(`infix`,80,80,!0,`\\intersect`,`\\union`),...uv(`infix`,80,80,!1,`\\`),...uv(`infix`,70,70,!1,`<:`,`:>`),...uv(`infix`,60,60,!0,`@@`),...uv(`infix`,50,140,!0,`\\cdot`),...uv(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...uv(`infix`,30,30,!0,`\\land`,`\\lor`),...uv(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...uv(`infix`,10,10,!1,`=>`)]),fv=new Map([...dv,...Xf.flatMap(e=>e.slice(1).map(t=>[t,dv.get(e[0])]))]),pv=fv.get(`[`),mv={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},hv=e=>({type:`tokens`,kinds:new Set(e)}),gv=e=>typeof e==`string`?e.startsWith(`<`)?hv([O(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(gv)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),_v=e=>(...t)=>({type:e,body:G(...t)}),q=_v(`zeroOrMore`),vv=_v(`oneOrMore`),J=_v(`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}),yv=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),bv=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=yv(e,n);return n},xv=(...e)=>{let t=e.map(O);return e=>t.includes(bv(e,1).kind)},Sv=(e,t=bv(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Cv=e=>{let t=bv(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},wv=e=>xv(`CASESEP`)(e)&&Sv(e),Tv=e=>{let t=bv(e,1);lv.has(t.kind)&&(t.kind=rv)},Ev=(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}`,Dv=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),Ov=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},kv=e=>e.operatorStacks[e.operatorStacks.length-1],Av=(e,t)=>e.low>t.high,jv=(e,t)=>e.high<t.low,Mv=e=>e.fix===`prefix`?e:fv.get(`${e.name}.`),Nv=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===pv?Dv(`FcnAppl`,[n,...r.node.heirs]):Dv(`PostfixExpr`,[n,r.node]),operator:void 0})},Pv=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Dv(`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:Dv(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Fv=e=>{let t=kv(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),Fv(e);if(i.operator!==void 0){let t=Mv(r.operator);return t!==void 0&&Av(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Ev(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 ${Ev(e,a.node.first,a.node.last)} and expression at location ${Ev(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return jv(a.operator,r.operator)?void 0:Av(a.operator,r.operator)?(Pv(t,a.operator),Fv(e)):`Precedence conflict between ops ${a.operator.name} in block ${Ev(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Mv(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(jv(s,r.operator))return;if(!Av(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Ev(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Pv(t,s),Fv(e);let c=Ev(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===mv?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},Iv=e=>Y(t=>{let n=kv(t),r=Ov(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:Fv(t)}),Lv=Iv(()=>!1),Rv=Iv(()=>!0),zv=Y(e=>{e.lastOperator=fv.get(e.token.image)}),Bv=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},Vv=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?Bv(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Hv=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Sv(e,n.first.beginColumn))return n;let t=Hv(e,n);if(t!==void 0)return t}},Uv=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(O),n=(e,...t)=>t.some(t=>e.kind===O(t)),r=e=>e!==void 0&&ov.has(e.kind),i=e.token,a=yv(e,i);i.next=void 0;let o=yv(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===rv&&(e=e.next)}else if(e.kind===rv){let t=e.next;!r(t)||cv.has(t.kind)||sv.has(t.kind)&&t.next?.kind!==rv||(e=t.next?.kind===O(`SUBSTITUTE`)?i:sv.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==iv&&(e.next={kind:iv,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=yv(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Wv=e=>{let t=bv(e,1);if(t.kind===O(`LAB`)){let n=1;for(;n!==0;)if(t=yv(e,t),t.kind===O(`LAB`)&&n++,t.kind===O(`RAB`)&&n--,t.kind===nv)return!1;return yv(e,t).kind===O(`IN`)}if(t.kind!==rv)return!1;for(t=yv(e,t);t.kind===O(`COMMA`);){if(t=yv(e,t),t.kind!==rv)return!1;t=yv(e,t)}return t.kind===O(`IN`)},Gv=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Kv=e=>e.proofLevels.at(-1)??-1,qv=e=>{let t=bv(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:xv(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Kv(e)>=0&&Gv(t)>Kv(e):xv(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Jv=(e,t)=>{let n=Gv(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=>Y(t=>Jv(t,t.token)?void 0:`${Ev(t,t.token)}: ${e}`),Xv=hv([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(O)),Zv=hv([...Xv.kinds,O(`op_76`)]),Qv=hv(sv),$v=hv(cv),ey=hv([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(O)),ty=()=>q(Z({expansion:[K(Xv,`<op_77>`)],semantic:Sv}),K(`PrefixOp`,`InfixOp`),Rv),ny=()=>K(G(Z({expansion:[`OpenStart`],semantic:Sv}),`OpenExpression`,Lv),G(Z({semantic:Sv}),`ExtendableExpr`)),ry=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),iy=()=>K(G(Z({semantic:e=>xv(`ASSUME`,`BOXASSUME`)(e)||bv(e,2).kind===O(`COLONCOLON`)&&[O(`ASSUME`),O(`BOXASSUME`)].includes(bv(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),ay=()=>[`JuncItem`,q(Z({semantic:Cv}),`JuncItem`)],oy=e=>Y(t=>{t.expecting=e,Tv(t)}),sy=e=>Y(t=>{t.isTerminalProof=e}),cy=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{Uv(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),ly={CompilationUnit:Q(void 0,[Y(Uv),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>`),oy(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,oy(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,oy(`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(Uv)),G(Z({semantic:e=>xv(`USE`)(e)&&bv(e,2).kind!==O(`ONLY`)||xv(`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(cy(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),cy(`Expression`,Z({expansion:[`<IDENTIFIER>`,$v]}),`PostfixLHS`,`Expression`),cy(`Expression`,Z({expansion:[`<IDENTIFIER>`,Qv]}),`InfixLHS`,`Expression`),cy(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),cy(`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`,[Zv,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,Qv,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,$v]),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>`,oy(`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,[Xv,zv]),NonExpPrefixOp:Q(void 0,[Zv,zv]),InfixOp:Q(`Infix Op`,[Qv,zv]),PostfixOp:Q(void 0,[$v,zv]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{Uv(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),iy(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),iy(),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=Ov(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Ev(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(Uv),K(G(Z({amount:3}),Z({semantic:xv(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:qv}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>xv(`BY`)(e)||bv(e,2).kind===O(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>bv(e,2).kind!==O(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,sy(!0),J(`<ONLY>`)),G(`<USE>`,sy(!1),J(`<ONLY>`)),G(`<HIDE>`,sy(!1))),X("an expression, `MODULE' or `DEF'"),J(ry(),q(`<COMMA>`,X(`MODULE or expression`),ry(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),ry(),q(`<COMMA>`,X(`MODULE or expression`),ry(),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`),ey,Yv(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:qv}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),ey,Yv(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:xv(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:xv(`INSTANCE`)}),`Instantiation`),G(Z({semantic:xv(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:qv}),Y(e=>{let t=Ov(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Ev(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),vv(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:xv(`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(Zv,Qv,$v),hv([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(O))],semantic:Sv}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Ev(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:Sv}),`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:Wv}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),vv(`<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=Ov(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`)),vv(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:Wv}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>bv(e,2).kind===O(`MAPTO`)&&lv.has(bv(e,1).kind)}),Y(e=>{bv(e,1).kind=rv}),`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=Dv(`FcnAppl`,t.heirs),e.lastOperator=pv})),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>`,vv(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(Tv),`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===O(`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=>wv(e)&&bv(e,2).kind!==O(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:wv}),`<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`,[vv(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=bv(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...ay()),G(Z({expansion:[`<AND>`]}),...ay())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Hv(t,e.heirs[1]);return n&&`Item at ${Ev(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Ev(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([])}),ty(),ny()],(e,t)=>{let n=kv(t);n.push({node:e.heirs[0],operator:mv});let r=Fv(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`),Lv,q(K(G(Z({expansion:[`PostfixOp`],semantic:Sv}),`PostfixOp`,Rv),G(Z({expansion:[`<DOT>`],semantic:Sv}),`<DOT>`,Y(Tv),Z({semantic:Sv}),`Identifier`,Y(e=>{let t=kv(e);t[t.length-1].operator!==void 0&&Nv(t,t.length),t[t.length-1]={node:Dv(`RecordComponent`,[t[t.length-1].node,Ov(e,2),Ov(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:Sv}),X(`function argument`),`SBracketCases`,Iv(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:Sv}),`InfixOp`,Rv,ty(),ny()),G(Z({expansion:[`<COLONCOLON>`],semantic:Sv}),`<COLONCOLON>`,Y(e=>{let t=kv(e);if(!Vv(t[t.length-1].node))return`\`::' at ${Ev(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=kv(e),n=Ov(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!jv(r,e.lastOperator)){let t=Ov(e,3);return`Removing label at ${Ev(e,t.first,t.last)} would change expression parsing.`}t.push({node:Dv(`Label`,[Ov(e,3),Ov(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:Sv}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:Sv}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>Kv(e)<0&&e.proofLevels.length<=1?`${Ev(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Ev(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:Bv(e.heirs)===void 0?e.heirs.length===1?Dv(`GeneralId`,e.heirs):void 0:Dv(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>bv(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=>bv(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Ev(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},uy=/* @__PURE__ */ new Map,dy=e=>{let t=uy.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=dy(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,dy(ly[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 uy.set(e,n),n},fy=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},py=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=yv(e,e.scanPosition)),e.scanPosition=yv(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`},my=(e,t)=>{if(t.type===`tokens`)return py(e,t.kinds);if(t.type===`call`)return my(e,ly[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||fy(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=my(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||fy(e,t.semantic)?my(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=my(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=my(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},hy=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=my(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},gy=(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||dy(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!dy(a).hasSemanticStart?dy(a).first.has(bv(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):hy(e,i,a)&&(o===void 0||o(e))}),_y=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,my(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=yv(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===nv){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=yv(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${et(e.token.image)}" `},vy=(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??_y(e)}\n\nResidual stack trace follows:\n${r}`,!1},yy=(e,t)=>{let n=yv(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,vy(e))},by=(e,t)=>{let n=ly[t];n.message!==void 0&&(e.messages.push({name:n.message,token:bv(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!xy(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 vy(e,i);let a=r.node??(r.heirs.length===0?void 0:Dv(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},xy=(e,t)=>{if(t.type===`tokens`)return yy(e,t.kinds);if(t.type===`call`)return by(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||vy(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||vy(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||xy(e,t));if(t.type===`choice`){let n=gy(e,t.alternatives);return n===-1?vy(e):xy(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!xy(e,t.body))return!1;if(t.type===`optional`)return gy(e,[t.body])===-1||xy(e,t.body);for(;gy(e,[t.body])===0;)if(!xy(e,t.body))return!1;return!0},Sy=e=>{let t=Qe(e),n={kind:nv,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=xy(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
|
-
`)},
|
|
1784
|
-
`)}\n`},nb=(e,t,n=ke(e,t===`tlapm`))=>{let i=t===`tlapm`,a=i?n:n.map(we),o=0,s=[],c,l,u=[],d=/* @__PURE__ */ new Set,f=[],p=[],m=e=>u[u.length-1].has(e),g=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),ee=[],_=[],v=[],y=(e,t=o-1)=>{let n=e===t?v[e]:void 0;if(n)return n;let r=a[t];ee[e]??=g(a[e]),_[t]??={line:r.line,column:r.endColumn};let i={module:p[0].name,start:ee[e],end:_[t]};return e===t&&(v[e]=i),i},b=(e,t)=>(e.location.range=y(t),e),te=(e=0)=>a[Math.min(o+e,a.length-1)],x=(e=0)=>{let t=te(e),n=s[s.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ne=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ie=0,ae=e=>{let t=a.slice(ie,o).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},oe=e=>i&&(e.kind===`Keyword`||Xy.has(e.text)),se=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},ce=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Ry.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:oe(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,le=(e,t=te(),n)=>{let i=a[a.length-1],o=t.line===i.line&&t.column===i.column;return new r(`${e} at line ${t.line}, column ${t.column}`,void 0,ue(e,t,o,n))},ue=(e,t,n,r)=>{if(i&&n){let e=a[a.length-1];return{reason:`Unexpected EOF`,...ae(se(e)),isEnd:n}}return i&&r?{reason:`Unexpected ${ce(r)}`,...se(r),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},de=(e,t=te())=>le(e,t,t),fe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!oe(e),S=(e,t=0)=>{let n=x(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},C=()=>{let e=x();if(e.kind===`End`)throw le(`Unexpected end of expression`);return o++,e},w=e=>S(e)?(o++,!0):!1,T=e=>{if(!S(e))throw de(`Expected ${JSON.stringify(e)} but found ${ne(x())}`);return C()},me=()=>{let e=x();if(e.kind!==`Identifier`)throw de(`Expected an identifier but found ${ne(e)}`);if(oe(e))throw de(`Unexpected keyword ${e.text}`);return o++,e.text},he=()=>{let e=o;return{name:me(),range:y(e)}},ge=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),_e=()=>{let e=x();return e.kind!==`String`&&(ky.has(e.text)||Ty.has(e.text)||Dy.has(e.text))?(o++,e.text):me()},ve=!1,ye=()=>x().kind===`Identifier`||!fe(x())?me():(ve=!0,C().text),be=e=>{if(!i)return e();s.push(-1);let t=e();return s.pop(),t},E=(e,t=`,`)=>{let n=[e()];for(;w(t);)n.push(e());return n},xe=()=>{if(S(`<<`)){let e=1;for(;x(e).kind===`Identifier`||S(`,`,e);)e++;return S(`>>`,e)&&S(`\\in`,e+1)}let e=0;for(;x(e).kind===`Identifier`;){if(S(`\\in`,e+1))return!0;if(!S(`,`,e+1))return!1;e+=2}return!1},Se=()=>{if(S(`::`))return!0;if(!S(`(`))return!1;let e=1;for(;x(e).kind===`Identifier`&&S(`,`,e+1);)e+=2;return x(e).kind===`Identifier`&&S(`)`,e+1)&&S(`::`,e+2)},D=()=>{if(!w(`<<`)){let e=he();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=ge(S(`>>`)?[]:E(he));return T(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Ce=()=>E(()=>{let e=E(D);T(`\\in`);let t=k();return e.map(e=>({pattern:e,set:t}))}).flat(),Te=()=>{let e=x();if(i&&Xy.has(e.text)){let t=o;C();let n={kind:`Identifier`,name:e.text,location:g(e)};return{subscript:b(n,t),lastArgs:[]}}let t=i&&(e.kind===`Number`||e.kind===`String`||S(`@`));if(e.kind===`Identifier`){let t=o,n=[],r=[],a=e=>(r.push(y(o,o)),n.push(me()),e&&S(`(`)?je():[]),s=[a(!i)];for(;S(`!`)&&x(1).kind===`Identifier`;)C(),s.push(a(!0));let c=s.slice(0,-1),l=g(e);l.range={...y(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(S(`<<`)||S(`(`)||S(`{`)||S(`[`)||t){let e=o,t=Be();return{subscript:t.location.range?t:b(t,e),lastArgs:[]}}throw de(`Expected a subscript but found ${ne(e)}`)},Ee=e=>{let t=x(1),n=x(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`&&S(`==`,Dy.has(n.text)?3:4))},De=e=>{let t=x(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||S(`,`,1)||S(`)`,1)||t.kind===`Keyword`&&Py.has(t.text)||Ee(e)},Oe=()=>{let e=x(),t=e.kind===`Operator`&&(Ty.has(e.text)||Oy.has(e.text))&&De(e);if(i&&e.kind!==`String`&&(Oy.has(e.text)||My.has(e.text)&&e.text!==`'`&&!Ey.has(e.text)||jy.has(e.text)&&x(-1).text===`(`&&x(-1).line===e.line&&x(-1).endColumn+1===e.column&&x(1).text===`)`&&x(1).line===e.line&&x(1).column===e.endColumn+1)&&De(e))throw le(`incomplete expression`,e);if(t&&!i&&e.text===`\\X`&&e.spelling!==`×`)throw le(`\\X may not be used as an infix operator`,e);if(t)return o++,b({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:g(e)},o-1);if(e.kind!==`String`&&My.has(e.text)&&De(e)){o++;let t=g(e);if(Ey.has(e.text))return b({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o-1);let n={kind:`Identifier`,name:`argument`,location:t};return b({kind:`Lambda`,params:[n.name],body:eb(e.text,n,t),operator:e.text,location:g(e)},o-1)}if(S(`LAMBDA`)){let t=o;C();let n=ge(E(he));T(`:`);let r=k();return b({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:g(e)},t)}return k()},Ae,je=()=>be(()=>{let e=o;T(`(`);let t=E(Oe);return T(`)`),Ae=y(e),t}),Me=()=>{let e=C();s.push(e.column);let t=[k()];for(;Qy(te())&&te().text===e.text&&te().column===e.column;)o++,t.push(k());return s.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:g(e)}},O=e=>be(()=>{let t=g(e),n=x().kind===`Identifier`,r=S(`|->`,1)&&(n||fe(x()));if(r||n&&S(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o,n=g(x()),i=e();return n.range=y(t),T(r?`|->`:`:`),{name:i,value:k(),location:n}},a=[i(()=>n?me():C().text),...w(`,`)?E(()=>i(me)):[]];return T(`]`),{kind:e,fields:a,location:t}}if(xe()){let e=o,n=Ce();if(!i||S(`|->`)){T(`|->`);let e=k();return T(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}o=e}let a=k();if(w(`->`)){let e=k();return T(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(w(`EXCEPT`)){let e=E(()=>{T(`!`);let e=[];for(;S(`.`)||S(`[`);)if(w(`.`)){if(!fe(x()))throw de(`Expected a field name but found ${ne(x())}`);if(!i&&S(`@`))throw de(`@ used in !.@`);e.push({kind:`Field`,name:C().text})}else T(`[`),e.push({kind:`Index`,args:E(()=>k())}),T(`]`);return T(`=`),{path:e,value:k()}});return T(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!S(`]_`)){let e=[a];for(;w(`,`);)e.push(k());return T(`]`),{kind:`Bracket`,args:e,location:t}}return T(`]_`),{kind:`BoxAction`,action:a,subscript:Te().subscript,location:t}}),Ne=()=>{let e=o,t=b(He(),e),n=g(C());return b({kind:`Apply`,operator:`\\in`,args:[t,k()],location:n},e)},Pe=e=>be(()=>{let t=g(e);if(w(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(xe()&&(x(1).text===`\\in`||S(`<<`))){let e=o,n=D();T(`\\in`);let r=k();if(w(`:`)){let e=k();return T(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o=e}let n=x().kind===`Identifier`&&S(`\\in`,1)?Ne():k();if(w(`:`)){let e=Ce();return T(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;w(`,`);)r.push(k());return T(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Fe=e=>{let t=g(e),n=be(()=>S(`>>`)||S(`>>_`)?[]:E(()=>k()));if(w(`>>_`)){if(n.length!==1)throw le(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:Te().subscript,location:t}}return T(`>>`),{kind:`Tuple`,elements:n,location:t}},Ie=e=>{let t=g(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&xe()){let e=Ce();return T(`:`),{kind:n,bounds:e,body:k(),location:t}}let i=ge(E(he));return T(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:k(),isTemporal:r,location:t}},Le=e=>{let t=[];do{let n=o;if(w(`OTHER`))return T(`->`),{kind:`Case`,arms:t,other:k(),otherRange:y(n),location:g(e)};let r=k();T(`->`),t.push({condition:r,body:k()})}while(w(`[]`));return{kind:`Case`,arms:t,other:void 0,location:g(e)}},Re=()=>{let e=x(1);return S(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Ny.has(e.text)||e.kind===`Operator`&&(Ty.has(e.text)||Dy.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&ky.has(e.text))},ze=()=>{let e=C();if(e.kind===`Number`)return{kind:`Operand`,operand:pe(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return o--,{kind:`Bound`,args:je()}}return{kind:`Name`,name:e.text,args:S(`(`)?je():[]}},Be=e=>{let n=o,r=C(),a=g(r);if(i&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=E(me);return T(`:`),{kind:`Lambda`,params:e,body:k(),location:a}}if(r.kind===`Number`){if(i&&/^\\[BOH]/.test(r.text))throw le(`incomplete expression`,r);return{kind:`Number`,value:pe(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`&&at(r);if(!i&&s&&nt()<0&&tt.length<=1)throw le(`Step number used outside proof`,r);if(s&&r.text[1]===`+`)throw le(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||s){let t=s?ot(r)??r.text:r.text;if(Se()){let o=ge(w(`(`)?E(he):[]);o.names.length>0&&T(`)`),T(`::`);let s=y(n),l=k();if(!i&&e!==void 0&&c!==void 0&&Zy(l)&&e.high>=c.low)throw le(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:t,params:o.names,paramRanges:o.ranges,head:s,body:l,location:a}}let l=S(`(`);if(t===`@`&&!l&&!Re())return{kind:`ExceptAt`,location:a};let u=l?je():[],d=[l?Ae:void 0];if(!Re())return l?{kind:`Apply`,operator:t,args:u,argumentsRange:Ae,location:a}:{kind:`Identifier`,name:t,location:a};let f=[{kind:`Name`,name:t,args:u}],p=[y(n,n)];for(;Re();)C(),p.push(y(o,o)),Ae=void 0,f.push(ze()),d.push(Ae);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),g=f.flatMap(e=>`args`in e?e.args:[]),ee=f.map(e=>`args`in e?e.args.length:0),_=d.at(-1)??y(n);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:_,selectorRanges:p,argumentRanges:d,location:a}}if(r.kind===`Operator`&&$y(r.text)&&S(`(`)){let e=je();return t===`tlc`&&r.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:a}:{kind:`Apply`,operator:r.text,spelling:r.spelling,args:e,location:a}}if(r.kind===`Operator`&&$y(r.text)&&!i)return{kind:`Identifier`,name:r.text,spelling:r.spelling,location:a};switch(r.text){case`(`:{let e=be(()=>k());return T(`)`),e}case`[`:return O(r);case`{`:return Pe(r);case`<<`:return Fe(r);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Ie(r);case`IF`:{let e=k();T(`THEN`);let t=k();return T(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:k(),location:a}}case`CASE`:return Le(r);case`LET`:{let e=[],t=[];for(u.push(/* @__PURE__ */ new Set);!w(`IN`);){if(i&&S(`RECURSIVE`))throw le(`Unexpected keyword RECURSIVE`,ae(te()));if(w(`RECURSIVE`)){Qe();continue}let n=Ge(!i&&w(`LOCAL`));n.kind===`Instance`?t.push(n):e.push(n)}u.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=D(),t=w(`\\in`)?k():void 0;return T(`:`),{kind:`Choose`,pattern:e,set:t,body:k(),location:a}}case`WF_`:case`SF_`:{let e=Te(),t=!S(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:be(()=>{T(`(`);let e=k();return T(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:a}}}throw de(`Unexpected ${ne(r)}`,r)},Ve=(e,t,n)=>{c=l={low:t,high:n};let r=k(i?Math.min(n+1,Cy.low):n+1),a=x(),o=Dy.has(a.text)?Cy.high:Ty.get(a.text)?.high;if(!i&&a.kind===`Operator`&&o!==void 0&&o>=t)throw le(`Precedence conflict between ${e.text} and ${a.text}`,a);return r},He=()=>{let e=l;l=void 0;let t=x(),n=g(t);if(t.kind===`Operator`&&Qy(t))return Me();if(i&&Ty.has(t.text)&&S(`(`,1)){let e=o,r=be(()=>{C(),C();let r=k();if(!w(`,`))return;let i=k();T(`)`);let a={kind:`Apply`,operator:t.text,args:[r,i],location:n};return b(a,e)});if(r!==void 0)return r;o=e}if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return C(),{kind:`Apply`,operator:`~`,args:[Ve(t,4,4)],location:n};case`-`:case`-.`:if(t.text===`-.`&&!i)break;return C(),{kind:`Apply`,operator:`-.`,args:[Ve(t,12,12)],location:n};case`[]`:return C(),{kind:`Always`,expression:Ve(t,4,15),location:n};case`<>`:return C(),{kind:`Eventually`,expression:Ve(t,4,15),location:n};case`ENABLED`:return C(),{kind:`Enabled`,expression:Ve(t,4,15),location:n};case`UNCHANGED`:return C(),{kind:`Unchanged`,expression:Ve(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return C(),{kind:`Apply`,operator:t.text,args:[i?k(9):Ve(t,10,13)],location:n}}return Be(e)},k=(e=0)=>{let t=o,n=He(),r=n.location.range?n:b(n,t),a;for(;;){let n=x();if(n.kind!==`Operator`)break;let o=g(n);if(n.text===`'`&&e<=15){C(),c=Cy,r=b({kind:`Prime`,expression:r,location:o},t);continue}if(Ey.has(n.text)&&e<=15){C(),c=Cy,r=b({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r],location:o},t);continue}if(n.text===`[`){C();let e=be(()=>E(()=>k()));be(()=>T(`]`)),c=wy,r=b({kind:`FunctionApplication`,function:r,args:e,location:o},t);continue}if(n.text===`.`&&fe(x(1))){C();let e=C().text;r=b({kind:`FieldAccess`,record:r,field:e,location:o},t);continue}let s=Ty.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 le(`Precedence conflict between ${a.text} and ${n.text}`,n)}if(C(),!i&&s.low>12&&S(`-`))throw le(`Precedence conflict between ${n.text} and -`,x());c=l=s;let u=k(s.high+1);if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,i=[y(t).end];r=r.kind===e&&a?.text===n.text?{...r,operands:[...r.operands,u],prefixEnds:[...r.prefixEnds??[],...i]}:{kind:e,operands:[r,u],prefixEnds:i,location:o}}else r=n.text===`\\X`?r.kind===`Product`&&a?.text===`\\X`?{...r,factors:[...r.factors,u]}:{kind:`Product`,factors:[r,u],location:o}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r,u],location:o};r=b(r,t),a={...s,text:n.text}}return r},Ue=()=>{if(!w(`(`))return[];let e=Ze();return T(`)`),e},We=()=>{let e=g(x()),t=k(),n=a[o-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:p[0].name,start:e,end:r}}},Ge=e=>{let t=o;return b(qe(e),t)},Ke=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),qe=e=>{let t=x(),n=o,r=g(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:y(n,o-2),...We(),isLocal:e,isRecursive:m(t),location:r});if(t.kind===`Identifier`&&x(1).kind===`Operator`&&Ty.has(x(1).text)&&x(2).kind===`Identifier`&&S(`==`,3)){let e=he(),t=C().text,n=he();return T(`==`),i(t,[Ke(e),Ke(n)])}let a=t.kind!==`String`&&ky.has(t.text),s=t.kind===`Identifier`&&Dy.has(x(1).text)&&S(`==`,2);if(a||s){let e=a?t.text:x(1).text;a&&C();let n=he();return s&&C(),T(`==`),i(e,[Ke(n)])}let c=me();if(w(`[`)){let t=be(()=>Ce());return T(`]`),T(`==`),{kind:`Function`,name:c,bounds:t,body:k(),isLocal:e,isRecursive:m(c),location:r}}let l=o,u=Ue();return T(`==`),S(`INSTANCE`)?{...Je(c,u,e,r),definitionRange:y(l)}:i(c,u)},Je=(e,t,n,r)=>{let i=o;return T(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ye(),substitutions:w(`WITH`)?E(()=>{let e=o,t=_e(),n=y(e);return T(`<-`),{name:t,nameRange:n,expression:Oe()}}):[],isLocal:n,location:r,instanceRange:y(i)}},Ye=()=>{let e=o;return b(Xe(),e)},Xe=()=>{let e=g(x());if(S(`_`)&&x(1).kind===`Operator`)return C(),{name:C().text,arity:w(`_`)?2:1,location:e};if(x().kind!==`String`&&(ky.has(x().text)||i&&x().kind===`Operator`)&&S(`_`,1)){let t=C().text;return C(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=me();if(!w(`(`))return{name:t,arity:0,location:e};let n=E(()=>T(`_`));return T(`)`),{name:t,arity:n.length,location:e}},Ze=()=>E(Ye),Qe=()=>{let e=Ze();return e.forEach(e=>u[u.length-1].add(e.name)),e},$e=e=>{let t=0,n=e;do{let e=x(n);if(e.kind===`End`)return n;e.kind===`Operator`&&Jy.has(e.text)&&t++,e.kind===`Operator`&&Yy.has(e.text)&&t--,n++}while(t>0);return n},et=()=>{let e=x(),t=x(1);return e.kind===`Identifier`?S(`(`,1)||S(`[`,1)?S(`==`,$e(1)):t.kind===`Operator`&&Dy.has(t.text)?S(`==`,2):t.kind===`Operator`&&Ty.has(t.text)?x(2).kind===`Identifier`&&S(`==`,3):S(`==`,1):e.kind!==`String`&&ky.has(e.text)&&t.kind===`Identifier`&&S(`==`,2)},tt=[],nt=()=>tt[tt.length-1]??-1,rt=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),it=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},at=e=>!e.text.endsWith(`.`)&&!zy.has(it(e)),ot=e=>{let t=it(e);if(zy.has(t))return;let n=rt(e);if(n>=0)return`<${n}>${t}`;let r=nt(),i=tt[tt.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},st=e=>{if(e.kind===`Keyword`)return Iy.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return tt.length===0;if(e.text[1]===`+`||tt.length===0)return!0;let t=nt();return t>=0&&rt(e)>t},ct=e=>{let t=rt(e),n=tt.length-1,r=tt[n-1]??-1,i=tt[n]<0;return i&&(tt[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:tt[n]===t},lt=e=>!d.has(e)&&p.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),ut=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Xy.has(e.name)&&!lt(e.name):!1,dt=()=>{let e=x();return e.kind===`Step`?at(e):e.kind===`Keyword`?Gy.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!et()},ft=()=>{let e=o,t=x();return t.kind===`Operator`&&!Ay.has(t.text)&&$y(t.text)?(o++,b({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:g(t)},e)):w(`MODULE`)?b({kind:`ModuleFact`,name:me(),location:g(t)},e):k()},pt=e=>f[f.length-1]?.add(e),mt=e=>{f.push(/* @__PURE__ */ new Set);let t=e();return f.pop(),t},ht=e=>f.some(t=>t.has(e))||p.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),A=()=>{let e=o,t=x(),n=E(()=>{let e=x();if((e.kind!==`Identifier`||oe(e))&&e.kind!==`Operator`)throw de(`Expected a definition name but found ${ne(e)}`,e);return o++,e.text},`!`),r=g(t);return b(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},gt=()=>{if(i)return E(A);let e=E(ft),n=t===`tlc`?e.find(e=>e.kind===`Identifier`&&ht(e.name)):void 0;if(n)throw le(`DEF clause entry should describe a defined operator`,n.location);return e},_t=()=>{let e=dt()?E(ft):[],t=w(`DEF`)||w(`DEFS`);if(i&&e.length===0&&!t)throw de(`Expected a fact`);return{facts:e,defs:t?gt():[]}},vt=()=>{let e=o,n=C(),r=n.text===`USE`&&w(`ONLY`),i=y(e),a={kind:n.text===`USE`?`Use`:`Hide`,isOnly:r,..._t(),keyword:i,location:g(n)},s=a.kind===`Hide`&&t===`tlc`?a.facts.filter(e=>!ut(e)):[];if(s.length>0)throw re(s.map(t=>({location:h(t.location.range??y(e)),message:`The only expression allowed as a fact in a HIDE is
|
|
1785
|
-
the name of a theorem, assumption, or step.`})));return b(a,e)},yt=()=>{let e=o,t=g(x()),n=w(`NEW`),r=i?o:e,a=i?g(x()):t,s=x().kind===`Keyword`?Ky.get(x().text):void 0;if(!n&&s===void 0)throw de(`Expected a declaration but found ${ne(x())}`);if(s!==void 0&&C(),s===`Variable`){let e=he();return pt(e.name),b({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:a},r)}let c=Ye();pt(c.name);let l=(s??`Constant`)===`Constant`&&S(`\\in`);if(l&&c.arity>0)throw le(`declared symbol with arguments before \\in`);return l&&C(),b({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?k():void 0,nameRange:c.location.range,location:a},r)},bt=()=>{let e=o,t=g(T(`ASSUME`)),n=E(()=>(x().kind===`Identifier`&&S(`::`,1)&&S(`ASSUME`,2)&&(C(),C()),S(`ASSUME`)?mt(bt):x().kind===`Keyword`&&qy.has(x().text)?yt():k()));return T(`PROVE`),b({kind:`AssumeProve`,assumptions:n,conclusion:k(),location:t},e)},j=e=>{let t=0;for(;x(t).kind===`Identifier`&&S(`,`,t+1);)t+=2;return x(t).kind===`Identifier`&&S(e,t+1)},xt=(e,t)=>{e.forEach(pt),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(pt))},St=()=>{let e=x();if(S(`USE`)||S(`HIDE`))return vt();if(S(`INSTANCE`)){let t=o;return b(Je(void 0,[],!1,g(e)),t)}if(S(`DEFINE`)||et()){let t=o;w(`DEFINE`);let n=[Ge(!1)];for(;et();)n.push(Ge(!1));let r={kind:`Define`,definitions:n,location:g(e)};return b(r,t)}if(w(`HAVE`))return{kind:`Have`,expression:k()};if(w(`TAKE`)){let e=xe(),t=ge(e?[]:E(he)),n=e?Ce():[];return xt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(w(`WITNESS`))return{kind:`Witness`,expressions:E(()=>k())};if(w(`PICK`)){let e=j(`:`),t=ge(e?E(he):[]),n=e?[]:Ce();return xt(t.names,n),T(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:k()}}return w(`CASE`)?{kind:`Case`,expression:k()}:{kind:`Assert`,isSuffices:w(`SUFFICES`),statement:S(`ASSUME`)?bt():k()}},Ct=e=>{let n=x();if(n.kind!==`Step`)throw de(`Expected a step number but found ${ne(n)}`,n);if(!ct(n))throw le(`${e?`QED step`:`step`}'s number has bad level`,n);if(t!==`sany`&&rt(n)<0&&ot(n)!==void 0)throw le(`<*> and <+> cannot be used for a named step`,n);return o++,{name:ot(n),token:n.text,location:g(n)}},wt=()=>{let e=o,t=Ct(S(`QED`,1)),n=o,r=/* @__PURE__ */ new Set;f.push(r);let i=w(`QED`)?{kind:`Qed`}:St(),a=y(e),s=y(n),c=st(x());if(c&&!Ly.has(i.kind))throw le(`Proof of a step that does not take a proof`);let l=c?Dt():void 0;return f.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(pt),b({...t,body:i,head:a,statement:s,proof:l},e)},Tt=e=>{if(w(`BY`)){let t=y(o-1);return{kind:`By`,isOnly:w(`ONLY`),..._t(),keyword:t,location:e}}let t=x();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;C();let n=y(o-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Et=()=>{let e=g(x());w(`PROOF`);let t=Tt(e);if(t)return t;let n=[wt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(wt());return{kind:`Steps`,level:nt(),steps:n,location:e}},Dt=()=>{let e=o;tt.push(-1);let t=mt(Et);return tt.pop(),b(t,e)},Ot=()=>x().kind===`Step`||x().kind===`Keyword`&&Iy.has(x().text),kt=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return Uy(e);let n=t.defs[t.defs.length-1]?.location.range;return Hy(Uy({...e,end:e.start}),Uy(n??t.keyword))},At=()=>{let e=o,t=g(x()),n=w(`PROOF`),r=Tt(t);if(r){let t=b(r,e);return{kind:`Leaf`,proof:t,span:Uy(t.keyword),first:e,end:o-1}}let i=x();if(i.kind!==`Step`)throw de(`Expected a step number but found ${ne(i)}`);let a=o;C();let s=o,c=w(`QED`)?{kind:`Qed`}:St(),l=y(a);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:y(s),span:kt(l,c),first:e,start:a,end:o-1}},jt=(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=Mt(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:y(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}},Mt=(e,t,n,r,i)=>{let a=e[t];if(!a)throw Wy(`Unexpected end of (sub)proof at level ${n} before QED step`,r);if(a.kind===`Leaf`)throw Wy(`Expecting a proof step but found a${By[a.proof.kind]} leaf proof`,a.span);if(!i&&a.isProof)throw Wy(`PROOF keyword found in step that does not begin subproof`,a.span);let o=a.token.text[1];if(o===`+`&&!i)throw Wy(`<+> used but no subproof expected`,a.span);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:rt(a.token);if(s<n||!i&&s>n)return;let c=Ly.has(a.body.kind)?jt(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:ot(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{...g(a.token),range:y(a.start,l)}},d=Hy(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=Mt(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:Hy(d,f.span)}},Nt=()=>{if(!Ot())return;let e=[];for(;Ot();)e.push(At());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=jt(e,0,0,t.span),r=e[n.next];if(r)throw Wy(`extra step(s) after finished proof`,r.span,`Proof.Parser.toplevel`);return n.proof},Pt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},Ft=()=>{if(x().kind!==`Identifier`||!S(`==`,1))return;let e=me();return d.add(e),C(),e},It=e=>{let t=o,n=C(),r=Ft(),a=mt(()=>{let e=S(`ASSUME`)?bt():k();return i?{statement:e,proof:Nt()}:{statement:e,proof:st(x())?Dt():void 0}}),s=a.statement,c=b({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`&&Pt(e,b({kind:`Operator`,name:r,params:[],body:s,isLocal:!1,isRecursive:!1,location:g(n)},t))},Lt=()=>{let e=o,t=C(),n=Ft();return b({name:n,expression:k(),isAxiom:t.text===`AXIOM`,location:g(t)},e)},Rt=()=>{let e=g(T(`----`));T(`MODULE`);let t=ye();T(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(p.push(n),u.push(/* @__PURE__ */ new Set),w(`EXTENDS`)&&E(()=>{let e=o;n.extends.push(ye()),n.extendsRanges.push(y(e))});;){let t=o;ie=t;let r=x();if(r.kind===`ModuleEnd`)return e.range={module:p[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},p.pop(),u.pop(),n;if(r.kind===`Separator`){if(S(`MODULE`,1)){let e=Rt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),T(`====`);continue}C()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=g(C()),r=Ze();n.constants.push(...r),e.range=y(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=g(C()),r=E(()=>{let e=o,t=g(x());return b({name:me(),arity:0,location:t},e)});n.variables.push(...r),e.range=y(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Lt();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&Pt(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(S(`USE`)&&S(`ONLY`,1))throw de(`Expected a module unit but found ${ne(r)}`);let e=vt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=g(C()),r=Qe();e.range=y(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:zt(n,b(Je(void 0,[],!1,g(r)),t));continue;case`LOCAL`:if(C(),S(`INSTANCE`)){zt(n,b(Je(void 0,[],!0,g(r)),t));continue}zt(n,b(qe(!0),t));continue}r.kind===`Keyword`&&Fy.has(r.text)?It(n):zt(n,Ge(!1))}}},zt=(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}))},Bt=Rt(),Vt=ve?Sy(e):void 0;if(Vt!==void 0)throw new r(Vt);return Bt},rb=e=>nb(e,`tlc`),ib=(e,t)=>nb(e,`tlc`,t),ab=e=>nb(e,`tlapm`),ob=e=>nb(e,`sany`),sb=`$subexpression`,cb=(e,t)=>new r(`${e} at line ${t.line}, column ${t.column}`),lb=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return lb(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of ht(e)){let e=lb(r,t,n);if(e)return e}},ub=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),db=(e,t)=>{let n=e.location,r=ub(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 cb(`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 cb(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:sb,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:sb,args:e.args,location:n,resolution:Ys},location:n}},fb=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:Ys})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Ys}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Ys};return db({...t,params:[...t.params,...r]},a)},pb=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o=0,s,c=!1,l=(t,r)=>{if(!t)throw cb(r,i);Zs.set(n,{args:e.slice(0,o).flatMap(e=>`args`in e?e.args:[]),error:{location:h(t),message:r}}),c=!0},u=n=>{let r=[],a=[];for(;o<e.length;){let s=e[o];if(s.kind!==`Name`)throw cb(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>yl(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o++}throw cb(`Unknown operator ${r.join(`!`)}`,i)},d=t=>{let c=u(t),d=c.definition,f=nc(d),p=o===e.length-1;if(c.args.length!==f&&(!r||c.args.length!==0))return l(n.argumentRanges?.[o]??i.range,`The operator ${c.name} requires ${f-c.earlier} arguments.`);if(p)return{definition:d,args:c.args};if(d.kind!==`Operator`)throw cb(`Cannot select a subexpression of ${d.name}`,i);a.params.push(...d.params),a.args.push(...c.args),s=d.body,o++},f=()=>{for(;o<e.length&&!c;){let t=e[o];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o],c=s&&lb(s,t.name,[]);if(!c)return l(i,`Cannot find label \`${t.name}'.`);let u=c.label.params;if(!r&&t.args.length!==u.length)return l(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...u.map(e=>({name:e,arity:0}))),a.args.push(...t.args),s=c.label.body,o++}},p=t=>{if(!s)throw cb(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(s.kind===`Label`){s=s.body,p(t);return}if(s.kind===`Let`){if(t.kind!==`Operand`||Cc(t.operand,1)!==0)throw cb(`A LET/IN expression has only one operand`,i);a.lets.push(s.definitions),s=s.body;return}let n=Dc(s);if(n&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...n.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),s=n.body;return}if(s.kind===`Case`&&t.kind===`Operand`){let n=[...s.arms,...s.other?[{condition:void 0,body:s.other}]:[]],r=n[Cc(t.operand,n.length)],a=e[o+1];if(!r||a?.kind!==`Operand`)throw cb(`A subexpression of CASE must have the form !i!j`,i);o++;let c=Cc(a.operand,2),l=c===0?r.condition:c===1?r.body:void 0;if(!l)throw cb(`Nonexistent CASE operand`,i);s=l;return}if(t.kind!==`Operand`)throw cb(`Unexpected subexpression selector`,i);let r=n?n.sets:Oc(s),c=r?.[Cc(t.operand,r.length)];if(!c)throw cb(`Nonexistent operand specified by the selector`,i);s=c},m=d(void 0);if(c)return n;if(m)return fb(m.definition,{...a,args:m.args});for(f();o<e.length&&!c;){let t=e[o];if(t.kind===`Name`){for(;s?.kind===`Label`;)s=s.body;if(s?.kind!==`Let`)throw cb(`A name selector here must be from a LET clause`,i);a.lets.push(s.definitions);let e=d(s.definitions);if(c)return n;if(e)return fb(e.definition,{...a,args:[...a.args,...e.args]});f()}else p(t),o++}if(c)return n;if(!s)throw cb(`Subexpression selection failed`,i);return db(a,s)},mb=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return wc(e,t,n)},hb=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||ht(e).some(hb),gb=(e,t,n,r=!1)=>{if(!hb(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Sl(e,e=>gb(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>_b(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)=>gb(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Sl(e,e=>gb(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?mb(a.name,[],void 0,t):a.kind===`Apply`?mb(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=pb(o,t,a,r);return c!==a&&Xs.add(c),c},_b=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:gb(e.expression,t,n,!0)}))}),vb=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},yb=(e,t)=>_b(e,vb(t.definitions),()=>!1),bb=(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=vb([...t,...e.definitions]),a=e=>n.has(e),o=vb([...t,...e.definitions,...r]),s=e=>gb(e,o,e=>a(e)&&r.every(t=>t.name!==e)),c=e=>a(e)||!i(e),l=e=>gb(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 _b(e,i,c);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?_b(e,i,c):xl(e,l))};case`Have`:case`Case`:return{...e,expression:l(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(l)};case`Take`:return{...e,bounds:d(e.bounds)};case`Pick`:return{...e,bounds:d(e.bounds),body:l(e.body)};case`Assert`:return{...e,statement:f(e.statement)};default:return e}},m=e=>e?.kind===`By`?{...e,facts:u(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:p(e.body),proof:m(e.proof)}))}:e,h={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:f(e.statement),proof:m(e.proof)})),uses:e.uses.map(e=>({...e,facts:u(e.facts)}))};return e.definitions.some(e=>hb(e.body))||e.assumptions.some(e=>hb(e.expression))?{...h,definitions:e.definitions.map(e=>xl(e,s)),assumptions:e.assumptions.map(e=>({...e,expression:s(e.expression)}))}:h},xb=(e,t)=>e.maxLevels[t]??3,Sb=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=Ou({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,i=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>au(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>au(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>ou(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=nu(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&au(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(ku(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,a=h(t.location.range??{module:t.instancer,start:t.location,end:t.location}),o=e=>r.set(`${a}\n${e}`,{location:a,message:e}),s=e(t.module),c=i(t.module),l=n(t.instancer),u=/* @__PURE__ */ new Map;t.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=l.analyze(n,u);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),f=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(d.forEach(e=>{!c.isConstant&&e.level>e.maximumLevel&&o(f(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),d.forEach(e=>{let n=c.constraints.get(e.name);n!==void 0&&e.level>n&&o(f(e.name,n));let r=e.operator;r&&Array.from({length:e.arity},(n,i)=>{let a=c.argConstraints.get(eu(e.name,i));a!==void 0&&xb(r,i)<a&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),c.argParams.forEach(e=>{let n=nu(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=xb(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw re([...r.values()])}},Cb=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],wb=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Tb=new Map(Xf.flatMap(e=>e.map(t=>[t,e[0]]))),Eb=e=>Tb.get(e)??e,Db=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},Ob=()=>{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}}},kb=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:Db(e)&2147483647,kind:t,isLocal:n}),Ab=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:Eb(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:Eb(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}},jb=(e,t)=>{let n=[];for(let r=t;;){let t=Ab(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},Mb=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=jb(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},Pb=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,Fb={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},Ib=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&Pb(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&Pb(e[n+1],e[n+2])?n+=Pb(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=>Fb[e])}"`:r.text)}return t},Lb=e=>e[2]?.text,Rb=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},zb=(e,t)=>e.find(e=>e.name===t)??e.map(e=>zb(e.modules,t)).find(Boolean),Bb=e=>{let t=e===void 0?[]:ke(e),n;return{tokens:t,ranges:Rb(t),getModule:()=>n??=e===void 0?rb(``):ib(e,t)}},Vb=(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=Bb(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:t?.(i)??ep.get(i)??rp.get(i)??tb(e,i),c=a(s),l=c.tokens,u=c.ranges.get(Lb(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:()=>zb(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()}},Hb=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=jb(t,e+1);i.push({location:Mb(t[e]),apply:e=>r.forEach(t=>e.put(kb(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:Mb(n),apply:t=>t.put(kb(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`&&jb(t,u+1).every(e=>s.has(e))&&o(u,`definition`),wb.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(Mb(n)),i.push({location:Mb(n),apply:e=>e.put(kb(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(kb(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=Eb(e.name);i.push({location:e.location,apply:n=>n.put(kb(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(kb(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(kb(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>tc(e.location,t.location)?-1:+!!tc(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=Ob();n.set(i??``,o),Yf.toReversed().forEach(e=>o.put(kb(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},Ub=(e,t)=>{let n=/* @__PURE__ */ new Set,r=e=>{n.add(e)},i=e=>{e.kind===`ModelValue`&&r(e.name),e.kind===`String`&&r(e.value),e.kind===`Set`&&e.elements.forEach(i)};t.constants.forEach(e=>{e.args?.forEach(i),i(e.value)}),Zf.forEach(r);let a=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=Nb(a(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),g=m(e=>e.instances),ee=/* @__PURE__ */ new Set([void 0]),_=/* @__PURE__ */ new Map;Ib(a(void 0)).forEach((e,t)=>{t===3&&$f.forEach(r),r(e)});let v=l(void 0);for(;;){let t=h(v,/* @__PURE__ */ new Set)??g(v,/* @__PURE__ */ new Set);if(!t)break;let[n,i]=t;if(d.add(`${n.key}>${i}`),_.set(n.unit,[..._.get(n.unit)??[],i]),!ee.has(i)){if(ee.add(i),e(i).tokens.length===0){let t=n.unit??Lb(e(void 0).tokens);throw o(i,t)}Ib(a(i)).forEach(r)}}Cb.forEach(r);let y=/* @__PURE__ */ new Set,b=e=>{if(y.has(e))return;y.add(e);let t=_.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(b),a(e).forEach(e=>{e.kind===`String`&&r(e.text)})};return b(void 0),Qf.forEach(r),[...n]},Wb=(e,t)=>{let n=Vb(e,t),r=n.getParsed,i,a=()=>i??=Hb(r);return{getStringOrder:e=>Ub(r,e),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},Gb=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),Kb=e=>{switch(e.kind){case`Number`:if(!fn(e.value))throw x(new c(`TLC can't handle a number this big.\n${e.value}`),ie.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return Xn(e.name);case`Set`:return P({kind:`MixedSet`,elements:e.elements.map(Kb)})}},qb=e=>{try{return Kb(e)}catch(e){throw!(e instanceof v)||e instanceof c||e instanceof se?e:x(new v(`${i}${e.message}`),ie.error)}},Jb=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],Yb=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof r))throw n;let i=Sy(e);throw i===void 0?n:re([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,i)}},Xb=e=>new r(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),Zb=(e,t)=>e.location.range&&t.location.range&&{location:h(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${h(t.location.range)}.`},Qb=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,$b=e=>e===`Theorem`?`ThmOrAssumpDefNode`:Qb(e),ex=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:zl(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),tx=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>L(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new v(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&dr(t,r)})});if(t)return t[1];throw new v(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:L(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},nx=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||ht(e).some(e=>nx(e,t)),rx=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Pl(e),n.get(e)??n.size)),n},ix=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),ax=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Wh(e);if(e.kind===`Number`&&!fn(e.value))throw Gh(e);ax(e.kind===`Let`?[...ht(e),...ix(e.instances??[])]:ht(e))}),ox=(e,t)=>{let n=t.order??Wb(t.source,t.loadModule),i=n.parseModule(t.source),a=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Set,d=new Map(mp.map(e=>[e.name,e])),f=/* @__PURE__ */ new Map,p=Sf(e.checkDeadlock,t.seed);p.isWarningEnabled=t.isWarningEnabled??!0,p.isTool=t.isTool??!1,p.version=t.version??`master`;let m=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Map,y=[],b=/* @__PURE__ */ new Map,te=[],x=[],ne=(e,t)=>te.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ie=0,ae=e=>`${e}#${ie++}`,oe=[],se=[],ce=Sb(e=>{let t=g.get(e)??pe(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)}}),le=/* @__PURE__ */ new Map,ue=/* @__PURE__ */ new Map,de=/* @__PURE__ */ new Map,fe=e=>{let n=f.get(e);if(n)return n;let r=Fp(e,t.print,p,t.files,d);if(!r)return;Pp.get(e)?.forEach(fe);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>fe(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{d.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Zl.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:$l(e,t.name)??i.get(t.name)?.range})}),f.set(e,i),i},S=e=>{let n=Pp.get(e)??[];if(e===`TLCExt`||[e,...n].some(e=>t.loadModule?.(e)!==void 0))return;let r=fe(e);return r&&ne(e,n),r&&n.includes(`Integers`)&&fe(`Integers`),r},C=e=>(ax([...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]),...ix(e.instances)]),e.modules.forEach(C),e);C(i);let w=(e,r)=>{let i=t.loadModule?.(e)??ap(p.version).get(e)??tb(t.source,e);if(i===void 0)throw o(e,r);let a=Yb(i,e,n);if(a.name!==e)throw re([{location:`Unknown location`,message:`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return C(a)},T=e=>{let t=x.indexOf(e.name);if(t!==-1){let n=[...x.slice(t),e.name].map(e=>`${e}.tla`);throw new r(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,i=[],a=[],o=[];x.push(e.name),te.push(n);let s=Se(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:se,levelChecks:o});if(te.pop(),x.pop(),a.length>0)throw re(a,!1,void 0,se);let c=i.find(e=>n.has(e.name)),l=c&&m.get(c.name),u=l&&Zb(c,l.module);if(u)throw re([u],!1,void 0,se);if(c)throw Xb(c);return o.forEach(e=>e()),{linked:s,closure:n}},pe=(e,n)=>{let r=m.get(e);if(r)return ne(e,b.get(e)??[]),r;let i=T(w(e,n)),o=/* @__PURE__ */ new Map;return Np(e,t.print,p,t.files,d,(e,t,n)=>{let r=o.get(e),i=t.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(r?.kind!==`Operator`||!n||i.length!==t.length)throw new v(`No definition of ${e} to fall back to`);let a={kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:void 0};return W(r.body,{environment:n.environment,scope:Zg(a,i,n),state:n.state,next:n.next,isKeepLazy:n.isKeepLazy})})?.forEach(t=>{let n=i.linked.visible.get(t.name);if(n?.kind!==`Definition`||n.arity!==t.arity&&Gb.has(e))return;let r=a.get(n.key);r&&o.set(t.name,r),d.set(n.key,t),a.delete(n.key)}),m.set(e,i.linked),b.set(e,i.closure),ne(e,i.closure),i.linked},me=(e,t,n,r,i)=>{let o=i?void 0:S(e.module);if(o)return he(e,o);let d=i??pe(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=Jb(d),p=`#${ie++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=ul(yb(e,t),f,t,n);oe.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=>u.add(e));let ee=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,_=Kl({params:g,substitutions:new Map([...h].map(([e,t])=>[e,gl(t,m)])),variables:new Set(d.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>s.get(e)===!0,addDefinition:(n,i,o)=>{let u=ae(`${i}@${t.name}`),d=o(u);return a.set(u,d),f.length>0&&l.add(d),e.name!==void 0&&ue.set(u,`${e.name}!${ue.get(n)??i}`),s.set(u,!r),c.set(u,{source:n,prefix:e.params.length}),u},createName:ae,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{...ee.start,range:ee}}}});return ge(e,d.exported,f,(t,n)=>{let r=e.name===void 0?_.getKey(t):_.getQualifiedKey(t);return f.length>0&&le.set(r,{name:n,location:e.location}),e.name!==void 0&&de.set(r,n),r})},he=(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}])),ge=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:s.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},_e=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:Bl(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),ve=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),ye=(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=ve(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:Bl(r,n),location:n}}},be=(e,t,n,r)=>{let i=e.location,o=r?void 0:S(e.module);if(o)return e.name===void 0?[]:[...o].map(([t,n])=>{let r=ve(n.arity);return _e(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??pe(e.module,n),l=`#${ie++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=Jb(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};oe.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=>nx(f(e),p),h=d.map(t=>{let n=ye(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=Kl({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:Bl(e.params,i),location:i,resolution:Ys}:zl(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>s.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:ex(a,i)),i},createName:ae}),_=new Set(d.map(e=>e.name)),v=[...c.exported].filter(([e])=>!_.has(e)).map(([t,n])=>{let r=ee.getKey(n.key),a=ve(n.arity),o=[...e.params,...a];return _e(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...g,...v]},E=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),xe=/* @__PURE__ */ new Map,Se=(e,n)=>{let r=tv(e,t.loadClass?.(e.name),e===i);xe.set(e.name,r.overrides);let o=r.module,c=oe.length,l=new Map([...mp.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...n.symbols]),u=/* @__PURE__ */ new Map,d={location:al,errors:[],warnings:[]},f=[d],p=e=>e.forEach((e,t)=>{let n=m.get(t);if(!n){l.set(t,e),m.set(t,e);return}if(!n.range||!e.range||h(n.range)===h(e.range))return;let r=h(e.range),i=h(n.range);$b(n.kind)===$b(e.kind)?d.warnings.push({location:r,message:`Warning: the ${Qb(n.kind)} of '${t}' conflicts with \nits ${Qb(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${Qb(e.kind)} of '${t}' conflicts with \nits ${Qb(n.kind)} at ${i}.`})}),m=/* @__PURE__ */ new Map,ee=/* @__PURE__ */ new Set,_=/* @__PURE__ */ new Map,v=[],b=[...o.constants],te=o.variables.filter((e,t)=>o.variables.findIndex(t=>t.name===e.name)===t),x=te.map(e=>e.name),ne=te.map(e=>e.location);o.extends.forEach(e=>{let t=n.modules.get(e),r=t?void 0:S(e);if(r){p(r);return}let i=t??pe(e,o.name);b.push(...i.constants.filter(e=>b.every(t=>t.name!==e.name)&&!x.includes(e.name))),i.variables.forEach((e,t)=>{x.includes(e)||b.some(t=>t.name===e)||(x.push(e),ne.push(i.variableLocations[t]))}),p(i.exported),i.facts.forEach(e=>ee.add(e)),i.modules.forEach((e,t)=>_.set(t,e)),v.push(i)});let re=new Map(l),ie=[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))],ae=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});ie.forEach(e=>m.set(e.name,ae(e)));let le=e=>({key:fe(e),arity:nc(e),params:rc(e),kind:ol(o,e)?`Theorem`:`Definition`,range:e.location.range}),ue=b.length===0&&x.length===0,fe=e=>o===i?e.name:`${e.name}@${n.id}`,C=/* @__PURE__ */ new Map,w=()=>new Map([...n.modules,..._]),T=e=>{let t=o.modules.find(t=>t.name===e.module);return t?tc(t.location,e.location)?_.get(t.name):void 0:w().get(e.module)},_e=e=>({imported:l,getInstance:e=>{let t=T(e),n=t?void 0:S(e.module);if(n)return{declarations:[],symbols:he(e,n),instancer:o.name};let r=t??pe(e.module,o.name),i=Jb(r);return{declarations:i,symbols:ge(e,r.exported,i,e=>e),instancer:o.name}},bound:re,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:fe,instanced:C,facts:ee,reports:f,warnings:n.warnings}),ve=e=>[...ie.filter(t=>tc(t.location,e)).map(e=>[e.name,ae(e)]),...o.definitions.filter(t=>tc(t.location,e)).map(e=>[e.name,le(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(l)),ye=e=>{let t=w(),r=t.get(e.name),i=r&&Zb(e,r.module);if(r&&!i)throw Xb(e);n.nested.push(e);let a={location:e.location,errors:[],warnings:[]};f.push(a);let o=Se(e,{id:`${n.id}/${e.name}`,symbols:ve(e.location),modules:t,nested:n.nested,errors:a.errors,warnings:a.warnings,levelChecks:n.levelChecks});i&&a.errors.push(i),r||_.set(e.name,o)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=me(e,o,_e(o),ue,w().get(e.module));C.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||m.set(n,t))})}})),...o.modules.map(e=>({location:e.location,link:()=>ye(e)}))].sort((e,t)=>tc(e.location,t.location)?-1:1).forEach(e=>e.link());let D=bb(Xl(o,(e,t)=>be(e,t,o.name,T(e))),E(l));n.errors.push(...fl(D,_e(D))),D.definitions.forEach(e=>{let t=fe(e);a.set(t,e),s.set(t,!ue);let n=le(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!tc(r,e.location))&&(l.set(e.name,n),e.isLocal||m.set(e.name,n))});let Ce={module:D,constants:b,variables:x,variableLocations:ne,visible:l,exported:m,modules:_,extended:v,facts:/* @__PURE__ */ new Set([...ee,...[...D.theorems,...D.assumptions].flatMap(e=>e.name??[])])};g.has(o.name)||g.set(o.name,Ce);let we=oe.splice(c).map(e=>({location:e.location,check:()=>ce(e)}));return n.levelChecks.push(()=>Au(D,{constants:new Set(b.map(e=>e.name)),variables:new Set(x),getDefinition:e=>a.get(l.get(e)?.key??e),getQualifiedName:e=>de.get(l.get(e)?.key??e)},we,se)),y.push(Ce),Ce},D=T(i).linked,Ce=t.traceFile,we=Ce===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:Ce}}],Te=[...t.moduleOperators??[],...we].map(e=>{let t=pe(e.module,i.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});y.push(...y.splice(y.indexOf(D),1)),se.length>0&&!t.isSanyReported&&t.print(ee(se));let Ee=e=>D.visible.get(e)?.key??e;D.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)}),Te.forEach(e=>{let t=e.key===void 0?void 0:a.get(e.key);e.kind!==`postcondition`&&t&&a.set(e.operator,t)});let De=[],Oe=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Oe(e,t)),De.push(...e.module.assumptions))};Oe(D,/* @__PURE__ */ new Set);let ke=D.constants.map(e=>e.name),Ae=D.variables,je=new Map([...f,...[...m].map(([e,t])=>[e,t.visible]),[i.name,D.visible]]),Me=e=>{let t=je.get(e.module??``)?.get(e.name);return t?.kind===`Definition`?t:void 0},O=e=>{if(e.module===void 0)return[e.name,Ee(e.name)];let t=Me(e);return t?[t.key]:[]},Ne=e=>e.module===i.name?[]:O(e),Pe=e=>{let t=a.get(e);return t?.kind===`Operator`?t.params.length:D.constants.find(t=>t.name===e)?.arity??d.get(e)?.arity??0},Fe=/* @__PURE__ */ new Map,Ie=/* @__PURE__ */ new Set,Le=(e,t)=>{d.set(e,t),a.delete(e),Fe.delete(e),Ie.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=qb(e.value);Ur(t),Ne(e).forEach(e=>{let n=Pe(e);n===0?Fe.set(e,t):Le(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Re=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Re.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new _(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(Kb),Kb(e.value)]),Re.set(t,n)}),Re.forEach(e=>Ne(e).forEach(t=>Le(t,tx(e.name,Pe(t),e.rows))));let ze=new Map(e.substitutions.flatMap(e=>O(e).map(t=>[t,Ee(e.target)])));[...ze.keys()].forEach(e=>Fe.delete(e));let Be=(e,t,n)=>{let r=Ee(t),i=a.get(r);if(!(i!==void 0||d.has(r)||Fe.has(r)||ke.includes(t)||Ae.includes(t)))throw new _(`The configuration file substitutes for ${e} with the undefined identifier ${t}.`);if(i?.kind===`Operator`&&i.params.length!==n)throw new _(`The configuration file substitutes for ${e} with ${t} of different number of arguments.`)};e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,r=t.target;if(!ke.includes(n)&&!D.visible.has(n))throw new _(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===r))throw new _(`In the configuration file, the identifier ${r} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);Be(n,r,D.constants.find(e=>e.name===n)?.arity??D.visible.get(n)?.arity)});let Ve=e.substitutions.filter(e=>e.module!==void 0);[...je.keys()].forEach(e=>{let t=Ve.filter(t=>t.module===e);t.forEach(e=>{let n=Me(e);if(n){if(t.some(t=>t.name===e.target))throw new _(`In the configuration file, the identifier ${e.target} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);Be(e.name,e.target,n.arity)}});let n=t.find(e=>!Me(e));if(n)throw new _(`In the configuration file, the identifier ${n.name} does not appear in the specification.`)});let He=Ve.find(e=>!je.has(e.module??``));if(He)throw new _(`In the configuration file, the module name ${He.module} is not a module in the specification.`);let k=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(Ne)),Ue=(e,t)=>{if(k.has(e))return{key:e,prefix:t};let n=c.get(e);return n&&Ue(n.source,t+n.prefix)};c.forEach((e,t)=>{let n=Ue(e.source,e.prefix),r=a.get(t);if(!n||!r)return;let i=r.kind===`Operator`?r.params:[],o=_e(t,n.key,i,i.slice(n.prefix),r.location);a.set(t,o),D.visible.forEach((e,n)=>{e.key===t&&n!==t&&a.set(n,o)})}),Te.forEach(e=>pe(e.module,i.name).constants.forEach(t=>{let n=e.constants?.[t.name];n!==void 0&&Fe.set(t.name,n)}));let We=ke.filter(e=>!Fe.has(e)&&!ze.has(e)&&!Ie.has(e));if(We.length>0){let e=n.getDeclarationOrder(`constant`).find(e=>We.includes(e))??We[0];throw new _(`The constant parameter ${e} is not assigned a value by the configuration file.`)}Ce!==void 0&&d.forEach((e,t)=>{let n=yp(e);n&&d.set(t,n)});let Ge=rx(Ae,y.flatMap(e=>e.module.variables.map(e=>e.name))),Ke=Wu({definitions:a,substitutions:ze,constants:Fe,variableIndex:Ge,builtins:d,variables:Ae}),qe={runtime:p,definitions:a,builtins:d,constants:Fe,substitutions:ze,instanceNames:ue,variables:Ae,variableIndex:Ge,facts:Ke,startupValues:Array.from({length:Ke.ids.size},()=>void 0),substitutedDefinitions:l,instanceParams:u,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Je=Ou({constants:new Set(Fe.keys()),variables:/* @__PURE__ */ new Set([...Ae,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>d.has(e))]),getDefinition:e=>ag(e,qe)}),Ye=e=>{try{W(e,{environment:qe,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof v)return e;throw e}};ze.forEach((e,t)=>{let n=a.get(e),r=ke.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Je.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Ye(n.body):void 0;if(r){let n=Mt(r)?``:` - specifically: ${r.message}`;throw new _(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),p.version!==`1.7.4`&&(p.isStarted=!0);let Xe=new Set(y.flatMap(e=>e.module.instances.map(e=>e.module))),Ze=n.createDefinitionOrder();return{environment:qe,assumptions:De,variableLocations:D.variableLocations,instanceActions:le,startupDefinitions:y.filter(e=>!Xe.has(e.module.name)||Jb(e).length===0).flatMap(e=>Ze(e===D?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:y.flatMap(e=>xe.get(e.module.name)??[]),moduleOperators:Te,rootName:i.name}},sx={kind:`Boolean`,value:!0},cx={kind:`Boolean`,value:!1},lx=e=>e?sx:cx,ux=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,dx=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,fx=(e,t)=>({kind:e,body:t}),px=(e,t,n)=>({kind:e,operands:[t,n]}),mx=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?mx(e,t.operands).operands:[t])}),hx=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return hx(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,hx(t)),0)}},gx=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return gx(e.body);case`And`:case`Or`:return e.operands.some(gx)}},_x=/* @__PURE__ */ new WeakMap;let vx=0;const yx=e=>{let t=_x.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${vx++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(yx).join(`,`)})`;default:return`${e.kind}(${yx(e.body)})`}})();return _x.set(e,n),n},bx=(e,t)=>e===t||yx(e)===yx(t),xx=(e,t)=>{let n=yx(t);return e.some(e=>e===t||yx(e)===n)},Sx=e=>e===`And`?`Or`:`And`,Cx=(e,t)=>{switch(e.kind){case`Boolean`:return t?lx(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?fx(`Not`,e):e;case`Not`:return Cx(e.body,!t);case`And`:case`Or`:return mx(t?Sx(e.kind):e.kind,e.operands.map(e=>Cx(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return fx(n,Cx(e.body,t))}}},wx=e=>{switch(e.kind){case`Boolean`:return lx(!e.value);case`Not`:return e.body;case`And`:case`Or`:return mx(Sx(e.kind),e.operands.map(wx));case`Always`:return fx(`Eventually`,wx(e.body));case`Eventually`:return fx(`Always`,wx(e.body));default:return fx(`Not`,e)}},Tx=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Tx(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return lx(t)}return n.length===0?lx(!t):n.length===1?n[0]:mx(e.kind,n)}case`Not`:{let t=Tx(e.body);return t.kind===`Boolean`?lx(!t.value):fx(`Not`,t)}case`Always`:case`Eventually`:{let t=Tx(e.body);return fx(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Ex=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Dx=e=>{switch(e.kind){case`And`:{let t=[],n=1;for(let r of e.operands){let e=Dx(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n*=e.operands.length,n>2147483647))throw new v(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n===1)return{kind:`And`,operands:t};let r=Array.from({length:n},()=>[]),i=1,a=n;for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}a/=e.operands.length;let t=0;for(let n=0;n<i;n++)for(let n of e.operands)for(let e=0;e<a;e++)r[t++].push(n);i*=e.operands.length}return{kind:`Or`,operands:r.map(e=>mx(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Dx(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Ex(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:mx(`Or`,t);n.push(fx(`Always`,fx(`Eventually`,e)))}return mx(`Or`,n)}case`Not`:return ux(e.body)?e:Dx(wx(e.body));default:return e}},Ox=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Ox(e.operands[0]):mx(e.kind,e.operands.map(Ox));case`Not`:return e.body.kind===`Not`?Ox(e.body.body):fx(`Not`,Ox(e.body));case`Always`:case`Eventually`:case`Next`:return fx(e.kind,Ox(e.body));default:return e}},kx=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return kx(e.operands[0]);let t=Math.floor(e.operands.length/2);return px(e.kind,kx(mx(e.kind,e.operands.slice(0,t))),kx(mx(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return fx(e.kind,kx(e.body));default:return e}},Ax=(e,t)=>{e.kind===`Eventually`&&!xx(t,e)&&t.push(e),`body`in e&&Ax(e.body,t),`operands`in e&&e.operands.forEach(e=>Ax(e,t))},jx=e=>{let t=e.filter(dx),n=e.flatMap(e=>e.kind===`Not`&&dx(e.body)?[e.body]:[]);return!t.some(e=>xx(n,e))},Mx=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,fx(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new v(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Nx=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:fx(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Px=(e,t,n)=>e.flatMap(e=>{let r=Nx(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Fx=e=>[...new Set(e.map(yx))].sort().join(`|`),Ix=(e,t)=>{let n=new Set(t.map(Fx));return[...e.filter(e=>!n.has(Fx(e))),...t]},Lx=e=>{let t=Mx(e),n=Px(t,`Always`,`And`),r=Px(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Nx(t,`Eventually`,`Or`);if(n&&!(xx(e,n.first)||xx(e,n.second)))return Ix(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(xx(e,t.first)||xx(e,t.second))&&!xx(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!jx(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Nx(t[e],`Always`,`And`);n&&(xx(t,n.first)||t.push(n.first),xx(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)xx(t,e.first)&&xx(t,e.second)&&!xx(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!jx(t)?[]:i(t)};return a(e)},Rx=e=>({particle:e,successors:[],statePredicates:e.filter(e=>hx(e)<=1)}),zx=e=>{let t=Lx([e]).map(Rx),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Fx(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of Lx(n)){let n=Fx(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Rx(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Bx=(e,t)=>!xx(e,t)||xx(e,t.body),Vx=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&hx(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Ex(e);if(n){let e=hx(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(gx(e))throw new v(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Hx=(e,t)=>{let n=e.findIndex(e=>bx(e,t));return n===-1?(e.push(t),e.length-1):n},Ux=e=>{let t=Dx(Tx(Cx(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Ox(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Vx(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:mx(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:bx(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&kx(e.formula),n=[];t&&Ax(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Hx(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Hx(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Hx(i,e))}));return{tableau:t&&zx(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Wx=()=>x(new v(`Temporal formula is a tautology (its negation is unsatisfiable).`),ie.livenessEvaluationFailure),Gx=/* @__PURE__ */ new Set([`~>`,`-+->`]),Kx=/* @__PURE__ */ new WeakSet,qx=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),Jx=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Yx=(e,t)=>new v(`TLC cannot handle the temporal formula ${H(e)}${t===void 0?``:`:\n${t}`}`),Xx=(e,t,n,r=/* @__PURE__ */ new Set,i=/* @__PURE__ */ new Set)=>{let a=(e,t,r)=>{if(i.has(e))return 0;i.add(e);let a=Xx(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=Jh(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=ag(e,n);if(t)return Xu(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isActionLevel?2:r.isStateLevel&&!r.isLevelConstant?1:0},c=(e,t)=>r.has(e)?0:A(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return Sl(e,(e,o)=>(a=Math.max(a,Xx(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(Gx.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=A(e)?void 0:Rg(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,Zg(o,e.args,Jx(n,t)))}default:return l(e)}},Zx=(e,t)=>{try{return hg(e,t)}catch(e){if(!(e instanceof v))throw e;if(!Mt(e))return;throw x(new v(`${m}${e.message}`),ie.error)}},Qx=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o,s=[])=>{let c=(e,t,c=o,l=i,u)=>Qx(e,t,n,r,l,a||u!==void 0&&n.substitutedDefinitions.has(u),c,u?.kind===`Operator`&&u.params.length===0?[...s,u.name]:s);if(e.kind===`And`)return e.operands.flatMap(e=>c(e,t,H(e)));if(e.kind===`Label`)return c(e.body,t);if(e.kind===`Let`)return c(e.body,$x(e,t,n));if(e.kind===`Identifier`){let r=A(e)?Jh(t,e.name):void 0;if(r?.kind===`Thunk`&&!r.isReleased)return c(r.expression,r.scope,Kx.has(r)?e.name:o);let s=n.constants.has(e.name)?void 0:ag(e.name,n);if(!r&&s?.kind===`Operator`&&s.params.length===0&&(Xu(s,n)>0||Ng(s,n)===void 0)){if(i.has(s))throw g();return c(s.body,void 0,!a&&n.instanceNames.get(e.name)||s.name,/* @__PURE__ */ new Set([...i,s]),s)}}let l=Jx(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||Xx(e,t,n)===3)){let t=zg(e,l),r=A(e)?void 0:ag(e.operator,n),o=t?.kind===`Closure`&&t.params.every(e=>n.instanceParams.has(e));if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&(!a||o))return c(t.body,Zg(t,e.args,l),a&&r?r.name:e.operator,i,r)}let u=r&&e.kind===`Forall`&&e.bounds.every(e=>Xx(e.set,t,n)===0),d=u?Zx(e.bounds,l):void 0;if(u&&d){let n=[];if(gg(e.bounds,d,t,t=>(n.push(...c(e.body,t,H(e.body))),!1)),n.length===0)throw Wx();return n}return[{expression:e,scope:t,name:o,path:s}]},$x=(e,t,n)=>{let r=t_(e.definitions,Jx(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Kx.add(e.binding);return r},eS=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,i=(e,t,i)=>{let a=i===0&&!r?Xx(e,t,n):i;if(a===0){let r=W(e,Jx(n,t));if(typeof r!=`boolean`)throw new v(`TLC expected a boolean value, but did not find one. ${Lh(e)}`);return lx(r)}return a===1?{kind:`State`,expression:e,scope:t}:e.kind===`AngleAction`?{kind:`Action`,expression:e.action,subscript:e.subscript,scope:t}:{kind:`Action`,expression:e,subscript:void 0,scope:t}},a=0,o=(e,t,r,o)=>{if(a>=100)throw g();a++;let s=p(e,t);a--;let c=hx(s),l=c===0&&Xx(r,o,n)>2;return c>2||l?s:i(r,o,c)},s=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=Jx(n,t),s=A(e)||ag(i,n)===void 0?Jh(t,i):void 0;if(s?.kind===`Thunk`&&!s.isReleased&&Kx.has(s))return c(e,()=>o(s.expression,s.scope,e,t));let l=s?.kind===`Operator`?s.operator:s?void 0:A(e)?Bg(i,a):Rg(i,n),u=e.kind===`Apply`?e.args:[],f=l?.kind===`Builtin`&&u.length===2?qx.get(l.name):void 0;if(f){let n=u.map(e=>p(e,t));return d(e,t,mx(f,n))}if(l?.kind!==`Closure`)throw Yx(e);let m=!A(e)&&ag(i,n)?.isRecursive===!0;return c(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),o(l.body,Zg(l,u,a),e,t)),m)},c=(e,t,n=!1)=>{try{return t()}catch(t){let i=t instanceof l||n&&!r;throw!(t instanceof v)||i?t:Yx(e)}},u=(e,t)=>{let r=Xx(e,t,n),a=[],o=e.kind===`Forall`;try{_g(e.bounds,Jx(n,t),t=>(a.push(p(e.body,t)),!1))}catch(n){if(!(n instanceof v)||n instanceof l)throw n;if(r<=2)return i(e,t,r);throw Yx(e,o&&!Mt(n)?n.message:void 0)}return a.length===0?lx(o):d(e,t,mx(o?`And`:`Or`,a))},d=(e,t,n)=>{let r=hx(n);return r>2?n:i(e,t,r)},f=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!A(e)||e.operator===`=>`),p=(e,t)=>{let a=Xx(e,t,n);if(a<=2&&!f(e))return i(e,t,a);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,$x(e,t,n));case`Identifier`:return s(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?fx(`Always`,px(`Or`,fx(`Not`,p(n[0],t)),fx(`Eventually`,p(n[1],t)))):e.operator===`~`&&!A(e)?d(e,t,fx(`Not`,p(n[0],t))):e.operator===`=>`?d(e,t,px(`Or`,fx(`Not`,p(n[0],t)),p(n[1],t))):s(e,t)}case`And`:case`Or`:return d(e,t,mx(e.kind,e.operands.map(e=>p(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!r&&Xx(e.condition,t,n)===0){let r=W(e.condition,Jx(n,t));if(typeof r==`boolean`)return p(r?e.consequent:e.alternative,t)}let i=p(e.condition,t);return d(e,t,px(`Or`,px(`And`,i,p(e.consequent,t)),px(`And`,fx(`Not`,i),p(e.alternative,t))))}case`Always`:case`Eventually`:return fx(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=fx(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?fx(`Always`,fx(`Eventually`,px(`Or`,i,a))):px(`Or`,fx(`Eventually`,fx(`Always`,i)),fx(`Always`,fx(`Eventually`,a)))}default:throw Yx(e)}};return p(e,t)},tS=(e,t,n,r,i)=>{let a=e=>tS(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?W(e.expression,a):wh(e.step,a);if(typeof o!=`boolean`)throw new v(`A state predicate was evaluated to a non-boolean value.`);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a=e.scope,o=e.subscript;if(o&&Gr(W(o,{environment:r,scope:a,state:t,next:void 0}),W(o,{environment:r,scope:a,state:n,next:void 0})))return!1;let s=W(e.expression,{environment:r,scope:a,state:t,next:n});if(typeof s!=`boolean`)throw new v(`Encountered an action predicate that's not a boolean.`);return s}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return tS(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new v(`TLC cannot evaluate a temporal formula in a single step`)}},nS=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>nS(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return tS(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},rS=`UnnamedAction`,iS={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},aS=e=>{let t=e.range??iS;return fi([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},oS=(e,t)=>{let n=[[`name`,e.name],[`location`,aS(e.location)]];return e.parameters.length>0&&n.push([`context`,fi(e.parameters)],[`parameters`,di(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),fi(n)},sS=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),cS=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),lS=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,uS=e=>e.kind===`Apply`?e.args:[],dS=(e,t,n)=>{let r=lS(e);if(r===void 0)return;if(A(e)){let e=Jh(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=Rg(r,n);return i?.kind===`Closure`?i:void 0},fS=(e,t)=>{try{return W(e,cS(t,void 0)),!0}catch(e){if(e instanceof ce)return!1;throw e}},pS=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&qu(e,t)&&fS(e.body,t),mS=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&pS(e,t),hS=(e,t)=>{let n=ag(e.name,t);return n?.body===e.body&&mS(n,t)},gS=(e,t)=>{if(e.kind!==`Identifier`||!A(e))return;let n=Jh(t,e.name);return n?.kind===`Thunk`?n:void 0},_S=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:t_(e.definitions,cS(n,t))};let r=gS(e,t);return r&&{expression:r.expression,scope:r.scope}},vS=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Jh(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),yS=(e,t)=>{try{return e()}catch(e){if(e instanceof ce)return t();throw e}},bS=(e,t,n,r,i)=>{let a=uS(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return r&&a.length===0?[{...e,parameters:[],expression:r.body,scope:r.scope}]:r?a.some(e=>Xx(e,n,i)!==0)?o():yS(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,cS(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},xS=(e,t,n,r,a)=>{let o=()=>({name:n?.name??rS,location:e.location,parameters:vS(n,t),expression:e,scope:t});if(pm.has(e.kind))throw x(new v(`${i}The next state relation is not a boolean expression.\n${Lh(e)}`),ie.error);switch(e.kind){case`Let`:return xS(e.body,t_(e.definitions,cS(r,t)),n,r,a);case`Label`:return xS(e.body,t,n,r,a);case`Or`:return e.operands.flatMap(e=>xS(e,t,n,r,a));case`Exists`:return yS(()=>{let i=[];return _g(e.bounds,cS(r,t),t=>(i.push(...xS(e.body,t,n,r,a)),!1)),i.length===0?[o()]:i},()=>[o()])}let s=A(e)?void 0:a.get(lS(e)??``),c=dS(e,t,r);if(s)return bS(s,e,t,c,r);if(!c)return[o()];let l=uS(e),u=A(e)?c.name:r.instanceNames.get(lS(e)??``)??c.name,d=()=>[{name:u,location:e.location,parameters:[],expression:e,scope:t}];return hS(c,r)||l.some(e=>Xx(e,t,r)!==0)?d():yS(()=>{let e=l.reduce((e,n,i)=>({name:c.params[i].name,binding:{kind:`Value`,value:W(n,cS(r,t))},parent:e}),c.scope);return xS(c.body,e,{...c,name:u},r,a)},d)},SS=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>SS(e,t,n,r,i,o),s=(e,t,n)=>sS(e,hl(t,a),n),c=_S(e,t,n);if(c){o(c.expression,c.scope);return}let l=dS(e,t,n);if(l&&hS(l,n))return;let u=l?[...a,...ml.get(l.body)??[]]:a;if(l&&l.params.length===0){if(Xx(l.body,l.scope,n)===1){r.inits.push(s(l.name,l.body,l.scope));return}o(l.body,l.scope,u);return}if(l&&e.kind===`Apply`&&l.params.length===e.args.length){o(l.body,Zg(l,e.args,cS(n,t)),u);return}if(e.kind===`And`){e.operands.forEach(e=>o(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t,frames:a});return}r.temporals.push(s(rS,e,t));return}let d=Xx(e,t,n);d<=1?r.inits.push(s(rS,e,t)):d===3&&r.temporals.push(s(rS,e,t))},CS=(e,t,n,r,i)=>{let a=(t,n)=>CS(e,t,n,r,i),o=_S(t,n,r);if(o){a(o.expression,o.scope);return}let s=dS(t,n,r);if(s&&hS(s,r))return;if(s&&s.params.length===uS(t).length){a(s.body,t.kind===`Apply`?Zg(s,t.args,cS(r,n)):s.scope);return}if(t.kind===`Forall`&&yS(()=>(_g(t.bounds,cS(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(sS(e,a)):Xx(a,n,r)<2?i.invariants.push(sS(e,a)):i.impliedTemporals.push(sS(e,t));return}let c=Xx(t,n,r);c<=1?i.impliedInits.push(sS(e,t)):c===3&&i.impliedTemporals.push(sS(e,t))},wS=(e,t)=>{let n=ag(e,t);return n?.kind===`Operator`&&!mS(n,t)?n:void 0},TS=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:wS(e.specification,t);a&&(SS(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:rS,location:e.frames[0].location,parameters:[],expression:hl(e.expression,e.frames),scope:e.scope}]:xS(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:Rg(e.init,t);o?.kind===`Closure`&&r.inits.push(sS(e.init??``,o.body));let s=e.next===void 0?void 0:Rg(e.next,t);return s?.kind===`Closure`&&r.actions.push(...xS(s.body,s.scope,s,t,n)),r},ES=(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=_S(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&A(e)?Jh(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!A(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=dS(e,t,n);if(!s||s.params.length!==uS(e).length)return!0;let c=ag(s.name,n);return c?.body===s.body&&pS(c,n)?!0:i(s.body,e.kind===`Apply`?Zg(s,e.args,cS(n,t)):s.scope)};return i(e,t)?r:void 0},DS=(e,t,n)=>TS(e,t,n).inits,OS=(e,t,n)=>TS(e,t,n).actions,kS=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>L(e[1])).join(`,`)})`,AS=(e,t,n=!1)=>`${e.name===rS?n?`Initial predicate`:`Action`:e.name}${t===`1.7.4`?``:kS(e)} ${h(e.location.range??iS)}`,jS=e=>`${e.name}${kS(e)}`,MS=(e,t,n,r)=>{let i=TS(e,t,r);e.invariants.forEach(e=>{let n=wS(e,t);n&&i.invariants.push(sS(e,n.body))}),e.properties.forEach(e=>{let n=wS(e,t);n&&CS(e,n.body,void 0,t,i)});let a=t.coverage,o=(e,t)=>Jr(e.map(e=>{let n=a&&t&&Qo(a,t,e.expression);return oS(e,n&&fi(n))})),s=e=>Jr(e.flatMap(e=>{let n=wS(e,t);return n?[fi([[`name`,n.name],[`location`,aS(n.location)]])]:[]}));return fi([[`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`,Jr(t.variables.map((e,t)=>fi([[`name`,e],[`location`,aS(n[t])],...a?[[`coverage`,fi([[`distinct`,Bo(a,t)]])]]:[]])))],[`actionconstraints`,s(e.actionConstraints)],[`constraints`,s(e.constraints)]])},NS=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),PS=(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},FS=e=>x(new v(`${i}${e}`),ie.error),IS=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!ln(e)||!ln(i))throw FS(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},LS=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${RS(t)}`:n},RS=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(RS).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${LS(e.pattern,e.set)}:${RS(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(RS).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${RS(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>LS(e.pattern,e.set)).join(`,`)}|->${RS(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(RS);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},zS=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,BS=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new _(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw FS(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>W(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!M(a)||!N(a))throw FS(`The symmetry operator must specify a set of functions.`);let o=P(a).elements;if(!o.every(cn))throw FS(`The symmetry values must be function records.`);let s=r.body,c=s.kind===`Apply`?s.args:s.kind===`SetEnumeration`?s.elements:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=RS(zS(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(xt.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;o.map(IS).forEach(e=>{e.size>0&&d.set(NS(e),e)});let f=[...d.values()],p=0;for(;p<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p,t).forEach(e=>{let t=PS(n,e),r=NS(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!zS(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>ln(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},VS=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=US(r,t);if(i===r)continue;let a=e.slice(0,n);a.push(i);for(let r=n+1;r<e.length;r++)a.push(US(e[r],t));return a}},HS=(e,t)=>{let n=[],r=[];for(let i of e){let e=US(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(qn);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(qn(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},US=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=HS(e.elements,t);return n?Qn(n):e}if(n===`Function`||n===`LazyFunction`&&N(e.domain)){let n=I(e),r=VS(n.domain,t),i=VS(n.range,t)??n.range;if(r){let e=ei(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?er(n.domain,e.range):e}return i===n.range?n:er(n.domain,i)}if(n===`Interval`||!M(e)||!N(e))return e;let r=P(e),i=VS(r.elements,t);return i?Jr(i):r},WS=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=US(e[o],i),a===0&&(a=qn(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},GS={line:0,column:0},KS=e=>({kind:`Identifier`,name:e,location:GS}),qS=/* @__PURE__ */ new Set([`name`,`property`]),JS=(e,t,n)=>{let r=ag(t,n);if(!r)throw new _(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new _(qS.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},YS=e=>e.body.kind===`Number`||e.body.kind===`String`,XS=(e,t,n)=>{if(n.constants.has(e))return n.constants.get(e);if(qu(t,n)&&!YS(t))try{return W(KS(e),bC(n,void 0,void 0))}catch(e){if(e instanceof v||y(e))return;throw e}},ZS=(e,t,n)=>{if(n.constants.has(t))throw new _(`The ${e} ${t} cannot be a constant.`);let r=JS(e,t,n);if(XS(t,r,n)!==void 0)throw new _(`The ${e} ${t} cannot be a constant.`);return r},QS=(e,t,n)=>{let r=n.constants.has(t)?void 0:JS(e,t,n),i=r?XS(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new _(`The ${e} of ${t} is equal to ${L(i)}`);return i===void 0?r:void 0},$S=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},eC=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),Pg(e.startupDefinitions,r),t.invariants.forEach(e=>{QS(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},tC=(e,t)=>{let n=Ou({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>t.definitions.get(e)});return e.flatMap(e=>{let r=QS(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
|
|
1780
|
+
`]]),ap=(e=`master`)=>e===`1.7.4`?ip:rp,op=(e,t)=>e.every(e=>qi(e,t)),sp=Yr([!1,!0]);Wr(sp);const cp=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return ei(cp(e,t,r),cp(e,r,n))},lp=[`\\cup`,`\\cap`,`\\`],up=e=>typeof e==`object`&&e.kind===`MixedSet`,dp=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,fp=(e,t,n)=>{t.kind===`Interval`&&Li(t);let r=t.kind===`Interval`?t:Ur(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return sn(r,e=>{qi(e,n)===i&&an(a,e)}),dp(t)?er(a):Xr(a)}if(P(t))return n;if(!cn(n))return cr({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return sn(r,e=>an(i,e)),sn(n.kind===`Interval`?n:N(n).elements,e=>{qi(e,t)||an(i,e)}),Xr(i)},pp=(e,t)=>{let n=(t,n)=>is([Ds(t,n,e)()],0,e);return{...R(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},mp=[os(`TRUE`,!0),os(`FALSE`,!1),os(`BOOLEAN`,sp),os(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ls(`=`,Kr),ls(`#`,(e,t)=>!Kr(e,t)),R(`~`,1,e=>!is(e,0,`~`)),R(`<=>`,2,e=>is(e,0,`<=>`)===is(e,1,`<=>`)),pp(`/\\`,(e,t)=>e&&t()),pp(`\\/`,(e,t)=>e||t()),pp(`=>`,(e,t)=>!e||t()),R(`\\in`,2,e=>qi(L(e,0,`\\in`),L(e,1,`\\in`))),R(`\\notin`,2,e=>!qi(L(e,0,`\\notin`),L(e,1,`\\notin`))),ls(`\\subseteq`,(e,t)=>{if(!j(e))throw new _(`\\subseteq expects a set but received ${I(e)}`);if(typeof e==`object`&&e.kind===`Subset`&&typeof t==`object`&&t.kind===`Subset`&&M(e.base))return op(N(e.base).elements,t.base);if(typeof e==`object`&&e.kind===`Interval`){if(typeof t==`object`&&t.kind===`Interval`&&t.low<=e.low&&t.high>=e.high)return!0;for(let n=e.low;n<=e.high;n++)if(!qi(n,t))return!1;return!0}return!ki(e,e=>!qi(e,t))}),...lp.map(e=>R(e,2,t=>{let n=L(t,0,e),r=L(t,1,e),i=e!==`\\cup`&&typeof r==`object`&&r.kind===`Interval`&&typeof n==`object`&&n.kind!==`Interval`;if(cn(n)&&cn(r)&&!up(n)&&!up(r)&&!i&&!on(n)&&!on(r)){if(e===`\\cup`&&P(n))return r;let t=e===`\\cup`?ei:e===`\\cap`?$r:Qr;return Gi((n,r)=>{let i=N(n),a=N(r),o=t(i,a);if(e===`\\cup`){let e=Ur(i),t=Qr(a,i).elements,n=e===i.elements&&(t.length===0||Jn(e[e.length-1],t[0])<0);if(e.length+t.length>nn())throw new s(rn());if(n&&!i.isNormalized)return o;let r=o===i?$n(o.elements):o;return n||(r.writtenElements=[...e,...t]),r}return o===n||(o.isNormalized=dp(n),i.writtenElements&&!i.isNormalized&&(o.writtenElements=i.writtenElements.filter(e=>qi(e,o)))),o},(t,n)=>fp(e,t,n),n,r)}return cn(n)?fp(e,n,r):e!==`\\`&&cn(r)?fp(e,r,n):cr({kind:`SetOperation`,operator:e,left:n,right:r})})),R(`SUBSET`,1,e=>({kind:`Subset`,base:L(e,0,`SUBSET`)})),R(`UNION`,1,e=>{let t=L(e,0,`UNION`),n=dn(t)?Ur(t):[],r=n.filter(dn);if(!dn(t)||r.length!==n.length)return cr({kind:`Union`,base:t});let i=r.flatMap(Ur),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{qi(t,e)||an(e.elements,t)}),Xr(e.elements)};return up(t)||r.some(up)?a():r.length===0?Zr:Gi(e=>Vi(cp(e,0,e.length),i),a,r.map(N),void 0)}),R(`DOMAIN`,1,e=>{let t=L(e,0,`DOMAIN`);if(!ln(t))throw new _(`DOMAIN expects a function but received ${I(t)}`);return fa(t)})],hp=Ss(`Integers`,`Neg`,`IntValue`,1),gp=e=>{let t=Ss(e,`DotDot`,`IntervalValue`,2);return[Cs(e,`+`,`Plus`,(e,t)=>e+t),Cs(e,`-`,`Minus`,(e,t)=>e-t),Cs(e,`*`,`Times`,(e,t)=>e*t),Cs(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new c(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new c(`0^0 is undefined.`);return e**t}),Cs(e,`\\div`,`Divide`,(e,t)=>{if(t===0)throw new c(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if(us(n))throw ds(`${e} \\div ${t}`);return n}),Cs(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new c(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),R(`..`,2,e=>{let n=L(e,0,`..`),r=xs(L(e,1,`..`),t);return{kind:`Interval`,low:xs(n,t),high:r}})]},_p=gp(`Naturals`),vp=gp(`Integers`),yp=e=>{let t=_p.indexOf(e);return t===-1?void 0:vp[t]},bp=e=>{let t=(t,n=`tlc2.value.IBoolValue`)=>`public static ${n} tlc2.module.${e}.${t}(tlc2.value.impl.Value,tlc2.value.impl.Value)`,n=e===`Integers`;return[bs(Ts(`<`,(e,t)=>e<t),t(`LT`)),bs(Ts(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),bs(Ts(`<=`,(e,t)=>e<=t),t(`LE`)),bs(Ts(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},xp=[os(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),..._p,...bp(`Naturals`)],Sp=[os(`Int`,{kind:`InfiniteSet`,name:`Int`}),...vp,...bp(`Integers`),R(`-.`,1,e=>{let t=xs(L(e,0,`-`),hp);if(us(-t))throw ds(`-${t}`);return-t})],Cp=(e,t,n)=>{let r=L(e,t,n),i=Hi(r);if(!i)throw new c(`${n}\n${I(r)}`);return i},wp=(e,t,n)=>{let r=L(e,t,n);return typeof r==`string`?r:Cp(e,t,n)},Tp=(e,t,n)=>{let r=L(e,t,`SubSeq`);if(typeof r!=`number`)throw ts(n,`SubSeq`,`natural number`,r);return r},Ep=(e,t,n)=>typeof e==`string`?Rn(e.slice(t,n)):fi(e.slice(t,n)),Dp=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Op=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,kp=(e,t)=>{let n=tp.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?bs(e,t):e}):t},Ap=e=>kp(`Sequences`,[R(`Seq`,1,e=>({kind:`SequenceSet`,base:L(e,0,`Seq`)})),R(`Len`,1,e=>wp(e,0,Dp(``,`Len`)).length),R(`\\o`,2,e=>{let t=wp(e,0,Op(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Cp(e,1,Op(`t \\o s`,`sequence`));return fi([...t,...n])}let n=L(e,1,`\\o`);if(typeof n!=`string`)throw new c(`${Op(`t \\o s`,`string`)}\n${I(n)}`);return Rn(t+n)}),R(`Append`,2,t=>fi([...Cp(t,0,Op(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),L(t,1,`Append`)])),R(`Head`,1,e=>{let t=Cp(e,0,Dp(``,`Head`));if(t.length===0)throw new c(`Attempted to apply Head to the empty sequence.`);return t[0]}),R(`Tail`,1,e=>{let t=wp(e,0,Dp(``,`Tail`));if(t.length===0)throw new c(`Attempted to apply Tail to the empty sequence.`);return Ep(t,1)}),R(`SubSeq`,3,e=>{let t=wp(e,0,Dp(`first `,`SubSeq`)),n=Tp(e,1,`second`),r=Tp(e,2,`third`);if(n>r)return Ep(t,0,0);let i=n<1||n>t.length?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new c(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${I(L(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Ep(t,n-1,r)}),ss(`SelectSeq`,2,e=>{let t=as(e,1,`SelectSeq`);return fi(Cp(e,0,Dp(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new c(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${t.name}>`);return n}))})]),jp=e=>kp(`FiniteSets`,[R(`IsFiniteSet`,1,e=>{let t=L(e,0,`IsFiniteSet`);if(j(t))return zi(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new _(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${I(t)}\nis a finite set.`:`Attempted to check if the ${fn(t)} ${I(t)} is a finite set.`)}),R(`Cardinality`,1,t=>{let n=L(t,0,`Cardinality`);if(!j(n)||typeof n==`object`&&(n.kind===`InfiniteSet`||n.kind===`SequenceSet`))throw new c(`Attempted to compute cardinality of the value\n${I(n)}`);return Li(n,e)})]),Mp=[bs(R(`Warshall`,1,e=>{let t=L(e,0,`Warshall`);if(!j(t)||Vn(t))throw new c(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${I(t)}`);Li(t);let n=[],r=/* @__PURE__ */ new Map,i=e=>{let t=ja(e),i=r.get(t)??n.length;return i===n.length&&(r.set(t,i),n.push(e)),i},a=N(t).elements.map(e=>{let t=Hi(e);if(t?.length!==2)throw new c(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${I(e)}`);return[i(t[0]),i(t[1])]}),o=n.map(()=>n.map(()=>!1));a.forEach(e=>{o[e[0]][e[1]]=!0});for(let e=0;e<n.length;e++)for(let t=0;t<n.length;t++)if(o[t][e])for(let r=0;r<n.length;r++)o[e][r]&&(o[t][r]=!0);return Xr(n.flatMap((e,t)=>n.flatMap((n,r)=>o[t][r]?[fi([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],Np=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return Mp;if(e===`AnySet`)return[os(`ANY`,Gn)];if(e===`IOUtils`)return Wd(r,a);if(e===`_TLCTrace`)return qd(r);if(!ap(n.version).has(e))return;let o=Fp(e,t,n,r,i)?.operators;return e===`Randomization`&&o?[...o,bf(n)]:o},Pp=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),Fp=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:xp};case`Integers`:return{extends:[`Naturals`],operators:Sp};case`Sequences`:return{extends:[],operators:Ap(n.version)};case`FiniteSets`:return{extends:[],operators:jp(n.version)};case`TLC`:return{extends:[],operators:kp(`TLC`,Jf(t,n))};case`Randomization`:return{extends:[],operators:xf(n)};case`_Possible`:return{extends:[],operators:Ff(t,n)};case`Json`:return{extends:[],operators:Ud(r)};case`Bags`:return{extends:[],operators:kp(`Bags`,hd(i))};case`TLCExt`:return{extends:[],operators:kp(`TLCExt`,Pf(t,n))};default:return}},Ip=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&ml.get(t)||[];r.expressions.push(...i,t);let a=Wi.sets,o=a??[],s=o.length;Wi.sets=o;try{return n()}catch(e){throw d_(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,Wi.sets=a}},Lp=(e,t,n)=>e.coverage?Po(e.coverage,t,n):-1,Rp=(e,t,n)=>e.coverage?Io(e.coverage,t,n):n(),zp=(e,t,n,r)=>Rp(e,t,()=>U(n,r)),Bp=(e,t,n,r)=>{let i=zp(e,t,n,r),a=e.coverage;if(a?.covered.has(n))for(let e=t;e!==-1;e=a.prefixes[e])a.primary[e]--;return i},Vp=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Hp=e=>!e.includes(void 0),Up=e=>e.variables.map(()=>void 0),Wp=(e,t,n)=>{let r=[...e];return r[t]=n,r},Gp=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},Kp=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,qp=e=>e.kind===`Identifier`?e.name:void 0,Jp=(e,t,n)=>{if(t.kind===`Label`)return Jp(e,t.body,n);let r=qp(t);if(r===void 0)return;let i=Yh(n,r);if(i?.kind===`Thunk`)return Jp(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=zg(r,e);return o?.kind===`Closure`&&o.params.length===0?Jp(e,o.body,o.scope):void 0},Yp=(e,t,n)=>{if(t.kind===`Prime`)return Jp(e,t.expression,n);if(t.kind===`Label`)return Yp(e,t.body,n);let r=qp(t);if(r===void 0)return;let i=Yh(n,r);if(i?.kind===`Thunk`)return Yp(e,i.expression,i.scope);if(i)return;let a=zg(r,e);return a?.kind===`Closure`&&a.params.length===0?Yp(e,a.body,a.scope):void 0},Xp=e=>{if(typeof e!=`boolean`)throw new _(`TLC expected a boolean expression.`);return e},Zp=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Qp=(e,t,n,r)=>{let i=em(e,t,n,r);return i&&e.coverage&&!e.isInit&&Fo(e.coverage,r),i},$p=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(Fo(r,n),Fo(r,r.roots[n])),e.onState(t),!0},em=(e,t,n,r)=>t===void 0?Hp(n)?$p(e,n,r):(e.onIncomplete?.(n),!1):Hp(n)&&Zp(e)?nm(e,t,n,r):t.kind===`Predicate`?rm(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?ym(e,t.expression,t.rest,t.scope,n,t.node):tm(e,t,n)&&Qp(e,t.rest,n,t.node),tm=(e,t,n)=>{let r=e.environment,i=zp(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return zp(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?Jh(t,r.runtime.version):t}})();try{return!Kr(i,a)}catch(t){throw e.callStack&&d_(e.callStack,[i],t),t}},nm=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return ym(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?tm(e,i,n):Xp(zp(e,i.node,i.expression,Vp(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return $p(e,n,r)},rm=(e,t,n,r,i,a)=>im(e,t,n,r,i,Lp(e,a,t)),im=(e,t,n,r,i,a)=>Ip(e,t,()=>{switch(t.kind){case`Let`:{let o=Vp(e,r,i),s=t.definitions,c=e.coverage?n_(s,o,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):n_(s,o);return rm(e,t.body,n,c,i,a)}case`Label`:return rm(e,t.body,n,r,i,a);default:if(pm.has(t.kind))throw new _(`The state relation is not a boolean expression.`);return Ip(e,t,()=>_m(e,t,n,r,i,a))}}),am=(e,t,n,r,i)=>Xp(t)&&Qp(e,n,r,i),om=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),sm=(e,t,n,r,i,a)=>{let o=Vp(e,r,i);if(t.kind===`Identifier`){let s=Yh(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return rm(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return rm(e,s.operator.body,n,s.operator.scope,i,a);let c=s?void 0:e.environment.definitions.get(t.name),l=s?void 0:zg(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&qu(c,e.environment))?rm(e,l.body,n,l.scope,i,a):am(e,Bp(e,a,t,o),n,i,a)}let s=Bg(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=Rp(e,a,()=>Qg(s,t.args,o));return rm(e,s.body,n,r,i,a)}let c=om.has(t.operator)?zp(e,a,t,o):Bp(e,a,t,o);return am(e,c,n,i,a)},cm=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?Qp(e,t,Wp(n,r,i),a):Kr(o,i)&&Qp(e,t,n,a)},lm=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),um=(e,t,n)=>(e.coverage&&Lo(e.coverage,t,n.length+1),n),dm=(e,t,n,r,i,a)=>{let[o,s]=t.args,c=e.isInit?Jp(e.environment,o,r):Yp(e.environment,o,r),l=Vp(e,r,i);if(c===void 0)return zp(e,a,t,l)===!0&&Qp(e,n,i,a);let u=zp(e,a,s,l),d=i[c];if(t.operator===`=`)return cm(e,n,i,c,u,a);let f=t.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(typeof f==`object`&&f!==u&&e.callStack?.sources.set(f,s),d!==void 0)return zp(e,a,t,l)===!0&&Qp(e,n,i,a);if(!hi(f))throw new _(`The right side of \\IN is not enumerable.`);return um(e,f,Ai(f)).reduce((t,r)=>Qp(e,n,Wp(i,c,r),a)||t,!1)},fm=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),pm=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),mm={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},hm=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:mm[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${V(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${V(e)}`:`In computing ENABLED, TLC encountered unbounded quantifier. Make sure that the expression is of form ${e.quantifier===`Forall`?`\\A`:`\\E`} x \\in S: P(x).\n${V(e)}`;if(e.kind===`Choose`&&e.set===void 0)return`In computing ENABLED, TLC encountered unbounded CHOOSE. Make sure that the expression is of form CHOOSE x \\in S: P(x).\n${V(e)}`},gm=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=Rp(e,r,()=>hg(t.bounds,t=>{let r=U(t,n),i=fg(r,t,a);return Array.isArray(i)&&um(e,r,i),i}));return _g(t.bounds,o,n.scope,e=>(i.push(e),!1)),i},_m=(e,t,n,r,i,a)=>{let o=Vp(e,r,i);switch(t.kind){case`Identifier`:return sm(e,t,n,r,i,a);case`Apply`:return fm.has(t.operator)&&t.args.length===2?dm(e,t,n,r,i,a):t.operator===`=>`&&t.args.length===2?Xp(zp(e,a,t.args[0],o))?rm(e,t.args[1],n,r,i,a):Qp(e,n,i,a):sm(e,t,n,r,i,a);case`And`:{let o=t.operands;if(t.isBulleted||o.length===2){let t=o.slice(1).reduceRight((e,t)=>lm(`Predicate`,t,r,a,e),n);return rm(e,o[0],t,r,i,a)}let s=o[o.length-1];return im(e,Gp(t,o.length-1),lm(`Predicate`,s,r,a,n),r,i,Kp(e,a))}case`Or`:{let o=t.operands;if(t.isBulleted||o.length===2)return o.reduce((t,o)=>rm(e,o,n,r,i,a)||t,!1);let s=im(e,Gp(t,o.length-1),n,r,i,Kp(e,a)),c=rm(e,o[o.length-1],n,r,i,a);return s||c}case`Exists`:return gm(e,t,o,a).reduce((r,o)=>rm(e,t.body,n,o,i,a)||r,!1);case`Forall`:{let r=gm(e,t,o,a);if(r.length===0)return Qp(e,n,i,a);let s=r.slice(1).reduce((e,n)=>lm(`Predicate`,t.body,n,a,e),n);return rm(e,t.body,s,r[0],i,a)}case`If`:return rm(e,Xp(zp(e,a,t.condition,o))?t.consequent:t.alternative,n,r,i,a);case`Case`:{let s=t.arms.find(t=>Xp(zp(e,a,t.condition,o)))?.body??t.other;if(s===void 0)throw new _(`TLC encountered a CASE with no conditions true.`);return rm(e,s,n,r,i,a)}case`FunctionApplication`:{let r=Cg(zp(e,a,t.function,e.isInit?o:$h(o)));if(r){let s=Rp(e,a,()=>wg(r,t,o));return rm(e,r.body,n,s,i,a)}break}case`Unchanged`:if(!e.isInit)return ym(e,t.expression,n,r,i,a);break;case`BoxAction`:if(!e.isInit){let o=rm(e,t.action,n,r,i,a);return ym(e,t.subscript,n,r,i,a)||o}break;case`AngleAction`:if(!e.isInit)return rm(e,t.action,lm(`Changed`,t.subscript,r,a,n),r,i,a)}let s=e.isEnabled?hm(t):void 0;if(s!==void 0)throw new _(s);return am(e,zp(e,a,t,o),n,i,a)},vm=(e,t,n)=>e.runtime.warn(St.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${V(n)}`),ym=(e,t,n,r,i,a)=>Ip(e,t,()=>{let o=Lp(e,a,t),s=Jp(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;let a=i[s];return a!==void 0&&!Kr(a,r)?(vm(e.environment,s,t),!1):cm(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return Qp(e,n,i,o);let c=s.reduceRight((e,t)=>lm(`Unchanged`,t,r,o,e),n);return ym(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=Yh(r,t.name);if(a?.kind===`Thunk`)return ym(e,a.expression,n,a.scope,i,o);let s=a?void 0:zg(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return ym(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=Vp(e,r,i),s=Bg(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return ym(e,s.body,n,Qg(s,t.args,a),i,o)}let c=e.environment,l=zp(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=zp(e,o,t,{environment:c,scope:r,state:i,next:void 0});return Kr(l,u)&&Qp(e,n,i,o)}),bm=(e,t,n,r,i=!1,a)=>({environment:e,callStack:e.callStack,coverage:e.coverage,isInit:t,isEnabled:i,current:n,onState:r,onIncomplete:a}),xm=/* @__PURE__ */ Error(`The replay found a successor`),Sm=(e,t,n,r)=>{let i=bm(r,!1,n,()=>{throw xm},!0),a=i.callStack,o=a?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=lm(`Changed`,e.subscript,t,-1,void 0);rm(i,e.action,n,t,Up(r),-1)}else rm(i,e,void 0,t,Up(r),-1);return!1}catch(e){if(e!==xm)throw e;return a&&(a.expressions.length=o,a.isFrozen=!1),!0}},Cm=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=bm(t,!0,void 0,n,!1,r),s=a.reduceRight((e,t)=>lm(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);rm(o,i.expression,s,i.scope,Up(t),i.node??-1)},wm=(e,t,n,r)=>{e.some(e=>pm.has(e.expression.kind))||e.forEach(e=>{let i=[];Tm(e,-1,t,n,e=>i.push(e)),i.forEach(t=>r(t,e))})},Tm=(e,t,n,r,i,a)=>{let o=bm(r,!1,n,i,!1,a);rm(o,e.expression,void 0,e.scope,Up(r),t)},Em=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(Jp(t,e,void 0)!==void 0&&e.kind===`Identifier`){n.push(e);return}if(e.kind===`Tuple`){e.elements.forEach(e=>i(e,r));return}if(e.kind!==`Identifier`)return;let a=Yh(r,e.name)?void 0:zg(e.name,t);a?.kind===`Closure`&&a.params.length===0&&i(a.body,a.scope)},a=(e,o,s)=>{switch(e.kind){case`Let`:a(e.body,n_(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`FunctionApplication`:a(e.function,o,s);return;case`If`:a(e.consequent,o,s),a(e.alternative,o,s);return;case`Case`:e.arms.forEach(e=>a(e.body,o,s)),e.other&&a(e.other,o,s);return;case`And`:case`Or`:e.operands.forEach(e=>a(e,o,s));return;case`Exists`:case`Forall`:a(e.body,o,s);return;case`Unchanged`:i(e.expression,o);return;case`AngleAction`:a(e.action,o,s);return;case`BoxAction`:a(e.action,o,s),n.push(e.subscript);return;case`Identifier`:case`Apply`:{if(e.kind===`Apply`){if(e.operator===`=>`){e.args.forEach(e=>a(e,o,s));return}if(e.operator===`=`||e.operator===`\\in`){Yp(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=Yh(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?Bg(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:zg(i,t);if(l?.kind!==`Closure`||s.has(l.body)||t.definitions.get(i)?.isRecursive)return;let u=e.kind===`Apply`?e.args:[];if(l.params.length!==u.length)return;s.add(l.body),a(l.body,Qg(l,u,r(o)),s),s.delete(l.body)}}};return e.forEach(e=>a(e.expression,e.scope,/* @__PURE__ */ new Set)),n.flatMap(e=>e.location.range??[])},Dm=/* @__PURE__ */ new WeakMap,Om=/* @__PURE__ */ new WeakMap,km=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Am=(e,t,n)=>{let r=e.slice();return r[t]=n,r},jm=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,Mm=(e,t)=>{let n=new _(t);return e.isInit?n:y(n,b.error)},Nm=(e,t,n,r)=>{let i=Rh(n);return r&&pm.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${jm(e)}, TLC expected a boolean expression,\nbut instead found ${I(t)}.\n${i}`},Pm=(e,t,n)=>{let r=_s(t),i=V(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${jm(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
1781
|
+
`:``}${i}`},Fm=(e,t,n)=>Rm(e,t,U(t,n)),Im=new Set(mp.map(e=>e.name)),Lm=e=>e.kind===`Apply`?Im.has(e.operator):e.kind!==`Identifier`&&!pm.has(e.kind),Rm=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;let i=Nm(e,n,t,r);throw e.isInit&&r&&Lm(t)?new ue(i):Mm(e,i)},zm=(e,t,n,r)=>r.environment.callStack?U(n,r):(e[t]??=g_(n,r.environment))(r),Bm=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Vm=(e,t,n)=>{let r=n?Dm:Om,i=r.get(e);if(i)return i;let a=xh(e,t,n),o=n?void 0:bh(e,t),s=o?(e,t,n,r,i,s)=>(e.generator?o:a)(e,t,n,r,i,s):a;return r.set(e,s),s},Hm=(e,t)=>{if(t.constants.has(e))return;let n=og(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},Um=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return Um(e.expression,t,!1,r);if(e.kind!==`Identifier`||k(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Hm(e.name,t);if(a&&!r.has(a))return r.add(a),Um(a.body,t,n,r)},Wm=(e,t,n)=>Um(e,t,!n),Gm=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return Gm(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=n_(e.definitions,km(r,t,n));return Gm(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Yh(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return Gm(a.expression,a.scope,n,r,i);if(a)return;let o=r.environment.variableIndex.get(e.name);if(o!==void 0)return i?void 0:o;let s=Hm(e.name,r.environment);if(s)return Gm(s.body,void 0,n,r,i)},Km=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||k(e))||!t&&e.kind===`Prime`,qm=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>qm(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[{index:r,expression:e}];let i=Hm(e.name,t);if(i)return n.add(e.name),qm(i.body,t,n)},Jm=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Ym=(e,t,n)=>Jm.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Bm(e.operator)&&(Km(e.args[0],n)||Wm(e.args[0],t,n)!==void 0)||k(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,Xm=/* @__PURE__ */ new Set,Zm=(e,t)=>{if(k(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Sl(e,(e,i)=>{let a=r.isReadOnly?Zm(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},Qm=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||k(e)?void 0:og(r,t);return i&&!n.has(i)&&(n.add(i),Qm(i.body,t,n))?!0:gt(e).some(e=>Qm(e,t,n))},$m=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Wm(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=qm(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return Ym(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Vm(e,t,n)}},eh=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(Qu(e,t)===void 0||Qm(e,t,/* @__PURE__ */ new Set))return!0;let n=Zm(e,Xm);return!n||n.some(e=>r.has(e))}),o=a===-1?i.length:a;if(o!==0)return{names:n,guards:i.slice(0,o),rest:i.slice(o)}},th=(e,t,n)=>{let r=e.map(e=>$m(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Zp(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Ch(u)){d??=km(t,n,u);for(let e=s;e<r.length;e++){let n=r[e],i=t.current,o=i&&n.kind===`Unchanged`?n.variables.find(e=>{let t=u[e.index];return t!==void 0&&!Kr(t,i[e.index])}):void 0;if(o){vm(t.environment,o.index,o.expression);return}let s=n.expression,c=zm(a,e,s,d);if(!Rm(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=km(t,n,u);let r=zm(i,s,e.expression,d);if(!Rm(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=km(t,n,u);let r=zm(i,s,e.value,d),a=u[e.index];if(a===void 0)u=Am(u,e.index,r),d=void 0;else if(!Kr(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let i of e.variables){let e=(r??u)[i.index];if(e===void 0)r??=u.slice(),r[i.index]=n[i.index];else if(!Kr(e,n[i.index])){vm(t.environment,i.index,i.expression);return}}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},nh=e=>{let t=hm(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw Mm(n,t);Fm(n,e,km(n,r,i))&&s(i,a)}},rh=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=km(r,i,a);if(a[l]!==void 0){Fm(r,e,u)&&c(a,o);return}let d=U(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!hi(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${jm(r)}, the right side of \\IN is not enumerable.`;throw Mm(r,`${t}\n${V(e)}`)}let p=Ai(f);if(r.generator){for(let e of ff(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(Am(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(Am(a,l,p[e]),o)}},ih=/* @__PURE__ */ new WeakMap,ah=e=>{let t=ih.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(ah),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return ih.set(e,n),n},oh=(e,t)=>{let n=e.args[0],r=nh(e),i=(e,r,i)=>Gm(n,r,i,e,!t)??-1,a=rh(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=U(e.args[1],km(t,n,o));l(Am(o,u,d),s)}},sh=(e,t,n)=>{let r=V(e);return(i,a,o,s,c,l)=>{let u=km(i,a,o),d=U(e.function,n?u:$h(u)),f=Cg(d);if(f!==void 0){Vm(f.body,t,n)(i,wg(f,e,u),o,s,c,l);return}if(!ln(d))throw Mm(i,`In computing ${jm(i)}, a non-function (${_s(d)}) was applied as a function.\n${r}`);let p=U(e,u);if(typeof p!=`boolean`)throw Mm(i,`In computing ${jm(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},ch=(e,t)=>{if(qm(e,t))return th([ah(e)],t,!1);if(e.kind===`Tuple`)return Vm(ah(e),t,!1);let n=ah(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Yh(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){Vm(ah(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=km(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=Bg(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){Vm(ah(n.body),t,!1)(r,Qg(n,e.args,u),a,o,s,c);return}}Fm(r,n,u)&&c(a,o)}},lh=(e,t,n)=>{let r=e.operator,i=nh(e),a=k(e)?void 0:zg(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=x_(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=Vm(a.body,t,n),o.body(e,i(km(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=km(a,o,s),f=Bg(e,d);f?.kind===`Closure`?Vm(f.body,t,n)(a,Qg(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},uh=(e,t,n)=>{let r=nh(e),i=k(e)?void 0:Hm(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=Yh(s,e.name);f?.kind===`Thunk`&&!f.isReleased?Vm(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&Pg(i,t)!==void 0?r(o,s,c,l,u,d):(a.body??=Vm(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},dh=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||k(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!k(i))return;let a=Um(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},fh=e=>e.kind===`And`?e.operands.flatMap(fh):[e],ph=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&Ym(e,t,!1),mh=e=>{let t=[];return(n,r,i)=>{let a=km(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!Rm(n,i,zm(t,r,i,a)))return}}},hh=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=fh(e),r=n.findIndex(e=>!ph(e,t)||dh(e,t)),i=r===-1?void 0:dh(n[r],t);return i?{...i,before:r===0?void 0:mh(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>hh(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||k(e))return;let r=zg(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=hh(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(!i||o?.kind!==`Identifier`||!k(o))return;let s=i.before,c=s&&x_(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(km(e,t,n)),n))}},gh=(e,t,n)=>{let r=Yh(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},_h=(e,t,n)=>{let r=e.map(e=>Vm(e,t,n)),i=n?[]:e.map(e=>hh(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&gh(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},vh=e=>(t,n,r,i,a,o)=>{let s=t.generator;if(!s)throw Error(`A random choice needs the run's generator`);let c=Math.floor(s.nextDouble()*e.length),l=tf(s);for(let s=0;s<e.length;s++)if(e[(c+s*l)%e.length](t,n,r,i,a,o),t.successors>0||t.isStopped)return},yh=(e,t)=>{let n=Vm(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=km(r,i,a),u=t.runtime.version,d=hg(e.bounds,e=>U(e,l)).map((n,r)=>ff(ug(n,e.bounds[r].set,u).length,n,t.runtime.getRandom(),u)),f=(t,i)=>{if(t<0)return n(r,i,a,o,s,c),r.successors>0||r.isStopped;let l=e.bounds[t].pattern;return d[t].some(e=>f(t-1,Zh(i,l,e)))};f(d.length-1,i)}},bh=(e,t)=>{if(e.kind===`Exists`)return yh(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>Vm(e,t,!1));return e.isBulleted?vh(n):n.reduce((e,t)=>vh([e,t]))},xh=(e,t,n)=>{let r=e=>Vm(e,t,n);switch(e.kind){case`And`:return th(e.operands,t,n);case`Or`:return _h(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(n,r,o,s,c,l)=>{let u=ug(U(a.set,km(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,Xh(r,e,u[t]),o,s,c,l)}}let o=n?void 0:eh(e,t);if(o){let r=th(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=km(n,i,a),d=hg(e.bounds,e=>ug(U(e,u),e,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=Xh(t,o.names[e],r);if(e===d.length-1){let e=km(n,i,a);if(!o.guards.every(t=>Fm(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{vg(e.bounds,km(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Qu(e,t)!==void 0&&!Qm(e.body,t,/* @__PURE__ */ new Set)?Zm(e,Xm):void 0;return(t,n,r,o,s,c)=>{let l=[];vg(e.bounds,km(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Yh(n,e)?.kind===`Value`)){u.every(n=>Fm(t,e.body,km(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Ch(r)?u.slice(n).every(n=>Fm(t,e.body,km(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=U(e.condition,km(r,i,a));if(typeof l!=`boolean`)throw Mm(r,Pm(r,l,e));(l?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,source:e.body,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=km(r,i,a),u=t.find(e=>{let t=U(e.condition,l);if(typeof t==`boolean`)return t;throw Mm(r,`In computing ${jm(r)}, a non-boolean expression${r.isEnabled?``:` `}(${_s(t)}) was used as a guard condition of a CASE.\n${Rh(e.source)}`)})?.body??n;if(!u)throw Mm(r,`In computing ${jm(r)}, TLC encountered a CASE with no conditions true.\n${V(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=i_(e.definitions,t);return(t,r,a,o,s,c)=>n(t,n_(e.definitions,km(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new _(`UNCHANGED appears in an initial predicate at ${Ph(e)}`)}:ch(e.expression,t);case`AngleAction`:{let n=r(e.action),i={kind:`Unchanged`,expression:e.subscript,location:e.subscript.location},a=(e,n,r)=>{try{return Fm(e,i,km(e,n,r))}catch(n){throw e.isEnabled?Jh(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return _h([e.action,ah(e.subscript)],t,n);case`Label`:return r(e.body);case`Identifier`:return uh(e,t,n);case`FunctionApplication`:return sh(e,t,n);case`Apply`:{let i=e.args;if(Bm(e.operator)){let r=Wm(i[0],t,n);if(r!==void 0)return e.operator===`=`?th([e],t,n):rh(e,()=>r);if(Km(i[0],n))return oh(e,n)}if(e.operator===`=>`){let t=r(i[1]);return(n,r,a,o,s,c)=>{let l=U(i[0],km(n,r,a));if(typeof l!=`boolean`){let t=_s(l),r=V(e);throw Mm(n,n.isInit?`In computing initial states of a predicate of form P => Q, P was ${t}\n.${r}`:n.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${t}.\n${r}`:`In computing next states of a predicate of the form P => Q, P was\n${t}.\n${r}`)}l?t(n,r,a,o,s,c):c(a,o)}}return lh(e,t,n)}default:return nh(e)}},Sh=e=>e.variables.map(()=>void 0),Ch=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},wh=(e,t)=>{let n=t.state;if(!n||!Ch(n))throw new _(`ENABLED needs a complete state at ${Ph(e)}`);let r=t.environment;if(r.callStack)return Sm(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1,generator:void 0,successors:0};return Vm(e,r,!1)(i,t.scope,Sh(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Th=(e,t,n,r,i)=>{let a={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};Vm(e,t,!0)(a,r,Sh(t),void 0,!1,e=>{if(!a.isStopped){if(!Ch(e)){if(i){a.isStopped=i([...e]);return}throw y(new f([...e]),b.error)}a.isStopped=n(e)}})},Eh=(e,t,n)=>{let r=[];return Th(e,t,e=>(r.push(e),!1),n),r},Dh=(e,t,r,i,a,o,s)=>{let c={environment:r,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:o,successors:0,onUnsatisfied:s};return Vm(e,r,!1)(c,a,Sh(r),void 0,!1,(e,t)=>{if(!c.isStopped){if(!Ch(e)){let i=r.variables.filter((t,n)=>e[n]===void 0);throw new n(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,e,t,i)}c.successors++,c.isStopped=i({state:e,action:t})}}),c.successors},Oh=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return Vm(e,n,!1)(i,r,Sh(n),void 0,!1,e=>{Ch(e)||(i.isStopped=!0)}),i.isStopped},kh=(e,t,n,r)=>{let i=[];return Dh(e,t,n,e=>(i.push(e),!1),r),i},Ah=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),jh=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Mh=e=>jh.has(e.kind)||e.kind===`Apply`&&Ah.has(e.operator),Nh=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&cn(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Ph=e=>`line ${e.location.line}, column ${e.location.column}`,Fh=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,V=e=>{let t=e.location.range;return t?Fh(t):Ph(e)},Ih={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},Lh=(e,t)=>new _(`TLC encountered a temporal formula (${e}) when evaluating a predicate or action.\n${V(t)}`),Rh=e=>e.kind===`Number`?e.text??String(e.value):V(e),zh=(e,t)=>new _(`A non-boolean expression (${_s(t)}) was used as the condition of an IF.\n${V(e)}`),Bh=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new _(`A non-boolean expression (${_s(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${Rh(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new _(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${_s(n)}.\n${V({...e,location:{...e.location,range:{...r,end:i}}})}`)},Vh=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${A(I(n))}\n${V(e)}`,r=e=>`Attempted to apply function:\n${A(I(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!ln(i))throw new _(`Attempted to select field "${t}" from a non-record value ${A(I(i))}\n${V(e)}`);let a=ir(i);if(a===`tuple`)throw ia(t);return ua(i.kind===`LazyFunction`?F(i):i,t,a===`record`?n:r)}},Hh=e=>e===`1.7.4`?(t,n)=>ta(t,n,e):void 0,Uh=e=>t=>{if(!ln(t))throw new _(`Attempted to apply the operator DOMAIN to a non-function\n(${_s(t)})\n${V(e)}`);return fa(t)},Wh=(e,t)=>(n,r)=>{if(!j(n)||Vn(n))throw new _(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${V(e)}`);return t.evaluateBinary?t.evaluateBinary(n,r):t.evaluate([n,r])},Gh=e=>y(new _(`TLC can't handle real numbers.\n${e.text}`),b.configParseError),Kh=e=>y(new _(`TLC can't handle a number this big.\n${e.text??e.value}`),b.error),qh=(e,t)=>new d(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${V(t)}`,e),Jh=(e,t)=>e instanceof d&&t!==`1.7.4`?new _(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,Yh=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},Xh=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Zh=(e,t,n)=>{if(t.kind===`Name`)return Xh(e,t.name,n);let r=Hi(n);if(!r||r.length!==t.names.length){let e=t.ranges?.[0];throw new _(`Argument mismatch in operator application.${e?Fh(e):``}`)}return t.names.reduce((e,t,n)=>Xh(e,t,r[n]),e)},Qh=(e,t)=>{if(ln(e))return e;throw new _(`A non-function (${_s(e)}) was applied as a function.\n${V(t)}`)},$h=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},eg=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),tg=(e,t)=>{if(typeof e!=`boolean`)throw new _(`Expected ${t} to be a boolean but found ${I(e)}`);return e},ng=(e,t,n)=>{if(typeof e!=`boolean`)throw new _(`Attempted to evaluate an expression of form P => Q when ${n} was\n${_s(e)}.\n${V(t)}`);return e},rg=(e,t)=>{if(typeof e!=`boolean`)throw new _(`Attempted to apply the operator ~ to a non-boolean\n(${_s(e)})\n${V(t)}`);return!e},ig=(e,t,n)=>{if(typeof e!=`boolean`||typeof t!=`boolean`)throw new _(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${V(n)}`);return e===t},ag=(e,t)=>{if(typeof e!=`boolean`)throw new _(`TLC expected a boolean value, but did not find one. ${Rh(t)}`);return e},og=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),sg=(e,t)=>{let n=`universally (\\A) or existentially (\\E) quantify over ${t}, because this would require checking an\ninfinite number of cases.`;if(typeof e==`object`&&e.kind===`SequenceSet`)return`In TLA+, Seq(S) represents the set of all finite sequences whose elements come from the set S. Even when S\nis a finite set, the number of possible sequences in Seq(S) is unbounded because sequences can have any\nfinite length (e.g., length 0, 1, 2, and so on). As a result, TLC cannot evaluate expressions that\n${n} Note that for a finite set of sequences s, TLC handles s \\subseteq Seq(S).\nSee https://explain.tlapl.us/seq-unenumerable for additional details.`;if(typeof e==`object`&&e.kind===`InfiniteSet`&&e.name!==`STRING`&&e.name!==`Any`)return`The set ${e.name} contains infinitely many elements. As a result, TLC cannot evaluate expressions that\n${n} Note that TLC handles set membership like T \\subseteq ${e.name} for any finite set T.`},cg=(e,t,n)=>{if(!j(e)||Vn(e)){let r=I(e),i=n===`1.7.4`?void 0:sg(e,r);throw new _(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${Rh(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${Rh(t)}\n${i}`)}},lg=(e,t,n)=>(cg(e,t,n),typeof e==`object`&&e.kind===`Interval`?ci(e):Si(e)??Oi(e)),ug=(e,t,n)=>n===`1.7.4`?(cg(e,t,n),Si(e)??Ai(e)):lg(e,t,n),dg=e=>{if(typeof e==`object`&&e.kind===`Interval`)return Li(e),e},fg=(e,t,n)=>dg(e)??ug(e,t,n),pg=(e,t,n)=>dg(e)??lg(e,t,n),mg=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},hg=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set)),n),[]),gg=(e,t)=>hg(e,e=>fg(U(e,t),e,t.environment.runtime.version)),_g=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):mg(t[n],t=>i(n-1,Zh(a,e[n].pattern,t)));return i(e.length-1,n)},vg=(e,t,n)=>_g(e,gg(e,t),t.scope,n),yg=(e,t)=>{let n=hg(e,e=>U(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},bg=(e,t,n)=>{if(e.length===1)return Zh(t,e[0].pattern,n);let r=Hi(n)??[];return e.reduce((e,t,n)=>Zh(e,t.pattern,r[n]),t)},xg=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Sg=e=>Object.assign(e.value,{lambda:e}),Cg=e=>xg(e)?e.lambda:void 0,wg=(e,t,n)=>{let r=e.value,i=t.args.map(e=>U(e,n)),a=i.length===1?i[0]:fi(i),o=(e,n,i)=>`In applying the function\n${A(I(r))},\nthe ${e} is:\n${A(I(n))}${i}.\n${V(t.function)}`,s=e.bounds;if(s.length===1){if(!qi(a,r.domain))throw new _(o(`first argument`,a,`which is not in its domain`));return bg(s,e.scope,a)}let c=Hi(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[],u=()=>new _(`In applying the function\n${A(I(r))},\nthe argument list is:\n${A(I(a))}\nwhich does not match its formal parameter.\n`);if(c===void 0||(s.forEach((e,t)=>{if(t>=c.length)throw u();let n=c[t],r=`argument number ${t+1}`;if(!qi(n,l[t]))throw new _(o(r,n,`${e.pattern.kind===`Name`?``:`
|
|
1782
|
+
`}which is not in its domain`));if(e.pattern.kind===`Tuple`&&Hi(n)?.length!==e.pattern.names.length)throw new _(o(r,n,`which does not match its formal parameter`))}),c.length>s.length))throw u();return bg(s,e.scope,a)},Tg=(e,t)=>{let n=t.location.range;if(n)return{parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:Fh(n)}},Eg=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},Dg=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},Og=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),kg=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),Ag=(e,t)=>{let n=yg(e.bounds,t),r=Dg(n,(n,r)=>U(e.body,eg(t,bg(e.bounds,Xh(void 0,e.name,r),n))),Eg(Tg(e.bounds,e.body),e.bounds,n),Og(e.bounds));Sg({value:r,bounds:e.bounds,body:e.body,scope:Xh(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=Ag(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?ar(i):i},jg=(e,t)=>{if(typeof t!=`object`||ir(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!cn(t.domain))return t;try{let e=F(t);return tr(e.domain,e.range)}catch(e){if(e instanceof _)return t;throw e}},Mg=(e,t)=>e.kind===`Operator`&&e.params.length>0?()=>{throw new _(`Operator ${e.name} requires ${e.params.length} arguments`)}:e.kind===`Function`?e.isSelfReferential?t=>Ag(e,t):g_(kg(e),t):g_(e.body,t),Ng=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=Mg(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(eg(e,void 0)):e=>a[i]??r(eg(e,void 0));return t.definitionEvaluators.set(e,o),o},Pg=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},Fg=(e,t)=>e.forEach(e=>{if(e.kind===`Operator`&&e.params.length>0)return;let n=e.name;if(t.constants.has(n)||t.substitutions.has(n)||!qu(e,t))return;let r=t.facts.ids.get(e);if(r===void 0||t.startupValues[r]!==void 0)return;let i={environment:t,scope:void 0,state:void 0,next:void 0};try{let n=t.runtime.evaluateAtStartup(()=>jg(e,Mg(e,t)(i)));Wr(n),t.startupValues[r]=n}catch(e){if(!(e instanceof _)&&!ne(e))throw e}}),Ig=(e,t)=>{if(t===void 0||e===t)return!0;try{return t.every((t,n)=>t===void 0||e?.[n]!==void 0&&fr(e[n],t))}catch(e){if(e instanceof _)return!1;throw e}},Lg=(e,t)=>{let n=e.cache;if(n!==void 0&&Ig(t.state,e.state)&&Ig(t.next,e.next))return n;let r=t.environment.coverage,i=r?.current===-1?void 0:r?.values.get(e),a=r&&i!==void 0?Io(r,i,()=>U(e.expression,eg(t,e.scope))):U(e.expression,eg(t,e.scope));return(!e.isStreamed||Mi(a))&&(e.cache=a,e.state=t.state,e.next=t.next),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),a},Rg=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),zg=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return zg(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Rg(r):t.builtins.get(e)},Bg=(e,t)=>k(e)?Vg(e.operator,t):zg(e.operator,t.environment)??Vg(e.operator,t),Vg=(e,t)=>{let n=Yh(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return zg(e,t.environment)},Hg=e=>e.kind===`Closure`?e.params.length:e.arity,Ug=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:e.params.map(e=>({name:e,arity:0})),body:e.body,scope:t.scope};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0,r=n===void 0?void 0:Vg(n,t);if(!r)throw new _(`Expected an operator argument at ${Ph(e)}`);return r},Wg=(e,t,n)=>{if(e.kind===`Builtin`&&e.isLazy)return e.evaluate(t.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>e})),n);if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>Xh(e,n.name,t[r]),e.scope);return U(e.body,eg(n,r))},Gg=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Hg(e),call:n=>Wg(e,n,t)},Kg=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Vg(e.name,t);return n!==void 0&&Hg(n)>0},qg=(e,t)=>e.map(e=>Kg(e,t)?Gg(Ug(e,t),t):U(e,t)),Jg=(e,t)=>new _(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),Yg=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),Xg=(e,t)=>{let n=t.variableIndex.get(e);if(n!==void 0)return{kind:`Variable`,index:n};let r=t.constants.get(e);if(r!==void 0)return{kind:`Value`,value:r};let i=t.substitutions.get(e);if(i!==void 0)return Xg(i,t);let a=t.definitions.get(e);if(a)return{kind:`Definition`,definition:a};let o=t.builtins.get(e);if(o&&o.arity===0&&!o.isStateLevel)return{kind:`Value`,value:o.evaluate([])}},Zg=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&pn(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=Yg(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=k(e)?void 0:Xg(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0&&!t.callStack)return t=>{let n=Yh(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:Yg(e,t)}}return t=>Yg(e,t)},Qg=(e,t,n,r)=>{if(t.length!==e.params.length)throw Jg(e,t.length);let i=e.scope;for(let a=0;a<t.length;a++){let o=e.params[a],s=o.arity>0?{kind:`Operator`,operator:Ug(t[a],n)}:(r?.[a]??Zg(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},$g=(e,t,n,r)=>e.kind===`Closure`?U(e.body,eg(n,Qg(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>U(e,n))):e.isLazy?e.evaluate(y_(t,n),n):e.evaluate(qg(t,n),n),e_=/* @__PURE__ */ new WeakMap,t_=e=>{let t=e_.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return e_.set(e,n),n},n_=(e,t,n)=>{let r=e.map(e=>({name:e.name,binding:{kind:`Value`,value:!1},parent:void 0})),i=r.reduce((e,t)=>(t.parent=e,t),t.scope);e.forEach((e,a)=>{r[a].binding=e.kind===`Function`?{kind:`Thunk`,expression:t_(e),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1}:e.params.length>0||n?.impure.has(e)?{kind:`Operator`,operator:{kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:i}}:{kind:`Thunk`,expression:e.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(e)??!1}});let a=t.environment.coverage;return a&&a.current!==-1&&r.forEach(e=>{e.binding.kind===`Thunk`&&a.values.set(e.binding,a.current)}),i},r_=(e,t,n)=>{let r=Yh(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Lg(r,n);if(r?.kind===`Operator`){if(Hg(r.operator)===0)return Wg(r.operator,[],n);throw new _(`Operator ${e} is used without arguments`)}let i=Xg(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw qh(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Ng(i.definition,n.environment)(n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new _(`Unknown identifier ${e} at ${Ph(t)}`)},i_=(e,t)=>({impure:new Set(e.filter(e=>Yu(e,t))),streamed:new Set(e.filter(e=>Yu(e,t,`streamed`)))}),a_=e=>[...e.facts.ids.keys()].some(t=>Yu(t,e)),o_=e=>[...e.facts.ids.keys()].some(t=>Yu(t,e,`repeated`)),s_=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,c_=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),l_=e=>t=>{let n=e(t);return fr(n,e(c_(t)))},u_=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Wi.sets,o=Wi.callStack,c=a??[],l=c.length;Wi.sets=c,Wi.callStack=r;try{let a=t(i),o=s_(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Mh(e)&&r.sources.set(o,e),o}catch(t){t instanceof s&&!r.isFrozen&&(r.expressions.length=0,r.isFrozen=!0);let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Nh(e,r.values),a=i&&!gt(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!ln(a)?void 0:a;throw d_(r,[o,...c.slice(l).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),c.length=l,Wi.sets=a,Wi.callStack=o}},d_=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof _){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},f_=(e,t,n)=>{if(!(n instanceof _))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},p_=e=>({...e,coverage:void 0,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),m_=(e,t,n,r)=>i=>{if(r.expressions.at(-1)===e)return n(i);r.expressions.push(...t);try{return n(i)}finally{r.isFrozen||(r.expressions.length-=t.length)}},h_=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=Po(n,i,e);Fo(n,a),n.current=a;try{let i=t(r);return typeof i==`object`&&e.kind===`SetEnumeration`&&n.values.set(i,a),i}finally{n.current=i}},H=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=U_(e,t),i=t.callStack,a=i&&ml.get(e),o=i?u_(e,r,t,i):r,s=i&&a?m_(e,a,o,i):o,c=t.coverage,l=c?h_(e,s,c):s;return t.evaluators.set(e,l),l},g_=(e,t)=>{if(t.callStack||t.coverage)return H(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=Js(e,t)??H(e,t);return t.entryEvaluators.set(e,r),r},U=(e,t)=>g_(e,t.environment)(t),__=(e,t)=>{let n=e.name,r=k(e)?void 0:Xg(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw qh(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n={reference:void 0};return r=>(n.reference??=Ng(e,t))(r)}return t=>r_(n,e,t)},v_=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||k(e))return!0;let n=zg(e.name,t);return n===void 0||Hg(n)===0},y_=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>U(e,t),expression:e})),b_=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(y_(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&v_(t[0],n)){let e=H(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&v_(t[0],n)&&v_(t[1],n);if(i&&a){let e=H(t[0],n),r=H(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(qg(t,n),n)},x_=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw Jg(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Zg(e,n));return n=>{let a=e.scope;for(let e=0;e<t.length;e++){let o=i[e],s=o?o(n):{kind:`Operator`,operator:Ug(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},S_=(e,t,n)=>{let r=x_(e,t,n),i={body:void 0};return t=>(i.body??=g_(e.body,n),i.body({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},C_=(e,t)=>{let n=e.args;if(e.operator===`=>`){let r=H(n[0],t),i=H(n[1],t);return t=>!ng(r(t),e,`P`)||ng(i(t),e,`Q`)}if(e.operator===`~`&&n.length===1){let r=H(n[0],t);return t=>rg(r(t),e)}if(e.operator===`<=>`){let r=H(n[0],t),i=H(n[1],t);return t=>ig(r(t),i(t),e)}if(e.operator===`~>`||e.operator===`-+->`)return()=>{throw Lh(e.operator===`~>`?`a ~> b`:`a -+-> formula`,e)};let r=k(e)?void 0:zg(e.operator,t);if(r?.kind===`Closure`)return S_(r,n,t);if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=H(n[0],t),i=Uh(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=!pl.has(e)&&!$u(n[0],t);return e=>r.evaluate(y_(n,e),i&&e.scope===void 0?void 0:e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=H(n[0],t),a=H(n[1],t),o=Wh(e,r);return e=>o(i(e),a(e))}if(r?.kind===`Builtin`)return b_(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new _(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let i=n.map(e=>Zg(e,t));return r=>{let a=Vg(e.operator,r);if(a)return $g(a,n,r,i);throw t.definitions.get(e.operator)?.kind===`Function`?new _(`${e.operator} is a function; apply it with brackets`):new _(`Unknown operator ${e.operator} at ${Ph(e)}`)}},w_=(e,t)=>{let n=e.kind===`Forall`,r=H(e.body,t),i=e.bounds[0];if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=H(i.set,t);return s=>mg(fg(o(s),i.set,t.runtime.version),t=>ag(r(eg(s,Xh(s.scope,a,t))),e)!==n)?!n:n}let a=e.bounds;if(a.every(e=>e.pattern.kind===`Name`)){let i=a.map(e=>e.pattern.kind===`Name`?e.pattern.name:``);return o=>{let s=hg(a,e=>fg(H(e,t)(o),e,t.runtime.version)),c=(t,a)=>t<0?ag(r(eg(o,a)),e)!==n:mg(s[t],e=>c(t-1,Xh(a,i[t],e)));return c(a.length-1,o.scope)?!n:n}}return t=>vg(a,t,i=>ag(r(eg(t,i)),e)!==n)?!n:n},T_=(e,t)=>{if(e.kind===`Tuple`)return fi(e.names.map(e=>{let n=Yh(t,e);return n?.kind===`Value`&&n.value}));let n=Yh(t,e.name);return n?.kind===`Value`?n.value:void 0},E_=/* @__PURE__ */ new WeakSet,D_=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&E_.add(e)},O_=/* @__PURE__ */ new WeakMap,k_=e=>{if(O_.has(e))return O_.get(e);let t=/* @__PURE__ */ new Set,n=e=>e.kind!==`Subexpression`&&(e.kind===`Identifier`&&t.add(e.name),(e.kind===`Apply`||e.kind===`OperatorReference`)&&t.add(e.operator),e.kind===`ExceptAt`&&t.add(`@`),gt(e).every(n)),r=n(e)?[...t]:void 0;return O_.set(e,r),r},A_=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=Yh(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),j_=e=>E_.has(e),M_=(e,t)=>{let n=j_(e),r=H(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=e=>r(eg(t,Xh(t.scope,n,e)));if(on(e))return Li(e),sn(e,i),d(e,t);let o=ui(e),s=tr(o,o.map(i));return cn(e)?s:(s.lambdaDomain=e,ar(s))}let n=[],s=hg(i,e=>pg(U(e,t),e,t.environment.runtime.version));return _g(i,s,t.scope,e=>{let o=i.length===1?T_(a.pattern,e)??!1:fi(i.map(t=>T_(t.pattern,e)??!1));return n.push([o,r(eg(t,e))]),!1}),ti(n)},c=Tg(i,e.body),l=Og(i),u=k_(e.body),d=(t,n)=>{let a=A_(n.scope,u),o=eg(n,a),s=Sg({value:Dg(t,e=>r(eg(o,bg(i,a,e))),Eg(c,i,t),l),bounds:i,body:e.body,scope:a});return i.length===1?ar(s):s},f=t.callStack;return{build:(t,r)=>{if(e.isRecursive||n||r.isKeepLazy||!M(t))return d(t,r);if(!(i.length===1?cn(t):typeof t==`object`&&t.kind===`ProductSet`&&t.factors.every(cn))){if(f)return d(t,r);try{return s(t,r)}catch(e){if(!(e instanceof _))throw e;return d(t,r)}}if(!f)return s(t,r);try{return s(t,r)}catch(t){throw f_(f,e,t),t}},createLazy:d}},N_=(e,t)=>{let n=M_(e,t).build,r=e.bounds;if(r.length===1&&r[0].pattern.kind===`Name`){let e=H(r[0].set,t);return t=>n(e(t),t)}return e=>n(yg(r,e),e)},P_=(e,t)=>{let n=E_.has(e);n&&D_(e.function);let r=H(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>H(e,t))}),value:H(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):fi(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(eg(i,Xh(i.scope,`@`,e))):pa(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i={value:!1};n=o(n,r.path,0,t,e=>(i.value=!0,r.value(e))),i.value||t.environment.runtime.warn(St.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${V(e.function)}`)}return n}},F_=(e,t)=>{let n=H(e.predicate,t),r=e.bound.pattern,i=e.predicate.location.range,a=i&&{names:r.kind===`Name`?r.name:r.names.join(`, `),predicate:Fh(i)},o=Rh(e.predicate),s=t.coverage,c=(e,t,n)=>{if(!s||e===-1)return n();t||s.secondary[e]++;let r=Io(s,t?-1:e,n);return!t&&r===!0&&s.secondary[e]++,r},l=(t,n,i,s)=>({kind:`FilteredSet`,base:t,test:(e,t)=>{if(r.kind===`Tuple`&&Hi(e)?.length!==r.names.length)throw new _(`Attempted to check if the value:\n${A(I(e))}\nis an element of a set of ${r.names.length}-tuples.`);let a=c(s,t,()=>i(eg(n,Zh(n.scope,r,e))));if(typeof a!=`boolean`)throw new _(`${t?`The evaluation of predicate`:`Evaluating predicate`} ${o} yielded non-Boolean value.`);return a},source:a,rebind:r=>l(t,{...n,environment:r},H(e.predicate,r),-1)});return(e,t,r=-1)=>l(e,t,n,r)},I_=(e,t)=>{if(typeof e!=`boolean`)throw new _(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${_s(e)}.\n${Rh(t.predicate)}`);return e},L_=(e,t,n,r)=>{if(!j(e)||Vn(e))throw new _(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${V(t)}`);return Gr(e),pg(e,n,r)},R_=e=>new _(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${V(e)}`),z_=(e,t)=>{if(e.kind===`SetFilter`){let n=H(e.predicate,t),r=H(e.bound.set,t),i=F_(e,t),a=e.bound.pattern,o=t.coverage;return t=>{let s=r(t);if(!cn(s))return i(s,t,o?.current);let c=[],l=r=>{let i=n(eg(t,Zh(t.scope,a,r)));I_(i,e)&&an(c,r)},u=s.kind===`Interval`?s:N(s).elements;return sn(u,l),o&&o.current!==-1&&(o.secondary[o.current]+=(Array.isArray(u)?u.length:u.high-u.low+1)+c.length),er(c)}}if(e.kind===`SetMap`){let n=H(e.expression,t);return t=>{let r=[];return vg(e.bounds,t,e=>(an(r,n(eg(t,e))),!1)),Xr(r)}}let n=e.set;if(!n)return()=>{throw new _(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${V(e)}`)};let r=H(e.body,t),i=H(n,t);return t=>{let a=L_(i(t),e,n,t.environment.runtime.version),o={value:void 0},s=e.pattern;if(mg(a,n=>{if(s.kind===`Tuple`&&Hi(n)?.length!==s.names.length)throw new _(`Attempted to compute the value of an expression of form\nCHOOSE <<x1, ... , xN>> \\in S: P, but S was not a set\nof N-tuples.\n${V(e)}`);let i=Zh(t.scope,s,n);return ag(r(eg(t,i)),e)?(o.value=T_(s,i),!0):!1}),o.value===void 0)throw R_(e);return o.value}},B_=e=>[...e].sort((e,t)=>Jn(e.name,t.name)),V_=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),H_=(e,t)=>{let n=B_(e),r=V_(n),i=n.map(e=>H(e.value,t));if(r)return e=>pi(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>yn(a,i.map(t=>t(e)),o):e=>mi(a,i.map(t=>t(e)))},U_=(e,t)=>{let n=e=>H(e,t);switch(e.kind){case`Number`:{let t=e.value;return pn(t)?()=>t:()=>{throw Kh(e)}}case`Decimal`:return()=>{throw Gh(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return __(e,t);case`Apply`:return C_(e,t);case`Bracket`:return()=>{throw new _(`A bracket without a function or subscript is not an expression at ${Ph(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new _(`An operator cannot be used as a value at ${Ph(e)}`)};case`And`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw Bh(e,r,i);if(!i)return!1}return!0}}case`Or`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw Bh(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return e=>t(c_(e))}case`Unchanged`:return l_(n(e.expression));case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw zh(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new _(`A non-boolean expression (${_s(t)}) was used as a condition of a CASE. ${Rh(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new _(`Attempted to evaluate a CASE with no conditions true.\n${V(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(eg(n,n_(e.definitions,n)))}case`Forall`:case`Exists`:return w_(e,t);case`UnboundedQuantifier`:return()=>{let t=e.quantifier===`Forall`?`\\A`:`\\E`;throw e.isTemporal?Lh(e.quantifier===`Forall`?`\\AA`:`\\EE`,e):new _(`TLC attempted to evaluate an unbounded ${t}.\nMake sure that the expression is of form ${t} x \\in S: P(x).\n${V(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return z_(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Xr(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>fi(t.map(t=>t(e)))}case`FunctionConstruction`:return N_(e,t);case`FunctionSet`:{let t=n(e.domain),r=n(e.range);return e=>({kind:`FunctionSet`,domain:t(e),range:r(e)})}case`Record`:return H_(e.fields,t);case`RecordSet`:{let t=B_(e.fields),r=t.map(e=>e.name),i=t.map(e=>n(e.value));return e=>({kind:`RecordSet`,names:r,sets:i.map(t=>t(e))})}case`Except`:return P_(e,t);case`ExceptAt`:return t=>{let n=Yh(t.scope,`@`);if(n?.kind!==`Value`)throw new _(`@ appears outside an EXCEPT at ${Ph(e)}`);return n.value};case`FunctionApplication`:{D_(e.function);let r=n(e.function),i=t=>Qh(r($h(t)),e),a=e.args.map(n),o=Hh(t.runtime.version);if(a.length===1){let e=a[0];return t=>ua(i(t),e(t),o)}return e=>ua(i(e),fi(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=Vh(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=l_(n(e.subscript)),i=e.kind===`BoxAction`,a=i?`[A]_e`:`<A>_e`;return n=>{let o=t(n);if(typeof o!=`boolean`)throw new _(`Attempted to evaluate an expression of form ${a}, but A was not a boolean.\n${V(e)}`);return i?o||r(n):o&&!r(n)}}case`Enabled`:{let t=e.expression;return e=>wh(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new _(`The subexpression reference at ${Ph(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw Lh(Ih[e.kind],e)}}},W_=`tlc2/value/impl/`,G_={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},K_={iconstM1:2,iconst0:3,iconst5:8,bipush:16,sipush:17,ldc:18,ldcW:19,dup:89,areturn:176,getstatic:178,invokespecial:183,invokestatic:184,new:187},q_=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n={offset:0},r=e=>{let t=n.offset;return n.offset+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n.offset)}},J_=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),Y_=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],X_=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??J_.get(e[3])}${`[]`.repeat(e[1].length)}`),Z_=(e,t)=>e[e[t].first].text,Q_=(e,t)=>Z_(e,t).replaceAll(`/`,`.`),$_=e=>{let t=q_(e);if(t.readUint32()!==3405691582)throw new r(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],i=t.readUint16(),a=new TextDecoder;for(let e=1;e<i;e++){let r=t.readUint8(),i={tag:r,text:``,value:0,first:0,second:0};n[e]=i,r===G_.utf8?i.text=a.decode(t.readBytes(t.readUint16())):r===G_.integer?i.value=t.readInt32():r===G_.float?t.readUint32():r===G_.long||r===G_.double?(t.readBytes(8),e++):r===G_.class||r===G_.string||r===G_.methodType||r===G_.module||r===G_.package?i.first=t.readUint16():r===G_.methodHandle?(t.readUint8(),i.first=t.readUint16()):(i.first=t.readUint16(),i.second=t.readUint16())}t.readUint16();let o=Q_(n,t.readUint16());t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let s=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,a=i.indexOf(`)`),c=X_(i.slice(1,a)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:q_(t.readBytes(t.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>Q_(n,d.readUint16())):[],p=Y_.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=X_(i.slice(a+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;s.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${o}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:s}},ev=(e,t)=>{let n=e[t],r=e[n.second];return{className:Z_(e,n.first),name:e[r.first].text}},tv=(e,n,r,i)=>{let a=()=>new t(`The Java override ${r}.${e.name} computes its value, which tla-ts cannot run`),o=e.code;if(!o)throw a();let s=[],c=()=>{let e=s.pop();if(e===void 0)throw a();return e},l=e=>{let t=n[e];if(t.tag===G_.integer)return t.value;if(t.tag===G_.string)return n[t.first].text;throw a()};for(let e=0;e<o.length;){let t=o[e],r=()=>o[e+1]<<8|o[e+2];if(t>=K_.iconstM1&&t<=K_.iconst5)s.push(t-K_.iconst0),e+=1;else if(t===K_.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===K_.sipush)s.push(r()<<16>>16),e+=3;else if(t===K_.ldc)s.push(l(o[e+1])),e+=2;else if(t===K_.ldcW)s.push(l(r())),e+=3;else if(t===K_.dup){let t=c();s.push(t,t),e+=1}else if(t===K_.getstatic){let t=ev(n,r());if(t.className!==`${W_}BoolValue`||t.name!==`ValTrue`&&t.name!==`ValFalse`)throw a();s.push({kind:`Identifier`,name:t.name===`ValTrue`?`TRUE`:`FALSE`,location:i}),e+=3}else if(t===K_.invokestatic){let t=ev(n,r()),o=c();if(t.className!==`${W_}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===K_.new)s.push({className:Z_(n,r()),value:void 0}),e+=3;else if(t===K_.invokespecial){let t=ev(n,r()),o=c(),s=c();if(!(t.className===`${W_}StringValue`&&t.name===`<init>`&&typeof o==`string`&&typeof s==`object`&&`className`in s))throw a();s.value={kind:`String`,value:o,location:i},e+=3}else if(t===K_.areturn){let e=c();if(typeof e!=`object`)throw a();if(`className`in e){if(!e.value)throw a();return e.value}return e}else throw a()}throw a()},nv=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=$_(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:tv(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},rv=D(`EOF`),iv=D(`IDENTIFIER`),av=D(`DEFBREAK`),ov=(e,t)=>Array.from({length:D(t)-D(e)+1},(t,n)=>D(e)+n),sv=new Set(ov(`op_57`,`op_119`)),cv=new Set(ov(`op_1`,`op_119`)),lv=new Set(ov(`op_57`,`op_70`)),uv=/* @__PURE__ */ new Set([...ov(`ACTION`,`EXCEPT`),D(`EXTENDS`),...ov(`IF`,`SF`),D(`STATE`),...ov(`THEN`,`WITH`),D(`US`),...ov(`op_112`,`op_116`)]),dv=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),fv=new Map([...dv(`postfix`,160,160,!0,`[`),...dv(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...dv(`prefix`,120,120,!1,`-.`),...dv(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...dv(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...dv(`prefix`,40,40,!0,`\\lnot`),...dv(`nfix`,100,130,!0,`\\times`),...dv(`infix`,140,140,!1,`^`,`^^`),...dv(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...dv(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...dv(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...dv(`infix`,100,110,!0,`|`,`||`,`%%`),...dv(`infix`,100,110,!1,`%`),...dv(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...dv(`infix`,90,140,!1,`\\wr`),...dv(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...dv(`infix`,90,130,!1,`!!`),...dv(`infix`,90,90,!1,`...`,`..`),...dv(`infix`,80,80,!0,`\\intersect`,`\\union`),...dv(`infix`,80,80,!1,`\\`),...dv(`infix`,70,70,!1,`<:`,`:>`),...dv(`infix`,60,60,!0,`@@`),...dv(`infix`,50,140,!0,`\\cdot`),...dv(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...dv(`infix`,30,30,!0,`\\land`,`\\lor`),...dv(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...dv(`infix`,10,10,!1,`=>`)]),pv=new Map([...fv,...Xf.flatMap(e=>e.slice(1).map(t=>[t,fv.get(e[0])]))]),mv=pv.get(`[`),hv={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},gv=e=>({type:`tokens`,kinds:new Set(e)}),_v=e=>typeof e==`string`?e.startsWith(`<`)?gv([D(e.slice(1,-1))]):{type:`call`,name:e}:e,W=(...e)=>({type:`sequence`,units:e.map(_v)}),G=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:W(e))}),vv=e=>(...t)=>({type:e,body:W(...t)}),K=vv(`zeroOrMore`),yv=vv(`oneOrMore`),q=vv(`optional`),J=e=>({type:`action`,run:t=>e(t)??void 0}),Y=e=>J(t=>{t.expecting=e}),X=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&W(...e.expansion),semantic:e.semantic}),bv=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),xv=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=bv(e,n);return n},Sv=(...e)=>{let t=e.map(D);return e=>t.includes(xv(e,1).kind)},Cv=(e,t=xv(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},wv=e=>{let t=xv(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Tv=e=>Sv(`CASESEP`)(e)&&Cv(e),Ev=e=>{let t=xv(e,1);uv.has(t.kind)&&(t.kind=iv)},Dv=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,Ov=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),kv=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Av=e=>e.operatorStacks[e.operatorStacks.length-1],jv=(e,t)=>e.low>t.high,Mv=(e,t)=>e.high<t.low,Nv=e=>e.fix===`prefix`?e:pv.get(`${e.name}.`),Pv=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===mv?Ov(`FcnAppl`,[n,...r.node.heirs]):Ov(`PostfixExpr`,[n,r.node]),operator:void 0})},Fv=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Ov(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:Ov(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Iv=e=>{let t=Av(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return Pv(t,n),Iv(e);if(i.operator!==void 0){let t=Nv(r.operator);return t!==void 0&&jv(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Dv(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${Dv(e,a.node.first,a.node.last)} and expression at location ${Dv(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Mv(a.operator,r.operator)?void 0:jv(a.operator,r.operator)?(Fv(t,a.operator),Iv(e)):`Precedence conflict between ops ${a.operator.name} in block ${Dv(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Nv(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Mv(s,r.operator))return;if(!jv(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Dv(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Fv(t,s),Iv(e);let c=Dv(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===hv?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},Lv=e=>J(t=>{let n=Av(t),r=kv(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:Iv(t)}),Rv=Lv(()=>!1),zv=Lv(()=>!0),Bv=J(e=>{e.lastOperator=pv.get(e.token.image)}),Vv=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},Hv=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?Vv(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Uv=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Cv(e,n.first.beginColumn))return n;let t=Uv(e,n);if(t!==void 0)return t}},Wv=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(D),n=(e,...t)=>t.some(t=>e.kind===D(t)),r=e=>e!==void 0&&sv.has(e.kind),i=e.token,a=bv(e,i);i.next=void 0;let o=bv(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===iv&&(e=e.next)}else if(e.kind===iv){let t=e.next;!r(t)||lv.has(t.kind)||cv.has(t.kind)&&t.next?.kind!==iv||(e=t.next?.kind===D(`SUBSTITUTE`)?i:cv.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==av&&(e.next={kind:av,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=bv(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Gv=e=>{let t=xv(e,1);if(t.kind===D(`LAB`)){let n=1;for(;n!==0;)if(t=bv(e,t),t.kind===D(`LAB`)&&n++,t.kind===D(`RAB`)&&n--,t.kind===rv)return!1;return bv(e,t).kind===D(`IN`)}if(t.kind!==iv)return!1;for(t=bv(e,t);t.kind===D(`COMMA`);){if(t=bv(e,t),t.kind!==iv)return!1;t=bv(e,t)}return t.kind===D(`IN`)},Kv=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),qv=e=>e.proofLevels.at(-1)??-1,Jv=e=>{let t=xv(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:Sv(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||qv(e)>=0&&Kv(t)>qv(e):Sv(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Yv=(e,t)=>{let n=Kv(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},Xv=e=>J(t=>Yv(t,t.token)?void 0:`${Dv(t,t.token)}: ${e}`),Zv=gv([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(D)),Qv=gv([...Zv.kinds,D(`op_76`)]),$v=gv(cv),ey=gv(lv),ty=gv([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(D)),ny=()=>K(X({expansion:[G(Zv,`<op_77>`)],semantic:Cv}),G(`PrefixOp`,`InfixOp`),zv),ry=()=>G(W(X({expansion:[`OpenStart`],semantic:Cv}),`OpenExpression`,Rv),W(X({semantic:Cv}),`ExtendableExpr`)),iy=()=>G(W(`<MODULE>`,Y(`identifier`),`Identifier`),`Expression`),ay=()=>G(W(X({semantic:e=>Sv(`ASSUME`,`BOXASSUME`)(e)||xv(e,2).kind===D(`COLONCOLON`)&&[D(`ASSUME`),D(`BOXASSUME`)].includes(xv(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),oy=()=>[`JuncItem`,K(X({semantic:wv}),`JuncItem`)],sy=e=>J(t=>{t.expecting=e,Ev(t)}),cy=e=>J(t=>{t.isTerminalProof=e}),ly=(e,...t)=>W(...t.slice(0,-1),Y(`==`),`<DEF>`,J(t=>{Wv(t),t.expecting=e}),t[t.length-1]),Z=(e,t,n)=>({message:e,body:W(...t),exit:n}),uy={CompilationUnit:Z(void 0,[J(Wv),q(`Prelude`),`Module`]),Prelude:Z(void 0,[`<BEGIN_PRAGMA>`,K(G(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Z(`Module definition`,[Y(`---- MODULE`),`BeginModule`,Y(`EXTENDS clause or module body`),`Extends`,Y(`Module body`),`Body`,Y(`==== or more Module body`),`EndModule`]),BeginModule:Z(`Begin module`,[Y(`---- MODULE (beginning of module)`),G(`<_BM0>`,`<_BM1>`,`<_BM2>`),sy(`Identifier`),`Identifier`,J(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Z(void 0,[`<END_MODULE>`]),Extends:Z(`Extends`,[q(`<EXTENDS>`,sy(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,sy(`Identifier`),`Identifier`))]),Body:Z(`Module body`,[Y(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),K(G(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,W(X({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,W(X({amount:2}),`Instance`),W(X({amount:2}),`Assumption`),W(X({amount:2}),`Theorem`),W(X({amount:1}),`Module`,J(Wv)),W(X({semantic:e=>Sv(`USE`)(e)&&xv(e,2).kind!==D(`ONLY`)||Sv(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Z(`variable declaration`,[`<VARIABLE>`,Y(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,Y(`Identifier`),`Identifier`)]),ParamDeclaration:Z(`Parameter declaration`,[Y(`CONSTANT`),`ParamSubDecl`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y(`,`),K(`<COMMA>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Z(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Z(`Recursive`,[Y(`RECURSIVE`),`<RECURSIVE>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y(`,`),K(`<COMMA>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y("`,' or `)'"))]),ConstantDeclarationItems:Z(`Constant declaration items`,[Y(`Identifier, _ or prefix op`),G(W(`Identifier`,Y(`(, comma, or Module Body`),q(X({amount:2}),`<LBR>`,Y(`_`),`<US>`,Y(`comma or )`),K(`<COMMA>`,Y(`_`),`<US>`,Y(`comma or )`)),`<RBR>`)),W(`NonExpPrefixOp`,Y(`_`),`<US>`),W(`<US>`,Y(`prefix or postfix operator`),G(W(`InfixOp`,Y(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Z(`Definition`,[Y(`LOCAL, Identifier or Operator Symbol`),q(`<LOCAL>`),`<DEFBREAK>`,Y(`LOCAL, Identifier or Operator Symbol`),G(ly(`Expression`,X({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,Y(`[`),`<LSB>`,Y(`Identifier`),`QuantBound`,Y(`COMMA or ]`),K(`<COMMA>`,Y(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),ly(`Expression`,X({expansion:[`<IDENTIFIER>`,ey]}),`PostfixLHS`,`Expression`),ly(`Expression`,X({expansion:[`<IDENTIFIER>`,$v]}),`InfixLHS`,`Expression`),ly(`Expression or Instance`,X({expansion:[`<IDENTIFIER>`,G(`<LBR>`,`<DEF>`)]}),`IdentLHS`,G(`Expression`,`Instantiation`)),ly(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Z(`Identifier tuple`,[`<LAB>`,Y(`Identifier or >>`),q(`Identifier`,Y(`COMMA or >>`),K(`<COMMA>`,Y(`COMMA or >>`),`Identifier`,Y(`COMMA or >>`))),`<RAB>`]),IdentLHS:Z(`Identifier LHS`,[`Identifier`,Y(`( or ==`),q(`<LBR>`,Y(`Identifier Declaration, prefix op, _ or )`),G(`IdentDecl`,`SomeFixDecl`),Y(`COMMA or )`),K(`<COMMA>`,Y(`Identifier Declaration, prefix op or _`),G(`IdentDecl`,`SomeFixDecl`),Y(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Z(`Prefix LHS`,[Qv,Y(`Identifier`),`Identifier`]),InfixLHS:Z(`Infix LHS`,[`Identifier`,$v,`Identifier`]),PostfixLHS:Z(`Postfix LHS`,[`Identifier`,ey]),IdentDecl:Z(`Identifier Declation`,[`Identifier`,Y(`( or ...`),q(`<LBR>`,Y(`_`),`<US>`,Y(`COMMA or )`),K(`<COMMA>`,Y(`_`),`<US>`,Y(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Z(`Op. Symbol Declaration`,[G(W(`NonExpPrefixOp`,Y(`_`),`<US>`),W(`<US>`,Y(`infix or postfix operator`),G(W(`InfixOp`,Y(`_`),`<US>`),`PostfixOp`)))]),Instance:Z(`Instance`,[Y(`LOCAL or instance`),q(`<LOCAL>`),`Instantiation`,Y(`COMMA or Module Body`)]),Instantiation:Z(`NonLocalInstance`,[`<INSTANCE>`,sy(`Module identifier`),`Identifier`,Y(`WITH or another definition.`),q(`<WITH>`,Y(``),`Substitution`,Y(``),K(X({amount:3}),`<COMMA>`,Y(``),`Substitution`,Y(``)))]),Substitution:Z(`Substitution`,[G(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),Y(`<-`),`<SUBSTITUTE>`,Y(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Z(void 0,[Zv,Bv]),NonExpPrefixOp:Z(void 0,[Qv,Bv]),InfixOp:Z(`Infix Op`,[$v,Bv]),PostfixOp:Z(void 0,[ey,Bv]),Identifier:Z(void 0,[`<IDENTIFIER>`]),Assumption:Z(`Assumption`,[Y(`ASSUM...`),G(`<ASSUMPTION>`,`<ASSUME>`),q(X({amount:2}),q(`<DEFBREAK>`),`Identifier`,Y(`==`),`<DEF>`),J(e=>{Wv(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Z(`Assume-Prove`,[G(W(`Identifier`,`<COLONCOLON>`,`AssumeProve`),W(G(`<ASSUME>`,`<BOXASSUME>`),Y(`Expression, Declaration, or AssumeProve`),ay(),Y("PROVE or `,'"),K(`<COMMA>`,Y(`Expression, Declaration, or AssumeProve`),ay(),Y("PROVE or `,'")),G(`<PROVE>`,`<BOXPROVE>`),Y(`Expression`),`Expression`))]),NewSymb:Z(`NEW symbol declaration`,[Y(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),G(W(X({amount:2}),G(W(X({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),Y(`Constant declaration`),G(W(X({amount:2}),`IdentDecl`,q(`<IN>`,J(e=>{let t=kv(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Dv(e,t.first,t.last)}`:void 0}),Y(`Expression`),`Expression`)),`SomeFixDecl`)),W(X({amount:2}),q(`<NEW>`),`<VARIABLE>`,Y(`Identifier`),`Identifier`),W(X({amount:2}),q(`<NEW>`),G(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),Y(`Declaration`),G(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Z(`Domain binding`,[q(`<IN>`,Y(`Expression`),`Expression`)]),Theorem:Z(`Theorem`,[Y(`THEOREM, PROPOSITION`),G(`<THEOREM>`,`<PROPOSITION>`),Y(`Identifier, Assume-Prove or Expression`),q(X({amount:2}),`Identifier`,Y(`==`),`<DEF>`),J(Wv),G(W(X({amount:3}),X({semantic:Sv(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),q(X({semantic:Jv}),`Proof`)]),Proof:Z(`Proof`,[J(e=>{e.proofLevels.push(-1)}),G(W(X({semantic:e=>Sv(`BY`)(e)||xv(e,2).kind===D(`BY`)}),`UseOrHideOrBy`),W(X({amount:2}),q(`<PROOF>`),G(`<OBVIOUS>`,`<OMITTED>`)),W(q(X({amount:2}),`<PROOF>`),K(X({semantic:e=>xv(e,2).kind!==D(`QED`)}),`Step`,Y(`a proof step`)),`QEDStep`)),J(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Z(`UseOrHideOrBy`,[G(W(q(`<PROOF>`),`<BY>`,cy(!0),q(`<ONLY>`)),W(`<USE>`,cy(!1),q(`<ONLY>`)),W(`<HIDE>`,cy(!1))),Y("an expression, `MODULE' or `DEF'"),q(iy(),K(`<COMMA>`,Y(`MODULE or expression`),iy(),J(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),q(`<DF>`,Y(`MODULE or expression`),iy(),K(`<COMMA>`,Y(`MODULE or expression`),iy(),J(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),J(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Z(`QED step`,[Y(`Step number`),ty,Xv(`QED step's number has bad level.`),Y(`QED`),`<QED>`,q(X({semantic:Jv}),`Proof`)]),Step:Z(`Step`,[Y(`Step number`),ty,Xv(`step's number has bad level.`),Y(`proof step`),G(W(X({semantic:Sv(`USE`,`HIDE`)}),`UseOrHideOrBy`),W(X({semantic:Sv(`INSTANCE`)}),`Instantiation`),W(X({semantic:Sv(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),q(X({semantic:Jv}),J(e=>{let t=kv(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Dv(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Z(`DefStep`,[q(`<DEFINE>`),yv(X({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Z(`HaveStep`,[`<HAVE>`,Y(`expression`),`Expression`]),TakeStep:Z(`TakeStep`,[`<TAKE>`,Y(`identifier`),G(W(X({expansion:[G(W(`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,Y(`comma or step`),K(`<COMMA>`,Y(`identifier or tuple of identifiers`),`QuantBound`,Y(`comma or proof step`))),W(`Identifier`,Y(`comma or proof step`),K(`<COMMA>`,Y(`identifier`),`Identifier`,Y(`comma or proof step`))))]),WitnessStep:Z(`WitnessStep`,[`<WITNESS>`,Y(`expression`),`Expression`,K(`<COMMA>`,Y(`expression`),`Expression`,Y(`comma or colon`))]),PickStep:Z(`PickStep`,[`<PICK>`,Y(`identifier`),G(W(X({expansion:[`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,Y(`comma, or colon`),K(`<COMMA>`,Y(`identifier`),`Identifier`,Y(`comma or colon`))),W(`QuantBound`,Y(`comma or colon`),K(`<COMMA>`,Y(`identifier or tuple of identifiers`),`QuantBound`,Y(`comma or colon`)))),`<COLON>`,Y(`expression`),`Expression`]),CaseStep:Z(`CaseStep`,[`<CASE>`,Y(`expression`),`Expression`]),AssertStep:Z(`AssertStep`,[q(`<SUFFICES>`,Y(`expression or ASSUME/PROVE`)),G(`Expression`,W(X({semantic:Sv(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Z(void 0,[G(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Z(void 0,[G(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Z(`String`,[`<STRING_LITERAL>`]),Number:Z(void 0,[`<NUMBER_LITERAL>`,q(X({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Z(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,K(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Z(void 0,[G(W(X({amount:2,expansion:[G(Qv,$v,ey),gv([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(D))],semantic:Cv}),G(`NonExpPrefixOp`,W(`InfixOp`,J(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Dv(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),W(X({expansion:[`<LAMBDA>`],semantic:Cv}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Z(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Z(`Quantified form`,[G(`<EXISTS>`,`<FORALL>`),G(W(X({expansion:[`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,K(`<COMMA>`,`Identifier`)),W(`QuantBound`,K(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Z(`Bound Quantified Expression`,[G(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,K(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Z(`Quant Bound`,[G(`IdentifierTuple`,W(`Identifier`,K(`<COMMA>`,`Identifier`,Y(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Z(`Some { } form`,[`<LBC>`,q(G(W(X({semantic:Gv}),G(`IdentifierTuple`,`Identifier`),Y(`\\in`),`<IN>`,`Expression`,Y(`':', ',' or '}'`),q(G(W(`<COLON>`,`Expression`),yv(`<COMMA>`,`Expression`)))),W(X({expansion:[G(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,K(`<COMMA>`,`Expression`)),W(X({expansion:[G(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,K(`<COMMA>`,`QuantBound`)),W(`Expression`,q(G(W(`<COLON>`,J(e=>{let t=kv(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,K(`<COMMA>`,`QuantBound`)),yv(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Z(`Some [] Form`,[`<LSB>`,G(W(X({semantic:Gv}),`QuantBound`,K(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({semantic:e=>xv(e,2).kind===D(`MAPTO`)&&uv.has(xv(e,1).kind)}),J(e=>{xv(e,1).kind=iv}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,K(`<COMMA>`,`FieldSet`),`<RSB>`),W(`Expression`,G(W(K(`<COMMA>`,`Expression`),`<RSB>`,J(e=>{let t=e.frames[e.frames.length-1];t.node=Ov(`FcnAppl`,t.heirs),e.lastOperator=mv})),W(`<ARROW>`,`Expression`,`<RSB>`),W(`<EXCEPT>`,`ExceptSpec`,K(`<COMMA>`,`ExceptSpec`),`<RSB>`),W(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Z(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Z(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Z(`Except Spec`,[`<BANG>`,yv(`ExceptComponent`,Y(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Z(`Except Component`,[G(W(`<DOT>`,J(Ev),`Identifier`,J(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),W(`<LSB>`,`Expression`,K(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Z(`Some << -- >> or >>_ Form`,[`<LAB>`,q(`Expression`,K(`<COMMA>`,`Expression`)),G(`<RAB>`,W(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Z(void 0,[`Identifier`,q(X({amount:2}),`OpArgs`),G(W(`<BANG>`,`NoOpExtension`),J(e=>{e.isFairnessHooked=e.token.kind===D(`RBR`)}))]),ReducedExpression:Z(`restricted form of expression`,[G(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Z(`Fairness Expression`,[J(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),G(`<WF>`,`<SF>`),`ReducedExpression`,q(X({amount:2}),`<LBR>`,`Expression`,`<RBR>`,J(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Z(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Z(`CASE Expression`,[`<CASE>`,`CaseArm`,K(X({semantic:e=>Tv(e)&&xv(e,2).kind!==D(`OTHER`)}),`<CASESEP>`,`CaseArm`),q(X({semantic:Tv}),`<CASESEP>`,`OtherArm`)]),CaseArm:Z(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Z(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Z(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Z(`Let Definitions`,[yv(G(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Z(`AND-OR Junction`,[J(e=>{let t=xv(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),G(W(X({expansion:[`<OR>`]}),...oy()),W(X({expansion:[`<AND>`]}),...oy())),J(e=>{e.junctions.pop()})]),JuncItem:Z(`Junction Item`,[G(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Uv(t,e.heirs[1]);return n&&`Item at ${Dv(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Dv(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Z(`(Un)Bounded Choose`,[`<CHOOSE>`,G(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Z(`Lambda`,[`<LAMBDA>`,Y(`Identifier`),`Identifier`,Y("`,' or `:'"),K(`<COMMA>`,Y(`Identifier`),`Identifier`,Y("`,' or `:'")),`<COLON>`,Y(`Expression`),`Expression`]),Expression:Z(`Expression`,[J(e=>{e.operatorStacks.push([])}),ny(),ry()],(e,t)=>{let n=Av(t);n.push({node:e.heirs[0],operator:hv});let r=Iv(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Z(`ExtendableExpr`,[G(W(X({expansion:[G(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),Rv,K(G(W(X({expansion:[`PostfixOp`],semantic:Cv}),`PostfixOp`,zv),W(X({expansion:[`<DOT>`],semantic:Cv}),`<DOT>`,J(Ev),X({semantic:Cv}),`Identifier`,J(e=>{let t=Av(e);t[t.length-1].operator!==void 0&&Pv(t,t.length),t[t.length-1]={node:Ov(`RecordComponent`,[t[t.length-1].node,kv(e,2),kv(e,1)]),operator:void 0}})),W(X({expansion:[`<LSB>`],semantic:Cv}),Y(`function argument`),`SBracketCases`,Lv(e=>e.kind===`FcnAppl`)))),q(G(W(X({expansion:[`InfixOp`],semantic:Cv}),`InfixOp`,zv,ny(),ry()),W(X({expansion:[`<COLONCOLON>`],semantic:Cv}),`<COLONCOLON>`,J(e=>{let t=Av(e);if(!Hv(t[t.length-1].node))return`\`::' at ${Dv(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,J(e=>{let t=Av(e),n=kv(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Mv(r,e.lastOperator)){let t=kv(e,3);return`Removing label at ${Dv(e,t.first,t.last)} would change expression parsing.`}t.push({node:Ov(`Label`,[kv(e,3),kv(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Z(`Primitive expression`,[G(W(X({expansion:[`String`],semantic:Cv}),`String`),W(X({expansion:[`<NUMBER_LITERAL>`],semantic:Cv}),`Number`),W(G(`Identifier`,W(G(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),J(e=>qv(e)<0&&e.proofLevels.length<=1?`${Dv(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Dv(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,W(X({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),q(X({amount:2}),`OpArgs`),K(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:Vv(e.heirs)===void 0?e.heirs.length===1?Ov(`GeneralId`,e.heirs):void 0:Ov(`OpApplication`,e.heirs)}),BangExt:Z(`Bang Extension`,[`<BANG>`,G(W(G(W(X({expansion:[`Identifier`],semantic:e=>xv(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),q(X({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Z(`StructOp`,[Y("`<<' , `>>' , `:' , `@' , or number"),G(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,W(X({semantic:e=>xv(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Dv(t,n.first,n.last)}`:void 0}),OpenStart:Z(void 0,[G(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},dy=/* @__PURE__ */ new Map,fy=e=>{let t=dy.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=fy(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,fy(uy[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return dy.set(e,n),n},py=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},my=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=bv(e,e.scanPosition)),e.scanPosition=bv(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},hy=(e,t)=>{if(t.type===`tokens`)return my(e,t.kinds);if(t.type===`call`)return hy(e,uy[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||py(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=hy(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||py(e,t.semantic)?hy(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=hy(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=hy(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},gy=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=hy(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},_y=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||fy(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!fy(a).hasSemanticStart?fy(a).first.has(xv(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):gy(e,i,a)&&(o===void 0||o(e))}),vy=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,hy(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=bv(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===rv){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=bv(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${tt(e.token.image)}" `},yy=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??vy(e)}\n\nResidual stack trace follows:\n${r}`,!1},by=(e,t)=>{let n=bv(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,yy(e))},xy=(e,t)=>{let n=uy[t];n.message!==void 0&&(e.messages.push({name:n.message,token:xv(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!Sy(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return yy(e,i);let a=r.node??(r.heirs.length===0?void 0:Ov(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},Sy=(e,t)=>{if(t.type===`tokens`)return by(e,t.kinds);if(t.type===`call`)return xy(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||yy(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||yy(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||Sy(e,t));if(t.type===`choice`){let n=_y(e,t.alternatives);return n===-1?yy(e):Sy(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!Sy(e,t.body))return!1;if(t.type===`optional`)return _y(e,[t.body])===-1||Sy(e,t.body);for(;_y(e,[t.body])===0;)if(!Sy(e,t.body))return!1;return!0},Cy=e=>{let t=$e(e),n={kind:rv,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],pushedErrors:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=Sy(r,{type:`call`,name:`CompilationUnit`});if(r.lexicalError!==void 0)return r.lexicalError;let a=[...r.pushedErrors,...i||r.report===void 0?[]:[`***Parse Error***\n${r.report}`]];return a.length===0?void 0:a.join(`
|
|
1783
|
+
`)},wy={low:15,high:15},Ty={low:16,high:16},Q=(e,t,n)=>({low:e,high:t,isAssociative:n}),Ey=new Map([[`=>`,Q(1,1,!1)],[`<=>`,Q(2,2,!1)],[`~>`,Q(2,2,!1)],[`-+->`,Q(2,2,!1)],[`/\\`,Q(3,3,!0)],[`\\/`,Q(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,Q(5,5,!1)]),[`\\cdot`,Q(5,14,!0)],[`@@`,Q(6,6,!0)],[`:>`,Q(7,7,!1)],[`<:`,Q(7,7,!1)],[`\\cup`,Q(8,8,!0)],[`\\cap`,Q(8,8,!0)],[`\\`,Q(8,8,!1)],[`..`,Q(9,9,!1)],[`...`,Q(9,9,!1)],[`##`,Q(9,13,!0)],[`$`,Q(9,13,!0)],[`$$`,Q(9,13,!0)],[`??`,Q(9,13,!0)],[`!!`,Q(9,13,!1)],[`\\sqcap`,Q(9,13,!0)],[`\\sqcup`,Q(9,13,!0)],[`\\uplus`,Q(9,13,!0)],[`\\wr`,Q(9,14,!1)],[`+`,Q(10,10,!0)],[`++`,Q(10,10,!0)],[`(+)`,Q(10,10,!0)],[`\\oplus`,Q(10,10,!0)],[`%`,Q(10,11,!1)],[`%%`,Q(10,11,!0)],[`|`,Q(10,11,!0)],[`||`,Q(10,11,!0)],[`\\X`,Q(10,13,!1)],[`-`,Q(11,11,!0)],[`--`,Q(11,11,!0)],[`(-)`,Q(11,11,!0)],[`\\ominus`,Q(11,11,!0)],[`*`,Q(13,13,!0)],[`**`,Q(13,13,!0)],[`/`,Q(13,13,!1)],[`//`,Q(13,13,!1)],[`\\div`,Q(13,13,!1)],[`\\o`,Q(13,13,!0)],[`(.)`,Q(13,13,!0)],[`\\odot`,Q(13,13,!0)],[`(/)`,Q(13,13,!1)],[`\\oslash`,Q(13,13,!1)],[`(\\X)`,Q(13,13,!0)],[`\\otimes`,Q(13,13,!0)],[`&`,Q(13,13,!0)],[`&&`,Q(13,13,!0)],[`\\star`,Q(13,13,!0)],[`\\bullet`,Q(13,13,!0)],[`\\bigcirc`,Q(13,13,!0)],[`^`,Q(14,14,!1)],[`^^`,Q(14,14,!1)]]),Dy=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Oy=/* @__PURE__ */ new Set([...Dy,`'`]),ky=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Ay=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),jy=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),My=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),Ny=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...Oy]),Py=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),Fy=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Iy=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Ly=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Ry=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),zy=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),By=/* @__PURE__ */ new Set([``,`*`,`-`]),Vy={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},Hy=(e,t)=>e.line-t.line||e.column-t.column,Uy=(e,t)=>({start:Hy(e.start,t.start)<=0?e.start:t.start,stop:Hy(e.stop,t.stop)>=0?e.stop:t.stop}),Wy=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),Gy=(e,t,n=`Proof.Parser`)=>new r(e,void 0,{reason:e,line:t.start.line,column:t.start.column,isEnd:!1,proof:{stop:t.stop,exception:n}}),Ky=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),qy=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),Jy=/* @__PURE__ */ new Set([`NEW`,...qy.keys()]),Yy=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Xy=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Zy=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Qy=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Ey.has(e.operator):Dy.has(e.operator)),$y=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,eb=e=>Ey.has(e)||Dy.has(e)||e===`-.`,tb=(e,t,n)=>{switch(e){case`ENABLED`:return{kind:`Enabled`,expression:t,location:n};case`UNCHANGED`:return{kind:`Unchanged`,expression:t,location:n};case`[]`:return{kind:`Always`,expression:t,location:n};case`<>`:return{kind:`Eventually`,expression:t,location:n};case`'`:return{kind:`Prime`,expression:t,location:n};default:return{kind:`Apply`,operator:e,args:[t],location:n}}},nb=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.replace(/\r?\n$/,``).split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
|
|
1784
|
+
`)}\n`},rb=(e,t,n=Ae(e,t===`tlapm`))=>{let i=t===`tlapm`,a=i?n:n.map(Te),o={index:0,offsideColumns:[]},s={},c=[],l=/* @__PURE__ */ new Set,u=[],d=[],f=e=>c[c.length-1].has(e),p=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),m=[],ee=[],te=[],g=(e,t=o.index-1)=>{let n=e===t?te[e]:void 0;if(n)return n;let r=a[t];m[e]??=p(a[e]),ee[t]??={line:r.line,column:r.endColumn};let i={module:d[0].name,start:m[e],end:ee[t]};return e===t&&(te[e]=i),i},_=(e,t)=>(e.location.range=g(t),e),ne=(e=0)=>a[Math.min(o.index+e,a.length-1)],v=(e=0)=>{let t=ne(e),n=o.offsideColumns[o.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},re=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),y={index:0},ie=e=>{let t=a.slice(y.index,o.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},b=e=>i&&(e.kind===`Keyword`||Zy.has(e.text)),oe=e=>{let t=a.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},se=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:zy.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:b(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,ce=(e,t=ne(),n)=>{let i=a[a.length-1],o=t.line===i.line&&t.column===i.column;return new r(`${e} at line ${t.line}, column ${t.column}`,void 0,le(e,t,o,n))},le=(e,t,n,r)=>{if(i&&n){let e=a[a.length-1];return{reason:`Unexpected EOF`,...ie(oe(e)),isEnd:n}}return i&&r?{reason:`Unexpected ${se(r)}`,...oe(r),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},ue=(e,t=ne())=>ce(e,t,t),de=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!b(e),x=(e,t=0)=>{let n=v(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},S=()=>{let e=v();if(e.kind===`End`)throw ce(`Unexpected end of expression`);return o.index++,e},C=e=>x(e)?(o.index++,!0):!1,w=e=>{if(!x(e))throw ue(`Expected ${JSON.stringify(e)} but found ${re(v())}`);return S()},fe=()=>{let e=v();if(e.kind!==`Identifier`)throw ue(`Expected an identifier but found ${re(e)}`);if(b(e))throw ue(`Unexpected keyword ${e.text}`);return o.index++,e.text},pe=()=>{let e=o.index;return{name:fe(),range:g(e)}},he=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),ge=()=>{let e=v();return e.kind!==`String`&&(Ay.has(e.text)||Ey.has(e.text)||Oy.has(e.text))?(o.index++,e.text):fe()},_e={isUsed:!1},ve=()=>v().kind===`Identifier`||!de(v())?fe():(_e.isUsed=!0,S().text),ye=e=>{if(!i)return e();o.offsideColumns.push(-1);let t=e();return o.offsideColumns.pop(),t},T=(e,t=`,`)=>{let n=[e()];for(;C(t);)n.push(e());return n},be=()=>{if(x(`<<`)){let e={value:1};for(;v(e.value).kind===`Identifier`||x(`,`,e.value);)e.value++;return x(`>>`,e.value)&&x(`\\in`,e.value+1)}let e={value:0};for(;v(e.value).kind===`Identifier`;){if(x(`\\in`,e.value+1))return!0;if(!x(`,`,e.value+1))return!1;e.value+=2}return!1},xe=()=>{if(x(`::`))return!0;if(!x(`(`))return!1;let e={value:1};for(;v(e.value).kind===`Identifier`&&x(`,`,e.value+1);)e.value+=2;return v(e.value).kind===`Identifier`&&x(`)`,e.value+1)&&x(`::`,e.value+2)},Se=()=>{if(!C(`<<`)){let e=pe();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=he(x(`>>`)?[]:T(pe));return w(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Ce=()=>T(()=>{let e=T(Se);w(`\\in`);let t=O();return e.map(e=>({pattern:e,set:t}))}).flat(),E=()=>{let e=v();if(i&&Zy.has(e.text)){let t=o.index;S();let n={kind:`Identifier`,name:e.text,location:p(e)};return{subscript:_(n,t),lastArgs:[]}}let t=i&&(e.kind===`Number`||e.kind===`String`||x(`@`));if(e.kind===`Identifier`){let t=o.index,n=[],r=[],a=e=>(r.push(g(o.index,o.index)),n.push(fe()),e&&x(`(`)?ke():[]),s=[a(!i)];for(;x(`!`)&&v(1).kind===`Identifier`;)S(),s.push(a(!0));let c=s.slice(0,-1),l=p(e);l.range={...g(t),end:r[r.length-1].end};let u=n.join(`!`);return{subscript:c.every(e=>e.length===0)?{kind:`Identifier`,name:u,location:l}:{kind:`Apply`,operator:u,args:c.flat(),argumentCounts:[...c.map(e=>e.length),0],argumentsRange:l.range,selectorRanges:r,location:l},lastArgs:s[s.length-1]}}if(x(`<<`)||x(`(`)||x(`{`)||x(`[`)||t){let e=o.index,t=ze();return{subscript:t.location.range?t:_(t,e),lastArgs:[]}}throw ue(`Expected a subscript but found ${re(e)}`)},we=e=>{let t=v(1),n=v(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&x(`==`,Oy.has(n.text)?3:4))},Ee=e=>{let t=v(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||x(`,`,1)||x(`)`,1)||t.kind===`Keyword`&&Fy.has(t.text)||we(e)},De=()=>{let e=v(),t=e.kind===`Operator`&&(Ey.has(e.text)||ky.has(e.text))&&Ee(e);if(i&&e.kind!==`String`&&(ky.has(e.text)||Ny.has(e.text)&&e.text!==`'`&&!Dy.has(e.text)||My.has(e.text)&&v(-1).text===`(`&&v(-1).line===e.line&&v(-1).endColumn+1===e.column&&v(1).text===`)`&&v(1).line===e.line&&v(1).column===e.endColumn+1)&&Ee(e))throw ce(`incomplete expression`,e);if(t&&!i&&e.text===`\\X`&&e.spelling!==`×`)throw ce(`\\X may not be used as an infix operator`,e);if(t)return o.index++,_({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:p(e)},o.index-1);if(e.kind!==`String`&&Ny.has(e.text)&&Ee(e)){o.index++;let t=p(e);if(Dy.has(e.text))return _({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return _({kind:`Lambda`,params:[n.name],body:tb(e.text,n,t),operator:e.text,location:p(e)},o.index-1)}if(x(`LAMBDA`)){let t=o.index;S();let n=he(T(pe));w(`:`);let r=O();return _({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:p(e)},t)}return O()},Oe={range:void 0},ke=()=>ye(()=>{let e=o.index;w(`(`);let t=T(De);return w(`)`),Oe.range=g(e),t}),je=()=>{let e=S();o.offsideColumns.push(e.column);let t=[O()];for(;$y(ne())&&ne().text===e.text&&ne().column===e.column;)o.index++,t.push(O());return o.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:p(e)}},Me=e=>ye(()=>{let t=p(e),n=v().kind===`Identifier`,r=x(`|->`,1)&&(n||de(v()));if(r||n&&x(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o.index,n=p(v()),i=e();return n.range=g(t),w(r?`|->`:`:`),{name:i,value:O(),location:n}},a=[i(()=>n?fe():S().text),...C(`,`)?T(()=>i(fe)):[]];return w(`]`),{kind:e,fields:a,location:t}}if(be()){let e=o.index,n=Ce();if(!i||x(`|->`)){w(`|->`);let e=O();return w(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}o.index=e}let a=O();if(C(`->`)){let e=O();return w(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(C(`EXCEPT`)){let e=T(()=>{w(`!`);let e=[];for(;x(`.`)||x(`[`);)if(C(`.`)){if(!de(v()))throw ue(`Expected a field name but found ${re(v())}`);if(!i&&x(`@`))throw ue(`@ used in !.@`);e.push({kind:`Field`,name:S().text})}else w(`[`),e.push({kind:`Index`,args:T(()=>O())}),w(`]`);return w(`=`),{path:e,value:O()}});return w(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!x(`]_`)){let e=[a];for(;C(`,`);)e.push(O());return w(`]`),{kind:`Bracket`,args:e,location:t}}return w(`]_`),{kind:`BoxAction`,action:a,subscript:E().subscript,location:t}}),Ne=()=>{let e=o.index,t=_(Ve(),e),n=p(S());return _({kind:`Apply`,operator:`\\in`,args:[t,O()],location:n},e)},D=e=>ye(()=>{let t=p(e);if(C(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(be()&&(v(1).text===`\\in`||x(`<<`))){let e=o.index,n=Se();w(`\\in`);let r=O();if(C(`:`)){let e=O();return w(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o.index=e}let n=v().kind===`Identifier`&&x(`\\in`,1)?Ne():O();if(C(`:`)){let e=Ce();return w(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;C(`,`);)r.push(O());return w(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Pe=e=>{let t=p(e),n=ye(()=>x(`>>`)||x(`>>_`)?[]:T(()=>O()));if(C(`>>_`)){if(n.length!==1)throw ce(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:E().subscript,location:t}}return w(`>>`),{kind:`Tuple`,elements:n,location:t}},Fe=e=>{let t=p(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&be()){let e=Ce();return w(`:`),{kind:n,bounds:e,body:O(),location:t}}let i=he(T(pe));return w(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:O(),isTemporal:r,location:t}},Ie=e=>{let t=[];do{let n=o.index;if(C(`OTHER`))return w(`->`),{kind:`Case`,arms:t,other:O(),otherRange:g(n),location:p(e)};let r=O();w(`->`),t.push({condition:r,body:O()})}while(C(`[]`));return{kind:`Case`,arms:t,other:void 0,location:p(e)}},Le=()=>{let e=v(1);return x(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Py.has(e.text)||e.kind===`Operator`&&(Ey.has(e.text)||Oy.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&Ay.has(e.text))},Re=()=>{let e=S();if(e.kind===`Number`)return{kind:`Operand`,operand:me(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return o.index--,{kind:`Bound`,args:ke()}}return{kind:`Name`,name:e.text,args:x(`(`)?ke():[]}},ze=e=>{let n=o.index,r=S(),a=p(r);if(i&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=T(fe);return w(`:`),{kind:`Lambda`,params:e,body:O(),location:a}}if(r.kind===`Number`){if(i&&/^\\[BOH]/.test(r.text))throw ce(`incomplete expression`,r);return{kind:`Number`,value:me(r.text),text:r.text,location:a}}if(r.kind===`Decimal`)return{kind:`Decimal`,text:r.text,location:a};if(r.kind===`String`)return{kind:`String`,value:r.text,location:a};let l=r.kind===`Step`&&it(r);if(!i&&l&&tt()<0&&et.length<=1)throw ce(`Step number used outside proof`,r);if(l&&r.text[1]===`+`)throw ce(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||l){let t=l?at(r)??r.text:r.text;if(xe()){let o=he(C(`(`)?T(pe):[]);o.names.length>0&&w(`)`),w(`::`);let c=g(n),l=O();if(!i&&e!==void 0&&s.last!==void 0&&Qy(l)&&e.high>=s.last.low)throw ce(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:t,params:o.names,paramRanges:o.ranges,head:c,body:l,location:a}}let c=x(`(`);if(t===`@`&&!c&&!Le())return{kind:`ExceptAt`,location:a};let u=c?ke():[],d=[c?Oe.range:void 0];if(!Le())return c?{kind:`Apply`,operator:t,args:u,argumentsRange:Oe.range,location:a}:{kind:`Identifier`,name:t,location:a};let f=[{kind:`Name`,name:t,args:u}],p=[g(n,n)];for(;Le();)S(),p.push(g(o.index,o.index)),Oe.range=void 0,f.push(Re()),d.push(Oe.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),ee=f.flatMap(e=>`args`in e?e.args:[]),te=f.map(e=>`args`in e?e.args.length:0),_=d.at(-1)??g(n);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:a}:ee.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:a}:{kind:`Apply`,operator:h,args:ee,...te.slice(0,-1).some(e=>e>0)&&{argumentCounts:te},argumentsRange:_,selectorRanges:p,argumentRanges:d,location:a}}if(r.kind===`Operator`&&eb(r.text)&&x(`(`)){let e=ke();return t===`tlc`&&r.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:a}:{kind:`Apply`,operator:r.text,spelling:r.spelling,args:e,location:a}}if(r.kind===`Operator`&&eb(r.text)&&!i)return{kind:`Identifier`,name:r.text,spelling:r.spelling,location:a};switch(r.text){case`(`:{let e=ye(()=>O());return w(`)`),e}case`[`:return Me(r);case`{`:return D(r);case`<<`:return Pe(r);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Fe(r);case`IF`:{let e=O();w(`THEN`);let t=O();return w(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:O(),location:a}}case`CASE`:return Ie(r);case`LET`:{let e=[],t=[];for(c.push(/* @__PURE__ */ new Set);!C(`IN`);){if(i&&x(`RECURSIVE`))throw ce(`Unexpected keyword RECURSIVE`,ie(ne()));if(C(`RECURSIVE`)){Ze();continue}let n=We(!i&&C(`LOCAL`));n.kind===`Instance`?t.push(n):e.push(n)}c.pop();let n=O();return t.length===0?{kind:`Let`,definitions:e,body:n,location:a}:{kind:`Let`,definitions:e,instances:t,body:n,location:a}}case`CHOOSE`:{let e=Se(),t=C(`\\in`)?O():void 0;return w(`:`),{kind:`Choose`,pattern:e,set:t,body:O(),location:a}}case`WF_`:case`SF_`:{let e=E(),t=!x(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:ye(()=>{w(`(`);let e=O();return w(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:a}}}throw ue(`Unexpected ${re(r)}`,r)},Be=(e,t,n)=>{s.last=s.preceding={low:t,high:n};let r=O(i?Math.min(n+1,wy.low):n+1),a=v(),o=Oy.has(a.text)?wy.high:Ey.get(a.text)?.high;if(!i&&a.kind===`Operator`&&o!==void 0&&o>=t)throw ce(`Precedence conflict between ${e.text} and ${a.text}`,a);return r},Ve=()=>{let e=s.preceding;s.preceding=void 0;let t=v(),n=p(t);if(t.kind===`Operator`&&$y(t))return je();if(i&&Ey.has(t.text)&&x(`(`,1)){let e=o.index,r=ye(()=>{S(),S();let r=O();if(!C(`,`))return;let i=O();w(`)`);let a={kind:`Apply`,operator:t.text,args:[r,i],location:n};return _(a,e)});if(r!==void 0)return r;o.index=e}if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return S(),{kind:`Apply`,operator:`~`,args:[Be(t,4,4)],location:n};case`-`:case`-.`:if(t.text===`-.`&&!i)break;return S(),{kind:`Apply`,operator:`-.`,args:[Be(t,12,12)],location:n};case`[]`:return S(),{kind:`Always`,expression:Be(t,4,15),location:n};case`<>`:return S(),{kind:`Eventually`,expression:Be(t,4,15),location:n};case`ENABLED`:return S(),{kind:`Enabled`,expression:Be(t,4,15),location:n};case`UNCHANGED`:return S(),{kind:`Unchanged`,expression:Be(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return S(),{kind:`Apply`,operator:t.text,args:[i?O(9):Be(t,10,13)],location:n}}return ze(e)},O=(e=0)=>{let t=o.index,n=Ve(),r={left:n.location.range?n:_(n,t),previous:void 0};for(;;){let n=v();if(n.kind!==`Operator`)break;let a=p(n);if(n.text===`'`&&e<=15){S(),s.last=wy,r.left=_({kind:`Prime`,expression:r.left,location:a},t);continue}if(Dy.has(n.text)&&e<=15){S(),s.last=wy,r.left=_({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:a},t);continue}if(n.text===`[`){S();let e=ye(()=>T(()=>O()));ye(()=>w(`]`)),s.last=Ty,r.left=_({kind:`FunctionApplication`,function:r.left,args:e,location:a},t);continue}if(n.text===`.`&&de(v(1))){S();let e=S().text;r.left=_({kind:`FieldAccess`,record:r.left,field:e,location:a},t);continue}let o=Ey.get(n.text);if(!o||o.low<e)break;let c=r.previous;if(c){let e=!(c.low>o.high||c.high<o.low),t=c.text===n.text&&o.isAssociative;if(e&&!t&&(c.text!==`\\X`||n.text!==`\\X`))throw ce(`Precedence conflict between ${c.text} and ${n.text}`,n)}if(S(),!i&&o.low>12&&x(`-`))throw ce(`Precedence conflict between ${n.text} and -`,v());s.last=s.preceding=o;let l=O(o.high+1),u=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,i=[g(t).end];r.left=u.kind===e&&c?.text===n.text?{...u,operands:[...u.operands,l],prefixEnds:[...u.prefixEnds??[],...i]}:{kind:e,operands:[u,l],prefixEnds:i,location:a}}else r.left=n.text===`\\X`?u.kind===`Product`&&c?.text===`\\X`?{...u,factors:[...u.factors,l]}:{kind:`Product`,factors:[u,l],location:a}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[u,l],location:a};r.left=_(r.left,t),r.previous={...o,text:n.text}}return r.left},He=()=>{if(!C(`(`))return[];let e=Xe();return w(`)`),e},Ue=()=>{let e=p(v()),t=O(),n=a[o.index-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:d[0].name,start:e,end:r}}},We=e=>{let t=o.index;return _(Ke(e),t)},Ge=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),Ke=e=>{let t=v(),n=o.index,r=p(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:g(n,o.index-2),...Ue(),isLocal:e,isRecursive:f(t),location:r});if(t.kind===`Identifier`&&v(1).kind===`Operator`&&Ey.has(v(1).text)&&v(2).kind===`Identifier`&&x(`==`,3)){let e=pe(),t=S().text,n=pe();return w(`==`),i(t,[Ge(e),Ge(n)])}let a=t.kind!==`String`&&Ay.has(t.text),s=t.kind===`Identifier`&&Oy.has(v(1).text)&&x(`==`,2);if(a||s){let e=a?t.text:v(1).text;a&&S();let n=pe();return s&&S(),w(`==`),i(e,[Ge(n)])}let c=fe();if(C(`[`)){let t=ye(()=>Ce());return w(`]`),w(`==`),{kind:`Function`,name:c,bounds:t,body:O(),isLocal:e,isRecursive:f(c),location:r}}let l=o.index,u=He();return w(`==`),x(`INSTANCE`)?{...qe(c,u,e,r),definitionRange:g(l)}:i(c,u)},qe=(e,t,n,r)=>{let i=o.index;return w(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ve(),substitutions:C(`WITH`)?T(()=>{let e=o.index,t=ge(),n=g(e);return w(`<-`),{name:t,nameRange:n,expression:De()}}):[],isLocal:n,location:r,instanceRange:g(i)}},Je=()=>{let e=o.index;return _(Ye(),e)},Ye=()=>{let e=p(v());if(x(`_`)&&v(1).kind===`Operator`)return S(),{name:S().text,arity:C(`_`)?2:1,location:e};if(v().kind!==`String`&&(Ay.has(v().text)||i&&v().kind===`Operator`)&&x(`_`,1)){let t=S().text;return S(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=fe();if(!C(`(`))return{name:t,arity:0,location:e};let n=T(()=>w(`_`));return w(`)`),{name:t,arity:n.length,location:e}},Xe=()=>T(Je),Ze=()=>{let e=Xe();return e.forEach(e=>c[c.length-1].add(e.name)),e},Qe=e=>{let t={value:0,offset:e};do{let e=v(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&Yy.has(e.text)&&t.value++,e.kind===`Operator`&&Xy.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},$e=()=>{let e=v(),t=v(1);return e.kind===`Identifier`?x(`(`,1)||x(`[`,1)?x(`==`,Qe(1)):t.kind===`Operator`&&Oy.has(t.text)?x(`==`,2):t.kind===`Operator`&&Ey.has(t.text)?v(2).kind===`Identifier`&&x(`==`,3):x(`==`,1):e.kind!==`String`&&Ay.has(e.text)&&t.kind===`Identifier`&&x(`==`,2)},et=[],tt=()=>et[et.length-1]??-1,nt=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),rt=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},it=e=>!e.text.endsWith(`.`)&&!By.has(rt(e)),at=e=>{let t=rt(e);if(By.has(t))return;let n=nt(e);if(n>=0)return`<${n}>${t}`;let r=tt(),i=et[et.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},ot=e=>{if(e.kind===`Keyword`)return Ly.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return et.length===0;if(e.text[1]===`+`||et.length===0)return!0;let t=tt();return t>=0&&nt(e)>t},st=e=>{let t=nt(e),n=et.length-1,r=et[n-1]??-1,i=et[n]<0;return i&&(et[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:et[n]===t},ct=e=>!l.has(e)&&d.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),lt=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Zy.has(e.name)&&!ct(e.name):!1,ut=()=>{let e=v();return e.kind===`Step`?it(e):e.kind===`Keyword`?Ky.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!$e()},dt=()=>{let e=o.index,t=v();return t.kind===`Operator`&&!jy.has(t.text)&&eb(t.text)?(o.index++,_({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:p(t)},e)):C(`MODULE`)?_({kind:`ModuleFact`,name:fe(),location:p(t)},e):O()},ft=e=>u[u.length-1]?.add(e),pt=e=>{u.push(/* @__PURE__ */ new Set);let t=e();return u.pop(),t},mt=e=>u.some(t=>t.has(e))||d.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),ht=()=>{let e=o.index,t=v(),n=T(()=>{let e=v();if((e.kind!==`Identifier`||b(e))&&e.kind!==`Operator`)throw ue(`Expected a definition name but found ${re(e)}`,e);return o.index++,e.text},`!`),r=p(t);return _(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},gt=()=>{if(i)return T(ht);let e=T(dt),n=t===`tlc`?e.find(e=>e.kind===`Identifier`&&mt(e.name)):void 0;if(n)throw ce(`DEF clause entry should describe a defined operator`,n.location);return e},k=()=>{let e=ut()?T(dt):[],t=C(`DEF`)||C(`DEFS`);if(i&&e.length===0&&!t)throw ue(`Expected a fact`);return{facts:e,defs:t?gt():[]}},_t=()=>{let e=o.index,n=S(),r=n.text===`USE`&&C(`ONLY`),i=g(e),a={kind:n.text===`USE`?`Use`:`Hide`,isOnly:r,...k(),keyword:i,location:p(n)},s=a.kind===`Hide`&&t===`tlc`?a.facts.filter(e=>!lt(e)):[];if(s.length>0)throw ae(s.map(t=>({location:h(t.location.range??g(e)),message:`The only expression allowed as a fact in a HIDE is
|
|
1785
|
+
the name of a theorem, assumption, or step.`})));return _(a,e)},vt=()=>{let e=o.index,t=p(v()),n=C(`NEW`),r=i?o.index:e,a=i?p(v()):t,s=v().kind===`Keyword`?qy.get(v().text):void 0;if(!n&&s===void 0)throw ue(`Expected a declaration but found ${re(v())}`);if(s!==void 0&&S(),s===`Variable`){let e=pe();return ft(e.name),_({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:a},r)}let c=Je();ft(c.name);let l=(s??`Constant`)===`Constant`&&x(`\\in`);if(l&&c.arity>0)throw ce(`declared symbol with arguments before \\in`);return l&&S(),_({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?O():void 0,nameRange:c.location.range,location:a},r)},yt=()=>{let e=o.index,t=p(w(`ASSUME`)),n=T(()=>(v().kind===`Identifier`&&x(`::`,1)&&x(`ASSUME`,2)&&(S(),S()),x(`ASSUME`)?pt(yt):v().kind===`Keyword`&&Jy.has(v().text)?vt():O()));return w(`PROVE`),_({kind:`AssumeProve`,assumptions:n,conclusion:O(),location:t},e)},bt=e=>{let t={value:0};for(;v(t.value).kind===`Identifier`&&x(`,`,t.value+1);)t.value+=2;return v(t.value).kind===`Identifier`&&x(e,t.value+1)},xt=(e,t)=>{e.forEach(ft),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(ft))},A=()=>{let e=v();if(x(`USE`)||x(`HIDE`))return _t();if(x(`INSTANCE`)){let t=o.index;return _(qe(void 0,[],!1,p(e)),t)}if(x(`DEFINE`)||$e()){let t=o.index;C(`DEFINE`);let n=[We(!1)];for(;$e();)n.push(We(!1));let r={kind:`Define`,definitions:n,location:p(e)};return _(r,t)}if(C(`HAVE`))return{kind:`Have`,expression:O()};if(C(`TAKE`)){let e=be(),t=he(e?[]:T(pe)),n=e?Ce():[];return xt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(C(`WITNESS`))return{kind:`Witness`,expressions:T(()=>O())};if(C(`PICK`)){let e=bt(`:`),t=he(e?T(pe):[]),n=e?[]:Ce();return xt(t.names,n),w(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:O()}}return C(`CASE`)?{kind:`Case`,expression:O()}:{kind:`Assert`,isSuffices:C(`SUFFICES`),statement:x(`ASSUME`)?yt():O()}},St=e=>{let n=v();if(n.kind!==`Step`)throw ue(`Expected a step number but found ${re(n)}`,n);if(!st(n))throw ce(`${e?`QED step`:`step`}'s number has bad level`,n);if(t!==`sany`&&nt(n)<0&&at(n)!==void 0)throw ce(`<*> and <+> cannot be used for a named step`,n);return o.index++,{name:at(n),token:n.text,location:p(n)}},Ct=()=>{let e=o.index,t=St(x(`QED`,1)),n=o.index,r=/* @__PURE__ */ new Set;u.push(r);let i=C(`QED`)?{kind:`Qed`}:A(),a=g(e),s=g(n),c=ot(v());if(c&&!Ry.has(i.kind))throw ce(`Proof of a step that does not take a proof`);let l=c?Et():void 0;return u.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(ft),_({...t,body:i,head:a,statement:s,proof:l},e)},wt=e=>{if(C(`BY`)){let t=g(o.index-1);return{kind:`By`,isOnly:C(`ONLY`),...k(),keyword:t,location:e}}let t=v();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;S();let n=g(o.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Tt=()=>{let e=p(v());C(`PROOF`);let t=wt(e);if(t)return t;let n=[Ct()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(Ct());return{kind:`Steps`,level:tt(),steps:n,location:e}},Et=()=>{let e=o.index;et.push(-1);let t=pt(Tt);return et.pop(),_(t,e)},Dt=()=>v().kind===`Step`||v().kind===`Keyword`&&Ly.has(v().text),Ot=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return Wy(e);let n=t.defs[t.defs.length-1]?.location.range;return Uy(Wy({...e,end:e.start}),Wy(n??t.keyword))},kt=()=>{let e=o.index,t=p(v()),n=C(`PROOF`),r=wt(t);if(r){let t=_(r,e);return{kind:`Leaf`,proof:t,span:Wy(t.keyword),first:e,end:o.index-1}}let i=v();if(i.kind!==`Step`)throw ue(`Expected a step number but found ${re(i)}`);let a=o.index;S();let s=o.index,c=C(`QED`)?{kind:`Qed`}:A(),l=g(a);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:g(s),span:Ot(l,c),first:e,start:a,end:o.index-1}},At=(e,t,n,r)=>{let i=e[t];if(!i)return{proof:void 0,span:r,next:t,end:void 0};if(i.kind===`Leaf`)return{proof:i.proof,span:i.span,next:t+1,end:i.end};let o=jt(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={...p(a[i.first]),range:g(i.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},jt=(e,t,n,r,i)=>{let a=e[t];if(!a)throw Gy(`Unexpected end of (sub)proof at level ${n} before QED step`,r);if(a.kind===`Leaf`)throw Gy(`Expecting a proof step but found a${Vy[a.proof.kind]} leaf proof`,a.span);if(!i&&a.isProof)throw Gy(`PROOF keyword found in step that does not begin subproof`,a.span);let o=a.token.text[1];if(o===`+`&&!i)throw Gy(`<+> used but no subproof expected`,a.span);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:nt(a.token);if(s<n||!i&&s>n)return;let c=Ry.has(a.body.kind)?At(e,t+1,s+1,a.span):{proof:void 0,span:a.span,next:t+1,end:void 0},l=c.end??a.end,u={name:at(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{...p(a.token),range:g(a.start,l)}},d=Uy(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=jt(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:Uy(d,f.span)}},Mt=()=>{if(!Dt())return;let e=[];for(;Dt();)e.push(kt());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=At(e,0,0,t.span),r=e[n.next];if(r)throw Gy(`extra step(s) after finished proof`,r.span,`Proof.Parser.toplevel`);return n.proof},Nt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},Pt=e=>{let t=o.index,n=S(),r=v().kind===`Identifier`&&x(`==`,1)?fe():void 0;r!==void 0&&(l.add(r),S());let a=pt(()=>{let e=x(`ASSUME`)?yt():O();return i?{statement:e,proof:Mt()}:{statement:e,proof:ot(v())?Et():void 0}}),s=a.statement,c=_({name:r,statement:s,proof:a.proof,location:p(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&s.kind!==`AssumeProve`&&Nt(e,_({kind:`Operator`,name:r,params:[],body:s,isLocal:!1,isRecursive:!1,location:p(n)},t))},Ft=()=>{let e=o.index,t=S(),n=v().kind===`Identifier`&&x(`==`,1)?fe():void 0;return n!==void 0&&(l.add(n),S()),_({name:n,expression:O(),isAxiom:t.text===`AXIOM`,location:p(t)},e)},It=()=>{let e=p(w(`----`));w(`MODULE`);let t=ve();w(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(d.push(n),c.push(/* @__PURE__ */ new Set),C(`EXTENDS`)&&T(()=>{let e=o.index;n.extends.push(ve()),n.extendsRanges.push(g(e))});;){let t=o.index;y.index=t;let r=v();if(r.kind===`ModuleEnd`)return e.range={module:d[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},d.pop(),c.pop(),n;if(r.kind===`Separator`){if(x(`MODULE`,1)){let e=It();n.modules.push(e),n.units.push({kind:`Module`,module:e}),w(`====`);continue}S()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=p(S()),r=Xe();n.constants.push(...r),e.range=g(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=p(S()),r=T(()=>{let e=o.index,t=p(v());return _({name:fe(),arity:0,location:t},e)});n.variables.push(...r),e.range=g(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Ft();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&Nt(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(x(`USE`)&&x(`ONLY`,1))throw ue(`Expected a module unit but found ${re(r)}`);let e=_t();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=p(S()),r=Ze();e.range=g(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:Lt(n,_(qe(void 0,[],!1,p(r)),t));continue;case`LOCAL`:if(S(),x(`INSTANCE`)){Lt(n,_(qe(void 0,[],!0,p(r)),t));continue}Lt(n,_(Ke(!0),t));continue}r.kind===`Keyword`&&Iy.has(r.text)?Pt(n):Lt(n,We(!1))}}},Lt=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},Rt=It(),zt=_e.isUsed?Cy(e):void 0;if(zt!==void 0)throw new r(zt);return Rt},ib=e=>rb(e,`tlc`),ab=(e,t)=>rb(e,`tlc`,t),ob=e=>rb(e,`tlapm`),sb=e=>rb(e,`sany`),cb=`$subexpression`,lb=(e,t)=>new r(`${e} at line ${t.line}, column ${t.column}`),ub=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return ub(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of gt(e)){let e=ub(r,t,n);if(e)return e}},db=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),fb=(e,t)=>{let n=e.location,r=db(t,e.lets,n);if(e.params.length===0)return r;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw lb(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:r,location:n}}if(e.args.length!==e.params.length)throw lb(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:cb,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:cb,args:e.args,location:n,resolution:Ys},location:n}},pb=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:Ys})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Ys}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Ys};return fb({...t,params:[...t.params,...r]},a)},mb=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o={index:0,current:void 0,isFailed:!1},s=(t,r)=>{if(!t)throw lb(r,i);Zs.set(n,{args:e.slice(0,o.index).flatMap(e=>`args`in e?e.args:[]),error:{location:h(t),message:r}}),o.isFailed=!0},c=n=>{let r=[],a=[];for(;o.index<e.length;){let s=e[o.index];if(s.kind!==`Name`)throw lb(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>yl(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o.index++}throw lb(`Unknown operator ${r.join(`!`)}`,i)},l=t=>{let l=c(t),u=l.definition,d=nc(u),f=o.index===e.length-1;if(l.args.length!==d&&(!r||l.args.length!==0))return s(n.argumentRanges?.[o.index]??i.range,`The operator ${l.name} requires ${d-l.earlier} arguments.`);if(f)return{definition:u,args:l.args};if(u.kind!==`Operator`)throw lb(`Cannot select a subexpression of ${u.name}`,i);a.params.push(...u.params),a.args.push(...l.args),o.current=u.body,o.index++},u=()=>{for(;o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o.index],c=o.current&&ub(o.current,t.name,[]);if(!c)return s(i,`Cannot find label \`${t.name}'.`);let l=c.label.params;if(!r&&t.args.length!==l.length)return s(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...l.map(e=>({name:e,arity:0}))),a.args.push(...t.args),o.current=c.label.body,o.index++}},d=t=>{let n=o.current;if(!n)throw lb(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(n.kind===`Label`){o.current=n.body,d(t);return}if(n.kind===`Let`){if(t.kind!==`Operand`||Cc(t.operand,1)!==0)throw lb(`A LET/IN expression has only one operand`,i);a.lets.push(n.definitions),o.current=n.body;return}let r=Dc(n);if(r&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...r.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),o.current=r.body;return}if(n.kind===`Case`&&t.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],a=r[Cc(t.operand,r.length)],s=e[o.index+1];if(!a||s?.kind!==`Operand`)throw lb(`A subexpression of CASE must have the form !i!j`,i);o.index++;let c=Cc(s.operand,2),l=c===0?a.condition:c===1?a.body:void 0;if(!l)throw lb(`Nonexistent CASE operand`,i);o.current=l;return}if(t.kind!==`Operand`)throw lb(`Unexpected subexpression selector`,i);let s=r?r.sets:Oc(n),c=s?.[Cc(t.operand,s.length)];if(!c)throw lb(`Nonexistent operand specified by the selector`,i);o.current=c},f=l(void 0);if(o.isFailed)return n;if(f)return pb(f.definition,{...a,args:f.args});for(u();o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind===`Name`){for(;o.current?.kind===`Label`;)o.current=o.current.body;if(o.current?.kind!==`Let`)throw lb(`A name selector here must be from a LET clause`,i);a.lets.push(o.current.definitions);let e=l(o.current.definitions);if(o.isFailed)return n;if(e)return pb(e.definition,{...a,args:[...a.args,...e.args]});u()}else d(t),o.index++}if(o.isFailed)return n;if(!o.current)throw lb(`Subexpression selection failed`,i);return fb(a,o.current)},hb=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return wc(e,t,n)},gb=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||gt(e).some(gb),_b=(e,t,n,r=!1)=>{if(!gb(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Sl(e,e=>_b(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>vb(e,r,n))}:i}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>_b(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Sl(e,e=>_b(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?hb(a.name,[],void 0,t):a.kind===`Apply`?hb(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=mb(o,t,a,r);return c!==a&&Xs.add(c),c},vb=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:_b(e.expression,t,n,!0)}))}),yb=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},bb=(e,t)=>vb(e,yb(t.definitions),()=>!1),xb=(e,t)=>{let n=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),r=e.theorems.flatMap(e=>{let t=e.statement;if(e.name===void 0||t.kind!==`AssumeProve`)return[];let n=t.assumptions.filter(e=>e.kind!==`NewSymbol`&&e.kind!==`AssumeProve`);return n.length===t.assumptions.length?[{kind:`Operator`,name:e.name,params:[],body:{kind:`Tuple`,elements:[...n,t.conclusion],location:t.location},isLocal:!0,isRecursive:!1,location:e.location}]:[]}),i=yb([...t,...e.definitions]),a=e=>n.has(e),o=yb([...t,...e.definitions,...r]),s=e=>_b(e,o,e=>a(e)&&r.every(t=>t.name!==e)),c=e=>a(e)||!i(e),l=e=>_b(e,i,c),u=e=>e.map(e=>e.kind===`ModuleFact`?e:l(e)),d=e=>e.map(e=>({...e,set:l(e.set)})),f=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&l(e.set)}:f(e)),conclusion:l(e.conclusion)}:l(e),p=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:u(e.facts)};case`Instance`:return vb(e,i,c);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?vb(e,i,c):xl(e,l))};case`Have`:case`Case`:return{...e,expression:l(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(l)};case`Take`:return{...e,bounds:d(e.bounds)};case`Pick`:return{...e,bounds:d(e.bounds),body:l(e.body)};case`Assert`:return{...e,statement:f(e.statement)};default:return e}},m=e=>e?.kind===`By`?{...e,facts:u(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:p(e.body),proof:m(e.proof)}))}:e,h={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:f(e.statement),proof:m(e.proof)})),uses:e.uses.map(e=>({...e,facts:u(e.facts)}))};return e.definitions.some(e=>gb(e.body))||e.assumptions.some(e=>gb(e.expression))?{...h,definitions:e.definitions.map(e=>xl(e,s)),assumptions:e.assumptions.map(e=>({...e,expression:s(e.expression)}))}:h},Sb=(e,t)=>e.maxLevels[t]??3,Cb=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=Ou({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,i=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>au(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>au(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>ou(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=nu(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&au(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(ku(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,a=h(t.location.range??{module:t.instancer,start:t.location,end:t.location}),o=e=>r.set(`${a}\n${e}`,{location:a,message:e}),s=e(t.module),c=i(t.module),l=n(t.instancer),u=/* @__PURE__ */ new Map;t.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=l.analyze(n,u);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),f=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(d.forEach(e=>{!c.isConstant&&e.level>e.maximumLevel&&o(f(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),d.forEach(e=>{let n=c.constraints.get(e.name);n!==void 0&&e.level>n&&o(f(e.name,n));let r=e.operator;r&&Array.from({length:e.arity},(n,i)=>{let a=c.argConstraints.get(eu(e.name,i));a!==void 0&&Sb(r,i)<a&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),c.argParams.forEach(e=>{let n=nu(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=Sb(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw ae([...r.values()])}},wb=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],Tb=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Eb=new Map(Xf.flatMap(e=>e.map(t=>[t,e[0]]))),Db=e=>Eb.get(e)??e,Ob=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},kb=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},Ab=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:Ob(e)&2147483647,kind:t,isLocal:n}),jb=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:Db(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:Db(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},Mb=(e,t)=>{let n=[];for(let r=t;;){let t=jb(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},Nb=e=>({line:e.line,column:e.column}),Pb=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text===`.`)continue;else if(a.text===`EXTENDS`){let n=Mb(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}return{references:s,end:e.length}};return i(0,t??``).references},Fb=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,Ib={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},Lb=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&Fb(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&Fb(e[n+1],e[n+2])?n+=Fb(e[n+2],e[n+3])?3:2:(r.text!==`MODULE`||e[n-1]?.kind!==`Separator`)&&t.push(r.kind===`String`?`"${r.text.replace(/[\\"\n\t\r\f]/g,e=>Ib[e])}"`:r.text)}return t},Rb=e=>e[2]?.text,zb=e=>{let t=/* @__PURE__ */ new Map,n=[];return e.forEach((r,i)=>{r.kind===`Separator`&&e[i+1]?.text===`MODULE`&&n.push({name:e[i+2].text,start:i});let a=r.kind===`ModuleEnd`?n.pop():void 0;a&&!t.has(a.name)&&t.set(a.name,{start:a.start,end:i+1})}),t},Bb=(e,t)=>e.find(e=>e.name===t)??e.map(e=>Bb(e.modules,t)).find(Boolean),Vb=e=>{let t=e===void 0?[]:Ae(e),n={module:void 0};return{tokens:t,ranges:zb(t),getModule:()=>n.module??=e===void 0?ib(``):ab(e,t)}},Hb=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=Vb(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:t?.(i)??ep.get(i)??rp.get(i)??nb(e,i),{tokens:c,ranges:l,getModule:u}=a(s),d=l.get(Rb(c)??``)??{start:0,end:0},f={tokens:c,...d,getModule:u};return n.set(i??``,f),l.forEach((e,t)=>{e.start===d.start||r.has(t)||r.set(t,{tokens:c,...e,getModule:()=>Bb(f.getModule().modules,t)??f.getModule()})}),f};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},Ub=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=Mb(t,e+1);i.push({location:Nb(t[e]),apply:e=>r.forEach(t=>e.put(Ab(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c=new Set(n.units.flatMap(e=>e.kind===`Constants`||e.kind===`Variables`?[`${e.location.line}:${e.location.column}`]:[])),l={value:0};t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r,d=t[u];if(d.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l.value++,l.value===2){let e=t[u+2].text;i.push({location:Nb(d),apply:t=>t.put(Ab(e,`module`,!1))})}return}if(d.kind===`ModuleEnd`&&l.value--,l.value!==1||d.kind!==`Keyword`)return;let f=c.has(`${d.line}:${d.column}`);f&&(d.text===`CONSTANT`||d.text===`CONSTANTS`)&&o(u,`constant`),f&&(d.text===`VARIABLE`||d.text===`VARIABLES`)&&o(u,`variable`),d.text===`RECURSIVE`&&Mb(t,u+1).every(e=>s.has(e))&&o(u,`definition`),Tb.has(d.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(Nb(d)),i.push({location:Nb(d),apply:e=>e.put(Ab(t[u+1].text,`theorem`,!1))}))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(Ab(t,`theorem`,!1))})});let u=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(u(e.location))return;let t=Db(e.name);i.push({location:e.location,apply:n=>n.put(Ab(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(Ab(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(Ab(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>tc(e.location,t.location)?-1:+!!tc(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=kb();n.set(i??``,o),Yf.toReversed().forEach(e=>o.put(Ab(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},Wb=(e,t)=>{let n=/* @__PURE__ */ new Set,r=e=>{n.add(e)},i=e=>{e.kind===`ModelValue`&&r(e.name),e.kind===`String`&&r(e.value),e.kind===`Set`&&e.elements.forEach(i)};t.constants.forEach(e=>{e.args?.forEach(i),i(e.value)}),Zf.forEach(r);let a=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=Pb(a(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),ee=m(e=>e.instances),te=/* @__PURE__ */ new Set([void 0]),g=/* @__PURE__ */ new Map;Lb(a(void 0)).forEach((e,t)=>{t===3&&$f.forEach(r),r(e)});let _=l(void 0);for(;;){let t=h(_,/* @__PURE__ */ new Set)??ee(_,/* @__PURE__ */ new Set);if(!t)break;let[n,i]=t;if(d.add(`${n.key}>${i}`),g.set(n.unit,[...g.get(n.unit)??[],i]),!te.has(i)){if(te.add(i),e(i).tokens.length===0){let t=n.unit??Rb(e(void 0).tokens);throw o(i,t)}Lb(a(i)).forEach(r)}}wb.forEach(r);let ne=/* @__PURE__ */ new Set,v=e=>{if(ne.has(e))return;ne.add(e);let t=g.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(v),a(e).forEach(e=>{e.kind===`String`&&r(e.text)})};return v(void 0),Qf.forEach(r),[...n]},Gb=(e,t)=>{let n=Hb(e,t),r=n.getParsed,i,a=()=>i??=Ub(r);return{getStringOrder:e=>Wb(r,e),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let{getContext:e,getOwnEntries:t}=a();return e(void 0),e=>t(e).filter(e=>e.kind===`definition`).map(e=>e.name)}}},Kb=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),qb=e=>{switch(e.kind){case`Number`:if(!pn(e.value))throw y(new c(`TLC can't handle a number this big.\n${e.value}`),b.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return Zn(e.name);case`Set`:return N({kind:`MixedSet`,elements:e.elements.map(qb)})}},Jb=e=>{try{return qb(e)}catch(e){throw!(e instanceof _)||e instanceof c||e instanceof ce?e:y(new _(`${i}${e.message}`),b.error)}},Yb=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],Xb=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof r))throw n;let i=Cy(e);throw i===void 0?n:ae([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,i)}},Zb=e=>new r(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),Qb=(e,t)=>e.location.range&&t.location.range&&{location:h(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${h(t.location.range)}.`},$b=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,ex=e=>e===`Theorem`?`ThmOrAssumpDefNode`:$b(e),tx=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:zl(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),nx=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>I(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new _(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&fr(t,r)})});if(t)return t[1];throw new _(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:I(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},rx=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||gt(e).some(e=>rx(e,t)),ix=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Pl(e),n.get(e)??n.size)),n},ax=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),ox=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Gh(e);if(e.kind===`Number`&&!pn(e.value))throw Kh(e);ox(e.kind===`Let`?[...gt(e),...ax(e.instances??[])]:gt(e))}),sx=(e,t)=>{let n=t.order??Gb(t.source,t.loadModule),i=n.parseModule(t.source),a=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Set,d=new Map(mp.map(e=>[e.name,e])),f=/* @__PURE__ */ new Map,p=Sf(e.checkDeadlock,t.seed);p.isWarningEnabled=t.isWarningEnabled??!0,p.isTool=t.isTool??!1,p.version=t.version??`master`;let m=/* @__PURE__ */ new Map,ee=/* @__PURE__ */ new Map,ne=[],v=/* @__PURE__ */ new Map,re=[],y=[],ie=(e,t)=>re.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),b=0,oe=e=>`${e}#${b++}`,se=[],ce=[],le=Cb(e=>{let t=ee.get(e)??me(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>a.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>a.get(t.visible.get(e)?.key??e)}}),ue=/* @__PURE__ */ new Map,de=/* @__PURE__ */ new Map,x=/* @__PURE__ */ new Map,S=e=>{let n=f.get(e);if(n)return n;let r=Fp(e,t.print,p,t.files,d);if(!r)return;Pp.get(e)?.forEach(S);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>S(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{d.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Zl.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:$l(e,t.name)??i.get(t.name)?.range})}),f.set(e,i),i},C=e=>{let n=Pp.get(e)??[];if(e===`TLCExt`||[e,...n].some(e=>t.loadModule?.(e)!==void 0))return;let r=S(e);return r&&ie(e,n),r&&n.includes(`Integers`)&&S(`Integers`),r},w=e=>(ox([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...ax(e.instances)]),e.modules.forEach(w),e);w(i);let fe=(e,r)=>{let i=t.loadModule?.(e)??ap(p.version).get(e)??nb(t.source,e);if(i===void 0)throw o(e,r);let a=Xb(i,e,n);if(a.name!==e)throw ae([{location:`Unknown location`,message:`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return w(a)},pe=e=>{let t=y.indexOf(e.name);if(t!==-1){let n=[...y.slice(t),e.name].map(e=>`${e}.tla`);throw new r(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,i=[],a=[],o=[];y.push(e.name),re.push(n);let s=Ce(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:ce,levelChecks:o});if(re.pop(),y.pop(),a.length>0)throw ae(a,!1,void 0,ce);let c=i.find(e=>n.has(e.name)),l=c&&m.get(c.name),u=l&&Qb(c,l.module);if(u)throw ae([u],!1,void 0,ce);if(c)throw Zb(c);return o.forEach(e=>e()),{linked:s,closure:n}},me=(e,n)=>{let r=m.get(e);if(r)return ie(e,v.get(e)??[]),r;let i=pe(fe(e,n)),o=/* @__PURE__ */ new Map;return Np(e,t.print,p,t.files,d,(e,t,n)=>{let r=o.get(e),i=t.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(r?.kind!==`Operator`||!n||i.length!==t.length)throw new _(`No definition of ${e} to fall back to`);let a={kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:void 0};return U(r.body,{environment:n.environment,scope:Qg(a,i,n),state:n.state,next:n.next,isKeepLazy:n.isKeepLazy})})?.forEach(t=>{let n=i.linked.visible.get(t.name);if(n?.kind!==`Definition`||n.arity!==t.arity&&Kb.has(e))return;let r=a.get(n.key);r&&o.set(t.name,r),d.set(n.key,t),a.delete(n.key)}),m.set(e,i.linked),v.set(e,i.closure),ie(e,i.closure),i.linked},he=(e,t,n,r,i)=>{let o=i?void 0:C(e.module);if(o)return ge(e,o);let d=i??me(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=Yb(d),p=`#${b++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=ul(bb(e,t),f,t,n);se.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let ee=e.params.map(e=>({...e,name:`${e.name}${p}`}));ee.forEach(e=>u.add(e));let te=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,g=Kl({params:ee,substitutions:new Map([...h].map(([e,t])=>[e,gl(t,m)])),variables:new Set(d.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>s.get(e)===!0,addDefinition:(n,i,o)=>{let u=oe(`${i}@${t.name}`),d=o(u);return a.set(u,d),f.length>0&&l.add(d),e.name!==void 0&&de.set(u,`${e.name}!${de.get(n)??i}`),s.set(u,!r),c.set(u,{source:n,prefix:e.params.length}),u},createName:oe,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{...te.start,range:te}}}});return _e(e,d.exported,f,(t,n)=>{let r=e.name===void 0?g.getKey(t):g.getQualifiedKey(t);return f.length>0&&ue.set(r,{name:n,location:e.location}),e.name!==void 0&&x.set(r,n),r})},ge=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),_e=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:s.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},ve=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:Bl(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),ye=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),T=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=ye(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:Bl(r,n),location:n}}},be=(e,t,n,r)=>{let i=e.location,o=r?void 0:C(e.module);if(o)return e.name===void 0?[]:[...o].map(([t,n])=>{let r=ye(n.arity);return ve(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??me(e.module,n),l=`#${b++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=Yb(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};se.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>rx(f(e),p),h=d.map(t=>{let n=T(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),ee=[],te=Kl({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:Bl(e.params,i),location:i,resolution:Ys}:zl(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>s.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${ee.length}`,a=r(i);return ee.push(a.kind===`Operator`?{...a,name:i}:tx(a,i)),i},createName:oe}),g=new Set(d.map(e=>e.name)),_=[...c.exported].filter(([e])=>!g.has(e)).map(([t,n])=>{let r=te.getKey(n.key),a=ye(n.arity),o=[...e.params,...a];return ve(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...ee,..._]},xe=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),Se=/* @__PURE__ */ new Map,Ce=(e,n)=>{let r=nv(e,t.loadClass?.(e.name),e===i);Se.set(e.name,r.overrides);let o=r.module,c=se.length,l=new Map([...mp.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...n.symbols]),u=/* @__PURE__ */ new Map,d={location:al,errors:[],warnings:[]},f=[d],p=e=>e.forEach((e,t)=>{let n=m.get(t);if(!n){l.set(t,e),m.set(t,e);return}if(!n.range||!e.range||h(n.range)===h(e.range))return;let r=h(e.range),i=h(n.range);ex(n.kind)===ex(e.kind)?d.warnings.push({location:r,message:`Warning: the ${$b(n.kind)} of '${t}' conflicts with \nits ${$b(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${$b(e.kind)} of '${t}' conflicts with \nits ${$b(n.kind)} at ${i}.`})}),m=/* @__PURE__ */ new Map,te=/* @__PURE__ */ new Set,g=/* @__PURE__ */ new Map,_=[],v=[...o.constants],re=o.variables.filter((e,t)=>o.variables.findIndex(t=>t.name===e.name)===t),y=re.map(e=>e.name),ie=re.map(e=>e.location);o.extends.forEach(e=>{let t=n.modules.get(e),r=t?void 0:C(e);if(r){p(r);return}let i=t??me(e,o.name);v.push(...i.constants.filter(e=>v.every(t=>t.name!==e.name)&&!y.includes(e.name))),i.variables.forEach((e,t)=>{y.includes(e)||v.some(t=>t.name===e)||(y.push(e),ie.push(i.variableLocations[t]))}),p(i.exported),i.facts.forEach(e=>te.add(e)),i.modules.forEach((e,t)=>g.set(t,e)),_.push(i)});let ae=new Map(l),b=[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))],oe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});b.forEach(e=>m.set(e.name,oe(e)));let ue=e=>({key:S(e),arity:nc(e),params:rc(e),kind:ol(o,e)?`Theorem`:`Definition`,range:e.location.range}),de=v.length===0&&y.length===0,S=e=>o===i?e.name:`${e.name}@${n.id}`,w=/* @__PURE__ */ new Map,fe=()=>new Map([...n.modules,...g]),pe=e=>{let t=o.modules.find(t=>t.name===e.module);return t?tc(t.location,e.location)?g.get(t.name):void 0:fe().get(e.module)},ve=e=>({imported:l,getInstance:e=>{let t=pe(e),n=t?void 0:C(e.module);if(n)return{declarations:[],symbols:ge(e,n),instancer:o.name};let r=t??me(e.module,o.name),i=Yb(r);return{declarations:i,symbols:_e(e,r.exported,i,e=>e),instancer:o.name}},bound:ae,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:S,instanced:w,facts:te,reports:f,warnings:n.warnings}),ye=e=>[...b.filter(t=>tc(t.location,e)).map(e=>[e.name,oe(e)]),...o.definitions.filter(t=>tc(t.location,e)).map(e=>[e.name,ue(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(l)),T=e=>{let t=fe(),r=t.get(e.name),i=r&&Qb(e,r.module);if(r&&!i)throw Zb(e);n.nested.push(e);let a={location:e.location,errors:[],warnings:[]};f.push(a);let o=Ce(e,{id:`${n.id}/${e.name}`,symbols:ye(e.location),modules:t,nested:n.nested,errors:a.errors,warnings:a.warnings,levelChecks:n.levelChecks});i&&a.errors.push(i),r||g.set(e.name,o)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=he(e,o,ve(o),de,fe().get(e.module));w.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||m.set(n,t))})}})),...o.modules.map(e=>({location:e.location,link:()=>T(e)}))].sort((e,t)=>tc(e.location,t.location)?-1:1).forEach(e=>e.link());let E=xb(Xl(o,(e,t)=>be(e,t,o.name,pe(e))),xe(l));n.errors.push(...fl(E,ve(E))),E.definitions.forEach(e=>{let t=S(e);a.set(t,e),s.set(t,!de);let n=ue(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!tc(r,e.location))&&(l.set(e.name,n),e.isLocal||m.set(e.name,n))});let we={module:E,constants:v,variables:y,variableLocations:ie,visible:l,exported:m,modules:g,extended:_,facts:/* @__PURE__ */ new Set([...te,...[...E.theorems,...E.assumptions].flatMap(e=>e.name??[])])};ee.has(o.name)||ee.set(o.name,we);let Te=se.splice(c).map(e=>({location:e.location,check:()=>le(e)}));return n.levelChecks.push(()=>Au(E,{constants:new Set(v.map(e=>e.name)),variables:new Set(y),getDefinition:e=>a.get(l.get(e)?.key??e),getQualifiedName:e=>x.get(l.get(e)?.key??e)},Te,ce)),ne.push(we),we},E=pe(i).linked,we=t.traceFile,Te=we===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:we}}],Ee=[...t.moduleOperators??[],...Te].map(e=>{let t=me(e.module,i.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});ne.push(...ne.splice(ne.indexOf(E),1)),ce.length>0&&!t.isSanyReported&&t.print(te(ce));let De=e=>E.visible.get(e)?.key??e;E.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)}),Ee.forEach(e=>{let t=e.key===void 0?void 0:a.get(e.key);e.kind!==`postcondition`&&t&&a.set(e.operator,t)});let Oe=[],ke=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>ke(e,t)),Oe.push(...e.module.assumptions))};ke(E,/* @__PURE__ */ new Set);let Ae=E.constants.map(e=>e.name),je=E.variables,Me=new Map([...f,...[...m].map(([e,t])=>[e,t.visible]),[i.name,E.visible]]),Ne=e=>{let t=Me.get(e.module??``)?.get(e.name);return t?.kind===`Definition`?t:void 0},D=e=>{if(e.module===void 0)return[e.name,De(e.name)];let t=Ne(e);return t?[t.key]:[]},Pe=e=>e.module===i.name?[]:D(e),Fe=e=>{let t=a.get(e);return t?.kind===`Operator`?t.params.length:E.constants.find(t=>t.name===e)?.arity??d.get(e)?.arity??0},Ie=/* @__PURE__ */ new Map,Le=/* @__PURE__ */ new Set,Re=(e,t)=>{d.set(e,t),a.delete(e),Ie.delete(e),Le.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=Jb(e.value);Wr(t),Pe(e).forEach(e=>{let n=Fe(e);n===0?Ie.set(e,t):Re(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let ze=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=ze.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new g(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(qb),qb(e.value)]),ze.set(t,n)}),ze.forEach(e=>Pe(e).forEach(t=>Re(t,nx(e.name,Fe(t),e.rows))));let Be=new Map(e.substitutions.flatMap(e=>D(e).map(t=>[t,De(e.target)])));[...Be.keys()].forEach(e=>Ie.delete(e));let Ve=(e,t,n)=>{let r=De(t),i=a.get(r);if(!(i!==void 0||d.has(r)||Ie.has(r)||Ae.includes(t)||je.includes(t)))throw new g(`The configuration file substitutes for ${e} with the undefined identifier ${t}.`);if(i?.kind===`Operator`&&i.params.length!==n)throw new g(`The configuration file substitutes for ${e} with ${t} of different number of arguments.`)};e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,r=t.target;if(!Ae.includes(n)&&!E.visible.has(n))throw new g(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===r))throw new g(`In the configuration file, the identifier ${r} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);Ve(n,r,E.constants.find(e=>e.name===n)?.arity??E.visible.get(n)?.arity)});let O=e.substitutions.filter(e=>e.module!==void 0);[...Me.keys()].forEach(e=>{let t=O.filter(t=>t.module===e);t.forEach(e=>{let n=Ne(e);if(n){if(t.some(t=>t.name===e.target))throw new g(`In the configuration file, the identifier ${e.target} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);Ve(e.name,e.target,n.arity)}});let n=t.find(e=>!Ne(e));if(n)throw new g(`In the configuration file, the identifier ${n.name} does not appear in the specification.`)});let He=O.find(e=>!Me.has(e.module??``));if(He)throw new g(`In the configuration file, the module name ${He.module} is not a module in the specification.`);let Ue=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(Pe)),We=(e,t)=>{if(Ue.has(e))return{key:e,prefix:t};let n=c.get(e);return n&&We(n.source,t+n.prefix)};c.forEach((e,t)=>{let n=We(e.source,e.prefix),r=a.get(t);if(!n||!r)return;let i=r.kind===`Operator`?r.params:[],o=ve(t,n.key,i,i.slice(n.prefix),r.location);a.set(t,o),E.visible.forEach((e,n)=>{e.key===t&&n!==t&&a.set(n,o)})}),Ee.forEach(e=>me(e.module,i.name).constants.forEach(t=>{let n=e.constants?.[t.name];n!==void 0&&Ie.set(t.name,n)}));let Ge=Ae.filter(e=>!Ie.has(e)&&!Be.has(e)&&!Le.has(e));if(Ge.length>0){let e=n.getDeclarationOrder(`constant`).find(e=>Ge.includes(e))??Ge[0];throw new g(`The constant parameter ${e} is not assigned a value by the configuration file.`)}we!==void 0&&d.forEach((e,t)=>{let n=yp(e);n&&d.set(t,n)});let Ke=ix(je,ne.flatMap(e=>e.module.variables.map(e=>e.name))),qe=Wu({definitions:a,substitutions:Be,constants:Ie,variableIndex:Ke,builtins:d,variables:je}),Je={runtime:p,definitions:a,builtins:d,constants:Ie,substitutions:Be,instanceNames:de,variables:je,variableIndex:Ke,facts:qe,startupValues:Array.from({length:qe.ids.size},()=>void 0),substitutedDefinitions:l,instanceParams:u,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Ye=Ou({constants:new Set(Ie.keys()),variables:/* @__PURE__ */ new Set([...je,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>d.has(e))]),getDefinition:e=>og(e,Je)}),Xe=e=>{try{U(e,{environment:Je,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof _)return e;throw e}};Be.forEach((e,t)=>{let n=a.get(e),r=Ae.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ye.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Xe(n.body):void 0;if(r){let n=Nt(r)?``:` - specifically: ${r.message}`;throw new g(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),p.version!==`1.7.4`&&(p.isStarted=!0);let Ze=new Set(ne.flatMap(e=>e.module.instances.map(e=>e.module))),Qe=n.createDefinitionOrder();return{environment:Je,assumptions:Oe,variableLocations:E.variableLocations,instanceActions:ue,startupDefinitions:ne.filter(e=>!Ze.has(e.module.name)||Yb(e).length===0).flatMap(e=>Qe(e===E?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:ne.flatMap(e=>Se.get(e.module.name)??[]),moduleOperators:Ee,rootName:i.name}},cx={kind:`Boolean`,value:!0},lx={kind:`Boolean`,value:!1},ux=e=>e?cx:lx,dx=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,fx=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),px=(e,t,n)=>({kind:e,operands:[t,n]}),mx=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?mx(e,t.operands).operands:[t])}),hx=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return hx(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,hx(t)),0)}},gx=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return gx(e.body);case`And`:case`Or`:return e.operands.some(gx)}},_x=/* @__PURE__ */ new WeakMap;let vx=0;const yx=e=>{let t=_x.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${vx++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(yx).join(`,`)})`;default:return`${e.kind}(${yx(e.body)})`}})();return _x.set(e,n),n},bx=(e,t)=>e===t||yx(e)===yx(t),xx=(e,t)=>{let n=yx(t);return e.some(e=>e===t||yx(e)===n)},Sx=e=>e===`And`?`Or`:`And`,Cx=(e,t)=>{switch(e.kind){case`Boolean`:return t?ux(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return Cx(e.body,!t);case`And`:case`Or`:return mx(t?Sx(e.kind):e.kind,e.operands.map(e=>Cx(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,Cx(e.body,t))}}},wx=e=>{switch(e.kind){case`Boolean`:return ux(!e.value);case`Not`:return e.body;case`And`:case`Or`:return mx(Sx(e.kind),e.operands.map(wx));case`Always`:return $(`Eventually`,wx(e.body));case`Eventually`:return $(`Always`,wx(e.body));default:return $(`Not`,e)}},Tx=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Tx(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return ux(t)}return n.length===0?ux(!t):n.length===1?n[0]:mx(e.kind,n)}case`Not`:{let t=Tx(e.body);return t.kind===`Boolean`?ux(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=Tx(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Ex=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Dx=e=>{switch(e.kind){case`And`:{let t=[],n=1;for(let r of e.operands){let e=Dx(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n*=e.operands.length,n>2147483647))throw new _(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n===1)return{kind:`And`,operands:t};let r=Array.from({length:n},()=>[]),i=1,a=n;for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}a/=e.operands.length;let t=0;for(let n=0;n<i;n++)for(let n of e.operands)for(let e=0;e<a;e++)r[t++].push(n);i*=e.operands.length}return{kind:`Or`,operands:r.map(e=>mx(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Dx(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Ex(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:mx(`Or`,t);n.push($(`Always`,$(`Eventually`,e)))}return mx(`Or`,n)}case`Not`:return dx(e.body)?e:Dx(wx(e.body));default:return e}},Ox=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Ox(e.operands[0]):mx(e.kind,e.operands.map(Ox));case`Not`:return e.body.kind===`Not`?Ox(e.body.body):$(`Not`,Ox(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,Ox(e.body));default:return e}},kx=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return kx(e.operands[0]);let t=Math.floor(e.operands.length/2);return px(e.kind,kx(mx(e.kind,e.operands.slice(0,t))),kx(mx(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,kx(e.body));default:return e}},Ax=(e,t)=>{e.kind===`Eventually`&&!xx(t,e)&&t.push(e),`body`in e&&Ax(e.body,t),`operands`in e&&e.operands.forEach(e=>Ax(e,t))},jx=e=>{let t=e.filter(fx),n=e.flatMap(e=>e.kind===`Not`&&fx(e.body)?[e.body]:[]);return!t.some(e=>xx(n,e))},Mx=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,$(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new _(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Nx=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:$(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Px=(e,t,n)=>e.flatMap(e=>{let r=Nx(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Fx=e=>[...new Set(e.map(yx))].sort().join(`|`),Ix=(e,t)=>{let n=new Set(t.map(Fx));return[...e.filter(e=>!n.has(Fx(e))),...t]},Lx=e=>{let t=Mx(e),n=Px(t,`Always`,`And`),r=Px(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Nx(t,`Eventually`,`Or`);if(n&&!(xx(e,n.first)||xx(e,n.second)))return Ix(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(xx(e,t.first)||xx(e,t.second))&&!xx(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!jx(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Nx(t[e],`Always`,`And`);n&&(xx(t,n.first)||t.push(n.first),xx(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)xx(t,e.first)&&xx(t,e.second)&&!xx(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!jx(t)?[]:i(t)};return a(e)},Rx=e=>({particle:e,successors:[],statePredicates:e.filter(e=>hx(e)<=1)}),zx=e=>{let t=Lx([e]).map(Rx),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Fx(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of Lx(n)){let n=Fx(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Rx(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Bx=(e,t)=>!xx(e,t)||xx(e,t.body),Vx=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&hx(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Ex(e);if(n){let e=hx(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(gx(e))throw new _(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Hx=(e,t)=>{let n=e.findIndex(e=>bx(e,t));return n===-1?(e.push(t),e.length-1):n},Ux=e=>{let t=Dx(Tx(Cx(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Ox(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Vx(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:mx(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:bx(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&kx(e.formula),n=[];t&&Ax(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Hx(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Hx(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Hx(i,e))}));return{tableau:t&&zx(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Wx=()=>y(new _(`Temporal formula is a tautology (its negation is unsatisfiable).`),b.livenessEvaluationFailure),Gx=/* @__PURE__ */ new Set([`~>`,`-+->`]),Kx=/* @__PURE__ */ new WeakSet,qx=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),Jx=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Yx=(e,t)=>new _(`TLC cannot handle the temporal formula ${V(e)}${t===void 0?``:`:\n${t}`}`),Xx=(e,t,n,r=/* @__PURE__ */ new Set,i=/* @__PURE__ */ new Set)=>{let a=(e,t,r)=>{if(i.has(e))return 0;i.add(e);let a=Xx(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=Yh(t,e);if(!n)return;if(n.kind===`Value`)return 0;if(n.kind===`Thunk`)return n.isReleased?0:a(n,n.expression,n.scope);let r=n.operator;return r.kind===`Closure`?a(r,r.body,r.scope):0},s=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=og(e,n);if(t)return Xu(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isActionLevel?2:r.isStateLevel&&!r.isLevelConstant?1:0},c=(e,t)=>r.has(e)?0:k(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a={value:0};return Sl(e,(e,o)=>(a.value=Math.max(a.value,Xx(e,t,n,o.length===0?r:/* @__PURE__ */ new Set([...r,...o]),i)),e)),a.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:l(e);case`Identifier`:return c(e.name,e);case`OperatorReference`:return c(e.operator,e);case`Apply`:{if(Gx.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=k(e)?void 0:zg(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,Qg(o,e.args,Jx(n,t)))}default:return l(e)}},Zx=(e,t)=>{try{return gg(e,t)}catch(e){if(!(e instanceof _))throw e;if(!Nt(e))return;throw y(new _(`${m}${e.message}`),b.error)}},Qx=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o,s=[])=>{let c=(e,t,c=o,l=i,u)=>Qx(e,t,n,r,l,a||u!==void 0&&n.substitutedDefinitions.has(u),c,u?.kind===`Operator`&&u.params.length===0?[...s,u.name]:s);if(e.kind===`And`)return e.operands.flatMap(e=>c(e,t,V(e)));if(e.kind===`Label`)return c(e.body,t);if(e.kind===`Let`)return c(e.body,$x(e,t,n));if(e.kind===`Identifier`){let r=k(e)?Yh(t,e.name):void 0;if(r?.kind===`Thunk`&&!r.isReleased)return c(r.expression,r.scope,Kx.has(r)?e.name:o);let s=n.constants.has(e.name)?void 0:og(e.name,n);if(!r&&s?.kind===`Operator`&&s.params.length===0&&(Xu(s,n)>0||Pg(s,n)===void 0)){if(i.has(s))throw ee();return c(s.body,void 0,!a&&n.instanceNames.get(e.name)||s.name,/* @__PURE__ */ new Set([...i,s]),s)}}let l=Jx(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||Xx(e,t,n)===3)){let t=Bg(e,l),r=k(e)?void 0:og(e.operator,n),o=t?.kind===`Closure`&&t.params.every(e=>n.instanceParams.has(e));if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&(!a||o))return c(t.body,Qg(t,e.args,l),a&&r?r.name:e.operator,i,r)}let u=r&&e.kind===`Forall`&&e.bounds.every(e=>Xx(e.set,t,n)===0),d=u?Zx(e.bounds,l):void 0;if(u&&d){let n=[];if(_g(e.bounds,d,t,t=>(n.push(...c(e.body,t,V(e.body))),!1)),n.length===0)throw Wx();return n}return[{expression:e,scope:t,name:o,path:s}]},$x=(e,t,n)=>{let r=n_(e.definitions,Jx(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Kx.add(e.binding);return r},eS=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,i=(e,t,i)=>{let a=i===0&&!r?Xx(e,t,n):i;if(a===0){let r=U(e,Jx(n,t));if(typeof r!=`boolean`)throw new _(`TLC expected a boolean value, but did not find one. ${Rh(e)}`);return ux(r)}return a===1?{kind:`State`,expression:e,scope:t}:e.kind===`AngleAction`?{kind:`Action`,expression:e.action,subscript:e.subscript,scope:t}:{kind:`Action`,expression:e,subscript:void 0,scope:t}},a={depth:0},o=(e,t,r,o)=>{if(a.depth>=100)throw ee();a.depth++;let s=p(e,t);a.depth--;let c=hx(s),l=c===0&&Xx(r,o,n)>2;return c>2||l?s:i(r,o,c)},s=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=Jx(n,t),s=k(e)||og(i,n)===void 0?Yh(t,i):void 0;if(s?.kind===`Thunk`&&!s.isReleased&&Kx.has(s))return c(e,()=>o(s.expression,s.scope,e,t));let l=s?.kind===`Operator`?s.operator:s?void 0:k(e)?Vg(i,a):zg(i,n),u=e.kind===`Apply`?e.args:[],f=l?.kind===`Builtin`&&u.length===2?qx.get(l.name):void 0;if(f){let n=u.map(e=>p(e,t));return d(e,t,mx(f,n))}if(l?.kind!==`Closure`)throw Yx(e);let m=!k(e)&&og(i,n)?.isRecursive===!0;return c(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>U(e,a)),o(l.body,Qg(l,u,a),e,t)),m)},c=(e,t,n=!1)=>{try{return t()}catch(t){let i=t instanceof l||n&&!r;throw!(t instanceof _)||i?t:Yx(e)}},u=(e,t)=>{let r=Xx(e,t,n),a=[],o=e.kind===`Forall`;try{vg(e.bounds,Jx(n,t),t=>(a.push(p(e.body,t)),!1))}catch(n){if(!(n instanceof _)||n instanceof l)throw n;if(r<=2)return i(e,t,r);throw Yx(e,o&&!Nt(n)?n.message:void 0)}return a.length===0?ux(o):d(e,t,mx(o?`And`:`Or`,a))},d=(e,t,n)=>{let r=hx(n);return r>2?n:i(e,t,r)},f=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!k(e)||e.operator===`=>`),p=(e,t)=>{let a=Xx(e,t,n);if(a<=2&&!f(e))return i(e,t,a);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,$x(e,t,n));case`Identifier`:return s(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,px(`Or`,$(`Not`,p(n[0],t)),$(`Eventually`,p(n[1],t)))):e.operator===`~`&&!k(e)?d(e,t,$(`Not`,p(n[0],t))):e.operator===`=>`?d(e,t,px(`Or`,$(`Not`,p(n[0],t)),p(n[1],t))):s(e,t)}case`And`:case`Or`:return d(e,t,mx(e.kind,e.operands.map(e=>p(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!r&&Xx(e.condition,t,n)===0){let r=U(e.condition,Jx(n,t));if(typeof r==`boolean`)return p(r?e.consequent:e.alternative,t)}let i=p(e.condition,t);return d(e,t,px(`Or`,px(`And`,i,p(e.consequent,t)),px(`And`,$(`Not`,i),p(e.alternative,t))))}case`Always`:case`Eventually`:return $(e.kind,p(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=$(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?$(`Always`,$(`Eventually`,px(`Or`,i,a))):px(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw Yx(e)}};return p(e,t)},tS=(e,t,n,r,i)=>{let a=e=>tS(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?U(e.expression,a):wh(e.step,a);if(typeof o!=`boolean`)throw new _(`A state predicate was evaluated to a non-boolean value.`);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a=e.scope,o=e.subscript;if(o&&Kr(U(o,{environment:r,scope:a,state:t,next:void 0}),U(o,{environment:r,scope:a,state:n,next:void 0})))return!1;let s=U(e.expression,{environment:r,scope:a,state:t,next:n});if(typeof s!=`boolean`)throw new _(`Encountered an action predicate that's not a boolean.`);return s}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return tS(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new _(`TLC cannot evaluate a temporal formula in a single step`)}},nS=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>nS(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return tS(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},rS=`UnnamedAction`,iS={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},aS=e=>{let t=e.range??iS;return pi([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},oS=(e,t)=>{let n=[[`name`,e.name],[`location`,aS(e.location)]];return e.parameters.length>0&&n.push([`context`,pi(e.parameters)],[`parameters`,fi(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),pi(n)},sS=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),cS=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),lS=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,uS=e=>e.kind===`Apply`?e.args:[],dS=(e,t,n)=>{let r=lS(e);if(r===void 0)return;if(k(e)){let e=Yh(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=zg(r,n);return i?.kind===`Closure`?i:void 0},fS=(e,t)=>{try{return U(e,cS(t,void 0)),!0}catch(e){if(e instanceof le)return!1;throw e}},pS=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&qu(e,t)&&fS(e.body,t),mS=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&pS(e,t),hS=(e,t)=>{let n=og(e.name,t);return n?.body===e.body&&mS(n,t)},gS=(e,t)=>{if(e.kind!==`Identifier`||!k(e))return;let n=Yh(t,e.name);return n?.kind===`Thunk`?n:void 0},_S=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Yh(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),vS=(e,t)=>{try{return e()}catch(e){if(e instanceof le)return t();throw e}},yS=(e,t,n,r,i)=>{let a=uS(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return r&&a.length===0?[{...e,parameters:[],expression:r.body,scope:r.scope}]:r?a.some(e=>Xx(e,n,i)!==0)?o():vS(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),U(e,cS(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},bS=(e,t,n,r,a)=>{let o=()=>({name:n?.name??rS,location:e.location,parameters:_S(n,t),expression:e,scope:t});if(pm.has(e.kind))throw y(new _(`${i}The next state relation is not a boolean expression.\n${Rh(e)}`),b.error);switch(e.kind){case`Let`:return bS(e.body,n_(e.definitions,cS(r,t)),n,r,a);case`Label`:return bS(e.body,t,n,r,a);case`Or`:return e.operands.flatMap(e=>bS(e,t,n,r,a));case`Exists`:return vS(()=>{let i=[];return vg(e.bounds,cS(r,t),t=>(i.push(...bS(e.body,t,n,r,a)),!1)),i.length===0?[o()]:i},()=>[o()])}let s=k(e)?void 0:a.get(lS(e)??``),c=dS(e,t,r);if(s)return yS(s,e,t,c,r);if(!c)return[o()];let l=uS(e),u=k(e)?c.name:r.instanceNames.get(lS(e)??``)??c.name,d=()=>[{name:u,location:e.location,parameters:[],expression:e,scope:t}];return hS(c,r)||l.some(e=>Xx(e,t,r)!==0)?d():vS(()=>{let e=l.reduce((e,n,i)=>({name:c.params[i].name,binding:{kind:`Value`,value:U(n,cS(r,t))},parent:e}),c.scope);return bS(c.body,e,{...c,name:u},r,a)},d)},xS=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>xS(e,t,n,r,i,o),s=(e,t,n)=>sS(e,hl(t,a),n);if(e.kind===`Let`){o(e.body,n_(e.definitions,cS(n,t)));return}let c=gS(e,t);if(c){o(c.expression,c.scope);return}let l=dS(e,t,n);if(l&&hS(l,n))return;let u=l?[...a,...ml.get(l.body)??[]]:a;if(l&&l.params.length===0){if(Xx(l.body,l.scope,n)===1){r.inits.push(s(l.name,l.body,l.scope));return}o(l.body,l.scope,u);return}if(l&&e.kind===`Apply`&&l.params.length===e.args.length){o(l.body,Qg(l,e.args,cS(n,t)),u);return}if(e.kind===`And`){e.operands.forEach(e=>o(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t,frames:a});return}r.temporals.push(s(rS,e,t));return}let d=Xx(e,t,n);d<=1?r.inits.push(s(rS,e,t)):d===3&&r.temporals.push(s(rS,e,t))},SS=(e,t,n,r,i)=>{let a=(t,n)=>SS(e,t,n,r,i);if(t.kind===`Let`){a(t.body,n_(t.definitions,cS(r,n)));return}let o=gS(t,n);if(o){a(o.expression,o.scope);return}let s=dS(t,n,r);if(s&&hS(s,r))return;if(s&&s.params.length===uS(t).length){a(s.body,t.kind===`Apply`?Qg(s,t.args,cS(r,n)):s.scope);return}if(t.kind===`Forall`&&vS(()=>(vg(t.bounds,cS(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(sS(e,a)):Xx(a,n,r)<2?i.invariants.push(sS(e,a)):i.impliedTemporals.push(sS(e,t));return}let c=Xx(t,n,r);c<=1?i.impliedInits.push(sS(e,t)):c===3&&i.impliedTemporals.push(sS(e,t))},CS=(e,t)=>{let n=og(e,t);return n?.kind===`Operator`&&!mS(n,t)?n:void 0},wS=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:CS(e.specification,t);a&&(xS(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:rS,location:e.frames[0].location,parameters:[],expression:hl(e.expression,e.frames),scope:e.scope}]:bS(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:zg(e.init,t);o?.kind===`Closure`&&r.inits.push(sS(e.init??``,o.body));let s=e.next===void 0?void 0:zg(e.next,t);return s?.kind===`Closure`&&r.actions.push(...bS(s.body,s.scope,s,t,n)),r},TS=(e,t,n)=>{let r=[],i=(e,t)=>{if(e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`)return!1;if(e.kind===`Tuple`)return e.elements.every(e=>i(e,t));if(e.kind===`Label`)return i(e.body,t);if(e.kind===`Let`)return i(e.body,n_(e.definitions,cS(n,t)));let a=gS(e,t);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&k(e)?Yh(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!k(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=dS(e,t,n);if(!s||s.params.length!==uS(e).length)return!0;let c=og(s.name,n);return c?.body===s.body&&pS(c,n)?!0:i(s.body,e.kind===`Apply`?Qg(s,e.args,cS(n,t)):s.scope)};return i(e,t)?r:void 0},ES=(e,t,n)=>wS(e,t,n).inits,DS=(e,t,n)=>wS(e,t,n).actions,OS=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>I(e[1])).join(`,`)})`,kS=(e,t,n=!1)=>`${e.name===rS?n?`Initial predicate`:`Action`:e.name}${t===`1.7.4`?``:OS(e)} ${h(e.location.range??iS)}`,AS=e=>`${e.name}${OS(e)}`,jS=(e,t,n,r)=>{let i=wS(e,t,r);e.invariants.forEach(e=>{let n=CS(e,t);n&&i.invariants.push(sS(e,n.body))}),e.properties.forEach(e=>{let n=CS(e,t);n&&SS(e,n.body,void 0,t,i)});let a=t.coverage,o=(e,t)=>Yr(e.map(e=>{let n=a&&t&&Qo(a,t,e.expression);return oS(e,n&&pi(n))})),s=e=>Yr(e.flatMap(e=>{let n=CS(e,t);return n?[pi([[`name`,n.name],[`location`,aS(n.location)]])]:[]}));return pi([[`inits`,o(i.inits,`init`)],[`actions`,o(i.actions,`next`)],[`temporals`,o(i.temporals)],[`invariants`,o(i.invariants,`invariant`)],[`impliedinits`,o(i.impliedInits,`implied`)],[`impliedactions`,o(i.impliedActions,`implied`)],[`impliedtemporals`,o(i.impliedTemporals)],[`variables`,Yr(t.variables.map((e,t)=>pi([[`name`,e],[`location`,aS(n[t])],...a?[[`coverage`,pi([[`distinct`,Bo(a,t)]])]]:[]])))],[`actionconstraints`,s(e.actionConstraints)],[`constraints`,s(e.constraints)]])},MS=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),NS=(e,t)=>{let n=/* @__PURE__ */ new Map;return(/* @__PURE__ */ new Set([...e.keys(),...t.keys()])).forEach(r=>{let i=e.get(r),a=i?t.get(i.name)??i:t.get(r);a&&a.name!==r&&n.set(r,a)}),n},PS=e=>y(new _(`${i}${e}`),b.error),FS=e=>{let t=F(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!un(e)||!un(i))throw PS(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},IS=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${LS(t)}`:n},LS=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Number`)return e.text??String(e.value);if(e.kind===`SetEnumeration`)return`{${e.elements.map(LS).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${IS(e.pattern,e.set)}:${LS(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(LS).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${LS(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>IS(e.pattern,e.set)).join(`,`)}|->${LS(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(LS);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},RS=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,zS=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new g(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw PS(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>U(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!j(a)||!M(a))throw PS(`The symmetry operator must specify a set of functions.`);let o=N(a).elements;if(!o.every(ln))throw PS(`The symmetry values must be function records.`);let s=r.body,c=s.kind===`Apply`?s.args:s.kind===`SetEnumeration`?s.elements:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=LS(RS(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(St.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;o.map(FS).forEach(e=>{e.size>0&&d.set(MS(e),e)});let f=[...d.values()],p={start:0};for(;p.start<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p.start,t).forEach(e=>{let t=NS(n,e),r=MS(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p.start=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!RS(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>un(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},BS=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=HS(r,t);if(i===r)continue;let a=e.slice(0,n);a.push(i);for(let r=n+1;r<e.length;r++)a.push(HS(e[r],t));return a}},VS=(e,t)=>{let n=[],r=[];for(let i of e){let e=HS(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Jn);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Jn(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},HS=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=VS(e.elements,t);return n?$n(n):e}if(n===`Function`||n===`LazyFunction`&&M(e.domain)){let n=F(e),r=BS(n.domain,t),i=BS(n.range,t)??n.range;if(r){let e=ti(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?tr(n.domain,e.range):e}return i===n.range?n:tr(n.domain,i)}if(n===`Interval`||!j(e)||!M(e))return e;let r=N(e),i=BS(r.elements,t);return i?Yr(i):r},US=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=HS(e[o],i),a===0&&(a=Jn(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},WS={line:0,column:0},GS=e=>({kind:`Identifier`,name:e,location:WS}),KS=/* @__PURE__ */ new Set([`name`,`property`]),qS=(e,t,n)=>{let r=og(t,n);if(!r)throw new g(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new g(KS.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},JS=e=>e.body.kind===`Number`||e.body.kind===`String`,YS=(e,t,n)=>{if(n.constants.has(e))return n.constants.get(e);if(qu(t,n)&&!JS(t))try{return U(GS(e),yC(n,void 0,void 0))}catch(e){if(e instanceof _||ne(e))return;throw e}},XS=(e,t,n)=>{if(n.constants.has(t))throw new g(`The ${e} ${t} cannot be a constant.`);let r=qS(e,t,n);if(YS(t,r,n)!==void 0)throw new g(`The ${e} ${t} cannot be a constant.`);return r},ZS=(e,t,n)=>{let r=n.constants.has(t)?void 0:qS(e,t,n),i=r?YS(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new g(`The ${e} of ${t} is equal to ${I(i)}`);return i===void 0?r:void 0},QS=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},$S=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),Fg(e.startupDefinitions,r),t.invariants.forEach(e=>{ZS(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},eC=(e,t)=>{let n=Ou({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>t.definitions.get(e)});return e.flatMap(e=>{let r=ZS(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
|
|
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
|
|
1789
|
-
all state variables. Proceed with fingers crossed.`}),r().filter(e=>n!==void 0&&!n.includes(e)).forEach(e=>i?.({kind:`warning`,code:
|
|
1790
|
-
but TLC can handle only specifications with one next-state relation.`);o.push({expression:c.expression.action,scope:e.scope});return}if(c.kind===`Always`&&c.expression.kind!==`Let`&&c.expression.kind!==`Label`&&Xx(c.expression,e.scope,t)<2)throw x(new v(`TLC cannot handle the temporal formula ${H(c.expression)}`),ie.error);let f=Xx(c,e.scope,t);if(f===3)u!==void 0&&e.path.includes(u)||(d=!0),s.push(e);else{if(f===2)throw new _(`TLC cannot handle this conjunct of the spec:\n${H(c)}`);a.push(e)}});let f=[...a,...o],p=e=>`$specification${e}`,m=f.reduce((e,t,n)=>t.scope===void 0?e:{name:p(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),g=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:p(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:a.length===0?void 0:{kind:`And`,operands:a.map(g),location:GS},next:o.length===0?void 0:g(o[0],a.length),scope:m,temporals:s,isPropertyFairness:s.length>0&&!d}},aC=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=QS(`property`,e,t);if(!i)return;Xx(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;Qx(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(rC(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&Xx(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!A(e)?ag(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=Xx(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2){let e=H(i),t=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,n=i.kind===`BoxAction`?`To check that action ${a} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${e} (compare page 90 of ${t}).`:i.kind===`AngleAction`?`To check that infinitely many ${a} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${e} (compare page 91 of ${t}).`:`To check that action ${a} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${e}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${t}).`;throw new _(`The formula ${a} at ${e} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${n}`)}r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},oC=(e,t,n)=>t.flatMap(t=>QS(e,t,n)?[{name:t,expression:KS(t),scope:void 0}]:[]),sC=(e,t)=>{let n=ag(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},cC=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new _(`_POSSIBLE lists ${n} more than once`);ZS(`possible`,n,t);let i=KS(n);if(Xx(i,void 0,t)===3)throw new _(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),lC=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||A(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},uC=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=ag(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},dC=(e,t)=>e.flatMap(e=>nC(e.expression,t).map(n=>{let r=e.scope===void 0?Qu(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:lC(n,r,t),predicate:uC(e.expression,t)}})),fC=(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},pC=/[\u0100-\uffff]/,mC=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),hC=e=>e.kind===`String`?pC.test(e.value):e.kind===`Set`&&e.elements.some(hC),gC=e=>e.kind===`String`&&pC.test(e.value)||e.kind===`Apply`&&mC.has(e.operator)||ht(e).some(gC),_C=(e,t)=>e.constants.some(e=>hC(e.value)||(e.args??[]).some(hC))||[...t.definitions.values()].some(e=>gC(e.body)||e.kind===`Function`&&e.bounds.some(e=>gC(e.set))),vC=e=>{if(!cn(e))return;let t=gn(I(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},yC=(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`},bC=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),xC=(e,t,n)=>eg(W(e,t),n),SC=(e,t,n=wC)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new v(n(e,t.environment));return r},CC=(e,t,n)=>{let r=t.kind===`Identifier`?ag(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`?h(a):Lh(i)}`},wC=(e,t)=>CC(`boolean`,e,t),TC=(e,t)=>SC(e.expression,t,(n,r)=>(SC(e.predicate,t),wC(n,r))),EC=()=>{},DC=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=xC(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),OC=(e,t)=>{try{return e(bC(t,void 0,void 0))?void 0:{message:void 0}}catch(e){if(e instanceof v)return{message:e.message};throw e}},kC=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=OC(e=>ig(W(n.expression,e),n.expression),t);if(e)return{name:Lh(n.expression),trace:[],message:e.message}}},AC=e=>{let t=typeof e.config==`string`?mt(e.config,e.version):e.config,n=Wb(e.source,e.loadModule);Dn(n.getStringOrder(t)),Mn(e),lo(e.fingerprintPolynomial??0);let r=ox(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});eC(r,t,e.onProgress);let i=r.environment;return i.runtime.getSpecification=()=>MS(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)}},jC=(e,t,n)=>{let r=kC(e,t);if(!r)return;if(r.message===void 0){let e=`Assumption ${r.name} is false.`;return n(xt.assumptionFalse,e,e),ie.assumptionViolation}let i=`Evaluating assumption ${r.name} failed.\n${r.message}`;return n(xt.assumptionEvaluationError,i,Pt(xt.assumptionEvaluationError,i,!0)),ie.assumptionViolation},MC=e=>x(new v(`${i}Could not find operator: ${e.operator} in module: ${e.module}`),ie.error),NC=(e,t,n,r,a,o=[])=>{let s=e=>o.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw MC(e);return{name:e.operator,key:e.key}}),c=tC(e.invariants,t),l=iC(e,t,n,r,a),u=aC(e,t,a),d=e.properties[0],f=d&&ag(d,t)?.location.range,p=e.specification,m=p&&ag(p,t)?.location.range;l.isPropertyFairness&&f&&m&&a?.({kind:`warning`,code:xt.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${d} at ${h(f)} equals\nthe fairness constraints of the behavior specification ${p} at ${h(m)}.\nTherefore, checking whether ${p} => ${d} using TLC will never result in a violation of ${d}.`});let g=dC([...c,...u.invariants],t),ee=[...new Map(g.map(e=>[e.predicate,e])).values()],y=g.length>0||u.actionProperties.length>0||u.liveness.length>0;if(l.init===void 0&&(y||u.initialPredicates.length>0||t.variables.length>0))throw new _(t.runtime.version===`1.7.4`?Et:`The configuration file did not specify the initial state predicate.`);if(l.next===void 0&&y)throw new _(`The configuration file did not specify the next state predicate.`);let b=oC(`constraint`,[...e.constraints,...s(`constraint`).map(e=>e.name)],t),te=dC(b,t),ne=oC(`action constraint`,e.actionConstraints,t),re=t.coverage,ae=(e,n,r=!0)=>n.flatMap(n=>{if(!re)return[];let i=r?uC(n.expression,t):n.expression,a=Co(r?n.name:void 0,i,t),o=xo(re,e,a,i,n.scope);return[{expression:i,scope:n.scope,node:o}]}),oe=[...ae(`invariant`,c),...ae(`invariant`,u.invariants,!1)],se=ae(`constraint`,ne),ce=ae(`constraint`,b),le=ae(`implied`,u.initialPredicates,!1),ue=ae(`implied`,u.actionProperties.map(e=>({...e,expression:e.box})),!1),de=(e,n,r,i)=>{try{return Io(e,n.node,()=>W(n.expression,bC(t,r,i,n.scope)))}catch{return}},fe=(e,t,n)=>re!==void 0&&e.every(e=>de(re,e,t,n)===!0),S=(e,t,n)=>{if(re){for(let r of e){let e=de(re,r,t,n);if(typeof e!=`boolean`)return;if(!e)return re.primary[r.node]++,!1;re.secondary[r.node]++}return!0}};e.rlReward!==void 0&&JS(`rlreward`,e.rlReward,t),e.periodic!==void 0&&JS(`periodic`,e.periodic,t);let C=cC(e.possible,t);if(t.variables.length===0)return;let w=e.symmetry===void 0?void 0:BS(e.symmetry,t,e.substitutions),T=e.view===void 0?void 0:ZS(`view function`,e.view,t),pe=e.view??s(`view`)[0]?.name,me=pe===void 0?void 0:{name:pe,expression:KS(pe),scope:void 0},he=u.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:GS};return{...e,unchanged:t}}),ge=e=>Xx(e.expression,void 0,t)>=2,_e=C.filter(e=>!ge(e)),ve=C.filter(ge),ye=t.runtime,be,E=()=>{if(be)return be;let e=r(),n=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return be=t.variables.map((e,t)=>t).sort((e,t)=>n(e)-n(t)),be},xe=(e,n)=>W(e,bC(t,n,void 0)),Se=e=>{let t=E(),n=w===void 0?e:WS(e,w,t);return mo(me===void 0?t.map(e=>n[e]):[xe(me.expression,n)])},D=/* @__PURE__ */ new WeakSet,Ce=(e,n,r)=>{let i=r&&!D.has(r)?r:void 0;if(fC(e,n,i))return!1;try{let r=bC(t,n,void 0,e.scope),a=e.membership;return i&&a?!$i(n[a.variable],i[a.variable],W(a.set,r)):!TC(e,r)}catch(t){throw r?Bt(x(t,ie.safetyEvaluationFailure),xt.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},we=_C(e,t);ye.getFingerprint=Se;let Te=()=>{let e=C.find(e=>!ye.possibleCounts.get(e.name));if(!e)return;let n=sC(e.name,t),r=n?` at ${h(n)}`:``;return{name:e.name,code:xt.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:j(L(Cf(ye),!0))}},Ee=T?.body.kind===`Tuple`?T.body.elements:[],De=Ee.flatMap(e=>e.kind===`Identifier`&&t.variables.includes(e.name)?[e.name]:[]),Oe=T?.body.kind===`Tuple`&&De.length===Ee.length&&new Set(De).size===De.length,ke=(e,n)=>Oe?E().filter(e=>De.includes(t.variables[e])).map(e=>`/\\ ${t.variables[e]} = ${j(L(n[e]))}\n`).join(``):j(L(xe(e,n))),Ae=(e,n,r)=>SC(e.expression,bC(t,n,r),e=>`${i}${wC(e,t)}`),je=e=>{let n=Object.fromEntries(E().map(n=>[t.variables[n],e[n]]));return me===void 0?n:Pn(n,()=>ke(me.expression,e))};return{properties:u,spec:l,toRecord:je,evaluateAlias:(e,n,r,i)=>{try{ZS(`alias`,e,t);let i=W(KS(e),bC(t,n,r)),a=vC(i);return a===void 0?je(n):In(a,e)}catch(e){if(!(e instanceof _||e instanceof v))throw e;return{...je(n),_ALIASEvalError:Ft(e.message,i)}}},isSymmetric:w!==void 0,isConstrained:te.length>0||ne.length>0,getTlcOrder:E,getStoredFingerprints:(e,t)=>me!==void 0||we?BigInt64Array.from(e,Se):ho(t,E()),getFingerprintState:e=>{if(we)return[String(Se(e))];let t=w===void 0?e:WS(e,w,E());return me===void 0?t:[xe(me.expression,t)]},findViolatedInvariant:(e,t)=>{if(fe(oe,e))return;let n=g.find(n=>Ce(n,e,t));return n&&D.add(e),n},getViolatedInvariants:e=>{let t=ee.filter(t=>g.some(n=>n.predicate===t.predicate&&Ce(n,e,void 0)));return t.length>0&&D.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>SC(n,bC(t,e,void 0,r));te.every(e=>r(e.predicate,e.scope))&&n();let i=ee.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=u.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(te.every(e=>SC(e.predicate,bC(n,t,void 0,e.scope)))&&ne.every(r=>SC(r.expression,bC(n,e,t,r.scope))))||r())||ee.every(e=>SC(e.predicate,bC(n,t,void 0,e.scope))))&&he.every(r=>SC(r.box,bC(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>S(ce,e)??te.every(r=>fC(r,e,n)||TC(r,bC(t,e,void 0))),findFailedInitialPredicate:e=>fe(le,e)?void 0:u.initialPredicates.find(n=>!SC(n.expression,bC(t,e,void 0,n.scope))),findViolatedActionProperty:(e,n)=>fe(ue,e,n)?void 0:he.find(r=>{try{return!SC(r.action,bC(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${H(r.box)}`)&&!xC(r.unchanged,bC(t,e,n,r.scope),`a subscript`)}catch(e){throw Bt(PC(e),xt.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>S(se,e,t)??ne.every(n=>Ae(n,e,t)),getExcludingConstraints:(e,n)=>[...te.filter(e=>!TC(e,bC(t,n,void 0))),...ne.filter(t=>!Ae(t,e,n))].map(e=>{let n=sC(e.name,t);return n?h(n):e.name}),trackStatePossible:_e.length===0?EC:e=>DC(_e,ye,bC(t,e,void 0)),trackActionPossible:ve.length===0?EC:(e,n)=>DC(ve,ye,bC(t,e,n)),findUnwitnessedPossible:Te,getReward:(n,r,i)=>{if(e.rlReward===void 0)return i;let a=KS(e.rlReward),o=W(a,bC(t,n,r));if(typeof o!=`number`)throw new v(CC(`integer`,a,t));return o},findPostconditionViolation:(n=!1)=>{let r=s(`postcondition`),i=e.postconditions.map(e=>{let n=ag(e,t);return n?n.kind===`Operator`&&n.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!YS(n)&&Ng(n,t)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(i!==void 0){if(n)return;throw x(new v(i),ie.configParseError)}let a=(e,n)=>{let r=OC(e=>SC(KS(n),e),t);if(!r)return;let i=ag(n,t)?.body,a=sC(n,t),o=a?` at ${i?.kind===`Number`?Lh(i):h(a)}`:``;return r.message===void 0?{name:e,code:xt.postconditionFalse,message:`Postcondition ${e}${o} is false.`}:{name:e,code:xt.postconditionFailed,message:`Evaluating postcondition ${e}${o} failed.\n${r.message}`}};for(let e of r){let t=a(e.name,e.key);if(t)return t}let o=Te();if(o)return o;for(let t of e.postconditions){let e=a(t,t);if(e)return e}}}},PC=e=>e instanceof c?x(e,e.exitCode):e,FC=(e,t)=>e*((t-e)/2**64),IC=e=>e.includes(`.`)?e:`${e}.0`,LC=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(`+`,``)}`},RC=e=>e!==void 0&&e>=`0`&&e<=`9`,zC=e=>{if(e===0)return`0.0`;let t=LC(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;RC(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;RC(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;RC(t[n])&&r<2;)i+=t[n++],r++;for(RC(t[n])&&Number(t[n])>=5&&(i=BC(i));RC(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},BC=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${BC(r)}.`:n===`9`?`${BC(r)}0`:`${r}${Number(n)+1}`},VC=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}`)},HC=(e,t,n)=>{if(FC(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a=1/0,o=9223372036854775807n;for(let e=1;e<r.length;e++){let t=i[2*e+1],n=i[2*e-1];if(t<0!=n<0)continue;let s=t-n;if(s<=1048576){let t=s*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a=Math.min(a,t)}else{let t=r[e]-r[e-1];t<o&&(o=t)}}if(a===1/0)return o;let s=BigInt(a);return s<o?s:o},UC=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a=0,o=n.find(t=>(a+=e[t],a>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},WC=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},GC=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Ca(e[t]),16777619),r=Math.imul(r^ka(e[t]),1540483477);t[0]=WC(n)||1,t[1]=WC(r)},KC=()=>{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)}}},qC=(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}},JC=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),YC=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return qC(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},XC=e=>Atomics.load(e.used,0)*2>=e.slots.length,ZC=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&qC(t,n);return{slots:t,used:e.used}},QC=[void 0,`lambda`,`tuple`,`record`],$C=()=>{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=ua(e.domain);return t?(a(7),a(QC.indexOf(rr(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(QC.indexOf(rr(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})}},ew=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 Xn(t.strings[n[r++]]);if(e===5)return Qn(i(n[r++]));let a=QC[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=li({kind:`Interval`,low:e,high:e+t-1});return nr(er(o,i(t)),a)}let o=n[r++],s=i(o);return nr(er(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{kh as $,mt as $t,tS as A,Sa as At,tb as B,St as Bt,AS as C,gr as Ct,MS as D,L as Dt,OS as E,Ka as Et,Ux as F,pr as Ft,f_ as G,Lt as Gt,ob as H,Pt as Ht,yx as I,ur as It,a_ as J,Kt as Jt,H as K,jt as Kt,Bx as L,Dn as Lt,eS as M,en as Mt,mx as N,kn as Nt,oS as O,On as Ot,fx as P,Ca as Pt,Eh as Q,ht as Qt,ox as R,Mn as Rt,PC as S,ma as St,DS as T,fi as Tt,ab as U,Ft as Ut,rb as V,Tt as Vt,Sy as W,Rt as Wt,Th as X,Vt as Xt,i_ as Y,Mt as Yt,Dh as Z,qt as Zt,yC as _,vo as _t,ZC as a,ip as at,$S as b,mo as bt,GC as c,Xf as ct,HC as d,Zd as dt,nt as en,Oh as et,FC as f,tf as ft,kC as g,zo as gt,NC as h,Mo as ht,JC as i,Tm as it,nS as j,Zn as jt,Wx as k,xa as kt,zC as l,Tf as lt,MC as m,xo as mt,$C as n,we as nn,Cm as nt,YC as o,rp as ot,UC as p,tc as pt,ag as q,Xt as qt,KC as r,ke as rn,wm as rt,XC as s,ap as st,ew as t,qe as tn,Em as tt,VC as u,Of as ut,AC as v,Co as vt,jS as w,Xn as wt,eC as x,lo as xt,jC as y,Zo as yt,Wb as z,xt as zt};
|
|
1788
|
+
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw y(new g(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),b.safetyEvaluationFailure)}return[{name:e,expression:GS(e),scope:void 0}]})},tC=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>tC(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=og(e.name,t);if(n?.kind===`Operator`&&n.params.length===0&&Pg(n,t)===void 0)return tC(n.body,t)}return[e]},nC=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||Xx(r,e.scope,t)>0)return!1;let i=U(r,yC(t,void 0,void 0,e.scope));if(i===!1)throw new g(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new g(`The operator ${r.name}, which equals ${I(i)},\ncannot be used as a ${n}`);return!0},rC=(e,t,n,r,i)=>{if(e.specification===void 0){let n=(e,n)=>{if(e!==void 0)return XS(n,e,t),GS(e)};return{init:n(e.init,`initial predicate`),next:n(e.next,`next state action`),scope:void 0,temporals:[],isPropertyFairness:!1}}if(e.init!==void 0||e.next!==void 0)throw new g(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let a=[],o=[],s=[],c=t.constants.has(e.specification)?t.constants.get(e.specification):YS(e.specification,qS(`name`,e.specification,t),t);if(c!==void 0)throw new g(`The value of ${e.specification} is equal to ${I(c)}`);let l=qS(`name`,e.specification,t),u=e.properties.length===1?e.properties[0]:void 0,d=!1;Qx(l.body,void 0,t,!1).forEach(e=>{let c=e.expression;if(nC(e,t,`spec`))return;let l=c.kind===`Identifier`&&!k(c)?t.variableIndex.get(c.name):void 0;if(c.kind===`Identifier`&&l!==void 0){let e=n[l].range;throw new g(`The operator ${c.name}, which equals ${e?Fh(e):c.name},\ncannot be used as a spec`)}if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw y(new g(`TLC does not support temporal existential, nor universal, quantification over state variables.`),b.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){let n=TS(c.expression.subscript,e.scope,t);if(n===void 0&&i?.({kind:`warning`,code:St.subscriptUndetermined,text:`TLC could not determine if the subscript of the next-state relation contains
|
|
1789
|
+
all state variables. Proceed with fingers crossed.`}),r().filter(e=>n!==void 0&&!n.includes(e)).forEach(e=>i?.({kind:`warning`,code:St.subscriptMissingVariable,text:`The subscript of the next-state relation specified by the specification\ndoes not seem to contain the state variable ${e}`})),o.length>0)throw new g(`The specification contains more than one conjunct of the form [][Next]_v,
|
|
1790
|
+
but TLC can handle only specifications with one next-state relation.`);o.push({expression:c.expression.action,scope:e.scope});return}if(c.kind===`Always`&&c.expression.kind!==`Let`&&c.expression.kind!==`Label`&&Xx(c.expression,e.scope,t)<2)throw y(new _(`TLC cannot handle the temporal formula ${V(c.expression)}`),b.error);let f=Xx(c,e.scope,t);if(f===3)u!==void 0&&e.path.includes(u)||(d=!0),s.push(e);else{if(f===2)throw new g(`TLC cannot handle this conjunct of the spec:\n${V(c)}`);a.push(e)}});let f=[...a,...o],p=e=>`$specification${e}`,m=f.reduce((e,t,n)=>t.scope===void 0?e:{name:p(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),h=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:p(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:a.length===0?void 0:{kind:`And`,operands:a.map(h),location:WS},next:o.length===0?void 0:h(o[0],a.length),scope:m,temporals:s,isPropertyFairness:s.length>0&&!d}},iC=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=ZS(`property`,e,t);if(!i)return;Xx(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;Qx(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(nC(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&Xx(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!k(e)?og(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=Xx(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2){let e=V(i),t=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,n=i.kind===`BoxAction`?`To check that action ${a} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${e} (compare page 90 of ${t}).`:i.kind===`AngleAction`?`To check that infinitely many ${a} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${e} (compare page 91 of ${t}).`:`To check that action ${a} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${e}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${t}).`;throw new g(`The formula ${a} at ${e} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${n}`)}r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},aC=(e,t,n)=>t.flatMap(t=>ZS(e,t,n)?[{name:t,expression:GS(t),scope:void 0}]:[]),oC=(e,t)=>{let n=og(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},sC=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new g(`_POSSIBLE lists ${n} more than once`);XS(`possible`,n,t);let i=GS(n);if(Xx(i,void 0,t)===3)throw new g(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),cC=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||k(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},lC=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=og(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},uC=(e,t)=>e.flatMap(e=>tC(e.expression,t).map(n=>{let r=e.scope===void 0?Qu(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:cC(n,r,t),predicate:lC(e.expression,t)}})),dC=(e,t,n)=>{let r=e.variables;if(!n||!r)return!1;for(let e=0;e<r.length;e++)if(t[r[e]]!==n[r[e]])return!1;return!0},fC=/[\u0100-\uffff]/,pC=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),mC=e=>e.kind===`String`?fC.test(e.value):e.kind===`Set`&&e.elements.some(mC),hC=e=>e.kind===`String`&&fC.test(e.value)||e.kind===`Apply`&&pC.has(e.operator)||gt(e).some(hC),gC=(e,t)=>e.constants.some(e=>mC(e.value)||(e.args??[]).some(mC))||[...t.definitions.values()].some(e=>hC(e.body)||e.kind===`Function`&&e.bounds.some(e=>hC(e.set))),_C=e=>{if(!ln(e))return;let t=_n(F(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},vC=(e,t,n,r)=>{let i=n===1?`the next-state action`:`action ${t} of the next-state relation`,a=r===`1.7.4`?`assigned`:`defined`;return`Successor state is not completely specified by ${i}. The following variable${e.length>1?`s are`:` is`} not ${a}: ${e.join(`, `)}.\n`},yC=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),bC=(e,t,n)=>tg(U(e,t),n),xC=(e,t,n=CC)=>{let r=U(e,t);if(typeof r!=`boolean`)throw new _(n(e,t.environment));return r},SC=(e,t,n)=>{let r=t.kind===`Identifier`?og(t.name,n):void 0,i=r?.kind===`Operator`?r.body:t,a=r?.kind===`Operator`?r.bodyRange:void 0;return`TLC expected a ${e} value, but did not find one. ${a&&i.kind!==`Number`?Fh(a):Rh(i)}`},CC=(e,t)=>SC(`boolean`,e,t),wC=(e,t)=>xC(e.expression,t,(n,r)=>(xC(e.predicate,t),CC(n,r))),TC=()=>{},EC=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=bC(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),DC=(e,t)=>{try{return e(yC(t,void 0,void 0))?void 0:{message:void 0}}catch(e){if(e instanceof _)return{message:e.message};throw e}},OC=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=DC(e=>ag(U(n.expression,e),n.expression),t);if(e)return{name:Rh(n.expression),trace:[],message:e.message}}},kC=e=>{let t=typeof e.config==`string`?ht(e.config,e.version):e.config,n=Gb(e.source,e.loadModule);On(n.getStringOrder(t)),Nn(e),lo(e.fingerprintPolynomial??0);let r=sx(t,{source:e.source,loadModule:e.loadModule,order:n,loadClass:e.loadClass,print:e.onPrint??console.log,files:{readFile:e.readFile,writeFile:e.writeFile,makeDirectory:e.makeDirectory},seed:e.seed,isTool:e.isTool,traceFile:e.traceSpec?.traceFile,isSanyReported:e.isSanyReported,isWarningEnabled:e.isWarningEnabled,version:e.version,moduleOperators:e.moduleOperators});$S(r,t,e.onProgress);let i=r.environment;return i.runtime.getSpecification=()=>jS(t,i,r.variableLocations,r.instanceActions),{config:t,specification:r,environment:i,search:MC(t,i,r.variableLocations,()=>n.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators)}},AC=(e,t,n)=>{let r=OC(e,t);if(!r)return;if(r.message===void 0){let e=`Assumption ${r.name} is false.`;return n(St.assumptionFalse,e,e),b.assumptionViolation}let i=`Evaluating assumption ${r.name} failed.\n${r.message}`;return n(St.assumptionEvaluationError,i,Ft(St.assumptionEvaluationError,i,!0)),b.assumptionViolation},jC=e=>y(new _(`${i}Could not find operator: ${e.operator} in module: ${e.module}`),b.error),MC=(e,t,n,r,a,o=[])=>{let s=e=>o.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw jC(e);return{name:e.operator,key:e.key}}),c=eC(e.invariants,t),l=rC(e,t,n,r,a),u=iC(e,t,a),d=e.properties[0],f=d&&og(d,t)?.location.range,p=e.specification,m=p&&og(p,t)?.location.range;l.isPropertyFairness&&f&&m&&a?.({kind:`warning`,code:St.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${d} at ${Fh(f)} equals\nthe fairness constraints of the behavior specification ${p} at ${Fh(m)}.\nTherefore, checking whether ${p} => ${d} using TLC will never result in a violation of ${d}.`});let h=uC([...c,...u.invariants],t),ee=[...new Map(h.map(e=>[e.predicate,e])).values()],te=h.length>0||u.actionProperties.length>0||u.liveness.length>0;if(l.init===void 0&&(te||u.initialPredicates.length>0||t.variables.length>0))throw new g(t.runtime.version===`1.7.4`?Dt:`The configuration file did not specify the initial state predicate.`);if(l.next===void 0&&te)throw new g(`The configuration file did not specify the next state predicate.`);let ne=aC(`constraint`,[...e.constraints,...s(`constraint`).map(e=>e.name)],t),v=uC(ne,t),re=aC(`action constraint`,e.actionConstraints,t),ie=t.coverage,ae=(e,n,r=!0)=>n.flatMap(n=>{if(!ie)return[];let i=r?lC(n.expression,t):n.expression,a=Co(r?n.name:void 0,i,t),o=xo(ie,e,a,i,n.scope);return[{expression:i,scope:n.scope,node:o}]}),oe=[...ae(`invariant`,c),...ae(`invariant`,u.invariants,!1)],se=ae(`constraint`,re),ce=ae(`constraint`,ne),le=ae(`implied`,u.initialPredicates,!1),ue=ae(`implied`,u.actionProperties.map(e=>({...e,expression:e.box})),!1),de=(e,n,r,i)=>{try{return Io(e,n.node,()=>U(n.expression,yC(t,r,i,n.scope)))}catch{return}},x=(e,t,n)=>ie!==void 0&&e.every(e=>de(ie,e,t,n)===!0),S=(e,t,n)=>{if(ie){for(let r of e){let e=de(ie,r,t,n);if(typeof e!=`boolean`)return;if(!e)return ie.primary[r.node]++,!1;ie.secondary[r.node]++}return!0}};e.rlReward!==void 0&&qS(`rlreward`,e.rlReward,t),e.periodic!==void 0&&qS(`periodic`,e.periodic,t);let C=sC(e.possible,t);if(t.variables.length===0)return;let w=e.symmetry===void 0?void 0:zS(e.symmetry,t,e.substitutions),fe=e.view===void 0?void 0:XS(`view function`,e.view,t),pe=e.view??s(`view`)[0]?.name,me=pe===void 0?void 0:{name:pe,expression:GS(pe),scope:void 0},he=u.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:WS};return{...e,unchanged:t}}),ge=e=>Xx(e.expression,void 0,t)>=2,_e=C.filter(e=>!ge(e)),ve=C.filter(ge),ye=t.runtime,T,be=()=>{if(T)return T;let e=r(),n=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return T=t.variables.map((e,t)=>t).sort((e,t)=>n(e)-n(t)),T},xe=(e,n)=>U(e,yC(t,n,void 0)),Se=e=>{let t=be(),n=w===void 0?e:US(e,w,t);return mo(me===void 0?t.map(e=>n[e]):[xe(me.expression,n)])},Ce=/* @__PURE__ */ new WeakSet,E=(e,n,r)=>{let i=r&&!Ce.has(r)?r:void 0;if(dC(e,n,i))return!1;try{let r=yC(t,n,void 0,e.scope),a=e.membership;return i&&a?!ea(n[a.variable],i[a.variable],U(a.set,r)):!wC(e,r)}catch(t){throw r?Vt(y(t,b.safetyEvaluationFailure),St.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},we=gC(e,t);ye.getFingerprint=Se;let Te=()=>{let e=C.find(e=>!ye.possibleCounts.get(e.name));if(!e)return;let n=oC(e.name,t),r=n?` at ${Fh(n)}`:``;return{name:e.name,code:St.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:A(I(Cf(ye),!0))}},Ee=fe?.body.kind===`Tuple`?fe.body.elements:[],De=Ee.flatMap(e=>e.kind===`Identifier`&&t.variables.includes(e.name)?[e.name]:[]),Oe=fe?.body.kind===`Tuple`&&De.length===Ee.length&&new Set(De).size===De.length,ke=(e,n)=>Oe?be().filter(e=>De.includes(t.variables[e])).map(e=>`/\\ ${t.variables[e]} = ${A(I(n[e]))}\n`).join(``):A(I(xe(e,n))),Ae=(e,n,r)=>xC(e.expression,yC(t,n,r),e=>`${i}${CC(e,t)}`),je=e=>{let n=Object.fromEntries(be().map(n=>[t.variables[n],e[n]]));return me===void 0?n:Fn(n,()=>ke(me.expression,e))};return{properties:u,spec:l,toRecord:je,evaluateAlias:(e,n,r,i)=>{try{XS(`alias`,e,t);let i=U(GS(e),yC(t,n,r)),a=_C(i);return a===void 0?je(n):Ln(a,e)}catch(e){if(!(e instanceof g||e instanceof _))throw e;return{...je(n),_ALIASEvalError:It(e.message,i)}}},isSymmetric:w!==void 0,isConstrained:v.length>0||re.length>0,getTlcOrder:be,getStoredFingerprints:(e,t)=>me!==void 0||we?BigInt64Array.from(e,Se):ho(t,be()),getFingerprintState:e=>{if(we)return[String(Se(e))];let t=w===void 0?e:US(e,w,be());return me===void 0?t:[xe(me.expression,t)]},findViolatedInvariant:(e,t)=>{if(x(oe,e))return;let n=h.find(n=>E(n,e,t));return n&&Ce.add(e),n},getViolatedInvariants:e=>{let t=ee.filter(t=>h.some(n=>n.predicate===t.predicate&&E(n,e,void 0)));return t.length>0&&Ce.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>xC(n,yC(t,e,void 0,r));v.every(e=>r(e.predicate,e.scope))&&n();let i=ee.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=u.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(v.every(e=>xC(e.predicate,yC(n,t,void 0,e.scope)))&&re.every(r=>xC(r.expression,yC(n,e,t,r.scope))))||r())||ee.every(e=>xC(e.predicate,yC(n,t,void 0,e.scope))))&&he.every(r=>xC(r.box,yC(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>S(ce,e)??v.every(r=>dC(r,e,n)||wC(r,yC(t,e,void 0))),findFailedInitialPredicate:e=>x(le,e)?void 0:u.initialPredicates.find(n=>!xC(n.expression,yC(t,e,void 0,n.scope))),findViolatedActionProperty:(e,n)=>x(ue,e,n)?void 0:he.find(r=>{try{return!xC(r.action,yC(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${V(r.box)}`)&&!bC(r.unchanged,yC(t,e,n,r.scope),`a subscript`)}catch(e){throw Vt(NC(e),St.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>S(se,e,t)??re.every(n=>Ae(n,e,t)),getExcludingConstraints:(e,n)=>[...v.filter(e=>!wC(e,yC(t,n,void 0))),...re.filter(t=>!Ae(t,e,n))].map(e=>{let n=oC(e.name,t);return n?Fh(n):e.name}),trackStatePossible:_e.length===0?TC:e=>EC(_e,ye,yC(t,e,void 0)),trackActionPossible:ve.length===0?TC:(e,n)=>EC(ve,ye,yC(t,e,n)),findUnwitnessedPossible:Te,getReward:(n,r,i)=>{if(e.rlReward===void 0)return i;let a=GS(e.rlReward),o=U(a,yC(t,n,r));if(typeof o!=`number`)throw new _(SC(`integer`,a,t));return o},findPostconditionViolation:(n=!1)=>{let r=s(`postcondition`),i=e.postconditions.map(e=>{let n=og(e,t);return n?n.kind===`Operator`&&n.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!JS(n)&&Pg(n,t)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(i!==void 0){if(n)return;throw y(new _(i),b.configParseError)}let a=(e,n)=>{let r=DC(e=>xC(GS(n),e),t);if(!r)return;let i=og(n,t)?.body,a=oC(n,t),o=a?` at ${i?.kind===`Number`?Rh(i):Fh(a)}`:``;return r.message===void 0?{name:e,code:St.postconditionFalse,message:`Postcondition ${e}${o} is false.`}:{name:e,code:St.postconditionFailed,message:`Evaluating postcondition ${e}${o} failed.\n${r.message}`}};for(let e of r){let t=a(e.name,e.key);if(t)return t}let o=Te();if(o)return o;for(let t of e.postconditions){let e=a(t,t);if(e)return e}}}},NC=e=>e instanceof c?y(e,e.exitCode):e,PC=(e,t)=>e*((t-e)/2**64),FC=e=>e.includes(`.`)?e:`${e}.0`,IC=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return FC(String(e));let[n,r]=e.toExponential().split(`e`);return`${FC(n)}E${r.replace(`+`,``)}`},LC=e=>e!==void 0&&e>=`0`&&e<=`9`,RC=e=>{if(e===0)return`0.0`;let t=IC(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;LC(t[n.next]);)n.result+=t[n.next++],n.digits++;if(n.next===t.length)return n.result;if(t[n.next]!==`.`)return t;if(n.next++,n.digits>=2)for(;LC(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;LC(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(LC(t[n.next])&&Number(t[n.next])>=5&&(n.result=zC(n.result));LC(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},zC=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${zC(r)}.`:n===`9`?`${zC(r)}0`:`${r}${Number(n)+1}`},BC=e=>{let t={value:0};for(;10n**BigInt(t.value+1)<e*10n;)t.value++;let n=10n**BigInt(t.value+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t.value+1}`)},VC=(e,t,n)=>{if(PC(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a={narrow:1/0,wide:9223372036854775807n};for(let e=1;e<r.length;e++){let t=i[2*e+1],n=i[2*e-1];if(t<0!=n<0)continue;let o=t-n;if(o<=1048576){let t=o*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a.narrow=Math.min(a.narrow,t)}else{let t=r[e]-r[e-1];t<a.wide&&(a.wide=t)}}if(a.narrow===1/0)return a.wide;let o=BigInt(a.narrow);return o<a.wide?o:a.wide},HC=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a={count:0},o=n.find(t=>(a.count+=e[t],a.count>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},UC=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},WC=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^wa(e[t]),16777619),r=Math.imul(r^Aa(e[t]),1540483477);t[0]=UC(n)||1,t[1]=UC(r)},GC=()=>{let e=/* @__PURE__ */ new Int32Array(8192),t=0,n=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},r=()=>{let t=e,r=new Int32Array(t.length*2);for(let e=0;e<t.length;e+=2){if(t[e]===0)continue;let i=n(r,t[e],t[e+1]);r[i*2]=t[e],r[i*2+1]=t[e+1]}e=r};return{insert:(i,a)=>{t*4>=e.length&&r();let o=n(e,i,a);return e[o*2]!==i&&(e[o*2]=i,e[o*2+1]=a,t++,!0)}}},KC=(e,t)=>{let n=e.length-1;for(let r=Number(t>>32n)&n;;r=r+1&n){let n=Atomics.load(e,r);if(n===t)return!1;if(n!==0n)continue;let i=Atomics.compareExchange(e,r,0n,t);if(i===0n)return!0;if(i===t)return!1}},qC=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),JC=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return KC(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},YC=e=>Atomics.load(e.used,0)*2>=e.slots.length,XC=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&KC(t,n);return{slots:t,used:e.used}},ZC=[void 0,`lambda`,`tuple`,`record`],QC=()=>{let e=/* @__PURE__ */ new Int32Array(1024),t=0,n=0,r=[],i=/* @__PURE__ */ new Map,a=n=>{if(t===e.length){let t=new Int32Array(e.length*2);t.set(e),e=t}e[t++]=n},o=e=>{let t=i.get(e);if(t!==void 0)return a(t);i.set(e,r.length),a(r.length),r.push(e)},s=e=>{if(typeof e==`boolean`)return a(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(a(2),a(e),!0);if(typeof e==`string`)return a(3),o(e),!0;if(e.kind===`ModelValue`)return a(4),o(e.name),!0;if(e.kind===`Set`)return a(5),a(e.elements.length),e.elements.every(s);if(e.kind===`Function`){let t=da(e.domain);return t?(a(7),a(ZC.indexOf(ir(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(ZC.indexOf(ir(e))),a(e.domain.length),e.domain.every(s)&&e.range.every(s))}return!1};return{encode:e=>{let r=t;return e.every(s)?(n++,!0):(t=r,!1)},finish:()=>({words:e.slice(0,t),strings:r,count:n})}},$C=e=>t=>{let n=t.words,r=0,i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r++];if(e===3)return t.strings[n[r++]];if(e===4)return Zn(t.strings[n[r++]]);if(e===5)return $n(i(n[r++]));let a=ZC[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=ui({kind:`Interval`,low:e,high:e+t-1});return rr(tr(o,i(t)),a)}let o=n[r++],s=i(o);return rr(tr(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Eh as $,gt as $t,tS as A,Sa as At,nb as B,St as Bt,kS as C,ha as Ct,jS as D,qa as Dt,DS as E,pi as Et,Ux as F,wa as Ft,p_ as G,zt as Gt,sb as H,Et as Ht,yx as I,mr as It,og as J,Zt as Jt,V as K,Rt as Kt,Bx as L,dr as Lt,eS as M,Qn as Mt,mx as N,tn as Nt,oS as O,I as Ot,$ as P,An as Pt,Dh as Q,Jt as Qt,sx as R,On as Rt,NC as S,lo as St,ES as T,Zn as Tt,ob as U,Ft as Ut,ib as V,Ct as Vt,Cy as W,It as Wt,a_ as X,Nt as Xt,o_ as Y,qt as Yt,Th as Z,Ht as Zt,vC as _,zo as _t,XC as a,Tm as at,QS as b,Zo as bt,WC as c,ap as ct,VC as d,Of as dt,ht as en,kh as et,PC as f,Zd as ft,OC as g,Mo as gt,MC as h,xo as ht,qC as i,Ae as in,wm as it,nS as j,Ca as jt,Wx as k,kn as kt,RC as l,Xf as lt,jC as m,tc as mt,QC as n,Je as nn,Em as nt,JC as o,ip as ot,HC as p,tf as pt,Fh as q,Mt as qt,GC as r,Te as rn,Cm as rt,YC as s,rp as st,$C as t,rt as tn,Oh as tt,BC as u,Tf as ut,kC as v,vo as vt,AS as w,_r as wt,$S as x,mo as xt,AC as y,Co as yt,Gb as z,Nn as zt};
|