tla-ts 0.0.3-dev.f362080 → 0.0.3-dev.f6f300a
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/transfer.cjs +21 -18
- package/dist/transfer.js +21 -18
- package/package.json +1 -1
- package/src/check.ts +29 -7
- package/src/errors.ts +7 -0
- package/src/evaluate.ts +5 -0
- package/src/liveness.ts +3 -5
package/dist/transfer.cjs
CHANGED
|
@@ -10,17 +10,20 @@ const e={success:0,assumptionViolation:10,deadlock:11,safetyViolation:12,livenes
|
|
|
10
10
|
This was probably caused by an error in the spec or model.
|
|
11
11
|
See the User Output or TLC Console for clues to what happened.
|
|
12
12
|
The exception was a java.lang.RuntimeException
|
|
13
|
-
:
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
|
|
17
|
-
|
|
13
|
+
: `,s=`This was a Java StackOverflowError. It was probably the result
|
|
14
|
+
of an incorrect recursive function definition that caused TLC to enter
|
|
15
|
+
an infinite loop when trying to compute the function or its application
|
|
16
|
+
to an element in its putative domain.`,c=e=>e instanceof RangeError&&e.message===`Maximum call stack size exceeded`;var l=class extends Error{constructor(e,t){super(e,{cause:t}),this.name=`TlaError`}},u=class extends l{failure;constructor(e,t,n){super(e,t),this.name=`TlaSyntaxError`,this.failure=n}},d=class extends l{constructor(e,t){super(e,t),this.name=`TlaConfigError`}},f=class extends l{constructor(e,t){super(e,t),this.name=`TlaEvaluationError`}},p=class extends f{exitCode;constructor(t,n=e.error){super(t),this.name=`TlaEvaluationError`,this.exitCode=n}},m=class extends f{constructor(e){super(e),this.name=`TlaEvaluationError`}},h=class extends l{failure;exception;constructor(e,t={}){super(e),this.name=`TlaProofError`,this.failure=t.exception===void 0?t.failure??e:void 0,this.exception=t.exception??`Failure(${JSON.stringify(this.failure)})`}},g=class extends h{constructor(e=`Assert_failure`){super(`Oops, this seems to be a bug in TLAPM.`,{exception:e}),this.name=`TlaProofError`}},_=class extends l{constructor(e,t){super(e,t),this.name=`TlaUnsupportedError`}};const v=t=>r(t)??(t instanceof u?e.specParseError:t instanceof d?e.configParseError:t instanceof f?e.specEvaluationFailure:e.error),y=/* @__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(`.`)),b=/* @__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`]]),x=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),S=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),ee=/* @__PURE__ */ new Map([[`∧`,`/\\`],[`∨`,`\\/`],[`¬`,`~`],[`⇒`,`=>`],[`⟹`,`=>`],[`≡`,`<=>`],[`⇔`,`<=>`],[`∈`,`\\in`],[`∉`,`\\notin`],[`⊆`,`\\subseteq`],[`⊂`,`\\subset`],[`⊇`,`\\supseteq`],[`⊃`,`\\supset`],[`∪`,`\\cup`],[`∩`,`\\cap`],[`×`,`\\X`],[`∀`,`\\A`],[`∃`,`\\E`],[`≠`,`#`],[`≤`,`<=`],[`≥`,`>=`],[`↦`,`|->`],[`→`,`->`],[`⟨`,`<<`],[`⟩`,`>>`],[`□`,`[]`],[`◇`,`<>`],[`≜`,`==`],[`′`,`'`],[`∘`,`\\o`],[`⋅`,`\\cdot`]]),te=/^\\([bB][01]+|[oO][0-7]+|[hH][0-9a-fA-F]+)/,C=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),w=e=>e.startsWith(`\\`)?parseInt(e.slice(2),C.get(e[1].toLowerCase())):Number(e),ne=/-{4,}[ \t]*MODULE\b/,re=e=>/[A-Za-z0-9_]/.test(e),ie=(e,t)=>{let n=e[t];if(n===`\\`&&/[A-Za-z]/.test(e[t+1]??``)){let n=/^[A-Za-z]+/.exec(e.slice(t+1))?.[0]??``,r={value:n.length};for(;r.value>0&&!b.has(n.slice(0,r.value));)r.value--;let i=b.get(n.slice(0,r.value));return{text:i??`\\`,length:i===void 0?1:r.value+1}}let r=ee.get(n);if(r)return{text:r,length:n.length};let i=S.find(n=>e.startsWith(n,t));return i?{text:x.get(i)??i,length:i.length}:n===`\\`?{text:`\\`,length:1}:void 0},T=e=>e!==void 0&&e>=`0`&&e<=`9`,E=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},D=(e,t)=>{if(e[t]!==`<`)return 0;let n=e[t+1]===`+`||e[t+1]===`*`?t+2:E(e,t+1,T);if(n===t+1||e[n]!==`>`)return 0;let r=E(e,n+1,re),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return E(e,i?r+1:r,e=>e===`.`)-t},O=(e,t)=>t===` `?e+8-e%8:e+1,ae=e=>{let t=ne.exec(e);if(!t)throw new u(`Expected a module header such as ---- MODULE Name ----`);let n=[],r=/* @__PURE__ */ new Map,i=e.slice(0,t.index).split(`
|
|
17
|
+
`),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=O(o.width,e[o.position]);return O(o.width,e[a.index])},c=(e,t,r)=>{let i=s();n.push({kind:e,text:t,line:a.line,column:i,endColumn:i+r-1}),a.index+=r},l=t=>{for(let n=0;n<t;n++)e[a.index]===`
|
|
18
|
+
`&&(a.line++,a.lineStart=a.index+1),a.index++},d=t=>new u(`${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[a.index];if(t===`
|
|
19
|
+
`||t===` `||t===` `||t===`\r`){l(1);continue}if(e.startsWith(`\\*`,a.index)){let t=e.indexOf(`
|
|
20
|
+
`,a.index);l((t===-1?e.length:t)-a.index);continue}if(e.startsWith(`(*`,a.index)){let t={value:0};do{if(a.index>=e.length)throw d(`Unterminated comment`);e.startsWith(`(*`,a.index)?(t.value++,l(2)):e.startsWith(`*)`,a.index)?(t.value--,l(2)):l(1)}while(t.value>0);continue}if(e.startsWith(`----`,a.index)){let t=E(e,a.index,e=>e===`-`)-a.index;e.slice(a.index+t).trimStart().startsWith(`MODULE`)&&a.moduleDepth++,c(`Separator`,`----`,t);continue}if(e.startsWith(`====`,a.index)){if(c(`ModuleEnd`,`====`,E(e,a.index,e=>e===`=`)-a.index),a.moduleDepth--,a.moduleDepth<=0)break;continue}if(t===`"`){let t=a.line,r=s(),i=[];for(l(1);e[a.index]!==`"`;){if(a.index>=e.length||e[a.index]===`
|
|
18
21
|
`)throw d(`Unterminated string`);if(e[a.index]===`\\`){let t=e[a.index+1];i.push({n:`
|
|
19
|
-
`,t:` `,r:`\r`,f:`\f`}[t]??t),
|
|
22
|
+
`,t:` `,r:`\r`,f:`\f`}[t]??t),l(2)}else i.push(e[a.index]),l(1)}l(1),n.push({kind:`String`,text:i.join(``),line:t,column:r,endColumn:s()-1});continue}let i=te.exec(e.slice(a.index,a.index+64));if(i){c(`Number`,i[0],i[0].length);continue}if(re(t)){let t=e.slice(a.index,E(e,a.index,re));if(/^\d+$/.test(t)){let n=/^\d+(\.\d+)?/.exec(e.slice(a.index))?.[0]??t;c(n.includes(`.`)?`Decimal`:`Number`,n,n.length);continue}if(t.startsWith(`WF_`)||t.startsWith(`SF_`)){c(`Keyword`,t.slice(0,3),3);continue}let n=r.get(t)??t;r.set(n,n),c(y.has(t)?`Keyword`:`Identifier`,n,t.length);continue}let o=D(e,a.index);if(o>0){c(`Step`,e.slice(a.index,a.index+o),o);continue}let u=ie(e,a.index);if(u)c(`Operator`,u.text,u.length);else throw d(`Unexpected character ${JSON.stringify(t)}`)}let f=s();return n.push({kind:`End`,text:``,line:a.line,column:f,endColumn:f}),n},k=/* @__PURE__ */ new Set([`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),oe=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`],A=e=>{let t=[],n={index:0,line:1};for(;n.index<e.length;){let r=e.slice(n.index),i=/^\s+/.exec(r)?.[0];if(i){n.line+=i.split(`
|
|
20
23
|
`).length-1,n.index+=i.length;continue}if(r.startsWith(`\\*`)){let e=r.indexOf(`
|
|
21
|
-
`);n.index+=e===-1?r.length:e;continue}if(r.startsWith(`(*`)){let e=r.indexOf(`*)`);if(e===-1)throw new
|
|
22
|
-
`).length-1,n.index+=e+2;continue}let a=/^\d+(?![A-Za-z_])/.exec(r)?.[0];if(a){t.push({kind:`Number`,text:a,line:n.line}),n.index+=a.length;continue}let o=/^[A-Za-z0-9_!]+/.exec(r)?.[0];if(o){t.push({kind:`Word`,text:o,line:n.line}),n.index+=o.length;continue}let s=/^"((?:[^"\\]|\\.)*)"/.exec(r);if(s){t.push({kind:`String`,text:s[1],line:n.line}),n.index+=s[0].length;continue}let c=E.find(e=>r.startsWith(e));if(c){t.push({kind:`Symbol`,text:c,line:n.line}),n.index+=c.length;continue}let u=ie(e,n.index);if(!u)throw new l(`Unexpected character ${JSON.stringify(r[0])} at line ${n.line}`);t.push({kind:`Word`,text:u.text,line:n.line}),n.index+=u.length}return t.push({kind:`End`,text:``,line:n.line}),t},ce=e=>{let t=D(e),n={index:0},r={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},i={isSet:!1},a=()=>t[n.index],o=()=>t[n.index++],s=e=>e.kind===`Word`&&T.has(e.text),c=e=>{let t=o();if(t.text!==e)throw new l(`Expected ${JSON.stringify(e)} but found ${JSON.stringify(t.text)} at line ${t.line}`)},u=()=>{let e=o();if(e.kind!==`Word`||s(e))throw new l(`Expected a name but found ${JSON.stringify(e.text)} at line ${e.line}`);return e.text},d=()=>a().kind===`Word`&&!s(a()),f=()=>{let e=[];for(;d();)e.push(o().text);return e},p=(e,t)=>{if(r[e]!==void 0)throw new l(`The keyword ${t} appears twice`);r[e]=u()},m=()=>{let e=o();if(e.kind===`Number`)return{kind:`Number`,value:Number(e.text)};if(e.kind===`String`)return{kind:`String`,value:e.text};if(e.text===`TRUE`||e.text===`FALSE`)return{kind:`Boolean`,value:e.text===`TRUE`};if(e.text===`{`){let e=[];for(a().text!==`}`&&e.push(m());a().text===`,`;)o(),e.push(m());return c(`}`),{kind:`Set`,elements:e}}if(e.kind===`Word`&&!s(e))return{kind:`ModelValue`,name:e.text};throw new l(`Expected a value but found ${JSON.stringify(e.text)} at line ${e.line}`)},h=()=>{if(a().text!==`[`)return;o();let e=u();return c(`]`),e},g=()=>{for(;d();){let e=o().text;if(a().text===`(`){o();let t=[];for(;a().text!==`)`;)t.push(m()),a().text!==`)`&&c(`,`);o(),c(`=`);let n=h();r.constants.push({name:e,value:m(),args:t,...n&&{module:n}});continue}if(a().text===`<-`){o();let t=h();r.substitutions.push({name:e,target:u(),...t&&{module:t}});continue}c(`=`);let t=h();r.constants.push({name:e,value:m(),...t&&{module:t}})}};for(;a().kind!==`End`;){let e=o();switch(e.text){case`CONSTANT`:case`CONSTANTS`:g();break;case`INIT`:p(`init`,e.text);break;case`NEXT`:p(`next`,e.text);break;case`SPECIFICATION`:p(`specification`,e.text);break;case`SYMMETRY`:p(`symmetry`,e.text);break;case`VIEW`:p(`view`,e.text);break;case`INVARIANT`:case`INVARIANTS`:r.invariants.push(...f());break;case`PROPERTY`:case`PROPERTIES`:r.properties.push(...f());break;case`CONSTRAINT`:case`CONSTRAINTS`:r.constraints.push(...f());break;case`ACTION_CONSTRAINT`:case`ACTION_CONSTRAINTS`:r.actionConstraints.push(...f());break;case`ALIAS`:p(`alias`,e.text);break;case`POSTCONDITION`:case`POSTCONDITIONS`:r.postconditions.push(...f());break;case`_POSSIBLE`:r.possible.push(...f());break;case`_PERIODIC`:p(`periodic`,e.text);break;case`_RL_REWARD`:p(`rlReward`,e.text);break;case`CHECK_DEADLOCK`:{if(i.isSet)throw new l(`The keyword CHECK_DEADLOCK appears twice`);i.isSet=!0;let e=o().text;if(e!==`TRUE`&&e!==`FALSE`)throw new l(`CHECK_DEADLOCK expects TRUE or FALSE but found ${JSON.stringify(e)}`);r.checkDeadlock=e===`TRUE`;break}default:throw new l(`Unexpected ${JSON.stringify(e.text)} at line ${e.line}`)}}if(r.specification!==void 0&&(r.init!==void 0||r.next!==void 0))throw new l(`SPECIFICATION cannot be combined with INIT or NEXT`);return r},O={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:` `}},k=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},le=e=>e!==void 0&&/^\p{Nd}$/u.test(e),ue=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),de=e=>{let t=t=>{let n=oe(e,t,k);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=oe(e,t,le);if(e.startsWith(`..`,n)&&le(e[n+2]))return{kind:`Constant`,first:t,last:oe(e,n+2,le)-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=le(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:oe(e,t+1,le)-1,children:[]};if(ue(n))return{kind:`Constant`,first:t,last:oe(e,t,ue)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},fe=e=>{let t=e.length===0?void 0:de(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=O[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},A=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,pe=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`,me=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:A(e)?`set`:`function`,he=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new d(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},ge={isUsed:!1},_e=(e,t)=>(ge.isUsed=!0,e.writtenKeys=t,e),ve=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[Yt(e.domain,t)]]),ye=(e,t,n)=>_e(Le(e,t),n),be=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(be);e.writtenKeys=void 0,e.range.forEach(be)}},xe=e=>e.every(e=>typeof e==`string`),Se=(e,t)=>e.length>0&&t.length>0&&xe(e)!==xe(t),Ce=(e,t)=>{ge.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Se(n,r)?rt(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=L(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=L(i[e],a[e]);if(t!==0)return t}return 0},N=(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=L(n[e],r[e]);if(t!==0)return t}return 0},we=e=>M(e)?e.type:void 0,Te=(e,t,n)=>{let r=we(e),i=we(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 u(`Attempted to ${a} the differently-typed model values ${U(e)} and ${U(t)}`)}throw r===void 0?new u(`Attempted to ${a} the typed model value ${U(t)} and the non-model value\n${U(e)}`):new u(`Attempted to ${a}${n?``:` the`} typed model value ${U(e)} and non-model value\n${U(t)}`)},Ee={ranks:Object.create(null),size:0},De=e=>{Ee.ranks=Object.create(null),Ee.size=0,Pe.clear();for(let t of e)Oe(t)},Oe=e=>(Ee.ranks[e]===void 0&&(Ee.ranks[e]=Ee.size++),e),ke=()=>Ee.size,P=e=>Ee.ranks[Oe(e)],Ae=(e,t)=>{if(e===t)return 0;let n=Ee.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},F=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),je=(e,t)=>(F(e)||F(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Me=(e,t,n)=>{if(!F(e))throw new u(`Attempted to ${n} the set ${U(z(e)?B(e):e,!0)} with the value:\n${U(t,!0)}`);if(!F(t))throw new u(`Attempted to compare overridden value ${U(e,!0)} with non-overridden value:\n${U(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 u(`Attempted to compare ${U(e,!0)} with the value\n${U(t,!0)}`)},I={kind:`InfiniteSet`,name:`Any`},Ne=e=>{throw new u(`Attempted to compare ANY with the value\n${U(e)}`)},L=(e,t)=>{if(e===t)return ge.isUsed&&be(e),e===I?Ne(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Ce(e,t);if(n===`Set`&&r===`Set`)return N(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&&Te(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return Te(e,t,!1),n===`ModelValue`?-1:1;if(e===I||t===I)return Ne(e===I?t:e);if(A(e)&&A(t)&&je(e,t))return Me(e,t,`compare`);let i=A(e);if(i!==A(t))throw new u(`Attempted to compare ${me(e)} ${U(e)} with ${me(t)} ${U(t)}`);return i?N(B(e),Ht(t)):Ce(H(e),H(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Ae(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(Te(e,t,!1),M(e))return-1;if(M(t))return 1;throw new u(`Attempted to compare ${me(e)} ${U(e)} with ${me(t)} ${U(t)}`)},Pe=/* @__PURE__ */ new Map,Fe=e=>{let t=Pe.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:P(e)};return Pe.set(e,n),n},Ie=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0}),Le=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0}),Re=(e,t)=>{if(e===t)return ge.isUsed&&be(e),e!==I||Ne(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Te(e,t,!0),L(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 Ce(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return N(e,t)===0;if(M(e)||M(t))return Te(e,t,!0),M(e)&&M(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Re(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=V(e.domain),r=V(t.domain);if(n||r)return n===r;let i=V(e.range),a=V(t.range);return i||a?i===a:Re(e.domain,t.domain)&&Re(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(V(e))return V(t);if(V(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]&&Re(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return V(e)?V(t):!V(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Re(e,t.factors[n]));let n=A(e)&&A(t)&&!(z(e)&&z(t));if(n&&je(e,t))return Me(e,t,`check equality of`)===0;if(n){if(!F(e)){let n=B(e);if(!F(t))return N(n,B(t))===0}return Mn(e)===Mn(t)}return L(e,t)===0},ze=(e,t)=>e===t||e.length===t.length&&e.every((e,n)=>Be(e,t[n])),Be=(e,t)=>e===t?!0:typeof e!=`object`||typeof t!=`object`?!1:e.kind===`Set`&&t.kind===`Set`?(e.hash===0||t.hash===0||e.hash===t.hash)&&ze(e.elements,t.elements):e.kind===`Function`&&t.kind===`Function`?(e.hash===0||t.hash===0||e.hash===t.hash)&&ze(e.domain,t.domain)&&ze(e.range,t.range):Mn(e)===Mn(t),Ve=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},He=e=>{if(!j(e))return;let t=H(e);return{domain:t.domain,range:t.range,low:Ve(t.domain)}},Ue=e=>{if(!j(e))return;let t=H(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},We=(e,t)=>{if(we(e)!==void 0)throw new u(`Attempted to compare the typed model value ${U(e)} and the non-model value\n${U(t)}`);return 1},Ge=(e,t)=>{if(we(e)!==void 0)throw new u(`Attempted to check equality of the typed model value ${U(e)} and the non-model value\n${U(t)}`);return!1},Ke=(e,t)=>{let n=we(e);if(n===void 0)return M(t)?e.rank-t.rank:-1;if(!M(t))throw new u(`Attempted to compare the typed model value ${U(e)} and non-model value\n${U(t)}`);let r=we(t);if(r!==void 0&&r!==n)throw new u(`Attempted to compare the differently-typed model values ${U(e)} and ${U(t)}`);return e.rank-t.rank},qe=(e,t)=>{let n=we(e);if(n===void 0)return M(t)&&e.name===t.name;if(!M(t))throw new u(`Attempted to check equality of typed model value ${U(e)} and non-model value\n${U(t)}`);let r=we(t);if(r!==void 0&&r!==n)throw new u(`Attempted to check equality of the differently-typed model values ${U(e)} and ${U(t)}`);return e.name===t.name},Je={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`}},Ye=(e,t,n)=>{let r=Je[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${U(e)} with ${r.other}:\n${U(t)}`},Xe=(e,t,n)=>{let r=He(n);if(!r){if(M(n))return We(n,t);throw new u(`Attempted to compare the function ${U(t)} with the value:\n${U(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>Ze(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 Ze(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 u(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${U(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},Ze=(e,t)=>{for(let n=0;n<e.length;n++){let r=rt(e[n],t[n]);if(r!==0)return r}return 0},Qe=(e,t)=>{let n=H(e);if(e.kind===`Function`&&Xt(n)!==void 0){let r=j(t)?Xt(t):void 0;return r?n.range.length-r.length||Ze(n.range,r):Xe({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=Ue(t);if(!r){if(M(t))return We(t,e);throw new u(`Attempted to compare record:\n${U(e)}\nwith non-record\n${U(t)}`)}return n.domain.length-r.domain.length||Ze(n.domain,r.domain)||Ze(n.range,r.range)}return Xe({...n,low:Ve(n.domain)},e,t)},$e=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),et=(e,t)=>F(e)||F(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),tt=(e,t)=>{let n=$e(t)?t:B(t);return{elements:B(e).elements,otherElements:B(n).elements}},nt=(e,t)=>{if(et(e,t))return L(e,t);if(!$e(e))return nt(B(e),t);if(!A(t)){if(M(t))return We(t,e);throw new u(`Attempted to compare the set ${U(e)} with the value:\n${U(t)}`)}let n=tt(e,t);return n.elements.length-n.otherElements.length||Ze(n.elements,n.otherElements)},rt=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return L(e,t);if(M(t))return We(t,e);throw new u(Ye(e,t,!1))}return e.kind===`ModelValue`?Ke(e,t):j(e)?Qe(e,t):nt(e,t)},it=(e,t)=>e.every((e,n)=>ct(e,t[n])),at=(e,t,n)=>{let r=He(n);if(!r){if(M(n))return Ge(n,t);throw new u(`Attempted to check equality of the function ${U(t)} with the value:\n${U(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)&&it(e.range,r.range);let i=e.low??r.low;return i===void 0?it(e.domain,r.domain)&&it(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new u(`Attempted to compare an integer with non-integer:\n${U(e)}.`);return e===i+t})&&it(e.range,r.range)},ot=(e,t)=>{let n=H(e);if(e.kind===`Function`&&Xt(n)!==void 0){let r=j(t)?Xt(t):void 0;return r?n.range.length===r.length&&it(n.range,r):at({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=Ue(t);if(!r){if(M(t))return Ge(t,e);throw new u(`Attempted to check equality of record:\n${U(e)}\nwith non-record\n${U(t)}`)}return n.domain.length===r.domain.length&&it(n.domain,r.domain)&&it(n.range,r.range)}return at({...n,low:Ve(n.domain)},e,t)},st=(e,t)=>{if(et(e,t))return Re(e,t);if(!$e(e))return st(B(e),t);if(!A(t)){if(M(t))return Ge(t,e);throw new u(`Attempted to check equality of the set ${U(e)} with the value:\n${U(t)}`)}let n=tt(e,t);return n.elements.length===n.otherElements.length&&it(n.elements,n.otherElements)},ct=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(M(t))return Ge(t,e);throw new u(Ye(e,t,!0))}return e.kind===`ModelValue`?qe(e,t):j(e)?ot(e,t):st(e,t)},lt=e=>{let t=[];for(let n of e){let e={low:0,high:t.length,comparison:1};for(;e.low<e.high;){let r=e.low+(e.high-e.low>>1);if(e.comparison=rt(n,t[r]),e.comparison===0)break;e.comparison<0?e.high=r:e.low=r+1}e.comparison!==0&&t.splice(e.low,0,n)}return t},ut=(e,t)=>t.some(t=>ct(t,e)),dt=(e,t)=>{try{return Re(e,t)}catch(n){if(!(n instanceof u))throw n;return ct(e,t)}},ft=e=>{for(let t=1;t<e.length;t++)if(L(e[t],e[t-1])<=0)return!1;return!0},pt=e=>{if(e.length<2||ft(e))return Ie(e);let t=[...e].sort(L),n=[t[0]];for(let e=1;e<t.length;e++)L(n[n.length-1],t[e])!==0&&n.push(t[e]);return Ie(n)},mt=e=>{try{return pt(e)}catch(t){if(!(t instanceof u))throw t;return{kind:`MixedSet`,elements:e}}},ht=Ie([]),gt=(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&&L(r[a],t)<0;)a++;a<r.length&&L(r[a],t)===0||i.push(t)}return i.length===n.length?e:Ie(i)},_t=(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&&L(r[a],t)<0;)a++;a<r.length&&L(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Ie(i)},vt=(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=L(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=Ie(i);if(e.hash!==0){let t=e.hash;for(let e=0;e<a.length;e++)t=t+bn(a[e])|0;c.hash=t}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Dn(a[e])|0;c.fingerprint=t}return c},yt=e=>{let t=e.length<2?e:[...e].sort((e,t)=>L(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&L(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Le(n,r)},bt=e=>{let t=yt(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:_e(t,e.map(e=>e[0]))},xt=[],St=[],Ct=/* @__PURE__ */ new WeakMap,wt=e=>{let t=xt[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return xt[e]=n,n},Tt=e=>{if(Kt(e),e.low===1&&e.high>=1)return wt(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Et=e=>e.length>0&&(e===xt[e.length]||Ct.has(e)),Dt=e=>{let t=B(e).elements;return Et(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Ot=e=>{let t=St[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return St[e]=n,n},R=e=>Le(wt(e.length),e),kt=e=>yt(e),At=e=>A(e)&&!F(e),jt=(e,t=!1)=>`UNION(${U(e.base,t)})`,Mt=(e,t=e=>B(e).elements)=>{if(!At(e.base))throw new u(`Attempted to enumerate the nonenumerable set:\n${jt(e)}`);return t(e.base)},Nt=(e,t,n)=>{if(At(e))return e;throw new u(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${U(e)}\nwhen enumerating:\n${jt(n)}`)},z=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 z(e.base);case`FunctionSet`:return z(e.domain)&&z(e.range)||Pt(e.domain)===!0||Pt(e)===!0;case`RecordSet`:return e.sets.every(z)||Pt(e)===!0;case`ProductSet`:return e.factors.every(z)||Pt(e)===!0;case`Union`:return z(e.base)&&Ut(e.base).every(z);case`SetOperation`:return e.operator===`\\cup`?z(e.left)&&z(e.right):e.operator===`\\cap`?z(e.left)||z(e.right):z(e.left);default:return!1}},Pt=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=Pt(e.domain);return t===void 0?void 0:!t&&Pt(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Pt(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return z(e)?B(e).elements.length===0:void 0;default:return}},Ft=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},It=(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},Lt=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Ie(r.map(t=>e[t])));while(It(r,e.length))}return t},Rt=e=>{if(typeof e!=`object`)throw new u(`Expected a set but found ${U(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return lt(e.elements);case`Interval`:{let t=Tt(e);return t!==xt[t.length]&&Ct.set(t,e),t}case`Subset`:{F(e.base)&&Kt(e.base);let t=B(e.base).elements;if(t.length>30)throw new u(Gt(e));return Lt(t)}case`FunctionSet`:{if(V(e))return[];if(F(e.domain))throw new u(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${U(e.domain)}\ncannot be enumerated.`);let t=Dt(e.domain);if(t.length>0&&F(e.range))throw new u(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${U(e.range)}\ncannot be enumerated.`);let n=t.length===0?[]:B(e.range).elements;return Ft(t.map(()=>n)).map(e=>Le(t,e))}case`RecordSet`:{if(V(e))return[];let t=e.sets.map((t,n)=>{if(F(t))throw new u(`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${U(t)}`);return B(t).elements});return Ft(t).map(t=>kt(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(V(e))return[];let t=e.factors.map((e,t)=>{if(F(e))throw new u(`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${U(e)}`);return B(e).elements});return Ft(t).map(R)}case`FilteredSet`:if(F(e.base))throw new u(`Attempted to enumerate { x \\in S : p(x) } when S:\n${U(e.base)}\nis not enumerable`);return B(e.base).elements.filter(e.test);case`Union`:{let t=Mt(e).flatMap((t,n)=>B(Nt(t,n,e)).elements);return B(mt(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(F(e.left)||F(e.right)))throw new u(`Attempted to enumerate S \\cup T when S:\n${U(e.left)}\nand T:\n${U(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&F(e.left)&&F(e.right))throw new u(`Attempted to enumerate S \\cap T when neither S:\n${U(e.left)}\nnor T:\n${U(e.right)}\nis enumerable`);if(e.operator===`\\`&&F(e.left))throw new u(`Attempted to enumerate S \\ T when S:\n${U(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return vt(B(e.left),B(e.right)).elements;let t=e.operator===`\\`||z(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return B(n).elements.filter(t=>$t(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new u(`Attempted to enumerate the non-enumerable set ${U(e)}`);default:throw new u(`Expected a set but found ${U(e)}`)}},zt=/* @__PURE__ */ new WeakMap,Bt=/* @__PURE__ */ new WeakMap,B=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Ie(Rt(e));let t=typeof e==`object`?zt.get(e):void 0;if(t)return t;let n=(typeof e==`object`?Bt.get(e):void 0)??Vt(e);return typeof e==`object`&&zt.set(e,n),n},Vt=e=>{let t=Rt(e);return typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?Ie(t):pt(t)},Ht=e=>{if(typeof e!=`object`||e.kind!==`Union`&&e.kind!==`SetOperation`&&e.kind!==`FilteredSet`||zt.has(e))return B(e);let t=Bt.get(e);if(t)return t;let n=Vt(e);return Bt.set(e,n),n},Ut=e=>{if(typeof e!=`object`||zt.has(e))return B(e).elements;if(e.kind===`Union`)return Mt(e,Ut).flatMap((t,n)=>Ut(Nt(t,n,e)));if(e.kind===`FilteredSet`&&!F(e.base))return Ut(e.base).filter(e.test);if(e.kind!==`SetOperation`)return B(e).elements;if(e.operator===`\\cup`)return F(e.left)||F(e.right)?B(e).elements:[...Ut(e.left),...Ut(e.right)];let t=e.operator===`\\`||z(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return F(n)?B(e).elements:Ut(n).filter(t=>$t(t,r)===(e.operator===`\\cap`))},V=e=>{if(typeof e!=`object`||!A(e))throw new u(`Shouldn't call isEmpty() on value ${U(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 u(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(V);case`RecordSet`:return e.sets.some(V);case`FunctionSet`:return!V(e.domain)&&V(e.range);case`Union`:return Mt(e).every((t,n)=>V(Nt(t,n,e)));default:return B(e).elements.length===0}},Wt=(e,t)=>e.reduce((e,n)=>{let r=e*Kt(n);if(r>2147483647)throw new u(t());return r},1),Gt=e=>`Overflow when computing the number of elements in:\n${U(e)}`,Kt=e=>{if(typeof e!=`object`)return B(e).elements.length;switch(e.kind){case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new u(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new u(`Attempted to compute the number of elements in the overridden value ${U(e)}.`);case`Subset`:{let t=Kt(e.base);if(t>=31)throw new u(Gt(e));return 2**t}case`FunctionSet`:{if(V(e.domain))return 1;if(V(e.range))return 0;let t=Kt(e.range);if(t===1)return 1;let n=Kt(e.domain),r={value:1};for(let i=0;i<n;i++)if(r.value*=t,r.value>2147483647)throw new u(Gt(e));return r.value}case`RecordSet`:return V(e)?0:Wt(e.sets,()=>Gt(e));case`ProductSet`:return V(e)?0:Wt(e.factors,()=>`Overflow when computing the number of elements in ${U(e)}`);default:return B(e).elements.length}},qt=e=>`Attempted to check if the set ${U(e)}is finite.`,Jt=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new u(`Attempted to check if the ${me(e)} ${U(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new u(`Attempted to check if the function:\n${U(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Jt(e.base)&&V(e.base);case`Subset`:return Jt(e.base);case`FunctionSet`:{let t=Jt(e.domain);if(t&&V(e.domain))return!0;let n=Jt(e.range);return n&&V(e.range)?!0:n&&(t||Kt(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(!Jt(e))n.isAllFinite=!1;else if(V(e))return!0;return n.isAllFinite}case`Union`:if(!At(e.base))throw new u(`Attempted to check if the nonenumerable set:\n${jt(e)}\nis a finite set.`);return B(e.base).elements.every(Jt);case`SetOperation`:if(e.operator===`\\cup`)return Jt(e.left)&&Jt(e.right);if(e.operator===`\\cap`){if(!Jt(e.left)&&!Jt(e.right))throw new u(qt(e));return!0}if(Jt(e.left))return!0;if(!Jt(e.right))throw new u(qt(e));return!1;case`FilteredSet`:if(!Jt(e.base))throw new u(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${U(e.base)}\nis finite.`);return!0}},Yt=(e,t)=>{let n={low:0,high:e.length-1};for(;n.low<=n.high;){let r=n.low+n.high>>1,i=L(e[r],t);if(i===0)return r;i<0?n.low=r+1:n.high=r-1}return-1},Xt=e=>{if(typeof e!=`object`||!j(e))return;let t=H(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Zt=(e,t)=>`Attempted to check if the value ${U(e)} is an element of ${U(t)}`,Qt=(e,t)=>{let n=`Attempted to check if the value:\n${U(e)}\nis an element of the`;if(!j(t))return`${n} ${me(t)} ${U(t)}`;let r=t.kind===`Function`||z(t.domain)?H(t).domain:[];return r.length>0&&r.every(e=>typeof e==`string`)?`Attempted to check if element:\n${U(e)}\nis in the record:\n${U(t)}`:r.every((e,t)=>e===t+1)?`Attempted to check set membership in a tuple value.`:`${n} function ${U(t)}`},$t=(e,t)=>{if(!A(t))throw new u(Qt(e,t));switch(t.kind){case`Set`:try{return Yt(t.elements,e)!==-1}catch(n){if(!(n instanceof u))throw n;return ut(e,t.elements)}case`MixedSet`:return ut(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 u(`Attempted to check if the value:\n${U(e)}\nis in the integer interval ${U(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 u(`Attempted to check if the value:\n${U(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!A(e))throw new u(Zt(e,t));return B(e).elements.every(e=>$t(e,t.base));case`FunctionSet`:{if(!j(e)){if(M(e))return!1;throw new u(Zt(e,t))}let n=H(e),r=Ve(n.domain);return(r===void 0?dt(t.domain,Ie(n.domain)):dt({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>$t(e,t.range))}case`RecordSet`:{let n=j(e)?H(e):void 0;if(!n||!xe(n.domain)){if(M(e))return!1;throw new u(`Attempted to check if non-record\n${U(e)}\nis in the set of records:\n${U(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=Yt(n.domain,e);return i!==-1&&$t(n.range[i],t.sets[r])})}case`ProductSet`:{let n=j(e)?Xt(e):void 0;if(n===void 0){if(j(e)&&H(e).domain.every(e=>typeof e==`number`)||M(e))return!1;throw new u(`Attempted to check if non-tuple\n${U(e)}\nis in the set of tuples:\n${U(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>$t(e,t.factors[n]))}case`FilteredSet`:return $t(e,t.base)&&t.test(e);case`Union`:if(!At(t.base))throw new u(`Attempted to check if:\n ${U(e)}\nis an element of the non-enumerable set:\n ${jt(t)}`);return B(t.base).elements.some(t=>$t(e,t));case`SetOperation`:return t.operator===`\\cup`?$t(e,t.left)||$t(e,t.right):$t(e,t.left)&&$t(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Xt(e);if(n===void 0){if(M(e))return!1;throw new u(Zt(e,t))}return n.every(e=>$t(e,t.base))}default:throw new u(Qt(e,t))}},en=(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?$t(e,n):e.range.every((e,r)=>en(e,t.range[r],n.range)),H=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){z(e.domain)||Kt(e.domain);let t=Dt(e.domain);return Le(t,t.map(t=>e.apply(t)))}throw new u(`Expected a function but found ${U(e)}`)},tn=/* @__PURE__ */ new WeakSet,nn=e=>(tn.add(e),e),rn=e=>{let t=e.domain;return t.length===0?tn.has(e)?`FcnRcdValue`:`TupleValue`:t===xt[t.length]?`TupleValue`:Ct.has(t)?`IntervalFcnRcdValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},an=(e,t)=>`Attempted to apply function:\n${fe(U(e))}\nto argument ${fe(U(t))}, which is not in the domain of the function.`,on=e=>`Attempted to apply function with integer domain to the non-integer argument ${fe(U(e))}`,sn=(e,t)=>{if(tn.has(e)||e.kind===`LazyFunction`)return`In applying the function\n${fe(U(e))},\nthe first argument is:\n${fe(U(t))}\nwhich is not in its domain.\n`;let n=rn(e);return n===`TupleValue`?typeof t==`number`?`Attempted to access index ${t} of tuple\n${fe(U(e))}\nwhich is out of bounds.`:`Attempted to access tuple at a non integral index: ${fe(U(t))}`:n===`RecordValue`?typeof t==`string`?`Attempted to access nonexistent field '${t}' of record\n${fe(U(e))}`:`Attempted to access record by a non-string argument: ${fe(U(t))}`:n===`IntervalFcnRcdValue`&&typeof t!=`number`?on(t):an(e,t)},cn=(e,t)=>rn(e)===`FcnRcdValue`?an(e,t):on(t),ln=e=>rn(e)===`RecordValue`,un=(e,t)=>{let n=e[0];return typeof n==`number`?typeof t!=`number`&&(e===xt[e.length]||Ct.has(e)):typeof n==`string`&&typeof t!=`string`},dn=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}if(e.length<=8){for(let n=0;n<e.length;n++)if(e[n]===t)return n}return Yt(e,t)},fn=(e,t,n,r)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!$t(t,e.domain))throw new u(tn.has(e)?sn(e,t):`Attempted to apply a function to ${U(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new u(r?.(e)??`Attempted to apply ${U(e)}, which is not a function`);let i=un(e.domain,t)?-1:dn(e.domain,t);if(i===-1)throw new u(n?.(e)??sn(e,t));return e.range[i]},pn=e=>Et(e)?Ct.get(e)??Ot(e.length):void 0,mn=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=H(e).domain;return pn(t)??Ie(t)},hn=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!z(e.domain))){if(!$t(t,e.domain))return e;let r=n(e.apply(t));return{kind:`LazyFunction`,domain:e.domain,apply:n=>dt(t,n)?r:e.apply(n),source:e.source}}let i=H(e),a=dn(i.domain,t);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Le(i.domain,o);if(l.writtenKeys=i.writtenKeys,i.hash!==0){let e=i.domain[a];l.hash=s===c?i.hash:i.hash-xn(e,s)+xn(e,c)|0}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-On(e,s)+On(e,c)|0}return l},gn=/* @__PURE__ */ new WeakMap,_n=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},vn=(e,t)=>Math.imul(e^t,16777619),yn=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return _n(t)},bn=e=>_n(Cn(e)+2654435769|0),xn=(e,t)=>_n(Math.imul(Cn(e),668265261)+Cn(t)|0),Sn=e=>{if(e.kind===`ModelValue`)return _n(vn(yn(e.name),109));if(A(e)){if(!z(e))return yn(Mn(e));let t=B(e).elements,n=1940243425;for(let e=0;e<t.length;e++)n=n+bn(t[e])|0;return n}let t=H(e),n=1725019383;for(let e=0;e<t.domain.length;e++)n=n+xn(t.domain[e],t.range[e])|0;return n},Cn=e=>{if(typeof e==`number`)return _n(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return yn(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=Sn(e)),e.hash;let t=gn.get(e);if(t!==void 0)return t;let n=Sn(e);return gn.set(e,n),n},wn=/* @__PURE__ */ new WeakMap,Tn=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},En=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Tn(t)},Dn=e=>Tn(An(e)+2135587861|0),On=(e,t)=>Tn(Math.imul(An(e),374761393)+An(t)|0),kn=e=>{if(e.kind===`ModelValue`)return Tn(En(e.name)^60);if(A(e)){if(!z(e))return En(Mn(e));let t=B(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Dn(t[e])|0;return n}let t=H(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+On(t.domain[e],t.range[e])|0;return n},An=e=>{if(typeof e==`number`)return Tn(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return En(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=kn(e)),e.fingerprint;let t=wn.get(e);if(t!==void 0)return t;let n=kn(e);return wn.set(e,n),n},jn=/* @__PURE__ */ new WeakMap,Mn=e=>{if(typeof e==`boolean`)return e?`T`:`F`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return JSON.stringify(e);let t=jn.get(e);if(t!==void 0)return t;let n=Nn(e);return jn.set(e,n),n},Nn=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${Mn(e.base)}>`;if(e.kind===`FilteredSet`&&!z(e))throw new u(`Attempted to compare the non-enumerable set ${U(e)} with another value`);if(A(e))return z(e)?`{${B(e).elements.map(Mn).join(`,`)}}`:`<${e.kind} ${U(e)}>`;let t=H(e);return`(${t.domain.map((e,n)=>`${Mn(e)}:${Mn(t.range[n])}`).join(`,`)})`},Pn=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,Fn=e=>e.reduce((e,t)=>e===0?0:e*Kt(t),1),In=e=>{if(e.kind===`Subset`)return Kt(e.base)<=6?B(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return B(e);if(e.kind===`FunctionSet`&&z(e.domain)&&Kt(e.domain)===0)return Ie([Le([],[])]);let t=e.kind===`FunctionSet`?Kt(e.range)**Kt(e.domain):Fn(e.kind===`RecordSet`?e.sets:e.factors);return t===0?ht:t<=1999?B(e):void 0},Ln=(e,t)=>{if(t)return In(e);if(z(e))try{return In(e)}catch(e){if(e instanceof u)return;throw e}},Rn=(e,t)=>{let n=e=>U(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`{x \\in ${n(e.base)} : ...}`;case`Union`:return jt(e,t)}},zn=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),U=(e,t=!1,n=!1)=>{let r=e=>U(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Pn(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(B(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=Ln(e,t);return n?r(n):Rn(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{if(e.kind===`LazyFunction`&&!z(e.domain)){let t=e.source;return t?`[${t.parameters.map(e=>`${e.name} \\in ${U(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}let i=H(e),a=r=>U(r,t,n&&e.kind===`Function`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:i.domain.every(e=>typeof e==`string`&&zn(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):ve(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},Bn=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${fe(U(n))}\n`).join(``)},Vn=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Hn=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Cn(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Be(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Be(i[e],n))return i[e]}return n.kind===`Set`?Vn(n.elements,t):(Vn(n.domain,t),Vn(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}},Un=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`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:[])}},W=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,Wn=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),Gn=(e,t)=>Wn.has(e)?new u(t):new d(t),Kn=e=>typeof e==`object`&&e.kind===`Operator`,G=(e,t,n)=>{let r=e[t];if(r===void 0||Kn(r))throw Gn(n,`${n} expects a value as argument ${t+1}`);return r},qn=(e,t,n)=>{let r=G(e,t,n);if(typeof r!=`number`)throw Gn(n,`${n} expects an integer but received ${U(r)}`);return r},Jn=(e,t,n)=>{let r=G(e,t,n);if(typeof r!=`boolean`)throw Gn(n,`${n} expects a boolean but received ${U(r)}`);return r},Yn=(e,t,n)=>{let r=G(e,t,n);if(!A(r))throw Gn(n,`${n} expects a set but received ${U(r)}`);return r},Xn=(e,t,n)=>{let r=Yn(e,t,n);if(!z(r))throw Gn(n,`${n} cannot enumerate the non-enumerable set ${U(r)}`);return r},Zn=(e,t,n)=>B(Xn(e,t,n)),Qn=(e,t,n)=>Zn(e,t,n).elements,$n=(e,t,n)=>{let r=G(e,t,n),i=Xt(r);if(!i)throw Gn(n,`${n} expects a sequence but received ${U(r)}`);return i},er=(e,t,n)=>{let r=G(e,t,n);if(!j(r))throw Gn(n,`${n} expects a function but received ${U(r)}`);return H(r)},tr=(e,t,n)=>{let r=e[t];if(r===void 0||!Kn(r))throw Gn(n,`${n} expects an operator as argument ${t+1}`);return r},nr=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),K=(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}),rr=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),ir=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),ar=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(G(n,0,e),G(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),or=e=>e>2147483647||e<-2147483648,sr=e=>new d(`Overflow when computing ${e}`),cr={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`},lr={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},ur={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`},dr=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return lr[e.operator];if(e.kind!==`Function`)return cr[e.kind];let t=e.domain;return t.every((e,t)=>e===t+1)?`TupleValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},fr=e=>ur[dr(e)],pr=(e,t)=>new u(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),mr=(e,t)=>{let n=n=>(...r)=>{try{return n(...r)}catch(n){throw n instanceof u&&(e.isLazy===!0||!(n instanceof d))?pr(t,n.message):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},hr=(e,t)=>{if(typeof e!=`number`)throw pr(t,`Cannot cast tlc2.value.impl.${dr(e)} to tlc2.value.impl.IntValue`);return e},gr=(e,t,n)=>`public static tlc2.value.impl.${t} tlc2.module.Integers.${e}(${Array.from({length:n},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,_r=(e,t,n)=>{let r=gr(t,`IntValue`,2);return ar(e,(t,i)=>{let a=hr(t,r),o=hr(i,r),s=n(a,o);if(or(s))throw sr(`${a}${e}${o}`);return s})},vr=(e,t,n)=>{if(typeof e!=`number`)throw new d(`The ${t} argument of ${n} should be an integer, but instead it is:\n${U(e)}`);return e},yr=(e,t)=>ar(e,(n,r)=>t(vr(n,`first`,e),vr(r,`second`,e))),br=(e,t,n)=>({...ir(e,t,n),isLazy:!0}),xr=(e,t,n)=>{let r=tr(e,t,n);return()=>r.call([])},Sr=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Cr=()=>({bool:so,condition:(e,t)=>{if(typeof e!=`boolean`)throw Ja(t,e);return e},conjunct:(e,t,n)=>{if(typeof e!=`boolean`)throw Ya(t,n,e);return e},apply:fn,tuple:R,set:mt,record:Le,writtenRecord:ye,equal:Re,enumerate:po,unassigned:(e,t)=>{throw Rs(e,t)},primeOutsideAction:e=>{throw zs(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0}),extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>io(e,t,n[r]),e.scope),state:e.state,next:e.next})}),wr={value:void 0},Tr=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Er=e=>`local${e.counter++}`,Dr=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),Un(e).forEach(e=>Dr(e,t)),t),Or=(e,t,n)=>{let r=Tr(e,Y(t,e.environment)),i=Dr(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Tr(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},kr=(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(()=>Er(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${jr(e,t.set,s)}, ${Tr(e,t.set)});`),u=t.bounds.map(t=>{let n=Er(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${jr(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=Er(e);return`for (let ${i} = 0; ${i} < ${c[r]}.length; ${i}++) { const ${n} = ${c[r]}[${i}]; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},Ar=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${jr(e,r[0],n)}, "the left side of =>") ? bool(${jr(e,r[1],n)}, "the right side of =>") : true)`;if(W(t))return Or(e,t,n);let i=Do(t.operator,e.environment);if(i?.kind!==`Builtin`)return Or(e,t,n);if(i.name===`DOMAIN`)return`${Tr(e,$a(t))}(${jr(e,r[0],n)})`;if(i.name===`TLCEval`)return Or(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Tr(e,eo(t,i))}(${jr(e,r[0],n)}, ${jr(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&vs(r[0],a))return`${Tr(e,i.evaluateUnary)}(${jr(e,r[0],n)})`;let o=r.length===2&&vs(r[0],a)&&vs(r[1],a);return i.evaluateBinary&&o?`${Tr(e,i.evaluateBinary)}(${jr(e,r[0],n)}, ${jr(e,r[1],n)})`:Or(e,t,n)},jr=(e,t,n)=>{let r=(t,r=n)=>jr(e,t,r);if(cs(t)&&rs(t,e.environment))return Or(e,t,n);switch(t.kind){case`Number`:return Go(t.value)?String(t.value):Or(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(W(t))return Or(e,t,n);let i=Lo(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Tr(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Tr(e,i.value):Or(e,t,n)}case`Apply`:return Ar(e,t,n);case`And`:{let n=Tr(e,t);return`(${t.operands.map((e,t)=>`conjunct(${r(e)}, ${n}, ${t})`).join(` && `)})`}case`Or`:return`(${t.operands.map(e=>`bool(${r(e)}, "a disjunct")`).join(` || `)})`;case`If`:return`(condition(${r(t.condition)}, ${Tr(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Ms(t.function);let n=r(t.function),i=Tr(e,Za(t));return t.args.length===1?`apply(${n}, ${r(t.args[0])}, undefined, ${i})`:`apply(${n}, tuple([${t.args.map(e=>r(e)).join(`, `)}]), undefined, ${i})`}case`FieldAccess`:return`apply(${r(t.record)}, ${JSON.stringify(t.field)}, ${Tr(e,Xa(t))}, ${Tr(e,Qa(t))})`;case`Record`:{let i=Is(t.fields);if(Ls(i))return Or(e,t,n);let a=Tr(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}, ${Tr(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=Tr(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`)?kr(e,t,n):Or(e,t,n);default:return Or(e,t,n)}},Mr=(e,t)=>{if(!Sr.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=jr(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(`
|
|
23
|
-
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; return ${r}; };`;wr.value??=Cr();let o=wr.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},Nr={kind:`Local`},Pr=/* @__PURE__ */ new WeakMap,Fr=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Ir=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2}])),Lr=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Rr=e=>e.kind===`Operator`?e.params.length:0,zr=e=>e.name.includes(`!`),Br=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Vr=(e,t,n=0)=>t.reduce((e,t)=>({name:t,arity:n,parent:e}),e),Hr=(e,t)=>t.reduce((e,t)=>({name:t.name,arity:t.arity,parent:e}),e),Ur=e=>e.kind===`Name`?[e.name]:e.names,Wr=e=>e.flatMap(e=>Ur(e.pattern)),Gr=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||Lr(n.location,t.location))?n:void 0},Kr=(e,t)=>{let n=Gr(e,t);return n?{key:t.getKey(n),arity:Rr(n)}:t.imported.get(e)},qr=e=>e[0].toLowerCase()===e[0].toUpperCase()&&e[0]!==`_`&&(e[0]<`0`||e[0]>`9`),Jr=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Yr=(e,t,n,r)=>{let i=e.location,a=Pr.get(e);if(a!==void 0)return a;if(Fr(t))return e.kind===`Apply`?e.args.length:0;if(Jr(t))return 0;let o=Br(n,t);if(o&&e.kind!==`OperatorReference`&&(e.resolution=Nr),o)return o.arity;let s=Kr(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Pr.set(e,s.arity),s.arity;let l=t.slice(0,t.indexOf(`!`));if(l!==``&&(Br(n,l)!==void 0||Kr(l,r)!==void 0||r.facts.has(l)))return e.kind===`Apply`?e.args.length:0;let u=`at line ${i.line}, column ${i.column}`;throw new c(qr(t)?`Could not find declaration or definition of symbol '${t}' ${u}`:`Unknown operator: \`${t}' ${u}`)},Xr=(e,t,n)=>(e.forEach(e=>q(e.set,t,n)),e.reduce((e,t)=>Vr(e,Ur(t.pattern)),t)),Zr=(e,t)=>e.kind===`Identifier`&&e.name===t&&W(e)||Un(e).some(e=>Zr(e,t)),Qr=(e,t)=>{e.kind===`FunctionConstruction`&&Zr(e.body,t)&&(e.isRecursive=!0),Un(e).forEach(e=>Qr(e,t))},$r=(e,t,n)=>{let r=Vr(t,e.kind===`Function`?[e.name]:[]);e.kind===`Function`?(q(e.body,Xr(e.bounds,r,n),n),Qr(e.body,e.name)):q(e.body,Hr(r,e.params),n)},ei=(e,t,n)=>{let r=e.filter(e=>e.isRecursive).reduce((e,t)=>({name:t.name,arity:Rr(t),parent:e}),t);return e.reduce((e,t)=>(zr(t)||$r(t,e,n),{name:t.name,arity:Rr(t),parent:e}),r)},ti=(e,t,n,r,i)=>{let a=e.kind===`Operator`?e.params[t]:void 0,o=n.location;if(a?.arity===0&&r>0)throw new c(`Operator used in argument number ${t+1} has incorrect number of arguments at line ${o.line}, column ${o.column}`);let s=i?.kind===`Operator`&&i.params.some(e=>e.arity>0);if(a!==void 0&&a.arity>0&&(r!==a.arity||s))throw new c(`Argument number ${t+1} to operator '${e.name}' should be a ${a.arity}-parameter operator at line ${o.line}, column ${o.column}`)},ni=e=>e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:void 0,ri=(e,t,n)=>{let r=Br(t,e.operator)?void 0:Gr(e.operator,n),i=Yr(e,e.operator,t,n);if(i!==e.args.length)throw new c(`The operator ${e.operator} requires ${i} arguments at line ${e.location.line}, column ${e.location.column}`);e.args.forEach((e,i)=>{let a=ni(e),o=a===void 0||Br(t,a)?void 0:Gr(a,n),s=ii(e,t,n);r&&ti(r,i,e,s,o)})},ii=(e,t,n)=>e.kind===`Identifier`?Yr(e,e.name,t,n):e.kind===`OperatorReference`?Yr(e,e.operator,t,n):(q(e,t,n),e.kind===`Lambda`?e.params.length:0),q=(e,t,n)=>{let r=e=>e.forEach(e=>q(e,t,n));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{let r=Yr(e,e.name,t,n);if(r>0)throw new c(`The operator ${e.name} requires ${r} arguments at line ${e.location.line}, column ${e.location.column}`);return}case`OperatorReference`:Yr(e,e.operator,t,n);return;case`Apply`:ri(e,t,n);return;case`Lambda`:q(e.body,Vr(t,e.params),n);return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:q(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&&q(e.other,t,n);return;case`Let`:q(e.body,ei(e.definitions,t,n),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:q(e.body,Xr(e.bounds,t,n),n);return;case`UnboundedQuantifier`:q(e.body,Vr(t,e.names),n);return;case`Choose`:e.set&&q(e.set,t,n),q(e.body,Vr(t,Ur(e.pattern)),n);return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:q(e.predicate,Xr([e.bound],t,n),n);return;case`SetMap`:q(e.expression,Xr(e.bounds,t,n),n);return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:if(new Set(e.fields.map(e=>e.name)).size<e.fields.length)throw new c(`Non-unique fields in constructor at line ${e.location.line}, column ${e.location.column}`);r(e.fields.map(e=>e.value));return;case`Except`:r([e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])]);return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:q(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`:q(e.body,t,n);return;case`Subexpression`:e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>ii(e,t,n))}},ai=(e,t,n)=>(e.set&&q(e.set,t,n),{name:e.name,arity:e.arity,parent:t}),oi=(e,t,n)=>{let r=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?ai(t,e,n):(t.kind===`AssumeProve`?oi(t,e,n):q(t,e,n),e),t);return q(e.conclusion,r,n),r},si=(e,t,n)=>e.kind===`AssumeProve`?oi(e,t,n):(q(e,t,n),t),ci=(e,t,n)=>{e?.kind===`Steps`&&e.steps.reduce((e,t)=>li(t,e,n),t)},li=(e,t,n)=>{let r=e.body;switch(r.kind){case`Assert`:{let i=si(r.statement,t,n);return ci(e.proof,i,n),r.isSuffices?i:t}case`Define`:return ei(r.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),t,n);case`Have`:case`Case`:return q(r.expression,t,n),ci(e.proof,t,n),t;case`Witness`:return r.expressions.forEach(e=>q(e,t,n)),t;case`Take`:return Vr(Xr(r.bounds,t,n),r.names);case`Pick`:{let i=Vr(Xr(r.bounds,t,n),r.names);return q(r.body,i,n),ci(e.proof,t,n),i}default:return ci(e.proof,t,n),t}},ui=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:si(e.statement,void 0,t);ci(e.proof,n,t)},di=(e,t)=>new c(`Multiply-defined symbol '${e}' at line ${t.line}, column ${t.column}`),fi=(e,t,n,r)=>t.reduce((e,t)=>{if(Br(e,t)||n(t))throw di(t,r);return{name:t,arity:0,parent:e}},e),pi=(e,t,n,r)=>(e.forEach(e=>hi(e.set,t,n)),e.reduce((e,t)=>fi(e,Ur(t.pattern),n,r),t)),mi=(e,t,n)=>{if(e.kind===`Function`){let r=Vr(t,[e.name]),i=pi(e.bounds,r,n,e.location);hi(e.body,i,n);return}let r=fi(t,e.params.map(e=>e.name),n,e.location);hi(e.body,r,n)},hi=(e,t,n)=>{let r=e.location;switch(e.kind){case`Lambda`:hi(e.body,fi(t,e.params,n,r),n);return;case`Let`:{let i=e.definitions.filter(e=>e.isRecursive).map(e=>e.name),a=e.definitions.reduce((e,t)=>{if(Br(e,t.name)||n(t.name))throw di(t.name,t.location);return mi(t,Vr(e,i),n),Vr(e,[t.name])},t);hi(e.body,fi(a,(e.instances??[]).flatMap(e=>e.name===void 0?[]:[e.name]),n,r),n);return}case`Forall`:case`Exists`:case`FunctionConstruction`:hi(e.body,pi(e.bounds,t,n,r),n);return;case`SetFilter`:hi(e.predicate,pi([e.bound],t,n,r),n);return;case`SetMap`:hi(e.expression,pi(e.bounds,t,n,r),n);return;case`UnboundedQuantifier`:hi(e.body,fi(t,e.names,n,r),n);return;case`Choose`:e.set&&hi(e.set,t,n),hi(e.body,fi(t,Ur(e.pattern),n,r),n);return;default:Un(e).forEach(e=>hi(e,t,n))}},gi=e=>[...e.definitions.map(e=>({name:e.name,kind:`Definition`,location:e.location,isRecursive:e.isRecursive})),...e.instances.flatMap(e=>e.name===void 0?[]:[{name:e.name,kind:`Definition`,location:e.location,isRecursive:!1}]),...e.constants.map(e=>({name:e.name,kind:`Constant`,location:e.location,isRecursive:!1})),...e.variables.map(e=>({name:e.name,kind:`Variable`,location:e.location,isRecursive:!1}))],_i=(e,t)=>{let n=/* @__PURE__ */ new Map;gi(e).sort((e,t)=>Lr(e.location,t.location)?-1:1).forEach(e=>n.set(e.name,[...n.get(e.name)??[],e]));let r=(e,n)=>{if(!t.imported.has(e)&&!Ir.has(e))return!1;let r=t.importedAt.get(e);return r===void 0||Lr(r,n)};n.forEach(e=>e.forEach((n,i)=>{let a=e.slice(0,i).some(e=>e.kind===`Definition`||n.kind===`Definition`||e.kind!==n.kind),o=t.imported.get(n.name)?.declaration===n.kind;if(a||!o&&r(n.name,n.location))throw di(n.name,n.location)}));let i=e=>t=>(n.get(t)??[]).some(t=>t.isRecursive||Lr(t.location,e))||r(t,e);e.definitions.forEach(e=>mi(e,void 0,i(e.location))),e.assumptions.forEach(e=>hi(e.expression,void 0,i(e.location))),e.instances.forEach(e=>{let t=i(e.location),n=fi(void 0,e.params.map(e=>e.name),t,e.location);e.substitutions.forEach(e=>hi(e.expression,n,t))})},vi=(e,t)=>{let n=new Map([...Ir,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0})),n},yi=(e,t,n,r)=>{let i=Hr(void 0,e.params),a={imported:vi(n,r.imported),definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set},o=new Map(e.substitutions.map(e=>[e.name,e.expression])),s=`in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`;return o.forEach((e,n)=>{if(t.every(e=>e.name!==n))throw new c(`Identifier '${n}' is not a legal target of a substitution ${s}`)}),new Map(t.map(t=>{let n=t.name;if(!o.has(n)&&!Br(i,n)&&!Kr(n,a))throw new c(`Substitution missing for symbol ${n} ${s}`);let r=o.get(n)??{kind:`Identifier`,name:n,location:e.location};if(t.arity===0||r.kind!==`Identifier`)return q(r,i,a),[n,r];if(Yr(r,r.name,i,a)!==t.arity)throw new c(`An operator must be substituted for symbol '${n}', and it must have arity ${t.arity} ${s}`);return[n,r]}))},bi=(e,t)=>{let n=vi(e,t.imported),r=new Set([...e.theorems,...e.assumptions].flatMap(e=>e.name??[])),i=(e,i)=>({imported:n,definitions:t.definitions,getKey:t.getKey,location:e,self:i,facts:r});e.definitions.forEach(e=>$r(e,void 0,i(e.location,e))),e.assumptions.forEach(e=>q(e.expression,void 0,i(e.location,void 0))),e.theorems.forEach(e=>ui(e,i(e.location,void 0)))},xi=/* @__PURE__ */ new WeakSet,Si=/* @__PURE__ */ new WeakSet,Ci=(e,t,n=/* @__PURE__ */ new Set)=>{let r=ki(e,(e,r)=>Ci(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&W(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&W(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},wi=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Ti=/* @__PURE__ */ new WeakMap,Ei=e=>Ti.get(e)??e.name,Di=(e,t)=>(Ei(t)!==e.name&&Ti.set(e,Ei(t)),e),Oi=(e,t)=>Di(e.kind===`Function`?{...e,bounds:wi(e.bounds,e=>t(e,[])),body:t(e.body,Wr(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),ki=(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=>Oi(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:wi(e.bounds,n),body:t(e.body,Wr(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,Ur(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,Ur(e.bound.pattern))};case`SetMap`:return{...e,bounds:wi(e.bounds,n),expression:t(e.expression,Wr(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=>({name:e.name,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`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)}}},Ai=`LAMBDA`,ji=(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 ki(e,(e,n)=>(r.push(...ji(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Mi=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}},Ni=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Pi=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Fi=(e,t)=>e.map(e=>({pattern:Pi(e.pattern,t),set:e.set})),Ii=(e,t)=>e.kind===`Function`?{...e,bounds:Fi(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Li=(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=>Di({...Ii(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Fi(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Pi(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Pi(e.bound.pattern,n),set:e.bound.set}};default:return e}},Ri=e=>`${e}@ENABLED`,zi=(e,t)=>e.modes.get(t)??e,Bi=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!W(e)&&t.instantiation.variables.has(e.name),Vi=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Vi(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Bi(e,t,n))return[e.name];let r=W(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Vi(r.body,t,/* @__PURE__ */ new Map):void 0},Hi=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Bi(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Ri(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:qi(e.expression,zi(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[qi(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:qi(e.subscript,zi(t,`Primed`),n),location:r},qi(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Vi(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:Ri(r),location:e.location},location:e.location},qi({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Ui=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),Wi=(e,t)=>e.map(e=>Ui(e.name,t)),Gi=(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:[...Wi(t,r),...i.map(e=>Ui(e,r))],location:r},location:r}},Ki=(e,t)=>e.instantiation.isParameterized(t)?Yi(e,t):void 0,qi=(e,t,n)=>{let r=e=>qi(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!W(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:qi(e.expression,zi(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:qi(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},zi(t,`Enabled`),n)};let s=Hi(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return xi.add(n),n;let r=Ki(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&&Rr(o)>0?Gi(r,a,Rr(o),e.location):{kind:`Apply`,operator:r,args:Wi(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||Si.has(e),l=e=>(s&&Si.add(e),e);if(o?.kind===`Identifier`||o?.kind===`OperatorReference`){let t=o.kind===`Identifier`?o.name:o.operator;return l({...e,operator:t,args:n,resolution:o.kind===`Identifier`?o.resolution:void 0})}if(o?.kind===`Apply`)return l({...e,operator:o.operator,args:[...o.args,...n],resolution:o.resolution});if(o?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Ai,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:Ai,args:n,resolution:{kind:`Local`}},location:e.location};if(o)throw new c(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=Ki(t,e.operator);return u===void 0?l({...e,args:n}):{...e,operator:u,args:[...Wi(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=Ki(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?Gi(n,a,Rr(r),e.location):{...e,operator:n}}let l=Mi(t),u=ki(e,(e,i)=>i.length===0?r(e):qi(e,t,Ni(n,i,l)));return Li(u,n,l)},Ji=(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:Ui(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Yi=(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=Mi(e),o=Ii(Oi(i,(t,n)=>qi(t,e,Ni(/* @__PURE__ */ new Map,n,a))),a);return Ji(o,r.params,i.location)}):t},Xi=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>ji(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=>Ki(i,e)??e,getQualifiedKey:t=>{let n=Ki(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Ji(r,e.params,r.location)):t}}},Zi=e=>e.kind===`Let`&&e.instances!==void 0||Un(e).some(Zi),Qi=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=ki(e,e=>Qi(e,t,r));return i.kind!==`Let`||!i.instances?i:{kind:`Let`,definitions:i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Lr(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions),body:i.body,location:i.location}},$i=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,ea=(e,t)=>e.definitions.some(e=>Zi(e.body))||e.assumptions.some(e=>Zi(e.expression))||e.theorems.some(e=>{let t=$i(e);return t!==void 0&&Zi(t)})?{...e,definitions:e.definitions.map(e=>Oi(e,e=>Qi(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Qi(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=$i(e);return n===void 0?e:{...e,statement:Qi(n,t,[])}})}:e,ta=/* @__PURE__ */ new WeakMap,na=/* @__PURE__ */ new WeakMap,J=(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},ra=(e,t,n)=>{let r=e.slice();return r[t]=n,r},ia=(t,r,i=X(t,r))=>{if(typeof i==`boolean`)return i;try{return so(i,`the action at ${Ga(t)}`)}catch(t){throw r.next===void 0?t:n(t,e.error)}},aa=e=>e===`=`||e===`\\in`||e===`\\subseteq`,oa=(e,t,n)=>{let r=n?ta:na,i=r.get(e);if(i)return i;let a=Fa(e,t,n);return r.set(e,a),a},sa=(e,t)=>{if(t.constants.has(e))return;let n=co(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},ca=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return ca(e.expression,t,!1,r);if(e.kind!==`Identifier`||W(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=sa(e.name,t);if(a&&!r.has(a))return r.add(a),ca(a.body,t,n,r)},la=(e,t,n)=>ca(e,t,!n),ua=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return ua(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Uo(e.definitions,J(r,t,n));return ua(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=ro(t,e.name);if(a?.kind===`Thunk`)return ua(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=sa(e.name,r.environment);if(s)return ua(s.body,void 0,n,r,i)},da=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||W(e))||!t&&e.kind===`Prime`,fa=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>fa(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=sa(e.name,t);if(i)return n.add(e.name),fa(i.body,t,n)},pa=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),ma=(e,t,n)=>pa.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||aa(e.operator)&&(da(e.args[0],n)||la(e.args[0],t,n)!==void 0)||W(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,ha=/* @__PURE__ */ new Set,ga=(e,t)=>{if(W(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return ki(e,(e,i)=>{let a=r.isReadOnly?ga(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},_a=(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||W(e)?void 0:co(r,t);return i&&!n.has(i)&&(n.add(i),_a(i.body,t,n))?!0:Un(e).some(e=>_a(e,t,n))},va=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=la(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=fa(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return ma(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:oa(e,t,n)}},ya=(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(Ws(e,t)===void 0||_a(e,t,/* @__PURE__ */ new Set))return!0;let n=ga(e,ha);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)}},ba=(e,t,n)=>{let r=e.map(e=>va(e,t,n)),i=r.map(()=>void 0),a=(e,n,o,s,c,l)=>{let u=s,d;for(let s=e;s<r.length;s++){if(s>0&&n.isInit&&za(u)){d??=J(n,o,u);for(let e=s;e<r.length;e++)if(!xa(r[e].expression,d))return;l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=J(n,o,u);let r=i[s]??=ps(e.expression,t);if(!ia(e.expression,d,r(d)))return;continue}if(e.kind===`Assign`){d??=J(n,o,u);let r=(i[s]??=ps(e.value,t))(d),a=u[e.index];if(a===void 0)u=ra(u,e.index,r),d=void 0;else if(!Re(a,r))return;continue}if(e.kind===`Unchanged`){let t=n.current;if(!t)return;for(let n of e.indices){let e=u[n];if(e===void 0)u=ra(u,n,t[n]),d=void 0;else if(!Re(e,t[n]))return}continue}let f=s+1;e.runner(n,o,u,c,!0,(e,t)=>a(f,n,o,e,t,l));return}l(u,c)};return(e,t,n,r,i,o)=>a(0,e,t,n,r,o)},xa=(e,t)=>so(X(e,t),`the initial predicate at ${Ga(e)}`),Sa=e=>(t,n,r,i,a,o)=>{ia(e,J(t,n,r))&&o(r,i)},Ca=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),d=J(r,i,a);if(a[l]!==void 0){ia(e,d)&&c(a,o);return}let f=X(n,d),p=e.operator===`\\subseteq`?{kind:`Subset`,base:f}:f;if(!z(p))throw new u(`In computing ${r.isInit?`initial`:`next`} states, the right side of \\IN is not enumerable.\n${qa(e)}`);let m=Ut(p);for(let e=0;e<m.length&&!r.isStopped;e++)c(ra(a,l,m[e]),o)}},wa=/* @__PURE__ */ new WeakMap,Ta=e=>{let t=wa.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Ta),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return wa.set(e,n),n},Ea=(e,t)=>{let n=e.args[0],r=Sa(e),i=(e,r,i)=>ua(n,r,i,e,!t)??-1,a=Ca(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=X(e.args[1],J(t,n,o));l(ra(o,u,d),s)}},Da=(e,t,n,r)=>{if(e.kind===`FunctionConstruction`)return{bounds:e.bounds,body:e.body,scope:t};if(e.kind!==`Identifier`)return;let i=ro(t,e.name);if(i?.kind===`Thunk`)return Da(i.expression,i.scope,n,r);let a=i?void 0:co(e.name,r.environment);if(a?.kind!==`Function`)return;let o=X(e,J(r,void 0,n));return{bounds:a.bounds,body:a.body,scope:io(void 0,a.name,o)}},Oa=(e,t,n)=>{let r=Sa(e);return(i,a,o,s,c,l)=>{let d=Da(e.function,a,o,i);if(!d){r(i,a,o,s,c,l);return}let f=J(i,a,o),p=e.args.map(e=>X(e,f)),m=p.length===1?p[0]:R(p),h=ho(d.bounds,J(i,d.scope,o));if(!$t(m,h))throw new u(`Attempted to apply a function to ${U(m)}, which is not in its domain at ${Ga(e)}`);oa(d.body,t,n)(i,go(d.bounds,d.scope,m),o,s,c,l)}},ka=(e,t)=>{if(fa(e,t))return ba([Ta(e)],t,!1);if(e.kind===`Tuple`)return oa(Ta(e),t,!1);let n=Ta(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?ro(i,e.name):void 0;l?.kind===`Thunk`?oa(Ta(l.expression),t,!1)(r,l.scope,a,o,s,c):ia(n,J(r,i,a))&&c(a,o)}},Aa=(e,t,n)=>{let r=e.operator,i=Sa(e),a=W(e)?void 0:Do(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=xs(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=oa(a.body,t,n),o.body(e,i(J(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=J(a,o,s),f=ko(e,d);f?.kind===`Closure`?oa(f.body,t,n)(a,Vo(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},ja=(e,t,n)=>{let r=Sa(e),i=W(e)?void 0:sa(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=ro(s,e.name);f?.kind===`Thunk`?oa(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=oa(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Ma=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=e.operands[0];if(n.kind!==`Apply`||n.operator!==`=`||W(n))return;let r=n.args[0],i=n.args[1];if(r.kind!==`FunctionApplication`||i.kind!==`String`)return;let a=r.args.length===1?r.args[0]:void 0;if(a?.kind!==`Identifier`||!W(a))return;let o=ca(r.function,t,!1);return o===void 0?void 0:{variable:o,argument:a.name,labels:/* @__PURE__ */ new Set([i.value])}}if(e.kind===`Or`){let r=e.operands.map(e=>Ma(e,t,n)),i=r[0],a=r.every(e=>e!==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}}if(e.kind!==`Apply`||W(e))return;let r=Do(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Ma(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`&&W(o))return{variable:i.variable,argument:o.name,labels:i.labels}},Na=(e,t,n)=>{let r=ro(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},Pa=(e,t,n)=>{let r=e.map(e=>oa(e,t,n)),i=n?[]:e.map(e=>Ma(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?.labels:void 0);return(e,t,n,i,s,c)=>{let l=a&&Na(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++)(l===void 0||o[a]?.has(l)!==!1)&&r[a](e,t,n,i,s,c)}},Fa=(e,t,n)=>{let r=e=>oa(e,t,n);switch(e.kind){case`And`:return ba(e.operands,t,n);case`Or`:return Pa(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(t,n,r,o,s,c)=>{let l=po(X(a.set,J(t,n,r)),a.set);for(let a=0;a<l.length&&!t.isStopped;a++)i(t,io(n,e,l[a]),r,o,s,c)}}let o=n?void 0:ya(e,t);if(o){let r=ba(o.rest,t,n);return(t,n,i,a,s,c)=>{let l=J(t,n,i),u=e.bounds.map(e=>po(X(e.set,l),e.set));if(u.some(e=>e.length===0))return;let d=(e,n)=>{if(e<0)r(t,n,i,a,s,c);else for(let r of u[e]){if(t.isStopped)return;let a=io(n,o.names[e],r);if(e===u.length-1){let e=J(t,a,i);if(!o.guards.every(t=>ia(t,e)))continue}d(e-1,a)}};d(u.length-1,n)}}return(t,n,r,a,o,s)=>{mo(e.bounds,J(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Ws(e,t)!==void 0&&!_a(e.body,t,/* @__PURE__ */ new Set)?ga(e,ha):void 0;return(t,n,r,o,s,c)=>{let l=[];mo(e.bounds,J(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>ro(n,e)?.kind===`Value`)){u.every(n=>ia(e.body,J(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&za(r)?u.slice(n).every(n=>xa(e.body,J(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=X(e.condition,J(r,i,a));(so(l,`an IF condition`)?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=J(r,i,a),d=t.find(e=>so(X(e.condition,l),`a CASE guard`))?.body??n;if(!d)throw new u(`In computing ${r.isInit?`initial`:`next`} states, TLC encountered a CASE with no conditions true.\n${qa(e)}`);d(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=$o(e.definitions,t);return(t,r,a,o,s,c)=>n(t,Uo(e.definitions,J(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new u(`UNCHANGED appears in an initial predicate at ${Ga(e)}`)}:ka(e.expression,t);case`AngleAction`:{let t=r(e.action),n=Ta(e.subscript);return(e,r,i,a,o,s)=>t(e,r,i,a,o,(t,i)=>{ia(n,J(e,r,t))||s(t,i)})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,Ta(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return ja(e,t,n);case`FunctionApplication`:return Oa(e,t,n);case`Apply`:{let i=e.args;if(aa(e.operator)){let r=la(i[0],t,n);if(r!==void 0)return e.operator===`=`?ba([e],t,n):Ca(e,()=>r);if(da(i[0],n))return Ea(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=X(i[0],J(t,n,r));(typeof c==`boolean`?c:so(c,`the left side of => at ${Ga(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return Aa(e,t,n)}default:return Sa(e)}},Ia=/* @__PURE__ */ new WeakMap,La=e=>{let t=Ia.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Ia.set(e,n),n},Ra=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),za=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Ba=(e,t)=>{let n=t.state;if(!n||!za(n))throw new u(`ENABLED needs a complete state at ${Ga(e)}`);let r=t.environment,i={environment:r,isInit:!1,current:n,isStopped:!1};return oa(e,r,!1)(i,t.scope,La(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Va=(t,r,i,a)=>{let o={environment:r,isInit:!0,current:void 0,isStopped:!1};oa(t,r,!0)(o,a,La(r),void 0,!1,t=>{if(!o.isStopped){if(!za(t))throw n(new u(`The initial predicate does not assign ${Ra(t,r).join(`, `)}`),e.error);o.isStopped=i(t)}})},Ha=(e,t,n)=>{let r=[];return Va(e,t,e=>(r.push(e),!1),n),r},Ua=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,current:t,isStopped:!1},o={successors:0};return oa(e,n,!1)(a,i,La(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!za(e))throw new f(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${Ra(e,n).join(`, `)}`);o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},Wa=(e,t,n,r)=>{let i=[];return Ua(e,t,n,e=>(i.push(e),!1),r),i},Ga=e=>`line ${e.location.line}, column ${e.location.column}`,Ka=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,qa=e=>{let t=e.location.range;return t?Ka(t):Ga(e)},Ja=(e,t)=>new u(`A non-boolean expression (${fr(t)}) was used as the condition of an IF.\n${qa(e)}`),Ya=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r){let r=e.operands[t],i=r.kind===`Number`?String(r.value):qa(r);return new u(`A non-boolean expression (${fr(n)}) was used as a formula in a conjunction.\n${i}`)}let i=e.operands[Math.max(t,1)].location.range?.end??r.end;return new u(`Attempted to evaluate an expression of form P /\\ Q when ${t===0?`P`:`Q`} was\n${fr(n)}.\n${qa({...e,location:{...e.location,range:{...r,end:i}}})}`)},Xa=e=>t=>ln(t)?`Attempted to select nonexistent field "${e.field}" from the record\n${U(t)}\n${qa(e)}`:cn(t,e.field),Za=e=>t=>`A non-function (${fr(t)}) was applied as a function.\n${qa(e)}`,Qa=e=>t=>`Attempted to select field "${e.field}" from a non-record value ${U(t)}\n${qa(e)}`,$a=e=>t=>{if(!j(t))throw new u(`Attempted to apply the operator DOMAIN to a non-function\n(${fr(t)})\n${qa(e)}`);return mn(t)},eo=(e,t)=>(n,r)=>{if(!A(n)||F(n))throw new u(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${qa(e)}`);return t.evaluate([n,r])},to=t=>n(new u(`TLC can't handle real numbers: ${t.text} at ${Ga(t)}`),e.configParseError),no=t=>n(new u(`TLC can't handle a number this big: ${t.text??t.value} at ${Ga(t)}`),e.error),ro=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},io=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),ao=(e,t,n)=>{if(t.kind===`Name`)return io(e,t.name,n);let r=Xt(n);if(!r||r.length!==t.names.length)throw new u(`Cannot bind <<${t.names.join(`, `)}>> to ${U(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>io(e,t,r[n]),e)},oo=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next}),so=(e,t)=>{if(typeof e!=`boolean`)throw new u(`Expected ${t} to be a boolean but found ${U(e)}`);return e},co=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),lo=(e,t)=>{if(e.kind===`Prime`||e.kind===`Unchanged`||e.kind===`Enabled`)return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=co(n,t);if(e&&!t.constants.has(n)&&!uo(e,t))return!0}return Un(e).some(e=>lo(e,t))},uo=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!lo(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>lo(e.set,t)));return t.constantLevels.set(e,r),r},fo=(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.`},po=(e,t)=>{if(!A(e)||F(e)){let n=U(e),r=fo(e,n);throw new u(r===void 0?`TLC encountered a non-enumerable quantifier bound\n${n}.\n${qa(t)}`:`TLC encountered the non-enumerable quantifier bound\n${n}\n${qa(t)}\n${r}`)}return typeof e==`object`&&e.kind===`Interval`?Tt(e):B(e).elements},mo=(e,t,n)=>{let r=e.map(e=>po(X(e.set,t),e.set)),i=(t,a)=>t<0?n(a):r[t].some(n=>i(t-1,ao(a,e[t].pattern,n)));return i(e.length-1,t.scope)},ho=(e,t)=>{let n=e.map(e=>X(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},go=(e,t,n)=>{if(e.length===1)return ao(t,e[0].pattern,n);let r=Xt(n)??[];return e.reduce((e,t,n)=>ao(e,t.pattern,r[n]),t)},_o=/* @__PURE__ */ new WeakMap,vo=(e,t)=>{let n=_o.get(t);if(n)return n;let r=t.location.range;if(!r)return;let i={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:Ka(r)};return _o.set(t,i),i},yo=(e,t,n)=>{let r=vo(e,t);if(!r)return;let i=e.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:r.parameters.map(e=>({name:e.name,domain:i[e.index]})),body:r.body}},bo=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Cn(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(Be(a[t],e))return a[t+1]}let o=t(e,i),s=r.get(n);return s===void 0?r.set(n,[e,o]):s.push(e,o),o}};return i},xo=(e,t)=>{let n=ho(e.bounds,t),r=bo(n,(n,r)=>X(e.body,oo(t,go(e.bounds,io(void 0,e.name,r),n))),yo(e.bounds,e.body,n));return e.bounds.length===1?nn(r):r},So=(e,t)=>e.kind===`Function`?xo(e,t):X(e.body,t),Co=(e,t)=>{let n=uo(e,t.environment),r=n?t.environment.definitionValues.get(e):void 0;if(r!==void 0)return r;if(e.kind===`Operator`&&e.params.length>0)throw new u(`Operator ${e.name} requires ${e.params.length} arguments`);let i=oo(t,void 0);if(!n)return So(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>So(e,i));return t.environment.definitionValues.set(e,a),a},wo=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=X(e.expression,oo(t,e.scope));return n&&(e.cache=r),r},To=/* @__PURE__ */ new WeakMap,Eo=e=>{let t=To.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return To.set(e,n),n},Do=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Do(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Eo(r):t.builtins.get(e)},Oo=/* @__PURE__ */ new WeakMap,ko=(e,t)=>{if(W(e))return Ao(e.operator,t);let n=Oo.get(e),r=n===void 0?Do(e.operator,t.environment)??null:n;return n===void 0&&Oo.set(e,r),r??Ao(e.operator,t)},Ao=(e,t)=>{let n=ro(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Do(e,t.environment)},jo=e=>e.kind===`Closure`?e.params.length:e.arity,Mo=(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:Ao(n,t);if(!r)throw new u(`Expected an operator argument at ${Ga(e)}`);return r},No=(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)=>io(e,n.name,t[r]),e.scope);return X(e.body,oo(n,r))},Po=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:jo(e),call:n=>No(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},Fo=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Ao(e.name,t);return n!==void 0&&jo(n)>0},Io=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),Lo=(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 Lo(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([])}},Ro=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Go(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=W(e)?void 0:Lo(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=ro(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:Io(e,t)}}return t=>Io(e,t)},zo=/* @__PURE__ */ new WeakMap,Bo=(e,t)=>{let n=zo.get(e);if(n)return n;let r=Ro(e,t);return zo.set(e,r),r},Vo=(e,t,n)=>{if(t.length!==e.params.length)throw new u(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`);let r=e.scope;for(let i=0;i<t.length;i++){let a=e.params[i],o=a.arity>0?{kind:`Operator`,operator:Mo(t[i],n)}:Bo(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},Ho=(e,t,n)=>e.kind===`Closure`?X(e.body,oo(n,Vo(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>X(e,n))):e.isLazy?e.evaluate(ys(t,n),n):e.evaluate(t.map(e=>Fo(e,n)?Po(Mo(e,n),n):X(e,n)),n),Uo=(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},i):r.params.length>0||n?.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},i)},t.scope),Wo=(e,t,n)=>{let r=ro(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return wo(r,n);if(r?.kind===`Operator`){if(jo(r.operator)===0)return No(r.operator,[],n);throw new u(`Operator ${e} is used without arguments`)}let i=Lo(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Rs(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Co(i.definition,n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new u(`Unknown identifier ${e} at ${Ga(t)}`)},Go=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,Ko=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),qo=(e,t)=>Ko.has(e)||t.builtins.get(e)?.isStateLevel===!0,Jo={builtins:Ko,definitions:/* @__PURE__ */ new WeakMap},Yo={builtins:new Set([...Ko].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},Xo=(e,t)=>e.kind===`Operator`&&e.params.length===0&&uo(e,t),Zo=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!W(e)){let e=co(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!Xo(e,t)&&Qo(e,t,n))return!0}return Un(e).some(e=>Zo(e,t,n))},Qo=(e,t,n=Jo)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=Zo(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>Zo(e.set,t,n));return n.definitions.set(e,i),i},$o=(e,t)=>new Set(e.filter(e=>Qo(e,t))),es=e=>[...e.definitions.values()].some(t=>Qo(t,e)),ts=e=>[...e.definitions.values()].some(t=>Qo(t,e,Yo)),ns=/* @__PURE__ */ new WeakMap,rs=(e,t)=>{let n=ns.get(e);if(n!==void 0)return n;let r=ss(e,t,as);return ns.set(e,r),r},is=/* @__PURE__ */ new Set([`Number`,`String`,`Identifier`,`Apply`,`And`,`Or`,`If`,`Case`,`SetEnumeration`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`FunctionApplication`,`FieldAccess`,`Product`,`SetFilter`,`SetMap`,`Forall`,`Exists`,`Choose`,`FunctionConstruction`,`Let`]),as=/* @__PURE__ */ new Set,os=(e,t,n)=>n.size===0?rs(e,t):ss(e,t,n),ss=(e,t,n)=>{if(!is.has(e.kind))return!1;if(e.kind===`Identifier`&&W(e))return n.has(e.name);if(W(e))return!1;if(e.kind===`Identifier`){let n=Lo(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&Xo(n.definition,t)}if(e.kind===`Apply`){if(qo(e.operator,t)||e.operator===`~>`)return!1;let r=Do(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=co(e.operator,t);if(!n||!uo(n,t)||Qo(n,t))return!1}return!(r.kind===`Closure`?r.params:[]).some(e=>e.arity>0)&&e.args.every(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&os(e,t,n))}let r={value:!0};return ki(e,(e,i)=>(r.value&&=os(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},cs=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,ls=e=>{let t={value:void 0};return n=>{if(t.value!==void 0)return t.value;let r=e(n);return t.value=r,r}},us=(e,t)=>{if(e.kind===`Identifier`&&W(e))return!t.has(e.name);if(W(e))return!0;let n={value:!1};return ki(e,(e,r)=>(n.value||=us(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},ds=(e,t)=>xi.has(e)&&cs(e)&&Ws(e,t)!==void 0&&!us(e,as),Y=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Vs(e,t),i=cs(e)&&rs(e,t)?ls(r):ds(e,t)?gs(r):r;return t.evaluators.set(e,i),i},fs=/* @__PURE__ */ new WeakMap,ps=(e,t)=>{let n=fs.get(e);if(n)return n;let r=(cs(e)&&rs(e,t)?void 0:Mr(e,t))??Y(e,t);return fs.set(e,r),r},X=(e,t)=>ps(e,t.environment)(t),ms=(e,t)=>{let n=e.name,r=W(e)?void 0:Lo(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Rs(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`&&r.definition.kind===`Operator`){let e=r.definition;if(e.params.length===0&&uo(e,t))return t=>Co(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=ps(e.body,t),n.body(oo(r,void 0)));return hs(e,t)?gs(r):r}return t=>Co(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>Co(e,t);return uo(e,t)||!hs(e,t)?n:gs(n)}return t=>Wo(n,e,t)},hs=(e,t)=>Ws(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>Ws(e.set,t)!==void 0)),gs=e=>{let t={recent:void 0,recentValue:void 0,previous:void 0,previousValue:void 0};return n=>{let r=n.state;if(r!==void 0&&t.recent===r&&t.recentValue!==void 0)return t.recentValue;if(r!==void 0&&t.previous===r&&t.previousValue!==void 0)return t.previousValue;let i=e(n);return t.previous=t.recent,t.previousValue=t.recentValue,t.recent=r,t.recentValue=i,i}},_s=(e,t)=>{let n=Do(e,t);return n!==void 0&&jo(n)>0},vs=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!W(e)&&_s(e.name,t)),ys=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>X(e,t),expression:e})),bs=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(ys(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&vs(t[0],n)){let e=Y(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&vs(t[0],n)&&vs(t[1],n);if(i&&a){let e=Y(t[0],n),r=Y(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>Fo(e,n)?Po(Mo(e,n),n):X(e,n)),n)},xs=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw new u(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Bo(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:Mo(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Ss=/* @__PURE__ */ new WeakMap,Cs=e=>{let t=Ss.get(e);if(t)return t;let n={calls:/* @__PURE__ */ new Map,size:0};return Ss.set(e,n),n},ws=(e,t)=>{let n=[];for(let r=e;n.length<t;r=r?.parent){if(r?.binding.kind!==`Value`)return;n.push(r.binding.value)}return n},Ts=(e,t)=>e.every((e,n)=>Be(e,t[n])),Es=(e,t)=>{let n=co(e.operator,t);return n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&uo(n,t)&&!Qo(n,t)},Ds=(e,t,n,r)=>{let i=xs(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=ps(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next}));if(!r)return e=>o(i(e),e);let s=Cs(e);return e=>{let n=i(e),r=ws(n,t.length);if(!r)return o(n,e);let a=r.length;for(let e of r)a=vn(a,Cn(e));let c=s.calls.get(a),l=c?.find(e=>Ts(e.args,r));if(l)return l.value;let u=o(n,e);return s.size<65536&&(s.size++,c?c.push({args:r,value:u}):s.calls.set(a,[{args:r,value:u}])),u}},Os=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=Y(n[0],t),r=Y(n[1],t);return t=>!so(e(t),`the left side of =>`)||so(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new u(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=W(e)?void 0:Do(e.operator,t);if(r?.kind===`Closure`)return Ds(r,n,t,Es(e,t));if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=Y(n[0],t),i=$a(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=Y(n[0],t);return Si.has(e)||lo(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=Y(n[0],t),a=Y(n[1],t),o=eo(e,r);return e=>o(i(e),a(e))}return r?.kind===`Builtin`?bs(r,n,t):r=>{let i=Ao(e.operator,r);if(i)return Ho(i,n,r);throw t.definitions.get(e.operator)?.kind===`Function`?new u(`${e.operator} is a function; apply it with brackets`):new u(`Unknown operator ${e.operator} at ${Ga(e)}`)}},ks=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=Y(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=Y(a.set,t);return t=>{let s=po(o(t),a.set);for(let a=0;a<s.length;a++){let o=so(i(oo(t,io(t.scope,e,s[a]))),r);if(o!==n)return o}return 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=>Y(e.set,t));return t=>{let s=a.map((e,n)=>po(e(t),o[n].set)),c=(a,o)=>{if(a<0)return so(i(oo(t,o)),r)!==n;let l=s[a];for(let t=0;t<l.length;t++)if(c(a-1,io(o,e[a],l[t])))return!0;return!1};return c(o.length-1,t.scope)?!n:n}}return e=>mo(o,e,t=>so(i(oo(e,t)),r)!==n)?!n:n},As=(e,t)=>{if(e.kind===`Tuple`)return R(e.names.map(e=>{let n=ro(t,e);return n?.kind===`Value`&&n.value}));let n=ro(t,e.name);return n?.kind===`Value`?n.value:void 0},js=/* @__PURE__ */ new WeakSet,Ms=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&js.add(e)},Ns=(e,t)=>{let n=js.has(e),r=Y(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=Y(a.set,t);return t=>{let c=o?s(t):ho(i,t),l=typeof c==`object`&&c.kind===`ProductSet`&&i.length>1?c.factors:[c];if(e.isRecursive||n||!l.every(pe)){let n=bo(c,e=>r(oo(t,go(i,t.scope,e))),yo(i,e.body,c));return i.length===1?nn(n):n}if(o&&a.pattern.kind===`Name`){let e=a.pattern.name,n=Dt(c);return nn(Le(n,n.map(n=>r(oo(t,io(t.scope,e,n))))))}let u=[];return mo(i,t,e=>{let n=i.length===1?As(a.pattern,e)??!1:R(i.map(t=>As(t.pattern,e)??!1));return u.push([n,r(oo(t,e))]),!1}),yt(u)}},Ps=(e,t)=>{let n=js.has(e);n&&Ms(e.function);let r=Y(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=>Y(e,t))}),value:Y(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):R(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(oo(i,io(i.scope,`@`,e))):hn(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return e=>{let t=r(e);for(let n of i)t=o(t,n.path,0,e,n.value);return t}},Fs=(e,t)=>{if(e.kind===`SetFilter`){let n=Y(e.predicate,t),r=Y(e.bound.set,t),i=e.bound.pattern;return t=>{let a=r(t),o=e=>so(n(oo(t,ao(t.scope,i,e))),`a set filter predicate`);if(!pe(a)){if(A(a))return{kind:`FilteredSet`,base:a,test:o};throw new u(`TLC encountered a non-enumerable quantifier bound ${U(a)} at ${Ga(e.bound.set)}`)}return Ie(B(a).elements.filter(o))}}if(e.kind===`SetMap`){let n=Y(e.expression,t);return t=>{let r=[];return mo(e.bounds,t,e=>(r.push(n(oo(t,e))),!1)),mt(r)}}let n=e.set;if(!n)return()=>{throw new u(`TLC cannot evaluate an unbounded CHOOSE at ${Ga(e)}`)};let r=Y(e.body,t),i={pattern:e.pattern,set:n};return t=>{let n={value:void 0};if(mo([i],t,i=>so(r(oo(t,i)),`the body of CHOOSE`)?(n.value=As(e.pattern,i),!0):!1),n.value===void 0)throw new u(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${qa(e)}`);return n.value}},Is=e=>[...e].sort((e,t)=>L(e.name,t.name)),Ls=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),Rs=(e,t)=>new u(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${qa(t)}`),zs=e=>new u(`A primed expression appears outside an action at ${Ga(e)}`),Bs=(e,t)=>{let n=Is(e),r=Ls(n),i=n.map(e=>Y(e.value,t));if(r)return e=>yt(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=>ye(a,i.map(t=>t(e)),o):e=>Le(a,i.map(t=>t(e)))},Vs=(e,t)=>{let n=e=>Y(e,t);switch(e.kind){case`Number`:{let t=e.value;return Go(t)?()=>t:()=>{throw no(e)}}case`Decimal`:return()=>{throw to(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return ms(e,t);case`Apply`:return Os(e,t);case`OperatorReference`:case`Lambda`:return()=>{throw new u(`An operator cannot be used as a value at ${Ga(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 Ya(e,r,i);if(!i)return!1}return!0}}case`Or`:{let t=e.operands.map(n);return e=>{for(let n=0;n<t.length;n++)if(so(t[n](e),`a disjunct`))return!0;return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw zs(e);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>Re(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 Ja(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t)if(so(e.condition(n),`a CASE guard`))return e.body(n);if(r)return r(n);throw new u(`Attempted to evaluate a CASE with no conditions true.\n${qa(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(oo(n,Uo(e.definitions,n)))}case`Forall`:case`Exists`:return ks(e,t);case`UnboundedQuantifier`:return()=>{throw new u(`TLC cannot evaluate an unbounded quantifier at ${Ga(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Fs(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>mt(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>R(t.map(t=>t(e)))}case`FunctionConstruction`:return Ns(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 Bs(e.fields,t);case`RecordSet`:{let t=Is(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 Ps(e,t);case`ExceptAt`:return t=>{let n=ro(t.scope,`@`);if(n?.kind!==`Value`)throw new u(`@ appears outside an EXCEPT at ${Ga(e)}`);return n.value};case`FunctionApplication`:{Ms(e.function);let t=n(e.function),r=e.args.map(n),i=Za(e);if(r.length===1){let e=r[0];return n=>fn(t(n),e(n),void 0,i)}return e=>fn(t(e),R(r.map(t=>t(e))),void 0,i)}case`FieldAccess`:{let t=n(e.record),r=e.field,i=Xa(e),a=Qa(e);return e=>fn(t(e),r,i,a)}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?so(t(e),`an action`)||r(e):so(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>Ba(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new u(`The subexpression reference at ${Ga(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new u(`TLC cannot evaluate a temporal formula in a state at ${Ga(e)}`)}}},Hs=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),Us=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},Ws=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(Hs.has(e.kind))return!1;let a=Us(e),o=(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`;if(a!==void 0&&!o&&!t.constants.has(a)){let e=t.substitutions.get(a)??a,o=t.definitions.get(e);if(!o&&qo(e,t))return!1;let s=t.variableIndex.get(a);if(s!==void 0&&n.add(s),o&&!r.has(o)&&(r.add(o),!i(o.body)||o.kind!==`Operator`&&!o.bounds.every(e=>i(e.set))))return!1}return Un(e).every(i)};return i(e)?[...n]:void 0},Gs=/* @__PURE__ */ new Map([[`Reals`,`-------------------------------- MODULE Reals -------------------------------
|
|
24
|
+
`);n.index+=e===-1?r.length:e;continue}if(r.startsWith(`(*`)){let e=r.indexOf(`*)`);if(e===-1)throw new d(`Unterminated comment at line ${n.line}`);n.line+=r.slice(0,e).split(`
|
|
25
|
+
`).length-1,n.index+=e+2;continue}let a=/^\d+(?![A-Za-z_])/.exec(r)?.[0];if(a){t.push({kind:`Number`,text:a,line:n.line}),n.index+=a.length;continue}let o=/^[A-Za-z0-9_!]+/.exec(r)?.[0];if(o){t.push({kind:`Word`,text:o,line:n.line}),n.index+=o.length;continue}let s=/^"((?:[^"\\]|\\.)*)"/.exec(r);if(s){t.push({kind:`String`,text:s[1],line:n.line}),n.index+=s[0].length;continue}let c=oe.find(e=>r.startsWith(e));if(c){t.push({kind:`Symbol`,text:c,line:n.line}),n.index+=c.length;continue}let l=ie(e,n.index);if(!l)throw new d(`Unexpected character ${JSON.stringify(r[0])} at line ${n.line}`);t.push({kind:`Word`,text:l.text,line:n.line}),n.index+=l.length}return t.push({kind:`End`,text:``,line:n.line}),t},se=e=>{let t=A(e),n={index:0},r={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},i={isSet:!1},a=()=>t[n.index],o=()=>t[n.index++],s=e=>e.kind===`Word`&&k.has(e.text),c=e=>{let t=o();if(t.text!==e)throw new d(`Expected ${JSON.stringify(e)} but found ${JSON.stringify(t.text)} at line ${t.line}`)},l=()=>{let e=o();if(e.kind!==`Word`||s(e))throw new d(`Expected a name but found ${JSON.stringify(e.text)} at line ${e.line}`);return e.text},u=()=>a().kind===`Word`&&!s(a()),f=()=>{let e=[];for(;u();)e.push(o().text);return e},p=(e,t)=>{if(r[e]!==void 0)throw new d(`The keyword ${t} appears twice`);r[e]=l()},m=()=>{let e=o();if(e.kind===`Number`)return{kind:`Number`,value:Number(e.text)};if(e.kind===`String`)return{kind:`String`,value:e.text};if(e.text===`TRUE`||e.text===`FALSE`)return{kind:`Boolean`,value:e.text===`TRUE`};if(e.text===`{`){let e=[];for(a().text!==`}`&&e.push(m());a().text===`,`;)o(),e.push(m());return c(`}`),{kind:`Set`,elements:e}}if(e.kind===`Word`&&!s(e))return{kind:`ModelValue`,name:e.text};throw new d(`Expected a value but found ${JSON.stringify(e.text)} at line ${e.line}`)},h=()=>{if(a().text!==`[`)return;o();let e=l();return c(`]`),e},g=()=>{for(;u();){let e=o().text;if(a().text===`(`){o();let t=[];for(;a().text!==`)`;)t.push(m()),a().text!==`)`&&c(`,`);o(),c(`=`);let n=h();r.constants.push({name:e,value:m(),args:t,...n&&{module:n}});continue}if(a().text===`<-`){o();let t=h();r.substitutions.push({name:e,target:l(),...t&&{module:t}});continue}c(`=`);let t=h();r.constants.push({name:e,value:m(),...t&&{module:t}})}};for(;a().kind!==`End`;){let e=o();switch(e.text){case`CONSTANT`:case`CONSTANTS`:g();break;case`INIT`:p(`init`,e.text);break;case`NEXT`:p(`next`,e.text);break;case`SPECIFICATION`:p(`specification`,e.text);break;case`SYMMETRY`:p(`symmetry`,e.text);break;case`VIEW`:p(`view`,e.text);break;case`INVARIANT`:case`INVARIANTS`:r.invariants.push(...f());break;case`PROPERTY`:case`PROPERTIES`:r.properties.push(...f());break;case`CONSTRAINT`:case`CONSTRAINTS`:r.constraints.push(...f());break;case`ACTION_CONSTRAINT`:case`ACTION_CONSTRAINTS`:r.actionConstraints.push(...f());break;case`ALIAS`:p(`alias`,e.text);break;case`POSTCONDITION`:case`POSTCONDITIONS`:r.postconditions.push(...f());break;case`_POSSIBLE`:r.possible.push(...f());break;case`_PERIODIC`:p(`periodic`,e.text);break;case`_RL_REWARD`:p(`rlReward`,e.text);break;case`CHECK_DEADLOCK`:{if(i.isSet)throw new d(`The keyword CHECK_DEADLOCK appears twice`);i.isSet=!0;let e=o().text;if(e!==`TRUE`&&e!==`FALSE`)throw new d(`CHECK_DEADLOCK expects TRUE or FALSE but found ${JSON.stringify(e)}`);r.checkDeadlock=e===`TRUE`;break}default:throw new d(`Unexpected ${JSON.stringify(e.text)} at line ${e.line}`)}}if(r.specification!==void 0&&(r.init!==void 0||r.next!==void 0))throw new d(`SPECIFICATION cannot be combined with INIT or NEXT`);return r},ce={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:` `}},le=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},ue=e=>e!==void 0&&/^\p{Nd}$/u.test(e),de=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),fe=e=>{let t=t=>{let n=E(e,t,le);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=E(e,t,ue);if(e.startsWith(`..`,n)&&ue(e[n+2]))return{kind:`Constant`,first:t,last:E(e,n+2,ue)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=ue(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:E(e,t+1,ue)-1,children:[]};if(de(n))return{kind:`Constant`,first:t,last:E(e,t,de)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},j=e=>{let t=e.length===0?void 0:fe(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=ce[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},M=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,pe=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),N=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),P=e=>typeof e==`object`&&e.kind===`ModelValue`,me=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:M(e)?`set`:`function`,he=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new p(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},ge={isUsed:!1},_e=(e,t)=>(ge.isUsed=!0,e.writtenKeys=t,e),ve=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[Zt(e.domain,t)]]),ye=(e,t,n)=>_e(ze(e,t),n),be=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(be);e.writtenKeys=void 0,e.range.forEach(be)}},xe=e=>e.every(e=>typeof e==`string`),F=(e,t)=>e.length>0&&t.length>0&&xe(e)!==xe(t),Se=(e,t)=>{ge.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return F(n,r)?at(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=L(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=L(i[e],a[e]);if(t!==0)return t}return 0},Ce=(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=L(n[e],r[e]);if(t!==0)return t}return 0},we=e=>P(e)?e.type:void 0,Te=(e,t,n)=>{let r=we(e),i=we(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(P(e)&&P(t)){if(r===void 0||i===void 0||r===i)return;throw new f(`Attempted to ${a} the differently-typed model values ${U(e)} and ${U(t)}`)}throw r===void 0?new f(`Attempted to ${a} the typed model value ${U(t)} and the non-model value\n${U(e)}`):new f(`Attempted to ${a}${n?``:` the`} typed model value ${U(e)} and non-model value\n${U(t)}`)},Ee={ranks:Object.create(null),size:0},De=e=>{Ee.ranks=Object.create(null),Ee.size=0,Ie.clear();for(let t of e)Oe(t)},Oe=e=>(Ee.ranks[e]===void 0&&(Ee.ranks[e]=Ee.size++),e),ke=()=>Ee.size,Ae=e=>Ee.ranks[Oe(e)],je=(e,t)=>{if(e===t)return 0;let n=Ee.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},I=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Me=(e,t)=>(I(e)||I(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Ne=(e,t,n)=>{if(!I(e))throw new f(`Attempted to ${n} the set ${U(z(e)?B(e):e,!0)} with the value:\n${U(t,!0)}`);if(!I(t))throw new f(`Attempted to compare overridden value ${U(e,!0)} with non-overridden value:\n${U(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 f(`Attempted to compare ${U(e,!0)} with the value\n${U(t,!0)}`)},Pe={kind:`InfiniteSet`,name:`Any`},Fe=e=>{throw new f(`Attempted to compare ANY with the value\n${U(e)}`)},L=(e,t)=>{if(e===t)return ge.isUsed&&be(e),e===Pe?Fe(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Se(e,t);if(n===`Set`&&r===`Set`)return Ce(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&&Te(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return Te(e,t,!1),n===`ModelValue`?-1:1;if(e===Pe||t===Pe)return Fe(e===Pe?t:e);if(M(e)&&M(t)&&Me(e,t))return Ne(e,t,`compare`);let i=M(e);if(i!==M(t))throw new f(`Attempted to compare ${me(e)} ${U(e)} with ${me(t)} ${U(t)}`);return i?Ce(B(e),Wt(t)):Se(H(e),H(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return je(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(Te(e,t,!1),P(e))return-1;if(P(t))return 1;throw new f(`Attempted to compare ${me(e)} ${U(e)} with ${me(t)} ${U(t)}`)},Ie=/* @__PURE__ */ new Map,Le=e=>{let t=Ie.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Ae(e)};return Ie.set(e,n),n},Re=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0}),ze=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0}),Be=(e,t)=>{if(e===t)return ge.isUsed&&be(e),e!==Pe||Fe(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Te(e,t,!0),L(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 Se(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Ce(e,t)===0;if(P(e)||P(t))return Te(e,t,!0),P(e)&&P(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Be(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=V(e.domain),r=V(t.domain);if(n||r)return n===r;let i=V(e.range),a=V(t.range);return i||a?i===a:Be(e.domain,t.domain)&&Be(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(V(e))return V(t);if(V(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]&&Be(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return V(e)?V(t):!V(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Be(e,t.factors[n]));let n=M(e)&&M(t)&&!(z(e)&&z(t));if(n&&Me(e,t))return Ne(e,t,`check equality of`)===0;if(n){if(!I(e)){let n=B(e);if(!I(t))return Ce(n,B(t))===0}return Pn(e)===Pn(t)}return L(e,t)===0},Ve=(e,t)=>e===t||e.length===t.length&&e.every((e,n)=>He(e,t[n])),He=(e,t)=>e===t?!0:typeof e!=`object`||typeof t!=`object`?!1:e.kind===`Set`&&t.kind===`Set`?(e.hash===0||t.hash===0||e.hash===t.hash)&&Ve(e.elements,t.elements):e.kind===`Function`&&t.kind===`Function`?(e.hash===0||t.hash===0||e.hash===t.hash)&&Ve(e.domain,t.domain)&&Ve(e.range,t.range):Pn(e)===Pn(t),Ue=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},We=e=>{if(!N(e))return;let t=H(e);return{domain:t.domain,range:t.range,low:Ue(t.domain)}},Ge=e=>{if(!N(e))return;let t=H(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},Ke=(e,t)=>{if(we(e)!==void 0)throw new f(`Attempted to compare the typed model value ${U(e)} and the non-model value\n${U(t)}`);return 1},qe=(e,t)=>{if(we(e)!==void 0)throw new f(`Attempted to check equality of the typed model value ${U(e)} and the non-model value\n${U(t)}`);return!1},Je=(e,t)=>{let n=we(e);if(n===void 0)return P(t)?e.rank-t.rank:-1;if(!P(t))throw new f(`Attempted to compare the typed model value ${U(e)} and non-model value\n${U(t)}`);let r=we(t);if(r!==void 0&&r!==n)throw new f(`Attempted to compare the differently-typed model values ${U(e)} and ${U(t)}`);return e.rank-t.rank},Ye=(e,t)=>{let n=we(e);if(n===void 0)return P(t)&&e.name===t.name;if(!P(t))throw new f(`Attempted to check equality of typed model value ${U(e)} and non-model value\n${U(t)}`);let r=we(t);if(r!==void 0&&r!==n)throw new f(`Attempted to check equality of the differently-typed model values ${U(e)} and ${U(t)}`);return e.name===t.name},Xe={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`}},Ze=(e,t,n)=>{let r=Xe[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${U(e)} with ${r.other}:\n${U(t)}`},Qe=(e,t,n)=>{let r=We(n);if(!r){if(P(n))return Ke(n,t);throw new f(`Attempted to compare the function ${U(t)} with the value:\n${U(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>$e(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 $e(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 f(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${U(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},$e=(e,t)=>{for(let n=0;n<e.length;n++){let r=at(e[n],t[n]);if(r!==0)return r}return 0},et=(e,t)=>{let n=H(e);if(e.kind===`Function`&&Qt(n)!==void 0){let r=N(t)?Qt(t):void 0;return r?n.range.length-r.length||$e(n.range,r):Qe({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=Ge(t);if(!r){if(P(t))return Ke(t,e);throw new f(`Attempted to compare record:\n${U(e)}\nwith non-record\n${U(t)}`)}return n.domain.length-r.domain.length||$e(n.domain,r.domain)||$e(n.range,r.range)}return Qe({...n,low:Ue(n.domain)},e,t)},tt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),nt=(e,t)=>I(e)||I(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),rt=(e,t)=>{let n=tt(t)?t:B(t);return{elements:B(e).elements,otherElements:B(n).elements}},it=(e,t)=>{if(nt(e,t))return L(e,t);if(!tt(e))return it(B(e),t);if(!M(t)){if(P(t))return Ke(t,e);throw new f(`Attempted to compare the set ${U(e)} with the value:\n${U(t)}`)}let n=rt(e,t);return n.elements.length-n.otherElements.length||$e(n.elements,n.otherElements)},at=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return L(e,t);if(P(t))return Ke(t,e);throw new f(Ze(e,t,!1))}return e.kind===`ModelValue`?Je(e,t):N(e)?et(e,t):it(e,t)},ot=(e,t)=>e.every((e,n)=>ut(e,t[n])),st=(e,t,n)=>{let r=We(n);if(!r){if(P(n))return qe(n,t);throw new f(`Attempted to check equality of the function ${U(t)} with the value:\n${U(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)&&ot(e.range,r.range);let i=e.low??r.low;return i===void 0?ot(e.domain,r.domain)&&ot(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new f(`Attempted to compare an integer with non-integer:\n${U(e)}.`);return e===i+t})&&ot(e.range,r.range)},ct=(e,t)=>{let n=H(e);if(e.kind===`Function`&&Qt(n)!==void 0){let r=N(t)?Qt(t):void 0;return r?n.range.length===r.length&&ot(n.range,r):st({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=Ge(t);if(!r){if(P(t))return qe(t,e);throw new f(`Attempted to check equality of record:\n${U(e)}\nwith non-record\n${U(t)}`)}return n.domain.length===r.domain.length&&ot(n.domain,r.domain)&&ot(n.range,r.range)}return st({...n,low:Ue(n.domain)},e,t)},lt=(e,t)=>{if(nt(e,t))return Be(e,t);if(!tt(e))return lt(B(e),t);if(!M(t)){if(P(t))return qe(t,e);throw new f(`Attempted to check equality of the set ${U(e)} with the value:\n${U(t)}`)}let n=rt(e,t);return n.elements.length===n.otherElements.length&&ot(n.elements,n.otherElements)},ut=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(P(t))return qe(t,e);throw new f(Ze(e,t,!0))}return e.kind===`ModelValue`?Ye(e,t):N(e)?ct(e,t):lt(e,t)},dt=e=>{let t=[];for(let n of e){let e={low:0,high:t.length,comparison:1};for(;e.low<e.high;){let r=e.low+(e.high-e.low>>1);if(e.comparison=at(n,t[r]),e.comparison===0)break;e.comparison<0?e.high=r:e.low=r+1}e.comparison!==0&&t.splice(e.low,0,n)}return t},ft=(e,t)=>t.some(t=>ut(t,e)),pt=(e,t)=>{try{return Be(e,t)}catch(n){if(!(n instanceof f))throw n;return ut(e,t)}},mt=e=>{for(let t=1;t<e.length;t++)if(L(e[t],e[t-1])<=0)return!1;return!0},ht=e=>{if(e.length<2||mt(e))return Re(e);let t=[...e].sort(L),n=[t[0]];for(let e=1;e<t.length;e++)L(n[n.length-1],t[e])!==0&&n.push(t[e]);return Re(n)},gt=e=>{try{return ht(e)}catch(t){if(!(t instanceof f))throw t;return{kind:`MixedSet`,elements:e}}},_t=Re([]),vt=(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&&L(r[a],t)<0;)a++;a<r.length&&L(r[a],t)===0||i.push(t)}return i.length===n.length?e:Re(i)},yt=(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&&L(r[a],t)<0;)a++;a<r.length&&L(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Re(i)},bt=(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=L(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=Re(i);if(e.hash!==0){let t=e.hash;for(let e=0;e<a.length;e++)t=t+Sn(a[e])|0;c.hash=t}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+kn(a[e])|0;c.fingerprint=t}return c},xt=e=>{let t=e.length<2?e:[...e].sort((e,t)=>L(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&L(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return ze(n,r)},St=e=>{let t=xt(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:_e(t,e.map(e=>e[0]))},Ct=[],wt=[],Tt=/* @__PURE__ */ new WeakMap,Et=e=>{let t=Ct[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Ct[e]=n,n},Dt=e=>{if(Jt(e),e.low===1&&e.high>=1)return Et(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Ot=e=>e.length>0&&(e===Ct[e.length]||Tt.has(e)),kt=e=>{let t=B(e).elements;return Ot(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},At=e=>{let t=wt[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return wt[e]=n,n},R=e=>ze(Et(e.length),e),jt=e=>xt(e),Mt=e=>M(e)&&!I(e),Nt=(e,t=!1)=>`UNION(${U(e.base,t)})`,Pt=(e,t=e=>B(e).elements)=>{if(!Mt(e.base))throw new f(`Attempted to enumerate the nonenumerable set:\n${Nt(e)}`);return t(e.base)},Ft=(e,t,n)=>{if(Mt(e))return e;throw new f(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${U(e)}\nwhen enumerating:\n${Nt(n)}`)},z=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 z(e.base);case`FunctionSet`:return z(e.domain)&&z(e.range)||It(e.domain)===!0||It(e)===!0;case`RecordSet`:return e.sets.every(z)||It(e)===!0;case`ProductSet`:return e.factors.every(z)||It(e)===!0;case`Union`:return z(e.base)&&Gt(e.base).every(z);case`SetOperation`:return e.operator===`\\cup`?z(e.left)&&z(e.right):e.operator===`\\cap`?z(e.left)||z(e.right):z(e.left);default:return!1}},It=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=It(e.domain);return t===void 0?void 0:!t&&It(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=It(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return z(e)?B(e).elements.length===0:void 0;default:return}},Lt=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},Rt=(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},zt=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Re(r.map(t=>e[t])));while(Rt(r,e.length))}return t},Bt=e=>{if(typeof e!=`object`)throw new f(`Expected a set but found ${U(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return dt(e.elements);case`Interval`:{let t=Dt(e);return t!==Ct[t.length]&&Tt.set(t,e),t}case`Subset`:{I(e.base)&&Jt(e.base);let t=B(e.base).elements;if(t.length>30)throw new f(qt(e));return zt(t)}case`FunctionSet`:{if(V(e))return[];if(I(e.domain))throw new f(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${U(e.domain)}\ncannot be enumerated.`);let t=kt(e.domain);if(t.length>0&&I(e.range))throw new f(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${U(e.range)}\ncannot be enumerated.`);let n=t.length===0?[]:B(e.range).elements;return Lt(t.map(()=>n)).map(e=>ze(t,e))}case`RecordSet`:{if(V(e))return[];let t=e.sets.map((t,n)=>{if(I(t))throw new f(`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${U(t)}`);return B(t).elements});return Lt(t).map(t=>jt(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(V(e))return[];let t=e.factors.map((e,t)=>{if(I(e))throw new f(`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${U(e)}`);return B(e).elements});return Lt(t).map(R)}case`FilteredSet`:if(I(e.base))throw new f(`Attempted to enumerate { x \\in S : p(x) } when S:\n${U(e.base)}\nis not enumerable`);return B(e.base).elements.filter(e.test);case`Union`:{let t=Pt(e).flatMap((t,n)=>B(Ft(t,n,e)).elements);return B(gt(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(I(e.left)||I(e.right)))throw new f(`Attempted to enumerate S \\cup T when S:\n${U(e.left)}\nand T:\n${U(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&I(e.left)&&I(e.right))throw new f(`Attempted to enumerate S \\cap T when neither S:\n${U(e.left)}\nnor T:\n${U(e.right)}\nis enumerable`);if(e.operator===`\\`&&I(e.left))throw new f(`Attempted to enumerate S \\ T when S:\n${U(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return bt(B(e.left),B(e.right)).elements;let t=e.operator===`\\`||z(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return B(n).elements.filter(t=>tn(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new f(`Attempted to enumerate the non-enumerable set ${U(e)}`);default:throw new f(`Expected a set but found ${U(e)}`)}},Vt=/* @__PURE__ */ new WeakMap,Ht=/* @__PURE__ */ new WeakMap,B=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Re(Bt(e));let t=typeof e==`object`?Vt.get(e):void 0;if(t)return t;let n=(typeof e==`object`?Ht.get(e):void 0)??Ut(e);return typeof e==`object`&&Vt.set(e,n),n},Ut=e=>{let t=Bt(e);return typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?Re(t):ht(t)},Wt=e=>{if(typeof e!=`object`||e.kind!==`Union`&&e.kind!==`SetOperation`&&e.kind!==`FilteredSet`||Vt.has(e))return B(e);let t=Ht.get(e);if(t)return t;let n=Ut(e);return Ht.set(e,n),n},Gt=e=>{if(typeof e!=`object`||Vt.has(e))return B(e).elements;if(e.kind===`Union`)return Pt(e,Gt).flatMap((t,n)=>Gt(Ft(t,n,e)));if(e.kind===`FilteredSet`&&!I(e.base))return Gt(e.base).filter(e.test);if(e.kind!==`SetOperation`)return B(e).elements;if(e.operator===`\\cup`)return I(e.left)||I(e.right)?B(e).elements:[...Gt(e.left),...Gt(e.right)];let t=e.operator===`\\`||z(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return I(n)?B(e).elements:Gt(n).filter(t=>tn(t,r)===(e.operator===`\\cap`))},V=e=>{if(typeof e!=`object`||!M(e))throw new f(`Shouldn't call isEmpty() on value ${U(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 f(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(V);case`RecordSet`:return e.sets.some(V);case`FunctionSet`:return!V(e.domain)&&V(e.range);case`Union`:return Pt(e).every((t,n)=>V(Ft(t,n,e)));default:return B(e).elements.length===0}},Kt=(e,t)=>e.reduce((e,n)=>{let r=e*Jt(n);if(r>2147483647)throw new f(t());return r},1),qt=e=>`Overflow when computing the number of elements in:\n${U(e)}`,Jt=e=>{if(typeof e!=`object`)return B(e).elements.length;switch(e.kind){case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new f(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new f(`Attempted to compute the number of elements in the overridden value ${U(e)}.`);case`Subset`:{let t=Jt(e.base);if(t>=31)throw new f(qt(e));return 2**t}case`FunctionSet`:{if(V(e.domain))return 1;if(V(e.range))return 0;let t=Jt(e.range);if(t===1)return 1;let n=Jt(e.domain),r={value:1};for(let i=0;i<n;i++)if(r.value*=t,r.value>2147483647)throw new f(qt(e));return r.value}case`RecordSet`:return V(e)?0:Kt(e.sets,()=>qt(e));case`ProductSet`:return V(e)?0:Kt(e.factors,()=>`Overflow when computing the number of elements in ${U(e)}`);default:return B(e).elements.length}},Yt=e=>`Attempted to check if the set ${U(e)}is finite.`,Xt=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new f(`Attempted to check if the ${me(e)} ${U(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new f(`Attempted to check if the function:\n${U(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Xt(e.base)&&V(e.base);case`Subset`:return Xt(e.base);case`FunctionSet`:{let t=Xt(e.domain);if(t&&V(e.domain))return!0;let n=Xt(e.range);return n&&V(e.range)?!0:n&&(t||Jt(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(!Xt(e))n.isAllFinite=!1;else if(V(e))return!0;return n.isAllFinite}case`Union`:if(!Mt(e.base))throw new f(`Attempted to check if the nonenumerable set:\n${Nt(e)}\nis a finite set.`);return B(e.base).elements.every(Xt);case`SetOperation`:if(e.operator===`\\cup`)return Xt(e.left)&&Xt(e.right);if(e.operator===`\\cap`){if(!Xt(e.left)&&!Xt(e.right))throw new f(Yt(e));return!0}if(Xt(e.left))return!0;if(!Xt(e.right))throw new f(Yt(e));return!1;case`FilteredSet`:if(!Xt(e.base))throw new f(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${U(e.base)}\nis finite.`);return!0}},Zt=(e,t)=>{let n={low:0,high:e.length-1};for(;n.low<=n.high;){let r=n.low+n.high>>1,i=L(e[r],t);if(i===0)return r;i<0?n.low=r+1:n.high=r-1}return-1},Qt=e=>{if(typeof e!=`object`||!N(e))return;let t=H(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},$t=(e,t)=>`Attempted to check if the value ${U(e)} is an element of ${U(t)}`,en=(e,t)=>{let n=`Attempted to check if the value:\n${U(e)}\nis an element of the`;if(!N(t))return`${n} ${me(t)} ${U(t)}`;let r=t.kind===`Function`||z(t.domain)?H(t).domain:[];return r.length>0&&r.every(e=>typeof e==`string`)?`Attempted to check if element:\n${U(e)}\nis in the record:\n${U(t)}`:r.every((e,t)=>e===t+1)?`Attempted to check set membership in a tuple value.`:`${n} function ${U(t)}`},tn=(e,t)=>{if(!M(t))throw new f(en(e,t));switch(t.kind){case`Set`:try{return Zt(t.elements,e)!==-1}catch(n){if(!(n instanceof f))throw n;return ft(e,t.elements)}case`MixedSet`:return ft(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!P(e))throw new f(`Attempted to check if the value:\n${U(e)}\nis in the integer interval ${U(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(P(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new f(`Attempted to check if the value:\n${U(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!M(e))throw new f($t(e,t));return B(e).elements.every(e=>tn(e,t.base));case`FunctionSet`:{if(!N(e)){if(P(e))return!1;throw new f($t(e,t))}let n=H(e),r=Ue(n.domain);return(r===void 0?pt(t.domain,Re(n.domain)):pt({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>tn(e,t.range))}case`RecordSet`:{let n=N(e)?H(e):void 0;if(!n||!xe(n.domain)){if(P(e))return!1;throw new f(`Attempted to check if non-record\n${U(e)}\nis in the set of records:\n${U(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=Zt(n.domain,e);return i!==-1&&tn(n.range[i],t.sets[r])})}case`ProductSet`:{let n=N(e)?Qt(e):void 0;if(n===void 0){if(N(e)&&H(e).domain.every(e=>typeof e==`number`)||P(e))return!1;throw new f(`Attempted to check if non-tuple\n${U(e)}\nis in the set of tuples:\n${U(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>tn(e,t.factors[n]))}case`FilteredSet`:return tn(e,t.base)&&t.test(e);case`Union`:if(!Mt(t.base))throw new f(`Attempted to check if:\n ${U(e)}\nis an element of the non-enumerable set:\n ${Nt(t)}`);return B(t.base).elements.some(t=>tn(e,t));case`SetOperation`:return t.operator===`\\cup`?tn(e,t.left)||tn(e,t.right):tn(e,t.left)&&tn(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Qt(e);if(n===void 0){if(P(e))return!1;throw new f($t(e,t))}return n.every(e=>tn(e,t.base))}default:throw new f(en(e,t))}},nn=(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?tn(e,n):e.range.every((e,r)=>nn(e,t.range[r],n.range)),H=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){z(e.domain)||Jt(e.domain);let t=kt(e.domain);return ze(t,t.map(t=>e.apply(t)))}throw new f(`Expected a function but found ${U(e)}`)},rn=/* @__PURE__ */ new WeakSet,an=e=>(rn.add(e),e),on=e=>{let t=e.domain;return t.length===0?rn.has(e)?`FcnRcdValue`:`TupleValue`:t===Ct[t.length]?`TupleValue`:Tt.has(t)?`IntervalFcnRcdValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},sn=(e,t)=>`Attempted to apply function:\n${j(U(e))}\nto argument ${j(U(t))}, which is not in the domain of the function.`,cn=e=>`Attempted to apply function with integer domain to the non-integer argument ${j(U(e))}`,ln=(e,t)=>{if(rn.has(e)||e.kind===`LazyFunction`)return`In applying the function\n${j(U(e))},\nthe first argument is:\n${j(U(t))}\nwhich is not in its domain.\n`;let n=on(e);return n===`TupleValue`?typeof t==`number`?`Attempted to access index ${t} of tuple\n${j(U(e))}\nwhich is out of bounds.`:`Attempted to access tuple at a non integral index: ${j(U(t))}`:n===`RecordValue`?typeof t==`string`?`Attempted to access nonexistent field '${t}' of record\n${j(U(e))}`:`Attempted to access record by a non-string argument: ${j(U(t))}`:n===`IntervalFcnRcdValue`&&typeof t!=`number`?cn(t):sn(e,t)},un=(e,t)=>on(e)===`FcnRcdValue`?sn(e,t):cn(t),dn=e=>on(e)===`RecordValue`,fn=(e,t)=>{let n=e[0];return typeof n==`number`?typeof t!=`number`&&(e===Ct[e.length]||Tt.has(e)):typeof n==`string`&&typeof t!=`string`},pn=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}if(e.length<=8){for(let n=0;n<e.length;n++)if(e[n]===t)return n}return Zt(e,t)},mn=(e,t,n,r)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!tn(t,e.domain))throw new f(rn.has(e)?ln(e,t):`Attempted to apply a function to ${U(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new f(r?.(e)??`Attempted to apply ${U(e)}, which is not a function`);let i=fn(e.domain,t)?-1:pn(e.domain,t);if(i===-1)throw new f(n?.(e)??ln(e,t));return e.range[i]},hn=e=>Ot(e)?Tt.get(e)??At(e.length):void 0,gn=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=H(e).domain;return hn(t)??Re(t)},_n=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!z(e.domain))){if(!tn(t,e.domain))return e;let r=n(e.apply(t));return{kind:`LazyFunction`,domain:e.domain,apply:n=>pt(t,n)?r:e.apply(n),source:e.source}}let i=H(e),a=pn(i.domain,t);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=ze(i.domain,o);if(l.writtenKeys=i.writtenKeys,i.hash!==0){let e=i.domain[a];l.hash=s===c?i.hash:i.hash-Cn(e,s)+Cn(e,c)|0}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-An(e,s)+An(e,c)|0}return l},vn=/* @__PURE__ */ new WeakMap,yn=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},bn=(e,t)=>Math.imul(e^t,16777619),xn=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return yn(t)},Sn=e=>yn(Tn(e)+2654435769|0),Cn=(e,t)=>yn(Math.imul(Tn(e),668265261)+Tn(t)|0),wn=e=>{if(e.kind===`ModelValue`)return yn(bn(xn(e.name),109));if(M(e)){if(!z(e))return xn(Pn(e));let t=B(e).elements,n=1940243425;for(let e=0;e<t.length;e++)n=n+Sn(t[e])|0;return n}let t=H(e),n=1725019383;for(let e=0;e<t.domain.length;e++)n=n+Cn(t.domain[e],t.range[e])|0;return n},Tn=e=>{if(typeof e==`number`)return yn(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return xn(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=wn(e)),e.hash;let t=vn.get(e);if(t!==void 0)return t;let n=wn(e);return vn.set(e,n),n},En=/* @__PURE__ */ new WeakMap,Dn=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},On=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Dn(t)},kn=e=>Dn(Mn(e)+2135587861|0),An=(e,t)=>Dn(Math.imul(Mn(e),374761393)+Mn(t)|0),jn=e=>{if(e.kind===`ModelValue`)return Dn(On(e.name)^60);if(M(e)){if(!z(e))return On(Pn(e));let t=B(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+kn(t[e])|0;return n}let t=H(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+An(t.domain[e],t.range[e])|0;return n},Mn=e=>{if(typeof e==`number`)return Dn(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return On(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=jn(e)),e.fingerprint;let t=En.get(e);if(t!==void 0)return t;let n=jn(e);return En.set(e,n),n},Nn=/* @__PURE__ */ new WeakMap,Pn=e=>{if(typeof e==`boolean`)return e?`T`:`F`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return JSON.stringify(e);let t=Nn.get(e);if(t!==void 0)return t;let n=Fn(e);return Nn.set(e,n),n},Fn=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${Pn(e.base)}>`;if(e.kind===`FilteredSet`&&!z(e))throw new f(`Attempted to compare the non-enumerable set ${U(e)} with another value`);if(M(e))return z(e)?`{${B(e).elements.map(Pn).join(`,`)}}`:`<${e.kind} ${U(e)}>`;let t=H(e);return`(${t.domain.map((e,n)=>`${Pn(e)}:${Pn(t.range[n])}`).join(`,`)})`},In=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,Ln=e=>e.reduce((e,t)=>e===0?0:e*Jt(t),1),Rn=e=>{if(e.kind===`Subset`)return Jt(e.base)<=6?B(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return B(e);if(e.kind===`FunctionSet`&&z(e.domain)&&Jt(e.domain)===0)return Re([ze([],[])]);let t=e.kind===`FunctionSet`?Jt(e.range)**Jt(e.domain):Ln(e.kind===`RecordSet`?e.sets:e.factors);return t===0?_t:t<=1999?B(e):void 0},zn=(e,t)=>{if(t)return Rn(e);if(z(e))try{return Rn(e)}catch(e){if(e instanceof f)return;throw e}},Bn=(e,t)=>{let n=e=>U(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`{x \\in ${n(e.base)} : ...}`;case`Union`:return Nt(e,t)}},Vn=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),U=(e,t=!1,n=!1)=>{let r=e=>U(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return In(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(B(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=zn(e,t);return n?r(n):Bn(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{if(e.kind===`LazyFunction`&&!z(e.domain)){let t=e.source;return t?`[${t.parameters.map(e=>`${e.name} \\in ${U(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}let i=H(e),a=r=>U(r,t,n&&e.kind===`Function`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:i.domain.every(e=>typeof e==`string`&&Vn(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):ve(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},Hn=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${j(U(n))}\n`).join(``)},Un=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Wn=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Tn(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||He(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||He(i[e],n))return i[e]}return n.kind===`Set`?Un(n.elements,t):(Un(n.domain,t),Un(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}},Gn=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`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:[])}},W=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,Kn=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),qn=(e,t)=>Kn.has(e)?new f(t):new p(t),Jn=e=>typeof e==`object`&&e.kind===`Operator`,G=(e,t,n)=>{let r=e[t];if(r===void 0||Jn(r))throw qn(n,`${n} expects a value as argument ${t+1}`);return r},Yn=(e,t,n)=>{let r=G(e,t,n);if(typeof r!=`number`)throw qn(n,`${n} expects an integer but received ${U(r)}`);return r},Xn=(e,t,n)=>{let r=G(e,t,n);if(typeof r!=`boolean`)throw qn(n,`${n} expects a boolean but received ${U(r)}`);return r},Zn=(e,t,n)=>{let r=G(e,t,n);if(!M(r))throw qn(n,`${n} expects a set but received ${U(r)}`);return r},Qn=(e,t,n)=>{let r=Zn(e,t,n);if(!z(r))throw qn(n,`${n} cannot enumerate the non-enumerable set ${U(r)}`);return r},$n=(e,t,n)=>B(Qn(e,t,n)),er=(e,t,n)=>$n(e,t,n).elements,tr=(e,t,n)=>{let r=G(e,t,n),i=Qt(r);if(!i)throw qn(n,`${n} expects a sequence but received ${U(r)}`);return i},nr=(e,t,n)=>{let r=G(e,t,n);if(!N(r))throw qn(n,`${n} expects a function but received ${U(r)}`);return H(r)},rr=(e,t,n)=>{let r=e[t];if(r===void 0||!Jn(r))throw qn(n,`${n} expects an operator as argument ${t+1}`);return r},ir=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),K=(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}),ar=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),or=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),sr=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(G(n,0,e),G(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),cr=e=>e>2147483647||e<-2147483648,lr=e=>new p(`Overflow when computing ${e}`),ur={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`},dr={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},fr={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`},pr=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return dr[e.operator];if(e.kind!==`Function`)return ur[e.kind];let t=e.domain;return t.every((e,t)=>e===t+1)?`TupleValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},mr=e=>fr[pr(e)],hr=(e,t)=>new f(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),gr=(e,t)=>{let n=n=>(...r)=>{try{return n(...r)}catch(n){throw n instanceof f&&(e.isLazy===!0||!(n instanceof p))?hr(t,n.message):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},_r=(e,t)=>{if(typeof e!=`number`)throw hr(t,`Cannot cast tlc2.value.impl.${pr(e)} to tlc2.value.impl.IntValue`);return e},vr=(e,t,n)=>`public static tlc2.value.impl.${t} tlc2.module.Integers.${e}(${Array.from({length:n},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,yr=(e,t,n)=>{let r=vr(t,`IntValue`,2);return sr(e,(t,i)=>{let a=_r(t,r),o=_r(i,r),s=n(a,o);if(cr(s))throw lr(`${a}${e}${o}`);return s})},br=(e,t,n)=>{if(typeof e!=`number`)throw new p(`The ${t} argument of ${n} should be an integer, but instead it is:\n${U(e)}`);return e},xr=(e,t)=>sr(e,(n,r)=>t(br(n,`first`,e),br(r,`second`,e))),Sr=(e,t,n)=>({...or(e,t,n),isLazy:!0}),Cr=(e,t,n)=>{let r=rr(e,t,n);return()=>r.call([])},wr=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Tr=()=>({bool:lo,condition:(e,t)=>{if(typeof e!=`boolean`)throw Xa(t,e);return e},conjunct:(e,t,n)=>{if(typeof e!=`boolean`)throw Za(t,n,e);return e},apply:mn,tuple:R,set:gt,record:ze,writtenRecord:ye,equal:Be,enumerate:ho,unassigned:(e,t)=>{throw Bs(e,t)},primeOutsideAction:e=>{throw Vs(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0}),extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>oo(e,t,n[r]),e.scope),state:e.state,next:e.next})}),Er={value:void 0},Dr=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Or=e=>`local${e.counter++}`,kr=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),Gn(e).forEach(e=>kr(e,t)),t),Ar=(e,t,n)=>{let r=Dr(e,Y(t,e.environment)),i=kr(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Dr(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},jr=(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(()=>Or(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${Nr(e,t.set,s)}, ${Dr(e,t.set)});`),u=t.bounds.map(t=>{let n=Or(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${Nr(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=Or(e);return`for (let ${i} = 0; ${i} < ${c[r]}.length; ${i}++) { const ${n} = ${c[r]}[${i}]; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},Mr=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${Nr(e,r[0],n)}, "the left side of =>") ? bool(${Nr(e,r[1],n)}, "the right side of =>") : true)`;if(W(t))return Ar(e,t,n);let i=ko(t.operator,e.environment);if(i?.kind!==`Builtin`)return Ar(e,t,n);if(i.name===`DOMAIN`)return`${Dr(e,to(t))}(${Nr(e,r[0],n)})`;if(i.name===`TLCEval`)return Ar(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Dr(e,no(t,i))}(${Nr(e,r[0],n)}, ${Nr(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&bs(r[0],a))return`${Dr(e,i.evaluateUnary)}(${Nr(e,r[0],n)})`;let o=r.length===2&&bs(r[0],a)&&bs(r[1],a);return i.evaluateBinary&&o?`${Dr(e,i.evaluateBinary)}(${Nr(e,r[0],n)}, ${Nr(e,r[1],n)})`:Ar(e,t,n)},Nr=(e,t,n)=>{let r=(t,r=n)=>Nr(e,t,r);if(us(t)&&as(t,e.environment))return Ar(e,t,n);switch(t.kind){case`Number`:return qo(t.value)?String(t.value):Ar(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(W(t))return Ar(e,t,n);let i=zo(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Dr(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Dr(e,i.value):Ar(e,t,n)}case`Apply`:return Mr(e,t,n);case`And`:{let n=Dr(e,t);return`(${t.operands.map((e,t)=>`conjunct(${r(e)}, ${n}, ${t})`).join(` && `)})`}case`Or`:return`(${t.operands.map(e=>`bool(${r(e)}, "a disjunct")`).join(` || `)})`;case`If`:return`(condition(${r(t.condition)}, ${Dr(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Ps(t.function);let n=r(t.function),i=Dr(e,$a(t));return t.args.length===1?`apply(${n}, ${r(t.args[0])}, undefined, ${i})`:`apply(${n}, tuple([${t.args.map(e=>r(e)).join(`, `)}]), undefined, ${i})`}case`FieldAccess`:return`apply(${r(t.record)}, ${JSON.stringify(t.field)}, ${Dr(e,Qa(t))}, ${Dr(e,eo(t))})`;case`Record`:{let i=Rs(t.fields);if(zs(i))return Ar(e,t,n);let a=Dr(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}, ${Dr(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=Dr(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`)?jr(e,t,n):Ar(e,t,n);default:return Ar(e,t,n)}},Pr=(e,t)=>{if(!wr.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=Nr(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(`
|
|
26
|
+
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; return ${r}; };`;Er.value??=Tr();let o=Er.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},Fr={kind:`Local`},Ir=/* @__PURE__ */ new WeakMap,Lr=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Rr=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2}])),zr=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Br=e=>e.kind===`Operator`?e.params.length:0,Vr=e=>e.name.includes(`!`),Hr=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Ur=(e,t,n=0)=>t.reduce((e,t)=>({name:t,arity:n,parent:e}),e),Wr=(e,t)=>t.reduce((e,t)=>({name:t.name,arity:t.arity,parent:e}),e),Gr=e=>e.kind===`Name`?[e.name]:e.names,Kr=e=>e.flatMap(e=>Gr(e.pattern)),qr=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||zr(n.location,t.location))?n:void 0},Jr=(e,t)=>{let n=qr(e,t);return n?{key:t.getKey(n),arity:Br(n)}:t.imported.get(e)},Yr=e=>e[0].toLowerCase()===e[0].toUpperCase()&&e[0]!==`_`&&(e[0]<`0`||e[0]>`9`),Xr=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Zr=(e,t,n,r)=>{let i=e.location,a=Ir.get(e);if(a!==void 0)return a;if(Lr(t))return e.kind===`Apply`?e.args.length:0;if(Xr(t))return 0;let o=Hr(n,t);if(o&&e.kind!==`OperatorReference`&&(e.resolution=Fr),o)return o.arity;let s=Jr(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Ir.set(e,s.arity),s.arity;let c=t.slice(0,t.indexOf(`!`));if(c!==``&&(Hr(n,c)!==void 0||Jr(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=`at line ${i.line}, column ${i.column}`;throw new u(Yr(t)?`Could not find declaration or definition of symbol '${t}' ${l}`:`Unknown operator: \`${t}' ${l}`)},Qr=(e,t,n)=>(e.forEach(e=>q(e.set,t,n)),e.reduce((e,t)=>Ur(e,Gr(t.pattern)),t)),$r=(e,t)=>e.kind===`Identifier`&&e.name===t&&W(e)||Gn(e).some(e=>$r(e,t)),ei=(e,t)=>{e.kind===`FunctionConstruction`&&$r(e.body,t)&&(e.isRecursive=!0),Gn(e).forEach(e=>ei(e,t))},ti=(e,t,n)=>{let r=Ur(t,e.kind===`Function`?[e.name]:[]);e.kind===`Function`?(q(e.body,Qr(e.bounds,r,n),n),ei(e.body,e.name)):q(e.body,Wr(r,e.params),n)},ni=(e,t,n)=>{let r=e.filter(e=>e.isRecursive).reduce((e,t)=>({name:t.name,arity:Br(t),parent:e}),t);return e.reduce((e,t)=>(Vr(t)||ti(t,e,n),{name:t.name,arity:Br(t),parent:e}),r)},ri=(e,t,n,r,i)=>{let a=e.kind===`Operator`?e.params[t]:void 0,o=n.location;if(a?.arity===0&&r>0)throw new u(`Operator used in argument number ${t+1} has incorrect number of arguments at line ${o.line}, column ${o.column}`);let s=i?.kind===`Operator`&&i.params.some(e=>e.arity>0);if(a!==void 0&&a.arity>0&&(r!==a.arity||s))throw new u(`Argument number ${t+1} to operator '${e.name}' should be a ${a.arity}-parameter operator at line ${o.line}, column ${o.column}`)},ii=e=>e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:void 0,ai=(e,t,n)=>{let r=Hr(t,e.operator)?void 0:qr(e.operator,n),i=Zr(e,e.operator,t,n);if(i!==e.args.length)throw new u(`The operator ${e.operator} requires ${i} arguments at line ${e.location.line}, column ${e.location.column}`);e.args.forEach((e,i)=>{let a=ii(e),o=a===void 0||Hr(t,a)?void 0:qr(a,n),s=oi(e,t,n);r&&ri(r,i,e,s,o)})},oi=(e,t,n)=>e.kind===`Identifier`?Zr(e,e.name,t,n):e.kind===`OperatorReference`?Zr(e,e.operator,t,n):(q(e,t,n),e.kind===`Lambda`?e.params.length:0),q=(e,t,n)=>{let r=e=>e.forEach(e=>q(e,t,n));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{let r=Zr(e,e.name,t,n);if(r>0)throw new u(`The operator ${e.name} requires ${r} arguments at line ${e.location.line}, column ${e.location.column}`);return}case`OperatorReference`:Zr(e,e.operator,t,n);return;case`Apply`:ai(e,t,n);return;case`Lambda`:q(e.body,Ur(t,e.params),n);return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:q(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&&q(e.other,t,n);return;case`Let`:q(e.body,ni(e.definitions,t,n),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:q(e.body,Qr(e.bounds,t,n),n);return;case`UnboundedQuantifier`:q(e.body,Ur(t,e.names),n);return;case`Choose`:e.set&&q(e.set,t,n),q(e.body,Ur(t,Gr(e.pattern)),n);return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:q(e.predicate,Qr([e.bound],t,n),n);return;case`SetMap`:q(e.expression,Qr(e.bounds,t,n),n);return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:if(new Set(e.fields.map(e=>e.name)).size<e.fields.length)throw new u(`Non-unique fields in constructor at line ${e.location.line}, column ${e.location.column}`);r(e.fields.map(e=>e.value));return;case`Except`:r([e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])]);return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:q(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`:q(e.body,t,n);return;case`Subexpression`:e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>oi(e,t,n))}},si=(e,t,n)=>(e.set&&q(e.set,t,n),{name:e.name,arity:e.arity,parent:t}),ci=(e,t,n)=>{let r=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?si(t,e,n):(t.kind===`AssumeProve`?ci(t,e,n):q(t,e,n),e),t);return q(e.conclusion,r,n),r},li=(e,t,n)=>e.kind===`AssumeProve`?ci(e,t,n):(q(e,t,n),t),ui=(e,t,n)=>{e?.kind===`Steps`&&e.steps.reduce((e,t)=>di(t,e,n),t)},di=(e,t,n)=>{let r=e.body;switch(r.kind){case`Assert`:{let i=li(r.statement,t,n);return ui(e.proof,i,n),r.isSuffices?i:t}case`Define`:return ni(r.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),t,n);case`Have`:case`Case`:return q(r.expression,t,n),ui(e.proof,t,n),t;case`Witness`:return r.expressions.forEach(e=>q(e,t,n)),t;case`Take`:return Ur(Qr(r.bounds,t,n),r.names);case`Pick`:{let i=Ur(Qr(r.bounds,t,n),r.names);return q(r.body,i,n),ui(e.proof,t,n),i}default:return ui(e.proof,t,n),t}},fi=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:li(e.statement,void 0,t);ui(e.proof,n,t)},pi=(e,t)=>new u(`Multiply-defined symbol '${e}' at line ${t.line}, column ${t.column}`),mi=(e,t,n,r)=>t.reduce((e,t)=>{if(Hr(e,t)||n(t))throw pi(t,r);return{name:t,arity:0,parent:e}},e),hi=(e,t,n,r)=>(e.forEach(e=>_i(e.set,t,n)),e.reduce((e,t)=>mi(e,Gr(t.pattern),n,r),t)),gi=(e,t,n)=>{if(e.kind===`Function`){let r=Ur(t,[e.name]),i=hi(e.bounds,r,n,e.location);_i(e.body,i,n);return}let r=mi(t,e.params.map(e=>e.name),n,e.location);_i(e.body,r,n)},_i=(e,t,n)=>{let r=e.location;switch(e.kind){case`Lambda`:_i(e.body,mi(t,e.params,n,r),n);return;case`Let`:{let i=e.definitions.filter(e=>e.isRecursive).map(e=>e.name),a=e.definitions.reduce((e,t)=>{if(Hr(e,t.name)||n(t.name))throw pi(t.name,t.location);return gi(t,Ur(e,i),n),Ur(e,[t.name])},t);_i(e.body,mi(a,(e.instances??[]).flatMap(e=>e.name===void 0?[]:[e.name]),n,r),n);return}case`Forall`:case`Exists`:case`FunctionConstruction`:_i(e.body,hi(e.bounds,t,n,r),n);return;case`SetFilter`:_i(e.predicate,hi([e.bound],t,n,r),n);return;case`SetMap`:_i(e.expression,hi(e.bounds,t,n,r),n);return;case`UnboundedQuantifier`:_i(e.body,mi(t,e.names,n,r),n);return;case`Choose`:e.set&&_i(e.set,t,n),_i(e.body,mi(t,Gr(e.pattern),n,r),n);return;default:Gn(e).forEach(e=>_i(e,t,n))}},vi=e=>[...e.definitions.map(e=>({name:e.name,kind:`Definition`,location:e.location,isRecursive:e.isRecursive})),...e.instances.flatMap(e=>e.name===void 0?[]:[{name:e.name,kind:`Definition`,location:e.location,isRecursive:!1}]),...e.constants.map(e=>({name:e.name,kind:`Constant`,location:e.location,isRecursive:!1})),...e.variables.map(e=>({name:e.name,kind:`Variable`,location:e.location,isRecursive:!1}))],yi=(e,t)=>{let n=/* @__PURE__ */ new Map;vi(e).sort((e,t)=>zr(e.location,t.location)?-1:1).forEach(e=>n.set(e.name,[...n.get(e.name)??[],e]));let r=(e,n)=>{if(!t.imported.has(e)&&!Rr.has(e))return!1;let r=t.importedAt.get(e);return r===void 0||zr(r,n)};n.forEach(e=>e.forEach((n,i)=>{let a=e.slice(0,i).some(e=>e.kind===`Definition`||n.kind===`Definition`||e.kind!==n.kind),o=t.imported.get(n.name)?.declaration===n.kind;if(a||!o&&r(n.name,n.location))throw pi(n.name,n.location)}));let i=e=>t=>(n.get(t)??[]).some(t=>t.isRecursive||zr(t.location,e))||r(t,e);e.definitions.forEach(e=>gi(e,void 0,i(e.location))),e.assumptions.forEach(e=>_i(e.expression,void 0,i(e.location))),e.instances.forEach(e=>{let t=i(e.location),n=mi(void 0,e.params.map(e=>e.name),t,e.location);e.substitutions.forEach(e=>_i(e.expression,n,t))})},bi=(e,t)=>{let n=new Map([...Rr,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0})),n},xi=(e,t,n,r)=>{let i=Wr(void 0,e.params),a={imported:bi(n,r.imported),definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set},o=new Map(e.substitutions.map(e=>[e.name,e.expression])),s=`in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`;return o.forEach((e,n)=>{if(t.every(e=>e.name!==n))throw new u(`Identifier '${n}' is not a legal target of a substitution ${s}`)}),new Map(t.map(t=>{let n=t.name;if(!o.has(n)&&!Hr(i,n)&&!Jr(n,a))throw new u(`Substitution missing for symbol ${n} ${s}`);let r=o.get(n)??{kind:`Identifier`,name:n,location:e.location};if(t.arity===0||r.kind!==`Identifier`)return q(r,i,a),[n,r];if(Zr(r,r.name,i,a)!==t.arity)throw new u(`An operator must be substituted for symbol '${n}', and it must have arity ${t.arity} ${s}`);return[n,r]}))},Si=(e,t)=>{let n=bi(e,t.imported),r=new Set([...e.theorems,...e.assumptions].flatMap(e=>e.name??[])),i=(e,i)=>({imported:n,definitions:t.definitions,getKey:t.getKey,location:e,self:i,facts:r});e.definitions.forEach(e=>ti(e,void 0,i(e.location,e))),e.assumptions.forEach(e=>q(e.expression,void 0,i(e.location,void 0))),e.theorems.forEach(e=>fi(e,i(e.location,void 0)))},Ci=/* @__PURE__ */ new WeakSet,wi=/* @__PURE__ */ new WeakSet,Ti=(e,t,n=/* @__PURE__ */ new Set)=>{let r=ji(e,(e,r)=>Ti(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&W(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&W(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Ei=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Di=/* @__PURE__ */ new WeakMap,Oi=e=>Di.get(e)??e.name,ki=(e,t)=>(Oi(t)!==e.name&&Di.set(e,Oi(t)),e),Ai=(e,t)=>ki(e.kind===`Function`?{...e,bounds:Ei(e.bounds,e=>t(e,[])),body:t(e.body,Kr(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),ji=(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=>Ai(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Ei(e.bounds,n),body:t(e.body,Kr(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,Gr(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,Gr(e.bound.pattern))};case`SetMap`:return{...e,bounds:Ei(e.bounds,n),expression:t(e.expression,Kr(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=>({name:e.name,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`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)}}},Mi=`LAMBDA`,Ni=(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 ji(e,(e,n)=>(r.push(...Ni(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Pi=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}},Fi=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Ii=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Li=(e,t)=>e.map(e=>({pattern:Ii(e.pattern,t),set:e.set})),Ri=(e,t)=>e.kind===`Function`?{...e,bounds:Li(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},zi=(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=>ki({...Ri(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Li(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Ii(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Ii(e.bound.pattern,n),set:e.bound.set}};default:return e}},Bi=e=>`${e}@ENABLED`,Vi=(e,t)=>e.modes.get(t)??e,Hi=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!W(e)&&t.instantiation.variables.has(e.name),Ui=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Ui(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Hi(e,t,n))return[e.name];let r=W(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Ui(r.body,t,/* @__PURE__ */ new Map):void 0},Wi=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Hi(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Bi(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Yi(e.expression,Vi(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Yi(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Yi(e.subscript,Vi(t,`Primed`),n),location:r},Yi(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Ui(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:Bi(r),location:e.location},location:e.location},Yi({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Gi=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),Ki=(e,t)=>e.map(e=>Gi(e.name,t)),qi=(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:[...Ki(t,r),...i.map(e=>Gi(e,r))],location:r},location:r}},Ji=(e,t)=>e.instantiation.isParameterized(t)?Zi(e,t):void 0,Yi=(e,t,n)=>{let r=e=>Yi(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!W(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Yi(e.expression,Vi(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:Yi(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Vi(t,`Enabled`),n)};let s=Wi(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return Ci.add(n),n;let r=Ji(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&&Br(o)>0?qi(r,a,Br(o),e.location):{kind:`Apply`,operator:r,args:Ki(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||wi.has(e),c=e=>(s&&wi.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:Mi,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:Mi,args:n,resolution:{kind:`Local`}},location:e.location};if(o)throw new u(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let l=Ji(t,e.operator);return l===void 0?c({...e,args:n}):{...e,operator:l,args:[...Ki(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=Ji(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?qi(n,a,Br(r),e.location):{...e,operator:n}}let c=Pi(t),l=ji(e,(e,i)=>i.length===0?r(e):Yi(e,t,Fi(n,i,c)));return zi(l,n,c)},Xi=(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:Gi(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Zi=(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=Pi(e),o=Ri(Ai(i,(t,n)=>Yi(t,e,Fi(/* @__PURE__ */ new Map,n,a))),a);return Xi(o,r.params,i.location)}):t},Qi=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Ni(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=>Ji(i,e)??e,getQualifiedKey:t=>{let n=Ji(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Xi(r,e.params,r.location)):t}}},$i=e=>e.kind===`Let`&&e.instances!==void 0||Gn(e).some($i),ea=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=ji(e,e=>ea(e,t,r));return i.kind!==`Let`||!i.instances?i:{kind:`Let`,definitions:i.instances.reduce((e,n)=>{let i=e.findIndex(e=>zr(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions),body:i.body,location:i.location}},ta=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,na=(e,t)=>e.definitions.some(e=>$i(e.body))||e.assumptions.some(e=>$i(e.expression))||e.theorems.some(e=>{let t=ta(e);return t!==void 0&&$i(t)})?{...e,definitions:e.definitions.map(e=>Ai(e,e=>ea(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:ea(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=ta(e);return n===void 0?e:{...e,statement:ea(n,t,[])}})}:e,ra=/* @__PURE__ */ new WeakMap,ia=/* @__PURE__ */ new WeakMap,J=(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},aa=(e,t,n)=>{let r=e.slice();return r[t]=n,r},oa=(t,r,i=X(t,r))=>{if(typeof i==`boolean`)return i;try{return lo(i,`the action at ${qa(t)}`)}catch(t){throw r.next===void 0?t:n(t,e.error)}},sa=e=>e===`=`||e===`\\in`||e===`\\subseteq`,ca=(e,t,n)=>{let r=n?ra:ia,i=r.get(e);if(i)return i;let a=La(e,t,n);return r.set(e,a),a},la=(e,t)=>{if(t.constants.has(e))return;let n=uo(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},ua=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return ua(e.expression,t,!1,r);if(e.kind!==`Identifier`||W(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=la(e.name,t);if(a&&!r.has(a))return r.add(a),ua(a.body,t,n,r)},da=(e,t,n)=>ua(e,t,!n),fa=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return fa(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Go(e.definitions,J(r,t,n));return fa(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=ao(t,e.name);if(a?.kind===`Thunk`)return fa(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=la(e.name,r.environment);if(s)return fa(s.body,void 0,n,r,i)},pa=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||W(e))||!t&&e.kind===`Prime`,ma=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>ma(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=la(e.name,t);if(i)return n.add(e.name),ma(i.body,t,n)},ha=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),ga=(e,t,n)=>ha.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||sa(e.operator)&&(pa(e.args[0],n)||da(e.args[0],t,n)!==void 0)||W(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,_a=/* @__PURE__ */ new Set,va=(e,t)=>{if(W(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return ji(e,(e,i)=>{let a=r.isReadOnly?va(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},ya=(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||W(e)?void 0:uo(r,t);return i&&!n.has(i)&&(n.add(i),ya(i.body,t,n))?!0:Gn(e).some(e=>ya(e,t,n))},ba=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=da(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=ma(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return ga(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:ca(e,t,n)}},xa=(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(Ks(e,t)===void 0||ya(e,t,/* @__PURE__ */ new Set))return!0;let n=va(e,_a);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)}},Sa=(e,t,n)=>{let r=e.map(e=>ba(e,t,n)),i=r.map(()=>void 0),a=(e,n,o,s,c,l)=>{let u=s,d;for(let s=e;s<r.length;s++){if(s>0&&n.isInit&&Va(u)){d??=J(n,o,u);for(let e=s;e<r.length;e++)if(!Ca(r[e].expression,d))return;l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=J(n,o,u);let r=i[s]??=hs(e.expression,t);if(!oa(e.expression,d,r(d)))return;continue}if(e.kind===`Assign`){d??=J(n,o,u);let r=(i[s]??=hs(e.value,t))(d),a=u[e.index];if(a===void 0)u=aa(u,e.index,r),d=void 0;else if(!Be(a,r))return;continue}if(e.kind===`Unchanged`){let t=n.current;if(!t)return;for(let n of e.indices){let e=u[n];if(e===void 0)u=aa(u,n,t[n]),d=void 0;else if(!Be(e,t[n]))return}continue}let f=s+1;e.runner(n,o,u,c,!0,(e,t)=>a(f,n,o,e,t,l));return}l(u,c)};return(e,t,n,r,i,o)=>a(0,e,t,n,r,o)},Ca=(e,t)=>lo(X(e,t),`the initial predicate at ${qa(e)}`),wa=e=>(t,n,r,i,a,o)=>{oa(e,J(t,n,r))&&o(r,i)},Ta=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=J(r,i,a);if(a[l]!==void 0){oa(e,u)&&c(a,o);return}let d=X(n,u),p=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!z(p))throw new f(`In computing ${r.isInit?`initial`:`next`} states, the right side of \\IN is not enumerable.\n${Ya(e)}`);let m=Gt(p);for(let e=0;e<m.length&&!r.isStopped;e++)c(aa(a,l,m[e]),o)}},Ea=/* @__PURE__ */ new WeakMap,Da=e=>{let t=Ea.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Da),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Ea.set(e,n),n},Oa=(e,t)=>{let n=e.args[0],r=wa(e),i=(e,r,i)=>fa(n,r,i,e,!t)??-1,a=Ta(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=X(e.args[1],J(t,n,o));l(aa(o,u,d),s)}},ka=(e,t,n,r)=>{if(e.kind===`FunctionConstruction`)return{bounds:e.bounds,body:e.body,scope:t};if(e.kind!==`Identifier`)return;let i=ao(t,e.name);if(i?.kind===`Thunk`)return ka(i.expression,i.scope,n,r);let a=i?void 0:uo(e.name,r.environment);if(a?.kind!==`Function`)return;let o=X(e,J(r,void 0,n));return{bounds:a.bounds,body:a.body,scope:oo(void 0,a.name,o)}},Aa=(e,t,n)=>{let r=wa(e);return(i,a,o,s,c,l)=>{let u=ka(e.function,a,o,i);if(!u){r(i,a,o,s,c,l);return}let d=J(i,a,o),p=e.args.map(e=>X(e,d)),m=p.length===1?p[0]:R(p),h=_o(u.bounds,J(i,u.scope,o));if(!tn(m,h))throw new f(`Attempted to apply a function to ${U(m)}, which is not in its domain at ${qa(e)}`);ca(u.body,t,n)(i,vo(u.bounds,u.scope,m),o,s,c,l)}},ja=(e,t)=>{if(ma(e,t))return Sa([Da(e)],t,!1);if(e.kind===`Tuple`)return ca(Da(e),t,!1);let n=Da(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?ao(i,e.name):void 0;l?.kind===`Thunk`?ca(Da(l.expression),t,!1)(r,l.scope,a,o,s,c):oa(n,J(r,i,a))&&c(a,o)}},Ma=(e,t,n)=>{let r=e.operator,i=wa(e),a=W(e)?void 0:ko(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Cs(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=ca(a.body,t,n),o.body(e,i(J(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=J(a,o,s),f=jo(e,d);f?.kind===`Closure`?ca(f.body,t,n)(a,Uo(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Na=(e,t,n)=>{let r=wa(e),i=W(e)?void 0:la(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=ao(s,e.name);f?.kind===`Thunk`?ca(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=ca(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Pa=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=e.operands[0];if(n.kind!==`Apply`||n.operator!==`=`||W(n))return;let r=n.args[0],i=n.args[1];if(r.kind!==`FunctionApplication`||i.kind!==`String`)return;let a=r.args.length===1?r.args[0]:void 0;if(a?.kind!==`Identifier`||!W(a))return;let o=ua(r.function,t,!1);return o===void 0?void 0:{variable:o,argument:a.name,labels:/* @__PURE__ */ new Set([i.value])}}if(e.kind===`Or`){let r=e.operands.map(e=>Pa(e,t,n)),i=r[0],a=r.every(e=>e!==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}}if(e.kind!==`Apply`||W(e))return;let r=ko(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Pa(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`&&W(o))return{variable:i.variable,argument:o.name,labels:i.labels}},Fa=(e,t,n)=>{let r=ao(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},Ia=(e,t,n)=>{let r=e.map(e=>ca(e,t,n)),i=n?[]:e.map(e=>Pa(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?.labels:void 0);return(e,t,n,i,s,c)=>{let l=a&&Fa(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++)(l===void 0||o[a]?.has(l)!==!1)&&r[a](e,t,n,i,s,c)}},La=(e,t,n)=>{let r=e=>ca(e,t,n);switch(e.kind){case`And`:return Sa(e.operands,t,n);case`Or`:return Ia(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(t,n,r,o,s,c)=>{let l=ho(X(a.set,J(t,n,r)),a.set);for(let a=0;a<l.length&&!t.isStopped;a++)i(t,oo(n,e,l[a]),r,o,s,c)}}let o=n?void 0:xa(e,t);if(o){let r=Sa(o.rest,t,n);return(t,n,i,a,s,c)=>{let l=J(t,n,i),u=e.bounds.map(e=>ho(X(e.set,l),e.set));if(u.some(e=>e.length===0))return;let d=(e,n)=>{if(e<0)r(t,n,i,a,s,c);else for(let r of u[e]){if(t.isStopped)return;let a=oo(n,o.names[e],r);if(e===u.length-1){let e=J(t,a,i);if(!o.guards.every(t=>oa(t,e)))continue}d(e-1,a)}};d(u.length-1,n)}}return(t,n,r,a,o,s)=>{go(e.bounds,J(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Ks(e,t)!==void 0&&!ya(e.body,t,/* @__PURE__ */ new Set)?va(e,_a):void 0;return(t,n,r,o,s,c)=>{let l=[];go(e.bounds,J(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>ao(n,e)?.kind===`Value`)){u.every(n=>oa(e.body,J(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Va(r)?u.slice(n).every(n=>Ca(e.body,J(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=X(e.condition,J(r,i,a));(lo(l,`an IF condition`)?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=J(r,i,a),u=t.find(e=>lo(X(e.condition,l),`a CASE guard`))?.body??n;if(!u)throw new f(`In computing ${r.isInit?`initial`:`next`} states, TLC encountered a CASE with no conditions true.\n${Ya(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=ts(e.definitions,t);return(t,r,a,o,s,c)=>n(t,Go(e.definitions,J(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new f(`UNCHANGED appears in an initial predicate at ${qa(e)}`)}:ja(e.expression,t);case`AngleAction`:{let t=r(e.action),n=Da(e.subscript);return(e,r,i,a,o,s)=>t(e,r,i,a,o,(t,i)=>{oa(n,J(e,r,t))||s(t,i)})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,Da(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Na(e,t,n);case`FunctionApplication`:return Aa(e,t,n);case`Apply`:{let i=e.args;if(sa(e.operator)){let r=da(i[0],t,n);if(r!==void 0)return e.operator===`=`?Sa([e],t,n):Ta(e,()=>r);if(pa(i[0],n))return Oa(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=X(i[0],J(t,n,r));(typeof c==`boolean`?c:lo(c,`the left side of => at ${qa(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return Ma(e,t,n)}default:return wa(e)}},Ra=/* @__PURE__ */ new WeakMap,za=e=>{let t=Ra.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Ra.set(e,n),n},Ba=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),Va=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Ha=(e,t)=>{let n=t.state;if(!n||!Va(n))throw new f(`ENABLED needs a complete state at ${qa(e)}`);let r=t.environment,i={environment:r,isInit:!1,current:n,isStopped:!1};return ca(e,r,!1)(i,t.scope,za(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Ua=(t,r,i,a)=>{let o={environment:r,isInit:!0,current:void 0,isStopped:!1};ca(t,r,!0)(o,a,za(r),void 0,!1,t=>{if(!o.isStopped){if(!Va(t))throw n(new f(`The initial predicate does not assign ${Ba(t,r).join(`, `)}`),e.error);o.isStopped=i(t)}})},Wa=(e,t,n)=>{let r=[];return Ua(e,t,e=>(r.push(e),!1),n),r},Ga=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,current:t,isStopped:!1},o={successors:0};return ca(e,n,!1)(a,i,za(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!Va(e))throw new m(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${Ba(e,n).join(`, `)}`);o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},Ka=(e,t,n,r)=>{let i=[];return Ga(e,t,n,e=>(i.push(e),!1),r),i},qa=e=>`line ${e.location.line}, column ${e.location.column}`,Ja=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,Ya=e=>{let t=e.location.range;return t?Ja(t):qa(e)},Xa=(e,t)=>new f(`A non-boolean expression (${mr(t)}) was used as the condition of an IF.\n${Ya(e)}`),Za=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r){let r=e.operands[t],i=r.kind===`Number`?String(r.value):Ya(r);return new f(`A non-boolean expression (${mr(n)}) was used as a formula in a conjunction.\n${i}`)}let i=e.operands[Math.max(t,1)].location.range?.end??r.end;return new f(`Attempted to evaluate an expression of form P /\\ Q when ${t===0?`P`:`Q`} was\n${mr(n)}.\n${Ya({...e,location:{...e.location,range:{...r,end:i}}})}`)},Qa=e=>t=>dn(t)?`Attempted to select nonexistent field "${e.field}" from the record\n${U(t)}\n${Ya(e)}`:un(t,e.field),$a=e=>t=>`A non-function (${mr(t)}) was applied as a function.\n${Ya(e)}`,eo=e=>t=>`Attempted to select field "${e.field}" from a non-record value ${U(t)}\n${Ya(e)}`,to=e=>t=>{if(!N(t))throw new f(`Attempted to apply the operator DOMAIN to a non-function\n(${mr(t)})\n${Ya(e)}`);return gn(t)},no=(e,t)=>(n,r)=>{if(!M(n)||I(n))throw new f(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Ya(e)}`);return t.evaluate([n,r])},ro=t=>n(new f(`TLC can't handle real numbers: ${t.text} at ${qa(t)}`),e.configParseError),io=t=>n(new f(`TLC can't handle a number this big: ${t.text??t.value} at ${qa(t)}`),e.error),ao=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},oo=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),so=(e,t,n)=>{if(t.kind===`Name`)return oo(e,t.name,n);let r=Qt(n);if(!r||r.length!==t.names.length)throw new f(`Cannot bind <<${t.names.join(`, `)}>> to ${U(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>oo(e,t,r[n]),e)},co=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next}),lo=(e,t)=>{if(typeof e!=`boolean`)throw new f(`Expected ${t} to be a boolean but found ${U(e)}`);return e},uo=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),fo=(e,t)=>{if(e.kind===`Prime`||e.kind===`Unchanged`||e.kind===`Enabled`)return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=uo(n,t);if(e&&!t.constants.has(n)&&!po(e,t))return!0}return Gn(e).some(e=>fo(e,t))},po=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!fo(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>fo(e.set,t)));return t.constantLevels.set(e,r),r},mo=(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.`},ho=(e,t)=>{if(!M(e)||I(e)){let n=U(e),r=mo(e,n);throw new f(r===void 0?`TLC encountered a non-enumerable quantifier bound\n${n}.\n${Ya(t)}`:`TLC encountered the non-enumerable quantifier bound\n${n}\n${Ya(t)}\n${r}`)}return typeof e==`object`&&e.kind===`Interval`?Dt(e):B(e).elements},go=(e,t,n)=>{let r=e.map(e=>ho(X(e.set,t),e.set)),i=(t,a)=>t<0?n(a):r[t].some(n=>i(t-1,so(a,e[t].pattern,n)));return i(e.length-1,t.scope)},_o=(e,t)=>{let n=e.map(e=>X(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},vo=(e,t,n)=>{if(e.length===1)return so(t,e[0].pattern,n);let r=Qt(n)??[];return e.reduce((e,t,n)=>so(e,t.pattern,r[n]),t)},yo=/* @__PURE__ */ new WeakMap,bo=(e,t)=>{let n=yo.get(t);if(n)return n;let r=t.location.range;if(!r)return;let i={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:Ja(r)};return yo.set(t,i),i},xo=(e,t,n)=>{let r=bo(e,t);if(!r)return;let i=e.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:r.parameters.map(e=>({name:e.name,domain:i[e.index]})),body:r.body}},So=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Tn(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(He(a[t],e))return a[t+1]}let o=t(e,i),s=r.get(n);return s===void 0?r.set(n,[e,o]):s.push(e,o),o}};return i},Co=(e,t)=>{let n=_o(e.bounds,t),r=So(n,(n,r)=>X(e.body,co(t,vo(e.bounds,oo(void 0,e.name,r),n))),xo(e.bounds,e.body,n));return e.bounds.length===1?an(r):r},wo=(e,t)=>e.kind===`Function`?Co(e,t):X(e.body,t),To=(e,t)=>{let n=po(e,t.environment),r=n?t.environment.definitionValues.get(e):void 0;if(r!==void 0)return r;if(e.kind===`Operator`&&e.params.length>0)throw new f(`Operator ${e.name} requires ${e.params.length} arguments`);let i=co(t,void 0);if(!n)return wo(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>wo(e,i));return t.environment.definitionValues.set(e,a),a},Eo=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=X(e.expression,co(t,e.scope));return n&&(e.cache=r),r},Do=/* @__PURE__ */ new WeakMap,Oo=e=>{let t=Do.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return Do.set(e,n),n},ko=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return ko(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Oo(r):t.builtins.get(e)},Ao=/* @__PURE__ */ new WeakMap,jo=(e,t)=>{if(W(e))return Mo(e.operator,t);let n=Ao.get(e),r=n===void 0?ko(e.operator,t.environment)??null:n;return n===void 0&&Ao.set(e,r),r??Mo(e.operator,t)},Mo=(e,t)=>{let n=ao(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return ko(e,t.environment)},No=e=>e.kind===`Closure`?e.params.length:e.arity,Po=(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:Mo(n,t);if(!r)throw new f(`Expected an operator argument at ${qa(e)}`);return r},Fo=(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)=>oo(e,n.name,t[r]),e.scope);return X(e.body,co(n,r))},Io=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:No(e),call:n=>Fo(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},Lo=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Mo(e.name,t);return n!==void 0&&No(n)>0},Ro=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),zo=(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 zo(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([])}},Bo=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&qo(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=W(e)?void 0:zo(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=ao(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:Ro(e,t)}}return t=>Ro(e,t)},Vo=/* @__PURE__ */ new WeakMap,Ho=(e,t)=>{let n=Vo.get(e);if(n)return n;let r=Bo(e,t);return Vo.set(e,r),r},Uo=(e,t,n)=>{if(t.length!==e.params.length)throw new f(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`);let r=e.scope;for(let i=0;i<t.length;i++){let a=e.params[i],o=a.arity>0?{kind:`Operator`,operator:Po(t[i],n)}:Ho(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},Wo=(e,t,n)=>e.kind===`Closure`?X(e.body,co(n,Uo(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>X(e,n))):e.isLazy?e.evaluate(xs(t,n),n):e.evaluate(t.map(e=>Lo(e,n)?Io(Po(e,n),n):X(e,n)),n),Go=(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},i):r.params.length>0||n?.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},i)},t.scope),Ko=(e,t,n)=>{let r=ao(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Eo(r,n);if(r?.kind===`Operator`){if(No(r.operator)===0)return Fo(r.operator,[],n);throw new f(`Operator ${e} is used without arguments`)}let i=zo(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Bs(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return To(i.definition,n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new f(`Unknown identifier ${e} at ${qa(t)}`)},qo=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,Jo=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Yo=(e,t)=>Jo.has(e)||t.builtins.get(e)?.isStateLevel===!0,Xo={builtins:Jo,definitions:/* @__PURE__ */ new WeakMap},Zo={builtins:new Set([...Jo].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},Qo=(e,t)=>e.kind===`Operator`&&e.params.length===0&&po(e,t),$o=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!W(e)){let e=uo(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!Qo(e,t)&&es(e,t,n))return!0}return Gn(e).some(e=>$o(e,t,n))},es=(e,t,n=Xo)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=$o(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>$o(e.set,t,n));return n.definitions.set(e,i),i},ts=(e,t)=>new Set(e.filter(e=>es(e,t))),ns=e=>[...e.definitions.values()].some(t=>es(t,e)),rs=e=>[...e.definitions.values()].some(t=>es(t,e,Zo)),is=/* @__PURE__ */ new WeakMap,as=(e,t)=>{let n=is.get(e);if(n!==void 0)return n;let r=ls(e,t,ss);return is.set(e,r),r},os=/* @__PURE__ */ new Set([`Number`,`String`,`Identifier`,`Apply`,`And`,`Or`,`If`,`Case`,`SetEnumeration`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`FunctionApplication`,`FieldAccess`,`Product`,`SetFilter`,`SetMap`,`Forall`,`Exists`,`Choose`,`FunctionConstruction`,`Let`]),ss=/* @__PURE__ */ new Set,cs=(e,t,n)=>n.size===0?as(e,t):ls(e,t,n),ls=(e,t,n)=>{if(!os.has(e.kind))return!1;if(e.kind===`Identifier`&&W(e))return n.has(e.name);if(W(e))return!1;if(e.kind===`Identifier`){let n=zo(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&Qo(n.definition,t)}if(e.kind===`Apply`){if(Yo(e.operator,t)||e.operator===`~>`)return!1;let r=ko(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=uo(e.operator,t);if(!n||!po(n,t)||es(n,t))return!1}return!(r.kind===`Closure`?r.params:[]).some(e=>e.arity>0)&&e.args.every(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&cs(e,t,n))}let r={value:!0};return ji(e,(e,i)=>(r.value&&=cs(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},us=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,ds=e=>{let t={value:void 0};return n=>{if(t.value!==void 0)return t.value;let r=e(n);return t.value=r,r}},fs=(e,t)=>{if(e.kind===`Identifier`&&W(e))return!t.has(e.name);if(W(e))return!0;let n={value:!1};return ji(e,(e,r)=>(n.value||=fs(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},ps=(e,t)=>Ci.has(e)&&us(e)&&Ks(e,t)!==void 0&&!fs(e,ss),Y=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Us(e,t),i=us(e)&&as(e,t)?ds(r):ps(e,t)?vs(r):r;return t.evaluators.set(e,i),i},ms=/* @__PURE__ */ new WeakMap,hs=(e,t)=>{let n=ms.get(e);if(n)return n;let r=(us(e)&&as(e,t)?void 0:Pr(e,t))??Y(e,t);return ms.set(e,r),r},X=(e,t)=>hs(e,t.environment)(t),gs=(e,t)=>{let n=e.name,r=W(e)?void 0:zo(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Bs(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`&&r.definition.kind===`Operator`){let e=r.definition;if(e.params.length===0&&po(e,t))return t=>To(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=hs(e.body,t),n.body(co(r,void 0)));return _s(e,t)?vs(r):r}return t=>To(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>To(e,t);return po(e,t)||!_s(e,t)?n:vs(n)}return t=>Ko(n,e,t)},_s=(e,t)=>Ks(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>Ks(e.set,t)!==void 0)),vs=e=>{let t={recent:void 0,recentValue:void 0,previous:void 0,previousValue:void 0};return n=>{let r=n.state;if(r!==void 0&&t.recent===r&&t.recentValue!==void 0)return t.recentValue;if(r!==void 0&&t.previous===r&&t.previousValue!==void 0)return t.previousValue;let i=e(n);return t.previous=t.recent,t.previousValue=t.recentValue,t.recent=r,t.recentValue=i,i}},ys=(e,t)=>{let n=ko(e,t);return n!==void 0&&No(n)>0},bs=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!W(e)&&ys(e.name,t)),xs=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>X(e,t),expression:e})),Ss=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(xs(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&bs(t[0],n)){let e=Y(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&bs(t[0],n)&&bs(t[1],n);if(i&&a){let e=Y(t[0],n),r=Y(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>Lo(e,n)?Io(Po(e,n),n):X(e,n)),n)},Cs=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw new f(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Ho(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:Po(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},ws=/* @__PURE__ */ new WeakMap,Ts=e=>{let t=ws.get(e);if(t)return t;let n={calls:/* @__PURE__ */ new Map,size:0};return ws.set(e,n),n},Es=(e,t)=>{let n=[];for(let r=e;n.length<t;r=r?.parent){if(r?.binding.kind!==`Value`)return;n.push(r.binding.value)}return n},Ds=(e,t)=>e.every((e,n)=>He(e,t[n])),Os=(e,t)=>{let n=uo(e.operator,t);return n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&po(n,t)&&!es(n,t)},ks=(e,t,n,r)=>{let i=Cs(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=hs(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next}));if(!r)return e=>o(i(e),e);let s=Ts(e);return e=>{let n=i(e),r=Es(n,t.length);if(!r)return o(n,e);let a=r.length;for(let e of r)a=bn(a,Tn(e));let c=s.calls.get(a),l=c?.find(e=>Ds(e.args,r));if(l)return l.value;let u=o(n,e);return s.size<65536&&(s.size++,c?c.push({args:r,value:u}):s.calls.set(a,[{args:r,value:u}])),u}},As=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=Y(n[0],t),r=Y(n[1],t);return t=>!lo(e(t),`the left side of =>`)||lo(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new f(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=W(e)?void 0:ko(e.operator,t);if(r?.kind===`Closure`)return ks(r,n,t,Os(e,t));if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=Y(n[0],t),i=to(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=Y(n[0],t);return wi.has(e)||fo(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=Y(n[0],t),a=Y(n[1],t),o=no(e,r);return e=>o(i(e),a(e))}return r?.kind===`Builtin`?Ss(r,n,t):r=>{let i=Mo(e.operator,r);if(i)return Wo(i,n,r);throw t.definitions.get(e.operator)?.kind===`Function`?new f(`${e.operator} is a function; apply it with brackets`):e.operator===`\\cdot`?new f(`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.`):new f(`Unknown operator ${e.operator} at ${qa(e)}`)}},js=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=Y(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=Y(a.set,t);return t=>{let s=ho(o(t),a.set);for(let a=0;a<s.length;a++){let o=lo(i(co(t,oo(t.scope,e,s[a]))),r);if(o!==n)return o}return 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=>Y(e.set,t));return t=>{let s=a.map((e,n)=>ho(e(t),o[n].set)),c=(a,o)=>{if(a<0)return lo(i(co(t,o)),r)!==n;let l=s[a];for(let t=0;t<l.length;t++)if(c(a-1,oo(o,e[a],l[t])))return!0;return!1};return c(o.length-1,t.scope)?!n:n}}return e=>go(o,e,t=>lo(i(co(e,t)),r)!==n)?!n:n},Ms=(e,t)=>{if(e.kind===`Tuple`)return R(e.names.map(e=>{let n=ao(t,e);return n?.kind===`Value`&&n.value}));let n=ao(t,e.name);return n?.kind===`Value`?n.value:void 0},Ns=/* @__PURE__ */ new WeakSet,Ps=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&Ns.add(e)},Fs=(e,t)=>{let n=Ns.has(e),r=Y(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=Y(a.set,t);return t=>{let c=o?s(t):_o(i,t),l=typeof c==`object`&&c.kind===`ProductSet`&&i.length>1?c.factors:[c];if(e.isRecursive||n||!l.every(pe)){let n=So(c,e=>r(co(t,vo(i,t.scope,e))),xo(i,e.body,c));return i.length===1?an(n):n}if(o&&a.pattern.kind===`Name`){let e=a.pattern.name,n=kt(c);return an(ze(n,n.map(n=>r(co(t,oo(t.scope,e,n))))))}let u=[];return go(i,t,e=>{let n=i.length===1?Ms(a.pattern,e)??!1:R(i.map(t=>Ms(t.pattern,e)??!1));return u.push([n,r(co(t,e))]),!1}),xt(u)}},Is=(e,t)=>{let n=Ns.has(e);n&&Ps(e.function);let r=Y(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=>Y(e,t))}),value:Y(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):R(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(co(i,oo(i.scope,`@`,e))):_n(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return e=>{let t=r(e);for(let n of i)t=o(t,n.path,0,e,n.value);return t}},Ls=(e,t)=>{if(e.kind===`SetFilter`){let n=Y(e.predicate,t),r=Y(e.bound.set,t),i=e.bound.pattern;return t=>{let a=r(t),o=e=>lo(n(co(t,so(t.scope,i,e))),`a set filter predicate`);if(!pe(a)){if(M(a))return{kind:`FilteredSet`,base:a,test:o};throw new f(`TLC encountered a non-enumerable quantifier bound ${U(a)} at ${qa(e.bound.set)}`)}return Re(B(a).elements.filter(o))}}if(e.kind===`SetMap`){let n=Y(e.expression,t);return t=>{let r=[];return go(e.bounds,t,e=>(r.push(n(co(t,e))),!1)),gt(r)}}let n=e.set;if(!n)return()=>{throw new f(`TLC cannot evaluate an unbounded CHOOSE at ${qa(e)}`)};let r=Y(e.body,t),i={pattern:e.pattern,set:n};return t=>{let n={value:void 0};if(go([i],t,i=>lo(r(co(t,i)),`the body of CHOOSE`)?(n.value=Ms(e.pattern,i),!0):!1),n.value===void 0)throw new f(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${Ya(e)}`);return n.value}},Rs=e=>[...e].sort((e,t)=>L(e.name,t.name)),zs=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),Bs=(e,t)=>new f(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${Ya(t)}`),Vs=e=>new f(`A primed expression appears outside an action at ${qa(e)}`),Hs=(e,t)=>{let n=Rs(e),r=zs(n),i=n.map(e=>Y(e.value,t));if(r)return e=>xt(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=>ye(a,i.map(t=>t(e)),o):e=>ze(a,i.map(t=>t(e)))},Us=(e,t)=>{let n=e=>Y(e,t);switch(e.kind){case`Number`:{let t=e.value;return qo(t)?()=>t:()=>{throw io(e)}}case`Decimal`:return()=>{throw ro(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return gs(e,t);case`Apply`:return As(e,t);case`OperatorReference`:case`Lambda`:return()=>{throw new f(`An operator cannot be used as a value at ${qa(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 Za(e,r,i);if(!i)return!1}return!0}}case`Or`:{let t=e.operands.map(n);return e=>{for(let n=0;n<t.length;n++)if(lo(t[n](e),`a disjunct`))return!0;return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw Vs(e);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>Be(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 Xa(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t)if(lo(e.condition(n),`a CASE guard`))return e.body(n);if(r)return r(n);throw new f(`Attempted to evaluate a CASE with no conditions true.\n${Ya(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(co(n,Go(e.definitions,n)))}case`Forall`:case`Exists`:return js(e,t);case`UnboundedQuantifier`:return()=>{throw new f(`TLC cannot evaluate an unbounded quantifier at ${qa(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Ls(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>gt(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>R(t.map(t=>t(e)))}case`FunctionConstruction`:return Fs(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 Hs(e.fields,t);case`RecordSet`:{let t=Rs(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 Is(e,t);case`ExceptAt`:return t=>{let n=ao(t.scope,`@`);if(n?.kind!==`Value`)throw new f(`@ appears outside an EXCEPT at ${qa(e)}`);return n.value};case`FunctionApplication`:{Ps(e.function);let t=n(e.function),r=e.args.map(n),i=$a(e);if(r.length===1){let e=r[0];return n=>mn(t(n),e(n),void 0,i)}return e=>mn(t(e),R(r.map(t=>t(e))),void 0,i)}case`FieldAccess`:{let t=n(e.record),r=e.field,i=Qa(e),a=eo(e);return e=>mn(t(e),r,i,a)}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?lo(t(e),`an action`)||r(e):lo(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>Ha(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new f(`The subexpression reference at ${qa(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new f(`TLC cannot evaluate a temporal formula in a state at ${qa(e)}`)}}},Ws=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),Gs=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},Ks=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(Ws.has(e.kind))return!1;let a=Gs(e),o=(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`;if(a!==void 0&&!o&&!t.constants.has(a)){let e=t.substitutions.get(a)??a,o=t.definitions.get(e);if(!o&&Yo(e,t))return!1;let s=t.variableIndex.get(a);if(s!==void 0&&n.add(s),o&&!r.has(o)&&(r.add(o),!i(o.body)||o.kind!==`Operator`&&!o.bounds.every(e=>i(e.set))))return!1}return Gn(e).every(i)};return i(e)?[...n]:void 0},qs=/* @__PURE__ */ new Map([[`Reals`,`-------------------------------- MODULE Reals -------------------------------
|
|
24
27
|
(***************************************************************************)
|
|
25
28
|
(* This module provides dummy definitions of the operators that are *)
|
|
26
29
|
(* defined by the real Reals module. It is expected that any tool that *)
|
|
@@ -89,8 +92,8 @@ _TEPosition ==
|
|
|
89
92
|
THEN _TETraceLength
|
|
90
93
|
ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
|
|
91
94
|
|
|
92
|
-
=============================================================================`]]),
|
|
93
|
-
`)},Cc=(e,t)=>{let n=se(e),r={index:0,offsideColumns:[]},i=[],a=/* @__PURE__ */ new Set,o=[],s={index:-1},l=[],u=e=>i[i.length-1].has(e),d=e=>({line:e.line,column:t&&e.kind===`String`?e.endColumn:e.column,range:void 0}),f=[],p=[],m=[],h=e=>{let t=r.index-1,i=e===t?m[e]:void 0;if(i)return i;let a=n[t];f[e]??=d(n[e]),p[t]??={line:a.line,column:a.endColumn};let o={module:l[l.length-1].name,start:f[e],end:p[t]};return e===t&&(m[e]=o),o},g=(e,t)=>(e.location.range=h(t),e),_=(e=0)=>n[Math.min(r.index+e,n.length-1)],v=(e=0)=>{let t=_(e),n=r.offsideColumns[r.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},y=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ee={index:0},b=e=>{let t=n.slice(ee.index,r.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},x=e=>t&&(e.kind===`Keyword`||bc.has(e.text)),te=e=>{let t=n.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},re=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:pc.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):x(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,S=(e,t=_(),r)=>{let i=n[n.length-1],a=t.line===i.line&&t.column===i.column;return new c(`${e} at line ${t.line}, column ${t.column}`,void 0,ie(e,t,a,r))},ie=(e,r,i,a)=>{if(t&&i){let e=n[n.length-1];return{reason:`Unexpected EOF`,...b(te(e)),isEnd:i}}return t&&a?{reason:`Unexpected ${re(a)}`,...te(a),isEnd:i}:{reason:e,line:r.line,column:r.column,isEnd:i}},ae=(e,t=_())=>S(e,t,t),oe=e=>(e.kind===`Identifier`||e.kind===`Keyword`)&&!x(e),C=(e,t=0)=>{let n=v(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},w=()=>{let e=v();if(e.kind===`End`)throw S(`Unexpected end of expression`);return r.index++,e},T=e=>C(e)?(r.index++,!0):!1,E=e=>{if(!C(e))throw ae(`Expected ${JSON.stringify(e)} but found ${y(v())}`);return w()},D=()=>{let e=v();if(e.kind!==`Identifier`)throw ae(`Expected an identifier but found ${y(e)}`);if(x(e))throw ae(`Unexpected keyword ${e.text}`);return r.index++,e.text},ce=e=>{r.offsideColumns.push(-1);let t=e();return r.offsideColumns.pop(),t},O=(e,t=`,`)=>{let n=[e()];for(;T(t);)n.push(e());return n},k=()=>{if(C(`<<`)){let e={value:1};for(;v(e.value).kind===`Identifier`||C(`,`,e.value);)e.value++;return C(`>>`,e.value)&&C(`\\in`,e.value+1)}let e={value:0};for(;v(e.value).kind===`Identifier`;){if(C(`\\in`,e.value+1))return!0;if(!C(`,`,e.value+1))return!1;e.value+=2}return!1},le=()=>{if(C(`::`))return!0;if(!C(`(`))return!1;let e={value:1};for(;v(e.value).kind===`Identifier`&&C(`,`,e.value+1);)e.value+=2;return v(e.value).kind===`Identifier`&&C(`)`,e.value+1)&&C(`::`,e.value+2)},ue=()=>{if(!T(`<<`))return{kind:`Name`,name:D()};let e=O(D);return E(`>>`),{kind:`Tuple`,names:e}},de=()=>O(()=>{let e=O(ue);E(`\\in`);let t=N();return e.map(e=>({pattern:e,set:t}))}).flat(),fe=()=>{let e=v();if(e.kind===`Identifier`){let t=r.index,n=[w().text];for(;C(`!`)&&v(1).kind===`Identifier`;)w(),n.push(D());return g({kind:`Identifier`,name:n.join(`!`),location:d(e)},t)}if(C(`<<`)||C(`(`))return Se();throw ae(`Expected a subscript but found ${y(e)}`)},A=e=>{let t=v(1),n=v(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&C(`==`,tc.has(n.text)?3:4))},pe=e=>{if(!rc.has(e.text))return!0;let t=v(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||C(`,`,1)||C(`)`,1)||t.kind===`Keyword`&&lc.has(t.text)||A(e)},j=()=>{let e=v(),n=e.kind===`Operator`&&(ec.has(e.text)||nc.has(e.text))&&pe(e);if(t&&e.kind!==`String`&&(nc.has(e.text)||ac.has(e.text)&&e.text!==`'`&&!tc.has(e.text)||ic.has(e.text)&&v(-1).text===`(`&&v(-1).line===e.line&&v(-1).endColumn+1===e.column&&v(1).text===`)`&&v(1).line===e.line&&v(1).column===e.endColumn+1)&&pe(e))throw S(`incomplete expression`,e);if(n)return r.index++,g({kind:`OperatorReference`,operator:e.text,location:d(e)},r.index-1);if(e.kind!==`String`&&ac.has(e.text)&&pe(e)){r.index++;let t=d(e);if(tc.has(e.text))return{kind:`OperatorReference`,operator:e.text,location:t};let n={kind:`Identifier`,name:`argument`,location:t};return{kind:`Lambda`,params:[n.name],body:sc(e.text,n,t),location:t}}if(C(`LAMBDA`)){let t=r.index;w();let n=O(D);E(`:`);let i=N();return g({kind:`Lambda`,params:n,body:i,location:d(e)},t)}return N()},M=()=>ce(()=>{E(`(`);let e=O(j);return E(`)`),e}),me=()=>{let e=w();r.offsideColumns.push(e.column);let t=[N()];for(;_().text===e.text&&_().column===e.column;)r.index++,t.push(N());return r.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:d(e)}},he=e=>ce(()=>{let t=d(e);if(v().kind===`Identifier`&&(C(`|->`,1)||C(`:`,1))){let e=C(`|->`,1)?`Record`:`RecordSet`,n=O(()=>{let t=D();return E(e===`Record`?`|->`:`:`),{name:t,value:N()}});return E(`]`),{kind:e,fields:n,location:t}}if(k()){let e=de();E(`|->`);let n=N();return E(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let n=N();if(T(`->`)){let e=N();return E(`]`),{kind:`FunctionSet`,domain:n,range:e,location:t}}if(T(`EXCEPT`)){let e=O(()=>{E(`!`);let e=[];for(;C(`.`)||C(`[`);)if(T(`.`)){if(!oe(v()))throw ae(`Expected a field name but found ${y(v())}`);e.push({kind:`Field`,name:w().text})}else E(`[`),e.push({kind:`Index`,args:O(()=>N())}),E(`]`);return E(`=`),{path:e,value:N()}});return E(`]`),{kind:`Except`,function:n,updates:e,location:t}}return E(`]_`),{kind:`BoxAction`,action:n,subscript:fe(),location:t}}),ge=e=>ce(()=>{let t=d(e);if(T(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(k()&&(v(1).text===`\\in`||C(`<<`))){let e=r.index,n=ue();E(`\\in`);let i=N();if(T(`:`)){let e=N();return E(`}`),{kind:`SetFilter`,bound:{pattern:n,set:i},predicate:e,location:t}}r.index=e}let n=N();if(T(`:`)){let e=de();return E(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let i=[n];for(;T(`,`);)i.push(N());return E(`}`),{kind:`SetEnumeration`,elements:i,location:t}}),_e=e=>{let t=d(e),n=ce(()=>C(`>>`)||C(`>>_`)?[]:O(()=>N()));if(T(`>>_`)){if(n.length!==1)throw S(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:fe(),location:t}}return E(`>>`),{kind:`Tuple`,elements:n,location:t}},ve=e=>{let t=d(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&k()){let e=de();return E(`:`),{kind:n,bounds:e,body:N(),location:t}}let i=O(D);return E(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i,body:N(),isTemporal:r,location:t}},ye=e=>{let t=[];do{if(T(`OTHER`))return E(`->`),{kind:`Case`,arms:t,other:N(),location:d(e)};let n=N();E(`->`),t.push({condition:n,body:N()})}while(T(`[]`));return{kind:`Case`,arms:t,other:void 0,location:d(e)}},be=()=>{let e=v(1);return C(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||cc.has(e.text)||e.kind===`Operator`&&(ec.has(e.text)||tc.has(e.text)||nc.has(e.text)))},xe=()=>{let e=w();if(e.kind===`Number`)return{kind:`Operand`,operand:ne(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return r.index--,{kind:`Bound`,args:M()}}return{kind:`Name`,name:e.text,args:C(`(`)?M():[]}},Se=()=>{let e=r.index===s.index,n=w(),a=d(n);if(t&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=O(D);return E(`:`),{kind:`Lambda`,params:e,body:N(),location:a}}if(n.kind===`Number`){if(t&&/^\\[BOH]/.test(n.text))throw S(`incomplete expression`,n);return{kind:`Number`,value:ne(n.text),text:n.text,location:a}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:a};if(n.kind===`String`)return{kind:`String`,value:n.text,location:a};let o=n.kind===`Step`&&Pe(n);if(o&&I()<0&&Me.length<=1)throw S(`Step number used outside proof`,n);if(o&&n.text[1]===`+`)throw S(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||o){let r=o?Fe(n)??n.text:n.text;if(le()){let e=T(`(`)?O(D):[];return e.length>0&&E(`)`),E(`::`),{kind:`Label`,name:r,params:e,body:N(),location:a}}let i=C(`(`),s=i?M():[];if(!be())return i?{kind:`Apply`,operator:r,args:s,location:a}:{kind:`Identifier`,name:r,location:a};let c=l.flatMap(e=>e.instances).find(e=>e.name===r);if(c&&!e&&!t&&c.params.length!==s.length)throw S(`The operator ${r} requires ${c.params.length} arguments`,n);let u=[{kind:`Name`,name:r,args:s}];for(;be();)w(),u.push(xe());let d=u.flatMap(e=>e.kind===`Name`?[e.name]:[]);if(d.length<u.length)return{kind:`Subexpression`,selectors:u,location:a};let f=d.join(`!`),p=u.flatMap(e=>`args`in e?e.args:[]);if(p.length===0)return{kind:`Identifier`,name:f,location:a};let m=u.map(e=>`args`in e?e.args.length:0);return m.slice(0,-1).some(e=>e>0)?{kind:`Apply`,operator:f,args:p,argumentCounts:m,location:a}:{kind:`Apply`,operator:f,args:p,location:a}}if(n.kind===`Operator`&&oc(n.text)&&C(`(`))return{kind:`Apply`,operator:n.text,args:M(),location:a};switch(n.text){case`(`:{let e=ce(()=>N());return E(`)`),e}case`[`:return he(n);case`{`:return ge(n);case`<<`:return _e(n);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return ve(n);case`IF`:{let e=N();E(`THEN`);let t=N();return E(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:N(),location:a}}case`CASE`:return ye(n);case`LET`:{let e=[],n=[];for(i.push(/* @__PURE__ */ new Set);!T(`IN`);){if(t&&C(`RECURSIVE`))throw S(`Unexpected keyword RECURSIVE`,b(_()));if(T(`RECURSIVE`)){Ae();continue}let r=Ee(!1);r.kind===`Instance`?n.push(r):e.push(r)}i.pop();let r=N();return n.length===0?{kind:`Let`,definitions:e,body:r,location:a}:{kind:`Let`,definitions:e,instances:n,body:r,location:a}}case`CHOOSE`:{let e=ue(),t=T(`\\in`)?N():void 0;return E(`:`),{kind:`Choose`,pattern:e,set:t,body:N(),location:a}}case`WF_`:case`SF_`:{let e=fe(),t=ce(()=>{E(`(`);let e=N();return E(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:a}}}throw ae(`Unexpected ${y(n)}`,n)},Ce=()=>{let e=v(),t=d(e);if(e.kind===`Operator`&&(e.text===`/\\`||e.text===`\\/`))return me();if(e.kind===`Operator`||e.kind===`Keyword`)switch(e.text){case`~`:return w(),{kind:`Apply`,operator:`~`,args:[N(5)],location:t};case`-`:return w(),{kind:`Apply`,operator:`-.`,args:[N(13)],location:t};case`[]`:return w(),{kind:`Always`,expression:N(16),location:t};case`<>`:return w(),{kind:`Eventually`,expression:N(16),location:t};case`ENABLED`:return w(),{kind:`Enabled`,expression:N(16),location:t};case`UNCHANGED`:return w(),{kind:`Unchanged`,expression:N(16),location:t};case`SUBSET`:case`UNION`:case`DOMAIN`:return w(),{kind:`Apply`,operator:e.text,args:[N(9)],location:t}}return Se()},N=(e=0)=>{let t=r.index,n=Ce(),i={left:n.location.range?n:g(n,t),previous:void 0};for(;;){let n=v();if(n.kind!==`Operator`)break;let r=d(n);if(n.text===`'`&&e<=15){w(),i.left=g({kind:`Prime`,expression:i.left,location:r},t);continue}if(tc.has(n.text)&&e<=15){w(),i.left=g({kind:`Apply`,operator:n.text,args:[i.left],location:r},t);continue}if(n.text===`[`){w();let e=ce(()=>O(()=>N()));ce(()=>E(`]`)),i.left=g({kind:`FunctionApplication`,function:i.left,args:e,location:r},t);continue}if(n.text===`.`&&oe(v(1))){w();let e=w().text;i.left=g({kind:`FieldAccess`,record:i.left,field:e,location:r},t);continue}let a=ec.get(n.text);if(!a||a.low<e)break;let o=i.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 S(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(w(),a.low>12&&C(`-`))throw S(`Precedence conflict between ${n.text} and -`,v());let s=N(a.high+1),c=i.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`;i.left=c.kind===e&&o?.text===n.text?{...c,operands:[...c.operands,s]}:{kind:e,operands:[c,s],location:r}}else i.left=n.text===`\\X`?c.kind===`Product`&&o?.text===`\\X`?{...c,factors:[...c.factors,s]}:{kind:`Product`,factors:[c,s],location:r}:{kind:`Apply`,operator:n.text,args:[c,s],location:r};i.left=g(i.left,t),i.previous={...a,text:n.text}}return i.left},we=()=>{if(!T(`(`))return[];let e=P();return E(`)`),e},Te=()=>{let e=d(v()),t=N(),i=n[r.index-1],a={line:i.line,column:i.endColumn};return{body:t,bodyRange:{module:l[l.length-1].name,start:e,end:a}}},Ee=e=>{let t=r.index;return g(De(e),t)},De=e=>{let t=v(),n=d(t),i=(t,r)=>({kind:`Operator`,name:t,params:r,...Te(),isLocal:e,isRecursive:u(t),location:n});if(t.kind===`Identifier`&&v(1).kind===`Operator`&&ec.has(v(1).text)&&v(2).kind===`Identifier`&&C(`==`,3)){let e=D(),t=w().text,n=D();return E(`==`),i(t,[{name:e,arity:0},{name:n,arity:0}])}let a=t.kind===`Operator`&&t.text===`-.`,o=t.kind===`Identifier`&&tc.has(v(1).text)&&C(`==`,2);if(a||o){let e=a?t.text:v(1).text;r.index+=a?1:2;let n=a?D():t.text;return E(`==`),i(e,[{name:n,arity:0}])}let s=D();if(T(`[`)){let t=ce(()=>de());return E(`]`),E(`==`),{kind:`Function`,name:s,bounds:t,body:N(),isLocal:e,isRecursive:u(s),location:n}}let c=r.index,l=we();return E(`==`),C(`INSTANCE`)?{...Oe(s,l,e,n),definitionRange:h(c)}:i(s,l)},Oe=(e,t,n,i)=>{let a=r.index;return E(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:D(),substitutions:T(`WITH`)?O(()=>{let e=w().text;return E(`<-`),{name:e,expression:j()}}):[],isLocal:n,location:i,instanceRange:h(a)}},ke=()=>{let e=d(v());if(C(`_`)&&v(1).kind===`Operator`)return w(),{name:w().text,arity:T(`_`)?2:1,location:e};if(v().kind===`Operator`&&C(`_`,1)){let t=w().text;return w(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=D();if(!T(`(`))return{name:t,arity:0,location:e};let n=O(()=>E(`_`));return E(`)`),{name:t,arity:n.length,location:e}},P=()=>O(ke),Ae=()=>{let e=P();return e.forEach(e=>i[i.length-1].add(e.name)),e},F=e=>{let t={value:0,offset:e};do{let e=v(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&vc.has(e.text)&&t.value++,e.kind===`Operator`&&yc.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},je=()=>{let e=v(),t=v(1);return e.kind===`Identifier`?C(`(`,1)||C(`[`,1)?C(`==`,F(1)):t.kind===`Operator`&&tc.has(t.text)?C(`==`,2):t.kind===`Operator`&&ec.has(t.text)?v(2).kind===`Identifier`&&C(`==`,3):C(`==`,1):C(`-.`)&&t.kind===`Identifier`&&C(`==`,2)},Me=[],I=()=>Me[Me.length-1]??-1,Ne=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),L=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)},Pe=e=>!e.text.endsWith(`.`)&&!mc.has(L(e)),Fe=e=>{let t=L(e);if(mc.has(t))return;let n=Ne(e);if(n>=0)return`<${n}>${t}`;let r=I(),i=Me[Me.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},Ie=e=>{if(e.kind===`Keyword`)return dc.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Me.length===0;if(e.text[1]===`+`||Me.length===0)return!0;let t=I();return t>=0&&Ne(e)>t},Le=e=>{let t=Ne(e),n=Me.length-1,r=Me[n-1]??-1,i=Me[n]<0;return i&&(Me[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Me[n]===t},Re=e=>!a.has(e)&&l.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),ze=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!bc.has(e.name)&&!Re(e.name):!1,Be=()=>{let e=v();return e.kind===`Step`?Pe(e):e.kind===`Keyword`?hc.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!je()},Ve=()=>{let e=r.index;s.index=e;let t=v();return t.kind===`Operator`&&!rc.has(t.text)&&oc(t.text)?(r.index++,g({kind:`OperatorReference`,operator:t.text,location:d(t)},e)):T(`MODULE`)?g({kind:`ModuleFact`,name:D(),location:d(t)},e):N()},He=e=>o[o.length-1]?.add(e),Ue=e=>{o.push(/* @__PURE__ */ new Set);let t=e();return o.pop(),t},We=e=>o.some(t=>t.has(e))||l.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),Ge=()=>{let e=r.index,t=v(),n=O(()=>{let e=v();if((e.kind!==`Identifier`||x(e))&&e.kind!==`Operator`)throw ae(`Expected a definition name but found ${y(e)}`,e);return r.index++,e.text},`!`),i=d(t);return g(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:i}:{kind:`Identifier`,name:n.join(`!`),location:i},e)},Ke=()=>{if(t)return O(Ge);let e=O(Ve),n=e.find(e=>e.kind===`Identifier`&&We(e.name));if(n)throw S(`DEF clause entry should describe a defined operator`,n.location);return e},qe=()=>({facts:Be()?O(Ve):[],defs:T(`DEF`)||T(`DEFS`)?Ke():[]}),Je=()=>{let e=r.index,n=w(),i=n.text===`USE`&&T(`ONLY`),a=h(e),o={kind:n.text===`USE`?`Use`:`Hide`,isOnly:i,...qe(),keyword:a,location:d(n)},s=o.kind===`Hide`&&!t?o.facts.find(e=>!ze(e)):void 0;if(s)throw S(`The only expression allowed as a fact in a HIDE is the name of a theorem, assumption, or step`,s.location);return g(o,e)},Ye=()=>{let e=r.index,t=d(v()),n=T(`NEW`),i=v().kind===`Keyword`?gc.get(v().text):void 0;if(!n&&i===void 0)throw ae(`Expected a declaration but found ${y(v())}`);if(i!==void 0&&w(),i===`Variable`){let n=D();return He(n),g({kind:`NewSymbol`,name:n,arity:0,level:i,set:void 0,location:t},e)}let a=ke();He(a.name);let o=(i??`Constant`)===`Constant`&&C(`\\in`);if(o&&a.arity>0)throw S(`declared symbol with arguments before \\in`);return o&&w(),g({kind:`NewSymbol`,name:a.name,arity:a.arity,level:i??`Constant`,set:o?N():void 0,location:t},e)},Xe=()=>{let e=r.index,t=d(E(`ASSUME`)),n=O(()=>C(`ASSUME`)?Ue(Xe):v().kind===`Keyword`&&_c.has(v().text)?Ye():N());return E(`PROVE`),g({kind:`AssumeProve`,assumptions:n,conclusion:N(),location:t},e)},Ze=e=>{let t={value:0};for(;v(t.value).kind===`Identifier`&&C(`,`,t.value+1);)t.value+=2;return v(t.value).kind===`Identifier`&&C(e,t.value+1)},Qe=(e,t)=>{e.forEach(He),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(He))},$e=()=>{let e=v();if(C(`USE`)||C(`HIDE`))return Je();if(C(`INSTANCE`))return g(Oe(void 0,[],!1,d(e)),r.index);if(C(`DEFINE`)||je()){let t=r.index;T(`DEFINE`);let n=[Ee(!1)];for(;je();)n.push(Ee(!1));let i={kind:`Define`,definitions:n,location:d(e)};return g(i,t)}if(T(`HAVE`))return{kind:`Have`,expression:N()};if(T(`TAKE`)){let e=k(),t=e?[]:O(D),n=e?de():[];return Qe(t,n),{kind:`Take`,names:t,bounds:n}}if(T(`WITNESS`))return{kind:`Witness`,expressions:O(()=>N())};if(T(`PICK`)){let e=Ze(`:`),t=e?O(D):[],n=e?[]:de();return Qe(t,n),E(`:`),{kind:`Pick`,names:t,bounds:n,body:N()}}return T(`CASE`)?{kind:`Case`,expression:N()}:{kind:`Assert`,isSuffices:T(`SUFFICES`),statement:C(`ASSUME`)?Xe():N()}},et=e=>{let t=v();if(t.kind!==`Step`)throw ae(`Expected a step number but found ${y(t)}`,t);if(!Le(t))throw S(`${e?`QED step`:`step`}'s number has bad level`,t);if(Ne(t)<0&&Fe(t)!==void 0)throw S(`<*> and <+> cannot be used for a named step`,t);return r.index++,{name:Fe(t),token:t.text,location:d(t)}},tt=()=>{let e=r.index,t=et(C(`QED`,1)),n=/* @__PURE__ */ new Set;o.push(n);let i=T(`QED`)?{kind:`Qed`}:$e(),a=h(e),s=Ie(v());if(s&&!fc.has(i.kind))throw S(`Proof of a step that does not take a proof`);let c=s?rt():void 0;return o.pop(),(i.kind!==`Assert`||i.isSuffices)&&n.forEach(He),g({...t,body:i,head:a,proof:c},e)},nt=()=>{let e=d(v());if(C(`BY`)||C(`PROOF`)&&C(`BY`,1)){T(`PROOF`),w();let t=h(r.index-1);return{kind:`By`,isOnly:T(`ONLY`),...qe(),keyword:t,location:e}}let t=v(+!!C(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){T(`PROOF`),w();let n=h(r.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}T(`PROOF`);let n=[tt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(tt());return{kind:`Steps`,level:I(),steps:n,location:e}},rt=()=>{let e=r.index;Me.push(-1);let t=Ue(nt);return Me.pop(),g(t,e)},it=e=>{let t=r.index,n=w(),i=v().kind===`Identifier`&&C(`==`,1)?D():void 0;i!==void 0&&(a.add(i),w());let o=Ue(()=>({statement:C(`ASSUME`)?Xe():N(),proof:Ie(v())?rt():void 0})),s=o.statement,c=g({name:i,statement:s,proof:o.proof,location:d(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),i!==void 0&&s.kind!==`AssumeProve`&&e.definitions.push(g({kind:`Operator`,name:i,params:[],body:s,isLocal:!1,isRecursive:!1,location:d(n)},t))},at=()=>{let e=r.index;return g(ot(),e)},ot=()=>{let e=w(),t=d(e),n=e.text===`AXIOM`;if(v().kind===`Identifier`&&C(`==`,1)){let e=D();return a.add(e),w(),{name:e,expression:N(),isAxiom:n,location:t}}return{name:void 0,expression:N(),isAxiom:n,location:t}},st=()=>{let e=d(E(`----`));E(`MODULE`);let t=D();E(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(l.push(n),i.push(/* @__PURE__ */ new Set),T(`EXTENDS`)&&O(()=>{let e=r.index;n.extends.push(D()),n.extendsRanges.push(h(e))});;){let a=r.index;ee.index=a;let o=v();if(o.kind===`ModuleEnd`||o.kind===`End`)return o.kind===`ModuleEnd`&&(e.range={module:t,start:{line:e.line,column:e.column},end:{line:o.line,column:o.endColumn}}),l.pop(),i.pop(),n;if(o.kind===`Separator`){if(C(`MODULE`,1)){let e=st();n.modules.push(e),n.units.push({kind:`Module`,module:e}),E(`====`);continue}w()}else{switch(o.text){case`CONSTANT`:case`CONSTANTS`:{w();let e=P();n.constants.push(...e),n.units.push({kind:`Constants`,declarations:e});continue}case`VARIABLE`:case`VARIABLES`:{w();let e=O(()=>{let e=r.index,t=d(v());return g({name:D(),arity:0,location:t},e)});n.variables.push(...e),n.units.push({kind:`Variables`,declarations:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=at();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&n.definitions.push({kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{let e=Je();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:w(),n.units.push({kind:`Recursive`,declarations:Ae()});continue;case`INSTANCE`:ct(n,g(Oe(void 0,[],!1,d(o)),a));continue;case`LOCAL`:if(w(),C(`INSTANCE`)){ct(n,g(Oe(void 0,[],!0,d(o)),a));continue}ct(n,Ee(!0));continue}o.kind===`Keyword`&&uc.has(o.text)?it(n):ct(n,Ee(!1))}}},ct=(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}))};return st()},wc=e=>Cc(e,!1),Tc=e=>Cc(e,!0),Ec=25214903917n,Dc=(1n<<48n)-1n,Oc=2147483647,kc=e=>{let t={value:(BigInt.asUintN(64,e)^Ec)&Dc},n=e=>(t.value=t.value*Ec+11n&Dc,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Ec)&Dc},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<=Oc)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Ac=10454148508367108822n,jc=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Ac);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Mc=Int32Array.from(jc,e=>Number(BigInt.asIntN(32,e>>32n))),Nc=Int32Array.from(jc,e=>Number(BigInt.asIntN(32,e))),Pc=Number(BigInt.asIntN(32,Ac>>32n)),Fc=Number(BigInt.asIntN(32,Ac));let Ic=Pc,Lc=Fc;const Rc=e=>{let t=(e^Lc)&255;Lc=(Lc>>>8|Ic<<24)^Nc[t],Ic=Ic>>>8^Mc[t]},zc=e=>{for(let t=0;t<32;t+=8)Rc(e>>>t)},Bc=e=>{if(typeof e==`boolean`)Rc(0),Rc(e?116:102);else if(typeof e==`number`)Rc(1),zc(e);else if(typeof e==`string`){Rc(3),zc(e.length);for(let t=0;t<e.length;t++)Rc(e.charCodeAt(t))}else if(M(e))Rc(21),zc(P(e.name)+1);else if(j(e)){let t=H(e);Rc(9),zc(t.domain.length);for(let e=0;e<t.domain.length;e++)Bc(t.domain[e]),Bc(t.range[e])}else{let t=B(e).elements;Rc(5),zc(t.length);for(let e of t)Bc(e)}},Vc=e=>{let t={high:Ic,low:Lc};Ic=Pc,Lc=Fc;for(let t of e)Bc(t);let n=BigInt(Ic>>>0)<<32n|BigInt(Lc>>>0);return Ic=t.high,Lc=t.low,n},Hc=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||M(e))return 5;if(typeof e==`string`)return 5+e.length;if(j(e)){let t=H(e);return t.domain.reduce((e,n,r)=>e+Hc(n)+Hc(t.range[r]),5)}return B(e).elements.reduce((e,t)=>e+Hc(t),5)},Uc=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){Ic=n<32?0:1<<n-32,Lc=n<32?1<<n:0;for(let t=0;t<e;t++)Rc(0);let r=n>>3,i=1<<(n&7);for(let e=i;e<2*i;e++){let n=(r*256+e)*2,a=(r*256+e-i)*2;t[n]=t[a]^Ic,t[n+1]=t[a+1]^Lc}}return t},Wc=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=[],a=e=>{let t=r.get(e);if(t!==void 0)return t;let n=Hc(e);return Ic=0,Lc=0,Bc(e),r.set(e,i.length),i.push(n,Ic,Lc),i.length-3},o=e=>{let t=n.get(e);if(t)return t;let r=Uc(e);return n.set(e,r),r};return(n,r)=>{let s={high:Ic,low:Lc},c={high:Pc,low:Fc};for(let t of e){let e=a(n[t]),r=o(i[e]),s={high:i[e+1],low:i[e+2]};for(let e=0;e<8;e++){let t=e<4?c.low:c.high,n=(e*256+(t>>>(e&3)*8&255))*2;s.high^=r[n],s.low^=r[n+1]}c.high=s.high,c.low=s.low}Ic=s.high,Lc=s.low,t[2*r]=c.low,t[2*r+1]=c.high}},Gc=[],Kc=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},qc=()=>{for(let e=1277011;Gc.length<1341;e++)Kc(e)&&Gc.push(e);return Gc},Jc=e=>{let t=qc(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},Yc=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},Xc=e=>{for(let t=Math.max(e,9);;t++){let e=Yc(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)}}},Zc=(e,t,n)=>{if(t<=0)return[];let r=Xc(t),i={index:BigInt(n.nextInt(t))},a=BigInt(Jc(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},Qc=(1n<<63n)-1n-24n,$c=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Qc*BigInt(n)+i)%t;return r<0n?r+t:r})},el=(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,tl=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Dt(e.domain),n=B(e.range).elements;return{lists:t.map(()=>n),create:e=>Le(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>B(e).elements),create:t=>kt(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>B(e).elements),create:R}}},nl=(e,t,n)=>{if(V(t))return[];if(typeof t==`object`&&t.kind===`Interval`)return Zc(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let r=tl(t);if(r){let t=r.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Oc)?$c(e,t,n):Zc(e,Number(t),n)).map(e=>r.create(el(r.lists,e)))}let i=B(t).elements;return Zc(e,i.length,n).map(e=>i[Number(e)])},rl=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new u(`RandomElement of the empty set`);return n},il=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...Dt(e.domain)];return Le(n,n.map(()=>il(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return kt(e.names.map((n,r)=>[n,il(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return R(e.factors.map(e=>il(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 u(`RandomElement of the empty set`);return e.low+r}return rl(B(e).elements,t)},al=(e,t=0n)=>{let n=kc(t),r={random:kc(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>kt([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Vc,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.state&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.state=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},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},ol=e=>yt([...e.possibleCounts].map(([e,t])=>[e,t])),sl=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,ol(e)]]),cl=(e,t,n)=>new d(`Applying ${e} to the following value,\nwhich is not ${t}:\n${U(n)}`),ll=(e,t,n,r)=>new d(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${U(r)}`),ul=e=>j(e)?H(e):void 0,dl=(e,t,n)=>{let r=G(e,t,n),i=ul(r);if(!i)throw cl(n,`a function with a finite domain`,r);return i},fl=(e,t,n)=>{let r=G(e,t,n),i=ul(r);if(!i)throw ll(t===0?`first`:`second`,n,`bag`,r);return i},pl=(e,t)=>{if(!A(e)||!z(e))throw t();return B(e).elements},ml=e=>e.range.every(e=>typeof e==`number`&&e>0),hl=(e,t)=>{let n=e.domain.findIndex(e=>Re(e,t));return n===-1?void 0:e.range[n]},gl=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,_l=gl(`BagDiff`,`tlc2.value.impl.Value`,2),vl=gl(`SqSubseteq`,`tlc2.value.IBoolValue`,2),yl=gl(`BagUnion`,`tlc2.value.impl.Value`,1),bl=gl(`BagOfAll`,`tlc2.value.impl.Value`,2),xl=gl(`BagCup`,`tlc2.value.impl.Value`,2),Sl=gl(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Cl=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${dr(e)}`;throw pr(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')`)},wl=(e,t,n)=>{let r=Cl(e,n)+Cl(t,n);if(or(r))throw sr(`${e}+${t}`);return r},Tl=(e,t,n,r)=>{let i=hl(n,e.domain[t]),a=Cl(e.range[t],r);return i===void 0?a:a-Cl(i,r)|0},El=(e,t)=>yt(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>Re(e[0],r));a?a[1]=wl(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),Dl=Le([],[]),Ol=[nr(`EmptyBag`,Dl),K(`IsABag`,1,e=>{let t=ul(G(e,0,`IsABag`));return t!==void 0&&ml(t)}),K(`BagCardinality`,1,e=>{let t=G(e,0,`BagCardinality`);return dl(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw cl(`BagCardinality`,`a bag`,t);return wl(e,n,Sl)},0)}),K(`BagIn`,2,e=>{let t=G(e,1,`BagIn`),n=hl(dl(e,1,`BagIn`),G(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw ll(`second`,`BagIn`,`bag`,t);return n>0}),K(`CopiesIn`,2,e=>{let t=G(e,1,`CopiesIn`),n=hl(dl(e,1,`CopiesIn`),G(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw ll(`second`,`CopiesIn`,`bag`,t);return n}),K(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=fl(e,t,`(+)`);if(!ml(n))throw ll(t===0?`first`:`second`,`(+)`,`bag`,G(e,t,`(+)`));return n});return El(t,xl)}),K(`\\ominus`,2,e=>{let t=fl(e,0,`(-)`),n=fl(e,1,`(-)`);return yt(t.domain.flatMap((e,r)=>{let i=Tl(t,r,n,_l);return i>0?[[e,i]]:[]}))}),K(`BagUnion`,1,e=>{let t=G(e,0,`BagUnion`),n=pl(t,()=>cl(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??Dl;let r=n.map(e=>{let n=ul(e);if(!n)throw new d(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${U(t)}`);return n});return El(r,yl)}),K(`\\sqsubseteq`,2,e=>{let t=dl(e,0,`\\sqsubseteq`),n=dl(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Tl(t,r,n,vl)<=0)}),rr(`BagOfAll`,2,e=>{let t=tr(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new d(`The first argument of BagOfAll should be an operator, but instead it is:\n${U(t.literalBody)}`);let n=G(e,1,`BagOfAll`),r=ul(n);if(!r)throw ll(`second`,`BagOfAll`,`function with a finite domain`,n);return El(r.domain.map((e,n)=>Le([t.call([e])],[r.range[n]])),bl)}),K(`SubBag`,1,e=>{let t=G(e,0,`SubBag`);if(!j(t))throw new u(`DOMAIN expects a function but received ${U(t)}`);let n=H(t),r=pt(n.range).elements,i=r.find(e=>typeof e!=`number`);if(i!==void 0){let e=typeof r[0]!=`number`;throw new u(`The ${e?`first`:`second`} argument of >= should be an integer, but instead it is:\n${U(e?r[0]:i)}`)}let a=n.range.filter(e=>typeof e==`number`);if(a.some(e=>e<1))throw new u(`Attempted to apply a function to ${U(n)}, which is not in its domain`);return pt(n.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:a[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Le(e.map(e=>e[0]),e.map(e=>e[1]))))}),K(`BagToSet`,1,e=>mn(dl(e,0,`BagToSet`))),K(`SetToBag`,1,e=>{let t=G(e,0,`SetToBag`),n=pl(t,()=>cl(`BagToSet`,`a function with a finite domain`,t));return Le([...n],n.map(()=>1))})],kl=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Al=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,jl=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Ml=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Nl=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Pl=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Fl=e=>{if(!j(e))return!1;let t=H(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},Il=(e,t)=>pr(e,`Cannot convert value: unsupported value type tlc2.value.impl.${dr(t)}`),Ll=(e,t)=>pr(e,`Cannot cast tlc2.value.impl.${dr(t)} to tlc2.value.impl.StringValue`),Rl=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),zl=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw Il(t,e);return`[${B(e).elements.map(e=>Vl(e,t)).join(`,`)}]`},Bl=(e,t)=>{let n=H(e),r=Xt(n);return r?`[${r.map(e=>Vl(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Rl(typeof e==`string`?e:U(e))}:${Vl(n.range[r],t)}`).join(`,`)}}`},Vl=(e,t)=>typeof e==`string`?Rl(e):typeof e==`object`?e.kind===`ModelValue`?Rl(e.name):A(e)?zl(e,t):Bl(e,t):String(e),Hl=e=>{if(A(e))return zl(e,kl);if(!j(e)||Fl(e))throw Il(kl,e);return Bl(e,kl)},Ul=e=>{if(!j(e))throw Il(Al,e);return Bl(e,Al)},Wl=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))},Gl=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Oe(e);if(Array.isArray(e))return R(e.map(e=>Gl(e,t)));if(typeof e==`object`&&e)return kt(Object.entries(e).map(([e,n])=>[Oe(e),Gl(n,t)]));throw pr(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Kl=(e,t)=>{if(e.trim()===``)return Gl(null,t);try{return Gl(JSON.parse(e,(e,t,n)=>typeof t==`number`?Wl(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?pr(t,e.message):e}},ql=(e,t)=>{if(typeof e!=`string`)throw Ll(t,e);return e},Jl=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw pr(n,`${t} (No such file or directory)`);return r},Yl=e=>[ir(`ToJson`,1,e=>Oe(Vl(G(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),ir(`ToJsonArray`,1,e=>Oe(Hl(G(e,0,`ToJsonArray`)))),ir(`ToJsonObject`,1,e=>Oe(Ul(G(e,0,`ToJsonObject`)))),ir(`JsonSerialize`,2,t=>{let n=ql(G(t,0,`JsonSerialize`),jl),r=G(t,1,`JsonSerialize`);if(!Xt(r)&&!Fl(r))throw new d(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${U(r)}`);return e.writeFile?.(n,Vl(r,jl)),!0}),ir(`ndJsonSerialize`,2,t=>{let n=ql(G(t,0,`ndJsonSerialize`),Ml),r=G(t,1,`ndJsonSerialize`),i=Xt(r);if(!i)throw new d(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${U(r)}`);return e.writeFile?.(n,i.map(e=>`${Vl(e,Ml)}\n`).join(``)),!0}),ir(`JsonDeserialize`,1,t=>{let n=ql(G(t,0,`JsonDeserialize`),Nl);return Kl(Jl(e,n,Nl),Nl)}),ir(`ndJsonDeserialize`,1,t=>{let n=ql(G(t,0,`ndJsonDeserialize`),Pl);return R(Jl(e,n,Pl).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Kl(e,Pl)))})],Xl=(e,t,n,r)=>new d(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),Zl=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Xl(t,n,`nonnegative integer`,U(e));return e},Ql=(e,t,n,r)=>{if(!A(e)||!z(e))throw Xl(t,n,r,U(e));return B(e).elements},$l=(e,t,n,r)=>pt(Array.from({length:t},()=>pt(e.filter(()=>r.nextDouble()<n)))),eu=(e,t)=>{let n=`RandomSetOfSubsets`,r=Zl(G(e,0,n),`first`,n),i=Zl(G(e,1,n),`second`,n),a=Ql(G(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw Xl(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw Xl(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return $l(a,r,a.length===0?0:i/a.length,t.getRandom())},tu=e=>[ir(`RandomSubset`,2,t=>{let n=G(t,0,`RandomSubset`);if(typeof n!=`number`)throw Xl(`first`,`RandomSubset`,`nonnegative integer`,U(n));if(n<0)throw new u(`Attempted to apply the operator overridden by the Java method\npublic static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value),\nbut it produced the following error:\n${n}`);let r=G(t,1,`RandomSubset`);if(!A(r)||!V(r)&&!z(r))throw Xl(`second`,`RandomSubset`,`a finite set`,U(r));return pt(nl(n,r,e.getRandom()))}),ir(`RandomSetOfSubsets`,3,t=>eu(t,e)),ir(`TestRandomSetOfSubsets`,3,t=>R(Array.from({length:5},()=>B(eu(t,e)).elements.length)))],nu=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,ru=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${nu})`,iu=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${nu}) throws java.io.IOException`,au=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${nu})`,ou=()=>kt([[`action`,pt([])],[`state`,pt([])]]),su=()=>kt([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),cu=e=>kt([[`name`,e??`UnnamedAction`],[`location`,su()]]),lu=(e,t)=>{let n=e.map((e,t)=>R([t+1,kt(Object.entries(e.state))])),r=n.slice(1).map((t,r)=>R([n[r],cu(e[r+1].action),t])),i=t?[R([n[n.length-1],cu(t.action),n[t.start]])]:[];return kt([[`action`,pt([...r,...i])],[`state`,pt(n)]])},uu=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return sl(e).get(t)},du=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),U(r));else throw new d(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${U(n)}`)},fu=e=>e.every(e=>e!==void 0),pu=(e,t)=>kt(t.variables.map((t,n)=>[t,e[n]])),mu=(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&&!W(e)){if(t.variableIndex.has(r))return!0;let e=co(r,t);if(e&&!n.has(e)&&(n.add(e),mu(e.body,t,n)))return!0}return Un(e).some(e=>mu(e,t,n))},hu=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[K(`AssertEq`,2,t=>{let n=G(t,0,`AssertEq`),r=G(t,1,`AssertEq`),i=Re(n,r);return i||(e(U(`Assertion failed`,!0)),e(U(n,!0)),e(U(r,!0))),i}),br(`AssertError`,2,e=>{let t=tr(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw pr(ru,`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=xr(e,0,`AssertError`)();try{xr(e,1,`AssertError`)()}catch(e){if(e instanceof u)return e.message===n;throw e}return!1}),ir(`TLCGetOrDefault`,2,e=>{let n=G(e,0,`TLCGetOrDefault`);return uu(t,n)??G(e,1,`TLCGetOrDefault`)}),{...rr(`TLCGetAndSet`,4,n=>{let r=G(n,0,`TLCGetAndSet`),i=uu(t,r)??G(n,3,`TLCGetAndSet`),a=tr(n,1,`TLCGetAndSet`);return du(t,e,r,a.call([i,G(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},ir(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!fu(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw pr(iu,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return R(t.getBehavior(r).map(e=>pu(e,n.environment)))}),ir(`CounterExample`,0,()=>t.counterExample??ou()),K(`ToTrace`,1,e=>{let t=G(e,0,`ToTrace`);if(!j(t)||!Re(mn(t),pt([`action`,`state`])))throw new u(`The argument of ToTrace should be a CounterExample, but instead it is:\n${U(t)}`);let n=B(fn(t,`state`)).elements.map(e=>Xt(e)??[]);return R(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),K(`TLCModelValue`,1,e=>{let t=G(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new d(`The argument of ModelValue should be a string, but instead it is:\n${U(t)}`);return Fe(t)}),br(`TLCDefer`,1,()=>!0),K(`TLCNoOp`,1,e=>G(e,0,`TLCNoOp`)),br(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!fu(r))throw pr(au,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||so(xr(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new h(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),br(`TLCCache`,2,(e,t)=>{let r=tr(e,0,`TLCCache`),a=Mn(xr(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=mu(o,t.environment,/* @__PURE__ */ new Set)&&t.state?i(t.state):n,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(a);if(l!==void 0)return l;let u=r.call([]);return c.set(a,u),u}),K(`TLCFP`,1,e=>Number(BigInt.asIntN(32,Vc([G(e,0,`TLCFP`)])))),ir(`TLCEvalDefinition`,1,(e,t)=>{let n=G(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?co(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new d(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${U(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new d(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return X({kind:`Identifier`,name:n,location:r.location},t)})]},gu=(e,t)=>[ir(`_Track`,2,e=>{let n=String(G(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,G(e,0,`_Track`)===!0?r+1:r),!0}),ir(`_Counts`,0,()=>ol(t)),ir(`_CheckName`,1,n=>{let r=String(G(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(U(ol(t),!0)),!1)}),ir(`_PrintCounts`,0,()=>(e(U(ol(t),!0)),!0))],_u=e=>String(e).padStart(2,`0`),vu=e=>`${e.getUTCFullYear()}.${_u(e.getUTCMonth()+1)}.${_u(e.getUTCDate())}.${_u(e.getUTCHours())}${_u(e.getUTCMinutes())}${_u(e.getUTCSeconds())}`,yu=e=>yt([...e].map(([e,t])=>[e,R([t])])),bu=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),xu=(e,t,n)=>{if(!e.isStarted&&bu.has(t))throw new u(`TLCGet(${t}) was undefined.`);let r=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return r;case`stats`:return kt([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return kt([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return kt([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Oe(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Oe(vu(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return cu(void 0);case`all`:return yu(e.registers);case`all:named`:return yu(sl(e))}if(t.startsWith(`s:`)){let n=sl(e).get(t);if(n===void 0)throw new u(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Oe(e.properties.get(t.slice(2))??t);throw new u(`TLCGet(${t}) was undefined.`)},Su=e=>e.length===0?[[]]:e.flatMap((t,n)=>Su([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Cu=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&B(e).elements.forEach(Cu),e.kind===`Function`&&e.range.forEach(Cu))},wu=(t,n)=>[K(`Print`,2,e=>(t(`${fe(U(G(e,0,`Print`),!0,!0))} ${fe(U(G(e,1,`Print`),!0,!0))}`),G(e,1,`Print`))),K(`PrintT`,1,e=>(t(fe(U(G(e,0,`PrintT`),!0,!0))),!0)),K(`Assert`,2,t=>{if(G(t,0,`Assert`)!==!0)throw new d(`The first argument of Assert evaluated to FALSE; the second argument was:\n${fe(U(G(t,1,`Assert`)))}`,e.assertViolation);return!0}),K(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),K(`:>`,2,e=>yt([[G(e,0,`:>`),G(e,1,`:>`)]])),K(`@@`,2,e=>{let t=er(e,0,`@@`),n=er(e,1,`@@`);return bt([...ve(t),...ve(n)])}),K(`ToString`,1,e=>Oe(U(G(e,0,`ToString`),!0))),K(`TLCEval`,1,e=>{let t=G(e,0,`TLCEval`);return Cu(t),t}),K(`Permutations`,1,e=>{let t=Qn(e,0,`Permutations`);return pt(Su(t).map(e=>yt(t.map((t,n)=>[t,e[n]]))))}),rr(`SortSeq`,2,e=>{let t=tr(e,1,`SortSeq`);return R($n(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)]},[]))}),ir(`TLCGet`,1,(e,t)=>{let r=G(e,0,`TLCGet`);if(typeof r==`number`&&r>=0){let e=n.registers.get(r);if(e===void 0)throw new u(`TLCGet(${r}) was undefined.`);return e}if(typeof r!=`string`)throw new u(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${U(r)}`);return xu(n,r,t?.state)}),ir(`TLCSet`,2,e=>{let r=G(e,0,`TLCSet`);return du(n,t,r,G(e,1,`TLCSet`)),!0}),nr(`Any`,I),K(`RandomElement`,1,e=>il(Xn(e,0,`RandomElement`),n.getRandom()))],Tu=/* @__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(`,`),Eu=[[`\\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`,`≀`],[`^+`,`⁺`]],Du=/* @__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(`,`),Ou=/* @__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(`.`),ku=/* @__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(`.`),Au=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
95
|
+
=============================================================================`]]),Js=`tlc2/value/impl/`,Ys=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)}},Xs=e=>[...e.slice(1,e.indexOf(`)`)).matchAll(/\[*(?:L[^;]*;|[BCDFIJSZ])/g)].length,Zs=e=>{let t=Ys(e);if(t.readUint32()!==3405691582)throw new u(`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===1?a.text=i.decode(t.readBytes(t.readUint16())):r===3?a.value=t.readInt32():r===4?t.readUint32():r===5||r===6?(t.readBytes(8),e++):r===7||r===8||r===16||r===19||r===20?a.first=t.readUint16():r===15?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16(),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 a=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,o={name:r,arity:Xs(i),code:void 0};for(let e=t.readUint16();e>0;e--){let e=n[t.readUint16()].text,r=t.readBytes(t.readUint32());if(e===`Code`){let e=new DataView(r.buffer,r.byteOffset+4,4).getUint32(0);o.code=r.subarray(8,8+e)}}e&1&&e&8&&a.push(o)}return{pool:n,methods:a}},Qs=(e,t)=>e[e[t].first].text,$s=(e,t)=>{let n=e[t],r=e[n.second];return{className:Qs(e,n.first),name:e[r.first].text}},ec=(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===3)return n.value;if(n.tag===8)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>=2&&n<=8)o.push(n-3),e+=1;else if(n===16)o.push(a[e+1]<<24>>24),e+=2;else if(n===17)o.push(l()<<16>>16),e+=3;else if(n===18)o.push(c(a[e+1])),e+=2;else if(n===19)o.push(c(l())),e+=3;else if(n===89){let t=s();o.push(t,t),e+=1}else if(n===178){let n=$s(t,l());if(n.className!==`${Js}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===184){let n=$s(t,l()),a=s();if(n.className!==`${Js}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===187)o.push({className:Qs(t,l()),value:void 0}),e+=3;else if(n===183){let n=$s(t,l()),a=s(),o=s();if(!(n.className===`${Js}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===176){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()},tc=(e,t)=>{if(!t)return e;let n=Zs(t),r=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let r=n.methods.find(e=>e.name===t.name&&e.arity===t.params.length);return r?{...t,body:ec(r,n.pool,e.name,t.location)}:t});return{...e,definitions:r}},Z=(e,t,n)=>({low:e,high:t,isAssociative:n}),nc=new Map([[`=>`,Z(1,1,!1)],[`<=>`,Z(2,2,!1)],[`~>`,Z(2,2,!1)],[`-+->`,Z(2,2,!1)],[`/\\`,Z(3,3,!0)],[`\\/`,Z(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,Z(5,5,!1)]),[`\\cdot`,Z(5,14,!0)],[`@@`,Z(6,6,!0)],[`:>`,Z(7,7,!1)],[`<:`,Z(7,7,!1)],[`\\cup`,Z(8,8,!0)],[`\\cap`,Z(8,8,!0)],[`\\`,Z(8,8,!1)],[`..`,Z(9,9,!1)],[`...`,Z(9,9,!1)],[`##`,Z(9,13,!0)],[`$`,Z(9,13,!0)],[`$$`,Z(9,13,!0)],[`??`,Z(9,13,!0)],[`!!`,Z(9,13,!1)],[`\\sqcap`,Z(9,13,!0)],[`\\sqcup`,Z(9,13,!0)],[`\\uplus`,Z(9,13,!0)],[`\\wr`,Z(9,14,!1)],[`+`,Z(10,10,!0)],[`++`,Z(10,10,!0)],[`(+)`,Z(10,10,!0)],[`\\oplus`,Z(10,10,!0)],[`%`,Z(10,11,!1)],[`%%`,Z(10,11,!0)],[`|`,Z(10,11,!0)],[`||`,Z(10,11,!0)],[`\\X`,Z(10,13,!1)],[`-`,Z(11,11,!0)],[`--`,Z(11,11,!0)],[`(-)`,Z(11,11,!0)],[`\\ominus`,Z(11,11,!0)],[`*`,Z(13,13,!0)],[`**`,Z(13,13,!0)],[`/`,Z(13,13,!1)],[`//`,Z(13,13,!1)],[`\\div`,Z(13,13,!1)],[`\\o`,Z(13,13,!0)],[`(.)`,Z(13,13,!0)],[`\\odot`,Z(13,13,!0)],[`(/)`,Z(13,13,!1)],[`\\oslash`,Z(13,13,!1)],[`(\\X)`,Z(13,13,!0)],[`\\otimes`,Z(13,13,!0)],[`&`,Z(13,13,!0)],[`&&`,Z(13,13,!0)],[`\\star`,Z(13,13,!0)],[`\\bullet`,Z(13,13,!0)],[`\\bigcirc`,Z(13,13,!0)],[`^`,Z(14,14,!1)],[`^^`,Z(14,14,!1)]]),rc=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),ic=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),ac=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),oc=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),sc=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...rc]),cc=e=>nc.has(e)||rc.has(e)||e===`-.`,lc=(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}}},uc=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),dc=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),fc=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),pc=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),mc=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),hc=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),gc=/* @__PURE__ */ new Set([``,`*`,`-`]),_c=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),vc=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),yc=/* @__PURE__ */ new Set([`NEW`,...vc.keys()]),bc=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),xc=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Sc=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Cc=e=>RegExp(`^-{4,}\\s*MODULE\\s+${e}\\s*-{3,}$`),wc=(e,t)=>{let n=e.split(/\r?\n/),r=n.findIndex(e=>Cc(t).test(e));if(r===-1)return;let i=n.findIndex((e,t)=>t>r&&e.startsWith(`====`));return n.slice(r,i===-1?void 0:i+1).join(`
|
|
96
|
+
`)},Tc=(e,t)=>{let n=ae(e),r={index:0,offsideColumns:[]},i=[],a=/* @__PURE__ */ new Set,o=[],s={index:-1},c=[],l=e=>i[i.length-1].has(e),d=e=>({line:e.line,column:t&&e.kind===`String`?e.endColumn:e.column,range:void 0}),f=[],p=[],m=[],h=e=>{let t=r.index-1,i=e===t?m[e]:void 0;if(i)return i;let a=n[t];f[e]??=d(n[e]),p[t]??={line:a.line,column:a.endColumn};let o={module:c[c.length-1].name,start:f[e],end:p[t]};return e===t&&(m[e]=o),o},g=(e,t)=>(e.location.range=h(t),e),_=(e=0)=>n[Math.min(r.index+e,n.length-1)],v=(e=0)=>{let t=_(e),n=r.offsideColumns[r.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},y=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),b={index:0},x=e=>{let t=n.slice(b.index,r.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},S=e=>t&&(e.kind===`Keyword`||Sc.has(e.text)),ee=e=>{let t=n.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},te=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:hc.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):S(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,C=(e,t=_(),r)=>{let i=n[n.length-1],a=t.line===i.line&&t.column===i.column;return new u(`${e} at line ${t.line}, column ${t.column}`,void 0,ne(e,t,a,r))},ne=(e,r,i,a)=>{if(t&&i){let e=n[n.length-1];return{reason:`Unexpected EOF`,...x(ee(e)),isEnd:i}}return t&&a?{reason:`Unexpected ${te(a)}`,...ee(a),isEnd:i}:{reason:e,line:r.line,column:r.column,isEnd:i}},re=(e,t=_())=>C(e,t,t),ie=e=>(e.kind===`Identifier`||e.kind===`Keyword`)&&!S(e),T=(e,t=0)=>{let n=v(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},E=()=>{let e=v();if(e.kind===`End`)throw C(`Unexpected end of expression`);return r.index++,e},D=e=>T(e)?(r.index++,!0):!1,O=e=>{if(!T(e))throw re(`Expected ${JSON.stringify(e)} but found ${y(v())}`);return E()},k=()=>{let e=v();if(e.kind!==`Identifier`)throw re(`Expected an identifier but found ${y(e)}`);if(S(e))throw re(`Unexpected keyword ${e.text}`);return r.index++,e.text},oe=e=>{r.offsideColumns.push(-1);let t=e();return r.offsideColumns.pop(),t},A=(e,t=`,`)=>{let n=[e()];for(;D(t);)n.push(e());return n},se=()=>{if(T(`<<`)){let e={value:1};for(;v(e.value).kind===`Identifier`||T(`,`,e.value);)e.value++;return T(`>>`,e.value)&&T(`\\in`,e.value+1)}let e={value:0};for(;v(e.value).kind===`Identifier`;){if(T(`\\in`,e.value+1))return!0;if(!T(`,`,e.value+1))return!1;e.value+=2}return!1},ce=()=>{if(T(`::`))return!0;if(!T(`(`))return!1;let e={value:1};for(;v(e.value).kind===`Identifier`&&T(`,`,e.value+1);)e.value+=2;return v(e.value).kind===`Identifier`&&T(`)`,e.value+1)&&T(`::`,e.value+2)},le=()=>{if(!D(`<<`))return{kind:`Name`,name:k()};let e=A(k);return O(`>>`),{kind:`Tuple`,names:e}},ue=()=>A(()=>{let e=A(le);O(`\\in`);let t=F();return e.map(e=>({pattern:e,set:t}))}).flat(),de=()=>{let e=v();if(e.kind===`Identifier`){let t=r.index,n=[E().text];for(;T(`!`)&&v(1).kind===`Identifier`;)E(),n.push(k());return g({kind:`Identifier`,name:n.join(`!`),location:d(e)},t)}if(T(`<<`)||T(`(`))return be();throw re(`Expected a subscript but found ${y(e)}`)},fe=e=>{let t=v(1),n=v(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&T(`==`,rc.has(n.text)?3:4))},j=e=>{if(!ac.has(e.text))return!0;let t=v(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||T(`,`,1)||T(`)`,1)||t.kind===`Keyword`&&dc.has(t.text)||fe(e)},M=()=>{let e=v(),n=e.kind===`Operator`&&(nc.has(e.text)||ic.has(e.text))&&j(e);if(t&&e.kind!==`String`&&(ic.has(e.text)||sc.has(e.text)&&e.text!==`'`&&!rc.has(e.text)||oc.has(e.text)&&v(-1).text===`(`&&v(-1).line===e.line&&v(-1).endColumn+1===e.column&&v(1).text===`)`&&v(1).line===e.line&&v(1).column===e.endColumn+1)&&j(e))throw C(`incomplete expression`,e);if(n)return r.index++,g({kind:`OperatorReference`,operator:e.text,location:d(e)},r.index-1);if(e.kind!==`String`&&sc.has(e.text)&&j(e)){r.index++;let t=d(e);if(rc.has(e.text))return{kind:`OperatorReference`,operator:e.text,location:t};let n={kind:`Identifier`,name:`argument`,location:t};return{kind:`Lambda`,params:[n.name],body:lc(e.text,n,t),location:t}}if(T(`LAMBDA`)){let t=r.index;E();let n=A(k);O(`:`);let i=F();return g({kind:`Lambda`,params:n,body:i,location:d(e)},t)}return F()},pe=()=>oe(()=>{O(`(`);let e=A(M);return O(`)`),e}),N=()=>{let e=E();r.offsideColumns.push(e.column);let t=[F()];for(;_().text===e.text&&_().column===e.column;)r.index++,t.push(F());return r.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:d(e)}},P=e=>oe(()=>{let t=d(e);if(v().kind===`Identifier`&&(T(`|->`,1)||T(`:`,1))){let e=T(`|->`,1)?`Record`:`RecordSet`,n=A(()=>{let t=k();return O(e===`Record`?`|->`:`:`),{name:t,value:F()}});return O(`]`),{kind:e,fields:n,location:t}}if(se()){let e=ue();O(`|->`);let n=F();return O(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let n=F();if(D(`->`)){let e=F();return O(`]`),{kind:`FunctionSet`,domain:n,range:e,location:t}}if(D(`EXCEPT`)){let e=A(()=>{O(`!`);let e=[];for(;T(`.`)||T(`[`);)if(D(`.`)){if(!ie(v()))throw re(`Expected a field name but found ${y(v())}`);e.push({kind:`Field`,name:E().text})}else O(`[`),e.push({kind:`Index`,args:A(()=>F())}),O(`]`);return O(`=`),{path:e,value:F()}});return O(`]`),{kind:`Except`,function:n,updates:e,location:t}}return O(`]_`),{kind:`BoxAction`,action:n,subscript:de(),location:t}}),me=e=>oe(()=>{let t=d(e);if(D(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(se()&&(v(1).text===`\\in`||T(`<<`))){let e=r.index,n=le();O(`\\in`);let i=F();if(D(`:`)){let e=F();return O(`}`),{kind:`SetFilter`,bound:{pattern:n,set:i},predicate:e,location:t}}r.index=e}let n=F();if(D(`:`)){let e=ue();return O(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let i=[n];for(;D(`,`);)i.push(F());return O(`}`),{kind:`SetEnumeration`,elements:i,location:t}}),he=e=>{let t=d(e),n=oe(()=>T(`>>`)||T(`>>_`)?[]:A(()=>F()));if(D(`>>_`)){if(n.length!==1)throw C(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:de(),location:t}}return O(`>>`),{kind:`Tuple`,elements:n,location:t}},ge=e=>{let t=d(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&se()){let e=ue();return O(`:`),{kind:n,bounds:e,body:F(),location:t}}let i=A(k);return O(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i,body:F(),isTemporal:r,location:t}},_e=e=>{let t=[];do{if(D(`OTHER`))return O(`->`),{kind:`Case`,arms:t,other:F(),location:d(e)};let n=F();O(`->`),t.push({condition:n,body:F()})}while(D(`[]`));return{kind:`Case`,arms:t,other:void 0,location:d(e)}},ve=()=>{let e=v(1);return T(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||uc.has(e.text)||e.kind===`Operator`&&(nc.has(e.text)||rc.has(e.text)||ic.has(e.text)))},ye=()=>{let e=E();if(e.kind===`Number`)return{kind:`Operand`,operand:w(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return r.index--,{kind:`Bound`,args:pe()}}return{kind:`Name`,name:e.text,args:T(`(`)?pe():[]}},be=()=>{let e=r.index===s.index,n=E(),a=d(n);if(t&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=A(k);return O(`:`),{kind:`Lambda`,params:e,body:F(),location:a}}if(n.kind===`Number`){if(t&&/^\\[BOH]/.test(n.text))throw C(`incomplete expression`,n);return{kind:`Number`,value:w(n.text),text:n.text,location:a}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:a};if(n.kind===`String`)return{kind:`String`,value:n.text,location:a};let o=n.kind===`Step`&&Fe(n);if(o&&Me()<0&&I.length<=1)throw C(`Step number used outside proof`,n);if(o&&n.text[1]===`+`)throw C(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||o){let r=o?L(n)??n.text:n.text;if(ce()){let e=D(`(`)?A(k):[];return e.length>0&&O(`)`),O(`::`),{kind:`Label`,name:r,params:e,body:F(),location:a}}let i=T(`(`),s=i?pe():[];if(!ve())return i?{kind:`Apply`,operator:r,args:s,location:a}:{kind:`Identifier`,name:r,location:a};let l=c.flatMap(e=>e.instances).find(e=>e.name===r);if(l&&!e&&!t&&l.params.length!==s.length)throw C(`The operator ${r} requires ${l.params.length} arguments`,n);let u=[{kind:`Name`,name:r,args:s}];for(;ve();)E(),u.push(ye());let d=u.flatMap(e=>e.kind===`Name`?[e.name]:[]);if(d.length<u.length)return{kind:`Subexpression`,selectors:u,location:a};let f=d.join(`!`),p=u.flatMap(e=>`args`in e?e.args:[]);if(p.length===0)return{kind:`Identifier`,name:f,location:a};let m=u.map(e=>`args`in e?e.args.length:0);return m.slice(0,-1).some(e=>e>0)?{kind:`Apply`,operator:f,args:p,argumentCounts:m,location:a}:{kind:`Apply`,operator:f,args:p,location:a}}if(n.kind===`Operator`&&cc(n.text)&&T(`(`))return{kind:`Apply`,operator:n.text,args:pe(),location:a};switch(n.text){case`(`:{let e=oe(()=>F());return O(`)`),e}case`[`:return P(n);case`{`:return me(n);case`<<`:return he(n);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return ge(n);case`IF`:{let e=F();O(`THEN`);let t=F();return O(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:F(),location:a}}case`CASE`:return _e(n);case`LET`:{let e=[],n=[];for(i.push(/* @__PURE__ */ new Set);!D(`IN`);){if(t&&T(`RECURSIVE`))throw C(`Unexpected keyword RECURSIVE`,x(_()));if(D(`RECURSIVE`)){ke();continue}let r=we(!1);r.kind===`Instance`?n.push(r):e.push(r)}i.pop();let r=F();return n.length===0?{kind:`Let`,definitions:e,body:r,location:a}:{kind:`Let`,definitions:e,instances:n,body:r,location:a}}case`CHOOSE`:{let e=le(),t=D(`\\in`)?F():void 0;return O(`:`),{kind:`Choose`,pattern:e,set:t,body:F(),location:a}}case`WF_`:case`SF_`:{let e=de(),t=oe(()=>{O(`(`);let e=F();return O(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:a}}}throw re(`Unexpected ${y(n)}`,n)},xe=()=>{let e=v(),t=d(e);if(e.kind===`Operator`&&(e.text===`/\\`||e.text===`\\/`))return N();if(e.kind===`Operator`||e.kind===`Keyword`)switch(e.text){case`~`:return E(),{kind:`Apply`,operator:`~`,args:[F(5)],location:t};case`-`:return E(),{kind:`Apply`,operator:`-.`,args:[F(13)],location:t};case`[]`:return E(),{kind:`Always`,expression:F(16),location:t};case`<>`:return E(),{kind:`Eventually`,expression:F(16),location:t};case`ENABLED`:return E(),{kind:`Enabled`,expression:F(16),location:t};case`UNCHANGED`:return E(),{kind:`Unchanged`,expression:F(16),location:t};case`SUBSET`:case`UNION`:case`DOMAIN`:return E(),{kind:`Apply`,operator:e.text,args:[F(9)],location:t}}return be()},F=(e=0)=>{let t=r.index,n=xe(),i={left:n.location.range?n:g(n,t),previous:void 0};for(;;){let n=v();if(n.kind!==`Operator`)break;let r=d(n);if(n.text===`'`&&e<=15){E(),i.left=g({kind:`Prime`,expression:i.left,location:r},t);continue}if(rc.has(n.text)&&e<=15){E(),i.left=g({kind:`Apply`,operator:n.text,args:[i.left],location:r},t);continue}if(n.text===`[`){E();let e=oe(()=>A(()=>F()));oe(()=>O(`]`)),i.left=g({kind:`FunctionApplication`,function:i.left,args:e,location:r},t);continue}if(n.text===`.`&&ie(v(1))){E();let e=E().text;i.left=g({kind:`FieldAccess`,record:i.left,field:e,location:r},t);continue}let a=nc.get(n.text);if(!a||a.low<e)break;let o=i.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 C(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(E(),a.low>12&&T(`-`))throw C(`Precedence conflict between ${n.text} and -`,v());let s=F(a.high+1),c=i.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`;i.left=c.kind===e&&o?.text===n.text?{...c,operands:[...c.operands,s]}:{kind:e,operands:[c,s],location:r}}else i.left=n.text===`\\X`?c.kind===`Product`&&o?.text===`\\X`?{...c,factors:[...c.factors,s]}:{kind:`Product`,factors:[c,s],location:r}:{kind:`Apply`,operator:n.text,args:[c,s],location:r};i.left=g(i.left,t),i.previous={...a,text:n.text}}return i.left},Se=()=>{if(!D(`(`))return[];let e=Oe();return O(`)`),e},Ce=()=>{let e=d(v()),t=F(),i=n[r.index-1],a={line:i.line,column:i.endColumn};return{body:t,bodyRange:{module:c[c.length-1].name,start:e,end:a}}},we=e=>{let t=r.index;return g(Te(e),t)},Te=e=>{let t=v(),n=d(t),i=(t,r)=>({kind:`Operator`,name:t,params:r,...Ce(),isLocal:e,isRecursive:l(t),location:n});if(t.kind===`Identifier`&&v(1).kind===`Operator`&&nc.has(v(1).text)&&v(2).kind===`Identifier`&&T(`==`,3)){let e=k(),t=E().text,n=k();return O(`==`),i(t,[{name:e,arity:0},{name:n,arity:0}])}let a=t.kind===`Operator`&&t.text===`-.`,o=t.kind===`Identifier`&&rc.has(v(1).text)&&T(`==`,2);if(a||o){let e=a?t.text:v(1).text;r.index+=a?1:2;let n=a?k():t.text;return O(`==`),i(e,[{name:n,arity:0}])}let s=k();if(D(`[`)){let t=oe(()=>ue());return O(`]`),O(`==`),{kind:`Function`,name:s,bounds:t,body:F(),isLocal:e,isRecursive:l(s),location:n}}let c=r.index,u=Se();return O(`==`),T(`INSTANCE`)?{...Ee(s,u,e,n),definitionRange:h(c)}:i(s,u)},Ee=(e,t,n,i)=>{let a=r.index;return O(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:k(),substitutions:D(`WITH`)?A(()=>{let e=E().text;return O(`<-`),{name:e,expression:M()}}):[],isLocal:n,location:i,instanceRange:h(a)}},De=()=>{let e=d(v());if(T(`_`)&&v(1).kind===`Operator`)return E(),{name:E().text,arity:D(`_`)?2:1,location:e};if(v().kind===`Operator`&&T(`_`,1)){let t=E().text;return E(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=k();if(!D(`(`))return{name:t,arity:0,location:e};let n=A(()=>O(`_`));return O(`)`),{name:t,arity:n.length,location:e}},Oe=()=>A(De),ke=()=>{let e=Oe();return e.forEach(e=>i[i.length-1].add(e.name)),e},Ae=e=>{let t={value:0,offset:e};do{let e=v(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&bc.has(e.text)&&t.value++,e.kind===`Operator`&&xc.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},je=()=>{let e=v(),t=v(1);return e.kind===`Identifier`?T(`(`,1)||T(`[`,1)?T(`==`,Ae(1)):t.kind===`Operator`&&rc.has(t.text)?T(`==`,2):t.kind===`Operator`&&nc.has(t.text)?v(2).kind===`Identifier`&&T(`==`,3):T(`==`,1):T(`-.`)&&t.kind===`Identifier`&&T(`==`,2)},I=[],Me=()=>I[I.length-1]??-1,Ne=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),Pe=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)},Fe=e=>!e.text.endsWith(`.`)&&!gc.has(Pe(e)),L=e=>{let t=Pe(e);if(gc.has(t))return;let n=Ne(e);if(n>=0)return`<${n}>${t}`;let r=Me(),i=I[I.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},Ie=e=>{if(e.kind===`Keyword`)return pc.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return I.length===0;if(e.text[1]===`+`||I.length===0)return!0;let t=Me();return t>=0&&Ne(e)>t},Le=e=>{let t=Ne(e),n=I.length-1,r=I[n-1]??-1,i=I[n]<0;return i&&(I[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:I[n]===t},Re=e=>!a.has(e)&&c.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),ze=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Sc.has(e.name)&&!Re(e.name):!1,Be=()=>{let e=v();return e.kind===`Step`?Fe(e):e.kind===`Keyword`?_c.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!je()},Ve=()=>{let e=r.index;s.index=e;let t=v();return t.kind===`Operator`&&!ac.has(t.text)&&cc(t.text)?(r.index++,g({kind:`OperatorReference`,operator:t.text,location:d(t)},e)):D(`MODULE`)?g({kind:`ModuleFact`,name:k(),location:d(t)},e):F()},He=e=>o[o.length-1]?.add(e),Ue=e=>{o.push(/* @__PURE__ */ new Set);let t=e();return o.pop(),t},We=e=>o.some(t=>t.has(e))||c.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),Ge=()=>{let e=r.index,t=v(),n=A(()=>{let e=v();if((e.kind!==`Identifier`||S(e))&&e.kind!==`Operator`)throw re(`Expected a definition name but found ${y(e)}`,e);return r.index++,e.text},`!`),i=d(t);return g(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:i}:{kind:`Identifier`,name:n.join(`!`),location:i},e)},Ke=()=>{if(t)return A(Ge);let e=A(Ve),n=e.find(e=>e.kind===`Identifier`&&We(e.name));if(n)throw C(`DEF clause entry should describe a defined operator`,n.location);return e},qe=()=>({facts:Be()?A(Ve):[],defs:D(`DEF`)||D(`DEFS`)?Ke():[]}),Je=()=>{let e=r.index,n=E(),i=n.text===`USE`&&D(`ONLY`),a=h(e),o={kind:n.text===`USE`?`Use`:`Hide`,isOnly:i,...qe(),keyword:a,location:d(n)},s=o.kind===`Hide`&&!t?o.facts.find(e=>!ze(e)):void 0;if(s)throw C(`The only expression allowed as a fact in a HIDE is the name of a theorem, assumption, or step`,s.location);return g(o,e)},Ye=()=>{let e=r.index,t=d(v()),n=D(`NEW`),i=v().kind===`Keyword`?vc.get(v().text):void 0;if(!n&&i===void 0)throw re(`Expected a declaration but found ${y(v())}`);if(i!==void 0&&E(),i===`Variable`){let n=k();return He(n),g({kind:`NewSymbol`,name:n,arity:0,level:i,set:void 0,location:t},e)}let a=De();He(a.name);let o=(i??`Constant`)===`Constant`&&T(`\\in`);if(o&&a.arity>0)throw C(`declared symbol with arguments before \\in`);return o&&E(),g({kind:`NewSymbol`,name:a.name,arity:a.arity,level:i??`Constant`,set:o?F():void 0,location:t},e)},Xe=()=>{let e=r.index,t=d(O(`ASSUME`)),n=A(()=>T(`ASSUME`)?Ue(Xe):v().kind===`Keyword`&&yc.has(v().text)?Ye():F());return O(`PROVE`),g({kind:`AssumeProve`,assumptions:n,conclusion:F(),location:t},e)},Ze=e=>{let t={value:0};for(;v(t.value).kind===`Identifier`&&T(`,`,t.value+1);)t.value+=2;return v(t.value).kind===`Identifier`&&T(e,t.value+1)},Qe=(e,t)=>{e.forEach(He),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(He))},$e=()=>{let e=v();if(T(`USE`)||T(`HIDE`))return Je();if(T(`INSTANCE`))return g(Ee(void 0,[],!1,d(e)),r.index);if(T(`DEFINE`)||je()){let t=r.index;D(`DEFINE`);let n=[we(!1)];for(;je();)n.push(we(!1));let i={kind:`Define`,definitions:n,location:d(e)};return g(i,t)}if(D(`HAVE`))return{kind:`Have`,expression:F()};if(D(`TAKE`)){let e=se(),t=e?[]:A(k),n=e?ue():[];return Qe(t,n),{kind:`Take`,names:t,bounds:n}}if(D(`WITNESS`))return{kind:`Witness`,expressions:A(()=>F())};if(D(`PICK`)){let e=Ze(`:`),t=e?A(k):[],n=e?[]:ue();return Qe(t,n),O(`:`),{kind:`Pick`,names:t,bounds:n,body:F()}}return D(`CASE`)?{kind:`Case`,expression:F()}:{kind:`Assert`,isSuffices:D(`SUFFICES`),statement:T(`ASSUME`)?Xe():F()}},et=e=>{let t=v();if(t.kind!==`Step`)throw re(`Expected a step number but found ${y(t)}`,t);if(!Le(t))throw C(`${e?`QED step`:`step`}'s number has bad level`,t);if(Ne(t)<0&&L(t)!==void 0)throw C(`<*> and <+> cannot be used for a named step`,t);return r.index++,{name:L(t),token:t.text,location:d(t)}},tt=()=>{let e=r.index,t=et(T(`QED`,1)),n=/* @__PURE__ */ new Set;o.push(n);let i=D(`QED`)?{kind:`Qed`}:$e(),a=h(e),s=Ie(v());if(s&&!mc.has(i.kind))throw C(`Proof of a step that does not take a proof`);let c=s?rt():void 0;return o.pop(),(i.kind!==`Assert`||i.isSuffices)&&n.forEach(He),g({...t,body:i,head:a,proof:c},e)},nt=()=>{let e=d(v());if(T(`BY`)||T(`PROOF`)&&T(`BY`,1)){D(`PROOF`),E();let t=h(r.index-1);return{kind:`By`,isOnly:D(`ONLY`),...qe(),keyword:t,location:e}}let t=v(+!!T(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){D(`PROOF`),E();let n=h(r.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}D(`PROOF`);let n=[tt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(tt());return{kind:`Steps`,level:Me(),steps:n,location:e}},rt=()=>{let e=r.index;I.push(-1);let t=Ue(nt);return I.pop(),g(t,e)},it=e=>{let t=r.index,n=E(),i=v().kind===`Identifier`&&T(`==`,1)?k():void 0;i!==void 0&&(a.add(i),E());let o=Ue(()=>({statement:T(`ASSUME`)?Xe():F(),proof:Ie(v())?rt():void 0})),s=o.statement,c=g({name:i,statement:s,proof:o.proof,location:d(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),i!==void 0&&s.kind!==`AssumeProve`&&e.definitions.push(g({kind:`Operator`,name:i,params:[],body:s,isLocal:!1,isRecursive:!1,location:d(n)},t))},at=()=>{let e=r.index;return g(ot(),e)},ot=()=>{let e=E(),t=d(e),n=e.text===`AXIOM`;if(v().kind===`Identifier`&&T(`==`,1)){let e=k();return a.add(e),E(),{name:e,expression:F(),isAxiom:n,location:t}}return{name:void 0,expression:F(),isAxiom:n,location:t}},st=()=>{let e=d(O(`----`));O(`MODULE`);let t=k();O(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(c.push(n),i.push(/* @__PURE__ */ new Set),D(`EXTENDS`)&&A(()=>{let e=r.index;n.extends.push(k()),n.extendsRanges.push(h(e))});;){let a=r.index;b.index=a;let o=v();if(o.kind===`ModuleEnd`||o.kind===`End`)return o.kind===`ModuleEnd`&&(e.range={module:t,start:{line:e.line,column:e.column},end:{line:o.line,column:o.endColumn}}),c.pop(),i.pop(),n;if(o.kind===`Separator`){if(T(`MODULE`,1)){let e=st();n.modules.push(e),n.units.push({kind:`Module`,module:e}),O(`====`);continue}E()}else{switch(o.text){case`CONSTANT`:case`CONSTANTS`:{E();let e=Oe();n.constants.push(...e),n.units.push({kind:`Constants`,declarations:e});continue}case`VARIABLE`:case`VARIABLES`:{E();let e=A(()=>{let e=r.index,t=d(v());return g({name:k(),arity:0,location:t},e)});n.variables.push(...e),n.units.push({kind:`Variables`,declarations:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=at();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&n.definitions.push({kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{let e=Je();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:E(),n.units.push({kind:`Recursive`,declarations:ke()});continue;case`INSTANCE`:ct(n,g(Ee(void 0,[],!1,d(o)),a));continue;case`LOCAL`:if(E(),T(`INSTANCE`)){ct(n,g(Ee(void 0,[],!0,d(o)),a));continue}ct(n,we(!0));continue}o.kind===`Keyword`&&fc.has(o.text)?it(n):ct(n,we(!1))}}},ct=(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}))};return st()},Ec=e=>Tc(e,!1),Dc=e=>Tc(e,!0),Oc=25214903917n,kc=(1n<<48n)-1n,Ac=2147483647,jc=e=>{let t={value:(BigInt.asUintN(64,e)^Oc)&kc},n=e=>(t.value=t.value*Oc+11n&kc,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Oc)&kc},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<=Ac)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Mc=10454148508367108822n,Nc=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Mc);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Pc=Int32Array.from(Nc,e=>Number(BigInt.asIntN(32,e>>32n))),Fc=Int32Array.from(Nc,e=>Number(BigInt.asIntN(32,e))),Ic=Number(BigInt.asIntN(32,Mc>>32n)),Lc=Number(BigInt.asIntN(32,Mc));let Rc=Ic,zc=Lc;const Bc=e=>{let t=(e^zc)&255;zc=(zc>>>8|Rc<<24)^Fc[t],Rc=Rc>>>8^Pc[t]},Vc=e=>{for(let t=0;t<32;t+=8)Bc(e>>>t)},Hc=e=>{if(typeof e==`boolean`)Bc(0),Bc(e?116:102);else if(typeof e==`number`)Bc(1),Vc(e);else if(typeof e==`string`){Bc(3),Vc(e.length);for(let t=0;t<e.length;t++)Bc(e.charCodeAt(t))}else if(P(e))Bc(21),Vc(Ae(e.name)+1);else if(N(e)){let t=H(e);Bc(9),Vc(t.domain.length);for(let e=0;e<t.domain.length;e++)Hc(t.domain[e]),Hc(t.range[e])}else{let t=B(e).elements;Bc(5),Vc(t.length);for(let e of t)Hc(e)}},Uc=e=>{let t={high:Rc,low:zc};Rc=Ic,zc=Lc;for(let t of e)Hc(t);let n=BigInt(Rc>>>0)<<32n|BigInt(zc>>>0);return Rc=t.high,zc=t.low,n},Wc=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||P(e))return 5;if(typeof e==`string`)return 5+e.length;if(N(e)){let t=H(e);return t.domain.reduce((e,n,r)=>e+Wc(n)+Wc(t.range[r]),5)}return B(e).elements.reduce((e,t)=>e+Wc(t),5)},Gc=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){Rc=n<32?0:1<<n-32,zc=n<32?1<<n:0;for(let t=0;t<e;t++)Bc(0);let r=n>>3,i=1<<(n&7);for(let e=i;e<2*i;e++){let n=(r*256+e)*2,a=(r*256+e-i)*2;t[n]=t[a]^Rc,t[n+1]=t[a+1]^zc}}return t},Kc=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=[],a=e=>{let t=r.get(e);if(t!==void 0)return t;let n=Wc(e);return Rc=0,zc=0,Hc(e),r.set(e,i.length),i.push(n,Rc,zc),i.length-3},o=e=>{let t=n.get(e);if(t)return t;let r=Gc(e);return n.set(e,r),r};return(n,r)=>{let s={high:Rc,low:zc},c={high:Ic,low:Lc};for(let t of e){let e=a(n[t]),r=o(i[e]),s={high:i[e+1],low:i[e+2]};for(let e=0;e<8;e++){let t=e<4?c.low:c.high,n=(e*256+(t>>>(e&3)*8&255))*2;s.high^=r[n],s.low^=r[n+1]}c.high=s.high,c.low=s.low}Rc=s.high,zc=s.low,t[2*r]=c.low,t[2*r+1]=c.high}},qc=[],Jc=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Yc=()=>{for(let e=1277011;qc.length<1341;e++)Jc(e)&&qc.push(e);return qc},Xc=e=>{let t=Yc(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},Zc=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},Qc=e=>{for(let t=Math.max(e,9);;t++){let e=Zc(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)}}},$c=(e,t,n)=>{if(t<=0)return[];let r=Qc(t),i={index:BigInt(n.nextInt(t))},a=BigInt(Xc(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},el=(1n<<63n)-1n-24n,tl=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(el*BigInt(n)+i)%t;return r<0n?r+t:r})},nl=(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,rl=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=kt(e.domain),n=B(e.range).elements;return{lists:t.map(()=>n),create:e=>ze(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>B(e).elements),create:t=>jt(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>B(e).elements),create:R}}},il=(e,t,n)=>{if(V(t))return[];if(typeof t==`object`&&t.kind===`Interval`)return $c(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let r=rl(t);if(r){let t=r.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Ac)?tl(e,t,n):$c(e,Number(t),n)).map(e=>r.create(nl(r.lists,e)))}let i=B(t).elements;return $c(e,i.length,n).map(e=>i[Number(e)])},al=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new f(`RandomElement of the empty set`);return n},ol=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...kt(e.domain)];return ze(n,n.map(()=>ol(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return jt(e.names.map((n,r)=>[n,ol(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return R(e.factors.map(e=>ol(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 f(`RandomElement of the empty set`);return e.low+r}return al(B(e).elements,t)},sl=(e,t=0n)=>{let n=jc(t),r={random:jc(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>jt([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Uc,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.state&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.state=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},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},cl=e=>xt([...e.possibleCounts].map(([e,t])=>[e,t])),ll=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,cl(e)]]),ul=(e,t,n)=>new p(`Applying ${e} to the following value,\nwhich is not ${t}:\n${U(n)}`),dl=(e,t,n,r)=>new p(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${U(r)}`),fl=e=>N(e)?H(e):void 0,pl=(e,t,n)=>{let r=G(e,t,n),i=fl(r);if(!i)throw ul(n,`a function with a finite domain`,r);return i},ml=(e,t,n)=>{let r=G(e,t,n),i=fl(r);if(!i)throw dl(t===0?`first`:`second`,n,`bag`,r);return i},hl=(e,t)=>{if(!M(e)||!z(e))throw t();return B(e).elements},gl=e=>e.range.every(e=>typeof e==`number`&&e>0),_l=(e,t)=>{let n=e.domain.findIndex(e=>Be(e,t));return n===-1?void 0:e.range[n]},vl=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,yl=vl(`BagDiff`,`tlc2.value.impl.Value`,2),bl=vl(`SqSubseteq`,`tlc2.value.IBoolValue`,2),xl=vl(`BagUnion`,`tlc2.value.impl.Value`,1),Sl=vl(`BagOfAll`,`tlc2.value.impl.Value`,2),Cl=vl(`BagCup`,`tlc2.value.impl.Value`,2),wl=vl(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Tl=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${pr(e)}`;throw hr(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')`)},El=(e,t,n)=>{let r=Tl(e,n)+Tl(t,n);if(cr(r))throw lr(`${e}+${t}`);return r},Dl=(e,t,n,r)=>{let i=_l(n,e.domain[t]),a=Tl(e.range[t],r);return i===void 0?a:a-Tl(i,r)|0},Ol=(e,t)=>xt(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>Be(e[0],r));a?a[1]=El(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),kl=ze([],[]),Al=[ir(`EmptyBag`,kl),K(`IsABag`,1,e=>{let t=fl(G(e,0,`IsABag`));return t!==void 0&&gl(t)}),K(`BagCardinality`,1,e=>{let t=G(e,0,`BagCardinality`);return pl(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw ul(`BagCardinality`,`a bag`,t);return El(e,n,wl)},0)}),K(`BagIn`,2,e=>{let t=G(e,1,`BagIn`),n=_l(pl(e,1,`BagIn`),G(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw dl(`second`,`BagIn`,`bag`,t);return n>0}),K(`CopiesIn`,2,e=>{let t=G(e,1,`CopiesIn`),n=_l(pl(e,1,`CopiesIn`),G(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw dl(`second`,`CopiesIn`,`bag`,t);return n}),K(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=ml(e,t,`(+)`);if(!gl(n))throw dl(t===0?`first`:`second`,`(+)`,`bag`,G(e,t,`(+)`));return n});return Ol(t,Cl)}),K(`\\ominus`,2,e=>{let t=ml(e,0,`(-)`),n=ml(e,1,`(-)`);return xt(t.domain.flatMap((e,r)=>{let i=Dl(t,r,n,yl);return i>0?[[e,i]]:[]}))}),K(`BagUnion`,1,e=>{let t=G(e,0,`BagUnion`),n=hl(t,()=>ul(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??kl;let r=n.map(e=>{let n=fl(e);if(!n)throw new p(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${U(t)}`);return n});return Ol(r,xl)}),K(`\\sqsubseteq`,2,e=>{let t=pl(e,0,`\\sqsubseteq`),n=pl(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Dl(t,r,n,bl)<=0)}),ar(`BagOfAll`,2,e=>{let t=rr(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new p(`The first argument of BagOfAll should be an operator, but instead it is:\n${U(t.literalBody)}`);let n=G(e,1,`BagOfAll`),r=fl(n);if(!r)throw dl(`second`,`BagOfAll`,`function with a finite domain`,n);return Ol(r.domain.map((e,n)=>ze([t.call([e])],[r.range[n]])),Sl)}),K(`SubBag`,1,e=>{let t=G(e,0,`SubBag`);if(!N(t))throw new f(`DOMAIN expects a function but received ${U(t)}`);let n=H(t),r=ht(n.range).elements,i=r.find(e=>typeof e!=`number`);if(i!==void 0){let e=typeof r[0]!=`number`;throw new f(`The ${e?`first`:`second`} argument of >= should be an integer, but instead it is:\n${U(e?r[0]:i)}`)}let a=n.range.filter(e=>typeof e==`number`);if(a.some(e=>e<1))throw new f(`Attempted to apply a function to ${U(n)}, which is not in its domain`);return ht(n.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:a[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>ze(e.map(e=>e[0]),e.map(e=>e[1]))))}),K(`BagToSet`,1,e=>gn(pl(e,0,`BagToSet`))),K(`SetToBag`,1,e=>{let t=G(e,0,`SetToBag`),n=hl(t,()=>ul(`BagToSet`,`a function with a finite domain`,t));return ze([...n],n.map(()=>1))})],jl=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Ml=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,Nl=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Pl=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Fl=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Il=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Ll=e=>{if(!N(e))return!1;let t=H(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},Rl=(e,t)=>hr(e,`Cannot convert value: unsupported value type tlc2.value.impl.${pr(t)}`),zl=(e,t)=>hr(e,`Cannot cast tlc2.value.impl.${pr(t)} to tlc2.value.impl.StringValue`),Bl=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Vl=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw Rl(t,e);return`[${B(e).elements.map(e=>Ul(e,t)).join(`,`)}]`},Hl=(e,t)=>{let n=H(e),r=Qt(n);return r?`[${r.map(e=>Ul(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Bl(typeof e==`string`?e:U(e))}:${Ul(n.range[r],t)}`).join(`,`)}}`},Ul=(e,t)=>typeof e==`string`?Bl(e):typeof e==`object`?e.kind===`ModelValue`?Bl(e.name):M(e)?Vl(e,t):Hl(e,t):String(e),Wl=e=>{if(M(e))return Vl(e,jl);if(!N(e)||Ll(e))throw Rl(jl,e);return Hl(e,jl)},Gl=e=>{if(!N(e))throw Rl(Ml,e);return Hl(e,Ml)},Kl=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))},ql=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Oe(e);if(Array.isArray(e))return R(e.map(e=>ql(e,t)));if(typeof e==`object`&&e)return jt(Object.entries(e).map(([e,n])=>[Oe(e),ql(n,t)]));throw hr(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Jl=(e,t)=>{if(e.trim()===``)return ql(null,t);try{return ql(JSON.parse(e,(e,t,n)=>typeof t==`number`?Kl(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?hr(t,e.message):e}},Yl=(e,t)=>{if(typeof e!=`string`)throw zl(t,e);return e},Xl=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw hr(n,`${t} (No such file or directory)`);return r},Zl=e=>[or(`ToJson`,1,e=>Oe(Ul(G(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),or(`ToJsonArray`,1,e=>Oe(Wl(G(e,0,`ToJsonArray`)))),or(`ToJsonObject`,1,e=>Oe(Gl(G(e,0,`ToJsonObject`)))),or(`JsonSerialize`,2,t=>{let n=Yl(G(t,0,`JsonSerialize`),Nl),r=G(t,1,`JsonSerialize`);if(!Qt(r)&&!Ll(r))throw new p(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${U(r)}`);return e.writeFile?.(n,Ul(r,Nl)),!0}),or(`ndJsonSerialize`,2,t=>{let n=Yl(G(t,0,`ndJsonSerialize`),Pl),r=G(t,1,`ndJsonSerialize`),i=Qt(r);if(!i)throw new p(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${U(r)}`);return e.writeFile?.(n,i.map(e=>`${Ul(e,Pl)}\n`).join(``)),!0}),or(`JsonDeserialize`,1,t=>{let n=Yl(G(t,0,`JsonDeserialize`),Fl);return Jl(Xl(e,n,Fl),Fl)}),or(`ndJsonDeserialize`,1,t=>{let n=Yl(G(t,0,`ndJsonDeserialize`),Il);return R(Xl(e,n,Il).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Jl(e,Il)))})],Ql=(e,t,n,r)=>new p(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),$l=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Ql(t,n,`nonnegative integer`,U(e));return e},eu=(e,t,n,r)=>{if(!M(e)||!z(e))throw Ql(t,n,r,U(e));return B(e).elements},tu=(e,t,n,r)=>ht(Array.from({length:t},()=>ht(e.filter(()=>r.nextDouble()<n)))),nu=(e,t)=>{let n=`RandomSetOfSubsets`,r=$l(G(e,0,n),`first`,n),i=$l(G(e,1,n),`second`,n),a=eu(G(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw Ql(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw Ql(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return tu(a,r,a.length===0?0:i/a.length,t.getRandom())},ru=e=>[or(`RandomSubset`,2,t=>{let n=G(t,0,`RandomSubset`);if(typeof n!=`number`)throw Ql(`first`,`RandomSubset`,`nonnegative integer`,U(n));if(n<0)throw new f(`Attempted to apply the operator overridden by the Java method\npublic static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value),\nbut it produced the following error:\n${n}`);let r=G(t,1,`RandomSubset`);if(!M(r)||!V(r)&&!z(r))throw Ql(`second`,`RandomSubset`,`a finite set`,U(r));return ht(il(n,r,e.getRandom()))}),or(`RandomSetOfSubsets`,3,t=>nu(t,e)),or(`TestRandomSetOfSubsets`,3,t=>R(Array.from({length:5},()=>B(nu(t,e)).elements.length)))],iu=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,au=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${iu})`,ou=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${iu}) throws java.io.IOException`,su=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${iu})`,cu=()=>jt([[`action`,ht([])],[`state`,ht([])]]),lu=()=>jt([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),uu=e=>jt([[`name`,e??`UnnamedAction`],[`location`,lu()]]),du=(e,t)=>{let n=e.map((e,t)=>R([t+1,jt(Object.entries(e.state))])),r=n.slice(1).map((t,r)=>R([n[r],uu(e[r+1].action),t])),i=t?[R([n[n.length-1],uu(t.action),n[t.start]])]:[];return jt([[`action`,ht([...r,...i])],[`state`,ht(n)]])},fu=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return ll(e).get(t)},pu=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),U(r));else throw new p(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${U(n)}`)},mu=e=>e.every(e=>e!==void 0),hu=(e,t)=>jt(t.variables.map((t,n)=>[t,e[n]])),gu=(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&&!W(e)){if(t.variableIndex.has(r))return!0;let e=uo(r,t);if(e&&!n.has(e)&&(n.add(e),gu(e.body,t,n)))return!0}return Gn(e).some(e=>gu(e,t,n))},_u=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[K(`AssertEq`,2,t=>{let n=G(t,0,`AssertEq`),r=G(t,1,`AssertEq`),i=Be(n,r);return i||(e(U(`Assertion failed`,!0)),e(U(n,!0)),e(U(r,!0))),i}),Sr(`AssertError`,2,e=>{let t=rr(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw hr(au,`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=Cr(e,0,`AssertError`)();try{Cr(e,1,`AssertError`)()}catch(e){if(e instanceof f)return e.message===n;throw e}return!1}),or(`TLCGetOrDefault`,2,e=>{let n=G(e,0,`TLCGetOrDefault`);return fu(t,n)??G(e,1,`TLCGetOrDefault`)}),{...ar(`TLCGetAndSet`,4,n=>{let r=G(n,0,`TLCGetAndSet`),i=fu(t,r)??G(n,3,`TLCGetAndSet`),a=rr(n,1,`TLCGetAndSet`);return pu(t,e,r,a.call([i,G(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},or(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!mu(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw hr(ou,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return R(t.getBehavior(r).map(e=>hu(e,n.environment)))}),or(`CounterExample`,0,()=>t.counterExample??cu()),K(`ToTrace`,1,e=>{let t=G(e,0,`ToTrace`);if(!N(t)||!Be(gn(t),ht([`action`,`state`])))throw new f(`The argument of ToTrace should be a CounterExample, but instead it is:\n${U(t)}`);let n=B(mn(t,`state`)).elements.map(e=>Qt(e)??[]);return R(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),K(`TLCModelValue`,1,e=>{let t=G(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new p(`The argument of ModelValue should be a string, but instead it is:\n${U(t)}`);return Le(t)}),Sr(`TLCDefer`,1,()=>!0),K(`TLCNoOp`,1,e=>G(e,0,`TLCNoOp`)),Sr(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!mu(r))throw hr(su,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||lo(Cr(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new _(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Sr(`TLCCache`,2,(e,t)=>{let r=rr(e,0,`TLCCache`),a=Pn(Cr(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=gu(o,t.environment,/* @__PURE__ */ new Set)&&t.state?i(t.state):n,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(a);if(l!==void 0)return l;let u=r.call([]);return c.set(a,u),u}),K(`TLCFP`,1,e=>Number(BigInt.asIntN(32,Uc([G(e,0,`TLCFP`)])))),or(`TLCEvalDefinition`,1,(e,t)=>{let n=G(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?uo(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new p(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${U(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new p(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return X({kind:`Identifier`,name:n,location:r.location},t)})]},vu=(e,t)=>[or(`_Track`,2,e=>{let n=String(G(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,G(e,0,`_Track`)===!0?r+1:r),!0}),or(`_Counts`,0,()=>cl(t)),or(`_CheckName`,1,n=>{let r=String(G(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(U(cl(t),!0)),!1)}),or(`_PrintCounts`,0,()=>(e(U(cl(t),!0)),!0))],yu=e=>String(e).padStart(2,`0`),bu=e=>`${e.getUTCFullYear()}.${yu(e.getUTCMonth()+1)}.${yu(e.getUTCDate())}.${yu(e.getUTCHours())}${yu(e.getUTCMinutes())}${yu(e.getUTCSeconds())}`,xu=e=>xt([...e].map(([e,t])=>[e,R([t])])),Su=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Cu=(e,t,n)=>{if(!e.isStarted&&Su.has(t))throw new f(`TLCGet(${t}) was undefined.`);let r=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return r;case`stats`:return jt([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return jt([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return jt([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Oe(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Oe(bu(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return uu(void 0);case`all`:return xu(e.registers);case`all:named`:return xu(ll(e))}if(t.startsWith(`s:`)){let n=ll(e).get(t);if(n===void 0)throw new f(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Oe(e.properties.get(t.slice(2))??t);throw new f(`TLCGet(${t}) was undefined.`)},wu=e=>e.length===0?[[]]:e.flatMap((t,n)=>wu([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Tu=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&B(e).elements.forEach(Tu),e.kind===`Function`&&e.range.forEach(Tu))},Eu=(t,n)=>[K(`Print`,2,e=>(t(`${j(U(G(e,0,`Print`),!0,!0))} ${j(U(G(e,1,`Print`),!0,!0))}`),G(e,1,`Print`))),K(`PrintT`,1,e=>(t(j(U(G(e,0,`PrintT`),!0,!0))),!0)),K(`Assert`,2,t=>{if(G(t,0,`Assert`)!==!0)throw new p(`The first argument of Assert evaluated to FALSE; the second argument was:\n${j(U(G(t,1,`Assert`)))}`,e.assertViolation);return!0}),K(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),K(`:>`,2,e=>xt([[G(e,0,`:>`),G(e,1,`:>`)]])),K(`@@`,2,e=>{let t=nr(e,0,`@@`),n=nr(e,1,`@@`);return St([...ve(t),...ve(n)])}),K(`ToString`,1,e=>Oe(U(G(e,0,`ToString`),!0))),K(`TLCEval`,1,e=>{let t=G(e,0,`TLCEval`);return Tu(t),t}),K(`Permutations`,1,e=>{let t=er(e,0,`Permutations`);return ht(wu(t).map(e=>xt(t.map((t,n)=>[t,e[n]]))))}),ar(`SortSeq`,2,e=>{let t=rr(e,1,`SortSeq`);return R(tr(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)]},[]))}),or(`TLCGet`,1,(e,t)=>{let r=G(e,0,`TLCGet`);if(typeof r==`number`&&r>=0){let e=n.registers.get(r);if(e===void 0)throw new f(`TLCGet(${r}) was undefined.`);return e}if(typeof r!=`string`)throw new f(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${U(r)}`);return Cu(n,r,t?.state)}),or(`TLCSet`,2,e=>{let r=G(e,0,`TLCSet`);return pu(n,t,r,G(e,1,`TLCSet`)),!0}),ir(`Any`,Pe),K(`RandomElement`,1,e=>ol(Qn(e,0,`RandomElement`),n.getRandom()))],Du=/* @__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(`,`),Ou=[[`\\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`,`≀`],[`^+`,`⁺`]],ku=/* @__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(`,`),Au=/* @__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(`.`),ju=/* @__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(`.`),Mu=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
94
97
|
Nat == { }
|
|
95
98
|
a+b == {a, b}
|
|
96
99
|
a-b == CHOOSE n : b + n = a
|
|
@@ -406,16 +409,16 @@ _CheckName(name) ==
|
|
|
406
409
|
=> (PrintT(counts) /\\ FALSE)
|
|
407
410
|
_PrintCounts == PrintT(_Counts)
|
|
408
411
|
=============================================================================
|
|
409
|
-
`]]),ju=/* @__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)`],[`TLCGet`,`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)`],[`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)`]])]]),Mu=(e,t)=>e.every(e=>$t(e,t)),Nu=pt([!1,!0]),Pu=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return vt(Pu(e,t,r),Pu(e,r,n))},Fu=[`\\cup`,`\\cap`,`\\`],Iu=e=>typeof e==`object`&&e.kind===`MixedSet`,Lu=e=>e.kind===`Interval`?B(e).elements:e.elements,Ru=(e,t,n)=>{let r=Lu(t);if(e!==`\\cup`){let t=e===`\\cap`;return mt(r.filter(e=>$t(e,n)===t))}if(r.length===0)return n;if(!pe(n))return{kind:`SetOperation`,operator:e,left:t,right:n};let i=B(n).elements.filter(e=>!$t(e,t));return mt([...r,...i])},zu=[nr(`TRUE`,!0),nr(`FALSE`,!1),nr(`BOOLEAN`,Nu),nr(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ar(`=`,dt),ar(`#`,(e,t)=>!dt(e,t)),K(`~`,1,e=>!Jn(e,0,`~`)),K(`<=>`,2,e=>Jn(e,0,`<=>`)===Jn(e,1,`<=>`)),K(`/\\`,2,e=>Jn(e,0,`/\\`)&&Jn(e,1,`/\\`)),K(`\\/`,2,e=>Jn(e,0,`\\/`)||Jn(e,1,`\\/`)),K(`=>`,2,e=>!Jn(e,0,`=>`)||Jn(e,1,`=>`)),K(`\\in`,2,e=>$t(G(e,0,`\\in`),G(e,1,`\\in`))),K(`\\notin`,2,e=>!$t(G(e,0,`\\notin`),G(e,1,`\\notin`))),K(`\\subseteq`,2,e=>{let t=Yn(e,0,`\\subseteq`),n=Yn(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&z(t.base)?Mu(B(t.base).elements,n.base):Mu(B(t).elements,n)}),...Fu.map(e=>K(e,2,t=>{let n=Yn(t,0,e),r=Yn(t,1,e);return pe(n)&&pe(r)&&!Iu(n)&&!Iu(r)?e===`\\cup`&&V(n)?r:(e===`\\cup`?vt:e===`\\cap`?_t:gt)(B(n),B(r)):pe(n)?Ru(e,n,r):e!==`\\`&&pe(r)?Ru(e,r,n):{kind:`SetOperation`,operator:e,left:n,right:r}})),K(`SUBSET`,1,e=>({kind:`Subset`,base:Yn(e,0,`SUBSET`)})),K(`UNION`,1,e=>{let t=Yn(e,0,`UNION`),n=$e(t)?t.elements.filter($e):[];if(!$e(t)||n.length!==t.elements.length)return{kind:`Union`,base:t};if(Iu(t)||n.some(Iu)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{$t(t,e)||e.elements.push(t)})),mt(e.elements)}return n.length===0?ht:Pu(n.map(B),0,n.length)}),K(`DOMAIN`,1,e=>{let t=G(e,0,`DOMAIN`);if(!j(t))throw new u(`DOMAIN expects a function but received ${U(t)}`);return mn(t)})],Bu=gr(`DotDot`,`IntervalValue`,2),Vu=gr(`Neg`,`IntValue`,1),Hu=[nr(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),_r(`+`,`Plus`,(e,t)=>e+t),_r(`-`,`Minus`,(e,t)=>e-t),_r(`*`,`Times`,(e,t)=>e*t),_r(`^`,`Expt`,(e,t)=>{if(t<0)throw new d(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new d(`0^0 is undefined.`);return e**t}),_r(`\\div`,`Divide`,(e,t)=>{if(t===0)throw new d(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if(or(n))throw sr(`${e} \\div ${t}`);return n}),_r(`%`,`Mod`,(e,t)=>{if(t<=0)throw new d(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),yr(`<`,(e,t)=>e<t),yr(`>`,(e,t)=>e>t),yr(`<=`,(e,t)=>e<=t),yr(`>=`,(e,t)=>e>=t),K(`..`,2,e=>({kind:`Interval`,low:hr(G(e,0,`..`),Bu),high:hr(G(e,1,`..`),Bu)}))],Uu=[nr(`Int`,{kind:`InfiniteSet`,name:`Int`}),K(`-.`,1,e=>{let t=hr(G(e,0,`-`),Vu);if(or(-t))throw sr(`-${t}`);return-t})],Wu=(e,t,n)=>{let r=G(e,t,n),i=Xt(r);if(!i)throw new d(`${n}\n${U(r)}`);return i},Gu=(e,t,n)=>{let r=G(e,t,n);return typeof r==`string`?r:Wu(e,t,n)},Ku=(e,t,n)=>typeof e==`string`?Oe(e.slice(t,n)):R(e.slice(t,n)),qu=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Ju=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Yu=(e,t)=>{let n=ju.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?mr(e,t):e}):t},Xu=Yu(`Sequences`,[K(`Seq`,1,e=>({kind:`SequenceSet`,base:G(e,0,`Seq`)})),K(`Len`,1,e=>Gu(e,0,qu(``,`Len`)).length),K(`\\o`,2,e=>{let t=Gu(e,0,Ju(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Wu(e,1,Ju(`t \\o s`,`sequence`));return R([...t,...n])}let n=G(e,1,`\\o`);if(typeof n!=`string`)throw new d(`${Ju(`t \\o s`,`string`)}\n${U(n)}`);return Oe(t+n)}),K(`Append`,2,e=>R([...Wu(e,0,Ju(`Append(s, v)`,`sequence`)),G(e,1,`Append`)])),K(`Head`,1,e=>{let t=Wu(e,0,qu(``,`Head`));if(t.length===0)throw new d(`Attempted to apply Head to the empty sequence.`);return t[0]}),K(`Tail`,1,e=>{let t=Gu(e,0,qu(``,`Tail`));if(t.length===0)throw new d(`Attempted to apply Tail to the empty sequence.`);return Ku(t,1)}),K(`SubSeq`,3,e=>{let t=Gu(e,0,qu(`first `,`SubSeq`)),n=qn(e,1,`SubSeq`),r=qn(e,2,`SubSeq`);if(n>r)return Ku(t,0,0);let i=n<1?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new d(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${U(G(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Ku(t,n-1,r)}),rr(`SelectSeq`,2,e=>{let t=tr(e,1,`SelectSeq`);return R(Wu(e,0,qu(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new d(`The second argument of SelectSeq should be a operator, but instead it is:\n${U(n)}`);return n}))})]),Zu=Yu(`FiniteSets`,[K(`IsFiniteSet`,1,e=>{let t=G(e,0,`IsFiniteSet`);if(A(t))return Jt(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new u(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${U(t)}\nis a finite set.`:`Attempted to check if the ${me(t)} ${U(t)} is a finite set.`)}),K(`Cardinality`,1,e=>{let t=G(e,0,`Cardinality`);if(!A(t)||typeof t==`object`&&(t.kind===`InfiniteSet`||t.kind===`SequenceSet`))throw new d(`Attempted to compute cardinality of the value\n${U(t)}`);return Kt(t)})]),Qu=/* @__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`]]]),$u=(e,t,n,r)=>{switch(e){case`Naturals`:return{extends:[],operators:Hu};case`Integers`:return{extends:[`Naturals`],operators:Uu};case`Sequences`:return{extends:[],operators:Xu};case`FiniteSets`:return{extends:[],operators:Zu};case`TLC`:return{extends:[],operators:Yu(`TLC`,wu(t,n))};case`Randomization`:return{extends:[],operators:tu(n)};case`_Possible`:return{extends:[],operators:gu(t,n)};case`Json`:return{extends:[],operators:Yl(r)};case`Bags`:return{extends:[],operators:Ol};case`TLCExt`:return{extends:[],operators:hu(t,n)};default:return}},ed=`$subexpression`,td=(e,t)=>new c(`${e} at line ${t.line}, column ${t.column}`),nd=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),rd=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,id=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}},ad=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Wr(e.bounds),body:e.body,sets:nd(e.bounds)};case`SetMap`:return{names:Wr(e.bounds),body:e.expression,sets:nd(e.bounds)};case`SetFilter`:return{names:Ur(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Ur(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}},od=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return od(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of Un(e)){let e=od(r,t,n);if(e)return e}},sd=(e,t,n)=>e.length===0&&n.length>0?n.splice(0,t):e,cd=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),ld=(e,t)=>{let n=e.location,r=cd(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 td(`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 td(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:ed,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:ed,args:e.args,location:n,resolution:Nr},location:n}},ud=(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:Nr})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Nr}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Nr};return ld({...t,params:[...t.params,...r]},a)},dd=(e,t,n,r)=>{let i={params:[],args:[],lets:[],location:n},a={index:0,current:void 0},o=i=>{let o=[],s=[];for(;a.index<e.length;){let c=e[a.index];if(c.kind!==`Name`)throw td(`Expected an operator name`,n);o.push(c.name),s.push(...c.args);let l=o.join(`!`),u=i?i.find(e=>Ei(e)===l):t(l);if(u)return{definition:u,args:sd(s,Rr(u),r)};a.index++}throw td(`Unknown operator ${o.join(`!`)}`,n)},s=t=>{let r=o(t),s=r.definition,c=Rr(s),l=a.index===e.length-1;if(r.args.length!==c&&r.args.length!==0)throw td(`The operator ${s.name} requires ${c} arguments`,n);if(l)return{definition:s,args:r.args};if(s.kind!==`Operator`)throw td(`Cannot select a subexpression of ${s.name}`,n);i.params.push(...s.params),i.args.push(...r.args),a.current=s.body,a.index++},c=()=>{for(;a.index<e.length;){let t=e[a.index];if(t.kind!==`Name`)return;let o=a.current&&od(a.current,t.name,[]);if(!o)throw td(`Cannot find label ${t.name}`,n);i.lets.push(...o.lets),i.params.push(...o.label.params.map(e=>({name:e,arity:0}))),i.args.push(...sd(t.args,o.label.params.length,r)),a.current=o.label.body,a.index++}},l=t=>{let o=a.current;if(!o)throw td(`Subexpression selection failed`,n);if(t.kind===`Colon`)return;if(o.kind===`Label`){a.current=o.body,l(t);return}if(o.kind===`Let`){if(t.kind!==`Operand`||rd(t.operand,1)!==0)throw td(`A LET/IN expression has only one operand`,n);i.lets.push(o.definitions),a.current=o.body;return}let s=ad(o);if(s&&(t.kind===`Bound`||t.kind===`At`)){i.params.push(...s.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&i.args.push(...sd(t.args,s.names.length,r)),a.current=s.body;return}if(o.kind===`Case`&&t.kind===`Operand`){let r=[...o.arms,...o.other?[{condition:void 0,body:o.other}]:[]],i=r[rd(t.operand,r.length)],s=e[a.index+1];if(!i||s?.kind!==`Operand`)throw td(`A subexpression of CASE must have the form !i!j`,n);a.index++;let c=rd(s.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw td(`Nonexistent CASE operand`,n);a.current=l;return}if(t.kind!==`Operand`)throw td(`Unexpected subexpression selector`,n);let c=s?s.sets:id(o),u=c?.[rd(t.operand,c.length)];if(!u)throw td(`Nonexistent operand specified by the selector`,n);a.current=u},u=s(void 0);if(u)return ud(u.definition,{...i,args:u.args});for(c();a.index<e.length;){let t=e[a.index];if(t.kind===`Name`){for(;a.current?.kind===`Label`;)a.current=a.current.body;if(a.current?.kind!==`Let`)throw td(`A name selector here must be from a LET clause`,n);i.lets.push(a.current.definitions);let e=s(a.current.definitions);if(e)return ud(e.definition,{...i,args:[...i.args,...e.args]});c()}else l(t),a.index++}if(!a.current)throw td(`Subexpression selection failed`,n);return ld(i,a.current)},fd=(e,t)=>{if(!e.includes(`!`)||t(e))return;let n=e.split(`!`),r=n.findIndex((e,r)=>t(n.slice(0,r+1).join(`!`)));if(r!==-1)return[{kind:`Name`,name:n.slice(0,r+1).join(`!`),args:[]},...n.slice(r+1).map(e=>({kind:`Name`,name:e,args:[]}))]},pd=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Un(e).some(pd),md=(e,t)=>{if(!pd(e))return e;if(e.kind===`Let`){let n=n=>e.definitions.find(e=>e.name===n)??t(n);return ki(e,e=>md(e,n))}let n=ki(e,e=>md(e,t));if(n.kind===`Subexpression`)return dd(n.selectors,t,n.location,[]);let r=n.kind===`Identifier`?n.name:n.kind===`Apply`?n.operator:``,i=fd(r,t);if(!i)return n;let a=n.kind===`Apply`?[...n.args]:[],o=dd(i,t,n.location,a);if(a.length>0)throw td(`Too many arguments for ${r}`,n.location);return o},hd=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},gd=(e,t)=>{let n=hd(t.definitions);return{...e,substitutions:e.substitutions.map(e=>({name:e.name,expression:md(e.expression,n)}))}},_d=(e,t)=>{let n=hd([...t,...e.definitions]);return e.definitions.some(e=>pd(e.body))||e.assumptions.some(e=>pd(e.expression))?{...e,definitions:e.definitions.map(e=>Oi(e,e=>md(e,n))),assumptions:e.assumptions.map(e=>({...e,expression:md(e.expression,n)}))}:e},vd=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}])),yd=(e,t)=>`${e}${t}`,bd=(e,t,n)=>`${e}${t}${n}`,xd=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Sd=(e,t,n)=>`${e},${t},${n}`,Cd=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),wd=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Td=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Ed=(e,t,n,r)=>({...Cd(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Dd=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Od=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,kd=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,{...Ed(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Ad=Ed(`$Set`,0,[2],[1]),jd=Ed(`$Junction`,0,[3],[1]),Md=Ed(`$Choose`,0,[2],[1]),Nd=Ed(`$Function`,0,[3],[1]),Pd=Ed(`$FcnApply`,0,[2,2],[1,1]),Fd=Ed(`$RcdSelect`,0,[2,0],[1,1]),Id=Ed(`'`,2,[1],[0]),Ld=Ed(`ENABLED`,1,[2],[0]),Rd=Ed(`[]`,3,[3],[0]),zd=Ed(`$SquareAct`,2,[2,1],[0,0]),Bd=Ed(`$WF`,3,[1,2],[0,0]),Vd=Ed(`$TemporalExists`,3,[3],[0]),Hd=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Ud=e=>e.map(e=>({name:e,arity:0})),Wd=(e,t)=>new c(`${e} at line ${t.line}, column ${t.column}`),Gd=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Kd=e=>e.kind!==`Let`&&e.kind!==`Label`,qd=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)return{kind:`Defined`,levels:_(i,/* @__PURE__ */ new Map)};let a=kd.get(t)??vd.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=Cd(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(bd(e,n,t))}),t.data.constraints.forEach((e,t)=>wd(r.constraints,t,e)),Td(r.argConstraints,yd(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Td(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>Dd(e,n))throw new c(`Level error in applying operator ${e.name}: The level of argument ${n+1} exceeds the maximum level allowed by the operator.`)}),n.some(e=>e.level>2))throw new c(`Level error in applying operator ${e.name}: The 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(Sd(t,n,r)),s=Cd(Math.max(e.level,...t.filter((t,n)=>Od(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)=>{Od(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)=>wd(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||wd(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>wd(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||wd(s.constraints,t,Dd(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=>wd(s.constraints,e,Dd(r,a)))}))}),e.argParams.forEach(e=>{let t=xd(e),n=a(t.operator)?.operator;n&&wd(s.constraints,t.param,Dd(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Td(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>Td(s.argConstraints,yd(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&Td(s.argConstraints,yd(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=xd(e),n=a(t.operator);n&&Td(s.argConstraints,yd(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(xd(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=xd(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(bd(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(bd(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(bd(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=g(`LAMBDA`,Ud(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=Cd();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=Hd(n,Ud(a));return i(e,o(t,s),r.map(e=>m(e,n)),a)},l=(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 Wd(`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 Wd(`Action used where only temporal formula or state predicate allowed`,e.location);Gd.has(e.operator)&&u(t,e.location)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Kd(n)&&n.kind!==r)throw Wd(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e.location)},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)=>wd(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Td(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Cd();case`Identifier`:return l(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return d(e,r),l(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.location),i(jd,n)}case`Prime`:case`Unchanged`:return s(Id,[e.expression],t);case`Enabled`:return s(Ld,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(Rd,[n])}case`If`:return s(jd,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(jd,[...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(jd,[e.body],t,e.bounds.map(e=>e.set),Wr(e.bounds));if(n.level===3&&e.bounds.some(e=>m(e.set,t).level===2))throw Wd(`Action-level bound of quantified temporal formula`,e.location);return n}case`UnboundedQuantifier`:return s(e.isTemporal?Vd:jd,[e.body],t,[],e.names);case`Choose`:return s(Md,[e.body],t,e.set?[e.set]:[],Ur(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(Ad,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(Ad,[e.predicate],t,[e.bound.set],Ur(e.bound.pattern));case`SetMap`:return s(Ad,[e.expression],t,e.bounds.map(e=>e.set),Wr(e.bounds));case`FunctionConstruction`:return s(Nd,[e.body],t,e.bounds.map(e=>e.set),Wr(e.bounds));case`Record`:return s(Nd,e.fields.map(e=>e.value),t);case`RecordSet`:return s(Ad,e.fields.map(e=>e.value),t);case`Except`:return s(Ad,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(Pd,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(Ad,e.args,t)}]);case`FieldAccess`:return i(Fd,[a(e.record,t),{data:Cd()}]);case`BoxAction`:case`AngleAction`:return s(zd,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(Bd,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Cd()}},h=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>h(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 Un(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,Hd(t,Ud(e.names))),i;default:return ki(e,(e,n)=>(a(e,r,Hd(t,Ud(n))),e)),i}},g=(e,t,n,r)=>{let i=Hd(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=h(n,i),c={...Cd(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(yd(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(bd(e.name,n,t.name))).map(e=>Sd(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(xd(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=xd(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,{...Cd(),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}},Jd=(e,t,n)=>{let r=new Map(t);e.assumptions.forEach(e=>{e.kind===`NewSymbol`?(e.set&&n.analyze(e.set,r),r.set(e.name,{kind:`Formal`,arity:e.arity})):e.kind===`AssumeProve`?Jd(e,r,n):n.analyze(e,r)}),n.analyze(e.conclusion,r)},Yd=(e,t)=>{let n=qd(t);e.definitions.filter(e=>!e.name.includes(`!`)).forEach(e=>n.analyzeDefinition(e,/* @__PURE__ */ new Map)),e.assumptions.forEach(e=>n.analyze(e.expression,/* @__PURE__ */ new Map)),e.theorems.forEach(e=>e.statement.kind===`AssumeProve`?Jd(e.statement,/* @__PURE__ */ new Map,n):n.analyze(e.statement,/* @__PURE__ */ new Map))},Xd=(e,t)=>e.maxLevels[t]??3,Zd=(e,t)=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=qd({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(e,a),a},i=/* @__PURE__ */ new Map,a=e=>{let n=i.get(e);if(n)return n;let a=t(e),o=r(e),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>wd(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>wd(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Td(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=xd(e);t(n.operator,n.param)&&c.argParams.add(e)})};return s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n))),a.assumptions.forEach(e=>l(o.analyze(e,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c},o=/* @__PURE__ */ new Set;if(e.forEach(e=>{let n=`at line ${e.location.line}, column ${e.location.column}`,i=e=>o.add(`${e} ${n}`),s=t(e.module),c=a(e.module),l=r(e.instancer),u=/* @__PURE__ */ new Map;e.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(t=>{let n=e.substitutions.get(t.name);if(!n)return[];if(t.arity===0){let e=l.analyze(n,u);return[{...t,level:e.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u);return[{...t,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),f=(t,n)=>`Level error in instantiating module '${e.module}': the level of the expression or operator substituted for '${t}' must be at most ${n}`;d.forEach(t=>{!c.isConstant&&t.level>t.maximumLevel&&i(f(t.name,t.maximumLevel)),t.isLeibniz||i(`Error in instantiating module '${e.module}': a non-Leibniz operator substituted for '${t.name}'`)}),d.forEach(t=>{let n=c.constraints.get(t.name);n!==void 0&&t.level>n&&i(f(t.name,n));let r=t.operator;r&&Array.from({length:t.arity},(n,a)=>{let o=c.argConstraints.get(yd(t.name,a));o!==void 0&&Xd(r,a)<o&&i(`Level error in instantiating module '${e.module}': the level of the argument ${a+1} of the operator ${r.name} must be at least ${o}`)})}),c.argParams.forEach(t=>{let n=xd(t),r=d.find(e=>e.name===n.operator)?.operator,a=d.find(e=>e.name===n.param);if(!r||!a)return;let o=Xd(r,n.index);a.level>o&&i(`Level error when instantiating module '${e.module}': the level of the argument ${n.index} of the operator ${n.operator}' must be at most ${o}`)})}),o.size>0)throw new c([...o].join(`
|
|
410
|
-
`))},Qd=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],$d=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),ef=new Map(Eu.flatMap(e=>e.map(t=>[t,e[0]]))),tf=e=>ef.get(e)??e,nf=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},rf=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(nf(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},af=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),of=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:tf(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:tf(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},sf=(e,t)=>{let n=[];for(let r=t;;){let t=of(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},cf=e=>({line:e.line,column:e.column}),lf=(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(a.text===`EXTENDS`){let n=sf(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},uf=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,df={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},ff=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&uf(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&uf(e[n+1],e[n+2])?n+=uf(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=>df[e])}"`:r.text)}return t},pf=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},mf=(e,t)=>e.find(e=>e.name===t)??e.map(e=>mf(e.modules,t)).find(Boolean),hf=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:Au.get(i)??t?.(i)??Sc(e,i),s=o===void 0?[]:se(o),c=pf(s),l=c.get(s[2]?.text??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=wc(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>mf(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},gf=(e,t,n)=>{let r=hf(e,t),i=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=sf(t,e+1);r.push({location:cf(t[e]),apply:e=>i.forEach(t=>e.put(af(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,o)=>{let l=e.start+o,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:cf(u),apply:t=>t.put(af(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&a(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&a(l,`variable`),u.text===`RECURSIVE`&&sf(t,l+1).every(e=>s.has(e))&&a(l,`definition`),$d.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(cf(u)),r.push({location:cf(u),apply:e=>e.put(af(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(af(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=tf(e.name);r.push({location:e.location,apply:n=>n.put(af(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=o(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),a=n.filter(e=>e.kind===`theorem`);[...i,...a].forEach(n=>{n.isLocal||t.put(af(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(af(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>Lr(e.location,t.location)?-1:+!!Lr(t.location,e.location))},a=/* @__PURE__ */ new Map,o=e=>{let t=a.get(e??``);if(t)return t;let n=rf();a.set(e??``,n),Tu.toReversed().forEach(e=>n.put(af(e,`builtin`,!1)));let s=r(e);return s.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||n.put(e)})),i(s).forEach(e=>e.apply(n)),n};return o(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse()},_f=(e,t,n)=>{let r=hf(e,n),i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};t.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),Du.forEach(a);let s=e=>{let t=r(e);return t.tokens.slice(t.start,t.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=lf(s(e),e,c);return l.set(e,n),n},d=e=>c.get(e)??u(e),f=/* @__PURE__ */ new Set,p=(e,t)=>c.has(t)||f.has(`${e.key}>${t}`),m=(e,t,n)=>{let r=[...e.extends.map(d),...e.instances.filter(t=>p(e,t)).map(d),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},h=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!p(n,e));return i===void 0?m(n,r,t):[n,i]};return t},g=h(e=>e.extends),_=h(e=>e.instances),v=/* @__PURE__ */ new Set([void 0]),y=/* @__PURE__ */ new Map;ff(s(void 0)).forEach((e,t)=>{t===3&&ku.forEach(a),a(e)});let ee=u(void 0);for(;;){let e=g(ee,/* @__PURE__ */ new Set)??_(ee,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;f.add(`${t.key}>${n}`),y.set(t.unit,[...y.get(t.unit)??[],n]),!v.has(n)&&(v.add(n),ff(s(n)).forEach(a))}Qd.forEach(a);let b=/* @__PURE__ */ new Set,x=e=>{if(b.has(e))return;b.add(e);let t=y.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(x),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return x(void 0),Ou.forEach(a),[...i]},vf=t=>{switch(t.kind){case`Number`:try{return he(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Fe(t.name);case`Set`:return pt(t.elements.map(vf))}},yf=e=>[...e.constants,...e.variables.map(e=>({name:e,arity:0}))],bf=e=>new c(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),xf=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:Nr},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),Sf=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>U(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 u(`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`)&&Re(t,r)})});if(t)return t[1];throw new u(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:U(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},Cf=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||Un(e).some(e=>Cf(e,t)),wf=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Ri(e),n.get(e)??n.size)),n},Tf=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Ef=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw to(e);if(e.kind===`Number`&&!Go(e.value))throw no(e);Ef(e.kind===`Let`?[...Un(e),...Tf(e.instances??[])]:Un(e))}),Df=(e,t)=>{let n=wc(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=new Map(zu.map(e=>[e.name,e])),s=/* @__PURE__ */ new Map,f=al(e.checkDeadlock,t.seed),p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,h=[],g=/* @__PURE__ */ new Map,_=[],v=[],y=(e,t)=>_.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ee={value:0},b=e=>`${e}#${ee.value++}`,x=[],te=/* @__PURE__ */ new Map,ne=e=>{let n=s.get(e);if(n)return n;let r=$u(e,t.print,f,t.files);if(!r)return;let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>ne(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(e=>{o.set(e.name,e),i.set(e.name,{key:e.name,arity:e.arity})}),s.set(e,i),i},re=e=>{let t=ne(e);return t&&y(e,Qu.get(e)??[]),t},S=e=>(Ef([...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]),...Tf(e.instances)]),e.modules.forEach(S),e);S(n);let ie=(e,n)=>{let r=t.loadModule?.(e)??Gs.get(e)??Sc(t.source,e);if(r===void 0)throw new c(`Cannot find source file for module ${e} imported in module ${n}.`);let i=wc(r);if(i.name!==e)throw new c(`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`);return S(i)},ae=e=>{let t=v.indexOf(e.name);if(t!==-1)throw new c(`Circular dependency among .tla files; dependency cycle is: ${[...v.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[];v.push(e.name),_.push(n);let i=O(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r});_.pop(),v.pop();let a=r.find(e=>n.has(e.name));if(a)throw bf(a);return{linked:i,closure:n}},oe=(e,t)=>{let n=p.get(e);if(n)return y(e,g.get(e)??[]),n;let r=ae(ie(e,t));return p.set(e,r.linked),g.set(e,r.closure),y(e,r.closure),r.linked},C=(e,t,n,o,s)=>{let c=s?void 0:re(e.module);if(c)return e.name===void 0?c:new Map([...c].map(([t,n])=>[`${e.name}!${t}`,n]));let l=s??oe(e.module,t.name),u=yf(l),d=`#${ee.value++}`,f=new Map(e.params.map(e=>[e.name,`${e.name}${d}`])),p=yi(gd(e,t),u,t,n);x.push({module:e.module,instancer:t.name,lets:[],substitutions:p,location:e.location});let m=Xi({params:e.params.map(e=>({...e,name:`${e.name}${d}`})),substitutions:new Map([...p].map(([e,t])=>[e,Ci(t,f)])),variables:new Set(l.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,s,c)=>{let l=b(`${s}@${t.name}`);return r.set(l,c(l)),i.set(l,!o),a.set(l,{source:n,prefix:e.params.length}),l},createName:b}),h=new Set(u.map(e=>e.name)),g=/* @__PURE__ */ new Map;return l.exported.forEach((t,n)=>{if(h.has(n))return;if(e.name===void 0){let r=m.getKey(t.key);u.length>0&&te.set(r,{name:n,location:e.location}),g.set(n,{key:r,arity:t.arity});return}let r=m.getQualifiedKey(t.key);u.length>0&&te.set(r,{name:`${e.name}!${n}`,location:e.location}),g.set(`${e.name}!${n}`,{key:r,arity:t.arity+e.params.length})}),g},w=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:Nr})),se=(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:w(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),T=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),E=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=T(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:w(r,n),location:n}}},D=(e,t,n,a)=>{let o=e.location,s=a?void 0:re(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=T(n.arity);return se(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??oe(e.module,n),l=`#${ee.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=yf(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};x.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>Cf(f(e),p),h=d.map(t=>{let n=E(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),g=[],_=Xi({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:w(e.params,o),location:o,resolution:Nr}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:Nr}])),variables:new Set(c.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.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}:xf(a,i)),i},createName:b}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),i=T(n.arity),a=[...e.params,...i];return se(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...y]},ce=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),O=(e,a)=>{let o=$s(e,t.loadClass?.(e.name)),s=new Map([...zu.map(e=>[e.name,{key:e.name,arity:e.arity}]),...a.symbols]),c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=[],d=[...o.constants],f=o.variables.map(e=>e.name),p=o.variables.map(e=>e.location),g=(e,t)=>e.forEach((e,n)=>{s.set(n,e),t&&c.set(n,e)});o.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:re(e);if(n){g(n,!0);return}let r=t??oe(e,o.name);d.push(...r.constants.filter(e=>d.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{f.includes(e)||(f.push(e),p.push(r.variableLocations[t]))}),g(r.exported,!0),r.modules.forEach((e,t)=>l.set(t,e)),u.push(r)}),o.constants.forEach(e=>c.set(e.name,{key:e.name,arity:e.arity,declaration:`Constant`})),o.variables.forEach(e=>c.set(e.name,{key:e.name,arity:0,declaration:`Variable`}));let _=d.length===0&&f.length===0,v=e=>o===n?e.name:`${e.name}@${a.id}`,y=/* @__PURE__ */ new Map,ee=e=>({imported:s,importedAt:y,definitions:new Map(e.definitions.map(e=>[e.name,e])),getKey:v}),b=()=>new Map([...a.modules,...l]),x=e=>new Map([...s,...[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))].filter(t=>Lr(t.location,e)).map(e=>[e.name,{key:e.name,arity:e.arity,declaration:e.kind}]),...o.definitions.filter(t=>Lr(t.location,e)).map(e=>[e.name,{key:v(e),arity:Rr(e)}])]),te=e=>{let t=b();if(t.has(e.name))throw bf(e);a.nested.push(e);let n=O(e,{id:`${a.id}/${e.name}`,symbols:x(e.location),modules:t,nested:a.nested});l.set(e.name,n),m.has(e.name)||m.set(e.name,n)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=C(e,o,ee(o),_,b().get(e.module));t.forEach((t,n)=>{s.has(n)||y.set(n,e.location)}),g(t,!e.isLocal)}})),...o.modules.map(e=>({location:e.location,link:()=>te(e)}))].sort((e,t)=>Lr(e.location,t.location)?-1:1).forEach(e=>e.link()),_i(o,ee(o));let ne=e=>{let t=o.instances.find(t=>t.module===e.name);return t!==void 0&&Lr(e.location,t.location)},S=e=>{let t=o.modules.find(t=>t.name===e.module);return t?ne(t)?l.get(t.name):void 0:b().get(e.module)},ie=_d(ea(o,(e,t)=>D(e,t,o.name,S(e))),ce(s));bi(ie,ee(ie)),ie.definitions.forEach(e=>{let t=v(e);r.set(t,e),i.set(t,!_);let n={key:t,arity:Rr(e)};s.set(e.name,n),e.isLocal||c.set(e.name,n)}),Yd(ie,{constants:new Set(d.map(e=>e.name)),variables:new Set(f),getDefinition:e=>r.get(s.get(e)?.key??e)});let ae={module:ie,constants:d,variables:f,variableLocations:p,visible:s,exported:c,modules:l,extended:u};return h.push(ae),ae},k=ae(n).linked,le=e=>k.visible.get(e)?.key??e;k.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let ue=[],de=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>de(e,t)),ue.push(...e.module.assumptions))};de(k,/* @__PURE__ */ new Set);let fe=k.constants.map(e=>e.name),A=k.variables,pe=e=>e.module===void 0?[e.name,le(e.name)]:e.module===n.name||fe.includes(e.name)?[]:[(p.get(e.module)??m.get(e.module))?.visible.get(e.name)?.key??e.name],j=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:k.constants.find(t=>t.name===e)?.arity??0},M=/* @__PURE__ */ new Map,me=/* @__PURE__ */ new Set,he=(e,t)=>{o.set(e,t),r.delete(e),M.delete(e),me.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=vf(e.value);pe(e).forEach(e=>{let n=j(e);n===0?M.set(e,t):he(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let ge=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=ge.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new l(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(vf),vf(e.value)]),ge.set(t,n)}),ge.forEach(e=>pe(e).forEach(t=>he(t,Sf(e.name,j(t)||e.rows[0][0].length,e.rows))));let _e=new Map(e.substitutions.flatMap(e=>pe(e).map(t=>[t,le(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!fe.includes(n)&&!k.visible.has(n))throw new l(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new l(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let a=le(i),s=r.get(a);if(!(s!==void 0||o.has(a)||M.has(a)||fe.includes(i)||A.includes(i)))throw new l(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(s?.kind===`Operator`&&s.params.length!==(k.constants.find(e=>e.name===n)?.arity??k.visible.get(n)?.arity))throw new l(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let ve=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(pe)),ye=(e,t)=>{if(ve.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&ye(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=ye(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=se(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),k.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})});let be=fe.filter(e=>!M.has(e)&&!_e.has(e)&&!me.has(e));if(be.length>0)throw new l(`The constant parameter ${gf(t.source,t.loadModule,`constant`).find(e=>be.includes(e))??be[0]} is not assigned a value by the configuration file.`);let xe={runtime:f,definitions:r,builtins:o,constants:M,substitutions:_e,variables:A,variableIndex:wf(A,h.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,evaluators:/* @__PURE__ */ new WeakMap};Zd(x,e=>{let t=p.get(e)??m.get(e)??k;return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),getDefinition:e=>r.get(t.visible.get(e)?.key??e)}});let Se=qd({constants:new Set(M.keys()),variables:/* @__PURE__ */ new Set([...A,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>o.has(e))]),getDefinition:e=>co(e,xe)}),Ce=e=>{try{X(e,{environment:xe,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof u)return e;throw e}};return _e.forEach((e,t)=>{let n=r.get(e),i=fe.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Se.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Ce(n.body):void 0;if(i)throw new l(`The configuration file substitutes constant ${t} with non-constant ${e}${i instanceof d?``:` - specifically: ${i.message}`}`)}),f.isStarted=!0,{environment:xe,assumptions:ue,variableLocations:k.variableLocations,instanceActions:te}},Of={kind:`Boolean`,value:!0},kf={kind:`Boolean`,value:!1},Af=e=>e?Of:kf,jf=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,Mf=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,Q=(e,t)=>({kind:e,body:t}),Nf=(e,t,n)=>({kind:e,operands:[t,n]}),Pf=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?Pf(e,t.operands).operands:[t])}),Ff=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return Ff(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,Ff(t)),0)}},If=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 If(e.body);case`And`:case`Or`:return e.operands.some(If)}},Lf=/* @__PURE__ */ new WeakMap,Rf={count:0},zf=e=>{let t=Lf.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`#${Rf.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(zf).join(`,`)})`;default:return`${e.kind}(${zf(e.body)})`}})();return Lf.set(e,n),n},Bf=(e,t)=>e===t||zf(e)===zf(t),Vf=(e,t)=>{let n=zf(t);return e.some(e=>e===t||zf(e)===n)},Hf=e=>e===`And`?`Or`:`And`,Uf=(e,t)=>{switch(e.kind){case`Boolean`:return t?Af(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?Q(`Not`,e):e;case`Not`:return Uf(e.body,!t);case`And`:case`Or`:return Pf(t?Hf(e.kind):e.kind,e.operands.map(e=>Uf(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return Q(n,Uf(e.body,t))}}},Wf=e=>{switch(e.kind){case`Boolean`:return Af(!e.value);case`Not`:return e.body;case`And`:case`Or`:return Pf(Hf(e.kind),e.operands.map(Wf));case`Always`:return Q(`Eventually`,Wf(e.body));case`Eventually`:return Q(`Always`,Wf(e.body));default:return Q(`Not`,e)}},Gf=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Gf(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return Af(t)}return n.length===0?Af(!t):n.length===1?n[0]:Pf(e.kind,n)}case`Not`:{let t=Gf(e.body);return t.kind===`Boolean`?Af(!t.value):Q(`Not`,t)}case`Always`:case`Eventually`:{let t=Gf(e.body);return Q(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Kf=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,qf=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=qf(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new u(`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=>Pf(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=qf(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Kf(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:Pf(`Or`,t);n.push(Q(`Always`,Q(`Eventually`,e)))}return Pf(`Or`,n)}case`Not`:return jf(e.body)?e:qf(Wf(e.body));default:return e}},Jf=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Jf(e.operands[0]):Pf(e.kind,e.operands.map(Jf));case`Not`:return e.body.kind===`Not`?Jf(e.body.body):Q(`Not`,Jf(e.body));case`Always`:case`Eventually`:case`Next`:return Q(e.kind,Jf(e.body));default:return e}},Yf=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Yf(e.operands[0]);let t=Math.floor(e.operands.length/2);return Nf(e.kind,Yf(Pf(e.kind,e.operands.slice(0,t))),Yf(Pf(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return Q(e.kind,Yf(e.body));default:return e}},Xf=(e,t)=>{e.kind===`Eventually`&&!Vf(t,e)&&t.push(e),`body`in e&&Xf(e.body,t),`operands`in e&&e.operands.forEach(e=>Xf(e,t))},Zf=e=>{let t=e.filter(Mf),n=e.flatMap(e=>e.kind===`Not`&&Mf(e.body)?[e.body]:[]);return!t.some(e=>Vf(n,e))},Qf=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,Q(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new u(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},$f=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:Q(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},ep=(e,t,n)=>e.flatMap(e=>{let r=$f(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),tp=e=>[...new Set(e.map(zf))].sort().join(`|`),np=(e,t)=>{let n=new Set(t.map(tp));return[...e.filter(e=>!n.has(tp(e))),...t]},rp=e=>{let t=Qf(e),n=ep(t,`Always`,`And`),r=ep(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=$f(t,`Eventually`,`Or`);if(n&&!(Vf(e,n.first)||Vf(e,n.second)))return np(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Vf(e,t.first)||Vf(e,t.second))&&!Vf(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Zf(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=$f(t[e],`Always`,`And`);n&&(Vf(t,n.first)||t.push(n.first),Vf(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)Vf(t,e.first)&&Vf(t,e.second)&&!Vf(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Zf(t)?[]:i(t)};return a(e)},ip=e=>({particle:e,successors:[],statePredicates:e.filter(e=>Ff(e)<=1)}),ap=e=>{let t=rp([e]).map(ip),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=tp(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 rp(n)){let n=tp(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(ip(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},op=(e,t)=>!Vf(e,t)||Vf(e,t.body),sp=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&Ff(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Kf(e);if(n){let e=Ff(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(If(e))throw new u(`TLC cannot handle the temporal formula: actions may only appear as []<>A or <>[]A`);t.formulas.push(e)},cp=(e,t)=>{let n=e.findIndex(e=>Bf(e,t));return n===-1?(e.push(t),e.length-1):n},lp=e=>{let t=qf(Gf(Uf(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Jf(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])sp(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:Pf(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Bf(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Yf(e.formula),n=[];t&&Xf(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>cp(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>cp(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>cp(i,e))}));return{tableau:t&&ap(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},up=/* @__PURE__ */ new Set([`~>`,`-+->`]),dp=/* @__PURE__ */ new WeakMap,fp=/* @__PURE__ */ new WeakSet,pp=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),mp=e=>new u(`TLC cannot handle the temporal formula at ${Ga(e)}`),$=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=ro(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return $(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?$(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=co(e,n);if(t)return hp(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?+!!r.isStateLevel:void 0},o=(e,t)=>r.has(e)?0:W(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return ki(e,(e,a)=>(i.value=Math.max(i.value,$(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 up.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},hp=(e,t)=>{let n=dp.get(e);if(n!==void 0)return n;dp.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max($(e.body,void 0,t),...r.map(e=>$(e.set,void 0,t)));return dp.set(e,i),i},gp=`Temporal formula is a tautology (its negation is unsatisfiable).`,_p=(t,r,i,a,o=``,s=/* @__PURE__ */ new Set)=>{let c=(e,t,n=o,r=s)=>_p(e,t,i,a,n,r);if(t.kind===`And`)return t.operands.flatMap(e=>c(e,r,qa(e)));if(t.kind===`Label`)return c(t.body,r);if(t.kind===`Let`)return c(t.body,vp(t,r,i));if(t.kind===`Identifier`){let e=W(t)?ro(r,t.name):void 0;if(e?.kind===`Thunk`)return c(e.expression,e.scope);let n=i.constants.has(t.name)?void 0:co(t.name,i);if(!e&&n?.kind===`Operator`&&n.params.length===0&&hp(n,i)>0){if(s.has(n))throw new l(`The definition of ${t.name} refers to itself`);return c(n.body,void 0,t.name,/* @__PURE__ */ new Set([...s,n]))}}let d=pp(i,r);if(t.kind===`Apply`&&(e=>a||$(e,r,i)===3)(t)){let e=ko(t,d),n=W(t)?void 0:co(t.operator,i);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive)return c(e.body,Vo(e,t.args,d),t.operator)}if(a&&t.kind===`Forall`&&t.bounds.every(e=>$(e.set,r,i)===0)){let r=[],i={count:0};if(mo(t.bounds,d,e=>(i.count++,r.push(...c(t.body,e,qa(t.body))),!1)),i.count===0)throw n(new u(gp),e.livenessEvaluationFailure);return r}return[{expression:t,scope:r,name:o}]},vp=(e,t,n)=>{let r=Uo(e.definitions,pp(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&fp.add(e.binding);return r},yp=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),bp=(e,t,n)=>{let r=(e,t,r)=>{let i=r===0?$(e,t,n):r;if(i===0){let r=X(e,pp(n,t));if(typeof r!=`boolean`)throw new u(`TLC expected a boolean in the temporal formula at ${Ga(e)}`);return Af(r)}return i===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},i={depth:0},a=(e,t,n,a)=>{if(i.depth>=100)throw new u(`TLC overflowed the stack while expanding the temporal formula at ${Ga(n)}`);i.depth++;let o=c(e,t);i.depth--;let s=Ff(o);return s>2?o:r(n,a,s)},o=(e,t)=>{let r=e.kind===`Identifier`?e.name:e.operator,i=pp(n,t),o=W(e)||co(r,n)===void 0?ro(t,r):void 0;if(o?.kind===`Thunk`&&fp.has(o))return a(o.expression,o.scope,e,t);let s=o?.kind===`Operator`?o.operator:o?void 0:W(e)?Ao(r,i):Do(r,n);if(s?.kind!==`Closure`)throw mp(e);let c=e.kind===`Apply`?e.args:[];return a(s.body,Vo(s,c,i),e,t)},s=(e,t)=>{if(!e.bounds.every(e=>$(e.set,t,n)===0))throw mp(e);let i=[];mo(e.bounds,pp(n,t),t=>(i.push(c(e.body,t)),!1));let a=e.kind===`Forall`;if(i.length===0)return Af(a);let o=Pf(a?`And`:`Or`,i),s=Ff(o);return s>2?o:r(e,t,s)},c=(e,t)=>{let i=$(e,t,n);if(i<=2)return r(e,t,i);switch(e.kind){case`Label`:return c(e.body,t);case`Let`:return c(e.body,vp(e,t,n));case`Identifier`:return o(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?Q(`Always`,Nf(`Or`,Q(`Not`,c(n[0],t)),Q(`Eventually`,c(n[1],t)))):e.operator===`~`&&!W(e)?Q(`Not`,c(n[0],t)):e.operator===`=>`?Nf(`Or`,Q(`Not`,c(n[0],t)),c(n[1],t)):o(e,t)}case`And`:case`Or`:return Pf(e.kind,e.operands.map(e=>c(e,t)));case`Forall`:case`Exists`:return s(e,t);case`If`:{if($(e.condition,t,n)===0){let r=X(e.condition,pp(n,t));if(typeof r==`boolean`)return c(r?e.consequent:e.alternative,t)}let r=c(e.condition,t);return Nf(`Or`,Nf(`And`,r,c(e.consequent,t)),Nf(`And`,Q(`Not`,r),c(e.alternative,t)))}case`Always`:case`Eventually`:return Q(e.kind,c(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=yp(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=Q(`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`?Q(`Always`,Q(`Eventually`,Nf(`Or`,i,a))):Nf(`Or`,Q(`Eventually`,Q(`Always`,i)),Q(`Always`,Q(`Eventually`,a)))}default:throw mp(e)}};return c(e,t)},xp=(e,t,n,r,i)=>{let a=e=>xp(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`?so(X(e.expression,a),`a temporal property predicate`):Ba(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&&so(X(e.unchanged,a),`a subscript`)?!1:so(X(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 xp(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new u(`TLC cannot evaluate a temporal formula in a single step`)}},Sp=(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)=>Sp(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 xp(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Cp=(e,t)=>e.every((e,n)=>Be(e,t[n])),wp=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Tp=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.pending.push(void 0),e.offsets.push(-1),e.edgeOffsets.push(-1),e.nodeStates.length-1),Ep=(e,t,n)=>{let r=e.slots.length/3-1,i=Math.imul(Math.imul(t,2654435761)^n,2246822507)>>>e.shift;for(let a=i;;a=a+1&r){let r=a*3,i=e.slots[r];if(i===0||i===t+1&&e.slots[r+1]===n)return r}},Dp=(e,t)=>e.offsets[t]!==-1,Op=(e,t)=>e.pending[t]??=[],kp=(e,t)=>{let n=e.edgeOffsets[t];return e.edges.ids.subarray(n+1,n+1+e.edges.ids[n])},Ap=(e,t,n)=>e.results.bytes[e.offsets[t]+n]===1,jp=2**53-1,Mp=(t,r,i,a)=>{if(t.length===0)return;let o=r.map(e=>bp(e.expression,e.scope,i)),s=t.map(e=>Q(`Not`,bp(e.expression,e.scope,i))),c=s.length===1?s[0]:Pf(`Or`,s),l=o.length===0?c:Pf(`And`,[...o,c]),d=lp(l);if(d.length===0)throw n(new u(gp),e.livenessEvaluationFailure);let f=/* @__PURE__ */ new Map,p=d.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=zf(e),n=f.get(t)??f.size;return f.set(t,n),n}),nodeStates:[],nodeTableaux:[],pending:[],offsets:[],results:{bytes:/* @__PURE__ */ new Uint8Array(1024),length:0},edgeOffsets:[],edges:{ids:/* @__PURE__ */ new Int32Array(1024),length:0},initial:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],errorNode:void 0})),m={multiplier:1},h=!ts(i),g={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},_=e=>{let t=g.states.get(e)??/* @__PURE__ */ new Map;return g.states.set(e,t),t},v=(e,t)=>{i.runtime.setLivenessSource(e);let n=t();return i.runtime.setLivenessSource(void 0),n},y=(e,t)=>xp(e,t,void 0,i,h?_(t):/* @__PURE__ */ new Map),ee=(e,t,n)=>v(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!y(e,n))),b=(e,t,n,r)=>v(t,()=>{let t=e.solution.actionChecks;if(!h)return Uint8Array.from(t,e=>+!!xp(e,n,r,i,/* @__PURE__ */ new Map));let a=_(n),o=g.actions.get(n)??/* @__PURE__ */ new Map;g.actions.set(n,o);let s=o.get(r)??new Int8Array(f.size).fill(-1);return o.set(r,s),Uint8Array.from(e.actionIds,(e,o)=>(s[e]===-1&&(s[e]=+!!xp(t[o],n,r,i,a)),s[e]))}),x=(e,t,n,r)=>v(n,()=>e.nodes[t].statePredicates.every(e=>y(e,r))),te=(e,t)=>{let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},ne=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),re=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=Ep(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},S=(e,t,n)=>{let r=Tp(e,t,n),i=e.nodeIds;if(++i.size*2>i.slots.length/3){let e=i.slots;i.slots=new Int32Array(e.length*2),i.shift--;for(let t=0;t<e.length;t+=3)e[t]!==0&&i.slots.set(e.subarray(t,t+3),Ep(i,e[t]-1,e[t+1]))}return i.slots.set([t+1,n,r],Ep(i,t,n)),r},ie=(e,t,n)=>t.nodes.flatMap((t,r)=>re(e,n,r)??[]).sort((e,t)=>e-t),ae=(e,t,n,r)=>{let i=e.solution.actionChecks.length,a=e.results,o=a.length;if(a.length+=r.length+n.length*i,a.length>a.bytes.length){let e=new Uint8Array(Math.max(2*a.bytes.length,a.length));e.set(a.bytes),a.bytes=e}a.bytes.set(r,o),n.forEach((e,t)=>a.bytes.set(e,o+r.length+t*i)),e.offsets[t]=o;let s=e.pending[t]??[],c=e.edges,l=c.length;if(c.length+=s.length+1,c.length>c.ids.length){let e=new Int32Array(Math.max(2*c.ids.length,c.length));e.set(c.ids),c.ids=e}c.ids[l]=s.length,c.ids.set(s,l+1),e.edgeOffsets[t]=l,e.pending[t]=void 0},oe=(e,t,n)=>{let r={slots:Array.from({length:16*m.multiplier}),count:0},i=(e,t)=>{for(let n=(a.getFingerprint(t.index)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&Cp(r.state,t.state))return!1}},o=e=>{if(r.count>=r.slots.length>>1){let e=r.slots;r.slots=Array.from({length:2*e.length+1});for(let t of e)t&&i(r.slots,t)}i(r.slots,e)&&r.count++};return n.forEach(o),o({index:e,state:t}),r.slots.length>16*m.multiplier&&m.multiplier++,r.slots.filter(e=>e!==void 0)},C=(e,t,n,r,i)=>{let o=ee(e,r,n),s=t.nodes[e.nodeTableaux[i]],c=[],l=Op(e,i),u=s.successors.length>0?b(e,r,n,n):/* @__PURE__ */ new Uint8Array;for(let a of s.successors){if(!x(t,a,r,n))continue;if(te(t,a)&&e.errorNode===void 0&&ne(e)){e.errorNode=i;return}let o=re(e,r,a);if(o!==void 0&&l.includes(o))continue;let s=o??S(e,r,a);l.push(s),c.push(u),o===void 0&&C(e,t,n,r,s)}for(let i of a.getSuccessors(n)){let a=b(e,r,n,i.state),o=e.isDone[i.index]===!0;for(let n of s.successors){if(!x(t,n,r,i.state))continue;let s=re(e,i.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??S(e,i.index,n);l.push(u),c.push(a),s===void 0&&o&&C(e,t,i.state,i.index,u)}}l.length>0&&ae(e,i,c,o)},w=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>x(t,r,a,e.state)));e.isDone[a]=!0;for(let s of ie(e,t,a)){let a=Op(e,s),c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=re(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??S(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&C(e,t,n.state,n.index,d)}}),ae(e,s,c,i)}if(e.errorNode!==void 0)return wp(T(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},se=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)Tp(e,e.nodeStates.length,-1);let a=Op(e,i),o=[];t.forEach((t,r)=>{Dp(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),ae(e,i,o,r)},T=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)Dp(e,t)&&(r.push(t),n.set(t,-1));for(let i=0;i<r.length;i++){let a=r[i];for(let i of kp(e,a))if(!(i===a&&e.solution.tableau)){if(i===t){let e=[t];for(let t=a;t!==-1;t=n.get(t)??-1)e.push(t);return e}Dp(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new u(`Couldn't re-create liveness trace (path) starting at: ${t}`)},E=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=n.stateChecks.length,a=(t,n,a)=>e.results.bytes[e.offsets[t]+i+n*r+a]===1,o=(e,n)=>t.eventuallyAlways.every(t=>a(e,n,t)),s=new Float64Array(e.nodeStates.length).fill(-1),c=e.initial.filter(t=>Dp(e,t)),l=[],d=t=>{let n=kp(e,t).indexOf(t);return n!==-1&&o(t,n)},f=(t,r)=>n.tableau!==void 0&&op(n.tableau.nodes[e.nodeTableaux[t]].particle,r),p=r=>{let i=l.pop()??r;if(i===r&&!d(i)){s[i]=jp;return}let c=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Map;for(let t=i;;t=l.pop()??r){c.add(t);let n=u.get(e.nodeStates[t]);if(n?n.push(t):u.set(e.nodeStates[t],[t]),s[t]=jp,t===r)break}let p=t.infinitelyOftenStates.every(t=>[...c].some(n=>Ap(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...c].some(n=>kp(e,n).some((e,r)=>c.has(e)&&o(n,r)&&a(n,r,t)))),g=n.promises.every(e=>[...c].some(t=>f(t,e)));if(p&&h&&g)return m(r,c,u)},m=(r,i,s)=>{let c=wp(T(e,r).reverse().map(t=>e.nodeStates[t])),l=[],d=/* @__PURE__ */ new Set([r]),p=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),g=n.promises.map(()=>!1),_={count:p.length+m.length+g.length},v={node:r},y=e=>i.has(e),ee=e=>{l.push(v.node),v.node=e};for(;_.count>0;){let r=_.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!p[n]&&Ap(e,v.node,t)&&(p[n]=!0,_.count--)}),n.promises.forEach((e,t)=>{!g[t]&&f(v.node,e)&&(g[t]=!0,_.count--)}),!(_.count<=0);){let n={last:-1,unvisited:-1},i=_.count;if(kp(e,v.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!y(r)||!o(v.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&a(v.node,c,e)&&(m[t]=!0,_.count--)})}return _.count<i?(ee(r),d.clear(),!0):(y(r)&&!d.has(r)&&(n.unvisited=r),!1)}))break;if(_.count<r){ee(n.last),d.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new u(`TLC failed to build the counterexample of a liveness property`);v.node=t,n.unvisited=kp(e,t).find(e=>y(e)&&!d.has(e))??-1}ee(n.unvisited),d.add(n.unvisited)}}let b=h(r,v.node,s,o);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];b[b.length-1]!==n&&b.push(n)}let x=c[c.length-1];return b[b.length-1]===x&&b.pop(),{prefix:c.slice(0,-1),cycle:[x,...b.reverse()]}},h=(t,n,r,i)=>{if(n===t)return[];let a=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([a]),c=[];for(let n=a,l=-1,d=0;;d++){for(let u of r.get(n)??[])for(let[d,f]of kp(e,u).entries()){if(f===u||!i(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==a;)e.push(t),t=r,r=o.get(t)??-1;return e.push(a),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let f=c[d];if(f===void 0)throw new u(`TLC failed to build the counterexample of a liveness property`);n=f[0],l=f[1]}};for(let t=0;t<c.length;t++){let n=[c[t],-1,0],r={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),a=n.pop()??0;if(i===-42){if(s[a]===t){let e=p(a);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(s[a]!==-1){n.push(Math.min(t,s[a]));continue}s[a]=r.link,n.push(t,a,-42),l.push(a);let u={value:r.link++};kp(e,a).forEach((t,r)=>{Dp(e,t)&&(o(a,r)?s[t]===-1?n.push(t,-1):u.value=Math.min(u.value,s[t]):s[t]===-1&&c.push(t))}),n.push(u.value)}}};return{addInitialState:(e,t)=>{g.states.clear(),g.actions.clear();for(let n of p){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)x(r,i,void 0,t)&&n.initial.push(re(n,e,i)??S(n,e,i))}},addState:(e,t,n)=>{g.states.clear(),g.actions.clear();let r=oe(e,t,n);for(let n of p){let i=r.map(r=>b(n,e,t,r.state)),a=ee(n,e,t),o=n.solution.tableau,s=o?w(n,o,r,i,a,e):se(n,r,i,a,e);if(s)return s}},findViolation:()=>{for(let e of p)for(let t of e.solution.models){let n=E(e,t);if(n)return n}},getViolatedProperties:(e,n)=>[...new Set(t.filter((t,r)=>!Sp(s[r].body,e,n,0,i)).map(e=>e.name))]}},Np=`UnnamedAction`,Pp={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},Fp=e=>{let t=e.range??Pp;return kt([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Ip=e=>{let t=[[`name`,e.name],[`location`,Fp(e.location)]];return e.parameters.length===0?kt(t):kt([...t,[`context`,kt(e.parameters)],[`parameters`,R(e.parameters.map(e=>e[0]))]])},Lp=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),Rp=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),zp=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,Bp=e=>e.kind===`Apply`?e.args:[],Vp=(e,t,n)=>{let r=zp(e);if(r===void 0)return;if(W(e)){let e=ro(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=Do(r,n);return i?.kind===`Closure`?i:void 0},Hp=(e,t)=>{try{return X(e,Rp(t,void 0)),!0}catch(e){if(e instanceof s)return!1;throw e}},Up=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&uo(e,t)&&Hp(e.body,t),Wp=(e,t)=>{let n=co(e.name,t);return n?.body===e.body&&Up(n,t)},Gp=(e,t)=>{if(e.kind!==`Identifier`||!W(e))return;let n=ro(t,e.name);return n?.kind===`Thunk`?n:void 0},Kp=(e,t)=>(e?.params??[]).flatMap(e=>{let n=ro(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),qp=(e,t)=>{try{return e()}catch(e){if(e instanceof s)return t();throw e}},Jp=(e,t,n,r,i)=>{let a=Bp(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return!r||a.length===0?[{...e,parameters:[],expression:t,scope:n}]:a.some(e=>$(e,n,i)!==0)?o():qp(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),X(e,Rp(i,n))]),expression:t,scope:n}],o)},Yp=(e,t,n,r,i)=>{let a=()=>({name:n?.name??Np,location:e.location,parameters:Kp(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return Yp(e.body,Uo(e.definitions,Rp(r,t)),n,r,i);case`Label`:return Yp(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>Yp(e,t,n,r,i));case`Exists`:return qp(()=>{let o=[];return mo(e.bounds,Rp(r,t),t=>(o.push(...Yp(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=W(e)?void 0:i.get(zp(e)??``),s=Vp(e,t,r);if(o)return Jp(o,e,t,s,r);if(!s)return[a()];let c=Bp(e),l=()=>[{name:s.name,location:e.location,parameters:[],expression:e,scope:t}];return Wp(s,r)||c.some(e=>$(e,t,r)!==0)?l():qp(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:X(n,Rp(r,t))},parent:e}),s.scope);return Yp(s.body,e,s,r,i)},l)},Xp=(e,t,n,r,i)=>{let a=(e,t)=>Xp(e,t,n,r,i);if(e.kind===`Let`){a(e.body,Uo(e.definitions,Rp(n,t)));return}let o=Gp(e,t);if(o){a(o.expression,o.scope);return}let s=Vp(e,t,n);if(s&&Wp(s,n))return;if(s&&s.params.length===0){if($(s.body,s.scope,n)===1){r.inits.push(Lp(s.name,s.body));return}a(s.body,s.scope);return}if(s&&e.kind===`Apply`&&s.params.length===e.args.length){a(s.body,Vo(s,e.args,Rp(n,t)));return}if(e.kind===`And`){e.operands.forEach(e=>a(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t});return}r.temporals.push(Lp(Np,e));return}let c=$(e,t,n);c<=1?r.inits.push(Lp(Np,e)):c===3&&r.temporals.push(Lp(Np,e))},Zp=(e,t,n,r,i)=>{let a=(t,n)=>Zp(e,t,n,r,i);if(t.kind===`Let`){a(t.body,Uo(t.definitions,Rp(r,n)));return}let o=Gp(t,n);if(o){a(o.expression,o.scope);return}let s=Vp(t,n,r);if(s&&Wp(s,r))return;if(s&&s.params.length===Bp(t).length){a(s.body,t.kind===`Apply`?Vo(s,t.args,Rp(r,n)):s.scope);return}if(t.kind===`Forall`&&qp(()=>(mo(t.bounds,Rp(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(Lp(e,a)):$(a,n,r)<2?i.invariants.push(Lp(e,a)):i.impliedTemporals.push(Lp(e,t));return}let c=$(t,n,r);c<=1?i.impliedInits.push(Lp(e,t)):c===3&&i.impliedTemporals.push(Lp(e,t))},Qp=(e,t)=>{let n=co(e,t);return n?.kind===`Operator`&&!Up(n,t)?n:void 0},$p=e=>kt([[`name`,e.name],[`location`,Fp(e.location)]]),em=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:Qp(e.specification,t);a&&(Xp(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...Yp(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:Do(e.init,t);o?.kind===`Closure`&&r.inits.push(Lp(e.init??``,o.body));let s=e.next===void 0?void 0:Do(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Yp(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=Qp(e,t);n&&r.invariants.push(Lp(e,n.body))}),e.properties.forEach(e=>{let n=Qp(e,t);n&&Zp(e,n.body,void 0,t,r)}),r},tm=(e,t,n)=>em(e,t,n).actions,nm=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>U(e[1])).join(`,`)})`,rm=e=>`${e.name===Np?`Action`:e.name}${nm(e)} ${Ka(e.location.range??Pp)}`,im=e=>`${e.name}${nm(e)}`,am=(e,t,n,r)=>{let i=em(e,t,r),a=e=>pt(e.map(Ip)),o=e=>pt(e.flatMap(e=>{let n=Qp(e,t);return n?[$p(n)]:[]}));return kt([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,pt(t.variables.map((e,t)=>kt([[`name`,e],[`location`,Fp(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},om=`paired12`,sm=(e,t=16)=>e<=t*.75?t:sm(e,t*2),cm=(e,t)=>{let n=sm(e.length)-1,r=e=>{let r=t(e);return(r^r>>>16)&n};return e.map((e,t)=>({key:e,position:t,bucket:r(e)})).sort((e,t)=>e.bucket-t.bucket||e.position-t.position).map(e=>e.key)},lm=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),um=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),dm=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),fm=e=>dm(e).replaceAll(`
|
|
411
|
-
`,`\\n`),
|
|
412
|
+
`]]),Nu=/* @__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)`],[`TLCGet`,`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)`],[`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)`]])]]),Pu=(e,t)=>e.every(e=>tn(e,t)),Fu=ht([!1,!0]),Iu=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return bt(Iu(e,t,r),Iu(e,r,n))},Lu=[`\\cup`,`\\cap`,`\\`],Ru=e=>typeof e==`object`&&e.kind===`MixedSet`,zu=e=>e.kind===`Interval`?B(e).elements:e.elements,Bu=(e,t,n)=>{let r=zu(t);if(e!==`\\cup`){let t=e===`\\cap`;return gt(r.filter(e=>tn(e,n)===t))}if(r.length===0)return n;if(!pe(n))return{kind:`SetOperation`,operator:e,left:t,right:n};let i=B(n).elements.filter(e=>!tn(e,t));return gt([...r,...i])},Vu=[ir(`TRUE`,!0),ir(`FALSE`,!1),ir(`BOOLEAN`,Fu),ir(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),sr(`=`,pt),sr(`#`,(e,t)=>!pt(e,t)),K(`~`,1,e=>!Xn(e,0,`~`)),K(`<=>`,2,e=>Xn(e,0,`<=>`)===Xn(e,1,`<=>`)),K(`/\\`,2,e=>Xn(e,0,`/\\`)&&Xn(e,1,`/\\`)),K(`\\/`,2,e=>Xn(e,0,`\\/`)||Xn(e,1,`\\/`)),K(`=>`,2,e=>!Xn(e,0,`=>`)||Xn(e,1,`=>`)),K(`\\in`,2,e=>tn(G(e,0,`\\in`),G(e,1,`\\in`))),K(`\\notin`,2,e=>!tn(G(e,0,`\\notin`),G(e,1,`\\notin`))),K(`\\subseteq`,2,e=>{let t=Zn(e,0,`\\subseteq`),n=Zn(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&z(t.base)?Pu(B(t.base).elements,n.base):Pu(B(t).elements,n)}),...Lu.map(e=>K(e,2,t=>{let n=Zn(t,0,e),r=Zn(t,1,e);return pe(n)&&pe(r)&&!Ru(n)&&!Ru(r)?e===`\\cup`&&V(n)?r:(e===`\\cup`?bt:e===`\\cap`?yt:vt)(B(n),B(r)):pe(n)?Bu(e,n,r):e!==`\\`&&pe(r)?Bu(e,r,n):{kind:`SetOperation`,operator:e,left:n,right:r}})),K(`SUBSET`,1,e=>({kind:`Subset`,base:Zn(e,0,`SUBSET`)})),K(`UNION`,1,e=>{let t=Zn(e,0,`UNION`),n=tt(t)?t.elements.filter(tt):[];if(!tt(t)||n.length!==t.elements.length)return{kind:`Union`,base:t};if(Ru(t)||n.some(Ru)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{tn(t,e)||e.elements.push(t)})),gt(e.elements)}return n.length===0?_t:Iu(n.map(B),0,n.length)}),K(`DOMAIN`,1,e=>{let t=G(e,0,`DOMAIN`);if(!N(t))throw new f(`DOMAIN expects a function but received ${U(t)}`);return gn(t)})],Hu=vr(`DotDot`,`IntervalValue`,2),Uu=vr(`Neg`,`IntValue`,1),Wu=[ir(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),yr(`+`,`Plus`,(e,t)=>e+t),yr(`-`,`Minus`,(e,t)=>e-t),yr(`*`,`Times`,(e,t)=>e*t),yr(`^`,`Expt`,(e,t)=>{if(t<0)throw new p(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new p(`0^0 is undefined.`);return e**t}),yr(`\\div`,`Divide`,(e,t)=>{if(t===0)throw new p(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if(cr(n))throw lr(`${e} \\div ${t}`);return n}),yr(`%`,`Mod`,(e,t)=>{if(t<=0)throw new p(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),xr(`<`,(e,t)=>e<t),xr(`>`,(e,t)=>e>t),xr(`<=`,(e,t)=>e<=t),xr(`>=`,(e,t)=>e>=t),K(`..`,2,e=>({kind:`Interval`,low:_r(G(e,0,`..`),Hu),high:_r(G(e,1,`..`),Hu)}))],Gu=[ir(`Int`,{kind:`InfiniteSet`,name:`Int`}),K(`-.`,1,e=>{let t=_r(G(e,0,`-`),Uu);if(cr(-t))throw lr(`-${t}`);return-t})],Ku=(e,t,n)=>{let r=G(e,t,n),i=Qt(r);if(!i)throw new p(`${n}\n${U(r)}`);return i},qu=(e,t,n)=>{let r=G(e,t,n);return typeof r==`string`?r:Ku(e,t,n)},Ju=(e,t,n)=>typeof e==`string`?Oe(e.slice(t,n)):R(e.slice(t,n)),Yu=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Xu=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Zu=(e,t)=>{let n=Nu.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?gr(e,t):e}):t},Qu=Zu(`Sequences`,[K(`Seq`,1,e=>({kind:`SequenceSet`,base:G(e,0,`Seq`)})),K(`Len`,1,e=>qu(e,0,Yu(``,`Len`)).length),K(`\\o`,2,e=>{let t=qu(e,0,Xu(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Ku(e,1,Xu(`t \\o s`,`sequence`));return R([...t,...n])}let n=G(e,1,`\\o`);if(typeof n!=`string`)throw new p(`${Xu(`t \\o s`,`string`)}\n${U(n)}`);return Oe(t+n)}),K(`Append`,2,e=>R([...Ku(e,0,Xu(`Append(s, v)`,`sequence`)),G(e,1,`Append`)])),K(`Head`,1,e=>{let t=Ku(e,0,Yu(``,`Head`));if(t.length===0)throw new p(`Attempted to apply Head to the empty sequence.`);return t[0]}),K(`Tail`,1,e=>{let t=qu(e,0,Yu(``,`Tail`));if(t.length===0)throw new p(`Attempted to apply Tail to the empty sequence.`);return Ju(t,1)}),K(`SubSeq`,3,e=>{let t=qu(e,0,Yu(`first `,`SubSeq`)),n=Yn(e,1,`SubSeq`),r=Yn(e,2,`SubSeq`);if(n>r)return Ju(t,0,0);let i=n<1?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new p(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${U(G(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Ju(t,n-1,r)}),ar(`SelectSeq`,2,e=>{let t=rr(e,1,`SelectSeq`);return R(Ku(e,0,Yu(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new p(`The second argument of SelectSeq should be a operator, but instead it is:\n${U(n)}`);return n}))})]),$u=Zu(`FiniteSets`,[K(`IsFiniteSet`,1,e=>{let t=G(e,0,`IsFiniteSet`);if(M(t))return Xt(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new f(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${U(t)}\nis a finite set.`:`Attempted to check if the ${me(t)} ${U(t)} is a finite set.`)}),K(`Cardinality`,1,e=>{let t=G(e,0,`Cardinality`);if(!M(t)||typeof t==`object`&&(t.kind===`InfiniteSet`||t.kind===`SequenceSet`))throw new p(`Attempted to compute cardinality of the value\n${U(t)}`);return Jt(t)})]),ed=/* @__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`]]]),td=(e,t,n,r)=>{switch(e){case`Naturals`:return{extends:[],operators:Wu};case`Integers`:return{extends:[`Naturals`],operators:Gu};case`Sequences`:return{extends:[],operators:Qu};case`FiniteSets`:return{extends:[],operators:$u};case`TLC`:return{extends:[],operators:Zu(`TLC`,Eu(t,n))};case`Randomization`:return{extends:[],operators:ru(n)};case`_Possible`:return{extends:[],operators:vu(t,n)};case`Json`:return{extends:[],operators:Zl(r)};case`Bags`:return{extends:[],operators:Al};case`TLCExt`:return{extends:[],operators:_u(t,n)};default:return}},nd=`$subexpression`,rd=(e,t)=>new u(`${e} at line ${t.line}, column ${t.column}`),id=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),ad=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,od=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}},sd=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Kr(e.bounds),body:e.body,sets:id(e.bounds)};case`SetMap`:return{names:Kr(e.bounds),body:e.expression,sets:id(e.bounds)};case`SetFilter`:return{names:Gr(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Gr(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}},cd=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return cd(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of Gn(e)){let e=cd(r,t,n);if(e)return e}},ld=(e,t,n)=>e.length===0&&n.length>0?n.splice(0,t):e,ud=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),dd=(e,t)=>{let n=e.location,r=ud(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 rd(`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 rd(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:nd,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:nd,args:e.args,location:n,resolution:Fr},location:n}},fd=(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:Fr})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Fr}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Fr};return dd({...t,params:[...t.params,...r]},a)},pd=(e,t,n,r)=>{let i={params:[],args:[],lets:[],location:n},a={index:0,current:void 0},o=i=>{let o=[],s=[];for(;a.index<e.length;){let c=e[a.index];if(c.kind!==`Name`)throw rd(`Expected an operator name`,n);o.push(c.name),s.push(...c.args);let l=o.join(`!`),u=i?i.find(e=>Oi(e)===l):t(l);if(u)return{definition:u,args:ld(s,Br(u),r)};a.index++}throw rd(`Unknown operator ${o.join(`!`)}`,n)},s=t=>{let r=o(t),s=r.definition,c=Br(s),l=a.index===e.length-1;if(r.args.length!==c&&r.args.length!==0)throw rd(`The operator ${s.name} requires ${c} arguments`,n);if(l)return{definition:s,args:r.args};if(s.kind!==`Operator`)throw rd(`Cannot select a subexpression of ${s.name}`,n);i.params.push(...s.params),i.args.push(...r.args),a.current=s.body,a.index++},c=()=>{for(;a.index<e.length;){let t=e[a.index];if(t.kind!==`Name`)return;let o=a.current&&cd(a.current,t.name,[]);if(!o)throw rd(`Cannot find label ${t.name}`,n);i.lets.push(...o.lets),i.params.push(...o.label.params.map(e=>({name:e,arity:0}))),i.args.push(...ld(t.args,o.label.params.length,r)),a.current=o.label.body,a.index++}},l=t=>{let o=a.current;if(!o)throw rd(`Subexpression selection failed`,n);if(t.kind===`Colon`)return;if(o.kind===`Label`){a.current=o.body,l(t);return}if(o.kind===`Let`){if(t.kind!==`Operand`||ad(t.operand,1)!==0)throw rd(`A LET/IN expression has only one operand`,n);i.lets.push(o.definitions),a.current=o.body;return}let s=sd(o);if(s&&(t.kind===`Bound`||t.kind===`At`)){i.params.push(...s.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&i.args.push(...ld(t.args,s.names.length,r)),a.current=s.body;return}if(o.kind===`Case`&&t.kind===`Operand`){let r=[...o.arms,...o.other?[{condition:void 0,body:o.other}]:[]],i=r[ad(t.operand,r.length)],s=e[a.index+1];if(!i||s?.kind!==`Operand`)throw rd(`A subexpression of CASE must have the form !i!j`,n);a.index++;let c=ad(s.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw rd(`Nonexistent CASE operand`,n);a.current=l;return}if(t.kind!==`Operand`)throw rd(`Unexpected subexpression selector`,n);let c=s?s.sets:od(o),u=c?.[ad(t.operand,c.length)];if(!u)throw rd(`Nonexistent operand specified by the selector`,n);a.current=u},u=s(void 0);if(u)return fd(u.definition,{...i,args:u.args});for(c();a.index<e.length;){let t=e[a.index];if(t.kind===`Name`){for(;a.current?.kind===`Label`;)a.current=a.current.body;if(a.current?.kind!==`Let`)throw rd(`A name selector here must be from a LET clause`,n);i.lets.push(a.current.definitions);let e=s(a.current.definitions);if(e)return fd(e.definition,{...i,args:[...i.args,...e.args]});c()}else l(t),a.index++}if(!a.current)throw rd(`Subexpression selection failed`,n);return dd(i,a.current)},md=(e,t)=>{if(!e.includes(`!`)||t(e))return;let n=e.split(`!`),r=n.findIndex((e,r)=>t(n.slice(0,r+1).join(`!`)));if(r!==-1)return[{kind:`Name`,name:n.slice(0,r+1).join(`!`),args:[]},...n.slice(r+1).map(e=>({kind:`Name`,name:e,args:[]}))]},hd=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Gn(e).some(hd),gd=(e,t)=>{if(!hd(e))return e;if(e.kind===`Let`){let n=n=>e.definitions.find(e=>e.name===n)??t(n);return ji(e,e=>gd(e,n))}let n=ji(e,e=>gd(e,t));if(n.kind===`Subexpression`)return pd(n.selectors,t,n.location,[]);let r=n.kind===`Identifier`?n.name:n.kind===`Apply`?n.operator:``,i=md(r,t);if(!i)return n;let a=n.kind===`Apply`?[...n.args]:[],o=pd(i,t,n.location,a);if(a.length>0)throw rd(`Too many arguments for ${r}`,n.location);return o},_d=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},vd=(e,t)=>{let n=_d(t.definitions);return{...e,substitutions:e.substitutions.map(e=>({name:e.name,expression:gd(e.expression,n)}))}},yd=(e,t)=>{let n=_d([...t,...e.definitions]);return e.definitions.some(e=>hd(e.body))||e.assumptions.some(e=>hd(e.expression))?{...e,definitions:e.definitions.map(e=>Ai(e,e=>gd(e,n))),assumptions:e.assumptions.map(e=>({...e,expression:gd(e.expression,n)}))}:e},bd=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}])),xd=(e,t)=>`${e}${t}`,Sd=(e,t,n)=>`${e}${t}${n}`,Cd=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},wd=(e,t,n)=>`${e},${t},${n}`,Td=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Ed=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Dd=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Od=(e,t,n,r)=>({...Td(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),kd=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Ad=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,jd=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,{...Od(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Md=Od(`$Set`,0,[2],[1]),Nd=Od(`$Junction`,0,[3],[1]),Pd=Od(`$Choose`,0,[2],[1]),Fd=Od(`$Function`,0,[3],[1]),Id=Od(`$FcnApply`,0,[2,2],[1,1]),Ld=Od(`$RcdSelect`,0,[2,0],[1,1]),Rd=Od(`'`,2,[1],[0]),zd=Od(`ENABLED`,1,[2],[0]),Bd=Od(`[]`,3,[3],[0]),Vd=Od(`$SquareAct`,2,[2,1],[0,0]),Hd=Od(`$WF`,3,[1,2],[0,0]),Ud=Od(`$TemporalExists`,3,[3],[0]),Wd=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Gd=e=>e.map(e=>({name:e,arity:0})),Kd=(e,t)=>new u(`${e} at line ${t.line}, column ${t.column}`),qd=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Jd=e=>e.kind!==`Let`&&e.kind!==`Label`,Yd=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)return{kind:`Defined`,levels:_(i,/* @__PURE__ */ new Map)};let a=jd.get(t)??bd.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=Td(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(Sd(e,n,t))}),t.data.constraints.forEach((e,t)=>Ed(r.constraints,t,e)),Dd(r.argConstraints,xd(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Dd(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>kd(e,n))throw new u(`Level error in applying operator ${e.name}: The level of argument ${n+1} exceeds the maximum level allowed by the operator.`)}),n.some(e=>e.level>2))throw new u(`Level error in applying operator ${e.name}: The 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(wd(t,n,r)),s=Td(Math.max(e.level,...t.filter((t,n)=>Ad(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)=>{Ad(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)=>Ed(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Ed(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Ed(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Ed(s.constraints,t,kd(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=>Ed(s.constraints,e,kd(r,a)))}))}),e.argParams.forEach(e=>{let t=Cd(e),n=a(t.operator)?.operator;n&&Ed(s.constraints,t.param,kd(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Dd(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>Dd(s.argConstraints,xd(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&Dd(s.argConstraints,xd(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=Cd(e),n=a(t.operator);n&&Dd(s.argConstraints,xd(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Cd(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=Cd(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(Sd(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(Sd(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(Sd(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=g(`LAMBDA`,Gd(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=Td();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=Wd(n,Gd(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),l=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw Kd(`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 Kd(`Action used where only temporal formula or state predicate allowed`,e.location);qd.has(e.operator)&&l(t,e.location)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Jd(n)&&n.kind!==r)throw Kd(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e.location)},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)=>Ed(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Dd(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Td();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 l(n,e.location),i(Nd,n)}case`Prime`:case`Unchanged`:return s(Rd,[e.expression],t);case`Enabled`:return s(zd,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(Bd,[n])}case`If`:return s(Nd,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(Nd,[...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(Nd,[e.body],t,e.bounds.map(e=>e.set),Kr(e.bounds));if(n.level===3&&e.bounds.some(e=>m(e.set,t).level===2))throw Kd(`Action-level bound of quantified temporal formula`,e.location);return n}case`UnboundedQuantifier`:return s(e.isTemporal?Ud:Nd,[e.body],t,[],e.names);case`Choose`:return s(Pd,[e.body],t,e.set?[e.set]:[],Gr(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(Md,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(Md,[e.predicate],t,[e.bound.set],Gr(e.bound.pattern));case`SetMap`:return s(Md,[e.expression],t,e.bounds.map(e=>e.set),Kr(e.bounds));case`FunctionConstruction`:return s(Fd,[e.body],t,e.bounds.map(e=>e.set),Kr(e.bounds));case`Record`:return s(Fd,e.fields.map(e=>e.value),t);case`RecordSet`:return s(Md,e.fields.map(e=>e.value),t);case`Except`:return s(Md,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(Id,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(Md,e.args,t)}]);case`FieldAccess`:return i(Ld,[a(e.record,t),{data:Td()}]);case`BoxAction`:case`AngleAction`:return s(Vd,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(Hd,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Td()}},h=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>h(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 Gn(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,Wd(t,Gd(e.names))),i;default:return ji(e,(e,n)=>(a(e,r,Wd(t,Gd(n))),e)),i}},g=(e,t,n,r)=>{let i=Wd(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=h(n,i),c={...Td(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(xd(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(Sd(e.name,n,t.name))).map(e=>wd(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(Cd(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Cd(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,{...Td(),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}},Xd=(e,t,n)=>{let r=new Map(t);e.assumptions.forEach(e=>{e.kind===`NewSymbol`?(e.set&&n.analyze(e.set,r),r.set(e.name,{kind:`Formal`,arity:e.arity})):e.kind===`AssumeProve`?Xd(e,r,n):n.analyze(e,r)}),n.analyze(e.conclusion,r)},Zd=(e,t)=>{let n=Yd(t);e.definitions.filter(e=>!e.name.includes(`!`)).forEach(e=>n.analyzeDefinition(e,/* @__PURE__ */ new Map)),e.assumptions.forEach(e=>n.analyze(e.expression,/* @__PURE__ */ new Map)),e.theorems.forEach(e=>e.statement.kind===`AssumeProve`?Xd(e.statement,/* @__PURE__ */ new Map,n):n.analyze(e.statement,/* @__PURE__ */ new Map))},Qd=(e,t)=>e.maxLevels[t]??3,$d=(e,t)=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=Yd({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(e,a),a},i=/* @__PURE__ */ new Map,a=e=>{let n=i.get(e);if(n)return n;let a=t(e),o=r(e),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Ed(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Ed(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Dd(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Cd(e);t(n.operator,n.param)&&c.argParams.add(e)})};return s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n))),a.assumptions.forEach(e=>l(o.analyze(e,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c},o=/* @__PURE__ */ new Set;if(e.forEach(e=>{let n=`at line ${e.location.line}, column ${e.location.column}`,i=e=>o.add(`${e} ${n}`),s=t(e.module),c=a(e.module),l=r(e.instancer),u=/* @__PURE__ */ new Map;e.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(t=>{let n=e.substitutions.get(t.name);if(!n)return[];if(t.arity===0){let e=l.analyze(n,u);return[{...t,level:e.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u);return[{...t,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),f=(t,n)=>`Level error in instantiating module '${e.module}': the level of the expression or operator substituted for '${t}' must be at most ${n}`;d.forEach(t=>{!c.isConstant&&t.level>t.maximumLevel&&i(f(t.name,t.maximumLevel)),t.isLeibniz||i(`Error in instantiating module '${e.module}': a non-Leibniz operator substituted for '${t.name}'`)}),d.forEach(t=>{let n=c.constraints.get(t.name);n!==void 0&&t.level>n&&i(f(t.name,n));let r=t.operator;r&&Array.from({length:t.arity},(n,a)=>{let o=c.argConstraints.get(xd(t.name,a));o!==void 0&&Qd(r,a)<o&&i(`Level error in instantiating module '${e.module}': the level of the argument ${a+1} of the operator ${r.name} must be at least ${o}`)})}),c.argParams.forEach(t=>{let n=Cd(t),r=d.find(e=>e.name===n.operator)?.operator,a=d.find(e=>e.name===n.param);if(!r||!a)return;let o=Qd(r,n.index);a.level>o&&i(`Level error when instantiating module '${e.module}': the level of the argument ${n.index} of the operator ${n.operator}' must be at most ${o}`)})}),o.size>0)throw new u([...o].join(`
|
|
413
|
+
`))},ef=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],tf=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),nf=new Map(Ou.flatMap(e=>e.map(t=>[t,e[0]]))),rf=e=>nf.get(e)??e,af=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},of=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(af(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},sf=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),cf=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:rf(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:rf(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},lf=(e,t)=>{let n=[];for(let r=t;;){let t=cf(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},uf=e=>({line:e.line,column:e.column}),df=(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(a.text===`EXTENDS`){let n=lf(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},ff=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,pf={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},mf=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&ff(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&ff(e[n+1],e[n+2])?n+=ff(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=>pf[e])}"`:r.text)}return t},hf=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},gf=(e,t)=>e.find(e=>e.name===t)??e.map(e=>gf(e.modules,t)).find(Boolean),_f=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:Mu.get(i)??t?.(i)??wc(e,i),s=o===void 0?[]:ae(o),c=hf(s),l=c.get(s[2]?.text??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=Ec(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>gf(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},vf=(e,t,n)=>{let r=_f(e,t),i=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=lf(t,e+1);r.push({location:uf(t[e]),apply:e=>i.forEach(t=>e.put(sf(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,o)=>{let l=e.start+o,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:uf(u),apply:t=>t.put(sf(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&a(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&a(l,`variable`),u.text===`RECURSIVE`&&lf(t,l+1).every(e=>s.has(e))&&a(l,`definition`),tf.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(uf(u)),r.push({location:uf(u),apply:e=>e.put(sf(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(sf(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=rf(e.name);r.push({location:e.location,apply:n=>n.put(sf(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=o(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),a=n.filter(e=>e.kind===`theorem`);[...i,...a].forEach(n=>{n.isLocal||t.put(sf(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(sf(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>zr(e.location,t.location)?-1:+!!zr(t.location,e.location))},a=/* @__PURE__ */ new Map,o=e=>{let t=a.get(e??``);if(t)return t;let n=of();a.set(e??``,n),Du.toReversed().forEach(e=>n.put(sf(e,`builtin`,!1)));let s=r(e);return s.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||n.put(e)})),i(s).forEach(e=>e.apply(n)),n};return o(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse()},yf=(e,t,n)=>{let r=_f(e,n),i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};t.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),ku.forEach(a);let s=e=>{let t=r(e);return t.tokens.slice(t.start,t.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=df(s(e),e,c);return l.set(e,n),n},d=e=>c.get(e)??u(e),f=/* @__PURE__ */ new Set,p=(e,t)=>c.has(t)||f.has(`${e.key}>${t}`),m=(e,t,n)=>{let r=[...e.extends.map(d),...e.instances.filter(t=>p(e,t)).map(d),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},h=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!p(n,e));return i===void 0?m(n,r,t):[n,i]};return t},g=h(e=>e.extends),_=h(e=>e.instances),v=/* @__PURE__ */ new Set([void 0]),y=/* @__PURE__ */ new Map;mf(s(void 0)).forEach((e,t)=>{t===3&&ju.forEach(a),a(e)});let b=u(void 0);for(;;){let e=g(b,/* @__PURE__ */ new Set)??_(b,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;f.add(`${t.key}>${n}`),y.set(t.unit,[...y.get(t.unit)??[],n]),!v.has(n)&&(v.add(n),mf(s(n)).forEach(a))}ef.forEach(a);let x=/* @__PURE__ */ new Set,S=e=>{if(x.has(e))return;x.add(e);let t=y.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(S),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return S(void 0),Au.forEach(a),[...i]},bf=t=>{switch(t.kind){case`Number`:try{return he(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Le(t.name);case`Set`:return ht(t.elements.map(bf))}},xf=e=>[...e.constants,...e.variables.map(e=>({name:e,arity:0}))],Sf=e=>new u(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),Cf=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:Fr},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),wf=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>U(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 f(`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`)&&Be(t,r)})});if(t)return t[1];throw new f(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:U(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},Tf=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||Gn(e).some(e=>Tf(e,t)),Ef=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Bi(e),n.get(e)??n.size)),n},Df=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Of=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw ro(e);if(e.kind===`Number`&&!qo(e.value))throw io(e);Of(e.kind===`Let`?[...Gn(e),...Df(e.instances??[])]:Gn(e))}),kf=(e,t)=>{let n=Ec(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=new Map(Vu.map(e=>[e.name,e])),s=/* @__PURE__ */ new Map,c=sl(e.checkDeadlock,t.seed),l=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,h=[],g=/* @__PURE__ */ new Map,_=[],v=[],y=(e,t)=>_.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),b={value:0},x=e=>`${e}#${b.value++}`,S=[],ee=/* @__PURE__ */ new Map,te=e=>{let n=s.get(e);if(n)return n;let r=td(e,t.print,c,t.files);if(!r)return;let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>te(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(e=>{o.set(e.name,e),i.set(e.name,{key:e.name,arity:e.arity})}),s.set(e,i),i},C=e=>{let t=te(e);return t&&y(e,ed.get(e)??[]),t},w=e=>(Of([...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]),...Df(e.instances)]),e.modules.forEach(w),e);w(n);let ne=(e,n)=>{let r=t.loadModule?.(e)??qs.get(e)??wc(t.source,e);if(r===void 0)throw new u(`Cannot find source file for module ${e} imported in module ${n}.`);let i=Ec(r);if(i.name!==e)throw new u(`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`);return w(i)},re=e=>{let t=v.indexOf(e.name);if(t!==-1)throw new u(`Circular dependency among .tla files; dependency cycle is: ${[...v.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[];v.push(e.name),_.push(n);let i=A(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r});_.pop(),v.pop();let a=r.find(e=>n.has(e.name));if(a)throw Sf(a);return{linked:i,closure:n}},ie=(e,t)=>{let n=l.get(e);if(n)return y(e,g.get(e)??[]),n;let r=re(ne(e,t));return l.set(e,r.linked),g.set(e,r.closure),y(e,r.closure),r.linked},T=(e,t,n,o,s)=>{let c=s?void 0:C(e.module);if(c)return e.name===void 0?c:new Map([...c].map(([t,n])=>[`${e.name}!${t}`,n]));let l=s??ie(e.module,t.name),u=xf(l),d=`#${b.value++}`,f=new Map(e.params.map(e=>[e.name,`${e.name}${d}`])),p=xi(vd(e,t),u,t,n);S.push({module:e.module,instancer:t.name,lets:[],substitutions:p,location:e.location});let m=Qi({params:e.params.map(e=>({...e,name:`${e.name}${d}`})),substitutions:new Map([...p].map(([e,t])=>[e,Ti(t,f)])),variables:new Set(l.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,s,c)=>{let l=x(`${s}@${t.name}`);return r.set(l,c(l)),i.set(l,!o),a.set(l,{source:n,prefix:e.params.length}),l},createName:x}),h=new Set(u.map(e=>e.name)),g=/* @__PURE__ */ new Map;return l.exported.forEach((t,n)=>{if(h.has(n))return;if(e.name===void 0){let r=m.getKey(t.key);u.length>0&&ee.set(r,{name:n,location:e.location}),g.set(n,{key:r,arity:t.arity});return}let r=m.getQualifiedKey(t.key);u.length>0&&ee.set(r,{name:`${e.name}!${n}`,location:e.location}),g.set(`${e.name}!${n}`,{key:r,arity:t.arity+e.params.length})}),g},E=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:Fr})),D=(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:E(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),O=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),ae=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=O(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:E(r,n),location:n}}},k=(e,t,n,a)=>{let o=e.location,s=a?void 0:C(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=O(n.arity);return D(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??ie(e.module,n),l=`#${b.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=xf(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};S.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>Tf(f(e),p),h=d.map(t=>{let n=ae(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),g=[],_=Qi({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:E(e.params,o),location:o,resolution:Fr}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:Fr}])),variables:new Set(c.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.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}:Cf(a,i)),i},createName:x}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),i=O(n.arity),a=[...e.params,...i];return D(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...y]},oe=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),A=(e,a)=>{let o=tc(e,t.loadClass?.(e.name)),s=new Map([...Vu.map(e=>[e.name,{key:e.name,arity:e.arity}]),...a.symbols]),c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=[],d=[...o.constants],f=o.variables.map(e=>e.name),p=o.variables.map(e=>e.location),g=(e,t)=>e.forEach((e,n)=>{s.set(n,e),t&&c.set(n,e)});o.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:C(e);if(n){g(n,!0);return}let r=t??ie(e,o.name);d.push(...r.constants.filter(e=>d.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{f.includes(e)||(f.push(e),p.push(r.variableLocations[t]))}),g(r.exported,!0),r.modules.forEach((e,t)=>l.set(t,e)),u.push(r)}),o.constants.forEach(e=>c.set(e.name,{key:e.name,arity:e.arity,declaration:`Constant`})),o.variables.forEach(e=>c.set(e.name,{key:e.name,arity:0,declaration:`Variable`}));let _=d.length===0&&f.length===0,v=e=>o===n?e.name:`${e.name}@${a.id}`,y=/* @__PURE__ */ new Map,b=e=>({imported:s,importedAt:y,definitions:new Map(e.definitions.map(e=>[e.name,e])),getKey:v}),x=()=>new Map([...a.modules,...l]),S=e=>new Map([...s,...[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))].filter(t=>zr(t.location,e)).map(e=>[e.name,{key:e.name,arity:e.arity,declaration:e.kind}]),...o.definitions.filter(t=>zr(t.location,e)).map(e=>[e.name,{key:v(e),arity:Br(e)}])]),ee=e=>{let t=x();if(t.has(e.name))throw Sf(e);a.nested.push(e);let n=A(e,{id:`${a.id}/${e.name}`,symbols:S(e.location),modules:t,nested:a.nested});l.set(e.name,n),m.has(e.name)||m.set(e.name,n)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=T(e,o,b(o),_,x().get(e.module));t.forEach((t,n)=>{s.has(n)||y.set(n,e.location)}),g(t,!e.isLocal)}})),...o.modules.map(e=>({location:e.location,link:()=>ee(e)}))].sort((e,t)=>zr(e.location,t.location)?-1:1).forEach(e=>e.link()),yi(o,b(o));let te=e=>{let t=o.instances.find(t=>t.module===e.name);return t!==void 0&&zr(e.location,t.location)},w=e=>{let t=o.modules.find(t=>t.name===e.module);return t?te(t)?l.get(t.name):void 0:x().get(e.module)},ne=yd(na(o,(e,t)=>k(e,t,o.name,w(e))),oe(s));Si(ne,b(ne)),ne.definitions.forEach(e=>{let t=v(e);r.set(t,e),i.set(t,!_);let n={key:t,arity:Br(e)};s.set(e.name,n),e.isLocal||c.set(e.name,n)}),Zd(ne,{constants:new Set(d.map(e=>e.name)),variables:new Set(f),getDefinition:e=>r.get(s.get(e)?.key??e)});let re={module:ne,constants:d,variables:f,variableLocations:p,visible:s,exported:c,modules:l,extended:u};return h.push(re),re},se=re(n).linked,ce=e=>se.visible.get(e)?.key??e;se.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let le=[],ue=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>ue(e,t)),le.push(...e.module.assumptions))};ue(se,/* @__PURE__ */ new Set);let de=se.constants.map(e=>e.name),fe=se.variables,j=e=>e.module===void 0?[e.name,ce(e.name)]:e.module===n.name||de.includes(e.name)?[]:[(l.get(e.module)??m.get(e.module))?.visible.get(e.name)?.key??e.name],M=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:se.constants.find(t=>t.name===e)?.arity??0},pe=/* @__PURE__ */ new Map,N=/* @__PURE__ */ new Set,P=(e,t)=>{o.set(e,t),r.delete(e),pe.delete(e),N.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=bf(e.value);j(e).forEach(e=>{let n=M(e);n===0?pe.set(e,t):P(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let me=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=me.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new d(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(bf),bf(e.value)]),me.set(t,n)}),me.forEach(e=>j(e).forEach(t=>P(t,wf(e.name,M(t)||e.rows[0][0].length,e.rows))));let he=new Map(e.substitutions.flatMap(e=>j(e).map(t=>[t,ce(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!de.includes(n)&&!se.visible.has(n))throw new d(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new d(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let a=ce(i),s=r.get(a);if(!(s!==void 0||o.has(a)||pe.has(a)||de.includes(i)||fe.includes(i)))throw new d(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(s?.kind===`Operator`&&s.params.length!==(se.constants.find(e=>e.name===n)?.arity??se.visible.get(n)?.arity))throw new d(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let ge=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(j)),_e=(e,t)=>{if(ge.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&_e(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=_e(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=D(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),se.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})});let ve=de.filter(e=>!pe.has(e)&&!he.has(e)&&!N.has(e));if(ve.length>0)throw new d(`The constant parameter ${vf(t.source,t.loadModule,`constant`).find(e=>ve.includes(e))??ve[0]} is not assigned a value by the configuration file.`);let ye={runtime:c,definitions:r,builtins:o,constants:pe,substitutions:he,variables:fe,variableIndex:Ef(fe,h.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,evaluators:/* @__PURE__ */ new WeakMap};$d(S,e=>{let t=l.get(e)??m.get(e)??se;return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),getDefinition:e=>r.get(t.visible.get(e)?.key??e)}});let be=Yd({constants:new Set(pe.keys()),variables:/* @__PURE__ */ new Set([...fe,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>o.has(e))]),getDefinition:e=>uo(e,ye)}),xe=e=>{try{X(e,{environment:ye,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof f)return e;throw e}};return he.forEach((e,t)=>{let n=r.get(e),i=de.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&be.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?xe(n.body):void 0;if(i)throw new d(`The configuration file substitutes constant ${t} with non-constant ${e}${i instanceof p?``:` - specifically: ${i.message}`}`)}),c.isStarted=!0,{environment:ye,assumptions:le,variableLocations:se.variableLocations,instanceActions:ee}},Af={kind:`Boolean`,value:!0},jf={kind:`Boolean`,value:!1},Mf=e=>e?Af:jf,Nf=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,Pf=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,Q=(e,t)=>({kind:e,body:t}),Ff=(e,t,n)=>({kind:e,operands:[t,n]}),If=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?If(e,t.operands).operands:[t])}),Lf=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return Lf(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,Lf(t)),0)}},Rf=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 Rf(e.body);case`And`:case`Or`:return e.operands.some(Rf)}},zf=/* @__PURE__ */ new WeakMap,Bf={count:0},Vf=e=>{let t=zf.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`#${Bf.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(Vf).join(`,`)})`;default:return`${e.kind}(${Vf(e.body)})`}})();return zf.set(e,n),n},Hf=(e,t)=>e===t||Vf(e)===Vf(t),Uf=(e,t)=>{let n=Vf(t);return e.some(e=>e===t||Vf(e)===n)},Wf=e=>e===`And`?`Or`:`And`,Gf=(e,t)=>{switch(e.kind){case`Boolean`:return t?Mf(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?Q(`Not`,e):e;case`Not`:return Gf(e.body,!t);case`And`:case`Or`:return If(t?Wf(e.kind):e.kind,e.operands.map(e=>Gf(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return Q(n,Gf(e.body,t))}}},Kf=e=>{switch(e.kind){case`Boolean`:return Mf(!e.value);case`Not`:return e.body;case`And`:case`Or`:return If(Wf(e.kind),e.operands.map(Kf));case`Always`:return Q(`Eventually`,Kf(e.body));case`Eventually`:return Q(`Always`,Kf(e.body));default:return Q(`Not`,e)}},qf=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=qf(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return Mf(t)}return n.length===0?Mf(!t):n.length===1?n[0]:If(e.kind,n)}case`Not`:{let t=qf(e.body);return t.kind===`Boolean`?Mf(!t.value):Q(`Not`,t)}case`Always`:case`Eventually`:{let t=qf(e.body);return Q(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Jf=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Yf=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=Yf(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new f(`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=>If(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Yf(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Jf(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:If(`Or`,t);n.push(Q(`Always`,Q(`Eventually`,e)))}return If(`Or`,n)}case`Not`:return Nf(e.body)?e:Yf(Kf(e.body));default:return e}},Xf=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Xf(e.operands[0]):If(e.kind,e.operands.map(Xf));case`Not`:return e.body.kind===`Not`?Xf(e.body.body):Q(`Not`,Xf(e.body));case`Always`:case`Eventually`:case`Next`:return Q(e.kind,Xf(e.body));default:return e}},Zf=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Zf(e.operands[0]);let t=Math.floor(e.operands.length/2);return Ff(e.kind,Zf(If(e.kind,e.operands.slice(0,t))),Zf(If(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return Q(e.kind,Zf(e.body));default:return e}},Qf=(e,t)=>{e.kind===`Eventually`&&!Uf(t,e)&&t.push(e),`body`in e&&Qf(e.body,t),`operands`in e&&e.operands.forEach(e=>Qf(e,t))},$f=e=>{let t=e.filter(Pf),n=e.flatMap(e=>e.kind===`Not`&&Pf(e.body)?[e.body]:[]);return!t.some(e=>Uf(n,e))},ep=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,Q(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new f(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},tp=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:Q(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},np=(e,t,n)=>e.flatMap(e=>{let r=tp(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),rp=e=>[...new Set(e.map(Vf))].sort().join(`|`),ip=(e,t)=>{let n=new Set(t.map(rp));return[...e.filter(e=>!n.has(rp(e))),...t]},ap=e=>{let t=ep(e),n=np(t,`Always`,`And`),r=np(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=tp(t,`Eventually`,`Or`);if(n&&!(Uf(e,n.first)||Uf(e,n.second)))return ip(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Uf(e,t.first)||Uf(e,t.second))&&!Uf(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!$f(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=tp(t[e],`Always`,`And`);n&&(Uf(t,n.first)||t.push(n.first),Uf(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)Uf(t,e.first)&&Uf(t,e.second)&&!Uf(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!$f(t)?[]:i(t)};return a(e)},op=e=>({particle:e,successors:[],statePredicates:e.filter(e=>Lf(e)<=1)}),sp=e=>{let t=ap([e]).map(op),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=rp(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 ap(n)){let n=rp(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(op(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},cp=(e,t)=>!Uf(e,t)||Uf(e,t.body),lp=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&Lf(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Jf(e);if(n){let e=Lf(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(Rf(e))throw new f(`TLC cannot handle the temporal formula: actions may only appear as []<>A or <>[]A`);t.formulas.push(e)},up=(e,t)=>{let n=e.findIndex(e=>Hf(e,t));return n===-1?(e.push(t),e.length-1):n},dp=e=>{let t=Yf(qf(Gf(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Xf(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])lp(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:If(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Hf(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Zf(e.formula),n=[];t&&Qf(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>up(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>up(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>up(i,e))}));return{tableau:t&&sp(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},fp=/* @__PURE__ */ new Set([`~>`,`-+->`]),pp=/* @__PURE__ */ new WeakMap,mp=/* @__PURE__ */ new WeakSet,hp=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),gp=e=>new f(`TLC cannot handle the temporal formula at ${qa(e)}`),$=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=ao(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return $(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?$(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=uo(e,n);if(t)return _p(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?+!!r.isStateLevel:void 0},o=(e,t)=>r.has(e)?0:W(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return ji(e,(e,a)=>(i.value=Math.max(i.value,$(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 fp.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},_p=(e,t)=>{let n=pp.get(e);if(n!==void 0)return n;pp.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max($(e.body,void 0,t),...r.map(e=>$(e.set,void 0,t)));return pp.set(e,i),i},vp=`Temporal formula is a tautology (its negation is unsatisfiable).`,yp=(t,r,i,a,o=``,c=/* @__PURE__ */ new Set)=>{let l=(e,t,n=o,r=c)=>yp(e,t,i,a,n,r);if(t.kind===`And`)return t.operands.flatMap(e=>l(e,r,Ya(e)));if(t.kind===`Label`)return l(t.body,r);if(t.kind===`Let`)return l(t.body,bp(t,r,i));if(t.kind===`Identifier`){let a=W(t)?ao(r,t.name):void 0;if(a?.kind===`Thunk`)return l(a.expression,a.scope);let o=i.constants.has(t.name)?void 0:uo(t.name,i);if(!a&&o?.kind===`Operator`&&o.params.length===0&&_p(o,i)>0){if(c.has(o))throw n(new f(s),e.error);return l(o.body,void 0,t.name,/* @__PURE__ */ new Set([...c,o]))}}let u=hp(i,r);if(t.kind===`Apply`&&(e=>a||$(e,r,i)===3)(t)){let e=jo(t,u),n=W(t)?void 0:uo(t.operator,i);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive)return l(e.body,Uo(e,t.args,u),t.operator)}if(a&&t.kind===`Forall`&&t.bounds.every(e=>$(e.set,r,i)===0)){let r=[],i={count:0};if(go(t.bounds,u,e=>(i.count++,r.push(...l(t.body,e,Ya(t.body))),!1)),i.count===0)throw n(new f(vp),e.livenessEvaluationFailure);return r}return[{expression:t,scope:r,name:o}]},bp=(e,t,n)=>{let r=Go(e.definitions,hp(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&mp.add(e.binding);return r},xp=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),Sp=(t,r,i)=>{let a=(e,t,n)=>{let r=n===0?$(e,t,i):n;if(r===0){let n=X(e,hp(i,t));if(typeof n!=`boolean`)throw new f(`TLC expected a boolean in the temporal formula at ${qa(e)}`);return Mf(n)}return r===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},o={depth:0},c=(t,r,i,c)=>{if(o.depth>=100)throw n(new f(s),e.error);o.depth++;let l=d(t,r);o.depth--;let u=Lf(l);return u>2?l:a(i,c,u)},l=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,r=hp(i,t),a=W(e)||uo(n,i)===void 0?ao(t,n):void 0;if(a?.kind===`Thunk`&&mp.has(a))return c(a.expression,a.scope,e,t);let o=a?.kind===`Operator`?a.operator:a?void 0:W(e)?Mo(n,r):ko(n,i);if(o?.kind!==`Closure`)throw gp(e);let s=e.kind===`Apply`?e.args:[];return c(o.body,Uo(o,s,r),e,t)},u=(e,t)=>{if(!e.bounds.every(e=>$(e.set,t,i)===0))throw gp(e);let n=[];go(e.bounds,hp(i,t),t=>(n.push(d(e.body,t)),!1));let r=e.kind===`Forall`;if(n.length===0)return Mf(r);let o=If(r?`And`:`Or`,n),s=Lf(o);return s>2?o:a(e,t,s)},d=(e,t)=>{let n=$(e,t,i);if(n<=2)return a(e,t,n);switch(e.kind){case`Label`:return d(e.body,t);case`Let`:return d(e.body,bp(e,t,i));case`Identifier`:return l(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?Q(`Always`,Ff(`Or`,Q(`Not`,d(n[0],t)),Q(`Eventually`,d(n[1],t)))):e.operator===`~`&&!W(e)?Q(`Not`,d(n[0],t)):e.operator===`=>`?Ff(`Or`,Q(`Not`,d(n[0],t)),d(n[1],t)):l(e,t)}case`And`:case`Or`:return If(e.kind,e.operands.map(e=>d(e,t)));case`Forall`:case`Exists`:return u(e,t);case`If`:{if($(e.condition,t,i)===0){let n=X(e.condition,hp(i,t));if(typeof n==`boolean`)return d(n?e.consequent:e.alternative,t)}let n=d(e.condition,t);return Ff(`Or`,Ff(`And`,n,d(e.consequent,t)),Ff(`And`,Q(`Not`,n),d(e.alternative,t)))}case`Always`:case`Eventually`:return Q(e.kind,d(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=xp(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=Q(`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`?Q(`Always`,Q(`Eventually`,Ff(`Or`,i,a))):Ff(`Or`,Q(`Eventually`,Q(`Always`,i)),Q(`Always`,Q(`Eventually`,a)))}default:throw gp(e)}};return d(t,r)},Cp=(e,t,n,r,i)=>{let a=e=>Cp(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`?lo(X(e.expression,a),`a temporal property predicate`):Ha(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&&lo(X(e.unchanged,a),`a subscript`)?!1:lo(X(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 Cp(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new f(`TLC cannot evaluate a temporal formula in a single step`)}},wp=(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)=>wp(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 Cp(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Tp=(e,t)=>e.every((e,n)=>He(e,t[n])),Ep=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Dp=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.pending.push(void 0),e.offsets.push(-1),e.edgeOffsets.push(-1),e.nodeStates.length-1),Op=(e,t,n)=>{let r=e.slots.length/3-1,i=Math.imul(Math.imul(t,2654435761)^n,2246822507)>>>e.shift;for(let a=i;;a=a+1&r){let r=a*3,i=e.slots[r];if(i===0||i===t+1&&e.slots[r+1]===n)return r}},kp=(e,t)=>e.offsets[t]!==-1,Ap=(e,t)=>e.pending[t]??=[],jp=(e,t)=>{let n=e.edgeOffsets[t];return e.edges.ids.subarray(n+1,n+1+e.edges.ids[n])},Mp=(e,t,n)=>e.results.bytes[e.offsets[t]+n]===1,Np=2**53-1,Pp=(t,r,i,a)=>{if(t.length===0)return;let o=r.map(e=>Sp(e.expression,e.scope,i)),s=t.map(e=>Q(`Not`,Sp(e.expression,e.scope,i))),c=s.length===1?s[0]:If(`Or`,s),l=o.length===0?c:If(`And`,[...o,c]),u=dp(l);if(u.length===0)throw n(new f(vp),e.livenessEvaluationFailure);let d=/* @__PURE__ */ new Map,p=u.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=Vf(e),n=d.get(t)??d.size;return d.set(t,n),n}),nodeStates:[],nodeTableaux:[],pending:[],offsets:[],results:{bytes:/* @__PURE__ */ new Uint8Array(1024),length:0},edgeOffsets:[],edges:{ids:/* @__PURE__ */ new Int32Array(1024),length:0},initial:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],errorNode:void 0})),m={multiplier:1},h=!rs(i),g={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},_=e=>{let t=g.states.get(e)??/* @__PURE__ */ new Map;return g.states.set(e,t),t},v=(e,t)=>{i.runtime.setLivenessSource(e);let n=t();return i.runtime.setLivenessSource(void 0),n},y=(e,t)=>Cp(e,t,void 0,i,h?_(t):/* @__PURE__ */ new Map),b=(e,t,n)=>v(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!y(e,n))),x=(e,t,n,r)=>v(t,()=>{let t=e.solution.actionChecks;if(!h)return Uint8Array.from(t,e=>+!!Cp(e,n,r,i,/* @__PURE__ */ new Map));let a=_(n),o=g.actions.get(n)??/* @__PURE__ */ new Map;g.actions.set(n,o);let s=o.get(r)??new Int8Array(d.size).fill(-1);return o.set(r,s),Uint8Array.from(e.actionIds,(e,o)=>(s[e]===-1&&(s[e]=+!!Cp(t[o],n,r,i,a)),s[e]))}),S=(e,t,n,r)=>v(n,()=>e.nodes[t].statePredicates.every(e=>y(e,r))),ee=(e,t)=>{let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},te=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),C=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=Op(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},w=(e,t,n)=>{let r=Dp(e,t,n),i=e.nodeIds;if(++i.size*2>i.slots.length/3){let e=i.slots;i.slots=new Int32Array(e.length*2),i.shift--;for(let t=0;t<e.length;t+=3)e[t]!==0&&i.slots.set(e.subarray(t,t+3),Op(i,e[t]-1,e[t+1]))}return i.slots.set([t+1,n,r],Op(i,t,n)),r},ne=(e,t,n)=>t.nodes.flatMap((t,r)=>C(e,n,r)??[]).sort((e,t)=>e-t),re=(e,t,n,r)=>{let i=e.solution.actionChecks.length,a=e.results,o=a.length;if(a.length+=r.length+n.length*i,a.length>a.bytes.length){let e=new Uint8Array(Math.max(2*a.bytes.length,a.length));e.set(a.bytes),a.bytes=e}a.bytes.set(r,o),n.forEach((e,t)=>a.bytes.set(e,o+r.length+t*i)),e.offsets[t]=o;let s=e.pending[t]??[],c=e.edges,l=c.length;if(c.length+=s.length+1,c.length>c.ids.length){let e=new Int32Array(Math.max(2*c.ids.length,c.length));e.set(c.ids),c.ids=e}c.ids[l]=s.length,c.ids.set(s,l+1),e.edgeOffsets[t]=l,e.pending[t]=void 0},ie=(e,t,n)=>{let r={slots:Array.from({length:16*m.multiplier}),count:0},i=(e,t)=>{for(let n=(a.getFingerprint(t.index)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&Tp(r.state,t.state))return!1}},o=e=>{if(r.count>=r.slots.length>>1){let e=r.slots;r.slots=Array.from({length:2*e.length+1});for(let t of e)t&&i(r.slots,t)}i(r.slots,e)&&r.count++};return n.forEach(o),o({index:e,state:t}),r.slots.length>16*m.multiplier&&m.multiplier++,r.slots.filter(e=>e!==void 0)},T=(e,t,n,r,i)=>{let o=b(e,r,n),s=t.nodes[e.nodeTableaux[i]],c=[],l=Ap(e,i),u=s.successors.length>0?x(e,r,n,n):/* @__PURE__ */ new Uint8Array;for(let a of s.successors){if(!S(t,a,r,n))continue;if(ee(t,a)&&e.errorNode===void 0&&te(e)){e.errorNode=i;return}let o=C(e,r,a);if(o!==void 0&&l.includes(o))continue;let s=o??w(e,r,a);l.push(s),c.push(u),o===void 0&&T(e,t,n,r,s)}for(let i of a.getSuccessors(n)){let a=x(e,r,n,i.state),o=e.isDone[i.index]===!0;for(let n of s.successors){if(!S(t,n,r,i.state))continue;let s=C(e,i.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??w(e,i.index,n);l.push(u),c.push(a),s===void 0&&o&&T(e,t,i.state,i.index,u)}}l.length>0&&re(e,i,c,o)},E=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>S(t,r,a,e.state)));e.isDone[a]=!0;for(let s of ne(e,t,a)){let a=Ap(e,s),c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=C(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??w(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&T(e,t,n.state,n.index,d)}}),re(e,s,c,i)}if(e.errorNode!==void 0)return Ep(O(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},D=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)Dp(e,e.nodeStates.length,-1);let a=Ap(e,i),o=[];t.forEach((t,r)=>{kp(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),re(e,i,o,r)},O=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)kp(e,t)&&(r.push(t),n.set(t,-1));for(let i=0;i<r.length;i++){let a=r[i];for(let i of jp(e,a))if(!(i===a&&e.solution.tableau)){if(i===t){let e=[t];for(let t=a;t!==-1;t=n.get(t)??-1)e.push(t);return e}kp(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new f(`Couldn't re-create liveness trace (path) starting at: ${t}`)},ae=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=n.stateChecks.length,a=(t,n,a)=>e.results.bytes[e.offsets[t]+i+n*r+a]===1,o=(e,n)=>t.eventuallyAlways.every(t=>a(e,n,t)),s=new Float64Array(e.nodeStates.length).fill(-1),c=e.initial.filter(t=>kp(e,t)),l=[],u=t=>{let n=jp(e,t).indexOf(t);return n!==-1&&o(t,n)},d=(t,r)=>n.tableau!==void 0&&cp(n.tableau.nodes[e.nodeTableaux[t]].particle,r),p=r=>{let i=l.pop()??r;if(i===r&&!u(i)){s[i]=Np;return}let c=/* @__PURE__ */ new Set,f=/* @__PURE__ */ new Map;for(let t=i;;t=l.pop()??r){c.add(t);let n=f.get(e.nodeStates[t]);if(n?n.push(t):f.set(e.nodeStates[t],[t]),s[t]=Np,t===r)break}let p=t.infinitelyOftenStates.every(t=>[...c].some(n=>Mp(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...c].some(n=>jp(e,n).some((e,r)=>c.has(e)&&o(n,r)&&a(n,r,t)))),g=n.promises.every(e=>[...c].some(t=>d(t,e)));if(p&&h&&g)return m(r,c,f)},m=(r,i,s)=>{let c=Ep(O(e,r).reverse().map(t=>e.nodeStates[t])),l=[],u=/* @__PURE__ */ new Set([r]),p=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),g=n.promises.map(()=>!1),_={count:p.length+m.length+g.length},v={node:r},y=e=>i.has(e),b=e=>{l.push(v.node),v.node=e};for(;_.count>0;){let r=_.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!p[n]&&Mp(e,v.node,t)&&(p[n]=!0,_.count--)}),n.promises.forEach((e,t)=>{!g[t]&&d(v.node,e)&&(g[t]=!0,_.count--)}),!(_.count<=0);){let n={last:-1,unvisited:-1},i=_.count;if(jp(e,v.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!y(r)||!o(v.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&a(v.node,c,e)&&(m[t]=!0,_.count--)})}return _.count<i?(b(r),u.clear(),!0):(y(r)&&!u.has(r)&&(n.unvisited=r),!1)}))break;if(_.count<r){b(n.last),u.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new f(`TLC failed to build the counterexample of a liveness property`);v.node=t,n.unvisited=jp(e,t).find(e=>y(e)&&!u.has(e))??-1}b(n.unvisited),u.add(n.unvisited)}}let x=h(r,v.node,s,o);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];x[x.length-1]!==n&&x.push(n)}let S=c[c.length-1];return x[x.length-1]===S&&x.pop(),{prefix:c.slice(0,-1),cycle:[S,...x.reverse()]}},h=(t,n,r,i)=>{if(n===t)return[];let a=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([a]),c=[];for(let n=a,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of jp(e,u).entries()){if(f===u||!i(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==a;)e.push(t),t=r,r=o.get(t)??-1;return e.push(a),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new f(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<c.length;t++){let n=[c[t],-1,0],r={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),a=n.pop()??0;if(i===-42){if(s[a]===t){let e=p(a);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(s[a]!==-1){n.push(Math.min(t,s[a]));continue}s[a]=r.link,n.push(t,a,-42),l.push(a);let u={value:r.link++};jp(e,a).forEach((t,r)=>{kp(e,t)&&(o(a,r)?s[t]===-1?n.push(t,-1):u.value=Math.min(u.value,s[t]):s[t]===-1&&c.push(t))}),n.push(u.value)}}};return{addInitialState:(e,t)=>{g.states.clear(),g.actions.clear();for(let n of p){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)S(r,i,void 0,t)&&n.initial.push(C(n,e,i)??w(n,e,i))}},addState:(e,t,n)=>{g.states.clear(),g.actions.clear();let r=ie(e,t,n);for(let n of p){let i=r.map(r=>x(n,e,t,r.state)),a=b(n,e,t),o=n.solution.tableau,s=o?E(n,o,r,i,a,e):D(n,r,i,a,e);if(s)return s}},findViolation:()=>{for(let e of p)for(let t of e.solution.models){let n=ae(e,t);if(n)return n}},getViolatedProperties:(e,n)=>[...new Set(t.filter((t,r)=>!wp(s[r].body,e,n,0,i)).map(e=>e.name))]}},Fp=`UnnamedAction`,Ip={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},Lp=e=>{let t=e.range??Ip;return jt([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Rp=e=>{let t=[[`name`,e.name],[`location`,Lp(e.location)]];return e.parameters.length===0?jt(t):jt([...t,[`context`,jt(e.parameters)],[`parameters`,R(e.parameters.map(e=>e[0]))]])},zp=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),Bp=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Vp=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,Hp=e=>e.kind===`Apply`?e.args:[],Up=(e,t,n)=>{let r=Vp(e);if(r===void 0)return;if(W(e)){let e=ao(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=ko(r,n);return i?.kind===`Closure`?i:void 0},Wp=(e,t)=>{try{return X(e,Bp(t,void 0)),!0}catch(e){if(e instanceof l)return!1;throw e}},Gp=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&po(e,t)&&Wp(e.body,t),Kp=(e,t)=>{let n=uo(e.name,t);return n?.body===e.body&&Gp(n,t)},qp=(e,t)=>{if(e.kind!==`Identifier`||!W(e))return;let n=ao(t,e.name);return n?.kind===`Thunk`?n:void 0},Jp=(e,t)=>(e?.params??[]).flatMap(e=>{let n=ao(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Yp=(e,t)=>{try{return e()}catch(e){if(e instanceof l)return t();throw e}},Xp=(e,t,n,r,i)=>{let a=Hp(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return!r||a.length===0?[{...e,parameters:[],expression:t,scope:n}]:a.some(e=>$(e,n,i)!==0)?o():Yp(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),X(e,Bp(i,n))]),expression:t,scope:n}],o)},Zp=(e,t,n,r,i)=>{let a=()=>({name:n?.name??Fp,location:e.location,parameters:Jp(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return Zp(e.body,Go(e.definitions,Bp(r,t)),n,r,i);case`Label`:return Zp(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>Zp(e,t,n,r,i));case`Exists`:return Yp(()=>{let o=[];return go(e.bounds,Bp(r,t),t=>(o.push(...Zp(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=W(e)?void 0:i.get(Vp(e)??``),s=Up(e,t,r);if(o)return Xp(o,e,t,s,r);if(!s)return[a()];let c=Hp(e),l=()=>[{name:s.name,location:e.location,parameters:[],expression:e,scope:t}];return Kp(s,r)||c.some(e=>$(e,t,r)!==0)?l():Yp(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:X(n,Bp(r,t))},parent:e}),s.scope);return Zp(s.body,e,s,r,i)},l)},Qp=(e,t,n,r,i)=>{let a=(e,t)=>Qp(e,t,n,r,i);if(e.kind===`Let`){a(e.body,Go(e.definitions,Bp(n,t)));return}let o=qp(e,t);if(o){a(o.expression,o.scope);return}let s=Up(e,t,n);if(s&&Kp(s,n))return;if(s&&s.params.length===0){if($(s.body,s.scope,n)===1){r.inits.push(zp(s.name,s.body));return}a(s.body,s.scope);return}if(s&&e.kind===`Apply`&&s.params.length===e.args.length){a(s.body,Uo(s,e.args,Bp(n,t)));return}if(e.kind===`And`){e.operands.forEach(e=>a(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t});return}r.temporals.push(zp(Fp,e));return}let c=$(e,t,n);c<=1?r.inits.push(zp(Fp,e)):c===3&&r.temporals.push(zp(Fp,e))},$p=(e,t,n,r,i)=>{let a=(t,n)=>$p(e,t,n,r,i);if(t.kind===`Let`){a(t.body,Go(t.definitions,Bp(r,n)));return}let o=qp(t,n);if(o){a(o.expression,o.scope);return}let s=Up(t,n,r);if(s&&Kp(s,r))return;if(s&&s.params.length===Hp(t).length){a(s.body,t.kind===`Apply`?Uo(s,t.args,Bp(r,n)):s.scope);return}if(t.kind===`Forall`&&Yp(()=>(go(t.bounds,Bp(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(zp(e,a)):$(a,n,r)<2?i.invariants.push(zp(e,a)):i.impliedTemporals.push(zp(e,t));return}let c=$(t,n,r);c<=1?i.impliedInits.push(zp(e,t)):c===3&&i.impliedTemporals.push(zp(e,t))},em=(e,t)=>{let n=uo(e,t);return n?.kind===`Operator`&&!Gp(n,t)?n:void 0},tm=e=>jt([[`name`,e.name],[`location`,Lp(e.location)]]),nm=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:em(e.specification,t);a&&(Qp(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...Zp(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:ko(e.init,t);o?.kind===`Closure`&&r.inits.push(zp(e.init??``,o.body));let s=e.next===void 0?void 0:ko(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Zp(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=em(e,t);n&&r.invariants.push(zp(e,n.body))}),e.properties.forEach(e=>{let n=em(e,t);n&&$p(e,n.body,void 0,t,r)}),r},rm=(e,t,n)=>nm(e,t,n).actions,im=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>U(e[1])).join(`,`)})`,am=e=>`${e.name===Fp?`Action`:e.name}${im(e)} ${Ja(e.location.range??Ip)}`,om=e=>`${e.name}${im(e)}`,sm=(e,t,n,r)=>{let i=nm(e,t,r),a=e=>ht(e.map(Rp)),o=e=>ht(e.flatMap(e=>{let n=em(e,t);return n?[tm(n)]:[]}));return jt([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,ht(t.variables.map((e,t)=>jt([[`name`,e],[`location`,Lp(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},cm=`paired12`,lm=(e,t=16)=>e<=t*.75?t:lm(e,t*2),um=(e,t)=>{let n=lm(e.length)-1,r=e=>{let r=t(e);return(r^r>>>16)&n};return e.map((e,t)=>({key:e,position:t,bucket:r(e)})).sort((e,t)=>e.bucket-t.bucket||e.position-t.position).map(e=>e.key)},dm=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),fm=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),pm=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),mm=e=>pm(e).replaceAll(`
|
|
414
|
+
`,`\\n`),hm=(e,t)=>{let n=[],r=e=>n.push(`State ${n.length+1}:\n${e.getText()}\n`);return{writeInitialState:r,writeSuccessor:(e,t,n)=>{n||r(t)},close:()=>t?.(e.path,n.join(``))}},gm=(e,t)=>{let n=[`strict digraph DiskGraph {
|
|
412
415
|
`,`node [shape=box,style=rounded]
|
|
413
|
-
`,e.colorize?`edge [colorscheme="${
|
|
416
|
+
`,e.colorize?`edge [colorscheme="${cm}"]\n`:``,`nodesep=0.35;
|
|
414
417
|
`,`subgraph cluster_graph {
|
|
415
418
|
`,`color="white";
|
|
416
419
|
`],r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=r.get(e.level)??/* @__PURE__ */ new Set;r.set(e.level,t.add(e.fingerprint))},o=e=>{if(!e)return 1;let t=i.get(e.name)??i.size+2;return i.set(e.name,t),t},s=()=>[`subgraph cluster_legend {graph[style=bold];label = "Next State Actions" style="solid"
|
|
417
|
-
`,`node [ labeljust="l",colorscheme="${
|
|
418
|
-
`,e.colorize&&i.size>1?s():``,`}`].join(``),l=()=>{e.snapshot&&t?.(e.path.replaceAll(`.dot`,`_snapshot.dot`),n.join(``)+c())};return{writeInitialState:e=>{n.push(`${e.fingerprint} [label="${
|
|
420
|
+
`,`node [ labeljust="l",colorscheme="${cm}",style=filled,shape=record ]\n`,...um([...i.keys()],fm).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${i.get(e)}]\n`),`}`].join(``),c=()=>[...um([...r],e=>e[0]).map(e=>`{rank = same; ${um([...e[1]],dm).map(e=>`${e};`).join(``)}}\n`),`}
|
|
421
|
+
`,e.colorize&&i.size>1?s():``,`}`].join(``),l=()=>{e.snapshot&&t?.(e.path.replaceAll(`.dot`,`_snapshot.dot`),n.join(``)+c())};return{writeInitialState:e=>{n.push(`${e.fingerprint} [label="${mm(e.getLabel())}",style = filled]\n`),a(e),l()},writeSuccessor:(t,r,i,s)=>{let c=e.colorize?String(o(s)):`black`,u=e.actionLabels&&s?pm(s.signature):``;n.push(`${t.fingerprint} -> ${r.fingerprint} [label="${u}",color="${c}",fontcolor="${c}"];\n`),i||n.push(`${r.fingerprint} [label="${mm(r.getLabel())}",tooltip="${mm(r.getText())}"];\n`),a(t),l()},close:()=>t?.(e.path,n.join(``)+c())}},_m=(e,t)=>e.dot?gm(e,t):hm(e,t),vm=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),ym=(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},bm=t=>n(new f(`${o}${t}`),e.error),xm=e=>{if(!N(e))throw bm(`The symmetry values must be function records.`);let t=H(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!P(e)||!P(i))throw new d(`Symmetry function must have model values as domain and range`);e.name!==i.name&&n.set(e.name,i)}),n},Sm=(e,t)=>{let n=t.definitions.get(e);if(n===void 0&&!t.constants.has(e))throw new d(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(n?.kind!==`Operator`||n.params.length>0)throw bm(`The symmetry function ${e} must specify a set of permutations.`);let r=X(n.body,{environment:t,scope:void 0,state:void 0,next:void 0});if(!M(r)||!z(r))throw bm(`The symmetry operator must specify a set of functions.`);let i=B(r).elements.map(xm);if(n.body.kind===`Apply`&&n.body.args.length>=i.length)return[];let a=/* @__PURE__ */ new Map;i.forEach(e=>{e.size>0&&a.set(vm(e),e)});let o=[...a.values()],s={start:0};for(;s.start<a.size;){let e=[...a.values()],t=e.length;o.forEach(n=>e.slice(s.start,t).forEach(e=>{let t=ym(n,e),r=vm(t);t.size>0&&!a.has(r)&&a.set(r,t)})),s.start=t}let c=Math.max(256,Math.floor(4194304/a.size));return[...a.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:c}))},Cm=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=Em(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(Em(e[r],t));return a}},wm=(e,t)=>{let n=[],r=[];for(let i of e){let e=Em(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(L);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(L(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},Tm=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,Em=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=Tm(e);if(n===0||n>64)return Dm(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=Dm(e,t),a=i!==e&&He(i,e)?e:i;return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,a),t.cacheSize++,a},Dm=(e,t)=>{let n=e.kind;if(n===`Set`){let n=wm(e.elements,t);return n?Re(n):e}if(n===`Function`||n===`LazyFunction`&&z(e.domain)){let n=H(e),r=Cm(n.domain,t),i=Cm(n.range,t)??n.range;if(r){let e=xt(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?ze(n.domain,e.range):e}return i===n.range?n:ze(n.domain,i)}if(n===`Interval`||!M(e)||!z(e))return e;let r=B(e),i=Cm(r.elements,t);return i?ht(i):r},Om=(e,t,n)=>{for(let r=t.length;r<e.length;r++)t.push(Em(e[r],n));return t},km=(e,t,n,r)=>{let i=[];for(let a=0;a<e.length;a++){let o=r?r[a]:a,s=Em(e[o],n),c=L(s,t[o]);if(c>0)return;if(r||i.push(s),c<0)return r?e.map(e=>Em(e,n)):Om(e,i,n)}},Am=(e,t,n)=>t.reduce((t,r)=>km(e,t,r,n)??t,e),jm=(e,t)=>e*((t-e)/2**64),Mm=e=>e.includes(`.`)?e:`${e}.0`,Nm=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return Mm(String(e));let[n,r]=e.toExponential().split(`e`);return`${Mm(n)}E${r.replace(`+`,``)}`},Pm=e=>e!==void 0&&e>=`0`&&e<=`9`,Fm=e=>{if(e===0)return`0.0`;let t=Nm(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;Pm(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(;Pm(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;Pm(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(Pm(t[n.next])&&Number(t[n.next])>=5&&(n.result=Im(n.result));Pm(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},Im=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Im(r)}.`:n===`9`?`${Im(r)}0`:`${r}${Number(n)+1}`},Lm=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}`)},Rm=(e,t,n)=>{if(jm(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},zm=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}).`},Bm={line:0,column:0},Vm=`Failed to recover the initial state from its fingerprint.`,Hm=`Failed to recover the next state from its fingerprint.`,Um=e=>({kind:`Identifier`,name:e,location:Bm}),Wm=/* @__PURE__ */ new Set([`name`,`property`]),Gm=(e,t,n)=>{let r=uo(t,n);if(!r)throw new d(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new d(Wm.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},Km=(e,t,n)=>{let r=Gm(e,t,n);if(po(r,n))throw new d(`The ${e} ${t} cannot be a constant.`);return r},qm=(e,t,n)=>{if(po(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return X(Um(e),fh(n,void 0,void 0))}catch(e){if(e instanceof f||c(e))return;throw e}},Jm=(e,t,n)=>{let r=Gm(e,t,n),i=qm(t,r,n);if(i!==void 0&&i!==!0)throw new d(`The ${e} of ${t} is equal to ${U(i)}`);return i===void 0?r:void 0},Ym=(t,r)=>{let i=Yd({constants:new Set(r.constants.keys()),variables:new Set(r.variables),getDefinition:e=>uo(e,r)});return t.flatMap(t=>{let a=Jm(`invariant`,t,r);if(!a)return[];let o=i.analyzeDefinition(a,/* @__PURE__ */ new Map);if(o.level>=2){let r=o.params.size===0?``:`
|
|
419
422
|
Note that a bug can cause TLC to incorrectly report this error.
|
|
420
423
|
If you believe your TLA+ or PlusCal specification to be correct,
|
|
421
|
-
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw n(new l(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${r}`),e.safetyEvaluationFailure)}return[{name:t,expression:Vm(t),scope:void 0}]})},Jm=(e,t)=>{if(!j(e))return;let n=H(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},Ym=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Ym(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=co(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Ym(n.body,t)}return[e]},Xm=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||$(r,e.scope,t)>0)return!1;let i=X(r,uh(t,void 0,void 0,e.scope));if(i===!1)throw new l(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new l(`The operator ${r.name}, which equals ${U(i)},\ncannot be used as a ${n}`);return!0},Zm=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e===void 0)return;let n=Um(t,e,r).body,i=Vm(e);if(n.kind!==`Number`&&n.kind!==`String`&&$(i,void 0,r)===0)throw new l(`The ${t} ${e} cannot be a constant.`);return i};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}let i=[],a=[],o=[],s=Um(`name`,t.specification,r),c=Gm(t.specification,s,r);if(c!==void 0)throw new l(`The value of ${t.specification} is equal to ${U(c)}`);if(_p(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(Xm(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new l(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){a.push({expression:c.expression.action,scope:s.scope});return}if(c.kind===`Always`&&$(c.expression,s.scope,r)<2)throw new l(`TLC cannot handle []P in the specification ${t.specification} when P is a state predicate`);let u=$(c,s.scope,r);if(u===3)o.push(s);else{if(u===2)throw new l(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new l(`The specification ${t.specification} must contain at most one [][Next]_vars`);let u=[...i,...a],d=e=>`$specification${e}`,f=u.reduce((e,t,n)=>t.scope===void 0?e:{name:d(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0},parent:e},void 0),p=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:d(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:i.length===0?void 0:{kind:`And`,operands:i.map(p),location:Rm},next:a.length===0?void 0:p(a[0],i.length),scope:f,temporals:o}},Qm=(e,t)=>{let n={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let r=Km(`property`,e,t);r&&_p(r.body,void 0,t,!0,e).forEach(r=>{let i=r.expression;if(Xm(r,t,`property`))return;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){n.actionProperties.push({name:r.name,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:r.scope});return}if(i.kind===`Always`&&$(i.expression,r.scope,t)<=1){let e=i.expression;n.invariants.push({name:e.kind===`Identifier`?e.name:r.name,expression:e,scope:r.scope});return}let a=$(i,r.scope,t);if(a<2)n.initialPredicates.push({name:r.name,expression:i,scope:r.scope});else{if(a===2)throw new l(`The property ${e} is an action-level formula`);n.liveness.push({name:e,expression:i,scope:r.scope})}})}),n},$m=(e,t,n)=>t.flatMap(t=>Km(e,t,n)?[{name:t,expression:Vm(t),scope:void 0}]:[]),eh=(e,t)=>{let n=co(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},th=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new l(`_POSSIBLE lists ${n} more than once`);Wm(`possible`,n,t);let i=Vm(n);if($(i,void 0,t)===3)throw new l(`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}}),nh=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||W(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},rh=(e,t)=>e.flatMap(e=>Ym(e.expression,t).map(n=>{let r=e.scope===void 0?Ws(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:nh(n,r,t)}})),ih=(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},ah=/[\u0100-\uffff]/,oh=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),sh=e=>e.kind===`String`?ah.test(e.value):e.kind===`Set`&&e.elements.some(sh),ch=e=>e.kind===`String`&&ah.test(e.value)||e.kind===`Apply`&&oh.has(e.operator)||Un(e).some(ch),lh=(e,t)=>e.constants.some(e=>sh(e.value)||(e.args??[]).some(sh))||[...t.definitions.values()].some(e=>ch(e.body)||e.kind===`Function`&&e.bounds.some(e=>ch(e.set))),uh=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),dh=(e,t,n)=>so(X(e,t),n),fh=(e,t,n=ph)=>{let r=X(e,t);if(typeof r!=`boolean`)throw new u(n(e,t.environment));return r},ph=(e,t)=>{let n=e.kind===`Identifier`?co(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. ${r.kind===`Number`?r.text??String(r.value):i?Ka(i):qa(r)}`},mh=()=>{},hh=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=dh(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),gh=(e,t,n)=>{try{return dh(e,uh(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof u)return{message:e.message};throw e}},_h=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=gh(n.expression,t,`an assumption`);if(e)return{name:qa(n.expression),trace:[],message:e.message}}},vh=(t,r,i)=>{let a=qm(t.invariants,r),s=Zm(t,r),c=Qm(t,r),u=rh([...a,...c.invariants],r),d=u.length>0||c.actionProperties.length>0||c.liveness.length>0;if(s.init===void 0&&(d||c.initialPredicates.length>0||r.variables.length>0))throw new l(`The configuration file did not specify the initial state predicate.`);if(s.next===void 0&&d)throw new l(`The configuration file did not specify the next state predicate.`);let f=rh($m(`constraint`,t.constraints,r),r),p=$m(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&Um(`rlreward`,t.rlReward,r),t.periodic!==void 0&&Um(`periodic`,t.periodic,r);let m=th(t.possible,r);if(r.variables.length===0)return;let h=t.symmetry===void 0?[]:bm(t.symmetry,r);t.view!==void 0&&Um(`view function`,t.view,r);let g=t.view===void 0?void 0:{name:t.view,expression:Vm(t.view),scope:void 0},_=c.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Rm};return{...e,unchanged:t}}),v=e=>$(e.expression,void 0,r)>=2,y=m.filter(e=>!v(e)),ee=m.filter(v),b=r.runtime,x={indices:void 0},te=()=>{if(x.indices)return x.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return x.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),x.indices},ne=h.length>0?te():void 0,re=(e,t)=>X(e,uh(r,t,void 0)),S=e=>{let t=te(),n=h.length===0?e:Om(e,h,t);return Vc(g===void 0?t.map(e=>n[e]):[re(g.expression,n)])},ie=lh(t,r);b.getFingerprint=S;let ae=()=>{let e=m.find(e=>!b.possibleCounts.get(e.name));if(!e)return;let t=eh(e.name,r),n=t?` at ${Ka(t)}`:``;return{name:e.name,message:`The _POSSIBLE predicate ${e.name}${n} 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:fe(U(ol(b),!0))}};return{properties:c,spec:s,isSymmetric:h.length>0,getTlcOrder:te,getStoredFingerprints:(e,t)=>{if(g!==void 0||ie)return BigInt64Array.from(e,S);let n=new BigInt64Array(t.length),r=Wc(te(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(ie)return[String(S(e))];let t=h.length===0?e:Om(e,h,ne);return g===void 0?t:[re(g.expression,t)]},findViolatedInvariant:(t,i)=>u.find(a=>{if(ih(a,t,i))return!1;try{let e=uh(r,t,void 0,a.scope),n=a.membership;return i&&n?!en(t[n.variable],i[n.variable],X(n.set,e)):!fh(a.expression,e)}catch(t){throw i?xh(n(t,e.safetyEvaluationFailure),`Evaluating invariant ${a.name} failed.`):t}}),satisfiesConstraints:(e,t)=>f.every(n=>ih(n,e,t)||fh(n.expression,uh(r,e,void 0))),findFailedInitialPredicate:e=>c.initialPredicates.find(t=>!fh(t.expression,uh(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>_.find(n=>{try{return!fh(n.action,uh(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${qa(n.box)}`)&&!dh(n.unchanged,uh(r,e,t,n.scope),`a subscript`)}catch(e){throw xh(yh(e),`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>p.every(n=>fh(n.expression,uh(r,e,t),e=>`${o}${ph(e,r)}`)),trackStatePossible:y.length===0?mh:e=>hh(y,b,uh(r,e,void 0)),trackActionPossible:ee.length===0?mh:(e,t)=>hh(ee,b,uh(r,e,t)),findUnwitnessedPossible:ae,findPostconditionViolation:()=>{let e=ae();if(e)return e;for(let e of t.postconditions){let t=gh(Vm(e),r,`a postcondition`);if(t)return{name:e,message:t.message??`Postcondition ${e} is false.`}}}}},yh=e=>e instanceof d?n(e,e.exitCode):e,bh=e=>e instanceof u&&!(e instanceof d)&&!(e instanceof f)?n(new u(`${o}${e.message}`,e),g(e)):yh(e),xh=(e,t)=>e instanceof u?n(new u(`${t}\n${e.message}`,e),g(e)):e,Sh=e=>{let t=e.dump&&hm(e.dump,e.writeFile),n=Ch(e,t);return t?.close(),n},Ch=(e,t)=>{let n=typeof e.config==`string`?ce(e.config):e.config,r=e.onPrint??console.log,i={isMuted:!1},o=e=>{i.isMuted||r(e)},s=e=>{i.isMuted=!0;let t=e();return i.isMuted=!1,t};De(_f(e.source,n,e.loadModule));let c=Df(n,{source:e.source,loadModule:e.loadModule,loadClass:e.loadClass,print:o,files:{readFile:e.readFile,writeFile:e.writeFile},seed:e.seed}),f=c.environment,p=f.runtime;p.pause=e.onPause??(()=>{}),p.getSpecification=()=>am(n,f,c.variableLocations,c.instanceActions);let m={depth:0},h=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:p.generatedStates,distinctStates:p.distinctStates,queuedStates:p.queueSize,depth:p.generatedStates===0?0:Math.max(m.depth,1),outDegrees:void 0,fingerprintDistance:void 0}),_=Array.from({length:32},()=>0),v={newStates:0},y=()=>Math.min(v.newStates,31),ee=()=>_.map((e,t)=>t===y()?e+1:e),b=()=>({...h(`success`),outDegrees:[..._],fingerprintDistance:Im(p.distinctStates,p.generatedStates,()=>x?x.getStoredFingerprints(T,E):BigInt64Array.from(T,p.getFingerprint))}),x=vh(n,f,()=>gf(e.source,e.loadModule,`variable`)),te=_h(c.assumptions,f);if(te)return h(`assumption-violation`,te);if(!x)return b();let ne=n.postconditions.length>0||n.possible.length>0,re=(e,t,n)=>{if(ne){let e=t.loopStart;p.counterExample=lu(t.trace,e===void 0||!n?void 0:{start:e,action:n()})}let r=x.findUnwitnessedPossible();return r||x.findPostconditionViolation(),h(e,r?{...t,unwitnessed:r}:t)},S=x.spec,ie=x.getFingerprintState,ae={value:void 0},oe=n.view!==void 0||n.symmetry!==void 0,C=[],w=a(()=>Mp(x.properties.liveness,S.temporals,f,{getFingerprint:e=>C[e]??=Number(BigInt.asIntN(32,p.getFingerprint(T[e]))),getSuccessors:e=>{let t=[];return S.next===void 0||Ua(S.next,e,f,n=>{if(ue(n.state),!(x.satisfiesConstraints(n.state,e)&&x.satisfiesActionConstraints(e,n.state)))return!1;let r=ie(n.state),i=we(Se(r),r);return t.push({index:i,state:n.state}),!1},S.scope),t}})),se=x.isSymmetric||w!==void 0,T=[],E=[],D=[],O=[],k=[],le={slots:new Int32Array(1<<17),size:0,shift:16},ue=Hn(),de=e=>Object.fromEntries(x.getTlcOrder().map(t=>[f.variables[t],e[t]])),fe=(e,t,n,r)=>(p.getLevel=()=>n+1,p.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),A(e,t[n].state,(t[n+1]??t[r??n]).state)),A=(e,t,n)=>{try{let r=Wm(`alias`,e,f).body,i=X(Vm(e),uh(f,t,n)),a=r.kind===`Record`?r.fields.map(e=>e.name):[];return Jm(i,a)??de(t)}catch(e){if(!(e instanceof l||e instanceof u))throw e;return{...de(t),_ALIASEvalError:e.message}}},pe=(e,t,r)=>{ae.value??=tm(n,f,c.instanceActions);let i={...P};Object.assign(P,{index:e,isExpanding:!0,candidate:void 0});let a=ie(r),o=ae.value.find(e=>Wa(e.expression,t,f,e.scope).some(e=>Ce(ie(e.state),a)));return Object.assign(P,i),o&&rm(o)},j=(e,t,r)=>{let i=n.alias,a=s(()=>(e.length>1&&es(f)&&M(),e.map((n,r)=>r===0||n.action===`Stuttering`?void 0:pe(t[r-1],e[r-1].state,n.state))));return e.map((t,n)=>({action:t.action,label:a[n],state:i===void 0?de(t.state):fe(i,e,n,r)}))},M=()=>S.init===void 0?[]:Ha(S.init,f,S.scope),me=e=>S.next===void 0?[]:Wa(S.next,e,f,S.scope),he=(e,t)=>Ce(ie(e),E[t]),ge=(e,t)=>me(e).find(e=>he(e.state,t)),_e=(e,t)=>{let n=oe||es(f)?M().find(t=>he(t,e[0])):T[e[0]];if(!n)throw new u(zm);let r=[{state:n,action:void 0}];for(let n=1;n<e.length;n++){let i=r[n-1].state;if(e[n-1]===e[n]){r.push({state:i,action:`Stuttering`});continue}let a=ge(i,e[n]);if(!a)throw new u(t);r.push(a)}return r},ve=(e,t)=>{let n=[];for(let t=e;t!==-1;t=D[t])n.unshift(t);let r=oe&&n.length>1?_e(n,zm):n.map(e=>({state:T[e],action:O[e]}));if(!t)return j(r,n);let i=oe?me(T[e]).find(e=>Ce(e.state,t.state))?.action:t.action;return j([...r,{state:t.state,action:i}],n)},ye=e=>D[e]===-1?[{action:void 0,label:void 0,state:de(T[e])}]:ve(e),be=(e,t,n,r)=>{if(!(e instanceof u))throw e;return{...h(`error`,void 0,{message:e.message,trace:t,initialState:n&&!(e instanceof d)?de(n):void 0,exitCode:g(e)}),outDegrees:r}},xe=(e,t)=>{let n=_e(e,Bm),r=n[n.length-1].state;if(oe&&t!==void 0&&t!==e.length-1&&ge(r,e[t])===void 0)throw new u(Bm);return n},Se=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=vn(t,Cn(e[n]));return t&1073741823},Ce=(e,t)=>{for(let n=0;n<t.length;n++)if(!Be(e[n],t[n]))return!1;return!0},N=e=>Math.imul(e,2654435761)>>>le.shift<<1,we=(e,t)=>{let n=le.slots.length-1;for(let r=N(e);;r=r+2&n){let n=le.slots[r+1];if(n===0)return-1;if(le.slots[r]===e&&Ce(E[n-1],t))return n-1}},Te=(e,t)=>{let n=le.slots.length-1,r=N(e);for(;le.slots[r+1]!==0;)r=r+2&n;le.slots[r]=e,le.slots[r+1]=t},Ee=(e,t)=>{if(le.size++,le.size*4>le.slots.length){let e=le.slots;le.slots=new Int32Array(e.length*2),le.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&Te(e[t],e[t+1])}Te(e,t+1)},Oe=e=>{p.distinctStates=T.length+1,m.depth=Math.max(m.depth,e),p.diameter=Math.max(p.diameter,e)},ke=(e,t,n,r)=>{let i=n===-1?1:k[n]+1;T.push(e),E.push(t),D.push(n),O.push(r),k.push(i)},P={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},Ae=e=>e===-1?[]:[...Ae(D[e]),T[e]];p.isSeen=e=>{let t=ie(e);return we(Se(t),t)!==-1},p.getBehavior=e=>{let t=e===P.candidate?-1:T.indexOf(e);return t===-1?[...Ae(P.index),e]:Ae(t)},p.getCurrentState=()=>P.index===-1?void 0:T[P.index],p.setLivenessSource=e=>{P.livenessSource=e??-1},p.getLevel=e=>{let t=P.livenessSource;return t===-1?e===P.candidate?P.candidateLevel:P.index===-1?0:e===T[P.index]?k[P.index]:P.isExpanding?k[P.index]+1:0:e===T[t]?k[t]:k[t]+1};let F=(e,t)=>({fingerprint:BigInt.asIntN(64,p.getFingerprint(e)),level:t,getLabel:()=>Bn(n.alias===void 0?de(e):A(n.alias,e,void 0)),getText:()=>Bn(de(e))}),je=e=>{ue(e),p.generatedStates++,p.initialStates++,P.candidate=e,P.candidateLevel=1;let n=ie(e),r=Se(n),i=x.satisfiesConstraints(e);if(i&&x.trackStatePossible(e),i&&we(r,n)!==-1)return;i&&(Oe(1),p.queueSize++,w?.addInitialState(T.length,e),t?.writeInitialState(F(e,1)));let a=x.findViolatedInvariant(e);if(a)return re(`invariant-violation`,{name:a.name,trace:j([{action:void 0,state:e}],[])});let o=x.findFailedInitialPredicate(e);if(o)return re(`liveness-violation`,{name:o.name,trace:j([{action:void 0,state:e}],[])});i&&(Ee(r,T.length),ke(e,n,-1,void 0))},Me=(e,n,r,i,a)=>{let o=T[e];p.generatedStates++,P.candidate=n.state,P.candidateLevel=k[e]+1,se&&ue(n.state);let s=ie(n.state),c=Se(s),l=we(c,s),u=x.satisfiesConstraints(n.state,o);u&&x.trackStatePossible(n.state);let d=u&&x.satisfiesActionConstraints(o,n.state);d&&x.trackActionPossible(o,n.state);let f=d?l:-1;if(i&&d&&t?.writeSuccessor(i,F(n.state,k[e]+1),f!==-1,a&&{name:a.name,signature:im(a)}),f!==-1&&w){let e=T[f],t=e.every((e,t)=>e===n.state[t]);r.push({index:f,state:t?e:n.state})}let m=d&&f===-1;if(m&&(Oe(k[e]+1),v.newStates++),f===-1)try{let t=x.findViolatedInvariant(n.state,o);if(t)return re(`invariant-violation`,{name:t.name,trace:ve(e,n)})}catch(t){return be(t,ve(e,n),void 0,ee())}let h=x.findViolatedActionProperty(o,n.state);if(h)return re(`liveness-violation`,{name:h.name,trace:ve(e,n)});m&&(se||ue(n.state),Ee(c,T.length),w&&r.push({index:T.length,state:n.state}),ke(n.state,s,e,n.action),p.queueSize++)},I={result:void 0};if(S.init!==void 0)try{Va(S.init,f,e=>{try{I.result=je(e)}catch(t){I.result=be(t,[],e)}return I.result!==void 0},S.scope)}catch(e){return be(e,[])}if(I.result)return I.result;let Ne=S.next;if(Ne===void 0){if(T.length>0)throw new u(`No next state actions defined to generate successor states from.`);return b()}let L=!!(e.dump?.dot&&(e.dump.actionLabels||e.dump.colorize)),Pe=(e,t)=>{if(!L)return Ua(Ne,e,f,e=>t(e,void 0),S.scope);ae.value??=tm(n,f,c.instanceActions);let r={isStopped:!1};return ae.value.reduce((n,i)=>r.isStopped?n:n+Ua(i.expression,e,f,e=>(r.isStopped=t(e,i),r.isStopped),i.scope),0)},Fe=e=>{let r=T[e],i=[],a=t&&F(r,k[e]),o=Pe(r,(t,n)=>{try{I.result=Me(e,t,i,a,n)}catch(n){I.result=be(n,ve(e,t))}return I.result!==void 0});if(P.isExpanding=!1,I.result)return I.result;if(o===0&&n.checkDeadlock)return re(`deadlock`,{name:`deadlock`,trace:ye(e)});try{let t=w?.addState(e,r,i);if(!w||!t)return;let n=xe(t),a=w.getViolatedProperties(n.map(e=>e.state),n.length-1);return re(`property-violation`,{name:a[0],properties:a,trace:j(n,t)})}catch(t){return be(t,ye(e),void 0,ee())}},Ie=(e,t)=>{let n=[...t.prefix,...t.cycle],r=t.prefix.length,i=xe(n,r),a=j(i,n,r),o=e.getViolatedProperties(i.map(e=>e.state),r),c=n[r],l=n[n.length-1],u=i[i.length-1].state,d=c===l?void 0:s(()=>pe(l,u,T[c]));return re(`liveness-violation`,{name:o[0],properties:o,trace:a,loopStart:r,loopLabel:d},()=>c===l?a[a.length-1].action:ge(u,c)?.action)},Le=w!==void 0&&e.livenessCheck!==`final`,Re=performance.now(),ze={at:Re+3e3,size:1,time:0},Ve=e=>{let t=performance.now();if(ze.at=t+6e4,!((e-ze.size)/ze.size>.1)||ze.time>(t-Re)*.2)return;ze.size=e;let n=w?.findViolation();return ze.time+=performance.now()-t,n};for(let e=0;e<T.length&&!p.isStopped;e++){P.index=e,P.candidate=void 0,p.queueSize=T.length-e-1,P.isExpanding=!0;try{I.result=Fe(e)}catch(t){I.result=be(bh(t),ye(e))}if(I.result)return I.result;if(_[y()]++,v.newStates=0,Le&&performance.now()>=ze.at){let t=Ve(e+1);if(w&&t)return Ie(w,t)}}P.index=-1,P.candidate=void 0;let He=w?.findViolation();if(w&&He)return Ie(w,He);let Ue=x.findPostconditionViolation();return Ue?h(`postcondition-violation`,{...Ue,trace:[]}):b()},wh=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Th=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Cn(e[t]),16777619),r=Math.imul(r^An(e[t]),1540483477);t[0]=wh(n)||1,t[1]=wh(r)},Eh=()=>{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)}}},Dh=(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}},Oh=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),kh=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return Dh(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},Ah=e=>Atomics.load(e.used,0)*2>=e.slots.length,jh=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&Dh(t,n);return{slots:t,used:e.used}},Mh=()=>{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=pn(e.domain);return t?(r(7),r(t.low),r(e.range.length),e.range.every(a)):(r(6),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})}},Nh=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 Fe(t.strings[n[r.index++]]);if(e===7){let e=n[r.index++],t=n[r.index++],a=Dt({kind:`Interval`,low:e,high:e+t-1});return Le(a,i(t))}let a=n[r.index++];if(e===5)return Ie(i(a));let o=i(a);return Le(o,i(a))};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return ce}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return e}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Ha}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return U}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Bn}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return p}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return c}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return h}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return l}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return s}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return ke}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return u}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return m}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return es}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Hn}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return Df}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return jh}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return wc}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return Th}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return _h}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return Nm}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return Lm}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return km}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return Oh}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return se}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return De}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return Sh}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return Im}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return Mh}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return kh}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return Fm}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return Eh}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return Ah}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return Nh}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return vh}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return gf}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Wa}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return Tc}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return _f}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return g}});
|
|
424
|
+
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw n(new d(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${r}`),e.safetyEvaluationFailure)}return[{name:t,expression:Um(t),scope:void 0}]})},Xm=(e,t)=>{if(!N(e))return;let n=H(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},Zm=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Zm(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=uo(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Zm(n.body,t)}return[e]},Qm=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||$(r,e.scope,t)>0)return!1;let i=X(r,fh(t,void 0,void 0,e.scope));if(i===!1)throw new d(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new d(`The operator ${r.name}, which equals ${U(i)},\ncannot be used as a ${n}`);return!0},$m=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e===void 0)return;let n=Gm(t,e,r).body,i=Um(e);if(n.kind!==`Number`&&n.kind!==`String`&&$(i,void 0,r)===0)throw new d(`The ${t} ${e} cannot be a constant.`);return i};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}let i=[],a=[],o=[],s=Gm(`name`,t.specification,r),c=qm(t.specification,s,r);if(c!==void 0)throw new d(`The value of ${t.specification} is equal to ${U(c)}`);if(yp(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(Qm(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new d(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){a.push({expression:c.expression.action,scope:s.scope});return}if(c.kind===`Always`&&$(c.expression,s.scope,r)<2)throw n(new d(`TLC cannot handle the temporal formula ${Ya(c.expression)}`),e.error);let l=$(c,s.scope,r);if(l===3)o.push(s);else{if(l===2)throw new d(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new d(`The specification ${t.specification} must contain at most one [][Next]_vars`);let l=[...i,...a],u=e=>`$specification${e}`,f=l.reduce((e,t,n)=>t.scope===void 0?e:{name:u(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0},parent:e},void 0),p=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:u(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:i.length===0?void 0:{kind:`And`,operands:i.map(p),location:Bm},next:a.length===0?void 0:p(a[0],i.length),scope:f,temporals:o}},eh=(e,t)=>{let n={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let r=Jm(`property`,e,t);r&&yp(r.body,void 0,t,!0,e).forEach(r=>{let i=r.expression;if(Qm(r,t,`property`))return;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){n.actionProperties.push({name:r.name,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:r.scope});return}if(i.kind===`Always`&&$(i.expression,r.scope,t)<=1){let e=i.expression;n.invariants.push({name:e.kind===`Identifier`?e.name:r.name,expression:e,scope:r.scope});return}let a=$(i,r.scope,t);if(a<2)n.initialPredicates.push({name:r.name,expression:i,scope:r.scope});else{if(a===2)throw new d(`The property ${e} is an action-level formula`);n.liveness.push({name:e,expression:i,scope:r.scope})}})}),n},th=(e,t,n)=>t.flatMap(t=>Jm(e,t,n)?[{name:t,expression:Um(t),scope:void 0}]:[]),nh=(e,t)=>{let n=uo(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},rh=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new d(`_POSSIBLE lists ${n} more than once`);Km(`possible`,n,t);let i=Um(n);if($(i,void 0,t)===3)throw new d(`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}}),ih=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||W(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},ah=(e,t)=>e.flatMap(e=>Zm(e.expression,t).map(n=>{let r=e.scope===void 0?Ks(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:ih(n,r,t)}})),oh=(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},sh=/[\u0100-\uffff]/,ch=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),lh=e=>e.kind===`String`?sh.test(e.value):e.kind===`Set`&&e.elements.some(lh),uh=e=>e.kind===`String`&&sh.test(e.value)||e.kind===`Apply`&&ch.has(e.operator)||Gn(e).some(uh),dh=(e,t)=>e.constants.some(e=>lh(e.value)||(e.args??[]).some(lh))||[...t.definitions.values()].some(e=>uh(e.body)||e.kind===`Function`&&e.bounds.some(e=>uh(e.set))),fh=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),ph=(e,t,n)=>lo(X(e,t),n),mh=(e,t,n=hh)=>{let r=X(e,t);if(typeof r!=`boolean`)throw new f(n(e,t.environment));return r},hh=(e,t)=>{let n=e.kind===`Identifier`?uo(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. ${r.kind===`Number`?r.text??String(r.value):i?Ja(i):Ya(r)}`},gh=()=>{},_h=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=ph(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),vh=(e,t,n)=>{try{return ph(e,fh(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof f)return{message:e.message};throw e}},yh=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=vh(n.expression,t,`an assumption`);if(e)return{name:Ya(n.expression),trace:[],message:e.message}}},bh=(t,r,i)=>{let a=Ym(t.invariants,r),s=$m(t,r),c=eh(t,r),l=ah([...a,...c.invariants],r),u=l.length>0||c.actionProperties.length>0||c.liveness.length>0;if(s.init===void 0&&(u||c.initialPredicates.length>0||r.variables.length>0))throw new d(`The configuration file did not specify the initial state predicate.`);if(s.next===void 0&&u)throw new d(`The configuration file did not specify the next state predicate.`);let f=ah(th(`constraint`,t.constraints,r),r),p=th(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&Gm(`rlreward`,t.rlReward,r),t.periodic!==void 0&&Gm(`periodic`,t.periodic,r);let m=rh(t.possible,r);if(r.variables.length===0)return;let h=t.symmetry===void 0?[]:Sm(t.symmetry,r);t.view!==void 0&&Gm(`view function`,t.view,r);let g=t.view===void 0?void 0:{name:t.view,expression:Um(t.view),scope:void 0},_=c.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Bm};return{...e,unchanged:t}}),v=e=>$(e.expression,void 0,r)>=2,y=m.filter(e=>!v(e)),b=m.filter(v),x=r.runtime,S={indices:void 0},ee=()=>{if(S.indices)return S.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return S.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),S.indices},te=h.length>0?ee():void 0,C=(e,t)=>X(e,fh(r,t,void 0)),w=e=>{let t=ee(),n=h.length===0?e:Am(e,h,t);return Uc(g===void 0?t.map(e=>n[e]):[C(g.expression,n)])},ne=dh(t,r);x.getFingerprint=w;let re=()=>{let e=m.find(e=>!x.possibleCounts.get(e.name));if(!e)return;let t=nh(e.name,r),n=t?` at ${Ja(t)}`:``;return{name:e.name,message:`The _POSSIBLE predicate ${e.name}${n} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:j(U(cl(x),!0))}};return{properties:c,spec:s,isSymmetric:h.length>0,getTlcOrder:ee,getStoredFingerprints:(e,t)=>{if(g!==void 0||ne)return BigInt64Array.from(e,w);let n=new BigInt64Array(t.length),r=Kc(ee(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(ne)return[String(w(e))];let t=h.length===0?e:Am(e,h,te);return g===void 0?t:[C(g.expression,t)]},findViolatedInvariant:(t,i)=>l.find(a=>{if(oh(a,t,i))return!1;try{let e=fh(r,t,void 0,a.scope),n=a.membership;return i&&n?!nn(t[n.variable],i[n.variable],X(n.set,e)):!mh(a.expression,e)}catch(t){throw i?Ch(n(t,e.safetyEvaluationFailure),`Evaluating invariant ${a.name} failed.`):t}}),satisfiesConstraints:(e,t)=>f.every(n=>oh(n,e,t)||mh(n.expression,fh(r,e,void 0))),findFailedInitialPredicate:e=>c.initialPredicates.find(t=>!mh(t.expression,fh(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>_.find(n=>{try{return!mh(n.action,fh(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Ya(n.box)}`)&&!ph(n.unchanged,fh(r,e,t,n.scope),`a subscript`)}catch(e){throw Ch(xh(e),`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>p.every(n=>mh(n.expression,fh(r,e,t),e=>`${o}${hh(e,r)}`)),trackStatePossible:y.length===0?gh:e=>_h(y,x,fh(r,e,void 0)),trackActionPossible:b.length===0?gh:(e,t)=>_h(b,x,fh(r,e,t)),findUnwitnessedPossible:re,findPostconditionViolation:()=>{let e=re();if(e)return e;for(let e of t.postconditions){let t=vh(Um(e),r,`a postcondition`);if(t)return{name:e,message:t.message??`Postcondition ${e} is false.`}}}}},xh=e=>e instanceof p?n(e,e.exitCode):e,Sh=e=>e instanceof f&&!(e instanceof p)&&!(e instanceof m)?n(new f(`${o}${e.message}`,e),v(e)):xh(e),Ch=(e,t)=>e instanceof f?n(new f(`${t}\n${e.message}`,e),v(e)):e,wh=t=>{let r=t.dump&&_m(t.dump,t.writeFile);try{return Th(t,r)}catch(t){throw c(t)?n(new f(s),e.error):t}finally{r?.close()}},Th=(t,r)=>{let i=typeof t.config==`string`?se(t.config):t.config,o=t.onPrint??console.log,l={isMuted:!1},u=e=>{l.isMuted||o(e)},m=e=>{l.isMuted=!0;let t=e();return l.isMuted=!1,t};De(yf(t.source,i,t.loadModule));let h=kf(i,{source:t.source,loadModule:t.loadModule,loadClass:t.loadClass,print:u,files:{readFile:t.readFile,writeFile:t.writeFile},seed:t.seed}),g=h.environment,_=g.runtime;_.pause=t.onPause??(()=>{}),_.getSpecification=()=>sm(i,g,h.variableLocations,h.instanceActions);let y={depth:0},b=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:_.generatedStates,distinctStates:_.distinctStates,queuedStates:_.queueSize,depth:_.generatedStates===0?0:Math.max(y.depth,1),outDegrees:void 0,fingerprintDistance:void 0}),x=Array.from({length:32},()=>0),S={newStates:0},ee=()=>Math.min(S.newStates,31),te=()=>x.map((e,t)=>t===ee()?e+1:e),C=()=>({...b(`success`),outDegrees:[...x],fingerprintDistance:Rm(_.distinctStates,_.generatedStates,()=>w?w.getStoredFingerprints(A,ce):BigInt64Array.from(A,_.getFingerprint))}),w=bh(i,g,()=>vf(t.source,t.loadModule,`variable`)),ne=yh(h.assumptions,g);if(ne)return b(`assumption-violation`,ne);if(!w)return C();let re=i.postconditions.length>0||i.possible.length>0,ie=(e,t,n)=>{if(re){let e=t.loopStart;_.counterExample=du(t.trace,e===void 0||!n?void 0:{start:e,action:n()})}let r=w.findUnwitnessedPossible();return r||w.findPostconditionViolation(),b(e,r?{...t,unwitnessed:r}:t)},T=w.spec,E=w.getFingerprintState,D={value:void 0},O=i.view!==void 0||i.symmetry!==void 0,ae=[],k=a(()=>Pp(w.properties.liveness,T.temporals,g,{getFingerprint:e=>ae[e]??=Number(BigInt.asIntN(32,_.getFingerprint(A[e]))),getSuccessors:e=>{let t=[];return T.next===void 0||Ga(T.next,e,g,n=>{if(j(n.state),!(w.satisfiesConstraints(n.state,e)&&w.satisfiesActionConstraints(e,n.state)))return!1;let r=E(n.state),i=Ee(Ce(r),r);return t.push({index:i,state:n.state}),!1},T.scope),t}})),oe=w.isSymmetric||k!==void 0,A=[],ce=[],le=[],ue=[],de=[],fe={slots:new Int32Array(1<<17),size:0,shift:16},j=Wn(),M=e=>Object.fromEntries(w.getTlcOrder().map(t=>[g.variables[t],e[t]])),pe=(e,t,n,r)=>(_.getLevel=()=>n+1,_.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),N(e,t[n].state,(t[n+1]??t[r??n]).state)),N=(e,t,n)=>{try{let r=Km(`alias`,e,g).body,i=X(Um(e),fh(g,t,n)),a=r.kind===`Record`?r.fields.map(e=>e.name):[];return Xm(i,a)??M(t)}catch(e){if(!(e instanceof d||e instanceof f))throw e;return{...M(t),_ALIASEvalError:e.message}}},P=(e,t,n)=>{D.value??=rm(i,g,h.instanceActions);let r={...I};Object.assign(I,{index:e,isExpanding:!0,candidate:void 0});let a=E(n),o=D.value.find(e=>Ka(e.expression,t,g,e.scope).some(e=>we(E(e.state),a)));return Object.assign(I,r),o&&am(o)},me=(e,t,n)=>{let r=i.alias,a=m(()=>(e.length>1&&ns(g)&&he(),e.map((n,r)=>r===0||n.action===`Stuttering`?void 0:P(t[r-1],e[r-1].state,n.state))));return e.map((t,i)=>({action:t.action,label:a[i],state:r===void 0?M(t.state):pe(r,e,i,n)}))},he=()=>T.init===void 0?[]:Wa(T.init,g,T.scope),ge=e=>T.next===void 0?[]:Ka(T.next,e,g,T.scope),_e=(e,t)=>we(E(e),ce[t]),ve=(e,t)=>ge(e).find(e=>_e(e.state,t)),ye=(e,t)=>{let n=O||ns(g)?he().find(t=>_e(t,e[0])):A[e[0]];if(!n)throw new f(Vm);let r=[{state:n,action:void 0}];for(let n=1;n<e.length;n++){let i=r[n-1].state;if(e[n-1]===e[n]){r.push({state:i,action:`Stuttering`});continue}let a=ve(i,e[n]);if(!a)throw new f(t);r.push(a)}return r},be=(e,t)=>{let n=[];for(let t=e;t!==-1;t=le[t])n.unshift(t);let r=O&&n.length>1?ye(n,Vm):n.map(e=>({state:A[e],action:ue[e]}));if(!t)return me(r,n);let i=O?ge(A[e]).find(e=>we(e.state,t.state))?.action:t.action;return me([...r,{state:t.state,action:i}],n)},xe=e=>le[e]===-1?[{action:void 0,label:void 0,state:M(A[e])}]:be(e),F=(t,r,i,a)=>{if(c(t))return I.isExpanding?F(n(new f(s),e.error),xe(I.index)):F(new f(s),r,i);if(!(t instanceof f))throw t;return{...b(`error`,void 0,{message:t.message,trace:r,initialState:i&&!(t instanceof p)?M(i):void 0,exitCode:v(t)}),outDegrees:a}},Se=(e,t)=>{let n=ye(e,Hm),r=n[n.length-1].state;if(O&&t!==void 0&&t!==e.length-1&&ve(r,e[t])===void 0)throw new f(Hm);return n},Ce=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=bn(t,Tn(e[n]));return t&1073741823},we=(e,t)=>{for(let n=0;n<t.length;n++)if(!He(e[n],t[n]))return!1;return!0},Te=e=>Math.imul(e,2654435761)>>>fe.shift<<1,Ee=(e,t)=>{let n=fe.slots.length-1;for(let r=Te(e);;r=r+2&n){let n=fe.slots[r+1];if(n===0)return-1;if(fe.slots[r]===e&&we(ce[n-1],t))return n-1}},Oe=(e,t)=>{let n=fe.slots.length-1,r=Te(e);for(;fe.slots[r+1]!==0;)r=r+2&n;fe.slots[r]=e,fe.slots[r+1]=t},ke=(e,t)=>{if(fe.size++,fe.size*4>fe.slots.length){let e=fe.slots;fe.slots=new Int32Array(e.length*2),fe.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&Oe(e[t],e[t+1])}Oe(e,t+1)},Ae=e=>{_.distinctStates=A.length+1,y.depth=Math.max(y.depth,e),_.diameter=Math.max(_.diameter,e)},je=(e,t,n,r)=>{let i=n===-1?1:de[n]+1;A.push(e),ce.push(t),le.push(n),ue.push(r),de.push(i)},I={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},Me=e=>e===-1?[]:[...Me(le[e]),A[e]];_.isSeen=e=>{let t=E(e);return Ee(Ce(t),t)!==-1},_.getBehavior=e=>{let t=e===I.candidate?-1:A.indexOf(e);return t===-1?[...Me(I.index),e]:Me(t)},_.getCurrentState=()=>I.index===-1?void 0:A[I.index],_.setLivenessSource=e=>{I.livenessSource=e??-1},_.getLevel=e=>{let t=I.livenessSource;return t===-1?e===I.candidate?I.candidateLevel:I.index===-1?0:e===A[I.index]?de[I.index]:I.isExpanding?de[I.index]+1:0:e===A[t]?de[t]:de[t]+1};let Ne=(e,t)=>({fingerprint:BigInt.asIntN(64,_.getFingerprint(e)),level:t,getLabel:()=>Hn(i.alias===void 0?M(e):N(i.alias,e,void 0)),getText:()=>Hn(M(e))}),Pe=e=>{j(e),_.generatedStates++,_.initialStates++,I.candidate=e,I.candidateLevel=1;let t=E(e),n=Ce(t),i=w.satisfiesConstraints(e);if(i&&w.trackStatePossible(e),i&&Ee(n,t)!==-1)return;i&&(Ae(1),_.queueSize++,k?.addInitialState(A.length,e),r?.writeInitialState(Ne(e,1)));let a=w.findViolatedInvariant(e);if(a)return ie(`invariant-violation`,{name:a.name,trace:me([{action:void 0,state:e}],[])});let o=w.findFailedInitialPredicate(e);if(o)return ie(`liveness-violation`,{name:o.name,trace:me([{action:void 0,state:e}],[])});i&&(ke(n,A.length),je(e,t,-1,void 0))},Fe=(e,t,n,i,a)=>{let o=A[e];_.generatedStates++,I.candidate=t.state,I.candidateLevel=de[e]+1,oe&&j(t.state);let s=E(t.state),c=Ce(s),l=Ee(c,s),u=w.satisfiesConstraints(t.state,o);u&&w.trackStatePossible(t.state);let d=u&&w.satisfiesActionConstraints(o,t.state);d&&w.trackActionPossible(o,t.state);let f=d?l:-1;if(i&&d&&r?.writeSuccessor(i,Ne(t.state,de[e]+1),f!==-1,a&&{name:a.name,signature:om(a)}),f!==-1&&k){let e=A[f],r=e.every((e,n)=>e===t.state[n]);n.push({index:f,state:r?e:t.state})}let p=d&&f===-1;if(p&&(Ae(de[e]+1),S.newStates++),f===-1)try{let n=w.findViolatedInvariant(t.state,o);if(n)return ie(`invariant-violation`,{name:n.name,trace:be(e,t)})}catch(n){return F(n,be(e,t),void 0,te())}let m=w.findViolatedActionProperty(o,t.state);if(m)return ie(`liveness-violation`,{name:m.name,trace:be(e,t)});p&&(oe||j(t.state),ke(c,A.length),k&&n.push({index:A.length,state:t.state}),je(t.state,s,e,t.action),_.queueSize++)},L={result:void 0};if(T.init!==void 0)try{Ua(T.init,g,e=>{try{L.result=Pe(e)}catch(t){L.result=F(t,[],e)}return L.result!==void 0},T.scope)}catch(e){return F(e,[])}if(L.result)return L.result;let Ie=T.next;if(Ie===void 0){if(A.length>0)throw new f(`No next state actions defined to generate successor states from.`);return C()}let Le=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),Re=(e,t)=>{if(!Le)return Ga(Ie,e,g,e=>t(e,void 0),T.scope);D.value??=rm(i,g,h.instanceActions);let n={isStopped:!1};return D.value.reduce((r,i)=>n.isStopped?r:r+Ga(i.expression,e,g,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},ze=e=>{let t=A[e],n=[],a=r&&Ne(t,de[e]),o=Re(t,(t,r)=>{try{L.result=Fe(e,t,n,a,r)}catch(n){L.result=F(n,be(e,t))}return L.result!==void 0});if(I.isExpanding=!1,L.result)return L.result;if(o===0&&i.checkDeadlock)return ie(`deadlock`,{name:`deadlock`,trace:xe(e)});try{let r=k?.addState(e,t,n);if(!k||!r)return;let i=Se(r),a=k.getViolatedProperties(i.map(e=>e.state),i.length-1);return ie(`property-violation`,{name:a[0],properties:a,trace:me(i,r)})}catch(t){return F(t,xe(e),void 0,te())}},Be=(e,t)=>{let n=[...t.prefix,...t.cycle],r=t.prefix.length,i=Se(n,r),a=me(i,n,r),o=e.getViolatedProperties(i.map(e=>e.state),r),s=n[r],c=n[n.length-1],l=i[i.length-1].state,u=s===c?void 0:m(()=>P(c,l,A[s]));return ie(`liveness-violation`,{name:o[0],properties:o,trace:a,loopStart:r,loopLabel:u},()=>s===c?a[a.length-1].action:ve(l,s)?.action)},Ve=k!==void 0&&t.livenessCheck!==`final`,Ue=performance.now(),We={at:Ue+3e3,size:1,time:0},Ge=e=>{let t=performance.now();if(We.at=t+6e4,!((e-We.size)/We.size>.1)||We.time>(t-Ue)*.2)return;We.size=e;let n=k?.findViolation();return We.time+=performance.now()-t,n};for(let e=0;e<A.length&&!_.isStopped;e++){I.index=e,I.candidate=void 0,_.queueSize=A.length-e-1,I.isExpanding=!0;try{L.result=ze(e)}catch(t){L.result=F(Sh(t),xe(e))}if(L.result)return L.result;if(x[ee()]++,S.newStates=0,Ve&&performance.now()>=We.at){let t=Ge(e+1);if(k&&t)return Be(k,t)}}I.index=-1,I.candidate=void 0;let Ke=k?.findViolation();if(k&&Ke)return Be(k,Ke);let qe=w.findPostconditionViolation();return qe?b(`postcondition-violation`,{...qe,trace:[]}):C()},Eh=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Dh=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Tn(e[t]),16777619),r=Math.imul(r^Mn(e[t]),1540483477);t[0]=Eh(n)||1,t[1]=Eh(r)},Oh=()=>{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)}}},kh=(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}},Ah=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),jh=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return kh(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},Mh=e=>Atomics.load(e.used,0)*2>=e.slots.length,Nh=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&kh(t,n);return{slots:t,used:e.used}},Ph=()=>{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=hn(e.domain);return t?(r(7),r(t.low),r(e.range.length),e.range.every(a)):(r(6),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})}},Fh=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 Le(t.strings[n[r.index++]]);if(e===7){let e=n[r.index++],t=n[r.index++],a=kt({kind:`Interval`,low:e,high:e+t-1});return ze(a,i(t))}let a=n[r.index++];if(e===5)return Re(i(a));let o=i(a);return ze(o,i(a))};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return se}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return e}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Wa}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return U}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Hn}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return h}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return u}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return _}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return d}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return l}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return ke}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return f}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return g}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return ns}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Wn}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return kf}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return Nh}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return Ec}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return Dh}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return yh}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return Fm}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return zm}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return jm}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return Ah}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return ae}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return De}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return wh}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return Rm}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return Ph}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return jh}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return Lm}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return Oh}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return Mh}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return Fh}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return bh}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return vf}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Ka}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return Dc}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return yf}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return v}});
|