tla-ts 0.0.9-dev.2813db5 → 0.0.9-dev.4ce0657
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +21 -0
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +15 -15
- package/dist/deciders.js +48 -48
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +1 -0
- package/dist/index.d.ts +1 -0
- package/dist/index.js +1 -1
- package/dist/prove.cjs +16 -16
- package/dist/prove.js +20 -20
- package/dist/run.cjs +28 -28
- package/dist/run.js +31 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +1 -1
- package/dist/transfer.cjs +18 -18
- package/dist/transfer.js +26 -26
- package/dist/worker.cjs +4 -4
- package/dist/worker.js +4 -4
- package/package.json +3 -1
- package/src/check.ts +44 -31
- package/src/cli/options.ts +1 -1
- package/src/cli/tlc.ts +17 -8
- package/src/cli/typescript.ts +26 -0
- package/src/environment.ts +4 -0
- package/src/errors.ts +15 -0
- package/src/evaluate.ts +65 -10
- package/src/instances.ts +67 -6
- package/src/liveness-checker.ts +6 -3
- package/src/liveness.ts +7 -3
- package/src/prover/smt/solver/solver.ts +31 -27
- package/src/successors.ts +3 -3
- package/src/typescript/actions.ts +494 -0
- package/src/typescript/collections.ts +615 -0
- package/src/typescript/compile.ts +70 -0
- package/src/typescript/context.ts +106 -0
- package/src/typescript/emit.ts +122 -0
- package/src/typescript/expressions.ts +508 -0
- package/src/typescript/formula.ts +160 -0
- package/src/typescript/functions.ts +295 -0
- package/src/typescript/model.ts +164 -0
- package/src/typescript/names.ts +116 -0
- package/src/typescript/program.ts +51 -0
- package/src/typescript/properties.ts +141 -0
- package/src/typescript/scope.ts +117 -0
- package/src/typescript/steps.ts +175 -0
- package/src/typescript/types.ts +178 -0
- package/src/values.ts +11 -9
package/dist/transfer.js
CHANGED
|
@@ -6,15 +6,15 @@
|
|
|
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{A as e,B as t,C as n,D as r,F as i,
|
|
10
|
-
`,t:` `,r:`\r`,f:`\f`},
|
|
11
|
-
`),a={index:t.index,line:i.length,lineStart:t.index-i[i.length-1].length,moduleDepth:0},o={lineStart:-1,position:0,width:0},s=()=>{for((o.lineStart!==a.lineStart||o.position>a.index)&&(o.lineStart=a.lineStart,o.position=a.lineStart,o.width=0);o.position<a.index;o.position++)o.width=
|
|
12
|
-
`,a.index);u((t===-1?e.length:t)-a.index);continue}if(t===40&&e.charCodeAt(a.index+1)===42){let t={value:0};do{if(a.index>=e.length)throw d(`Unterminated comment`);e.startsWith(`(*`,a.index)?(t.value++,u(2)):e.startsWith(`*)`,a.index)?(t.value--,u(2)):u(1)}while(t.value>0);continue}if(t===45&&e.startsWith(`----`,a.index)){let t=
|
|
9
|
+
import{A as e,B as t,C as n,D as r,F as i,G as a,H as o,I as s,L as c,O as l,P as u,R as d,V as f,W as p,_ as m,g as h,h as g,j as _,q as v,u as y,v as b,y as ee,z as x}from"./worker.js";const te=/* @__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(`.`)),ne=/* @__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`]]),re=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),ie=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),ae=/* @__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`]]),oe=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),se=e=>e.startsWith(`\\`)?parseInt(e.slice(2),oe.get(e[1].toLowerCase())):Number(e),ce=/-{4,}[ \t]*MODULE\b/,le=/* @__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)le[n.charCodeAt(0)]|=e});const ue=(e,t)=>e<128&&(le[e]&t)!==0,de=(e,t,n)=>{let r=t;for(;ue(e.charCodeAt(r),n);)r++;return r},S=/* @__PURE__ */ new Map;ie.forEach(e=>{let t=e.charCodeAt(0),n=S.get(t)??[];n.push(e),S.set(t,n)});const C=(e,t)=>{let n=S.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]}},w=(e,t)=>{if(e.charCodeAt(t)<128)return;let n=e.slice(t,t+2);if(ae.has(n))return n;let r=e[t];return ae.has(r)?r:void 0},T=(e,t)=>{let n=e.charCodeAt(t);if(n===92&&ue(e.charCodeAt(t+1),2)){let n=e.slice(t+1,de(e,t+1,2)),r={value:n.length};for(;r.value>0&&!ne.has(n.slice(0,r.value));)r.value--;let i=ne.get(n.slice(0,r.value));return{text:i??`\\`,length:i===void 0?1:r.value+1}}let r=w(e,t);if(r!==void 0)return{text:ae.get(r)??``,length:r.length};let i=C(e,t);return i?{text:re.get(i)??i,length:i.length}:n===92?{text:`\\`,length:1}:void 0},fe=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),pe=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>ae.has(e)||fe.has(e));return n===void 0?void 0:{text:n,length:n.length}},me=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},he=(e,t)=>{let n=e[t+1]===`+`||e[t+1]===`*`?t+2:de(e,t+1,1);if(n===t+1||e[n]!==`>`)return 0;let r=de(e,n+1,7),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return me(e,i?r+1:r,e=>e===`.`)-t},ge=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,_e={n:`
|
|
10
|
+
`,t:` `,r:`\r`,f:`\f`},ve=(e,t)=>t===9?e+8-e%8:e+1,ye=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),E=(e,t)=>{if(e.charCodeAt(t)!==92)return 0;let n=ye.get(e.charAt(t+1).toLowerCase());if(n===void 0)return 0;let r=de(e,t+2,n);return r===t+2?0:r-t},be=e=>{let t=ce.exec(e);if(!t)throw new l(`Expected a module header such as ---- MODULE Name ----`);let n=[],r=/* @__PURE__ */ new Map,i=e.slice(0,t.index).split(`
|
|
11
|
+
`),a={index:t.index,line:i.length,lineStart:t.index-i[i.length-1].length,moduleDepth:0},o={lineStart:-1,position:0,width:0},s=()=>{for((o.lineStart!==a.lineStart||o.position>a.index)&&(o.lineStart=a.lineStart,o.position=a.lineStart,o.width=0);o.position<a.index;o.position++)o.width=ve(o.width,e.charCodeAt(o.position));return ve(o.width,e.charCodeAt(a.index))},c=(e,t,r,i)=>{let o=s();n.push({kind:e,text:t,spelling:i,line:a.line,column:o,endColumn:o+r-1}),a.index+=r},u=t=>{for(let n=0;n<t;n++)e.charCodeAt(a.index)===10&&(a.line++,a.lineStart=a.index+1),a.index++},d=t=>new l(`${t} at line ${a.line}, column ${s()}`,void 0,{reason:t,line:a.line,column:s(),isEnd:a.index>=e.length});for(;a.index<e.length;){let t=e.charCodeAt(a.index);if(t===10||t===32||t===9||t===13){u(1);continue}if(t===92&&e.charCodeAt(a.index+1)===42){let t=e.indexOf(`
|
|
12
|
+
`,a.index);u((t===-1?e.length:t)-a.index);continue}if(t===40&&e.charCodeAt(a.index+1)===42){let t={value:0};do{if(a.index>=e.length)throw d(`Unterminated comment`);e.startsWith(`(*`,a.index)?(t.value++,u(2)):e.startsWith(`*)`,a.index)?(t.value--,u(2)):u(1)}while(t.value>0);continue}if(t===45&&e.startsWith(`----`,a.index)){let t=me(e,a.index,e=>e===`-`)-a.index;e.slice(a.index+t).trimStart().startsWith(`MODULE`)&&a.moduleDepth++,c(`Separator`,`----`,t);continue}if(t===61&&e.startsWith(`====`,a.index)){if(c(`ModuleEnd`,`====`,me(e,a.index,e=>e===`=`)-a.index),a.moduleDepth--,a.moduleDepth<=0)break;continue}if(t===34){let t=a.line,r=s(),i=[];for(u(1);e.charCodeAt(a.index)!==34;){let t=e.charCodeAt(a.index);if(a.index>=e.length||t===10||t===13)throw d(`Unterminated string`);if(t===92){let t=e[a.index+1];if(t===void 0||!`ntrf\\"`.includes(t))throw d(`Invalid escape in string`);i.push(_e[t]??t),u(2)}else i.push(e[a.index]),u(1)}u(1),n.push({kind:`String`,text:i.join(``),line:t,column:r,endColumn:s()-1});continue}let i=E(e,a.index);if(i>0){c(`Number`,e.slice(a.index,a.index+i),i);continue}if(ue(t,7)){let n=de(e,a.index,7),i=e.slice(a.index,n),o=de(e,a.index,1);if(o===n){let t=e.charCodeAt(n)===46?de(e,n+1,1):n,r=t>n+1,o=r?e.slice(a.index,t):i;c(r?`Decimal`:`Number`,o,o.length);continue}if(!/[A-Za-z]/.test(i)){let n=t===95?`_`:e.slice(a.index,o);c(n===`_`?`Operator`:`Number`,n,n.length);continue}if(i.startsWith(`WF_`)||i.startsWith(`SF_`)){c(`Keyword`,i.slice(0,3),3);continue}let s=r.get(i)??i;r.set(s,s),c(te.has(i)?`Keyword`:`Identifier`,s,i.length);continue}let o=e[a.index];if(t>=128&&fe.has(o)){c(`Identifier`,r.get(o)??o,1),r.set(o,o);continue}if(t===60){let t=he(e,a.index);if(t>0){c(`Step`,e.slice(a.index,a.index+t),t);continue}}let l=T(e,a.index);if(l){let t=e.slice(a.index,a.index+l.length);c(`Operator`,l.text,l.length,t===l.text?void 0:t)}else throw d(`Unexpected character ${JSON.stringify(o)}`)}let f=s();return n.push({kind:`End`,text:``,line:a.line,column:f,endColumn:f}),n},xe=[[`EOF`],[`BEGIN_PRAGMA`,`--->`],[`_BM1`],[`NUMBER`],[`_BM2`],[`_BM0`],[`SEPARATOR`],[`END_MODULE`],[`ACTION`,`ACTION`,`ACTIONS`],[`ASSUME`,`ASSUME`],[`BOXASSUME`,`[]ASSUME`],[`ASSUMPTION`,`ASSUMPTION`,`AXIOM`],[`CASE`,`CASE`],[`CHOOSE`,`CHOOSE`],[`CONSTANT`,`CONSTANT`,`CONSTANTS`],[`ELSE`,`ELSE`],[`EXCEPT`,`EXCEPT`],[`EXISTS`,`\\E`,`\\exists`,`∃`],[`EXTENDS`,`EXTENDS`],[`FORALL`,`\\A`,`\\forall`,`∀`],[`IF`,`IF`],[`INSTANCE`,`INSTANCE`],[`LET`,`LET`],[`LETIN`,`IN`],[`LOCAL`,`LOCAL`],[`MODULE`,`MODULE`],[`NEW`,`NEW`],[`OTHER`,`OTHER`],[`PROPOSITION`,`PROPOSITION`,`LEMMA`,`COROLLARY`],[`SF`,`SF_`],[`T_EXISTS`,`\\EE`],[`T_FORALL`,`\\AA`],[`THEN`,`THEN`],[`BY`,`BY`],[`ONLY`,`ONLY`],[`DEFINE`,`DEFINE`],[`DF`,`DEF`,`DEFS`],[`THEOREM`,`THEOREM`],[`USE`,`USE`],[`HIDE`,`HIDE`],[`HAVE`,`HAVE`],[`OBVIOUS`,`OBVIOUS`],[`OMITTED`,`OMITTED`],[`LAMBDA`,`LAMBDA`],[`TAKE`,`TAKE`],[`PROOF`,`PROOF`],[`PROVE`,`PROVE`],[`BOXPROVE`,`[]PROVE`],[`QED`,`QED`],[`RECURSIVE`,`RECURSIVE`],[`STATE`,`STATE`],[`TEMPORAL`,`TEMPORAL`,`TEMPORALS`],[`PICK`,`PICK`],[`WITNESS`,`WITNESS`],[`SUFFICES`,`SUFFICES`],[`VARIABLE`,`VARIABLE`,`VARIABLES`],[`WF`,`WF_`],[`WITH`,`WITH`],[`COMMA`,`,`],[`COLON`,`:`],[`COLONCOLON`,`::`,`∷`],[`DOT`,`.`],[`US`,`_`],[`DEF`,`==`,`≜`],[`LBR`,`(`],[`RBR`,`)`],[`DEFBREAK`,`-|-`],[`LSB`,`[`],[`ARSB`,`]_`],[`RSB`,`]`],[`LBC`,`{`],[`RBC`,`}`],[`LAB`,`<<`,`⟨`],[`ARAB`,`>>_`,`⟩_`],[`RAB`,`>>`,`⟩`],[`BANG`,`!`],[`ARROW`,`->`,`→`],[`SUBSTITUTE`,`<-`,`←`],[`MAPTO`,`|->`,`↦`],[`NUMBER_LITERAL`],[`STRING_LITERAL`],[`BAND`],[`BOR`],[`op_57`,`'`],[`op_68`,`^+`,`⁺`],[`op_69`,`^*`],[`op_70`,`^#`],[`op_76`,`-.`],[`op_26`,`\\lnot`,`¬`],[`op_29`,`\\neg`],[`op_58`,`~`],[`CASESEP`,`[]`,`□`],[`op_61`,`<>`,`◇`],[`op_112`,`ENABLED`],[`op_113`,`UNCHANGED`],[`op_114`,`SUBSET`],[`op_115`,`UNION`],[`op_116`,`DOMAIN`],[`op_1`,`//`],[`AND`,`/\\`,`∧`],[`op_3`,`/=`],[`op_4`,`/`],[`OR`,`\\/`,`∨`],...[`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`].map(e=>[`infix`,e]),[`IN`,`\\in`,`∈`],...(/* @__PURE__ */ `\\intersect.\\union.\\land.\\leq.\\ll.\\lor.\\o.\\odot.\\ominus.\\oplus.\\oslash.\\otimes.\\prec.\\preceq.\\propto.\\sim.\\simeq.\\sqcap.\\sqcup.\\sqsubset.\\sqsupset.\\sqsubseteq.\\sqsupseteq.\\star.\\subset.\\subseteq.\\succ.\\succeq.\\supset.\\supseteq.\\uplus.\\wr.\\.~>.=>.=<.=|`.split(`.`)).map(e=>[`infix`,e]),[`EQUALS`,`=`],...[`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`].map(e=>[`infix`,e]),[`op_77`,`-`],...[`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`].map(e=>[`infix`,e]),[`op_119`,`\\X`],[`IDENTIFIER`],[`ProofStepLexeme`],[`ProofImplicitStepLexeme`],[`ProofStepDotLexeme`],[`BareLevelLexeme`],[`UnnumberedStepLexeme`]],Se=xe.map(e=>e[0]),Ce=new Map(Se.map((e,t)=>[e,t]).reverse()),D=e=>{let t=Ce.get(e);if(t===void 0)throw new h(`Unknown SANY token kind ${e}`);return t},we=new Map(xe.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),Te=Math.max(...[...we.keys()].map(e=>e.length)),Ee=Array.from({length:Te},(e,t)=>Te-t),De=/----+ *MODULE/y,Oe=[/_\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],ke=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`)),Ae=ke(String.raw`\.\/\\`),je=ke(String.raw`\.\\\/`),Me=String.raw`<(?:[0-9]+|\+|\*)>`,Ne=[[`_BM0`,[De]],[`SEPARATOR`,[/----+/y]],[`END_MODULE`,[/====+/y]],[`NUMBER_LITERAL`,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[`STRING_LITERAL`,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[`BAND`,Ae],[`BOR`,je],[`IDENTIFIER`,Oe],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${Me}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(Me,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${Me}(?:\*\.*|-\.*|\.+)`,`y`)]]],Pe=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[De]]],Fe=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[De]],[`BAND`,Ae],[`BOR`,je],[`IDENTIFIER`,Oe]],Ie=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),Le=(e,t,n)=>e.map(([e,r])=>({kind:D(e),length:Math.max(...r.map(e=>Ie(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),Re=(e,t)=>{let n=Ee.find(n=>we.has(e.slice(t,t+n))),r=Le(Ne,e,t);if(n===void 0)return r;let i={kind:we.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},ze=e=>e+8-e%8,Be=e=>{let t=[],n=[],r={line:1,column:0,isAfterCr:!1,isAfterLf:!1};for(let i of e)for(let e=0;e<i.length;e++)r.column++,r.isAfterLf?(r.isAfterLf=!1,r.line++,r.column=1):r.isAfterCr&&(r.isAfterCr=!1,i===`
|
|
13
13
|
`?r.isAfterLf=!0:(r.line++,r.column=1)),i===`\r`?r.isAfterCr=!0:i===`
|
|
14
|
-
`?r.isAfterLf=!0:i===` `&&(r.column=
|
|
15
|
-
`||e[a]===`\r`?
|
|
16
|
-
\r`.includes(e[t]))n.offset++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=o();if(e!==void 0)return e}else{let i=
|
|
17
|
-
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),
|
|
14
|
+
`?r.isAfterLf=!0:i===` `&&(r.column=ze(r.column-1)),t.push(r.line),n.push(r.column);return{lines:t,columns:n}},Ve=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,O=new Set([...we.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),He=(e,t)=>{let n=0;for(;O.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,Ie(Ve,e,t)))},Ue=e=>{let t=Be(e),n={offset:0,mode:`DEFAULT`},r=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),i=()=>r(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?Ke(o,s,e[a],i):t.lines[n]===o?e[a]===`
|
|
15
|
+
`||e[a]===`\r`?Ke(o+1,0,void 0,i):Ke(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=Le(t,e,n.offset);if(i.length>0){let e=r(i.kind,n.offset,i.length);return n.offset+=i.length,Se[i.kind].startsWith(`_BM`)&&(n.mode=`SPEC`),Se[i.kind]===`BEGIN_PRAGMA`&&(n.mode=`PRAGMA`),e}n.offset++}return i()};return()=>{if(n.mode===`DEFAULT`)return s(Pe);if(n.mode===`PRAGMA`)return s(Fe);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=Re(e,t);if(i.length===0){let n=He(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()}},We=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
|
|
17
|
+
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),Ge=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>We.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),Ke=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${Ge(n)}" (${n.charCodeAt(0)}), `}after : "${Ge(r)}"`,qe=e=>{let t=Ue(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===` `?ze(e):e+1,e.beginColumn);return Ke(e.beginLine,n,e.image[t],e.image.slice(0,t))}},Je=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`,Ye=`-------------------------------- MODULE Reals -------------------------------
|
|
18
18
|
(***************************************************************************)
|
|
19
19
|
(* This module provides dummy definitions of the operators that are *)
|
|
20
20
|
(* defined by the real Reals module. It is expected that any tool that *)
|
|
@@ -31,7 +31,7 @@ EXTENDS Integers
|
|
|
31
31
|
Real == "Reals"
|
|
32
32
|
a / b == CHOOSE m \\in Real : m * b = a
|
|
33
33
|
Infinity == CHOOSE i : (i \\notin Real) /\\ (\\A r \\in Real : i > r)
|
|
34
|
-
=============================================================================`,
|
|
34
|
+
=============================================================================`,Xe=`----------------------------- MODULE RealTime -------------------------------
|
|
35
35
|
(***************************************************************************)
|
|
36
36
|
(* This standard module is described in Chapter 9 of the book "Specifying *)
|
|
37
37
|
(* Systems". The type of specification described there cannot be handled *)
|
|
@@ -57,7 +57,7 @@ RTnow(v) == LET NowNext == /\\ now' \\in {r \\in Real : r > now}
|
|
|
57
57
|
IN /\\ now \\in Real
|
|
58
58
|
/\\ [][NowNext]_now
|
|
59
59
|
/\\ \\A r \\in Real : WF_now(NowNext /\\ (now'>r))
|
|
60
|
-
=============================================================================`,
|
|
60
|
+
=============================================================================`,Ze=`----------------------------- MODULE Toolbox --------------------------------
|
|
61
61
|
(***************************************************************************)
|
|
62
62
|
(* *)
|
|
63
63
|
(***************************************************************************)
|
|
@@ -83,11 +83,11 @@ _TEPosition ==
|
|
|
83
83
|
THEN _TETraceLength
|
|
84
84
|
ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
|
|
85
85
|
|
|
86
|
-
=============================================================================`,$e=/* @__PURE__ */ new Map([[`Reals`,Xe],[`RealTime`,Ze],[`Toolbox`,Qe]]),et={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},tt=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},nt=e=>e!==void 0&&/^\p{Nd}$/u.test(e),rt=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),it=e=>{let t=t=>{let n=he(e,t,tt);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=he(e,t,nt);if(e.startsWith(`..`,n)&&nt(e[n+2]))return{kind:`Constant`,first:t,last:he(e,n+2,nt)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=nt(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:he(e,t+1,nt)-1,children:[]};if(rt(n))return{kind:`Constant`,first:t,last:he(e,t,rt)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},at=e=>{let t=e.length===0?void 0:it(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=et[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),ee=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||ee===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${ee}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},ot=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,k=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,st=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),A=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),j=e=>typeof e==`object`&&e.kind===`ModelValue`,ct=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),lt=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:k(e)?`set`:`function`,ut=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,dt={isUsed:!1},ft=(e,t)=>(dt.isUsed=!0,e.writtenKeys=t,e),pt=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[xr(e.domain,t)]]),mt=(e,t,n)=>ft(Zn(e,t),n),ht=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(ht);e.writtenKeys=void 0,e.range.forEach(ht)}},gt=e=>e.every(e=>typeof e==`string`),_t=(e,t)=>e.length>0&&t.length>0&>(e)!==gt(t),vt=(e,t)=>{dt.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return _t(n,r)?yn(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=It(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:It(t,n);if(r!==0)return r}return 0},yt=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=It(n[e],r[e]);if(t!==0)return t}return 0},bt=e=>j(e)?e.type:void 0,xt=(e,t,n)=>{let r=bt(e),i=bt(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(j(e)&&j(t)){if(r===void 0||i===void 0||r===i)return;throw new h(`Attempted to ${a} the differently-typed model values ${I(e)} and ${I(t)}`)}throw r===void 0?new h(`Attempted to ${a} the typed model value ${I(t)} and the non-model value\n${I(e)}`):new h(`Attempted to ${a}${n?``:` the`} typed model value ${I(e)} and non-model value\n${I(t)}`)},St={ranks:Object.create(null),size:0},Ct=e=>{St.ranks=Object.create(null),St.size=0,Lt.clear();for(let t of e)Et(t)},wt={is174:!1},Tt=e=>{wt.is174=e===`1.7.4`},Et=e=>(St.ranks[e]===void 0&&(St.ranks[e]=St.size++),e),Dt=()=>St.size,Ot=e=>Object.keys(St.ranks).find(t=>St.ranks[t]===e),kt=e=>St.ranks[Et(e)],At=(e,t)=>{if(e===t)return 0;let n=St.ranks,r=n[e],i=n[t];return r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},jt=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Mt=(e,t)=>(jt(e)||jt(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Nt=(e,t,n)=>{if(!jt(e))throw new h(`Attempted to ${n} the set ${I(M(e)?N(e):e,!0)} with the value:\n${I(t,!0)}`);if(!jt(t))throw new h(`Attempted to compare overridden value ${I(e,!0)} with non-overridden value:\n${I(t,!0)}`);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new h(`Attempted to compare ${I(e,!0)} with the value\n${I(t,!0)}`)},Pt={kind:`InfiniteSet`,name:`Any`},Ft=e=>{throw new h(`Attempted to compare ANY with the value\n${I(e)}`)},It=(e,t)=>{if(e===t)return dt.isUsed&&ht(e),e===Pt?Ft(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return vt(e,t);if(n===`Set`&&r===`Set`)return yt(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&xt(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return xt(e,t,!1),n===`ModelValue`?-1:1;if(e===Pt||t===Pt)return Ft(e===Pt?t:e);if(k(e)&&k(t)&&Mt(e,t))return Nt(e,t,`compare`);let i=k(e);if(i!==k(t))throw new h(`Attempted to compare ${lt(e)} ${I(e)} with ${lt(t)} ${I(t)}`);return i?yt(N(e),N(t)):vt(F(e),F(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return At(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(xt(e,t,!1),j(e))return-1;if(j(t))return 1;throw new h(`Attempted to compare ${lt(e)} ${I(e)} with ${lt(t)} ${I(t)}`)},Lt=/* @__PURE__ */ new Map,Rt=e=>{let t=Lt.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:kt(e),hash:Vr(Hr(Ur(e),109)),fingerprint:Qr($r(e)^60)};return Lt.set(e,n),n},zt=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0,isFingerprinted:!1}),Bt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,isFingerprinted:!1}),Vt={isPresent:!1},Ht=(e,t)=>(t===`lambda`&&(Vt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),Ut=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Wt=e=>Ht(e,`lambda`),Gt=e=>ot(e)&&e.isCached===!0,Kt={isPresent:!1},qt=e=>(Kt.isPresent=!0,e),Jt=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),Yt=e=>{Kt.isPresent&&typeof e==`object`&&ot(e)&&Jt.has(e.kind)&&(e.isCached=!0)},Xt=e=>{(Vt.isPresent||Kt.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(Xt),e.range.forEach(Xt)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Xt):k(e)&&M(e)&&(Yt(e),N(e).elements.forEach(Xt))))},Zt=(e,t)=>{if(Yt(e),e===t)return dt.isUsed&&ht(e),e!==Pt||Ft(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&xt(e,t,!0),It(e,t)===0);if((e.kind===`Set`||e.kind===`Function`)&&(t.kind===`Set`||t.kind===`Function`)&&e.hash!==0&&t.hash!==0&&e.hash!==t.hash)return!1;if(e.kind===`Function`&&t.kind===`Function`)return vt(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return yt(e,t)===0;if(j(e)||j(t))return xt(e,t,!0),j(e)&&j(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Zt(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:Zt(e.domain,t.domain)&&Zt(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]&&Zt(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)=>Zt(e,t.factors[n]));let n=k(e)&&k(t)&&!(M(e)&&M(t));if(n&&Mt(e,t))return Nt(e,t,`check equality of`)===0;if(n){if(!jt(e)){let n=N(e);if(!jt(t))return yt(n,N(t))===0}return ii(e)===ii(t)}return It(e,t)===0},Qt=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):ii(n)===ii(r);return n},$t=Qt(!1),en=Qt(!0),tn=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},nn=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Zr(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||en(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||en(i[e],n))return i[e]}return n.kind===`Set`?tn(n.elements,t):(tn(n.domain,t),tn(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}},rn=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},an=e=>{if(!A(e))return;let t=F(e);return{domain:t.domain,range:t.range,low:rn(t.domain)}},on=e=>{if(!A(e))return;let t=F(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},sn=(e,t)=>(xt(t,e,!1),1),cn=(e,t)=>(xt(t,e,!0),!1),ln=(e,t)=>(e.type!==void 0&&xt(e,t,!1),j(t)?e.rank-t.rank:-1),un=(e,t)=>(e.type!==void 0&&xt(e,t,!0),j(t)&&e.name===t.name),dn={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`}},fn=(e,t,n)=>{let r=dn[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)}`},pn=(e,t,n)=>{let r=an(n);if(!r){if(j(n))return sn(n,t);throw new h(`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=()=>mn(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 mn(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new h(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${I(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},mn=(e,t)=>{for(let n=0;n<e.length;n++){let r=yn(e[n],t[n]);if(r!==0)return r}return 0},hn=(e,t)=>{let n=F(e);if(e.kind===`Function`&&Sr(n)!==void 0){let r=A(t)?Sr(t):void 0;return r?n.range.length-r.length||mn(n.range,r):pn({...n,low:1},e,t)}if(Ut(e)===`record`){let r=on(t);if(!r){if(j(t))return sn(t,e);throw new h(`Attempted to compare record:\n${I(e)}\nwith non-record\n${I(t)}`)}return n.domain.length-r.domain.length||mn(n.domain,r.domain)||mn(n.range,r.range)}return pn({...n,low:rn(n.domain)},e,t)},gn=(e,t)=>jt(e)||jt(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),_n=(e,t)=>{let n=ct(t)?t:N(t);return{elements:N(e).elements,otherElements:N(n).elements}},vn=(e,t)=>{if(gn(e,t))return It(e,t);if(!ct(e))return vn(N(e),t);if(!k(t)){if(j(t))return sn(t,e);throw new h(`Attempted to compare the set ${I(e)} with the value:\n${I(t)}`)}let n=_n(e,t);return n.elements.length-n.otherElements.length||mn(n.elements,n.otherElements)},yn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return It(e,t);if(j(t))return sn(t,e);throw new h(fn(e,t,!1))}return e.kind===`ModelValue`?ln(e,t):A(e)?hn(e,t):vn(e,t)},bn=(e,t)=>e.every((e,n)=>wn(e,t[n])),xn=(e,t,n)=>{let r=an(n);if(!r){if(j(n))return cn(n,t);throw new h(`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)&&bn(e.range,r.range);let i=e.low??r.low;return i===void 0?bn(e.domain,r.domain)&&bn(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new h(`Attempted to compare an integer with non-integer:\n${I(e)}.`);return e===i+t})&&bn(e.range,r.range)},Sn=(e,t)=>{let n=F(e);if(e.kind===`Function`&&Sr(n)!==void 0){let r=A(t)?Sr(t):void 0;return r?n.range.length===r.length&&bn(n.range,r):xn({...n,low:1},e,t)}if(Ut(e)===`record`){let r=on(t);if(!r){if(j(t))return cn(t,e);throw new h(`Attempted to check equality of record:\n${I(e)}\nwith non-record\n${I(t)}`)}return n.domain.length===r.domain.length&&bn(n.domain,r.domain)&&bn(n.range,r.range)}return xn({...n,low:rn(n.domain)},e,t)},Cn=(e,t)=>{if(gn(e,t))return Zt(e,t);if(!ct(e))return Cn(N(e),t);if(!k(t)){if(j(t))return cn(t,e);throw new h(`Attempted to check equality of the set ${I(e)} with the value:\n${I(t)}`)}let n=_n(e,t);return n.elements.length===n.otherElements.length&&bn(n.elements,n.otherElements)},wn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(j(t))return cn(t,e);throw new h(fn(e,t,!0))}return e.kind===`ModelValue`?un(e,t):A(e)?Sn(e,t):Cn(e,t)},Tn=e=>{let t=[];for(let n of e){let e=Dn(n,t);e.isFound||t.splice(e.index,0,n)}return t},En=(e,t)=>{let n=wr.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Dn=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=En(e,()=>yn(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}},On=(e,t)=>t.some(t=>En(t,()=>wn(t,e))),kn=/* @__PURE__ */ new WeakSet,An=e=>{typeof e==`object`&&(e.kind===`Set`&&(kn.add(e),e.elements.forEach(An)),e.kind===`Function`&&(e.domain.forEach(An),e.range.forEach(An)))},jn=(e,t)=>Tr(Zt,wn,e,t),Mn=e=>{for(let t=1;t<e.length;t++)if(It(e[t-1],e[t])>=0)return!1;return!0},Nn=e=>{for(let t=1;t<e.length;t++)Yt(e[t]);if(e.length<2||Mn(e))return zt(e);let t=[...e].sort(It),n=[t[0]];for(let e=1;e<t.length;e++)It(n[n.length-1],t[e])!==0&&n.push(t[e]);return zt(n)},Pn=e=>Tr(Nn,e=>({kind:`MixedSet`,elements:e}),e,void 0),Fn=zt([]),In=(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&&It(r[a],t)<0;)a++;a<r.length&&It(r[a],t)===0||i.push(t)}return i.length===n.length?e:zt(i)},Ln=(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&&It(r[a],t)<0;)a++;a<r.length&&It(r[a],t)===0&&i.push(t)}return i.length===n.length?e:zt(i)},Rn=(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=It(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=zt(i);if(e.hash!==0&&e.hash!==Kr){let t=e.hash,n=0;for(;n<a.length;n++){let e=Zr(a[n]);if(e===Kr)break;t=t+Wr(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+ei(a[e])|0;c.fingerprint=t}return c},zn=e=>{let t=e.length<2?e:[...e].sort((e,t)=>It(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&It(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Bt(n,r)},Bn=e=>{let t=zn(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:ft(t,e.map(e=>e[0]))},Vn=[],Hn=[],Un=/* @__PURE__ */ new WeakMap,Wn=e=>{let t=Vn[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Vn[e]=n,n},Gn=e=>{if(vr(e),e.low===1&&e.high>=1)return Wn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Kn=e=>e.length>0&&(e===Vn[e.length]||Un.has(e)),qn=e=>{let t=N(e).elements;return Kn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Jn=e=>{let t=Hn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Hn[e]=n,n},Yn=e=>Ht(Bt(Wn(e.length),e),`tuple`),Xn=e=>Ht(zn(e),`record`),Zn=(e,t)=>Ht(Bt(e,t),`record`),Qn=e=>k(e)&&!jt(e),$n=(e,t=!1)=>`UNION(${I(e.base,t)})`,er=(e,t=e=>N(e).elements)=>{if(!Qn(e.base))throw new h(`Attempted to enumerate the nonenumerable set:\n${$n(e)}`);return t(e.base)},tr=(e,t,n)=>{if(Qn(e))return e;throw new h(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${I(e)}\nwhen enumerating:\n${$n(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)||nr(e.domain)===!0||nr(e)===!0;case`RecordSet`:return e.sets.every(M)||nr(e)===!0;case`ProductSet`:return e.factors.every(M)||nr(e)===!0;case`Union`:return M(e.base)&&dr(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}},nr=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=nr(e.domain);return t===void 0?void 0:!t&&nr(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=nr(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}},rr=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},ir=(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},ar=e=>{if(typeof e!=`object`||e.kind!==`Subset`||jt(e.base))return;let t=N(e.base).elements;if(t.length<=30)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:ir(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return zt(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)})},or=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(zt(r.map(t=>e[t])));while(ir(r,e.length))}return t},sr=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(jt(a))throw new h(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},cr=(e,t=e=>N(e).elements)=>{if(typeof e!=`object`)throw new h(`Expected a set but found ${I(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return Tn(e.elements);case`Interval`:{let t=Gn(e);return t!==Vn[t.length]&&Un.set(t,e),t}case`Subset`:{if(vr(e.base)===0)return or([]);if(!k(e.base))throw new h(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${at(I(e.base))}`);let t=N(e.base).elements;if(t.length>30)throw new h(_r(e));return or(t)}case`FunctionSet`:{if(!wt.is174&&P(e))return[];if(jt(e.domain))throw new h(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${I(e.domain)}\ncannot be enumerated.`);let n=qn(e.domain);if((n.length>0||wt.is174)&&jt(e.range))throw new h(`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 rr(n.map(()=>r)).map(e=>Bt(n,e))}case`RecordSet`:{if(!wt.is174&&P(e))return[];let n=sr(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 rr(n).map(t=>Xn(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!wt.is174&&P(e))return[];let n=sr(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 rr(n).map(Yn)}case`FilteredSet`:if(!k(e.base)||jt(e.base))throw new h(`Attempted to enumerate { x \\in S : p(x) } when S:\n${I(e.base)}\nis not enumerable`);return N(e.base).elements.filter(e.test);case`Union`:{let t=er(e).flatMap((t,n)=>N(tr(t,n,e)).elements);return N(Pn(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!Qn(e.left)||!Qn(e.right)))throw new h(`Attempted to enumerate S \\cup T when S:\n${I(e.left)}\nand T:\n${I(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&!Qn(e.left)&&!Qn(e.right))throw new h(`Attempted to enumerate S \\cap T when neither S:\n${I(e.left)}\nnor T:\n${I(e.right)}\nis enumerable`);if(e.operator===`\\`&&!Qn(e.left))throw new h(`Attempted to enumerate S \\ T when S:\n${I(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Tr(e=>Rn(N(e.left),N(e.right)).elements,e=>Tn(lr(e)),e,e);let t=e.operator===`\\`||Qn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return N(n).elements.filter(t=>Er(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new h(`Attempted to enumerate the non-enumerable set ${I(e)}`);default:throw new h(`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 zt(cr(e));let t=typeof e==`object`&&ot(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=wr.sets;n?.push(e);let r=cr(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`)?zt(r):Nn(r);return t&&(t.enumerated=i),i},lr=e=>[...N(e.left).elements,...N(e.right).elements],ur=e=>typeof e==`object`&&e.kind===`SetOperation`&&e.operator===`\\cup`?Tr(e=>N(e).elements,e=>Tn(En(e,()=>lr(e))),e,e):N(e).elements,dr=e=>{if(typeof e!=`object`||Gt(e))return N(e).elements;let t=wr.sets;t?.push(e);let n=hr(e);return t?.pop(),n},fr=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,pr=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(pr);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(pr)&&e.range.every(pr);case`SetOperation`:return e.operator!==`\\cup`&&pr(e.left)&&pr(e.right);case`FilteredSet`:return pr(e.base);case`ProductSet`:return e.factors.every(pr);default:return!1}},mr=e=>typeof e!=`object`||Gt(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?mr(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||mr(e.left)||mr(e.right):fr(e)?.some(mr)??!1,hr=e=>{if(e.kind===`Union`)return er(e,dr).flatMap((t,n)=>dr(tr(t,n,e)));if(e.kind===`FilteredSet`&&!jt(e.base))return dr(e.base).filter(e.test);if(fr(e)?.some(mr))return cr(e,dr);if(e.kind!==`SetOperation`)return N(e).elements;if(e.operator===`\\cup`)return!Qn(e.left)||!Qn(e.right)?N(e).elements:[...dr(e.left),...dr(e.right)];let t=e.operator===`\\`||Qn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return Qn(n)?dr(n).filter(t=>Er(t,r)===(e.operator===`\\cap`)):N(e).elements},P=e=>{if(typeof e!=`object`||!k(e))throw new h(`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 h(`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 er(e).every((t,n)=>P(tr(t,n,e)));default:return N(e).elements.length===0}},gr=(e,t,n)=>e.reduce((e,r)=>{let i=e*vr(r,t);if(i>2147483647)throw new h(n());return i},1),_r=e=>`Overflow when computing the number of elements in:\n${I(e)}`,vr=(e,t)=>{if(typeof e!=`object`)throw new h(`Attempted to compute the number of elements in the ${lt(e)} ${I(e)}.`);switch(e.kind){case`ModelValue`:throw new h(`Attempted to compute the number of elements in the model value ${I(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return vr(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new h(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new h(`Attempted to compute the number of elements in the overridden value ${I(e)}.`);case`Subset`:{let n=vr(e.base,t);if(n>=31)throw new h(_r(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(P(e.domain))return 1;if(P(e.range))return 0;if(vr(e.range,t)===1)return 1}let n=vr(e.domain,t),r=vr(e.range,t);if(r<=1)return n===0?1:r;let i={value:1};for(let t=0;t<n;t++)if(i.value*=r,i.value>2147483647)throw new h(_r(e));return i.value}case`RecordSet`:return t!==`1.7.4`&&P(e)?0:gr(e.sets,t,()=>_r(e));case`ProductSet`:return t!==`1.7.4`&&P(e)?0:gr(e.factors,t,()=>`Overflow when computing the number of elements in ${I(e)}`);default:return Yt(e),N(e).elements.length}},yr=e=>`Attempted to check if the set ${I(e)}is finite.`,br=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new h(`Attempted to check if the ${lt(e)} ${I(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new h(`Attempted to check if the function:\n${I(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return br(e.base)&&P(e.base);case`Subset`:return br(e.base);case`FunctionSet`:{let t=br(e.domain);if(t&&P(e.domain))return!0;let n=br(e.range);return n&&P(e.range)?!0:n&&(t||vr(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(!br(e))n.isAllFinite=!1;else if(P(e))return!0;return n.isAllFinite}case`Union`:if(!Qn(e.base))throw new h(`Attempted to check if the nonenumerable set:\n${$n(e)}\nis a finite set.`);return N(e.base).elements.every(br);case`SetOperation`:if(e.operator===`\\cup`)return br(e.left)&&br(e.right);if(e.operator===`\\cap`){if(!br(e.left)&&!br(e.right))throw new h(yr(e));return!0}if(br(e.left))return!0;if(!br(e.right))throw new h(yr(e));return!1;case`FilteredSet`:if(!br(e.base))throw new h(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${I(e.base)}\nis finite.`);return!0}},xr=(e,t,n=It)=>{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},Sr=e=>{if(typeof e!=`object`||!A(e))return;let t=F(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Cr=(e,t)=>{let n=`Attempted to check if the value:\n${I(e)}\nis an element of the`;if(!A(t))return`${n} ${lt(t)} ${I(t)}`;let r=Ut(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)}`},wr={sets:void 0},Tr=(e,t,n,r)=>{let i=wr.sets,a=wr.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof h))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},Er=(e,t)=>{let n=wr.sets;if(n===void 0)return kr(e,t);n.push(t);let r=kr(e,t);return n.pop(),r},Dr=(e,t)=>xr(t.elements,e)!==-1,Or=(e,t)=>kn.has(t)?Dn(e,t.elements).isFound:On(e,t.elements),kr=(e,t)=>{if(!k(t))throw new h(Cr(e,t));switch(t.kind){case`Set`:return Yt(e),Tr(Dr,Or,e,t);case`MixedSet`:return On(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!j(e))throw new h(`Attempted to check if the value:\n${I(e)}\nis in the integer interval ${I(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(j(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new h(`Attempted to check if the value:\n${I(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!k(e)||jt(e))throw new h(`Attempted to check if the non-enumerable value\n${at(I(e))}\nis element of\n${at(I(t))}`);return N(e).elements.every(e=>Er(e,t.base));case`FunctionSet`:{if(!A(e)){if(j(e))return!1;throw new h(`Attempted to check if \n${I(e)}\nwhich is not a TLC function value, is in the set of functions:\n${at(I(t))}`)}let n=F(e),r=rn(n.domain);return(r===void 0?jn(t.domain,zt(n.domain)):jn({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>Er(e,t.range))}case`RecordSet`:{let n=A(e)?F(e):void 0;if(!n||!gt(n.domain)){if(j(e))return!1;throw new h(`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=xr(n.domain,e);return i!==-1&&Er(n.range[i],t.sets[r])})}case`ProductSet`:{let n=A(e)?Sr(e):void 0;if(n===void 0){if(A(e)&&F(e).domain.every(e=>typeof e==`number`)||j(e))return!1;throw new h(`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)=>Er(e,t.factors[n]))}case`FilteredSet`:return Er(e,t.base)&&t.test(e);case`Union`:if(!Qn(t.base))throw new h(`Attempted to check if:\n ${I(e)}\nis an element of the non-enumerable set:\n ${$n(t)}`);return N(t.base).elements.some(t=>Er(e,t));case`SetOperation`:return t.operator===`\\cup`?Er(e,t.left)||Er(e,t.right):Er(e,t.left)&&Er(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Sr(e);if(n===void 0){if(j(e))return!1;throw new h(`Attempted to check if the value:\n${at(I(e))}\nis an element of ${at(I(t))}.`)}return n.every(e=>Er(e,t.base))}default:throw new h(Cr(e,t))}},Ar=(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?Er(e,n):e.range.every((e,r)=>Ar(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;M(e.domain)||vr(e.domain);let t=qn(e.domain);return e.enumerated=Ht(Bt(t,t.map(t=>e.apply(t))),Ut(e)),e.enumerated}throw new h(`Expected a function but found ${I(e)}`)},jr=(e,t,n)=>{let r=at(I(e)),i=at(I(t)),a=n===`1.7.4`;switch(Ut(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.`}},Mr=(e,t)=>{if(!wt.is174)return jr(e,t);let n=at(I(t));return Ut(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Nr=(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},Pr=e=>new h(`Attempted to apply function with integer domain to the non-integer argument ${at(I(e))}`),Fr=(e,t,n)=>{throw wt.is174||e.length<32?e.forEach(e=>wn(e,t)):xr(e,t,yn),n},Ir=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=Ut(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new h(n(e,t));if(a===void 0&&!wt.is174&&Kn(r))throw Pr(t)}let i=Nr(r,t);return i===-1?Tr(xr,Fr,r,t):i},Lr=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!Er(t,e.domain))throw new h(Ut(e)===`lambda`?jr(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 h(`Attempted to apply ${I(e)}, which is not a function`);let r=n??jr,i=Ir(e,t,r);if(i===-1)throw new h(r(e,t));return e.range[i]},Rr=e=>Kn(e)?Un.get(e)??Jn(e.length):void 0,zr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=F(e).domain;return Rr(t)??zt(t)},Br=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!M(e.domain))){if(!Er(t,e.domain))return e;let r=n(e.apply(t));return Ht({kind:`LazyFunction`,domain:e.domain,apply:n=>jn(t,n)?r:e.apply(n),source:e.source},Ut(e))}if(!A(e))throw new h(`Attempted to apply EXCEPT construct to the value ${at(I(e))}.`);let i=F(e),a=Ir(i,t,Mr);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Ht(Bt(i.domain,o),Ut(i));if(l.writtenKeys=i.writtenKeys,i.hash!==0&&i.hash!==Kr){let e=Zr(c);if(e!==Kr){let t=Zr(i.domain[a]);l.hash=s===c?i.hash:i.hash-Gr(t,Zr(s))+Gr(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-ti(e,s)+ti(e,c)|0}return l},Vr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Hr=(e,t)=>Math.imul(e^t,16777619),Ur=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Vr(t)},Wr=e=>Vr(e+2654435769|0),Gr=(e,t)=>Vr(Math.imul(e,668265261)+t|0),Kr=795548749,qr=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Zr(t[e]);if(r===Kr)return Kr;n=n+Wr(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Zr(e.domain[n]),i=Zr(e.range[n]);if(r===Kr||i===Kr)return Kr;t=t+Gr(r,i)|0}return t},Jr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new h(`TLC has found a state in which the value of a variable contains ${I(e)}`);if(k(e)){N(e).elements.forEach(Jr);return}let t=F(e);t.domain.forEach(Jr),t.range.forEach(Jr)},Yr=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Zr(e)===Kr&&Jr(e);return}catch(e){if(!(e instanceof h))throw e;return e}},Xr=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[]}},Zr=e=>typeof e==`number`?Vr(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?Ur(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=qr(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?M(e.domain)?Zr(F(e)):Kr:M(e)?Zr(N(e)):Kr,Qr=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},$r=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Qr(t)},ei=e=>Qr(ri(e)+2135587861|0),ti=(e,t)=>Qr(Math.imul(ri(e),374761393)+ri(t)|0),ni=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+ei(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+ti(e.domain[n],e.range[n])|0;return t},ri=e=>typeof e==`number`?Qr(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?$r(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=ni(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?ri(F(e)):M(e)?ri(N(e)):$r(ii(e)),ii=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):ai(e),ai=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${ii(e.base)}>`;if(e.kind===`FilteredSet`&&!M(e))throw new h(`Attempted to compare the non-enumerable set ${I(e)} with another value`);if(k(e))return M(e)?`{${N(e).elements.map(ii).join(`,`)}}`:`<${e.kind} ${I(e)}>`;let t=F(e);return`(${t.domain.map((e,n)=>`${ii(e)}:${ii(t.range[n])}`).join(`,`)})`},oi=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,si=e=>e.reduce((e,t)=>e===0?0:e*vr(t),1),ci=e=>{if(e.kind===`Subset`)return vr(e.base)<=6?N(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return N(e);if(e.kind===`FunctionSet`&&M(e.domain)&&vr(e.domain)===0)return zt([Bt([],[])]);let t=e.kind===`FunctionSet`?vr(e.range)**vr(e.domain):si(e.kind===`RecordSet`?e.sets:e.factors);return t===0?Fn:t<=1999?N(e):void 0},li=(e,t)=>{if(t)return ci(e);if(M(e))try{return ci(e)}catch(e){if(e instanceof h)return;throw e}},ui=(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 $n(e,t)}},di=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),fi=e=>{if(M(e.domain))try{return F(e)}catch(e){if(e instanceof h)return;throw e}},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 oi(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=li(e,t);return n?r(n):ui(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?fi(e):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&&wt.is174&&Ut(e)!==`tuple`)return`<< >>`;let a=r=>I(r,t,n&&Ut(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:Ut(e)===`record`||i.domain.every(e=>typeof e==`string`&&di(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):pt(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},pi=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${at(I(n))}\n`).join(``)},mi=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),hi=(e,t)=>mi.has(e)?new h(t):new n(t),gi=(e,t,r,i)=>new n(`The ${e} argument of ${t} should be a ${r}, but instead it is:\n${I(i)}`),_i=e=>typeof e==`object`&&e.kind===`Operator`,L=(e,t,n)=>{let r=e[t];if(r===void 0||_i(r))throw hi(n,`${n} expects a value as argument ${t+1}`);return r},vi=(e,t,n)=>{let r=L(e,t,n);if(typeof r!=`number`)throw hi(n,`${n} expects an integer but received ${I(r)}`);return r},yi=(e,t,n)=>{let r=L(e,t,n);if(typeof r!=`boolean`)throw hi(n,`${n} expects a boolean but received ${I(r)}`);return r},bi=(e,t,n)=>{let r=L(e,t,n);if(!k(r))throw hi(n,`${n} expects a set but received ${I(r)}`);return r},xi=(e,t,n)=>{let r=bi(e,t,n);if(!M(r))throw hi(n,`${n} cannot enumerate the non-enumerable set ${I(r)}`);return r},Si=(e,t,n)=>N(xi(e,t,n)).elements,Ci=(e,t,n)=>{let r=L(e,t,n),i=Sr(r);if(!i)throw hi(n,`${n} expects a sequence but received ${I(r)}`);return i},wi=(e,t,n)=>{let r=L(e,t,n);if(!A(r))throw hi(n,`${n} expects a function but received ${I(r)}`);return F(r)},Ti=(e,t,n)=>{let r=e[t];if(r===void 0||!_i(r))throw hi(n,`${n} expects an operator as argument ${t+1}`);return r},Ei=(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}),Di=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Oi=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),ki=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(L(n,0,e),L(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Ai=e=>e>2147483647||e<-2147483648,ji=e=>new n(`Overflow when computing ${e}`),Mi={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`},Ni={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Pi={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`},Fi={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Ii=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Ni[e.operator];if(e.kind!==`Function`)return Mi[e.kind];let t=Ut(e);return t===void 0?`FcnRcdValue`:Fi[t]},Li=e=>Pi[Ii(e)],Ri=(e,t)=>new h(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),zi=(e,t)=>{let r=r=>(...i)=>{let a=wr.sets?.length??0;try{return r(...i)}catch(r){throw r instanceof h&&(e.isLazy===!0||!(r instanceof n))?(wr.sets&&(wr.sets.length=a),Ri(t,r.message)):r}};return{...e,evaluate:r(e.evaluate),evaluateUnary:e.evaluateUnary&&r(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&r(e.evaluateBinary)}},Bi=(e,t)=>{if(typeof e!=`number`)throw Ri(t,`Cannot cast tlc2.value.impl.${Ii(e)} to tlc2.value.impl.IntValue`);return e},Vi=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Hi=(e,t,n,r)=>{let i=Vi(e,n,`IntValue`,2);return ki(t,(e,n)=>{let a=Bi(e,i),o=Bi(n,i),s=r(a,o);if(Ai(s))throw ji(`${a}${t}${o}`);return s})},Ui=(e,t,r)=>{if(typeof e!=`number`)throw new n(`The ${t} argument of ${r} should be an integer, but instead it is:\n${I(e)}`);return e},Wi=(e,t,n=e)=>ki(e,(e,r)=>t(Ui(e,`first`,n),Ui(r,`second`,n))),Gi=(e,t,n)=>({...Oi(e,t,n),isLazy:!0}),Ki=(e,t,n)=>{let r=Ti(e,t,n);return()=>r.call([])},qi=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Ji=()=>({bool:Pu,condition:(e,t)=>{if(typeof e!=`boolean`)throw _u(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw vu(t,n,e);return e},apply:Lr,expectFunction:ju,tuple:Yn,set:Pn,record:Zn,writtenRecord:mt,equal:Zt,enumerate:Vu,unassigned:(e,t)=>{throw Tu(e,t)},primeOutsideAction:e=>{throw Du(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:Mu,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>ku(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),Yi={value:void 0},Xi={isAllowed:void 0},Zi=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Qi=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),$i=e=>`local${e.counter++}`,ea=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),Ye(e).forEach(e=>ea(e,t)),t),ta=(e,t,n)=>{let r=Qi(e,V(t,e.environment)),i=ea(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Qi(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},na=(e,t,n)=>{let r=t.kind===`Forall`,i=JSON.stringify(r?`the body of \\A`:`the body of \\E`),a=`quantifier${e.counter++}`,o=[...n.locals.values()],s={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(n.locals)},c=t.bounds.map(()=>$i(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${oa(e,t.set,s)}, ${Qi(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=$i(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${oa(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=$i(e),a=$i(e),o=$i(e),s=c[r];return`for (let ${i} = 0, ${a} = ${s}.low, ${o} = ${a} === undefined ? ${s}.length : ${s}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${s}[${i}] : ${a} + ${i}; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; let applied; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},ra=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${oa(e,r[0],n)}, "the left side of =>") ? bool(${oa(e,r[1],n)}, "the right side of =>") : true)`;if(O(t))return ta(e,t,n);let i=dd(t.operator,e.environment);if(i?.kind!==`Builtin`)return ta(e,t,n);if(i.name===`DOMAIN`)return`${Qi(e,xu(t))}(${oa(e,r[0],n)})`;if(i.name===`TLCEval`)return ta(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Qi(e,Su(t,i))}(${oa(e,r[0],n)}, ${oa(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Rd(r[0],a))return`${Qi(e,i.evaluateUnary)}(${oa(e,r[0],n)})`;let o=r.length===2&&Rd(r[0],a)&&Rd(r[1],a);return i.evaluateBinary&&o?`${Qi(e,i.evaluateBinary)}(${oa(e,r[0],n)}, ${oa(e,r[1],n)})`:ta(e,t,n)},ia=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(O(e))return!1;let r=Sd(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return ia(e.expression,t,n);case`FieldAccess`:return ia(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>ia(e,t,n));default:return!1}},aa=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return aa(e.record);case`FunctionApplication`:return[e.function,...e.args].every(aa);default:return!1}},oa=(e,t,n)=>{let r=(t,r=n)=>oa(e,t,r);switch(t.kind){case`Number`:return ut(t.value)?String(t.value):ta(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(O(t))return ta(e,t,n);let i=Sd(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Qi(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Qi(e,i.value):ta(e,t,n)}case`Apply`:return ra(e,t,n);case`And`:case`Or`:{let n=Qi(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)}, ${Qi(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{qd(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${ia(t.function,n,e.environment)?r(t.function):aa(t.function)?r(t.function,i):ta(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Qi(e,t)}))`,o=bu(e.environment.runtime.version),s=o?`, ${Qi(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`${Qi(e,yu(t))}(${r(t.record)})`;case`Record`:{let i=Zd(t.fields);if(Qd(i))return ta(e,t,n);let a=Qi(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}, ${Qi(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:{let i=Qi(e,t);if(n.isPrimed)return`primeOutsideAction(${i})`;let a={context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals};return`(${n.next} === undefined ? primeOutsideAction(${i}) : ${r(t.expression,a)})`}case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?na(e,t,n):ta(e,t,n);default:return ta(e,t,n)}},sa=(e,t)=>{if(!qi.has(e.kind)||(Xi.isAllowed??=Zi(),!Xi.isAllowed))return;let n={environment:t,references:[],helpers:[],counter:0},r=oa(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(`
|
|
86
|
+
=============================================================================`,Qe=/* @__PURE__ */ new Map([[`Reals`,Ye],[`RealTime`,Xe],[`Toolbox`,Ze]]),$e={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:` `}},et=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},tt=e=>e!==void 0&&/^\p{Nd}$/u.test(e),nt=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),rt=e=>{let t=t=>{let n=me(e,t,et);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=me(e,t,tt);if(e.startsWith(`..`,n)&&tt(e[n+2]))return{kind:`Constant`,first:t,last:me(e,n+2,tt)-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=tt(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:me(e,t+1,tt)-1,children:[]};if(nt(n))return{kind:`Constant`,first:t,last:me(e,t,nt)-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)},it=e=>{let t=e.length===0?void 0:rt(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=$e[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},at=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,A=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,ot=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),j=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),M=e=>typeof e==`object`&&e.kind===`ModelValue`,st=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),ct=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:A(e)?`set`:`function`,lt=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,ut={isUsed:!1},dt=(e,t)=>(ut.isUsed=!0,e.writtenKeys=t,e),ft=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[xr(e.domain,t)]]),pt=(e,t,n)=>dt(Zn(e,t),n),mt=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(mt);e.writtenKeys=void 0,e.range.forEach(mt)}},ht=e=>e.every(e=>typeof e==`string`),gt=(e,t)=>e.length>0&&t.length>0&&ht(e)!==ht(t),_t=(e,t)=>{ut.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return gt(n,r)?vn(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Ft(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:Ft(t,n);if(r!==0)return r}return 0},vt=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=Ft(n[e],r[e]);if(t!==0)return t}return 0},yt=e=>M(e)?e.type:void 0,bt=(e,t,n)=>{let r=yt(e),i=yt(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(M(e)&&M(t)){if(r===void 0||i===void 0||r===i)return;throw new m(`Attempted to ${a} the differently-typed model values ${L(e)} and ${L(t)}`)}throw r===void 0?new m(`Attempted to ${a} the typed model value ${L(t)} and the non-model value\n${L(e)}`):new m(`Attempted to ${a}${n?``:` the`} typed model value ${L(e)} and non-model value\n${L(t)}`)},xt={ranks:Object.create(null),size:0},St=e=>{xt.ranks=Object.create(null),xt.size=0,It.clear();for(let t of e)Tt(t)},Ct={is174:!1},wt=e=>{Ct.is174=e===`1.7.4`},Tt=e=>(xt.ranks[e]===void 0&&(xt.ranks[e]=xt.size++),e),Et=()=>xt.size,Dt=e=>Object.keys(xt.ranks).find(t=>xt.ranks[t]===e),Ot=e=>xt.ranks[Tt(e)],kt=(e,t)=>{if(e===t)return 0;let n=xt.ranks,r=n[e],i=n[t];return r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},At=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),jt=(e,t)=>(At(e)||At(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Mt=(e,t,n)=>{if(!At(e))throw new m(`Attempted to ${n} the set ${L(N(e)?P(e):e,!0)} with the value:\n${L(t,!0)}`);if(!At(t))throw new m(`Attempted to compare overridden value ${L(e,!0)} with non-overridden value:\n${L(t,!0)}`);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new m(`Attempted to compare ${L(e,!0)} with the value\n${L(t,!0)}`)},Nt={kind:`InfiniteSet`,name:`Any`},Pt=e=>{throw new m(`Attempted to compare ANY with the value\n${L(e)}`)},Ft=(e,t)=>{if(e===t)return ut.isUsed&&mt(e),e===Nt?Pt(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return _t(e,t);if(n===`Set`&&r===`Set`)return vt(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&&bt(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return bt(e,t,!1),n===`ModelValue`?-1:1;if(e===Nt||t===Nt)return Pt(e===Nt?t:e);if(A(e)&&A(t)&&jt(e,t))return Mt(e,t,`compare`);let i=A(e);if(i!==A(t))throw new m(`Attempted to compare ${ct(e)} ${L(e)} with ${ct(t)} ${L(t)}`);return i?vt(P(e),P(t)):_t(I(e),I(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return kt(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(bt(e,t,!1),M(e))return-1;if(M(t))return 1;throw new m(`Attempted to compare ${ct(e)} ${L(e)} with ${ct(t)} ${L(t)}`)},It=/* @__PURE__ */ new Map,Lt=e=>{let t=It.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Ot(e),hash:Vr(Hr(Ur(e),109)),fingerprint:Qr($r(e)^60)};return It.set(e,n),n},Rt=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0,isFingerprinted:!1}),zt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,isFingerprinted:!1}),Bt={isPresent:!1},Vt=(e,t)=>(t===`lambda`&&(Bt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),Ht=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Ut=e=>Vt(e,`lambda`),Wt=e=>at(e)&&e.isCached===!0,Gt={isPresent:!1},Kt=e=>(Gt.isPresent=!0,e),qt=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),Jt=e=>{Gt.isPresent&&typeof e==`object`&&at(e)&&qt.has(e.kind)&&(e.isCached=!0)},Yt=e=>{(Bt.isPresent||Gt.isPresent)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(Yt),e.range.forEach(Yt)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Yt):A(e)&&N(e)&&(Jt(e),P(e).elements.forEach(Yt))))},Xt=(e,t)=>{if(Jt(e),e===t)return ut.isUsed&&mt(e),e!==Nt||Pt(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&bt(e,t,!0),Ft(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return _t(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return vt(e,t)===0;if(M(e)||M(t))return bt(e,t,!0),M(e)&&M(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Xt(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=F(e.domain),r=F(t.domain);if(n||r)return n===r;let i=F(e.range),a=F(t.range);return i||a?i===a:Xt(e.domain,t.domain)&&Xt(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(F(e))return F(t);if(F(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&Xt(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return F(e)?F(t):!F(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Xt(e,t.factors[n]));let n=A(e)&&A(t)&&!(N(e)&&N(t));if(n&&jt(e,t))return Mt(e,t,`check equality of`)===0;if(n){if(!At(e)){let n=P(e);if(!At(t))return vt(n,P(t))===0}return ii(e)===ii(t)}return Ft(e,t)===0},Zt=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):ii(n)===ii(r);return n},Qt=Zt(!1),$t=Zt(!0),en=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},tn=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Zr(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||$t(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||$t(i[e],n))return i[e]}return n.kind===`Set`?en(n.elements,t):(en(n.domain,t),en(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},nn=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},rn=e=>{if(!j(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:nn(t.domain)}},an=e=>{if(!j(e))return;let t=I(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},on=(e,t)=>(bt(t,e,!1),1),sn=(e,t)=>(bt(t,e,!0),!1),cn=(e,t)=>(e.type!==void 0&&bt(e,t,!1),M(t)?e.rank-t.rank:-1),ln=(e,t)=>(e.type!==void 0&&bt(e,t,!0),M(t)&&e.name===t.name),un={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},dn=(e,t,n)=>{let r=un[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${L(e)} with ${r.other}:\n${L(t)}`},fn=(e,t,n)=>{let r=rn(n);if(!r){if(M(n))return on(n,t);throw new m(`Attempted to compare the function ${L(t)} with the value:\n${L(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>pn(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return pn(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new m(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${L(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},pn=(e,t)=>{for(let n=0;n<e.length;n++){let r=vn(e[n],t[n]);if(r!==0)return r}return 0},mn=(e,t)=>{let n=I(e);if(e.kind===`Function`&&Sr(n)!==void 0){let r=j(t)?Sr(t):void 0;return r?n.range.length-r.length||pn(n.range,r):fn({...n,low:1},e,t)}if(Ht(e)===`record`){let r=an(t);if(!r){if(M(t))return on(t,e);throw new m(`Attempted to compare record:\n${L(e)}\nwith non-record\n${L(t)}`)}return n.domain.length-r.domain.length||pn(n.domain,r.domain)||pn(n.range,r.range)}return fn({...n,low:nn(n.domain)},e,t)},hn=(e,t)=>At(e)||At(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),gn=(e,t)=>{let n=st(t)?t:P(t);return{elements:P(e).elements,otherElements:P(n).elements}},_n=(e,t)=>{if(hn(e,t))return Ft(e,t);if(!st(e))return _n(P(e),t);if(!A(t)){if(M(t))return on(t,e);throw new m(`Attempted to compare the set ${L(e)} with the value:\n${L(t)}`)}let n=gn(e,t);return n.elements.length-n.otherElements.length||pn(n.elements,n.otherElements)},vn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return Ft(e,t);if(M(t))return on(t,e);throw new m(dn(e,t,!1))}return e.kind===`ModelValue`?cn(e,t):j(e)?mn(e,t):_n(e,t)},yn=(e,t)=>e.every((e,n)=>Cn(e,t[n])),bn=(e,t,n)=>{let r=rn(n);if(!r){if(M(n))return sn(n,t);throw new m(`Attempted to check equality of the function ${L(t)} with the value:\n${L(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&yn(e.range,r.range);let i=e.low??r.low;return i===void 0?yn(e.domain,r.domain)&&yn(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new m(`Attempted to compare an integer with non-integer:\n${L(e)}.`);return e===i+t})&&yn(e.range,r.range)},xn=(e,t)=>{let n=I(e);if(e.kind===`Function`&&Sr(n)!==void 0){let r=j(t)?Sr(t):void 0;return r?n.range.length===r.length&&yn(n.range,r):bn({...n,low:1},e,t)}if(Ht(e)===`record`){let r=an(t);if(!r){if(M(t))return sn(t,e);throw new m(`Attempted to check equality of record:\n${L(e)}\nwith non-record\n${L(t)}`)}return n.domain.length===r.domain.length&&yn(n.domain,r.domain)&&yn(n.range,r.range)}return bn({...n,low:nn(n.domain)},e,t)},Sn=(e,t)=>{if(hn(e,t))return Xt(e,t);if(!st(e))return Sn(P(e),t);if(!A(t)){if(M(t))return sn(t,e);throw new m(`Attempted to check equality of the set ${L(e)} with the value:\n${L(t)}`)}let n=gn(e,t);return n.elements.length===n.otherElements.length&&yn(n.elements,n.otherElements)},Cn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(M(t))return sn(t,e);throw new m(dn(e,t,!0))}return e.kind===`ModelValue`?ln(e,t):j(e)?xn(e,t):Sn(e,t)},wn=e=>{let t=[];for(let n of e){let e=En(n,t);e.isFound||t.splice(e.index,0,n)}return t},Tn=(e,t)=>{let n=wr.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},En=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=Tn(e,()=>vn(e,t[r]));if(i===0)return{index:r,isFound:!0};i<0?n.high=r:n.low=r+1}return{index:n.low,isFound:!1}},Dn=(e,t)=>t.some(t=>Tn(t,()=>Cn(t,e))),On=/* @__PURE__ */ new WeakSet,kn=e=>{typeof e==`object`&&(e.kind===`Set`&&(On.add(e),e.elements.forEach(kn)),e.kind===`Function`&&(e.domain.forEach(kn),e.range.forEach(kn)))},An=(e,t)=>Tr(Xt,Cn,e,t),jn=e=>{for(let t=1;t<e.length;t++)if(Ft(e[t-1],e[t])>=0)return!1;return!0},Mn=e=>{for(let t=1;t<e.length;t++)Jt(e[t]);if(e.length<2||jn(e))return Rt(e);let t=[...e].sort(Ft),n=[t[0]];for(let e=1;e<t.length;e++)Ft(n[n.length-1],t[e])!==0&&n.push(t[e]);return Rt(n)},Nn=e=>Tr(Mn,e=>({kind:`MixedSet`,elements:e}),e,void 0),Pn=Rt([]),Fn=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&Ft(r[a],t)<0;)a++;a<r.length&&Ft(r[a],t)===0||i.push(t)}return i.length===n.length?e:Rt(i)},In=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&Ft(r[a],t)<0;)a++;a<r.length&&Ft(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Rt(i)},Ln=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=Ft(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=Rt(i);if(e.hash!==0&&e.hash!==Kr){let t=e.hash,n=0;for(;n<a.length;n++){let e=Zr(a[n]);if(e===Kr)break;t=t+Wr(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+ei(a[e])|0;c.fingerprint=t}return c},Rn=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Ft(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Ft(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return zt(n,r)},zn=e=>{let t=Rn(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:dt(t,e.map(e=>e[0]))},Bn=[],Vn=/* @__PURE__ */ new Map,Hn=[],Un=/* @__PURE__ */ new WeakMap,Wn=e=>{let t=Bn[e]??Vn.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?Vn.set(e,new WeakRef(n)):Bn[e]=n,n},Gn=e=>{if(vr(e),e.low===1&&e.high>=1)return Wn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Kn=e=>e.length>0&&(e===Bn[e.length]||e===Vn.get(e.length)?.deref()||Un.has(e)),qn=e=>{let t=P(e).elements;return Kn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Jn=e=>{let t=Hn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Hn[e]=n,n},Yn=e=>Vt(zt(Wn(e.length),e),`tuple`),Xn=e=>Vt(Rn(e),`record`),Zn=(e,t)=>Vt(zt(e,t),`record`),Qn=e=>A(e)&&!At(e),$n=(e,t=!1)=>`UNION(${L(e.base,t)})`,er=(e,t=e=>P(e).elements)=>{if(!Qn(e.base))throw new m(`Attempted to enumerate the nonenumerable set:\n${$n(e)}`);return t(e.base)},tr=(e,t,n)=>{if(Qn(e))return e;throw new m(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${$n(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)||nr(e.domain)===!0||nr(e)===!0;case`RecordSet`:return e.sets.every(N)||nr(e)===!0;case`ProductSet`:return e.factors.every(N)||nr(e)===!0;case`Union`:return N(e.base)&&dr(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}},nr=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=nr(e.domain);return t===void 0?void 0:!t&&nr(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=nr(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}},rr=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},ir=(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},ar=e=>{if(typeof e!=`object`||e.kind!==`Subset`||At(e.base))return;let t=P(e.base).elements;if(t.length<=30)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:ir(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return Rt(n.indices.map(e=>t[e]))},i=2**t.length,a=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<i;return new Proxy([],{get:(e,t,n)=>t===`length`?i:a(t)?r(Number(t)):Reflect.get(e,t,n),has:(e,t)=>a(t)||Reflect.has(e,t)})},or=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Rt(r.map(t=>e[t])));while(ir(r,e.length))}return t},sr=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(At(a))throw new m(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},cr=(e,t=e=>P(e).elements)=>{if(typeof e!=`object`)throw new m(`Expected a set but found ${L(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return wn(e.elements);case`Interval`:{let t=Gn(e);return t!==Bn[t.length]&&Un.set(t,e),t}case`Subset`:{if(vr(e.base)===0)return or([]);if(!A(e.base))throw new m(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${it(L(e.base))}`);let t=P(e.base).elements;if(t.length>30)throw new m(_r(e));return or(t)}case`FunctionSet`:{if(!Ct.is174&&F(e))return[];if(At(e.domain))throw new m(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${L(e.domain)}\ncannot be enumerated.`);let n=qn(e.domain);if((n.length>0||Ct.is174)&&At(e.range))throw new m(`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 rr(n.map(()=>r)).map(e=>zt(n,e))}case`RecordSet`:{if(!Ct.is174&&F(e))return[];let n=sr(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 rr(n).map(t=>Xn(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!Ct.is174&&F(e))return[];let n=sr(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 rr(n).map(Yn)}case`FilteredSet`:if(!A(e.base)||At(e.base))throw new m(`Attempted to enumerate { x \\in S : p(x) } when S:\n${L(e.base)}\nis not enumerable`);return P(e.base).elements.filter(e.test);case`Union`:{let t=er(e).flatMap((t,n)=>P(tr(t,n,e)).elements);return P(Nn(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!Qn(e.left)||!Qn(e.right)))throw new m(`Attempted to enumerate S \\cup T when S:\n${L(e.left)}\nand T:\n${L(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&!Qn(e.left)&&!Qn(e.right))throw new m(`Attempted to enumerate S \\cap T when neither S:\n${L(e.left)}\nnor T:\n${L(e.right)}\nis enumerable`);if(e.operator===`\\`&&!Qn(e.left))throw new m(`Attempted to enumerate S \\ T when S:\n${L(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Tr(e=>Ln(P(e.left),P(e.right)).elements,e=>wn(lr(e)),e,e);let t=e.operator===`\\`||Qn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return P(n).elements.filter(t=>Er(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new m(`Attempted to enumerate the non-enumerable set ${L(e)}`);default:throw new m(`Expected a set but found ${L(e)}`)}},P=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Rt(cr(e));let t=typeof e==`object`&&at(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=wr.sets;n?.push(e);let r=cr(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?Rt(r):Mn(r);return t&&(t.enumerated=i),i},lr=e=>[...P(e.left).elements,...P(e.right).elements],ur=e=>typeof e==`object`&&e.kind===`SetOperation`&&e.operator===`\\cup`?Tr(e=>P(e).elements,e=>wn(Tn(e,()=>lr(e))),e,e):P(e).elements,dr=e=>{if(typeof e!=`object`||Wt(e))return P(e).elements;let t=wr.sets;t?.push(e);let n=hr(e);return t?.pop(),n},fr=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,pr=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(pr);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(pr)&&e.range.every(pr);case`SetOperation`:return e.operator!==`\\cup`&&pr(e.left)&&pr(e.right);case`FilteredSet`:return pr(e.base);case`ProductSet`:return e.factors.every(pr);default:return!1}},mr=e=>typeof e!=`object`||Wt(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?mr(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||mr(e.left)||mr(e.right):fr(e)?.some(mr)??!1,hr=e=>{if(e.kind===`Union`)return er(e,dr).flatMap((t,n)=>dr(tr(t,n,e)));if(e.kind===`FilteredSet`&&!At(e.base))return dr(e.base).filter(e.test);if(fr(e)?.some(mr))return cr(e,dr);if(e.kind!==`SetOperation`)return P(e).elements;if(e.operator===`\\cup`)return!Qn(e.left)||!Qn(e.right)?P(e).elements:[...dr(e.left),...dr(e.right)];let t=e.operator===`\\`||Qn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return Qn(n)?dr(n).filter(t=>Er(t,r)===(e.operator===`\\cap`)):P(e).elements},F=e=>{if(typeof e!=`object`||!A(e))throw new m(`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 m(`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 er(e).every((t,n)=>F(tr(t,n,e)));default:return P(e).elements.length===0}},gr=(e,t,n)=>e.reduce((e,r)=>{let i=e*vr(r,t);if(i>2147483647)throw new m(n());return i},1),_r=e=>`Overflow when computing the number of elements in:\n${L(e)}`,vr=(e,t)=>{if(typeof e!=`object`)throw new m(`Attempted to compute the number of elements in the ${ct(e)} ${L(e)}.`);switch(e.kind){case`ModelValue`:throw new m(`Attempted to compute the number of elements in the model value ${L(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return vr(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new m(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new m(`Attempted to compute the number of elements in the overridden value ${L(e)}.`);case`Subset`:{let n=vr(e.base,t);if(n>=31)throw new m(_r(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(F(e.domain))return 1;if(F(e.range))return 0;if(vr(e.range,t)===1)return 1}let n=vr(e.domain,t),r=vr(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 m(_r(e));return i.value}case`RecordSet`:return t!==`1.7.4`&&F(e)?0:gr(e.sets,t,()=>_r(e));case`ProductSet`:return t!==`1.7.4`&&F(e)?0:gr(e.factors,t,()=>`Overflow when computing the number of elements in ${L(e)}`);default:return Jt(e),P(e).elements.length}},yr=e=>`Attempted to check if the set ${L(e)}is finite.`,br=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new m(`Attempted to check if the ${ct(e)} ${L(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new m(`Attempted to check if the function:\n${L(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return br(e.base)&&F(e.base);case`Subset`:return br(e.base);case`FunctionSet`:{let t=br(e.domain);if(t&&F(e.domain))return!0;let n=br(e.range);return n&&F(e.range)?!0:n&&(t||vr(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(!br(e))n.isAllFinite=!1;else if(F(e))return!0;return n.isAllFinite}case`Union`:if(!Qn(e.base))throw new m(`Attempted to check if the nonenumerable set:\n${$n(e)}\nis a finite set.`);return P(e.base).elements.every(br);case`SetOperation`:if(e.operator===`\\cup`)return br(e.left)&&br(e.right);if(e.operator===`\\cap`){if(!br(e.left)&&!br(e.right))throw new m(yr(e));return!0}if(br(e.left))return!0;if(!br(e.right))throw new m(yr(e));return!1;case`FilteredSet`:if(!br(e.base))throw new m(`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}},xr=(e,t,n=Ft)=>{let r={low:0,high:e.length-1};for(;r.low<=r.high;){let i=r.low+r.high>>1,a=n(e[i],t);if(a===0)return i;a<0?r.low=i+1:r.high=i-1}return-1},Sr=e=>{if(typeof e!=`object`||!j(e))return;let t=I(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Cr=(e,t)=>{let n=`Attempted to check if the value:\n${L(e)}\nis an element of the`;if(!j(t))return`${n} ${ct(t)} ${L(t)}`;let r=Ht(t);return r===`record`?`Attempted to check if element:\n${L(e)}\nis in the record:\n${L(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${L(t)}`},wr={sets:void 0},Tr=(e,t,n,r)=>{let i=wr.sets,a=wr.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof m))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)}},Er=(e,t)=>{let n=wr.sets;if(n===void 0)return kr(e,t);n.push(t);let r=kr(e,t);return n.pop(),r},Dr=(e,t)=>xr(t.elements,e)!==-1,Or=(e,t)=>On.has(t)?En(e,t.elements).isFound:Dn(e,t.elements),kr=(e,t)=>{if(!A(t))throw new m(Cr(e,t));switch(t.kind){case`Set`:return Jt(e),Tr(Dr,Or,e,t);case`MixedSet`:return Dn(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!M(e))throw new m(`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(M(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new m(`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(!A(e)||At(e))throw new m(`Attempted to check if the non-enumerable value\n${it(L(e))}\nis element of\n${it(L(t))}`);return P(e).elements.every(e=>Er(e,t.base));case`FunctionSet`:{if(!j(e)){if(M(e))return!1;throw new m(`Attempted to check if \n${L(e)}\nwhich is not a TLC function value, is in the set of functions:\n${it(L(t))}`)}let n=I(e),r=nn(n.domain);return(r===void 0?An(t.domain,Rt(n.domain)):An({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>Er(e,t.range))}case`RecordSet`:{let n=j(e)?I(e):void 0;if(!n||!ht(n.domain)){if(M(e))return!1;throw new m(`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=xr(n.domain,e);return i!==-1&&Er(n.range[i],t.sets[r])})}case`ProductSet`:{let n=j(e)?Sr(e):void 0;if(n===void 0){if(j(e)&&I(e).domain.every(e=>typeof e==`number`)||M(e))return!1;throw new m(`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)=>Er(e,t.factors[n]))}case`FilteredSet`:return Er(e,t.base)&&t.test(e);case`Union`:if(!Qn(t.base))throw new m(`Attempted to check if:\n ${L(e)}\nis an element of the non-enumerable set:\n ${$n(t)}`);return P(t.base).elements.some(t=>Er(e,t));case`SetOperation`:return t.operator===`\\cup`?Er(e,t.left)||Er(e,t.right):Er(e,t.left)&&Er(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Sr(e);if(n===void 0){if(M(e))return!1;throw new m(`Attempted to check if the value:\n${it(L(e))}\nis an element of ${it(L(t))}.`)}return n.every(e=>Er(e,t.base))}default:throw new m(Cr(e,t))}},Ar=(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?Er(e,n):e.range.every((e,r)=>Ar(e,t.range[r],n.range)),I=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return e.enumerated;N(e.domain)||vr(e.domain);let t=qn(e.domain);return e.enumerated=Vt(zt(t,t.map(t=>e.apply(t))),Ht(e)),e.enumerated}throw new m(`Expected a function but found ${L(e)}`)},jr=(e,t,n)=>{let r=it(L(e)),i=it(L(t)),a=n===`1.7.4`;switch(Ht(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},Mr=(e,t)=>{if(!Ct.is174)return jr(e,t);let n=it(L(t));return Ht(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Nr=(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},Pr=e=>new m(`Attempted to apply function with integer domain to the non-integer argument ${it(L(e))}`),Fr=(e,t,n)=>{throw Ct.is174||e.length<32?e.forEach(e=>Cn(e,t)):xr(e,t,vn),n},Ir=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=Ht(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new m(n(e,t));if(a===void 0&&!Ct.is174&&Kn(r))throw Pr(t)}let i=Nr(r,t);return i===-1?Tr(xr,Fr,r,t):i},Lr=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!Er(t,e.domain))throw new m(Ht(e)===`lambda`?jr(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 m(`Attempted to apply ${L(e)}, which is not a function`);let r=n??jr,i=Ir(e,t,r);if(i===-1)throw new m(r(e,t));return e.range[i]},Rr=e=>Kn(e)?Un.get(e)??Jn(e.length):void 0,zr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=I(e).domain;return Rr(t)??Rt(t)},Br=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!N(e.domain))){if(!Er(t,e.domain))return e;let r=n(e.apply(t));return Vt({kind:`LazyFunction`,domain:e.domain,apply:n=>An(t,n)?r:e.apply(n),source:e.source},Ht(e))}if(!j(e))throw new m(`Attempted to apply EXCEPT construct to the value ${it(L(e))}.`);let i=I(e),a=Ir(i,t,Mr);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Vt(zt(i.domain,o),Ht(i));if(l.writtenKeys=i.writtenKeys,i.hash!==0&&i.hash!==Kr){let e=Zr(c);if(e!==Kr){let t=Zr(i.domain[a]);l.hash=s===c?i.hash:i.hash-Gr(t,Zr(s))+Gr(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-ti(e,s)+ti(e,c)|0}return l},Vr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Hr=(e,t)=>Math.imul(e^t,16777619),Ur=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Vr(t)},Wr=e=>Vr(e+2654435769|0),Gr=(e,t)=>Vr(Math.imul(e,668265261)+t|0),Kr=795548749,qr=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Zr(t[e]);if(r===Kr)return Kr;n=n+Wr(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Zr(e.domain[n]),i=Zr(e.range[n]);if(r===Kr||i===Kr)return Kr;t=t+Gr(r,i)|0}return t},Jr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new m(`TLC has found a state in which the value of a variable contains ${L(e)}`);if(A(e)){P(e).elements.forEach(Jr);return}let t=I(e);t.domain.forEach(Jr),t.range.forEach(Jr)},Yr=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Zr(e)===Kr&&Jr(e);return}catch(e){if(!(e instanceof m))throw e;return e}},Xr=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[]}},Zr=e=>typeof e==`number`?Vr(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?Ur(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=qr(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?N(e.domain)?Zr(I(e)):Kr:N(e)?Zr(P(e)):Kr,Qr=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},$r=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Qr(t)},ei=e=>Qr(ri(e)+2135587861|0),ti=(e,t)=>Qr(Math.imul(ri(e),374761393)+ri(t)|0),ni=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+ei(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+ti(e.domain[n],e.range[n])|0;return t},ri=e=>typeof e==`number`?Qr(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?$r(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=ni(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?ri(I(e)):N(e)?ri(P(e)):$r(ii(e)),ii=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):ai(e),ai=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${ii(e.base)}>`;if(e.kind===`FilteredSet`&&!N(e))throw new m(`Attempted to compare the non-enumerable set ${L(e)} with another value`);if(A(e))return N(e)?`{${P(e).elements.map(ii).join(`,`)}}`:`<${e.kind} ${L(e)}>`;let t=I(e);return`(${t.domain.map((e,n)=>`${ii(e)}:${ii(t.range[n])}`).join(`,`)})`},oi=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,si=e=>e.reduce((e,t)=>e===0?0:e*vr(t),1),ci=e=>{if(e.kind===`Subset`)return vr(e.base)<=6?P(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return P(e);if(e.kind===`FunctionSet`&&N(e.domain)&&vr(e.domain)===0)return Rt([zt([],[])]);let t=e.kind===`FunctionSet`?vr(e.range)**vr(e.domain):si(e.kind===`RecordSet`?e.sets:e.factors);return t===0?Pn:t<=1999?P(e):void 0},li=(e,t)=>{if(t)return ci(e);if(N(e))try{return ci(e)}catch(e){if(e instanceof m)return;throw e}},ui=(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 $n(e,t)}},di=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),fi=e=>{if(N(e.domain))try{return I(e)}catch(e){if(e instanceof m)return;throw e}},L=(e,t=!1,n=!1)=>{let r=e=>L(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return oi(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=li(e,t);return n?r(n):ui(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?fi(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${L(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Ct.is174&&Ht(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&Ht(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:Ht(e)===`record`||i.domain.every(e=>typeof e==`string`&&di(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):ft(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},pi=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${it(L(n))}\n`).join(``)},mi=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),hi=(e,t)=>mi.has(e)?new m(t):new n(t),gi=(e,t,r,i)=>new n(`The ${e} argument of ${t} should be a ${r}, but instead it is:\n${L(i)}`),_i=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||_i(r))throw hi(n,`${n} expects a value as argument ${t+1}`);return r},vi=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`number`)throw hi(n,`${n} expects an integer but received ${L(r)}`);return r},yi=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw hi(n,`${n} expects a boolean but received ${L(r)}`);return r},bi=(e,t,n)=>{let r=R(e,t,n);if(!A(r))throw hi(n,`${n} expects a set but received ${L(r)}`);return r},xi=(e,t,n)=>{let r=bi(e,t,n);if(!N(r))throw hi(n,`${n} cannot enumerate the non-enumerable set ${L(r)}`);return r},Si=(e,t,n)=>P(xi(e,t,n)).elements,Ci=(e,t,n)=>{let r=R(e,t,n),i=Sr(r);if(!i)throw hi(n,`${n} expects a sequence but received ${L(r)}`);return i},wi=(e,t,n)=>{let r=R(e,t,n);if(!j(r))throw hi(n,`${n} expects a function but received ${L(r)}`);return I(r)},Ti=(e,t,n)=>{let r=e[t];if(r===void 0||!_i(r))throw hi(n,`${n} expects an operator as argument ${t+1}`);return r},Ei=(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}),Di=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Oi=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),ki=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Ai=e=>e>2147483647||e<-2147483648,ji=e=>new n(`Overflow when computing ${e}`),Mi={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`},Ni={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Pi={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`},Fi={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Ii=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Ni[e.operator];if(e.kind!==`Function`)return Mi[e.kind];let t=Ht(e);return t===void 0?`FcnRcdValue`:Fi[t]},Li=e=>Pi[Ii(e)],Ri=(e,t)=>new m(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),zi=(e,t)=>{let r=r=>(...i)=>{let a=wr.sets?.length??0;try{return r(...i)}catch(r){throw r instanceof m&&(e.isLazy===!0||!(r instanceof n))?(wr.sets&&(wr.sets.length=a),Ri(t,r.message)):r}};return{...e,evaluate:r(e.evaluate),evaluateUnary:e.evaluateUnary&&r(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&r(e.evaluateBinary)}},Bi=(e,t)=>{if(typeof e!=`number`)throw Ri(t,`Cannot cast tlc2.value.impl.${Ii(e)} to tlc2.value.impl.IntValue`);return e},Vi=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Hi=(e,t,n,r)=>{let i=Vi(e,n,`IntValue`,2);return ki(t,(e,n)=>{let a=Bi(e,i),o=Bi(n,i),s=r(a,o);if(Ai(s))throw ji(`${a}${t}${o}`);return s})},Ui=(e,t,r)=>{if(typeof e!=`number`)throw new n(`The ${t} argument of ${r} should be an integer, but instead it is:\n${L(e)}`);return e},Wi=(e,t,n=e)=>ki(e,(e,r)=>t(Ui(e,`first`,n),Ui(r,`second`,n))),Gi=(e,t,n)=>({...Oi(e,t,n),isLazy:!0}),Ki=(e,t,n)=>{let r=Ti(e,t,n);return()=>r.call([])},qi=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Ji=()=>({bool:Lu,condition:(e,t)=>{if(typeof e!=`boolean`)throw bu(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw xu(t,n,e);return e},apply:Lr,expectFunction:Pu,tuple:Yn,set:Nn,record:Zn,writtenRecord:pt,equal:Xt,enumerate:Wu,unassigned:(e,t)=>{throw Ou(e,t)},primeOutsideAction:e=>{throw Au(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:Fu,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>Mu(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),Yi={value:void 0},Xi={isAllowed:void 0},Zi=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Qi=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),$i=e=>`local${e.counter++}`,ea=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),Je(e).forEach(e=>ea(e,t)),t),ta=(e,t,n)=>{let r=Qi(e,V(t,e.environment)),i=ea(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Qi(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},na=(e,t,n)=>{let r=t.kind===`Forall`,i=JSON.stringify(r?`the body of \\A`:`the body of \\E`),a=`quantifier${e.counter++}`,o=[...n.locals.values()],s={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(n.locals)},c=t.bounds.map(()=>$i(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${oa(e,t.set,s)}, ${Qi(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=$i(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${oa(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=$i(e),a=$i(e),o=$i(e),s=c[r];return`for (let ${i} = 0, ${a} = ${s}.low, ${o} = ${a} === undefined ? ${s}.length : ${s}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${s}[${i}] : ${a} + ${i}; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; let applied; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},ra=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${oa(e,r[0],n)}, "the left side of =>") ? bool(${oa(e,r[1],n)}, "the right side of =>") : true)`;if(k(t))return ta(e,t,n);let i=md(t.operator,e.environment);if(i?.kind!==`Builtin`)return ta(e,t,n);if(i.name===`DOMAIN`)return`${Qi(e,wu(t))}(${oa(e,r[0],n)})`;if(i.name===`TLCEval`)return ta(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Qi(e,Tu(t,i))}(${oa(e,r[0],n)}, ${oa(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Ud(r[0],a))return`${Qi(e,i.evaluateUnary)}(${oa(e,r[0],n)})`;let o=r.length===2&&Ud(r[0],a)&&Ud(r[1],a);return i.evaluateBinary&&o?`${Qi(e,i.evaluateBinary)}(${oa(e,r[0],n)}, ${oa(e,r[1],n)})`:ta(e,t,n)},ia=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(k(e))return!1;let r=Td(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return ia(e.expression,t,n);case`FieldAccess`:return ia(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>ia(e,t,n));default:return!1}},aa=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return aa(e.record);case`FunctionApplication`:return[e.function,...e.args].every(aa);default:return!1}},oa=(e,t,n)=>{let r=(t,r=n)=>oa(e,t,r);switch(t.kind){case`Number`:return lt(t.value)?String(t.value):ta(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 ta(e,t,n);let i=Td(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Qi(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Qi(e,i.value):ta(e,t,n)}case`Apply`:return ra(e,t,n);case`And`:case`Or`:{let n=Qi(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)}, ${Qi(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Qd(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${ia(t.function,n,e.environment)?r(t.function):aa(t.function)?r(t.function,i):ta(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Qi(e,t)}))`,o=Cu(e.environment.runtime.version),s=o?`, ${Qi(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`${Qi(e,Su(t))}(${r(t.record)})`;case`Record`:{let i=of(t.fields);if(sf(i))return ta(e,t,n);let a=Qi(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}, ${Qi(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:{let i=Qi(e,t);if(n.isPrimed)return`primeOutsideAction(${i})`;let a={context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals};return`(${n.next} === undefined ? primeOutsideAction(${i}) : ${r(t.expression,a)})`}case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?na(e,t,n):ta(e,t,n);default:return ta(e,t,n)}},sa=(e,t)=>{if(!qi.has(e.kind)||(Xi.isAllowed??=Zi(),!Xi.isAllowed))return;let n={environment:t,references:[],helpers:[],counter:0},r=oa(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
|
|
87
87
|
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;Yi.value??=Ji();let o=Yi.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},ca={general:1e3,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,behaviorUpToThisPoint:2121,backToState:2122,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,finished:2186,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,temporalBranches:2212,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,version:2262,noSpecificationButProperty:2257,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001},la={none:0,error:1,warning:3,state:4},ua={0:``,1:`Error: `,3:`Warning: `,4:`State `},da=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===la.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
|
|
88
88
|
(Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${ua[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},fa=`The configuration file did not specify the initial state predicate.
|
|
89
89
|
Can also be caused by trying to run TLC on a specification from
|
|
90
|
-
a module imported with a parameterized INSTANCE statement.`,pa=[[1005,
|
|
90
|
+
a module imported with a parameterized INSTANCE statement.`,pa=[[1005,y,!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:
|
|
91
91
|
%1%`,!0],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
|
|
92
92
|
%1%,
|
|
93
93
|
but it produced the following error:
|
|
@@ -132,11 +132,11 @@ It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the
|
|
|
132
132
|
: `],[2105,`failed.
|
|
133
133
|
`],[2154,`but it produced the following error:
|
|
134
134
|
`],[2213,`:
|
|
135
|
-
`],[2281,` - specifically: `]]),ba=(e,t,n)=>{let r=n?ya.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)}${xa(t.slice(a),n)}`},xa=(e,t)=>{let n=t?_a(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${la.none} @!@!@\n${ba(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},Sa=e=>String(e).padStart(2,`0`),Ca=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 ${Sa(r%24)}h`:e>36e5?`${Sa(r%24)}h ${Sa(n)}min`:e>6e4?`${Sa(n)}min ${Sa(t)}s`:`${Sa(t)}s`},wa=e=>`${e.getFullYear()}-${Sa(e.getMonth()+1)}-${Sa(e.getDate())} ${Sa(e.getHours())}:${Sa(e.getMinutes())}:${Sa(e.getSeconds())}`,Ta=/* @__PURE__ */ new WeakMap,Ea=(e,t,n)=>{if(!(e instanceof
|
|
136
|
-
`)),ka=`${
|
|
137
|
-
from outside that declaration's scope.`,wo=(e,t,n,r,i,a)=>{let o=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:b(r),message:n})},s=n.isSuffices===n.isInProof,c=n.statement,l={node:c,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,u=l.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return u.kind!==`NewSymbol`&&u.kind!==`AssumeProve`&&xo(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:bo(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?yo(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&vo(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${Co}`);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=So(n.operand);if(l.isSufficesOpen){if(uo(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=xo(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?io(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=ho(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:go(e);if(!c)return;let f=uo(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=uo(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(vo(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${Co}`);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.`))},To=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:b(e.location.range),message:n}),!0)},Eo=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=b(r),a=e.params.filter((r,i)=>{let a=Ka(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:b(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},Do=(e,t,n,r)=>{if(!_o(e))return!1;let i=po(e),a=i[0],o=i.length>1&&a.kind===`Name`?Ka(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&wo(e,i,o,t,n,r),o!==void 0},Oo=(e,t,n,r)=>{let i=e.location;if(Ro(e,n,r))return;let a=za.get(e);if(a!==void 0)return a;if(Ba(t))return e.kind===`Apply`?e.args.length:0;let o=Ka(n,t);if(o?.isNonFact){r.errors.push({location:b(oo(e,t)),message:`Step number of non-expression step used as an expression.`});return}if(Do(e,n,r,!1)||lo(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=Ia),o)return o.arity;let s=ro(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,za.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(Ka(n,c)!==void 0||ro(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=(e.kind===`Identifier`?void 0:e.spelling)??t,u=b(e.kind===`Apply`&&l===`-.`?ao(i,`-`):oo(e,t));if(!co(t)||lo(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=so(e);d&&i.range&&r.errors.push({location:b(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},ko=(e,t,n)=>(e.forEach(e=>z(e.set,t,n)),e.reduce((e,t)=>Qa(e,eo(t.pattern),t.pattern.ranges,n),t)),Ao=(e,t)=>e.kind===`Identifier`&&e.name===t&&O(e)||Ye(e).some(e=>Ao(e,t)),jo=(e,t)=>{e.kind===`FunctionConstruction`&&Ao(e.body,t)&&(e.isRecursive=!0),Ye(e).forEach(e=>jo(e,t))},Mo=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?to(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:b(o),message:e})},c=e.kind===`Function`?ko(e.bounds,t,i):$a(t,e.params,i),l=Ka(c,a)??qa(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),jo(e.body,a),e.isSelfReferential=Ao(e.body,a)):z(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:Ya(a,Ka(t,a)??qa(a,i,o),{kind:`Definition`,arity:Ua(e),range:o},i)},No=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Ka(e,t.name)?.isPending)return e;let n={name:t.name,arity:Ua(t),params:Wa(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)=>Wo(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Ba(t.name)?e:s(e,e=>!Ha(t.location,e.location)),o={name:t.name,arity:Ua(t),kind:`Definition`,range:t.location.range,parent:a};if(Ga(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Ba(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return Mo(t,a,u,i)?{...o,params:Wa(t)}:a},a),()=>!0)},Po=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Ka(t,r)??qa(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},Fo=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=Po(e.kind===`Identifier`?e.name:e.operator,t,n),i=e.kind===`Apply`?e.argumentCounts?.[0]??0:0;if(!r||i===r.arity)return!1;let a=(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??e.location.range;return a&&n.errors.push({location:b(a),message:`The operator ${r.name} requires ${r.arity} arguments.`}),!0},Io=(e,t,n)=>{if(Fo(e,t,n))return;let r=e.operator,i=io(r,t,n),a=Oo(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:b(e.argumentsRange??oo(e,r)),message:`The operator ${r} requires ${a-(Po(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>Lo(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:b(e),message:t})};e.args.map((i,a)=>{let c=o[a]??0,l=i.location.range;if(c===0){if(i.kind===`Lambda`&&i.operator!==void 0)s(l,`The operator ${i.operator} requires 1 arguments.`);else if(i.kind===`Lambda`&&l)s(l,`LAMBDA expression used where an expression is required.`);else if(i.kind===`OperatorReference`){let e=Oo(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&&La.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)??oo(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=io(u,t,n)?.params??[],f=Oo(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(oo(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.`)})},Lo=(e,t,n)=>{e.kind===`Identifier`?Oo(e,e.name,t,n):z(e,t,n)},Ro=(e,t,n)=>{let r=Ra.get(e);return r?(r.args.forEach(e=>Lo(e,t,n)),n.errors.push(r.error),!0):!1},z=(e,t,n)=>{if(La.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(Fo(e,t,n))return;let r=e.name,i=Oo(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:b(oo(e,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:Oo(e,e.operator,t,n);return;case`Apply`:Io(e,t,n);return;case`Lambda`:z(e.body,Qa(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,No(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:z(e.body,ko(e.bounds,t,n),i(to(e.bounds)));return;case`UnboundedQuantifier`:z(e.body,Qa(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&z(e.set,t,n),z(e.body,Qa(t,eo(e.pattern),e.pattern.ranges,n),i(eo(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:z(e.predicate,ko([e.bound],t,n),i(eo(e.bound.pattern)));return;case`SetMap`:z(e.expression,ko(e.bounds,t,n),i(to(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:b(r.location.range??ao(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(To(e,n))return;z(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),Eo(e,t,n);return;case`Subexpression`:if(Ro(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Lo(e,t,n)),Do(e,t,n,!1)}},zo=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||Fo(e,t,n)||Do(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&Ka(t,r)?.isNonFact?n.errors.push({location:b(oo(e,r)),message:`Step number of non-fact used as a fact`}):n.facts.has(r)||z(e,t,n)}),Bo=(e,t,n)=>(e.set&&z(e.set,t,n),Xa(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Vo=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Bo(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Vo(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},Ho=(e,t,n)=>e.kind===`AssumeProve`?Vo(e,t,n):(z(e,t,n),t),Uo=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&zo(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Go(t,e,r),t)},Wo=(e,t,n)=>{let r=Zo(e,t,n);return e.name===void 0?r:Xa(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Go=(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=Ho(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Uo(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Uo(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 zo(r.facts,t,n),o(t);case`Instance`:return o(Wo(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?Wo(t,e,i):No([t],e,n),t));case`Have`:case`Case`:return z(r.expression,t,i),Uo(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>z(e,t,i)),a(t);case`Take`:return a(Qa(ko(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Qa(ko(r.bounds,t,i),r.names,r.nameRanges,i);return z(r.body,o,{...i,labelParams:[...i.labelParams,...to(r.bounds),...r.names]}),Uo(e.proof,a(t),n),a(o)}default:return Uo(e.proof,a(t),n),a(t)}},Ko=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Ho(e.statement,void 0,t);e.name!==void 0&&Za(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Uo(e.proof,n,t),r&&(r.isInProof=!1)},qo={line:0,column:0},Jo=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Yo=(e,t)=>{let n=new Map([...Va,...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},Xo=(e,t,n,r,i)=>{let a=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),r),o=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){z(n,a,i);return}let r=Oo(n,n.name,a,i);if(r!==void 0&&r!==t.arity)throw new l(`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},s=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){i.errors.push({location:b(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let a=e.expression;o(r,a);let c=a.location.range;s.has(n)?c&&i.errors.push({location:b(c),message:`Multiple substitutions for symbol '${n}' in substitution.`}):s.set(n,a)});let c=t.filter(e=>!s.has(e.name)),u=e=>!Ka(a,e.name)&&!ro(e.name,i);return c.filter(e=>!u(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};o(t,n),s.set(t.name,n)}),c.filter(u).forEach(t=>{let r=e.location.range,a=t.location.range;r&&a&&i.errors.push({location:b(r),message:`Substitution missing for symbol ${t.name} declared at ${b(a)} \nand instantiated in module ${n}.`})}),s},Zo=(e,t,n)=>{let r=n.getInstance(e);return Xo(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Xa(e,t,r,n),t)},Qo=(e,t,n,r)=>{let i=Yo(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Xo(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:qo}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},$o=(e,t)=>{let n=[],r=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>Ha(e.location,t.location)?-1:+!!Ha(t.location,e.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof l)||!e.sany&&i.length===0)throw e;i.push(...e.sany?.errors??[])}i.forEach(e=>r(n,e)),a.forEach(e=>r(t,e))}),n},es=(e,t)=>{let n=Yo(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([...Va,...t.bound].map(([e,t])=>[e,{...t,position:qo}])),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)=>Za(e.name,{kind:t,arity:e.arity,range:e.location.range},c(e.location,void 0,n,r,!1))}));return $o([...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=Ya(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);Jo(e,t)?z(t.body,void 0,i):Mo(t,void 0,i,o)&&a.set(t.name,{kind:`Definition`,arity:Ua(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);$a(void 0,e.params,i),t.instanced.get(e)?.forEach((e,t)=>Za(t,e,i)),e.name!==void 0&&Za(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&&Za(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>Ko(e,c(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>zo(e.facts,void 0,c(e.location,void 0,t,n,!1))})),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:b(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},ts=/* @__PURE__ */ new WeakSet,ns=/* @__PURE__ */ new WeakSet,rs=(e,t,n=/* @__PURE__ */ new Set)=>{let r=ls(e,(e,r)=>rs(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&O(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&O(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},is=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),as=/* @__PURE__ */ new WeakMap,os=e=>as.get(e)??e.name,ss=(e,t)=>(os(t)!==e.name&&as.set(e,os(t)),e),cs=(e,t)=>ss(e.kind===`Function`?{...e,bounds:is(e.bounds,e=>t(e,[])),body:t(e.body,to(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),ls=(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=>cs(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:is(e.bounds,n),body:t(e.body,to(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,eo(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,eo(e.bound.pattern))};case`SetMap`:return{...e,bounds:is(e.bounds,n),expression:t(e.expression,to(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)}}},us=`LAMBDA`,ds=(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 ls(e,(e,n)=>(r.push(...ds(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},fs=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}},ps=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),ms=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},hs=(e,t)=>e.map(e=>({pattern:ms(e.pattern,t),set:e.set})),gs=(e,t)=>e.kind===`Function`?{...e,bounds:hs(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},_s=(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=>ss({...gs(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:hs(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:ms(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:ms(e.bound.pattern,n),set:e.bound.set}};default:return e}},vs=e=>`${e}@ENABLED`,ys=(e,t)=>e.modes.get(t)??e,bs=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!O(e)&&t.instantiation.variables.has(e.name),xs=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>xs(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(bs(e,t,n))return[e.name];let r=O(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?xs(r.body,t,/* @__PURE__ */ new Map):void 0},Ss=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return bs(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:vs(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Ds(e.expression,ys(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Ds(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Ds(e.subscript,ys(t,`Primed`),n),location:r},Ds(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=xs(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:vs(r),location:e.location},location:e.location},Ds({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Cs=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:Ia}),ws=(e,t)=>e.map(e=>Cs(e.name,t)),Ts=(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:[...ws(t,r),...i.map(e=>Cs(e,r))],location:r},location:r}},Es=(e,t)=>e.instantiation.isParameterized(t)?ks(e,t):void 0,Ds=(e,t,n)=>{let r=e=>Ds(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!O(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Ds(e.expression,ys(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:Ds(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},ys(t,`Enabled`),n)};let s=Ss(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return ts.add(n),n;let r=Es(t,e.name);if(r===void 0)return e;if(a.length===0)return{...e,name:r};let o=i.getDefinition(e.name);return o&&Ua(o)>0?Ts(r,a,Ua(o),e.location):{kind:`Apply`,operator:r,args:ws(a,e.location),location:e.location}}if(e.kind===`Apply`&&o(e.operator)){let n=e.args.map(r),o=i.substitutions.get(e.operator),s=i.substitutions.size>0||a.length>0||ns.has(e),c=e=>(s&&ns.add(e),e);if(o?.kind===`Identifier`||o?.kind===`OperatorReference`){let t=o.kind===`Identifier`?o.name:o.operator;return c({...e,operator:t,args:n,resolution:o.kind===`Identifier`?o.resolution:void 0})}if(o?.kind===`Apply`)return c({...e,operator:o.operator,args:[...o.args,...n],resolution:o.resolution});if(o?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:us,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:us,args:n,resolution:Ia},location:e.location};if(o)throw new l(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=Es(t,e.operator);return u===void 0?c({...e,args:n}):{...e,operator:u,args:[...ws(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=Es(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?Ts(n,a,Ua(r),e.location):{...e,operator:n}}let c=fs(t),u=ls(e,(e,i)=>i.length===0?r(e):Ds(e,t,ps(n,i,c)));return _s(u,n,c)},Os=(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:Cs(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},ks=(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=fs(e),o=gs(cs(i,(t,n)=>Ds(t,e,ps(/* @__PURE__ */ new Map,n,a))),a);return Os(o,r.params,i.location)}):t},As=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>ds(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=>Es(i,e)??e,getQualifiedKey:t=>{let n=Es(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Os(r,e.params,r.location)):t}}},js=e=>e.kind===`Let`&&e.instances!==void 0||Ye(e).some(js),Ms=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=ls(e,e=>Ms(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Ha(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}},Ns=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Ps=(e,t)=>e.definitions.some(e=>js(e.body))||e.assumptions.some(e=>js(e.expression))||e.theorems.some(e=>{let t=Ns(e);return t!==void 0&&js(t)})?{...e,definitions:e.definitions.map(e=>cs(e,e=>Ms(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Ms(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Ns(e);return n===void 0?e:{...e,statement:Ms(n,t,[])}})}:e,Fs=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}])),Is={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]}},Ls=(e,t)=>{let n=Is[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Rs=(e,t)=>`${e}${t}`,zs=(e,t,n)=>`${e}${t}${n}`,Bs=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Vs=(e,t,n)=>`${e},${t},${n}`,Hs=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Us=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Ws=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Gs=(e,t,n,r)=>({...Hs(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Ks=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,qs=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Js=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,{...Gs(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Ys=Gs(`$Set`,0,[2],[1]),Xs=Gs(`$Junction`,0,[3],[1]),Zs=Gs(`$Choose`,0,[2],[1]),Qs=Gs(`$Function`,0,[3],[1]),$s=Gs(`$FcnApply`,0,[2,2],[1,1]),ec=Gs(`$RcdSelect`,0,[2,0],[1,1]),tc=Gs(`'`,2,[1],[0]),nc=Gs(`ENABLED`,1,[2],[0]),rc=Gs(`[]`,3,[3],[0]),ic=Gs(`$SquareAct`,2,[2,1],[0,0]),ac=Gs(`$WF`,3,[1,2],[0,0]),oc=Gs(`$TemporalExists`,3,[3],[0]),sc=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),cc=e=>e.map(e=>({name:e,arity:0})),lc=(e,t)=>t.location.range?s(`${e}.`,t.location.range):new l(`${e} at line ${t.location.line}, column ${t.location.column}`),uc=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),dc=e=>e.kind!==`Let`&&e.kind!==`Label`,fc=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=Js.get(t)??Fs.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=Hs(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(zs(e,n,t))}),t.data.constraints.forEach((e,t)=>Us(r.constraints,t,e)),Ws(r.argConstraints,Rs(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Ws(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);if(t.forEach((t,n)=>{if(!(t.operator||t.declared)&&t.data.level>Ks(e,n))throw new l(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new l(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(Vs(t,n,r)),s=Hs(Math.max(e.level,...t.filter((t,n)=>qs(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>s.params.add(e)),t.forEach((t,n)=>{qs(e,n)===1&&t.data.params.forEach(e=>s.params.add(e))}),n.forEach(e=>e.params.forEach(e=>s.params.add(e))),r.forEach(e=>s.params.delete(e)),e.constraints.forEach((e,t)=>Us(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Us(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Us(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Us(s.constraints,t,Ks(e,n))})),t.forEach((e,n)=>{let r=e.operator;r&&t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>Us(s.constraints,e,Ks(r,a)))}))}),e.argParams.forEach(e=>{let t=Bs(e),n=a(t.operator)?.operator;n&&Us(s.constraints,t.param,Ks(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Ws(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>Ws(s.argConstraints,Rs(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&Ws(s.argConstraints,Rs(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=Bs(e),n=a(t.operator);n&&Ws(s.argConstraints,Rs(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Bs(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=Bs(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(zs(n.declared.name,t.index,t.param));else{let n=a(t.param);if(!n){s.argParams.add(e);return}n.data.params.forEach(e=>s.argParams.add(zs(t.operator,t.index,e)))}}),t.forEach((e,n)=>{let r=e.declared;r&&t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>s.argParams.add(zs(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=g(`LAMBDA`,cc(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=Hs();return e.params.add(r),{data:e,declared:{name:r,arity:i.arity}}}}return{data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),s=(e,t,n,r=[],a=[])=>{let s=sc(n,cc(a));return i(e,o(t,s),r.map(e=>m(e,n)),a)},c=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw lc(`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 lc(`Action used where only temporal formula or state predicate allowed`,e);uc.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&dc(n)&&n.kind!==r)throw lc(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)=>Us(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Ws(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof l)||t.sany?t:lc(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Hs();case`Identifier`:return c(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return d(e,r),c(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t);return u(n,e),i(Xs,n)}case`Prime`:case`Unchanged`:return s(tc,[e.expression],t);case`Enabled`:return s(nc,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(rc,[n])}case`If`:return s(Xs,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(Xs,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=s(Xs,[e.body],t,e.bounds.map(e=>e.set),to(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw lc(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?oc:Xs,[e.body],t,[],e.names);case`Choose`:return s(Zs,[e.body],t,e.set?[e.set]:[],eo(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(Ys,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(Ys,[e.predicate],t,[e.bound.set],eo(e.bound.pattern));case`SetMap`:return s(Ys,[e.expression],t,e.bounds.map(e=>e.set),to(e.bounds));case`FunctionConstruction`:return s(Qs,[e.body],t,e.bounds.map(e=>e.set),to(e.bounds));case`Record`:return s(Qs,e.fields.map(e=>e.value),t);case`RecordSet`:return s(Ys,e.fields.map(e=>e.value),t);case`Except`:return s(Ys,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i($s,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(Ys,e.args,t)}]);case`Bracket`:return Hs();case`FieldAccess`:return i(ec,[a(e.record,t),{data:Hs()}]);case`BoxAction`:case`AngleAction`:return s(ic,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(ac,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Hs()}},ee=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>ee(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return Ye(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,sc(t,cc(e.names))),i;default:return ls(e,(e,n)=>(a(e,r,sc(t,cc(n))),e)),i}},g=(e,t,n,r)=>{let i=sc(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=ee(n,i),c={...Hs(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(Rs(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(zs(e.name,n,t.name))).map(e=>Vs(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(Bs(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Bs(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,{...Hs(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=g(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:_,toOperand:a}},pc=(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`?pc(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Hs(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Us(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ws(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},mc=(e,t,n,r)=>{let i=fc(t),o=e=>Math.max(0,...e.map(e=>i.analyze(e,/* @__PURE__ */ new Map).level)),s=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?o([t.expression]):t.kind===`Witness`?o(t.expressions):t.kind===`Take`?o(t.bounds.map(e=>e.set)):t.kind===`Pick`?o([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?pc(t.statement,/* @__PURE__ */ new Map,i).level:o([t.statement]):0},c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=b(e.statement),n=()=>s(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...c(e.proof)]:e.body.kind===`Qed`?c(e.proof):[]}):[],l=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>s(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>o([e.set])!==0).flatMap(e=>e.set.location.range?[{location:b(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(e.proof),...r,...e.proof?.kind===`Steps`&&n()?c(e.proof):[]]}):[],u=$o([...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`?pc(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...l(e.proof),...t.level===3?c(e.proof):[]];if(n.length>0)throw a(n)}})),...n],r);if(u.length>0)throw a(u,!1,void 0,r)},hc=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),gc=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),_c=/* @__PURE__ */ new Set([...hc,...gc,`Enabled`]),vc=/* @__PURE__ */ new Set([`~>`,`-+->`]),yc=/* @__PURE__ */ new Set([...vc,`\\cdot`]),bc=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),xc=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),Sc=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},Cc=(e,t)=>bc.has(e)||t.builtins.get(e)?.isStateLevel===!0,wc=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(hc.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(gc.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&vc.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(_c.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&yc.has(e.operator))&&(r[0]|=1),_c.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=Sc(e);if(u!==void 0&&!O(e)){let e=t.substitutions.get(u)??u,n=t.definitions.get(e),a=t.constants.has(u),o=t.variableIndex.get(u);if((o!==void 0||t.builtins.get(u)?.isStateLevel)&&(r[0]|=1),o!==void 0&&(l&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:l});else{Cc(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),xc.has(u)&&(r[0]|=8),!a&&Cc(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=32)}}Ye(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},Tc=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],Ec=(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},Dc=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),Oc=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=wc(Tc(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=Ec(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=Ec(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!Dc(t[e],l[e*r])))),p=Ec(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}},kc=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?Ac(Tc(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},Ac=(e,t)=>{let n=t.facts.words,r=wc(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=kc(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]}Dc(e.callee,r[0])||(i[0]|=r[0]&14)}),i},jc=(e,t)=>!(kc(e,t)[0]&1),Mc={any:2,repeated:4,streamed:8},Nc=(e,t,n=`any`)=>(kc(e,t)[0]&Mc[n])!==0,Pc=(e,t)=>{let n=kc(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},Fc=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},Ic=(e,t)=>{let n=Ac([e],t);return n[0]&16?void 0:Fc(n)},Lc=(e,t)=>!!(Ac([e],t)[0]&1),Rc=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=wr.sets,a=i??[],o=a.length;wr.sets=a;try{return n()}catch(e){throw Nd(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,wr.sets=i}},zc=(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},Bc=e=>!e.includes(void 0),Vc=e=>e.variables.map(()=>void 0),Hc=(e,t,n)=>{let r=[...e];return r[t]=n,r},Uc=(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}},Wc=e=>e.kind===`Identifier`?e.name:void 0,Gc=(e,t,n)=>{if(t.kind===`Label`)return Gc(e,t.body,n);let r=Wc(t);if(r===void 0)return;let i=Ou(n,r);if(i?.kind===`Thunk`)return Gc(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=dd(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?Gc(e,o.body,o.scope):void 0},Kc=(e,t,n)=>{if(t.kind===`Prime`)return Gc(e,t.expression,n);if(t.kind===`Label`)return Kc(e,t.body,n);let r=Wc(t);if(r===void 0)return;let i=Ou(n,r);if(i?.kind===`Thunk`)return Kc(e,i.expression,i.scope);if(i)return;let a=dd(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?Kc(e,a.body,a.scope):void 0},qc=e=>{if(typeof e!=`boolean`)throw new h(`TLC expected a boolean expression.`);return e},Jc=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Yc=(e,t,n)=>{t===void 0?Bc(n)&&e.onState(n):Bc(n)&&Jc(e)?Zc(e,t,n):t.kind===`Predicate`?Qc(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?sl(e,t.expression,t.rest,t.scope,n):Xc(e,t,n)&&Yc(e,t.rest,n)},Xc=(e,t,n)=>{let r=e.environment,i=H(t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return H(t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?Eu(t,r.runtime.version):t}})();return!Zt(i,a)},Zc=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){sl(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!Xc(e,r,n):!qc(H(r.expression,zc(e,r.scope,n))))return}e.onState(n)},Qc=(e,t,n,r,i)=>Rc(e,t,()=>{switch(t.kind){case`Let`:Qc(e,t.body,n,Ed(t.definitions,zc(e,r,i)),i);return;case`Label`:Qc(e,t.body,n,r,i);return;default:if(al.has(t.kind))throw new h(`The state relation is not a boolean expression.`);Rc(e,t,()=>ol(e,t,n,r,i))}}),$c=(e,t,n,r)=>{qc(t)&&Yc(e,n,r)},el=(e,t,n,r,i)=>{let a=zc(e,r,i);if(t.kind===`Identifier`){let o=Ou(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){Qc(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){Qc(e,o.operator.body,n,o.operator.scope,i);return}let s=o?void 0:e.environment.definitions.get(t.name),c=o?void 0:dd(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&jc(s,e.environment))){Qc(e,c.body,n,c.scope,i);return}$c(e,H(t,a),n,i);return}let o=fd(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?Qc(e,o.body,n,wd(o,t.args,a),i):$c(e,H(t,a),n,i)},tl=(e,t,n,r,i)=>{let a=n[r];a===void 0?Yc(e,t,Hc(n,r,i)):Zt(a,i)&&Yc(e,t,n)},nl=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),rl=(e,t,n,r,i)=>{let[a,o]=t.args,s=e.isInit?Gc(e,a,r):Kc(e,a,r),c=zc(e,r,i);if(s===void 0){H(t,c)===!0&&Yc(e,n,i);return}let l=H(o,c),u=i[s];if(t.operator===`=`){tl(e,n,i,s,l);return}let d=t.operator===`\\subseteq`?{kind:`Subset`,base:l}:l;if(u!==void 0)H(t,c)===!0&&Yc(e,n,i);else{if(!Qn(d))throw new h(`The right side of \\IN is not enumerable.`);for(let t of dr(d))Yc(e,n,Hc(i,s,t))}},il=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),al=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),ol=(e,t,n,r,i)=>{let a=zc(e,r,i);switch(t.kind){case`Identifier`:el(e,t,n,r,i);return;case`Apply`:if(il.has(t.operator)&&t.args.length===2){rl(e,t,n,r,i);return}if(t.operator===`=>`&&t.args.length===2){if(qc(H(t.args[0],a))){Qc(e,t.args[1],n,r,i);return}Yc(e,n,i);return}el(e,t,n,r,i);return;case`And`:{let a=t.operands;if(t.isBulleted||a.length===2){let t=a.slice(1).reduceRight((e,t)=>nl(`Predicate`,t,r,e),n);Qc(e,a[0],t,r,i);return}let o=a[a.length-1];Qc(e,Uc(t,a.length-1),nl(`Predicate`,o,r,n),r,i);return}case`Or`:{let a=t.operands;if(t.isBulleted||a.length===2){a.forEach(t=>Qc(e,t,n,r,i));return}Qc(e,Uc(t,a.length-1),n,r,i),Qc(e,a[a.length-1],n,r,i);return}case`Exists`:Ku(t.bounds,a,r=>(Qc(e,t.body,n,r,i),!1));return;case`Forall`:{let r=[];if(Ku(t.bounds,a,e=>(r.push(e),!1)),r.length===0){Yc(e,n,i);return}let o=r.slice(1).reduce((e,n)=>nl(`Predicate`,t.body,n,e),n);Qc(e,t.body,o,r[0],i);return}case`If`:Qc(e,qc(H(t.condition,a))?t.consequent:t.alternative,n,r,i);return;case`Case`:{let o=t.arms.find(e=>qc(H(e.condition,a)))?.body??t.other;if(o===void 0)throw new h(`TLC encountered a CASE with no conditions true.`);Qc(e,o,n,r,i);return}case`FunctionApplication`:{let r=Zu(H(t.function,e.isInit?a:Mu(a)));if(r){Qc(e,r.body,n,Qu(r,t,a),i);return}break}case`Unchanged`:if(!e.isInit){sl(e,t.expression,n,r,i);return}break;case`BoxAction`:if(!e.isInit){Qc(e,t.action,n,r,i),sl(e,t.subscript,n,r,i);return}break;case`AngleAction`:if(!e.isInit){Qc(e,t.action,nl(`Changed`,t.subscript,r,n),r,i);return}}$c(e,H(t,a),n,i)},sl=(e,t,n,r,i)=>Rc(e,t,()=>{let a=Gc(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&tl(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){Yc(e,n,i);return}let s=o.reduceRight((e,t)=>nl(`Unchanged`,t,r,e),n);sl(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=Ou(r,t.name);if(a?.kind===`Thunk`){sl(e,a.expression,n,a.scope,i);return}let o=a?void 0:dd(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){sl(e,o.body,n,o.scope,i);return}}let o=e.environment,s=H(t,{environment:o,scope:r,state:e.current,next:void 0}),c=H(t,{environment:o,scope:r,state:i,next:void 0});Zt(s,c)&&Yc(e,n,i)}),cl=(e,t,n,r,i=!1)=>{let a=e.callStack;if(!a)throw Error(`The replay needs an environment that records its call stack`);return{environment:e,callStack:a,isInit:t,isEnabled:i,current:n,onState:r}},ll=/* @__PURE__ */ Error(`The replay found a successor`),ul=(e,t,n,r)=>{let i=cl(r,!1,n,()=>{throw ll},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=nl(`Changed`,e.subscript,t,void 0);Qc(i,e.action,n,t,Vc(r))}else Qc(i,e,void 0,t,Vc(r));return!1}catch(e){if(e!==ll)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},dl=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=cl(t,!0,void 0,n),o=i.reduceRight((e,t)=>nl(`Predicate`,t.expression,t.scope,e),void 0);Qc(a,r.expression,o,r.scope,Vc(t))},fl=(e,t,n,r)=>{e.some(e=>al.has(e.expression.kind))||e.forEach(e=>{let i=[],a=cl(n,!1,t,e=>i.push(e));Qc(a,e.expression,void 0,e.scope,Vc(n)),i.forEach(t=>r(t,e))})},pl=/* @__PURE__ */ new WeakMap,ml=/* @__PURE__ */ new WeakMap,hl=(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},gl=(e,t,n)=>{let r=e.slice();return r[t]=n,r},_l=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,vl=(e,t)=>{let n=new h(t);return e.isInit?n:o(n,m.error)},yl=(e,t,n,r)=>{let i=gu(n);return r&&al.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 ${_l(e)}, TLC expected a boolean expression,\nbut instead found ${I(t)}.\n${i}`},bl=(e,t,n)=>{let r=Li(t),i=B(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 ${_l(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
138
|
-
`:``}${i}`},xl=(e,t,n)=>Sl(e,t,H(t,n)),Sl=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;throw vl(e,yl(e,n,t,r))},Cl=(e,t,n,r)=>r.environment.callStack?H(n,r):(e[t]??=Id(n,r.environment))(r),wl=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Tl=(e,t,n)=>{let r=n?pl:ml,i=r.get(e);if(i)return i;let a=nu(e,t,n);return r.set(e,a),a},El=(e,t)=>{if(t.constants.has(e))return;let n=Fu(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},Dl=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return Dl(e.expression,t,!1,r);if(e.kind!==`Identifier`||O(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=El(e.name,t);if(a&&!r.has(a))return r.add(a),Dl(a.body,t,n,r)},Ol=(e,t,n)=>Dl(e,t,!n),kl=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return kl(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Ed(e.definitions,hl(r,t,n));return kl(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Ou(t,e.name);if(a?.kind===`Thunk`)return kl(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=El(e.name,r.environment);if(s)return kl(s.body,void 0,n,r,i)},Al=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||O(e))||!t&&e.kind===`Prime`,jl=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>jl(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[r];let i=El(e.name,t);if(i)return n.add(e.name),jl(i.body,t,n)},Ml=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Nl=(e,t,n)=>Ml.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||wl(e.operator)&&(Al(e.args[0],n)||Ol(e.args[0],t,n)!==void 0)||O(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,Pl=/* @__PURE__ */ new Set,Fl=(e,t)=>{if(O(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return ls(e,(e,i)=>{let a=r.isReadOnly?Fl(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},Il=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||O(e)?void 0:Fu(r,t);return i&&!n.has(i)&&(n.add(i),Il(i.body,t,n))?!0:Ye(e).some(e=>Il(e,t,n))},Ll=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Ol(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=jl(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return Nl(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Tl(e,t,n)}},Rl=(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(Ic(e,t)===void 0||Il(e,t,/* @__PURE__ */ new Set))return!0;let n=Fl(e,Pl);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)}},zl=(e,t,n)=>{let r=e.map(e=>Ll(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Jc(t);for(let s=e;s<r.length;s++){if(s>0&&f&&iu(u)){d??=hl(t,n,u);for(let e=s;e<r.length;e++){let n=r[e].expression,i=Cl(a,e,n,d);if(!Sl(t,n,i,!1))return}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=hl(t,n,u);let r=Cl(i,s,e.expression,d);if(!Sl(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=hl(t,n,u);let r=Cl(i,s,e.value,d),a=u[e.index];if(a===void 0)u=gl(u,e.index,r),d=void 0;else if(!Zt(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let t of e.indices){let e=(r??u)[t];if(e===void 0)r??=u.slice(),r[t]=n[t];else if(!Zt(e,n[t]))return}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},Bl=e=>(t,n,r,i,a,o)=>{xl(t,e,hl(t,n,r))&&o(r,i)},Vl=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=hl(r,i,a);if(a[l]!==void 0){xl(r,e,u)&&c(a,o);return}let d=H(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Qn(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${_l(r)}, the right side of \\IN is not enumerable.`;throw vl(r,`${t}\n${B(e)}`)}let p=dr(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(gl(a,l,p[e]),o)}},Hl=/* @__PURE__ */ new WeakMap,Ul=e=>{let t=Hl.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Ul),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Hl.set(e,n),n},Wl=(e,t)=>{let n=e.args[0],r=Bl(e),i=(e,r,i)=>kl(n,r,i,e,!t)??-1,a=Vl(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=H(e.args[1],hl(t,n,o));l(gl(o,u,d),s)}},Gl=(e,t,n)=>{let r=B(e);return(i,a,o,s,c,l)=>{let u=hl(i,a,o),d=H(e.function,n?u:Mu(u)),f=Zu(d);if(f!==void 0){Tl(f.body,t,n)(i,Qu(f,e,u),o,s,c,l);return}if(!A(d))throw vl(i,`In computing ${_l(i)}, a non-function (${Li(d)}) was applied as a function.\n${r}`);let p=H(e,u);if(typeof p!=`boolean`)throw vl(i,`In computing ${_l(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Kl=(e,t)=>{if(jl(e,t))return zl([Ul(e)],t,!1);if(e.kind===`Tuple`)return Tl(Ul(e),t,!1);let n=Ul(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Ou(i,e.name):void 0;l?.kind===`Thunk`?Tl(Ul(l.expression),t,!1)(r,l.scope,a,o,s,c):xl(r,n,hl(r,i,a))&&c(a,o)}},ql=(e,t,n)=>{let r=e.operator,i=Bl(e),a=O(e)?void 0:dd(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Vd(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=Tl(a.body,t,n),o.body(e,i(hl(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=hl(a,o,s),f=fd(e,d);f?.kind===`Closure`?Tl(f.body,t,n)(a,wd(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Jl=(e,t,n)=>{let r=Bl(e),i=O(e)?void 0:El(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=Ou(s,e.name);f?.kind===`Thunk`?Tl(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=Tl(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Yl=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||O(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!O(i))return;let a=Dl(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},Xl=e=>e.kind===`And`?e.operands.flatMap(Xl):[e],Zl=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&Nl(e,t,!1),Ql=e=>{let t=[];return(n,r,i)=>{let a=hl(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!Sl(n,i,Cl(t,r,i,a)))return}}},$l=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=Xl(e),r=n.findIndex(e=>!Zl(e,t)||Yl(e,t)),i=r===-1?void 0:Yl(n[r],t);return i?{...i,before:r===0?void 0:Ql(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>$l(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||O(e))return;let r=dd(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=$l(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(!i||o?.kind!==`Identifier`||!O(o))return;let s=i.before,c=s&&Vd(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(hl(e,t,n)),n))}},eu=(e,t,n)=>{let r=Ou(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},tu=(e,t,n)=>{let r=e.map(e=>Tl(e,t,n)),i=n?[]:e.map(e=>$l(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&&eu(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)}}},nu=(e,t,n)=>{let r=e=>Tl(e,t,n);switch(e.kind){case`And`:return zl(e.operands,t,n);case`Or`:return tu(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=zu(H(a.set,hl(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,ku(r,e,u[t]),o,s,c,l)}}let o=n?void 0:Rl(e,t);if(o){let r=zl(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=hl(n,i,a),d=e.bounds.map(e=>zu(H(e.set,u),e.set,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=ku(t,o.names[e],r);if(e===d.length-1){let e=hl(n,i,a);if(!o.guards.every(t=>xl(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{Ku(e.bounds,hl(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Ic(e,t)!==void 0&&!Il(e.body,t,/* @__PURE__ */ new Set)?Fl(e,Pl):void 0;return(t,n,r,o,s,c)=>{let l=[];Ku(e.bounds,hl(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Ou(n,e)?.kind===`Value`)){u.every(n=>xl(t,e.body,hl(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&iu(r)?u.slice(n).every(n=>xl(t,e.body,hl(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=H(e.condition,hl(r,i,a));if(typeof l!=`boolean`)throw vl(r,bl(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=hl(r,i,a),u=t.find(e=>{let t=H(e.condition,l);if(typeof t==`boolean`)return t;throw vl(r,`In computing ${_l(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Li(t)}) was used as a guard condition of a CASE.\n${gu(e.source)}`)})?.body??n;if(!u)throw vl(r,`In computing ${_l(r)}, TLC encountered a CASE with no conditions true.\n${B(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=Od(e.definitions,t);return(t,r,a,o,s,c)=>n(t,Ed(e.definitions,hl(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new h(`UNCHANGED appears in an initial predicate at ${mu(e)}`)}:Kl(e.expression,t);case`AngleAction`:{let n=r(e.action),i=Ul(e.subscript),a=(e,n,r)=>{try{return xl(e,i,hl(e,n,r))}catch(n){throw e.isEnabled?Eu(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,Ul(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Jl(e,t,n);case`FunctionApplication`:return Gl(e,t,n);case`Apply`:{let i=e.args;if(wl(e.operator)){let r=Ol(i[0],t,n);if(r!==void 0)return e.operator===`=`?zl([e],t,n):Vl(e,()=>r);if(Al(i[0],n))return Wl(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=H(i[0],hl(t,n,r));(typeof c==`boolean`?c:Pu(c,`the left side of => at ${mu(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return ql(e,t,n)}default:return Bl(e)}},ru=e=>e.variables.map(()=>void 0),iu=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},au=(e,t)=>{let n=t.state;if(!n||!iu(n))throw new h(`ENABLED needs a complete state at ${mu(e)}`);let r=t.environment;if(r.callStack)return ul(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return Tl(e,r,!1)(i,t.scope,ru(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},ou=(e,t,n,r)=>{let i={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};Tl(e,t,!0)(i,r,ru(t),void 0,!1,e=>{if(!i.isStopped){if(!iu(e))throw o(new te([...e]),m.error);i.isStopped=n(e)}})},su=(e,t,n)=>{let r=[];return ou(e,t,e=>(r.push(e),!1),n),r},cu=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return Tl(e,n,!1)(a,i,ru(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!iu(e)){let r=n.variables.filter((t,n)=>e[n]===void 0);throw new y(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)}o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},lu=(e,t,n,r)=>{let i=[];return cu(e,t,n,e=>(i.push(e),!1),r),i},uu=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),du=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),fu=e=>du.has(e.kind)||e.kind===`Apply`&&uu.has(e.operator),pu=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&st(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},mu=e=>`line ${e.location.line}, column ${e.location.column}`,hu=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,B=e=>{let t=e.location.range;return t?hu(t):mu(e)},gu=e=>e.kind===`Number`?e.text??String(e.value):B(e),_u=(e,t)=>new h(`A non-boolean expression (${Li(t)}) was used as the condition of an IF.\n${B(e)}`),vu=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new h(`A non-boolean expression (${Li(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${gu(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new h(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${Li(n)}.\n${B({...e,location:{...e.location,range:{...r,end:i}}})}`)},yu=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${I(n)}\n${B(e)}`,r=e=>`Attempted to apply function:\n${at(I(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!A(i))throw new h(`Attempted to select field "${t}" from a non-record value ${at(I(i))}\n${B(e)}`);let a=Ut(i);if(a===`tuple`)throw Pr(t);return Lr(i,t,a===`record`?n:r)}},bu=e=>e===`1.7.4`?(t,n)=>jr(t,n,e):void 0,xu=e=>t=>{if(!A(t))throw new h(`Attempted to apply the operator DOMAIN to a non-function\n(${Li(t)})\n${B(e)}`);return zr(t)},Su=(e,t)=>(n,r)=>{if(!k(n)||jt(n))throw new h(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${B(e)}`);return t.evaluate([n,r])},Cu=e=>o(new h(`TLC can't handle real numbers: ${e.text} at ${mu(e)}`),m.configParseError),wu=e=>o(new h(`TLC can't handle a number this big: ${e.text??e.value} at ${mu(e)}`),m.error),Tu=(e,t)=>new _(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${B(t)}`,e),Eu=(e,t)=>e instanceof _&&t!==`1.7.4`?new h(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,Du=e=>new h(`A primed expression appears outside an action at ${mu(e)}`),Ou=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},ku=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Au=(e,t,n)=>{if(t.kind===`Name`)return ku(e,t.name,n);let r=Sr(n);if(!r||r.length!==t.names.length)throw new h(`Cannot bind <<${t.names.join(`, `)}>> to ${I(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>ku(e,t,r[n]),e)},ju=(e,t)=>{if(A(e))return e;throw new h(`A non-function (${Li(e)}) was applied as a function.\n${B(t)}`)},Mu=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},Nu=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),Pu=(e,t)=>{if(typeof e!=`boolean`)throw new h(`Expected ${t} to be a boolean but found ${I(e)}`);return e},Fu=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),Iu=(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.`},Lu=(e,t,n)=>{if(!k(e)||jt(e)){let r=I(e),i=n===`1.7.4`?void 0:Iu(e,r);throw new h(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${gu(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${gu(t)}\n${i}`)}},Ru=(e,t,n)=>(Lu(e,t,n),typeof e==`object`&&e.kind===`Interval`?Gn(e):ar(e)??ur(e)),zu=(e,t,n)=>n===`1.7.4`?(Lu(e,t,n),ar(e)??dr(e)):Ru(e,t,n),Bu=e=>{if(typeof e==`object`&&e.kind===`Interval`)return vr(e),e},Vu=(e,t,n)=>Bu(e)??zu(e,t,n),Hu=(e,t,n)=>Bu(e)??Ru(e,t,n),Uu=(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},Wu=(e,t)=>e.map(e=>Vu(H(e.set,t),e.set,t.environment.runtime.version)),Gu=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Uu(t[n],t=>i(n-1,Au(a,e[n].pattern,t)));return i(e.length-1,n)},Ku=(e,t,n)=>Gu(e,Wu(e,t),t.scope,n),qu=(e,t)=>{let n=e.map(e=>H(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Ju=(e,t,n)=>{if(e.length===1)return Au(t,e[0].pattern,n);let r=Sr(n)??[];return e.reduce((e,t,n)=>Au(e,t.pattern,r[n]),t)},Yu=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Xu=e=>Object.assign(e.value,{lambda:e}),Zu=e=>Yu(e)?e.lambda:void 0,Qu=(e,t,n)=>{let r=e.value,i=t.args.map(e=>H(e,n)),a=i.length===1?i[0]:Yn(i),o=(e,n,i)=>`In applying the function\n${at(I(r))},\nthe ${e} is:\n${at(I(n))}${i}.\n${B(t.function)}`,s=e.bounds;if(s.length===1){if(!Er(a,r.domain))throw new h(o(`first argument`,a,`which is not in its domain`));return Ju(s,e.scope,a)}let c=Sr(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0||c.length<s.length)throw new h(`Attempted to apply a function to an argument not in its domain.\n${B(t.function)}`);return s.forEach((e,t)=>{let n=c[t],r=`argument number ${t+1}`;if(!Er(n,l[t]))throw new h(o(r,n,`${e.pattern.kind===`Name`?``:`
|
|
139
|
-
`}which is not in its domain`));if(e.pattern.kind===`Tuple`&&Sr(n)?.length!==e.pattern.names.length)throw new h(o(r,n,`which does not match its formal parameter`))}),Ju(s,e.scope,Yn(c.slice(0,s.length)))},$u=(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:hu(n)}},ed=(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}},td=(e,t,n)=>{let r={kind:`LazyFunction`,domain:e,source:n,apply:e=>t(e,r)};return r},nd=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),rd=(e,t)=>{let n=qu(e.bounds,t),r=td(n,(n,r)=>H(e.body,Nu(t,Ju(e.bounds,ku(void 0,e.name,r),n))),ed($u(e.bounds,e.body),e.bounds,n));return Xu({value:r,bounds:e.bounds,body:e.body,scope:ku(void 0,e.name,r)}),e.bounds.length===1?Wt(r):r},id=(e,t)=>{if(typeof t!=`object`||Ut(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!st(t.domain))return t;try{let e=F(t);return Bt(e.domain,e.range)}catch(e){if(e instanceof h)return t;throw e}},ad=(e,t)=>e.kind===`Operator`&&e.params.length>0?()=>{throw new h(`Operator ${e.name} requires ${e.params.length} arguments`)}:e.kind===`Function`?e.isSelfReferential?t=>rd(e,t):Id(nd(e),t):Id(e.body,t),od=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=ad(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(Nu(e,void 0)):e=>a[i]??r(Nu(e,void 0));return t.definitionEvaluators.set(e,o),o},sd=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},cd=(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)||!jc(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(()=>id(e,ad(e,t)(i)));An(n),t.startupValues[r]=n}catch(e){if(!(e instanceof h)&&!f(e))throw e}}),ld=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=H(e.expression,Nu(t,e.scope));return n&&(!e.isStreamed||pr(r))&&(e.cache=r),r},ud=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),dd=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return dd(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?ud(r):t.builtins.get(e)},fd=(e,t)=>O(e)?pd(e.operator,t):dd(e.operator,t.environment)??pd(e.operator,t),pd=(e,t)=>{let n=Ou(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return dd(e,t.environment)},md=e=>e.kind===`Closure`?e.params.length:e.arity,hd=(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:pd(n,t);if(!r)throw new h(`Expected an operator argument at ${mu(e)}`);return r},gd=(e,t,n)=>{if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>ku(e,n.name,t[r]),e.scope);return H(e.body,Nu(n,r))},_d=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:md(e),call:n=>gd(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},vd=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=pd(e.name,t);return n!==void 0&&md(n)>0},yd=(e,t)=>e.map(e=>vd(e,t)?_d(hd(e,t),t):H(e,t)),bd=(e,t)=>new h(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),xd=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),Sd=(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 Sd(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([])}},Cd=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&ut(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=O(e)?void 0:Sd(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=Ou(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:xd(e,t)}}return t=>xd(e,t)},wd=(e,t,n,r)=>{if(t.length!==e.params.length)throw bd(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:hd(t[a],n)}:(r?.[a]??Cd(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},Td=(e,t,n,r)=>e.kind===`Closure`?H(e.body,Nu(n,wd(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>H(e,n))):e.isLazy?e.evaluate(zd(t,n),n):e.evaluate(yd(t,n),n),Ed=(e,t,n)=>e.reduce((e,r)=>{let i={name:r.name,binding:{kind:`Value`,value:!1},parent:e};return r.kind===`Function`?(i.binding={kind:`Thunk`,expression:{kind:`FunctionConstruction`,bounds:r.bounds,body:r.body,location:r.location,isRecursive:!0},scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1},i):r.params.length>0||n?.impure.has(r)?(i.binding={kind:`Operator`,operator:{kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:i}},i):(i.binding={kind:`Thunk`,expression:r.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(r)??!1},i)},t.scope),Dd=(e,t,n)=>{let r=Ou(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return ld(r,n);if(r?.kind===`Operator`){if(md(r.operator)===0)return gd(r.operator,[],n);throw new h(`Operator ${e} is used without arguments`)}let i=Sd(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Tu(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return od(i.definition,n.environment)(n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new h(`Unknown identifier ${e} at ${mu(t)}`)},Od=(e,t)=>({impure:new Set(e.filter(e=>Nc(e,t))),streamed:new Set(e.filter(e=>Nc(e,t,`streamed`)))}),kd=e=>[...e.facts.ids.keys()].some(t=>Nc(t,e)),Ad=e=>[...e.facts.ids.keys()].some(t=>Nc(t,e,`repeated`)),jd=e=>typeof e==`object`&&e.kind===`FilteredSet`&&`rebind`in e,Md=(e,t,n,r)=>i=>{r.expressions.push(e);let a=wr.sets,o=wr.callStack,s=a??[],c=s.length;wr.sets=s,wr.callStack=r;try{let a=t(i),o=jd(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&fu(e)&&r.sources.set(o,e),o}catch(t){let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=pu(e,r.values),a=i&&!Ye(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!A(a)?void 0:a;throw Nd(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,wr.sets=a,wr.callStack=o}},Nd=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof h){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},Pd=(e,t,n)=>{if(!(n instanceof h))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},Fd=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),V=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=ef(e,t),i=t.callStack,a=i?Md(e,r,t,i):r;return t.evaluators.set(e,a),a},Id=(e,t)=>{if(t.callStack)return V(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=sa(e,t)??V(e,t);return t.entryEvaluators.set(e,r),r},H=(e,t)=>Id(e,t.environment)(t),Ld=(e,t)=>{let n=e.name,r=O(e)?void 0:Sd(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Tu(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??=od(e,t))(r)}return t=>Dd(n,e,t)},Rd=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||O(e))return!0;let n=dd(e.name,t);return n===void 0||md(n)===0},zd=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>H(e,t),expression:e})),Bd=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(zd(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Rd(t[0],n)){let e=V(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Rd(t[0],n)&&Rd(t[1],n);if(i&&a){let e=V(t[0],n),r=V(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(yd(t,n),n)},Vd=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw bd(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Cd(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:hd(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Hd=(e,t,n)=>{let r=Vd(e,t,n),i={body:void 0};return t=>(i.body??=Id(e.body,n),i.body({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},Ud=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=V(n[0],t),r=V(n[1],t);return t=>!Pu(e(t),`the left side of =>`)||Pu(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new h(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=O(e)?void 0:dd(e.operator,t);if(r?.kind===`Closure`)return Hd(r,n,t);if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=V(n[0],t),i=xu(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=V(n[0],t);return ns.has(e)||Lc(n[0],t)?i:e=>e.scope===void 0?r.evaluate([i(e)]):i(e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=V(n[0],t),a=V(n[1],t),o=Su(e,r);return e=>o(i(e),a(e))}if(r?.kind===`Builtin`)return Bd(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new h(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let i=n.map(e=>Cd(e,t));return r=>{let a=pd(e.operator,r);if(a)return Td(a,n,r,i);throw t.definitions.get(e.operator)?.kind===`Function`?new h(`${e.operator} is a function; apply it with brackets`):new h(`Unknown operator ${e.operator} at ${mu(e)}`)}},Wd=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=V(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=V(a.set,t);return s=>Uu(Vu(o(s),a.set,t.runtime.version),t=>Pu(i(Nu(s,ku(s.scope,e,t))),r)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>V(e.set,t));return s=>{let c=a.map((e,n)=>Vu(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?Pu(i(Nu(s,a)),r)!==n:Uu(c[t],n=>l(t-1,ku(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>Ku(o,e,t=>Pu(i(Nu(e,t)),r)!==n)?!n:n},Gd=(e,t)=>{if(e.kind===`Tuple`)return Yn(e.names.map(e=>{let n=Ou(t,e);return n?.kind===`Value`&&n.value}));let n=Ou(t,e.name);return n?.kind===`Value`?n.value:void 0},Kd=/* @__PURE__ */ new WeakSet,qd=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&Kd.add(e)},Jd=(e,t)=>{let n=Kd.has(e),r=V(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=V(a.set,t),c=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=qn(e),o=Bt(i,i.map(e=>r(Nu(t,ku(t.scope,n,e)))));return st(e)?o:Wt(o)}let n=[],s=i.map(e=>Hu(H(e.set,t),e.set,t.environment.runtime.version));return Gu(i,s,t.scope,e=>{let o=i.length===1?Gd(a.pattern,e)??!1:Yn(i.map(t=>Gd(t.pattern,e)??!1));return n.push([o,r(Nu(t,e))]),!1}),zn(n)},l=$u(i,e.body),u=(t,n)=>{let a=n.scope,o=Xu({value:td(t,e=>r(Nu(n,Ju(i,a,e))),ed(l,i,t)),bounds:i,body:e.body,scope:a});return i.length===1?Wt(o):o},d=t.callStack;return t=>{let r=o?s(t):qu(i,t);if(e.isRecursive||n||t.isKeepLazy||!M(r))return u(r,t);if(!st(r)){if(d)return u(r,t);try{return c(r,t)}catch(e){if(!(e instanceof h))throw e;return u(r,t)}}if(!d)return c(r,t);try{return c(r,t)}catch(t){throw Pd(d,e,t),t}}},Yd=(e,t)=>{let n=Kd.has(e);n&&qd(e.function);let r=V(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>V(e,t))}),value:V(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Yn(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Nu(i,ku(i.scope,`@`,e))):Br(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(ca.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${B(e.function)}`)}return n}},Xd=(e,t)=>{if(e.kind===`SetFilter`){let n=V(e.predicate,t),r=V(e.bound.set,t),i=e.bound.pattern,a=e.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:hu(a)},s=(e,t)=>n=>Pu(e(Nu(t,Au(t.scope,i,n))),`a set filter predicate`),c=(t,n,r)=>({kind:`FilteredSet`,base:t,test:s(r,n),source:o,rebind:r=>c(t,{...n,environment:r},V(e.predicate,r))});return e=>{let t=r(e);return st(t)?zt(N(t).elements.filter(s(n,e))):c(t,e,n)}}if(e.kind===`SetMap`){let n=V(e.expression,t);return t=>{let r=[];return Ku(e.bounds,t,e=>(r.push(n(Nu(t,e))),!1)),Pn(r)}}let n=e.set;if(!n)return()=>{throw new h(`TLC cannot evaluate an unbounded CHOOSE at ${mu(e)}`)};let r=V(e.body,t),i=V(n,t);return t=>{let a=i(t);if(!k(a)||jt(a))throw new h(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${B(e)}`);let o={value:void 0},s=Hu(a,n,t.environment.runtime.version);if(Uu(s,n=>{let i=Au(t.scope,e.pattern,n);return Pu(r(Nu(t,i)),`the body of CHOOSE`)?(o.value=Gd(e.pattern,i),!0):!1}),o.value===void 0)throw new h(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${B(e)}`);return o.value}},Zd=e=>[...e].sort((e,t)=>It(e.name,t.name)),Qd=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),$d=(e,t)=>{let n=Zd(e),r=Qd(n),i=n.map(e=>V(e.value,t));if(r)return e=>Xn(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>mt(a,i.map(t=>t(e)),o):e=>Zn(a,i.map(t=>t(e)))},ef=(e,t)=>{let n=e=>V(e,t);switch(e.kind){case`Number`:{let t=e.value;return ut(t)?()=>t:()=>{throw wu(e)}}case`Decimal`:return()=>{throw Cu(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return Ld(e,t);case`Apply`:return Ud(e,t);case`Bracket`:return()=>{throw new h(`A bracket without a function or subscript is not an expression at ${mu(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new h(`An operator cannot be used as a value at ${mu(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 vu(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 vu(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw Du(e);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0,isKeepLazy:n.isKeepLazy})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>Zt(t(e),r(e))}case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw _u(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new h(`A non-boolean expression (${Li(t)}) was used as a condition of a CASE. ${gu(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new h(`Attempted to evaluate a CASE with no conditions true.\n${B(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(Nu(n,Ed(e.definitions,n)))}case`Forall`:case`Exists`:return Wd(e,t);case`UnboundedQuantifier`:return()=>{throw new h(`TLC cannot evaluate an unbounded quantifier at ${mu(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Xd(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Pn(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>Yn(t.map(t=>t(e)))}case`FunctionConstruction`:return Jd(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 $d(e.fields,t);case`RecordSet`:{let t=Zd(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 Yd(e,t);case`ExceptAt`:return t=>{let n=Ou(t.scope,`@`);if(n?.kind!==`Value`)throw new h(`@ appears outside an EXCEPT at ${mu(e)}`);return n.value};case`FunctionApplication`:{qd(e.function);let r=n(e.function),i=t=>ju(r(Mu(t)),e),a=e.args.map(n),o=bu(t.runtime.version);if(a.length===1){let e=a[0];return t=>Lr(i(t),e(t),o)}return e=>Lr(i(e),Yn(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=yu(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=n({kind:`Unchanged`,expression:e.subscript,location:e.location}),i=e.kind===`BoxAction`;return e=>i?Pu(t(e),`an action`)||r(e):Pu(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>au(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new h(`The subexpression reference at ${mu(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new h(`TLC cannot evaluate a temporal formula in a state at ${mu(e)}`)}}},tf=`tlc2/value/impl/`,nf={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},rf={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},af=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)}},of=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),sf=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],cf=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??of.get(e[3])}${`[]`.repeat(e[1].length)}`),lf=(e,t)=>e[e[t].first].text,uf=(e,t)=>lf(e,t).replaceAll(`/`,`.`),df=e=>{let t=af(e);if(t.readUint32()!==3405691582)throw new l(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],r=t.readUint16(),i=new TextDecoder;for(let e=1;e<r;e++){let r=t.readUint8(),a={tag:r,text:``,value:0,first:0,second:0};n[e]=a,r===nf.utf8?a.text=i.decode(t.readBytes(t.readUint16())):r===nf.integer?a.value=t.readInt32():r===nf.float?t.readUint32():r===nf.long||r===nf.double?(t.readBytes(8),e++):r===nf.class||r===nf.string||r===nf.methodType||r===nf.module||r===nf.package?a.first=t.readUint16():r===nf.methodHandle?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16();let a=uf(n,t.readUint16());t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let o=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,s=i.indexOf(`)`),c=cf(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:af(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()},()=>uf(n,d.readUint16())):[],p=sf.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=cf(i.slice(s+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;o.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${a}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:o}},ff=(e,t)=>{let n=e[t],r=e[n.second];return{className:lf(e,n.first),name:e[r.first].text}},pf=(t,n,r,i)=>{let a=()=>new e(`The Java override ${r}.${t.name} computes its value, which tla-ts cannot run`),o=t.code;if(!o)throw a();let s=[],c=()=>{let e=s.pop();if(e===void 0)throw a();return e},l=e=>{let t=n[e];if(t.tag===nf.integer)return t.value;if(t.tag===nf.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>=rf.iconstM1&&t<=rf.iconst5)s.push(t-rf.iconst0),e+=1;else if(t===rf.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===rf.sipush)s.push(r()<<16>>16),e+=3;else if(t===rf.ldc)s.push(l(o[e+1])),e+=2;else if(t===rf.ldcW)s.push(l(r())),e+=3;else if(t===rf.dup){let t=c();s.push(t,t),e+=1}else if(t===rf.getstatic){let t=ff(n,r());if(t.className!==`${tf}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===rf.invokestatic){let t=ff(n,r()),o=c();if(t.className!==`${tf}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===rf.new)s.push({className:lf(n,r()),value:void 0}),e+=3;else if(t===rf.invokespecial){let t=ff(n,r()),o=c(),s=c();if(!(t.className===`${tf}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===rf.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()},mf=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=df(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:pf(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)}))}},hf=/* @__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(`,`),gf=[[`\\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`,`≀`],[`^+`,`⁺`]],_f=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***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(`,`),vf=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs`.split(`.`),yf=/* @__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(`.`),bf=/* @__PURE__ */ new Set([`Bags`,`Json`,`Randomization`,`TLCExt`]),xf=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
135
|
+
`],[2281,` - specifically: `]]),ba=(e,t,n)=>{let r=n?ya.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)}${xa(t.slice(a),n)}`},xa=(e,t)=>{let n=t?_a(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${la.none} @!@!@\n${ba(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},Sa=e=>String(e).padStart(2,`0`),Ca=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 ${Sa(r%24)}h`:e>36e5?`${Sa(r%24)}h ${Sa(n)}min`:e>6e4?`${Sa(n)}min ${Sa(t)}s`:`${Sa(t)}s`},wa=e=>`${e.getFullYear()}-${Sa(e.getMonth()+1)}-${Sa(e.getDate())} ${Sa(e.getHours())}:${Sa(e.getMinutes())}:${Sa(e.getSeconds())}`,Ta=/* @__PURE__ */ new WeakMap,Ea=(e,t,n)=>{if(!(e instanceof m))return e;let r=v(new m(`${n}\n${e.message}`,e),o(e));return Ta.set(r,{code:t,headline:n,inner:e}),r},Da=e=>Ta.has(e),Oa=i.slice(0,i.indexOf(`
|
|
136
|
+
`)),ka=`${i}tlc2.tool.EvalException: `,Aa=`${i}util.Assert$TLCRuntimeException: `,ja=e=>va(e)?ka:Aa,Ma=e=>{try{return e()}catch(e){throw e instanceof m?va(e)?new m(`${u}${e.message}`):_a(e.message)?e:new m(`${i}${e.message}`):e}},Na=[ka,Aa,i,u],Pa=(e,t)=>{let n=Ta.get(e);if(n)return`${n.headline}\n${Pa(n.inner,t)}`;let r=e.message,i=Na.find(e=>r.startsWith(e))??``;return`${i}${xa(r.slice(i.length),t)}`},Fa=(e,t)=>{let n=Ta.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:Pa(e,!0)};if(t&&va(e))return{code:_a(r)?.code??ca.general,message:r,toolMessage:r};let a=t&&!r.startsWith(Oa)?i:``;return{code:ca.general,message:`${a}${r}`,toolMessage:`${a}${Pa(e,!0)}`}},Ia={kind:`Local`},La=/* @__PURE__ */ new WeakSet,Ra=/* @__PURE__ */ new WeakMap,za=/* @__PURE__ */ new WeakMap,Ba=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Va=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),Ha=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Ua=e=>e.kind===`Operator`?e.params.length:0,Wa=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Ga=e=>e.name.includes(`!`),Ka=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},qa=(e,t,n)=>{let r=t.bindings.get(e);return r&&Ha(r.position,t.location)&&(!n||Ha(r.position,n.start))?r:void 0},Ja=(e,n)=>e!==void 0&&n!==void 0&&t(e)===t(n),Ya=(e,n,r,i)=>{if(n===void 0)return!0;if(Ja(n.range,r.range))return!1;let a=r.range;if(a===void 0||i.isGenerated||n.kind!==`Builtin`&&!n.range)return!0;let o=t(a),s=n.range&&t(n.range);return n.kind===`Builtin`?i.errors.push({location:o,message:`Symbol ${e} is a built-in operator, and cannot be redefined.`}):r.kind===`Parameter`||n.kind!==r.kind||n.arity!==r.arity?i.errors.push({location:o,message:`Multiply-defined symbol '${e}': this definition or declaration conflicts \nwith the one at ${s}.`}):i.warnings.push({location:o,message:`Multiple declarations or definitions for symbol ${e}. \nThis duplicates the one at ${s}.`}),!1},Xa=(e,t,n,r)=>Ya(t,Ka(e,t)??qa(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Za=(e,t,n)=>{Ya(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Qa=(e,t,n,r)=>t.reduce((e,t,i)=>Xa(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),$a=(e,t,n)=>t.reduce((e,t)=>Xa(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),eo=e=>e.kind===`Name`?[e.name]:e.names,to=e=>e.flatMap(e=>eo(e.pattern)),no=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||Ha(n.location,t.location))?n:void 0},ro=(e,t)=>{let n=no(e,t);return n?{key:t.getKey(n),arity:Ua(n),params:Wa(n),kind:`Definition`}:t.imported.get(e)},io=(e,t,n)=>Ka(t,e)??ro(e,n),ao=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),oo=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:ao(e.location,e.spelling??t)},so=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return Ha(e.location,e.args[0].location)?`prefix`:`postfix`}},co=e=>!/^[\p{L}\d_]/u.test(e),lo=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),uo=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,fo=(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])}})},po=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?fo(e.name,[],void 0):fo(e.operator,e.args,e.argumentCounts),mo=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),ho=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:to(e.bounds),body:e.body,sets:mo(e.bounds)};case`SetMap`:return{names:to(e.bounds),body:e.expression,sets:mo(e.bounds)};case`SetFilter`:return{names:eo(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:eo(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}},go=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}},_o=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,vo=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),yo=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?yo(e.body,t):Je(e).reduce((e,n)=>e??yo(n,t),void 0)},bo=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??bo(i,t,n||vo(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&yo(e.set,t):yo(e,t)},xo=e=>e.kind===`Label`?xo(e.body):e,So=e=>typeof e==`number`?`argument selector ${e}`:e,Co=`within the scope of a declaration
|
|
137
|
+
from outside that declaration's scope.`,wo=(e,n,r,i,a,o)=>{let s=(n,r)=>{let i=(n===void 0?void 0:e.selectorRanges?.[n])??e.location.range;i&&a.errors.push({location:t(i),message:r})},c=r.isSuffices===r.isInProof,l=r.statement,u={node:l,isGoal:!0,isSufficesOpen:r.isSuffices};for(let[e,t]of n.slice(1).entries()){let r=e+1,o=u.node;if(t.kind===`Name`){if(n[r-1].kind!==`Name`)return o.kind!==`NewSymbol`&&o.kind!==`AssumeProve`&&xo(o).kind===`Let`?void 0:s(r-1,`A name selector here must be from a LET clause.`);let e=l.kind===`AssumeProve`?[...l.assumptions,l.conclusion]:[l],i=r===1?e.map((e,n)=>({position:n,label:bo(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:o.kind===`Label`?yo(o.body,t.name):void 0};if(!i?.label)return s(r,`Cannot find label \`${t.name}'.`);if(r===1&&l.kind===`AssumeProve`&&vo(l,i.position)&&c)return s(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${Co}`);if(t.args.length!==i.label.params.length)return s(r,`Label \`${t.name}' used with wrong number of arguments.`);u.node=i.label,u.isGoal=!1,u.isSufficesOpen=!1;continue}if(t.kind!==`Operand`)return;let d=So(t.operand);if(u.isSufficesOpen){if(uo(t.operand,1)!==0)return s(r,o.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);u.isSufficesOpen=!1;continue}if(o.kind===`NewSymbol`)return;if(o.kind!==`AssumeProve`){let e=xo(o);if([`Number`,`Decimal`,`String`].includes(e.kind))return s(r,`Selecting subexpression of expression that has none.`);let n=e.kind===`Identifier`?io(e.name,i,a)?.kind:void 0;if(n===`Variable`||n?.startsWith(`New`))return s(r,`Choosing operand \`${d}' of subexpression with no operands.`);let c=ho(e)?.sets,l=e.kind===`Identifier`?[]:c?c.length>0?c:void 0:e.kind===`Except`?void 0:go(e);if(!l)return;let f=uo(t.operand,l.length);if(f===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);u.node=l[f],u.isGoal=!1;continue}let f=[...o.assumptions,o.conclusion],p=uo(t.operand,f.length);if(p===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);if(vo(o,p)&&(!u.isGoal||c))return s(r,`Accessing ASSUME/PROVE clause ${Co}`);let m=f[p];if(m.kind===`NewSymbol`&&r!==n.length-1)return s(r,`Selected a subexpression of a NEW clause of an ASSUME.`);u.node=m,u.isGoal=!1}o||(u.node.kind===`AssumeProve`&&s(void 0,`Selected ASSUME/PROVE instead of expression.`),u.node.kind===`NewSymbol`&&s(void 0,`Selected a NEW declaration as an expression or operator.`))},To=(e,n)=>{let r=n.isGenerated?void 0:n.hasLabelScope?n.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:n.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return r===void 0||!e.location.range?!1:(n.errors.push({location:t(e.location.range),message:r}),!0)},Eo=(e,n,r)=>{let i=e.location.range;if(!i||r.isGenerated)return;let a=t(i),o=e.params.filter((i,a)=>{let o=Ka(n,i)?.kind===`Parameter`,s=e.paramRanges?.[a];return!o&&s&&r.errors.push({location:t(s),message:`Illegal parameter ${i} of label \`${e.name}'.`}),o});o.filter((e,t)=>o.indexOf(e)!==t).forEach(t=>r.errors.push({location:a,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),r.labelParams.filter(e=>!o.includes(e)).forEach(t=>r.errors.push({location:a,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let s=[...new Set(o.filter(e=>!r.labelParams.includes(e))),...e.params.filter(e=>!o.includes(e))];s.length>0&&r.errors.push({location:a,message:`Label ${e.name} declares extra parameter(s) ${s.map(e=>`${e} `).join(``)}`}),r.labels.has(e.name)&&r.errors.push({location:a,message:`Duplicate label \`${e.name}'.`}),r.labels.add(e.name)},Do=(e,t,n,r)=>{if(!_o(e))return!1;let i=po(e),a=i[0],o=i.length>1&&a.kind===`Name`?Ka(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&wo(e,i,o,t,n,r),o!==void 0},Oo=(e,n,r,i)=>{let a=e.location;if(Ro(e,r,i))return;let o=za.get(e);if(o!==void 0)return o;if(Ba(n))return e.kind===`Apply`?e.args.length:0;let s=Ka(r,n);if(s?.isNonFact){i.errors.push({location:t(oo(e,n)),message:`Step number of non-expression step used as an expression.`});return}if(Do(e,r,i,!1)||lo(n)&&s)return e.kind===`Apply`?e.args.length:0;if(s&&e.kind!==`OperatorReference`&&(e.resolution=Ia),s)return s.arity;let c=ro(n,i);if(c)return e.kind===`Identifier`?e.name=c.key:e.operator=c.key,za.set(e,c.arity),c.arity;let l=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``;if(l!==``&&(Ka(r,l)!==void 0||ro(l,i)!==void 0||i.facts.has(l)))return e.kind===`Apply`?e.args.length:0;let u=(e.kind===`Identifier`?void 0:e.spelling)??n,d=t(e.kind===`Apply`&&u===`-.`?ao(a,`-`):oo(e,n));if(!co(n)||lo(n)){i.errors.push({location:d,message:`Unknown operator: \`${n}'.`});return}i.errors.push({location:d,message:`Could not find declaration or definition of symbol '${u}'.`});let f=so(e);f&&a.range&&i.errors.push({location:t(a.range),message:`Couldn't resolve ${f} operator symbol \`${u}'.`})},ko=(e,t,n)=>(e.forEach(e=>B(e.set,t,n)),e.reduce((e,t)=>Qa(e,eo(t.pattern),t.pattern.ranges,n),t)),Ao=(e,t)=>e.kind===`Identifier`&&e.name===t&&k(e)||Je(e).some(e=>Ao(e,t)),jo=(e,t)=>{e.kind===`FunctionConstruction`&&Ao(e.body,t)&&(e.isRecursive=!0),Je(e).forEach(e=>jo(e,t))},Mo=(e,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:e.kind===`Function`?to(e.bounds):[],labels:/* @__PURE__ */ new Set},o=e.name,s=e.location.range,c=e=>{s&&!a.isGenerated&&a.errors.push({location:t(s),message:e})},l=e.kind===`Function`?ko(e.bounds,n,a):$a(n,e.params,a),u=Ka(l,o)??qa(o,a,s),d=u?.isPending===!0&&i.has(u);return u?.isPending&&!d?c(`Recursive ${e.kind===`Function`?`function`:`operator`} ${o} defined at wrong LET/IN level.`):u&&!d&&c(e.kind===`Function`?`Function name \`${o}' already defined or declared.`:`Operator ${o} already defined or declared.`),e.kind===`Function`?(B(e.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),jo(e.body,o),e.isSelfReferential=Ao(e.body,o)):B(e.body,l,a),u&&d?(u.isPending=!1,u.range=s,!1):e.kind===`Function`?u===void 0:Ya(o,Ka(n,o)??qa(o,a,s),{kind:`Definition`,arity:Ua(e),range:s},a)},No=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Ka(e,t.name)?.isPending)return e;let n={name:t.name,arity:Ua(t),params:Wa(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)=>Wo(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Ba(t.name)?e:s(e,e=>!Ha(t.location,e.location)),o={name:t.name,arity:Ua(t),kind:`Definition`,range:t.location.range,parent:a};if(Ga(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Ba(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return Mo(t,a,u,i)?{...o,params:Wa(t)}:a},a),()=>!0)},Po=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Ka(t,r)??qa(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},Fo=(e,n,r)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let i=Po(e.kind===`Identifier`?e.name:e.operator,n,r),a=e.kind===`Apply`?e.argumentCounts?.[0]??0:0;if(!i||a===i.arity)return!1;let o=(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??e.location.range;return o&&r.errors.push({location:t(o),message:`The operator ${i.name} requires ${i.arity} arguments.`}),!0},Io=(e,n,r)=>{if(Fo(e,n,r))return;let i=e.operator,a=io(i,n,r),o=Oo(e,i,n,r);if(o===void 0)return;if(o!==e.args.length){r.errors.push({location:t(e.argumentsRange??oo(e,i)),message:`The operator ${i} requires ${o-(Po(i,n,r)?.arity??0)} arguments.`});return}let s=a&&(a.kind===`Definition`?a.params:[]);if(s===void 0){e.args.forEach(e=>Lo(e,n,r));return}let c=(e,n)=>{e&&r.errors.push({location:t(e),message:n})};e.args.map((t,a)=>{let o=s[a]??0,l=t.location.range;if(o===0){if(t.kind===`Lambda`&&t.operator!==void 0)c(l,`The operator ${t.operator} requires 1 arguments.`);else if(t.kind===`Lambda`&&l)c(l,`LAMBDA expression used where an expression is required.`);else if(t.kind===`OperatorReference`){let e=Oo(t,t.operator,n,r);e!==void 0&&c(l,`The operator ${t.operator} requires ${e} arguments.`)}else B(t,n,r);return!0}if(t.kind===`Lambda`){B(t,n,r);let s=t.params.length===o;return!s&&La.has(t)?c(l,`Expected arity ${o} but found operator of arity ${t.params.length}.`):!s&&l&&t.operator===void 0&&c(e.selectorRanges?.at(-1)??oo(e,i),`Lambda expression with arity ${t.params.length} used as argument ${a+1} of operator \`${i}', \nbut an operator of arity ${o} is required.`),s}if(t.kind===`Subexpression`)return B(t,n,r),!0;if(t.kind===`Apply`&&t.argumentCounts?.at(-1)===0){let e=t.argumentCounts.findIndex(e=>e>0);return c(t.selectorRanges?.[e],`Selector \`${t.operator.split(`!`)[e]}' should not have argument(s).`),!1}if(t.kind!==`Identifier`&&t.kind!==`OperatorReference`)return c(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${i}', in a position an operator is required.`),!1;let u=t.kind===`Identifier`?t.name:t.operator,d=io(u,n,r)?.params??[],f=Oo(t,u,n,r);return t.kind===`Identifier`&&f!==void 0&&f!==o&&c(oo(t,u),`Expected arity ${o} but found operator of arity ${f}.`),f===o&&d.every(e=>e===0)}).forEach((t,n)=>{t||c(e.location.range,`Argument number ${n+1} to operator '${i}' \nshould be a ${s[n]}-parameter operator.`)})},Lo=(e,t,n)=>{e.kind===`Identifier`?Oo(e,e.name,t,n):B(e,t,n)},Ro=(e,t,n)=>{let r=Ra.get(e);return r?(r.args.forEach(e=>Lo(e,t,n)),n.errors.push(r.error),!0):!1},B=(e,n,r)=>{if(La.has(e)&&!r.isGenerated){B(e,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>B(e,n,r)),a=e=>({...r,labelParams:[...r.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(Fo(e,n,r))return;let i=e.name,a=Oo(e,i,n,r);a!==void 0&&a>0&&r.errors.push({location:t(oo(e,i)),message:`The operator ${i} requires ${a} arguments.`});return}case`OperatorReference`:Oo(e,e.operator,n,r);return;case`Apply`:Io(e,n,r);return;case`Lambda`:B(e.body,Qa(n,e.params,e.paramRanges,r),a(e.params));return;case`And`:case`Or`:i(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:B(e.expression,n,r);return;case`If`:i([e.condition,e.consequent,e.alternative]);return;case`Case`:i(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&B(e.other,n,r);return;case`Let`:B(e.body,No(e.definitions,n,r,e.instances),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:B(e.body,ko(e.bounds,n,r),a(to(e.bounds)));return;case`UnboundedQuantifier`:B(e.body,Qa(n,e.names,e.nameRanges,r),a(e.names));return;case`Choose`:e.set&&B(e.set,n,r),B(e.body,Qa(n,eo(e.pattern),e.pattern.ranges,r),a(eo(e.pattern)));return;case`SetEnumeration`:case`Tuple`:i(e.elements);return;case`SetFilter`:B(e.predicate,ko([e.bound],n,r),a(eo(e.bound.pattern)));return;case`SetMap`:B(e.expression,ko(e.bounds,n,r),a(to(e.bounds)));return;case`FunctionSet`:i([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((i,a)=>{e.fields.slice(0,a).some(e=>e.name===i.name)&&r.errors.push({location:t(i.location.range??ao(i.location,i.name)),message:`Non-unique fields in constructor.`}),B(i.value,n,r)});return;case`Except`:B(e.function,n,r),e.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),B(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:i([e.function,...e.args]);return;case`FieldAccess`:B(e.record,n,r);return;case`Product`:i(e.factors);return;case`BoxAction`:case`AngleAction`:i([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:i([e.subscript,e.action]);return;case`Label`:if(To(e,r))return;B(e.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),Eo(e,n,r);return;case`Subexpression`:if(Ro(e,n,r))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Lo(e,n,r)),Do(e,n,r,!1)}},zo=(e,n,r)=>e.forEach(e=>{if(e.kind===`ModuleFact`||Fo(e,n,r)||Do(e,n,r,!0))return;let i=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&Ka(n,i)?.isNonFact?r.errors.push({location:t(oo(e,i)),message:`Step number of non-fact used as a fact`}):r.facts.has(i)||B(e,n,r)}),Bo=(e,t,n)=>(e.set&&B(e.set,t,n),Xa(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Vo=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Bo(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Vo(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},Ho=(e,t,n)=>e.kind===`AssumeProve`?Vo(e,t,n):(B(e,t,n),t),Uo=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&zo(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Go(t,e,r),t)},Wo=(e,t,n)=>{let r=Zo(e,t,n);return e.name===void 0?r:Xa(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Go=(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=Ho(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Uo(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Uo(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 zo(r.facts,t,n),o(t);case`Instance`:return o(Wo(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?Wo(t,e,i):No([t],e,n),t));case`Have`:case`Case`:return B(r.expression,t,i),Uo(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>B(e,t,i)),a(t);case`Take`:return a(Qa(ko(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Qa(ko(r.bounds,t,i),r.names,r.nameRanges,i);return B(r.body,o,{...i,labelParams:[...i.labelParams,...to(r.bounds),...r.names]}),Uo(e.proof,a(t),n),a(o)}default:return Uo(e.proof,a(t),n),a(t)}},Ko=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Ho(e.statement,void 0,t);e.name!==void 0&&Za(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Uo(e.proof,n,t),r&&(r.isInProof=!1)},qo={line:0,column:0},Jo=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Yo=(e,t)=>{let n=new Map([...Va,...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},Xo=(e,n,r,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 r=Oo(n,n.name,o,a);if(r!==void 0&&r!==t.arity)throw new l(`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},c=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let r=e.name,i=n.find(e=>e.name===r);if(!i){a.errors.push({location:t(e.nameRange),message:`Identifier '${r}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let o=e.expression;s(i,o);let l=o.location.range;c.has(r)?l&&a.errors.push({location:t(l),message:`Multiple substitutions for symbol '${r}' in substitution.`}):c.set(r,o)});let u=n.filter(e=>!c.has(e.name)),d=e=>!Ka(o,e.name)&&!ro(e.name,a);return u.filter(e=>!d(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};s(t,n),c.set(t.name,n)}),u.filter(d).forEach(n=>{let i=e.location.range,o=n.location.range;i&&o&&a.errors.push({location:t(i),message:`Substitution missing for symbol ${n.name} declared at ${t(o)} \nand instantiated in module ${r}.`})}),c},Zo=(e,t,n)=>{let r=n.getInstance(e);return Xo(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Xa(e,t,r,n),t)},Qo=(e,t,n,r)=>{let i=Yo(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Xo(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:qo}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},$o=(e,t)=>{let n=[],r=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>Ha(e.location,t.location)?-1:+!!Ha(t.location,e.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof l)||!e.sany&&i.length===0)throw e;i.push(...e.sany?.errors??[])}i.forEach(e=>r(n,e)),a.forEach(e=>r(t,e))}),n},es=(e,n)=>{let r=Yo(e,n.imported),i=/* @__PURE__ */ new Set([...n.facts,...[...e.theorems,...e.assumptions].flatMap(e=>e.name??[])]),a=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),o=new Map([...Va,...n.bound].map(([e,t])=>[e,{...t,position:qo}])),s=/* @__PURE__ */ new Set,c=[],l=(e,t,s,c,l)=>({imported:r,getInstance:n.getInstance,definitions:n.definitions,getKey:n.getKey,location:e,self:t,facts:i,goals:a,bindings:o,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),u=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>Za(e.name,{kind:t,arity:e.arity,range:e.location.range},l(e.location,void 0,n,r,!1))}));return $o([...n.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...u(e.constants,`Constant`),...u(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=Ya(e.name,o.get(e.name),r,l(e.location,void 0,t,n,!1));i&&(o.set(e.name,r),s.add(r)),c.push({declaration:e,binding:i?r:void 0})}})),...e.definitions.map(t=>({location:t.location,check:(n,r)=>{let i=l(t.location,t,n,r,!0);Jo(e,t)?B(t.body,void 0,i):Mo(t,void 0,i,s)&&o.set(t.name,{kind:`Definition`,arity:Ua(t),range:t.location.range,position:t.location})}})),...e.instances.map(e=>({location:e.location,check:(t,r)=>{let i=l(e.location,void 0,t,r,!1);$a(void 0,e.params,i),n.instanced.get(e)?.forEach((e,t)=>Za(t,e,i)),e.name!==void 0&&Za(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=l(e.location,void 0,t,n,e.name!==void 0);B(e.expression,void 0,r),e.name!==void 0&&Za(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>Ko(e,l(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>zo(e.facts,void 0,l(e.location,void 0,t,n,!1))})),{location:e.location.range?.end??e.location,check:e=>c.forEach(n=>{let r=n.declaration.location.range;r&&(!n.binding||n.binding.isPending)&&e.push({location:t(r),message:`Symbol ${n.declaration.name} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},ts=/* @__PURE__ */ new WeakSet,ns=(e,t,n=/* @__PURE__ */ new Set)=>{let r=cs(e,(e,r)=>ns(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,operator:t.get(r.operator)??r.operator}:r},rs=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),is=/* @__PURE__ */ new WeakMap,as=e=>is.get(e)??e.name,os=(e,t)=>(as(t)!==e.name&&is.set(e,as(t)),e),ss=(e,t)=>os(e.kind===`Function`?{...e,bounds:rs(e.bounds,e=>t(e,[])),body:t(e.body,to(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),cs=(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=>ss(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:rs(e.bounds,n),body:t(e.body,to(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,eo(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,eo(e.bound.pattern))};case`SetMap`:return{...e,bounds:rs(e.bounds,n),expression:t(e.expression,to(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)}}},ls=`LAMBDA`,us=e=>`${e}@SUBSTITUTION`,ds=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(ds),fs=(e,t)=>{if(e.kind!==`Identifier`)return!ds(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&&!ds(n.body)},ps=(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 cs(e,(e,n)=>(r.push(...ps(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},ms=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}},hs=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),gs=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},_s=(e,t)=>e.map(e=>({pattern:gs(e.pattern,t),set:e.set})),vs=(e,t)=>e.kind===`Function`?{...e,bounds:_s(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},ys=(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=>os({...vs(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:_s(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:gs(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:gs(e.bound.pattern,n),set:e.bound.set}};default:return e}},bs=e=>`${e}@ENABLED`,xs=(e,t)=>e.modes.get(t)??e,Ss=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!k(e)&&t.instantiation.variables.has(e.name),Cs=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Cs(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Ss(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?Cs(r.body,t,/* @__PURE__ */ new Map):void 0},ws=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Ss(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:bs(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:ks(e.expression,xs(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[ks(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:ks(e.subscript,xs(t,`Primed`),n),location:r},ks(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Cs(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:bs(r),location:e.location},location:e.location},ks({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Ts=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:Ia}),Es=(e,t)=>e.map(e=>Ts(e.name,t)),Ds=(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:[...Es(t,r),...i.map(e=>Ts(e,r))],location:r},location:r}},Os=(e,t)=>e.instantiation.isParameterized(t)?js(e,t):void 0,ks=(e,t,n)=>{let r=e=>ks(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!k(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:ks(e.expression,xs(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:ks(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},xs(t,`Enabled`),n)};let s=ws(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name),r=t.bindings;if(n&&(r===void 0||!fs(n,i)))return n;if(n&&r){let t=us(e.name);return r.set(t,n),Ts(t,e.location)}let o=Os(t,e.name);if(o===void 0)return e;if(a.length===0)return{...e,name:o};let s=i.getDefinition(e.name);return s&&Ua(s)>0?Ds(o,a,Ua(s),e.location):{kind:`Apply`,operator:o,args:Es(a,e.location),location:e.location}}if(e.kind===`Apply`&&o(e.operator)){let n=e.args.map(r),o=i.substitutions.get(e.operator),s=i.substitutions.size>0||a.length>0||ts.has(e),c=e=>(s&&ts.add(e),e);if(o?.kind===`Identifier`||o?.kind===`OperatorReference`){let t=o.kind===`Identifier`?o.name:o.operator;return c({...e,operator:t,args:n,resolution:o.kind===`Identifier`?o.resolution:void 0})}if(o?.kind===`Apply`)return c({...e,operator:o.operator,args:[...o.args,...n],resolution:o.resolution});if(o?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:ls,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:ls,args:n,resolution:Ia},location:e.location};if(o)throw new l(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=Os(t,e.operator);return u===void 0?c({...e,args:n}):{...e,operator:u,args:[...Es(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=Os(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?Ds(n,a,Ua(r),e.location):{...e,operator:n}}let c=ms(t),u=cs(e,(e,i)=>i.length===0?r(e):ks(e,t,hs(n,i,c)));return ys(u,n,c)},As=(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:Ts(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},js=(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=ms(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=vs(ss(i,(e,t)=>ks(e,s,hs(/* @__PURE__ */ new Map,t,a))),a);if(c.kind!==`Operator`||o.size===0)return As(c,r.params,i.location);let l=[...o].map(([e,t])=>({kind:`Operator`,name:e,params:[],body:t,isLocal:!0,isRecursive:!1,location:t.location}));return As({...c,body:{kind:`Let`,definitions:l,body:c.body,location:c.body.location}},r.params,i.location)}):t},Ms=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>ps(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=>Os(i,e)??e,getQualifiedKey:t=>{let n=Os(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>As(r,e.params,r.location)):t}}},Ns=e=>e.kind===`Let`&&e.instances!==void 0||Je(e).some(Ns),Ps=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=cs(e,e=>Ps(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Ha(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}},Fs=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Is=(e,t)=>e.definitions.some(e=>Ns(e.body))||e.assumptions.some(e=>Ns(e.expression))||e.theorems.some(e=>{let t=Fs(e);return t!==void 0&&Ns(t)})?{...e,definitions:e.definitions.map(e=>ss(e,e=>Ps(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Ps(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Fs(e);return n===void 0?e:{...e,statement:Ps(n,t,[])}})}:e,Ls=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}])),Rs={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]}},zs=(e,t)=>{let n=Rs[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Bs=(e,t)=>`${e}${t}`,Vs=(e,t,n)=>`${e}${t}${n}`,Hs=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Us=(e,t,n)=>`${e},${t},${n}`,Ws=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Gs=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Ks=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),qs=(e,t,n,r)=>({...Ws(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Js=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Ys=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Xs=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,{...qs(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Zs=qs(`$Set`,0,[2],[1]),Qs=qs(`$Junction`,0,[3],[1]),$s=qs(`$Choose`,0,[2],[1]),ec=qs(`$Function`,0,[3],[1]),tc=qs(`$FcnApply`,0,[2,2],[1,1]),nc=qs(`$RcdSelect`,0,[2,0],[1,1]),rc=qs(`'`,2,[1],[0]),ic=qs(`ENABLED`,1,[2],[0]),ac=qs(`[]`,3,[3],[0]),oc=qs(`$SquareAct`,2,[2,1],[0,0]),sc=qs(`$WF`,3,[1,2],[0,0]),cc=qs(`$TemporalExists`,3,[3],[0]),lc=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),uc=e=>e.map(e=>({name:e,arity:0})),dc=(e,t)=>t.location.range?d(`${e}.`,t.location.range):new l(`${e} at line ${t.location.line}, column ${t.location.column}`),fc=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),pc=e=>e.kind!==`Let`&&e.kind!==`Label`,mc=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:v(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=v(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Xs.get(t)??Ls.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=Ws(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(Vs(e,n,t))}),t.data.constraints.forEach((e,t)=>Gs(r.constraints,t,e)),Ks(r.argConstraints,Bs(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Ks(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);if(t.forEach((t,n)=>{if(!(t.operator||t.declared)&&t.data.level>Js(e,n))throw new l(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new l(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(Us(t,n,r)),s=Ws(Math.max(e.level,...t.filter((t,n)=>Ys(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>s.params.add(e)),t.forEach((t,n)=>{Ys(e,n)===1&&t.data.params.forEach(e=>s.params.add(e))}),n.forEach(e=>e.params.forEach(e=>s.params.add(e))),r.forEach(e=>s.params.delete(e)),e.constraints.forEach((e,t)=>Gs(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Gs(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Gs(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Gs(s.constraints,t,Js(e,n))})),t.forEach((e,n)=>{let r=e.operator;r&&t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>Gs(s.constraints,e,Js(r,a)))}))}),e.argParams.forEach(e=>{let t=Hs(e),n=a(t.operator)?.operator;n&&Gs(s.constraints,t.param,Js(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Ks(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>Ks(s.argConstraints,Bs(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&Ks(s.argConstraints,Bs(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=Hs(e),n=a(t.operator);n&&Ks(s.argConstraints,Bs(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Hs(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=Hs(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(Vs(n.declared.name,t.index,t.param));else{let n=a(t.param);if(!n){s.argParams.add(e);return}n.data.params.forEach(e=>s.argParams.add(Vs(t.operator,t.index,e)))}}),t.forEach((e,n)=>{let r=e.declared;r&&t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>s.argParams.add(Vs(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,uc(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=Ws();return e.params.add(r),{data:e,declared:{name:r,arity:i.arity}}}}return{data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),s=(e,t,n,r=[],a=[])=>{let s=lc(n,uc(a));return i(e,o(t,s),r.map(e=>m(e,n)),a)},c=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw dc(`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 dc(`Action used where only temporal formula or state predicate allowed`,e);fc.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&pc(n)&&n.kind!==r)throw dc(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=v(e,n);t.constraints.forEach((e,t)=>Gs(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Ks(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof l)||t.sany?t:dc(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Ws();case`Identifier`:return c(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return d(e,r),c(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t);return u(n,e),i(Qs,n)}case`Prime`:case`Unchanged`:return s(rc,[e.expression],t);case`Enabled`:return s(ic,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(ac,[n])}case`If`:return s(Qs,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(Qs,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=s(Qs,[e.body],t,e.bounds.map(e=>e.set),to(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw dc(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?cc:Qs,[e.body],t,[],e.names);case`Choose`:return s($s,[e.body],t,e.set?[e.set]:[],eo(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(Zs,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(Zs,[e.predicate],t,[e.bound.set],eo(e.bound.pattern));case`SetMap`:return s(Zs,[e.expression],t,e.bounds.map(e=>e.set),to(e.bounds));case`FunctionConstruction`:return s(ec,[e.body],t,e.bounds.map(e=>e.set),to(e.bounds));case`Record`:return s(ec,e.fields.map(e=>e.value),t);case`RecordSet`:return s(Zs,e.fields.map(e=>e.value),t);case`Except`:return s(Zs,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(tc,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(Zs,e.args,t)}]);case`Bracket`:return Ws();case`FieldAccess`:return i(nc,[a(e.record,t),{data:Ws()}]);case`BoxAction`:case`AngleAction`:return s(oc,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(sc,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Ws()}},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 Je(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,lc(t,uc(e.names))),i;default:return cs(e,(e,n)=>(a(e,r,lc(t,uc(n))),e)),i}},_=(e,t,n,r)=>{let i=lc(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...Ws(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(Bs(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(Vs(e.name,n,t.name))).map(e=>Us(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(Hs(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Hs(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},v=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...Ws(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:v,toOperand:a}},hc=(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`?hc(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Ws(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Gs(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ks(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},gc=(e,n,r,i)=>{let a=mc(n),o=e=>Math.max(0,...e.map(e=>a.analyze(e,/* @__PURE__ */ new Map).level)),s=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?o([t.expression]):t.kind===`Witness`?o(t.expressions):t.kind===`Take`?o(t.bounds.map(e=>e.set)):t.kind===`Pick`?o([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?hc(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},l=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let n=t(e.statement),r=()=>s(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?r()?[]:[{location:n,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...r()?[]:[{location:n,message:`Non-constant CASE for temporal goal.`}],...l(e.proof)]:e.body.kind===`Qed`?l(e.proof):[]}):[],u=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let n=e.body,r=()=>s(e)===3,i=n.kind===`Pick`&&n.bounds.length>0&&r()?n.bounds.filter(e=>o([e.set])!==0).flatMap(e=>e.set.location.range?[{location:t(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...u(e.proof),...i,...e.proof?.kind===`Steps`&&r()?l(e.proof):[]]}):[],d=$o([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>a.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>a.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?hc(e.statement,/* @__PURE__ */ new Map,a):a.analyze(e.statement,/* @__PURE__ */ new Map),n=[...u(e.proof),...t.level===3?l(e.proof):[]];if(n.length>0)throw c(n)}})),...r],i);if(d.length>0)throw c(d,!1,void 0,i)},_c=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),vc=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),yc=/* @__PURE__ */ new Set([..._c,...vc,`Enabled`]),bc=/* @__PURE__ */ new Set([`~>`,`-+->`]),xc=/* @__PURE__ */ new Set([...bc,`\\cdot`]),Sc=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Cc=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),wc=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},Tc=(e,t)=>Sc.has(e)||t.builtins.get(e)?.isStateLevel===!0,Ec=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(_c.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(vc.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&bc.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(yc.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&xc.has(e.operator))&&(r[0]|=1),yc.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=wc(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)&&(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{Tc(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),Cc.has(u)&&(r[0]|=8),!a&&Tc(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=32)}}Je(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},Dc=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],Oc=(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},kc=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),Ac=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=Ec(Dc(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=Oc(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=Oc(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!kc(t[e],l[e*r])))),p=Oc(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}},jc=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?Mc(Dc(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},Mc=(e,t)=>{let n=t.facts.words,r=Ec(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=jc(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]}kc(e.callee,r[0])||(i[0]|=r[0]&14)}),i},Nc=(e,t)=>!(jc(e,t)[0]&1),Pc={any:2,repeated:4,streamed:8},Fc=(e,t,n=`any`)=>(jc(e,t)[0]&Pc[n])!==0,Ic=(e,t)=>{let n=jc(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},Lc=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},Rc=(e,t)=>{let n=Mc([e],t);return n[0]&16?void 0:Lc(n)},zc=(e,t)=>!!(Mc([e],t)[0]&1),Bc=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=wr.sets,a=i??[],o=a.length;wr.sets=a;try{return n()}catch(e){throw Rd(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,wr.sets=i}},Vc=(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},Hc=e=>!e.includes(void 0),Uc=e=>e.variables.map(()=>void 0),Wc=(e,t,n)=>{let r=[...e];return r[t]=n,r},Gc=(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}},Kc=e=>e.kind===`Identifier`?e.name:void 0,qc=(e,t,n)=>{if(t.kind===`Label`)return qc(e,t.body,n);let r=Kc(t);if(r===void 0)return;let i=ju(n,r);if(i?.kind===`Thunk`)return qc(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=md(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?qc(e,o.body,o.scope):void 0},Jc=(e,t,n)=>{if(t.kind===`Prime`)return qc(e,t.expression,n);if(t.kind===`Label`)return Jc(e,t.body,n);let r=Kc(t);if(r===void 0)return;let i=ju(n,r);if(i?.kind===`Thunk`)return Jc(e,i.expression,i.scope);if(i)return;let a=md(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?Jc(e,a.body,a.scope):void 0},Yc=e=>{if(typeof e!=`boolean`)throw new m(`TLC expected a boolean expression.`);return e},Xc=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Zc=(e,t,n)=>{t===void 0?Hc(n)&&e.onState(n):Hc(n)&&Xc(e)?$c(e,t,n):t.kind===`Predicate`?el(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?ll(e,t.expression,t.rest,t.scope,n):Qc(e,t,n)&&Zc(e,t.rest,n)},Qc=(e,t,n)=>{let r=e.environment,i=H(t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return H(t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?ku(t,r.runtime.version):t}})();return!Xt(i,a)},$c=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){ll(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!Qc(e,r,n):!Yc(H(r.expression,Vc(e,r.scope,n))))return}e.onState(n)},el=(e,t,n,r,i)=>Bc(e,t,()=>{switch(t.kind){case`Let`:el(e,t.body,n,jd(t.definitions,Vc(e,r,i)),i);return;case`Label`:el(e,t.body,n,r,i);return;default:if(sl.has(t.kind))throw new m(`The state relation is not a boolean expression.`);Bc(e,t,()=>cl(e,t,n,r,i))}}),tl=(e,t,n,r)=>{Yc(t)&&Zc(e,n,r)},nl=(e,t,n,r,i)=>{let a=Vc(e,r,i);if(t.kind===`Identifier`){let o=ju(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){el(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){el(e,o.operator.body,n,o.operator.scope,i);return}let s=o?void 0:e.environment.definitions.get(t.name),c=o?void 0:md(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&Nc(s,e.environment))){el(e,c.body,n,c.scope,i);return}tl(e,H(t,a),n,i);return}let o=hd(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?el(e,o.body,n,Dd(o,t.args,a),i):tl(e,H(t,a),n,i)},rl=(e,t,n,r,i)=>{let a=n[r];a===void 0?Zc(e,t,Wc(n,r,i)):Xt(a,i)&&Zc(e,t,n)},il=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),al=(e,t,n,r,i)=>{let[a,o]=t.args,s=e.isInit?qc(e,a,r):Jc(e,a,r),c=Vc(e,r,i);if(s===void 0){H(t,c)===!0&&Zc(e,n,i);return}let l=H(o,c),u=i[s];if(t.operator===`=`){rl(e,n,i,s,l);return}let d=t.operator===`\\subseteq`?{kind:`Subset`,base:l}:l;if(u!==void 0)H(t,c)===!0&&Zc(e,n,i);else{if(!Qn(d))throw new m(`The right side of \\IN is not enumerable.`);for(let t of dr(d))Zc(e,n,Wc(i,s,t))}},ol=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),sl=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),cl=(e,t,n,r,i)=>{let a=Vc(e,r,i);switch(t.kind){case`Identifier`:nl(e,t,n,r,i);return;case`Apply`:if(ol.has(t.operator)&&t.args.length===2){al(e,t,n,r,i);return}if(t.operator===`=>`&&t.args.length===2){if(Yc(H(t.args[0],a))){el(e,t.args[1],n,r,i);return}Zc(e,n,i);return}nl(e,t,n,r,i);return;case`And`:{let a=t.operands;if(t.isBulleted||a.length===2){let t=a.slice(1).reduceRight((e,t)=>il(`Predicate`,t,r,e),n);el(e,a[0],t,r,i);return}let o=a[a.length-1];el(e,Gc(t,a.length-1),il(`Predicate`,o,r,n),r,i);return}case`Or`:{let a=t.operands;if(t.isBulleted||a.length===2){a.forEach(t=>el(e,t,n,r,i));return}el(e,Gc(t,a.length-1),n,r,i),el(e,a[a.length-1],n,r,i);return}case`Exists`:Yu(t.bounds,a,r=>(el(e,t.body,n,r,i),!1));return;case`Forall`:{let r=[];if(Yu(t.bounds,a,e=>(r.push(e),!1)),r.length===0){Zc(e,n,i);return}let o=r.slice(1).reduce((e,n)=>il(`Predicate`,t.body,n,e),n);el(e,t.body,o,r[0],i);return}case`If`:el(e,Yc(H(t.condition,a))?t.consequent:t.alternative,n,r,i);return;case`Case`:{let o=t.arms.find(e=>Yc(H(e.condition,a)))?.body??t.other;if(o===void 0)throw new m(`TLC encountered a CASE with no conditions true.`);el(e,o,n,r,i);return}case`FunctionApplication`:{let r=ed(H(t.function,e.isInit?a:Fu(a)));if(r){el(e,r.body,n,td(r,t,a),i);return}break}case`Unchanged`:if(!e.isInit){ll(e,t.expression,n,r,i);return}break;case`BoxAction`:if(!e.isInit){el(e,t.action,n,r,i),ll(e,t.subscript,n,r,i);return}break;case`AngleAction`:if(!e.isInit){el(e,t.action,il(`Changed`,t.subscript,r,n),r,i);return}}tl(e,H(t,a),n,i)},ll=(e,t,n,r,i)=>Bc(e,t,()=>{let a=qc(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&rl(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){Zc(e,n,i);return}let s=o.reduceRight((e,t)=>il(`Unchanged`,t,r,e),n);ll(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=ju(r,t.name);if(a?.kind===`Thunk`){ll(e,a.expression,n,a.scope,i);return}let o=a?void 0:md(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){ll(e,o.body,n,o.scope,i);return}}let o=e.environment,s=H(t,{environment:o,scope:r,state:e.current,next:void 0}),c=H(t,{environment:o,scope:r,state:i,next:void 0});Xt(s,c)&&Zc(e,n,i)}),ul=(e,t,n,r,i=!1)=>{let a=e.callStack;if(!a)throw Error(`The replay needs an environment that records its call stack`);return{environment:e,callStack:a,isInit:t,isEnabled:i,current:n,onState:r}},dl=/* @__PURE__ */ Error(`The replay found a successor`),fl=(e,t,n,r)=>{let i=ul(r,!1,n,()=>{throw dl},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=il(`Changed`,e.subscript,t,void 0);el(i,e.action,n,t,Uc(r))}else el(i,e,void 0,t,Uc(r));return!1}catch(e){if(e!==dl)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},pl=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=ul(t,!0,void 0,n),o=i.reduceRight((e,t)=>il(`Predicate`,t.expression,t.scope,e),void 0);el(a,r.expression,o,r.scope,Uc(t))},ml=(e,t,n,r)=>{e.some(e=>sl.has(e.expression.kind))||e.forEach(e=>{let i=[],a=ul(n,!1,t,e=>i.push(e));el(a,e.expression,void 0,e.scope,Uc(n)),i.forEach(t=>r(t,e))})},hl=/* @__PURE__ */ new WeakMap,gl=/* @__PURE__ */ new WeakMap,_l=(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},vl=(e,t,n)=>{let r=e.slice();return r[t]=n,r},yl=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,bl=(e,t)=>{let n=new m(t);return e.isInit?n:v(n,a.error)},xl=(e,t,n,r)=>{let i=yu(n);return r&&sl.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 ${yl(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},Sl=(e,t,n)=>{let r=Li(t),i=vu(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 ${yl(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
138
|
+
`:``}${i}`},Cl=(e,t,n)=>wl(e,t,H(t,n)),wl=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;throw bl(e,xl(e,n,t,r))},Tl=(e,t,n,r)=>r.environment.callStack?H(n,r):(e[t]??=Vd(n,r.environment))(r),El=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Dl=(e,t,n)=>{let r=n?hl:gl,i=r.get(e);if(i)return i;let a=iu(e,t,n);return r.set(e,a),a},Ol=(e,t)=>{if(t.constants.has(e))return;let n=Ru(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},kl=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return kl(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=Ol(e.name,t);if(a&&!r.has(a))return r.add(a),kl(a.body,t,n,r)},Al=(e,t,n)=>kl(e,t,!n),jl=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return jl(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=jd(e.definitions,_l(r,t,n));return jl(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=ju(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return jl(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=Ol(e.name,r.environment);if(s)return jl(s.body,void 0,n,r,i)},Ml=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||k(e))||!t&&e.kind===`Prime`,Nl=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Nl(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[r];let i=Ol(e.name,t);if(i)return n.add(e.name),Nl(i.body,t,n)},Pl=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Fl=(e,t,n)=>Pl.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||El(e.operator)&&(Ml(e.args[0],n)||Al(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,Il=/* @__PURE__ */ new Set,Ll=(e,t)=>{if(k(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return cs(e,(e,i)=>{let a=r.isReadOnly?Ll(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},Rl=(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:Ru(r,t);return i&&!n.has(i)&&(n.add(i),Rl(i.body,t,n))?!0:Je(e).some(e=>Rl(e,t,n))},zl=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Al(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=Nl(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return Fl(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Dl(e,t,n)}},Bl=(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(Rc(e,t)===void 0||Rl(e,t,/* @__PURE__ */ new Set))return!0;let n=Ll(e,Il);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)}},Vl=(e,t,n)=>{let r=e.map(e=>zl(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Xc(t);for(let s=e;s<r.length;s++){if(s>0&&f&&ou(u)){d??=_l(t,n,u);for(let e=s;e<r.length;e++){let n=r[e].expression,i=Tl(a,e,n,d);if(!wl(t,n,i,!1))return}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=_l(t,n,u);let r=Tl(i,s,e.expression,d);if(!wl(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=_l(t,n,u);let r=Tl(i,s,e.value,d),a=u[e.index];if(a===void 0)u=vl(u,e.index,r),d=void 0;else if(!Xt(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let t of e.indices){let e=(r??u)[t];if(e===void 0)r??=u.slice(),r[t]=n[t];else if(!Xt(e,n[t]))return}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},Hl=e=>(t,n,r,i,a,o)=>{Cl(t,e,_l(t,n,r))&&o(r,i)},Ul=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=_l(r,i,a);if(a[l]!==void 0){Cl(r,e,u)&&c(a,o);return}let d=H(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Qn(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${yl(r)}, the right side of \\IN is not enumerable.`;throw bl(r,`${t}\n${vu(e)}`)}let p=dr(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(vl(a,l,p[e]),o)}},Wl=/* @__PURE__ */ new WeakMap,Gl=e=>{let t=Wl.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Gl),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Wl.set(e,n),n},Kl=(e,t)=>{let n=e.args[0],r=Hl(e),i=(e,r,i)=>jl(n,r,i,e,!t)??-1,a=Ul(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=H(e.args[1],_l(t,n,o));l(vl(o,u,d),s)}},ql=(e,t,n)=>{let r=vu(e);return(i,a,o,s,c,l)=>{let u=_l(i,a,o),d=H(e.function,n?u:Fu(u)),f=ed(d);if(f!==void 0){Dl(f.body,t,n)(i,td(f,e,u),o,s,c,l);return}if(!j(d))throw bl(i,`In computing ${yl(i)}, a non-function (${Li(d)}) was applied as a function.\n${r}`);let p=H(e,u);if(typeof p!=`boolean`)throw bl(i,`In computing ${yl(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Jl=(e,t)=>{if(Nl(e,t))return Vl([Gl(e)],t,!1);if(e.kind===`Tuple`)return Dl(Gl(e),t,!1);let n=Gl(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?ju(i,e.name):void 0;l?.kind===`Thunk`&&!l.isReleased?Dl(Gl(l.expression),t,!1)(r,l.scope,a,o,s,c):Cl(r,n,_l(r,i,a))&&c(a,o)}},Yl=(e,t,n)=>{let r=e.operator,i=Hl(e),a=k(e)?void 0:md(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Kd(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=Dl(a.body,t,n),o.body(e,i(_l(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=_l(a,o,s),f=hd(e,d);f?.kind===`Closure`?Dl(f.body,t,n)(a,Dd(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Xl=(e,t,n)=>{let r=Hl(e),i=k(e)?void 0:Ol(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=ju(s,e.name);f?.kind===`Thunk`&&!f.isReleased?Dl(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=Dl(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Zl=(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=kl(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},Ql=e=>e.kind===`And`?e.operands.flatMap(Ql):[e],$l=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&Fl(e,t,!1),eu=e=>{let t=[];return(n,r,i)=>{let a=_l(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!wl(n,i,Tl(t,r,i,a)))return}}},tu=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=Ql(e),r=n.findIndex(e=>!$l(e,t)||Zl(e,t)),i=r===-1?void 0:Zl(n[r],t);return i?{...i,before:r===0?void 0:eu(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>tu(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=md(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=tu(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&&Kd(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(_l(e,t,n)),n))}},nu=(e,t,n)=>{let r=ju(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},ru=(e,t,n)=>{let r=e.map(e=>Dl(e,t,n)),i=n?[]:e.map(e=>tu(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&&nu(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)}}},iu=(e,t,n)=>{let r=e=>Dl(e,t,n);switch(e.kind){case`And`:return Vl(e.operands,t,n);case`Or`:return ru(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=Hu(H(a.set,_l(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,Mu(r,e,u[t]),o,s,c,l)}}let o=n?void 0:Bl(e,t);if(o){let r=Vl(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=_l(n,i,a),d=e.bounds.map(e=>Hu(H(e.set,u),e.set,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=Mu(t,o.names[e],r);if(e===d.length-1){let e=_l(n,i,a);if(!o.guards.every(t=>Cl(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{Yu(e.bounds,_l(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Rc(e,t)!==void 0&&!Rl(e.body,t,/* @__PURE__ */ new Set)?Ll(e,Il):void 0;return(t,n,r,o,s,c)=>{let l=[];Yu(e.bounds,_l(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>ju(n,e)?.kind===`Value`)){u.every(n=>Cl(t,e.body,_l(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&ou(r)?u.slice(n).every(n=>Cl(t,e.body,_l(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=H(e.condition,_l(r,i,a));if(typeof l!=`boolean`)throw bl(r,Sl(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=_l(r,i,a),u=t.find(e=>{let t=H(e.condition,l);if(typeof t==`boolean`)return t;throw bl(r,`In computing ${yl(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Li(t)}) was used as a guard condition of a CASE.\n${yu(e.source)}`)})?.body??n;if(!u)throw bl(r,`In computing ${yl(r)}, TLC encountered a CASE with no conditions true.\n${vu(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=Nd(e.definitions,t);return(t,r,a,o,s,c)=>n(t,jd(e.definitions,_l(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new m(`UNCHANGED appears in an initial predicate at ${gu(e)}`)}:Jl(e.expression,t);case`AngleAction`:{let n=r(e.action),i=Gl(e.subscript),a=(e,n,r)=>{try{return Cl(e,i,_l(e,n,r))}catch(n){throw e.isEnabled?ku(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,Gl(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Xl(e,t,n);case`FunctionApplication`:return ql(e,t,n);case`Apply`:{let i=e.args;if(El(e.operator)){let r=Al(i[0],t,n);if(r!==void 0)return e.operator===`=`?Vl([e],t,n):Ul(e,()=>r);if(Ml(i[0],n))return Kl(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=H(i[0],_l(t,n,r));(typeof c==`boolean`?c:Lu(c,`the left side of => at ${gu(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return Yl(e,t,n)}default:return Hl(e)}},au=e=>e.variables.map(()=>void 0),ou=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},su=(e,t)=>{let n=t.state;if(!n||!ou(n))throw new m(`ENABLED needs a complete state at ${gu(e)}`);let r=t.environment;if(r.callStack)return fl(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return Dl(e,r,!1)(i,t.scope,au(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},cu=(e,t,n,r)=>{let i={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};Dl(e,t,!0)(i,r,au(t),void 0,!1,e=>{if(!i.isStopped){if(!ou(e))throw v(new b([...e]),a.error);i.isStopped=n(e)}})},lu=(e,t,n)=>{let r=[];return cu(e,t,e=>(r.push(e),!1),n),r},uu=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return Dl(e,n,!1)(a,i,au(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!ou(e)){let r=n.variables.filter((t,n)=>e[n]===void 0);throw new ee(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)}o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},du=(e,t,n,r)=>{let i=[];return uu(e,t,n,e=>(i.push(e),!1),r),i},fu=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),pu=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),mu=e=>pu.has(e.kind)||e.kind===`Apply`&&fu.has(e.operator),hu=(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&&ot(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},gu=e=>`line ${e.location.line}, column ${e.location.column}`,_u=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,vu=e=>{let t=e.location.range;return t?_u(t):gu(e)},yu=e=>e.kind===`Number`?e.text??String(e.value):vu(e),bu=(e,t)=>new m(`A non-boolean expression (${Li(t)}) was used as the condition of an IF.\n${vu(e)}`),xu=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new m(`A non-boolean expression (${Li(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${yu(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new m(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${Li(n)}.\n${vu({...e,location:{...e.location,range:{...r,end:i}}})}`)},Su=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${L(n)}\n${vu(e)}`,r=e=>`Attempted to apply function:\n${it(L(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!j(i))throw new m(`Attempted to select field "${t}" from a non-record value ${it(L(i))}\n${vu(e)}`);let a=Ht(i);if(a===`tuple`)throw Pr(t);return Lr(i,t,a===`record`?n:r)}},Cu=e=>e===`1.7.4`?(t,n)=>jr(t,n,e):void 0,wu=e=>t=>{if(!j(t))throw new m(`Attempted to apply the operator DOMAIN to a non-function\n(${Li(t)})\n${vu(e)}`);return zr(t)},Tu=(e,t)=>(n,r)=>{if(!A(n)||At(n))throw new m(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${vu(e)}`);return t.evaluate([n,r])},Eu=e=>v(new m(`TLC can't handle real numbers: ${e.text} at ${gu(e)}`),a.configParseError),Du=e=>v(new m(`TLC can't handle a number this big: ${e.text??e.value} at ${gu(e)}`),a.error),Ou=(t,n)=>new e(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${vu(n)}`,t),ku=(t,n)=>t instanceof e&&n!==`1.7.4`?new m(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${t.variable} occurring in the state formula v.\n`):t,Au=e=>new m(`A primed expression appears outside an action at ${gu(e)}`),ju=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},Mu=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Nu=(e,t,n)=>{if(t.kind===`Name`)return Mu(e,t.name,n);let r=Sr(n);if(!r||r.length!==t.names.length)throw new m(`Cannot bind <<${t.names.join(`, `)}>> to ${L(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>Mu(e,t,r[n]),e)},Pu=(e,t)=>{if(j(e))return e;throw new m(`A non-function (${Li(e)}) was applied as a function.\n${vu(t)}`)},Fu=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},Iu=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),Lu=(e,t)=>{if(typeof e!=`boolean`)throw new m(`Expected ${t} to be a boolean but found ${L(e)}`);return e},Ru=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),zu=(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.`},Bu=(e,t,n)=>{if(!A(e)||At(e)){let r=L(e),i=n===`1.7.4`?void 0:zu(e,r);throw new m(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${yu(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${yu(t)}\n${i}`)}},Vu=(e,t,n)=>(Bu(e,t,n),typeof e==`object`&&e.kind===`Interval`?Gn(e):ar(e)??ur(e)),Hu=(e,t,n)=>n===`1.7.4`?(Bu(e,t,n),ar(e)??dr(e)):Vu(e,t,n),Uu=e=>{if(typeof e==`object`&&e.kind===`Interval`)return vr(e),e},Wu=(e,t,n)=>Uu(e)??Hu(e,t,n),Gu=(e,t,n)=>Uu(e)??Vu(e,t,n),Ku=(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},qu=(e,t)=>e.map(e=>Wu(H(e.set,t),e.set,t.environment.runtime.version)),Ju=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Ku(t[n],t=>i(n-1,Nu(a,e[n].pattern,t)));return i(e.length-1,n)},Yu=(e,t,n)=>Ju(e,qu(e,t),t.scope,n),Xu=(e,t)=>{let n=e.map(e=>H(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Zu=(e,t,n)=>{if(e.length===1)return Nu(t,e[0].pattern,n);let r=Sr(n)??[];return e.reduce((e,t,n)=>Nu(e,t.pattern,r[n]),t)},Qu=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,$u=e=>Object.assign(e.value,{lambda:e}),ed=e=>Qu(e)?e.lambda:void 0,td=(e,t,n)=>{let r=e.value,i=t.args.map(e=>H(e,n)),a=i.length===1?i[0]:Yn(i),o=(e,n,i)=>`In applying the function\n${it(L(r))},\nthe ${e} is:\n${it(L(n))}${i}.\n${vu(t.function)}`,s=e.bounds;if(s.length===1){if(!Er(a,r.domain))throw new m(o(`first argument`,a,`which is not in its domain`));return Zu(s,e.scope,a)}let c=Sr(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0||c.length<s.length)throw new m(`Attempted to apply a function to an argument not in its domain.\n${vu(t.function)}`);return s.forEach((e,t)=>{let n=c[t],r=`argument number ${t+1}`;if(!Er(n,l[t]))throw new m(o(r,n,`${e.pattern.kind===`Name`?``:`
|
|
139
|
+
`}which is not in its domain`));if(e.pattern.kind===`Tuple`&&Sr(n)?.length!==e.pattern.names.length)throw new m(o(r,n,`which does not match its formal parameter`))}),Zu(s,e.scope,Yn(c.slice(0,s.length)))},nd=(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:_u(n)}},rd=(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}},id=(e,t,n)=>{let r={kind:`LazyFunction`,domain:e,source:n,apply:e=>t(e,r)};return r},ad=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),od=(e,t)=>{let n=Xu(e.bounds,t),r=id(n,(n,r)=>H(e.body,Iu(t,Zu(e.bounds,Mu(void 0,e.name,r),n))),rd(nd(e.bounds,e.body),e.bounds,n));return $u({value:r,bounds:e.bounds,body:e.body,scope:Mu(void 0,e.name,r)}),e.bounds.length===1?Ut(r):r},sd=(e,t)=>{if(typeof t!=`object`||Ht(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!ot(t.domain))return t;try{let e=I(t);return zt(e.domain,e.range)}catch(e){if(e instanceof m)return t;throw e}},cd=(e,t)=>e.kind===`Operator`&&e.params.length>0?()=>{throw new m(`Operator ${e.name} requires ${e.params.length} arguments`)}:e.kind===`Function`?e.isSelfReferential?t=>od(e,t):Vd(ad(e),t):Vd(e.body,t),ld=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=cd(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(Iu(e,void 0)):e=>a[i]??r(Iu(e,void 0));return t.definitionEvaluators.set(e,o),o},ud=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},dd=(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)||!Nc(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(()=>sd(e,cd(e,t)(i)));kn(n),t.startupValues[r]=n}catch(e){if(!(e instanceof m)&&!p(e))throw e}}),fd=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(e.cache!==void 0&&(n||e.isReleased))return e.cache;let r=H(e.expression,Iu(t,e.scope));return n&&(!e.isStreamed||pr(r))&&(e.cache=r),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),r},pd=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),md=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return md(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?pd(r):t.builtins.get(e)},hd=(e,t)=>k(e)?gd(e.operator,t):md(e.operator,t.environment)??gd(e.operator,t),gd=(e,t)=>{let n=ju(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return md(e,t.environment)},_d=e=>e.kind===`Closure`?e.params.length:e.arity,vd=(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:gd(n,t);if(!r)throw new m(`Expected an operator argument at ${gu(e)}`);return r},yd=(e,t,n)=>{if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>Mu(e,n.name,t[r]),e.scope);return H(e.body,Iu(n,r))},bd=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:_d(e),call:n=>yd(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},xd=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=gd(e.name,t);return n!==void 0&&_d(n)>0},Sd=(e,t)=>e.map(e=>xd(e,t)?bd(vd(e,t),t):H(e,t)),Cd=(e,t)=>new m(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),wd=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),Td=(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 Td(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([])}},Ed=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&<(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=k(e)?void 0:Td(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=ju(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:wd(e,t)}}return t=>wd(e,t)},Dd=(e,t,n,r)=>{if(t.length!==e.params.length)throw Cd(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:vd(t[a],n)}:(r?.[a]??Ed(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},Od=(e,t,n,r)=>e.kind===`Closure`?H(e.body,Iu(n,Dd(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>H(e,n))):e.isLazy?e.evaluate(Wd(t,n),n):e.evaluate(Sd(t,n),n),kd=/* @__PURE__ */ new WeakMap,Ad=e=>{let t=kd.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return kd.set(e,n),n},jd=(e,t,n)=>e.reduce((e,r)=>{let i={name:r.name,binding:{kind:`Value`,value:!1},parent:e};return r.kind===`Function`?(i.binding={kind:`Thunk`,expression:Ad(r),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1},i):r.params.length>0||n?.impure.has(r)?(i.binding={kind:`Operator`,operator:{kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:i}},i):(i.binding={kind:`Thunk`,expression:r.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(r)??!1},i)},t.scope),Md=(e,t,n)=>{let r=ju(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return fd(r,n);if(r?.kind===`Operator`){if(_d(r.operator)===0)return yd(r.operator,[],n);throw new m(`Operator ${e} is used without arguments`)}let i=Td(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Ou(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return ld(i.definition,n.environment)(n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new m(`Unknown identifier ${e} at ${gu(t)}`)},Nd=(e,t)=>({impure:new Set(e.filter(e=>Fc(e,t))),streamed:new Set(e.filter(e=>Fc(e,t,`streamed`)))}),Pd=e=>[...e.facts.ids.keys()].some(t=>Fc(t,e)),Fd=e=>[...e.facts.ids.keys()].some(t=>Fc(t,e,`repeated`)),Id=e=>typeof e==`object`&&e.kind===`FilteredSet`&&`rebind`in e,Ld=(e,t,n,r)=>i=>{r.expressions.push(e);let a=wr.sets,o=wr.callStack,s=a??[],c=s.length;wr.sets=s,wr.callStack=r;try{let a=t(i),o=Id(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&mu(e)&&r.sources.set(o,e),o}catch(t){let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=hu(e,r.values),a=i&&!Je(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!j(a)?void 0:a;throw Rd(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,wr.sets=a,wr.callStack=o}},Rd=(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 m){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},zd=(e,t,n)=>{if(!(n instanceof m))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}},Bd=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),V=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=lf(e,t),i=t.callStack,a=i?Ld(e,r,t,i):r;return t.evaluators.set(e,a),a},Vd=(e,t)=>{if(t.callStack)return V(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=sa(e,t)??V(e,t);return t.entryEvaluators.set(e,r),r},H=(e,t)=>Vd(e,t.environment)(t),Hd=(e,t)=>{let n=e.name,r=k(e)?void 0:Td(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Ou(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??=ld(e,t))(r)}return t=>Md(n,e,t)},Ud=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||k(e))return!0;let n=md(e.name,t);return n===void 0||_d(n)===0},Wd=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>H(e,t),expression:e})),Gd=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Wd(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Ud(t[0],n)){let e=V(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Ud(t[0],n)&&Ud(t[1],n);if(i&&a){let e=V(t[0],n),r=V(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(Sd(t,n),n)},Kd=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw Cd(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Ed(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:vd(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},qd=(e,t,n)=>{let r=Kd(e,t,n),i={body:void 0};return t=>(i.body??=Vd(e.body,n),i.body({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},Jd=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=V(n[0],t),r=V(n[1],t);return t=>!Lu(e(t),`the left side of =>`)||Lu(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new m(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=k(e)?void 0:md(e.operator,t);if(r?.kind===`Closure`)return qd(r,n,t);if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=V(n[0],t),i=wu(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=V(n[0],t);return ts.has(e)||zc(n[0],t)?i:e=>e.scope===void 0?r.evaluate([i(e)]):i(e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=V(n[0],t),a=V(n[1],t),o=Tu(e,r);return e=>o(i(e),a(e))}if(r?.kind===`Builtin`)return Gd(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new m(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=>Ed(e,t));return r=>{let a=gd(e.operator,r);if(a)return Od(a,n,r,i);throw t.definitions.get(e.operator)?.kind===`Function`?new m(`${e.operator} is a function; apply it with brackets`):new m(`Unknown operator ${e.operator} at ${gu(e)}`)}},Yd=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=V(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=V(a.set,t);return s=>Ku(Wu(o(s),a.set,t.runtime.version),t=>Lu(i(Iu(s,Mu(s.scope,e,t))),r)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>V(e.set,t));return s=>{let c=a.map((e,n)=>Wu(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?Lu(i(Iu(s,a)),r)!==n:Ku(c[t],n=>l(t-1,Mu(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>Yu(o,e,t=>Lu(i(Iu(e,t)),r)!==n)?!n:n},Xd=(e,t)=>{if(e.kind===`Tuple`)return Yn(e.names.map(e=>{let n=ju(t,e);return n?.kind===`Value`&&n.value}));let n=ju(t,e.name);return n?.kind===`Value`?n.value:void 0},Zd=/* @__PURE__ */ new WeakSet,Qd=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&Zd.add(e)},$d=/* @__PURE__ */ new WeakMap,ef=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(`@`),Je(e).every(n)),r=n(e)?[...t]:void 0;return $d.set(e,r),r},tf=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=ju(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),nf=(e,t)=>{let n=Zd.has(e),r=V(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=V(a.set,t),c=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=qn(e),o=zt(i,i.map(e=>r(Iu(t,Mu(t.scope,n,e)))));return ot(e)?o:Ut(o)}let n=[],s=i.map(e=>Gu(H(e.set,t),e.set,t.environment.runtime.version));return Ju(i,s,t.scope,e=>{let o=i.length===1?Xd(a.pattern,e)??!1:Yn(i.map(t=>Xd(t.pattern,e)??!1));return n.push([o,r(Iu(t,e))]),!1}),Rn(n)},l=nd(i,e.body),u=ef(e.body),d=(t,n)=>{let a=tf(n.scope,u),o=Iu(n,a),s=$u({value:id(t,e=>r(Iu(o,Zu(i,a,e))),rd(l,i,t)),bounds:i,body:e.body,scope:a});return i.length===1?Ut(s):s},f=t.callStack;return t=>{let r=o?s(t):Xu(i,t);if(e.isRecursive||n||t.isKeepLazy||!N(r))return d(r,t);if(!ot(r)){if(f)return d(r,t);try{return c(r,t)}catch(e){if(!(e instanceof m))throw e;return d(r,t)}}if(!f)return c(r,t);try{return c(r,t)}catch(t){throw zd(f,e,t),t}}},rf=(e,t)=>{let n=Zd.has(e);n&&Qd(e.function);let r=V(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>V(e,t))}),value:V(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Yn(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Iu(i,Mu(i.scope,`@`,e))):Br(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(ca.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${vu(e.function)}`)}return n}},af=(e,t)=>{if(e.kind===`SetFilter`){let n=V(e.predicate,t),r=V(e.bound.set,t),i=e.bound.pattern,a=e.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:_u(a)},s=(e,t)=>n=>Lu(e(Iu(t,Nu(t.scope,i,n))),`a set filter predicate`),c=(t,n,r)=>({kind:`FilteredSet`,base:t,test:s(r,n),source:o,rebind:r=>c(t,{...n,environment:r},V(e.predicate,r))});return e=>{let t=r(e);return ot(t)?Rt(P(t).elements.filter(s(n,e))):c(t,e,n)}}if(e.kind===`SetMap`){let n=V(e.expression,t);return t=>{let r=[];return Yu(e.bounds,t,e=>(r.push(n(Iu(t,e))),!1)),Nn(r)}}let n=e.set;if(!n)return()=>{throw new m(`TLC cannot evaluate an unbounded CHOOSE at ${gu(e)}`)};let r=V(e.body,t),i=V(n,t);return t=>{let a=i(t);if(!A(a)||At(a))throw new m(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${vu(e)}`);let o={value:void 0},s=Gu(a,n,t.environment.runtime.version);if(Ku(s,n=>{let i=Nu(t.scope,e.pattern,n);return Lu(r(Iu(t,i)),`the body of CHOOSE`)?(o.value=Xd(e.pattern,i),!0):!1}),o.value===void 0)throw new m(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${vu(e)}`);return o.value}},of=e=>[...e].sort((e,t)=>Ft(e.name,t.name)),sf=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),cf=(e,t)=>{let n=of(e),r=sf(n),i=n.map(e=>V(e.value,t));if(r)return e=>Xn(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=>pt(a,i.map(t=>t(e)),o):e=>Zn(a,i.map(t=>t(e)))},lf=(e,t)=>{let n=e=>V(e,t);switch(e.kind){case`Number`:{let t=e.value;return lt(t)?()=>t:()=>{throw Du(e)}}case`Decimal`:return()=>{throw Eu(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return Hd(e,t);case`Apply`:return Jd(e,t);case`Bracket`:return()=>{throw new m(`A bracket without a function or subscript is not an expression at ${gu(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new m(`An operator cannot be used as a value at ${gu(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 xu(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 xu(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw Au(e);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0,isKeepLazy:n.isKeepLazy})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>Xt(t(e),r(e))}case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw bu(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 m(`A non-boolean expression (${Li(t)}) was used as a condition of a CASE. ${yu(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new m(`Attempted to evaluate a CASE with no conditions true.\n${vu(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(Iu(n,jd(e.definitions,n)))}case`Forall`:case`Exists`:return Yd(e,t);case`UnboundedQuantifier`:return()=>{throw new m(`TLC cannot evaluate an unbounded quantifier at ${gu(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return af(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Nn(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>Yn(t.map(t=>t(e)))}case`FunctionConstruction`:return nf(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 cf(e.fields,t);case`RecordSet`:{let t=of(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 rf(e,t);case`ExceptAt`:return t=>{let n=ju(t.scope,`@`);if(n?.kind!==`Value`)throw new m(`@ appears outside an EXCEPT at ${gu(e)}`);return n.value};case`FunctionApplication`:{Qd(e.function);let r=n(e.function),i=t=>Pu(r(Fu(t)),e),a=e.args.map(n),o=Cu(t.runtime.version);if(a.length===1){let e=a[0];return t=>Lr(i(t),e(t),o)}return e=>Lr(i(e),Yn(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=Su(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=n({kind:`Unchanged`,expression:e.subscript,location:e.location}),i=e.kind===`BoxAction`;return e=>i?Lu(t(e),`an action`)||r(e):Lu(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>su(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new m(`The subexpression reference at ${gu(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new m(`TLC cannot evaluate a temporal formula in a state at ${gu(e)}`)}}},uf=`tlc2/value/impl/`,df={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},ff={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},pf=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)}},mf=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),hf=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],gf=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??mf.get(e[3])}${`[]`.repeat(e[1].length)}`),_f=(e,t)=>e[e[t].first].text,vf=(e,t)=>_f(e,t).replaceAll(`/`,`.`),yf=e=>{let t=pf(e);if(t.readUint32()!==3405691582)throw new l(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],r=t.readUint16(),i=new TextDecoder;for(let e=1;e<r;e++){let r=t.readUint8(),a={tag:r,text:``,value:0,first:0,second:0};n[e]=a,r===df.utf8?a.text=i.decode(t.readBytes(t.readUint16())):r===df.integer?a.value=t.readInt32():r===df.float?t.readUint32():r===df.long||r===df.double?(t.readBytes(8),e++):r===df.class||r===df.string||r===df.methodType||r===df.module||r===df.package?a.first=t.readUint16():r===df.methodHandle?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16();let a=vf(n,t.readUint16());t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let o=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,s=i.indexOf(`)`),c=gf(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:pf(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()},()=>vf(n,d.readUint16())):[],p=hf.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=gf(i.slice(s+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;o.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${a}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:o}},bf=(e,t)=>{let n=e[t],r=e[n.second];return{className:_f(e,n.first),name:e[r.first].text}},xf=(e,t,n,r)=>{let i=()=>new _(`The Java override ${n}.${e.name} computes its value, which tla-ts cannot run`),a=e.code;if(!a)throw i();let o=[],s=()=>{let e=o.pop();if(e===void 0)throw i();return e},c=e=>{let n=t[e];if(n.tag===df.integer)return n.value;if(n.tag===df.string)return t[n.first].text;throw i()};for(let e=0;e<a.length;){let n=a[e],l=()=>a[e+1]<<8|a[e+2];if(n>=ff.iconstM1&&n<=ff.iconst5)o.push(n-ff.iconst0),e+=1;else if(n===ff.bipush)o.push(a[e+1]<<24>>24),e+=2;else if(n===ff.sipush)o.push(l()<<16>>16),e+=3;else if(n===ff.ldc)o.push(c(a[e+1])),e+=2;else if(n===ff.ldcW)o.push(c(l())),e+=3;else if(n===ff.dup){let t=s();o.push(t,t),e+=1}else if(n===ff.getstatic){let n=bf(t,l());if(n.className!==`${uf}BoolValue`||n.name!==`ValTrue`&&n.name!==`ValFalse`)throw i();o.push({kind:`Identifier`,name:n.name===`ValTrue`?`TRUE`:`FALSE`,location:r}),e+=3}else if(n===ff.invokestatic){let n=bf(t,l()),a=s();if(n.className!==`${uf}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===ff.new)o.push({className:_f(t,l()),value:void 0}),e+=3;else if(n===ff.invokespecial){let n=bf(t,l()),a=s(),o=s();if(!(n.className===`${uf}StringValue`&&n.name===`<init>`&&typeof a==`string`&&typeof o==`object`&&`className`in o))throw i();o.value={kind:`String`,value:a,location:r},e+=3}else if(n===ff.areturn){let e=s();if(typeof e!=`object`)throw i();if(`className`in e){if(!e.value)throw i();return e.value}return e}else throw i()}throw i()},Sf=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=yf(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:xf(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)}))}},Cf=/* @__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(`,`),wf=[[`\\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`,`≀`],[`^+`,`⁺`]],Tf=/* @__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(`,`),Ef=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs`.split(`.`),Df=/* @__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(`.`),Of=/* @__PURE__ */ new Set([`Bags`,`Json`,`Randomization`,`TLCExt`]),kf=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
140
140
|
Nat == { }
|
|
141
141
|
a+b == {a, b}
|
|
142
142
|
a-b == CHOOSE n : b + n = a
|
|
@@ -452,9 +452,9 @@ _CheckName(name) ==
|
|
|
452
452
|
=> (PrintT(counts) /\\ FALSE)
|
|
453
453
|
_PrintCounts == PrintT(_Counts)
|
|
454
454
|
=============================================================================
|
|
455
|
-
`]]),Sf=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])]]),Cf=E(`EOF`),wf=E(`IDENTIFIER`),Tf=E(`DEFBREAK`),Ef=(e,t)=>Array.from({length:E(t)-E(e)+1},(t,n)=>E(e)+n),Df=new Set(Ef(`op_57`,`op_119`)),Of=new Set(Ef(`op_1`,`op_119`)),kf=new Set(Ef(`op_57`,`op_70`)),Af=/* @__PURE__ */ new Set([...Ef(`ACTION`,`EXCEPT`),E(`EXTENDS`),...Ef(`IF`,`SF`),E(`STATE`),...Ef(`THEN`,`WITH`),E(`US`),...Ef(`op_112`,`op_116`)]),U=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),jf=new Map([...U(`postfix`,160,160,!0,`[`),...U(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...U(`prefix`,120,120,!1,`-.`),...U(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...U(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...U(`prefix`,40,40,!0,`\\lnot`),...U(`nfix`,100,130,!0,`\\times`),...U(`infix`,140,140,!1,`^`,`^^`),...U(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...U(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...U(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...U(`infix`,100,110,!0,`|`,`||`,`%%`),...U(`infix`,100,110,!1,`%`),...U(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...U(`infix`,90,140,!1,`\\wr`),...U(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...U(`infix`,90,130,!1,`!!`),...U(`infix`,90,90,!1,`...`,`..`),...U(`infix`,80,80,!0,`\\intersect`,`\\union`),...U(`infix`,80,80,!1,`\\`),...U(`infix`,70,70,!1,`<:`,`:>`),...U(`infix`,60,60,!0,`@@`),...U(`infix`,50,140,!0,`\\cdot`),...U(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...U(`infix`,30,30,!0,`\\land`,`\\lor`),...U(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...U(`infix`,10,10,!1,`=>`)]),Mf=new Map([...jf,...gf.flatMap(e=>e.slice(1).map(t=>[t,jf.get(e[0])]))]),Nf=Mf.get(`[`),Pf={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},Ff=e=>({type:`tokens`,kinds:new Set(e)}),If=e=>typeof e==`string`?e.startsWith(`<`)?Ff([E(e.slice(1,-1))]):{type:`call`,name:e}:e,W=(...e)=>({type:`sequence`,units:e.map(If)}),G=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:W(e))}),Lf=e=>(...t)=>({type:e,body:W(...t)}),K=Lf(`zeroOrMore`),Rf=Lf(`oneOrMore`),q=Lf(`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}),zf=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Bf=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=zf(e,n);return n},Vf=(...e)=>{let t=e.map(E);return e=>t.includes(Bf(e,1).kind)},Hf=(e,t=Bf(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Uf=e=>{let t=Bf(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Wf=e=>Vf(`CASESEP`)(e)&&Hf(e),Gf=e=>{let t=Bf(e,1);Af.has(t.kind)&&(t.kind=wf)},Kf=(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}`,qf=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),Jf=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Yf=e=>e.operatorStacks[e.operatorStacks.length-1],Xf=(e,t)=>e.low>t.high,Zf=(e,t)=>e.high<t.low,Qf=e=>e.fix===`prefix`?e:Mf.get(`${e.name}.`),$f=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===Nf?qf(`FcnAppl`,[n,...r.node.heirs]):qf(`PostfixExpr`,[n,r.node]),operator:void 0})},ep=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:qf(`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:qf(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},tp=e=>{let t=Yf(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 $f(t,n),tp(e);if(i.operator!==void 0){let t=Qf(r.operator);return t!==void 0&&Xf(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Kf(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 ${Kf(e,a.node.first,a.node.last)} and expression at location ${Kf(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Zf(a.operator,r.operator)?void 0:Xf(a.operator,r.operator)?(ep(t,a.operator),tp(e)):`Precedence conflict between ops ${a.operator.name} in block ${Kf(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Qf(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Zf(s,r.operator))return;if(!Xf(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Kf(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return ep(t,s),tp(e);let c=Kf(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===Pf?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},np=e=>J(t=>{let n=Yf(t),r=Jf(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:tp(t)}),rp=np(()=>!1),ip=np(()=>!0),ap=J(e=>{e.lastOperator=Mf.get(e.token.image)}),op=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},sp=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?op(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},cp=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Hf(e,n.first.beginColumn))return n;let t=cp(e,n);if(t!==void 0)return t}},lp=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(E),n=(e,...t)=>t.some(t=>e.kind===E(t)),r=e=>e!==void 0&&Df.has(e.kind),i=e.token,a=zf(e,i);i.next=void 0;let o=zf(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===wf&&(e=e.next)}else if(e.kind===wf){let t=e.next;!r(t)||kf.has(t.kind)||Of.has(t.kind)&&t.next?.kind!==wf||(e=t.next?.kind===E(`SUBSTITUTE`)?i:Of.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Tf&&(e.next={kind:Tf,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=zf(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},up=e=>{let t=Bf(e,1);if(t.kind===E(`LAB`)){let n=1;for(;n!==0;)if(t=zf(e,t),t.kind===E(`LAB`)&&n++,t.kind===E(`RAB`)&&n--,t.kind===Cf)return!1;return zf(e,t).kind===E(`IN`)}if(t.kind!==wf)return!1;for(t=zf(e,t);t.kind===E(`COMMA`);){if(t=zf(e,t),t.kind!==wf)return!1;t=zf(e,t)}return t.kind===E(`IN`)},dp=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),fp=e=>e.proofLevels.at(-1)??-1,pp=e=>{let t=Bf(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:Vf(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||fp(e)>=0&&dp(t)>fp(e):Vf(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},mp=(e,t)=>{let n=dp(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},hp=e=>J(t=>mp(t,t.token)?void 0:`${Kf(t,t.token)}: ${e}`),gp=Ff([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(E)),_p=Ff([...gp.kinds,E(`op_76`)]),vp=Ff(Of),yp=Ff(kf),bp=Ff([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(E)),xp=()=>K(X({expansion:[G(gp,`<op_77>`)],semantic:Hf}),G(`PrefixOp`,`InfixOp`),ip),Sp=()=>G(W(X({expansion:[`OpenStart`],semantic:Hf}),`OpenExpression`,rp),W(X({semantic:Hf}),`ExtendableExpr`)),Cp=()=>G(W(`<MODULE>`,Y(`identifier`),`Identifier`),`Expression`),wp=()=>G(W(X({semantic:e=>Vf(`ASSUME`,`BOXASSUME`)(e)||Bf(e,2).kind===E(`COLONCOLON`)&&[E(`ASSUME`),E(`BOXASSUME`)].includes(Bf(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Tp=()=>[`JuncItem`,K(X({semantic:Uf}),`JuncItem`)],Ep=e=>J(t=>{t.expecting=e,Gf(t)}),Dp=e=>J(t=>{t.isTerminalProof=e}),Op=(e,...t)=>W(...t.slice(0,-1),Y(`==`),`<DEF>`,J(t=>{lp(t),t.expecting=e}),t[t.length-1]),Z=(e,t,n)=>({message:e,body:W(...t),exit:n}),kp={CompilationUnit:Z(void 0,[J(lp),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>`),Ep(`Identifier`),`Identifier`,J(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Z(void 0,[`<END_MODULE>`]),Extends:Z(`Extends`,[q(`<EXTENDS>`,Ep(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,Ep(`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(lp)),W(X({semantic:e=>Vf(`USE`)(e)&&Bf(e,2).kind!==E(`ONLY`)||Vf(`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(Op(`Expression`,X({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,Y(`[`),`<LSB>`,Y(`Identifier`),`QuantBound`,Y(`COMMA or ]`),K(`<COMMA>`,Y(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),Op(`Expression`,X({expansion:[`<IDENTIFIER>`,yp]}),`PostfixLHS`,`Expression`),Op(`Expression`,X({expansion:[`<IDENTIFIER>`,vp]}),`InfixLHS`,`Expression`),Op(`Expression or Instance`,X({expansion:[`<IDENTIFIER>`,G(`<LBR>`,`<DEF>`)]}),`IdentLHS`,G(`Expression`,`Instantiation`)),Op(`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`,[_p,Y(`Identifier`),`Identifier`]),InfixLHS:Z(`Infix LHS`,[`Identifier`,vp,`Identifier`]),PostfixLHS:Z(`Postfix LHS`,[`Identifier`,yp]),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>`,Ep(`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,[gp,ap]),NonExpPrefixOp:Z(void 0,[_p,ap]),InfixOp:Z(`Infix Op`,[vp,ap]),PostfixOp:Z(void 0,[yp,ap]),Identifier:Z(void 0,[`<IDENTIFIER>`]),Assumption:Z(`Assumption`,[Y(`ASSUM...`),G(`<ASSUMPTION>`,`<ASSUME>`),q(X({amount:2}),q(`<DEFBREAK>`),`Identifier`,Y(`==`),`<DEF>`),J(e=>{lp(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Z(`Assume-Prove`,[G(W(`Identifier`,`<COLONCOLON>`,`AssumeProve`),W(G(`<ASSUME>`,`<BOXASSUME>`),Y(`Expression, Declaration, or AssumeProve`),wp(),Y("PROVE or `,'"),K(`<COMMA>`,Y(`Expression, Declaration, or AssumeProve`),wp(),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=Jf(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Kf(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(lp),G(W(X({amount:3}),X({semantic:Vf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),q(X({semantic:pp}),`Proof`)]),Proof:Z(`Proof`,[J(e=>{e.proofLevels.push(-1)}),G(W(X({semantic:e=>Vf(`BY`)(e)||Bf(e,2).kind===E(`BY`)}),`UseOrHideOrBy`),W(X({amount:2}),q(`<PROOF>`),G(`<OBVIOUS>`,`<OMITTED>`)),W(q(X({amount:2}),`<PROOF>`),K(X({semantic:e=>Bf(e,2).kind!==E(`QED`)}),`Step`,Y(`a proof step`)),`QEDStep`)),J(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Z(`UseOrHideOrBy`,[G(W(q(`<PROOF>`),`<BY>`,Dp(!0),q(`<ONLY>`)),W(`<USE>`,Dp(!1),q(`<ONLY>`)),W(`<HIDE>`,Dp(!1))),Y("an expression, `MODULE' or `DEF'"),q(Cp(),K(`<COMMA>`,Y(`MODULE or expression`),Cp(),J(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),q(`<DF>`,Y(`MODULE or expression`),Cp(),K(`<COMMA>`,Y(`MODULE or expression`),Cp(),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`),bp,hp(`QED step's number has bad level.`),Y(`QED`),`<QED>`,q(X({semantic:pp}),`Proof`)]),Step:Z(`Step`,[Y(`Step number`),bp,hp(`step's number has bad level.`),Y(`proof step`),G(W(X({semantic:Vf(`USE`,`HIDE`)}),`UseOrHideOrBy`),W(X({semantic:Vf(`INSTANCE`)}),`Instantiation`),W(X({semantic:Vf(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),q(X({semantic:pp}),J(e=>{let t=Jf(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Kf(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Z(`DefStep`,[q(`<DEFINE>`),Rf(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:Vf(`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(_p,vp,yp),Ff([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(E))],semantic:Hf}),G(`NonExpPrefixOp`,W(`InfixOp`,J(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Kf(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),W(X({expansion:[`<LAMBDA>`],semantic:Hf}),`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:up}),G(`IdentifierTuple`,`Identifier`),Y(`\\in`),`<IN>`,`Expression`,Y(`':', ',' or '}'`),q(G(W(`<COLON>`,`Expression`),Rf(`<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=Jf(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`)),Rf(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Z(`Some [] Form`,[`<LSB>`,G(W(X({semantic:up}),`QuantBound`,K(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({semantic:e=>Bf(e,2).kind===E(`MAPTO`)&&Af.has(Bf(e,1).kind)}),J(e=>{Bf(e,1).kind=wf}),`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=qf(`FcnAppl`,t.heirs),e.lastOperator=Nf})),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>`,Rf(`ExceptComponent`,Y(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Z(`Except Component`,[G(W(`<DOT>`,J(Gf),`Identifier`),W(`<LSB>`,`Expression`,K(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Z(`Some << -- >> or >>_ Form`,[`<LAB>`,q(`Expression`,K(`<COMMA>`,`Expression`)),G(`<RAB>`,W(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Z(void 0,[`Identifier`,q(X({amount:2}),`OpArgs`),G(W(`<BANG>`,`NoOpExtension`),J(e=>{e.isFairnessHooked=e.token.kind===E(`RBR`)}))]),ReducedExpression:Z(`restricted form of expression`,[G(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Z(`Fairness Expression`,[J(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),G(`<WF>`,`<SF>`),`ReducedExpression`,q(X({amount:2}),`<LBR>`,`Expression`,`<RBR>`,J(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Z(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Z(`CASE Expression`,[`<CASE>`,`CaseArm`,K(X({semantic:e=>Wf(e)&&Bf(e,2).kind!==E(`OTHER`)}),`<CASESEP>`,`CaseArm`),q(X({semantic:Wf}),`<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`,[Rf(G(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Z(`AND-OR Junction`,[J(e=>{let t=Bf(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),G(W(X({expansion:[`<OR>`]}),...Tp()),W(X({expansion:[`<AND>`]}),...Tp())),J(e=>{e.junctions.pop()})]),JuncItem:Z(`Junction Item`,[G(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=cp(t,e.heirs[1]);return n&&`Item at ${Kf(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Kf(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([])}),xp(),Sp()],(e,t)=>{let n=Yf(t);n.push({node:e.heirs[0],operator:Pf});let r=tp(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`),rp,K(G(W(X({expansion:[`PostfixOp`],semantic:Hf}),`PostfixOp`,ip),W(X({expansion:[`<DOT>`],semantic:Hf}),`<DOT>`,J(Gf),X({semantic:Hf}),`Identifier`,J(e=>{let t=Yf(e);t[t.length-1].operator!==void 0&&$f(t,t.length),t[t.length-1]={node:qf(`RecordComponent`,[t[t.length-1].node,Jf(e,2),Jf(e,1)]),operator:void 0}})),W(X({expansion:[`<LSB>`],semantic:Hf}),Y(`function argument`),`SBracketCases`,np(e=>e.kind===`FcnAppl`)))),q(G(W(X({expansion:[`InfixOp`],semantic:Hf}),`InfixOp`,ip,xp(),Sp()),W(X({expansion:[`<COLONCOLON>`],semantic:Hf}),`<COLONCOLON>`,J(e=>{let t=Yf(e);if(!sp(t[t.length-1].node))return`\`::' at ${Kf(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,J(e=>{let t=Yf(e),n=Jf(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Zf(r,e.lastOperator)){let t=Jf(e,3);return`Removing label at ${Kf(e,t.first,t.last)} would change expression parsing.`}t.push({node:qf(`Label`,[Jf(e,3),Jf(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Z(`Primitive expression`,[G(W(X({expansion:[`String`],semantic:Hf}),`String`),W(X({expansion:[`<NUMBER_LITERAL>`],semantic:Hf}),`Number`),W(G(`Identifier`,W(G(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),J(e=>fp(e)<0&&e.proofLevels.length<=1?`${Kf(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Kf(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:op(e.heirs)===void 0?e.heirs.length===1?qf(`GeneralId`,e.heirs):void 0:qf(`OpApplication`,e.heirs)}),BangExt:Z(`Bang Extension`,[`<BANG>`,G(W(G(W(X({expansion:[`Identifier`],semantic:e=>Bf(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=>Bf(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Kf(t,n.first,n.last)}`:void 0}),OpenStart:Z(void 0,[G(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},Ap=/* @__PURE__ */ new Map,jp=e=>{let t=Ap.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=jp(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,jp(kp[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 Ap.set(e,n),n},Mp=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},Np=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=zf(e,e.scanPosition)),e.scanPosition=zf(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`},Pp=(e,t)=>{if(t.type===`tokens`)return Np(e,t.kinds);if(t.type===`call`)return Pp(e,kp[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||Mp(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=Pp(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||Mp(e,t.semantic)?Pp(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=Pp(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=Pp(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},Fp=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=Pp(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},Ip=(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||jp(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!jp(a).hasSemanticStart?jp(a).first.has(Bf(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):Fp(e,i,a)&&(o===void 0||o(e))}),Lp=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,Pp(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=zf(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Cf){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=zf(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Ke(e.token.image)}" `},Rp=(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??Lp(e)}\n\nResidual stack trace follows:\n${r}`,!1},zp=(e,t)=>{let n=zf(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,Rp(e))},Bp=(e,t)=>{let n=kp[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Bf(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!Vp(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 Rp(e,i);let a=r.node??(r.heirs.length===0?void 0:qf(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},Vp=(e,t)=>{if(t.type===`tokens`)return zp(e,t.kinds);if(t.type===`call`)return Bp(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||Rp(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||Rp(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||Vp(e,t));if(t.type===`choice`){let n=Ip(e,t.alternatives);return n===-1?Rp(e):Vp(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!Vp(e,t.body))return!1;if(t.type===`optional`)return Ip(e,[t.body])===-1||Vp(e,t.body);for(;Ip(e,[t.body])===0;)if(!Vp(e,t.body))return!1;return!0},Hp=e=>{let t=We(e),n={kind:Cf,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=Vp(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},Up={low:15,high:15},Wp={low:16,high:16},Q=(e,t,n)=>({low:e,high:t,isAssociative:n}),Gp=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)]]),Kp=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),qp=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Jp=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),Yp=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),Xp=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),Zp=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...Kp]),Qp=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),$p=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),em=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),tm=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),nm=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),rm=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),im=/* @__PURE__ */ new Set([``,`*`,`-`]),am=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),om=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),sm=/* @__PURE__ */ new Set([`NEW`,...om.keys()]),cm=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),lm=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),um=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),dm=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Gp.has(e.operator):Kp.has(e.operator)),fm=e=>Gp.has(e)||Kp.has(e)||e===`-.`,pm=(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}}},mm=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
|
|
456
|
-
`)}\n`},hm=(e,t,n=xe(e))=>{let r=t===`tlapm`,i=r?n:n.map(_e),o={index:0,offsideColumns:[]},s={},c=[],u=/* @__PURE__ */ new Set,d=[],f=[],p=e=>c[c.length-1].has(e),m=e=>({line:e.line,column:r&&e.kind===`String`?e.endColumn:e.column,range:void 0}),h=[],ee=[],g=[],_=(e,t=o.index-1)=>{let n=e===t?g[e]:void 0;if(n)return n;let r=i[t];h[e]??=m(i[e]),ee[t]??={line:r.line,column:r.endColumn};let a={module:f[0].name,start:h[e],end:ee[t]};return e===t&&(g[e]=a),a},v=(e,t)=>(e.location.range=_(t),e),te=(e=0)=>i[Math.min(o.index+e,i.length-1)],y=(e=0)=>{let t=te(e),n=o.offsideColumns[o.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ne=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),re={index:0},ie=e=>{let t=i.slice(re.index,o.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ae=e=>r&&(e.kind===`Keyword`||um.has(e.text)),oe=e=>{let t=i.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},se=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:rm.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):ae(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,le=(e,t=te(),n)=>{let r=i[i.length-1],a=t.line===r.line&&t.column===r.column;return new l(`${e} at line ${t.line}, column ${t.column}`,void 0,ue(e,t,a,n))},ue=(e,t,n,a)=>{if(r&&n){let e=i[i.length-1];return{reason:`Unexpected EOF`,...ie(oe(e)),isEnd:n}}return r&&a?{reason:`Unexpected ${se(a)}`,...oe(a),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},de=(e,t=te())=>le(e,t,t),fe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ae(e),x=(e,t=0)=>{let n=y(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},S=()=>{let e=y();if(e.kind===`End`)throw le(`Unexpected end of expression`);return o.index++,e},C=e=>x(e)?(o.index++,!0):!1,w=e=>{if(!x(e))throw de(`Expected ${JSON.stringify(e)} but found ${ne(y())}`);return S()},pe=()=>{let e=y();if(e.kind!==`Identifier`)throw de(`Expected an identifier but found ${ne(e)}`);if(ae(e))throw de(`Unexpected keyword ${e.text}`);return o.index++,e.text},me=()=>{let e=o.index;return{name:pe(),range:_(e)}},he=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),ge=()=>{let e=y();return e.kind!==`String`&&(Jp.has(e.text)||Gp.has(e.text)||Kp.has(e.text)||e.text===`'`)?(o.index++,e.text):pe()},ve={isUsed:!1},ye=()=>y().kind===`Identifier`||!fe(y())?pe():(ve.isUsed=!0,S().text),be=e=>{if(!r)return e();o.offsideColumns.push(-1);let t=e();return o.offsideColumns.pop(),t},T=(e,t=`,`)=>{let n=[e()];for(;C(t);)n.push(e());return n},Se=()=>{if(x(`<<`)){let e={value:1};for(;y(e.value).kind===`Identifier`||x(`,`,e.value);)e.value++;return x(`>>`,e.value)&&x(`\\in`,e.value+1)}let e={value:0};for(;y(e.value).kind===`Identifier`;){if(x(`\\in`,e.value+1))return!0;if(!x(`,`,e.value+1))return!1;e.value+=2}return!1},Ce=()=>{if(x(`::`))return!0;if(!x(`(`))return!1;let e={value:1};for(;y(e.value).kind===`Identifier`&&x(`,`,e.value+1);)e.value+=2;return y(e.value).kind===`Identifier`&&x(`)`,e.value+1)&&x(`::`,e.value+2)},we=()=>{if(!C(`<<`)){let e=me();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=he(T(me));return w(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},E=()=>T(()=>{let e=T(we);w(`\\in`);let t=D();return e.map(e=>({pattern:e,set:t}))}).flat(),Te=()=>{let e=y();if(e.kind===`Identifier`){let t=o.index,n=[S().text];for(;x(`!`)&&y(1).kind===`Identifier`;)S(),n.push(pe());return v({kind:`Identifier`,name:n.join(`!`),location:m(e)},t)}if(x(`<<`)||x(`(`))return Be();throw de(`Expected a subscript but found ${ne(e)}`)},Ee=e=>{let t=y(1),n=y(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&x(`==`,Kp.has(n.text)?3:4))},De=e=>{let t=y(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||x(`,`,1)||x(`)`,1)||t.kind===`Keyword`&&$p.has(t.text)||Ee(e)},Oe=()=>{let e=y(),t=e.kind===`Operator`&&(Gp.has(e.text)||qp.has(e.text))&&De(e);if(r&&e.kind!==`String`&&(qp.has(e.text)||Zp.has(e.text)&&e.text!==`'`&&!Kp.has(e.text)||Xp.has(e.text)&&y(-1).text===`(`&&y(-1).line===e.line&&y(-1).endColumn+1===e.column&&y(1).text===`)`&&y(1).line===e.line&&y(1).column===e.endColumn+1)&&De(e))throw le(`incomplete expression`,e);if(t)return o.index++,v({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:m(e)},o.index-1);if(e.kind!==`String`&&Zp.has(e.text)&&De(e)){o.index++;let t=m(e);if(Kp.has(e.text))return v({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return v({kind:`Lambda`,params:[n.name],body:pm(e.text,n,t),operator:e.text,location:m(e)},o.index-1)}if(x(`LAMBDA`)){let t=o.index;S();let n=he(T(me));w(`:`);let r=D();return v({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:m(e)},t)}return D()},ke={range:void 0},Ae=()=>be(()=>{let e=o.index;w(`(`);let t=T(Oe);return w(`)`),ke.range=_(e),t}),je=()=>{let e=S();o.offsideColumns.push(e.column);let t=[D()];for(;te().text===e.text&&te().column===e.column;)o.index++,t.push(D());return o.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:m(e)}},Me=e=>be(()=>{let t=m(e),n=y().kind===`Identifier`,i=x(`|->`,1)&&(n||fe(y()));if(i||n&&x(`:`,1)){let e=i?`Record`:`RecordSet`,r=e=>{let t=o.index,n=m(y()),r=e();return n.range=_(t),w(i?`|->`:`:`),{name:r,value:D(),location:n}},a=[r(()=>n?pe():S().text),...C(`,`)?T(()=>r(pe)):[]];return w(`]`),{kind:e,fields:a,location:t}}if(Se()){let e=E();w(`|->`);let n=D();return w(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let a=D();if(C(`->`)){let e=D();return w(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(C(`EXCEPT`)){let e=T(()=>{w(`!`);let e=[];for(;x(`.`)||x(`[`);)if(C(`.`)){if(!fe(y()))throw de(`Expected a field name but found ${ne(y())}`);e.push({kind:`Field`,name:S().text})}else w(`[`),e.push({kind:`Index`,args:T(()=>D())}),w(`]`);return w(`=`),{path:e,value:D()}});return w(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!r&&!x(`]_`)){let e=[a];for(;C(`,`);)e.push(D());return w(`]`),{kind:`Bracket`,args:e,location:t}}return w(`]_`),{kind:`BoxAction`,action:a,subscript:Te(),location:t}}),Ne=()=>{let e=o.index,t=v(He(),e),n=m(S());return v({kind:`Apply`,operator:`\\in`,args:[t,D()],location:n},e)},Pe=e=>be(()=>{let t=m(e);if(C(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(Se()&&(y(1).text===`\\in`||x(`<<`))){let e=o.index,n=we();w(`\\in`);let r=D();if(C(`:`)){let e=D();return w(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o.index=e}let n=y().kind===`Identifier`&&x(`\\in`,1)?Ne():D();if(C(`:`)){let e=E();return w(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;C(`,`);)r.push(D());return w(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Fe=e=>{let t=m(e),n=be(()=>x(`>>`)||x(`>>_`)?[]:T(()=>D()));if(C(`>>_`)){if(n.length!==1)throw le(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:Te(),location:t}}return w(`>>`),{kind:`Tuple`,elements:n,location:t}},Ie=e=>{let t=m(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&Se()){let e=E();return w(`:`),{kind:n,bounds:e,body:D(),location:t}}let i=he(T(me));return w(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:D(),isTemporal:r,location:t}},Le=e=>{let t=[];do{if(C(`OTHER`))return w(`->`),{kind:`Case`,arms:t,other:D(),location:m(e)};let n=D();w(`->`),t.push({condition:n,body:D()})}while(C(`[]`));return{kind:`Case`,arms:t,other:void 0,location:m(e)}},Re=()=>{let e=y(1);return x(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Qp.has(e.text)||e.kind===`Operator`&&(Gp.has(e.text)||Kp.has(e.text)||qp.has(e.text)))},ze=()=>{let e=S();if(e.kind===`Number`)return{kind:`Operand`,operand:ce(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return o.index--,{kind:`Bound`,args:Ae()}}return{kind:`Name`,name:e.text,args:x(`(`)?Ae():[]}},Be=e=>{let t=o.index,n=S(),i=m(n);if(r&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=T(pe);return w(`:`),{kind:`Lambda`,params:e,body:D(),location:i}}if(n.kind===`Number`){if(r&&/^\\[BOH]/.test(n.text))throw le(`incomplete expression`,n);return{kind:`Number`,value:ce(n.text),text:n.text,location:i}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:i};if(n.kind===`String`)return{kind:`String`,value:n.text,location:i};let a=n.kind===`Step`&&it(n);if(a&&tt()<0&&et.length<=1)throw le(`Step number used outside proof`,n);if(a&&n.text[1]===`+`)throw le(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||a){let c=a?at(n)??n.text:n.text;if(Ce()){let t=he(C(`(`)?T(me):[]);t.names.length>0&&w(`)`),w(`::`);let a=D();if(!r&&e!==void 0&&s.last!==void 0&&dm(a)&&e.high>=s.last.low)throw le(`Removing the label would change expression parsing`,n);return{kind:`Label`,name:c,params:t.names,paramRanges:t.ranges,body:a,location:i}}let l=x(`(`);if(c===`@`&&!l&&!Re())return{kind:`ExceptAt`,location:i};let u=l?Ae():[],d=[l?ke.range:void 0];if(!Re())return l?{kind:`Apply`,operator:c,args:u,argumentsRange:ke.range,location:i}:{kind:`Identifier`,name:c,location:i};let f=[{kind:`Name`,name:c,args:u}],p=[_(t,t)];for(;Re();)S(),p.push(_(o.index,o.index)),ke.range=void 0,f.push(ze()),d.push(ke.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),ee=f.flatMap(e=>`args`in e?e.args:[]),g=f.map(e=>`args`in e?e.args.length:0),v=d.at(-1)??_(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:i}:ee.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:i}:{kind:`Apply`,operator:h,args:ee,...g.slice(0,-1).some(e=>e>0)&&{argumentCounts:g},argumentsRange:v,selectorRanges:p,argumentRanges:d,location:i}}if(n.kind===`Operator`&&fm(n.text)&&x(`(`))return{kind:`Apply`,operator:n.text,spelling:n.spelling,args:Ae(),location:i};if(n.kind===`Operator`&&fm(n.text)&&!r)return{kind:`Identifier`,name:n.text,spelling:n.spelling,location:i};switch(n.text){case`(`:{let e=be(()=>D());return w(`)`),e}case`[`:return Me(n);case`{`:return Pe(n);case`<<`:return Fe(n);case`@`:return{kind:`ExceptAt`,location:i};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Ie(n);case`IF`:{let e=D();w(`THEN`);let t=D();return w(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:D(),location:i}}case`CASE`:return Le(n);case`LET`:{let e=[],t=[];for(c.push(/* @__PURE__ */ new Set);!C(`IN`);){if(r&&x(`RECURSIVE`))throw le(`Unexpected keyword RECURSIVE`,ie(te()));if(C(`RECURSIVE`)){Ze();continue}let n=Ge(!1);n.kind===`Instance`?t.push(n):e.push(n)}c.pop();let n=D();return t.length===0?{kind:`Let`,definitions:e,body:n,location:i}:{kind:`Let`,definitions:e,instances:t,body:n,location:i}}case`CHOOSE`:{let e=we(),t=C(`\\in`)?D():void 0;return w(`:`),{kind:`Choose`,pattern:e,set:t,body:D(),location:i}}case`WF_`:case`SF_`:{let e=Te(),t=be(()=>{w(`(`);let e=D();return w(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:i}}}throw de(`Unexpected ${ne(n)}`,n)},Ve=(e,t,n)=>{s.last=s.preceding={low:t,high:n};let i=D(n+1),a=y(),o=a.text===`'`||Kp.has(a.text)?Up.high:Gp.get(a.text)?.high;if(!r&&a.kind===`Operator`&&o!==void 0&&o>=t)throw le(`Precedence conflict between ${e.text} and ${a.text}`,a);return i},He=()=>{let e=s.preceding;s.preceding=void 0;let t=y(),n=m(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return je();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return S(),{kind:`Apply`,operator:`~`,args:[Ve(t,4,4)],location:n};case`-`:return S(),{kind:`Apply`,operator:`-.`,args:[Ve(t,12,12)],location:n};case`[]`:return S(),{kind:`Always`,expression:Ve(t,4,15),location:n};case`<>`:return S(),{kind:`Eventually`,expression:Ve(t,4,15),location:n};case`ENABLED`:return S(),{kind:`Enabled`,expression:Ve(t,4,15),location:n};case`UNCHANGED`:return S(),{kind:`Unchanged`,expression:Ve(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return S(),{kind:`Apply`,operator:t.text,args:[r?D(9):Ve(t,10,13)],location:n}}return Be(e)},D=(e=0)=>{let t=o.index,n=He(),r={left:n.location.range?n:v(n,t),previous:void 0};for(;;){let n=y();if(n.kind!==`Operator`)break;let i=m(n);if(n.text===`'`&&e<=15){S(),s.last=Up,r.left=v({kind:`Prime`,expression:r.left,location:i},t);continue}if(Kp.has(n.text)&&e<=15){S(),s.last=Up,r.left=v({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){S();let e=be(()=>T(()=>D()));be(()=>w(`]`)),s.last=Wp,r.left=v({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&fe(y(1))){S();let e=S().text;r.left=v({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let a=Gp.get(n.text);if(!a||a.low<e)break;let o=r.previous;if(o){let e=!(o.low>a.high||o.high<a.low),t=o.text===n.text&&a.isAssociative;if(e&&!t&&(o.text!==`\\X`||n.text!==`\\X`))throw le(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(S(),a.low>12&&x(`-`))throw le(`Precedence conflict between ${n.text} and -`,y());s.last=s.preceding=a;let c=D(a.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[_(t).end];r.left=l.kind===e&&o?.text===n.text?{...l,operands:[...l.operands,c],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,c],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&o?.text===`\\X`?{...l,factors:[...l.factors,c]}:{kind:`Product`,factors:[l,c],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,c],location:i};r.left=v(r.left,t),r.previous={...a,text:n.text}}return r.left},Ue=()=>{if(!C(`(`))return[];let e=Xe();return w(`)`),e},We=()=>{let e=m(y()),t=D(),n=i[o.index-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:f[0].name,start:e,end:r}}},Ge=e=>{let t=o.index;return v(qe(e),t)},Ke=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),qe=e=>{let t=y(),n=m(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...We(),isLocal:e,isRecursive:p(t),location:n});if(t.kind===`Identifier`&&y(1).kind===`Operator`&&Gp.has(y(1).text)&&y(2).kind===`Identifier`&&x(`==`,3)){let e=me(),t=S().text,n=me();return w(`==`),r(t,[Ke(e),Ke(n)])}let i=t.kind!==`String`&&Jp.has(t.text),a=t.kind===`Identifier`&&Kp.has(y(1).text)&&x(`==`,2);if(i||a){let e=i?t.text:y(1).text;i&&S();let n=me();return a&&S(),w(`==`),r(e,[Ke(n)])}let s=pe();if(C(`[`)){let t=be(()=>E());return w(`]`),w(`==`),{kind:`Function`,name:s,bounds:t,body:D(),isLocal:e,isRecursive:p(s),location:n}}let c=o.index,l=Ue();return w(`==`),x(`INSTANCE`)?{...Je(s,l,e,n),definitionRange:_(c)}:r(s,l)},Je=(e,t,n,r)=>{let i=o.index;return w(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ye(),substitutions:C(`WITH`)?T(()=>{let e=o.index,t=ge(),n=_(e);return w(`<-`),{name:t,nameRange:n,expression:Oe()}}):[],isLocal:n,location:r,instanceRange:_(i)}},Ye=()=>{let e=o.index;return v(O(),e)},O=()=>{let e=m(y());if(x(`_`)&&y(1).kind===`Operator`)return S(),{name:S().text,arity:C(`_`)?2:1,location:e};if(y().kind===`Operator`&&x(`_`,1)){let t=S().text;return S(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=pe();if(!C(`(`))return{name:t,arity:0,location:e};let n=T(()=>w(`_`));return w(`)`),{name:t,arity:n.length,location:e}},Xe=()=>T(Ye),Ze=()=>{let e=Xe();return e.forEach(e=>c[c.length-1].add(e.name)),e},Qe=e=>{let t={value:0,offset:e};do{let e=y(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&cm.has(e.text)&&t.value++,e.kind===`Operator`&&lm.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},$e=()=>{let e=y(),t=y(1);return e.kind===`Identifier`?x(`(`,1)||x(`[`,1)?x(`==`,Qe(1)):t.kind===`Operator`&&Kp.has(t.text)?x(`==`,2):t.kind===`Operator`&&Gp.has(t.text)?y(2).kind===`Identifier`&&x(`==`,3):x(`==`,1):e.kind!==`String`&&Jp.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(`.`)&&!im.has(rt(e)),at=e=>{let t=rt(e);if(im.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 tm.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return et.length===0;if(e.text[1]===`+`||et.length===0)return!0;let t=tt();return t>=0&&nt(e)>t},k=e=>{let t=nt(e),n=et.length-1,r=et[n-1]??-1,i=et[n]<0;return i&&(et[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:et[n]===t},st=e=>!u.has(e)&&f.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),A=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!um.has(e.name)&&!st(e.name):!1,j=()=>{let e=y();return e.kind===`Step`?it(e):e.kind===`Keyword`?am.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!$e()},ct=()=>{let e=o.index,t=y();return t.kind===`Operator`&&!Yp.has(t.text)&&fm(t.text)?(o.index++,v({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:m(t)},e)):C(`MODULE`)?v({kind:`ModuleFact`,name:pe(),location:m(t)},e):D()},lt=e=>d[d.length-1]?.add(e),ut=e=>{d.push(/* @__PURE__ */ new Set);let t=e();return d.pop(),t},dt=e=>d.some(t=>t.has(e))||f.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),ft=()=>{let e=o.index,t=y(),n=T(()=>{let e=y();if((e.kind!==`Identifier`||ae(e))&&e.kind!==`Operator`)throw de(`Expected a definition name but found ${ne(e)}`,e);return o.index++,e.text},`!`),r=m(t);return v(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},pt=()=>{if(r)return T(ft);let e=T(ct),n=t===`tlc`?e.find(e=>e.kind===`Identifier`&&dt(e.name)):void 0;if(n)throw le(`DEF clause entry should describe a defined operator`,n.location);return e},mt=()=>({facts:j()?T(ct):[],defs:C(`DEF`)||C(`DEFS`)?pt():[]}),ht=()=>{let e=o.index,n=S(),r=n.text===`USE`&&C(`ONLY`),i=_(e),s={kind:n.text===`USE`?`Use`:`Hide`,isOnly:r,...mt(),keyword:i,location:m(n)},c=s.kind===`Hide`&&t===`tlc`?s.facts.filter(e=>!A(e)):[];if(c.length>0)throw a(c.map(t=>({location:b(t.location.range??_(e)),message:`The only expression allowed as a fact in a HIDE is
|
|
457
|
-
the name of a theorem, assumption, or step.`})));return v(s,e)},gt=()=>{let e=o.index,t=m(y()),n=C(`NEW`),r=y().kind===`Keyword`?om.get(y().text):void 0;if(!n&&r===void 0)throw de(`Expected a declaration but found ${ne(y())}`);if(r!==void 0&&S(),r===`Variable`){let n=me();return lt(n.name),v({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let i=Ye();lt(i.name);let a=(r??`Constant`)===`Constant`&&x(`\\in`);if(a&&i.arity>0)throw le(`declared symbol with arguments before \\in`);return a&&S(),v({kind:`NewSymbol`,name:i.name,arity:i.arity,level:r??`Constant`,set:a?D():void 0,nameRange:i.location.range,location:t},e)},_t=()=>{let e=o.index,t=m(w(`ASSUME`)),n=T(()=>x(`ASSUME`)?ut(_t):y().kind===`Keyword`&&sm.has(y().text)?gt():D());return w(`PROVE`),v({kind:`AssumeProve`,assumptions:n,conclusion:D(),location:t},e)},vt=e=>{let t={value:0};for(;y(t.value).kind===`Identifier`&&x(`,`,t.value+1);)t.value+=2;return y(t.value).kind===`Identifier`&&x(e,t.value+1)},yt=(e,t)=>{e.forEach(lt),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(lt))},bt=()=>{let e=y();if(x(`USE`)||x(`HIDE`))return ht();if(x(`INSTANCE`)){let t=o.index;return v(Je(void 0,[],!1,m(e)),t)}if(x(`DEFINE`)||$e()){let t=o.index;C(`DEFINE`);let n=[Ge(!1)];for(;$e();)n.push(Ge(!1));let r={kind:`Define`,definitions:n,location:m(e)};return v(r,t)}if(C(`HAVE`))return{kind:`Have`,expression:D()};if(C(`TAKE`)){let e=Se(),t=he(e?[]:T(me)),n=e?E():[];return yt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(C(`WITNESS`))return{kind:`Witness`,expressions:T(()=>D())};if(C(`PICK`)){let e=vt(`:`),t=he(e?T(me):[]),n=e?[]:E();return yt(t.names,n),w(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:D()}}return C(`CASE`)?{kind:`Case`,expression:D()}:{kind:`Assert`,isSuffices:C(`SUFFICES`),statement:x(`ASSUME`)?_t():D()}},xt=e=>{let t=y();if(t.kind!==`Step`)throw de(`Expected a step number but found ${ne(t)}`,t);if(!k(t))throw le(`${e?`QED step`:`step`}'s number has bad level`,t);if(nt(t)<0&&at(t)!==void 0)throw le(`<*> and <+> cannot be used for a named step`,t);return o.index++,{name:at(t),token:t.text,location:m(t)}},St=()=>{let e=o.index,t=xt(x(`QED`,1)),n=o.index,r=/* @__PURE__ */ new Set;d.push(r);let i=C(`QED`)?{kind:`Qed`}:bt(),a=_(e),s=_(n),c=ot(y());if(c&&!nm.has(i.kind))throw le(`Proof of a step that does not take a proof`);let l=c?wt():void 0;return d.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(lt),v({...t,body:i,head:a,statement:s,proof:l},e)},Ct=()=>{let e=m(y());if(x(`BY`)||x(`PROOF`)&&x(`BY`,1)){C(`PROOF`),S();let t=_(o.index-1);return{kind:`By`,isOnly:C(`ONLY`),...mt(),keyword:t,location:e}}let t=y(+!!x(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){C(`PROOF`),S();let n=_(o.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}C(`PROOF`);let n=[St()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(St());return{kind:`Steps`,level:tt(),steps:n,location:e}},wt=()=>{let e=o.index;et.push(-1);let t=ut(Ct);return et.pop(),v(t,e)},Tt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},Et=e=>{let t=o.index,n=S(),r=y().kind===`Identifier`&&x(`==`,1)?pe():void 0;r!==void 0&&(u.add(r),S());let i=ut(()=>({statement:x(`ASSUME`)?_t():D(),proof:ot(y())?wt():void 0})),a=i.statement,s=v({name:r,statement:a,proof:i.proof,location:m(n)},t);e.theorems.push(s),e.units.push({kind:`Theorem`,theorem:s}),r!==void 0&&a.kind!==`AssumeProve`&&Tt(e,v({kind:`Operator`,name:r,params:[],body:a,isLocal:!1,isRecursive:!1,location:m(n)},t))},Dt=()=>{let e=o.index,t=S(),n=y().kind===`Identifier`&&x(`==`,1)?pe():void 0;return n!==void 0&&(u.add(n),S()),v({name:n,expression:D(),isAxiom:t.text===`AXIOM`,location:m(t)},e)},Ot=()=>{let e=m(w(`----`));w(`MODULE`);let t=ye();w(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(f.push(n),c.push(/* @__PURE__ */ new Set),C(`EXTENDS`)&&T(()=>{let e=o.index;n.extends.push(ye()),n.extendsRanges.push(_(e))});;){let t=o.index;re.index=t;let r=y();if(r.kind===`ModuleEnd`)return e.range={module:f[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},f.pop(),c.pop(),n;if(r.kind===`Separator`){if(x(`MODULE`,1)){let e=Ot();n.modules.push(e),n.units.push({kind:`Module`,module:e}),w(`====`);continue}S()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=m(S()),r=Xe();n.constants.push(...r),e.range=_(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=m(S()),r=T(()=>{let e=o.index,t=m(y());return v({name:pe(),arity:0,location:t},e)});n.variables.push(...r),e.range=_(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Dt();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&Tt(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(x(`USE`)&&x(`ONLY`,1))throw de(`Expected a module unit but found ${ne(r)}`);let e=ht();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:S(),n.units.push({kind:`Recursive`,declarations:Ze()});continue;case`INSTANCE`:kt(n,v(Je(void 0,[],!1,m(r)),t));continue;case`LOCAL`:if(S(),x(`INSTANCE`)){kt(n,v(Je(void 0,[],!0,m(r)),t));continue}kt(n,v(qe(!0),t));continue}r.kind===`Keyword`&&em.has(r.text)?Et(n):kt(n,Ge(!1))}}},kt=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},At=Ot(),jt=ve.isUsed?Hp(e):void 0;if(jt!==void 0)throw new l(jt);return At},gm=e=>hm(e,`tlc`),_m=(e,t)=>hm(e,`tlc`,t),vm=e=>hm(e,`tlapm`),ym=e=>hm(e,`sany`),bm=10454148508367108822n,xm=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:bm);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Sm=Int32Array.from(xm,e=>Number(BigInt.asIntN(32,e>>32n))),Cm=Int32Array.from(xm,e=>Number(BigInt.asIntN(32,e))),wm=Number(BigInt.asIntN(32,bm>>32n)),Tm=Number(BigInt.asIntN(32,bm));let Em=wm,Dm=Tm;const Om=e=>{let t=(e^Dm)&255;Dm=(Dm>>>8|Em<<24)^Cm[t],Em=Em>>>8^Sm[t]},km=(()=>{let e=[Sm],t=[Cm];for(let n=1;n<4;n++){let r=e[n-1],i=t[n-1],a=/* @__PURE__ */ new Int32Array(256),o=/* @__PURE__ */ new Int32Array(256);for(let e=0;e<256;e++){let t=i[e]&255;o[e]=(i[e]>>>8|r[e]<<24)^Cm[t],a[e]=r[e]>>>8^Sm[t]}e.push(a),t.push(o)}return{highs:e,lows:t}})(),Am=km.highs[0],jm=km.highs[1],Mm=km.highs[2],Nm=km.highs[3],Pm=km.lows[0],Fm=km.lows[1],Im=km.lows[2],Lm=km.lows[3],Rm=e=>{let t=Dm^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;Dm=Em^Lm[n]^Im[r]^Fm[i]^Pm[a],Em=Nm[n]^Mm[r]^jm[i]^Am[a]},zm=e=>{if(typeof e==`boolean`)return Om(0),Om(e?116:102),2;if(typeof e==`number`)return Om(1),Rm(e),5;if(typeof e==`string`){Om(3),Rm(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)Rm(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++)Om(e.charCodeAt(n));return 5+e.length}return Om(21),Rm(kt(e.name)+1),5},Bm=e=>{if(typeof e!=`object`||j(e))zm(e);else if(A(e)){let t=F(e);Om(9),Rm(t.domain.length);for(let e=0;e<t.domain.length;e++)Bm(t.domain[e]),Bm(t.range[e])}else{let t=N(e).elements;Om(5),Rm(t.length);for(let e of t)Bm(e)}},Vm=e=>{let t={high:Em,low:Dm};Em=wm,Dm=Tm;for(let t of e)Bm(t);let n=BigInt(Em>>>0)<<32n|BigInt(Dm>>>0);return Em=t.high,Dm=t.low,n},Hm=(e,t)=>{let n=new BigInt64Array(e.length),r=new Int32Array(n.buffer),i=Em,a=Dm;return e.forEach((e,n)=>{Em=wm,Dm=Tm;for(let n of t)Bm(e[n]);r[2*n]=Dm,r[2*n+1]=Em}),Em=i,Dm=a,n},Um=25214903917n,Wm=(1n<<48n)-1n,Gm=2147483647,Km=e=>{let t={value:(BigInt.asUintN(64,e)^Um)&Wm},n=e=>(t.value=t.value*Um+11n&Wm,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Um)&Wm},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<=Gm)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},qm=[],Jm=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Ym=()=>{for(let e=1277011;qm.length<1341;e++)Jm(e)&&qm.push(e);return qm},Xm=e=>{let t=Ym(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},Zm=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},Qm=e=>{for(let t=Math.max(e,9);;t++){let e=Zm(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)}}},$m=(e,t,n)=>{if(t<=0)return[];let r=Qm(t),i={index:BigInt(n.nextInt(t))},a=BigInt(Xm(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},eh=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Gm),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},th=(1n<<63n)-1n-24n,nh=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(th*BigInt(n)+i)%t;return r<0n?r+t:r})},rh=(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,ih=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=qn(e.domain),n=N(e.range).elements;return{lists:t.map(()=>n),create:e=>Bt(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>N(e).elements),create:t=>Xn(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>N(e).elements),create:Yn}}},ah=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,oh=(e,t,n,r)=>{if(P(t))return[];let i=r===`1.7.4`?eh:$m;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=ah(t,r)?void 0:ih(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Gm)?nh(e,t,n):i(e,Number(t),n)).map(e=>a.create(rh(a.lists,e)))}let o=N(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},sh=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new h(`RandomElement of the empty set`);return n},ch=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...qn(e.domain)];return Bt(n,n.map(()=>ch(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Xn(e.names.map((n,r)=>[n,ch(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return Yn(e.factors.map(e=>ch(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new h(`RandomElement of the empty set`);return e.low+r}return sh(N(e).elements,t)},lh=(e,t=0n)=>{let n=Km(t),r={random:Km(t),seededState:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Xn([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Vm,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.seededState&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.seededState=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},uh=e=>zn([...e.possibleCounts].map(([e,t])=>[e,t])),dh=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,uh(e)]]),fh=`----------------------------- MODULE Bags --------------------------------
|
|
455
|
+
`]]),Af=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])]]),jf=D(`EOF`),Mf=D(`IDENTIFIER`),Nf=D(`DEFBREAK`),Pf=(e,t)=>Array.from({length:D(t)-D(e)+1},(t,n)=>D(e)+n),Ff=new Set(Pf(`op_57`,`op_119`)),If=new Set(Pf(`op_1`,`op_119`)),Lf=new Set(Pf(`op_57`,`op_70`)),Rf=/* @__PURE__ */ new Set([...Pf(`ACTION`,`EXCEPT`),D(`EXTENDS`),...Pf(`IF`,`SF`),D(`STATE`),...Pf(`THEN`,`WITH`),D(`US`),...Pf(`op_112`,`op_116`)]),U=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),zf=new Map([...U(`postfix`,160,160,!0,`[`),...U(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...U(`prefix`,120,120,!1,`-.`),...U(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...U(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...U(`prefix`,40,40,!0,`\\lnot`),...U(`nfix`,100,130,!0,`\\times`),...U(`infix`,140,140,!1,`^`,`^^`),...U(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...U(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...U(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...U(`infix`,100,110,!0,`|`,`||`,`%%`),...U(`infix`,100,110,!1,`%`),...U(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...U(`infix`,90,140,!1,`\\wr`),...U(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...U(`infix`,90,130,!1,`!!`),...U(`infix`,90,90,!1,`...`,`..`),...U(`infix`,80,80,!0,`\\intersect`,`\\union`),...U(`infix`,80,80,!1,`\\`),...U(`infix`,70,70,!1,`<:`,`:>`),...U(`infix`,60,60,!0,`@@`),...U(`infix`,50,140,!0,`\\cdot`),...U(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...U(`infix`,30,30,!0,`\\land`,`\\lor`),...U(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...U(`infix`,10,10,!1,`=>`)]),Bf=new Map([...zf,...wf.flatMap(e=>e.slice(1).map(t=>[t,zf.get(e[0])]))]),Vf=Bf.get(`[`),Hf={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},Uf=e=>({type:`tokens`,kinds:new Set(e)}),Wf=e=>typeof e==`string`?e.startsWith(`<`)?Uf([D(e.slice(1,-1))]):{type:`call`,name:e}:e,W=(...e)=>({type:`sequence`,units:e.map(Wf)}),G=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:W(e))}),Gf=e=>(...t)=>({type:e,body:W(...t)}),K=Gf(`zeroOrMore`),Kf=Gf(`oneOrMore`),q=Gf(`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}),qf=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Jf=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=qf(e,n);return n},Yf=(...e)=>{let t=e.map(D);return e=>t.includes(Jf(e,1).kind)},Xf=(e,t=Jf(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Zf=e=>{let t=Jf(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Qf=e=>Yf(`CASESEP`)(e)&&Xf(e),$f=e=>{let t=Jf(e,1);Rf.has(t.kind)&&(t.kind=Mf)},ep=(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}`,tp=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),np=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},rp=e=>e.operatorStacks[e.operatorStacks.length-1],ip=(e,t)=>e.low>t.high,ap=(e,t)=>e.high<t.low,op=e=>e.fix===`prefix`?e:Bf.get(`${e.name}.`),sp=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===Vf?tp(`FcnAppl`,[n,...r.node.heirs]):tp(`PostfixExpr`,[n,r.node]),operator:void 0})},cp=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:tp(`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:tp(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},lp=e=>{let t=rp(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 sp(t,n),lp(e);if(i.operator!==void 0){let t=op(r.operator);return t!==void 0&&ip(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${ep(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 ${ep(e,a.node.first,a.node.last)} and expression at location ${ep(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return ap(a.operator,r.operator)?void 0:ip(a.operator,r.operator)?(cp(t,a.operator),lp(e)):`Precedence conflict between ops ${a.operator.name} in block ${ep(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=op(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(ap(s,r.operator))return;if(!ip(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${ep(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return cp(t,s),lp(e);let c=ep(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===Hf?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},up=e=>J(t=>{let n=rp(t),r=np(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:lp(t)}),dp=up(()=>!1),fp=up(()=>!0),pp=J(e=>{e.lastOperator=Bf.get(e.token.image)}),mp=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},hp=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?mp(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},gp=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Xf(e,n.first.beginColumn))return n;let t=gp(e,n);if(t!==void 0)return t}},_p=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&&Ff.has(e.kind),i=e.token,a=qf(e,i);i.next=void 0;let o=qf(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===Mf&&(e=e.next)}else if(e.kind===Mf){let t=e.next;!r(t)||Lf.has(t.kind)||If.has(t.kind)&&t.next?.kind!==Mf||(e=t.next?.kind===D(`SUBSTITUTE`)?i:If.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Nf&&(e.next={kind:Nf,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=qf(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},vp=e=>{let t=Jf(e,1);if(t.kind===D(`LAB`)){let n=1;for(;n!==0;)if(t=qf(e,t),t.kind===D(`LAB`)&&n++,t.kind===D(`RAB`)&&n--,t.kind===jf)return!1;return qf(e,t).kind===D(`IN`)}if(t.kind!==Mf)return!1;for(t=qf(e,t);t.kind===D(`COMMA`);){if(t=qf(e,t),t.kind!==Mf)return!1;t=qf(e,t)}return t.kind===D(`IN`)},yp=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),bp=e=>e.proofLevels.at(-1)??-1,xp=e=>{let t=Jf(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:Yf(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||bp(e)>=0&&yp(t)>bp(e):Yf(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Sp=(e,t)=>{let n=yp(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},Cp=e=>J(t=>Sp(t,t.token)?void 0:`${ep(t,t.token)}: ${e}`),wp=Uf([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(D)),Tp=Uf([...wp.kinds,D(`op_76`)]),Ep=Uf(If),Dp=Uf(Lf),Op=Uf([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(D)),kp=()=>K(X({expansion:[G(wp,`<op_77>`)],semantic:Xf}),G(`PrefixOp`,`InfixOp`),fp),Ap=()=>G(W(X({expansion:[`OpenStart`],semantic:Xf}),`OpenExpression`,dp),W(X({semantic:Xf}),`ExtendableExpr`)),jp=()=>G(W(`<MODULE>`,Y(`identifier`),`Identifier`),`Expression`),Mp=()=>G(W(X({semantic:e=>Yf(`ASSUME`,`BOXASSUME`)(e)||Jf(e,2).kind===D(`COLONCOLON`)&&[D(`ASSUME`),D(`BOXASSUME`)].includes(Jf(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Np=()=>[`JuncItem`,K(X({semantic:Zf}),`JuncItem`)],Pp=e=>J(t=>{t.expecting=e,$f(t)}),Fp=e=>J(t=>{t.isTerminalProof=e}),Ip=(e,...t)=>W(...t.slice(0,-1),Y(`==`),`<DEF>`,J(t=>{_p(t),t.expecting=e}),t[t.length-1]),Z=(e,t,n)=>({message:e,body:W(...t),exit:n}),Lp={CompilationUnit:Z(void 0,[J(_p),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>`),Pp(`Identifier`),`Identifier`,J(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Z(void 0,[`<END_MODULE>`]),Extends:Z(`Extends`,[q(`<EXTENDS>`,Pp(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,Pp(`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(_p)),W(X({semantic:e=>Yf(`USE`)(e)&&Jf(e,2).kind!==D(`ONLY`)||Yf(`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(Ip(`Expression`,X({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,Y(`[`),`<LSB>`,Y(`Identifier`),`QuantBound`,Y(`COMMA or ]`),K(`<COMMA>`,Y(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),Ip(`Expression`,X({expansion:[`<IDENTIFIER>`,Dp]}),`PostfixLHS`,`Expression`),Ip(`Expression`,X({expansion:[`<IDENTIFIER>`,Ep]}),`InfixLHS`,`Expression`),Ip(`Expression or Instance`,X({expansion:[`<IDENTIFIER>`,G(`<LBR>`,`<DEF>`)]}),`IdentLHS`,G(`Expression`,`Instantiation`)),Ip(`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`,[Tp,Y(`Identifier`),`Identifier`]),InfixLHS:Z(`Infix LHS`,[`Identifier`,Ep,`Identifier`]),PostfixLHS:Z(`Postfix LHS`,[`Identifier`,Dp]),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>`,Pp(`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,[wp,pp]),NonExpPrefixOp:Z(void 0,[Tp,pp]),InfixOp:Z(`Infix Op`,[Ep,pp]),PostfixOp:Z(void 0,[Dp,pp]),Identifier:Z(void 0,[`<IDENTIFIER>`]),Assumption:Z(`Assumption`,[Y(`ASSUM...`),G(`<ASSUMPTION>`,`<ASSUME>`),q(X({amount:2}),q(`<DEFBREAK>`),`Identifier`,Y(`==`),`<DEF>`),J(e=>{_p(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Z(`Assume-Prove`,[G(W(`Identifier`,`<COLONCOLON>`,`AssumeProve`),W(G(`<ASSUME>`,`<BOXASSUME>`),Y(`Expression, Declaration, or AssumeProve`),Mp(),Y("PROVE or `,'"),K(`<COMMA>`,Y(`Expression, Declaration, or AssumeProve`),Mp(),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=np(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${ep(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(_p),G(W(X({amount:3}),X({semantic:Yf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),q(X({semantic:xp}),`Proof`)]),Proof:Z(`Proof`,[J(e=>{e.proofLevels.push(-1)}),G(W(X({semantic:e=>Yf(`BY`)(e)||Jf(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=>Jf(e,2).kind!==D(`QED`)}),`Step`,Y(`a proof step`)),`QEDStep`)),J(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Z(`UseOrHideOrBy`,[G(W(q(`<PROOF>`),`<BY>`,Fp(!0),q(`<ONLY>`)),W(`<USE>`,Fp(!1),q(`<ONLY>`)),W(`<HIDE>`,Fp(!1))),Y("an expression, `MODULE' or `DEF'"),q(jp(),K(`<COMMA>`,Y(`MODULE or expression`),jp(),J(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),q(`<DF>`,Y(`MODULE or expression`),jp(),K(`<COMMA>`,Y(`MODULE or expression`),jp(),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`),Op,Cp(`QED step's number has bad level.`),Y(`QED`),`<QED>`,q(X({semantic:xp}),`Proof`)]),Step:Z(`Step`,[Y(`Step number`),Op,Cp(`step's number has bad level.`),Y(`proof step`),G(W(X({semantic:Yf(`USE`,`HIDE`)}),`UseOrHideOrBy`),W(X({semantic:Yf(`INSTANCE`)}),`Instantiation`),W(X({semantic:Yf(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),q(X({semantic:xp}),J(e=>{let t=np(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${ep(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Z(`DefStep`,[q(`<DEFINE>`),Kf(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:Yf(`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(Tp,Ep,Dp),Uf([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(D))],semantic:Xf}),G(`NonExpPrefixOp`,W(`InfixOp`,J(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${ep(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),W(X({expansion:[`<LAMBDA>`],semantic:Xf}),`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:vp}),G(`IdentifierTuple`,`Identifier`),Y(`\\in`),`<IN>`,`Expression`,Y(`':', ',' or '}'`),q(G(W(`<COLON>`,`Expression`),Kf(`<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=np(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`)),Kf(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Z(`Some [] Form`,[`<LSB>`,G(W(X({semantic:vp}),`QuantBound`,K(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({semantic:e=>Jf(e,2).kind===D(`MAPTO`)&&Rf.has(Jf(e,1).kind)}),J(e=>{Jf(e,1).kind=Mf}),`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=tp(`FcnAppl`,t.heirs),e.lastOperator=Vf})),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>`,Kf(`ExceptComponent`,Y(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Z(`Except Component`,[G(W(`<DOT>`,J($f),`Identifier`),W(`<LSB>`,`Expression`,K(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Z(`Some << -- >> or >>_ Form`,[`<LAB>`,q(`Expression`,K(`<COMMA>`,`Expression`)),G(`<RAB>`,W(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Z(void 0,[`Identifier`,q(X({amount:2}),`OpArgs`),G(W(`<BANG>`,`NoOpExtension`),J(e=>{e.isFairnessHooked=e.token.kind===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=>Qf(e)&&Jf(e,2).kind!==D(`OTHER`)}),`<CASESEP>`,`CaseArm`),q(X({semantic:Qf}),`<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`,[Kf(G(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Z(`AND-OR Junction`,[J(e=>{let t=Jf(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),G(W(X({expansion:[`<OR>`]}),...Np()),W(X({expansion:[`<AND>`]}),...Np())),J(e=>{e.junctions.pop()})]),JuncItem:Z(`Junction Item`,[G(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=gp(t,e.heirs[1]);return n&&`Item at ${ep(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${ep(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([])}),kp(),Ap()],(e,t)=>{let n=rp(t);n.push({node:e.heirs[0],operator:Hf});let r=lp(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`),dp,K(G(W(X({expansion:[`PostfixOp`],semantic:Xf}),`PostfixOp`,fp),W(X({expansion:[`<DOT>`],semantic:Xf}),`<DOT>`,J($f),X({semantic:Xf}),`Identifier`,J(e=>{let t=rp(e);t[t.length-1].operator!==void 0&&sp(t,t.length),t[t.length-1]={node:tp(`RecordComponent`,[t[t.length-1].node,np(e,2),np(e,1)]),operator:void 0}})),W(X({expansion:[`<LSB>`],semantic:Xf}),Y(`function argument`),`SBracketCases`,up(e=>e.kind===`FcnAppl`)))),q(G(W(X({expansion:[`InfixOp`],semantic:Xf}),`InfixOp`,fp,kp(),Ap()),W(X({expansion:[`<COLONCOLON>`],semantic:Xf}),`<COLONCOLON>`,J(e=>{let t=rp(e);if(!hp(t[t.length-1].node))return`\`::' at ${ep(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,J(e=>{let t=rp(e),n=np(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!ap(r,e.lastOperator)){let t=np(e,3);return`Removing label at ${ep(e,t.first,t.last)} would change expression parsing.`}t.push({node:tp(`Label`,[np(e,3),np(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Z(`Primitive expression`,[G(W(X({expansion:[`String`],semantic:Xf}),`String`),W(X({expansion:[`<NUMBER_LITERAL>`],semantic:Xf}),`Number`),W(G(`Identifier`,W(G(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),J(e=>bp(e)<0&&e.proofLevels.length<=1?`${ep(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${ep(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:mp(e.heirs)===void 0?e.heirs.length===1?tp(`GeneralId`,e.heirs):void 0:tp(`OpApplication`,e.heirs)}),BangExt:Z(`Bang Extension`,[`<BANG>`,G(W(G(W(X({expansion:[`Identifier`],semantic:e=>Jf(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=>Jf(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${ep(t,n.first,n.last)}`:void 0}),OpenStart:Z(void 0,[G(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},Rp=/* @__PURE__ */ new Map,zp=e=>{let t=Rp.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=zp(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,zp(Lp[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 Rp.set(e,n),n},Bp=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},Vp=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=qf(e,e.scanPosition)),e.scanPosition=qf(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`},Hp=(e,t)=>{if(t.type===`tokens`)return Vp(e,t.kinds);if(t.type===`call`)return Hp(e,Lp[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||Bp(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=Hp(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||Bp(e,t.semantic)?Hp(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=Hp(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=Hp(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},Up=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=Hp(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},Wp=(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||zp(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!zp(a).hasSemanticStart?zp(a).first.has(Jf(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):Up(e,i,a)&&(o===void 0||o(e))}),Gp=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,Hp(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=qf(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===jf){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=qf(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Ge(e.token.image)}" `},Kp=(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??Gp(e)}\n\nResidual stack trace follows:\n${r}`,!1},qp=(e,t)=>{let n=qf(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,Kp(e))},Jp=(e,t)=>{let n=Lp[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Jf(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!Yp(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 Kp(e,i);let a=r.node??(r.heirs.length===0?void 0:tp(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},Yp=(e,t)=>{if(t.type===`tokens`)return qp(e,t.kinds);if(t.type===`call`)return Jp(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||Kp(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||Kp(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||Yp(e,t));if(t.type===`choice`){let n=Wp(e,t.alternatives);return n===-1?Kp(e):Yp(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!Yp(e,t.body))return!1;if(t.type===`optional`)return Wp(e,[t.body])===-1||Yp(e,t.body);for(;Wp(e,[t.body])===0;)if(!Yp(e,t.body))return!1;return!0},Xp=e=>{let t=Ue(e),n={kind:jf,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=Yp(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},Zp={low:15,high:15},Qp={low:16,high:16},Q=(e,t,n)=>({low:e,high:t,isAssociative:n}),$p=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)]]),em=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),tm=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),nm=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),rm=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),im=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),am=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...em]),om=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),sm=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),cm=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),lm=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),um=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),dm=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),fm=/* @__PURE__ */ new Set([``,`*`,`-`]),pm=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),mm=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),hm=/* @__PURE__ */ new Set([`NEW`,...mm.keys()]),gm=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),_m=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),vm=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),ym=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?$p.has(e.operator):em.has(e.operator)),bm=e=>$p.has(e)||em.has(e)||e===`-.`,xm=(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}}},Sm=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
|
|
456
|
+
`)}\n`},Cm=(e,n,r=be(e))=>{let i=n===`tlapm`,a=i?r:r.map(ge),o={index:0,offsideColumns:[]},s={},u=[],d=/* @__PURE__ */ new Set,f=[],p=[],m=e=>u[u.length-1].has(e),h=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),g=[],_=[],v=[],y=(e,t=o.index-1)=>{let n=e===t?v[e]:void 0;if(n)return n;let r=a[t];g[e]??=h(a[e]),_[t]??={line:r.line,column:r.endColumn};let i={module:p[0].name,start:g[e],end:_[t]};return e===t&&(v[e]=i),i},b=(e,t)=>(e.location.range=y(t),e),ee=(e=0)=>a[Math.min(o.index+e,a.length-1)],x=(e=0)=>{let t=ee(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},te=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ne={index:0},re=e=>{let t=a.slice(ne.index,o.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ie=e=>i&&(e.kind===`Keyword`||vm.has(e.text)),ae=e=>{let t=a.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},oe=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:dm.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):ie(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,ce=(e,t=ee(),n)=>{let r=a[a.length-1],i=t.line===r.line&&t.column===r.column;return new l(`${e} at line ${t.line}, column ${t.column}`,void 0,le(e,t,i,n))},le=(e,t,n,r)=>{if(i&&n){let e=a[a.length-1];return{reason:`Unexpected EOF`,...re(ae(e)),isEnd:n}}return i&&r?{reason:`Unexpected ${oe(r)}`,...ae(r),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},ue=(e,t=ee())=>ce(e,t,t),de=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ie(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 ce(`Unexpected end of expression`);return o.index++,e},w=e=>S(e)?(o.index++,!0):!1,T=e=>{if(!S(e))throw ue(`Expected ${JSON.stringify(e)} but found ${te(x())}`);return C()},fe=()=>{let e=x();if(e.kind!==`Identifier`)throw ue(`Expected an identifier but found ${te(e)}`);if(ie(e))throw ue(`Unexpected keyword ${e.text}`);return o.index++,e.text},pe=()=>{let e=o.index;return{name:fe(),range:y(e)}},me=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),he=()=>{let e=x();return e.kind!==`String`&&(nm.has(e.text)||$p.has(e.text)||em.has(e.text)||e.text===`'`)?(o.index++,e.text):fe()},_e={isUsed:!1},ve=()=>x().kind===`Identifier`||!de(x())?fe():(_e.isUsed=!0,C().text),ye=e=>{if(!i)return e();o.offsideColumns.push(-1);let t=e();return o.offsideColumns.pop(),t},E=(e,t=`,`)=>{let n=[e()];for(;w(t);)n.push(e());return n},xe=()=>{if(S(`<<`)){let e={value:1};for(;x(e.value).kind===`Identifier`||S(`,`,e.value);)e.value++;return S(`>>`,e.value)&&S(`\\in`,e.value+1)}let e={value:0};for(;x(e.value).kind===`Identifier`;){if(S(`\\in`,e.value+1))return!0;if(!S(`,`,e.value+1))return!1;e.value+=2}return!1},Se=()=>{if(S(`::`))return!0;if(!S(`(`))return!1;let e={value:1};for(;x(e.value).kind===`Identifier`&&S(`,`,e.value+1);)e.value+=2;return x(e.value).kind===`Identifier`&&S(`)`,e.value+1)&&S(`::`,e.value+2)},Ce=()=>{if(!w(`<<`)){let e=pe();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=me(E(pe));return T(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},D=()=>E(()=>{let e=E(Ce);T(`\\in`);let t=O();return e.map(e=>({pattern:e,set:t}))}).flat(),we=()=>{let e=x();if(e.kind===`Identifier`){let t=o.index,n=[C().text];for(;S(`!`)&&x(1).kind===`Identifier`;)C(),n.push(fe());return b({kind:`Identifier`,name:n.join(`!`),location:h(e)},t)}if(S(`<<`)||S(`(`))return ze();throw ue(`Expected a subscript but found ${te(e)}`)},Te=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(`==`,em.has(n.text)?3:4))},Ee=e=>{let t=x(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||S(`,`,1)||S(`)`,1)||t.kind===`Keyword`&&sm.has(t.text)||Te(e)},De=()=>{let e=x(),t=e.kind===`Operator`&&($p.has(e.text)||tm.has(e.text))&&Ee(e);if(i&&e.kind!==`String`&&(tm.has(e.text)||am.has(e.text)&&e.text!==`'`&&!em.has(e.text)||im.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)&&Ee(e))throw ce(`incomplete expression`,e);if(t)return o.index++,b({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:h(e)},o.index-1);if(e.kind!==`String`&&am.has(e.text)&&Ee(e)){o.index++;let t=h(e);if(em.has(e.text))return b({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return b({kind:`Lambda`,params:[n.name],body:xm(e.text,n,t),operator:e.text,location:h(e)},o.index-1)}if(S(`LAMBDA`)){let t=o.index;C();let n=me(E(pe));T(`:`);let r=O();return b({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:h(e)},t)}return O()},Oe={range:void 0},ke=()=>ye(()=>{let e=o.index;T(`(`);let t=E(De);return T(`)`),Oe.range=y(e),t}),Ae=()=>{let e=C();o.offsideColumns.push(e.column);let t=[O()];for(;ee().text===e.text&&ee().column===e.column;)o.index++,t.push(O());return o.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:h(e)}},je=e=>ye(()=>{let t=h(e),n=x().kind===`Identifier`,r=S(`|->`,1)&&(n||de(x()));if(r||n&&S(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o.index,n=h(x()),i=e();return n.range=y(t),T(r?`|->`:`:`),{name:i,value:O(),location:n}},a=[i(()=>n?fe():C().text),...w(`,`)?E(()=>i(fe)):[]];return T(`]`),{kind:e,fields:a,location:t}}if(xe()){let e=D();T(`|->`);let n=O();return T(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let a=O();if(w(`->`)){let e=O();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(!de(x()))throw ue(`Expected a field name but found ${te(x())}`);e.push({kind:`Field`,name:C().text})}else T(`[`),e.push({kind:`Index`,args:E(()=>O())}),T(`]`);return T(`=`),{path:e,value:O()}});return T(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!S(`]_`)){let e=[a];for(;w(`,`);)e.push(O());return T(`]`),{kind:`Bracket`,args:e,location:t}}return T(`]_`),{kind:`BoxAction`,action:a,subscript:we(),location:t}}),Me=()=>{let e=o.index,t=b(Ve(),e),n=h(C());return b({kind:`Apply`,operator:`\\in`,args:[t,O()],location:n},e)},Ne=e=>ye(()=>{let t=h(e);if(w(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(xe()&&(x(1).text===`\\in`||S(`<<`))){let e=o.index,n=Ce();T(`\\in`);let r=O();if(w(`:`)){let e=O();return T(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o.index=e}let n=x().kind===`Identifier`&&S(`\\in`,1)?Me():O();if(w(`:`)){let e=D();return T(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;w(`,`);)r.push(O());return T(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Pe=e=>{let t=h(e),n=ye(()=>S(`>>`)||S(`>>_`)?[]:E(()=>O()));if(w(`>>_`)){if(n.length!==1)throw ce(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:we(),location:t}}return T(`>>`),{kind:`Tuple`,elements:n,location:t}},Fe=e=>{let t=h(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&xe()){let e=D();return T(`:`),{kind:n,bounds:e,body:O(),location:t}}let i=me(E(pe));return T(`:`),{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{if(w(`OTHER`))return T(`->`),{kind:`Case`,arms:t,other:O(),location:h(e)};let n=O();T(`->`),t.push({condition:n,body:O()})}while(w(`[]`));return{kind:`Case`,arms:t,other:void 0,location:h(e)}},Le=()=>{let e=x(1);return S(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||om.has(e.text)||e.kind===`Operator`&&($p.has(e.text)||em.has(e.text)||tm.has(e.text)))},Re=()=>{let e=C();if(e.kind===`Number`)return{kind:`Operand`,operand:se(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:S(`(`)?ke():[]}},ze=e=>{let t=o.index,n=C(),r=h(n);if(i&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=E(fe);return T(`:`),{kind:`Lambda`,params:e,body:O(),location:r}}if(n.kind===`Number`){if(i&&/^\\[BOH]/.test(n.text))throw ce(`incomplete expression`,n);return{kind:`Number`,value:se(n.text),text:n.text,location:r}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:r};if(n.kind===`String`)return{kind:`String`,value:n.text,location:r};let a=n.kind===`Step`&&rt(n);if(a&&et()<0&&$e.length<=1)throw ce(`Step number used outside proof`,n);if(a&&n.text[1]===`+`)throw ce(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||a){let c=a?it(n)??n.text:n.text;if(Se()){let t=me(w(`(`)?E(pe):[]);t.names.length>0&&T(`)`),T(`::`);let a=O();if(!i&&e!==void 0&&s.last!==void 0&&ym(a)&&e.high>=s.last.low)throw ce(`Removing the label would change expression parsing`,n);return{kind:`Label`,name:c,params:t.names,paramRanges:t.ranges,body:a,location:r}}let l=S(`(`);if(c===`@`&&!l&&!Le())return{kind:`ExceptAt`,location:r};let u=l?ke():[],d=[l?Oe.range:void 0];if(!Le())return l?{kind:`Apply`,operator:c,args:u,argumentsRange:Oe.range,location:r}:{kind:`Identifier`,name:c,location:r};let f=[{kind:`Name`,name:c,args:u}],p=[y(t,t)];for(;Le();)C(),p.push(y(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(`!`),g=f.flatMap(e=>`args`in e?e.args:[]),_=f.map(e=>`args`in e?e.args.length:0),v=d.at(-1)??y(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:r}:g.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:r}:{kind:`Apply`,operator:h,args:g,..._.slice(0,-1).some(e=>e>0)&&{argumentCounts:_},argumentsRange:v,selectorRanges:p,argumentRanges:d,location:r}}if(n.kind===`Operator`&&bm(n.text)&&S(`(`))return{kind:`Apply`,operator:n.text,spelling:n.spelling,args:ke(),location:r};if(n.kind===`Operator`&&bm(n.text)&&!i)return{kind:`Identifier`,name:n.text,spelling:n.spelling,location:r};switch(n.text){case`(`:{let e=ye(()=>O());return T(`)`),e}case`[`:return je(n);case`{`:return Ne(n);case`<<`:return Pe(n);case`@`:return{kind:`ExceptAt`,location:r};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Fe(n);case`IF`:{let e=O();T(`THEN`);let t=O();return T(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:O(),location:r}}case`CASE`:return Ie(n);case`LET`:{let e=[],t=[];for(u.push(/* @__PURE__ */ new Set);!w(`IN`);){if(i&&S(`RECURSIVE`))throw ce(`Unexpected keyword RECURSIVE`,re(ee()));if(w(`RECURSIVE`)){Xe();continue}let n=We(!1);n.kind===`Instance`?t.push(n):e.push(n)}u.pop();let n=O();return t.length===0?{kind:`Let`,definitions:e,body:n,location:r}:{kind:`Let`,definitions:e,instances:t,body:n,location:r}}case`CHOOSE`:{let e=Ce(),t=w(`\\in`)?O():void 0;return T(`:`),{kind:`Choose`,pattern:e,set:t,body:O(),location:r}}case`WF_`:case`SF_`:{let e=we(),t=ye(()=>{T(`(`);let e=O();return T(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:r}}}throw ue(`Unexpected ${te(n)}`,n)},Be=(e,t,n)=>{s.last=s.preceding={low:t,high:n};let r=O(n+1),a=x(),o=a.text===`'`||em.has(a.text)?Zp.high:$p.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=x(),n=h(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return Ae();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return C(),{kind:`Apply`,operator:`~`,args:[Be(t,4,4)],location:n};case`-`:return C(),{kind:`Apply`,operator:`-.`,args:[Be(t,12,12)],location:n};case`[]`:return C(),{kind:`Always`,expression:Be(t,4,15),location:n};case`<>`:return C(),{kind:`Eventually`,expression:Be(t,4,15),location:n};case`ENABLED`:return C(),{kind:`Enabled`,expression:Be(t,4,15),location:n};case`UNCHANGED`:return C(),{kind:`Unchanged`,expression:Be(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return C(),{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:b(n,t),previous:void 0};for(;;){let n=x();if(n.kind!==`Operator`)break;let i=h(n);if(n.text===`'`&&e<=15){C(),s.last=Zp,r.left=b({kind:`Prime`,expression:r.left,location:i},t);continue}if(em.has(n.text)&&e<=15){C(),s.last=Zp,r.left=b({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){C();let e=ye(()=>E(()=>O()));ye(()=>T(`]`)),s.last=Qp,r.left=b({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&de(x(1))){C();let e=C().text;r.left=b({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let a=$p.get(n.text);if(!a||a.low<e)break;let o=r.previous;if(o){let e=!(o.low>a.high||o.high<a.low),t=o.text===n.text&&a.isAssociative;if(e&&!t&&(o.text!==`\\X`||n.text!==`\\X`))throw ce(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(C(),a.low>12&&S(`-`))throw ce(`Precedence conflict between ${n.text} and -`,x());s.last=s.preceding=a;let c=O(a.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[y(t).end];r.left=l.kind===e&&o?.text===n.text?{...l,operands:[...l.operands,c],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,c],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&o?.text===`\\X`?{...l,factors:[...l.factors,c]}:{kind:`Product`,factors:[l,c],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,c],location:i};r.left=b(r.left,t),r.previous={...a,text:n.text}}return r.left},He=()=>{if(!w(`(`))return[];let e=Ye();return T(`)`),e},Ue=()=>{let e=h(x()),t=O(),n=a[o.index-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:p[0].name,start:e,end:r}}},We=e=>{let t=o.index;return b(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=x(),n=h(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...Ue(),isLocal:e,isRecursive:m(t),location:n});if(t.kind===`Identifier`&&x(1).kind===`Operator`&&$p.has(x(1).text)&&x(2).kind===`Identifier`&&S(`==`,3)){let e=pe(),t=C().text,n=pe();return T(`==`),r(t,[Ge(e),Ge(n)])}let i=t.kind!==`String`&&nm.has(t.text),a=t.kind===`Identifier`&&em.has(x(1).text)&&S(`==`,2);if(i||a){let e=i?t.text:x(1).text;i&&C();let n=pe();return a&&C(),T(`==`),r(e,[Ge(n)])}let s=fe();if(w(`[`)){let t=ye(()=>D());return T(`]`),T(`==`),{kind:`Function`,name:s,bounds:t,body:O(),isLocal:e,isRecursive:m(s),location:n}}let c=o.index,l=He();return T(`==`),S(`INSTANCE`)?{...qe(s,l,e,n),definitionRange:y(c)}:r(s,l)},qe=(e,t,n,r)=>{let i=o.index;return T(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ve(),substitutions:w(`WITH`)?E(()=>{let e=o.index,t=he(),n=y(e);return T(`<-`),{name:t,nameRange:n,expression:De()}}):[],isLocal:n,location:r,instanceRange:y(i)}},Je=()=>{let e=o.index;return b(k(),e)},k=()=>{let e=h(x());if(S(`_`)&&x(1).kind===`Operator`)return C(),{name:C().text,arity:w(`_`)?2:1,location:e};if(x().kind===`Operator`&&S(`_`,1)){let t=C().text;return C(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=fe();if(!w(`(`))return{name:t,arity:0,location:e};let n=E(()=>T(`_`));return T(`)`),{name:t,arity:n.length,location:e}},Ye=()=>E(Je),Xe=()=>{let e=Ye();return e.forEach(e=>u[u.length-1].add(e.name)),e},Ze=e=>{let t={value:0,offset:e};do{let e=x(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&gm.has(e.text)&&t.value++,e.kind===`Operator`&&_m.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Qe=()=>{let e=x(),t=x(1);return e.kind===`Identifier`?S(`(`,1)||S(`[`,1)?S(`==`,Ze(1)):t.kind===`Operator`&&em.has(t.text)?S(`==`,2):t.kind===`Operator`&&$p.has(t.text)?x(2).kind===`Identifier`&&S(`==`,3):S(`==`,1):e.kind!==`String`&&nm.has(e.text)&&t.kind===`Identifier`&&S(`==`,2)},$e=[],et=()=>$e[$e.length-1]??-1,tt=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),nt=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)},rt=e=>!e.text.endsWith(`.`)&&!fm.has(nt(e)),it=e=>{let t=nt(e);if(fm.has(t))return;let n=tt(e);if(n>=0)return`<${n}>${t}`;let r=et(),i=$e[$e.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},at=e=>{if(e.kind===`Keyword`)return lm.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return $e.length===0;if(e.text[1]===`+`||$e.length===0)return!0;let t=et();return t>=0&&tt(e)>t},A=e=>{let t=tt(e),n=$e.length-1,r=$e[n-1]??-1,i=$e[n]<0;return i&&($e[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:$e[n]===t},ot=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)),j=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!vm.has(e.name)&&!ot(e.name):!1,M=()=>{let e=x();return e.kind===`Step`?rt(e):e.kind===`Keyword`?pm.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Qe()},st=()=>{let e=o.index,t=x();return t.kind===`Operator`&&!rm.has(t.text)&&bm(t.text)?(o.index++,b({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:h(t)},e)):w(`MODULE`)?b({kind:`ModuleFact`,name:fe(),location:h(t)},e):O()},ct=e=>f[f.length-1]?.add(e),lt=e=>{f.push(/* @__PURE__ */ new Set);let t=e();return f.pop(),t},ut=e=>f.some(t=>t.has(e))||p.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),dt=()=>{let e=o.index,t=x(),n=E(()=>{let e=x();if((e.kind!==`Identifier`||ie(e))&&e.kind!==`Operator`)throw ue(`Expected a definition name but found ${te(e)}`,e);return o.index++,e.text},`!`),r=h(t);return b(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},ft=()=>{if(i)return E(dt);let e=E(st),t=n===`tlc`?e.find(e=>e.kind===`Identifier`&&ut(e.name)):void 0;if(t)throw ce(`DEF clause entry should describe a defined operator`,t.location);return e},pt=()=>({facts:M()?E(st):[],defs:w(`DEF`)||w(`DEFS`)?ft():[]}),mt=()=>{let e=o.index,r=C(),i=r.text===`USE`&&w(`ONLY`),a=y(e),s={kind:r.text===`USE`?`Use`:`Hide`,isOnly:i,...pt(),keyword:a,location:h(r)},l=s.kind===`Hide`&&n===`tlc`?s.facts.filter(e=>!j(e)):[];if(l.length>0)throw c(l.map(n=>({location:t(n.location.range??y(e)),message:`The only expression allowed as a fact in a HIDE is
|
|
457
|
+
the name of a theorem, assumption, or step.`})));return b(s,e)},ht=()=>{let e=o.index,t=h(x()),n=w(`NEW`),r=x().kind===`Keyword`?mm.get(x().text):void 0;if(!n&&r===void 0)throw ue(`Expected a declaration but found ${te(x())}`);if(r!==void 0&&C(),r===`Variable`){let n=pe();return ct(n.name),b({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let i=Je();ct(i.name);let a=(r??`Constant`)===`Constant`&&S(`\\in`);if(a&&i.arity>0)throw ce(`declared symbol with arguments before \\in`);return a&&C(),b({kind:`NewSymbol`,name:i.name,arity:i.arity,level:r??`Constant`,set:a?O():void 0,nameRange:i.location.range,location:t},e)},gt=()=>{let e=o.index,t=h(T(`ASSUME`)),n=E(()=>S(`ASSUME`)?lt(gt):x().kind===`Keyword`&&hm.has(x().text)?ht():O());return T(`PROVE`),b({kind:`AssumeProve`,assumptions:n,conclusion:O(),location:t},e)},_t=e=>{let t={value:0};for(;x(t.value).kind===`Identifier`&&S(`,`,t.value+1);)t.value+=2;return x(t.value).kind===`Identifier`&&S(e,t.value+1)},vt=(e,t)=>{e.forEach(ct),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(ct))},yt=()=>{let e=x();if(S(`USE`)||S(`HIDE`))return mt();if(S(`INSTANCE`)){let t=o.index;return b(qe(void 0,[],!1,h(e)),t)}if(S(`DEFINE`)||Qe()){let t=o.index;w(`DEFINE`);let n=[We(!1)];for(;Qe();)n.push(We(!1));let r={kind:`Define`,definitions:n,location:h(e)};return b(r,t)}if(w(`HAVE`))return{kind:`Have`,expression:O()};if(w(`TAKE`)){let e=xe(),t=me(e?[]:E(pe)),n=e?D():[];return vt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(w(`WITNESS`))return{kind:`Witness`,expressions:E(()=>O())};if(w(`PICK`)){let e=_t(`:`),t=me(e?E(pe):[]),n=e?[]:D();return vt(t.names,n),T(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:O()}}return w(`CASE`)?{kind:`Case`,expression:O()}:{kind:`Assert`,isSuffices:w(`SUFFICES`),statement:S(`ASSUME`)?gt():O()}},bt=e=>{let t=x();if(t.kind!==`Step`)throw ue(`Expected a step number but found ${te(t)}`,t);if(!A(t))throw ce(`${e?`QED step`:`step`}'s number has bad level`,t);if(tt(t)<0&&it(t)!==void 0)throw ce(`<*> and <+> cannot be used for a named step`,t);return o.index++,{name:it(t),token:t.text,location:h(t)}},xt=()=>{let e=o.index,t=bt(S(`QED`,1)),n=o.index,r=/* @__PURE__ */ new Set;f.push(r);let i=w(`QED`)?{kind:`Qed`}:yt(),a=y(e),s=y(n),c=at(x());if(c&&!um.has(i.kind))throw ce(`Proof of a step that does not take a proof`);let l=c?Ct():void 0;return f.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(ct),b({...t,body:i,head:a,statement:s,proof:l},e)},St=()=>{let e=h(x());if(S(`BY`)||S(`PROOF`)&&S(`BY`,1)){w(`PROOF`),C();let t=y(o.index-1);return{kind:`By`,isOnly:w(`ONLY`),...pt(),keyword:t,location:e}}let t=x(+!!S(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){w(`PROOF`),C();let n=y(o.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}w(`PROOF`);let n=[xt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(xt());return{kind:`Steps`,level:et(),steps:n,location:e}},Ct=()=>{let e=o.index;$e.push(-1);let t=lt(St);return $e.pop(),b(t,e)},wt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},Tt=e=>{let t=o.index,n=C(),r=x().kind===`Identifier`&&S(`==`,1)?fe():void 0;r!==void 0&&(d.add(r),C());let i=lt(()=>({statement:S(`ASSUME`)?gt():O(),proof:at(x())?Ct():void 0})),a=i.statement,s=b({name:r,statement:a,proof:i.proof,location:h(n)},t);e.theorems.push(s),e.units.push({kind:`Theorem`,theorem:s}),r!==void 0&&a.kind!==`AssumeProve`&&wt(e,b({kind:`Operator`,name:r,params:[],body:a,isLocal:!1,isRecursive:!1,location:h(n)},t))},Et=()=>{let e=o.index,t=C(),n=x().kind===`Identifier`&&S(`==`,1)?fe():void 0;return n!==void 0&&(d.add(n),C()),b({name:n,expression:O(),isAxiom:t.text===`AXIOM`,location:h(t)},e)},Dt=()=>{let e=h(T(`----`));T(`MODULE`);let t=ve();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.index;n.extends.push(ve()),n.extendsRanges.push(y(e))});;){let t=o.index;ne.index=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=Dt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),T(`====`);continue}C()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=h(C()),r=Ye();n.constants.push(...r),e.range=y(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=h(C()),r=E(()=>{let e=o.index,t=h(x());return b({name:fe(),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=Et();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&wt(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 ue(`Expected a module unit but found ${te(r)}`);let e=mt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:C(),n.units.push({kind:`Recursive`,declarations:Xe()});continue;case`INSTANCE`:Ot(n,b(qe(void 0,[],!1,h(r)),t));continue;case`LOCAL`:if(C(),S(`INSTANCE`)){Ot(n,b(qe(void 0,[],!0,h(r)),t));continue}Ot(n,b(Ke(!0),t));continue}r.kind===`Keyword`&&cm.has(r.text)?Tt(n):Ot(n,We(!1))}}},Ot=(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}))},kt=Dt(),At=_e.isUsed?Xp(e):void 0;if(At!==void 0)throw new l(At);return kt},wm=e=>Cm(e,`tlc`),Tm=(e,t)=>Cm(e,`tlc`,t),Em=e=>Cm(e,`tlapm`),Dm=e=>Cm(e,`sany`),Om=10454148508367108822n,km=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Om);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Am=Int32Array.from(km,e=>Number(BigInt.asIntN(32,e>>32n))),jm=Int32Array.from(km,e=>Number(BigInt.asIntN(32,e))),Mm=Number(BigInt.asIntN(32,Om>>32n)),Nm=Number(BigInt.asIntN(32,Om));let Pm=Mm,Fm=Nm;const Im=e=>{let t=(e^Fm)&255;Fm=(Fm>>>8|Pm<<24)^jm[t],Pm=Pm>>>8^Am[t]},Lm=(()=>{let e=[Am],t=[jm];for(let n=1;n<4;n++){let r=e[n-1],i=t[n-1],a=/* @__PURE__ */ new Int32Array(256),o=/* @__PURE__ */ new Int32Array(256);for(let e=0;e<256;e++){let t=i[e]&255;o[e]=(i[e]>>>8|r[e]<<24)^jm[t],a[e]=r[e]>>>8^Am[t]}e.push(a),t.push(o)}return{highs:e,lows:t}})(),Rm=Lm.highs[0],zm=Lm.highs[1],Bm=Lm.highs[2],Vm=Lm.highs[3],Hm=Lm.lows[0],Um=Lm.lows[1],Wm=Lm.lows[2],Gm=Lm.lows[3],Km=e=>{let t=Fm^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;Fm=Pm^Gm[n]^Wm[r]^Um[i]^Hm[a],Pm=Vm[n]^Bm[r]^zm[i]^Rm[a]},qm=e=>{if(typeof e==`boolean`)return Im(0),Im(e?116:102),2;if(typeof e==`number`)return Im(1),Km(e),5;if(typeof e==`string`){Im(3),Km(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)Km(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++)Im(e.charCodeAt(n));return 5+e.length}return Im(21),Km(Ot(e.name)+1),5},Jm=e=>{if(typeof e!=`object`||M(e))qm(e);else if(j(e)){let t=I(e);Im(9),Km(t.domain.length);for(let e=0;e<t.domain.length;e++)Jm(t.domain[e]),Jm(t.range[e])}else{let t=P(e).elements;Im(5),Km(t.length);for(let e of t)Jm(e)}},Ym=e=>{let t={high:Pm,low:Fm};Pm=Mm,Fm=Nm;for(let t of e)Jm(t);let n=BigInt(Pm>>>0)<<32n|BigInt(Fm>>>0);return Pm=t.high,Fm=t.low,n},Xm=(e,t)=>{let n=new BigInt64Array(e.length),r=new Int32Array(n.buffer),i=Pm,a=Fm;return e.forEach((e,n)=>{Pm=Mm,Fm=Nm;for(let n of t)Jm(e[n]);r[2*n]=Fm,r[2*n+1]=Pm}),Pm=i,Fm=a,n},Zm=25214903917n,Qm=(1n<<48n)-1n,$m=2147483647,eh=e=>{let t={value:(BigInt.asUintN(64,e)^Zm)&Qm},n=e=>(t.value=t.value*Zm+11n&Qm,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Zm)&Qm},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<=$m)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},th=[],nh=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},rh=()=>{for(let e=1277011;th.length<1341;e++)nh(e)&&th.push(e);return th},ih=e=>{let t=rh(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},ah=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},oh=e=>{for(let t=Math.max(e,9);;t++){let e=ah(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)}}},sh=(e,t,n)=>{if(t<=0)return[];let r=oh(t),i={index:BigInt(n.nextInt(t))},a=BigInt(ih(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},ch=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:$m),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},lh=(1n<<63n)-1n-24n,uh=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(lh*BigInt(n)+i)%t;return r<0n?r+t:r})},dh=(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,fh=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=qn(e.domain),n=P(e.range).elements;return{lists:t.map(()=>n),create:e=>zt(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>P(e).elements),create:t=>Xn(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>P(e).elements),create:Yn}}},ph=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,mh=(e,t,n,r)=>{if(F(t))return[];let i=r===`1.7.4`?ch:sh;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=ph(t,r)?void 0:fh(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt($m)?uh(e,t,n):i(e,Number(t),n)).map(e=>a.create(dh(a.lists,e)))}let o=P(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},hh=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new m(`RandomElement of the empty set`);return n},gh=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...qn(e.domain)];return zt(n,n.map(()=>gh(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Xn(e.names.map((n,r)=>[n,gh(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return Yn(e.factors.map(e=>gh(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 m(`RandomElement of the empty set`);return e.low+r}return hh(P(e).elements,t)},_h=(e,t=0n)=>{let n=eh(t),r={random:eh(t),seededState:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Xn([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Ym,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.seededState&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.seededState=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},vh=e=>Rn([...e.possibleCounts].map(([e,t])=>[e,t])),yh=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,vh(e)]]),bh=`----------------------------- MODULE Bags --------------------------------
|
|
458
458
|
(**************************************************************************)
|
|
459
459
|
(* A bag, also called a multiset, is a set that can contain multiple *)
|
|
460
460
|
(* copies of the same element. A bag can have infinitely many elements, *)
|
|
@@ -607,7 +607,7 @@ CopiesIn(e, B) ==
|
|
|
607
607
|
7 Dec 98 : Corrected error found by Stephan Merz.
|
|
608
608
|
6 Dec 98 : Modified comments based on suggestions by Lyle Ramshaw.
|
|
609
609
|
5 Dec 98 : Initial version.
|
|
610
|
-
`,
|
|
610
|
+
`,xh=/* @__PURE__ */ new Map([[`Bags`,bh],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
|
|
611
611
|
(***************************************************************************)
|
|
612
612
|
(* The two definitions in this standard module are overridden by TLC in *)
|
|
613
613
|
(* the Java class tlc2.module.FiniteSets. Each operator is overridden by *)
|
|
@@ -863,7 +863,7 @@ TestRandomSetOfSubsets(k, n, S) ==
|
|
|
863
863
|
[i \\in 1..5 |-> Cardinality(RandomSetOfSubsets(k, n, S))]
|
|
864
864
|
|
|
865
865
|
=============================================================================
|
|
866
|
-
`],[`RealTime`,`${
|
|
866
|
+
`],[`RealTime`,`${Xe}\n`],[`Reals`,`${Ye}\n`],[`Sequences`,`------------------------------ MODULE Sequences -----------------------------
|
|
867
867
|
(***************************************************************************)
|
|
868
868
|
(* Defines operators on finite sequences, where a sequence of length n is *)
|
|
869
869
|
(* represented as a function whose domain is the set 1..n (the set *)
|
|
@@ -1267,7 +1267,7 @@ TLCEvalDefinition(definitionName) ==
|
|
|
1267
1267
|
TRUE \\* TODO
|
|
1268
1268
|
|
|
1269
1269
|
============================================================================
|
|
1270
|
-
`],[`Toolbox`,`${
|
|
1270
|
+
`],[`Toolbox`,`${Ze}\n`],[`_DotTrace`,`------------------------------- MODULE _DotTrace -------------------------------
|
|
1271
1271
|
LOCAL INSTANCE TLC
|
|
1272
1272
|
LOCAL INSTANCE TLCExt
|
|
1273
1273
|
LOCAL INSTANCE GraphViz
|
|
@@ -1667,7 +1667,7 @@ _TLCTrace ==
|
|
|
1667
1667
|
/\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
|
|
1668
1668
|
|
|
1669
1669
|
=============================================================================
|
|
1670
|
-
`]]),
|
|
1670
|
+
`]]),Sh=new Map([...[...xh].filter(([e])=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e)),[`Bags`,bh.replace(`
|
|
1671
1671
|
LOCAL INSTANCE Naturals
|
|
1672
1672
|
`,`
|
|
1673
1673
|
EXTENDS TLC
|
|
@@ -1759,7 +1759,7 @@ _TEPosition ==
|
|
|
1759
1759
|
ELSE TLCGet("level") + 1
|
|
1760
1760
|
|
|
1761
1761
|
=============================================================================
|
|
1762
|
-
`]]),hh=(e=`master`)=>e===`1.7.4`?mh:ph,gh=(e,t,r)=>new n(`Applying ${e} to the following value,\nwhich is not ${t}:\n${I(r)}`),_h=e=>A(e)?F(e):void 0,vh=(e,t,n)=>{let r=L(e,t,n),i=_h(r);if(!i)throw gh(n,`a function with a finite domain`,r);return i},yh=(e,t,n)=>{let r=L(e,t,n),i=_h(r);if(!i)throw gi(t===0?`first`:`second`,n,`bag`,r);return i},bh=(e,t)=>{if(!k(e)||!M(e))throw t();return N(e).elements},xh=e=>e.range.every(e=>typeof e==`number`&&e>0),Sh=(e,t)=>{let n=e.domain.findIndex(e=>Zt(e,t));return n===-1?void 0:e.range[n]},Ch=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,wh=Ch(`BagDiff`,`tlc2.value.impl.Value`,2),Th=Ch(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Eh=Ch(`BagUnion`,`tlc2.value.impl.Value`,1),Dh=Ch(`BagOfAll`,`tlc2.value.impl.Value`,2),Oh=Ch(`BagCup`,`tlc2.value.impl.Value`,2),kh=Ch(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Ah=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Ii(e)}`;throw Ri(t,`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},jh=(e,t,n)=>{let r=Ah(e,n)+Ah(t,n);if(Ai(r))throw ji(`${e}+${t}`);return r},Mh=(e,t,n,r)=>{let i=Sh(n,e.domain[t]),a=Ah(e.range[t],r);return i===void 0?a:a-Ah(i,r)|0},Nh=(e,t)=>zn(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>Zt(e[0],r));a?a[1]=jh(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),Ph=Bt([],[]),Fh=e=>[Ei(`EmptyBag`,Ph),R(`IsABag`,1,e=>{let t=_h(L(e,0,`IsABag`));return t!==void 0&&xh(t)}),R(`BagCardinality`,1,e=>{let t=L(e,0,`BagCardinality`);return vh(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw gh(`BagCardinality`,`a bag`,t);return jh(e,n,kh)},0)}),R(`BagIn`,2,e=>{let t=L(e,1,`BagIn`),n=Sh(vh(e,1,`BagIn`),L(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw gi(`second`,`BagIn`,`bag`,t);return n>0}),R(`CopiesIn`,2,e=>{let t=L(e,1,`CopiesIn`),n=Sh(vh(e,1,`CopiesIn`),L(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw gi(`second`,`CopiesIn`,`bag`,t);return n}),R(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=yh(e,t,`(+)`);if(!xh(n))throw gi(t===0?`first`:`second`,`(+)`,`bag`,L(e,t,`(+)`));return n});return Nh(t,Oh)}),R(`\\ominus`,2,e=>{let t=yh(e,0,`(-)`),n=yh(e,1,`(-)`);return zn(t.domain.flatMap((e,r)=>{let i=Mh(t,r,n,wh);return i>0?[[e,i]]:[]}))}),R(`BagUnion`,1,e=>{let t=L(e,0,`BagUnion`),r=bh(t,()=>gh(`BagUnion`,`a finite enumerable set`,t));if(r.length<2)return r[0]??Ph;let i=r.map(e=>{let r=_h(e);if(!r)throw new n(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${I(t)}`);return r});return Nh(i,Eh)}),R(`\\sqsubseteq`,2,e=>{let t=vh(e,0,`\\sqsubseteq`),n=vh(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Mh(t,r,n,Th)<=0)}),Di(`BagOfAll`,2,e=>{let t=Ti(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new n(`The first argument of BagOfAll should be an operator, but instead it is:\n${I(t.literalBody)}`);let r=L(e,1,`BagOfAll`),i=_h(r);if(!i)throw gi(`second`,`BagOfAll`,`function with a finite domain`,r);return Nh(i.domain.map((e,n)=>Bt([t.call([e])],[i.range[n]])),Dh)}),R(`SubBag`,1,t=>{let n=L(t,0,`SubBag`);if(!A(n))throw new h(`DOMAIN expects a function but received ${I(n)}`);let r=F(n),i=Nn(r.range).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new h(`Attempted to apply a function to ${I(r)}, which is not in its domain`);return Nn(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Bt(e.map(e=>e[0]),e.map(e=>e[1]))))}),R(`BagToSet`,1,e=>zr(vh(e,0,`BagToSet`))),R(`SetToBag`,1,e=>{let t=L(e,0,`SetToBag`),n=bh(t,()=>gh(`BagToSet`,`a function with a finite domain`,t));return Bt([...n],n.map(()=>1))})],Ih=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Lh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,Rh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,zh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Bh=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Vh=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Hh=e=>{if(!A(e))return!1;let t=F(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},Uh=(e,t)=>Ri(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Ii(t)}`),Wh=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Gh=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw Uh(t,e);return`[${N(e).elements.map(e=>qh(e,t)).join(`,`)}]`},Kh=(e,t)=>{let n=F(e),r=Sr(n);return r?`[${r.map(e=>qh(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Wh(typeof e==`string`?e:I(e))}:${qh(n.range[r],t)}`).join(`,`)}}`},qh=(e,t)=>typeof e==`string`?Wh(e):typeof e==`object`?e.kind===`ModelValue`?Wh(e.name):k(e)?Gh(e,t):Kh(e,t):String(e),Jh=e=>{if(k(e))return Gh(e,Ih);if(!A(e)||Hh(e))throw Uh(Ih,e);return Kh(e,Ih)},Yh=e=>{if(!A(e))throw Uh(Lh,e);return Kh(e,Lh)},Xh=e=>{let[,t,n=`0`,r=``,i=`0`]=/^(-?)(\d+)(?:\.(\d*))?(?:[eE]([+-]?\d+))?$/.exec(e)??[],a=BigInt(n+r),o=Number(i)-r.length,s=o>=0?a*10n**BigInt(o):a/10n**BigInt(-o);return Number(BigInt.asIntN(32,t===`-`?-s:s))},Zh=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Et(e);if(Array.isArray(e))return Yn(e.map(e=>Zh(e,t)));if(typeof e==`object`&&e)return Xn(Object.entries(e).map(([e,n])=>[Et(e),Zh(n,t)]));throw Ri(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Qh=(e,t)=>{if(e.trim()===``)return Zh(null,t);try{return Zh(JSON.parse(e,(e,t,n)=>typeof t==`number`?Xh(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Ri(t,e.message):e}},$h=(e,t)=>{if(typeof e!=`string`)throw Ri(t,`Cannot cast tlc2.value.impl.${Ii(e)} to tlc2.value.impl.StringValue`);return e},eg=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Ri(n,`${t} (No such file or directory)`);return r},tg=e=>[Oi(`ToJson`,1,e=>Et(qh(L(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Oi(`ToJsonArray`,1,e=>Et(Jh(L(e,0,`ToJsonArray`)))),Oi(`ToJsonObject`,1,e=>Et(Yh(L(e,0,`ToJsonObject`)))),Oi(`JsonSerialize`,2,t=>{let n=$h(L(t,0,`JsonSerialize`),Rh),r=L(t,1,`JsonSerialize`);if(!Sr(r)&&!Hh(r))throw gi(`second`,`JsonSerialize`,`sequence or record`,r);return e.writeFile?.(n,qh(r,Rh)),!0}),Oi(`ndJsonSerialize`,2,t=>{let n=$h(L(t,0,`ndJsonSerialize`),zh),r=L(t,1,`ndJsonSerialize`),i=Sr(r);if(!i)throw gi(`second`,`ndJsonSerialize`,`sequence`,r);return e.writeFile?.(n,i.map(e=>`${qh(e,zh)}\n`).join(``)),!0}),Oi(`JsonDeserialize`,1,t=>{let n=$h(L(t,0,`JsonDeserialize`),Bh);return Qh(eg(e,n,Bh),Bh)}),Oi(`ndJsonDeserialize`,1,t=>{let n=$h(L(t,0,`ndJsonDeserialize`),Vh);return Yn(eg(e,n,Vh).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Qh(e,Vh)))})],ng=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,rg=1e6,ig=(e,t,n)=>{if(typeof e!=`number`||e<0)throw gi(t,n,`nonnegative integer`,e);return e},ag=(e,t,n,r)=>Nn(Array.from({length:t},()=>Nn(e.filter(()=>r.nextDouble()<n)))),og=(e,t)=>{let n=`RandomSetOfSubsets`,r=ig(L(e,0,n),`first`,n),i=ig(L(e,1,n),`second`,n),a=L(e,2,n);if(!k(a)||!M(a))throw gi(`third`,n,`finite set`,a);let o=N(a).elements;if(o.length<31&&r>2**o.length)throw gi(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw gi(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return ag(o,r,o.length===0?0:i/o.length,t.getRandom())},sg=e=>[Oi(`RandomSubset`,2,t=>{let n=L(t,0,`RandomSubset`);if(typeof n!=`number`)throw gi(`first`,`RandomSubset`,`nonnegative integer`,n);if(n<0)throw Ri(ng,String(n));let r=L(t,1,`RandomSubset`);if(!k(r)||!P(r)&&!M(r))throw gi(`second`,`RandomSubset`,`a finite set`,r);let i=ah(r,e.version);if(i&&i.reduce((e,t)=>e*N(t).elements.length,1)>rg)throw Ri(ng,`Attempted to construct a set with too many elements (>${rg}).`);return Nn(oh(n,r,e.getRandom(),e.version))}),Oi(`RandomSetOfSubsets`,3,t=>og(t,e)),Oi(`TestRandomSetOfSubsets`,3,t=>Yn(Array.from({length:5},()=>N(og(t,e)).elements.length)))],cg=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,lg=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${cg})`,ug=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${cg}) throws java.io.IOException`,dg=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${cg})`,fg=e=>Xn([[`name`,e??`UnnamedAction`],[`location`,Xn([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),pg=(e,t,n)=>{let r=e.map((e,t)=>Yn([t+1,Xn(Object.entries(e))])),i=r.slice(1).map((e,n)=>Yn([r[n],t[n],e])),a=n?[Yn([r[r.length-1],n.action,r[n.start]])]:[];return Xn([[`action`,Nn([...i,...a])],[`state`,Nn(r)]])},mg=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return dh(e).get(t)},hg=(e,t,r,i)=>{if(typeof r==`number`&&r>=0)e.registers.set(r,i);else if(r===`exit`)i===!0&&(e.isStopped=!0);else if(r===`pause`){if(i!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))e.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))e.properties.set(r.slice(2),I(i));else throw new n(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${I(r)}`)},gg=e=>e.every(e=>e!==void 0),_g=(e,t)=>Xn(t.variables.map((t,n)=>[t,e[n]])),vg=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(e.kind===`Prime`||e.kind===`Unchanged`)return!0;if(r!==void 0&&!O(e)){if(t.variableIndex.has(r))return!0;let e=Fu(r,t);if(e&&!n.has(e)&&(n.add(e),vg(e.body,t,n)))return!0}return Ye(e).some(e=>vg(e,t,n))},yg=(t,r)=>{let i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new WeakMap,o=e=>{let t=a.get(e)??/* @__PURE__ */ new Map;return a.set(e,t),t};return[R(`AssertEq`,2,e=>{let n=L(e,0,`AssertEq`),r=L(e,1,`AssertEq`),i=Zt(n,r);return i||(t(I(`Assertion failed`,!0)),t(I(n,!0)),t(I(r,!0))),i}),Gi(`AssertError`,2,e=>{let t=Ti(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw Ri(lg,`In computing AssertError, a non-string expression (line ${t.location.line}, col ${t.location.column}) was used as the err of an AssertError(err, exp).`);let n=Ki(e,0,`AssertError`)();try{Ki(e,1,`AssertError`)()}catch(e){if(e instanceof h)return xa(e.message,r.isTool)===n;throw e}return!1}),Oi(`TLCGetOrDefault`,2,e=>{let t=L(e,0,`TLCGetOrDefault`);return mg(r,t)??L(e,1,`TLCGetOrDefault`)}),{...Di(`TLCGetAndSet`,4,e=>{let n=L(e,0,`TLCGetAndSet`),i=mg(r,n)??L(e,3,`TLCGetAndSet`),a=Ti(e,1,`TLCGetAndSet`);return hg(r,t,n,a.call([i,L(e,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Oi(`Trace`,0,(e,t)=>{let n=t?.state;if(!t||!n||!gg(n)){let e=(t?.environment.variables??[]).filter((e,t)=>n?.[t]===void 0);throw Ri(ug,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return Yn(r.getBehavior(n).map(e=>_g(e,t.environment)))}),Oi(`CounterExample`,0,()=>r.counterExample??Xn([[`action`,Nn([])],[`state`,Nn([])]])),R(`ToTrace`,1,e=>{let t=L(e,0,`ToTrace`);if(!A(t)||!Zt(zr(t),Nn([`action`,`state`])))throw new h(`The argument of ToTrace should be a CounterExample, but instead it is:\n${I(t)}`);let n=N(Lr(t,`state`)).elements.map(e=>Sr(e)??[]);return Yn(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 n(`The argument of ModelValue should be a string, but instead it is:\n${I(t)}`);return Rt(t)}),Gi(`TLCDefer`,1,()=>!0),R(`TLCNoOp`,1,e=>L(e,0,`TLCNoOp`)),Gi(`PickSuccessor`,1,(t,n)=>{let i=n?.next;if(!i||!gg(i))throw Ri(dg,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(r.isSeen(i)||Pu(Ki(t,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new e(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Gi(`TLCCache`,2,(e,t)=>{let n=Ti(e,0,`TLCCache`),r=ii(Ki(e,1,`TLCCache`)()),a=n.expression;if(!a||!t)return n.call([]);let s=vg(a,t.environment,/* @__PURE__ */ new Set)&&t.state?o(t.state):i,c=s.get(a)??/* @__PURE__ */ new Map;s.set(a,c);let l=c.get(r);if(l!==void 0)return l;let u=n.call([]);return c.set(r,u),u}),R(`TLCFP`,1,e=>Number(BigInt.asIntN(32,Vm([L(e,0,`TLCFP`)])))),Oi(`TLCEvalDefinition`,1,(e,t)=>{let r=L(e,0,`TLCEvalDefinition`),i=typeof r==`string`&&t?Fu(r,t.environment):void 0;if(!i||typeof r!=`string`||!t)throw new n(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${I(r)}`);if(i.kind===`Operator`&&i.params.length>0)throw new n(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${r}`);return H({kind:`Identifier`,name:r,location:i.location},t)})]},bg=(e,t)=>[Oi(`_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}),Oi(`_Counts`,0,()=>uh(t)),Oi(`_CheckName`,1,n=>{let r=String(L(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(I(uh(t),!0)),!1)}),Oi(`_PrintCounts`,0,()=>(e(I(uh(t),!0)),!0))],xg=e=>String(e).padStart(2,`0`),Sg=e=>`${e.getUTCFullYear()}.${xg(e.getUTCMonth()+1)}.${xg(e.getUTCDate())}.${xg(e.getUTCHours())}${xg(e.getUTCMinutes())}${xg(e.getUTCSeconds())}`,Cg=e=>zn([...e].map(([e,t])=>[e,Yn([t])])),wg=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Tg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Eg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Dg=(e,t,r)=>{if(e.version===`1.7.4`?!Tg.has(t)||!e.isStarted&&Eg.has(t):!e.isStarted&&wg.has(t))throw new n(`TLCGet(${t}) was undefined.`);let i=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return r===void 0?0:e.getLevel(r);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return i;case`stats`:return Xn([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,i],[`worker`,0]]);case`config`:return Xn([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Xn([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Et(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Et(Sg(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return fg(void 0);case`all`:return Cg(e.registers);case`all:named`:return Cg(dh(e))}if(t.startsWith(`s:`)){let r=dh(e).get(t);if(r===void 0)throw new n(`TLCGet(${t}) was undefined.`);return r}if(t.startsWith(`-D`))return Et(e.properties.get(t.slice(2))??t);throw new n(`TLCGet(${t}) was undefined.`)},Og=(e,t,r)=>{if(typeof t==`number`&&t>=0){let r=e.registers.get(t);if(r===void 0)throw new n(`TLCGet(${t}) was undefined.`);return r}if(typeof t!=`string`)throw new n(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${I(t)}`);return Dg(e,t,r?.state)},kg=e=>e.length===0?[[]]:e.flatMap((t,n)=>kg([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Ag=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&N(e).elements.forEach(Ag),e.kind===`Function`&&e.range.forEach(Ag))},jg=(e,t)=>[R(`Print`,2,t=>(e(`${at(I(L(t,0,`Print`),!0,!0))} ${at(I(L(t,1,`Print`),!0,!0))}`),L(t,1,`Print`))),R(`PrintT`,1,t=>(e(at(I(L(t,0,`PrintT`),!0,!0))),!0)),R(`Assert`,2,e=>{if(L(e,0,`Assert`)!==!0)throw new n(`The first argument of Assert evaluated to FALSE; the second argument was:\n${at(I(L(e,1,`Assert`)))}`,m.assertViolation);return!0}),R(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),R(`:>`,2,e=>zn([[L(e,0,`:>`),L(e,1,`:>`)]])),R(`@@`,2,e=>{let t=wi(e,0,`@@`),n=wi(e,1,`@@`);return Bn([...pt(t),...pt(n)])}),R(`ToString`,1,e=>Et(I(L(e,0,`ToString`),!0))),R(`TLCEval`,1,e=>{let t=L(e,0,`TLCEval`);return Ag(t),t}),R(`Permutations`,1,e=>{let t=Si(e,0,`Permutations`);return Nn(kg(t).map(e=>zn(t.map((t,n)=>[t,e[n]]))))}),Di(`SortSeq`,2,e=>{let t=Ti(e,1,`SortSeq`);return Yn(Ci(e,0,`SortSeq`).reduce((e,n)=>{let r=e.findIndex(e=>t.call([n,e])===!0);return r===-1?[...e,n]:[...e.slice(0,r),n,...e.slice(r)]},[]))}),t.version===`1.7.4`?zi({...Oi(`TLCGet`,1,(e,n)=>Og(t,L(e,0,`TLCGet`),n)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):zi(Gi(`TLCGet`,1,(e,n)=>Og(t,Ki(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)`),Oi(`TLCSet`,2,n=>{let r=L(n,0,`TLCSet`);return hg(t,e,r,L(n,1,`TLCSet`)),!0}),Ei(`Any`,Pt),R(`RandomElement`,1,e=>ch(xi(e,0,`RandomElement`),t.getRandom()))],Mg=(e,t)=>e.every(e=>Er(e,t)),Ng=Nn([!1,!0]),Pg=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Rn(Pg(e,t,r),Pg(e,r,n))},Fg=[`\\cup`,`\\cap`,`\\`],Ig=e=>typeof e==`object`&&e.kind===`MixedSet`,Lg=(e,t,n)=>{let r=t.kind===`Interval`?N(t).elements:t.elements;if(e!==`\\cup`){let t=e===`\\cap`;return Pn(r.filter(e=>Er(e,n)===t))}if(r.length===0)return n;if(!st(n))return qt({kind:`SetOperation`,operator:e,left:t,right:n});let i=N(n).elements.filter(e=>!Er(e,t));return Pn([...r,...i])},Rg=[Ei(`TRUE`,!0),Ei(`FALSE`,!1),Ei(`BOOLEAN`,Ng),Ei(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ki(`=`,jn),ki(`#`,(e,t)=>!jn(e,t)),R(`~`,1,e=>!yi(e,0,`~`)),R(`<=>`,2,e=>yi(e,0,`<=>`)===yi(e,1,`<=>`)),R(`/\\`,2,e=>yi(e,0,`/\\`)&&yi(e,1,`/\\`)),R(`\\/`,2,e=>yi(e,0,`\\/`)||yi(e,1,`\\/`)),R(`=>`,2,e=>!yi(e,0,`=>`)||yi(e,1,`=>`)),R(`\\in`,2,e=>Er(L(e,0,`\\in`),L(e,1,`\\in`))),R(`\\notin`,2,e=>!Er(L(e,0,`\\notin`),L(e,1,`\\notin`))),R(`\\subseteq`,2,e=>{let t=bi(e,0,`\\subseteq`),n=L(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&M(t.base)?Mg(N(t.base).elements,n.base):Mg(N(t).elements,n)}),...Fg.map(e=>R(e,2,t=>{let n=L(t,0,e),r=L(t,1,e);if(st(n)&&st(r)&&!Ig(n)&&!Ig(r)){if(e===`\\cup`&&P(n))return r;let t=e===`\\cup`?Rn:e===`\\cap`?Ln:In;return Tr((e,n)=>t(N(e),N(n)),(t,n)=>Lg(e,t,n),n,r)}return st(n)?Lg(e,n,r):e!==`\\`&&st(r)?Lg(e,r,n):qt({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=bi(e,0,`UNION`),n=ct(t)?t.elements.filter(ct):[];if(!ct(t)||n.length!==t.elements.length)return qt({kind:`Union`,base:t});if(Ig(t)||n.some(Ig)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{Er(t,e)||e.elements.push(t)})),Pn(e.elements)}return n.length===0?Fn:Pg(n.map(N),0,n.length)}),R(`DOMAIN`,1,e=>{let t=L(e,0,`DOMAIN`);if(!A(t))throw new h(`DOMAIN expects a function but received ${I(t)}`);return zr(t)})],zg=Vi(`Integers`,`Neg`,`IntValue`,1),Bg=e=>{let t=Vi(e,`DotDot`,`IntervalValue`,2);return[Hi(e,`+`,`Plus`,(e,t)=>e+t),Hi(e,`-`,`Minus`,(e,t)=>e-t),Hi(e,`*`,`Times`,(e,t)=>e*t),Hi(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new n(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new n(`0^0 is undefined.`);return e**t}),Hi(e,`\\div`,`Divide`,(t,r)=>{if(r===0)throw new n(`The second argument of \\div is 0.`);if(e===`Naturals`){let e=Math.trunc(t/r)|0;return e<0&&Math.imul(e,r)!==t?e-1:e}let i=Math.floor(t/r);if(Ai(i))throw ji(`${t} \\div ${r}`);return i}),Hi(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new n(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),R(`..`,2,e=>({kind:`Interval`,low:Bi(L(e,0,`..`),t),high:Bi(L(e,1,`..`),t)}))]},Vg=Bg(`Naturals`),Hg=Bg(`Integers`),Ug=e=>{let t=Vg.indexOf(e);return t===-1?void 0:Hg[t]},Wg=[Ei(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Vg,Wi(`<`,(e,t)=>e<t),Wi(`>`,(e,t)=>e>t),Wi(`<=`,(e,t)=>e<=t),Wi(`>=`,(e,t)=>e>=t,`>`)],Gg=[Ei(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Hg,Wi(`>=`,(e,t)=>e>=t),R(`-.`,1,e=>{let t=Bi(L(e,0,`-`),zg);if(Ai(-t))throw ji(`-${t}`);return-t})],Kg=(e,t,r)=>{let i=L(e,t,r),a=Sr(i);if(!a)throw new n(`${r}\n${I(i)}`);return a},qg=(e,t,n)=>{let r=L(e,t,n);return typeof r==`string`?r:Kg(e,t,n)},Jg=(e,t,n)=>typeof e==`string`?Et(e.slice(t,n)):Yn(e.slice(t,n)),Yg=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Xg=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Zg=(e,t)=>{let n=Sf.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?zi(e,t):e}):t},Qg=e=>Zg(`Sequences`,[R(`Seq`,1,e=>({kind:`SequenceSet`,base:L(e,0,`Seq`)})),R(`Len`,1,e=>qg(e,0,Yg(``,`Len`)).length),R(`\\o`,2,e=>{let t=qg(e,0,Xg(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Kg(e,1,Xg(`t \\o s`,`sequence`));return Yn([...t,...n])}let r=L(e,1,`\\o`);if(typeof r!=`string`)throw new n(`${Xg(`t \\o s`,`string`)}\n${I(r)}`);return Et(t+r)}),R(`Append`,2,t=>Yn([...Kg(t,0,Xg(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),L(t,1,`Append`)])),R(`Head`,1,e=>{let t=Kg(e,0,Yg(``,`Head`));if(t.length===0)throw new n(`Attempted to apply Head to the empty sequence.`);return t[0]}),R(`Tail`,1,e=>{let t=qg(e,0,Yg(``,`Tail`));if(t.length===0)throw new n(`Attempted to apply Tail to the empty sequence.`);return Jg(t,1)}),R(`SubSeq`,3,e=>{let t=qg(e,0,Yg(`first `,`SubSeq`)),r=vi(e,1,`SubSeq`),i=vi(e,2,`SubSeq`);if(r>i)return Jg(t,0,0);let a=r<1||r>t.length?{position:`second`,value:r}:i>t.length?{position:`third`,value:i}:void 0;if(a)throw new n(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${I(L(e,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return Jg(t,r-1,i)}),Di(`SelectSeq`,2,e=>{let t=Ti(e,1,`SelectSeq`);return Yn(Kg(e,0,Yg(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw gi(`second`,`SelectSeq`,`operator`,n);return n}))})]),$g=e=>Zg(`FiniteSets`,[R(`IsFiniteSet`,1,e=>{let t=L(e,0,`IsFiniteSet`);if(k(t))return br(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new h(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${I(t)}\nis a finite set.`:`Attempted to check if the ${lt(t)} ${I(t)} is a finite set.`)}),R(`Cardinality`,1,t=>{let r=L(t,0,`Cardinality`);if(!k(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new n(`Attempted to compute cardinality of the value\n${I(r)}`);return vr(r,e)})]),e_=/* @__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`]]]),t_=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:Wg};case`Integers`:return{extends:[`Naturals`],operators:Gg};case`Sequences`:return{extends:[],operators:Qg(n.version)};case`FiniteSets`:return{extends:[],operators:$g(n.version)};case`TLC`:return{extends:[],operators:Zg(`TLC`,jg(t,n))};case`Randomization`:return{extends:[],operators:sg(n)};case`_Possible`:return{extends:[],operators:bg(t,n)};case`Json`:return{extends:[],operators:tg(r)};case`Bags`:return{extends:[],operators:Fh(i)};case`TLCExt`:return{extends:[],operators:yg(t,n)};default:return}},n_=`$subexpression`,r_=(e,t)=>new l(`${e} at line ${t.line}, column ${t.column}`),i_=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return i_(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of Ye(e)){let e=i_(r,t,n);if(e)return e}},a_=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),o_=(e,t)=>{let n=e.location,r=a_(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 r_(`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 r_(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:n_,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:n_,args:e.args,location:n,resolution:Ia},location:n}},s_=(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:Ia})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Ia}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Ia};return o_({...t,params:[...t.params,...r]},a)},c_=(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 r_(r,i);Ra.set(n,{args:e.slice(0,o.index).flatMap(e=>`args`in e?e.args:[]),error:{location:b(t),message:r}}),o.isFailed=!0},c=n=>{let r=[],a=[];for(;o.index<e.length;){let s=e[o.index];if(s.kind!==`Name`)throw r_(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>os(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o.index++}throw r_(`Unknown operator ${r.join(`!`)}`,i)},l=t=>{let l=c(t),u=l.definition,d=Ua(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 r_(`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&&i_(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 r_(`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`||uo(t.operand,1)!==0)throw r_(`A LET/IN expression has only one operand`,i);a.lets.push(n.definitions),o.current=n.body;return}let r=ho(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[uo(t.operand,r.length)],s=e[o.index+1];if(!a||s?.kind!==`Operand`)throw r_(`A subexpression of CASE must have the form !i!j`,i);o.index++;let c=uo(s.operand,2),l=c===0?a.condition:c===1?a.body:void 0;if(!l)throw r_(`Nonexistent CASE operand`,i);o.current=l;return}if(t.kind!==`Operand`)throw r_(`Unexpected subexpression selector`,i);let s=r?r.sets:go(n),c=s?.[uo(t.operand,s.length)];if(!c)throw r_(`Nonexistent operand specified by the selector`,i);o.current=c},f=l(void 0);if(o.isFailed)return n;if(f)return s_(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 r_(`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 s_(e.definition,{...a,args:[...a.args,...e.args]});u()}else d(t),o.index++}if(o.isFailed)return n;if(!o.current)throw r_(`Subexpression selection failed`,i);return o_(a,o.current)},l_=(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 fo(e,t,n)},u_=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Ye(e).some(u_),d_=(e,t,n,r=!1)=>{if(!u_(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=ls(e,e=>d_(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>f_(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)=>d_(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:ls(e,e=>d_(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?l_(a.name,[],void 0,t):a.kind===`Apply`?l_(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=c_(o,t,a,r);return c!==a&&La.add(c),c},f_=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:d_(e.expression,t,n,!0)}))}),p_=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},m_=(e,t)=>f_(e,p_(t.definitions),()=>!1),h_=(e,t)=>{let n=p_([...t,...e.definitions]),r=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),i=e=>r.has(e),a=e=>d_(e,n,i),o=e=>i(e)||!n(e),s=e=>d_(e,n,o),c=e=>e.map(e=>e.kind===`ModuleFact`?e:s(e)),l=e=>e.map(e=>({...e,set:s(e.set)})),u=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&s(e.set)}:u(e)),conclusion:s(e.conclusion)}:s(e),d=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:c(e.facts)};case`Instance`:return f_(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?f_(e,n,o):cs(e,s))};case`Have`:case`Case`:return{...e,expression:s(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(s)};case`Take`:return{...e,bounds:l(e.bounds)};case`Pick`:return{...e,bounds:l(e.bounds),body:s(e.body)};case`Assert`:return{...e,statement:u(e.statement)};default:return e}},f=e=>e?.kind===`By`?{...e,facts:c(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:d(e.body),proof:f(e.proof)}))}:e,p={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:u(e.statement),proof:f(e.proof)})),uses:e.uses.map(e=>({...e,facts:c(e.facts)}))};return e.definitions.some(e=>u_(e.body))||e.assumptions.some(e=>u_(e.expression))?{...p,definitions:e.definitions.map(e=>cs(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},g_=(e,t)=>e.maxLevels[t]??3,__=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=fc({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=>Us(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Us(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ws(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Bs(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)&&Us(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(pc(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,o=b(t.location.range??{module:t.instancer,start:t.location,end:t.location}),s=e=>r.set(`${o}\n${e}`,{location:o,message:e}),c=e(t.module),l=i(t.module),u=n(t.instancer),d=/* @__PURE__ */ new Map;t.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...c.constants.map(e=>({...e,maximumLevel:0})),...c.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=u.analyze(n,d);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(n,d);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),p=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&s(p(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let n=l.constraints.get(e.name);n!==void 0&&e.level>n&&s(p(e.name,n));let r=e.operator;r&&Array.from({length:e.arity},(n,i)=>{let a=l.argConstraints.get(Rs(e.name,i));a!==void 0&&g_(r,i)<a&&s(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),l.argParams.forEach(e=>{let n=Bs(e),r=f.find(e=>e.name===n.operator)?.operator,i=f.find(e=>e.name===n.param);if(!r||!i)return;let a=g_(r,n.index);i.level>a&&s(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw a([...r.values()])}},v_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],y_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),b_=new Map(gf.flatMap(e=>e.map(t=>[t,e[0]]))),x_=e=>b_.get(e)??e,S_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},C_=()=>{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}}},w_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:S_(e)&2147483647,kind:t,isLocal:n}),T_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:x_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:x_(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}},E_=(e,t)=>{let n=[];for(let r=t;;){let t=T_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},D_=e=>({line:e.line,column:e.column}),O_=(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=E_(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},k_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,A_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},j_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&k_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&k_(e[n+1],e[n+2])?n+=k_(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=>A_[e])}"`:r.text)}return t},M_=e=>e[2]?.text,N_=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},P_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>P_(e.modules,t)).find(Boolean),F_=e=>{let t=e===void 0?[]:xe(e),n={module:void 0};return{tokens:t,ranges:N_(t),getModule:()=>n.module??=e===void 0?gm(``):_m(e,t)}},I_=(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=F_(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:(bf.has(i)?t?.(i):void 0)??xf.get(i)??t?.(i)??mm(e,i),{tokens:c,ranges:l,getModule:u}=a(s),d=l.get(M_(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:()=>P_(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()}},L_=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=E_(t,e+1);i.push({location:D_(t[e]),apply:e=>r.forEach(t=>e.put(w_(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,r)=>{let l=e.start+r,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;i.push({location:D_(u),apply:t=>t.put(w_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&o(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&o(l,`variable`),u.text===`RECURSIVE`&&E_(t,l+1).every(e=>s.has(e))&&o(l,`definition`),y_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(a.push(D_(u)),i.push({location:D_(u),apply:e=>e.put(w_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(w_(t,`theorem`,!1))})});let l=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=x_(e.name);i.push({location:e.location,apply:n=>n.put(w_(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(w_(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(w_(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>Ha(e.location,t.location)?-1:+!!Ha(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=C_();n.set(i??``,o),hf.toReversed().forEach(e=>o.put(w_(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)}}},R_=(e,t)=>{let n=/* @__PURE__ */ new Set,r=e=>{n.add(e)},a=e=>{e.kind===`ModelValue`&&r(e.name),e.kind===`String`&&r(e.value),e.kind===`Set`&&e.elements.forEach(a)};t.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),_f.forEach(r);let o=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=O_(o(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),ee=m(e=>e.instances),g=/* @__PURE__ */ new Set([void 0]),_=/* @__PURE__ */ new Map;j_(o(void 0)).forEach((e,t)=>{t===3&&yf.forEach(r),r(e)});let v=l(void 0);for(;;){let t=h(v,/* @__PURE__ */ new Set)??ee(v,/* @__PURE__ */ new Set);if(!t)break;let[n,a]=t;if(d.add(`${n.key}>${a}`),_.set(n.unit,[..._.get(n.unit)??[],a]),!g.has(a)){if(g.add(a),e(a).tokens.length===0){let t=n.unit??M_(e(void 0).tokens);throw i(a,t)}j_(o(a)).forEach(r)}}v_.forEach(r);let te=/* @__PURE__ */ new Set,y=e=>{if(te.has(e))return;te.add(e);let t=_.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(y),o(e).forEach(e=>{e.kind===`String`&&r(e.text)})};return y(void 0),vf.forEach(r),[...n]},z_=(e,t)=>{let n=I_(e,t),r=n.getParsed,i,a=()=>i??=L_(r);return{getStringOrder:e=>R_(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)}}},B_=e=>{switch(e.kind){case`Number`:if(!ut(e.value))throw o(new n(`Integer overflow: ${e.value} is outside TLC's 32-bit range`),m.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return Rt(e.name);case`Set`:return Nn(e.elements.map(B_))}},V_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],H_=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof l))throw n;let r=Hp(e);throw r===void 0?n:a([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},U_=e=>new l(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),W_=(e,t)=>e.location.range&&t.location.range&&{location:b(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${b(t.location.range)}.`},G_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,K_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:G_(e),q_=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:Cs(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),J_=(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 h(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&Zt(t,r)})});if(t)return t[1];throw new h(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:I(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},Y_=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||Ye(e).some(e=>Y_(e,t)),X_=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(vs(e),n.get(e)??n.size)),n},Z_=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Q_=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Cu(e);if(e.kind===`Number`&&!ut(e.value))throw wu(e);Q_(e.kind===`Let`?[...Ye(e),...Z_(e.instances??[])]:Ye(e))}),$_=(e,n)=>{let r=n.order??z_(n.source,n.loadModule),o=r.parseModule(n.source),s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Map,d=/* @__PURE__ */ new Set,f=new Map(Rg.map(e=>[e.name,e])),p=/* @__PURE__ */ new Map,m=lh(e.checkDeadlock,n.seed);m.isWarningEnabled=n.isWarningEnabled??!0,m.isTool=n.isTool??!1,m.version=n.version??`master`;let ee=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Map,te=[],y=/* @__PURE__ */ new Map,ne=[],re=[],ie=(e,t)=>ne.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ae={value:0},oe=e=>`${e}#${ae.value++}`,se=[],ce=[],le=__(e=>{let t=v.get(e)??me(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>s.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>s.get(t.visible.get(e)?.key??e)}}),ue=/* @__PURE__ */ new Map,de=/* @__PURE__ */ new Map,fe=/* @__PURE__ */ new Map,x=e=>{let t=p.get(e);if(t)return t;let r=t_(e,n.print,m,n.files,f);if(!r)return;e_.get(e)?.forEach(x);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>x(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{f.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Fs.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Ls(e,t.name)??i.get(t.name)?.range})}),p.set(e,i),i},S=e=>{if(bf.has(e)&&n.loadModule?.(e)!==void 0)return;let t=x(e),r=e_.get(e)??[];return t&&ie(e,r),t&&r.includes(`Integers`)&&x(`Integers`),t},C=e=>(Q_([...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]),...Z_(e.instances)]),e.modules.forEach(C),e);C(o);let w=(e,t)=>{let o=n.loadModule?.(e)??$e.get(e)??mm(n.source,e);if(o===void 0)throw i(e,t);let s=H_(o,e,r);if(s.name!==e)throw a([{location:`Unknown location`,message:`File name '${e}' does not match the name '${s.name}' of the top level module it contains.`}],!0);return C(s)},pe=e=>{let t=re.indexOf(e.name);if(t!==-1){let n=[...re.slice(t),e.name].map(e=>`${e}.tla`);throw new l(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,r=[],i=[],o=[];re.push(e.name),ne.push(n);let s=Ce(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:ce,levelChecks:o});if(ne.pop(),re.pop(),i.length>0)throw a(i,!1,void 0,ce);let c=r.find(e=>n.has(e.name)),u=c&&ee.get(c.name),d=u&&W_(c,u.module);if(d)throw a([d],!1,void 0,ce);if(c)throw U_(c);return o.forEach(e=>e()),{linked:s,closure:n}},me=(e,t)=>{let r=ee.get(e);if(r)return ie(e,y.get(e)??[]),r;let i=pe(w(e,t));return(hh(m.version).has(e)?t_(e,n.print,m,n.files,f):void 0)?.operators.forEach(e=>{let t=i.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(f.set(t.key,e),s.delete(t.key))}),ee.set(e,i.linked),y.set(e,i.closure),ie(e,i.closure),i.linked},he=(e,t,n,r,i)=>{let a=i?void 0:S(e.module);if(a)return ge(e,a);let o=i??me(e.module,t.name);o.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let l=V_(o),f=`#${ae.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=Qo(m_(e,t),l,t,n);se.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=As({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,rs(t,p)])),variables:new Set(o.variables),getDefinition:e=>s.get(e),isParameterized:e=>c.get(e)===!0,addDefinition:(n,i,a)=>{let o=oe(`${i}@${t.name}`),f=a(o);return s.set(o,f),l.length>0&&d.add(f),e.name!==void 0&&de.set(o,`${e.name}!${de.get(n)??i}`),c.set(o,!r),u.set(o,{source:n,prefix:e.params.length}),o},createName:oe});return _e(e,o.exported,l,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return l.length>0&&ue.set(r,{name:n,location:e.location}),e.name!==void 0&&fe.set(r,n),r})},ge=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),_e=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:c.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},ve=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:ws(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),ye=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),be=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=ye(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:ws(r,n),location:n}}},T=(e,t,n,r)=>{let i=e.location,a=r?void 0:S(e.module);if(a)return e.name===void 0?[]:[...a].map(([t,n])=>{let r=ye(n.arity);return ve(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let o=r??me(e.module,n),l=`#${ae.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=V_(o),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};se.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>Y_(f(e),p),h=d.map(t=>{let n=be(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),ee=[],g=As({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:ws(e.params,i),location:i,resolution:Ia}:Cs(`${t.name}${l}`,i)])),variables:new Set(o.variables),getDefinition:e=>s.get(e),isParameterized:e=>c.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${ee.length}`,a=r(i);return ee.push(a.kind===`Operator`?{...a,name:i}:q_(a,i)),i},createName:oe}),_=new Set(d.map(e=>e.name)),v=[...o.exported].filter(([e])=>!_.has(e)).map(([t,n])=>{let r=g.getKey(n.key),a=ye(n.arity),o=[...e.params,...a];return ve(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...ee,...v]},xe=e=>[...e].flatMap(([e,t])=>{let n=s.get(t.key);return n?[{...n,name:e}]:[]}),Se=/* @__PURE__ */ new Map,Ce=(e,t)=>{let r=mf(e,n.loadClass?.(e.name),e===o);Se.set(e.name,r.overrides);let i=r.module,a=se.length,l=new Map([...Rg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...t.symbols]),u=/* @__PURE__ */ new Map,d={location:qo,errors:[],warnings:[]},f=[d],p=e=>e.forEach((e,t)=>{let n=m.get(t);if(!n){l.set(t,e),m.set(t,e);return}if(!n.range||!e.range||b(n.range)===b(e.range))return;let r=b(e.range),i=b(n.range);K_(n.kind)===K_(e.kind)?d.warnings.push({location:r,message:`Warning: the ${G_(n.kind)} of '${t}' conflicts with \nits ${G_(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${G_(e.kind)} of '${t}' conflicts with \nits ${G_(n.kind)} at ${i}.`})}),m=/* @__PURE__ */ new Map,h=/* @__PURE__ */ new Set,ee=/* @__PURE__ */ new Map,g=[],y=[...i.constants],ne=i.variables.map(e=>e.name),re=i.variables.map(e=>e.location);i.extends.forEach(e=>{let n=t.modules.get(e),r=n?void 0:S(e);if(r){p(r);return}let a=n??me(e,i.name);y.push(...a.constants.filter(e=>y.every(t=>t.name!==e.name))),a.variables.forEach((e,t)=>{ne.includes(e)||(ne.push(e),re.push(a.variableLocations[t]))}),p(a.exported),a.facts.forEach(e=>h.add(e)),a.modules.forEach((e,t)=>ee.set(t,e)),g.push(a)});let ie=new Map(l),ae=[...i.constants.map(e=>({...e,kind:`Constant`})),...i.variables.map(e=>({...e,kind:`Variable`}))],oe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});ae.forEach(e=>m.set(e.name,oe(e)));let ue=e=>({key:x(e),arity:Ua(e),params:Wa(e),kind:Jo(i,e)?`Theorem`:`Definition`,range:e.location.range}),de=y.length===0&&ne.length===0,x=e=>i===o?e.name:`${e.name}@${t.id}`,C=/* @__PURE__ */ new Map,w=()=>new Map([...t.modules,...ee]),pe=e=>{let t=i.instances.find(t=>t.module===e.name);return t!==void 0&&Ha(e.location,t.location)},ve=e=>{let t=i.modules.find(t=>t.name===e.module);return t?pe(t)?ee.get(t.name):void 0:w().get(e.module)},ye=e=>({imported:l,getInstance:e=>{let t=ve(e),n=t?void 0:S(e.module);if(n)return{declarations:[],symbols:ge(e,n),instancer:i.name};let r=t??me(e.module,i.name),a=V_(r);return{declarations:a,symbols:_e(e,r.exported,a,e=>e),instancer:i.name}},bound:ie,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:x,instanced:C,facts:h,reports:f,warnings:t.warnings}),be=e=>[...ae.filter(t=>Ha(t.location,e)).map(e=>[e.name,oe(e)]),...i.definitions.filter(t=>Ha(t.location,e)).map(e=>[e.name,ue(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(l)),we=e=>{let n=w(),r=n.get(e.name),i=r&&W_(e,r.module);if(r&&!i)throw U_(e);t.nested.push(e);let a={location:e.location,errors:[],warnings:[]};f.push(a);let o=Ce(e,{id:`${t.id}/${e.name}`,symbols:be(e.location),modules:n,nested:t.nested,errors:a.errors,warnings:a.warnings,levelChecks:t.levelChecks});i&&a.errors.push(i),r||ee.set(e.name,o),_.has(e.name)||_.set(e.name,o)};[...i.instances.map(e=>({location:e.location,link:()=>{let t=he(e,i,ye(i),de,w().get(e.module));C.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||m.set(n,t))})}})),...i.modules.map(e=>({location:e.location,link:()=>we(e)}))].sort((e,t)=>Ha(e.location,t.location)?-1:1).forEach(e=>e.link());let E=h_(Ps(i,(e,t)=>T(e,t,i.name,ve(e))),xe(l));t.errors.push(...es(E,ye(E))),E.definitions.forEach(e=>{let t=x(e);s.set(t,e),c.set(t,!de);let n=ue(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!Ha(r,e.location))&&(l.set(e.name,n),e.isLocal||m.set(e.name,n))});let Te={module:E,constants:y,variables:ne,variableLocations:re,visible:l,exported:m,modules:ee,extended:g,facts:/* @__PURE__ */ new Set([...h,...[...E.theorems,...E.assumptions].flatMap(e=>e.name??[])])};v.has(i.name)||v.set(i.name,Te);let Ee=se.splice(a).map(e=>({location:e.location,check:()=>le(e)}));return t.levelChecks.push(()=>mc(E,{constants:new Set(y.map(e=>e.name)),variables:new Set(ne),getDefinition:e=>s.get(l.get(e)?.key??e),getQualifiedName:e=>fe.get(l.get(e)?.key??e)},Ee,ce)),te.push(Te),Te},we=pe(o).linked;ce.length>0&&!n.isSanyReported&&n.print(t(ce));let E=e=>we.visible.get(e)?.key??e;we.visible.forEach((e,t)=>{let n=s.get(e.key);n&&e.key!==t&&s.set(t,n)});let Te=[],Ee=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Ee(e,t)),Te.push(...e.module.assumptions))};Ee(we,/* @__PURE__ */ new Set);let De=we.constants.map(e=>e.name),Oe=we.variables,ke=e=>e.module===void 0?[e.name,E(e.name)]:e.module===o.name||De.includes(e.name)?[]:[(ee.get(e.module)??_.get(e.module))?.visible.get(e.name)?.key??e.name],Ae=e=>{let t=s.get(e);return t?.kind===`Operator`?t.params.length:we.constants.find(t=>t.name===e)?.arity??0},je=/* @__PURE__ */ new Map,Me=/* @__PURE__ */ new Set,Ne=(e,t)=>{f.set(e,t),s.delete(e),je.delete(e),Me.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=B_(e.value);An(t),ke(e).forEach(e=>{let n=Ae(e);n===0?je.set(e,t):Ne(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Pe=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Pe.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new g(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(B_),B_(e.value)]),Pe.set(t,n)}),Pe.forEach(e=>ke(e).forEach(t=>Ne(t,J_(e.name,Ae(t)||e.rows[0][0].length,e.rows))));let Fe=new Map(e.substitutions.flatMap(e=>ke(e).map(t=>[t,E(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,r=t.target;if(!De.includes(n)&&!we.visible.has(n))throw new g(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===r))throw new g(`In the configuration file, the identifier ${r} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let i=E(r),a=s.get(i);if(!(a!==void 0||f.has(i)||je.has(i)||De.includes(r)||Oe.includes(r)))throw new g(`The configuration file substitutes for ${n} with the undefined identifier ${r}.`);if(a?.kind===`Operator`&&a.params.length!==(we.constants.find(e=>e.name===n)?.arity??we.visible.get(n)?.arity))throw new g(`The configuration file substitutes for ${n} with ${r} of different number of arguments.`)});let Ie=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(ke)),Le=(e,t)=>{if(Ie.has(e))return{key:e,prefix:t};let n=u.get(e);return n&&Le(n.source,t+n.prefix)};u.forEach((e,t)=>{let n=Le(e.source,e.prefix),r=s.get(t);if(!n||!r)return;let i=r.kind===`Operator`?r.params:[],a=ve(t,n.key,i,i.slice(n.prefix),r.location);s.set(t,a),we.visible.forEach((e,n)=>{e.key===t&&n!==t&&s.set(n,a)})});let Re=De.filter(e=>!je.has(e)&&!Fe.has(e)&&!Me.has(e));if(Re.length>0&&!n.isUnconfigured){let e=r.getDeclarationOrder(`constant`).find(e=>Re.includes(e))??Re[0];throw new g(`The constant parameter ${e} is not assigned a value by the configuration file.`)}n.isTraceRecorded&&f.forEach((e,t)=>{let n=Ug(e);n&&f.set(t,n)});let ze=X_(Oe,te.flatMap(e=>e.module.variables.map(e=>e.name))),Be=Oc({definitions:s,substitutions:Fe,constants:je,variableIndex:ze,builtins:f,variables:Oe}),Ve={runtime:m,definitions:s,builtins:f,constants:je,substitutions:Fe,instanceNames:de,variables:Oe,variableIndex:ze,facts:Be,startupValues:Array.from({length:Be.ids.size},()=>void 0),substitutedDefinitions:d,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},He=fc({constants:new Set(je.keys()),variables:/* @__PURE__ */ new Set([...Oe,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>f.has(e))]),getDefinition:e=>Fu(e,Ve)}),D=e=>{try{H(e,{environment:Ve,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof h)return e;throw e}};Fe.forEach((e,t)=>{let n=s.get(e),r=De.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&He.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?D(n.body):void 0;if(r){let n=va(r)?``:` - specifically: ${r.message}`;throw new g(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),m.version!==`1.7.4`&&(m.isStarted=!0);let Ue=new Set(te.flatMap(e=>e.module.instances.map(e=>e.module))),We=r.createDefinitionOrder();return{environment:Ve,assumptions:Te,variableLocations:we.variableLocations,instanceActions:ue,startupDefinitions:te.filter(e=>!Ue.has(e.module.name)||V_(e).length===0).flatMap(e=>We(e===we?void 0:e.module.name).flatMap(t=>{let n=s.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:we.constants,rootSymbols:we.visible,javaOverrides:te.flatMap(e=>Se.get(e.module.name)??[])}},ev={kind:`Boolean`,value:!0},tv={kind:`Boolean`,value:!1},nv=e=>e?ev:tv,rv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,iv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),av=(e,t,n)=>({kind:e,operands:[t,n]}),ov=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?ov(e,t.operands).operands:[t])}),sv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return sv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,sv(t)),0)}},cv=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 cv(e.body);case`And`:case`Or`:return e.operands.some(cv)}},lv=/* @__PURE__ */ new WeakMap,uv={count:0},dv=e=>{let t=lv.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`#${uv.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(dv).join(`,`)})`;default:return`${e.kind}(${dv(e.body)})`}})();return lv.set(e,n),n},fv=(e,t)=>e===t||dv(e)===dv(t),pv=(e,t)=>{let n=dv(t);return e.some(e=>e===t||dv(e)===n)},mv=e=>e===`And`?`Or`:`And`,hv=(e,t)=>{switch(e.kind){case`Boolean`:return t?nv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return hv(e.body,!t);case`And`:case`Or`:return ov(t?mv(e.kind):e.kind,e.operands.map(e=>hv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,hv(e.body,t))}}},gv=e=>{switch(e.kind){case`Boolean`:return nv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return ov(mv(e.kind),e.operands.map(gv));case`Always`:return $(`Eventually`,gv(e.body));case`Eventually`:return $(`Always`,gv(e.body));default:return $(`Not`,e)}},_v=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=_v(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return nv(t)}return n.length===0?nv(!t):n.length===1?n[0]:ov(e.kind,n)}case`Not`:{let t=_v(e.body);return t.kind===`Boolean`?nv(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=_v(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},vv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,yv=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=yv(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new h(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>ov(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=yv(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=vv(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:ov(`Or`,t);n.push($(`Always`,$(`Eventually`,e)))}return ov(`Or`,n)}case`Not`:return rv(e.body)?e:yv(gv(e.body));default:return e}},bv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?bv(e.operands[0]):ov(e.kind,e.operands.map(bv));case`Not`:return e.body.kind===`Not`?bv(e.body.body):$(`Not`,bv(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,bv(e.body));default:return e}},xv=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return xv(e.operands[0]);let t=Math.floor(e.operands.length/2);return av(e.kind,xv(ov(e.kind,e.operands.slice(0,t))),xv(ov(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,xv(e.body));default:return e}},Sv=(e,t)=>{e.kind===`Eventually`&&!pv(t,e)&&t.push(e),`body`in e&&Sv(e.body,t),`operands`in e&&e.operands.forEach(e=>Sv(e,t))},Cv=e=>{let t=e.filter(iv),n=e.flatMap(e=>e.kind===`Not`&&iv(e.body)?[e.body]:[]);return!t.some(e=>pv(n,e))},wv=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,$(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new h(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Tv=(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]}},Ev=(e,t,n)=>e.flatMap(e=>{let r=Tv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Dv=e=>[...new Set(e.map(dv))].sort().join(`|`),Ov=(e,t)=>{let n=new Set(t.map(Dv));return[...e.filter(e=>!n.has(Dv(e))),...t]},kv=e=>{let t=wv(e),n=Ev(t,`Always`,`And`),r=Ev(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Tv(t,`Eventually`,`Or`);if(n&&!(pv(e,n.first)||pv(e,n.second)))return Ov(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(pv(e,t.first)||pv(e,t.second))&&!pv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Cv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Tv(t[e],`Always`,`And`);n&&(pv(t,n.first)||t.push(n.first),pv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)pv(t,e.first)&&pv(t,e.second)&&!pv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Cv(t)?[]:i(t)};return a(e)},Av=e=>({particle:e,successors:[],statePredicates:e.filter(e=>sv(e)<=1)}),jv=e=>{let t=kv([e]).map(Av),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Dv(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of kv(n)){let n=Dv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Av(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Mv=(e,t)=>!pv(e,t)||pv(e,t.body),Nv=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&sv(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=vv(e);if(n){let e=sv(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(cv(e))throw new h(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Pv=(e,t)=>{let n=e.findIndex(e=>fv(e,t));return n===-1?(e.push(t),e.length-1):n},Fv=e=>{let t=yv(_v(hv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=bv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Nv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:ov(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:fv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&xv(e.formula),n=[];t&&Sv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Pv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Pv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Pv(i,e))}));return{tableau:t&&jv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Iv=()=>o(new h(`Temporal formula is a tautology (its negation is unsatisfiable).`),m.livenessEvaluationFailure),Lv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Rv=/* @__PURE__ */ new WeakSet,zv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Bv=(e,t)=>new h(`TLC cannot handle the temporal formula ${B(e)}${t===void 0?``:`:\n${t}`}`),Vv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=Ou(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return Vv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?Vv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=Fu(e,n);if(t)return Pc(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isStateLevel&&!r.isLevelConstant?1:0},o=(e,t)=>r.has(e)?0:O(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return ls(e,(e,a)=>(i.value=Math.max(i.value,Vv(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return Lv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Hv=(e,t)=>{try{return Wu(e,t)}catch(e){if(!(e instanceof h))throw e;if(!va(e))return;throw o(new h(`${c}${e.message}`),m.error)}},Uv=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o)=>{let s=(e,t,s=o,c=i,l)=>Uv(e,t,n,r,c,a||l!==void 0&&n.substitutedDefinitions.has(l),s);if(e.kind===`And`)return e.operands.flatMap(e=>s(e,t,B(e)));if(e.kind===`Label`)return s(e.body,t);if(e.kind===`Let`)return s(e.body,Wv(e,t,n));if(e.kind===`Identifier`){let r=O(e)?Ou(t,e.name):void 0;if(r?.kind===`Thunk`)return s(r.expression,r.scope);let a=n.constants.has(e.name)?void 0:Fu(e.name,n);if(!r&&a?.kind===`Operator`&&a.params.length===0&&Pc(a,n)>0){if(i.has(a))throw d();return s(a.body,void 0,a.name,/* @__PURE__ */ new Set([...i,a]),a)}}let c=zv(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||Vv(e,t,n)===3)){let t=fd(e,c),r=O(e)?void 0:Fu(e.operator,n);if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&!a)return s(t.body,wd(t,e.args,c),e.operator,i,r)}let l=r&&e.kind===`Forall`&&e.bounds.every(e=>Vv(e.set,t,n)===0),u=l?Hv(e.bounds,c):void 0;if(l&&u){let n=[];if(Gu(e.bounds,u,t,t=>(n.push(...s(e.body,t,B(e.body))),!1)),n.length===0)throw Iv();return n}return[{expression:e,scope:t,name:o}]},Wv=(e,t,n)=>{let r=Ed(e.definitions,zv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Rv.add(e.binding);return r},Gv=(e,t,n)=>{let i=n.runtime.version===`1.7.4`,a=(e,t,r)=>{let a=r===0&&!i?Vv(e,t,n):r;if(a===0){let r=H(e,zv(n,t));if(typeof r!=`boolean`)throw new h(`TLC expected a boolean value, but did not find one. ${gu(e)}`);return nv(r)}return a===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},o={depth:0},s=(e,t,n,r)=>{if(o.depth>=100)throw d();o.depth++;let i=m(e,t);o.depth--;let s=sv(i);return s>2?i:a(n,r,s)},c=(e,t)=>{let r=e.kind===`Identifier`?e.name:e.operator,a=zv(n,t),o=O(e)||Fu(r,n)===void 0?Ou(t,r):void 0;if(o?.kind===`Thunk`&&Rv.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:O(e)?pd(r,a):dd(r,n);if(c?.kind!==`Closure`)throw Bv(e);let u=e.kind===`Apply`?e.args:[],d=!O(e)&&Fu(r,n)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>H(e,a)),s(c.body,wd(c,u,a),e,t)),d)},l=(e,t,n=!1)=>{try{return t()}catch(t){let a=t instanceof r||n&&!i;throw!(t instanceof h)||a?t:Bv(e)}},u=(e,t)=>{let i=Vv(e,t,n);if(!e.bounds.every(e=>Vv(e.set,t,n)===0)){if(i<=2)return a(e,t,i);throw Bv(e)}let o=[],s=e.kind===`Forall`;try{Ku(e.bounds,zv(n,t),t=>(o.push(m(e.body,t)),!1))}catch(n){if(!(n instanceof h)||n instanceof r)throw n;if(i<=2)return a(e,t,i);throw Bv(e,s&&!va(n)?n.message:void 0)}return o.length===0?nv(s):f(e,t,ov(s?`And`:`Or`,o))},f=(e,t,n)=>{let r=sv(n);return r>2?n:a(e,t,r)},p=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!O(e)||e.operator===`=>`),m=(e,t)=>{let r=Vv(e,t,n);if(r<=2&&!p(e))return a(e,t,r);switch(e.kind){case`Label`:return m(e.body,t);case`Let`:return m(e.body,Wv(e,t,n));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,av(`Or`,$(`Not`,m(n[0],t)),$(`Eventually`,m(n[1],t)))):e.operator===`~`&&!O(e)?f(e,t,$(`Not`,m(n[0],t))):e.operator===`=>`?f(e,t,av(`Or`,$(`Not`,m(n[0],t)),m(n[1],t))):c(e,t)}case`And`:case`Or`:return f(e,t,ov(e.kind,e.operands.map(e=>m(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&Vv(e.condition,t,n)===0){let r=H(e.condition,zv(n,t));if(typeof r==`boolean`)return m(r?e.consequent:e.alternative,t)}let r=m(e.condition,t);return f(e,t,av(`Or`,av(`And`,r,m(e.consequent,t)),av(`And`,$(`Not`,r),m(e.alternative,t))))}case`Always`:case`Eventually`:return $(e.kind,m(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=$(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?$(`Always`,$(`Eventually`,av(`Or`,i,a))):av(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw Bv(e)}};return m(e,t)},Kv=(e,t,n,r,i)=>{let a=e=>Kv(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`?Pu(H(e.expression,a),`a temporal property predicate`):au(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&Pu(H(e.unchanged,a),`a subscript`)?!1:Pu(H(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return Kv(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new h(`TLC cannot evaluate a temporal formula in a single step`)}},qv=(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)=>qv(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 Kv(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Jv=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),Yv=(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},Xv=e=>o(new h(`${u}${e}`),m.error),Zv=e=>{let t=F(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!j(e)||!j(i))throw Xv(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},Qv=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(Qv);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},$v=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,ey=(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 Xv(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>H(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!k(a)||!M(a))throw Xv(`The symmetry operator must specify a set of functions.`);let o=N(a).elements;if(!o.every(A))throw Xv(`The symmetry values must be function records.`);let s=o.map(Zv),c=r.body.kind===`Apply`?r.body.args:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=Qv($v(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(ca.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;s.forEach(e=>{e.size>0&&d.set(Jv(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=Yv(n,e),r=Jv(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(!$v(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>j(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},ty=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=ry(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(ry(e[r],t));return a}},ny=(e,t)=>{let n=[],r=[];for(let i of e){let e=ry(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(It);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(It(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},ry=(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=ny(e.elements,t);return n?zt(n):e}if(n===`Function`||n===`LazyFunction`&&M(e.domain)){let n=F(e),r=ty(n.domain,t),i=ty(n.range,t)??n.range;if(r){let e=zn(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Bt(n.domain,e.range):e}return i===n.range?n:Bt(n.domain,i)}if(n===`Interval`||!k(e)||!M(e))return e;let r=N(e),i=ty(r.elements,t);return i?Nn(i):r},iy=(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]=ry(e[o],i),a===0&&(a=It(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},ay={line:0,column:0},oy=e=>({kind:`Identifier`,name:e,location:ay}),sy=/* @__PURE__ */ new Set([`name`,`property`]),cy=(e,t,n)=>{let r=Fu(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(sy.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},ly=(e,t,n)=>{if(jc(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return H(oy(e),jy(n,void 0,void 0))}catch(e){if(e instanceof h||f(e))return;throw e}},uy=(e,t,n)=>{let r=cy(e,t,n);if(ly(t,r,n)!==void 0)throw new g(`The ${e} ${t} cannot be a constant.`);return r},dy=(e,t,n)=>{let r=n.constants.has(t)?void 0:cy(e,t,n),i=r?ly(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},fy=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},py=(e,t,n)=>{let r=e.environment,i=/* @__PURE__ */ new Set;r.runtime.warn=(e,t)=>{i.has(t)||(i.add(t),n?.({kind:`warning`,code:e,text:t}))},n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),cd(e.startupDefinitions,r),t.invariants.forEach(e=>{dy(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},my=(e,t)=>{let n=fc({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>Fu(e,t)});return e.flatMap(e=>{let r=dy(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
|
|
1762
|
+
`]]),Ch=(e=`master`)=>e===`1.7.4`?Sh:xh,wh=(e,t,r)=>new n(`Applying ${e} to the following value,\nwhich is not ${t}:\n${L(r)}`),Th=e=>j(e)?I(e):void 0,Eh=(e,t,n)=>{let r=R(e,t,n),i=Th(r);if(!i)throw wh(n,`a function with a finite domain`,r);return i},Dh=(e,t,n)=>{let r=R(e,t,n),i=Th(r);if(!i)throw gi(t===0?`first`:`second`,n,`bag`,r);return i},Oh=(e,t)=>{if(!A(e)||!N(e))throw t();return P(e).elements},kh=e=>e.range.every(e=>typeof e==`number`&&e>0),Ah=(e,t)=>{let n=e.domain.findIndex(e=>Xt(e,t));return n===-1?void 0:e.range[n]},jh=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Mh=jh(`BagDiff`,`tlc2.value.impl.Value`,2),Nh=jh(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Ph=jh(`BagUnion`,`tlc2.value.impl.Value`,1),Fh=jh(`BagOfAll`,`tlc2.value.impl.Value`,2),Ih=jh(`BagCup`,`tlc2.value.impl.Value`,2),Lh=jh(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Rh=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Ii(e)}`;throw Ri(t,`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},zh=(e,t,n)=>{let r=Rh(e,n)+Rh(t,n);if(Ai(r))throw ji(`${e}+${t}`);return r},Bh=(e,t,n,r)=>{let i=Ah(n,e.domain[t]),a=Rh(e.range[t],r);return i===void 0?a:a-Rh(i,r)|0},Vh=(e,t)=>Rn(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>Xt(e[0],r));a?a[1]=zh(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),Hh=zt([],[]),Uh=e=>[Ei(`EmptyBag`,Hh),z(`IsABag`,1,e=>{let t=Th(R(e,0,`IsABag`));return t!==void 0&&kh(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`);return Eh(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw wh(`BagCardinality`,`a bag`,t);return zh(e,n,Lh)},0)}),z(`BagIn`,2,e=>{let t=R(e,1,`BagIn`),n=Ah(Eh(e,1,`BagIn`),R(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw gi(`second`,`BagIn`,`bag`,t);return n>0}),z(`CopiesIn`,2,e=>{let t=R(e,1,`CopiesIn`),n=Ah(Eh(e,1,`CopiesIn`),R(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw gi(`second`,`CopiesIn`,`bag`,t);return n}),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Dh(e,t,`(+)`);if(!kh(n))throw gi(t===0?`first`:`second`,`(+)`,`bag`,R(e,t,`(+)`));return n});return Vh(t,Ih)}),z(`\\ominus`,2,e=>{let t=Dh(e,0,`(-)`),n=Dh(e,1,`(-)`);return Rn(t.domain.flatMap((e,r)=>{let i=Bh(t,r,n,Mh);return i>0?[[e,i]]:[]}))}),z(`BagUnion`,1,e=>{let t=R(e,0,`BagUnion`),r=Oh(t,()=>wh(`BagUnion`,`a finite enumerable set`,t));if(r.length<2)return r[0]??Hh;let i=r.map(e=>{let r=Th(e);if(!r)throw new n(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${L(t)}`);return r});return Vh(i,Ph)}),z(`\\sqsubseteq`,2,e=>{let t=Eh(e,0,`\\sqsubseteq`),n=Eh(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Bh(t,r,n,Nh)<=0)}),Di(`BagOfAll`,2,e=>{let t=Ti(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new n(`The first argument of BagOfAll should be an operator, but instead it is:\n${L(t.literalBody)}`);let r=R(e,1,`BagOfAll`),i=Th(r);if(!i)throw gi(`second`,`BagOfAll`,`function with a finite domain`,r);return Vh(i.domain.map((e,n)=>zt([t.call([e])],[i.range[n]])),Fh)}),z(`SubBag`,1,t=>{let n=R(t,0,`SubBag`);if(!j(n))throw new m(`DOMAIN expects a function but received ${L(n)}`);let r=I(n),i=Mn(r.range).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new m(`Attempted to apply a function to ${L(r)}, which is not in its domain`);return Mn(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>zt(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>zr(Eh(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=Oh(t,()=>wh(`BagToSet`,`a function with a finite domain`,t));return zt([...n],n.map(()=>1))})],Wh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Gh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,Kh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,qh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Jh=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Yh=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Xh=e=>{if(!j(e))return!1;let t=I(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},Zh=(e,t)=>Ri(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Ii(t)}`),Qh=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),$h=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw Zh(t,e);return`[${P(e).elements.map(e=>tg(e,t)).join(`,`)}]`},eg=(e,t)=>{let n=I(e),r=Sr(n);return r?`[${r.map(e=>tg(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Qh(typeof e==`string`?e:L(e))}:${tg(n.range[r],t)}`).join(`,`)}}`},tg=(e,t)=>typeof e==`string`?Qh(e):typeof e==`object`?e.kind===`ModelValue`?Qh(e.name):A(e)?$h(e,t):eg(e,t):String(e),ng=e=>{if(A(e))return $h(e,Wh);if(!j(e)||Xh(e))throw Zh(Wh,e);return eg(e,Wh)},rg=e=>{if(!j(e))throw Zh(Gh,e);return eg(e,Gh)},ig=e=>{let[,t,n=`0`,r=``,i=`0`]=/^(-?)(\d+)(?:\.(\d*))?(?:[eE]([+-]?\d+))?$/.exec(e)??[],a=BigInt(n+r),o=Number(i)-r.length,s=o>=0?a*10n**BigInt(o):a/10n**BigInt(-o);return Number(BigInt.asIntN(32,t===`-`?-s:s))},ag=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Tt(e);if(Array.isArray(e))return Yn(e.map(e=>ag(e,t)));if(typeof e==`object`&&e)return Xn(Object.entries(e).map(([e,n])=>[Tt(e),ag(n,t)]));throw Ri(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},og=(e,t)=>{if(e.trim()===``)return ag(null,t);try{return ag(JSON.parse(e,(e,t,n)=>typeof t==`number`?ig(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Ri(t,e.message):e}},sg=(e,t)=>{if(typeof e!=`string`)throw Ri(t,`Cannot cast tlc2.value.impl.${Ii(e)} to tlc2.value.impl.StringValue`);return e},cg=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Ri(n,`${t} (No such file or directory)`);return r},lg=e=>[Oi(`ToJson`,1,e=>Tt(tg(R(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Oi(`ToJsonArray`,1,e=>Tt(ng(R(e,0,`ToJsonArray`)))),Oi(`ToJsonObject`,1,e=>Tt(rg(R(e,0,`ToJsonObject`)))),Oi(`JsonSerialize`,2,t=>{let n=sg(R(t,0,`JsonSerialize`),Kh),r=R(t,1,`JsonSerialize`);if(!Sr(r)&&!Xh(r))throw gi(`second`,`JsonSerialize`,`sequence or record`,r);return e.writeFile?.(n,tg(r,Kh)),!0}),Oi(`ndJsonSerialize`,2,t=>{let n=sg(R(t,0,`ndJsonSerialize`),qh),r=R(t,1,`ndJsonSerialize`),i=Sr(r);if(!i)throw gi(`second`,`ndJsonSerialize`,`sequence`,r);return e.writeFile?.(n,i.map(e=>`${tg(e,qh)}\n`).join(``)),!0}),Oi(`JsonDeserialize`,1,t=>{let n=sg(R(t,0,`JsonDeserialize`),Jh);return og(cg(e,n,Jh),Jh)}),Oi(`ndJsonDeserialize`,1,t=>{let n=sg(R(t,0,`ndJsonDeserialize`),Yh);return Yn(cg(e,n,Yh).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>og(e,Yh)))})],ug=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,dg=1e6,fg=(e,t,n)=>{if(typeof e!=`number`||e<0)throw gi(t,n,`nonnegative integer`,e);return e},pg=(e,t,n,r)=>Mn(Array.from({length:t},()=>Mn(e.filter(()=>r.nextDouble()<n)))),mg=(e,t)=>{let n=`RandomSetOfSubsets`,r=fg(R(e,0,n),`first`,n),i=fg(R(e,1,n),`second`,n),a=R(e,2,n);if(!A(a)||!N(a))throw gi(`third`,n,`finite set`,a);let o=P(a).elements;if(o.length<31&&r>2**o.length)throw gi(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw gi(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return pg(o,r,o.length===0?0:i/o.length,t.getRandom())},hg=e=>[Oi(`RandomSubset`,2,t=>{let n=R(t,0,`RandomSubset`);if(typeof n!=`number`)throw gi(`first`,`RandomSubset`,`nonnegative integer`,n);if(n<0)throw Ri(ug,String(n));let r=R(t,1,`RandomSubset`);if(!A(r)||!F(r)&&!N(r))throw gi(`second`,`RandomSubset`,`a finite set`,r);let i=ph(r,e.version);if(i&&i.reduce((e,t)=>e*P(t).elements.length,1)>dg)throw Ri(ug,`Attempted to construct a set with too many elements (>${dg}).`);return Mn(mh(n,r,e.getRandom(),e.version))}),Oi(`RandomSetOfSubsets`,3,t=>mg(t,e)),Oi(`TestRandomSetOfSubsets`,3,t=>Yn(Array.from({length:5},()=>P(mg(t,e)).elements.length)))],gg=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,_g=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${gg})`,vg=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${gg}) throws java.io.IOException`,yg=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${gg})`,bg=e=>Xn([[`name`,e??`UnnamedAction`],[`location`,Xn([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),xg=(e,t,n)=>{let r=e.map((e,t)=>Yn([t+1,Xn(Object.entries(e))])),i=r.slice(1).map((e,n)=>Yn([r[n],t[n],e])),a=n?[Yn([r[r.length-1],n.action,r[n.start]])]:[];return Xn([[`action`,Mn([...i,...a])],[`state`,Mn(r)]])},Sg=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return yh(e).get(t)},Cg=(e,t,r,i)=>{if(typeof r==`number`&&r>=0)e.registers.set(r,i);else if(r===`exit`)i===!0&&(e.isStopped=!0);else if(r===`pause`){if(i!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))e.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))e.properties.set(r.slice(2),L(i));else throw new n(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${L(r)}`)},wg=e=>e.every(e=>e!==void 0),Tg=(e,t)=>Xn(t.variables.map((t,n)=>[t,e[n]])),Eg=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(e.kind===`Prime`||e.kind===`Unchanged`)return!0;if(r!==void 0&&!k(e)){if(t.variableIndex.has(r))return!0;let e=Ru(r,t);if(e&&!n.has(e)&&(n.add(e),Eg(e.body,t,n)))return!0}return Je(e).some(e=>Eg(e,t,n))},Dg=(e,t)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[z(`AssertEq`,2,t=>{let n=R(t,0,`AssertEq`),r=R(t,1,`AssertEq`),i=Xt(n,r);return i||(e(L(`Assertion failed`,!0)),e(L(n,!0)),e(L(r,!0))),i}),Gi(`AssertError`,2,e=>{let n=Ti(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw Ri(_g,`In computing AssertError, a non-string expression (line ${n.location.line}, col ${n.location.column}) was used as the err of an AssertError(err, exp).`);let r=Ki(e,0,`AssertError`)();try{Ki(e,1,`AssertError`)()}catch(e){if(e instanceof m)return xa(e.message,t.isTool)===r;throw e}return!1}),Oi(`TLCGetOrDefault`,2,e=>{let n=R(e,0,`TLCGetOrDefault`);return Sg(t,n)??R(e,1,`TLCGetOrDefault`)}),{...Di(`TLCGetAndSet`,4,n=>{let r=R(n,0,`TLCGetAndSet`),i=Sg(t,r)??R(n,3,`TLCGetAndSet`),a=Ti(n,1,`TLCGetAndSet`);return Cg(t,e,r,a.call([i,R(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Oi(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!wg(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Ri(vg,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return Yn(t.getBehavior(r).map(e=>Tg(e,n.environment)))}),Oi(`CounterExample`,0,()=>t.counterExample??Xn([[`action`,Mn([])],[`state`,Mn([])]])),z(`ToTrace`,1,e=>{let t=R(e,0,`ToTrace`);if(!j(t)||!Xt(zr(t),Mn([`action`,`state`])))throw new m(`The argument of ToTrace should be a CounterExample, but instead it is:\n${L(t)}`);let n=P(Lr(t,`state`)).elements.map(e=>Sr(e)??[]);return Yn(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,e=>{let t=R(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new n(`The argument of ModelValue should be a string, but instead it is:\n${L(t)}`);return Lt(t)}),Gi(`TLCDefer`,1,()=>!0),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),Gi(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!wg(r))throw Ri(yg,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||Lu(Ki(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new _(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Gi(`TLCCache`,2,(e,t)=>{let n=Ti(e,0,`TLCCache`),i=ii(Ki(e,1,`TLCCache`)()),o=n.expression;if(!o||!t)return n.call([]);let s=Eg(o,t.environment,/* @__PURE__ */ new Set)&&t.state?a(t.state):r,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(i);if(l!==void 0)return l;let u=n.call([]);return c.set(i,u),u}),z(`TLCFP`,1,e=>Number(BigInt.asIntN(32,Ym([R(e,0,`TLCFP`)])))),Oi(`TLCEvalDefinition`,1,(e,t)=>{let r=R(e,0,`TLCEvalDefinition`),i=typeof r==`string`&&t?Ru(r,t.environment):void 0;if(!i||typeof r!=`string`||!t)throw new n(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${L(r)}`);if(i.kind===`Operator`&&i.params.length>0)throw new n(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${r}`);return H({kind:`Identifier`,name:r,location:i.location},t)})]},Og=(e,t)=>[Oi(`_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}),Oi(`_Counts`,0,()=>vh(t)),Oi(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(vh(t),!0)),!1)}),Oi(`_PrintCounts`,0,()=>(e(L(vh(t),!0)),!0))],kg=e=>String(e).padStart(2,`0`),Ag=e=>`${e.getUTCFullYear()}.${kg(e.getUTCMonth()+1)}.${kg(e.getUTCDate())}.${kg(e.getUTCHours())}${kg(e.getUTCMinutes())}${kg(e.getUTCSeconds())}`,jg=e=>Rn([...e].map(([e,t])=>[e,Yn([t])])),Mg=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Ng=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Pg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Fg=(e,t,r)=>{if(e.version===`1.7.4`?!Ng.has(t)||!e.isStarted&&Pg.has(t):!e.isStarted&&Mg.has(t))throw new n(`TLCGet(${t}) was undefined.`);let i=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return r===void 0?0:e.getLevel(r);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return i;case`stats`:return Xn([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,i],[`worker`,0]]);case`config`:return Xn([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Xn([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Tt(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Tt(Ag(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return bg(void 0);case`all`:return jg(e.registers);case`all:named`:return jg(yh(e))}if(t.startsWith(`s:`)){let r=yh(e).get(t);if(r===void 0)throw new n(`TLCGet(${t}) was undefined.`);return r}if(t.startsWith(`-D`))return Tt(e.properties.get(t.slice(2))??t);throw new n(`TLCGet(${t}) was undefined.`)},Ig=(e,t,r)=>{if(typeof t==`number`&&t>=0){let r=e.registers.get(t);if(r===void 0)throw new n(`TLCGet(${t}) was undefined.`);return r}if(typeof t!=`string`)throw new n(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${L(t)}`);return Fg(e,t,r?.state)},Lg=e=>e.length===0?[[]]:e.flatMap((t,n)=>Lg([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Rg=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&P(e).elements.forEach(Rg),e.kind===`Function`&&e.range.forEach(Rg))},zg=(e,t)=>[z(`Print`,2,t=>(e(`${it(L(R(t,0,`Print`),!0,!0))} ${it(L(R(t,1,`Print`),!0,!0))}`),R(t,1,`Print`))),z(`PrintT`,1,t=>(e(it(L(R(t,0,`PrintT`),!0,!0))),!0)),z(`Assert`,2,e=>{if(R(e,0,`Assert`)!==!0)throw new n(`The first argument of Assert evaluated to FALSE; the second argument was:\n${it(L(R(e,1,`Assert`)))}`,a.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>Rn([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=wi(e,0,`@@`),n=wi(e,1,`@@`);return zn([...ft(t),...ft(n)])}),z(`ToString`,1,e=>Tt(L(R(e,0,`ToString`),!0))),z(`TLCEval`,1,e=>{let t=R(e,0,`TLCEval`);return Rg(t),t}),z(`Permutations`,1,e=>{let t=Si(e,0,`Permutations`);return Mn(Lg(t).map(e=>Rn(t.map((t,n)=>[t,e[n]]))))}),Di(`SortSeq`,2,e=>{let t=Ti(e,1,`SortSeq`);return Yn(Ci(e,0,`SortSeq`).reduce((e,n)=>{let r=e.findIndex(e=>t.call([n,e])===!0);return r===-1?[...e,n]:[...e.slice(0,r),n,...e.slice(r)]},[]))}),t.version===`1.7.4`?zi({...Oi(`TLCGet`,1,(e,n)=>Ig(t,R(e,0,`TLCGet`),n)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):zi(Gi(`TLCGet`,1,(e,n)=>Ig(t,Ki(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)`),Oi(`TLCSet`,2,n=>{let r=R(n,0,`TLCSet`);return Cg(t,e,r,R(n,1,`TLCSet`)),!0}),Ei(`Any`,Nt),z(`RandomElement`,1,e=>gh(xi(e,0,`RandomElement`),t.getRandom()))],Bg=(e,t)=>e.every(e=>Er(e,t)),Vg=Mn([!1,!0]),Hg=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Ln(Hg(e,t,r),Hg(e,r,n))},Ug=[`\\cup`,`\\cap`,`\\`],Wg=e=>typeof e==`object`&&e.kind===`MixedSet`,Gg=(e,t,n)=>{let r=t.kind===`Interval`?P(t).elements:t.elements;if(e!==`\\cup`){let t=e===`\\cap`;return Nn(r.filter(e=>Er(e,n)===t))}if(r.length===0)return n;if(!ot(n))return Kt({kind:`SetOperation`,operator:e,left:t,right:n});let i=P(n).elements.filter(e=>!Er(e,t));return Nn([...r,...i])},Kg=[Ei(`TRUE`,!0),Ei(`FALSE`,!1),Ei(`BOOLEAN`,Vg),Ei(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ki(`=`,An),ki(`#`,(e,t)=>!An(e,t)),z(`~`,1,e=>!yi(e,0,`~`)),z(`<=>`,2,e=>yi(e,0,`<=>`)===yi(e,1,`<=>`)),z(`/\\`,2,e=>yi(e,0,`/\\`)&&yi(e,1,`/\\`)),z(`\\/`,2,e=>yi(e,0,`\\/`)||yi(e,1,`\\/`)),z(`=>`,2,e=>!yi(e,0,`=>`)||yi(e,1,`=>`)),z(`\\in`,2,e=>Er(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!Er(R(e,0,`\\notin`),R(e,1,`\\notin`))),z(`\\subseteq`,2,e=>{let t=bi(e,0,`\\subseteq`),n=R(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&N(t.base)?Bg(P(t.base).elements,n.base):Bg(P(t).elements,n)}),...Ug.map(e=>z(e,2,t=>{let n=R(t,0,e),r=R(t,1,e);if(ot(n)&&ot(r)&&!Wg(n)&&!Wg(r)){if(e===`\\cup`&&F(n))return r;let t=e===`\\cup`?Ln:e===`\\cap`?In:Fn;return Tr((e,n)=>t(P(e),P(n)),(t,n)=>Gg(e,t,n),n,r)}return ot(n)?Gg(e,n,r):e!==`\\`&&ot(r)?Gg(e,r,n):Kt({kind:`SetOperation`,operator:e,left:n,right:r})})),z(`SUBSET`,1,e=>({kind:`Subset`,base:R(e,0,`SUBSET`)})),z(`UNION`,1,e=>{let t=bi(e,0,`UNION`),n=st(t)?t.elements.filter(st):[];if(!st(t)||n.length!==t.elements.length)return Kt({kind:`Union`,base:t});if(Wg(t)||n.some(Wg)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{Er(t,e)||e.elements.push(t)})),Nn(e.elements)}return n.length===0?Pn:Hg(n.map(P),0,n.length)}),z(`DOMAIN`,1,e=>{let t=R(e,0,`DOMAIN`);if(!j(t))throw new m(`DOMAIN expects a function but received ${L(t)}`);return zr(t)})],qg=Vi(`Integers`,`Neg`,`IntValue`,1),Jg=e=>{let t=Vi(e,`DotDot`,`IntervalValue`,2);return[Hi(e,`+`,`Plus`,(e,t)=>e+t),Hi(e,`-`,`Minus`,(e,t)=>e-t),Hi(e,`*`,`Times`,(e,t)=>e*t),Hi(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new n(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new n(`0^0 is undefined.`);return e**t}),Hi(e,`\\div`,`Divide`,(t,r)=>{if(r===0)throw new n(`The second argument of \\div is 0.`);if(e===`Naturals`){let e=Math.trunc(t/r)|0;return e<0&&Math.imul(e,r)!==t?e-1:e}let i=Math.floor(t/r);if(Ai(i))throw ji(`${t} \\div ${r}`);return i}),Hi(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new n(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),z(`..`,2,e=>({kind:`Interval`,low:Bi(R(e,0,`..`),t),high:Bi(R(e,1,`..`),t)}))]},Yg=Jg(`Naturals`),Xg=Jg(`Integers`),Zg=e=>{let t=Yg.indexOf(e);return t===-1?void 0:Xg[t]},Qg=[Ei(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Yg,Wi(`<`,(e,t)=>e<t),Wi(`>`,(e,t)=>e>t),Wi(`<=`,(e,t)=>e<=t),Wi(`>=`,(e,t)=>e>=t,`>`)],$g=[Ei(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Xg,Wi(`>=`,(e,t)=>e>=t),z(`-.`,1,e=>{let t=Bi(R(e,0,`-`),qg);if(Ai(-t))throw ji(`-${t}`);return-t})],e_=(e,t,r)=>{let i=R(e,t,r),a=Sr(i);if(!a)throw new n(`${r}\n${L(i)}`);return a},t_=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:e_(e,t,n)},n_=(e,t,n)=>typeof e==`string`?Tt(e.slice(t,n)):Yn(e.slice(t,n)),r_=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,i_=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,a_=(e,t)=>{let n=Af.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?zi(e,t):e}):t},o_=e=>a_(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>t_(e,0,r_(``,`Len`)).length),z(`\\o`,2,e=>{let t=t_(e,0,i_(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=e_(e,1,i_(`t \\o s`,`sequence`));return Yn([...t,...n])}let r=R(e,1,`\\o`);if(typeof r!=`string`)throw new n(`${i_(`t \\o s`,`string`)}\n${L(r)}`);return Tt(t+r)}),z(`Append`,2,t=>Yn([...e_(t,0,i_(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(t,1,`Append`)])),z(`Head`,1,e=>{let t=e_(e,0,r_(``,`Head`));if(t.length===0)throw new n(`Attempted to apply Head to the empty sequence.`);return t[0]}),z(`Tail`,1,e=>{let t=t_(e,0,r_(``,`Tail`));if(t.length===0)throw new n(`Attempted to apply Tail to the empty sequence.`);return n_(t,1)}),z(`SubSeq`,3,e=>{let t=t_(e,0,r_(`first `,`SubSeq`)),r=vi(e,1,`SubSeq`),i=vi(e,2,`SubSeq`);if(r>i)return n_(t,0,0);let a=r<1||r>t.length?{position:`second`,value:r}:i>t.length?{position:`third`,value:i}:void 0;if(a)throw new n(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${L(R(e,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return n_(t,r-1,i)}),Di(`SelectSeq`,2,e=>{let t=Ti(e,1,`SelectSeq`);return Yn(e_(e,0,r_(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw gi(`second`,`SelectSeq`,`operator`,n);return n}))})]),s_=e=>a_(`FiniteSets`,[z(`IsFiniteSet`,1,e=>{let t=R(e,0,`IsFiniteSet`);if(A(t))return br(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new m(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${L(t)}\nis a finite set.`:`Attempted to check if the ${ct(t)} ${L(t)} is a finite set.`)}),z(`Cardinality`,1,t=>{let r=R(t,0,`Cardinality`);if(!A(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new n(`Attempted to compute cardinality of the value\n${L(r)}`);return vr(r,e)})]),c_=/* @__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`]]]),l_=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:Qg};case`Integers`:return{extends:[`Naturals`],operators:$g};case`Sequences`:return{extends:[],operators:o_(n.version)};case`FiniteSets`:return{extends:[],operators:s_(n.version)};case`TLC`:return{extends:[],operators:a_(`TLC`,zg(t,n))};case`Randomization`:return{extends:[],operators:hg(n)};case`_Possible`:return{extends:[],operators:Og(t,n)};case`Json`:return{extends:[],operators:lg(r)};case`Bags`:return{extends:[],operators:Uh(i)};case`TLCExt`:return{extends:[],operators:Dg(t,n)};default:return}},u_=`$subexpression`,d_=(e,t)=>new l(`${e} at line ${t.line}, column ${t.column}`),f_=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return f_(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of Je(e)){let e=f_(r,t,n);if(e)return e}},p_=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),m_=(e,t)=>{let n=e.location,r=p_(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 d_(`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 d_(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:u_,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:u_,args:e.args,location:n,resolution:Ia},location:n}},h_=(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:Ia})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Ia}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Ia};return m_({...t,params:[...t.params,...r]},a)},g_=(e,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s={index:0,current:void 0,isFailed:!1},c=(n,i)=>{if(!n)throw d_(i,a);Ra.set(r,{args:e.slice(0,s.index).flatMap(e=>`args`in e?e.args:[]),error:{location:t(n),message:i}}),s.isFailed=!0},l=t=>{let r=[],i=[];for(;s.index<e.length;){let o=e[s.index];if(o.kind!==`Name`)throw d_(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=t?t.find(e=>as(e)===c):n(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s.index++}throw d_(`Unknown operator ${r.join(`!`)}`,a)},u=t=>{let n=l(t),u=n.definition,d=Ua(u),f=s.index===e.length-1;if(n.args.length!==d&&(!i||n.args.length!==0))return c(r.argumentRanges?.[s.index]??a.range,`The operator ${n.name} requires ${d-n.earlier} arguments.`);if(f)return{definition:u,args:n.args};if(u.kind!==`Operator`)throw d_(`Cannot select a subexpression of ${u.name}`,a);o.params.push(...u.params),o.args.push(...n.args),s.current=u.body,s.index++},d=()=>{for(;s.index<e.length&&!s.isFailed;){let t=e[s.index];if(t.kind!==`Name`)return;let n=r.selectorRanges?.[s.index],a=s.current&&f_(s.current,t.name,[]);if(!a)return c(n,`Cannot find label \`${t.name}'.`);let l=a.label.params;if(!i&&t.args.length!==l.length)return c(n,`Label \`${t.name}' used with wrong number of arguments.`);o.lets.push(...a.lets),o.params.push(...l.map(e=>({name:e,arity:0}))),o.args.push(...t.args),s.current=a.label.body,s.index++}},f=t=>{let n=s.current;if(!n)throw d_(`Subexpression selection failed`,a);if(t.kind===`Colon`)return;if(n.kind===`Label`){s.current=n.body,f(t);return}if(n.kind===`Let`){if(t.kind!==`Operand`||uo(t.operand,1)!==0)throw d_(`A LET/IN expression has only one operand`,a);o.lets.push(n.definitions),s.current=n.body;return}let r=ho(n);if(r&&(t.kind===`Bound`||t.kind===`At`)){o.params.push(...r.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&o.args.push(...t.args),s.current=r.body;return}if(n.kind===`Case`&&t.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],i=r[uo(t.operand,r.length)],o=e[s.index+1];if(!i||o?.kind!==`Operand`)throw d_(`A subexpression of CASE must have the form !i!j`,a);s.index++;let c=uo(o.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw d_(`Nonexistent CASE operand`,a);s.current=l;return}if(t.kind!==`Operand`)throw d_(`Unexpected subexpression selector`,a);let i=r?r.sets:go(n),c=i?.[uo(t.operand,i.length)];if(!c)throw d_(`Nonexistent operand specified by the selector`,a);s.current=c},p=u(void 0);if(s.isFailed)return r;if(p)return h_(p.definition,{...o,args:p.args});for(d();s.index<e.length&&!s.isFailed;){let t=e[s.index];if(t.kind===`Name`){for(;s.current?.kind===`Label`;)s.current=s.current.body;if(s.current?.kind!==`Let`)throw d_(`A name selector here must be from a LET clause`,a);o.lets.push(s.current.definitions);let e=u(s.current.definitions);if(s.isFailed)return r;if(e)return h_(e.definition,{...o,args:[...o.args,...e.args]});d()}else f(t),s.index++}if(s.isFailed)return r;if(!s.current)throw d_(`Subexpression selection failed`,a);return m_(o,s.current)},__=(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 fo(e,t,n)},v_=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Je(e).some(v_),y_=(e,t,n,r=!1)=>{if(!v_(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=cs(e,e=>y_(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)=>y_(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:cs(e,e=>y_(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?__(a.name,[],void 0,t):a.kind===`Apply`?__(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=g_(o,t,a,r);return c!==a&&La.add(c),c},b_=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:y_(e.expression,t,n,!0)}))}),x_=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},S_=(e,t)=>b_(e,x_(t.definitions),()=>!1),C_=(e,t)=>{let n=x_([...t,...e.definitions]),r=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),i=e=>r.has(e),a=e=>y_(e,n,i),o=e=>i(e)||!n(e),s=e=>y_(e,n,o),c=e=>e.map(e=>e.kind===`ModuleFact`?e:s(e)),l=e=>e.map(e=>({...e,set:s(e.set)})),u=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&s(e.set)}:u(e)),conclusion:s(e.conclusion)}:s(e),d=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:c(e.facts)};case`Instance`:return b_(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?b_(e,n,o):ss(e,s))};case`Have`:case`Case`:return{...e,expression:s(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(s)};case`Take`:return{...e,bounds:l(e.bounds)};case`Pick`:return{...e,bounds:l(e.bounds),body:s(e.body)};case`Assert`:return{...e,statement:u(e.statement)};default:return e}},f=e=>e?.kind===`By`?{...e,facts:c(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:d(e.body),proof:f(e.proof)}))}:e,p={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:u(e.statement),proof:f(e.proof)})),uses:e.uses.map(e=>({...e,facts:c(e.facts)}))};return e.definitions.some(e=>v_(e.body))||e.assumptions.some(e=>v_(e.expression))?{...p,definitions:e.definitions.map(e=>ss(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},w_=(e,t)=>e.maxLevels[t]??3,T_=e=>{let n=/* @__PURE__ */ new Map,r=t=>{let r=n.get(t);if(r)return r;let i=e(t),a=mc({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(t,a),a},i=/* @__PURE__ */ new Map,a=t=>{let n=i.get(t);if(n)return n;let a=e(t),o=r(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=>Gs(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Gs(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ks(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Hs(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)&&Gs(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(hc(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),i.set(t,c),c};return n=>{let i=/* @__PURE__ */ new Map,o=t(n.location.range??{module:n.instancer,start:n.location,end:n.location}),s=e=>i.set(`${o}\n${e}`,{location:o,message:e}),l=e(n.module),u=a(n.module),d=r(n.instancer),f=/* @__PURE__ */ new Map;n.lets.forEach(e=>f.set(e.name,{kind:`Let`,definition:e,scope:f}));let p=[...l.constants.map(e=>({...e,maximumLevel:0})),...l.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let t=n.substitutions.get(e.name);if(!t)return[];if(e.arity===0){let n=d.analyze(t,f);return[{...e,level:n.level,operator:void 0,isLeibniz:!0}]}let r=d.toOperand(t,f);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),m=(e,t)=>`Level error in instantiating module '${n.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${t}.`;if(p.forEach(e=>{!u.isConstant&&e.level>e.maximumLevel&&s(m(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${n.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),p.forEach(e=>{let t=u.constraints.get(e.name);t!==void 0&&e.level>t&&s(m(e.name,t));let r=e.operator;r&&Array.from({length:e.arity},(t,i)=>{let a=u.argConstraints.get(Bs(e.name,i));a!==void 0&&w_(r,i)<a&&s(`Level error in instantiating module '${n.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),u.argParams.forEach(e=>{let t=Hs(e),r=p.find(e=>e.name===t.operator)?.operator,i=p.find(e=>e.name===t.param);if(!r||!i)return;let a=w_(r,t.index);i.level>a&&s(`Level error when instantiating module '${n.module}':\nThe level of the argument ${t.index} of the operator ${t.operator}' \nmust be at most ${a}.`)}),i.size>0)throw c([...i.values()])}},E_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],D_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),O_=new Map(wf.flatMap(e=>e.map(t=>[t,e[0]]))),k_=e=>O_.get(e)??e,A_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},j_=()=>{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}}},M_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:A_(e)&2147483647,kind:t,isLocal:n}),N_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:k_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:k_(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}},P_=(e,t)=>{let n=[];for(let r=t;;){let t=N_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},F_=e=>({line:e.line,column:e.column}),I_=(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=P_(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},L_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,R_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},z_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&L_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&L_(e[n+1],e[n+2])?n+=L_(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=>R_[e])}"`:r.text)}return t},B_=e=>e[2]?.text,V_=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},H_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>H_(e.modules,t)).find(Boolean),U_=e=>{let t=e===void 0?[]:be(e),n={module:void 0};return{tokens:t,ranges:V_(t),getModule:()=>n.module??=e===void 0?wm(``):Tm(e,t)}},W_=(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=U_(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:(Of.has(i)?t?.(i):void 0)??kf.get(i)??t?.(i)??Sm(e,i),{tokens:c,ranges:l,getModule:u}=a(s),d=l.get(B_(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:()=>H_(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()}},G_=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=P_(t,e+1);i.push({location:F_(t[e]),apply:e=>r.forEach(t=>e.put(M_(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,r)=>{let l=e.start+r,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;i.push({location:F_(u),apply:t=>t.put(M_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&o(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&o(l,`variable`),u.text===`RECURSIVE`&&P_(t,l+1).every(e=>s.has(e))&&o(l,`definition`),D_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(a.push(F_(u)),i.push({location:F_(u),apply:e=>e.put(M_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(M_(t,`theorem`,!1))})});let l=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=k_(e.name);i.push({location:e.location,apply:n=>n.put(M_(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(M_(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(M_(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>Ha(e.location,t.location)?-1:+!!Ha(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=j_();n.set(i??``,o),Cf.toReversed().forEach(e=>o.put(M_(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)}}},K_=(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)}),Tf.forEach(r);let a=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},o=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=I_(a(e),e,o);return c.set(e,n),n},u=e=>o.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>o.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),g=m(e=>e.instances),_=/* @__PURE__ */ new Set([void 0]),v=/* @__PURE__ */ new Map;z_(a(void 0)).forEach((e,t)=>{t===3&&Df.forEach(r),r(e)});let y=l(void 0);for(;;){let t=h(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!t)break;let[n,i]=t;if(d.add(`${n.key}>${i}`),v.set(n.unit,[...v.get(n.unit)??[],i]),!_.has(i)){if(_.add(i),e(i).tokens.length===0){let t=n.unit??B_(e(void 0).tokens);throw s(i,t)}z_(a(i)).forEach(r)}}E_.forEach(r);let b=/* @__PURE__ */ new Set,ee=e=>{if(b.has(e))return;b.add(e);let t=v.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(ee),a(e).forEach(e=>{e.kind===`String`&&r(e.text)})};return ee(void 0),Ef.forEach(r),[...n]},q_=(e,t)=>{let n=W_(e,t),r=n.getParsed,i,a=()=>i??=G_(r);return{getStringOrder:e=>K_(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)}}},J_=e=>{switch(e.kind){case`Number`:if(!lt(e.value))throw v(new n(`Integer overflow: ${e.value} is outside TLC's 32-bit range`),a.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return Lt(e.name);case`Set`:return Mn(e.elements.map(J_))}},Y_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],X_=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof l))throw n;let r=Xp(e);throw r===void 0?n:c([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},Z_=e=>new l(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),Q_=(e,n)=>e.location.range&&n.location.range&&{location:t(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${t(n.location.range)}.`},$_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,ev=e=>e===`Theorem`?`ThmOrAssumpDefNode`:$_(e),tv=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:Ts(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),nv=(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 m(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&Xt(t,r)})});if(t)return t[1];throw new m(`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}},rv=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||Je(e).some(e=>rv(e,t)),iv=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(bs(e),n.get(e)??n.size)),n},av=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),ov=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Eu(e);if(e.kind===`Number`&&!lt(e.value))throw Du(e);ov(e.kind===`Let`?[...Je(e),...av(e.instances??[])]:Je(e))}),sv=(e,n)=>{let r=n.order??q_(n.source,n.loadModule),i=r.parseModule(n.source),a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Map,d=/* @__PURE__ */ new Set,p=new Map(Kg.map(e=>[e.name,e])),h=/* @__PURE__ */ new Map,_=_h(e.checkDeadlock,n.seed);_.isWarningEnabled=n.isWarningEnabled??!0,_.isTool=n.isTool??!1,_.version=n.version??`master`;let v=/* @__PURE__ */ new Map,y=/* @__PURE__ */ new Map,b=/* @__PURE__ */ new Map,ee=[],x=/* @__PURE__ */ new Map,te=[],ne=[],re=(e,t)=>te.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ie={value:0},ae=e=>`${e}#${ie.value++}`,oe=[],se=[],ce=T_(e=>{let t=b.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,S=e=>{let t=h.get(e);if(t)return t;let r=l_(e,n.print,_,n.files,p);if(!r)return;c_.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=>{p.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Ls.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:zs(e,t.name)??i.get(t.name)?.range})}),h.set(e,i),i},C=e=>{if(Of.has(e)&&n.loadModule?.(e)!==void 0)return;let t=S(e),r=c_.get(e)??[];return t&&re(e,r),t&&r.includes(`Integers`)&&S(`Integers`),t},w=e=>(ov([...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]),...av(e.instances)]),e.modules.forEach(w),e);w(i);let T=(e,t)=>{let i=n.loadModule?.(e)??Qe.get(e)??Sm(n.source,e);if(i===void 0)throw s(e,t);let a=X_(i,e,r);if(a.name!==e)throw c([{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)},fe=e=>{let t=ne.indexOf(e.name);if(t!==-1){let n=[...ne.slice(t),e.name].map(e=>`${e}.tla`);throw new l(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];ne.push(e.name),te.push(n);let o=Se(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:se,levelChecks:a});if(te.pop(),ne.pop(),i.length>0)throw c(i,!1,void 0,se);let s=r.find(e=>n.has(e.name)),u=s&&v.get(s.name),d=u&&Q_(s,u.module);if(d)throw c([d],!1,void 0,se);if(s)throw Z_(s);return a.forEach(e=>e()),{linked:o,closure:n}},pe=(e,t)=>{let r=v.get(e);if(r)return re(e,x.get(e)??[]),r;let i=fe(T(e,t));return(Ch(_.version).has(e)?l_(e,n.print,_,n.files,p):void 0)?.operators.forEach(e=>{let t=i.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(p.set(t.key,e),a.delete(t.key))}),v.set(e,i.linked),x.set(e,i.closure),re(e,i.closure),i.linked},me=(e,t,n,r,i)=>{let s=i?void 0:C(e.module);if(s)return he(e,s);let c=i??pe(e.module,t.name);c.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let l=Y_(c),f=`#${ie.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=Qo(S_(e,t),l,t,n);oe.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=Ms({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,ns(t,p)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>o.get(e)===!0,addDefinition:(n,i,s)=>{let c=ae(`${i}@${t.name}`),f=s(c);return a.set(c,f),l.length>0&&d.add(f),e.name!==void 0&&ue.set(c,`${e.name}!${ue.get(n)??i}`),o.set(c,!r),u.set(c,{source:n,prefix:e.params.length}),c},createName:ae});return ge(e,c.exported,l,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return l.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:o.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},_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:Es(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:Es(r,n),location:n}}},E=(e,t,n,r)=>{let i=e.location,s=r?void 0:C(e.module);if(s)return e.name===void 0?[]:[...s].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.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=Y_(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=>rv(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=[],_=Ms({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:Es(e.params,i),location:i,resolution:Ia}:Ts(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>o.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:tv(a,i)),i},createName:ae}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),a=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,...y]},be=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),xe=/* @__PURE__ */ new Map,Se=(e,r)=>{let s=Sf(e,n.loadClass?.(e.name),e===i);xe.set(e.name,s.overrides);let c=s.module,l=oe.length,u=new Map([...Kg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:qo,errors:[],warnings:[]},p=[f],m=e=>e.forEach((e,n)=>{let r=h.get(n);if(!r){u.set(n,e),h.set(n,e);return}if(!r.range||!e.range||t(r.range)===t(e.range))return;let i=t(e.range),a=t(r.range);ev(r.kind)===ev(e.kind)?f.warnings.push({location:i,message:`Warning: the ${$_(r.kind)} of '${n}' conflicts with \nits ${$_(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${$_(e.kind)} of '${n}' conflicts with \nits ${$_(r.kind)} at ${a}.`})}),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Set,_=/* @__PURE__ */ new Map,v=[],x=[...c.constants],te=c.variables.map(e=>e.name),ne=c.variables.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:C(e);if(n){m(n);return}let i=t??pe(e,c.name);x.push(...i.constants.filter(e=>x.every(t=>t.name!==e.name))),i.variables.forEach((e,t)=>{te.includes(e)||(te.push(e),ne.push(i.variableLocations[t]))}),m(i.exported),i.facts.forEach(e=>g.add(e)),i.modules.forEach((e,t)=>_.set(t,e)),v.push(i)});let re=new Map(u),ie=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],ae=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});ie.forEach(e=>h.set(e.name,ae(e)));let le=e=>({key:S(e),arity:Ua(e),params:Wa(e),kind:Jo(c,e)?`Theorem`:`Definition`,range:e.location.range}),ue=x.length===0&&te.length===0,S=e=>c===i?e.name:`${e.name}@${r.id}`,w=/* @__PURE__ */ new Map,T=()=>new Map([...r.modules,..._]),fe=e=>{let t=c.instances.find(t=>t.module===e.name);return t!==void 0&&Ha(e.location,t.location)},_e=e=>{let t=c.modules.find(t=>t.name===e.module);return t?fe(t)?_.get(t.name):void 0:T().get(e.module)},ve=e=>({imported:u,getInstance:e=>{let t=_e(e),n=t?void 0:C(e.module);if(n)return{declarations:[],symbols:he(e,n),instancer:c.name};let r=t??pe(e.module,c.name),i=Y_(r);return{declarations:i,symbols:ge(e,r.exported,i,e=>e),instancer:c.name}},bound:re,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:S,instanced:w,facts:g,reports:p,warnings:r.warnings}),ye=e=>[...ie.filter(t=>Ha(t.location,e)).map(e=>[e.name,ae(e)]),...c.definitions.filter(t=>Ha(t.location,e)).map(e=>[e.name,le(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(u)),Ce=e=>{let t=T(),n=t.get(e.name),i=n&&Q_(e,n.module);if(n&&!i)throw Z_(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};p.push(a);let o=Se(e,{id:`${r.id}/${e.name}`,symbols:ye(e.location),modules:t,nested:r.nested,errors:a.errors,warnings:a.warnings,levelChecks:r.levelChecks});i&&a.errors.push(i),n||_.set(e.name,o),y.has(e.name)||y.set(e.name,o)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=me(e,c,ve(c),ue,T().get(e.module));w.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||h.set(n,t))})}})),...c.modules.map(e=>({location:e.location,link:()=>Ce(e)}))].sort((e,t)=>Ha(e.location,t.location)?-1:1).forEach(e=>e.link());let D=C_(Is(c,(e,t)=>E(e,t,c.name,_e(e))),be(u));r.errors.push(...es(D,ve(D))),D.definitions.forEach(e=>{let t=S(e);a.set(t,e),o.set(t,!ue);let n=le(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!Ha(r,e.location))&&(u.set(e.name,n),e.isLocal||h.set(e.name,n))});let we={module:D,constants:x,variables:te,variableLocations:ne,visible:u,exported:h,modules:_,extended:v,facts:/* @__PURE__ */ new Set([...g,...[...D.theorems,...D.assumptions].flatMap(e=>e.name??[])])};b.has(c.name)||b.set(c.name,we);let Te=oe.splice(l).map(e=>({location:e.location,check:()=>ce(e)}));return r.levelChecks.push(()=>gc(D,{constants:new Set(x.map(e=>e.name)),variables:new Set(te),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>de.get(u.get(e)?.key??e)},Te,se)),ee.push(we),we},Ce=fe(i).linked;se.length>0&&!n.isSanyReported&&n.print(f(se));let D=e=>Ce.visible.get(e)?.key??e;Ce.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)});let we=[],Te=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Te(e,t)),we.push(...e.module.assumptions))};Te(Ce,/* @__PURE__ */ new Set);let Ee=Ce.constants.map(e=>e.name),De=Ce.variables,Oe=e=>e.module===void 0?[e.name,D(e.name)]:e.module===i.name||Ee.includes(e.name)?[]:[(v.get(e.module)??y.get(e.module))?.visible.get(e.name)?.key??e.name],ke=e=>{let t=a.get(e);return t?.kind===`Operator`?t.params.length:Ce.constants.find(t=>t.name===e)?.arity??0},Ae=/* @__PURE__ */ new Map,je=/* @__PURE__ */ new Set,Me=(e,t)=>{p.set(e,t),a.delete(e),Ae.delete(e),je.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=J_(e.value);kn(t),Oe(e).forEach(e=>{let n=ke(e);n===0?Ae.set(e,t):Me(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ne=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Ne.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(J_),J_(e.value)]),Ne.set(t,n)}),Ne.forEach(e=>Oe(e).forEach(t=>Me(t,nv(e.name,ke(t)||e.rows[0][0].length,e.rows))));let Pe=new Map(e.substitutions.flatMap(e=>Oe(e).map(t=>[t,D(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,r=t.target;if(!Ee.includes(n)&&!Ce.visible.has(n))throw new g(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===r))throw new g(`In the configuration file, the identifier ${r} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let i=D(r),o=a.get(i);if(!(o!==void 0||p.has(i)||Ae.has(i)||Ee.includes(r)||De.includes(r)))throw new g(`The configuration file substitutes for ${n} with the undefined identifier ${r}.`);if(o?.kind===`Operator`&&o.params.length!==(Ce.constants.find(e=>e.name===n)?.arity??Ce.visible.get(n)?.arity))throw new g(`The configuration file substitutes for ${n} with ${r} of different number of arguments.`)});let Fe=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(Oe)),Ie=(e,t)=>{if(Fe.has(e))return{key:e,prefix:t};let n=u.get(e);return n&&Ie(n.source,t+n.prefix)};u.forEach((e,t)=>{let n=Ie(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),Ce.visible.forEach((e,n)=>{e.key===t&&n!==t&&a.set(n,o)})});let Le=Ee.filter(e=>!Ae.has(e)&&!Pe.has(e)&&!je.has(e));if(Le.length>0&&!n.isUnconfigured){let e=r.getDeclarationOrder(`constant`).find(e=>Le.includes(e))??Le[0];throw new g(`The constant parameter ${e} is not assigned a value by the configuration file.`)}n.isTraceRecorded&&p.forEach((e,t)=>{let n=Zg(e);n&&p.set(t,n)});let Re=iv(De,ee.flatMap(e=>e.module.variables.map(e=>e.name))),ze=Ac({definitions:a,substitutions:Pe,constants:Ae,variableIndex:Re,builtins:p,variables:De}),Be={runtime:_,definitions:a,builtins:p,constants:Ae,substitutions:Pe,instanceNames:ue,variables:De,variableIndex:Re,facts:ze,startupValues:Array.from({length:ze.ids.size},()=>void 0),substitutedDefinitions:d,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Ve=mc({constants:new Set(Ae.keys()),variables:/* @__PURE__ */ new Set([...De,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>p.has(e))]),getDefinition:e=>Ru(e,Be)}),O=e=>{try{H(e,{environment:Be,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof m)return e;throw e}};Pe.forEach((e,t)=>{let n=a.get(e),r=Ee.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ve.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?O(n.body):void 0;if(r){let n=va(r)?``:` - specifically: ${r.message}`;throw new g(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),_.version!==`1.7.4`&&(_.isStarted=!0);let He=new Set(ee.flatMap(e=>e.module.instances.map(e=>e.module))),Ue=r.createDefinitionOrder();return{environment:Be,assumptions:we,variableLocations:Ce.variableLocations,instanceActions:le,startupDefinitions:ee.filter(e=>!He.has(e.module.name)||Y_(e).length===0).flatMap(e=>Ue(e===Ce?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:Ce.constants,rootSymbols:Ce.visible,javaOverrides:ee.flatMap(e=>xe.get(e.module.name)??[])}},cv={kind:`Boolean`,value:!0},lv={kind:`Boolean`,value:!1},uv=e=>e?cv:lv,dv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,fv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),pv=(e,t,n)=>({kind:e,operands:[t,n]}),mv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?mv(e,t.operands).operands:[t])}),hv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return hv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,hv(t)),0)}},gv=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 gv(e.body);case`And`:case`Or`:return e.operands.some(gv)}},_v=/* @__PURE__ */ new WeakMap,vv={count:0},yv=e=>{let t=_v.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`#${vv.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(yv).join(`,`)})`;default:return`${e.kind}(${yv(e.body)})`}})();return _v.set(e,n),n},bv=(e,t)=>e===t||yv(e)===yv(t),xv=(e,t)=>{let n=yv(t);return e.some(e=>e===t||yv(e)===n)},Sv=e=>e===`And`?`Or`:`And`,Cv=(e,t)=>{switch(e.kind){case`Boolean`:return t?uv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return Cv(e.body,!t);case`And`:case`Or`:return mv(t?Sv(e.kind):e.kind,e.operands.map(e=>Cv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,Cv(e.body,t))}}},wv=e=>{switch(e.kind){case`Boolean`:return uv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return mv(Sv(e.kind),e.operands.map(wv));case`Always`:return $(`Eventually`,wv(e.body));case`Eventually`:return $(`Always`,wv(e.body));default:return $(`Not`,e)}},Tv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Tv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return uv(t)}return n.length===0?uv(!t):n.length===1?n[0]:mv(e.kind,n)}case`Not`:{let t=Tv(e.body);return t.kind===`Boolean`?uv(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=Tv(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Ev=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Dv=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=Dv(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new m(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>mv(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Dv(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Ev(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:mv(`Or`,t);n.push($(`Always`,$(`Eventually`,e)))}return mv(`Or`,n)}case`Not`:return dv(e.body)?e:Dv(wv(e.body));default:return e}},Ov=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Ov(e.operands[0]):mv(e.kind,e.operands.map(Ov));case`Not`:return e.body.kind===`Not`?Ov(e.body.body):$(`Not`,Ov(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,Ov(e.body));default:return e}},kv=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return kv(e.operands[0]);let t=Math.floor(e.operands.length/2);return pv(e.kind,kv(mv(e.kind,e.operands.slice(0,t))),kv(mv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,kv(e.body));default:return e}},Av=(e,t)=>{e.kind===`Eventually`&&!xv(t,e)&&t.push(e),`body`in e&&Av(e.body,t),`operands`in e&&e.operands.forEach(e=>Av(e,t))},jv=e=>{let t=e.filter(fv),n=e.flatMap(e=>e.kind===`Not`&&fv(e.body)?[e.body]:[]);return!t.some(e=>xv(n,e))},Mv=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 m(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Nv=(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]}},Pv=(e,t,n)=>e.flatMap(e=>{let r=Nv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Fv=e=>[...new Set(e.map(yv))].sort().join(`|`),Iv=(e,t)=>{let n=new Set(t.map(Fv));return[...e.filter(e=>!n.has(Fv(e))),...t]},Lv=e=>{let t=Mv(e),n=Pv(t,`Always`,`And`),r=Pv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Nv(t,`Eventually`,`Or`);if(n&&!(xv(e,n.first)||xv(e,n.second)))return Iv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(xv(e,t.first)||xv(e,t.second))&&!xv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!jv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Nv(t[e],`Always`,`And`);n&&(xv(t,n.first)||t.push(n.first),xv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)xv(t,e.first)&&xv(t,e.second)&&!xv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!jv(t)?[]:i(t)};return a(e)},Rv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>hv(e)<=1)}),zv=e=>{let t=Lv([e]).map(Rv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Fv(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 Lv(n)){let n=Fv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Rv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Bv=(e,t)=>!xv(e,t)||xv(e,t.body),Vv=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&hv(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Ev(e);if(n){let e=hv(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(gv(e))throw new m(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Hv=(e,t)=>{let n=e.findIndex(e=>bv(e,t));return n===-1?(e.push(t),e.length-1):n},Uv=e=>{let t=Dv(Tv(Cv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Ov(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Vv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:mv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:bv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&kv(e.formula),n=[];t&&Av(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Hv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Hv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Hv(i,e))}));return{tableau:t&&zv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Wv=()=>v(new m(`Temporal formula is a tautology (its negation is unsatisfiable).`),a.livenessEvaluationFailure),Gv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Kv=/* @__PURE__ */ new WeakSet,qv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Jv=(e,t)=>new m(`TLC cannot handle the temporal formula ${vu(e)}${t===void 0?``:`:\n${t}`}`),Yv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=ju(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return r.isReleased?0:Yv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?Yv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=Ru(e,n);if(t)return Ic(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isStateLevel&&!r.isLevelConstant?1:0},o=(e,t)=>r.has(e)?0:k(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return cs(e,(e,a)=>(i.value=Math.max(i.value,Yv(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return Gv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Xv=(e,t)=>{try{return qu(e,t)}catch(e){if(!(e instanceof m))throw e;if(!va(e))return;throw v(new m(`${u}${e.message}`),a.error)}},Zv=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o)=>{let s=(e,t,s=o,c=i,l)=>Zv(e,t,n,r,c,a||l!==void 0&&n.substitutedDefinitions.has(l),s);if(e.kind===`And`)return e.operands.flatMap(e=>s(e,t,vu(e)));if(e.kind===`Label`)return s(e.body,t);if(e.kind===`Let`)return s(e.body,Qv(e,t,n));if(e.kind===`Identifier`){let r=k(e)?ju(t,e.name):void 0;if(r?.kind===`Thunk`&&!r.isReleased)return s(r.expression,r.scope);let a=n.constants.has(e.name)?void 0:Ru(e.name,n);if(!r&&a?.kind===`Operator`&&a.params.length===0&&Ic(a,n)>0){if(i.has(a))throw x();return s(a.body,void 0,a.name,/* @__PURE__ */ new Set([...i,a]),a)}}let c=qv(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||Yv(e,t,n)===3)){let t=hd(e,c),r=k(e)?void 0:Ru(e.operator,n);if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&!a)return s(t.body,Dd(t,e.args,c),e.operator,i,r)}let l=r&&e.kind===`Forall`&&e.bounds.every(e=>Yv(e.set,t,n)===0),u=l?Xv(e.bounds,c):void 0;if(l&&u){let n=[];if(Ju(e.bounds,u,t,t=>(n.push(...s(e.body,t,vu(e.body))),!1)),n.length===0)throw Wv();return n}return[{expression:e,scope:t,name:o}]},Qv=(e,t,n)=>{let r=jd(e.definitions,qv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Kv.add(e.binding);return r},$v=(e,t,n)=>{let i=n.runtime.version===`1.7.4`,a=(e,t,r)=>{let a=r===0&&!i?Yv(e,t,n):r;if(a===0){let r=H(e,qv(n,t));if(typeof r!=`boolean`)throw new m(`TLC expected a boolean value, but did not find one. ${yu(e)}`);return uv(r)}return a===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},o={depth:0},s=(e,t,n,r)=>{if(o.depth>=100)throw x();o.depth++;let i=p(e,t);o.depth--;let s=hv(i);return s>2?i:a(n,r,s)},c=(e,t)=>{let r=e.kind===`Identifier`?e.name:e.operator,a=qv(n,t),o=k(e)||Ru(r,n)===void 0?ju(t,r):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&Kv.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:k(e)?gd(r,a):md(r,n);if(c?.kind!==`Closure`)throw Jv(e);let u=e.kind===`Apply`?e.args:[],d=!k(e)&&Ru(r,n)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>H(e,a)),s(c.body,Dd(c,u,a),e,t)),d)},l=(e,t,n=!1)=>{try{return t()}catch(t){let a=t instanceof r||n&&!i;throw!(t instanceof m)||a?t:Jv(e)}},u=(e,t)=>{let i=Yv(e,t,n);if(!e.bounds.every(e=>Yv(e.set,t,n)===0)){if(i<=2)return a(e,t,i);throw Jv(e)}let o=[],s=e.kind===`Forall`;try{Yu(e.bounds,qv(n,t),t=>(o.push(p(e.body,t)),!1))}catch(n){if(!(n instanceof m)||n instanceof r)throw n;if(i<=2)return a(e,t,i);throw Jv(e,s&&!va(n)?n.message:void 0)}return o.length===0?uv(s):d(e,t,mv(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=hv(n);return r>2?n:a(e,t,r)},f=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!k(e)||e.operator===`=>`),p=(e,t)=>{let r=Yv(e,t,n);if(r<=2&&!f(e))return a(e,t,r);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,Qv(e,t,n));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,pv(`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,pv(`Or`,$(`Not`,p(n[0],t)),p(n[1],t))):c(e,t)}case`And`:case`Or`:return d(e,t,mv(e.kind,e.operands.map(e=>p(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&Yv(e.condition,t,n)===0){let r=H(e.condition,qv(n,t));if(typeof r==`boolean`)return p(r?e.consequent:e.alternative,t)}let r=p(e.condition,t);return d(e,t,pv(`Or`,pv(`And`,r,p(e.consequent,t)),pv(`And`,$(`Not`,r),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,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?$(`Always`,$(`Eventually`,pv(`Or`,i,a))):pv(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw Jv(e)}};return p(e,t)},ey=(e,t,n,r,i)=>{let a=e=>ey(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`?Lu(H(e.expression,a),`a temporal property predicate`):su(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&Lu(H(e.unchanged,a),`a subscript`)?!1:Lu(H(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return ey(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new m(`TLC cannot evaluate a temporal formula in a single step`)}},ty=(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)=>ty(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 ey(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},ny=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),ry=(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},iy=e=>v(new m(`${i}${e}`),a.error),ay=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!M(e)||!M(i))throw iy(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},oy=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(oy);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},sy=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,cy=(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 iy(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>H(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!A(a)||!N(a))throw iy(`The symmetry operator must specify a set of functions.`);let o=P(a).elements;if(!o.every(j))throw iy(`The symmetry values must be function records.`);let s=o.map(ay),c=r.body.kind===`Apply`?r.body.args:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=oy(sy(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(ca.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;s.forEach(e=>{e.size>0&&d.set(ny(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=ry(n,e),r=ny(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(!sy(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=>M(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},ly=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=dy(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(dy(e[r],t));return a}},uy=(e,t)=>{let n=[],r=[];for(let i of e){let e=dy(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Ft);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Ft(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},dy=(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=uy(e.elements,t);return n?Rt(n):e}if(n===`Function`||n===`LazyFunction`&&N(e.domain)){let n=I(e),r=ly(n.domain,t),i=ly(n.range,t)??n.range;if(r){let e=Rn(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?zt(n.domain,e.range):e}return i===n.range?n:zt(n.domain,i)}if(n===`Interval`||!A(e)||!N(e))return e;let r=P(e),i=ly(r.elements,t);return i?Mn(i):r},fy=(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]=dy(e[o],i),a===0&&(a=Ft(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},py={line:0,column:0},my=e=>({kind:`Identifier`,name:e,location:py}),hy=/* @__PURE__ */ new Set([`name`,`property`]),gy=(e,t,n)=>{let r=Ru(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(hy.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},_y=(e,t,n)=>{if(Nc(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return H(my(e),zy(n,void 0,void 0))}catch(e){if(e instanceof m||p(e))return;throw e}},vy=(e,t,n)=>{let r=gy(e,t,n);if(_y(t,r,n)!==void 0)throw new g(`The ${e} ${t} cannot be a constant.`);return r},yy=(e,t,n)=>{let r=n.constants.has(t)?void 0:gy(e,t,n),i=r?_y(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new g(`The ${e} of ${t} is equal to ${L(i)}`);return i===void 0?r:void 0},by=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},xy=(e,t,n)=>{let r=e.environment,i=/* @__PURE__ */ new Set;r.runtime.warn=(e,t)=>{i.has(t)||(i.add(t),n?.({kind:`warning`,code:e,text:t}))},n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),dd(e.startupDefinitions,r),t.invariants.forEach(e=>{yy(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},Sy=(e,t)=>{let n=mc({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>Ru(e,t)});return e.flatMap(e=>{let r=yy(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
|
|
1763
1763
|
Note that a bug can cause TLC to incorrectly report this error.
|
|
1764
1764
|
If you believe your TLA+ or PlusCal specification to be correct,
|
|
1765
|
-
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw o(new g(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),m.safetyEvaluationFailure)}return[{name:e,expression:oy(e),scope:void 0}]})},hy=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>hy(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Fu(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return hy(n.body,t)}return[e]},gy=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||Vv(r,e.scope,t)>0)return!1;let i=H(r,jy(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},_y=(e,t)=>{if(e.specification===void 0){let n=(e,n)=>{if(e!==void 0)return uy(n,e,t),oy(e)};return{init:n(e.init,`initial predicate`),next:n(e.next,`next state action`),scope:void 0,temporals:[]}}if(e.init!==void 0||e.next!==void 0)throw new g(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let n=[],r=[],i=[],a=cy(`name`,e.specification,t),s=ly(e.specification,a,t);if(s!==void 0)throw new g(`The value of ${e.specification} is equal to ${I(s)}`);if(Uv(a.body,void 0,t,!1).forEach(a=>{let s=a.expression;if(gy(a,t,`spec`))return;if(s.kind===`UnboundedQuantifier`&&s.isTemporal)throw o(new g(`TLC does not support temporal existential, nor universal, quantification over state variables.`),m.error);if(s.kind===`Always`&&s.expression.kind===`BoxAction`){r.push({expression:s.expression.action,scope:a.scope});return}if(s.kind===`Always`&&Vv(s.expression,a.scope,t)<2)throw o(new h(`TLC cannot handle the temporal formula ${B(s.expression)}`),m.error);let c=Vv(s,a.scope,t);if(c===3)i.push(a);else{if(c===2)throw new g(`TLC cannot handle the action-level conjunct of the specification ${e.specification}`);n.push(a)}}),r.length>1)throw new g(`The specification ${e.specification} must contain at most one [][Next]_vars`);let c=[...n,...r],l=e=>`$specification${e}`,u=c.reduce((e,t,n)=>t.scope===void 0?e:{name:l(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),d=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:l(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:n.length===0?void 0:{kind:`And`,operands:n.map(d),location:ay},next:r.length===0?void 0:d(r[0],n.length),scope:u,temporals:i}},vy=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=dy(`property`,e,t);if(!i)return;Vv(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;Uv(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(gy(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`&&Vv(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!O(e)?Fu(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=Vv(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2)throw new g(`The property ${e} is an action-level formula`);r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},yy=(e,t,n)=>t.flatMap(t=>dy(e,t,n)?[{name:t,expression:oy(t),scope:void 0}]:[]),by=(e,t)=>{let n=Fu(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},xy=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new g(`_POSSIBLE lists ${n} more than once`);uy(`possible`,n,t);let i=oy(n);if(Vv(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}}),Sy=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||O(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Cy=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=Fu(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},wy=(e,t)=>e.flatMap(e=>hy(e.expression,t).map(n=>{let r=e.scope===void 0?Ic(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Sy(n,r,t),predicate:Cy(e.expression,t)}})),Ty=(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},Ey=/[\u0100-\uffff]/,Dy=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Oy=e=>e.kind===`String`?Ey.test(e.value):e.kind===`Set`&&e.elements.some(Oy),ky=e=>e.kind===`String`&&Ey.test(e.value)||e.kind===`Apply`&&Dy.has(e.operator)||Ye(e).some(ky),Ay=(e,t)=>e.constants.some(e=>Oy(e.value)||(e.args??[]).some(Oy))||[...t.definitions.values()].some(e=>ky(e.body)||e.kind===`Function`&&e.bounds.some(e=>ky(e.set))),jy=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),My=(e,t,n)=>Pu(H(e,t),n),Ny=(e,t,n=Py)=>{let r=H(e,t);if(typeof r!=`boolean`)throw new h(n(e,t.environment));return r},Py=(e,t)=>{let n=e.kind===`Identifier`?Fu(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${i&&r.kind!==`Number`?hu(i):gu(r)}`},Fy=(e,t)=>Ny(e.expression,t,(n,r)=>(Ny(e.predicate,t),Py(n,r))),Iy=()=>{},Ly=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=My(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),Ry=(e,t,n)=>{try{return My(e,jy(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof h)return{message:e.message};throw e}},zy=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=Ry(n.expression,t,`an assumption`);if(e)return{name:B(n.expression),trace:[],message:e.message}}},By=(e,t,n,r)=>{let i=my(e.invariants,t),a=_y(e,t),s=vy(e,t,r),c=wy([...i,...s.invariants],t),l=[...new Map(c.map(e=>[e.predicate,e])).values()],d=c.length>0||s.actionProperties.length>0||s.liveness.length>0;if(a.init===void 0&&(d||s.initialPredicates.length>0||t.variables.length>0))throw new g(t.runtime.version===`1.7.4`?fa:`The configuration file did not specify the initial state predicate.`);if(a.next===void 0&&d)throw new g(`The configuration file did not specify the next state predicate.`);let f=wy(yy(`constraint`,e.constraints,t),t),p=yy(`action constraint`,e.actionConstraints,t);e.rlReward!==void 0&&cy(`rlreward`,e.rlReward,t),e.periodic!==void 0&&cy(`periodic`,e.periodic,t);let ee=xy(e.possible,t);if(t.variables.length===0)return;let _=e.symmetry===void 0?void 0:ey(e.symmetry,t,e.substitutions);e.view!==void 0&&cy(`view function`,e.view,t);let v=e.view===void 0?void 0:{name:e.view,expression:oy(e.view),scope:void 0},te=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:ay};return{...e,unchanged:t}}),y=e=>Vv(e.expression,void 0,t)>=2,b=ee.filter(e=>!y(e)),ne=ee.filter(y),re=t.runtime,ie={indices:void 0},ae=()=>{if(ie.indices)return ie.indices;let e=n(),r=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return ie.indices=t.variables.map((e,t)=>t).sort((e,t)=>r(e)-r(t)),ie.indices},oe=(e,n)=>H(e,jy(t,n,void 0)),se=e=>{let t=ae(),n=_===void 0?e:iy(e,_,t);return Vm(v===void 0?t.map(e=>n[e]):[oe(v.expression,n)])},ce=/* @__PURE__ */ new WeakSet,le=(e,n,r)=>{let i=r&&!ce.has(r)?r:void 0;if(Ty(e,n,i))return!1;try{let r=jy(t,n,void 0,e.scope),a=e.membership;return i&&a?!Ar(n[a.variable],i[a.variable],H(a.set,r)):!Fy(e,r)}catch(t){throw r?Ea(o(t,m.safetyEvaluationFailure),ca.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},ue=Ay(e,t);re.getFingerprint=se;let de=()=>{let e=ee.find(e=>!re.possibleCounts.get(e.name));if(!e)return;let n=by(e.name,t),r=n?` at ${hu(n)}`:``;return{name:e.name,code:ca.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:at(I(uh(re),!0))}};return{properties:s,spec:a,isSymmetric:_!==void 0,isConstrained:f.length>0||p.length>0,getTlcOrder:ae,getStoredFingerprints:(e,t)=>v!==void 0||ue?BigInt64Array.from(e,se):Hm(t,ae()),getFingerprintState:e=>{if(ue)return[String(se(e))];let t=_===void 0?e:iy(e,_,ae());return v===void 0?t:[oe(v.expression,t)]},findViolatedInvariant:(e,t)=>{let n=c.find(n=>le(n,e,t));return n&&ce.add(e),n},getViolatedInvariants:e=>{let t=l.filter(t=>c.some(n=>n.predicate===t.predicate&&le(n,e,void 0)));return t.length>0&&ce.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>Ny(n,jy(t,e,void 0,r));f.every(e=>r(e.predicate,e.scope))&&n();let i=l.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=s.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(f.every(e=>Ny(e.predicate,jy(n,t,void 0,e.scope)))&&p.every(r=>Ny(r.expression,jy(n,e,t,r.scope))))||r())||l.every(e=>Ny(e.predicate,jy(n,t,void 0,e.scope))))&&te.every(r=>Ny(r.box,jy(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>f.every(r=>Ty(r,e,n)||Fy(r,jy(t,e,void 0))),findFailedInitialPredicate:e=>s.initialPredicates.find(n=>!Ny(n.expression,jy(t,e,void 0,n.scope))),findViolatedActionProperty:(e,n)=>te.find(r=>{try{return!Ny(r.action,jy(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${B(r.box)}`)&&!My(r.unchanged,jy(t,e,n,r.scope),`a subscript`)}catch(e){throw Ea(Vy(e),ca.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,n)=>p.every(r=>Ny(r.expression,jy(t,e,n),e=>`${u}${Py(e,t)}`)),trackStatePossible:b.length===0?Iy:e=>Ly(b,re,jy(t,e,void 0)),trackActionPossible:ne.length===0?Iy:(e,n)=>Ly(ne,re,jy(t,e,n)),findUnwitnessedPossible:de,findPostconditionViolation:(n=!1)=>{let r=e.postconditions.find(e=>{let n=Fu(e,t);return n!==void 0&&sd(n,t)!==void 0});if(r!==void 0){if(n)return;throw o(new h(`${u}The post condition ${r} cannot be a constant.`),m.error)}let i=de();if(i)return i;for(let n of e.postconditions){let e=Ry(oy(n),t,`a postcondition`);if(!e)continue;let r=by(n,t),i=r?` at ${hu(r)}`:``;return e.message===void 0?{name:n,code:ca.postconditionFalse,message:`Postcondition ${n}${i} is false.`}:{name:n,code:ca.postconditionFailed,message:`Evaluating postcondition ${n}${i} failed.\n${e.message}`}}}}},Vy=e=>e instanceof n?o(e,e.exitCode):e,Hy=(e,t)=>e*((t-e)/2**64),Uy=e=>e.includes(`.`)?e:`${e}.0`,Wy=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return Uy(String(e));let[n,r]=e.toExponential().split(`e`);return`${Uy(n)}E${r.replace(`+`,``)}`},Gy=e=>e!==void 0&&e>=`0`&&e<=`9`,Ky=e=>{if(e===0)return`0.0`;let t=Wy(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;Gy(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(;Gy(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;Gy(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(Gy(t[n.next])&&Number(t[n.next])>=5&&(n.result=qy(n.result));Gy(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},qy=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${qy(r)}.`:n===`9`?`${qy(r)}0`:`${r}${Number(n)+1}`},Jy=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}`)},Yy=(e,t,n)=>{if(Hy(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},Xy=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}).`},Zy=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Qy=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Zr(e[t]),16777619),r=Math.imul(r^ri(e[t]),1540483477);t[0]=Zy(n)||1,t[1]=Zy(r)},$y=()=>{let e={slots:/* @__PURE__ */ new Int32Array(8192),used:0},t=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},n=()=>{let n=e.slots,r=new Int32Array(n.length*2);for(let e=0;e<n.length;e+=2){if(n[e]===0)continue;let i=t(r,n[e],n[e+1]);r[i*2]=n[e],r[i*2+1]=n[e+1]}e.slots=r};return{insert:(r,i)=>{e.used*4>=e.slots.length&&n();let a=t(e.slots,r,i);return e.slots[a*2]!==r&&(e.slots[a*2]=r,e.slots[a*2+1]=i,e.used++,!0)}}},eb=(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}},tb=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),nb=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return eb(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},rb=e=>Atomics.load(e.used,0)*2>=e.slots.length,ib=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&eb(t,n);return{slots:t,used:e.used}},ab=[void 0,`lambda`,`tuple`,`record`],ob=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=Rr(e.domain);return t?(r(7),r(ab.indexOf(Ut(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(ab.indexOf(Ut(e))),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},sb=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return Rt(t.strings[n[r.index++]]);if(e===5)return zt(i(n[r.index++]));let a=ab[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=qn({kind:`Interval`,low:e,high:e+t-1});return Ht(Bt(o,i(t)),a)}let o=n[r.index++],s=i(o);return Ht(Bt(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Fu as $,dv as A,pi as At,mm as B,Ct as Bt,Kv as C,Ma as Ct,ov as D,Xn as Dt,Gv as E,Rt as Et,pg as F,Dt as Ft,gf as G,qe as Gt,ym as H,F as Ht,mh as I,Zr as It,Fd as J,w as Jt,Ed as K,Je as Kt,ph as L,A as Lt,$_ as M,Yr as Mt,z_ as N,Xr as Nt,$ as O,Nn as Ot,fg as P,Ot as Pt,hu as Q,hh as R,$t as Rt,Iv as S,Da as St,Vv as T,nn as Tt,vm as U,Ye as Ut,gm as V,Tt as Vt,Hp as W,O as Wt,H as X,_e as Xt,B as Y,me as Yt,Ku as Z,xe as Zt,uy as _,Ca as _t,ib as a,cu as at,py as b,ja as bt,Qy as c,dl as ct,Yy as d,ca as dt,Ad as et,Hy as f,la as ft,zy as g,wa as gt,By as h,xa as ht,tb as i,ou as it,Mv as j,I as jt,Fv as k,Yn as kt,Ky as l,fl as lt,oy as m,ba as mt,ob as n,Ou as nt,nb as o,su as ot,Xy as p,da as pt,wd as q,Be as qt,$y as r,dd as rt,rb as s,lu as st,sb as t,kd as tt,Jy as u,jc as ut,jy as v,_a as vt,qv as w,Hr as wt,Vy as x,va as xt,fy as y,Fa as yt,Vm as z,Xt as zt};
|
|
1765
|
+
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw v(new g(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),a.safetyEvaluationFailure)}return[{name:e,expression:my(e),scope:void 0}]})},Cy=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Cy(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Ru(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Cy(n.body,t)}return[e]},wy=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||Yv(r,e.scope,t)>0)return!1;let i=H(r,zy(t,void 0,void 0,e.scope));if(i===!1)throw new g(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new g(`The operator ${r.name}, which equals ${L(i)},\ncannot be used as a ${n}`);return!0},Ty=(e,t)=>{if(e.specification===void 0){let n=(e,n)=>{if(e!==void 0)return vy(n,e,t),my(e)};return{init:n(e.init,`initial predicate`),next:n(e.next,`next state action`),scope:void 0,temporals:[]}}if(e.init!==void 0||e.next!==void 0)throw new g(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let n=[],r=[],i=[],o=gy(`name`,e.specification,t),s=_y(e.specification,o,t);if(s!==void 0)throw new g(`The value of ${e.specification} is equal to ${L(s)}`);if(Zv(o.body,void 0,t,!1).forEach(o=>{let s=o.expression;if(wy(o,t,`spec`))return;if(s.kind===`UnboundedQuantifier`&&s.isTemporal)throw v(new g(`TLC does not support temporal existential, nor universal, quantification over state variables.`),a.error);if(s.kind===`Always`&&s.expression.kind===`BoxAction`){r.push({expression:s.expression.action,scope:o.scope});return}if(s.kind===`Always`&&Yv(s.expression,o.scope,t)<2)throw v(new m(`TLC cannot handle the temporal formula ${vu(s.expression)}`),a.error);let c=Yv(s,o.scope,t);if(c===3)i.push(o);else{if(c===2)throw new g(`TLC cannot handle the action-level conjunct of the specification ${e.specification}`);n.push(o)}}),r.length>1)throw new g(`The specification ${e.specification} must contain at most one [][Next]_vars`);let c=[...n,...r],l=e=>`$specification${e}`,u=c.reduce((e,t,n)=>t.scope===void 0?e:{name:l(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),d=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:l(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:n.length===0?void 0:{kind:`And`,operands:n.map(d),location:py},next:r.length===0?void 0:d(r[0],n.length),scope:u,temporals:i}},Ey=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=yy(`property`,e,t);if(!i)return;Yv(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;Zv(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(wy(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`&&Yv(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!k(e)?Ru(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=Yv(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2)throw new g(`The property ${e} is an action-level formula`);r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},Dy=(e,t,n)=>t.flatMap(t=>yy(e,t,n)?[{name:t,expression:my(t),scope:void 0}]:[]),Oy=(e,t)=>{let n=Ru(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},ky=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new g(`_POSSIBLE lists ${n} more than once`);vy(`possible`,n,t);let i=my(n);if(Yv(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}}),Ay=(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},jy=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=Ru(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},My=(e,t)=>e.flatMap(e=>Cy(e.expression,t).map(n=>{let r=e.scope===void 0?Rc(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Ay(n,r,t),predicate:jy(e.expression,t)}})),Ny=(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},Py=/[\u0100-\uffff]/,Fy=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Iy=e=>e.kind===`String`?Py.test(e.value):e.kind===`Set`&&e.elements.some(Iy),Ly=e=>e.kind===`String`&&Py.test(e.value)||e.kind===`Apply`&&Fy.has(e.operator)||Je(e).some(Ly),Ry=(e,t)=>e.constants.some(e=>Iy(e.value)||(e.args??[]).some(Iy))||[...t.definitions.values()].some(e=>Ly(e.body)||e.kind===`Function`&&e.bounds.some(e=>Ly(e.set))),zy=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),By=(e,t,n)=>Lu(H(e,t),n),Vy=(e,t,n=Hy)=>{let r=H(e,t);if(typeof r!=`boolean`)throw new m(n(e,t.environment));return r},Hy=(e,t)=>{let n=e.kind===`Identifier`?Ru(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${i&&r.kind!==`Number`?_u(i):yu(r)}`},Uy=(e,t)=>Vy(e.expression,t,(n,r)=>(Vy(e.predicate,t),Hy(n,r))),Wy=()=>{},Gy=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=By(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),Ky=(e,t,n)=>{try{return By(e,zy(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof m)return{message:e.message};throw e}},qy=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=Ky(n.expression,t,`an assumption`);if(e)return{name:vu(n.expression),trace:[],message:e.message}}},Jy=(e,t,n,r)=>{let o=Sy(e.invariants,t),s=Ty(e,t),c=Ey(e,t,r),l=My([...o,...c.invariants],t),u=[...new Map(l.map(e=>[e.predicate,e])).values()],d=l.length>0||c.actionProperties.length>0||c.liveness.length>0;if(s.init===void 0&&(d||c.initialPredicates.length>0||t.variables.length>0))throw new g(t.runtime.version===`1.7.4`?fa:`The configuration file did not specify the initial state predicate.`);if(s.next===void 0&&d)throw new g(`The configuration file did not specify the next state predicate.`);let f=My(Dy(`constraint`,e.constraints,t),t),p=Dy(`action constraint`,e.actionConstraints,t);e.rlReward!==void 0&&gy(`rlreward`,e.rlReward,t),e.periodic!==void 0&&gy(`periodic`,e.periodic,t);let h=ky(e.possible,t);if(t.variables.length===0)return;let _=e.symmetry===void 0?void 0:cy(e.symmetry,t,e.substitutions);e.view!==void 0&&gy(`view function`,e.view,t);let y=e.view===void 0?void 0:{name:e.view,expression:my(e.view),scope:void 0},b=c.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:py};return{...e,unchanged:t}}),ee=e=>Yv(e.expression,void 0,t)>=2,x=h.filter(e=>!ee(e)),te=h.filter(ee),ne=t.runtime,re={indices:void 0},ie=()=>{if(re.indices)return re.indices;let e=n(),r=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return re.indices=t.variables.map((e,t)=>t).sort((e,t)=>r(e)-r(t)),re.indices},ae=(e,n)=>H(e,zy(t,n,void 0)),oe=e=>{let t=ie(),n=_===void 0?e:fy(e,_,t);return Ym(y===void 0?t.map(e=>n[e]):[ae(y.expression,n)])},se=/* @__PURE__ */ new WeakSet,ce=(e,n,r)=>{let i=r&&!se.has(r)?r:void 0;if(Ny(e,n,i))return!1;try{let r=zy(t,n,void 0,e.scope),a=e.membership;return i&&a?!Ar(n[a.variable],i[a.variable],H(a.set,r)):!Uy(e,r)}catch(t){throw r?Ea(v(t,a.safetyEvaluationFailure),ca.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},le=Ry(e,t);ne.getFingerprint=oe;let ue=()=>{let e=h.find(e=>!ne.possibleCounts.get(e.name));if(!e)return;let n=Oy(e.name,t),r=n?` at ${_u(n)}`:``;return{name:e.name,code:ca.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:it(L(vh(ne),!0))}};return{properties:c,spec:s,isSymmetric:_!==void 0,isConstrained:f.length>0||p.length>0,getTlcOrder:ie,getStoredFingerprints:(e,t)=>y!==void 0||le?BigInt64Array.from(e,oe):Xm(t,ie()),getFingerprintState:e=>{if(le)return[String(oe(e))];let t=_===void 0?e:fy(e,_,ie());return y===void 0?t:[ae(y.expression,t)]},findViolatedInvariant:(e,t)=>{let n=l.find(n=>ce(n,e,t));return n&&se.add(e),n},getViolatedInvariants:e=>{let t=u.filter(t=>l.some(n=>n.predicate===t.predicate&&ce(n,e,void 0)));return t.length>0&&se.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>Vy(n,zy(t,e,void 0,r));f.every(e=>r(e.predicate,e.scope))&&n();let i=u.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=c.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(f.every(e=>Vy(e.predicate,zy(n,t,void 0,e.scope)))&&p.every(r=>Vy(r.expression,zy(n,e,t,r.scope))))||r())||u.every(e=>Vy(e.predicate,zy(n,t,void 0,e.scope))))&&b.every(r=>Vy(r.box,zy(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>f.every(r=>Ny(r,e,n)||Uy(r,zy(t,e,void 0))),findFailedInitialPredicate:e=>c.initialPredicates.find(n=>!Vy(n.expression,zy(t,e,void 0,n.scope))),findViolatedActionProperty:(e,n)=>b.find(r=>{try{return!Vy(r.action,zy(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${vu(r.box)}`)&&!By(r.unchanged,zy(t,e,n,r.scope),`a subscript`)}catch(e){throw Ea(Yy(e),ca.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,n)=>p.every(r=>Vy(r.expression,zy(t,e,n),e=>`${i}${Hy(e,t)}`)),trackStatePossible:x.length===0?Wy:e=>Gy(x,ne,zy(t,e,void 0)),trackActionPossible:te.length===0?Wy:(e,n)=>Gy(te,ne,zy(t,e,n)),findUnwitnessedPossible:ue,findPostconditionViolation:(n=!1)=>{let r=e.postconditions.find(e=>{let n=Ru(e,t);return n!==void 0&&ud(n,t)!==void 0});if(r!==void 0){if(n)return;throw v(new m(`${i}The post condition ${r} cannot be a constant.`),a.error)}let o=ue();if(o)return o;for(let n of e.postconditions){let e=Ky(my(n),t,`a postcondition`);if(!e)continue;let r=Oy(n,t),i=r?` at ${_u(r)}`:``;return e.message===void 0?{name:n,code:ca.postconditionFalse,message:`Postcondition ${n}${i} is false.`}:{name:n,code:ca.postconditionFailed,message:`Evaluating postcondition ${n}${i} failed.\n${e.message}`}}}}},Yy=e=>e instanceof n?v(e,e.exitCode):e,Xy=(e,t)=>e*((t-e)/2**64),Zy=e=>e.includes(`.`)?e:`${e}.0`,Qy=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return Zy(String(e));let[n,r]=e.toExponential().split(`e`);return`${Zy(n)}E${r.replace(`+`,``)}`},$y=e=>e!==void 0&&e>=`0`&&e<=`9`,eb=e=>{if(e===0)return`0.0`;let t=Qy(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;$y(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(;$y(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;$y(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for($y(t[n.next])&&Number(t[n.next])>=5&&(n.result=tb(n.result));$y(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},tb=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${tb(r)}.`:n===`9`?`${tb(r)}0`:`${r}${Number(n)+1}`},nb=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}`)},rb=(e,t,n)=>{if(Xy(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},ib=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}).`},ab=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},ob=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Zr(e[t]),16777619),r=Math.imul(r^ri(e[t]),1540483477);t[0]=ab(n)||1,t[1]=ab(r)},sb=()=>{let e={slots:/* @__PURE__ */ new Int32Array(8192),used:0},t=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},n=()=>{let n=e.slots,r=new Int32Array(n.length*2);for(let e=0;e<n.length;e+=2){if(n[e]===0)continue;let i=t(r,n[e],n[e+1]);r[i*2]=n[e],r[i*2+1]=n[e+1]}e.slots=r};return{insert:(r,i)=>{e.used*4>=e.slots.length&&n();let a=t(e.slots,r,i);return e.slots[a*2]!==r&&(e.slots[a*2]=r,e.slots[a*2+1]=i,e.used++,!0)}}},cb=(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}},lb=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),ub=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return cb(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},db=e=>Atomics.load(e.used,0)*2>=e.slots.length,fb=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&cb(t,n);return{slots:t,used:e.used}},pb=[void 0,`lambda`,`tuple`,`record`],mb=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=Rr(e.domain);return t?(r(7),r(pb.indexOf(Ht(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(pb.indexOf(Ht(e))),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},hb=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return Lt(t.strings[n[r.index++]]);if(e===5)return Rt(i(n[r.index++]));let a=pb[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=qn({kind:`Interval`,low:e,high:e+t-1});return Vt(zt(o,i(t)),a)}let o=n[r.index++],s=i(o);return Vt(zt(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Ru as $,yv as A,pi as At,Sm as B,St as Bt,ey as C,Ma as Ct,mv as D,Xn as Dt,$v as E,Lt as Et,xg as F,Et as Ft,wf as G,Ke as Gt,Dm as H,I as Ht,Sh as I,Zr as It,Bd as J,T as Jt,jd as K,qe as Kt,xh as L,j as Lt,sv as M,Yr as Mt,q_ as N,Xr as Nt,$ as O,Mn as Ot,bg as P,Dt as Pt,_u as Q,Ch as R,Qt as Rt,Wv as S,Da as St,Yv as T,tn as Tt,Em as U,Je as Ut,wm as V,wt as Vt,Xp as W,k as Wt,H as X,ge as Xt,vu as Y,pe as Yt,Yu as Z,be as Zt,vy as _,Ca as _t,fb as a,uu as at,xy as b,ja as bt,ob as c,pl as ct,rb as d,ca as dt,Fd as et,Xy as f,la as ft,qy as g,wa as gt,Jy as h,xa as ht,lb as i,cu as it,Bv as j,L as jt,Uv as k,Yn as kt,eb as l,ml as lt,my as m,ba as mt,mb as n,ju as nt,ub as o,lu as ot,ib as p,da as pt,Dd as q,ze as qt,sb as r,md as rt,db as s,du as st,hb as t,Pd as tt,nb as u,Nc as ut,zy as v,_a as vt,ty as w,Hr as wt,Yy as x,va as xt,by as y,Fa as yt,Ym as z,Yt as zt};
|