tla-ts 0.0.3-dev.037ac3b → 0.0.3-dev.0e500e5

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (47) hide show
  1. package/dist/index.cjs +1 -1
  2. package/dist/index.d.cts +58 -22
  3. package/dist/index.d.ts +58 -22
  4. package/dist/index.js +1 -1
  5. package/dist/parallel-worker.cjs +1 -1
  6. package/dist/parallel-worker.js +2 -2
  7. package/dist/parallel.cjs +1 -1
  8. package/dist/parallel.js +2 -2
  9. package/dist/run-cli.cjs +14 -12
  10. package/dist/run-cli.js +22 -20
  11. package/dist/transfer.cjs +39 -21
  12. package/dist/transfer.js +39 -21
  13. package/package.json +1 -1
  14. package/src/ast.ts +26 -4
  15. package/src/builtins.ts +9 -3
  16. package/src/check.ts +309 -61
  17. package/src/codegen.ts +6 -3
  18. package/src/config.ts +224 -170
  19. package/src/environment.ts +223 -84
  20. package/src/errors.ts +100 -1
  21. package/src/evaluate.ts +172 -19
  22. package/src/exit-codes.ts +22 -3
  23. package/src/fingerprints.ts +2 -1
  24. package/src/instances.ts +1 -1
  25. package/src/levels.ts +176 -36
  26. package/src/live-check.ts +129 -49
  27. package/src/liveness.ts +68 -10
  28. package/src/parallel-worker.ts +2 -2
  29. package/src/parallel.ts +2 -2
  30. package/src/parser.ts +152 -48
  31. package/src/resolve.ts +878 -338
  32. package/src/run-cli.ts +61 -11
  33. package/src/sany-lexer.ts +615 -0
  34. package/src/sany-parse-error.ts +3143 -0
  35. package/src/spec-description.ts +1 -2
  36. package/src/standard-modules.ts +52 -38
  37. package/src/standard-ranges.ts +116 -0
  38. package/src/subexpressions.ts +25 -13
  39. package/src/substitution-levels.ts +38 -17
  40. package/src/successors.ts +111 -31
  41. package/src/symmetry.ts +16 -6
  42. package/src/tableau.ts +1 -1
  43. package/src/tlc-module.ts +6 -6
  44. package/src/tlc-modules.ts +4 -0
  45. package/src/tlc-order.ts +8 -4
  46. package/src/value-sources.ts +29 -0
  47. package/src/values.ts +184 -51
package/dist/transfer.cjs CHANGED
@@ -6,21 +6,31 @@
6
6
  * This source code is licensed under the MIT license found in the
7
7
  * LICENSE file in the root directory of this source tree.
8
8
  */
9
- const e={success:0,assumptionViolation:10,deadlock:11,safetyViolation:12,livenessViolation:13,assertViolation:14,specEvaluationFailure:75,safetyEvaluationFailure:76,livenessEvaluationFailure:77,specParseError:150,configParseError:151,error:255},t=/* @__PURE__ */ new WeakMap,n=(e,n)=>(e instanceof Error&&!t.has(e)&&t.set(e,n),e),r=e=>t.get(e),i=t=>{try{return t()}catch(t){throw n(t,e.error)}},a=e=>{let t=i(e);return t&&{addInitialState:(e,n)=>i(()=>t.addInitialState(e,n)),addState:(e,n,r)=>i(()=>t.addState(e,n,r)),findViolation:()=>i(()=>t.findViolation()),getViolatedProperties:(e,n)=>i(()=>t.getViolatedProperties(e,n))}},o=`TLC threw an unexpected exception.
9
+ const e={success:0,assumptionViolation:10,deadlock:11,safetyViolation:12,livenessViolation:13,assertViolation:14,specEvaluationFailure:75,safetyEvaluationFailure:76,livenessEvaluationFailure:77,specParseError:150,configParseError:151,error:255},t=/* @__PURE__ */ new WeakMap,n=(e,n)=>(e instanceof Error&&!t.has(e)&&t.set(e,n),e),r=e=>t.get(e),i=/* @__PURE__ */ new WeakMap,a=(e,t)=>(i.set(e,t),e),o=e=>e instanceof Error?i.get(e):void 0,s=t=>{try{return t()}catch(t){throw n(t,e.error)}},c=t=>{let r=s(t);return r&&{addInitialState:(t,i)=>{try{r.addInitialState(t,i)}catch(t){throw n(t,o(t)??e.error)}},addState:(e,t,n)=>s(()=>r.addState(e,t,n)),findViolation:()=>s(()=>r.findViolation()),getViolatedProperties:(e,t)=>s(()=>r.getViolatedProperties(e,t))}},l=`TLC threw an unexpected exception.
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
- : `;var s=class extends Error{constructor(e,t){super(e,{cause:t}),this.name=`TlaError`}},c=class extends s{failure;constructor(e,t,n){super(e,t),this.name=`TlaSyntaxError`,this.failure=n}},l=class extends s{constructor(e,t){super(e,t),this.name=`TlaConfigError`}},u=class extends s{constructor(e,t){super(e,t),this.name=`TlaEvaluationError`}},d=class extends u{exitCode;constructor(t,n=e.error){super(t),this.name=`TlaEvaluationError`,this.exitCode=n}},f=class extends s{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)})`}},p=class extends f{constructor(e=`Assert_failure`){super(`Oops, this seems to be a bug in TLAPM.`,{exception:e}),this.name=`TlaProofError`}},m=class extends s{constructor(e,t){super(e,t),this.name=`TlaUnsupportedError`}};const h=t=>r(t)??(t instanceof c?e.specParseError:t instanceof l?e.configParseError:t instanceof u?e.specEvaluationFailure:e.error),g=/* @__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(`.`)),_=/* @__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`]]),v=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),y=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),ee=/* @__PURE__ */ new Map([[`∧`,`/\\`],[`∨`,`\\/`],[`¬`,`~`],[`⇒`,`=>`],[`⟹`,`=>`],[`≡`,`<=>`],[`⇔`,`<=>`],[`∈`,`\\in`],[`∉`,`\\notin`],[`⊆`,`\\subseteq`],[`⊂`,`\\subset`],[`⊇`,`\\supseteq`],[`⊃`,`\\supset`],[`∪`,`\\cup`],[`∩`,`\\cap`],[`×`,`\\X`],[`∀`,`\\A`],[`∃`,`\\E`],[`≠`,`#`],[`≤`,`<=`],[`≥`,`>=`],[`↦`,`|->`],[`→`,`->`],[`⟨`,`<<`],[`⟩`,`>>`],[`□`,`[]`],[`◇`,`<>`],[`≜`,`==`],[`′`,`'`],[`∘`,`\\o`],[`⋅`,`\\cdot`]]),b=/^\\([bB][01]+|[oO][0-7]+|[hH][0-9a-fA-F]+)/,x=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),te=e=>e.startsWith(`\\`)?parseInt(e.slice(2),x.get(e[1].toLowerCase())):Number(e),ne=/-{4,}[ \t]*MODULE\b/,re=e=>/[A-Za-z0-9_]/.test(e),S=(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&&!_.has(n.slice(0,r.value));)r.value--;let i=_.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=y.find(n=>e.startsWith(n,t));return i?{text:v.get(i)??i,length:i.length}:n===`\\`?{text:`\\`,length:1}:void 0},ie=e=>e!==void 0&&e>=`0`&&e<=`9`,C=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},ae=(e,t)=>{if(e[t]!==`<`)return 0;let n=e[t+1]===`+`||e[t+1]===`*`?t+2:C(e,t+1,ie);if(n===t+1||e[n]!==`>`)return 0;let r=C(e,n+1,re),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return C(e,i?r+1:r,e=>e===`.`)-t},w=(e,t)=>t===` `?e+8-e%8:e+1,oe=e=>{let t=ne.exec(e);if(!t)throw new c(`Expected a module header such as ---- MODULE Name ----`);let n=[],r=/* @__PURE__ */ new Map,i=e.slice(0,t.index).split(`
14
- `),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=w(o.width,e[o.position]);return w(o.width,e[a.index])},l=(e,t,r)=>{let i=s();n.push({kind:e,text:t,line:a.line,column:i,endColumn:i+r-1}),a.index+=r},u=t=>{for(let n=0;n<t;n++)e[a.index]===`
15
- `&&(a.line++,a.lineStart=a.index+1),a.index++},d=t=>new c(`${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===`
16
- `||t===` `||t===` `||t===`\r`){u(1);continue}if(e.startsWith(`\\*`,a.index)){let t=e.indexOf(`
17
- `,a.index);u((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++,u(2)):e.startsWith(`*)`,a.index)?(t.value--,u(2)):u(1)}while(t.value>0);continue}if(e.startsWith(`----`,a.index)){let t=C(e,a.index,e=>e===`-`)-a.index;e.slice(a.index+t).trimStart().startsWith(`MODULE`)&&a.moduleDepth++,l(`Separator`,`----`,t);continue}if(e.startsWith(`====`,a.index)){if(l(`ModuleEnd`,`====`,C(e,a.index,e=>e===`=`)-a.index),a.moduleDepth--,a.moduleDepth<=0)break;continue}if(t===`"`){let t=a.line,r=s(),i=[];for(u(1);e[a.index]!==`"`;){if(a.index>=e.length||e[a.index]===`
18
- `)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),u(2)}else i.push(e[a.index]),u(1)}u(1),n.push({kind:`String`,text:i.join(``),line:t,column:r,endColumn:s()-1});continue}let i=b.exec(e.slice(a.index,a.index+64));if(i){l(`Number`,i[0],i[0].length);continue}if(re(t)){let t=e.slice(a.index,C(e,a.index,re));if(/^\d+$/.test(t)){let n=/^\d+(\.\d+)?/.exec(e.slice(a.index))?.[0]??t;l(n.includes(`.`)?`Decimal`:`Number`,n,n.length);continue}if(t.startsWith(`WF_`)||t.startsWith(`SF_`)){l(`Keyword`,t.slice(0,3),3);continue}let n=r.get(t)??t;r.set(n,n),l(g.has(t)?`Keyword`:`Identifier`,n,t.length);continue}let o=ae(e,a.index);if(o>0){l(`Step`,e.slice(a.index,a.index+o),o);continue}let c=S(e,a.index);if(c)l(`Operator`,c.text,c.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},T=/* @__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`]),E=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`],D=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
- `).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 l(`Unterminated comment at line ${n.line}`);n.line+=r.slice(0,e).split(`
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=S(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},O=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},se={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},ce=e=>e!==void 0&&/^\p{Nd}$/u.test(e),le=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),ue=e=>{let t=t=>{let n=C(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=C(e,t,ce);if(e.startsWith(`..`,n)&&ce(e[n+2]))return{kind:`Constant`,first:t,last:C(e,n+2,ce)-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=ce(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:C(e,t+1,ce)-1,children:[]};if(le(n))return{kind:`Constant`,first:t,last:C(e,t,le)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},A=e=>{let t=e.length===0?void 0:ue(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=se[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},j=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,de=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),M=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),N=e=>typeof e==`object`&&e.kind===`ModelValue`,fe=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:j(e)?`set`:`function`,pe=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new d(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},me={isUsed:!1},he=(e,t)=>(me.isUsed=!0,e.writtenKeys=t,e),ge=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[Yt(e.domain,t)]]),_e=(e,t,n)=>he(Ie(e,t),n),ve=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(ve);e.writtenKeys=void 0,e.range.forEach(ve)}},ye=e=>e.every(e=>typeof e==`string`),be=(e,t)=>e.length>0&&t.length>0&&ye(e)!==ye(t),xe=(e,t)=>{me.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return be(n,r)?nt(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},Se=(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},P=e=>N(e)?e.type:void 0,Ce=(e,t,n)=>{let r=P(e),i=P(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(N(e)&&N(t)){if(r===void 0||i===void 0||r===i)return;throw new u(`Attempted to ${a} the differently-typed model values ${H(e)} and ${H(t)}`)}throw r===void 0?new u(`Attempted to ${a} the typed model value ${H(t)} and the non-model value\n${H(e)}`):new u(`Attempted to ${a}${n?``:` the`} typed model value ${H(e)} and non-model value\n${H(t)}`)},we={ranks:Object.create(null),size:0},Te=e=>{we.ranks=Object.create(null),we.size=0,Ne.clear();for(let t of e)Ee(t)},Ee=e=>(we.ranks[e]===void 0&&(we.ranks[e]=we.size++),e),De=()=>we.size,Oe=e=>we.ranks[Ee(e)],F=(e,t)=>{if(e===t)return 0;let n=we.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`),ke=(e,t)=>(I(e)||I(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Ae=(e,t,n)=>{if(!I(e))throw new u(`Attempted to ${n} the set ${H(R(e)?z(e):e,!0)} with the value:\n${H(t,!0)}`);if(!I(t))throw new u(`Attempted to compare overridden value ${H(e,!0)} with non-overridden value:\n${H(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 ${H(e,!0)} with the value\n${H(t,!0)}`)},je={kind:`InfiniteSet`,name:`Any`},Me=e=>{throw new u(`Attempted to compare ANY with the value\n${H(e)}`)},L=(e,t)=>{if(e===t)return me.isUsed&&ve(e),e===je?Me(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return xe(e,t);if(n===`Set`&&r===`Set`)return Se(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&&Ce(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return Ce(e,t,!1),n===`ModelValue`?-1:1;if(e===je||t===je)return Me(e===je?t:e);if(j(e)&&j(t)&&ke(e,t))return Ae(e,t,`compare`);let i=j(e);if(i!==j(t))throw new u(`Attempted to compare ${fe(e)} ${H(e)} with ${fe(t)} ${H(t)}`);return i?Se(z(e),Ht(t)):xe(V(e),V(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return F(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(Ce(e,t,!1),N(e))return-1;if(N(t))return 1;throw new u(`Attempted to compare ${fe(e)} ${H(e)} with ${fe(t)} ${H(t)}`)},Ne=/* @__PURE__ */ new Map,Pe=e=>{let t=Ne.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Oe(e)};return Ne.set(e,n),n},Fe=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0}),Ie=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0}),Le=(e,t)=>{if(e===t)return me.isUsed&&ve(e),e!==je||Me(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Ce(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 xe(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Se(e,t)===0;if(N(e)||N(t))return Ce(e,t,!0),N(e)&&N(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Le(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=B(e.domain),r=B(t.domain);if(n||r)return n===r;let i=B(e.range),a=B(t.range);return i||a?i===a:Le(e.domain,t.domain)&&Le(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(B(e))return B(t);if(B(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]&&Le(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return B(e)?B(t):!B(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Le(e,t.factors[n]));let n=j(e)&&j(t)&&!(R(e)&&R(t));if(n&&ke(e,t))return Ae(e,t,`check equality of`)===0;if(n){if(!I(e)){let n=z(e);if(!I(t))return Se(n,z(t))===0}return En(e)===En(t)}return L(e,t)===0},Re=(e,t)=>e===t||e.length===t.length&&e.every((e,n)=>ze(e,t[n])),ze=(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)&&Re(e.elements,t.elements):e.kind===`Function`&&t.kind===`Function`?(e.hash===0||t.hash===0||e.hash===t.hash)&&Re(e.domain,t.domain)&&Re(e.range,t.range):En(e)===En(t),Be=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},Ve=e=>{if(!M(e))return;let t=V(e);return{domain:t.domain,range:t.range,low:Be(t.domain)}},He=e=>{if(!M(e))return;let t=V(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},Ue=(e,t)=>{if(P(e)!==void 0)throw new u(`Attempted to compare the typed model value ${H(e)} and the non-model value\n${H(t)}`);return 1},We=(e,t)=>{if(P(e)!==void 0)throw new u(`Attempted to check equality of the typed model value ${H(e)} and the non-model value\n${H(t)}`);return!1},Ge=(e,t)=>{let n=P(e);if(n===void 0)return N(t)?e.rank-t.rank:-1;if(!N(t))throw new u(`Attempted to compare the typed model value ${H(e)} and non-model value\n${H(t)}`);let r=P(t);if(r!==void 0&&r!==n)throw new u(`Attempted to compare the differently-typed model values ${H(e)} and ${H(t)}`);return e.rank-t.rank},Ke=(e,t)=>{let n=P(e);if(n===void 0)return N(t)&&e.name===t.name;if(!N(t))throw new u(`Attempted to check equality of typed model value ${H(e)} and non-model value\n${H(t)}`);let r=P(t);if(r!==void 0&&r!==n)throw new u(`Attempted to check equality of the differently-typed model values ${H(e)} and ${H(t)}`);return e.name===t.name},qe={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`}},Je=(e,t,n)=>{let r=qe[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${H(e)} with ${r.other}:\n${H(t)}`},Ye=(e,t,n)=>{let r=Ve(n);if(!r){if(N(n))return Ue(n,t);throw new u(`Attempted to compare the function ${H(t)} with the value:\n${H(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>Xe(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 Xe(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${H(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},Xe=(e,t)=>{for(let n=0;n<e.length;n++){let r=nt(e[n],t[n]);if(r!==0)return r}return 0},Ze=(e,t)=>{let n=V(e);if(e.kind===`Function`&&Xt(n)!==void 0){let r=M(t)?Xt(t):void 0;return r?n.range.length-r.length||Xe(n.range,r):Ye({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=He(t);if(!r){if(N(t))return Ue(t,e);throw new u(`Attempted to compare record:\n${H(e)}\nwith non-record\n${H(t)}`)}return n.domain.length-r.domain.length||Xe(n.domain,r.domain)||Xe(n.range,r.range)}return Ye({...n,low:Be(n.domain)},e,t)},Qe=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),$e=(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`),et=(e,t)=>{let n=Qe(t)?t:z(t);return{elements:z(e).elements,otherElements:z(n).elements}},tt=(e,t)=>{if($e(e,t))return L(e,t);if(!Qe(e))return tt(z(e),t);if(!j(t)){if(N(t))return Ue(t,e);throw new u(`Attempted to compare the set ${H(e)} with the value:\n${H(t)}`)}let n=et(e,t);return n.elements.length-n.otherElements.length||Xe(n.elements,n.otherElements)},nt=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return L(e,t);if(N(t))return Ue(t,e);throw new u(Je(e,t,!1))}return e.kind===`ModelValue`?Ge(e,t):M(e)?Ze(e,t):tt(e,t)},rt=(e,t)=>e.every((e,n)=>st(e,t[n])),it=(e,t,n)=>{let r=Ve(n);if(!r){if(N(n))return We(n,t);throw new u(`Attempted to check equality of the function ${H(t)} with the value:\n${H(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)&&rt(e.range,r.range);let i=e.low??r.low;return i===void 0?rt(e.domain,r.domain)&&rt(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${H(e)}.`);return e===i+t})&&rt(e.range,r.range)},at=(e,t)=>{let n=V(e);if(e.kind===`Function`&&Xt(n)!==void 0){let r=M(t)?Xt(t):void 0;return r?n.range.length===r.length&&rt(n.range,r):it({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=He(t);if(!r){if(N(t))return We(t,e);throw new u(`Attempted to check equality of record:\n${H(e)}\nwith non-record\n${H(t)}`)}return n.domain.length===r.domain.length&&rt(n.domain,r.domain)&&rt(n.range,r.range)}return it({...n,low:Be(n.domain)},e,t)},ot=(e,t)=>{if($e(e,t))return Le(e,t);if(!Qe(e))return ot(z(e),t);if(!j(t)){if(N(t))return We(t,e);throw new u(`Attempted to check equality of the set ${H(e)} with the value:\n${H(t)}`)}let n=et(e,t);return n.elements.length===n.otherElements.length&&rt(n.elements,n.otherElements)},st=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(N(t))return We(t,e);throw new u(Je(e,t,!0))}return e.kind===`ModelValue`?Ke(e,t):M(e)?at(e,t):ot(e,t)},ct=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=nt(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},lt=(e,t)=>t.some(t=>st(t,e)),ut=(e,t)=>{try{return Le(e,t)}catch(n){if(!(n instanceof u))throw n;return st(e,t)}},dt=e=>{for(let t=1;t<e.length;t++)if(L(e[t],e[t-1])<=0)return!1;return!0},ft=e=>{if(e.length<2||dt(e))return Fe(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 Fe(n)},pt=e=>{try{return ft(e)}catch(t){if(!(t instanceof u))throw t;return{kind:`MixedSet`,elements:e}}},mt=Fe([]),ht=(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:Fe(i)},gt=(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:Fe(i)},_t=(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=Fe(i);if(e.hash!==0){let t=e.hash;for(let e=0;e<a.length;e++)t=t+mn(a[e])|0;c.hash=t}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+xn(a[e])|0;c.fingerprint=t}return c},vt=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 Ie(n,r)},yt=e=>{let t=vt(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:he(t,e.map(e=>e[0]))},bt=[],xt=[],St=/* @__PURE__ */ new WeakMap,Ct=e=>{let t=bt[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return bt[e]=n,n},wt=e=>{if(Kt(e),e.low===1&&e.high>=1)return Ct(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Tt=e=>e.length>0&&(e===bt[e.length]||St.has(e)),Et=e=>{let t=z(e).elements;return Tt(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Dt=e=>{let t=xt[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return xt[e]=n,n},Ot=e=>Ie(Ct(e.length),e),kt=e=>vt(e),At=e=>j(e)&&!I(e),jt=(e,t=!1)=>`UNION(${H(e.base,t)})`,Mt=(e,t=e=>z(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${H(e)}\nwhen enumerating:\n${jt(n)}`)},R=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 R(e.base);case`FunctionSet`:return R(e.domain)&&R(e.range)||Pt(e.domain)===!0||Pt(e)===!0;case`RecordSet`:return e.sets.every(R)||Pt(e)===!0;case`ProductSet`:return e.factors.every(R)||Pt(e)===!0;case`Union`:return R(e.base)&&Ut(e.base).every(R);case`SetOperation`:return e.operator===`\\cup`?R(e.left)&&R(e.right):e.operator===`\\cap`?R(e.left)||R(e.right):R(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 R(e)?z(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(Fe(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 ${H(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return ct(e.elements);case`Interval`:{let t=wt(e);return t!==bt[t.length]&&St.set(t,e),t}case`Subset`:{I(e.base)&&Kt(e.base);let t=z(e.base).elements;if(t.length>30)throw new u(`SUBSET of a set with ${t.length} elements is too large to enumerate`);return Lt(t)}case`FunctionSet`:{if(B(e))return[];if(I(e.domain))throw new u(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${H(e.domain)}\ncannot be enumerated.`);let t=Et(e.domain);if(t.length>0&&I(e.range))throw new u(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${H(e.range)}\ncannot be enumerated.`);let n=t.length===0?[]:z(e.range).elements;return Ft(t.map(()=>n)).map(e=>Ie(t,e))}case`RecordSet`:{if(B(e))return[];let t=e.sets.map((t,n)=>{if(I(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${H(t)}`);return z(t).elements});return Ft(t).map(t=>kt(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(B(e))return[];let t=e.factors.map((e,t)=>{if(I(e))throw new u(`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${H(e)}`);return z(e).elements});return Ft(t).map(Ot)}case`FilteredSet`:if(I(e.base))throw new u(`Attempted to enumerate { x \\in S : p(x) } when S:\n${H(e.base)}\nis not enumerable`);return z(e.base).elements.filter(e.test);case`Union`:{let t=Mt(e).flatMap((t,n)=>z(Nt(t,n,e)).elements);return z(pt(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(I(e.left)||I(e.right)))throw new u(`Attempted to enumerate S \\cup T when S:\n${H(e.left)}\nand T:\n${H(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&I(e.left)&&I(e.right))throw new u(`Attempted to enumerate S \\cap T when neither S:\n${H(e.left)}\nnor T:\n${H(e.right)}\nis enumerable`);if(e.operator===`\\`&&I(e.left))throw new u(`Attempted to enumerate S \\ T when S:\n${H(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return _t(z(e.left),z(e.right)).elements;let t=e.operator===`\\`||R(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return z(n).elements.filter(t=>$t(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new u(`Attempted to enumerate the non-enumerable set ${H(e)}`);default:throw new u(`Expected a set but found ${H(e)}`)}},zt=/* @__PURE__ */ new WeakMap,Bt=/* @__PURE__ */ new WeakMap,z=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Fe(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`)?Fe(t):ft(t)},Ht=e=>{if(typeof e!=`object`||e.kind!==`Union`&&e.kind!==`SetOperation`&&e.kind!==`FilteredSet`||zt.has(e))return z(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 z(e).elements;if(e.kind===`Union`)return Mt(e,Ut).flatMap((t,n)=>Ut(Nt(t,n,e)));if(e.kind===`FilteredSet`&&!I(e.base))return Ut(e.base).filter(e.test);if(e.kind!==`SetOperation`)return z(e).elements;if(e.operator===`\\cup`)return I(e.left)||I(e.right)?z(e).elements:[...Ut(e.left),...Ut(e.right)];let t=e.operator===`\\`||R(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return I(n)?z(e).elements:Ut(n).filter(t=>$t(t,r)===(e.operator===`\\cap`))},B=e=>{if(typeof e!=`object`||!j(e))throw new u(`Shouldn't call isEmpty() on value ${H(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(B);case`RecordSet`:return e.sets.some(B);case`FunctionSet`:return!B(e.domain)&&B(e.range);case`Union`:return Mt(e).every((t,n)=>B(Nt(t,n,e)));default:return z(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${H(e)}`,Kt=e=>{if(typeof e!=`object`)return z(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 ${H(e)}.`);case`Subset`:{let t=Kt(e.base);if(t>=31)throw new u(Gt(e));return 2**t}case`FunctionSet`:{if(B(e.domain))return 1;if(B(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 B(e)?0:Wt(e.sets,()=>Gt(e));case`ProductSet`:return B(e)?0:Wt(e.factors,()=>`Overflow when computing the number of elements in ${H(e)}`);default:return z(e).elements.length}},qt=e=>`Attempted to check if the set ${H(e)}is finite.`,Jt=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new u(`Attempted to check if the ${fe(e)} ${H(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${H(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Jt(e.base)&&B(e.base);case`Subset`:return Jt(e.base);case`FunctionSet`:{let t=Jt(e.domain);if(t&&B(e.domain))return!0;let n=Jt(e.range);return n&&B(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(B(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 z(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${H(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`||!M(e))return;let t=V(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Zt=(e,t)=>`Attempted to check if the value ${H(e)} is an element of ${H(t)}`,Qt=(e,t)=>{let n=`Attempted to check if the value:\n${H(e)}\nis an element of the`;if(!M(t))return`${n} ${fe(t)} ${H(t)}`;let r=t.kind===`Function`||R(t.domain)?V(t).domain:[];return r.length>0&&r.every(e=>typeof e==`string`)?`Attempted to check if element:\n${H(e)}\nis in the record:\n${H(t)}`:r.every((e,t)=>e===t+1)?`Attempted to check set membership in a tuple value.`:`${n} function ${H(t)}`},$t=(e,t)=>{if(!j(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 lt(e,t.elements)}case`MixedSet`:return lt(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!N(e))throw new u(`Attempted to check if the value:\n${H(e)}\nis in the integer interval ${H(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(N(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new u(`Attempted to check if the value:\n${H(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!j(e))throw new u(Zt(e,t));return z(e).elements.every(e=>$t(e,t.base));case`FunctionSet`:{if(!M(e)){if(N(e))return!1;throw new u(Zt(e,t))}let n=V(e),r=Be(n.domain);return(r===void 0?ut(t.domain,Fe(n.domain)):ut({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>$t(e,t.range))}case`RecordSet`:{let n=M(e)?V(e):void 0;if(!n||!ye(n.domain)){if(N(e))return!1;throw new u(`Attempted to check if non-record\n${H(e)}\nis in the set of records:\n${H(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=M(e)?Xt(e):void 0;if(n===void 0){if(M(e)&&V(e).domain.every(e=>typeof e==`number`)||N(e))return!1;throw new u(`Attempted to check if non-tuple\n${H(e)}\nis in the set of tuples:\n${H(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 ${H(e)}\nis an element of the non-enumerable set:\n ${jt(t)}`);return z(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(N(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)),V=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){R(e.domain)||Kt(e.domain);let t=Et(e.domain);return Ie(t,t.map(t=>e.apply(t)))}throw new u(`Expected a function but found ${H(e)}`)},tn=/* @__PURE__ */ new WeakSet,nn=e=>(tn.add(e),e),rn=(e,t)=>typeof e==`object`&&tn.has(e)?`In applying the function\n${A(H(e))},\nthe first argument is:\n${A(H(t))}\nwhich is not in its domain.\n`:`Attempted to apply function ${H(e)} to ${H(t)}, which is not in its domain`,an=(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)},on=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!$t(t,e.domain))throw new u(tn.has(e)?rn(e,t):`Attempted to apply a function to ${H(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new u(`Attempted to apply ${H(e)}, which is not a function`);let r=an(e.domain,t);if(r===-1)throw new u(n?.(e)??rn(e,t));return e.range[r]},sn=e=>Tt(e)?St.get(e)??Dt(e.length):void 0,cn=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=V(e).domain;return sn(t)??Fe(t)},ln=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!R(e.domain))){if(!$t(t,e.domain))return e;let r=n(e.apply(t));return{kind:`LazyFunction`,domain:e.domain,apply:n=>ut(t,n)?r:e.apply(n),source:e.source}}let i=V(e),a=an(i.domain,t);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Ie(i.domain,o);if(l.writtenKeys=i.writtenKeys,i.hash!==0){let e=i.domain[a];l.hash=s===c?i.hash:i.hash-hn(e,s)+hn(e,c)|0}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Sn(e,s)+Sn(e,c)|0}return l},un=/* @__PURE__ */ new WeakMap,dn=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},fn=(e,t)=>Math.imul(e^t,16777619),pn=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return dn(t)},mn=e=>dn(_n(e)+2654435769|0),hn=(e,t)=>dn(Math.imul(_n(e),668265261)+_n(t)|0),gn=e=>{if(e.kind===`ModelValue`)return dn(fn(pn(e.name),109));if(j(e)){if(!R(e))return pn(En(e));let t=z(e).elements,n=1940243425;for(let e=0;e<t.length;e++)n=n+mn(t[e])|0;return n}let t=V(e),n=1725019383;for(let e=0;e<t.domain.length;e++)n=n+hn(t.domain[e],t.range[e])|0;return n},_n=e=>{if(typeof e==`number`)return dn(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return pn(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=gn(e)),e.hash;let t=un.get(e);if(t!==void 0)return t;let n=gn(e);return un.set(e,n),n},vn=/* @__PURE__ */ new WeakMap,yn=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},bn=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return yn(t)},xn=e=>yn(wn(e)+2135587861|0),Sn=(e,t)=>yn(Math.imul(wn(e),374761393)+wn(t)|0),Cn=e=>{if(e.kind===`ModelValue`)return yn(bn(e.name)^60);if(j(e)){if(!R(e))return bn(En(e));let t=z(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+xn(t[e])|0;return n}let t=V(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+Sn(t.domain[e],t.range[e])|0;return n},wn=e=>{if(typeof e==`number`)return yn(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return bn(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=Cn(e)),e.fingerprint;let t=vn.get(e);if(t!==void 0)return t;let n=Cn(e);return vn.set(e,n),n},Tn=/* @__PURE__ */ new WeakMap,En=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=Tn.get(e);if(t!==void 0)return t;let n=Dn(e);return Tn.set(e,n),n},Dn=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${En(e.base)}>`;if(e.kind===`FilteredSet`&&!R(e))throw new u(`Attempted to compare the non-enumerable set ${H(e)} with another value`);if(j(e))return R(e)?`{${z(e).elements.map(En).join(`,`)}}`:`<${e.kind} ${H(e)}>`;let t=V(e);return`(${t.domain.map((e,n)=>`${En(e)}:${En(t.range[n])}`).join(`,`)})`},On=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,kn=e=>e.reduce((e,t)=>e===0?0:e*Kt(t),1),An=e=>{if(e.kind===`Subset`)return Kt(e.base)<=6?z(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return z(e);if(e.kind===`FunctionSet`&&R(e.domain)&&Kt(e.domain)===0)return Fe([Ie([],[])]);let t=e.kind===`FunctionSet`?Kt(e.range)**Kt(e.domain):kn(e.kind===`RecordSet`?e.sets:e.factors);return t===0?mt:t<=1999?z(e):void 0},jn=(e,t)=>{if(t)return An(e);if(R(e))try{return An(e)}catch(e){if(e instanceof u)return;throw e}},Mn=(e,t)=>{let n=e=>H(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)}},Nn=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),H=(e,t=!1,n=!1)=>{let r=e=>H(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return On(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(z(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=jn(e,t);return n?r(n):Mn(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{if(e.kind===`LazyFunction`&&!R(e.domain)){let t=e.source;return t?`[${t.parameters.map(e=>`${e.name} \\in ${H(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}let i=V(e),a=r=>H(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`&&Nn(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):ge(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},Pn=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${A(H(n))}\n`).join(``)},Fn=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},In=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=_n(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||ze(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||ze(i[e],n))return i[e]}return n.kind===`Set`?Fn(n.elements,t):(Fn(n.domain,t),Fn(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}},Ln=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:[])}},U=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,Rn=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),zn=(e,t)=>Rn.has(e)?new u(t):new d(t),Bn=e=>typeof e==`object`&&e.kind===`Operator`,W=(e,t,n)=>{let r=e[t];if(r===void 0||Bn(r))throw zn(n,`${n} expects a value as argument ${t+1}`);return r},Vn=(e,t,n)=>{let r=W(e,t,n);if(typeof r!=`number`)throw zn(n,`${n} expects an integer but received ${H(r)}`);return r},Hn=(e,t,n)=>{let r=W(e,t,n);if(typeof r!=`boolean`)throw zn(n,`${n} expects a boolean but received ${H(r)}`);return r},Un=(e,t,n)=>{let r=W(e,t,n);if(!j(r))throw zn(n,`${n} expects a set but received ${H(r)}`);return r},Wn=(e,t,n)=>{let r=Un(e,t,n);if(!R(r))throw zn(n,`${n} cannot enumerate the non-enumerable set ${H(r)}`);return r},Gn=(e,t,n)=>z(Wn(e,t,n)),Kn=(e,t,n)=>Gn(e,t,n).elements,qn=(e,t,n)=>{let r=W(e,t,n),i=Xt(r);if(!i)throw zn(n,`${n} expects a sequence but received ${H(r)}`);return i},Jn=(e,t,n)=>{let r=W(e,t,n);if(!M(r))throw zn(n,`${n} expects a function but received ${H(r)}`);return V(r)},Yn=(e,t,n)=>{let r=e[t];if(r===void 0||!Bn(r))throw zn(n,`${n} expects an operator as argument ${t+1}`);return r},Xn=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),G=(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}),Zn=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Qn=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),$n=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(W(n,0,e),W(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),er=e=>e>2147483647||e<-2147483648,tr=e=>new d(`Overflow when computing ${e}`),nr={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`},rr={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},ir={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`},ar=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return rr[e.operator];if(e.kind!==`Function`)return nr[e.kind];let t=e.domain;return t.every((e,t)=>e===t+1)?`TupleValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},or=e=>ir[ar(e)],sr=(e,t)=>new u(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),cr=(e,t)=>{let n=n=>(...r)=>{try{return n(...r)}catch(n){throw n instanceof u&&(e.isLazy===!0||!(n instanceof d))?sr(t,n.message):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},lr=(e,t)=>{if(typeof e!=`number`)throw sr(t,`Cannot cast tlc2.value.impl.${ar(e)} to tlc2.value.impl.IntValue`);return e},ur=(e,t,n)=>`public static tlc2.value.impl.${t} tlc2.module.Integers.${e}(${Array.from({length:n},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,dr=(e,t,n)=>{let r=ur(t,`IntValue`,2);return $n(e,(t,i)=>{let a=lr(t,r),o=lr(i,r),s=n(a,o);if(er(s))throw tr(`${a}${e}${o}`);return s})},fr=(e,t,n)=>{if(typeof e!=`number`)throw new d(`The ${t} argument of ${n} should be an integer, but instead it is:\n${H(e)}`);return e},pr=(e,t)=>$n(e,(n,r)=>t(fr(n,`first`,e),fr(r,`second`,e))),mr=(e,t,n)=>({...Qn(e,t,n),isLazy:!0}),hr=(e,t,n)=>{let r=Yn(e,t,n);return()=>r.call([])},gr=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),_r=()=>({bool:Qa,condition:(e,t)=>{if(typeof e!=`boolean`)throw Va(t,e);return e},conjunct:(e,t,n)=>{if(typeof e!=`boolean`)throw Ha(t,n,e);return e},apply:on,tuple:Ot,set:pt,record:Ie,writtenRecord:_e,equal:Le,enumerate:ro,unassigned:(e,t)=>{throw ks(e,t)},primeOutsideAction:e=>{throw As(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)=>Ya(e,t,n[r]),e.scope),state:e.state,next:e.next})}),vr={value:void 0},yr=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),br=e=>`local${e.counter++}`,xr=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),Ln(e).forEach(e=>xr(e,t)),t),Sr=(e,t,n)=>{let r=yr(e,Y(t,e.environment)),i=xr(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=yr(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},Cr=(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(()=>br(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${Tr(e,t.set,s)}, ${yr(e,t.set)});`),u=t.bounds.map(t=>{let n=br(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${Tr(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=br(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})`},wr=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${Tr(e,r[0],n)}, "the left side of =>") ? bool(${Tr(e,r[1],n)}, "the right side of =>") : true)`;if(U(t))return Sr(e,t,n);let i=vo(t.operator,e.environment);if(i?.kind!==`Builtin`)return Sr(e,t,n);if(i.name===`DOMAIN`)return`${yr(e,Wa(t))}(${Tr(e,r[0],n)})`;if(i.name===`TLCEval`)return Sr(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${yr(e,Ga(t,i))}(${Tr(e,r[0],n)}, ${Tr(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&ls(r[0],a))return`${yr(e,i.evaluateUnary)}(${Tr(e,r[0],n)})`;let o=r.length===2&&ls(r[0],a)&&ls(r[1],a);return i.evaluateBinary&&o?`${yr(e,i.evaluateBinary)}(${Tr(e,r[0],n)}, ${Tr(e,r[1],n)})`:Sr(e,t,n)},Tr=(e,t,n)=>{let r=(t,r=n)=>Tr(e,t,r);if($o(t)&&Jo(t,e.environment))return Sr(e,t,n);switch(t.kind){case`Number`:return Io(t.value)?String(t.value):Sr(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(U(t))return Sr(e,t,n);let i=Oo(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=yr(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?yr(e,i.value):Sr(e,t,n)}case`Apply`:return wr(e,t,n);case`And`:{let n=yr(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)}, ${yr(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Cs(t.function);let e=r(t.function);return t.args.length===1?`apply(${e}, ${r(t.args[0])})`:`apply(${e}, tuple([${t.args.map(e=>r(e)).join(`, `)}]))`}case`FieldAccess`:return`apply(${r(t.record)}, ${JSON.stringify(t.field)}, ${yr(e,Ua(t))})`;case`Record`:{let i=Ds(t.fields);if(Os(i))return Sr(e,t,n);let a=yr(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}, ${yr(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=yr(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`)?Cr(e,t,n):Sr(e,t,n);default:return Sr(e,t,n)}},Er=(e,t)=>{if(!gr.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=Tr(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}; };`;vr.value??=_r();let o=vr.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},Dr={kind:`Local`},Or=/* @__PURE__ */ new WeakMap,kr=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Ar=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2}])),jr=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Mr=e=>e.kind===`Operator`?e.params.length:0,Nr=e=>e.name.includes(`!`),Pr=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Fr=(e,t,n=0)=>t.reduce((e,t)=>({name:t,arity:n,parent:e}),e),Ir=(e,t)=>t.reduce((e,t)=>({name:t.name,arity:t.arity,parent:e}),e),Lr=e=>e.kind===`Name`?[e.name]:e.names,Rr=e=>e.flatMap(e=>Lr(e.pattern)),zr=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||jr(n.location,t.location))?n:void 0},Br=(e,t)=>{let n=zr(e,t);return n?{key:t.getKey(n),arity:Mr(n)}:t.imported.get(e)},Vr=e=>e[0].toLowerCase()===e[0].toUpperCase()&&e[0]!==`_`&&(e[0]<`0`||e[0]>`9`),Hr=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Ur=(e,t,n,r)=>{let i=e.location,a=Or.get(e);if(a!==void 0)return a;if(kr(t))return e.kind===`Apply`?e.args.length:0;if(Hr(t))return 0;let o=Pr(n,t);if(o&&e.kind!==`OperatorReference`&&(e.resolution=Dr),o)return o.arity;let s=Br(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Or.set(e,s.arity),s.arity;let l=t.slice(0,t.indexOf(`!`));if(l!==``&&(Pr(n,l)!==void 0||Br(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(Vr(t)?`Could not find declaration or definition of symbol '${t}' ${u}`:`Unknown operator: \`${t}' ${u}`)},Wr=(e,t,n)=>(e.forEach(e=>K(e.set,t,n)),e.reduce((e,t)=>Fr(e,Lr(t.pattern)),t)),Gr=(e,t)=>e.kind===`Identifier`&&e.name===t&&U(e)||Ln(e).some(e=>Gr(e,t)),Kr=(e,t)=>{e.kind===`FunctionConstruction`&&Gr(e.body,t)&&(e.isRecursive=!0),Ln(e).forEach(e=>Kr(e,t))},qr=(e,t,n)=>{let r=Fr(t,e.kind===`Function`?[e.name]:[]);e.kind===`Function`?(K(e.body,Wr(e.bounds,r,n),n),Kr(e.body,e.name)):K(e.body,Ir(r,e.params),n)},Jr=(e,t,n)=>{let r=e.filter(e=>e.isRecursive).reduce((e,t)=>({name:t.name,arity:Mr(t),parent:e}),t);return e.reduce((e,t)=>(Nr(t)||qr(t,e,n),{name:t.name,arity:Mr(t),parent:e}),r)},Yr=(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}`)},Xr=e=>e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:void 0,Zr=(e,t,n)=>{let r=Pr(t,e.operator)?void 0:zr(e.operator,n),i=Ur(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=Xr(e),o=a===void 0||Pr(t,a)?void 0:zr(a,n),s=Qr(e,t,n);r&&Yr(r,i,e,s,o)})},Qr=(e,t,n)=>e.kind===`Identifier`?Ur(e,e.name,t,n):e.kind===`OperatorReference`?Ur(e,e.operator,t,n):(K(e,t,n),e.kind===`Lambda`?e.params.length:0),K=(e,t,n)=>{let r=e=>e.forEach(e=>K(e,t,n));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{let r=Ur(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`:Ur(e,e.operator,t,n);return;case`Apply`:Zr(e,t,n);return;case`Lambda`:K(e.body,Fr(t,e.params),n);return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:K(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&&K(e.other,t,n);return;case`Let`:K(e.body,Jr(e.definitions,t,n),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:K(e.body,Wr(e.bounds,t,n),n);return;case`UnboundedQuantifier`:K(e.body,Fr(t,e.names),n);return;case`Choose`:e.set&&K(e.set,t,n),K(e.body,Fr(t,Lr(e.pattern)),n);return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:K(e.predicate,Wr([e.bound],t,n),n);return;case`SetMap`:K(e.expression,Wr(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`:K(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`:K(e.body,t,n);return;case`Subexpression`:e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Qr(e,t,n))}},$r=(e,t,n)=>(e.set&&K(e.set,t,n),{name:e.name,arity:e.arity,parent:t}),ei=(e,t,n)=>{let r=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?$r(t,e,n):(t.kind===`AssumeProve`?ei(t,e,n):K(t,e,n),e),t);return K(e.conclusion,r,n),r},ti=(e,t,n)=>e.kind===`AssumeProve`?ei(e,t,n):(K(e,t,n),t),ni=(e,t,n)=>{e?.kind===`Steps`&&e.steps.reduce((e,t)=>ri(t,e,n),t)},ri=(e,t,n)=>{let r=e.body;switch(r.kind){case`Assert`:{let i=ti(r.statement,t,n);return ni(e.proof,i,n),r.isSuffices?i:t}case`Define`:return Jr(r.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),t,n);case`Have`:case`Case`:return K(r.expression,t,n),ni(e.proof,t,n),t;case`Witness`:return r.expressions.forEach(e=>K(e,t,n)),t;case`Take`:return Fr(Wr(r.bounds,t,n),r.names);case`Pick`:{let i=Fr(Wr(r.bounds,t,n),r.names);return K(r.body,i,n),ni(e.proof,t,n),i}default:return ni(e.proof,t,n),t}},ii=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:ti(e.statement,void 0,t);ni(e.proof,n,t)},ai=(e,t)=>new c(`Multiply-defined symbol '${e}' at line ${t.line}, column ${t.column}`),oi=(e,t,n,r)=>t.reduce((e,t)=>{if(Pr(e,t)||n(t))throw ai(t,r);return{name:t,arity:0,parent:e}},e),si=(e,t,n,r)=>(e.forEach(e=>li(e.set,t,n)),e.reduce((e,t)=>oi(e,Lr(t.pattern),n,r),t)),ci=(e,t,n)=>{if(e.kind===`Function`){let r=Fr(t,[e.name]),i=si(e.bounds,r,n,e.location);li(e.body,i,n);return}let r=oi(t,e.params.map(e=>e.name),n,e.location);li(e.body,r,n)},li=(e,t,n)=>{let r=e.location;switch(e.kind){case`Lambda`:li(e.body,oi(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(Pr(e,t.name)||n(t.name))throw ai(t.name,t.location);return ci(t,Fr(e,i),n),Fr(e,[t.name])},t);li(e.body,oi(a,(e.instances??[]).flatMap(e=>e.name===void 0?[]:[e.name]),n,r),n);return}case`Forall`:case`Exists`:case`FunctionConstruction`:li(e.body,si(e.bounds,t,n,r),n);return;case`SetFilter`:li(e.predicate,si([e.bound],t,n,r),n);return;case`SetMap`:li(e.expression,si(e.bounds,t,n,r),n);return;case`UnboundedQuantifier`:li(e.body,oi(t,e.names,n,r),n);return;case`Choose`:e.set&&li(e.set,t,n),li(e.body,oi(t,Lr(e.pattern),n,r),n);return;default:Ln(e).forEach(e=>li(e,t,n))}},ui=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}))],di=(e,t)=>{let n=/* @__PURE__ */ new Map;ui(e).sort((e,t)=>jr(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)&&!Ar.has(e))return!1;let r=t.importedAt.get(e);return r===void 0||jr(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 ai(n.name,n.location)}));let i=e=>t=>(n.get(t)??[]).some(t=>t.isRecursive||jr(t.location,e))||r(t,e);e.definitions.forEach(e=>ci(e,void 0,i(e.location))),e.assumptions.forEach(e=>li(e.expression,void 0,i(e.location))),e.instances.forEach(e=>{let t=i(e.location),n=oi(void 0,e.params.map(e=>e.name),t,e.location);e.substitutions.forEach(e=>li(e.expression,n,t))})},fi=(e,t)=>{let n=new Map([...Ar,...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},pi=(e,t,n,r)=>{let i=Ir(void 0,e.params),a={imported:fi(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)&&!Pr(i,n)&&!Br(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 K(r,i,a),[n,r];if(Ur(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]}))},mi=(e,t)=>{let n=fi(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=>qr(e,void 0,i(e.location,e))),e.assumptions.forEach(e=>K(e.expression,void 0,i(e.location,void 0))),e.theorems.forEach(e=>ii(e,i(e.location,void 0)))},hi=/* @__PURE__ */ new WeakSet,gi=/* @__PURE__ */ new WeakSet,_i=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Ci(e,(e,r)=>_i(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&U(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&U(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},vi=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),yi=/* @__PURE__ */ new WeakMap,bi=e=>yi.get(e)??e.name,xi=(e,t)=>(bi(t)!==e.name&&yi.set(e,bi(t)),e),Si=(e,t)=>xi(e.kind===`Function`?{...e,bounds:vi(e.bounds,e=>t(e,[])),body:t(e.body,Rr(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Ci=(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=>Si(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:vi(e.bounds,n),body:t(e.body,Rr(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,Lr(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,Lr(e.bound.pattern))};case`SetMap`:return{...e,bounds:vi(e.bounds,n),expression:t(e.expression,Rr(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)}}},wi=`LAMBDA`,Ti=(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 Ci(e,(e,n)=>(r.push(...Ti(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Ei=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}},Di=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Oi=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},ki=(e,t)=>e.map(e=>({pattern:Oi(e.pattern,t),set:e.set})),Ai=(e,t)=>e.kind===`Function`?{...e,bounds:ki(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},ji=(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=>xi({...Ai(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:ki(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Oi(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Oi(e.bound.pattern,n),set:e.bound.set}};default:return e}},Mi=e=>`${e}@ENABLED`,Ni=(e,t)=>e.modes.get(t)??e,Pi=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!U(e)&&t.instantiation.variables.has(e.name),Fi=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Fi(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Pi(e,t,n))return[e.name];let r=U(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Fi(r.body,t,/* @__PURE__ */ new Map):void 0},Ii=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Pi(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Mi(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Vi(e.expression,Ni(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Vi(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Vi(e.subscript,Ni(t,`Primed`),n),location:r},Vi(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Fi(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:Mi(r),location:e.location},location:e.location},Vi({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Li=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),Ri=(e,t)=>e.map(e=>Li(e.name,t)),zi=(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:[...Ri(t,r),...i.map(e=>Li(e,r))],location:r},location:r}},Bi=(e,t)=>e.instantiation.isParameterized(t)?Ui(e,t):void 0,Vi=(e,t,n)=>{let r=e=>Vi(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!U(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Vi(e.expression,Ni(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:Vi(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Ni(t,`Enabled`),n)};let s=Ii(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return hi.add(n),n;let r=Bi(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&&Mr(o)>0?zi(r,a,Mr(o),e.location):{kind:`Apply`,operator:r,args:Ri(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||gi.has(e),l=e=>(s&&gi.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:wi,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:wi,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=Bi(t,e.operator);return u===void 0?l({...e,args:n}):{...e,operator:u,args:[...Ri(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=Bi(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?zi(n,a,Mr(r),e.location):{...e,operator:n}}let l=Ei(t),u=Ci(e,(e,i)=>i.length===0?r(e):Vi(e,t,Di(n,i,l)));return ji(u,n,l)},Hi=(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:Li(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Ui=(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=Ei(e),o=Ai(Si(i,(t,n)=>Vi(t,e,Di(/* @__PURE__ */ new Map,n,a))),a);return Hi(o,r.params,i.location)}):t},Wi=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Ti(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=>Bi(i,e)??e,getQualifiedKey:t=>{let n=Bi(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Hi(r,e.params,r.location)):t}}},Gi=e=>e.kind===`Let`&&e.instances!==void 0||Ln(e).some(Gi),Ki=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Ci(e,e=>Ki(e,t,r));return i.kind!==`Let`||!i.instances?i:{kind:`Let`,definitions:i.instances.reduce((e,n)=>{let i=e.findIndex(e=>jr(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}},qi=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Ji=(e,t)=>e.definitions.some(e=>Gi(e.body))||e.assumptions.some(e=>Gi(e.expression))||e.theorems.some(e=>{let t=qi(e);return t!==void 0&&Gi(t)})?{...e,definitions:e.definitions.map(e=>Si(e,e=>Ki(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Ki(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=qi(e);return n===void 0?e:{...e,statement:Ki(n,t,[])}})}:e,Yi=/* @__PURE__ */ new WeakMap,Xi=/* @__PURE__ */ new WeakMap,q=(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},Zi=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Qi=(t,r,i=X(t,r))=>{if(typeof i==`boolean`)return i;try{return Qa(i,`the action at ${J(t)}`)}catch(t){throw r.next===void 0?t:n(t,e.error)}},$i=e=>e===`=`||e===`\\in`||e===`\\subseteq`,ea=(e,t,n)=>{let r=n?Yi:Xi,i=r.get(e);if(i)return i;let a=ka(e,t,n);return r.set(e,a),a},ta=(e,t)=>{if(t.constants.has(e))return;let n=$a(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},na=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return na(e.expression,t,!1,r);if(e.kind!==`Identifier`||U(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=ta(e.name,t);if(a&&!r.has(a))return r.add(a),na(a.body,t,n,r)},ra=(e,t,n)=>na(e,t,!n),ia=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return ia(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Po(e.definitions,q(r,t,n));return ia(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Ja(t,e.name);if(a?.kind===`Thunk`)return ia(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=ta(e.name,r.environment);if(s)return ia(s.body,void 0,n,r,i)},aa=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||U(e))||!t&&e.kind===`Prime`,oa=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>oa(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=ta(e.name,t);if(i)return n.add(e.name),oa(i.body,t,n)},sa=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),ca=(e,t,n)=>sa.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||$i(e.operator)&&(aa(e.args[0],n)||ra(e.args[0],t,n)!==void 0)||U(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,la=/* @__PURE__ */ new Set,ua=(e,t)=>{if(U(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Ci(e,(e,i)=>{let a=r.isReadOnly?ua(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},da=(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||U(e)?void 0:$a(r,t);return i&&!n.has(i)&&(n.add(i),da(i.body,t,n))?!0:Ln(e).some(e=>da(e,t,n))},fa=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=ra(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=oa(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return ca(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:ea(e,t,n)}},pa=(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(Fs(e,t)===void 0||da(e,t,/* @__PURE__ */ new Set))return!0;let n=ua(e,la);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)}},ma=(e,t,n)=>{let r=e.map(e=>fa(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&&Na(u)){d??=q(n,o,u);for(let e=s;e<r.length;e++)if(!ha(r[e].expression,d))return;l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=q(n,o,u);let r=i[s]??=is(e.expression,t);if(!Qi(e.expression,d,r(d)))return;continue}if(e.kind===`Assign`){d??=q(n,o,u);let r=(i[s]??=is(e.value,t))(d),a=u[e.index];if(a===void 0)u=Zi(u,e.index,r),d=void 0;else if(!Le(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=Zi(u,n,t[n]),d=void 0;else if(!Le(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)},ha=(e,t)=>Qa(X(e,t),`the initial predicate at ${J(e)}`),ga=e=>(t,n,r,i,a,o)=>{Qi(e,q(t,n,r))&&o(r,i)},_a=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),d=q(r,i,a);if(a[l]!==void 0){Qi(e,d)&&c(a,o);return}let f=X(n,d),p=e.operator===`\\subseteq`?{kind:`Subset`,base:f}:f;if(!R(p))throw new u(`In computing next states, the right side of \\in is not enumerable: ${H(p)} at ${J(e)}`);let m=Ut(p);for(let e=0;e<m.length&&!r.isStopped;e++)c(Zi(a,l,m[e]),o)}},va=/* @__PURE__ */ new WeakMap,ya=e=>{let t=va.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(ya),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return va.set(e,n),n},ba=(e,t)=>{let n=e.args[0],r=ga(e),i=(e,r,i)=>ia(n,r,i,e,!t)??-1,a=_a(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],q(t,n,o));l(Zi(o,u,d),s)}},xa=(e,t,n,r)=>{if(e.kind===`FunctionConstruction`)return{bounds:e.bounds,body:e.body,scope:t};if(e.kind!==`Identifier`)return;let i=Ja(t,e.name);if(i?.kind===`Thunk`)return xa(i.expression,i.scope,n,r);let a=i?void 0:$a(e.name,r.environment);if(a?.kind!==`Function`)return;let o=X(e,q(r,void 0,n));return{bounds:a.bounds,body:a.body,scope:Ya(void 0,a.name,o)}},Sa=(e,t,n)=>{let r=ga(e);return(i,a,o,s,c,l)=>{let d=xa(e.function,a,o,i);if(!d){r(i,a,o,s,c,l);return}let f=q(i,a,o),p=e.args.map(e=>X(e,f)),m=p.length===1?p[0]:Ot(p),h=ao(d.bounds,q(i,d.scope,o));if(!$t(m,h))throw new u(`Attempted to apply a function to ${H(m)}, which is not in its domain at ${J(e)}`);ea(d.body,t,n)(i,oo(d.bounds,d.scope,m),o,s,c,l)}},Ca=(e,t)=>{if(oa(e,t))return ma([ya(e)],t,!1);if(e.kind===`Tuple`)return ea(ya(e),t,!1);let n=ya(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Ja(i,e.name):void 0;l?.kind===`Thunk`?ea(ya(l.expression),t,!1)(r,l.scope,a,o,s,c):Qi(n,q(r,i,a))&&c(a,o)}},wa=(e,t,n)=>{let r=e.operator,i=ga(e),a=U(e)?void 0:vo(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=fs(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=ea(a.body,t,n),o.body(e,i(q(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=q(a,o,s),f=bo(e,d);f?.kind===`Closure`?ea(f.body,t,n)(a,Mo(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Ta=(e,t,n)=>{let r=ga(e),i=U(e)?void 0:ta(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=Ja(s,e.name);f?.kind===`Thunk`?ea(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=ea(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Ea=(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!==`=`||U(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`||!U(a))return;let o=na(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=>Ea(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`||U(e))return;let r=vo(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Ea(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`&&U(o))return{variable:i.variable,argument:o.name,labels:i.labels}},Da=(e,t,n)=>{let r=Ja(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},Oa=(e,t,n)=>{let r=e.map(e=>ea(e,t,n)),i=n?[]:e.map(e=>Ea(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&&Da(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)}},ka=(e,t,n)=>{let r=e=>ea(e,t,n);switch(e.kind){case`And`:return ma(e.operands,t,n);case`Or`:return Oa(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=ro(X(a.set,q(t,n,r)),a.set);for(let a=0;a<l.length&&!t.isStopped;a++)i(t,Ya(n,e,l[a]),r,o,s,c)}}let o=n?void 0:pa(e,t);if(o){let r=ma(o.rest,t,n);return(t,n,i,a,s,c)=>{let l=q(t,n,i),u=e.bounds.map(e=>ro(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=Ya(n,o.names[e],r);if(e===u.length-1){let e=q(t,a,i);if(!o.guards.every(t=>Qi(t,e)))continue}d(e-1,a)}};d(u.length-1,n)}}return(t,n,r,a,o,s)=>{io(e.bounds,q(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Fs(e,t)!==void 0&&!da(e.body,t,/* @__PURE__ */ new Set)?ua(e,la):void 0;return(t,n,r,o,s,c)=>{let l=[];io(e.bounds,q(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Ja(n,e)?.kind===`Value`)){u.every(n=>Qi(e.body,q(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Na(r)?u.slice(n).every(n=>ha(e.body,q(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,q(r,i,a));(Qa(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,s,c,l)=>{let d=q(r,i,a),f=t.find(e=>Qa(X(e.condition,d),`a CASE guard`))?.body??n;if(!f)throw new u(`${o}In computing next states, TLC encountered a CASE with no conditions true.\n${Ba(e)}`);f(r,i,a,s,c,l)}}case`Let`:{let n=r(e.body),i=Wo(e.definitions,t);return(t,r,a,o,s,c)=>n(t,Po(e.definitions,q(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new u(`UNCHANGED appears in an initial predicate at ${J(e)}`)}:Ca(e.expression,t);case`AngleAction`:{let t=r(e.action),n=ya(e.subscript);return(e,r,i,a,o,s)=>t(e,r,i,a,o,(t,i)=>{Qi(n,q(e,r,t))||s(t,i)})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,ya(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Ta(e,t,n);case`FunctionApplication`:return Sa(e,t,n);case`Apply`:{let i=e.args;if($i(e.operator)){let r=ra(i[0],t,n);if(r!==void 0)return e.operator===`=`?ma([e],t,n):_a(e,()=>r);if(aa(i[0],n))return ba(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=X(i[0],q(t,n,r));(typeof c==`boolean`?c:Qa(c,`the left side of => at ${J(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return wa(e,t,n)}default:return ga(e)}},Aa=/* @__PURE__ */ new WeakMap,ja=e=>{let t=Aa.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Aa.set(e,n),n},Ma=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),Na=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Pa=(e,t)=>{let n=t.state;if(!n||!Na(n))throw new u(`ENABLED needs a complete state at ${J(e)}`);let r=t.environment,i={environment:r,isInit:!1,current:n,isStopped:!1};return ea(e,r,!1)(i,t.scope,ja(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Fa=(t,r,i,a)=>{let o={environment:r,isInit:!0,current:void 0,isStopped:!1};ea(t,r,!0)(o,a,ja(r),void 0,!1,t=>{if(!o.isStopped){if(!Na(t))throw n(new u(`The initial predicate does not assign ${Ma(t,r).join(`, `)}`),e.error);o.isStopped=i(t)}})},Ia=(e,t,n)=>{let r=[];return Fa(e,t,e=>(r.push(e),!1),n),r},La=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,current:t,isStopped:!1},o={successors:0};return ea(e,n,!1)(a,i,ja(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!Na(e))throw new u(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${Ma(e,n).join(`, `)}`);o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},Ra=(e,t,n,r)=>{let i=[];return La(e,t,n,e=>(i.push(e),!1),r),i},J=e=>`line ${e.location.line}, column ${e.location.column}`,za=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,Ba=e=>{let t=e.location.range;return t?za(t):J(e)},Va=(e,t)=>new u(`A non-boolean expression (${or(t)}) was used as the condition of an IF.\n${Ba(e)}`),Ha=(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):Ba(r);return new u(`A non-boolean expression (${or(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${or(n)}.\n${Ba({...e,location:{...e.location,range:{...r,end:i}}})}`)},Ua=e=>t=>`Attempted to select nonexistent field "${e.field}" from the record\n${H(t)}\n${Ba(e)}`,Wa=e=>t=>{if(!M(t))throw new u(`Attempted to apply the operator DOMAIN to a non-function\n(${or(t)})\n${Ba(e)}`);return cn(t)},Ga=(e,t)=>(n,r)=>{if(!j(n)||I(n))throw new u(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Ba(e)}`);return t.evaluate([n,r])},Ka=t=>n(new u(`TLC can't handle real numbers: ${t.text} at ${J(t)}`),e.configParseError),qa=t=>n(new u(`TLC can't handle a number this big: ${t.text??t.value} at ${J(t)}`),e.error),Ja=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},Ya=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Xa=(e,t,n)=>{if(t.kind===`Name`)return Ya(e,t.name,n);let r=Xt(n);if(!r||r.length!==t.names.length)throw new u(`Cannot bind <<${t.names.join(`, `)}>> to ${H(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>Ya(e,t,r[n]),e)},Za=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next}),Qa=(e,t)=>{if(typeof e!=`boolean`)throw new u(`Expected ${t} to be a boolean but found ${H(e)}`);return e},$a=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),eo=(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=$a(n,t);if(e&&!t.constants.has(n)&&!to(e,t))return!0}return Ln(e).some(e=>eo(e,t))},to=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!eo(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>eo(e.set,t)));return t.constantLevels.set(e,r),r},no=(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.`},ro=(e,t)=>{if(!j(e)||I(e)){let n=H(e),r=no(e,n);throw new u(r===void 0?`TLC encountered a non-enumerable quantifier bound\n${n}.\n${Ba(t)}`:`TLC encountered the non-enumerable quantifier bound\n${n}\n${Ba(t)}\n${r}`)}return typeof e==`object`&&e.kind===`Interval`?wt(e):z(e).elements},io=(e,t,n)=>{let r=e.map(e=>ro(X(e.set,t),e.set)),i=(t,a)=>t<0?n(a):r[t].some(n=>i(t-1,Xa(a,e[t].pattern,n)));return i(e.length-1,t.scope)},ao=(e,t)=>{let n=e.map(e=>X(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},oo=(e,t,n)=>{if(e.length===1)return Xa(t,e[0].pattern,n);let r=Xt(n)??[];return e.reduce((e,t,n)=>Xa(e,t.pattern,r[n]),t)},so=/* @__PURE__ */ new WeakMap,co=(e,t)=>{let n=so.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:za(r)};return so.set(t,i),i},lo=(e,t,n)=>{let r=co(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}},uo=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=_n(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(ze(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},fo=(e,t)=>{let n=ao(e.bounds,t),r=uo(n,(n,r)=>X(e.body,Za(t,oo(e.bounds,Ya(void 0,e.name,r),n))),lo(e.bounds,e.body,n));return e.bounds.length===1?nn(r):r},po=(e,t)=>e.kind===`Function`?fo(e,t):X(e.body,t),mo=(e,t)=>{let n=to(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=Za(t,void 0);if(!n)return po(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>po(e,i));return t.environment.definitionValues.set(e,a),a},ho=(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,Za(t,e.scope));return n&&(e.cache=r),r},go=/* @__PURE__ */ new WeakMap,_o=e=>{let t=go.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return go.set(e,n),n},vo=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return vo(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?_o(r):t.builtins.get(e)},yo=/* @__PURE__ */ new WeakMap,bo=(e,t)=>{if(U(e))return xo(e.operator,t);let n=yo.get(e),r=n===void 0?vo(e.operator,t.environment)??null:n;return n===void 0&&yo.set(e,r),r??xo(e.operator,t)},xo=(e,t)=>{let n=Ja(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return vo(e,t.environment)},So=e=>e.kind===`Closure`?e.params.length:e.arity,Co=(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:xo(n,t);if(!r)throw new u(`Expected an operator argument at ${J(e)}`);return r},wo=(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)=>Ya(e,n.name,t[r]),e.scope);return X(e.body,Za(n,r))},To=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:So(e),call:n=>wo(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},Eo=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=xo(e.name,t);return n!==void 0&&So(n)>0},Do=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),Oo=(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 Oo(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([])}},ko=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Io(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=U(e)?void 0:Oo(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=Ja(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:Do(e,t)}}return t=>Do(e,t)},Ao=/* @__PURE__ */ new WeakMap,jo=(e,t)=>{let n=Ao.get(e);if(n)return n;let r=ko(e,t);return Ao.set(e,r),r},Mo=(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:Co(t[i],n)}:jo(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},No=(e,t,n)=>e.kind===`Closure`?X(e.body,Za(n,Mo(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>X(e,n))):e.isLazy?e.evaluate(us(t,n),n):e.evaluate(t.map(e=>Eo(e,n)?To(Co(e,n),n):X(e,n)),n),Po=(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),Fo=(e,t,n)=>{let r=Ja(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return ho(r,n);if(r?.kind===`Operator`){if(So(r.operator)===0)return wo(r.operator,[],n);throw new u(`Operator ${e} is used without arguments`)}let i=Oo(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw ks(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return mo(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 ${J(t)}`)},Io=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,Lo=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Ro=(e,t)=>Lo.has(e)||t.builtins.get(e)?.isStateLevel===!0,zo={builtins:Lo,definitions:/* @__PURE__ */ new WeakMap},Bo={builtins:new Set([...Lo].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},Vo=(e,t)=>e.kind===`Operator`&&e.params.length===0&&to(e,t),Ho=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!U(e)){let e=$a(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!Vo(e,t)&&Uo(e,t,n))return!0}return Ln(e).some(e=>Ho(e,t,n))},Uo=(e,t,n=zo)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=Ho(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>Ho(e.set,t,n));return n.definitions.set(e,i),i},Wo=(e,t)=>new Set(e.filter(e=>Uo(e,t))),Go=e=>[...e.definitions.values()].some(t=>Uo(t,e)),Ko=e=>[...e.definitions.values()].some(t=>Uo(t,e,Bo)),qo=/* @__PURE__ */ new WeakMap,Jo=(e,t)=>{let n=qo.get(e);if(n!==void 0)return n;let r=Qo(e,t,Xo);return qo.set(e,r),r},Yo=/* @__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`]),Xo=/* @__PURE__ */ new Set,Zo=(e,t,n)=>n.size===0?Jo(e,t):Qo(e,t,n),Qo=(e,t,n)=>{if(!Yo.has(e.kind))return!1;if(e.kind===`Identifier`&&U(e))return n.has(e.name);if(U(e))return!1;if(e.kind===`Identifier`){let n=Oo(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&Vo(n.definition,t)}if(e.kind===`Apply`){if(Ro(e.operator,t)||e.operator===`~>`)return!1;let r=vo(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=$a(e.operator,t);if(!n||!to(n,t)||Uo(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`&&Zo(e,t,n))}let r={value:!0};return Ci(e,(e,i)=>(r.value&&=Zo(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},$o=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,es=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}},ts=(e,t)=>{if(e.kind===`Identifier`&&U(e))return!t.has(e.name);if(U(e))return!0;let n={value:!1};return Ci(e,(e,r)=>(n.value||=ts(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},ns=(e,t)=>hi.has(e)&&$o(e)&&Fs(e,t)!==void 0&&!ts(e,Xo),Y=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Ms(e,t),i=$o(e)&&Jo(e,t)?es(r):ns(e,t)?ss(r):r;return t.evaluators.set(e,i),i},rs=/* @__PURE__ */ new WeakMap,is=(e,t)=>{let n=rs.get(e);if(n)return n;let r=($o(e)&&Jo(e,t)?void 0:Er(e,t))??Y(e,t);return rs.set(e,r),r},X=(e,t)=>is(e,t.environment)(t),as=(e,t)=>{let n=e.name,r=U(e)?void 0:Oo(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw ks(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&&to(e,t))return t=>mo(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=is(e.body,t),n.body(Za(r,void 0)));return os(e,t)?ss(r):r}return t=>mo(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>mo(e,t);return to(e,t)||!os(e,t)?n:ss(n)}return t=>Fo(n,e,t)},os=(e,t)=>Fs(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>Fs(e.set,t)!==void 0)),ss=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}},cs=(e,t)=>{let n=vo(e,t);return n!==void 0&&So(n)>0},ls=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!U(e)&&cs(e.name,t)),us=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>X(e,t),expression:e})),ds=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(us(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&ls(t[0],n)){let e=Y(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&ls(t[0],n)&&ls(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=>Eo(e,n)?To(Co(e,n),n):X(e,n)),n)},fs=(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:jo(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:Co(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},ps=/* @__PURE__ */ new WeakMap,ms=e=>{let t=ps.get(e);if(t)return t;let n={calls:/* @__PURE__ */ new Map,size:0};return ps.set(e,n),n},hs=(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},gs=(e,t)=>e.every((e,n)=>ze(e,t[n])),_s=(e,t)=>{let n=$a(e.operator,t);return n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&to(n,t)&&!Uo(n,t)},vs=(e,t,n,r)=>{let i=fs(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=is(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=ms(e);return e=>{let n=i(e),r=hs(n,t.length);if(!r)return o(n,e);let a=r.length;for(let e of r)a=fn(a,_n(e));let c=s.calls.get(a),l=c?.find(e=>gs(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}},ys=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=Y(n[0],t),r=Y(n[1],t);return t=>!Qa(e(t),`the left side of =>`)||Qa(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=U(e)?void 0:vo(e.operator,t);if(r?.kind===`Closure`)return vs(r,n,t,_s(e,t));if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=Y(n[0],t),i=Wa(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=Y(n[0],t);return gi.has(e)||eo(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=Ga(e,r);return e=>o(i(e),a(e))}return r?.kind===`Builtin`?ds(r,n,t):r=>{let i=xo(e.operator,r);if(i)return No(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 ${J(e)}`)}},bs=(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=ro(o(t),a.set);for(let a=0;a<s.length;a++){let o=Qa(i(Za(t,Ya(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)=>ro(e(t),o[n].set)),c=(a,o)=>{if(a<0)return Qa(i(Za(t,o)),r)!==n;let l=s[a];for(let t=0;t<l.length;t++)if(c(a-1,Ya(o,e[a],l[t])))return!0;return!1};return c(o.length-1,t.scope)?!n:n}}return e=>io(o,e,t=>Qa(i(Za(e,t)),r)!==n)?!n:n},xs=(e,t)=>{if(e.kind===`Tuple`)return Ot(e.names.map(e=>{let n=Ja(t,e);return n?.kind===`Value`&&n.value}));let n=Ja(t,e.name);return n?.kind===`Value`?n.value:void 0},Ss=/* @__PURE__ */ new WeakSet,Cs=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&Ss.add(e)},ws=(e,t)=>{let n=Ss.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):ao(i,t),l=typeof c==`object`&&c.kind===`ProductSet`&&i.length>1?c.factors:[c];if(e.isRecursive||n||!l.every(de)){let n=uo(c,e=>r(Za(t,oo(i,t.scope,e))),lo(i,e.body,c));return i.length===1?nn(n):n}if(o&&a.pattern.kind===`Name`){let e=a.pattern.name,n=Et(c);return nn(Ie(n,n.map(n=>r(Za(t,Ya(t.scope,e,n))))))}let u=[];return io(i,t,e=>{let n=i.length===1?xs(a.pattern,e)??!1:Ot(i.map(t=>xs(t.pattern,e)??!1));return u.push([n,r(Za(t,e))]),!1}),vt(u)}},Ts=(e,t)=>{let n=Ss.has(e);n&&Cs(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):Ot(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Za(i,Ya(i.scope,`@`,e))):ln(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}},Es=(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=>Qa(n(Za(t,Xa(t.scope,i,e))),`a set filter predicate`);if(!de(a)){if(j(a))return{kind:`FilteredSet`,base:a,test:o};throw new u(`TLC encountered a non-enumerable quantifier bound ${H(a)} at ${J(e.bound.set)}`)}return Fe(z(a).elements.filter(o))}}if(e.kind===`SetMap`){let n=Y(e.expression,t);return t=>{let r=[];return io(e.bounds,t,e=>(r.push(n(Za(t,e))),!1)),pt(r)}}let n=e.set;if(!n)return()=>{throw new u(`TLC cannot evaluate an unbounded CHOOSE at ${J(e)}`)};let r=Y(e.body,t),i={pattern:e.pattern,set:n};return t=>{let n={value:void 0};if(io([i],t,i=>Qa(r(Za(t,i)),`the body of CHOOSE`)?(n.value=xs(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${Ba(e)}`);return n.value}},Ds=e=>[...e].sort((e,t)=>L(e.name,t.name)),Os=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),ks=(e,t)=>new u(`The variable ${e} is not assigned at ${J(t)}`),As=e=>new u(`A primed expression appears outside an action at ${J(e)}`),js=(e,t)=>{let n=Ds(e),r=Os(n),i=n.map(e=>Y(e.value,t));if(r)return e=>vt(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=>_e(a,i.map(t=>t(e)),o):e=>Ie(a,i.map(t=>t(e)))},Ms=(e,t)=>{let n=e=>Y(e,t);switch(e.kind){case`Number`:{let t=e.value;return Io(t)?()=>t:()=>{throw qa(e)}}case`Decimal`:return()=>{throw Ka(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return as(e,t);case`Apply`:return ys(e,t);case`OperatorReference`:case`Lambda`:return()=>{throw new u(`An operator cannot be used as a value at ${J(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 Ha(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(Qa(t[n](e),`a disjunct`))return!0;return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw As(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=>Le(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 Va(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(Qa(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${Ba(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(Za(n,Po(e.definitions,n)))}case`Forall`:case`Exists`:return bs(e,t);case`UnboundedQuantifier`:return()=>{throw new u(`TLC cannot evaluate an unbounded quantifier at ${J(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Es(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>pt(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>Ot(t.map(t=>t(e)))}case`FunctionConstruction`:return ws(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 js(e.fields,t);case`RecordSet`:{let t=Ds(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 Ts(e,t);case`ExceptAt`:return t=>{let n=Ja(t.scope,`@`);if(n?.kind!==`Value`)throw new u(`@ appears outside an EXCEPT at ${J(e)}`);return n.value};case`FunctionApplication`:{Cs(e.function);let t=n(e.function),r=e.args.map(n);if(r.length===1){let e=r[0];return n=>on(t(n),e(n))}return e=>on(t(e),Ot(r.map(t=>t(e))))}case`FieldAccess`:{let t=n(e.record),r=e.field,i=Ua(e);return e=>on(t(e),r,i)}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?Qa(t(e),`an action`)||r(e):Qa(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>Pa(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new u(`The subexpression reference at ${J(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 ${J(e)}`)}}},Ns=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),Ps=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},Fs=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(Ns.has(e.kind))return!1;let a=Ps(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&&Ro(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 Ln(e).every(i)};return i(e)?[...n]:void 0},Is=/* @__PURE__ */ new Map([[`Reals`,`-------------------------------- MODULE Reals -------------------------------
13
+ : `,u=`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.`,d=e=>e instanceof RangeError&&e.message===`Maximum call stack size exceeded`;var f=class extends Error{constructor(e,t){super(e,{cause:t}),this.name=`TlaError`}},p=class extends f{failure;sany;constructor(e,t,n,r){super(e,t),this.name=`TlaSyntaxError`,this.failure=n,this.sany=r}};const m=(e,t=!1,n,r=[])=>new p(e.map(e=>`${e.location}\n\n${e.message}`).join(`
17
+
18
+ `),void 0,void 0,{errors:e,warnings:r,isFatal:t,parseError:n}),h=e=>`*** Warnings: ${e.length}\n\n${e.map(e=>`${e.location}\n\n${e.message}\n\n\n`).join(`
19
+ `)}`;var g=class extends f{constructor(e){super(e),this.name=`TlaParseError`}};const _=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,v=(e,t)=>m([{location:_(t),message:e}]);var y=class extends f{constructor(e,t){super(e,t),this.name=`TlaConfigError`}},b=class extends f{constructor(e,t){super(e,t),this.name=`TlaEvaluationError`}},x=class extends b{exitCode;constructor(t,n=e.error){super(t),this.name=`TlaEvaluationError`,this.exitCode=n}},S=class extends b{variable;constructor(e,t){super(e),this.name=`TlaEvaluationError`,this.variable=t}},C=class extends b{state;action;missing;constructor(e,t,n){super(`Successor state is not completely specified by the next-state action. The following variable${n.length>1?`s are`:` is`} not defined: ${n.join(`, `)}.\n`),this.name=`TlaEvaluationError`,this.state=e,this.action=t,this.missing=n}},w=class extends b{state;constructor(e){super(`current state is not a legal state`),this.name=`TlaEvaluationError`,this.state=e}},T=class extends f{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)})`}},ee=class extends T{constructor(e=`Assert_failure`){super(`Oops, this seems to be a bug in TLAPM.`,{exception:e}),this.name=`TlaProofError`}},te=class extends f{constructor(e,t){super(e,t),this.name=`TlaUnsupportedError`}};const ne=t=>r(t)??(t instanceof p?e.specParseError:t instanceof y?e.configParseError:t instanceof b?e.specEvaluationFailure:e.error),E=/* @__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(`.`)),re=/* @__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`]]),D=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),O=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),k=/* @__PURE__ */ new Map([[`∧`,`/\\`],[`∨`,`\\/`],[`¬`,`~`],[`⇒`,`=>`],[`⟹`,`=>`],[`≡`,`<=>`],[`⇔`,`<=>`],[`∈`,`\\in`],[`∉`,`\\notin`],[`⊆`,`\\subseteq`],[`⊂`,`\\subset`],[`⊇`,`\\supseteq`],[`⊃`,`\\supset`],[`∪`,`\\cup`],[`∩`,`\\cap`],[`×`,`\\X`],[`∀`,`\\A`],[`∃`,`\\E`],[`≠`,`#`],[`≤`,`<=`],[`≥`,`>=`],[`↦`,`|->`],[`→`,`->`],[`⟨`,`<<`],[`⟩`,`>>`],[`□`,`[]`],[`◇`,`<>`],[`≜`,`==`],[`′`,`'`],[`∘`,`\\o`],[`⋅`,`\\cdot`]]),A=/^\\([bB][01]+|[oO][0-7]+|[hH][0-9a-fA-F]+)/,ie=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),j=e=>e.startsWith(`\\`)?parseInt(e.slice(2),ie.get(e[1].toLowerCase())):Number(e),ae=/-{4,}[ \t]*MODULE\b/,oe=e=>/[A-Za-z0-9_]/.test(e),se=(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&&!re.has(n.slice(0,r.value));)r.value--;let i=re.get(n.slice(0,r.value));return{text:i??`\\`,length:i===void 0?1:r.value+1}}let r=k.get(n);if(r)return{text:r,length:n.length};let i=O.find(n=>e.startsWith(n,t));return i?{text:D.get(i)??i,length:i.length}:n===`\\`?{text:`\\`,length:1}:void 0},ce=e=>e!==void 0&&e>=`0`&&e<=`9`,le=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},ue=(e,t)=>{if(e[t]!==`<`)return 0;let n=e[t+1]===`+`||e[t+1]===`*`?t+2:le(e,t+1,ce);if(n===t+1||e[n]!==`>`)return 0;let r=le(e,n+1,oe),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return le(e,i?r+1:r,e=>e===`.`)-t},de=(e,t)=>t===` `?e+8-e%8:e+1,fe=e=>{let t=ae.exec(e);if(!t)throw new p(`Expected a module header such as ---- MODULE Name ----`);let n=[],r=/* @__PURE__ */ new Map,i=e.slice(0,t.index).split(`
20
+ `),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=de(o.width,e[o.position]);return de(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]===`
21
+ `&&(a.line++,a.lineStart=a.index+1),a.index++},u=t=>new p(`${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===`
22
+ `||t===` `||t===` `||t===`\r`){l(1);continue}if(e.startsWith(`\\*`,a.index)){let t=e.indexOf(`
23
+ `,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 u(`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=le(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`,`====`,le(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]===`
24
+ `)throw u(`Unterminated string`);if(e[a.index]===`\\`){let t=e[a.index+1];i.push({n:`
25
+ `,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=A.exec(e.slice(a.index,a.index+64));if(i){c(`Number`,i[0],i[0].length);continue}if(oe(t)){let t=e.slice(a.index,le(e,a.index,oe));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(E.has(t)?`Keyword`:`Identifier`,n,t.length);continue}let o=ue(e,a.index);if(o>0){c(`Step`,e.slice(a.index,a.index+o),o);continue}let d=se(e,a.index);if(d)c(`Operator`,d.text,d.length);else throw u(`Unexpected character ${JSON.stringify(t)}`)}let d=s();return n.push({kind:`End`,text:``,line:a.line,column:d,endColumn:d}),n},pe=/* @__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`]),M=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`],me={INIT:`init`,NEXT:`next`,SPECIFICATION:`specification`,VIEW:`view`,SYMMETRY:`symmetry`,ALIAS:`alias`,_PERIODIC:`periodic`,_RL_REWARD:`rlReward`},he={INVARIANT:`invariants`,INVARIANTS:`invariants`,PROPERTY:`properties`,PROPERTIES:`properties`,CONSTRAINT:`constraints`,CONSTRAINTS:`constraints`,ACTION_CONSTRAINT:`actionConstraints`,ACTION_CONSTRAINTS:`actionConstraints`,POSTCONDITION:`postconditions`,POSTCONDITIONS:`postconditions`,_POSSIBLE:`possible`},ge=e=>Object.hasOwn(me,e),_e=e=>Object.hasOwn(he,e),ve=e=>[...e].map(e=>{let t={"\b":`\\b`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`}[e];if(t)return t;if(e===`"`||e===`'`||e===`\\`)return`\\${e}`;let n=e.codePointAt(0)??0;return n<32||n>126?`\\u${n.toString(16).padStart(4,`0`)}`:e}).join(``),ye=(e,t,n,r=``)=>new y(`TLC found an error in the configuration file:\nLexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${ve(n)}" (${n.codePointAt(0)}), `}after : "${ve(r)}"`),be=(e,t)=>new y(`TLC found an error in the configuration file at line ${e}\n${t}`),xe=e=>{let t=`${e}\n`,n=[],r={index:0,line:1,lineStart:0},i=e=>{let n=t.slice(r.index,r.index+e),i=n.lastIndexOf(`
26
+ `);i!==-1&&(r.line+=n.split(`
27
+ `).length-1,r.lineStart=r.index+i+1),r.index+=e},a=e=>ye(r.line+1,0,void 0,e);for(;r.index<t.length;){let e=t.slice(r.index),o=/^\s+/.exec(e)?.[0];if(o){i(o.length);continue}if(e.startsWith(`\\*`)){r.index+=e.indexOf(`
28
+ `);continue}if(e.startsWith(`(*`)){let t=e.indexOf(`*)`);if(t===-1)throw r.line+=e.split(`
29
+ `).length-2,a(``);i(t+2);continue}let s=/^\d+(?![A-Za-z_])/.exec(e)?.[0];if(s){n.push({kind:`Number`,text:s,line:r.line}),r.index+=s.length;continue}let c=/^[A-Za-z0-9_!]+/.exec(e)?.[0];if(c){n.push({kind:`Word`,text:c,line:r.line}),r.index+=c.length;continue}if(e.startsWith(`"`)){let t=/^"((?:[^"\\\n]|\\.)*)"/.exec(e);if(!t){let t=e.indexOf(`
30
+ `);throw t===e.length-1?a(e):ye(r.line,r.index+t-r.lineStart+1,`
31
+ `,e.slice(0,t))}n.push({kind:`String`,text:t[1],line:r.line}),r.index+=t[0].length;continue}let l=M.find(t=>e.startsWith(t));if(l){n.push({kind:`Symbol`,text:l,line:r.line}),r.index+=l.length;continue}let u=se(t,r.index);if(!u)throw ye(r.line,r.index-r.lineStart+1,e[0]);n.push({kind:`Word`,text:u.text,line:r.line}),r.index+=u.length}return n.push({kind:`End`,text:``,line:r.line-1}),n},Se=e=>{let t=xe(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[Math.min(n.index++,t.length-1)],o=e=>e.kind===`Word`&&pe.has(e.text),s=e=>{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=[],t=a();if(t.text!==`}`)for(;e.push(s(t)),t=a(),t.text===`,`;)t=a();if(t.text!==`}`)throw be(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(e.kind!==`End`)return{kind:`ModelValue`,name:e.text};throw be(e.line,`It was expecting a value, but did not find it.`)},c=e=>{let t=a();if(t.kind===`End`)throw be(t.line,`Expected an identifier after ${e}[.`);let n=a();if(n.text!==`]`)throw be(n.line,`It was expecting ], but did not find it.`);return t.text},l=e=>{for(;;){let t=a();if(t.kind===`End`||o(t))return t;let n={text:t.text},i=a();for(;i.text===`!`;)n.text=`${n.text}!${a().text}`,i=a();if(i.text===`<-`){if(i=a(),i.text===`[`){let e=c(`<-`),t=a();if(t.kind===`End`)throw be(t.line,`Expected an identifier after <-[mod].`);r.substitutions.push({name:n.text,target:t.text,module:e});continue}if(i.kind===`End`)throw be(i.line,`Expected an identifier after <-.`);r.substitutions.push({name:n.text,target:i.text});continue}let l=[];if(i.text===`(`){for(;l.push(s(a())),i=a(),i.text===`,`;);if(i.text!==`)`)throw be(e,``);i=a()}if(i.text!==`=`)throw be(i.line,`It was expecting = or <-, but did not find it.`);i=a();let u=i.text===`[`?c(`=`):void 0,d=s(u===void 0?i:a());r.constants.push({name:n.text,value:d,...l.length>0&&{args:l},...u&&{module:u}})}},u=a();for(;u.kind!==`End`;){let e=u.text,t=u.line;if(ge(e)){let n=a();if(n.kind===`End`)throw be(t,`The keyword ${e} was not followed by an identifier.`);let i=me[e];if(r[i]!==void 0)throw be(t,`The keyword ${e} appeared twice.`);r[i]=n.text,u=a()}else if(_e(e)){let t=r[he[e]];for(u=a();u.kind!==`End`&&!o(u);)t.push(u.text),u=a()}else if(e===`CONSTANT`||e===`CONSTANTS`)u=l(t);else if(e===`CHECK_DEADLOCK`){let e=a();if(e.kind===`End`)throw be(t,`The keyword CHECK_DEADLOCK was not followed by an identifier.`);if(e.text!==`TRUE`&&e.text!==`FALSE`)throw be(e.line,`It was expecting TRUE or FALSE, but did not find it.`);if(i.isSet)throw be(t,`The keyword CHECK_DEADLOCK appeared twice.`);i.isSet=!0,r.checkDeadlock=e.text===`TRUE`,u=a()}else throw be(t,`It was expecting a keyword, but did not find it.`)}if(r.specification!==void 0&&(r.init!==void 0||r.next!==void 0))throw new y(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);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:` `}},we=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},Te=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Ee=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),De=e=>{let t=t=>{let n=le(e,t,we);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=le(e,t,Te);if(e.startsWith(`..`,n)&&Te(e[n+2]))return{kind:`Constant`,first:t,last:le(e,n+2,Te)-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=Te(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:le(e,t+1,Te)-1,children:[]};if(Ee(n))return{kind:`Constant`,first:t,last:le(e,t,Ee)-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)},Oe=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=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},ke={current:void 0},N=/* @__PURE__ */ new WeakMap,Ae=e=>e instanceof b?N.get(e):void 0,je=(e,t)=>{let n=ke.current;if(!n||typeof e!=`object`)return t();try{return t()}catch(t){let r=n.get(e);throw r&&t instanceof b&&N.set(t,[r,...N.get(t)??[]]),t}},Me=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,Ne=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),P=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),Pe=e=>typeof e==`object`&&e.kind===`ModelValue`,Fe=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:Me(e)?`set`:`function`,F=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new x(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},Ie={isUsed:!1},Le=(e,t)=>(Ie.isUsed=!0,e.writtenKeys=t,e),I=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[mn(e.domain,t)]]),L=(e,t,n)=>Le($e(e,t),n),R=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(R);e.writtenKeys=void 0,e.range.forEach(R)}},z=e=>e.every(e=>typeof e==`string`),B=(e,t)=>e.length>0&&t.length>0&&z(e)!==z(t),Re=(e,t)=>{Ie.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return B(n,r)?_t(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Ye(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=Ye(i[e],a[e]);if(t!==0)return t}return 0},V=(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=Ye(n[e],r[e]);if(t!==0)return t}return 0},H=e=>Pe(e)?e.type:void 0,U=(e,t,n)=>{let r=H(e),i=H(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(Pe(e)&&Pe(t)){if(r===void 0||i===void 0||r===i)return;throw new b(`Attempted to ${a} the differently-typed model values ${Y(e)} and ${Y(t)}`)}throw r===void 0?new b(`Attempted to ${a} the typed model value ${Y(t)} and the non-model value\n${Y(e)}`):new b(`Attempted to ${a}${n?``:` the`} typed model value ${Y(e)} and non-model value\n${Y(t)}`)},W={ranks:Object.create(null),size:0},ze=e=>{W.ranks=Object.create(null),W.size=0,Xe.clear();for(let t of e)Be(t)},Be=e=>(W.ranks[e]===void 0&&(W.ranks[e]=W.size++),e),Ve=()=>W.size,He=e=>W.ranks[Be(e)],Ue=(e,t)=>{if(e===t)return 0;let n=W.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},We=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Ge=(e,t)=>(We(e)||We(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Ke=(e,t,n)=>{if(!We(e))throw new b(`Attempted to ${n} the set ${Y(Yt(e)?q(e):e,!0)} with the value:\n${Y(t,!0)}`);if(!We(t))throw new b(`Attempted to compare overridden value ${Y(e,!0)} with non-overridden value:\n${Y(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 b(`Attempted to compare ${Y(e,!0)} with the value\n${Y(t,!0)}`)},qe={kind:`InfiniteSet`,name:`Any`},Je=e=>{throw new b(`Attempted to compare ANY with the value\n${Y(e)}`)},Ye=(e,t)=>{if(e===t)return Ie.isUsed&&R(e),e===qe?Je(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Re(e,t);if(n===`Set`&&r===`Set`)return V(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&&U(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return U(e,t,!1),n===`ModelValue`?-1:1;if(e===qe||t===qe)return Je(e===qe?t:e);if(Me(e)&&Me(t)&&Ge(e,t))return Ke(e,t,`compare`);let i=Me(e);if(i!==Me(t))throw new b(`Attempted to compare ${Fe(e)} ${Y(e)} with ${Fe(t)} ${Y(t)}`);return i?V(q(e),on(t)):Re(xn(e),xn(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Ue(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(U(e,t,!1),Pe(e))return-1;if(Pe(t))return 1;throw new b(`Attempted to compare ${Fe(e)} ${Y(e)} with ${Fe(t)} ${Y(t)}`)},Xe=/* @__PURE__ */ new Map,Ze=e=>{let t=Xe.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:He(e)};return Xe.set(e,n),n},Qe=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0}),$e=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0}),et=(e,t)=>{if(e===t)return Ie.isUsed&&R(e),e!==qe||Je(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&U(e,t,!0),Ye(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 Re(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return V(e,t)===0;if(Pe(e)||Pe(t))return U(e,t,!0),Pe(e)&&Pe(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return et(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=cn(e.domain),r=cn(t.domain);if(n||r)return n===r;let i=cn(e.range),a=cn(t.range);return i||a?i===a:et(e.domain,t.domain)&&et(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(cn(e))return cn(t);if(cn(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]&&et(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return cn(e)?cn(t):!cn(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>et(e,t.factors[n]));let n=Me(e)&&Me(t)&&!(Yt(e)&&Yt(t));if(n&&Ge(e,t))return Ke(e,t,`check equality of`)===0;if(n){if(!We(e)){let n=q(e);if(!We(t))return V(n,q(t))===0}return er(e)===er(t)}return Ye(e,t)===0},tt=(e,t)=>e===t||e.length===t.length&&e.every((e,n)=>nt(e,t[n])),nt=(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)&&tt(e.elements,t.elements):e.kind===`Function`&&t.kind===`Function`?(e.hash===0||t.hash===0||e.hash===t.hash)&&tt(e.domain,t.domain)&&tt(e.range,t.range):er(e)===er(t),rt=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},G=e=>{if(!P(e))return;let t=xn(e);return{domain:t.domain,range:t.range,low:rt(t.domain)}},K=e=>{if(!P(e))return;let t=xn(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},it=(e,t)=>{if(H(e)!==void 0)throw new b(`Attempted to compare the typed model value ${Y(e)} and the non-model value\n${Y(t)}`);return 1},at=(e,t)=>{if(H(e)!==void 0)throw new b(`Attempted to check equality of the typed model value ${Y(e)} and the non-model value\n${Y(t)}`);return!1},ot=(e,t)=>{let n=H(e);if(n===void 0)return Pe(t)?e.rank-t.rank:-1;if(!Pe(t))throw new b(`Attempted to compare the typed model value ${Y(e)} and non-model value\n${Y(t)}`);let r=H(t);if(r!==void 0&&r!==n)throw new b(`Attempted to compare the differently-typed model values ${Y(e)} and ${Y(t)}`);return e.rank-t.rank},st=(e,t)=>{let n=H(e);if(n===void 0)return Pe(t)&&e.name===t.name;if(!Pe(t))throw new b(`Attempted to check equality of typed model value ${Y(e)} and non-model value\n${Y(t)}`);let r=H(t);if(r!==void 0&&r!==n)throw new b(`Attempted to check equality of the differently-typed model values ${Y(e)} and ${Y(t)}`);return e.name===t.name},ct={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`}},lt=(e,t,n)=>{let r=ct[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${Y(e)} with ${r.other}:\n${Y(t)}`},ut=(e,t,n)=>{let r=G(n);if(!r){if(Pe(n))return it(n,t);throw new b(`Attempted to compare the function ${Y(t)} with the value:\n${Y(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>dt(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 dt(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 b(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${Y(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},dt=(e,t)=>{for(let n=0;n<e.length;n++){let r=_t(e[n],t[n]);if(r!==0)return r}return 0},ft=(e,t)=>{let n=xn(e);if(e.kind===`Function`&&hn(n)!==void 0){let r=P(t)?hn(t):void 0;return r?n.range.length-r.length||dt(n.range,r):ut({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=K(t);if(!r){if(Pe(t))return it(t,e);throw new b(`Attempted to compare record:\n${Y(e)}\nwith non-record\n${Y(t)}`)}return n.domain.length-r.domain.length||dt(n.domain,r.domain)||dt(n.range,r.range)}return ut({...n,low:rt(n.domain)},e,t)},pt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),mt=(e,t)=>We(e)||We(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),ht=(e,t)=>{let n=pt(t)?t:q(t);return{elements:q(e).elements,otherElements:q(n).elements}},gt=(e,t)=>{if(mt(e,t))return Ye(e,t);if(!pt(e))return gt(q(e),t);if(!Me(t)){if(Pe(t))return it(t,e);throw new b(`Attempted to compare the set ${Y(e)} with the value:\n${Y(t)}`)}let n=ht(e,t);return n.elements.length-n.otherElements.length||dt(n.elements,n.otherElements)},_t=(e,t)=>je(e,()=>{if(typeof e!=`object`){if(typeof t==typeof e)return Ye(e,t);if(Pe(t))return it(t,e);throw new b(lt(e,t,!1))}return e.kind===`ModelValue`?ot(e,t):P(e)?ft(e,t):gt(e,t)}),vt=(e,t)=>e.every((e,n)=>St(e,t[n])),yt=(e,t,n)=>{let r=G(n);if(!r){if(Pe(n))return at(n,t);throw new b(`Attempted to check equality of the function ${Y(t)} with the value:\n${Y(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)&&vt(e.range,r.range);let i=e.low??r.low;return i===void 0?vt(e.domain,r.domain)&&vt(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new b(`Attempted to compare an integer with non-integer:\n${Y(e)}.`);return e===i+t})&&vt(e.range,r.range)},bt=(e,t)=>{let n=xn(e);if(e.kind===`Function`&&hn(n)!==void 0){let r=P(t)?hn(t):void 0;return r?n.range.length===r.length&&vt(n.range,r):yt({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=K(t);if(!r){if(Pe(t))return at(t,e);throw new b(`Attempted to check equality of record:\n${Y(e)}\nwith non-record\n${Y(t)}`)}return n.domain.length===r.domain.length&&vt(n.domain,r.domain)&&vt(n.range,r.range)}return yt({...n,low:rt(n.domain)},e,t)},xt=(e,t)=>{if(mt(e,t))return et(e,t);if(!pt(e))return xt(q(e),t);if(!Me(t)){if(Pe(t))return at(t,e);throw new b(`Attempted to check equality of the set ${Y(e)} with the value:\n${Y(t)}`)}let n=ht(e,t);return n.elements.length===n.otherElements.length&&vt(n.elements,n.otherElements)},St=(e,t)=>je(e,()=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(Pe(t))return at(t,e);throw new b(lt(e,t,!0))}return e.kind===`ModelValue`?st(e,t):P(e)?bt(e,t):xt(e,t)}),Ct=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=_t(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},wt=(e,t)=>t.some(t=>St(t,e)),Tt=(e,t)=>{try{return et(e,t)}catch(n){if(!(n instanceof b))throw n;return St(e,t)}},Et=e=>{for(let t=1;t<e.length;t++)if(Ye(e[t],e[t-1])<=0)return!1;return!0},Dt=e=>{if(e.length<2||Et(e))return Qe(e);let t=[...e].sort(Ye),n=[t[0]];for(let e=1;e<t.length;e++)Ye(n[n.length-1],t[e])!==0&&n.push(t[e]);return Qe(n)},Ot=e=>{try{return Dt(e)}catch(t){if(!(t instanceof b))throw t;return{kind:`MixedSet`,elements:e}}},kt=Qe([]),At=(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&&Ye(r[a],t)<0;)a++;a<r.length&&Ye(r[a],t)===0||i.push(t)}return i.length===n.length?e:Qe(i)},jt=(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&&Ye(r[a],t)<0;)a++;a<r.length&&Ye(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Qe(i)},Mt=(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=Ye(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=Qe(i);if(e.hash!==0){let t=e.hash;for(let e=0;e<a.length;e++)t=t+zn(a[e])|0;c.hash=t}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Yn(a[e])|0;c.fingerprint=t}return c},Nt=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Ye(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Ye(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return $e(n,r)},Pt=e=>{let t=Nt(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:Le(t,e.map(e=>e[0]))},Ft=[],It=[],Lt=/* @__PURE__ */ new WeakMap,Rt=e=>{let t=Ft[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Ft[e]=n,n},zt=e=>{if(dn(e),e.low===1&&e.high>=1)return Rt(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Bt=e=>e.length>0&&(e===Ft[e.length]||Lt.has(e)),Vt=e=>{let t=q(e).elements;return Bt(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Ht=e=>{let t=It[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return It[e]=n,n},Ut=e=>$e(Rt(e.length),e),Wt=e=>Nt(e),Gt=e=>Me(e)&&!We(e),Kt=(e,t=!1)=>`UNION(${Y(e.base,t)})`,qt=(e,t=e=>q(e).elements)=>{if(!Gt(e.base))throw new b(`Attempted to enumerate the nonenumerable set:\n${Kt(e)}`);return t(e.base)},Jt=(e,t,n)=>{if(Gt(e))return e;throw new b(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${Y(e)}\nwhen enumerating:\n${Kt(n)}`)},Yt=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 Yt(e.base);case`FunctionSet`:return Yt(e.domain)&&Yt(e.range)||Xt(e.domain)===!0||Xt(e)===!0;case`RecordSet`:return e.sets.every(Yt)||Xt(e)===!0;case`ProductSet`:return e.factors.every(Yt)||Xt(e)===!0;case`Union`:return Yt(e.base)&&sn(e.base).every(Yt);case`SetOperation`:return e.operator===`\\cup`?Yt(e.left)&&Yt(e.right):e.operator===`\\cap`?Yt(e.left)||Yt(e.right):Yt(e.left);default:return!1}},Xt=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=Xt(e.domain);return t===void 0?void 0:!t&&Xt(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Xt(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return Yt(e)?q(e).elements.length===0:void 0;default:return}},Zt=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},Qt=(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},$t=e=>{if(typeof e!=`object`||e.kind!==`Subset`||We(e.base))return;let t=q(e.base).elements;if(t.length<=30)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:Qt(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return Qe(n.indices.map(e=>t[e]))},i=2**t.length,a=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<i;return new Proxy([],{get:(e,t,n)=>t===`length`?i:a(t)?r(Number(t)):Reflect.get(e,t,n),has:(e,t)=>a(t)||Reflect.has(e,t)})},en=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Qe(r.map(t=>e[t])));while(Qt(r,e.length))}return t},tn=e=>{if(typeof e!=`object`)throw new b(`Expected a set but found ${Y(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return Ct(e.elements);case`Interval`:{let t=zt(e);return t!==Ft[t.length]&&Lt.set(t,e),t}case`Subset`:{We(e.base)&&dn(e.base);let t=q(e.base).elements;if(t.length>30)throw new b(un(e));return en(t)}case`FunctionSet`:{if(cn(e))return[];if(We(e.domain))throw new b(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${Y(e.domain)}\ncannot be enumerated.`);let t=Vt(e.domain);if(t.length>0&&We(e.range))throw new b(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${Y(e.range)}\ncannot be enumerated.`);let n=t.length===0?[]:q(e.range).elements;return Zt(t.map(()=>n)).map(e=>$e(t,e))}case`RecordSet`:{if(cn(e))return[];let t=e.sets.map((t,n)=>{if(We(t))throw new b(`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${Y(t)}`);return q(t).elements});return Zt(t).map(t=>Wt(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(cn(e))return[];let t=e.factors.map((e,t)=>{if(We(e))throw new b(`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${Y(e)}`);return q(e).elements});return Zt(t).map(Ut)}case`FilteredSet`:if(We(e.base))throw new b(`Attempted to enumerate { x \\in S : p(x) } when S:\n${Y(e.base)}\nis not enumerable`);return q(e.base).elements.filter(e.test);case`Union`:{let t=qt(e).flatMap((t,n)=>q(Jt(t,n,e)).elements);return q(Ot(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!Gt(e.left)||!Gt(e.right)))throw new b(`Attempted to enumerate S \\cup T when S:\n${Y(e.left)}\nand T:\n${Y(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&!Gt(e.left)&&!Gt(e.right))throw new b(`Attempted to enumerate S \\cap T when neither S:\n${Y(e.left)}\nnor T:\n${Y(e.right)}\nis enumerable`);if(e.operator===`\\`&&!Gt(e.left))throw new b(`Attempted to enumerate S \\ T when S:\n${Y(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Mt(q(e.left),q(e.right)).elements;let t=e.operator===`\\`||Yt(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return q(n).elements.filter(t=>yn(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new b(`Attempted to enumerate the non-enumerable set ${Y(e)}`);default:throw new b(`Expected a set but found ${Y(e)}`)}},nn=/* @__PURE__ */ new WeakMap,rn=/* @__PURE__ */ new WeakMap,q=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Qe(tn(e));let t=typeof e==`object`?nn.get(e):void 0;if(t)return t;let n=(typeof e==`object`?rn.get(e):void 0)??(ke.current?je(e,()=>an(e)):an(e));return typeof e==`object`&&nn.set(e,n),n},an=e=>{let t=tn(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`)?Qe(t):Dt(t)},on=e=>{if(typeof e!=`object`||e.kind!==`Union`&&e.kind!==`SetOperation`&&e.kind!==`FilteredSet`||nn.has(e))return q(e);let t=rn.get(e);if(t)return t;let n=an(e);return rn.set(e,n),n},sn=e=>{if(typeof e!=`object`||nn.has(e))return q(e).elements;if(e.kind===`Union`)return qt(e,sn).flatMap((t,n)=>sn(Jt(t,n,e)));if(e.kind===`FilteredSet`&&!We(e.base))return sn(e.base).filter(e.test);if(e.kind!==`SetOperation`)return q(e).elements;if(e.operator===`\\cup`)return!Gt(e.left)||!Gt(e.right)?q(e).elements:[...sn(e.left),...sn(e.right)];let t=e.operator===`\\`||Yt(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return Gt(n)?sn(n).filter(t=>yn(t,r)===(e.operator===`\\cap`)):q(e).elements},cn=e=>{if(typeof e!=`object`||!Me(e))throw new b(`Shouldn't call isEmpty() on value ${Y(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 b(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(cn);case`RecordSet`:return e.sets.some(cn);case`FunctionSet`:return!cn(e.domain)&&cn(e.range);case`Union`:return qt(e).every((t,n)=>cn(Jt(t,n,e)));default:return q(e).elements.length===0}},ln=(e,t)=>e.reduce((e,n)=>{let r=e*dn(n);if(r>2147483647)throw new b(t());return r},1),un=e=>`Overflow when computing the number of elements in:\n${Y(e)}`,dn=e=>{if(typeof e!=`object`)return q(e).elements.length;switch(e.kind){case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new b(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new b(`Attempted to compute the number of elements in the overridden value ${Y(e)}.`);case`Subset`:{let t=dn(e.base);if(t>=31)throw new b(un(e));return 2**t}case`FunctionSet`:{if(cn(e.domain))return 1;if(cn(e.range))return 0;let t=dn(e.range);if(t===1)return 1;let n=dn(e.domain),r={value:1};for(let i=0;i<n;i++)if(r.value*=t,r.value>2147483647)throw new b(un(e));return r.value}case`RecordSet`:return cn(e)?0:ln(e.sets,()=>un(e));case`ProductSet`:return cn(e)?0:ln(e.factors,()=>`Overflow when computing the number of elements in ${Y(e)}`);default:return q(e).elements.length}},fn=e=>`Attempted to check if the set ${Y(e)}is finite.`,pn=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new b(`Attempted to check if the ${Fe(e)} ${Y(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new b(`Attempted to check if the function:\n${Y(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return pn(e.base)&&cn(e.base);case`Subset`:return pn(e.base);case`FunctionSet`:{let t=pn(e.domain);if(t&&cn(e.domain))return!0;let n=pn(e.range);return n&&cn(e.range)?!0:n&&(t||dn(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(!pn(e))n.isAllFinite=!1;else if(cn(e))return!0;return n.isAllFinite}case`Union`:if(!Gt(e.base))throw new b(`Attempted to check if the nonenumerable set:\n${Kt(e)}\nis a finite set.`);return q(e.base).elements.every(pn);case`SetOperation`:if(e.operator===`\\cup`)return pn(e.left)&&pn(e.right);if(e.operator===`\\cap`){if(!pn(e.left)&&!pn(e.right))throw new b(fn(e));return!0}if(pn(e.left))return!0;if(!pn(e.right))throw new b(fn(e));return!1;case`FilteredSet`:if(!pn(e.base))throw new b(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${Y(e.base)}\nis finite.`);return!0}},mn=(e,t)=>{let n={low:0,high:e.length-1};for(;n.low<=n.high;){let r=n.low+n.high>>1,i=Ye(e[r],t);if(i===0)return r;i<0?n.low=r+1:n.high=r-1}return-1},hn=e=>{if(typeof e!=`object`||!P(e))return;let t=xn(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},gn=(e,t)=>`Attempted to check if the value ${Y(e)} is an element of ${Y(t)}`,_n=(e,t)=>{let n=`Attempted to check if the value:\n${Y(e)}\nis an element of the`;if(!P(t))return`${n} ${Fe(t)} ${Y(t)}`;let r=t.kind===`Function`||Yt(t.domain)?xn(t).domain:[];return r.length>0&&r.every(e=>typeof e==`string`)?`Attempted to check if element:\n${Y(e)}\nis in the record:\n${Y(t)}`:r.every((e,t)=>e===t+1)?`Attempted to check set membership in a tuple value.`:`${n} function ${Y(t)}`},vn=(e,t)=>ke.current?je(t,()=>yn(e,t)):yn(e,t),yn=(e,t)=>{if(!Me(t))throw new b(_n(e,t));switch(t.kind){case`Set`:try{return mn(t.elements,e)!==-1}catch(n){if(!(n instanceof b))throw n;return je(t,()=>wt(e,t.elements))}case`MixedSet`:return je(t,()=>wt(e,t.elements));case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!Pe(e))throw new b(`Attempted to check if the value:\n${Y(e)}\nis in the integer interval ${Y(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(Pe(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new b(`Attempted to check if the value:\n${Y(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!Gt(e))throw new b(`Attempted to check if the non-enumerable value\n${Oe(Y(e))}\nis element of\n${Oe(Y(t))}`);return q(e).elements.every(e=>vn(e,t.base));case`FunctionSet`:{if(!P(e)){if(Pe(e))return!1;throw new b(`Attempted to check if \n${Y(e)}\nwhich is not a TLC function value, is in the set of functions:\n${Oe(Y(t))}`)}let n=xn(e),r=rt(n.domain);return(r===void 0?Tt(t.domain,Qe(n.domain)):Tt({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>vn(e,t.range))}case`RecordSet`:{let n=P(e)?xn(e):void 0;if(!n||!z(n.domain)){if(Pe(e))return!1;throw new b(`Attempted to check if non-record\n${Y(e)}\nis in the set of records:\n${Y(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=mn(n.domain,e);return i!==-1&&vn(n.range[i],t.sets[r])})}case`ProductSet`:{let n=P(e)?hn(e):void 0;if(n===void 0){if(P(e)&&xn(e).domain.every(e=>typeof e==`number`)||Pe(e))return!1;throw new b(`Attempted to check if non-tuple\n${Y(e)}\nis in the set of tuples:\n${Y(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>vn(e,t.factors[n]))}case`FilteredSet`:return vn(e,t.base)&&t.test(e);case`Union`:if(!Gt(t.base))throw new b(`Attempted to check if:\n ${Y(e)}\nis an element of the non-enumerable set:\n ${Kt(t)}`);return q(t.base).elements.some(t=>vn(e,t));case`SetOperation`:return t.operator===`\\cup`?vn(e,t.left)||vn(e,t.right):vn(e,t.left)&&vn(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=hn(e);if(n===void 0){if(Pe(e))return!1;throw new b(gn(e,t))}return n.every(e=>yn(e,t.base))}default:throw new b(_n(e,t))}},bn=(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?yn(e,n):e.range.every((e,r)=>bn(e,t.range[r],n.range)),xn=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){Yt(e.domain)||dn(e.domain);let t=Vt(e.domain);return $e(t,t.map(t=>e.apply(t)))}throw new b(`Expected a function but found ${Y(e)}`)},Sn=/* @__PURE__ */ new WeakSet,Cn=e=>(Sn.add(e),e),wn=e=>{let t=e.domain;return t.length===0?Sn.has(e)?`FcnRcdValue`:`TupleValue`:t===Ft[t.length]?`TupleValue`:Lt.has(t)?`IntervalFcnRcdValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},J=(e,t)=>`Attempted to apply function:\n${Oe(Y(e))}\nto argument ${Oe(Y(t))}, which is not in the domain of the function.`,Tn=e=>`Attempted to apply function with integer domain to the non-integer argument ${Oe(Y(e))}`,En=(e,t)=>{if(Sn.has(e)||e.kind===`LazyFunction`)return`In applying the function\n${Oe(Y(e))},\nthe first argument is:\n${Oe(Y(t))}\nwhich is not in its domain.\n`;let n=wn(e);return n===`TupleValue`?typeof t==`number`?`Attempted to access index ${t} of tuple\n${Oe(Y(e))}\nwhich is out of bounds.`:`Attempted to access tuple at a non integral index: ${Oe(Y(t))}`:n===`RecordValue`?typeof t==`string`?`Attempted to access nonexistent field '${t}' of record\n${Oe(Y(e))}`:`Attempted to access record by a non-string argument: ${Oe(Y(t))}`:n===`IntervalFcnRcdValue`&&typeof t!=`number`?Tn(t):J(e,t)},Dn=(e,t)=>wn(e)===`FcnRcdValue`?J(e,t):Tn(t),On=e=>wn(e)===`RecordValue`,kn=(e,t)=>{let n=e[0];return typeof n==`number`?typeof t!=`number`&&(e===Ft[e.length]||Lt.has(e)):typeof n==`string`&&typeof t!=`string`},An=(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 mn(e,t)},jn=(e,t,n,r)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!yn(t,e.domain))throw new b(Sn.has(e)?En(e,t):`Attempted to apply a function to ${Y(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new b(r?.(e)??`Attempted to apply ${Y(e)}, which is not a function`);let i=kn(e.domain,t)?-1:An(e.domain,t);if(i===-1)throw new b(n?.(e)??En(e,t));return e.range[i]},Mn=e=>Bt(e)?Lt.get(e)??Ht(e.length):void 0,Nn=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=xn(e).domain;return Mn(t)??Qe(t)},Pn=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!Yt(e.domain))){if(!yn(t,e.domain))return e;let r=n(e.apply(t));return{kind:`LazyFunction`,domain:e.domain,apply:n=>Tt(t,n)?r:e.apply(n),source:e.source}}let i=xn(e),a=An(i.domain,t);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=$e(i.domain,o);if(l.writtenKeys=i.writtenKeys,i.hash!==0){let e=i.domain[a];l.hash=s===c?i.hash:i.hash-Bn(e,s)+Bn(e,c)|0}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Xn(e,s)+Xn(e,c)|0}return l},Fn=/* @__PURE__ */ new WeakMap,In=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Ln=(e,t)=>Math.imul(e^t,16777619),Rn=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return In(t)},zn=e=>In(Un(e)+2654435769|0),Bn=(e,t)=>In(Math.imul(Un(e),668265261)+Un(t)|0),Vn={isHashed:!1},Hn=e=>{if(e.kind===`ModelValue`)return In(Ln(Rn(e.name),109));if(Me(e)){if(!Yt(e))return Vn.isHashed=!0,Rn(er(e));let t=q(e).elements,n=1940243425;for(let e=0;e<t.length;e++)n=n+zn(t[e])|0;return n}let t=xn(e),n=1725019383;for(let e=0;e<t.domain.length;e++)n=n+Bn(t.domain[e],t.range[e])|0;return n},Un=e=>{if(typeof e==`number`)return In(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return Rn(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=Hn(e)),e.hash;let t=Fn.get(e);if(t!==void 0)return t;let n=Hn(e);return Fn.set(e,n),n},Wn=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(We(e))throw new b(`TLC has found a state in which the value of a variable contains ${Y(e)}`);if(Me(e))return q(e).elements.forEach(Wn);let t=xn(e);t.domain.forEach(Wn),t.range.forEach(Wn)},Gn=e=>{Vn.isHashed&&e.forEach(Wn)},Kn=/* @__PURE__ */ new WeakMap,qn=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Jn=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return qn(t)},Yn=e=>qn(Qn(e)+2135587861|0),Xn=(e,t)=>qn(Math.imul(Qn(e),374761393)+Qn(t)|0),Zn=e=>{if(e.kind===`ModelValue`)return qn(Jn(e.name)^60);if(Me(e)){if(!Yt(e))return Vn.isHashed=!0,Jn(er(e));let t=q(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Yn(t[e])|0;return n}let t=xn(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+Xn(t.domain[e],t.range[e])|0;return n},Qn=e=>{if(typeof e==`number`)return qn(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return Jn(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=Zn(e)),e.fingerprint;let t=Kn.get(e);if(t!==void 0)return t;let n=Zn(e);return Kn.set(e,n),n},$n=/* @__PURE__ */ new WeakMap,er=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=$n.get(e);if(t!==void 0)return t;let n=tr(e);return $n.set(e,n),n},tr=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${er(e.base)}>`;if(e.kind===`FilteredSet`&&!Yt(e))throw new b(`Attempted to compare the non-enumerable set ${Y(e)} with another value`);if(Me(e))return Yt(e)?`{${q(e).elements.map(er).join(`,`)}}`:`<${e.kind} ${Y(e)}>`;let t=xn(e);return`(${t.domain.map((e,n)=>`${er(e)}:${er(t.range[n])}`).join(`,`)})`},nr=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,rr=e=>e.reduce((e,t)=>e===0?0:e*dn(t),1),ir=e=>{if(e.kind===`Subset`)return dn(e.base)<=6?q(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return q(e);if(e.kind===`FunctionSet`&&Yt(e.domain)&&dn(e.domain)===0)return Qe([$e([],[])]);let t=e.kind===`FunctionSet`?dn(e.range)**dn(e.domain):rr(e.kind===`RecordSet`?e.sets:e.factors);return t===0?kt:t<=1999?q(e):void 0},ar=(e,t)=>{if(t)return ir(e);if(Yt(e))try{return ir(e)}catch(e){if(e instanceof b)return;throw e}},or=(e,t)=>{let n=e=>Y(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 Kt(e,t)}},sr=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Y=(e,t=!1,n=!1)=>{let r=e=>Y(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return nr(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(q(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=ar(e,t);return n?r(n):or(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{if(e.kind===`LazyFunction`&&!Yt(e.domain)){let t=e.source;return t?`[${t.parameters.map(e=>`${e.name} \\in ${Y(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}let i=xn(e),a=r=>Y(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`&&sr(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):I(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},cr=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${Oe(Y(n))}\n`).join(``)},lr=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},ur=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Un(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||nt(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||nt(i[e],n))return i[e]}return n.kind===`Set`?lr(n.elements,t):(lr(n.domain,t),lr(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}},dr=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:[])}},X=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,fr=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),pr=(e,t)=>fr.has(e)?new b(t):new x(t),mr=e=>typeof e==`object`&&e.kind===`Operator`,Z=(e,t,n)=>{let r=e[t];if(r===void 0||mr(r))throw pr(n,`${n} expects a value as argument ${t+1}`);return r},hr=(e,t,n)=>{let r=Z(e,t,n);if(typeof r!=`number`)throw pr(n,`${n} expects an integer but received ${Y(r)}`);return r},gr=(e,t,n)=>{let r=Z(e,t,n);if(typeof r!=`boolean`)throw pr(n,`${n} expects a boolean but received ${Y(r)}`);return r},_r=(e,t,n)=>{let r=Z(e,t,n);if(!Me(r))throw pr(n,`${n} expects a set but received ${Y(r)}`);return r},vr=(e,t,n)=>{let r=_r(e,t,n);if(!Yt(r))throw pr(n,`${n} cannot enumerate the non-enumerable set ${Y(r)}`);return r},yr=(e,t,n)=>q(vr(e,t,n)),br=(e,t,n)=>yr(e,t,n).elements,xr=(e,t,n)=>{let r=Z(e,t,n),i=hn(r);if(!i)throw pr(n,`${n} expects a sequence but received ${Y(r)}`);return i},Sr=(e,t,n)=>{let r=Z(e,t,n);if(!P(r))throw pr(n,`${n} expects a function but received ${Y(r)}`);return xn(r)},Cr=(e,t,n)=>{let r=e[t];if(r===void 0||!mr(r))throw pr(n,`${n} expects an operator as argument ${t+1}`);return r},wr=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),Q=(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}),Tr=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Er=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),Dr=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(Z(n,0,e),Z(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Or=e=>e>2147483647||e<-2147483648,kr=e=>new x(`Overflow when computing ${e}`),Ar={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`},jr={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Mr={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`},Nr=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return jr[e.operator];if(e.kind!==`Function`)return Ar[e.kind];let t=e.domain;return t.every((e,t)=>e===t+1)?`TupleValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},Pr=e=>Mr[Nr(e)],Fr=(e,t)=>new b(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Ir=(e,t)=>{let n=n=>(...r)=>{try{return n(...r)}catch(n){throw n instanceof b&&(e.isLazy===!0||!(n instanceof x))?Fr(t,n.message):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},Lr=(e,t)=>{if(typeof e!=`number`)throw Fr(t,`Cannot cast tlc2.value.impl.${Nr(e)} to tlc2.value.impl.IntValue`);return e},Rr=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,zr=(e,t,n,r)=>{let i=Rr(e,n,`IntValue`,2);return Dr(t,(e,n)=>{let a=Lr(e,i),o=Lr(n,i),s=r(a,o);if(Or(s))throw kr(`${a}${t}${o}`);return s})},Br=(e,t,n)=>{if(typeof e!=`number`)throw new x(`The ${t} argument of ${n} should be an integer, but instead it is:\n${Y(e)}`);return e},Vr=(e,t)=>Dr(e,(n,r)=>t(Br(n,`first`,e),Br(r,`second`,e))),Hr=(e,t,n)=>({...Er(e,t,n),isLazy:!0}),Ur=(e,t,n)=>{let r=Cr(e,t,n);return()=>r.call([])},Wr=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Gr=()=>({bool:Xo,condition:(e,t)=>{if(typeof e!=`boolean`)throw Lo(t,e);return e},conjunct:(e,t,n)=>{if(typeof e!=`boolean`)throw Ro(t,n,e);return e},apply:jn,tuple:Ut,set:Ot,record:$e,writtenRecord:L,equal:et,enumerate:ts,unassigned:(e,t)=>{throw Fc(e,t)},primeOutsideAction:e=>{throw Ic(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)=>qo(e,t,n[r]),e.scope),state:e.state,next:e.next})}),Kr={value:void 0},qr=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Jr=e=>`local${e.counter++}`,Yr=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),dr(e).forEach(e=>Yr(e,t)),t),Xr=(e,t,n)=>{let r=qr(e,ac(t,e.environment)),i=Yr(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=qr(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},Zr=(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(()=>Jr(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${$r(e,t.set,s)}, ${qr(e,t.set)});`),u=t.bounds.map(t=>{let n=Jr(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${$r(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=Jr(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})`},Qr=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${$r(e,r[0],n)}, "the left side of =>") ? bool(${$r(e,r[1],n)}, "the right side of =>") : true)`;if(X(t))return Xr(e,t,n);let i=hs(t.operator,e.environment);if(i?.kind!==`Builtin`)return Xr(e,t,n);if(i.name===`DOMAIN`)return`${qr(e,Ho(t))}(${$r(e,r[0],n)})`;if(i.name===`TLCEval`)return Xr(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${qr(e,Uo(t,i))}(${$r(e,r[0],n)}, ${$r(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&pc(r[0],a))return`${qr(e,i.evaluateUnary)}(${$r(e,r[0],n)})`;let o=r.length===2&&pc(r[0],a)&&pc(r[1],a);return i.evaluateBinary&&o?`${qr(e,i.evaluateBinary)}(${$r(e,r[0],n)}, ${$r(e,r[1],n)})`:Xr(e,t,n)},$r=(e,t,n)=>{let r=(t,r=n)=>$r(e,t,r);if(Xs(t)&&Gs(t,e.environment))return Xr(e,t,n);switch(t.kind){case`Number`:return Ns(t.value)?String(t.value):Xr(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(X(t))return Xr(e,t,n);let i=Ts(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=qr(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?qr(e,i.value):Xr(e,t,n)}case`Apply`:return Qr(e,t,n);case`And`:{let n=qr(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)}, ${qr(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{kc(t.function);let n=r(t.function),i=qr(e,Bo(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)}, ${qr(e,zo(t))}, ${qr(e,Vo(t))})`;case`Record`:{let i=Nc(t.fields);if(Pc(i))return Xr(e,t,n);let a=qr(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}, ${qr(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=qr(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`)?Zr(e,t,n):Xr(e,t,n);default:return Xr(e,t,n)}},ei=(e,t)=>{if(!Wr.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=$r(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(`
32
+ `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; return ${r}; };`;Kr.value??=Gr();let o=Kr.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},ti={kind:`Local`},ni=/* @__PURE__ */ new WeakMap,ri=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ii=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),ai=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,oi=e=>e.kind===`Operator`?e.params.length:0,si=e=>e.name.includes(`!`),ci=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},li=(e,t,n)=>{let r=t.bindings.get(e);return r&&ai(r.position,t.location)&&(!n||ai(r.position,n.start))?r:void 0},ui=(e,t)=>e!==void 0&&t!==void 0&&_(e)===_(t),di=(e,t,n,r)=>{if(t===void 0)return!0;if(ui(t.range,n.range))return!1;let i=n.range;if(i===void 0||r.isGenerated||t.kind!==`Builtin`&&!t.range)return!0;let a=_(i),o=t.range&&_(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${e} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${e}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${e}. \nThis duplicates the one at ${o}.`}),!1},fi=(e,t,n,r)=>di(t,ci(e,t)??li(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,pi=(e,t,n)=>{di(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},mi=(e,t,n,r)=>t.reduce((e,t,i)=>fi(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),hi=(e,t,n)=>t.reduce((e,t)=>fi(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),gi=e=>e.kind===`Name`?[e.name]:e.names,_i=e=>e.flatMap(e=>gi(e.pattern)),vi=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||ai(n.location,t.location))?n:void 0},yi=(e,t)=>{let n=vi(e,t);return n?{key:t.getKey(n),arity:oi(n),kind:`Definition`}:t.imported.get(e)},bi=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),xi=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return ai(e.location,e.args[0].location)?`prefix`:`postfix`}},Si=e=>e[0].toLowerCase()===e[0].toUpperCase()&&e[0]!==`_`&&(e[0]<`0`||e[0]>`9`),Ci=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),wi=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Ti=e=>e.kind===`Subexpression`?e.selectors:(e.kind===`Identifier`?e.name:e.operator).split(`!`).map(e=>({kind:`Name`,name:e,args:[]})),Ei=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Di=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),Oi=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?Oi(e.body,t):dr(e).reduce((e,n)=>e??Oi(n,t),void 0)},ki=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??ki(i,t,n||Di(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&Oi(e.set,t):Oi(e,t)},Ai=e=>typeof e==`number`?`argument selector ${e}`:e,ji=`within the scope of a declaration
33
+ from outside that declaration's scope.`,Mi=(e,t,n,r,i)=>{let a=(t,n)=>{let i=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;i&&r.errors.push({location:_(i),message:n})},o=n.isSuffices===n.isInProof,s=n.statement,c=t[1];if(c.kind===`Name`){let e=(s.kind===`AssumeProve`?[...s.assumptions,s.conclusion]:[s]).map((e,t)=>({index:t,label:ki(e,c.name,!1)})).find(e=>e.label!==void 0);if(!e)return a(1,`Cannot find label \`${c.name}'.`);if(s.kind===`AssumeProve`&&Di(s,e.index)&&o)return a(1,`Accessing subexpression labeled \`${c.name}' of ASSUME/PROVE clause ${ji}`);t.slice(2).reduce((e,t,n)=>{if(!e||t.kind!==`Name`)return;let r=Oi(e.body,t.name);return r||a(n+2,`Cannot find label \`${t.name}'.`),r},e.label);return}let l={node:s,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let r=e+1,i=l.node;if(n.kind!==`Operand`)return;if(l.isSufficesOpen){if(wi(n.operand,1)!==0)return a(r,i.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${Ai(n.operand)}'.`);l.isSufficesOpen=!1;continue}if(i.kind!==`AssumeProve`)return;let s=[...i.assumptions,i.conclusion],c=wi(n.operand,s.length);if(c===-1)return a(r,`Nonexistent operand specified by \`${Ai(n.operand)}'.`);if(Di(i,c)&&(!l.isGoal||o))return a(r,`Accessing ASSUME/PROVE clause ${ji}`);let u=s[c];if(u.kind===`NewSymbol`&&r!==t.length-1)return a(r,`Selected a subexpression of a NEW clause of an ASSUME.`);l.node=u,l.isGoal=!1}i||(l.node.kind===`AssumeProve`&&a(void 0,`Selected ASSUME/PROVE instead of expression.`),l.node.kind===`NewSymbol`&&a(void 0,`Selected a NEW declaration as an expression or operator.`))},Ni=(e,t)=>{let n=t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:_(e.location.range),message:n}),!0)},Pi=(e,t,n,r)=>{if(!Ei(e))return!1;let i=Ti(e),a=i[0],o=i.length>1&&a.kind===`Name`?ci(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&Mi(e,i,o,n,r),o!==void 0},Fi=(e,t,n,r)=>{let i=e.location,a=ni.get(e);if(a!==void 0)return a;if(ri(t)||Pi(e,n,r,!1)||Ci(t))return e.kind===`Apply`?e.args.length:0;let o=ci(n,t);if(o&&e.kind!==`OperatorReference`&&(e.resolution=ti),o)return o.arity;let s=yi(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,ni.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(ci(n,c)!==void 0||yi(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=_(bi(i,t===`-.`?`-`:t));if(!Si(t)){r.errors.push({location:l,message:`Unknown operator: \`${t}'.`});return}r.errors.push({location:l,message:`Could not find declaration or definition of symbol '${t}'.`});let u=xi(e);u&&i.range&&r.errors.push({location:_(i.range),message:`Couldn't resolve ${u} operator symbol \`${t}'.`})},Ii=(e,t,n)=>(e.forEach(e=>Gi(e.set,t,n)),e.reduce((e,t)=>mi(e,gi(t.pattern),t.pattern.ranges,n),t)),Li=(e,t)=>e.kind===`Identifier`&&e.name===t&&X(e)||dr(e).some(e=>Li(e,t)),Ri=(e,t)=>{e.kind===`FunctionConstruction`&&Li(e.body,t)&&(e.isRecursive=!0),dr(e).forEach(e=>Ri(e,t))},zi=(e,t,n,r)=>{let i=n.hasLabelScope?n:{...n,hasLabelScope:!0},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:_(o),message:e})},c=e.kind===`Function`?Ii(e.bounds,t,i):hi(t,e.params,i),l=ci(c,a)??li(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${a} defined at wrong LET/IN level.`):l&&!u&&s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${a} already defined or declared.`),e.kind===`Function`?(Gi(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),Ri(e.body,a)):Gi(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:di(a,ci(t,a)??li(a,i,o),{kind:`Definition`,arity:oi(e),range:o},i)},Bi=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(ci(e,t.name)?.isPending)return e;let n={name:t.name,arity:oi(t),kind:`Definition`,parent:e,isPending:!0};return r.add(n),n},t);return e.reduce((e,t)=>{let i={name:t.name,arity:oi(t),kind:`Definition`,range:t.location.range,parent:e};if(si(t))return i;let a=n.isGenerated||t.isLocal||ri(t.name);return zi(t,e,a?{...n,isGenerated:a}:n,r)?i:e},i)},Vi=(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 p(`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 p(`Argument number ${t+1} to operator '${e.name}' should be a ${a.arity}-parameter operator at line ${o.line}, column ${o.column}`)},Hi=e=>e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:void 0,Ui=(e,t,n)=>{let r=e.operator,i=ci(t,r)?void 0:vi(r,n),a=Fi(e,r,t,n);a!==void 0&&(a===e.args.length?e.args.forEach((e,r)=>{if(e.kind===`Identifier`&&i?.kind===`Operator`&&i.params[r].arity===0){Gi(e,t,n);return}let a=Hi(e),o=a===void 0||ci(t,a)?void 0:vi(a,n),s=Wi(e,t,n);i&&s!==void 0&&Vi(i,r,e,s,o)}):n.errors.push({location:_(e.argumentsRange??bi(e.location,r)),message:`The operator ${r} requires ${a} arguments.`}))},Wi=(e,t,n)=>e.kind===`Identifier`?Fi(e,e.name,t,n):e.kind===`OperatorReference`?Fi(e,e.operator,t,n):(Gi(e,t,n),e.kind===`Lambda`?e.params.length:0),Gi=(e,t,n)=>{let r=e=>e.forEach(e=>Gi(e,t,n));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{let r=e.name,i=Fi(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:_(bi(e.location,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:Fi(e,e.operator,t,n);return;case`Apply`:Ui(e,t,n);return;case`Lambda`:Gi(e.body,mi(t,e.params,e.paramRanges,n),n);return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:Gi(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&&Gi(e.other,t,n);return;case`Let`:Gi(e.body,Bi(e.definitions,t,n),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:Gi(e.body,Ii(e.bounds,t,n),n);return;case`UnboundedQuantifier`:Gi(e.body,mi(t,e.names,e.nameRanges,n),n);return;case`Choose`:e.set&&Gi(e.set,t,n),Gi(e.body,mi(t,gi(e.pattern),e.pattern.ranges,n),n);return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:Gi(e.predicate,Ii([e.bound],t,n),n);return;case`SetMap`:Gi(e.expression,Ii(e.bounds,t,n),n);return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:_(r.location.range??bi(r.location,r.name)),message:`Non-unique fields in constructor.`}),Gi(r.value,t,n)});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`:Gi(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`:Ni(e,n)||Gi(e.body,t,n);return;case`Subexpression`:e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Wi(e,t,n)),Pi(e,t,n,!1)}},Ki=(e,t,n)=>{let r=(e,n,i)=>{e.kind===`Label`&&Ni(e,i)||(Pi(e,t,i,n),dr(e).forEach(t=>r(t,!1,e.kind===`Let`&&t!==e.body?{...i,hasLabelScope:!0}:i)))};e.forEach(e=>{e.kind!==`ModuleFact`&&r(e,!0,{...n,hasLabelScope:!1})})},qi=(e,t,n)=>(e.set&&Gi(e.set,t,n),fi(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Ji=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:qi(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Ji(t,e.scope,e.unit,!0):Gi(t,e.scope,e.unit),e),{scope:t,unit:n});return Gi(e.conclusion,i.scope,i.unit),i.scope},Yi=(e,t,n)=>e.kind===`AssumeProve`?Ji(e,t,n):(Gi(e,t,n),t),Xi=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Ki(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Zi(t,e,r),t)},Zi=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0};switch(r.kind){case`Assert`:{let a=Yi(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Xi(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Xi(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return Ki(r.facts,t,n),t;case`Define`:return Bi(r.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),t,n);case`Have`:case`Case`:return Gi(r.expression,t,i),Xi(e.proof,t,n),t;case`Witness`:return r.expressions.forEach(e=>Gi(e,t,i)),t;case`Take`:return mi(Ii(r.bounds,t,i),r.names,r.nameRanges,i);case`Pick`:{let a=mi(Ii(r.bounds,t,i),r.names,r.nameRanges,i);return Gi(r.body,a,i),Xi(e.proof,t,n),a}default:return Xi(e.proof,t,n),t}},Qi=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Yi(e.statement,void 0,t);e.name!==void 0&&pi(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Xi(e.proof,n,t),r&&(r.isInProof=!1)},$i={line:0,column:0},ea=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),ta=(e,t)=>{let n=new Map([...ii,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},na=(e,t,n,r)=>{let i=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),void 0),a=ta(n,r.imported),o={imported:a,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...a].map(([e,t])=>[e,{...t,position:$i}])),errors:[],warnings:r.warnings,hasLabelScope:!0,isLabelForbidden:!1,isGenerated:!1},s=new Map(e.substitutions.map(e=>[e.name,e.expression])),c=`in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`;s.forEach((e,n)=>{if(t.every(e=>e.name!==n))throw new p(`Identifier '${n}' is not a legal target of a substitution ${c}`)});let l=[...s.keys(),...t.map(e=>e.name)],u=new Map(t.toSorted((e,t)=>l.indexOf(e.name)-l.indexOf(t.name)).map(t=>{let n=t.name;if(!s.has(n)&&!ci(i,n)&&!yi(n,o))throw new p(`Substitution missing for symbol ${n} ${c}`);let r=s.get(n)??{kind:`Identifier`,name:n,location:e.location};if(t.arity===0||r.kind!==`Identifier`)return Gi(r,i,o),[n,r];let a=Fi(r,r.name,i,o);if(a!==void 0&&a!==t.arity)throw new p(`An operator must be substituted for symbol '${n}', and it must have arity ${t.arity} ${c}`);return[n,r]}));if(o.errors.length>0)throw m(o.errors,!1,void 0,r.warnings);return u},ra=(e,t)=>{let n=[],r=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};if(e.toSorted((e,t)=>ai(e.location,t.location)?-1:1).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof p)||!e.sany&&i.length===0)throw e;i.push(...e.sany?.errors??[])}i.forEach(e=>r(n,e)),a.forEach(e=>r(t,e))}),n.length>0)throw m(n,!1,void 0,t)},ia=(e,t)=>{let n=ta(e,t.imported),r=new Set([...e.theorems,...e.assumptions].flatMap(e=>e.name??[])),i=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),a=new Map([...ii,...t.bound].map(([e,t])=>[e,{...t,position:$i}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c,l)=>({imported:n,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isGenerated:!1}),l=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>pi(e.name,{kind:t,arity:e.arity,range:e.location.range},c(e.location,void 0,n,r,!1))}));ra([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=di(e.name,a.get(e.name),r,c(e.location,void 0,t,n,!1));i&&(a.set(e.name,r),o.add(r)),s.push({declaration:e,binding:i?r:void 0})}})),...e.definitions.map(t=>({location:t.location,check:(n,r)=>{let i=c(t.location,t,n,r,!0);ea(e,t)?Gi(t.body,void 0,i):zi(t,void 0,i,o)&&a.set(t.name,{kind:`Definition`,arity:oi(t),range:t.location.range,position:t.location})}})),...e.instances.map(e=>({location:e.location,check:(n,r)=>{let i=c(e.location,void 0,n,r,!1);hi(void 0,e.params,i),t.instanced.get(e)?.forEach((e,t)=>pi(t,e,i)),e.name!==void 0&&pi(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...e.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=c(e.location,void 0,t,n,!0);Gi(e.expression,void 0,r),e.name!==void 0&&pi(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>Qi(e,c(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>Ki(e.facts,void 0,c(e.location,void 0,t,n,!1))})),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:_(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},aa=/* @__PURE__ */ new WeakSet,oa=/* @__PURE__ */ new WeakSet,sa=(e,t,n=/* @__PURE__ */ new Set)=>{let r=pa(e,(e,r)=>sa(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&X(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&X(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},ca=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),la=/* @__PURE__ */ new WeakMap,ua=e=>la.get(e)??e.name,da=(e,t)=>(ua(t)!==e.name&&la.set(e,ua(t)),e),fa=(e,t)=>da(e.kind===`Function`?{...e,bounds:ca(e.bounds,e=>t(e,[])),body:t(e.body,_i(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),pa=(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=>fa(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:ca(e.bounds,n),body:t(e.body,_i(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,gi(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,gi(e.bound.pattern))};case`SetMap`:return{...e,bounds:ca(e.bounds,n),expression:t(e.expression,_i(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`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)}}},ma=`LAMBDA`,ha=(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 pa(e,(e,n)=>(r.push(...ha(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},ga=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}},_a=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),va=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},ya=(e,t)=>e.map(e=>({pattern:va(e.pattern,t),set:e.set})),ba=(e,t)=>e.kind===`Function`?{...e,bounds:ya(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},xa=(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=>da({...ba(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:ya(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:va(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:va(e.bound.pattern,n),set:e.bound.set}};default:return e}},Sa=e=>`${e}@ENABLED`,Ca=(e,t)=>e.modes.get(t)??e,wa=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!X(e)&&t.instantiation.variables.has(e.name),Ta=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Ta(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(wa(e,t,n))return[e.name];let r=X(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Ta(r.body,t,/* @__PURE__ */ new Map):void 0},Ea=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return wa(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Sa(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:ja(e.expression,Ca(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[ja(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:ja(e.subscript,Ca(t,`Primed`),n),location:r},ja(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Ta(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:Sa(r),location:e.location},location:e.location},ja({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Da=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),Oa=(e,t)=>e.map(e=>Da(e.name,t)),ka=(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:[...Oa(t,r),...i.map(e=>Da(e,r))],location:r},location:r}},Aa=(e,t)=>e.instantiation.isParameterized(t)?Na(e,t):void 0,ja=(e,t,n)=>{let r=e=>ja(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!X(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:ja(e.expression,Ca(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:ja(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Ca(t,`Enabled`),n)};let s=Ea(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return aa.add(n),n;let r=Aa(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&&oi(o)>0?ka(r,a,oi(o),e.location):{kind:`Apply`,operator:r,args:Oa(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||oa.has(e),c=e=>(s&&oa.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:ma,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:ma,args:n,resolution:{kind:`Local`}},location:e.location};if(o)throw new p(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let l=Aa(t,e.operator);return l===void 0?c({...e,args:n}):{...e,operator:l,args:[...Oa(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=Aa(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?ka(n,a,oi(r),e.location):{...e,operator:n}}let c=ga(t),l=pa(e,(e,i)=>i.length===0?r(e):ja(e,t,_a(n,i,c)));return xa(l,n,c)},Ma=(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:Da(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Na=(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=ga(e),o=ba(fa(i,(t,n)=>ja(t,e,_a(/* @__PURE__ */ new Map,n,a))),a);return Ma(o,r.params,i.location)}):t},Pa=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>ha(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=>Aa(i,e)??e,getQualifiedKey:t=>{let n=Aa(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Ma(r,e.params,r.location)):t}}},Fa=e=>e.kind===`Let`&&e.instances!==void 0||dr(e).some(Fa),Ia=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=pa(e,e=>Ia(e,t,r));return i.kind!==`Let`||!i.instances?i:{kind:`Let`,definitions:i.instances.reduce((e,n)=>{let i=e.findIndex(e=>ai(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}},La=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Ra=(e,t)=>e.definitions.some(e=>Fa(e.body))||e.assumptions.some(e=>Fa(e.expression))||e.theorems.some(e=>{let t=La(e);return t!==void 0&&Fa(t)})?{...e,definitions:e.definitions.map(e=>fa(e,e=>Ia(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Ia(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=La(e);return n===void 0?e:{...e,statement:Ia(n,t,[])}})}:e,za=/* @__PURE__ */ new WeakMap,Ba=/* @__PURE__ */ new WeakMap,Va=(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},Ha=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Ua=(e,t,n)=>{if(typeof t==`boolean`)return t;throw new b(`In computing ${n?`initial`:`next`} states, TLC expected a boolean expression,\nbut instead found ${Y(t)}.\n${Io(e)}`)},Wa=(t,r,i=cc(t,r))=>{if(r.next!==void 0&&t.kind===`Number`)throw n(new b(`The next state relation is not a boolean expression.\n${t.text??t.value}`),e.error);return Ua(t,i,r.next===void 0)},Ga=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Ka=/* @__PURE__ */ new WeakMap,qa=(e,t)=>{if(!e.trace)return t?za:Ba;let n=Ka.get(e)??[/* @__PURE__ */ new WeakMap,/* @__PURE__ */ new WeakMap];return Ka.set(e,n),n[+!t]},Ja=(e,t,n)=>{let r=qa(t,n),i=r.get(e);if(i)return i;let a=To(e,t,n),o=t.trace,s=o?(t,n,r,i,s,c)=>{let l=o.length;o.push(e),a(t,n,r,i,s,c),o.length=l}:a;return r.set(e,s),s},Ya=(e,t)=>{if(t.constants.has(e))return;let n=Zo(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},Xa=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return Xa(e.expression,t,!1,r);if(e.kind!==`Identifier`||X(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Ya(e.name,t);if(a&&!r.has(a))return r.add(a),Xa(a.body,t,n,r)},Za=(e,t,n)=>Xa(e,t,!n),Qa=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return Qa(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=js(e.definitions,Va(r,t,n));return Qa(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Ko(t,e.name);if(a?.kind===`Thunk`)return Qa(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=Ya(e.name,r.environment);if(s)return Qa(s.body,void 0,n,r,i)},$a=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||X(e))||!t&&e.kind===`Prime`,eo=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>eo(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=Ya(e.name,t);if(i)return n.add(e.name),eo(i.body,t,n)},to=(e,t)=>{if(e.kind===`Tuple`)return[e,...e.elements.flatMap(e=>to(e,t))];let n=e.kind===`Identifier`&&!t.variableIndex.has(e.name)?Ya(e.name,t):void 0;return n?[e,...to(n.body,t)]:[e]},no=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),ro=(e,t,n)=>no.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Ga(e.operator)&&($a(e.args[0],n)||Za(e.args[0],t,n)!==void 0)||X(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,io=/* @__PURE__ */ new Set,ao=(e,t)=>{if(X(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return pa(e,(e,i)=>{let a=r.isReadOnly?ao(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},oo=(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||X(e)?void 0:Zo(r,t);return i&&!n.has(i)&&(n.add(i),oo(i.body,t,n))?!0:dr(e).some(e=>oo(e,t,n))},so=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Za(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=eo(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return ro(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Ja(e,t,n)}},co=(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(Vc(e,t)===void 0||oo(e,t,/* @__PURE__ */ new Set))return!0;let n=ao(e,io);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)}},lo=(e,t,n)=>{let r=e.map(e=>so(e,t,n)),i=r.map(()=>void 0),a=t.trace,o=(e,n,s,c,l,u)=>{let d=c,f;for(let c=e;c<r.length;c++){if(c>0&&n.isInit&&ko(d)){f??=Va(n,s,d);for(let e=c;e<r.length;e++)if(!uo(r[e].expression,f))return;u(d,l);return}let e=r[c];if(a&&(a.push(e.expression),e.expression.kind===`Unchanged`&&a.push(...to(e.expression.expression,t))),e.kind===`Guard`){f??=Va(n,s,d);let r=i[c]??=sc(e.expression,t);if(!Wa(e.expression,f,r(f)))return;continue}if(e.kind===`Assign`){f??=Va(n,s,d);let r=(i[c]??=sc(e.value,t))(f),a=d[e.index];if(a===void 0)d=Ha(d,e.index,r),f=void 0;else if(!et(a,r))return;continue}if(e.kind===`Unchanged`){let t=n.current;if(!t)return;for(let n of e.indices){let e=d[n];if(e===void 0)d=Ha(d,n,t[n]),f=void 0;else if(!et(e,t[n]))return}continue}let p=c+1;e.runner(n,s,d,l,!0,(e,t)=>o(p,n,s,e,t,u));return}u(d,l)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},uo=(e,t)=>Ua(e,cc(e,t),!0),fo=e=>(t,n,r,i,a,o)=>{Wa(e,Va(t,n,r))&&o(r,i)},po=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Va(r,i,a);if(a[l]!==void 0){Wa(e,u)&&c(a,o);return}let d=cc(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Yt(f))throw new b(`In computing ${r.isInit?`initial`:`next`} states, the right side of \\IN is not enumerable.\n${Io(e)}`);let p=sn(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(Ha(a,l,p[e]),o)}},mo=/* @__PURE__ */ new WeakMap,ho=e=>{let t=mo.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(ho),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return mo.set(e,n),n},go=(e,t)=>{let n=e.args[0],r=fo(e),i=(e,r,i)=>Qa(n,r,i,e,!t)??-1,a=po(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=cc(e.args[1],Va(t,n,o));l(Ha(o,u,d),s)}},_o=(e,t,n,r)=>{if(e.kind===`FunctionConstruction`)return{bounds:e.bounds,body:e.body,scope:t};if(e.kind!==`Identifier`)return;let i=Ko(t,e.name);if(i?.kind===`Thunk`)return _o(i.expression,i.scope,n,r);let a=i?void 0:Zo(e.name,r.environment);if(a?.kind!==`Function`)return;let o=cc(e,Va(r,void 0,n));return{bounds:a.bounds,body:a.body,scope:qo(void 0,a.name,o)}},vo=(e,t,n)=>{let r=fo(e);return(i,a,o,s,c,l)=>{let u=_o(e.function,a,o,i);if(!u){r(i,a,o,s,c,l);return}let d=Va(i,a,o),f=e.args.map(e=>cc(e,d)),p=f.length===1?f[0]:Ut(f),m=rs(u.bounds,Va(i,u.scope,o));if(!yn(p,m))throw new b(`Attempted to apply a function to ${Y(p)}, which is not in its domain at ${Fo(e)}`);Ja(u.body,t,n)(i,is(u.bounds,u.scope,p),o,s,c,l)}},yo=(e,t)=>{if(eo(e,t))return lo([ho(e)],t,!1);if(e.kind===`Tuple`)return Ja(ho(e),t,!1);let n=ho(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Ko(i,e.name):void 0;l?.kind===`Thunk`?Ja(ho(l.expression),t,!1)(r,l.scope,a,o,s,c):Wa(n,Va(r,i,a))&&c(a,o)}},bo=(e,t,n)=>{let r=e.operator,i=fo(e),a=X(e)?void 0:hs(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=vc(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=Ja(a.body,t,n),o.body(e,i(Va(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Va(a,o,s),f=_s(e,d);f?.kind===`Closure`?Ja(f.body,t,n)(a,ks(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},xo=(e,t,n)=>{let r=fo(e),i=X(e)?void 0:Ya(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=Ko(s,e.name);f?.kind===`Thunk`?Ja(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=Ja(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},So=(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!==`=`||X(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`||!X(a))return;let o=Xa(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=>So(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`||X(e))return;let r=hs(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=So(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`&&X(o))return{variable:i.variable,argument:o.name,labels:i.labels}},Co=(e,t,n)=>{let r=Ko(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},wo=(e,t,n)=>{let r=e.map(e=>Ja(e,t,n)),i=n?[]:e.map(e=>So(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&&Co(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)}},To=(e,t,n)=>{let r=e=>Ja(e,t,n);switch(e.kind){case`And`:return lo(e.operands,t,n);case`Or`:return wo(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=ts(cc(a.set,Va(t,n,r)),a.set);for(let a=0;a<l.length&&!t.isStopped;a++)i(t,qo(n,e,l[a]),r,o,s,c)}}let o=n||t.trace?void 0:co(e,t);if(o){let r=lo(o.rest,t,n);return(t,n,i,a,s,c)=>{let l=Va(t,n,i),u=e.bounds.map(e=>ts(cc(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=qo(n,o.names[e],r);if(e===u.length-1){let e=Va(t,a,i);if(!o.guards.every(t=>Wa(t,e)))continue}d(e-1,a)}};d(u.length-1,n)}}return(t,n,r,a,o,s)=>{ns(e.bounds,Va(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Vc(e,t)!==void 0&&!oo(e.body,t,/* @__PURE__ */ new Set)?ao(e,io):void 0;return(t,n,r,o,s,c)=>{let l=[];ns(e.bounds,Va(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Ko(n,e)?.kind===`Value`)){u.every(n=>Wa(e.body,Va(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&ko(r)?u.slice(n).every(n=>uo(e.body,Va(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=cc(e.condition,Va(r,i,a));(Xo(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=Va(r,i,a),u=t.find(e=>Xo(cc(e.condition,l),`a CASE guard`))?.body??n;if(!u)throw new b(`In computing ${r.isInit?`initial`:`next`} states, TLC encountered a CASE with no conditions true.\n${Io(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=Vs(e.definitions,t);return(t,r,a,o,s,c)=>n(t,js(e.definitions,Va(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new b(`UNCHANGED appears in an initial predicate at ${Fo(e)}`)}:yo(e.expression,t);case`AngleAction`:{let t=r(e.action),n=ho(e.subscript);return(e,r,i,a,o,s)=>t(e,r,i,a,o,(t,i)=>{try{Wa(n,Va(e,r,t))||s(t,i)}catch(t){throw!e.isEnabled||!(t instanceof S)?t:new b(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${t.variable} occurring in the state formula v.\n`)}})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,ho(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return xo(e,t,n);case`FunctionApplication`:return vo(e,t,n);case`Apply`:{let i=e.args;if(Ga(e.operator)){let r=Za(i[0],t,n);if(r!==void 0)return e.operator===`=`?lo([e],t,n):po(e,()=>r);if($a(i[0],n))return go(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=cc(i[0],Va(t,n,r));(typeof c==`boolean`?c:Xo(c,`the left side of => at ${Fo(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return bo(e,t,n)}default:return fo(e)}},Eo=/* @__PURE__ */ new WeakMap,Do=e=>{let t=Eo.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Eo.set(e,n),n},Oo=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),ko=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Ao=(e,t)=>{let n=t.state;if(!n||!ko(n))throw new b(`ENABLED needs a complete state at ${Fo(e)}`);let r=t.environment,i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return Ja(e,r,!1)(i,t.scope,Do(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},jo=(t,r,i,a)=>{let o={environment:r,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};Ja(t,r,!0)(o,a,Do(r),void 0,!1,t=>{if(!o.isStopped){if(!ko(t))throw n(new w(t),e.error);o.isStopped=i(t)}})},Mo=(e,t,n)=>{let r=[];return jo(e,t,e=>(r.push(e),!1),n),r},No=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return Ja(e,n,!1)(a,i,Do(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!ko(e))throw new C(e,t,Oo(e,n).sort());o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},Po=(e,t,n,r)=>{let i=[];return No(e,t,n,e=>(i.push(e),!1),r),i},Fo=e=>`line ${e.location.line}, column ${e.location.column}`,Io=e=>{let t=e.location.range;return t?_(t):Fo(e)},Lo=(e,t)=>new b(`A non-boolean expression (${Pr(t)}) was used as the condition of an IF.\n${Io(e)}`),Ro=(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):Io(r);return new b(`A non-boolean expression (${Pr(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 b(`Attempted to evaluate an expression of form P /\\ Q when ${t===0?`P`:`Q`} was\n${Pr(n)}.\n${Io({...e,location:{...e.location,range:{...r,end:i}}})}`)},zo=e=>t=>On(t)?`Attempted to select nonexistent field "${e.field}" from the record\n${Y(t)}\n${Io(e)}`:Dn(t,e.field),Bo=e=>t=>`A non-function (${Pr(t)}) was applied as a function.\n${Io(e)}`,Vo=e=>t=>`Attempted to select field "${e.field}" from a non-record value ${Y(t)}\n${Io(e)}`,Ho=e=>t=>{if(!P(t))throw new b(`Attempted to apply the operator DOMAIN to a non-function\n(${Pr(t)})\n${Io(e)}`);return Nn(t)},Uo=(e,t)=>(n,r)=>{if(!Me(n)||We(n))throw new b(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Io(e)}`);return t.evaluate([n,r])},Wo=t=>n(new b(`TLC can't handle real numbers: ${t.text} at ${Fo(t)}`),e.configParseError),Go=t=>n(new b(`TLC can't handle a number this big: ${t.text??t.value} at ${Fo(t)}`),e.error),Ko=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},qo=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Jo=(e,t,n)=>{if(t.kind===`Name`)return qo(e,t.name,n);let r=hn(n);if(!r||r.length!==t.names.length)throw new b(`Cannot bind <<${t.names.join(`, `)}>> to ${Y(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>qo(e,t,r[n]),e)},Yo=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next}),Xo=(e,t)=>{if(typeof e!=`boolean`)throw new b(`Expected ${t} to be a boolean but found ${Y(e)}`);return e},Zo=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),Qo=(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=Zo(n,t);if(e&&!t.constants.has(n)&&!$o(e,t))return!0}return dr(e).some(e=>Qo(e,t))},$o=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!Qo(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>Qo(e.set,t)));return t.constantLevels.set(e,r),r},es=(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.`},ts=(e,t)=>{if(!Me(e)||We(e)){let n=Y(e),r=es(e,n);throw new b(r===void 0?`TLC encountered a non-enumerable quantifier bound\n${n}.\n${Io(t)}`:`TLC encountered the non-enumerable quantifier bound\n${n}\n${Io(t)}\n${r}`)}return typeof e==`object`&&e.kind===`Interval`?zt(e):$t(e)??q(e).elements},ns=(e,t,n)=>{let r=e.map(e=>ts(cc(e.set,t),e.set)),i=(t,a)=>t<0?n(a):r[t].some(n=>i(t-1,Jo(a,e[t].pattern,n)));return i(e.length-1,t.scope)},rs=(e,t)=>{let n=e.map(e=>cc(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},is=(e,t,n)=>{if(e.length===1)return Jo(t,e[0].pattern,n);let r=hn(n)??[];return e.reduce((e,t,n)=>Jo(e,t.pattern,r[n]),t)},as=/* @__PURE__ */ new WeakMap,os=(e,t)=>{let n=as.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:_(r)};return as.set(t,i),i},ss=(e,t,n)=>{let r=os(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}},cs=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Un(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(nt(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},ls=(e,t)=>{let n=rs(e.bounds,t),r=cs(n,(n,r)=>cc(e.body,Yo(t,is(e.bounds,qo(void 0,e.name,r),n))),ss(e.bounds,e.body,n));return e.bounds.length===1?Cn(r):r},us=(e,t)=>e.kind===`Function`?ls(e,t):cc(e.body,t),ds=(e,t)=>{let n=$o(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 b(`Operator ${e.name} requires ${e.params.length} arguments`);let i=Yo(t,void 0);if(!n)return us(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>us(e,i));return t.environment.definitionValues.set(e,a),a},fs=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=cc(e.expression,Yo(t,e.scope));return n&&(e.cache=r),r},ps=/* @__PURE__ */ new WeakMap,ms=e=>{let t=ps.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return ps.set(e,n),n},hs=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return hs(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?ms(r):t.builtins.get(e)},gs=/* @__PURE__ */ new WeakMap,_s=(e,t)=>{if(X(e))return vs(e.operator,t);let n=gs.get(e),r=n===void 0?hs(e.operator,t.environment)??null:n;return n===void 0&&gs.set(e,r),r??vs(e.operator,t)},vs=(e,t)=>{let n=Ko(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return hs(e,t.environment)},ys=e=>e.kind===`Closure`?e.params.length:e.arity,bs=(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:vs(n,t);if(!r)throw new b(`Expected an operator argument at ${Fo(e)}`);return r},xs=(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)=>qo(e,n.name,t[r]),e.scope);return cc(e.body,Yo(n,r))},Ss=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:ys(e),call:n=>xs(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},Cs=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=vs(e.name,t);return n!==void 0&&ys(n)>0},ws=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),Ts=(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 Ts(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([])}},Es=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Ns(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=X(e)?void 0:Ts(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=Ko(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:ws(e,t)}}return t=>ws(e,t)},Ds=/* @__PURE__ */ new WeakMap,Os=(e,t)=>{let n=Ds.get(e);if(n)return n;let r=Es(e,t);return Ds.set(e,r),r},ks=(e,t,n)=>{if(t.length!==e.params.length)throw new b(`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:bs(t[i],n)}:Os(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},As=(e,t,n)=>e.kind===`Closure`?cc(e.body,Yo(n,ks(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>cc(e,n))):e.isLazy?e.evaluate(mc(t,n),n):e.evaluate(t.map(e=>Cs(e,n)?Ss(bs(e,n),n):cc(e,n)),n),js=(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),Ms=(e,t,n)=>{let r=Ko(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return fs(r,n);if(r?.kind===`Operator`){if(ys(r.operator)===0)return xs(r.operator,[],n);throw new b(`Operator ${e} is used without arguments`)}let i=Ts(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Fc(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return ds(i.definition,n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new b(`Unknown identifier ${e} at ${Fo(t)}`)},Ns=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,Ps=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Fs=(e,t)=>Ps.has(e)||t.builtins.get(e)?.isStateLevel===!0,Is={builtins:Ps,definitions:/* @__PURE__ */ new WeakMap},Ls={builtins:new Set([...Ps].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},Rs=(e,t)=>e.kind===`Operator`&&e.params.length===0&&$o(e,t),zs=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!X(e)){let e=Zo(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!Rs(e,t)&&Bs(e,t,n))return!0}return dr(e).some(e=>zs(e,t,n))},Bs=(e,t,n=Is)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=zs(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>zs(e.set,t,n));return n.definitions.set(e,i),i},Vs=(e,t)=>new Set(e.filter(e=>Bs(e,t))),Hs=e=>[...e.definitions.values()].some(t=>Bs(t,e)),Us=e=>[...e.definitions.values()].some(t=>Bs(t,e,Ls)),Ws=/* @__PURE__ */ new WeakMap,Gs=(e,t)=>{let n=Ws.get(e);if(n!==void 0)return n;let r=Ys(e,t,qs);return Ws.set(e,r),r},Ks=/* @__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`]),qs=/* @__PURE__ */ new Set,Js=(e,t,n)=>n.size===0?Gs(e,t):Ys(e,t,n),Ys=(e,t,n)=>{if(!Ks.has(e.kind))return!1;if(e.kind===`Identifier`&&X(e))return n.has(e.name);if(X(e))return!1;if(e.kind===`Identifier`){let n=Ts(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&Rs(n.definition,t)}if(e.kind===`Apply`){if(Fs(e.operator,t)||e.operator===`~>`)return!1;let r=hs(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=Zo(e.operator,t);if(!n||!$o(n,t)||Bs(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`&&Js(e,t,n))}let r={value:!0};return pa(e,(e,i)=>(r.value&&=Js(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},Xs=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,Zs=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}},Qs=(e,t)=>{if(e.kind===`Identifier`&&X(e))return!t.has(e.name);if(X(e))return!0;let n={value:!1};return pa(e,(e,r)=>(n.value||=Qs(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},$s=(e,t)=>aa.has(e)&&Xs(e)&&Vc(e,t)!==void 0&&!Qs(e,qs),ec=/* @__PURE__ */ new WeakMap,tc=/* @__PURE__ */ new Set([`SetEnumeration`,`SetMap`,`SetFilter`,`Tuple`,`Record`,`RecordSet`,`FunctionSet`,`Product`]),nc=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),rc=(e,t)=>tc.has(e.kind)||e.kind===`Apply`&&nc.has(e.operator)&&!X(e)&&hs(e.operator,t)?.kind===`Builtin`,ic=(e,t,n,r)=>{try{return e(t)}catch(e){throw n.length===r+1&&n.push(...Ae(e)??[]),e}},ac=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Rc(e,t),i=Xs(e)&&Gs(e,t)?Zs(r):$s(e,t)?dc(r):r,a=t.trace,o=a!==void 0&&rc(e,t),s=a?n=>{let r=a.length;a.push(e);let s=ic(i,n,a,r);a.length=r,o&&typeof s==`object`&&s.kind!==`FilteredSet`&&ke.current?.set(s,e);let c=typeof s==`object`&&s.kind===`FilteredSet`?ec.get(s):void 0;return c?c(t):s}:i;return t.evaluators.set(e,s),s},oc=/* @__PURE__ */ new WeakMap,sc=(e,t)=>{if(t.trace)return ac(e,t);let n=oc.get(e);if(n)return n;let r=(Xs(e)&&Gs(e,t)?void 0:ei(e,t))??ac(e,t);return oc.set(e,r),r},cc=(e,t)=>sc(e,t.environment)(t),lc=(e,t)=>{let n=e.name,r=X(e)?void 0:Ts(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Fc(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&&$o(e,t))return t=>ds(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=sc(e.body,t),n.body(Yo(r,void 0)));return uc(e,t)?dc(r):r}return t=>ds(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>ds(e,t);return $o(e,t)||!uc(e,t)?n:dc(n)}return t=>Ms(n,e,t)},uc=(e,t)=>Vc(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>Vc(e.set,t)!==void 0)),dc=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}},fc=(e,t)=>{let n=hs(e,t);return n!==void 0&&ys(n)>0},pc=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!X(e)&&fc(e.name,t)),mc=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>cc(e,t),expression:e})),hc=/* @__PURE__ */ new Set([`=`,`#`,`\\in`,`\\notin`,`\\cup`,`\\cap`,`\\`]),gc=(e,t,n)=>e===`\\in`||e===`\\notin`||(e===`\\cup`||e===`\\cap`)&&!Ne(t)?n:t,_c=(e,t,n)=>{if(n.trace&&hc.has(e.name)&&t.length===2){let r=ac(t[0],n),i=ac(t[1],n);return t=>{let n=r(t),a=i(t);return je(gc(e.name,n,a),()=>e.evaluate([n,a],t))}}if(e.isLazy)return n=>e.evaluate(mc(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&pc(t[0],n)){let e=ac(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&pc(t[0],n)&&pc(t[1],n);if(i&&a){let e=ac(t[0],n),r=ac(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>Cs(e,n)?Ss(bs(e,n),n):cc(e,n)),n)},vc=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw new b(`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:Os(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:bs(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},yc=/* @__PURE__ */ new WeakMap,bc=e=>{let t=yc.get(e);if(t)return t;let n={calls:/* @__PURE__ */ new Map,size:0};return yc.set(e,n),n},xc=(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},Sc=(e,t)=>e.every((e,n)=>nt(e,t[n])),Cc=(e,t)=>{let n=Zo(e.operator,t);return n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&$o(n,t)&&!Bs(n,t)},wc=(e,t,n,r)=>{let i=vc(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=sc(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=bc(e);return e=>{let n=i(e),r=xc(n,t.length);if(!r)return o(n,e);let a=r.length;for(let e of r)a=Ln(a,Un(e));let c=s.calls.get(a),l=c?.find(e=>Sc(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}},Tc=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=ac(n[0],t),r=ac(n[1],t);return t=>!Xo(e(t),`the left side of =>`)||Xo(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new b(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=X(e)?void 0:hs(e.operator,t);if(r?.kind===`Closure`)return wc(r,n,t,Cc(e,t));if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=ac(n[0],t),i=Ho(e);return t.trace?e=>{let t=i(r(e));return typeof t==`object`&&t.kind===`Interval`?{...t}:t}:e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=ac(n[0],t);return oa.has(e)||Qo(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=ac(n[0],t),a=ac(n[1],t),o=Uo(e,r);return t.trace?e=>{let t=i(e),n=a(e);return je(t,()=>o(t,n))}:e=>o(i(e),a(e))}return r?.kind===`Builtin`?_c(r,n,t):r=>{let i=vs(e.operator,r);if(i)return As(i,n,r);throw t.definitions.get(e.operator)?.kind===`Function`?new b(`${e.operator} is a function; apply it with brackets`):e.operator===`\\cdot`?new b(`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 b(`Unknown operator ${e.operator} at ${Fo(e)}`)}},Ec=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=ac(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=ac(a.set,t);return t=>{let s=ts(o(t),a.set);for(let a=0;a<s.length;a++){let o=Xo(i(Yo(t,qo(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=>ac(e.set,t));return t=>{let s=a.map((e,n)=>ts(e(t),o[n].set)),c=(a,o)=>{if(a<0)return Xo(i(Yo(t,o)),r)!==n;let l=s[a];for(let t=0;t<l.length;t++)if(c(a-1,qo(o,e[a],l[t])))return!0;return!1};return c(o.length-1,t.scope)?!n:n}}return e=>ns(o,e,t=>Xo(i(Yo(e,t)),r)!==n)?!n:n},Dc=(e,t)=>{if(e.kind===`Tuple`)return Ut(e.names.map(e=>{let n=Ko(t,e);return n?.kind===`Value`&&n.value}));let n=Ko(t,e.name);return n?.kind===`Value`?n.value:void 0},Oc=/* @__PURE__ */ new WeakSet,kc=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&Oc.add(e)},Ac=(e,t)=>{let n=Oc.has(e),r=ac(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=ac(a.set,t);return t=>{let c=o?s(t):rs(i,t),l=typeof c==`object`&&c.kind===`ProductSet`&&i.length>1?c.factors:[c];if(e.isRecursive||n||!l.every(Ne)){let n=cs(c,e=>r(Yo(t,is(i,t.scope,e))),ss(i,e.body,c));return i.length===1?Cn(n):n}if(o&&a.pattern.kind===`Name`){let e=a.pattern.name,n=Vt(c);return Cn($e(n,n.map(n=>r(Yo(t,qo(t.scope,e,n))))))}let u=[];return ns(i,t,e=>{let n=i.length===1?Dc(a.pattern,e)??!1:Ut(i.map(t=>Dc(t.pattern,e)??!1));return u.push([n,r(Yo(t,e))]),!1}),Nt(u)}},jc=(e,t)=>{let n=Oc.has(e);n&&kc(e.function);let r=ac(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=>ac(e,t))}),value:ac(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Ut(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Yo(i,qo(i.scope,`@`,e))):Pn(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}},Mc=(e,t)=>{if(e.kind===`SetFilter`){let n=ac(e.predicate,t),r=ac(e.bound.set,t),i=e.bound.pattern;return t=>{let a=r(t),o=e=>n=>Xo(e(Yo(t,Jo(t.scope,i,n))),`a set filter predicate`),s=o(n);if(!Ne(a)){if(Me(a)){let t={kind:`FilteredSet`,base:a,test:s};return ec.set(t,n=>({...t,test:o(ac(e.predicate,n))})),t}throw new b(`TLC encountered a non-enumerable quantifier bound ${Y(a)} at ${Fo(e.bound.set)}`)}return Qe(q(a).elements.filter(s))}}if(e.kind===`SetMap`){let n=ac(e.expression,t);return t=>{let r=[];return ns(e.bounds,t,e=>(r.push(n(Yo(t,e))),!1)),Ot(r)}}let n=e.set;if(!n)return()=>{throw new b(`TLC cannot evaluate an unbounded CHOOSE at ${Fo(e)}`)};let r=ac(e.body,t),i={pattern:e.pattern,set:n};return t=>{let n={value:void 0};if(ns([i],t,i=>Xo(r(Yo(t,i)),`the body of CHOOSE`)?(n.value=Dc(e.pattern,i),!0):!1),n.value===void 0)throw new b(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${Io(e)}`);return n.value}},Nc=e=>[...e].sort((e,t)=>Ye(e.name,t.name)),Pc=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),Fc=(t,n)=>a(new S(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${Io(n)}`,t),e.configParseError),Ic=e=>new b(`A primed expression appears outside an action at ${Fo(e)}`),Lc=(e,t)=>{let n=Nc(e),r=Pc(n),i=n.map(e=>ac(e.value,t));if(r)return e=>Nt(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=>L(a,i.map(t=>t(e)),o):e=>$e(a,i.map(t=>t(e)))},Rc=(e,t)=>{let n=e=>ac(e,t);switch(e.kind){case`Number`:{let t=e.value;return Ns(t)?()=>t:()=>{throw Go(e)}}case`Decimal`:return()=>{throw Wo(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return lc(e,t);case`Apply`:return Tc(e,t);case`OperatorReference`:case`Lambda`:return()=>{throw new b(`An operator cannot be used as a value at ${Fo(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 Ro(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(Xo(t[n](e),`a disjunct`))return!0;return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw Ic(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=>et(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 Lo(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(Xo(e.condition(n),`a CASE guard`))return e.body(n);if(r)return r(n);throw new b(`Attempted to evaluate a CASE with no conditions true.\n${Io(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(Yo(n,js(e.definitions,n)))}case`Forall`:case`Exists`:return Ec(e,t);case`UnboundedQuantifier`:return()=>{throw new b(`TLC cannot evaluate an unbounded quantifier at ${Fo(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Mc(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Ot(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>Ut(t.map(t=>t(e)))}case`FunctionConstruction`:return Ac(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 Lc(e.fields,t);case`RecordSet`:{let t=Nc(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 jc(e,t);case`ExceptAt`:return t=>{let n=Ko(t.scope,`@`);if(n?.kind!==`Value`)throw new b(`@ appears outside an EXCEPT at ${Fo(e)}`);return n.value};case`FunctionApplication`:{kc(e.function);let r=n(e.function),i=e.args.map(n),a=Bo(e);if(i.length===1&&t.trace){let e=i[0];return t=>{let n=r(t),i=e(t),o=()=>jn(n,i,void 0,a);return P(n)?je(n,o):o()}}if(i.length===1){let e=i[0];return t=>jn(r(t),e(t),void 0,a)}return e=>jn(r(e),Ut(i.map(t=>t(e))),void 0,a)}case`FieldAccess`:{let t=n(e.record),r=e.field,i=zo(e),a=Vo(e);return e=>jn(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?Xo(t(e),`an action`)||r(e):Xo(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>Ao(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new b(`The subexpression reference at ${Fo(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new b(`TLC cannot evaluate a temporal formula in a state at ${Fo(e)}`)}}},zc=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),Bc=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},Vc=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(zc.has(e.kind))return!1;let a=Bc(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&&Fs(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 dr(e).every(i)};return i(e)?[...n]:void 0},Hc=/* @__PURE__ */ new Map([[`Reals`,`-------------------------------- MODULE Reals -------------------------------
24
34
  (***************************************************************************)
25
35
  (* This module provides dummy definitions of the operators that are *)
26
36
  (* defined by the real Reals module. It is expected that any tool that *)
@@ -89,8 +99,17 @@ _TEPosition ==
89
99
  THEN _TETraceLength
90
100
  ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
91
101
 
92
- =============================================================================`]]),Ls=`tlc2/value/impl/`,Rs=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)}},zs=e=>[...e.slice(1,e.indexOf(`)`)).matchAll(/\[*(?:L[^;]*;|[BCDFIJSZ])/g)].length,Bs=e=>{let t=Rs(e);if(t.readUint32()!==3405691582)throw new c(`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:zs(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}},Vs=(e,t)=>e[e[t].first].text,Hs=(e,t)=>{let n=e[t],r=e[n.second];return{className:Vs(e,n.first),name:e[r.first].text}},Us=(e,t,n,r)=>{let i=()=>new m(`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=Hs(t,l());if(n.className!==`${Ls}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=Hs(t,l()),a=s();if(n.className!==`${Ls}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:Vs(t,l()),value:void 0}),e+=3;else if(n===183){let n=Hs(t,l()),a=s(),o=s();if(!(n.className===`${Ls}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()},Ws=(e,t)=>{if(!t)return e;let n=Bs(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:Us(r,n.pool,e.name,t.location)}:t});return{...e,definitions:r}},Z=(e,t,n)=>({low:e,high:t,isAssociative:n}),Gs=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)]]),Ks=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),qs=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Js=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),Ys=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),Xs=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...Ks]),Zs=e=>Gs.has(e)||Ks.has(e)||e===`-.`,Qs=(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}}},$s=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),ec=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),tc=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),nc=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),rc=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),ic=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),ac=/* @__PURE__ */ new Set([``,`*`,`-`]),oc=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),sc=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),cc=/* @__PURE__ */ new Set([`NEW`,...sc.keys()]),lc=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),uc=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),dc=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),fc=e=>RegExp(`^-{4,}\\s*MODULE\\s+${e}\\s*-{3,}$`),pc=(e,t)=>{let n=e.split(/\r?\n/),r=n.findIndex(e=>fc(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(`
93
- `)},mc=(e,t)=>{let n=oe(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`||dc.has(e.text)),ne=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)?`====`:ic.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(ne(e)),isEnd:i}}return t&&a?{reason:`Unexpected ${re(a)}`,...ne(a),isEnd:i}:{reason:e,line:r.line,column:r.column,isEnd:i}},C=(e,t=_())=>S(e,t,t),ae=e=>(e.kind===`Identifier`||e.kind===`Keyword`)&&!x(e),w=(e,t=0)=>{let n=v(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},T=()=>{let e=v();if(e.kind===`End`)throw S(`Unexpected end of expression`);return r.index++,e},E=e=>w(e)?(r.index++,!0):!1,D=e=>{if(!w(e))throw C(`Expected ${JSON.stringify(e)} but found ${y(v())}`);return T()},O=()=>{let e=v();if(e.kind!==`Identifier`)throw C(`Expected an identifier but found ${y(e)}`);if(x(e))throw C(`Unexpected keyword ${e.text}`);return r.index++,e.text},se=e=>{r.offsideColumns.push(-1);let t=e();return r.offsideColumns.pop(),t},k=(e,t=`,`)=>{let n=[e()];for(;E(t);)n.push(e());return n},ce=()=>{if(w(`<<`)){let e={value:1};for(;v(e.value).kind===`Identifier`||w(`,`,e.value);)e.value++;return w(`>>`,e.value)&&w(`\\in`,e.value+1)}let e={value:0};for(;v(e.value).kind===`Identifier`;){if(w(`\\in`,e.value+1))return!0;if(!w(`,`,e.value+1))return!1;e.value+=2}return!1},le=()=>{if(w(`::`))return!0;if(!w(`(`))return!1;let e={value:1};for(;v(e.value).kind===`Identifier`&&w(`,`,e.value+1);)e.value+=2;return v(e.value).kind===`Identifier`&&w(`)`,e.value+1)&&w(`::`,e.value+2)},ue=()=>{if(!E(`<<`))return{kind:`Name`,name:O()};let e=k(O);return D(`>>`),{kind:`Tuple`,names:e}},A=()=>k(()=>{let e=k(ue);D(`\\in`);let t=P();return e.map(e=>({pattern:e,set:t}))}).flat(),j=()=>{let e=v();if(e.kind===`Identifier`){let t=r.index,n=[T().text];for(;w(`!`)&&v(1).kind===`Identifier`;)T(),n.push(O());return g({kind:`Identifier`,name:n.join(`!`),location:d(e)},t)}if(w(`<<`)||w(`(`))return xe();throw C(`Expected a subscript but found ${y(e)}`)},de=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`&&w(`==`,Ks.has(n.text)?3:4))},M=e=>{if(!Js.has(e.text))return!0;let t=v(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||w(`,`,1)||w(`)`,1)||t.kind===`Keyword`&&ec.has(t.text)||de(e)},N=()=>{let e=v(),n=e.kind===`Operator`&&(Gs.has(e.text)||qs.has(e.text))&&M(e);if(t&&e.kind!==`String`&&(qs.has(e.text)||Xs.has(e.text)&&e.text!==`'`&&!Ks.has(e.text)||Ys.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)&&M(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`&&Xs.has(e.text)&&M(e)){r.index++;let t=d(e);if(Ks.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:Qs(e.text,n,t),location:t}}if(w(`LAMBDA`)){let t=r.index;T();let n=k(O);D(`:`);let i=P();return g({kind:`Lambda`,params:n,body:i,location:d(e)},t)}return P()},fe=()=>se(()=>{D(`(`);let e=k(N);return D(`)`),e}),pe=()=>{let e=T();r.offsideColumns.push(e.column);let t=[P()];for(;_().text===e.text&&_().column===e.column;)r.index++,t.push(P());return r.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:d(e)}},me=e=>se(()=>{let t=d(e);if(v().kind===`Identifier`&&(w(`|->`,1)||w(`:`,1))){let e=w(`|->`,1)?`Record`:`RecordSet`,n=k(()=>{let t=O();return D(e===`Record`?`|->`:`:`),{name:t,value:P()}});return D(`]`),{kind:e,fields:n,location:t}}if(ce()){let e=A();D(`|->`);let n=P();return D(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let n=P();if(E(`->`)){let e=P();return D(`]`),{kind:`FunctionSet`,domain:n,range:e,location:t}}if(E(`EXCEPT`)){let e=k(()=>{D(`!`);let e=[];for(;w(`.`)||w(`[`);)if(E(`.`)){if(!ae(v()))throw C(`Expected a field name but found ${y(v())}`);e.push({kind:`Field`,name:T().text})}else D(`[`),e.push({kind:`Index`,args:k(()=>P())}),D(`]`);return D(`=`),{path:e,value:P()}});return D(`]`),{kind:`Except`,function:n,updates:e,location:t}}return D(`]_`),{kind:`BoxAction`,action:n,subscript:j(),location:t}}),he=e=>se(()=>{let t=d(e);if(E(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ce()&&(v(1).text===`\\in`||w(`<<`))){let e=r.index,n=ue();D(`\\in`);let i=P();if(E(`:`)){let e=P();return D(`}`),{kind:`SetFilter`,bound:{pattern:n,set:i},predicate:e,location:t}}r.index=e}let n=P();if(E(`:`)){let e=A();return D(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let i=[n];for(;E(`,`);)i.push(P());return D(`}`),{kind:`SetEnumeration`,elements:i,location:t}}),ge=e=>{let t=d(e),n=se(()=>w(`>>`)||w(`>>_`)?[]:k(()=>P()));if(E(`>>_`)){if(n.length!==1)throw S(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:j(),location:t}}return D(`>>`),{kind:`Tuple`,elements:n,location:t}},_e=e=>{let t=d(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ce()){let e=A();return D(`:`),{kind:n,bounds:e,body:P(),location:t}}let i=k(O);return D(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i,body:P(),isTemporal:r,location:t}},ve=e=>{let t=[];do{if(E(`OTHER`))return D(`->`),{kind:`Case`,arms:t,other:P(),location:d(e)};let n=P();D(`->`),t.push({condition:n,body:P()})}while(E(`[]`));return{kind:`Case`,arms:t,other:void 0,location:d(e)}},ye=()=>{let e=v(1);return w(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||$s.has(e.text)||e.kind===`Operator`&&(Gs.has(e.text)||Ks.has(e.text)||qs.has(e.text)))},be=()=>{let e=T();if(e.kind===`Number`)return{kind:`Operand`,operand:te(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:fe()}}return{kind:`Name`,name:e.text,args:w(`(`)?fe():[]}},xe=()=>{let e=r.index===s.index,n=T(),a=d(n);if(t&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=k(O);return D(`:`),{kind:`Lambda`,params:e,body:P(),location:a}}if(n.kind===`Number`){if(t&&/^\\[BOH]/.test(n.text))throw S(`incomplete expression`,n);return{kind:`Number`,value:te(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&&Me()<0&&je.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=E(`(`)?k(O):[];return e.length>0&&D(`)`),D(`::`),{kind:`Label`,name:r,params:e,body:P(),location:a}}let i=w(`(`),s=i?fe():[];if(!ye())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(;ye();)T(),u.push(be());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`&&Zs(n.text)&&w(`(`))return{kind:`Apply`,operator:n.text,args:fe(),location:a};switch(n.text){case`(`:{let e=se(()=>P());return D(`)`),e}case`[`:return me(n);case`{`:return he(n);case`<<`:return ge(n);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return _e(n);case`IF`:{let e=P();D(`THEN`);let t=P();return D(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:P(),location:a}}case`CASE`:return ve(n);case`LET`:{let e=[],n=[];for(i.push(/* @__PURE__ */ new Set);!E(`IN`);){if(t&&w(`RECURSIVE`))throw S(`Unexpected keyword RECURSIVE`,b(_()));if(E(`RECURSIVE`)){I();continue}let r=Te(!1);r.kind===`Instance`?n.push(r):e.push(r)}i.pop();let r=P();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=E(`\\in`)?P():void 0;return D(`:`),{kind:`Choose`,pattern:e,set:t,body:P(),location:a}}case`WF_`:case`SF_`:{let e=j(),t=se(()=>{D(`(`);let e=P();return D(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:a}}}throw C(`Unexpected ${y(n)}`,n)},Se=()=>{let e=v(),t=d(e);if(e.kind===`Operator`&&(e.text===`/\\`||e.text===`\\/`))return pe();if(e.kind===`Operator`||e.kind===`Keyword`)switch(e.text){case`~`:return T(),{kind:`Apply`,operator:`~`,args:[P(5)],location:t};case`-`:return T(),{kind:`Apply`,operator:`-.`,args:[P(13)],location:t};case`[]`:return T(),{kind:`Always`,expression:P(16),location:t};case`<>`:return T(),{kind:`Eventually`,expression:P(16),location:t};case`ENABLED`:return T(),{kind:`Enabled`,expression:P(16),location:t};case`UNCHANGED`:return T(),{kind:`Unchanged`,expression:P(16),location:t};case`SUBSET`:case`UNION`:case`DOMAIN`:return T(),{kind:`Apply`,operator:e.text,args:[P(9)],location:t}}return xe()},P=(e=0)=>{let t=r.index,n=Se(),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){T(),i.left=g({kind:`Prime`,expression:i.left,location:r},t);continue}if(Ks.has(n.text)&&e<=15){T(),i.left=g({kind:`Apply`,operator:n.text,args:[i.left],location:r},t);continue}if(n.text===`[`){T();let e=se(()=>k(()=>P()));se(()=>D(`]`)),i.left=g({kind:`FunctionApplication`,function:i.left,args:e,location:r},t);continue}if(n.text===`.`&&ae(v(1))){T();let e=T().text;i.left=g({kind:`FieldAccess`,record:i.left,field:e,location:r},t);continue}let a=Gs.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(T(),a.low>12&&w(`-`))throw S(`Precedence conflict between ${n.text} and -`,v());let s=P(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},Ce=()=>{if(!E(`(`))return[];let e=F();return D(`)`),e},we=()=>{let e=d(v()),t=P(),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}}},Te=e=>{let t=r.index;return g(Ee(e),t)},Ee=e=>{let t=v(),n=d(t),i=(t,r)=>({kind:`Operator`,name:t,params:r,...we(),isLocal:e,isRecursive:u(t),location:n});if(t.kind===`Identifier`&&v(1).kind===`Operator`&&Gs.has(v(1).text)&&v(2).kind===`Identifier`&&w(`==`,3)){let e=O(),t=T().text,n=O();return D(`==`),i(t,[{name:e,arity:0},{name:n,arity:0}])}let a=t.kind===`Operator`&&t.text===`-.`,o=t.kind===`Identifier`&&Ks.has(v(1).text)&&w(`==`,2);if(a||o){let e=a?t.text:v(1).text;r.index+=a?1:2;let n=a?O():t.text;return D(`==`),i(e,[{name:n,arity:0}])}let s=O();if(E(`[`)){let t=se(()=>A());return D(`]`),D(`==`),{kind:`Function`,name:s,bounds:t,body:P(),isLocal:e,isRecursive:u(s),location:n}}let c=r.index,l=Ce();return D(`==`),w(`INSTANCE`)?{...De(s,l,e,n),definitionRange:h(c)}:i(s,l)},De=(e,t,n,i)=>{let a=r.index;return D(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:O(),substitutions:E(`WITH`)?k(()=>{let e=T().text;return D(`<-`),{name:e,expression:N()}}):[],isLocal:n,location:i,instanceRange:h(a)}},Oe=()=>{let e=d(v());if(w(`_`)&&v(1).kind===`Operator`)return T(),{name:T().text,arity:E(`_`)?2:1,location:e};if(v().kind===`Operator`&&w(`_`,1)){let t=T().text;return T(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=O();if(!E(`(`))return{name:t,arity:0,location:e};let n=k(()=>D(`_`));return D(`)`),{name:t,arity:n.length,location:e}},F=()=>k(Oe),I=()=>{let e=F();return e.forEach(e=>i[i.length-1].add(e.name)),e},ke=e=>{let t={value:0,offset:e};do{let e=v(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&lc.has(e.text)&&t.value++,e.kind===`Operator`&&uc.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Ae=()=>{let e=v(),t=v(1);return e.kind===`Identifier`?w(`(`,1)||w(`[`,1)?w(`==`,ke(1)):t.kind===`Operator`&&Ks.has(t.text)?w(`==`,2):t.kind===`Operator`&&Gs.has(t.text)?v(2).kind===`Identifier`&&w(`==`,3):w(`==`,1):w(`-.`)&&t.kind===`Identifier`&&w(`==`,2)},je=[],Me=()=>je[je.length-1]??-1,L=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),Ne=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(`.`)&&!ac.has(Ne(e)),Fe=e=>{let t=Ne(e);if(ac.has(t))return;let n=L(e);if(n>=0)return`<${n}>${t}`;let r=Me(),i=je[je.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},Ie=e=>{if(e.kind===`Keyword`)return nc.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return je.length===0;if(e.text[1]===`+`||je.length===0)return!0;let t=Me();return t>=0&&L(e)>t},Le=e=>{let t=L(e),n=je.length-1,r=je[n-1]??-1,i=je[n]<0;return i&&(je[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:je[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:!dc.has(e.name)&&!Re(e.name):!1,Be=()=>{let e=v();return e.kind===`Step`?Pe(e):e.kind===`Keyword`?oc.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Ae()},Ve=()=>{let e=r.index;s.index=e;let t=v();return t.kind===`Operator`&&!Js.has(t.text)&&Zs(t.text)?(r.index++,g({kind:`OperatorReference`,operator:t.text,location:d(t)},e)):E(`MODULE`)?g({kind:`ModuleFact`,name:O(),location:d(t)},e):P()},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=k(()=>{let e=v();if((e.kind!==`Identifier`||x(e))&&e.kind!==`Operator`)throw C(`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 k(Ge);let e=k(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()?k(Ve):[],defs:E(`DEF`)||E(`DEFS`)?Ke():[]}),Je=()=>{let e=r.index,n=T(),i=n.text===`USE`&&E(`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=E(`NEW`),i=v().kind===`Keyword`?sc.get(v().text):void 0;if(!n&&i===void 0)throw C(`Expected a declaration but found ${y(v())}`);if(i!==void 0&&T(),i===`Variable`){let n=O();return He(n),g({kind:`NewSymbol`,name:n,arity:0,level:i,set:void 0,location:t},e)}let a=Oe();He(a.name);let o=(i??`Constant`)===`Constant`&&w(`\\in`);if(o&&a.arity>0)throw S(`declared symbol with arguments before \\in`);return o&&T(),g({kind:`NewSymbol`,name:a.name,arity:a.arity,level:i??`Constant`,set:o?P():void 0,location:t},e)},Xe=()=>{let e=r.index,t=d(D(`ASSUME`)),n=k(()=>w(`ASSUME`)?Ue(Xe):v().kind===`Keyword`&&cc.has(v().text)?Ye():P());return D(`PROVE`),g({kind:`AssumeProve`,assumptions:n,conclusion:P(),location:t},e)},Ze=e=>{let t={value:0};for(;v(t.value).kind===`Identifier`&&w(`,`,t.value+1);)t.value+=2;return v(t.value).kind===`Identifier`&&w(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(w(`USE`)||w(`HIDE`))return Je();if(w(`INSTANCE`))return g(De(void 0,[],!1,d(e)),r.index);if(w(`DEFINE`)||Ae()){let t=r.index;E(`DEFINE`);let n=[Te(!1)];for(;Ae();)n.push(Te(!1));let i={kind:`Define`,definitions:n,location:d(e)};return g(i,t)}if(E(`HAVE`))return{kind:`Have`,expression:P()};if(E(`TAKE`)){let e=ce(),t=e?[]:k(O),n=e?A():[];return Qe(t,n),{kind:`Take`,names:t,bounds:n}}if(E(`WITNESS`))return{kind:`Witness`,expressions:k(()=>P())};if(E(`PICK`)){let e=Ze(`:`),t=e?k(O):[],n=e?[]:A();return Qe(t,n),D(`:`),{kind:`Pick`,names:t,bounds:n,body:P()}}return E(`CASE`)?{kind:`Case`,expression:P()}:{kind:`Assert`,isSuffices:E(`SUFFICES`),statement:w(`ASSUME`)?Xe():P()}},et=e=>{let t=v();if(t.kind!==`Step`)throw C(`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(L(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(w(`QED`,1)),n=/* @__PURE__ */ new Set;o.push(n);let i=E(`QED`)?{kind:`Qed`}:$e(),a=h(e),s=Ie(v());if(s&&!rc.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(w(`BY`)||w(`PROOF`)&&w(`BY`,1)){E(`PROOF`),T();let t=h(r.index-1);return{kind:`By`,isOnly:E(`ONLY`),...qe(),keyword:t,location:e}}let t=v(+!!w(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){E(`PROOF`),T();let n=h(r.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}E(`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;je.push(-1);let t=Ue(nt);return je.pop(),g(t,e)},it=e=>{let t=r.index,n=T(),i=v().kind===`Identifier`&&w(`==`,1)?O():void 0;i!==void 0&&(a.add(i),T());let o=Ue(()=>({statement:w(`ASSUME`)?Xe():P(),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=T(),t=d(e),n=e.text===`AXIOM`;if(v().kind===`Identifier`&&w(`==`,1)){let e=O();return a.add(e),T(),{name:e,expression:P(),isAxiom:n,location:t}}return{name:void 0,expression:P(),isAxiom:n,location:t}},st=()=>{let e=d(D(`----`));D(`MODULE`);let t=O();D(`----`);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),E(`EXTENDS`)&&k(()=>{let e=r.index;n.extends.push(O()),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(w(`MODULE`,1)){let e=st();n.modules.push(e),n.units.push({kind:`Module`,module:e}),D(`====`);continue}T()}else{switch(o.text){case`CONSTANT`:case`CONSTANTS`:{T();let e=F();n.constants.push(...e),n.units.push({kind:`Constants`,declarations:e});continue}case`VARIABLE`:case`VARIABLES`:{T();let e=k(()=>{let e=r.index,t=d(v());return g({name:O(),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`:T(),n.units.push({kind:`Recursive`,declarations:I()});continue;case`INSTANCE`:ct(n,g(De(void 0,[],!1,d(o)),a));continue;case`LOCAL`:if(T(),w(`INSTANCE`)){ct(n,g(De(void 0,[],!0,d(o)),a));continue}ct(n,Te(!0));continue}o.kind===`Keyword`&&tc.has(o.text)?it(n):ct(n,Te(!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()},hc=e=>mc(e,!1),gc=e=>mc(e,!0),_c=25214903917n,vc=(1n<<48n)-1n,yc=2147483647,bc=e=>{let t={value:(BigInt.asUintN(64,e)^_c)&vc},n=e=>(t.value=t.value*_c+11n&vc,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^_c)&vc},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<=yc)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},xc=10454148508367108822n,Sc=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:xc);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Cc=Int32Array.from(Sc,e=>Number(BigInt.asIntN(32,e>>32n))),wc=Int32Array.from(Sc,e=>Number(BigInt.asIntN(32,e))),Tc=Number(BigInt.asIntN(32,xc>>32n)),Ec=Number(BigInt.asIntN(32,xc));let Dc=Tc,Oc=Ec;const kc=e=>{let t=(e^Oc)&255;Oc=(Oc>>>8|Dc<<24)^wc[t],Dc=Dc>>>8^Cc[t]},Ac=e=>{for(let t=0;t<32;t+=8)kc(e>>>t)},jc=e=>{if(typeof e==`boolean`)kc(0),kc(e?116:102);else if(typeof e==`number`)kc(1),Ac(e);else if(typeof e==`string`){kc(3),Ac(e.length);for(let t=0;t<e.length;t++)kc(e.charCodeAt(t))}else if(N(e))kc(21),Ac(Oe(e.name)+1);else if(M(e)){let t=V(e);kc(9),Ac(t.domain.length);for(let e=0;e<t.domain.length;e++)jc(t.domain[e]),jc(t.range[e])}else{let t=z(e).elements;kc(5),Ac(t.length);for(let e of t)jc(e)}},Mc=e=>{let t={high:Dc,low:Oc};Dc=Tc,Oc=Ec;for(let t of e)jc(t);let n=BigInt(Dc>>>0)<<32n|BigInt(Oc>>>0);return Dc=t.high,Oc=t.low,n},Nc=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||N(e))return 5;if(typeof e==`string`)return 5+e.length;if(M(e)){let t=V(e);return t.domain.reduce((e,n,r)=>e+Nc(n)+Nc(t.range[r]),5)}return z(e).elements.reduce((e,t)=>e+Nc(t),5)},Pc=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){Dc=n<32?0:1<<n-32,Oc=n<32?1<<n:0;for(let t=0;t<e;t++)kc(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]^Dc,t[n+1]=t[a+1]^Oc}}return t},Fc=(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=Nc(e);return Dc=0,Oc=0,jc(e),r.set(e,i.length),i.push(n,Dc,Oc),i.length-3},o=e=>{let t=n.get(e);if(t)return t;let r=Pc(e);return n.set(e,r),r};return(n,r)=>{let s={high:Dc,low:Oc},c={high:Tc,low:Ec};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}Dc=s.high,Oc=s.low,t[2*r]=c.low,t[2*r+1]=c.high}},Ic=[],Lc=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Rc=()=>{for(let e=1277011;Ic.length<1341;e++)Lc(e)&&Ic.push(e);return Ic},zc=e=>{let t=Rc(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},Bc=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},Vc=e=>{for(let t=Math.max(e,9);;t++){let e=Bc(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)}}},Hc=(e,t,n)=>{if(t<=0)return[];let r=Vc(t),i={index:BigInt(n.nextInt(t))},a=BigInt(zc(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},Uc=(1n<<63n)-1n-24n,Wc=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Uc*BigInt(n)+i)%t;return r<0n?r+t:r})},Gc=(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,Kc=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Et(e.domain),n=z(e.range).elements;return{lists:t.map(()=>n),create:e=>Ie(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>z(e).elements),create:t=>kt(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>z(e).elements),create:Ot}}},qc=(e,t,n)=>{if(B(t))return[];if(typeof t==`object`&&t.kind===`Interval`)return Hc(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let r=Kc(t);if(r){let t=r.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(yc)?Wc(e,t,n):Hc(e,Number(t),n)).map(e=>r.create(Gc(r.lists,e)))}let i=z(t).elements;return Hc(e,i.length,n).map(e=>i[Number(e)])},Jc=(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},Yc=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...Et(e.domain)];return Ie(n,n.map(()=>Yc(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return kt(e.names.map((n,r)=>[n,Yc(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return Ot(e.factors.map(e=>Yc(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 Jc(z(e).elements,t)},Xc=(e,t=0n)=>{let n=bc(t),r={random:bc(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>kt([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Mc,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},Zc=e=>vt([...e.possibleCounts].map(([e,t])=>[e,t])),Qc=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Zc(e)]]),$c=(e,t,n)=>new d(`Applying ${e} to the following value,\nwhich is not ${t}:\n${H(n)}`),el=(e,t,n,r)=>new d(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${H(r)}`),tl=e=>M(e)?V(e):void 0,nl=(e,t,n)=>{let r=W(e,t,n),i=tl(r);if(!i)throw $c(n,`a function with a finite domain`,r);return i},rl=(e,t,n)=>{let r=W(e,t,n),i=tl(r);if(!i)throw el(t===0?`first`:`second`,n,`bag`,r);return i},il=(e,t)=>{if(!j(e)||!R(e))throw t();return z(e).elements},al=e=>e.range.every(e=>typeof e==`number`&&e>0),ol=(e,t)=>{let n=e.domain.findIndex(e=>Le(e,t));return n===-1?void 0:e.range[n]},sl=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,cl=sl(`BagDiff`,`tlc2.value.impl.Value`,2),ll=sl(`SqSubseteq`,`tlc2.value.IBoolValue`,2),ul=sl(`BagUnion`,`tlc2.value.impl.Value`,1),dl=sl(`BagOfAll`,`tlc2.value.impl.Value`,2),fl=sl(`BagCup`,`tlc2.value.impl.Value`,2),pl=sl(`BagCardinality`,`tlc2.value.impl.IntValue`,1),ml=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${ar(e)}`;throw sr(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')`)},hl=(e,t,n)=>{let r=ml(e,n)+ml(t,n);if(er(r))throw tr(`${e}+${t}`);return r},gl=(e,t,n,r)=>{let i=ol(n,e.domain[t]),a=ml(e.range[t],r);return i===void 0?a:a-ml(i,r)|0},_l=(e,t)=>vt(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>Le(e[0],r));a?a[1]=hl(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),vl=Ie([],[]),yl=[Xn(`EmptyBag`,vl),G(`IsABag`,1,e=>{let t=tl(W(e,0,`IsABag`));return t!==void 0&&al(t)}),G(`BagCardinality`,1,e=>{let t=W(e,0,`BagCardinality`);return nl(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw $c(`BagCardinality`,`a bag`,t);return hl(e,n,pl)},0)}),G(`BagIn`,2,e=>{let t=W(e,1,`BagIn`),n=ol(nl(e,1,`BagIn`),W(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw el(`second`,`BagIn`,`bag`,t);return n>0}),G(`CopiesIn`,2,e=>{let t=W(e,1,`CopiesIn`),n=ol(nl(e,1,`CopiesIn`),W(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw el(`second`,`CopiesIn`,`bag`,t);return n}),G(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=rl(e,t,`(+)`);if(!al(n))throw el(t===0?`first`:`second`,`(+)`,`bag`,W(e,t,`(+)`));return n});return _l(t,fl)}),G(`\\ominus`,2,e=>{let t=rl(e,0,`(-)`),n=rl(e,1,`(-)`);return vt(t.domain.flatMap((e,r)=>{let i=gl(t,r,n,cl);return i>0?[[e,i]]:[]}))}),G(`BagUnion`,1,e=>{let t=W(e,0,`BagUnion`),n=il(t,()=>$c(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??vl;let r=n.map(e=>{let n=tl(e);if(!n)throw new d(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${H(t)}`);return n});return _l(r,ul)}),G(`\\sqsubseteq`,2,e=>{let t=nl(e,0,`\\sqsubseteq`),n=nl(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>gl(t,r,n,ll)<=0)}),Zn(`BagOfAll`,2,e=>{let t=Yn(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${H(t.literalBody)}`);let n=W(e,1,`BagOfAll`),r=tl(n);if(!r)throw el(`second`,`BagOfAll`,`function with a finite domain`,n);return _l(r.domain.map((e,n)=>Ie([t.call([e])],[r.range[n]])),dl)}),G(`SubBag`,1,e=>{let t=W(e,0,`SubBag`);if(!M(t))throw new u(`DOMAIN expects a function but received ${H(t)}`);let n=V(t),r=ft(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${H(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 ${H(n)}, which is not in its domain`);return ft(n.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:a[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Ie(e.map(e=>e[0]),e.map(e=>e[1]))))}),G(`BagToSet`,1,e=>cn(nl(e,0,`BagToSet`))),G(`SetToBag`,1,e=>{let t=W(e,0,`SetToBag`),n=il(t,()=>$c(`BagToSet`,`a function with a finite domain`,t));return Ie([...n],n.map(()=>1))})],bl=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,xl=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,Sl=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Cl=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,wl=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Tl=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,El=e=>{if(!M(e))return!1;let t=V(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},Dl=(e,t)=>sr(e,`Cannot convert value: unsupported value type tlc2.value.impl.${ar(t)}`),Ol=(e,t)=>sr(e,`Cannot cast tlc2.value.impl.${ar(t)} to tlc2.value.impl.StringValue`),kl=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Al=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw Dl(t,e);return`[${z(e).elements.map(e=>Ml(e,t)).join(`,`)}]`},jl=(e,t)=>{let n=V(e),r=Xt(n);return r?`[${r.map(e=>Ml(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${kl(typeof e==`string`?e:H(e))}:${Ml(n.range[r],t)}`).join(`,`)}}`},Ml=(e,t)=>typeof e==`string`?kl(e):typeof e==`object`?e.kind===`ModelValue`?kl(e.name):j(e)?Al(e,t):jl(e,t):String(e),Nl=e=>{if(j(e))return Al(e,bl);if(!M(e)||El(e))throw Dl(bl,e);return jl(e,bl)},Pl=e=>{if(!M(e))throw Dl(xl,e);return jl(e,xl)},Fl=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))},Il=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Ee(e);if(Array.isArray(e))return Ot(e.map(e=>Il(e,t)));if(typeof e==`object`&&e)return kt(Object.entries(e).map(([e,n])=>[Ee(e),Il(n,t)]));throw sr(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Ll=(e,t)=>{if(e.trim()===``)return Il(null,t);try{return Il(JSON.parse(e,(e,t,n)=>typeof t==`number`?Fl(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?sr(t,e.message):e}},Rl=(e,t)=>{if(typeof e!=`string`)throw Ol(t,e);return e},zl=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw sr(n,`${t} (No such file or directory)`);return r},Bl=e=>[Qn(`ToJson`,1,e=>Ee(Ml(W(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Qn(`ToJsonArray`,1,e=>Ee(Nl(W(e,0,`ToJsonArray`)))),Qn(`ToJsonObject`,1,e=>Ee(Pl(W(e,0,`ToJsonObject`)))),Qn(`JsonSerialize`,2,t=>{let n=Rl(W(t,0,`JsonSerialize`),Sl),r=W(t,1,`JsonSerialize`);if(!Xt(r)&&!El(r))throw new d(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${H(r)}`);return e.writeFile?.(n,Ml(r,Sl)),!0}),Qn(`ndJsonSerialize`,2,t=>{let n=Rl(W(t,0,`ndJsonSerialize`),Cl),r=W(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${H(r)}`);return e.writeFile?.(n,i.map(e=>`${Ml(e,Cl)}\n`).join(``)),!0}),Qn(`JsonDeserialize`,1,t=>{let n=Rl(W(t,0,`JsonDeserialize`),wl);return Ll(zl(e,n,wl),wl)}),Qn(`ndJsonDeserialize`,1,t=>{let n=Rl(W(t,0,`ndJsonDeserialize`),Tl);return Ot(zl(e,n,Tl).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Ll(e,Tl)))})],Vl=(e,t,n,r)=>new d(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),Hl=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Vl(t,n,`nonnegative integer`,H(e));return e},Ul=(e,t,n,r)=>{if(!j(e)||!R(e))throw Vl(t,n,r,H(e));return z(e).elements},Wl=(e,t,n,r)=>ft(Array.from({length:t},()=>ft(e.filter(()=>r.nextDouble()<n)))),Gl=(e,t)=>{let n=`RandomSetOfSubsets`,r=Hl(W(e,0,n),`first`,n),i=Hl(W(e,1,n),`second`,n),a=Ul(W(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw Vl(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw Vl(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return Wl(a,r,a.length===0?0:i/a.length,t.getRandom())},Kl=e=>[Qn(`RandomSubset`,2,t=>{let n=W(t,0,`RandomSubset`);if(typeof n!=`number`)throw Vl(`first`,`RandomSubset`,`nonnegative integer`,H(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=W(t,1,`RandomSubset`);if(!j(r)||!B(r)&&!R(r))throw Vl(`second`,`RandomSubset`,`a finite set`,H(r));return ft(qc(n,r,e.getRandom()))}),Qn(`RandomSetOfSubsets`,3,t=>Gl(t,e)),Qn(`TestRandomSetOfSubsets`,3,t=>Ot(Array.from({length:5},()=>z(Gl(t,e)).elements.length)))],ql=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,Jl=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${ql})`,Yl=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${ql}) throws java.io.IOException`,Xl=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${ql})`,Zl=()=>kt([[`action`,ft([])],[`state`,ft([])]]),Ql=()=>kt([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),$l=e=>kt([[`name`,e??`UnnamedAction`],[`location`,Ql()]]),eu=(e,t)=>{let n=e.map((e,t)=>Ot([t+1,kt(Object.entries(e.state))])),r=n.slice(1).map((t,r)=>Ot([n[r],$l(e[r+1].action),t])),i=t?[Ot([n[n.length-1],$l(t.action),n[t.start]])]:[];return kt([[`action`,ft([...r,...i])],[`state`,ft(n)]])},tu=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Qc(e).get(t)},nu=(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),H(r));else throw new d(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${H(n)}`)},ru=e=>e.every(e=>e!==void 0),iu=(e,t)=>kt(t.variables.map((t,n)=>[t,e[n]])),au=(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&&!U(e)){if(t.variableIndex.has(r))return!0;let e=$a(r,t);if(e&&!n.has(e)&&(n.add(e),au(e.body,t,n)))return!0}return Ln(e).some(e=>au(e,t,n))},ou=(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[G(`AssertEq`,2,t=>{let n=W(t,0,`AssertEq`),r=W(t,1,`AssertEq`),i=Le(n,r);return i||(e(H(`Assertion failed`,!0)),e(H(n,!0)),e(H(r,!0))),i}),mr(`AssertError`,2,e=>{let t=Yn(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw sr(Jl,`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=hr(e,0,`AssertError`)();try{hr(e,1,`AssertError`)()}catch(e){if(e instanceof u)return e.message===n;throw e}return!1}),Qn(`TLCGetOrDefault`,2,e=>{let n=W(e,0,`TLCGetOrDefault`);return tu(t,n)??W(e,1,`TLCGetOrDefault`)}),{...Zn(`TLCGetAndSet`,4,n=>{let r=W(n,0,`TLCGetAndSet`),i=tu(t,r)??W(n,3,`TLCGetAndSet`),a=Yn(n,1,`TLCGetAndSet`);return nu(t,e,r,a.call([i,W(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Qn(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!ru(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw sr(Yl,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return Ot(t.getBehavior(r).map(e=>iu(e,n.environment)))}),Qn(`CounterExample`,0,()=>t.counterExample??Zl()),G(`ToTrace`,1,e=>{let t=W(e,0,`ToTrace`);if(!M(t)||!Le(cn(t),ft([`action`,`state`])))throw new u(`The argument of ToTrace should be a CounterExample, but instead it is:\n${H(t)}`);let n=z(on(t,`state`)).elements.map(e=>Xt(e)??[]);return Ot(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),G(`TLCModelValue`,1,e=>{let t=W(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new d(`The argument of ModelValue should be a string, but instead it is:\n${H(t)}`);return Pe(t)}),mr(`TLCDefer`,1,()=>!0),G(`TLCNoOp`,1,e=>W(e,0,`TLCNoOp`)),mr(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!ru(r))throw sr(Xl,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||Qa(hr(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new m(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),mr(`TLCCache`,2,(e,t)=>{let r=Yn(e,0,`TLCCache`),a=En(hr(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=au(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}),G(`TLCFP`,1,e=>Number(BigInt.asIntN(32,Mc([W(e,0,`TLCFP`)])))),Qn(`TLCEvalDefinition`,1,(e,t)=>{let n=W(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?$a(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${H(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)})]},su=(e,t)=>[Qn(`_Track`,2,e=>{let n=String(W(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,W(e,0,`_Track`)===!0?r+1:r),!0}),Qn(`_Counts`,0,()=>Zc(t)),Qn(`_CheckName`,1,n=>{let r=String(W(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(H(Zc(t),!0)),!1)}),Qn(`_PrintCounts`,0,()=>(e(H(Zc(t),!0)),!0))],cu=e=>String(e).padStart(2,`0`),lu=e=>`${e.getUTCFullYear()}.${cu(e.getUTCMonth()+1)}.${cu(e.getUTCDate())}.${cu(e.getUTCHours())}${cu(e.getUTCMinutes())}${cu(e.getUTCSeconds())}`,uu=e=>vt([...e].map(([e,t])=>[e,Ot([t])])),du=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),fu=(e,t,n)=>{if(!e.isStarted&&du.has(t))throw new d(`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`,Ee(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Ee(lu(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return $l(void 0);case`all`:return uu(e.registers);case`all:named`:return uu(Qc(e))}if(t.startsWith(`s:`)){let n=Qc(e).get(t);if(n===void 0)throw new d(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Ee(e.properties.get(t.slice(2))??t);throw new d(`TLCGet(${t}) was undefined.`)},pu=e=>e.length===0?[[]]:e.flatMap((t,n)=>pu([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),mu=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&z(e).elements.forEach(mu),e.kind===`Function`&&e.range.forEach(mu))},hu=(t,n)=>[G(`Print`,2,e=>(t(`${A(H(W(e,0,`Print`),!0,!0))} ${A(H(W(e,1,`Print`),!0,!0))}`),W(e,1,`Print`))),G(`PrintT`,1,e=>(t(A(H(W(e,0,`PrintT`),!0,!0))),!0)),G(`Assert`,2,t=>{if(W(t,0,`Assert`)!==!0)throw new d(`The first argument of Assert evaluated to FALSE; the second argument was:\n${A(H(W(t,1,`Assert`)))}`,e.assertViolation);return!0}),G(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),G(`:>`,2,e=>vt([[W(e,0,`:>`),W(e,1,`:>`)]])),G(`@@`,2,e=>{let t=Jn(e,0,`@@`),n=Jn(e,1,`@@`);return yt([...ge(t),...ge(n)])}),G(`ToString`,1,e=>Ee(H(W(e,0,`ToString`),!0))),G(`TLCEval`,1,e=>{let t=W(e,0,`TLCEval`);return mu(t),t}),G(`Permutations`,1,e=>{let t=Kn(e,0,`Permutations`);return ft(pu(t).map(e=>vt(t.map((t,n)=>[t,e[n]]))))}),Zn(`SortSeq`,2,e=>{let t=Yn(e,1,`SortSeq`);return Ot(qn(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)]},[]))}),Qn(`TLCGet`,1,(e,t)=>{let r=W(e,0,`TLCGet`);if(typeof r==`number`&&r>=0){let e=n.registers.get(r);if(e===void 0)throw new d(`TLCGet(${r}) was undefined.`);return e}if(typeof r!=`string`)throw new d(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${H(r)}`);return fu(n,r,t?.state)}),Qn(`TLCSet`,2,e=>{let r=W(e,0,`TLCSet`);return nu(n,t,r,W(e,1,`TLCSet`)),!0}),Xn(`Any`,je),G(`RandomElement`,1,e=>Yc(Wn(e,0,`RandomElement`),n.getRandom()))],gu=/* @__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(`,`),_u=[[`\\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`,`≀`],[`^+`,`⁺`]],vu=/* @__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(`,`),yu=/* @__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(`.`),bu=/* @__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(`.`),xu=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
102
+ =============================================================================`]]),Uc=`tlc2/value/impl/`,Wc=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)}},Gc=e=>[...e.slice(1,e.indexOf(`)`)).matchAll(/\[*(?:L[^;]*;|[BCDFIJSZ])/g)].length,Kc=e=>{let t=Wc(e);if(t.readUint32()!==3405691582)throw new p(`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:Gc(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}},qc=(e,t)=>e[e[t].first].text,Jc=(e,t)=>{let n=e[t],r=e[n.second];return{className:qc(e,n.first),name:e[r.first].text}},Yc=(e,t,n,r)=>{let i=()=>new te(`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=Jc(t,l());if(n.className!==`${Uc}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=Jc(t,l()),a=s();if(n.className!==`${Uc}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:qc(t,l()),value:void 0}),e+=3;else if(n===183){let n=Jc(t,l()),a=s(),o=s();if(!(n.className===`${Uc}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()},Xc=(e,t)=>{if(!t)return e;let n=Kc(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:Yc(r,n.pool,e.name,t.location)}:t});return{...e,definitions:r}},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),Zc=new Map([[`=>`,$(1,1,!1)],[`<=>`,$(2,2,!1)],[`~>`,$(2,2,!1)],[`-+->`,$(2,2,!1)],[`/\\`,$(3,3,!0)],[`\\/`,$(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,$(5,5,!1)]),[`\\cdot`,$(5,14,!0)],[`@@`,$(6,6,!0)],[`:>`,$(7,7,!1)],[`<:`,$(7,7,!1)],[`\\cup`,$(8,8,!0)],[`\\cap`,$(8,8,!0)],[`\\`,$(8,8,!1)],[`..`,$(9,9,!1)],[`...`,$(9,9,!1)],[`##`,$(9,13,!0)],[`$`,$(9,13,!0)],[`$$`,$(9,13,!0)],[`??`,$(9,13,!0)],[`!!`,$(9,13,!1)],[`\\sqcap`,$(9,13,!0)],[`\\sqcup`,$(9,13,!0)],[`\\uplus`,$(9,13,!0)],[`\\wr`,$(9,14,!1)],[`+`,$(10,10,!0)],[`++`,$(10,10,!0)],[`(+)`,$(10,10,!0)],[`\\oplus`,$(10,10,!0)],[`%`,$(10,11,!1)],[`%%`,$(10,11,!0)],[`|`,$(10,11,!0)],[`||`,$(10,11,!0)],[`\\X`,$(10,13,!1)],[`-`,$(11,11,!0)],[`--`,$(11,11,!0)],[`(-)`,$(11,11,!0)],[`\\ominus`,$(11,11,!0)],[`*`,$(13,13,!0)],[`**`,$(13,13,!0)],[`/`,$(13,13,!1)],[`//`,$(13,13,!1)],[`\\div`,$(13,13,!1)],[`\\o`,$(13,13,!0)],[`(.)`,$(13,13,!0)],[`\\odot`,$(13,13,!0)],[`(/)`,$(13,13,!1)],[`\\oslash`,$(13,13,!1)],[`(\\X)`,$(13,13,!0)],[`\\otimes`,$(13,13,!0)],[`&`,$(13,13,!0)],[`&&`,$(13,13,!0)],[`\\star`,$(13,13,!0)],[`\\bullet`,$(13,13,!0)],[`\\bigcirc`,$(13,13,!0)],[`^`,$(14,14,!1)],[`^^`,$(14,14,!1)]]),Qc=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),$c=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),el=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),tl=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),nl=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...Qc]),rl=e=>Zc.has(e)||Qc.has(e)||e===`-.`,il=(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}}},al=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),ol=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),sl=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),cl=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),ll=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),ul=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),dl=/* @__PURE__ */ new Set([``,`*`,`-`]),fl=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),pl=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),ml=/* @__PURE__ */ new Set([`NEW`,...pl.keys()]),hl=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),gl=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),_l=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),vl=e=>RegExp(`^-{4,}\\s*MODULE\\s+${e}\\s*-{3,}$`),yl=(e,t)=>{let n=e.split(/\r?\n/),r=n.findIndex(e=>vl(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(`
103
+ `)},bl=(e,t)=>{let n=fe(e),r={index:0,offsideColumns:[]},i=[],a=/* @__PURE__ */ new Set,o=[],s={index:-1},c=[],l=e=>i[i.length-1].has(e),u=e=>({line:e.line,column:t&&e.kind===`String`?e.endColumn:e.column,range:void 0}),d=[],f=[],h=[],g=(e,t=r.index-1)=>{let i=e===t?h[e]:void 0;if(i)return i;let a=n[t];d[e]??=u(n[e]),f[t]??={line:a.line,column:a.endColumn};let o={module:c[0].name,start:d[e],end:f[t]};return e===t&&(h[e]=o),o},v=(e,t)=>(e.location.range=g(t),e),y=(e=0)=>n[Math.min(r.index+e,n.length-1)],b=(e=0)=>{let t=y(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},x=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),S={index:0},C=e=>{let t=n.slice(S.index,r.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},w=e=>t&&(e.kind===`Keyword`||_l.has(e.text)),T=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},ee=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:ul.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):w(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,te=(e,t=y(),r)=>{let i=n[n.length-1],a=t.line===i.line&&t.column===i.column;return new p(`${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`,...C(T(e)),isEnd:i}}return t&&a?{reason:`Unexpected ${ee(a)}`,...T(a),isEnd:i}:{reason:e,line:r.line,column:r.column,isEnd:i}},E=(e,t=y())=>te(e,t,t),re=e=>(e.kind===`Identifier`||e.kind===`Keyword`)&&!w(e),D=(e,t=0)=>{let n=b(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},O=()=>{let e=b();if(e.kind===`End`)throw te(`Unexpected end of expression`);return r.index++,e},k=e=>D(e)?(r.index++,!0):!1,A=e=>{if(!D(e))throw E(`Expected ${JSON.stringify(e)} but found ${x(b())}`);return O()},ie=()=>{let e=b();if(e.kind!==`Identifier`)throw E(`Expected an identifier but found ${x(e)}`);if(w(e))throw E(`Unexpected keyword ${e.text}`);return r.index++,e.text},ae=()=>{let e=r.index;return{name:ie(),range:g(e)}},oe=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),se=e=>{r.offsideColumns.push(-1);let t=e();return r.offsideColumns.pop(),t},ce=(e,t=`,`)=>{let n=[e()];for(;k(t);)n.push(e());return n},le=()=>{if(D(`<<`)){let e={value:1};for(;b(e.value).kind===`Identifier`||D(`,`,e.value);)e.value++;return D(`>>`,e.value)&&D(`\\in`,e.value+1)}let e={value:0};for(;b(e.value).kind===`Identifier`;){if(D(`\\in`,e.value+1))return!0;if(!D(`,`,e.value+1))return!1;e.value+=2}return!1},ue=()=>{if(D(`::`))return!0;if(!D(`(`))return!1;let e={value:1};for(;b(e.value).kind===`Identifier`&&D(`,`,e.value+1);)e.value+=2;return b(e.value).kind===`Identifier`&&D(`)`,e.value+1)&&D(`::`,e.value+2)},de=()=>{if(!k(`<<`)){let e=ae();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=oe(ce(ae));return A(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},pe=()=>ce(()=>{let e=ce(de);A(`\\in`);let t=N();return e.map(e=>({pattern:e,set:t}))}).flat(),M=()=>{let e=b();if(e.kind===`Identifier`){let t=r.index,n=[O().text];for(;D(`!`)&&b(1).kind===`Identifier`;)O(),n.push(ie());return v({kind:`Identifier`,name:n.join(`!`),location:u(e)},t)}if(D(`<<`)||D(`(`))return Oe();throw E(`Expected a subscript but found ${x(e)}`)},me=e=>{let t=b(1),n=b(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&D(`==`,Qc.has(n.text)?3:4))},he=e=>{if(!el.has(e.text))return!0;let t=b(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||D(`,`,1)||D(`)`,1)||t.kind===`Keyword`&&ol.has(t.text)||me(e)},ge=()=>{let e=b(),n=e.kind===`Operator`&&(Zc.has(e.text)||$c.has(e.text))&&he(e);if(t&&e.kind!==`String`&&($c.has(e.text)||nl.has(e.text)&&e.text!==`'`&&!Qc.has(e.text)||tl.has(e.text)&&b(-1).text===`(`&&b(-1).line===e.line&&b(-1).endColumn+1===e.column&&b(1).text===`)`&&b(1).line===e.line&&b(1).column===e.endColumn+1)&&he(e))throw te(`incomplete expression`,e);if(n)return r.index++,v({kind:`OperatorReference`,operator:e.text,location:u(e)},r.index-1);if(e.kind!==`String`&&nl.has(e.text)&&he(e)){r.index++;let t=u(e);if(Qc.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:il(e.text,n,t),location:t}}if(D(`LAMBDA`)){let t=r.index;O();let n=oe(ce(ae));A(`:`);let i=N();return v({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:i,location:u(e)},t)}let i=N();return i.kind===`Identifier`&&_e.delete(i),i},_e=/* @__PURE__ */ new Map,ve={range:void 0},ye=()=>se(()=>{let e=r.index;A(`(`);let t=ce(ge);return A(`)`),ve.range=g(e),t}),be=()=>{let e=O();r.offsideColumns.push(e.column);let t=[N()];for(;y().text===e.text&&y().column===e.column;)r.index++,t.push(N());return r.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:u(e)}},xe=e=>se(()=>{let t=u(e);if(b().kind===`Identifier`&&(D(`|->`,1)||D(`:`,1))){let e=D(`|->`,1)?`Record`:`RecordSet`,n=ce(()=>{let t=r.index,n=u(b()),i=ie();return n.range=g(t),A(e===`Record`?`|->`:`:`),{name:i,value:N(),location:n}});return A(`]`),{kind:e,fields:n,location:t}}if(le()){let e=pe();A(`|->`);let n=N();return A(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let n=N();if(k(`->`)){let e=N();return A(`]`),{kind:`FunctionSet`,domain:n,range:e,location:t}}if(k(`EXCEPT`)){let e=ce(()=>{A(`!`);let e=[];for(;D(`.`)||D(`[`);)if(k(`.`)){if(!re(b()))throw E(`Expected a field name but found ${x(b())}`);e.push({kind:`Field`,name:O().text})}else A(`[`),e.push({kind:`Index`,args:ce(()=>N())}),A(`]`);return A(`=`),{path:e,value:N()}});return A(`]`),{kind:`Except`,function:n,updates:e,location:t}}return A(`]_`),{kind:`BoxAction`,action:n,subscript:M(),location:t}}),Se=e=>se(()=>{let t=u(e);if(k(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(le()&&(b(1).text===`\\in`||D(`<<`))){let e=r.index,n=de();A(`\\in`);let i=N();if(k(`:`)){let e=N();return A(`}`),{kind:`SetFilter`,bound:{pattern:n,set:i},predicate:e,location:t}}r.index=e}let n=N();if(k(`:`)){let e=pe();return A(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let i=[n];for(;k(`,`);)i.push(N());return A(`}`),{kind:`SetEnumeration`,elements:i,location:t}}),Ce=e=>{let t=u(e),n=se(()=>D(`>>`)||D(`>>_`)?[]:ce(()=>N()));if(k(`>>_`)){if(n.length!==1)throw te(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:M(),location:t}}return A(`>>`),{kind:`Tuple`,elements:n,location:t}},we=e=>{let t=u(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&le()){let e=pe();return A(`:`),{kind:n,bounds:e,body:N(),location:t}}let i=oe(ce(ae));return A(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:N(),isTemporal:r,location:t}},Te=e=>{let t=[];do{if(k(`OTHER`))return A(`->`),{kind:`Case`,arms:t,other:N(),location:u(e)};let n=N();A(`->`),t.push({condition:n,body:N()})}while(k(`[]`));return{kind:`Case`,arms:t,other:void 0,location:u(e)}},Ee=()=>{let e=b(1);return D(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||al.has(e.text)||e.kind===`Operator`&&(Zc.has(e.text)||Qc.has(e.text)||$c.has(e.text)))},De=()=>{let e=O();if(e.kind===`Number`)return{kind:`Operand`,operand:j(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:ye()}}return{kind:`Name`,name:e.text,args:D(`(`)?ye():[]}},Oe=()=>{let e=r.index,n=e===s.index,a=O(),o=u(a);if(t&&a.kind===`Keyword`&&a.text===`LAMBDA`){let e=ce(ie);return A(`:`),{kind:`Lambda`,params:e,body:N(),location:o}}if(a.kind===`Number`){if(t&&/^\\[BOH]/.test(a.text))throw te(`incomplete expression`,a);return{kind:`Number`,value:j(a.text),text:a.text,location:o}}if(a.kind===`Decimal`)return{kind:`Decimal`,text:a.text,location:o};if(a.kind===`String`)return{kind:`String`,value:a.text,location:o};let l=a.kind===`Step`&&V(a);if(l&&z()<0&&R.length<=1)throw te(`Step number used outside proof`,a);if(l&&a.text[1]===`+`)throw te(`<+> step number used in an expression`,a);if(a.kind===`Identifier`||l){let i=l?H(a)??a.text:a.text;if(ue()){let e=k(`(`)?ce(ie):[];return e.length>0&&A(`)`),A(`::`),{kind:`Label`,name:i,params:e,body:N(),location:o}}let s=D(`(`),u=s?ye():[];if(!Ee())return s?{kind:`Apply`,operator:i,args:u,argumentsRange:ve.range,location:o}:{kind:`Identifier`,name:i,location:o};let d=c.flatMap(e=>e.instances).find(e=>e.name===i),f=d!==void 0&&!n&&!t&&d.params.length!==u.length;if(f&&u.length>0)throw te(`The operator ${i} requires ${d.params.length} arguments`,a);let p=[{kind:`Name`,name:i,args:u}],m=[g(e,e)];for(;Ee();)O(),m.push(g(r.index,r.index)),p.push(De());let h=p.flatMap(e=>e.kind===`Name`?[e.name]:[]),v=h.join(`!`),y=p.flatMap(e=>`args`in e?e.args:[]),b=p.map(e=>`args`in e?e.args.length:0),x=ve.range,S=h.length<p.length?{kind:`Subexpression`,selectors:p,selectorRanges:m,location:o}:y.length===0?{kind:`Identifier`,name:v,selectorRanges:m,location:o}:b.slice(0,-1).some(e=>e>0)?{kind:`Apply`,operator:v,args:y,argumentCounts:b,argumentsRange:x,selectorRanges:m,location:o}:{kind:`Apply`,operator:v,args:y,argumentsRange:x,selectorRanges:m,location:o};return f&&_e.set(S,{location:_(g(e)),message:`The operator ${i} requires ${d.params.length} arguments.`}),S}if(a.kind===`Operator`&&rl(a.text)&&D(`(`))return{kind:`Apply`,operator:a.text,args:ye(),location:o};switch(a.text){case`(`:{let e=se(()=>N());return A(`)`),e}case`[`:return xe(a);case`{`:return Se(a);case`<<`:return Ce(a);case`@`:return{kind:`ExceptAt`,location:o};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return we(a);case`IF`:{let e=N();A(`THEN`);let t=N();return A(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:N(),location:o}}case`CASE`:return Te(a);case`LET`:{let e=[],n=[];for(i.push(/* @__PURE__ */ new Set);!k(`IN`);){if(t&&D(`RECURSIVE`))throw te(`Unexpected keyword RECURSIVE`,C(y()));if(k(`RECURSIVE`)){Le();continue}let r=Me(!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:o}:{kind:`Let`,definitions:e,instances:n,body:r,location:o}}case`CHOOSE`:{let e=de(),t=k(`\\in`)?N():void 0;return A(`:`),{kind:`Choose`,pattern:e,set:t,body:N(),location:o}}case`WF_`:case`SF_`:{let e=M(),t=se(()=>{A(`(`);let e=N();return A(`)`),e});return{kind:a.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:o}}}throw E(`Unexpected ${x(a)}`,a)},ke=()=>{let e=b(),t=u(e);if(e.kind===`Operator`&&(e.text===`/\\`||e.text===`\\/`))return be();if(e.kind===`Operator`||e.kind===`Keyword`)switch(e.text){case`~`:return O(),{kind:`Apply`,operator:`~`,args:[N(5)],location:t};case`-`:return O(),{kind:`Apply`,operator:`-.`,args:[N(13)],location:t};case`[]`:return O(),{kind:`Always`,expression:N(16),location:t};case`<>`:return O(),{kind:`Eventually`,expression:N(16),location:t};case`ENABLED`:return O(),{kind:`Enabled`,expression:N(16),location:t};case`UNCHANGED`:return O(),{kind:`Unchanged`,expression:N(16),location:t};case`SUBSET`:case`UNION`:case`DOMAIN`:return O(),{kind:`Apply`,operator:e.text,args:[N(9)],location:t}}return Oe()},N=(e=0)=>{let t=r.index,n=ke(),i={left:n.location.range?n:v(n,t),previous:void 0};for(;;){let n=b();if(n.kind!==`Operator`)break;let r=u(n);if(n.text===`'`&&e<=15){O(),i.left=v({kind:`Prime`,expression:i.left,location:r},t);continue}if(Qc.has(n.text)&&e<=15){O(),i.left=v({kind:`Apply`,operator:n.text,args:[i.left],location:r},t);continue}if(n.text===`[`){O();let e=se(()=>ce(()=>N()));se(()=>A(`]`)),i.left=v({kind:`FunctionApplication`,function:i.left,args:e,location:r},t);continue}if(n.text===`.`&&re(b(1))){O();let e=O().text;i.left=v({kind:`FieldAccess`,record:i.left,field:e,location:r},t);continue}let a=Zc.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 te(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(O(),a.low>12&&D(`-`))throw te(`Precedence conflict between ${n.text} and -`,b());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=v(i.left,t),i.previous={...a,text:n.text}}return i.left},Ae=()=>{if(!k(`(`))return[];let e=Ie();return A(`)`),e},je=()=>{let e=u(b()),t=N(),i=n[r.index-1],a={line:i.line,column:i.endColumn};return{body:t,bodyRange:{module:c[0].name,start:e,end:a}}},Me=e=>{let t=r.index;return v(P(e),t)},Ne=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),P=e=>{let t=b(),n=u(t),i=(t,r)=>({kind:`Operator`,name:t,params:r,...je(),isLocal:e,isRecursive:l(t),location:n});if(t.kind===`Identifier`&&b(1).kind===`Operator`&&Zc.has(b(1).text)&&b(2).kind===`Identifier`&&D(`==`,3)){let e=ae(),t=O().text,n=ae();return A(`==`),i(t,[Ne(e),Ne(n)])}let a=t.kind===`Operator`&&t.text===`-.`,o=t.kind===`Identifier`&&Qc.has(b(1).text)&&D(`==`,2);if(a||o){let e=a?t.text:b(1).text;a&&O();let n=ae();return o&&O(),A(`==`),i(e,[Ne(n)])}let s=ie();if(k(`[`)){let t=se(()=>pe());return A(`]`),A(`==`),{kind:`Function`,name:s,bounds:t,body:N(),isLocal:e,isRecursive:l(s),location:n}}let c=r.index,d=Ae();return A(`==`),D(`INSTANCE`)?{...Pe(s,d,e,n),definitionRange:g(c)}:i(s,d)},Pe=(e,t,n,i)=>{let a=r.index;return A(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ie(),substitutions:k(`WITH`)?ce(()=>{let e=O().text;return A(`<-`),{name:e,expression:ge()}}):[],isLocal:n,location:i,instanceRange:g(a)}},Fe=()=>{let e=r.index;return v(F(),e)},F=()=>{let e=u(b());if(D(`_`)&&b(1).kind===`Operator`)return O(),{name:O().text,arity:k(`_`)?2:1,location:e};if(b().kind===`Operator`&&D(`_`,1)){let t=O().text;return O(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=ie();if(!k(`(`))return{name:t,arity:0,location:e};let n=ce(()=>A(`_`));return A(`)`),{name:t,arity:n.length,location:e}},Ie=()=>ce(Fe),Le=()=>{let e=Ie();return e.forEach(e=>i[i.length-1].add(e.name)),e},I=e=>{let t={value:0,offset:e};do{let e=b(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&hl.has(e.text)&&t.value++,e.kind===`Operator`&&gl.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},L=()=>{let e=b(),t=b(1);return e.kind===`Identifier`?D(`(`,1)||D(`[`,1)?D(`==`,I(1)):t.kind===`Operator`&&Qc.has(t.text)?D(`==`,2):t.kind===`Operator`&&Zc.has(t.text)?b(2).kind===`Identifier`&&D(`==`,3):D(`==`,1):D(`-.`)&&t.kind===`Identifier`&&D(`==`,2)},R=[],z=()=>R[R.length-1]??-1,B=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),Re=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)},V=e=>!e.text.endsWith(`.`)&&!dl.has(Re(e)),H=e=>{let t=Re(e);if(dl.has(t))return;let n=B(e);if(n>=0)return`<${n}>${t}`;let r=z(),i=R[R.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},U=e=>{if(e.kind===`Keyword`)return cl.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return R.length===0;if(e.text[1]===`+`||R.length===0)return!0;let t=z();return t>=0&&B(e)>t},W=e=>{let t=B(e),n=R.length-1,r=R[n-1]??-1,i=R[n]<0;return i&&(R[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:R[n]===t},ze=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)),Be=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!_l.has(e.name)&&!ze(e.name):!1,Ve=()=>{let e=b();return e.kind===`Step`?V(e):e.kind===`Keyword`?fl.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!L()},He=()=>{let e=r.index;s.index=e;let t=b();return t.kind===`Operator`&&!el.has(t.text)&&rl(t.text)?(r.index++,v({kind:`OperatorReference`,operator:t.text,location:u(t)},e)):k(`MODULE`)?v({kind:`ModuleFact`,name:ie(),location:u(t)},e):N()},Ue=e=>o[o.length-1]?.add(e),We=e=>{o.push(/* @__PURE__ */ new Set);let t=e();return o.pop(),t},Ge=e=>o.some(t=>t.has(e))||c.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),Ke=()=>{let e=r.index,t=b(),n=ce(()=>{let e=b();if((e.kind!==`Identifier`||w(e))&&e.kind!==`Operator`)throw E(`Expected a definition name but found ${x(e)}`,e);return r.index++,e.text},`!`),i=u(t);return v(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:i}:{kind:`Identifier`,name:n.join(`!`),location:i},e)},qe=()=>{if(t)return ce(Ke);let e=ce(He),n=e.find(e=>e.kind===`Identifier`&&Ge(e.name));if(n)throw te(`DEF clause entry should describe a defined operator`,n.location);return e},Je=()=>({facts:Ve()?ce(He):[],defs:k(`DEF`)||k(`DEFS`)?qe():[]}),Ye=()=>{let e=r.index,n=O(),i=n.text===`USE`&&k(`ONLY`),a=g(e),o={kind:n.text===`USE`?`Use`:`Hide`,isOnly:i,...Je(),keyword:a,location:u(n)},s=o.kind===`Hide`&&!t?o.facts.filter(e=>!Be(e)):[];if(s.length>0)throw m(s.map(t=>({location:_(t.location.range??g(e)),message:`The only expression allowed as a fact in a HIDE is
104
+ the name of a theorem, assumption, or step.`})));return v(o,e)},Xe=()=>{let e=r.index,t=u(b()),n=k(`NEW`),i=b().kind===`Keyword`?pl.get(b().text):void 0;if(!n&&i===void 0)throw E(`Expected a declaration but found ${x(b())}`);if(i!==void 0&&O(),i===`Variable`){let n=ae();return Ue(n.name),v({kind:`NewSymbol`,name:n.name,arity:0,level:i,set:void 0,nameRange:n.range,location:t},e)}let a=Fe();Ue(a.name);let o=(i??`Constant`)===`Constant`&&D(`\\in`);if(o&&a.arity>0)throw te(`declared symbol with arguments before \\in`);return o&&O(),v({kind:`NewSymbol`,name:a.name,arity:a.arity,level:i??`Constant`,set:o?N():void 0,nameRange:a.location.range,location:t},e)},Ze=()=>{let e=r.index,t=u(A(`ASSUME`)),n=ce(()=>D(`ASSUME`)?We(Ze):b().kind===`Keyword`&&ml.has(b().text)?Xe():N());return A(`PROVE`),v({kind:`AssumeProve`,assumptions:n,conclusion:N(),location:t},e)},Qe=e=>{let t={value:0};for(;b(t.value).kind===`Identifier`&&D(`,`,t.value+1);)t.value+=2;return b(t.value).kind===`Identifier`&&D(e,t.value+1)},$e=(e,t)=>{e.forEach(Ue),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(Ue))},et=()=>{let e=b();if(D(`USE`)||D(`HIDE`))return Ye();if(D(`INSTANCE`))return v(Pe(void 0,[],!1,u(e)),r.index);if(D(`DEFINE`)||L()){let t=r.index;k(`DEFINE`);let n=[Me(!1)];for(;L();)n.push(Me(!1));let i={kind:`Define`,definitions:n,location:u(e)};return v(i,t)}if(k(`HAVE`))return{kind:`Have`,expression:N()};if(k(`TAKE`)){let e=le(),t=oe(e?[]:ce(ae)),n=e?pe():[];return $e(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(k(`WITNESS`))return{kind:`Witness`,expressions:ce(()=>N())};if(k(`PICK`)){let e=Qe(`:`),t=oe(e?ce(ae):[]),n=e?[]:pe();return $e(t.names,n),A(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:N()}}return k(`CASE`)?{kind:`Case`,expression:N()}:{kind:`Assert`,isSuffices:k(`SUFFICES`),statement:D(`ASSUME`)?Ze():N()}},tt=e=>{let t=b();if(t.kind!==`Step`)throw E(`Expected a step number but found ${x(t)}`,t);if(!W(t))throw te(`${e?`QED step`:`step`}'s number has bad level`,t);if(B(t)<0&&H(t)!==void 0)throw te(`<*> and <+> cannot be used for a named step`,t);return r.index++,{name:H(t),token:t.text,location:u(t)}},nt=()=>{let e=r.index,t=tt(D(`QED`,1)),n=r.index,i=/* @__PURE__ */ new Set;o.push(i);let a=k(`QED`)?{kind:`Qed`}:et(),s=g(e),c=g(n),l=U(b());if(l&&!ll.has(a.kind))throw te(`Proof of a step that does not take a proof`);let u=l?G():void 0;return o.pop(),(a.kind!==`Assert`||a.isSuffices)&&i.forEach(Ue),v({...t,body:a,head:s,statement:c,proof:u},e)},rt=()=>{let e=u(b());if(D(`BY`)||D(`PROOF`)&&D(`BY`,1)){k(`PROOF`),O();let t=g(r.index-1);return{kind:`By`,isOnly:k(`ONLY`),...Je(),keyword:t,location:e}}let t=b(+!!D(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){k(`PROOF`),O();let n=g(r.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}k(`PROOF`);let n=[nt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(nt());return{kind:`Steps`,level:z(),steps:n,location:e}},G=()=>{let e=r.index;R.push(-1);let t=We(rt);return R.pop(),v(t,e)},K=e=>{let t=r.index,n=O(),i=b().kind===`Identifier`&&D(`==`,1)?ie():void 0;i!==void 0&&(a.add(i),O());let o=We(()=>({statement:D(`ASSUME`)?Ze():N(),proof:U(b())?G():void 0})),s=o.statement,c=v({name:i,statement:s,proof:o.proof,location:u(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),i!==void 0&&s.kind!==`AssumeProve`&&e.definitions.push(v({kind:`Operator`,name:i,params:[],body:s,isLocal:!1,isRecursive:!1,location:u(n)},t))},it=()=>{let e=r.index;return v(at(),e)},at=()=>{let e=O(),t=u(e),n=e.text===`AXIOM`;if(b().kind===`Identifier`&&D(`==`,1)){let e=ie();return a.add(e),O(),{name:e,expression:N(),isAxiom:n,location:t}}return{name:void 0,expression:N(),isAxiom:n,location:t}},ot=()=>{let e=u(A(`----`));A(`MODULE`);let t=ie();A(`----`);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),k(`EXTENDS`)&&ce(()=>{let e=r.index;n.extends.push(ie()),n.extendsRanges.push(g(e))});;){let t=r.index;S.index=t;let a=b();if(a.kind===`ModuleEnd`||a.kind===`End`){if(a.kind===`ModuleEnd`&&(e.range={module:c[0].name,start:{line:e.line,column:e.column},end:{line:a.line,column:a.endColumn}}),_e.size>0)throw m([..._e.values()]);return c.pop(),i.pop(),n}if(a.kind===`Separator`){if(D(`MODULE`,1)){let e=ot();n.modules.push(e),n.units.push({kind:`Module`,module:e}),A(`====`);continue}O()}else{switch(a.text){case`CONSTANT`:case`CONSTANTS`:{O();let e=Ie();n.constants.push(...e),n.units.push({kind:`Constants`,declarations:e});continue}case`VARIABLE`:case`VARIABLES`:{O();let e=ce(()=>{let e=r.index,t=u(b());return v({name:ie(),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=it();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=Ye();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:O(),n.units.push({kind:`Recursive`,declarations:Le()});continue;case`INSTANCE`:st(n,v(Pe(void 0,[],!1,u(a)),t));continue;case`LOCAL`:if(O(),D(`INSTANCE`)){st(n,v(Pe(void 0,[],!0,u(a)),t));continue}st(n,v(P(!0),t));continue}a.kind===`Keyword`&&sl.has(a.text)?K(n):st(n,Me(!1))}}},st=(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 ot()},xl=e=>bl(e,!1),Sl=e=>bl(e,!0),Cl=25214903917n,wl=(1n<<48n)-1n,Tl=2147483647,El=e=>{let t={value:(BigInt.asUintN(64,e)^Cl)&wl},n=e=>(t.value=t.value*Cl+11n&wl,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Cl)&wl},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<=Tl)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Dl=10454148508367108822n,Ol=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Dl);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),kl=Int32Array.from(Ol,e=>Number(BigInt.asIntN(32,e>>32n))),Al=Int32Array.from(Ol,e=>Number(BigInt.asIntN(32,e))),jl=Number(BigInt.asIntN(32,Dl>>32n)),Ml=Number(BigInt.asIntN(32,Dl));let Nl=jl,Pl=Ml;const Fl=e=>{let t=(e^Pl)&255;Pl=(Pl>>>8|Nl<<24)^Al[t],Nl=Nl>>>8^kl[t]},Il=e=>{for(let t=0;t<32;t+=8)Fl(e>>>t)},Ll=e=>{if(typeof e==`boolean`)Fl(0),Fl(e?116:102);else if(typeof e==`number`)Fl(1),Il(e);else if(typeof e==`string`){Fl(3),Il(e.length);for(let t=0;t<e.length;t++)Fl(e.charCodeAt(t))}else if(Pe(e))Fl(21),Il(He(e.name)+1);else if(P(e)){let t=xn(e);Fl(9),Il(t.domain.length);for(let e=0;e<t.domain.length;e++)Ll(t.domain[e]),Ll(t.range[e])}else{let t=q(e).elements;Fl(5),Il(t.length);for(let e of t)Ll(e)}},Rl=e=>{let t={high:Nl,low:Pl};Nl=jl,Pl=Ml;for(let t of e)Ll(t);let n=BigInt(Nl>>>0)<<32n|BigInt(Pl>>>0);return Nl=t.high,Pl=t.low,n},zl=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||Pe(e))return 5;if(typeof e==`string`)return 5+e.length;if(P(e)){let t=xn(e);return t.domain.reduce((e,n,r)=>e+zl(n)+zl(t.range[r]),5)}return q(e).elements.reduce((e,t)=>e+zl(t),5)},Bl=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){Nl=n<32?0:1<<n-32,Pl=n<32?1<<n:0;for(let t=0;t<e;t++)Fl(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]^Nl,t[n+1]=t[a+1]^Pl}}return t},Vl=(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=zl(e);return Nl=0,Pl=0,Ll(e),r.set(e,i.length),i.push(n,Nl,Pl),i.length-3},o=e=>{let t=n.get(e);if(t)return t;let r=Bl(e);return n.set(e,r),r};return(n,r)=>{let s={high:Nl,low:Pl},c={high:jl,low:Ml};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}Nl=s.high,Pl=s.low,t[2*r]=c.low,t[2*r+1]=c.high}},Hl=[],Ul=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Wl=()=>{for(let e=1277011;Hl.length<1341;e++)Ul(e)&&Hl.push(e);return Hl},Gl=e=>{let t=Wl(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},Kl=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},ql=e=>{for(let t=Math.max(e,9);;t++){let e=Kl(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)}}},Jl=(e,t,n)=>{if(t<=0)return[];let r=ql(t),i={index:BigInt(n.nextInt(t))},a=BigInt(Gl(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},Yl=(1n<<63n)-1n-24n,Xl=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Yl*BigInt(n)+i)%t;return r<0n?r+t:r})},Zl=(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,Ql=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Vt(e.domain),n=q(e.range).elements;return{lists:t.map(()=>n),create:e=>$e(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>q(e).elements),create:t=>Wt(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>q(e).elements),create:Ut}}},$l=(e,t,n)=>{if(cn(t))return[];if(typeof t==`object`&&t.kind===`Interval`)return Jl(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let r=Ql(t);if(r){let t=r.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Tl)?Xl(e,t,n):Jl(e,Number(t),n)).map(e=>r.create(Zl(r.lists,e)))}let i=q(t).elements;return Jl(e,i.length,n).map(e=>i[Number(e)])},eu=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new b(`RandomElement of the empty set`);return n},tu=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...Vt(e.domain)];return $e(n,n.map(()=>tu(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Wt(e.names.map((n,r)=>[n,tu(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return Ut(e.factors.map(e=>tu(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 b(`RandomElement of the empty set`);return e.low+r}return eu(q(e).elements,t)},nu=(e,t=0n)=>{let n=El(t),r={random:El(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Wt([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Rl,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},ru=e=>Nt([...e.possibleCounts].map(([e,t])=>[e,t])),iu=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,ru(e)]]),au=[[38,[`ACTION`,`ACTIONS`]],[39,[`ASSUME`]],[40,[`[]ASSUME`]],[41,[`ASSUMPTION`,`AXIOM`]],[42,[`CASE`]],[43,[`CHOOSE`]],[44,[`CONSTANT`,`CONSTANTS`]],[45,[`ELSE`]],[46,[`EXCEPT`]],[47,[`\\E`,`\\exists`,`∃`]],[48,[`EXTENDS`]],[49,[`\\A`,`\\forall`,`∀`]],[50,[`IF`]],[51,[`INSTANCE`]],[52,[`LET`]],[53,[`IN`]],[54,[`LOCAL`]],[55,[`MODULE`]],[56,[`NEW`]],[57,[`OTHER`]],[58,[`PROPOSITION`,`LEMMA`,`COROLLARY`]],[59,[`SF_`]],[60,[`\\EE`]],[61,[`\\AA`]],[62,[`THEN`]],[63,[`BY`]],[64,[`ONLY`]],[65,[`DEFINE`]],[66,[`DEF`,`DEFS`]],[67,[`THEOREM`]],[68,[`USE`]],[69,[`HIDE`]],[70,[`HAVE`]],[71,[`OBVIOUS`]],[72,[`OMITTED`]],[73,[`LAMBDA`]],[74,[`TAKE`]],[75,[`PROOF`]],[76,[`PROVE`]],[77,[`[]PROVE`]],[78,[`QED`]],[79,[`RECURSIVE`]],[80,[`STATE`]],[81,[`TEMPORAL`,`TEMPORALS`]],[82,[`PICK`]],[83,[`WITNESS`]],[84,[`SUFFICES`]],[85,[`VARIABLE`,`VARIABLES`]],[86,[`WF_`]],[87,[`WITH`]],[88,[`,`]],[89,[`:`]],[90,[`::`,`∷`]],[91,[`.`]],[92,[`_`]],[93,[`==`,`≜`]],[94,[`(`]],[95,[`)`]],[96,[`-|-`]],[97,[`[`]],[98,[`]_`]],[99,[`]`]],[100,[`{`]],[101,[`}`]],[102,[`<<`,`⟨`]],[103,[`>>_`,`⟩_`]],[104,[`>>`,`⟩`]],[105,[`!`]],[106,[`->`,`→`]],[107,[`<-`,`←`]],[108,[`|->`,`↦`]],[113,[`'`]],[114,[`^+`,`⁺`]],[115,[`^*`]],[116,[`^#`]],[117,[`-.`]],[118,[`\\lnot`,`¬`]],[119,[`\\neg`]],[120,[`~`]],[121,[`[]`,`□`]],[122,[`<>`,`◇`]],[123,[`ENABLED`]],[124,[`UNCHANGED`]],[125,[`SUBSET`]],[126,[`UNION`]],[127,[`DOMAIN`]],...[`//`,`/\\`,`/=`,`/`,`\\/`,`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`,`\\in`,`\\intersect`,`\\union`,`\\land`,`\\leq`,`\\ll`,`\\lor`,`\\o`,`\\odot`,`\\ominus`,`\\oplus`,`\\oslash`,`\\otimes`,`\\prec`,`\\preceq`,`\\propto`,`\\sim`,`\\simeq`,`\\sqcap`,`\\sqcup`,`\\sqsubset`,`\\sqsupset`,`\\sqsubseteq`,`\\sqsupseteq`,`\\star`,`\\subset`,`\\subseteq`,`\\succ`,`\\succeq`,`\\supset`,`\\supseteq`,`\\uplus`,`\\wr`,`\\`,`~>`,`=>`,`=<`,`=|`,`=`,`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`,`-`,`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`,`\\X`].map((e,t)=>[128+t,[e]]),[129,[`∧`]],[132,[`∨`]],[147,[`∈`]]],ou=(()=>{let e=/* @__PURE__ */ new Map;for(let t of au)for(let n of t[1])e.set(n[0],[...e.get(n[0])??[],[t[0],n]]);return e})(),su=/-{4,} *MODULE/y,cu=[/[0-9][A-Za-z0-9]*\.\/\\/y,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*\.\/\\/y,/[a-zA-RT-VX-Z][A-Za-z0-9]*\.\/\\/y],lu=[/[0-9][A-Za-z0-9]*\.\\\//y,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*\.\\\//y,/[a-zA-RT-VX-Z][A-Za-z0-9]*\.\\\//y],uu=[/_[A-Za-z0-9_]*[A-Za-z][A-Za-z0-9_]*/y,/[0-9][A-Za-z0-9_]*[A-Za-z][A-Za-z0-9_]*/y,/[WS](?:[a-zA-EG-Z_0-9][A-Za-z0-9_]*)?/y,/[WS]F(?:[A-Za-z0-9][A-Za-z0-9_]*)?/y,/[a-zA-RT-VX-Z][A-Za-z0-9_]*/y,/[@ℕℤℝ]/y],du=[[35,[su]],[36,[/-{4,}/y]],[37,[/={4,}/y]],[109,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[110,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[111,cu],[112,lu],[289,uu],[290,[/<[0-9]+>[A-Za-z0-9_]+/y]],[291,[/<[+*]>[A-Za-z0-9]+/y]],[292,[/<(?:[0-9]+|\+|\*)>[A-Za-z0-9_]+\.+/y]],[293,[/<(?:[0-9]+|\+|\*)>/y]],[294,[/<(?:[0-9]+|\+|\*)>(?:\*\.*|-\.*|\.+)/y]]],fu=[[20,[/[0-9]+/y]],[21,[su]],[111,cu],[112,lu],[289,uu]],pu=(e,t,n)=>Math.max(0,...e.map(e=>(e.lastIndex=n,e.exec(t)?.[0].length??0))),mu=(e,t,n,r)=>{let i=n.map(([n,r])=>[n,pu(r,e,t)]);if(r)for(let[n,r]of ou.get(e[t])??[])e.startsWith(r,t)&&i.push([n,r.length]);return i.reduce((e,t)=>t[1]>e[1]||t[1]===e[1]&&t[1]>0&&t[0]<e[0]?t:e,[0,0])},hu=(e,t)=>{if(e[t]===`?`)return 1;if(e[t]!==`"`)return 0;let n=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y;return n.lastIndex=t,n.exec(e)?.[0].length??0},gu=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
105
+ `,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`],[`\0`,``]]),_u=e=>e.split(``).map(e=>{let t=e.charCodeAt(0);return gu.get(e)??(t<32||t>126?`\\u${t.toString(16).padStart(4,`0`)}`:e)}).join(``),vu=e=>{let t=[],n=[],r={line:1,column:0,isAfterCarriageReturn:!1,isAfterLineFeed:!1};for(let i of e.split(``))r.column++,r.isAfterLineFeed?(r.isAfterLineFeed=!1,r.line++,r.column=1):r.isAfterCarriageReturn&&(r.isAfterCarriageReturn=!1,i===`
106
+ `?r.isAfterLineFeed=!0:(r.line++,r.column=1)),i===`\r`&&(r.isAfterCarriageReturn=!0),i===`
107
+ `&&(r.isAfterLineFeed=!0),i===` `&&(r.column=r.column-1+(8-(r.column-1)%8)),t.push(r.line),n.push(r.column);let i={state:0,index:0,commentDepth:0},a=(r,i,a)=>({kind:r,image:e.slice(i,a),beginLine:t[i],beginColumn:n[i],endLine:t[a-1],endColumn:n[a-1],next:void 0}),o=(r,i,a)=>{if(a!==void 0&&a+1<e.length)throw new g(`Lexical error at line ${t[a]}, column ${n[a]}. Encountered: "${_u(e[a])}" (${e.charCodeAt(a)}), after : "${_u(i)}"`);let o=e.length-1,s=e[o]===`
108
+ `||e[o]===`\r`,c=`Lexical error at line ${s?t[o]+1:t[o]}, column ${s?0:n[o]+1}. Encountered: <EOF> after : "${_u(i)}"`;throw new g(t[r]===t[o]?c:`Lexical {error: EOF reached, possibly open comment starting around line ${t[r]}`)},s=t=>{for(;;){if(i.index>=e.length)return o(t,``,void 0);let n=e.startsWith(`(*.`,i.index)?3:e.startsWith(`(*`,i.index)?2:0;if(i.state===5){let t=e.startsWith(`\r
109
+ `,i.index)?2:+(e[i.index]===`
110
+ `||e[i.index]===`\r`);if(t>0){i.index+=t,i.state=2;return}}else if(n>0){i.index+=n,i.commentDepth++,i.state=4;return}else if(e.startsWith(`*)`,i.index)){i.index+=2,i.state===3?i.state=2:(i.commentDepth--,i.commentDepth===0&&(i.state=3));return}i.index++}};return{getNextToken:()=>{for(;;){if(i.index>=e.length){let r=e.length-1;return{kind:0,image:``,beginLine:t[r]??0,beginColumn:n[r]??0,endLine:t[r]??0,endColumn:n[r]??0,next:void 0}}let r=i.index;if(i.state===0){let t=e.startsWith(`--->`,i.index)?4:0;su.lastIndex=i.index;let n=su.exec(e)?.[0].length??0;if(n>0&&n>=t)return i.index+=n,i.state=2,a(3,r,i.index);if(t>0)return i.index+=t,i.state=1,a(2,r,i.index);i.index++;continue}if(i.state===1){let[t,n]=mu(e,i.index,fu,!1);if(n===0){i.index++;continue}return i.index+=n,t===21&&(i.state=2),a(t,r,i.index)}if(i.state!==2){s(r);continue}if(`
111
+ \r`.includes(e[i.index])){i.index++;continue}if(e.startsWith(`(*`,i.index)||e.startsWith(`\\*`,i.index)){i.state=e[i.index]===`(`?3:5,i.index+=e.startsWith(`(*.`,i.index)?3:2,s(r);continue}let[c,l]=mu(e,i.index,du,!0);if(l===0){let t=hu(e,i.index),n=i.index+t;return n<e.length?o(r,n+1<e.length||t===0?e.slice(r,n):e.slice(r,n+1),n):o(r,t<=1?``:e.slice(r),void 0)}return i.index+=l,a(c,r,i.index)}}}},yu=2147483647,bu=-2147483648,xu=(e,t)=>Array.from({length:t-e+1},(t,n)=>e+n),Su=xu(118,127),Cu=xu(117,127),wu=xu(128,288),Tu=xu(113,116),Eu=xu(290,294),Du=[42,43,47,49,50,52,60,61],Ou=new Set(xu(113,291)),ku=/* @__PURE__ */ new Set([59,86,94,97,100,102]),Au=/* @__PURE__ */ new Set([38,44,56,80,81,85]),ju=/* @__PURE__ */ new Set([92,...Cu]),Mu=/* @__PURE__ */ new Set([`Tuple`,`ParenExpr`,`SetEnumerate`,`SubsetOf`,`SetOfAll`,`SetOfFcns`,`RcdConstructor`,`SetOfRcds`,`Except`,`FcnConst`,`ActionExpr`]),Nu=[[`[`,160,160,`left`,`postfix`],[`.`,170,170,`left`,`infix`],[`'`,150,150,`none`,`postfix`],[`^`,140,140,`none`,`infix`],[`/`,130,130,`none`,`infix`],[`*`,130,130,`left`,`infix`],[`-`,110,110,`left`,`infix`],[`-.`,120,120,`none`,`prefix`],[`+`,100,100,`left`,`infix`],[`=`,50,50,`none`,`infix`],[`\\lnot`,40,40,`left`,`prefix`],[`\\land`,30,30,`left`,`infix`],[`\\lor`,30,30,`left`,`infix`],[`~>`,20,20,`none`,`infix`],[`=>`,10,10,`none`,`infix`],[`[]`,40,150,`none`,`prefix`],[`<>`,40,150,`none`,`prefix`],[`ENABLED`,40,150,`none`,`prefix`],[`UNCHANGED`,40,150,`none`,`prefix`],[`SUBSET`,100,130,`none`,`prefix`],[`UNION`,100,130,`none`,`prefix`],[`DOMAIN`,100,130,`none`,`prefix`],[`^+`,150,150,`none`,`postfix`],[`^*`,150,150,`none`,`postfix`],[`^#`,150,150,`none`,`postfix`],[`\\cdot`,50,140,`left`,`infix`],[`\\equiv`,20,20,`none`,`infix`],[`-+->`,20,20,`none`,`infix`],[`/=`,50,50,`none`,`infix`],[`\\subseteq`,50,50,`none`,`infix`],[`\\in`,50,50,`none`,`infix`],[`\\notin`,50,50,`none`,`infix`],[`<`,50,50,`none`,`infix`],[`\\leq`,50,50,`none`,`infix`],[`>`,50,50,`none`,`infix`],[`\\geq`,50,50,`none`,`infix`],[`\\times`,100,130,`left`,`nfix`],[`\\`,80,80,`none`,`infix`],[`\\intersect`,80,80,`left`,`infix`],[`\\union`,80,80,`left`,`infix`],[`...`,90,90,`none`,`infix`],[`..`,90,90,`none`,`infix`],[`|`,100,110,`left`,`infix`],[`||`,100,110,`left`,`infix`],[`&&`,130,130,`left`,`infix`],[`&`,130,130,`left`,`infix`],[`$$`,90,130,`left`,`infix`],[`$`,90,130,`left`,`infix`],[`??`,90,130,`left`,`infix`],[`%%`,100,110,`left`,`infix`],[`%`,100,110,`none`,`infix`],[`##`,90,130,`left`,`infix`],[`++`,100,100,`left`,`infix`],[`--`,110,110,`left`,`infix`],[`**`,130,130,`left`,`infix`],[`//`,130,130,`none`,`infix`],[`^^`,140,140,`none`,`infix`],[`@@`,60,60,`left`,`infix`],[`!!`,90,130,`none`,`infix`],[`|-`,50,50,`none`,`infix`],[`|=`,50,50,`none`,`infix`],[`-|`,50,50,`none`,`infix`],[`=|`,50,50,`none`,`infix`],[`<:`,70,70,`none`,`infix`],[`:>`,70,70,`none`,`infix`],[`:=`,50,50,`none`,`infix`],[`::=`,50,50,`none`,`infix`],[`\\oplus`,100,100,`left`,`infix`],[`\\ominus`,110,110,`left`,`infix`],[`\\odot`,130,130,`left`,`infix`],[`\\oslash`,130,130,`none`,`infix`],[`\\otimes`,130,130,`left`,`infix`],[`\\uplus`,90,130,`left`,`infix`],[`\\sqcap`,90,130,`left`,`infix`],[`\\sqcup`,90,130,`left`,`infix`],[`\\div`,130,130,`none`,`infix`],[`\\wr`,90,140,`none`,`infix`],[`\\star`,130,130,`left`,`infix`],[`\\o`,130,130,`left`,`infix`],[`\\bigcirc`,130,130,`left`,`infix`],[`\\bullet`,130,130,`left`,`infix`],[`\\prec`,50,50,`none`,`infix`],[`\\succ`,50,50,`none`,`infix`],[`\\preceq`,50,50,`none`,`infix`],[`\\succeq`,50,50,`none`,`infix`],[`\\sim`,50,50,`none`,`infix`],[`\\simeq`,50,50,`none`,`infix`],[`\\ll`,50,50,`none`,`infix`],[`\\gg`,50,50,`none`,`infix`],[`\\asymp`,50,50,`none`,`infix`],[`\\subset`,50,50,`none`,`infix`],[`\\supset`,50,50,`none`,`infix`],[`\\supseteq`,50,50,`none`,`infix`],[`\\approx`,50,50,`none`,`infix`],[`\\cong`,50,50,`none`,`infix`],[`\\sqsubset`,50,50,`none`,`infix`],[`\\sqsubseteq`,50,50,`none`,`infix`],[`\\sqsupset`,50,50,`none`,`infix`],[`\\sqsupseteq`,50,50,`none`,`infix`],[`\\doteq`,50,50,`none`,`infix`],[`\\propto`,50,50,`none`,`infix`]].map(e=>({name:e[0],low:e[1],high:e[2],associativity:e[3],fix:e[4]})),Pu=[[`\\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`,`≀`],[`^+`,`⁺`]],Fu=(()=>{let e=new Map(Nu.map(e=>[e.name,e]));for(let t of Pu){let n=e.get(t[0]);if(n)for(let r of t.slice(1))e.set(r,n)}return e})(),Iu=Fu.get(`[`),Lu={name:`$$_void`,low:0,high:0,associativity:`none`,fix:`infix`},Ru=e=>e.fix===`prefix`?e:Fu.get(`${e.name}.`),zu=e=>e.fix===`infix`||e.fix===`nfix`,Bu=(e,t)=>e.low>t.high,Vu=(e,t)=>e.high<t.low,Hu=e=>e!==void 0&&e.kind>=113&&e.kind<=288,Uu=e=>e!==void 0&&e.kind>=128&&e.kind<=288,Wu=(e,t)=>{let n=e[t];if(n.kind===95||n.kind===99){let n={index:t,depth:1};for(;n.index>0;){n.index--;let t=e[n.index].kind,r=t===94||t===97;if(r&&n.depth===1)break;r&&n.depth--,(t===95||t===99)&&n.depth++}return n.index>0&&e[n.index-1].kind===289?n.index-1:n.index}if(n.kind===289){let n=e[t-1];return!Hu(n)||n.kind>=113&&n.kind<=116||Uu(n)&&e[t-2]?.kind!==289||e[t-2]?.kind===107?t:Uu(n)?t-2:t-1}return Hu(n)?t-1:t},Gu=e=>e.kind>=38&&e.kind<=46||e.kind===48||e.kind>=50&&e.kind<=59||e.kind===80||e.kind>=62&&e.kind<=87||e.kind===92||e.kind>=123&&e.kind<=127,Ku=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1,e.image.indexOf(`>`))),qu=e=>{let t=vu(e),n=[],r={kind:0,image:``,beginLine:0,beginColumn:0,endLine:0,endColumn:0,next:void 0},i={token:r,nextKind:-1,generation:0,expectedGeneration:-1,moduleName:void 0,expecting:``,lastOperator:void 0,fairnessHook:void 0,proofDepth:-1,operatorStack:void 0},a={scanPosition:r,lastPosition:r,remaining:0,isSucceeded:!1,isLookingAhead:!1,isRescanning:!1,endPosition:0,longestExpected:0},o=[],s=[],c=[],l=[],u=[],d=e=>e.next??=t.getNextToken(),f=e=>Array.from({length:e}).reduce(e=>d(e),a.isLookingAhead?a.scanPosition:i.token),p=()=>i.nextKind===-1?i.nextKind=d(i.token).kind:i.nextKind,m=()=>(i.expectedGeneration=i.generation,!1),h=e=>p()===e||m(),_=e=>`line ${e.location[0]}, col ${e.location[1]} to line ${e.location[2]}, col ${e.location[3]} of module ${i.moduleName??`null`}`,v=e=>new g(`***Parse Error***\n${i.expecting===``?``:`Was expecting "${i.expecting}"\n`}${e}\n\nResidual stack trace follows:\n${s.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``)}`),y=e=>{e>=100||(e===a.endPosition+1?a.endPosition++:a.endPosition!==0&&(a.longestExpected=Math.max(a.longestExpected,a.endPosition),e!==0&&(a.endPosition=e)))},b=(e,t)=>e===void 0||t>=100?void 0:e===a.scanPosition?t:b(e.next,t+1),x=e=>{a.scanPosition===a.lastPosition&&(a.remaining--,a.lastPosition=d(a.scanPosition)),a.scanPosition=d(a.scanPosition);let t=a.isRescanning?b(i.token,0):void 0;return t!==void 0&&y(t),e.has(a.scanPosition.kind)?(a.remaining===0&&a.scanPosition===a.lastPosition&&(a.isSucceeded=!0),!0):!1},S=e=>{if(typeof e!=`number`)return e;let t=/* @__PURE__ */ new Set([e]);return()=>x(t)},C=(...e)=>{let t=new Set(e);return()=>x(t)},w=(...e)=>{let t=e.map(S);return()=>{for(let e of t){if(!e())return!1;if(a.isSucceeded)return!0}return!0}},T=(...e)=>{let t=e.map(S);return()=>{let e=a.scanPosition;for(let n of t)if(a.scanPosition=e,n())return!0;return!1}},ee=e=>{let t=S(e);return()=>{let e=a.scanPosition;return t()||(a.scanPosition=e),!0}},te=e=>{let t=S(e);return()=>{for(;;){let e=a.scanPosition;if(!t())return a.scanPosition=e,!0;if(a.isSucceeded)return!0}}},ne=(e,t)=>{let n=S(t);return()=>{a.isLookingAhead=!0;let t=e();return a.isLookingAhead=!1,t&&n()}},E=e=>l.length===0||l[l.length-1].column<e,re=()=>E(f(1).beginColumn),D=()=>{let e=f(1),t=l.at(-1);return t!==void 0&&(e.kind===129||e.kind===132)&&t.column===e.beginColumn&&t.isConjunction===(e.kind===129)},O=()=>f(1).kind===39||f(1).kind===40,k=()=>O()||f(2).kind===90&&(f(3).kind===39||f(3).kind===40),A=()=>{let e=i.operatorStack?.at(-1)?.operator;return i.operatorStack===void 0||i.operatorStack.length===0||e!==void 0&&e.fix!==`postfix`},ie=()=>{let e=d(a.isLookingAhead?a.scanPosition:i.token);if(e.kind===102){let t={token:e,depth:1};for(;t.depth!==0;)if(t.token=d(t.token),t.token.kind===102&&t.depth++,t.token.kind===104&&t.depth--,t.token.kind===0)return!1;return d(t.token).kind===147}if(e.kind!==289)return!1;let t={token:d(e)};for(;t.token.kind===88;){let e=d(t.token);if(e.kind!==289)return!1;t.token=d(e)}return t.token.kind===147},j=()=>Me(),ae=()=>Te(),oe=w(102,ee(w(289,te(w(88,289)))),104),se=T(oe,289),ce=w(91,109),le=w(109,ee(ce)),ue=w(94,j),de=T(ne(ie,se),j,j,j),fe=w(100,ee(de),101),pe=w(97,T(ne(ie,se),289,ne(()=>f(2).kind===108&&Gu(f(1)),289),289,j)),M=w(102,ee(j),C(104,103)),me=w(C(132,129),j),he=w(ee(54),96,C(289,...Cu)),ge=T(he,79),_e=w(289,ee(94)),ve=C(92,...Cu),ye=w(94,T(ne(re,C(...Cu,...wu,...Tu)),ne(re,73),j)),be=w(56,44),xe=w(_e,ee(147)),Se=w(T(be,56,44),T(xe,ve)),Ce=w(ee(56),85,289),we=w(ee(56),C(80,38,81),T(_e,ve)),Te=w(ee(w(289,90,ae)),C(39,40),T(ne(k,ae),T(Se,Ce,we),j),te(88),C(76,77)),Ee=w(ee(96),289,93),De=w(289,93),Oe=S(75),ke=w(ee(84),T(j,ne(O,ae))),N=T(ne(re,110),ne(re,le),w(C(289,290,291,...wu,...Tu,...Cu),ee(ye),te(105))),Ae=T(ne(re,C(...Tu)),ne(re,91),ne(re,pe)),je=T(ne(re,C(...wu)),ne(re,90)),Me=w(te(C(...Su,...wu)),T(ne(re,T(w(C(47,49),T(289,se)),w(C(60,61),289),w(50,j),w(42,j),w(52,ge,te(ge)),w(43,T(289,oe)))),ne(re,w(T(ne(A,T(me,me)),T(ue,fe,pe,M,w(C(86,59),T(289,ue,fe,pe,M))),N),te(Ae),ee(je))))),Ne={moduleUnit:[T(36,85,44,he,79,w(ee(54),51,289),w(C(41,39),ee(Ee),j),w(C(67,58),ee(De),T(ne(O,ae),j)),C(35,3,21),ne(()=>f(1).kind===68&&f(2).kind!==64||f(1).kind===69,T(w(ee(75),63),68,69))),1],unitDefinition:[he,2],unitInstance:[w(ee(54),51,289),2],unitAssumption:[w(C(41,39),ee(Ee),j),2],unitTheorem:[w(C(67,58),ee(De),T(ne(O,ae),j)),2],constantArguments:[w(94,92),2],definitionBody:[j,1],functionDefinition:[w(289,97),yu],postfixDefinition:[w(289,C(...Tu)),yu],infixDefinition:[w(289,C(...wu)),yu],identifierDefinition:[w(289,C(94,93)),yu],nextSubstitution:[w(88,C(289,...Cu,...wu,...Tu),107),3],assumptionName:[Ee,2],assumeExpression:[j,1],nextAssumeExpression:[j,1],newConstant:[be,2],constantDeclaration:[xe,2],constantSymbol:[Se,2],variableSymbol:[Ce,2],levelSymbol:[we,2],theoremName:[De,2],theoremAssumeProve:[ne(O,ae),3],theoremExpression:[j,1],proofKeyword:[Oe,2],terminalProof:[w(ee(75),C(71,72)),2],stepProof:[w(ee(Oe),te(C(...Eu)),C(...Eu)),1],usedExpression:[j,1],nextUsedExpression:[j,1],usedFacts:[T(55,j),1],definedExpression:[j,1],nextDefinedExpression:[j,1],assertStep:[ke,1],nextDefinition:[he,2],takeBounds:[T(w(289,te(w(88,289)),147),102),yu],pickIdentifiers:[w(289,te(w(88,289)),89),yu],assertedExpression:[j,1],decimalPart:[ce,2],operatorArgument:[w(C(...Cu,...wu,...Tu),C(88,95,96,54,51,67,39,37,36,35,41,44,85,79)),2],lambdaArgument:[S(73),yu],expressionArgument:[j,1],unboundQuantifier:[w(289,te(w(88,289)),89),yu],setEnumeration:[w(se,88),yu],setOfAll:[w(se,89),yu],setExpression:[j,1],setContents:[de,1],recordFields:[w(289,108),yu],recordSets:[w(289,89),yu],bracketExpression:[j,1],tupleContents:[j,1],identifierArguments:[ye,2],fairnessArguments:[w(94,j),2],disjunctionList:[S(132),yu],conjunctionList:[S(129),yu],leadingOperator:[C(...Su,193),yu],openExpression:[C(...Du),yu],junctionList:[C(129,132),yu],primitiveExpression:[N,1],expressionSuffix:[Ae,1],postfixSuffix:[C(...Tu),yu],recordSuffix:[S(91),yu],applicationSuffix:[S(97),yu],nextLeadingOperator:[C(...Su,193),yu],nextOpenExpression:[C(...Du),yu],infixContinuation:[C(...wu),yu],labelContinuation:[S(90),yu],expressionContinuation:[je,1],negativeOperator:[S(117),yu],primitiveArguments:[ye,2],stringLiteral:[S(110),yu],numberLiteral:[S(109),yu],bangIdentifier:[S(289),yu],bangArguments:[ye,2],bangOperand:[T(ne(()=>f(1).image!==`@`,289),C(...Cu),C(...wu),C(...Tu)),1],structureOperator:[T(102,104,89,le,ne(()=>f(1).image===`@`,289)),1]},P=Object.keys(Ne),Pe=P.map(()=>[{generation:0,first:void 0,amount:0}]),Fe=(e,t,n)=>(a.remaining=n,a.scanPosition=t,a.lastPosition=t,a.isSucceeded=!1,e()),F=e=>{let t=Ne[e][1],n=Fe(Ne[e][0],i.token,t),r=Pe[P.indexOf(e)],o=r.find(e=>e.generation<=i.generation)??r[r.push({generation:0,first:void 0,amount:0})-1];return o.generation=i.generation+t-a.remaining,o.first=i.token,o.amount=t,n},Ie=(e,t)=>t===0?[]:e.kind===0?[`<EOF>`]:[e.image,...Ie(d(e),t-1)],Le=(e=-1)=>{a.longestExpected=+(e>=0||i.expectedGeneration===i.generation),a.endPosition=0,a.isRescanning=!0,Object.values(Ne).forEach((e,t)=>{for(let n of Pe[t])if(!(n.generation<=i.generation||n.first===void 0)&&(Fe(e[0],n.first,n.amount),a.isSucceeded))break}),a.isRescanning=!1,y(0);let t=d(i.token);return v(`Encountered "${Ie(t,a.longestExpected).join(` `)}" at line ${t.beginLine}, column ${t.beginColumn} and token "${_u(i.token.image)}" `)},I=()=>(d(i.token),i.nextKind=-1,Le()),L=e=>{let t=i.token;if(i.token=d(i.token),i.nextKind=-1,i.token.kind===e)return i.generation++,i.token;throw i.token=t,Le(e)},R=e=>{if(e.includes(p()))return L(p());throw m(),I()},z=(e,t=e.kind)=>({kind:t,image:e.image,location:[e.beginLine,e.beginColumn,e.endLine,e.endColumn],heirs:[]}),B=(e,...t)=>{let n=t.flatMap(e=>e??[]),r=[yu,yu,bu,bu];for(let e of n)(e.location[0]<r[0]||e.location[0]===r[0]&&e.location[1]<r[1])&&(r[0]=e.location[0],r[1]=e.location[1]),(e.location[2]>r[2]||e.location[2]===r[2]&&e.location[3]>r[3])&&(r[2]=e.location[2],r[3]=e.location[3]);return{kind:e,image:e,location:r,heirs:n}},Re=()=>B(`IdPrefix`),V=e=>c.push(e),H=()=>{let e=c.lastIndexOf(void 0)+1;if(e!==c.length)return c.splice(e).filter(e=>e!==void 0)},U=e=>{c.push(void 0),s.push({name:e,token:f(1)}),i.expecting=``},W=()=>{s.pop(),c.pop(),i.expecting=``},ze=(e,t)=>{U(e);let n=t();return W(),n},Be=(e,t)=>ze(e,()=>{let e=t();return B(e,H())}),Ve=e=>{Gu(e)&&(e.kind=289)},He=()=>{let e=[i.token,d(i.token)];for(;;){let t=e[e.length-1],n=d(t);if([0,67,58,41,37].includes(n.kind)||t.kind===67||t.kind===58)return;if(t.kind===93)break;e.push(n)}let t=Wu(e,e.length-2);if(t<=0||e[t-1].kind===96)return;let n=e[t];e[t-1].next={kind:96,image:`Beginning of definition`,beginLine:n.beginLine,beginColumn:n.beginColumn,endLine:n.endLine,endColumn:n.endColumn,next:n}},Ue=(e,t)=>i.operatorStack?.push({node:e,operator:t}),We=()=>i.operatorStack??[],Ge=e=>We()[e].node??B(`Missing`),Ke=e=>{let t=We(),n=t.length-1;if(n<3)return;let r=Ge(n-2),i=Ge(n-3),a=Ge(n-1);t.splice(n-2,2);let o=e.fix===`nfix`&&i.kind===`Times`?B(`Times`,i.heirs,[r,a]):B(e.fix===`nfix`?`Times`:`InfixExpr`,[i,r,a]);t[n-3]={node:o,operator:void 0}},qe=()=>{let e=We(),t=e.length-1;if(t<2)return;let n=B(`PrefixExpr`,[Ge(t-2),Ge(t-1)]);e.splice(t-1,1),e[t-2]={node:n,operator:void 0}},Je=()=>{let e=We(),t=e.length-1;if(t<2)return;let n=Ge(t-1),r=e[t-1].operator===Iu?B(`FcnAppl`,[Ge(t-2)],n.heirs):B(`PostfixExpr`,[Ge(t-2),n]);e.splice(t-1,1),e[t-2]={node:r,operator:void 0}},Ye=()=>{let e=We();for(;;){let t=e.length-1,n=e[t],r=n.operator;if(r===void 0)return;let i=_(n.node??B(`Missing`));if(r.fix===`postfix`){if(t===0)throw v(`\n Encountered postfix op ${r.name} in block ${i} on empty stack`);let n=e[t-1];if(n.operator!==void 0){if(zu(n.operator)||n.operator.fix===`prefix`)throw v(`\n Encountered postfix op ${r.name} in block ${i} following prefix or infix op ${n.operator.name}.`);Je()}else{if(t<=1)return;let n=e[t-2].operator;if(n===void 0)throw v(`Expression at location ${_(Ge(t-2))} and expression at location ${_(Ge(t-1))} follow each other without any intervening operator.`);if(Bu(n,r))zu(n)?Ke(n):qe();else if(Vu(n,r))return;else throw v(`Precedence conflict between ops ${n.name} in block ${i} and ${r.name}.`)}}else if(r.fix===`prefix`){if(t===0)return;let n=e[t-1];if(n.operator===void 0)throw v(`\n Encountered prefix op ${r.name} in block ${i} following an expression.`);if(n.operator.fix===`postfix`)throw v(`\n Encountered prefix op ${r.name} in block ${i} following postfix op ${n.operator.name}.`);return}else if(t===0){if(Ru(r)===void 0)throw v(`\n Encountered infix op ${r.name} in block ${i} on empty stack.`);return}else{let n=e[t-1];if(n.operator!==void 0){let e=n.operator;if(zu(e)||e.fix===`prefix`){let n=Ru(r),i=_(Ge(t-1));if(n===void 0)throw v(r===Lu?`\n Missing expression in block ${i} following prefix or infix op ${e.name}.`:`\n Encountered infix op ${r.name} in block ${i} following prefix or infix op ${e.name}.`);if(Bu(e,n)||e===n&&e.associativity===`left`)throw v(`\n Precedence conflict between ops ${e.name} in block ${i} and ${n.name}.`)}else Je()}else{if(t<=1)return;let n=e[t-2];if(n.operator===void 0)throw v(`Expression at location ${_(Ge(t-2))} and expression at location ${_(Ge(t-1))} follow each other without any intervening operator.`);let i=Ru(n.operator),a=i!==void 0&&(t===2||e[t-3].operator!==void 0)?i:n.operator,o=_(Ge(t-2));if(Bu(a,r)||a===r&&a.associativity===`left`){if(zu(a))Ke(a);else if(a.fix===`prefix`)qe();else if(Ge(t-2).location[0]<Ge(t-1).location[0]&&r.name===`=`)throw v(`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${a.name} in block ${o} and ${r.name}.`);else if(r===Lu)throw v(`\n Error following expression at ${o}, missing operator or separator.`);else throw v(`\n Illegal combination of operators ${a.name} in block ${o} and ${r.name}.`)}else if(Vu(a,r)||a===r&&a.associativity===`right`)return;else throw v(`\n Precedence conflict between ops ${a.name} in block ${o} and ${r.name}.`)}}if(t===e.length-1)return}},Xe=()=>{Ue(void 0,Lu),Ye();let e=We();if(e.length===2)return e[0].node;n.push(`Couldn't properly parse expression${e.slice(0,Math.max(e.length-1,1)).map((e,t)=>`-- incomplete expression at ${_(Ge(t))}.\n`).join(``)}`)},Ze=(e,t)=>{let n=We(),r=n.at(-1);if(r===void 0)throw v(`\n \`\`.'' has no left hand side at ${_(e)}.`);if(r.operator!==void 0){if(r.operator.fix!==`postfix`||n[n.length-2].operator!==void 0)throw v(`\n \`\`.'' follows operator ${_(r.node??B(`Missing`))}.`);n.push({node:void 0,operator:void 0}),Je(),n.pop()}let i=n.length-1;n[i]={node:B(`RecordComponent`,[Ge(i),e,t]),operator:void 0}},Qe=e=>{i.fairnessHook=e},$e=e=>e===void 0?!1:e.kind===`GeneralId`?e.heirs[0].heirs.length===0:e.kind===`OpApplication`&&e.heirs[1].heirs.filter((e,t)=>t%2==1).every(e=>e.kind===`GeneralId`&&e.heirs[0].heirs.length===0),et=(e,t)=>{for(let n of e.heirs)if(n.kind!==`ConjList`&&n.kind!==`DisjList`){if(!E(n.location[1]))throw v(`Item at ${_(n)} is not properly indented inside conjunction or disjunction list item at ${_(t)}`);et(n,t)}},tt=()=>i.proofDepth<0?i.proofDepth:o[i.proofDepth],nt=e=>e.image.length<2?!1:e.image[1]===`*`?i.proofDepth<0:e.image[1]===`+`?!0:[290,293,294,292].includes(e.kind)?i.proofDepth<0||o[i.proofDepth]>=0&&Ku(e)>o[i.proofDepth]:[63,75,71,72].includes(e.kind),rt=e=>{let t=Ku(e),n=i.proofDepth>0?o[i.proofDepth-1]:-1;return t===-1?(o[i.proofDepth]<0&&(o[i.proofDepth]=n+1),!0):o[i.proofDepth]>=0?t!==-2&&o[i.proofDepth]===t:(o[i.proofDepth]=t===-2?n+1:t,t===-2||t>n)},G=()=>z(L(289)),K=e=>V(z(L(e))),it=(e,t)=>{let n=R(e);return i.lastOperator=Fu.get(n.image),z(n,t)},at=()=>{U(`Infix Op`);let e=R(wu);return i.lastOperator=Fu.get(e.image),W(),z(e,`InfixOp`)},ot=()=>{let e=R(Tu);return i.lastOperator=Fu.get(e.image),z(e,`PostfixOp`)},st=()=>it(Cu,`NonExpPrefixOp`),ct=()=>{U(`Module definition`),i.expecting=`---- MODULE`;let e=lt();i.expecting=`EXTENDS clause or module body`;let t=ut();i.expecting=`Module body`;let n=ft();i.expecting=`==== or more Module body`;let r=B(`EndModule`,[z(L(37))]);return W(),B(`Module`,[e,t,n,r])},lt=()=>{U(`Begin module`),i.expecting=`---- MODULE (beginning of module)`;let e=z(R([35,3,21]));i.expecting=`Identifier`,Ve(f(1));let t=G();i.moduleName??=t.image,i.expecting=`----`;let n=z(L(36));return W(),B(`BeginModule`,[e,t,n])},ut=()=>{if(U(`Extends`),h(48))for(K(48),i.expecting=`Identifier`,Ve(f(1)),V(G()),i.expecting=`comma or module body`;h(88);)K(88),i.expecting=`Identifier`,Ve(f(1)),V(G());let e=H();return W(),B(`Extends`,e)},dt=()=>{let e=p();if(e===36)return z(L(36));if(e===85)return pt();if(e===44)return mt();if(m(),F(`unitDefinition`))return yt();if(p()===79)return ht();if(m(),F(`unitInstance`))return Tt();if(F(`unitAssumption`))return Ot();if(F(`unitTheorem`))return Mt();if([35,3,21].includes(p())){let e=ct();return He(),e}if(m(),f(1).kind===68&&f(2).kind!==64||f(1).kind===69)return Ft();throw I()},ft=()=>{for(U(`Module body`),i.expecting=`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`;F(`moduleUnit`);)V(dt());let e=H();return W(),B(`Body`,e)},pt=()=>{U(`variable declaration`);let e=z(L(85));for(i.expecting=`Identifier`,V(G()),i.expecting=`comma or module body`;h(88);)K(88),i.expecting=`Identifier`,V(G());let t=H();return W(),B(`VariableDeclaration`,e,t)},mt=()=>{U(`Parameter declaration`),i.expecting=`CONSTANT`,U(`Parameter declaration item`);let e=B(`ConsDecl`,[z(L(44))]);for(W(),V(e),i.expecting=`Identifier, operator or _`,V(_t()),i.expecting=`,`;h(88);)K(88),i.expecting=`Identifier, operator or _`,V(_t());let t=H();return W(),B(`ParamDeclaration`,t)},ht=()=>{for(U(`Recursive`),i.expecting=`RECURSIVE`,K(79),i.expecting=`Identifier, operator or _`,V(_t()),i.expecting=`,`;h(88);)K(88),i.expecting=`Identifier, operator or _`,V(_t()),i.expecting="`,' or `)'";let e=H();return W(),B(`Recursive`,e)},gt=()=>{for(K(94),i.expecting=`_`,K(92),i.expecting=`comma or )`;h(88);)K(88),i.expecting=`_`,K(92),i.expecting=`comma or )`;K(95)},_t=()=>Be(`Constant declaration items`,()=>{i.expecting=`Identifier, _ or prefix op`;let e=p();if(e===289)return V(G()),i.expecting=`(, comma, or Module Body`,F(`constantArguments`)&&gt(),`IdentDecl`;if(Cu.includes(e)){let e=st();return i.expecting=`_`,V(e),K(92),`PrefixDecl`}if(e!==92)throw m(),I();let t=z(L(92));i.expecting=`prefix or postfix operator`;let n=p();if(wu.includes(n)){let e=at();return i.expecting=`_`,V(t),V(e),K(92),`InfixDecl`}if(Tu.includes(n)){let e=ot();return V(t),V(e),`PostfixDecl`}throw m(),I()}),vt=e=>{let t=z(L(93));He(),V(t),i.expecting=e},yt=()=>Be(`Definition`,()=>{if(i.expecting=`LOCAL, Identifier or Operator Symbol`,h(54)&&K(54),L(96),i.expecting=`LOCAL, Identifier or Operator Symbol`,F(`functionDefinition`)){for(V(G()),i.expecting=`[`,K(97),i.expecting=`Identifier`,V(tn()),i.expecting=`COMMA or ]`;h(88);)K(88),i.expecting=`Identifier`,V(tn());let e=z(L(99));return i.expecting=`==`,V(e),vt(`Expression`),V(J()),`FunctionDefinition`}if(F(`postfixDefinition`)){U(`Postfix LHS`);let e=G(),t=z(R(Tu));return W(),V(B(`PostfixLHS`,[e,t])),i.expecting=`==`,vt(`Expression`),V(J()),`OperatorDefinition`}if(F(`infixDefinition`)){U(`Infix LHS`);let e=G(),t=z(R(wu)),n=G();return W(),V(B(`InfixLHS`,[e,t,n])),i.expecting=`==`,vt(`Expression`),V(J()),`OperatorDefinition`}if(F(`identifierDefinition`)){if(V(St()),i.expecting=`==`,vt(`Expression or Instance`),F(`definitionBody`))return V(J()),`OperatorDefinition`;if(p()===51)return V(Et()),`ModuleDefinition`;throw m(),I()}if(!Cu.includes(p()))throw m(),I();U(`Prefix LHS`);let e=z(R(Cu));i.expecting=`Identifier`;let t=G();return W(),V(B(`PrefixLHS`,[e,t])),i.expecting=`==`,vt(`Expression`),V(J()),`OperatorDefinition`}),bt=()=>{if(U(`Identifier tuple`),K(102),i.expecting=`Identifier or >>`,h(289))for(V(G()),i.expecting=`COMMA or >>`;h(88);)K(88),i.expecting=`COMMA or >>`,V(G()),i.expecting=`COMMA or >>`;K(104);let e=H();return W(),B(`IdentifierTuple`,e)},xt=()=>{let e=p();if(e===289)return Ct();if(ju.has(e))return wt();throw m(),I()},St=()=>{if(U(`Identifier LHS`),V(G()),i.expecting=`( or ==`,h(94)){for(K(94),i.expecting=`Identifier Declaration, prefix op, _ or )`,V(xt()),i.expecting=`COMMA or )`;h(88);)K(88),i.expecting=`Identifier Declaration, prefix op or _`,V(xt()),i.expecting=`COMMA or )`;K(95)}let e=H();return W(),B(`IdentLHS`,e)},Ct=()=>{if(U(`Identifier Declation`),V(G()),i.expecting=`( or ...`,h(94)){for(K(94),i.expecting=`_`,K(92),i.expecting=`COMMA or )`;h(88);)K(88),i.expecting=`_`,K(92),i.expecting=`COMMA or )`;K(95)}let e=H();return W(),B(`IdentDecl`,e)},wt=()=>Be(`Op. Symbol Declaration`,()=>{let e=p();if(Cu.includes(e))return V(st()),i.expecting=`_`,K(92),`PrefixDecl`;if(e!==92)throw m(),I();K(92),i.expecting=`infix or postfix operator`;let t=p();if(wu.includes(t))return V(at()),i.expecting=`_`,K(92),`InfixDecl`;if(Tu.includes(t))return V(ot()),`PostfixDecl`;throw m(),I()}),Tt=()=>{U(`Instance`),i.expecting=`LOCAL or instance`;let e=h(54)?z(L(54)):void 0;V(Et()),i.expecting=`COMMA or Module Body`;let t=H();return W(),B(`Instance`,e,t)},Et=()=>{if(U(`NonLocalInstance`),K(51),i.expecting=`Module identifier`,Ve(f(1)),V(G()),i.expecting=`WITH or another definition.`,h(87))for(K(87),i.expecting=``,V(Dt()),i.expecting=``;F(`nextSubstitution`);)K(88),i.expecting=``,V(Dt()),i.expecting=``;let e=H();return W(),B(`NonLocalInstance`,e)},Dt=()=>{U(`Substitution`);let e=p(),t=e===289?G():Cu.includes(e)?st():wu.includes(e)?at():Tu.includes(e)?ot():void 0;if(t===void 0)throw m(),I();i.expecting=`<-`;let n=z(L(107));i.expecting=`Expression or Op. Symbol`;let r=Zt();return W(),B(`Substitution`,[t,n,r])},Ot=()=>{U(`Assumption`),i.expecting=`ASSUM...`,V(z(R([41,39]))),F(`assumptionName`)&&(h(96)&&L(96),V(G()),i.expecting=`==`,K(93)),He(),i.expecting=`Expression`,V(J());let e=H();return W(),B(`Assumption`,e)},kt=e=>{if(k())return At();if(Au.has(p()))return jt();if(m(),F(e))return J();throw I()},At=()=>{if(U(`Assume-Prove`),h(289)){V(B(`GeneralId`,[Re(),G()])),K(90),V(At());let e=H();return W(),B(`Label`,e)}for(V(z(R([39,40]))),i.expecting=`Expression, Declaration, or AssumeProve`,V(kt(`assumeExpression`)),i.expecting="PROVE or `,'";h(88);)K(88),i.expecting=`Expression, Declaration, or AssumeProve`,V(kt(`nextAssumeExpression`)),i.expecting="PROVE or `,'";V(z(R([76,77]))),i.expecting=`Expression`,V(J());let e=H();return W(),B(`AssumeProve`,e)},jt=()=>{if(U(`NEW symbol declaration`),i.expecting=`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`,F(`constantSymbol`)){if(F(`newConstant`)?(K(56),K(44)):V(z(R([56,44]))),i.expecting=`Constant declaration`,F(`constantDeclaration`)){let e=Ct();if(V(e),h(147)){let t=L(147);if(e.heirs.length>1)throw v(`declared symbol with arguments before \\in at ${_(e)}`);V(z(t)),i.expecting=`Expression`,V(J())}}else if(ju.has(p()))V(wt());else throw m(),I()}else if(F(`variableSymbol`))h(56)&&K(56),K(85),i.expecting=`Identifier`,V(B(`IdentDecl`,[G()]));else if(F(`levelSymbol`))h(56)&&K(56),V(z(R([80,38,81]))),i.expecting=`Declaration`,V(xt());else throw I();let e=H();return W(),B(`NewSymb`,e)},Mt=()=>{if(U(`Theorem`),i.expecting=`THEOREM, PROPOSITION`,V(z(R([67,58]))),i.expecting=`Identifier, Assume-Prove or Expression`,F(`theoremName`)&&(V(G()),i.expecting=`==`,K(93)),He(),F(`theoremAssumeProve`)){if(!O())throw I();V(At())}else if(F(`theoremExpression`))V(J());else throw I();nt(f(1))&&V(Nt());let e=H();return W(),B(`Theorem`,e)},Nt=()=>{if(i.proofDepth++,i.proofDepth>=100)throw v(`Proofs nested more than 100deep.`);o[i.proofDepth]=-1;let e=ze(`Proof`,()=>{if(f(1).kind===63||f(2).kind===63)return Ft();if(F(`terminalProof`)){let e=h(75)?z(L(75)):void 0;return B(`TerminalProof`,e,[z(R([71,72]))])}if(!F(`stepProof`))throw I();for(F(`proofKeyword`)&&K(75);f(2).kind!==78;)V(zt()),i.expecting=`a proof step`;return V(Lt()),B(`Proof`,H())});if(i.proofDepth<0)throw v(`Parser bug: an extra QED step found.`);return i.proofDepth--,e},Pt=e=>{if(p()===55)K(55),i.expecting=`identifier`,V(G());else{if(m(),!F(e))throw I();V(J())}},Ft=()=>{U(`UseOrHideOrBy`);let e=p(),t=e===63||e===75?`TerminalProof`:`UseOrHide`;if(t===`TerminalProof`)h(75)&&K(75),K(63),h(64)&&K(64);else if(e===68)K(68),h(64)&&K(64);else if(e===69)K(69);else throw m(),I();if(i.expecting="an expression, `MODULE' or `DEF'",F(`usedFacts`))for(Pt(`usedExpression`);h(88);)K(88),i.expecting=`MODULE or expression`,Pt(`nextUsedExpression`),i.expecting=t===`TerminalProof`?`comma, DEF, or [.]`:`comma, DEF, or proof step`;if(h(66))for(K(66),i.expecting=`MODULE or expression`,Pt(`definedExpression`);h(88);)K(88),i.expecting=`MODULE or expression`,Pt(`nextDefinedExpression`),i.expecting=t===`TerminalProof`?`comma or [.]`:`comma or proof step`;let n=H();return W(),B(t,n)},It=e=>{i.expecting=`Step number`;let t=z(R(Eu));if(!rt(i.token))throw v(`${_(t)}: ${e}`);V(t)},Lt=()=>{U(`QED step`),It(`QED step's number has bad level.`),i.expecting=`QED`,V(B(`QEDStep`,[z(L(78))])),nt(f(1))&&V(Nt());let e=H();return W(),B(`ProofStep`,e)},Rt=()=>{let e=f(1).kind;if(e===68||e===69)return[Ft(),!1];if(e===51)return[Et(),!1];if(e===96||e===65)return[Bt(),!1];let t=p();if(t===70)return[Vt(`HaveStep`,70),!1];if(t===74)return[Ut(),!1];if(t===83)return[Wt(),!1];if(t===82)return[Gt(),!0];if(t===42)return[Vt(`CaseStep`,42),!0];if(m(),F(`assertStep`))return[Kt(),!0];throw I()},zt=()=>{U(`Step`),It(`step's number has bad level.`),i.expecting=`proof step`;let e=Rt();if(V(e[0]),nt(f(1))){if(!e[1])throw v(`${_(e[0])}: proof of step that does not take a proof.`);V(Nt())}let t=H();return W(),B(`ProofStep`,t)},Bt=()=>{U(`DefStep`),h(65)&&K(65);do V(yt());while(F(`nextDefinition`));let e=H();return W(),B(`DefStep`,e)},Vt=(e,t)=>{U(e),K(t),i.expecting=`expression`,V(J());let n=H();return W(),B(e,n)},Ht=(e,t,n,r)=>{for(V(e()),i.expecting=t;h(88);)K(88),i.expecting=n,V(e()),i.expecting=r},Ut=()=>{if(U(`TakeStep`),K(74),i.expecting=`identifier`,F(`takeBounds`))Ht(tn,`comma or step`,`identifier or tuple of identifiers`,`comma or proof step`);else if(h(289))Ht(G,`comma or proof step`,`identifier`,`comma or proof step`);else throw I();let e=H();return W(),B(`TakeStep`,e)},Wt=()=>{for(U(`WitnessStep`),K(83),i.expecting=`expression`,V(J());h(88);)K(88),i.expecting=`expression`,V(J()),i.expecting=`comma or colon`;let e=H();return W(),B(`WitnessStep`,e)},Gt=()=>{if(U(`PickStep`),K(82),i.expecting=`identifier`,F(`pickIdentifiers`))Ht(G,`comma, or colon`,`identifier`,`comma or colon`);else if(p()===102||p()===289)Ht(tn,`comma or colon`,`identifier or tuple of identifiers`,`comma or colon`);else throw m(),I();K(89),i.expecting=`expression`,V(J());let e=H();return W(),B(`PickStep`,e)},Kt=()=>{if(U(`AssertStep`),h(84)&&(K(84),i.expecting=`expression or ASSUME/PROVE`),F(`assertedExpression`))V(J());else if(O())V(At());else throw I();let e=H();return W(),B(`AssertStep`,e)},qt=()=>{let e=p();if(e===94)return Qt();if(e===100)return nn();if(e===97)return on();if(e===102)return ln();if(e===59||e===86)return fn();throw m(),I()},Jt=()=>{let e=p();if(e===47||e===49)return $t();if(e===60||e===61)return en();if(e===50)return pn();if(e===42)return gn();if(e===52)return _n();if(e===43)return xn();throw m(),I()},Yt=()=>{let e=z(L(109));if(!F(`decimalPart`))return B(`Number`,[e]);let t=z(L(91));return B(`Real`,[e,t,z(L(109))])},Xt=()=>{for(U(`Optional Arguments`),K(94),V(Zt());h(88);)K(88),V(Zt());K(95);let e=H();return W(),B(`OpArgs`,e)},Zt=()=>{if(F(`operatorArgument`)&&re()){let e=p();if(Cu.includes(e))return B(`GenNonExpPrefixOp`,[Re(),st()]);if(wu.includes(e)){let e=at();if(e.image===`\\X`||e.image===`\\times`)throw v(`${_(e)}: \\X may not be used as an infix operator.`);return B(`GenInfixOp`,[Re(),e])}if(Tu.includes(e))return B(`GenPostfixOp`,[Re(),ot()]);throw m(),I()}if(F(`lambdaArgument`)&&re())return Sn();if(F(`expressionArgument`))return J();throw I()},Qt=()=>B(`ParenExpr`,[z(L(94)),J(),z(L(95))]),$t=()=>{U(`Quantified form`),V(z(R([47,49])));let e=F(`unboundQuantifier`);if(e)for(V(G());h(88);)K(88),V(G());else if(p()===102||p()===289)for(V(tn());h(88);)K(88),V(tn());else throw m(),I();K(89),V(J());let t=H();return W(),B(e?`UnboundQuant`:`BoundQuant`,t)},en=()=>{for(U(`Bound Quantified Expression`),V(z(R([60,61]))),V(G());h(88);)K(88),V(G());K(89),V(J());let e=H();return W(),B(`UnboundQuant`,e)},tn=()=>{U(`Quant Bound`);let e=p();if(e===102)V(bt());else if(e===289)for(V(G());h(88);)K(88),V(G()),i.expecting=`, or \\in`;else throw m(),I();K(147),V(J());let t=H();return W(),B(`QuantBound`,t)},nn=()=>Be(`Some { } form`,()=>{K(100);let e=F(`setContents`)?rn():`SetEnumerate`;return K(101),e}),rn=()=>{if(ie()){let e=p(),t=e===102?bt():e===289?G():void 0;if(t===void 0)throw m(),I();i.expecting=`\\in`;let n=z(L(147)),r=J();if(i.expecting=`':', ',' or '}'`,p()===89){let e=z(L(89));return V(t),V(n),V(r),V(e),V(J()),`SubsetOf`}if(V(B(`InfixExpr`,[B(`GeneralId`,[Re(),t]),B(`GenInfixOp`,[Re(),n]),r])),p()!==88)return m(),`SetEnumerate`;do K(88),V(J());while(h(88));return`SetEnumerate`}if(F(`setEnumeration`)){for(V(J());h(88);)K(88),V(J());return`SetEnumerate`}if(F(`setOfAll`)){for(V(J()),K(89),V(tn());h(88);)K(88),V(tn());return`SetOfAll`}if(!F(`setExpression`))throw I();let e=J();V(e);let t=p();if(t===89){let t=L(89);if(e.heirs.length>1&&e.kind===`InfixExpr`&&e.heirs[1].heirs[1].image===`\\in`)throw v(`Form {a \\in b : c \\in d }, at line ${t.beginLine}, is not allowed`);for(V(z(t)),V(tn());h(88);)K(88),V(tn());return`SetOfAll`}if(t!==88)return m(),`SetEnumerate`;do K(88),V(J());while(h(88));return`SetEnumerate`},q=e=>{for(V(e());h(88);)K(88),V(e());K(99)},an=(e,t,n)=>()=>{U(e);let r=G(),i=z(L(n)),a=J();return W(),B(t,[r,i,a])},on=()=>Be(`Some [] Form`,()=>{if(K(97),ie()){for(V(tn());h(88);)K(88),V(tn());return K(108),V(J()),K(99),`FcnConst`}if(F(`recordFields`))return q(an(`Field Value`,`FieldVal`,108)),`RcdConstructor`;if(f(2).kind===108&&Gu(f(1)))return f(1).kind=289,q(an(`Field Value`,`FieldVal`,108)),`RcdConstructor`;if(F(`recordSets`))return q(an(`Field Set`,`FieldSet`,89)),`SetOfRcds`;if(!F(`bracketExpression`))throw I();V(J());let e=p();if(e===88||e===99){for(;h(88);)K(88),V(J());return K(99),i.lastOperator=Iu,`FcnAppl`}if(e===106)return K(106),V(J()),K(99),`SetOfFcns`;if(e===46){for(K(46),V(sn());h(88);)K(88),V(sn());return K(99),`Except`}if(e===98)return K(98),V(dn()),`ActionExpr`;throw m(),I()}),sn=()=>{U(`Except Spec`),K(105);do V(cn()),i.expecting=`= or ,`;while(p()===91||p()===97||m());K(185),V(J());let e=H();return W(),B(`ExceptSpec`,e)},cn=()=>{U(`Except Component`);let e=p();if(e===91){K(91),Ve(f(1));let e=G();e.image===`@`&&n.push(`@ used in !.@`),V(e)}else if(e===97){for(K(97),V(J());h(88);)K(88),V(J());K(99)}else throw m(),I();let t=H();return W(),B(`ExceptComponent`,t)},ln=()=>Be(`Some << -- >> or >>_ Form`,()=>{if(K(102),F(`tupleContents`))for(V(J());h(88);)K(88),V(J());let e=p();if(e===104)return K(104),`Tuple`;if(e===103)return K(103),V(dn()),`ActionExpr`;throw m(),I()}),un=()=>{let e=G(),t=F(`identifierArguments`)?Xt():void 0;if(h(105)){let n=z(L(105));return V(B(`IdPrefixElement`,[e],t,[n])),un()}return Qe(t),B(`GeneralId`,[B(`IdPrefix`,H()),e])},dn=()=>{U(`restricted form of expression`);let e=p(),t=e===289?un():e===94?Qt():e===100?nn():e===97?on():e===102?ln():void 0;if(t===void 0)throw m(),I();return W(),t},fn=()=>{Qe(void 0),U(`Fairness Expression`);let e=z(R([86,59])),t=dn(),r=`${e.location[0]}`;if(F(`fairnessArguments`)){let a=z(L(94)),o=J(),s=z(L(95));return W(),t.kind===`GeneralId`&&i.fairnessHook!==void 0?B(`FairnessExpr`,[e,B(`OpApplication`,[t,i.fairnessHook]),a,o,s]):Mu.has(String(t.kind))?B(`FairnessExpr`,[e,t,a,o,s]):(n.push(`Error in fairness expression at ${r}: ${e.location[1]}: could not link arguments\n`),t)}if(W(),i.fairnessHook===void 0)throw v(`Ill-structured fairness expression at line ${r}, column ${e.location[1]}`);let a=i.fairnessHook.heirs;return a.length===3?B(`FairnessExpr`,[e,t,...a]):(n.push(`Error in fairness expression at ${r}: ${e.location[1]}\n`),t)},pn=()=>{U(`IF THEN ELSE`);let e=[z(L(50)),J(),z(L(62)),J(),z(L(45)),J()];return W(),B(`IfThenElse`,e)},mn=()=>{let e=f(1);return e.kind===121&&E(e.beginColumn)},hn=(e,t,n)=>{U(e);let r=[n(),z(L(106)),J()];return W(),B(t,r)},gn=()=>{for(U(`CASE Expression`),K(42),V(hn(`Case Arm`,`CaseArm`,J));mn()&&f(2).kind!==57;)K(121),V(hn(`Case Arm`,`CaseArm`,J));mn()&&(K(121),V(hn(`Case Other Arm`,`OtherArm`,()=>z(L(57)))));let e=H();return W(),B(`Case`,e)},_n=()=>{U(`Case Other Arm`);let e=[z(L(52)),vn(),z(L(53)),J()];return W(),B(`LetIn`,e)},vn=()=>{U(`Let Definitions`);do{let e=p();if(e===54||e===96)V(yt());else if(e===79)V(ht());else throw m(),I()}while([54,79,96].includes(p())||m());let e=H();return W(),B(`LetDefinitions`,e)},yn=e=>{U(`Junction Item`);let t=z(R([132,129])),n=J();W();let r=B(e,[t,n]);return et(n,r),r},bn=()=>{let e=f(1);return l.push({isConjunction:e.kind===129,column:e.beginColumn}),Be(`AND-OR Junction`,()=>{let e=F(`disjunctionList`)?`DisjList`:F(`conjunctionList`)?`ConjList`:void 0;if(e===void 0)throw I();let t=e===`DisjList`?`DisjItem`:`ConjItem`;for(V(yn(t));D();)V(yn(t));return l.pop(),e})},xn=()=>{U(`(Un)Bounded Choose`);let e=z(L(43)),t=p(),n=t===289?G():t===102?bt():void 0;if(n===void 0)throw m(),I();U(`Domain binding`),h(147)&&(K(147),i.expecting=`Expression`,V(J()));let r=B(`MaybeBound`,H());W();let a=[e,n,r,z(L(89)),J()];return W(),B(`UnboundOrBoundChoose`,a)},Sn=()=>{U(`Lambda`),K(73),i.expecting=`Identifier`,Ht(G,"`,' or `:'",`Identifier`,"`,' or `:'"),K(89),i.expecting=`Expression`,V(J());let e=H();return W(),B(`Lambda`,e)},Cn=(e,t)=>{Ue(B(e,[Re(),t]),i.lastOperator),We().length!==1&&Ye()},wn=()=>{let e=p();if(Su.includes(e))return Cn(`GenPrefixOp`,it(Su,`PrefixOp`));if(wu.includes(e))return Cn(`GenInfixOp`,at());throw m(),I()},J=()=>{for(U(`Expression`),i.operatorStack=[],u.push(i.operatorStack);F(`leadingOperator`)&&re();)wn();if(F(`openExpression`)&&re())Ue(Jt());else if(re())Tn();else throw I();W();let e=Xe();if(e===void 0)throw v(` Couldn't reduce expression stack.`);return u.pop(),i.operatorStack=u.at(-1),e},Tn=()=>{if(U(`ExtendableExpr`),F(`junctionList`)&&A())Ue(bn());else if(ku.has(p()))Ue(qt());else{if(m(),!F(`primitiveExpression`))throw I();Ue(On())}for(;F(`expressionSuffix`);)if(F(`postfixSuffix`)&&re())Cn(`GenPostfixOp`,ot());else if(F(`recordSuffix`)&&re()){let e=z(L(91));if(Ve(f(1)),!re())throw I();Ze(e,G())}else if(F(`applicationSuffix`)&&re()){i.expecting=`function argument`;let e=on();[`GenPrefixOp`,`GenNonExpPrefixOp`,`GenInfixOp`,`GenPostfixOp`,`FcnAppl`].includes(String(e.kind))?(Ue(e,i.lastOperator),We().length!==1&&Ye()):Ue(e)}else throw I();if(F(`expressionContinuation`)){if(F(`infixContinuation`)&&re()){for(Cn(`GenInfixOp`,at());F(`nextLeadingOperator`)&&re();)wn();if(F(`nextOpenExpression`)&&re())Ue(Jt());else if(re())Tn();else throw I()}else if(F(`labelContinuation`)&&re()){let e=z(L(90)),t=We().at(-1)?.node;if(!$e(t))throw v(`\`::' at ${_(e)} does not follow a label.`);We().pop();let n=J(),r=We().at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&We().length>0&&r!==void 0&&i.lastOperator!==void 0&&!Vu(r,i.lastOperator))throw v(`Removing label at ${_(t??B(`Missing`))} would change expression parsing.`);Ue(B(`Label`,[t??B(`Missing`),e,n]))}else throw I()}W()},En=()=>{let e=R([290,291]),t=z(e);if(tt()<0&&i.proofDepth<=0)throw v(`${_(t)}: Step number used outside proof.`);if(e.image[1]===`+`)throw v(`${_(t)}: <+> step number used in an expression.`);return t},Dn=()=>{let e=p();if(e===289)return G();if(e===290||e===291)return En();if(wu.includes(e))return at();if(Tu.includes(e))return ot();if(m(),!F(`negativeOperator`))throw I();return st()},On=()=>ze(`Primitive expression`,()=>{if(F(`stringLiteral`)&&re())return ze(`String`,()=>z(L(110),`String`));if(F(`numberLiteral`)&&re())return Yt();if(!Ou.has(p()))throw m(),I();let e=Dn(),t=F(`primitiveArguments`)?Xt():void 0;for(;h(105);)V(kn());let n=H();if(n===void 0){let n=B(`GeneralId`,[B(`IdPrefix`,[]),e]);return t?B(`OpApplication`,[n,t]):n}let r=[B(`IdPrefixElement`,[e],t,[n[0].heirs[0]]),...n.slice(0,-1).map((e,t)=>B(`IdPrefixElement`,e.heirs.slice(1),[n[t+1].heirs[0]]))],i=n[n.length-1].heirs,a=B(`GeneralId`,[B(`IdPrefix`,r),i[1]]);return i.length===2?a:B(`OpApplication`,[a,i[2]])}),kn=()=>{if(U(`Bang Extension`),K(105),F(`bangOperand`)){if(F(`bangIdentifier`)&&f(1).image!==`@`)V(G());else{let e=p();if(Cu.includes(e))V(st());else if(wu.includes(e))V(at());else if(Tu.includes(e))V(ot());else throw m(),I()}F(`bangArguments`)&&V(Xt())}else if(p()===94)V(Xt());else{if(m(),!F(`structureOperator`))throw I();V(An())}let e=B(`IdPrefixElement`,H());return W(),e},An=()=>{let e=ze(`StructOp`,()=>{i.expecting="`<<' , `>>' , `:' , `@' , or number";let e=p();if(e===102||e===104||e===89)return z(L(e),`StructOp`);if(e===109)return Yt();if(m(),f(1).image!==`@`)throw I();return z(L(289),`StructOp`)});if(e.kind===`Real`)throw v(`Illegal structural term at ${_(e)}`);return e.kind===`Number`?B(`StructOp`,[e]):e},jn=()=>{if(He(),h(2))for(L(2);;){let e=p();if(e!==20&&e!==289){m();break}L(e)}ct()};try{jn()}catch(e){if(!(e instanceof g))throw e;n.push(e.message)}return n.length===0?void 0:n.join(`
112
+ `)},Ju=(e,t)=>{try{return xl(e)}catch(n){if(!(n instanceof p))throw n;let r=qu(e);throw r===void 0?n:m([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},Yu=(e,t,n)=>new x(`Applying ${e} to the following value,\nwhich is not ${t}:\n${Y(n)}`),Xu=(e,t,n,r)=>new x(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${Y(r)}`),Zu=e=>P(e)?xn(e):void 0,Qu=(e,t,n)=>{let r=Z(e,t,n),i=Zu(r);if(!i)throw Yu(n,`a function with a finite domain`,r);return i},$u=(e,t,n)=>{let r=Z(e,t,n),i=Zu(r);if(!i)throw Xu(t===0?`first`:`second`,n,`bag`,r);return i},ed=(e,t)=>{if(!Me(e)||!Yt(e))throw t();return q(e).elements},td=e=>e.range.every(e=>typeof e==`number`&&e>0),nd=(e,t)=>{let n=e.domain.findIndex(e=>et(e,t));return n===-1?void 0:e.range[n]},rd=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,id=rd(`BagDiff`,`tlc2.value.impl.Value`,2),ad=rd(`SqSubseteq`,`tlc2.value.IBoolValue`,2),od=rd(`BagUnion`,`tlc2.value.impl.Value`,1),sd=rd(`BagOfAll`,`tlc2.value.impl.Value`,2),cd=rd(`BagCup`,`tlc2.value.impl.Value`,2),ld=rd(`BagCardinality`,`tlc2.value.impl.IntValue`,1),ud=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Nr(e)}`;throw Fr(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')`)},dd=(e,t,n)=>{let r=ud(e,n)+ud(t,n);if(Or(r))throw kr(`${e}+${t}`);return r},fd=(e,t,n,r)=>{let i=nd(n,e.domain[t]),a=ud(e.range[t],r);return i===void 0?a:a-ud(i,r)|0},pd=(e,t)=>Nt(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>et(e[0],r));a?a[1]=dd(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),md=$e([],[]),hd=[wr(`EmptyBag`,md),Q(`IsABag`,1,e=>{let t=Zu(Z(e,0,`IsABag`));return t!==void 0&&td(t)}),Q(`BagCardinality`,1,e=>{let t=Z(e,0,`BagCardinality`);return Qu(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Yu(`BagCardinality`,`a bag`,t);return dd(e,n,ld)},0)}),Q(`BagIn`,2,e=>{let t=Z(e,1,`BagIn`),n=nd(Qu(e,1,`BagIn`),Z(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Xu(`second`,`BagIn`,`bag`,t);return n>0}),Q(`CopiesIn`,2,e=>{let t=Z(e,1,`CopiesIn`),n=nd(Qu(e,1,`CopiesIn`),Z(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Xu(`second`,`CopiesIn`,`bag`,t);return n}),Q(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=$u(e,t,`(+)`);if(!td(n))throw Xu(t===0?`first`:`second`,`(+)`,`bag`,Z(e,t,`(+)`));return n});return pd(t,cd)}),Q(`\\ominus`,2,e=>{let t=$u(e,0,`(-)`),n=$u(e,1,`(-)`);return Nt(t.domain.flatMap((e,r)=>{let i=fd(t,r,n,id);return i>0?[[e,i]]:[]}))}),Q(`BagUnion`,1,e=>{let t=Z(e,0,`BagUnion`),n=ed(t,()=>Yu(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??md;let r=n.map(e=>{let n=Zu(e);if(!n)throw new x(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${Y(t)}`);return n});return pd(r,od)}),Q(`\\sqsubseteq`,2,e=>{let t=Qu(e,0,`\\sqsubseteq`),n=Qu(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>fd(t,r,n,ad)<=0)}),Tr(`BagOfAll`,2,e=>{let t=Cr(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new x(`The first argument of BagOfAll should be an operator, but instead it is:\n${Y(t.literalBody)}`);let n=Z(e,1,`BagOfAll`),r=Zu(n);if(!r)throw Xu(`second`,`BagOfAll`,`function with a finite domain`,n);return pd(r.domain.map((e,n)=>$e([t.call([e])],[r.range[n]])),sd)}),Q(`SubBag`,1,e=>{let t=Z(e,0,`SubBag`);if(!P(t))throw new b(`DOMAIN expects a function but received ${Y(t)}`);let n=xn(t),r=Dt(n.range).elements,i=r.find(e=>typeof e!=`number`);if(i!==void 0){let e=typeof r[0]!=`number`;throw new b(`The ${e?`first`:`second`} argument of >= should be an integer, but instead it is:\n${Y(e?r[0]:i)}`)}let a=n.range.filter(e=>typeof e==`number`);if(a.some(e=>e<1))throw new b(`Attempted to apply a function to ${Y(n)}, which is not in its domain`);return Dt(n.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:a[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>$e(e.map(e=>e[0]),e.map(e=>e[1]))))}),Q(`BagToSet`,1,e=>Nn(Qu(e,0,`BagToSet`))),Q(`SetToBag`,1,e=>{let t=Z(e,0,`SetToBag`),n=ed(t,()=>Yu(`BagToSet`,`a function with a finite domain`,t));return $e([...n],n.map(()=>1))})],gd=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,_d=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,vd=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,yd=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,bd=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,xd=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Sd=e=>{if(!P(e))return!1;let t=xn(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},Cd=(e,t)=>Fr(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Nr(t)}`),wd=(e,t)=>Fr(e,`Cannot cast tlc2.value.impl.${Nr(t)} to tlc2.value.impl.StringValue`),Td=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Ed=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw Cd(t,e);return`[${q(e).elements.map(e=>Od(e,t)).join(`,`)}]`},Dd=(e,t)=>{let n=xn(e),r=hn(n);return r?`[${r.map(e=>Od(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Td(typeof e==`string`?e:Y(e))}:${Od(n.range[r],t)}`).join(`,`)}}`},Od=(e,t)=>typeof e==`string`?Td(e):typeof e==`object`?e.kind===`ModelValue`?Td(e.name):Me(e)?Ed(e,t):Dd(e,t):String(e),kd=e=>{if(Me(e))return Ed(e,gd);if(!P(e)||Sd(e))throw Cd(gd,e);return Dd(e,gd)},Ad=e=>{if(!P(e))throw Cd(_d,e);return Dd(e,_d)},jd=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))},Md=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Be(e);if(Array.isArray(e))return Ut(e.map(e=>Md(e,t)));if(typeof e==`object`&&e)return Wt(Object.entries(e).map(([e,n])=>[Be(e),Md(n,t)]));throw Fr(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Nd=(e,t)=>{if(e.trim()===``)return Md(null,t);try{return Md(JSON.parse(e,(e,t,n)=>typeof t==`number`?jd(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Fr(t,e.message):e}},Pd=(e,t)=>{if(typeof e!=`string`)throw wd(t,e);return e},Fd=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Fr(n,`${t} (No such file or directory)`);return r},Id=e=>[Er(`ToJson`,1,e=>Be(Od(Z(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Er(`ToJsonArray`,1,e=>Be(kd(Z(e,0,`ToJsonArray`)))),Er(`ToJsonObject`,1,e=>Be(Ad(Z(e,0,`ToJsonObject`)))),Er(`JsonSerialize`,2,t=>{let n=Pd(Z(t,0,`JsonSerialize`),vd),r=Z(t,1,`JsonSerialize`);if(!hn(r)&&!Sd(r))throw new x(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${Y(r)}`);return e.writeFile?.(n,Od(r,vd)),!0}),Er(`ndJsonSerialize`,2,t=>{let n=Pd(Z(t,0,`ndJsonSerialize`),yd),r=Z(t,1,`ndJsonSerialize`),i=hn(r);if(!i)throw new x(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${Y(r)}`);return e.writeFile?.(n,i.map(e=>`${Od(e,yd)}\n`).join(``)),!0}),Er(`JsonDeserialize`,1,t=>{let n=Pd(Z(t,0,`JsonDeserialize`),bd);return Nd(Fd(e,n,bd),bd)}),Er(`ndJsonDeserialize`,1,t=>{let n=Pd(Z(t,0,`ndJsonDeserialize`),xd);return Ut(Fd(e,n,xd).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Nd(e,xd)))})],Ld=(e,t,n,r)=>new x(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),Rd=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Ld(t,n,`nonnegative integer`,Y(e));return e},zd=(e,t,n,r)=>{if(!Me(e)||!Yt(e))throw Ld(t,n,r,Y(e));return q(e).elements},Bd=(e,t,n,r)=>Dt(Array.from({length:t},()=>Dt(e.filter(()=>r.nextDouble()<n)))),Vd=(e,t)=>{let n=`RandomSetOfSubsets`,r=Rd(Z(e,0,n),`first`,n),i=Rd(Z(e,1,n),`second`,n),a=zd(Z(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw Ld(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw Ld(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return Bd(a,r,a.length===0?0:i/a.length,t.getRandom())},Hd=e=>[Er(`RandomSubset`,2,t=>{let n=Z(t,0,`RandomSubset`);if(typeof n!=`number`)throw Ld(`first`,`RandomSubset`,`nonnegative integer`,Y(n));if(n<0)throw new b(`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=Z(t,1,`RandomSubset`);if(!Me(r)||!cn(r)&&!Yt(r))throw Ld(`second`,`RandomSubset`,`a finite set`,Y(r));return Dt($l(n,r,e.getRandom()))}),Er(`RandomSetOfSubsets`,3,t=>Vd(t,e)),Er(`TestRandomSetOfSubsets`,3,t=>Ut(Array.from({length:5},()=>q(Vd(t,e)).elements.length)))],Ud=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,Wd=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${Ud})`,Gd=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${Ud}) throws java.io.IOException`,Kd=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${Ud})`,qd=()=>Wt([[`action`,Dt([])],[`state`,Dt([])]]),Jd=()=>Wt([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),Yd=e=>Wt([[`name`,e??`UnnamedAction`],[`location`,Jd()]]),Xd=(e,t)=>{let n=e.map((e,t)=>Ut([t+1,Wt(Object.entries(e.state))])),r=n.slice(1).map((t,r)=>Ut([n[r],Yd(e[r+1].action),t])),i=t?[Ut([n[n.length-1],Yd(t.action),n[t.start]])]:[];return Wt([[`action`,Dt([...r,...i])],[`state`,Dt(n)]])},Zd=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return iu(e).get(t)},Qd=(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),Y(r));else throw new x(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${Y(n)}`)},$d=e=>e.every(e=>e!==void 0),ef=(e,t)=>Wt(t.variables.map((t,n)=>[t,e[n]])),tf=(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&&!X(e)){if(t.variableIndex.has(r))return!0;let e=Zo(r,t);if(e&&!n.has(e)&&(n.add(e),tf(e.body,t,n)))return!0}return dr(e).some(e=>tf(e,t,n))},nf=(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[Q(`AssertEq`,2,t=>{let n=Z(t,0,`AssertEq`),r=Z(t,1,`AssertEq`),i=et(n,r);return i||(e(Y(`Assertion failed`,!0)),e(Y(n,!0)),e(Y(r,!0))),i}),Hr(`AssertError`,2,e=>{let t=Cr(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw Fr(Wd,`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=Ur(e,0,`AssertError`)();try{Ur(e,1,`AssertError`)()}catch(e){if(e instanceof b)return e.message===n;throw e}return!1}),Er(`TLCGetOrDefault`,2,e=>{let n=Z(e,0,`TLCGetOrDefault`);return Zd(t,n)??Z(e,1,`TLCGetOrDefault`)}),{...Tr(`TLCGetAndSet`,4,n=>{let r=Z(n,0,`TLCGetAndSet`),i=Zd(t,r)??Z(n,3,`TLCGetAndSet`),a=Cr(n,1,`TLCGetAndSet`);return Qd(t,e,r,a.call([i,Z(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Er(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!$d(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Fr(Gd,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return Ut(t.getBehavior(r).map(e=>ef(e,n.environment)))}),Er(`CounterExample`,0,()=>t.counterExample??qd()),Q(`ToTrace`,1,e=>{let t=Z(e,0,`ToTrace`);if(!P(t)||!et(Nn(t),Dt([`action`,`state`])))throw new b(`The argument of ToTrace should be a CounterExample, but instead it is:\n${Y(t)}`);let n=q(jn(t,`state`)).elements.map(e=>hn(e)??[]);return Ut(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),Q(`TLCModelValue`,1,e=>{let t=Z(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new x(`The argument of ModelValue should be a string, but instead it is:\n${Y(t)}`);return Ze(t)}),Hr(`TLCDefer`,1,()=>!0),Q(`TLCNoOp`,1,e=>Z(e,0,`TLCNoOp`)),Hr(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!$d(r))throw Fr(Kd,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||Xo(Ur(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new te(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Hr(`TLCCache`,2,(e,t)=>{let r=Cr(e,0,`TLCCache`),a=er(Ur(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=tf(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}),Q(`TLCFP`,1,e=>Number(BigInt.asIntN(32,Rl([Z(e,0,`TLCFP`)])))),Er(`TLCEvalDefinition`,1,(e,t)=>{let n=Z(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?Zo(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new x(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${Y(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new x(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return cc({kind:`Identifier`,name:n,location:r.location},t)})]},rf=(e,t)=>[Er(`_Track`,2,e=>{let n=String(Z(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,Z(e,0,`_Track`)===!0?r+1:r),!0}),Er(`_Counts`,0,()=>ru(t)),Er(`_CheckName`,1,n=>{let r=String(Z(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(Y(ru(t),!0)),!1)}),Er(`_PrintCounts`,0,()=>(e(Y(ru(t),!0)),!0))],af=e=>String(e).padStart(2,`0`),of=e=>`${e.getUTCFullYear()}.${af(e.getUTCMonth()+1)}.${af(e.getUTCDate())}.${af(e.getUTCHours())}${af(e.getUTCMinutes())}${af(e.getUTCSeconds())}`,sf=e=>Nt([...e].map(([e,t])=>[e,Ut([t])])),cf=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),lf=(e,t,n)=>{if(!e.isStarted&&cf.has(t))throw new b(`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 Wt([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return Wt([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Wt([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Be(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Be(of(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Yd(void 0);case`all`:return sf(e.registers);case`all:named`:return sf(iu(e))}if(t.startsWith(`s:`)){let n=iu(e).get(t);if(n===void 0)throw new b(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Be(e.properties.get(t.slice(2))??t);throw new b(`TLCGet(${t}) was undefined.`)},uf=e=>e.length===0?[[]]:e.flatMap((t,n)=>uf([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),df=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&q(e).elements.forEach(df),e.kind===`Function`&&e.range.forEach(df))},ff=(t,n)=>[Q(`Print`,2,e=>(t(`${Oe(Y(Z(e,0,`Print`),!0,!0))} ${Oe(Y(Z(e,1,`Print`),!0,!0))}`),Z(e,1,`Print`))),Q(`PrintT`,1,e=>(t(Oe(Y(Z(e,0,`PrintT`),!0,!0))),!0)),Q(`Assert`,2,t=>{if(Z(t,0,`Assert`)!==!0)throw new x(`The first argument of Assert evaluated to FALSE; the second argument was:\n${Oe(Y(Z(t,1,`Assert`)))}`,e.assertViolation);return!0}),Q(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),Q(`:>`,2,e=>Nt([[Z(e,0,`:>`),Z(e,1,`:>`)]])),Q(`@@`,2,e=>{let t=Sr(e,0,`@@`),n=Sr(e,1,`@@`);return Pt([...I(t),...I(n)])}),Q(`ToString`,1,e=>Be(Y(Z(e,0,`ToString`),!0))),Q(`TLCEval`,1,e=>{let t=Z(e,0,`TLCEval`);return df(t),t}),Q(`Permutations`,1,e=>{let t=br(e,0,`Permutations`);return Dt(uf(t).map(e=>Nt(t.map((t,n)=>[t,e[n]]))))}),Tr(`SortSeq`,2,e=>{let t=Cr(e,1,`SortSeq`);return Ut(xr(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)]},[]))}),Er(`TLCGet`,1,(e,t)=>{let r=Z(e,0,`TLCGet`);if(typeof r==`number`&&r>=0){let e=n.registers.get(r);if(e===void 0)throw new b(`TLCGet(${r}) was undefined.`);return e}if(typeof r!=`string`)throw new b(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${Y(r)}`);return lf(n,r,t?.state)}),Er(`TLCSet`,2,e=>{let r=Z(e,0,`TLCSet`);return Qd(n,t,r,Z(e,1,`TLCSet`)),!0}),wr(`Any`,qe),Q(`RandomElement`,1,e=>tu(vr(e,0,`RandomElement`),n.getRandom()))],pf=/* @__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(`,`),mf=[[`\\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`,`≀`],[`^+`,`⁺`]],hf=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***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(`,`),gf=/* @__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(`.`),_f=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),vf=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
94
113
  Nat == { }
95
114
  a+b == {a, b}
96
115
  a-b == CHOOSE n : b + n = a
@@ -406,16 +425,15 @@ _CheckName(name) ==
406
425
  => (PrintT(counts) /\\ FALSE)
407
426
  _PrintCounts == PrintT(_Counts)
408
427
  =============================================================================
409
- `]]),Su=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])]]),Cu=(e,t)=>e.every(e=>$t(e,t)),wu=ft([!1,!0]),Tu=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return _t(Tu(e,t,r),Tu(e,r,n))},Eu=[`\\cup`,`\\cap`,`\\`],Du=e=>typeof e==`object`&&e.kind===`MixedSet`,Ou=e=>e.kind===`Interval`?z(e).elements:e.elements,ku=(e,t,n)=>{let r=Ou(t);if(e!==`\\cup`){let t=e===`\\cap`;return pt(r.filter(e=>$t(e,n)===t))}if(r.length===0)return n;if(!de(n))return{kind:`SetOperation`,operator:e,left:t,right:n};let i=z(n).elements.filter(e=>!$t(e,t));return pt([...r,...i])},Au=[Xn(`TRUE`,!0),Xn(`FALSE`,!1),Xn(`BOOLEAN`,wu),Xn(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),$n(`=`,ut),$n(`#`,(e,t)=>!ut(e,t)),G(`~`,1,e=>!Hn(e,0,`~`)),G(`<=>`,2,e=>Hn(e,0,`<=>`)===Hn(e,1,`<=>`)),G(`/\\`,2,e=>Hn(e,0,`/\\`)&&Hn(e,1,`/\\`)),G(`\\/`,2,e=>Hn(e,0,`\\/`)||Hn(e,1,`\\/`)),G(`=>`,2,e=>!Hn(e,0,`=>`)||Hn(e,1,`=>`)),G(`\\in`,2,e=>$t(W(e,0,`\\in`),W(e,1,`\\in`))),G(`\\notin`,2,e=>!$t(W(e,0,`\\notin`),W(e,1,`\\notin`))),G(`\\subseteq`,2,e=>{let t=Un(e,0,`\\subseteq`),n=Un(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&R(t.base)?Cu(z(t.base).elements,n.base):Cu(z(t).elements,n)}),...Eu.map(e=>G(e,2,t=>{let n=Un(t,0,e),r=Un(t,1,e);return de(n)&&de(r)&&!Du(n)&&!Du(r)?e===`\\cup`&&B(n)?r:(e===`\\cup`?_t:e===`\\cap`?gt:ht)(z(n),z(r)):de(n)?ku(e,n,r):e!==`\\`&&de(r)?ku(e,r,n):{kind:`SetOperation`,operator:e,left:n,right:r}})),G(`SUBSET`,1,e=>({kind:`Subset`,base:Un(e,0,`SUBSET`)})),G(`UNION`,1,e=>{let t=Un(e,0,`UNION`),n=Qe(t)?t.elements.filter(Qe):[];if(!Qe(t)||n.length!==t.elements.length)return{kind:`Union`,base:t};if(Du(t)||n.some(Du)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{$t(t,e)||e.elements.push(t)})),pt(e.elements)}return n.length===0?mt:Tu(n.map(z),0,n.length)}),G(`DOMAIN`,1,e=>{let t=W(e,0,`DOMAIN`);if(!M(t))throw new u(`DOMAIN expects a function but received ${H(t)}`);return cn(t)})],ju=ur(`DotDot`,`IntervalValue`,2),Mu=ur(`Neg`,`IntValue`,1),Nu=[Xn(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),dr(`+`,`Plus`,(e,t)=>e+t),dr(`-`,`Minus`,(e,t)=>e-t),dr(`*`,`Times`,(e,t)=>e*t),dr(`^`,`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}),dr(`\\div`,`Divide`,(e,t)=>{if(t===0)throw new d(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if(er(n))throw tr(`${e} \\div ${t}`);return n}),dr(`%`,`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}),pr(`<`,(e,t)=>e<t),pr(`>`,(e,t)=>e>t),pr(`<=`,(e,t)=>e<=t),pr(`>=`,(e,t)=>e>=t),G(`..`,2,e=>({kind:`Interval`,low:lr(W(e,0,`..`),ju),high:lr(W(e,1,`..`),ju)}))],Pu=[Xn(`Int`,{kind:`InfiniteSet`,name:`Int`}),G(`-.`,1,e=>{let t=lr(W(e,0,`-`),Mu);if(er(-t))throw tr(`-${t}`);return-t})],Fu=(e,t,n)=>{let r=W(e,t,n),i=Xt(r);if(!i)throw new d(`${n}\n${H(r)}`);return i},Iu=(e,t,n)=>{let r=W(e,t,n);return typeof r==`string`?r:Fu(e,t,n)},Lu=(e,t,n)=>typeof e==`string`?Ee(e.slice(t,n)):Ot(e.slice(t,n)),Ru=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,zu=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Bu=(e,t)=>{let n=Su.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?cr(e,t):e}):t},Vu=Bu(`Sequences`,[G(`Seq`,1,e=>({kind:`SequenceSet`,base:W(e,0,`Seq`)})),G(`Len`,1,e=>Iu(e,0,Ru(``,`Len`)).length),G(`\\o`,2,e=>{let t=Iu(e,0,zu(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Fu(e,1,zu(`t \\o s`,`sequence`));return Ot([...t,...n])}let n=W(e,1,`\\o`);if(typeof n!=`string`)throw new d(`${zu(`t \\o s`,`string`)}\n${H(n)}`);return Ee(t+n)}),G(`Append`,2,e=>Ot([...Fu(e,0,zu(`Append(s, v)`,`sequence`)),W(e,1,`Append`)])),G(`Head`,1,e=>{let t=Fu(e,0,Ru(``,`Head`));if(t.length===0)throw new d(`Attempted to apply Head to the empty sequence.`);return t[0]}),G(`Tail`,1,e=>{let t=Iu(e,0,Ru(``,`Tail`));if(t.length===0)throw new d(`Attempted to apply Tail to the empty sequence.`);return Lu(t,1)}),G(`SubSeq`,3,e=>{let t=Iu(e,0,Ru(`first `,`SubSeq`)),n=Vn(e,1,`SubSeq`),r=Vn(e,2,`SubSeq`);if(n>r)return Lu(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${H(W(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Lu(t,n-1,r)}),Zn(`SelectSeq`,2,e=>{let t=Yn(e,1,`SelectSeq`);return Ot(Fu(e,0,Ru(`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${H(n)}`);return n}))})]),Hu=Bu(`FiniteSets`,[G(`IsFiniteSet`,1,e=>{let t=W(e,0,`IsFiniteSet`);if(j(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${H(t)}\nis a finite set.`:`Attempted to check if the ${fe(t)} ${H(t)} is a finite set.`)}),G(`Cardinality`,1,e=>{let t=W(e,0,`Cardinality`);if(!j(t)||typeof t==`object`&&(t.kind===`InfiniteSet`||t.kind===`SequenceSet`))throw new d(`Attempted to compute cardinality of the value\n${H(t)}`);return Kt(t)})]),Uu=/* @__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`]]]),Wu=(e,t,n,r)=>{switch(e){case`Naturals`:return{extends:[],operators:Nu};case`Integers`:return{extends:[`Naturals`],operators:Pu};case`Sequences`:return{extends:[],operators:Vu};case`FiniteSets`:return{extends:[],operators:Hu};case`TLC`:return{extends:[],operators:Bu(`TLC`,hu(t,n))};case`Randomization`:return{extends:[],operators:Kl(n)};case`_Possible`:return{extends:[],operators:su(t,n)};case`Json`:return{extends:[],operators:Bl(r)};case`Bags`:return{extends:[],operators:yl};case`TLCExt`:return{extends:[],operators:ou(t,n)};default:return}},Gu=`$subexpression`,Ku=(e,t)=>new c(`${e} at line ${t.line}, column ${t.column}`),qu=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Ju=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Yu=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}},Xu=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Rr(e.bounds),body:e.body,sets:qu(e.bounds)};case`SetMap`:return{names:Rr(e.bounds),body:e.expression,sets:qu(e.bounds)};case`SetFilter`:return{names:Lr(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Lr(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}},Zu=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Zu(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of Ln(e)){let e=Zu(r,t,n);if(e)return e}},Qu=(e,t,n)=>e.length===0&&n.length>0?n.splice(0,t):e,$u=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),ed=(e,t)=>{let n=e.location,r=$u(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 Ku(`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 Ku(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Gu,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Gu,args:e.args,location:n,resolution:Dr},location:n}},td=(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:Dr})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Dr}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Dr};return ed({...t,params:[...t.params,...r]},a)},nd=(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 Ku(`Expected an operator name`,n);o.push(c.name),s.push(...c.args);let l=o.join(`!`),u=i?i.find(e=>bi(e)===l):t(l);if(u)return{definition:u,args:Qu(s,Mr(u),r)};a.index++}throw Ku(`Unknown operator ${o.join(`!`)}`,n)},s=t=>{let r=o(t),s=r.definition,c=Mr(s),l=a.index===e.length-1;if(r.args.length!==c&&r.args.length!==0)throw Ku(`The operator ${s.name} requires ${c} arguments`,n);if(l)return{definition:s,args:r.args};if(s.kind!==`Operator`)throw Ku(`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&&Zu(a.current,t.name,[]);if(!o)throw Ku(`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(...Qu(t.args,o.label.params.length,r)),a.current=o.label.body,a.index++}},l=t=>{let o=a.current;if(!o)throw Ku(`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`||Ju(t.operand,1)!==0)throw Ku(`A LET/IN expression has only one operand`,n);i.lets.push(o.definitions),a.current=o.body;return}let s=Xu(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(...Qu(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[Ju(t.operand,r.length)],s=e[a.index+1];if(!i||s?.kind!==`Operand`)throw Ku(`A subexpression of CASE must have the form !i!j`,n);a.index++;let c=Ju(s.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw Ku(`Nonexistent CASE operand`,n);a.current=l;return}if(t.kind!==`Operand`)throw Ku(`Unexpected subexpression selector`,n);let c=s?s.sets:Yu(o),u=c?.[Ju(t.operand,c.length)];if(!u)throw Ku(`Nonexistent operand specified by the selector`,n);a.current=u},u=s(void 0);if(u)return td(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 Ku(`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 td(e.definition,{...i,args:[...i.args,...e.args]});c()}else l(t),a.index++}if(!a.current)throw Ku(`Subexpression selection failed`,n);return ed(i,a.current)},rd=(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:[]}))]},id=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Ln(e).some(id),ad=(e,t)=>{if(!id(e))return e;if(e.kind===`Let`){let n=n=>e.definitions.find(e=>e.name===n)??t(n);return Ci(e,e=>ad(e,n))}let n=Ci(e,e=>ad(e,t));if(n.kind===`Subexpression`)return nd(n.selectors,t,n.location,[]);let r=n.kind===`Identifier`?n.name:n.kind===`Apply`?n.operator:``,i=rd(r,t);if(!i)return n;let a=n.kind===`Apply`?[...n.args]:[],o=nd(i,t,n.location,a);if(a.length>0)throw Ku(`Too many arguments for ${r}`,n.location);return o},od=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},sd=(e,t)=>{let n=od(t.definitions);return{...e,substitutions:e.substitutions.map(e=>({name:e.name,expression:ad(e.expression,n)}))}},cd=(e,t)=>{let n=od([...t,...e.definitions]);return e.definitions.some(e=>id(e.body))||e.assumptions.some(e=>id(e.expression))?{...e,definitions:e.definitions.map(e=>Si(e,e=>ad(e,n))),assumptions:e.assumptions.map(e=>({...e,expression:ad(e.expression,n)}))}:e},ld=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}])),ud=(e,t)=>`${e}${t}`,dd=(e,t,n)=>`${e}${t}${n}`,fd=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},pd=(e,t,n)=>`${e},${t},${n}`,md=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),hd=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),gd=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),_d=(e,t,n,r)=>({...md(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),vd=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,yd=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,bd=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,{..._d(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),xd=_d(`$Set`,0,[2],[1]),Sd=_d(`$Junction`,0,[3],[1]),Cd=_d(`$Choose`,0,[2],[1]),wd=_d(`$Function`,0,[3],[1]),Td=_d(`$FcnApply`,0,[2,2],[1,1]),Ed=_d(`$RcdSelect`,0,[2,0],[1,1]),Dd=_d(`'`,2,[1],[0]),Od=_d(`ENABLED`,1,[2],[0]),kd=_d(`[]`,3,[3],[0]),Ad=_d(`$SquareAct`,2,[2,1],[0,0]),jd=_d(`$WF`,3,[1,2],[0,0]),Md=_d(`$TemporalExists`,3,[3],[0]),Nd=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Pd=e=>e.map(e=>({name:e,arity:0})),Fd=(e,t)=>new c(`${e} at line ${t.line}, column ${t.column}`),Id=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Ld=e=>e.kind!==`Let`&&e.kind!==`Label`,Rd=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=bd.get(t)??ld.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=md(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(dd(e,n,t))}),t.data.constraints.forEach((e,t)=>hd(r.constraints,t,e)),gd(r.argConstraints,ud(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>gd(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>vd(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(pd(t,n,r)),s=md(Math.max(e.level,...t.filter((t,n)=>yd(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)=>{yd(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)=>hd(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||hd(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>hd(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||hd(s.constraints,t,vd(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=>hd(s.constraints,e,vd(r,a)))}))}),e.argParams.forEach(e=>{let t=fd(e),n=a(t.operator)?.operator;n&&hd(s.constraints,t.param,vd(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>gd(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>gd(s.argConstraints,ud(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&gd(s.argConstraints,ud(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=fd(e),n=a(t.operator);n&&gd(s.argConstraints,ud(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(fd(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=fd(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(dd(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(dd(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(dd(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=g(`LAMBDA`,Pd(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=md();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=Nd(n,Pd(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 Fd(`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 Fd(`Action used where only temporal formula or state predicate allowed`,e.location);Id.has(e.operator)&&u(t,e.location)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Ld(n)&&n.kind!==r)throw Fd(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)=>hd(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>gd(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 md();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(Sd,n)}case`Prime`:case`Unchanged`:return s(Dd,[e.expression],t);case`Enabled`:return s(Od,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(kd,[n])}case`If`:return s(Sd,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(Sd,[...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(Sd,[e.body],t,e.bounds.map(e=>e.set),Rr(e.bounds));if(n.level===3&&e.bounds.some(e=>m(e.set,t).level===2))throw Fd(`Action-level bound of quantified temporal formula`,e.location);return n}case`UnboundedQuantifier`:return s(e.isTemporal?Md:Sd,[e.body],t,[],e.names);case`Choose`:return s(Cd,[e.body],t,e.set?[e.set]:[],Lr(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(xd,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(xd,[e.predicate],t,[e.bound.set],Lr(e.bound.pattern));case`SetMap`:return s(xd,[e.expression],t,e.bounds.map(e=>e.set),Rr(e.bounds));case`FunctionConstruction`:return s(wd,[e.body],t,e.bounds.map(e=>e.set),Rr(e.bounds));case`Record`:return s(wd,e.fields.map(e=>e.value),t);case`RecordSet`:return s(xd,e.fields.map(e=>e.value),t);case`Except`:return s(xd,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(Td,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(xd,e.args,t)}]);case`FieldAccess`:return i(Ed,[a(e.record,t),{data:md()}]);case`BoxAction`:case`AngleAction`:return s(Ad,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(jd,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return md()}},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 Ln(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,Nd(t,Pd(e.names))),i;default:return Ci(e,(e,n)=>(a(e,r,Nd(t,Pd(n))),e)),i}},g=(e,t,n,r)=>{let i=Nd(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=h(n,i),c={...md(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(ud(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(dd(e.name,n,t.name))).map(e=>pd(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(fd(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=fd(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,{...md(),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}},zd=(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`?zd(e,r,n):n.analyze(e,r)}),n.analyze(e.conclusion,r)},Bd=(e,t)=>{let n=Rd(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`?zd(e.statement,/* @__PURE__ */ new Map,n):n.analyze(e.statement,/* @__PURE__ */ new Map))},Vd=(e,t)=>e.maxLevels[t]??3,Hd=(e,t)=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=Rd({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=>hd(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>hd(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>gd(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=fd(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(ud(t.name,a));o!==void 0&&Vd(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=fd(t),r=d.find(e=>e.name===n.operator)?.operator,a=d.find(e=>e.name===n.param);if(!r||!a)return;let o=Vd(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
- `))},Ud=t=>{switch(t.kind){case`Number`:try{return pe(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Pe(t.name);case`Set`:return ft(t.elements.map(Ud))}},Wd=e=>[...e.constants,...e.variables.map(e=>({name:e,arity:0}))],Gd=e=>new c(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),Kd=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:Dr},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),qd=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>H(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`)&&Le(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:H(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},Jd=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||Ln(e).some(e=>Jd(e,t)),Yd=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Mi(e),n.get(e)??n.size)),n},Xd=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Zd=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Ka(e);if(e.kind===`Number`&&!Io(e.value))throw qa(e);Zd(e.kind===`Let`?[...Ln(e),...Xd(e.instances??[])]:Ln(e))}),Qd=(e,t)=>{let n=hc(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=new Map(Au.map(e=>[e.name,e])),s=/* @__PURE__ */ new Map,d=Xc(e.checkDeadlock,t.seed),f=/* @__PURE__ */ new Map,p=/* @__PURE__ */ new Map,m=[],h=/* @__PURE__ */ new Map,g=[],_=[],v=(e,t)=>g.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),y={value:0},ee=e=>`${e}#${y.value++}`,b=[],x=/* @__PURE__ */ new Map,te=e=>{let n=s.get(e);if(n)return n;let r=Wu(e,t.print,d,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},ne=e=>{let t=te(e);return t&&v(e,Uu.get(e)??[]),t},re=e=>(Zd([...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]),...Xd(e.instances)]),e.modules.forEach(re),e);re(n);let S=(e,n)=>{let r=t.loadModule?.(e)??Is.get(e)??pc(t.source,e);if(r===void 0)throw new c(`Cannot find source file for module ${e} imported in module ${n}.`);let i=hc(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 re(i)},ie=e=>{let t=_.indexOf(e.name);if(t!==-1)throw new c(`Circular dependency among .tla files; dependency cycle is: ${[..._.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[];_.push(e.name),g.push(n);let i=se(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r});g.pop(),_.pop();let a=r.find(e=>n.has(e.name));if(a)throw Gd(a);return{linked:i,closure:n}},C=(e,t)=>{let n=f.get(e);if(n)return v(e,h.get(e)??[]),n;let r=ie(S(e,t));return f.set(e,r.linked),h.set(e,r.closure),v(e,r.closure),r.linked},ae=(e,t,n,o,s)=>{let c=s?void 0:ne(e.module);if(c)return e.name===void 0?c:new Map([...c].map(([t,n])=>[`${e.name}!${t}`,n]));let l=s??C(e.module,t.name),u=Wd(l),d=`#${y.value++}`,f=new Map(e.params.map(e=>[e.name,`${e.name}${d}`])),p=pi(sd(e,t),u,t,n);b.push({module:e.module,instancer:t.name,lets:[],substitutions:p,location:e.location});let m=Wi({params:e.params.map(e=>({...e,name:`${e.name}${d}`})),substitutions:new Map([...p].map(([e,t])=>[e,_i(t,f)])),variables:new Set(l.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,s,c)=>{let l=ee(`${s}@${t.name}`);return r.set(l,c(l)),i.set(l,!o),a.set(l,{source:n,prefix:e.params.length}),l},createName:ee}),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&&x.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&&x.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:Dr})),oe=(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:ne(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=T(n.arity);return oe(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??C(e.module,n),l=`#${y.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=Wd(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};b.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=>Jd(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=[],_=Wi({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:Dr}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:Dr}])),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}:Kd(a,i)),i},createName:ee}),v=new Set(d.map(e=>e.name)),x=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),i=T(n.arity),a=[...e.params,...i];return oe(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...x]},O=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),se=(e,a)=>{let o=Ws(e,t.loadClass?.(e.name)),s=new Map([...Au.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),h=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:ne(e);if(n){g(n,!0);return}let r=t??C(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),h.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=>jr(t.location,e)).map(e=>[e.name,{key:e.name,arity:e.arity,declaration:e.kind}]),...o.definitions.filter(t=>jr(t.location,e)).map(e=>[e.name,{key:v(e),arity:Mr(e)}])]),te=e=>{let t=b();if(t.has(e.name))throw Gd(e);a.nested.push(e);let n=se(e,{id:`${a.id}/${e.name}`,symbols:x(e.location),modules:t,nested:a.nested});l.set(e.name,n),p.has(e.name)||p.set(e.name,n)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=ae(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)=>jr(e.location,t.location)?-1:1).forEach(e=>e.link()),di(o,ee(o));let re=e=>{let t=o.instances.find(t=>t.module===e.name);return t!==void 0&&jr(e.location,t.location)},S=e=>{let t=o.modules.find(t=>t.name===e.module);return t?re(t)?l.get(t.name):void 0:b().get(e.module)},ie=cd(Ji(o,(e,t)=>D(e,t,o.name,S(e))),O(s));mi(ie,ee(ie)),ie.definitions.forEach(e=>{let t=v(e);r.set(t,e),i.set(t,!_);let n={key:t,arity:Mr(e)};s.set(e.name,n),e.isLocal||c.set(e.name,n)}),Bd(ie,{constants:new Set(d.map(e=>e.name)),variables:new Set(f),getDefinition:e=>r.get(s.get(e)?.key??e)});let w={module:ie,constants:d,variables:f,variableLocations:h,visible:s,exported:c,modules:l,extended:u};return m.push(w),w},k=ie(n).linked,ce=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 le=[],ue=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>ue(e,t)),le.push(...e.module.assumptions))};ue(k,/* @__PURE__ */ new Set);let A=k.constants.map(e=>e.name),j=k.variables,de=e=>e.module===void 0?[e.name,ce(e.name)]:e.module===n.name||A.includes(e.name)?[]:[(f.get(e.module)??p.get(e.module))?.visible.get(e.name)?.key??e.name],M=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:k.constants.find(t=>t.name===e)?.arity??0},N=/* @__PURE__ */ new Map,fe=/* @__PURE__ */ new Set,pe=(e,t)=>{o.set(e,t),r.delete(e),N.delete(e),fe.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=Ud(e.value);de(e).forEach(e=>{let n=M(e);n===0?N.set(e,t):pe(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 l(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(Ud),Ud(e.value)]),me.set(t,n)}),me.forEach(e=>de(e).forEach(t=>pe(t,qd(e.name,M(t)||e.rows[0][0].length,e.rows))));let he=new Map(e.substitutions.flatMap(e=>de(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(!A.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=ce(i),s=r.get(a);if(!(s!==void 0||o.has(a)||N.has(a)||A.includes(i)||j.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 ge=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(de)),_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=oe(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)})}),A.forEach(e=>{if(!N.has(e)&&!he.has(e)&&!fe.has(e))throw new l(`The constant ${e} is not assigned a value by the configuration`)});let ve={runtime:d,definitions:r,builtins:o,constants:N,substitutions:he,variables:j,variableIndex:Yd(j,m.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,evaluators:/* @__PURE__ */ new WeakMap};Hd(b,e=>{let t=f.get(e)??p.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 ye=Rd({constants:new Set(N.keys()),variables:/* @__PURE__ */ new Set([...j,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>o.has(e))]),getDefinition:e=>$a(e,ve)}),be=e=>{try{return X(e,{environment:ve,scope:void 0,state:void 0,next:void 0}),!0}catch(e){if(e instanceof u)return!1;throw e}};return he.forEach((e,t)=>{let n=r.get(e);if(A.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&ye.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0&&!be(n.body))throw new l(`The configuration file substitutes constant ${t} with non-constant ${e}`)}),d.isStarted=!0,{environment:ve,assumptions:le,variableLocations:k.variableLocations,instanceActions:x}},$d={kind:`Boolean`,value:!0},ef={kind:`Boolean`,value:!1},tf=e=>e?$d:ef,nf=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,rf=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,Q=(e,t)=>({kind:e,body:t}),af=(e,t,n)=>({kind:e,operands:[t,n]}),of=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?of(e,t.operands).operands:[t])}),sf=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return sf(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,sf(t)),0)}},cf=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 cf(e.body);case`And`:case`Or`:return e.operands.some(cf)}},lf=/* @__PURE__ */ new WeakMap,uf={count:0},df=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`#${uf.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(df).join(`,`)})`;default:return`${e.kind}(${df(e.body)})`}})();return lf.set(e,n),n},ff=(e,t)=>e===t||df(e)===df(t),pf=(e,t)=>{let n=df(t);return e.some(e=>e===t||df(e)===n)},mf=e=>e===`And`?`Or`:`And`,hf=(e,t)=>{switch(e.kind){case`Boolean`:return t?tf(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?Q(`Not`,e):e;case`Not`:return hf(e.body,!t);case`And`:case`Or`:return of(t?mf(e.kind):e.kind,e.operands.map(e=>hf(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return Q(n,hf(e.body,t))}}},gf=e=>{switch(e.kind){case`Boolean`:return tf(!e.value);case`Not`:return e.body;case`And`:case`Or`:return of(mf(e.kind),e.operands.map(gf));case`Always`:return Q(`Eventually`,gf(e.body));case`Eventually`:return Q(`Always`,gf(e.body));default:return Q(`Not`,e)}},_f=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=_f(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return tf(t)}return n.length===0?tf(!t):n.length===1?n[0]:of(e.kind,n)}case`Not`:{let t=_f(e.body);return t.kind===`Boolean`?tf(!t.value):Q(`Not`,t)}case`Always`:case`Eventually`:{let t=_f(e.body);return Q(e.kind,t.kind===e.kind?t.body:t)}default:return e}},vf=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 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=>of(`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=vf(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:of(`Or`,t);n.push(Q(`Always`,Q(`Eventually`,e)))}return of(`Or`,n)}case`Not`:return nf(e.body)?e:yf(gf(e.body));default:return e}},bf=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?bf(e.operands[0]):of(e.kind,e.operands.map(bf));case`Not`:return e.body.kind===`Not`?bf(e.body.body):Q(`Not`,bf(e.body));case`Always`:case`Eventually`:case`Next`:return Q(e.kind,bf(e.body));default:return e}},xf=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return xf(e.operands[0]);let t=Math.floor(e.operands.length/2);return af(e.kind,xf(of(e.kind,e.operands.slice(0,t))),xf(of(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return Q(e.kind,xf(e.body));default:return e}},Sf=(e,t)=>{e.kind===`Eventually`&&!pf(t,e)&&t.push(e),`body`in e&&Sf(e.body,t),`operands`in e&&e.operands.forEach(e=>Sf(e,t))},Cf=e=>{let t=e.filter(rf),n=e.flatMap(e=>e.kind===`Not`&&rf(e.body)?[e.body]:[]);return!t.some(e=>pf(n,e))},wf=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},Tf=(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]}},Ef=(e,t,n)=>e.flatMap(e=>{let r=Tf(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Df=e=>[...new Set(e.map(df))].sort().join(`|`),Of=(e,t)=>{let n=new Set(t.map(Df));return[...e.filter(e=>!n.has(Df(e))),...t]},kf=e=>{let t=wf(e),n=Ef(t,`Always`,`And`),r=Ef(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Tf(t,`Eventually`,`Or`);if(n&&!(pf(e,n.first)||pf(e,n.second)))return Of(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(pf(e,t.first)||pf(e,t.second))&&!pf(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Cf(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Tf(t[e],`Always`,`And`);n&&(pf(t,n.first)||t.push(n.first),pf(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)pf(t,e.first)&&pf(t,e.second)&&!pf(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Cf(t)?[]:i(t)};return a(e)},Af=e=>({particle:e,successors:[],statePredicates:e.filter(e=>sf(e)<=1)}),jf=e=>{let t=kf([e]).map(Af),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Df(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 kf(n)){let n=Df(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Af(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Mf=(e,t)=>!pf(e,t)||pf(e,t.body),Nf=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&sf(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=vf(e);if(n){let e=sf(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(cf(e))throw new u(`TLC cannot handle the temporal formula: actions may only appear as []<>A or <>[]A`);t.formulas.push(e)},Pf=(e,t)=>{let n=e.findIndex(e=>ff(e,t));return n===-1?(e.push(t),e.length-1):n},Ff=e=>{let t=yf(_f(hf(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=bf(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Nf(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:of(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:ff(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&xf(e.formula),n=[];t&&Sf(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Pf(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Pf(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Pf(i,e))}));return{tableau:t&&jf(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},If=/* @__PURE__ */ new Set([`~>`,`-+->`]),Lf=/* @__PURE__ */ new WeakMap,Rf=/* @__PURE__ */ new WeakSet,zf=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Bf=e=>new u(`TLC cannot handle the temporal formula at ${J(e)}`),$=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=Ja(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=$a(e,n);if(t)return Vf(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:U(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Ci(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 If.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Vf=(e,t)=>{let n=Lf.get(e);if(n!==void 0)return n;Lf.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 Lf.set(e,i),i},Hf=`Temporal formula is a tautology (its negation is unsatisfiable).`,Uf=(t,r,i,a,o=``,s=/* @__PURE__ */ new Set)=>{let c=(e,t,n=o,r=s)=>Uf(e,t,i,a,n,r);if(t.kind===`And`)return t.operands.flatMap(e=>c(e,r,Ba(e)));if(t.kind===`Label`)return c(t.body,r);if(t.kind===`Let`)return c(t.body,Wf(t,r,i));if(t.kind===`Identifier`){let e=U(t)?Ja(r,t.name):void 0;if(e?.kind===`Thunk`)return c(e.expression,e.scope);let n=i.constants.has(t.name)?void 0:$a(t.name,i);if(!e&&n?.kind===`Operator`&&n.params.length===0&&Vf(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=zf(i,r);if(t.kind===`Apply`&&(e=>a||$(e,r,i)===3)(t)){let e=bo(t,d),n=U(t)?void 0:$a(t.operator,i);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive)return c(e.body,Mo(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(io(t.bounds,d,e=>(i.count++,r.push(...c(t.body,e,Ba(t.body))),!1)),i.count===0)throw n(new u(Hf),e.livenessEvaluationFailure);return r}return[{expression:t,scope:r,name:o}]},Wf=(e,t,n)=>{let r=Po(e.definitions,zf(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Rf.add(e.binding);return r},Gf=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),Kf=(e,t,n)=>{let r=(e,t,r)=>{let i=r===0?$(e,t,n):r;if(i===0){let r=X(e,zf(n,t));if(typeof r!=`boolean`)throw new u(`TLC expected a boolean in the temporal formula at ${J(e)}`);return tf(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 ${J(n)}`);i.depth++;let o=c(e,t);i.depth--;let s=sf(o);return s>2?o:r(n,a,s)},o=(e,t)=>{let r=e.kind===`Identifier`?e.name:e.operator,i=zf(n,t),o=U(e)||$a(r,n)===void 0?Ja(t,r):void 0;if(o?.kind===`Thunk`&&Rf.has(o))return a(o.expression,o.scope,e,t);let s=o?.kind===`Operator`?o.operator:o?void 0:U(e)?xo(r,i):vo(r,n);if(s?.kind!==`Closure`)throw Bf(e);let c=e.kind===`Apply`?e.args:[];return a(s.body,Mo(s,c,i),e,t)},s=(e,t)=>{if(!e.bounds.every(e=>$(e.set,t,n)===0))throw Bf(e);let i=[];io(e.bounds,zf(n,t),t=>(i.push(c(e.body,t)),!1));let a=e.kind===`Forall`;if(i.length===0)return tf(a);let o=of(a?`And`:`Or`,i),s=sf(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,Wf(e,t,n));case`Identifier`:return o(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?Q(`Always`,af(`Or`,Q(`Not`,c(n[0],t)),Q(`Eventually`,c(n[1],t)))):e.operator===`~`&&!U(e)?Q(`Not`,c(n[0],t)):e.operator===`=>`?af(`Or`,Q(`Not`,c(n[0],t)),c(n[1],t)):o(e,t)}case`And`:case`Or`:return of(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,zf(n,t));if(typeof r==`boolean`)return c(r?e.consequent:e.alternative,t)}let r=c(e.condition,t);return af(`Or`,af(`And`,r,c(e.consequent,t)),af(`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=Gf(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`,af(`Or`,i,a))):af(`Or`,Q(`Eventually`,Q(`Always`,i)),Q(`Always`,Q(`Eventually`,a)))}default:throw Bf(e)}};return c(e,t)},qf=(e,t,n,r,i)=>{let a=e=>qf(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`?Qa(X(e.expression,a),`a temporal property predicate`):Pa(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&&Qa(X(e.unchanged,a),`a subscript`)?!1:Qa(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 qf(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`)}},Jf=(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)=>Jf(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 qf(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Yf=(e,t)=>e.every((e,n)=>ze(e,t[n])),Xf=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Zf=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.successors.push([]),e.actions.push(/* @__PURE__ */ new Uint8Array),e.stateResults.push(/* @__PURE__ */ new Uint8Array),e.isWritten.push(!1),e.nodeStates.length-1),Qf=2**53-1,$f=(e,t,n,r)=>{if(e.length===0)return;let i=t.map(e=>Kf(e.expression,e.scope,n)),a=e.map(e=>Q(`Not`,Kf(e.expression,e.scope,n))),o=a.length===1?a[0]:of(`Or`,a),s=i.length===0?o:of(`And`,[...i,o]),c=Ff(s);if(c.length===0)throw new u(Hf);let l=/* @__PURE__ */ new Map,d=c.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=df(e),n=l.get(t)??l.size;return l.set(t,n),n}),nodeStates:[],nodeTableaux:[],successors:[],actions:[],stateResults:[],isWritten:[],initial:[],nodeIds:/* @__PURE__ */ new Map,nodesByState:/* @__PURE__ */ new Map,isDone:[],errorNode:void 0})),f={multiplier:1},p=!Ko(n),m={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},h=e=>{let t=m.states.get(e)??/* @__PURE__ */ new Map;return m.states.set(e,t),t},g=(e,t)=>{n.runtime.setLivenessSource(e);let r=t();return n.runtime.setLivenessSource(void 0),r},_=(e,t)=>qf(e,t,void 0,n,p?h(t):/* @__PURE__ */ new Map),v=(e,t,n)=>g(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!_(e,n))),y=(e,t,r,i)=>g(t,()=>{let t=e.solution.actionChecks;if(!p)return Uint8Array.from(t,e=>+!!qf(e,r,i,n,/* @__PURE__ */ new Map));let a=h(r),o=m.actions.get(r)??/* @__PURE__ */ new Map;m.actions.set(r,o);let s=o.get(i)??new Int8Array(l.size).fill(-1);return o.set(i,s),Uint8Array.from(e.actionIds,(e,o)=>(s[e]===-1&&(s[e]=+!!qf(t[o],r,i,n,a)),s[e]))}),ee=(e,t,n,r)=>g(n,()=>e.nodes[t].statePredicates.every(e=>_(e,r))),b=(e,t)=>{let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},x=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),te=(e,t,n)=>e.solution.tableau?e.nodeIds.get(t*e.solution.tableau.nodes.length+n):t,ne=(e,t,n)=>{let r=Zf(e,t,n);e.nodeIds.set(t*(e.solution.tableau?.nodes.length??1)+n,r);let i=e.nodesByState.get(t);return i?i.push(r):e.nodesByState.set(t,[r]),r},re=(e,t,n,r)=>{let i=e.solution.actionChecks.length,a=new Uint8Array(n.length*i);n.forEach((e,t)=>a.set(e,t*i)),e.actions[t]=a,e.stateResults[t]=r,e.isWritten[t]=!0},S=(e,t,n)=>{let i={slots:Array.from({length:16*f.multiplier}),count:0},a=(e,t)=>{for(let n=(r.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&&Yf(r.state,t.state))return!1}},o=e=>{if(i.count>=i.slots.length>>1){let e=i.slots;i.slots=Array.from({length:2*e.length+1});for(let t of e)t&&a(i.slots,t)}a(i.slots,e)&&i.count++};return n.forEach(o),o({index:e,state:t}),i.slots.length>16*f.multiplier&&f.multiplier++,i.slots.filter(e=>e!==void 0)},ie=(e,t,n,i,a)=>{let o=v(e,i,n),s=t.nodes[e.nodeTableaux[a]],c=[],l=e.successors[a],u=s.successors.length>0?y(e,i,n,n):/* @__PURE__ */ new Uint8Array;for(let r of s.successors){if(!ee(t,r,i,n))continue;if(b(t,r)&&e.errorNode===void 0&&x(e)){e.errorNode=a;return}let o=te(e,i,r);if(o!==void 0&&l.includes(o))continue;let s=o??ne(e,i,r);l.push(s),c.push(u),o===void 0&&ie(e,t,n,i,s)}for(let a of r.getSuccessors(n)){let r=y(e,i,n,a.state),o=e.isDone[a.index]===!0;for(let n of s.successors){if(!ee(t,n,i,a.state))continue;let s=te(e,a.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??ne(e,a.index,n);l.push(u),c.push(r),s===void 0&&o&&ie(e,t,a.state,a.index,u)}}l.length>0&&re(e,a,c,o)},C=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>ee(t,r,a,e.state)));e.isDone[a]=!0;for(let s of(e.nodesByState.get(a)??[]).slice()){let a=e.successors[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=te(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??ne(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&ie(e,t,n.state,n.index,d)}}),re(e,s,c,i)}if(e.errorNode!==void 0)return Xf(w(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},ae=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)Zf(e,e.nodeStates.length,-1);let a=e.successors[i],o=[];t.forEach((t,r)=>{e.isWritten[t.index]&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),re(e,i,o,r)},w=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)e.isWritten[t]&&(r.push(t),n.set(t,-1));for(let i=0;i<r.length;i++){let a=r[i];for(let i of e.successors[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}e.isWritten[i]&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new u(`Couldn't re-create liveness trace (path) starting at: ${t}`)},oe=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.actions[t][n*r+i]===1,a=(e,n)=>t.eventuallyAlways.every(t=>i(e,n,t)),o=new Float64Array(e.nodeStates.length).fill(-1),s=e.initial.filter(t=>e.isWritten[t]),c=[],l=t=>{let n=e.successors[t].indexOf(t);return n!==-1&&a(t,n)},d=(t,r)=>n.tableau!==void 0&&Mf(n.tableau.nodes[e.nodeTableaux[t]].particle,r),f=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=Qf;return}let u=/* @__PURE__ */ new Set,f=/* @__PURE__ */ new Map;for(let t=s;;t=c.pop()??r){u.add(t);let n=f.get(e.nodeStates[t]);if(n?n.push(t):f.set(e.nodeStates[t],[t]),o[t]=Qf,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...u].some(n=>e.stateResults[n][t]===1)),h=t.infinitelyOftenActions.every(t=>[...u].some(n=>e.successors[n].some((e,r)=>u.has(e)&&a(n,r)&&i(n,r,t)))),g=n.promises.every(e=>[...u].some(t=>d(t,e)));if(m&&h&&g)return p(r,u,f)},p=(r,o,s)=>{let c=Xf(w(e,r).reverse().map(t=>e.nodeStates[t])),l=[],f=/* @__PURE__ */ new Set([r]),p=t.infinitelyOftenStates.map(()=>!1),h=t.infinitelyOftenActions.map(()=>!1),g=n.promises.map(()=>!1),_={count:p.length+h.length+g.length},v={node:r},y=e=>o.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]&&e.stateResults[v.node][t]===1&&(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},o=_.count;if(e.successors[v.node].some((r,c)=>{if(s.has(e.nodeStates[r])){if(!y(r)||!a(v.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!h[t]&&i(v.node,c,e)&&(h[t]=!0,_.count--)})}return _.count<o?(ee(r),f.clear(),!0):(y(r)&&!f.has(r)&&(n.unvisited=r),!1)}))break;if(_.count<r){ee(n.last),f.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=e.successors[t].find(e=>y(e)&&!f.has(e))??-1}ee(n.unvisited),f.add(n.unvisited)}}let b=m(r,v.node,s,a);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()]}},m=(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 e.successors[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<s.length;t++){let n=[s[t],-1,0],r={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),l=n.pop()??0;if(i===-42){if(o[l]===t){let e=f(l);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(o[l]!==-1){n.push(Math.min(t,o[l]));continue}o[l]=r.link,n.push(t,l,-42),c.push(l);let u={value:r.link++};e.successors[l].forEach((t,r)=>{e.isWritten[t]&&(a(l,r)?o[t]===-1?n.push(t,-1):u.value=Math.min(u.value,o[t]):o[t]===-1&&s.push(t))}),n.push(u.value)}}};return{addInitialState:(e,t)=>{m.states.clear(),m.actions.clear();for(let n of d){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)ee(r,i,void 0,t)&&n.initial.push(te(n,e,i)??ne(n,e,i))}},addState:(e,t,n)=>{m.states.clear(),m.actions.clear();let r=S(e,t,n);for(let n of d){let i=r.map(r=>y(n,e,t,r.state)),a=v(n,e,t),o=n.solution.tableau,s=o?C(n,o,r,i,a,e):ae(n,r,i,a,e);if(s)return s}},findViolation:()=>{for(let e of d)for(let t of e.solution.models){let n=oe(e,t);if(n)return n}},getViolatedProperties:(t,r)=>[...new Set(e.filter((e,i)=>!Jf(a[i].body,t,r,0,n)).map(e=>e.name))]}},ep=`UnnamedAction`,tp={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},np=e=>{let t=e.range??tp;return kt([[`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`,np(e.location)]];return e.parameters.length===0?kt(t):kt([...t,[`context`,kt(e.parameters)],[`parameters`,Ot(e.parameters.map(e=>e[0]))]])},ip=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),ap=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),op=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,sp=e=>e.kind===`Apply`?e.args:[],cp=(e,t,n)=>{let r=op(e);if(r===void 0)return;if(U(e)){let e=Ja(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=vo(r,n);return i?.kind===`Closure`?i:void 0},lp=(e,t)=>{try{return X(e,ap(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`&&to(e,t)&&lp(e.body,t),dp=(e,t)=>{let n=$a(e.name,t);return n?.body===e.body&&up(n,t)},fp=(e,t)=>{if(e.kind!==`Identifier`||!U(e))return;let n=Ja(t,e.name);return n?.kind===`Thunk`?n:void 0},pp=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Ja(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),mp=(e,t)=>{try{return e()}catch(e){if(e instanceof s)return t();throw e}},hp=(e,t,n,r,i)=>{let a=sp(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():mp(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),X(e,ap(i,n))]),expression:t,scope:n}],o)},gp=(e,t,n,r,i)=>{let a=()=>({name:n?.name??ep,location:e.location,parameters:pp(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return gp(e.body,Po(e.definitions,ap(r,t)),n,r,i);case`Label`:return gp(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>gp(e,t,n,r,i));case`Exists`:return mp(()=>{let o=[];return io(e.bounds,ap(r,t),t=>(o.push(...gp(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=U(e)?void 0:i.get(op(e)??``),s=cp(e,t,r);if(o)return hp(o,e,t,s,r);if(!s)return[a()];let c=sp(e),l=()=>[{name:s.name,location:e.location,parameters:[],expression:e,scope:t}];return dp(s,r)||c.some(e=>$(e,t,r)!==0)?l():mp(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:X(n,ap(r,t))},parent:e}),s.scope);return gp(s.body,e,s,r,i)},l)},_p=(e,t,n,r,i)=>{let a=(e,t)=>_p(e,t,n,r,i);if(e.kind===`Let`){a(e.body,Po(e.definitions,ap(n,t)));return}let o=fp(e,t);if(o){a(o.expression,o.scope);return}let s=cp(e,t,n);if(s&&dp(s,n))return;if(s&&s.params.length===0){if($(s.body,s.scope,n)===1){r.inits.push(ip(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,Mo(s,e.args,ap(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(ip(ep,e));return}let c=$(e,t,n);c<=1?r.inits.push(ip(ep,e)):c===3&&r.temporals.push(ip(ep,e))},vp=(e,t,n,r,i)=>{let a=(t,n)=>vp(e,t,n,r,i);if(t.kind===`Let`){a(t.body,Po(t.definitions,ap(r,n)));return}let o=fp(t,n);if(o){a(o.expression,o.scope);return}let s=cp(t,n,r);if(s&&dp(s,r))return;if(s&&s.params.length===sp(t).length){a(s.body,t.kind===`Apply`?Mo(s,t.args,ap(r,n)):s.scope);return}if(t.kind===`Forall`&&mp(()=>(io(t.bounds,ap(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(ip(e,a)):$(a,n,r)<2?i.invariants.push(ip(e,a)):i.impliedTemporals.push(ip(e,t));return}let c=$(t,n,r);c<=1?i.impliedInits.push(ip(e,t)):c===3&&i.impliedTemporals.push(ip(e,t))},yp=(e,t)=>{let n=$a(e,t);return n?.kind===`Operator`&&!up(n,t)?n:void 0},bp=e=>kt([[`name`,e.name],[`location`,np(e.location)]]),xp=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:yp(e.specification,t);a&&(_p(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...gp(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:vo(e.init,t);o?.kind===`Closure`&&r.inits.push(ip(e.init??``,o.body));let s=e.next===void 0?void 0:vo(e.next,t);return s?.kind===`Closure`&&r.actions.push(...gp(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=yp(e,t);n&&r.invariants.push(ip(e,n.body))}),e.properties.forEach(e=>{let n=yp(e,t);n&&vp(e,n.body,void 0,t,r)}),r},Sp=(e,t,n)=>xp(e,t,n).actions,Cp=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>H(e[1])).join(`,`)})`,wp=e=>`${e.name===ep?`Action`:e.name}${Cp(e)} ${za(e.location.range??tp)}`,Tp=e=>`${e.name}${Cp(e)}`,Ep=(e,t,n,r)=>{let i=xp(e,t,r),a=e=>ft(e.map(rp)),o=e=>ft(e.flatMap(e=>{let n=yp(e,t);return n?[bp(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`,ft(t.variables.map((e,t)=>kt([[`name`,e],[`location`,np(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},Dp=`paired12`,Op=(e,t=16)=>e<=t*.75?t:Op(e,t*2),kp=(e,t)=>{let n=Op(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)},Ap=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),jp=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),Mp=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),Np=e=>Mp(e).replaceAll(`
411
- `,`\\n`),Pp=(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(``))}},Fp=(e,t)=>{let n=[`strict digraph DiskGraph {
428
+ `]]),yf=/* @__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)`]])]]),bf=(e,t)=>e.every(e=>yn(e,t)),xf=Dt([!1,!0]),Sf=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Mt(Sf(e,t,r),Sf(e,r,n))},Cf=[`\\cup`,`\\cap`,`\\`],wf=e=>typeof e==`object`&&e.kind===`MixedSet`,Tf=e=>e.kind===`Interval`?q(e).elements:e.elements,Ef=(e,t,n)=>{let r=Tf(t);if(e!==`\\cup`){let t=e===`\\cap`;return Ot(r.filter(e=>yn(e,n)===t))}if(r.length===0)return n;if(!Ne(n))return{kind:`SetOperation`,operator:e,left:t,right:n};let i=q(n).elements.filter(e=>!yn(e,t));return Ot([...r,...i])},Df=[wr(`TRUE`,!0),wr(`FALSE`,!1),wr(`BOOLEAN`,xf),wr(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Dr(`=`,Tt),Dr(`#`,(e,t)=>!Tt(e,t)),Q(`~`,1,e=>!gr(e,0,`~`)),Q(`<=>`,2,e=>gr(e,0,`<=>`)===gr(e,1,`<=>`)),Q(`/\\`,2,e=>gr(e,0,`/\\`)&&gr(e,1,`/\\`)),Q(`\\/`,2,e=>gr(e,0,`\\/`)||gr(e,1,`\\/`)),Q(`=>`,2,e=>!gr(e,0,`=>`)||gr(e,1,`=>`)),Q(`\\in`,2,e=>yn(Z(e,0,`\\in`),Z(e,1,`\\in`))),Q(`\\notin`,2,e=>!yn(Z(e,0,`\\notin`),Z(e,1,`\\notin`))),Q(`\\subseteq`,2,e=>{let t=_r(e,0,`\\subseteq`),n=Z(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&Yt(t.base)?bf(q(t.base).elements,n.base):bf(q(t).elements,n)}),...Cf.map(e=>Q(e,2,t=>{let n=Z(t,0,e),r=Z(t,1,e);if(Ne(n)&&Ne(r)&&!wf(n)&&!wf(r)){if(e===`\\cup`&&cn(n))return r;let t=e===`\\cup`?Mt:e===`\\cap`?jt:At;try{return t(q(n),q(r))}catch(e){if(!(e instanceof b))throw e}}return Ne(n)?Ef(e,n,r):e!==`\\`&&Ne(r)?Ef(e,r,n):{kind:`SetOperation`,operator:e,left:n,right:r}})),Q(`SUBSET`,1,e=>({kind:`Subset`,base:_r(e,0,`SUBSET`)})),Q(`UNION`,1,e=>{let t=_r(e,0,`UNION`),n=pt(t)?t.elements.filter(pt):[];if(!pt(t)||n.length!==t.elements.length)return{kind:`Union`,base:t};if(wf(t)||n.some(wf)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{yn(t,e)||e.elements.push(t)})),Ot(e.elements)}return n.length===0?kt:Sf(n.map(q),0,n.length)}),Q(`DOMAIN`,1,e=>{let t=Z(e,0,`DOMAIN`);if(!P(t))throw new b(`DOMAIN expects a function but received ${Y(t)}`);return Nn(t)})],Of=Rr(`Integers`,`Neg`,`IntValue`,1),kf=e=>{let t=Rr(e,`DotDot`,`IntervalValue`,2);return[zr(e,`+`,`Plus`,(e,t)=>e+t),zr(e,`-`,`Minus`,(e,t)=>e-t),zr(e,`*`,`Times`,(e,t)=>e*t),zr(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new x(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new x(`0^0 is undefined.`);return e**t}),zr(e,`\\div`,`Divide`,(e,t)=>{if(t===0)throw new x(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if(Or(n))throw kr(`${e} \\div ${t}`);return n}),zr(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new x(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),Q(`..`,2,e=>({kind:`Interval`,low:Lr(Z(e,0,`..`),t),high:Lr(Z(e,1,`..`),t)}))]},Af=[wr(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...kf(`Naturals`),Vr(`<`,(e,t)=>e<t),Vr(`>`,(e,t)=>e>t),Vr(`<=`,(e,t)=>e<=t),Vr(`>=`,(e,t)=>e>=t)],jf=[wr(`Int`,{kind:`InfiniteSet`,name:`Int`}),...kf(`Integers`),Q(`-.`,1,e=>{let t=Lr(Z(e,0,`-`),Of);if(Or(-t))throw kr(`-${t}`);return-t})],Mf=(e,t,n)=>{let r=Z(e,t,n),i=hn(r);if(!i)throw new x(`${n}\n${Y(r)}`);return i},Nf=(e,t,n)=>{let r=Z(e,t,n);return typeof r==`string`?r:Mf(e,t,n)},Pf=(e,t,n)=>typeof e==`string`?Be(e.slice(t,n)):Ut(e.slice(t,n)),Ff=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,If=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Lf=(e,t)=>{let n=yf.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Ir(e,t):e}):t},Rf=Lf(`Sequences`,[Q(`Seq`,1,e=>({kind:`SequenceSet`,base:Z(e,0,`Seq`)})),Q(`Len`,1,e=>Nf(e,0,Ff(``,`Len`)).length),Q(`\\o`,2,e=>{let t=Nf(e,0,If(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Mf(e,1,If(`t \\o s`,`sequence`));return Ut([...t,...n])}let n=Z(e,1,`\\o`);if(typeof n!=`string`)throw new x(`${If(`t \\o s`,`string`)}\n${Y(n)}`);return Be(t+n)}),Q(`Append`,2,e=>Ut([...Mf(e,0,If(`Append(s, v)`,`sequence`)),Z(e,1,`Append`)])),Q(`Head`,1,e=>{let t=Mf(e,0,Ff(``,`Head`));if(t.length===0)throw new x(`Attempted to apply Head to the empty sequence.`);return t[0]}),Q(`Tail`,1,e=>{let t=Nf(e,0,Ff(``,`Tail`));if(t.length===0)throw new x(`Attempted to apply Tail to the empty sequence.`);return Pf(t,1)}),Q(`SubSeq`,3,e=>{let t=Nf(e,0,Ff(`first `,`SubSeq`)),n=hr(e,1,`SubSeq`),r=hr(e,2,`SubSeq`);if(n>r)return Pf(t,0,0);let i=n<1?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new x(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${Y(Z(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Pf(t,n-1,r)}),Tr(`SelectSeq`,2,e=>{let t=Cr(e,1,`SelectSeq`);return Ut(Mf(e,0,Ff(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new x(`The second argument of SelectSeq should be a operator, but instead it is:\n${Y(n)}`);return n}))})]),zf=Lf(`FiniteSets`,[Q(`IsFiniteSet`,1,e=>{let t=Z(e,0,`IsFiniteSet`);if(Me(t))return pn(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new b(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${Y(t)}\nis a finite set.`:`Attempted to check if the ${Fe(t)} ${Y(t)} is a finite set.`)}),Q(`Cardinality`,1,e=>{let t=Z(e,0,`Cardinality`);if(!Me(t)||typeof t==`object`&&(t.kind===`InfiniteSet`||t.kind===`SequenceSet`))throw new x(`Attempted to compute cardinality of the value\n${Y(t)}`);return dn(t)})]),Bf=/* @__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`]]]),Vf=(e,t,n,r)=>{switch(e){case`Naturals`:return{extends:[],operators:Af};case`Integers`:return{extends:[`Naturals`],operators:jf};case`Sequences`:return{extends:[],operators:Rf};case`FiniteSets`:return{extends:[],operators:zf};case`TLC`:return{extends:[],operators:Lf(`TLC`,ff(t,n))};case`Randomization`:return{extends:[],operators:Hd(n)};case`_Possible`:return{extends:[],operators:rf(t,n)};case`Json`:return{extends:[],operators:Id(r)};case`Bags`:return{extends:[],operators:hd};case`TLCExt`:return{extends:[],operators:nf(t,n)};default:return}},Hf={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},Uf=(e,t)=>{let n=Hf[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Wf=`$subexpression`,Gf=(e,t)=>new p(`${e} at line ${t.line}, column ${t.column}`),Kf=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),qf=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}},Jf=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:_i(e.bounds),body:e.body,sets:Kf(e.bounds)};case`SetMap`:return{names:_i(e.bounds),body:e.expression,sets:Kf(e.bounds)};case`SetFilter`:return{names:gi(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:gi(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}},Yf=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Yf(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of dr(e)){let e=Yf(r,t,n);if(e)return e}},Xf=(e,t,n)=>e.length===0&&n.length>0?n.splice(0,t):e,Zf=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Qf=(e,t)=>{let n=e.location,r=Zf(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 Gf(`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 Gf(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Wf,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Wf,args:e.args,location:n,resolution:ti},location:n}},$f=(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:ti})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:ti}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:ti};return Qf({...t,params:[...t.params,...r]},a)},ep=(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 Gf(`Expected an operator name`,n);o.push(c.name),s.push(...c.args);let l=o.join(`!`),u=i?i.find(e=>ua(e)===l):t(l);if(u)return{definition:u,args:Xf(s,oi(u),r)};a.index++}throw Gf(`Unknown operator ${o.join(`!`)}`,n)},s=t=>{let r=o(t),s=r.definition,c=oi(s),l=a.index===e.length-1;if(r.args.length!==c&&r.args.length!==0)throw Gf(`The operator ${s.name} requires ${c} arguments`,n);if(l)return{definition:s,args:r.args};if(s.kind!==`Operator`)throw Gf(`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&&Yf(a.current,t.name,[]);if(!o)throw Gf(`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(...Xf(t.args,o.label.params.length,r)),a.current=o.label.body,a.index++}},l=t=>{let o=a.current;if(!o)throw Gf(`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`||wi(t.operand,1)!==0)throw Gf(`A LET/IN expression has only one operand`,n);i.lets.push(o.definitions),a.current=o.body;return}let s=Jf(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(...Xf(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[wi(t.operand,r.length)],s=e[a.index+1];if(!i||s?.kind!==`Operand`)throw Gf(`A subexpression of CASE must have the form !i!j`,n);a.index++;let c=wi(s.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw Gf(`Nonexistent CASE operand`,n);a.current=l;return}if(t.kind!==`Operand`)throw Gf(`Unexpected subexpression selector`,n);let c=s?s.sets:qf(o),u=c?.[wi(t.operand,c.length)];if(!u)throw Gf(`Nonexistent operand specified by the selector`,n);a.current=u},u=s(void 0);if(u)return $f(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 Gf(`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 $f(e.definition,{...i,args:[...i.args,...e.args]});c()}else l(t),a.index++}if(!a.current)throw Gf(`Subexpression selection failed`,n);return Qf(i,a.current)},tp=(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:[]}))]},np=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||dr(e).some(np),rp=(e,t,n)=>{if(!np(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n);return pa(e,e=>rp(e,r,n))}let r=pa(e,e=>rp(e,t,n));if(r.kind===`Subexpression`){let e=r.selectors[0];return e.kind===`Name`&&n.has(e.name)?r:ep(r.selectors,t,r.location,[])}let i=r.kind===`Identifier`?r.name:r.kind===`Apply`?r.operator:``,a=tp(i,t);if(!a)return r;let o=r.kind===`Apply`?[...r.args]:[],s=ep(a,t,r.location,o);if(o.length>0)throw Gf(`Too many arguments for ${i}`,r.location);return s},ip=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},ap=(e,t)=>{let n=ip(t.definitions);return{...e,substitutions:e.substitutions.map(e=>({name:e.name,expression:rp(e.expression,n,/* @__PURE__ */ new Set)}))}},op=(e,t)=>{let n=ip([...t,...e.definitions]);if(!(e.definitions.some(e=>np(e.body))||e.assumptions.some(e=>np(e.expression))))return e;let r=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[]));return{...e,definitions:e.definitions.map(e=>fa(e,e=>rp(e,n,r))),assumptions:e.assumptions.map(e=>({...e,expression:rp(e.expression,n,r)}))}},sp=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}])),cp=(e,t)=>`${e}${t}`,lp=(e,t,n)=>`${e}${t}${n}`,up=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},dp=(e,t,n)=>`${e},${t},${n}`,fp=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),pp=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),mp=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),hp=(e,t,n,r)=>({...fp(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),gp=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,_p=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,vp=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,{...hp(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),yp=hp(`$Set`,0,[2],[1]),bp=hp(`$Junction`,0,[3],[1]),xp=hp(`$Choose`,0,[2],[1]),Sp=hp(`$Function`,0,[3],[1]),Cp=hp(`$FcnApply`,0,[2,2],[1,1]),wp=hp(`$RcdSelect`,0,[2,0],[1,1]),Tp=hp(`'`,2,[1],[0]),Ep=hp(`ENABLED`,1,[2],[0]),Dp=hp(`[]`,3,[3],[0]),Op=hp(`$SquareAct`,2,[2,1],[0,0]),kp=hp(`$WF`,3,[1,2],[0,0]),Ap=hp(`$TemporalExists`,3,[3],[0]),jp=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Mp=e=>e.map(e=>({name:e,arity:0})),Np=(e,t)=>t.location.range?v(`${e}.`,t.location.range):new p(`${e} at line ${t.location.line}, column ${t.location.column}`),Pp=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Fp=e=>e.kind!==`Let`&&e.kind!==`Label`,Ip=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:v(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=v(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=vp.get(t)??sp.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=fp(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(lp(e,n,t))}),t.data.constraints.forEach((e,t)=>pp(r.constraints,t,e)),mp(r.argConstraints,cp(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>mp(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>gp(e,n))throw new p(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new p(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(dp(t,n,r)),s=fp(Math.max(e.level,...t.filter((t,n)=>_p(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)=>{_p(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)=>pp(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||pp(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>pp(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||pp(s.constraints,t,gp(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=>pp(s.constraints,e,gp(r,a)))}))}),e.argParams.forEach(e=>{let t=up(e),n=a(t.operator)?.operator;n&&pp(s.constraints,t.param,gp(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>mp(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>mp(s.argConstraints,cp(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&mp(s.argConstraints,cp(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=up(e),n=a(t.operator);n&&mp(s.argConstraints,cp(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(up(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=up(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(lp(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(lp(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(lp(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,Mp(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=fp();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=jp(n,Mp(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 Np(`Formula has both temporal formula and action as arguments`,t)},u=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw Np(`Action used where only temporal formula or state predicate allowed`,e);Pp.has(e.operator)&&l(t,e)},d=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Fp(n)&&n.kind!==r)throw Np(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},f=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=v(e,n);t.constraints.forEach((e,t)=>pp(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>mp(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof p)||t.sany?t:Np(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return fp();case`Identifier`:return c(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return u(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),i(bp,n)}case`Prime`:case`Unchanged`:return s(Tp,[e.expression],t);case`Enabled`:return s(Ep,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return d(e,n.data.level),i(Dp,[n])}case`If`:return s(bp,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(bp,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return f(e,t);case`Forall`:case`Exists`:{let n=s(bp,[e.body],t,e.bounds.map(e=>e.set),_i(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Np(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?Ap:bp,[e.body],t,[],e.names);case`Choose`:return s(xp,[e.body],t,e.set?[e.set]:[],gi(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(yp,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(yp,[e.predicate],t,[e.bound.set],gi(e.bound.pattern));case`SetMap`:return s(yp,[e.expression],t,e.bounds.map(e=>e.set),_i(e.bounds));case`FunctionConstruction`:return s(Sp,[e.body],t,e.bounds.map(e=>e.set),_i(e.bounds));case`Record`:return s(Sp,e.fields.map(e=>e.value),t);case`RecordSet`:return s(yp,e.fields.map(e=>e.value),t);case`Except`:return s(yp,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(Cp,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(yp,e.args,t)}]);case`FieldAccess`:return i(wp,[a(e.record,t),{data:fp()}]);case`BoxAction`:case`AngleAction`:return s(Op,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(kp,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return fp()}},g=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>g(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return dr(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,jp(t,Mp(e.names))),i;default:return pa(e,(e,n)=>(a(e,r,jp(t,Mp(n))),e)),i}},_=(e,t,n,r)=>{let i=jp(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...fp(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(cp(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(lp(e.name,n,t.name))).map(e=>dp(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(up(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=up(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},v=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...fp(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:v,toOperand:a}},Lp=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?Lp(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=fp(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>pp(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>mp(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},Rp=(e,t,n,r)=>{let i=Ip(t),a=e=>Math.max(0,...e.map(e=>i.analyze(e,/* @__PURE__ */ new Map).level)),o=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?a([t.expression]):t.kind===`Witness`?a(t.expressions):t.kind===`Take`?a(t.bounds.map(e=>e.set)):t.kind===`Pick`?a([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?Lp(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=_(e.statement),n=()=>o(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...s(e.proof)]:e.body.kind===`Qed`?s(e.proof):[]}):[],c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>o(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>a([e.set])!==0).flatMap(e=>e.set.location.range?[{location:_(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...c(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[];ra([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>i.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?Lp(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...c(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw m(n)}})),...n],r)},zp=(e,t)=>e.maxLevels[t]??3,Bp=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=Ip({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,i=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>pp(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>pp(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>mp(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=up(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&pp(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(Lp(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,a=_(t.location.range??{module:t.instancer,start:t.location,end:t.location}),o=e=>r.set(`${a}\n${e}`,{location:a,message:e}),s=e(t.module),c=i(t.module),l=n(t.instancer),u=/* @__PURE__ */ new Map;t.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=l.analyze(n,u);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),f=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(d.forEach(e=>{!c.isConstant&&e.level>e.maximumLevel&&o(f(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),d.forEach(e=>{let n=c.constraints.get(e.name);n!==void 0&&e.level>n&&o(f(e.name,n));let r=e.operator;r&&Array.from({length:e.arity},(n,i)=>{let a=c.argConstraints.get(cp(e.name,i));a!==void 0&&zp(r,i)<a&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),c.argParams.forEach(e=>{let n=up(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=zp(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw m([...r.values()])}},Vp=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],Hp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Up=new Map(mf.flatMap(e=>e.map(t=>[t,e[0]]))),Wp=e=>Up.get(e)??e,Gp=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},Kp=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(Gp(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()}},qp=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),Jp=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:Wp(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:Wp(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}},Yp=(e,t)=>{let n=[];for(let r=t;;){let t=Jp(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},Xp=e=>({line:e.line,column:e.column}),Zp=(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=Yp(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},Qp=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,$p={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},em=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&Qp(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&Qp(e[n+1],e[n+2])?n+=Qp(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=>$p[e])}"`:r.text)}return t},tm=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},nm=(e,t)=>e.find(e=>e.name===t)??e.map(e=>nm(e.modules,t)).find(Boolean),rm=(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:vf.get(i)??t?.(i)??yl(e,i),s=o===void 0?[]:fe(o),c=tm(s),l=c.get(s[2]?.text??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=xl(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>nm(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},im=(e,t,n)=>{let r=rm(e,t),i=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=Yp(t,e+1);r.push({location:Xp(t[e]),apply:e=>i.forEach(t=>e.put(qp(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:Xp(u),apply:t=>t.put(qp(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`&&Yp(t,l+1).every(e=>s.has(e))&&a(l,`definition`),Hp.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(Xp(u)),r.push({location:Xp(u),apply:e=>e.put(qp(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(qp(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=Wp(e.name);r.push({location:e.location,apply:n=>n.put(qp(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(qp(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(qp(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>ai(e.location,t.location)?-1:+!!ai(t.location,e.location))},a=/* @__PURE__ */ new Map,o=e=>{let t=a.get(e??``);if(t)return t;let n=Kp();a.set(e??``,n),pf.toReversed().forEach(e=>n.put(qp(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()},am=(e,t,n)=>{let r=rm(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)}),hf.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=Zp(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;em(s(void 0)).forEach((e,t)=>{t===3&&_f.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),em(s(n)).forEach(a))}Vp.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),gf.forEach(a),[...i]},om=t=>{switch(t.kind){case`Number`:try{return F(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Ze(t.name);case`Set`:return Dt(t.elements.map(om))}},sm=e=>[...e.constants,...e.variables.map(e=>({name:e,arity:0}))],cm=e=>new p(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),lm=(e,t)=>e.location.range&&t.location.range&&{location:_(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${_(t.location.range)}.`},um=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,dm=e=>e===`Theorem`?`ThmOrAssumpDefNode`:um(e),fm=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:ti},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),pm=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>Y(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 b(`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`)&&et(t,r)})});if(t)return t[1];throw new b(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:Y(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},mm=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||dr(e).some(e=>mm(e,t)),hm=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Sa(e),n.get(e)??n.size)),n},gm=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),_m=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Wo(e);if(e.kind===`Number`&&!Ns(e.value))throw Go(e);_m(e.kind===`Let`?[...dr(e),...gm(e.instances??[])]:dr(e))}),vm=(e,t)=>{let n=xl(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=new Map(Df.map(e=>[e.name,e])),s=/* @__PURE__ */ new Map,c=nu(e.checkDeadlock,t.seed),l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Map,d=/* @__PURE__ */ new Map,f=[],g=/* @__PURE__ */ new Map,v=[],S=[],C=(e,t)=>v.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),w={value:0},T=e=>`${e}#${w.value++}`,ee=[],te=[],ne=Bp(e=>{let t=d.get(e)??j(e,e);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),theorems:t.module.theorems,getDefinition:e=>r.get(t.visible.get(e)?.key??e)}}),E=/* @__PURE__ */ new Map,re=/* @__PURE__ */ new Map,D=e=>{let n=s.get(e);if(n)return n;let r=Vf(e,t.print,c,t.files);if(!r)return;let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>D(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{o.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,kind:`Definition`,range:Uf(e,t.name)??i.get(t.name)?.range})}),s.set(e,i),i},O=e=>{let t=D(e),n=Bf.get(e)??[];return t&&C(e,n),t&&n.includes(`Integers`)&&D(`Integers`),t},k=e=>(_m([...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]),...gm(e.instances)]),e.modules.forEach(k),e);k(n);let A=(e,n)=>{let r=t.loadModule?.(e)??Hc.get(e)??yl(t.source,e);if(r===void 0)throw m([{location:`In module ${n}`,message:`Cannot find source file for module ${e} imported in module ${n}.`}],!0);let i=Ju(r,e);if(i.name!==e)throw m([{location:`Unknown location`,message:`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`}],!0);return k(i)},ie=e=>{let t=S.indexOf(e.name);if(t!==-1)throw new p(`Circular dependency among .tla files; dependency cycle is: ${[...S.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[];S.push(e.name),v.push(n);let i=fe(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r});v.pop(),S.pop();let a=r.find(e=>n.has(e.name)),o=a&&l.get(a.name),s=o&&lm(a,o.module);if(s)throw m([s],!1,void 0,te);if(a)throw cm(a);return{linked:i,closure:n}},j=(e,t)=>{let n=l.get(e);if(n)return C(e,g.get(e)??[]),n;let r=ie(A(e,t));return l.set(e,r.linked),g.set(e,r.closure),C(e,r.closure),r.linked},ae=(e,t,n,o,s)=>{let c=s?void 0:O(e.module);if(c)return e.name===void 0?c:new Map([...c].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,kind:n.kind}]));let l=s??j(e.module,t.name),u=sm(l),d=`#${w.value++}`,f=new Map(e.params.map(e=>[e.name,`${e.name}${d}`])),p=na(ap(e,t),u,t,n);ee.push({module:e.module,instancer:t.name,lets:[],substitutions:p,location:e.location});let m=Pa({params:e.params.map(e=>({...e,name:`${e.name}${d}`})),substitutions:new Map([...p].map(([e,t])=>[e,sa(t,f)])),variables:new Set(l.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,s,c)=>{let l=T(`${s}@${t.name}`);return r.set(l,c(l)),i.set(l,!o),a.set(l,{source:n,prefix:e.params.length}),l},createName:T}),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&&E.set(r,{name:n,location:e.location}),g.set(n,{key:r,arity:t.arity,kind:t.kind,range:i.get(t.key)===!0?e.location.range:t.range});return}let r=m.getQualifiedKey(t.key);u.length>0&&E.set(r,{name:`${e.name}!${n}`,location:e.location}),re.set(r,`${e.name}!${n}`),g.set(`${e.name}!${n}`,{key:r,arity:t.arity+e.params.length,kind:t.kind})}),g},oe=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:ti})),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:oe(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),ce=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),le=(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=ce(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:oe(r,n),location:n}}},ue=(e,t,n,a)=>{let o=e.location,s=a?void 0:O(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=ce(n.arity);return se(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??j(e.module,n),l=`#${w.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=sm(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};ee.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=>mm(f(e),p),h=d.map(t=>{let n=le(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=[],_=Pa({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:oe(e.params,o),location:o,resolution:ti}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:ti}])),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}:fm(a,i)),i},createName:T}),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=ce(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]},de=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),fe=(e,a)=>{let o=Xc(e,t.loadClass?.(e.name)),s=ee.length,c=new Map([...Df.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...a.symbols]),l={location:$i,errors:[],warnings:[]},p=[l],m=e=>e.forEach((e,t)=>{let n=h.get(t);if(!n){c.set(t,e),h.set(t,e);return}if(!n.range||!e.range||_(n.range)===_(e.range))return;let r=_(e.range),i=_(n.range);dm(n.kind)===dm(e.kind)?l.warnings.push({location:r,message:`Warning: the ${um(n.kind)} of '${t}' conflicts with \nits ${um(n.kind)} at ${i}.`}):l.errors.push({location:r,message:`The ${um(e.kind)} of '${t}' conflicts with \nits ${um(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Map,v=[],y=[...o.constants],b=o.variables.map(e=>e.name),x=o.variables.map(e=>e.location);o.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:O(e);if(n){m(n);return}let r=t??j(e,o.name);y.push(...r.constants.filter(e=>y.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{b.includes(e)||(b.push(e),x.push(r.variableLocations[t]))}),m(r.exported),r.modules.forEach((e,t)=>g.set(t,e)),v.push(r)});let S=new Map(c),C=[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))],w=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});C.forEach(e=>h.set(e.name,w(e)));let T=e=>({key:D(e),arity:oi(e),kind:ea(o,e)?`Theorem`:`Definition`,range:e.location.range}),E=y.length===0&&b.length===0,D=e=>o===n?e.name:`${e.name}@${a.id}`,k=/* @__PURE__ */ new Map,A=e=>({imported:c,bound:S,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:D,instanced:k,reports:p,warnings:te}),ie=()=>new Map([...a.modules,...g]),oe=e=>new Map([...c,...C.filter(t=>ai(t.location,e)).map(e=>[e.name,w(e)]),...o.definitions.filter(t=>ai(t.location,e)).map(e=>[e.name,T(e)])]),se=e=>{let t=ie(),n=t.get(e.name),r=n&&lm(e,n.module);if(r)p.push({location:e.location,errors:[r],warnings:[]});else if(n)throw cm(e);a.nested.push(e);let i=fe(e,{id:`${a.id}/${e.name}`,symbols:oe(e.location),modules:t,nested:a.nested});n||g.set(e.name,i),u.has(e.name)||u.set(e.name,i)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=ae(e,o,A(o),E,ie().get(e.module));k.set(e,t),t.forEach((t,n)=>{c.has(n)||(c.set(n,t),e.isLocal||h.set(n,t))})}})),...o.modules.map(e=>({location:e.location,link:()=>se(e)}))].sort((e,t)=>ai(e.location,t.location)?-1:1).forEach(e=>e.link());let ce=e=>{let t=o.instances.find(t=>t.module===e.name);return t!==void 0&&ai(e.location,t.location)},le=e=>{let t=o.modules.find(t=>t.name===e.module);return t?ce(t)?g.get(t.name):void 0:ie().get(e.module)},pe=op(Ra(o,(e,t)=>ue(e,t,o.name,le(e))),de(c));ia(pe,A(pe)),pe.definitions.forEach(e=>{let t=D(e);r.set(t,e),i.set(t,!E);let n=T(e);c.set(e.name,n),e.isLocal||h.set(e.name,n)});let M={module:pe,constants:y,variables:b,variableLocations:x,visible:c,exported:h,modules:g,extended:v};return d.has(o.name)||d.set(o.name,M),Rp(pe,{constants:new Set(y.map(e=>e.name)),variables:new Set(b),getDefinition:e=>r.get(c.get(e)?.key??e),getQualifiedName:e=>re.get(c.get(e)?.key??e)},ee.splice(s).map(e=>({location:e.location,check:()=>ne(e)})),te),f.push(M),M},pe=ie(n).linked;te.length>0&&t.print(h(te));let M=e=>pe.visible.get(e)?.key??e;pe.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let me=[],he=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>he(e,t)),me.push(...e.module.assumptions))};he(pe,/* @__PURE__ */ new Set);let ge=pe.constants.map(e=>e.name),_e=pe.variables,ve=e=>e.module===void 0?[e.name,M(e.name)]:e.module===n.name||ge.includes(e.name)?[]:[(l.get(e.module)??u.get(e.module))?.visible.get(e.name)?.key??e.name],ye=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:pe.constants.find(t=>t.name===e)?.arity??0},be=/* @__PURE__ */ new Map,xe=/* @__PURE__ */ new Set,Se=(e,t)=>{o.set(e,t),r.delete(e),be.delete(e),xe.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=om(e.value);ve(e).forEach(e=>{let n=ye(e);n===0?be.set(e,t):Se(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ce=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Ce.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new y(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(om),om(e.value)]),Ce.set(t,n)}),Ce.forEach(e=>ve(e).forEach(t=>Se(t,pm(e.name,ye(t)||e.rows[0][0].length,e.rows))));let we=new Map(e.substitutions.flatMap(e=>ve(e).map(t=>[t,M(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!ge.includes(n)&&!pe.visible.has(n))throw new y(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new y(`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=M(i),s=r.get(a);if(!(s!==void 0||o.has(a)||be.has(a)||ge.includes(i)||_e.includes(i)))throw new y(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(s?.kind===`Operator`&&s.params.length!==(pe.constants.find(e=>e.name===n)?.arity??pe.visible.get(n)?.arity))throw new y(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let Te=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(ve)),Ee=(e,t)=>{if(Te.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&Ee(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=Ee(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),pe.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})});let De=ge.filter(e=>!be.has(e)&&!we.has(e)&&!xe.has(e));if(De.length>0)throw new y(`The constant parameter ${im(t.source,t.loadModule,`constant`).find(e=>De.includes(e))??De[0]} is not assigned a value by the configuration file.`);let Oe={runtime:c,definitions:r,builtins:o,constants:be,substitutions:we,variables:_e,variableIndex:hm(_e,f.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,evaluators:/* @__PURE__ */ new WeakMap},ke=Ip({constants:new Set(be.keys()),variables:/* @__PURE__ */ new Set([..._e,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>o.has(e))]),getDefinition:e=>Zo(e,Oe)}),N=e=>{try{cc(e,{environment:Oe,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof b)return e;throw e}};return we.forEach((e,t)=>{let n=r.get(e),i=ge.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&ke.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?N(n.body):void 0;if(i)throw new y(`The configuration file substitutes constant ${t} with non-constant ${e}${i instanceof x?``:` - specifically: ${i.message}`}`)}),c.isStarted=!0,{environment:Oe,assumptions:me,variableLocations:pe.variableLocations,instanceActions:E}},ym={kind:`Boolean`,value:!0},bm={kind:`Boolean`,value:!1},xm=e=>e?ym:bm,Sm=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,Cm=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,wm=(e,t)=>({kind:e,body:t}),Tm=(e,t,n)=>({kind:e,operands:[t,n]}),Em=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?Em(e,t.operands).operands:[t])}),Dm=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return Dm(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,Dm(t)),0)}},Om=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 Om(e.body);case`And`:case`Or`:return e.operands.some(Om)}},km=/* @__PURE__ */ new WeakMap,Am={count:0},jm=e=>{let t=km.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`#${Am.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(jm).join(`,`)})`;default:return`${e.kind}(${jm(e.body)})`}})();return km.set(e,n),n},Mm=(e,t)=>e===t||jm(e)===jm(t),Nm=(e,t)=>{let n=jm(t);return e.some(e=>e===t||jm(e)===n)},Pm=e=>e===`And`?`Or`:`And`,Fm=(e,t)=>{switch(e.kind){case`Boolean`:return t?xm(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?wm(`Not`,e):e;case`Not`:return Fm(e.body,!t);case`And`:case`Or`:return Em(t?Pm(e.kind):e.kind,e.operands.map(e=>Fm(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return wm(n,Fm(e.body,t))}}},Im=e=>{switch(e.kind){case`Boolean`:return xm(!e.value);case`Not`:return e.body;case`And`:case`Or`:return Em(Pm(e.kind),e.operands.map(Im));case`Always`:return wm(`Eventually`,Im(e.body));case`Eventually`:return wm(`Always`,Im(e.body));default:return wm(`Not`,e)}},Lm=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Lm(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return xm(t)}return n.length===0?xm(!t):n.length===1?n[0]:Em(e.kind,n)}case`Not`:{let t=Lm(e.body);return t.kind===`Boolean`?xm(!t.value):wm(`Not`,t)}case`Always`:case`Eventually`:{let t=Lm(e.body);return wm(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Rm=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,zm=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=zm(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new b(`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=>Em(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=zm(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Rm(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:Em(`Or`,t);n.push(wm(`Always`,wm(`Eventually`,e)))}return Em(`Or`,n)}case`Not`:return Sm(e.body)?e:zm(Im(e.body));default:return e}},Bm=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Bm(e.operands[0]):Em(e.kind,e.operands.map(Bm));case`Not`:return e.body.kind===`Not`?Bm(e.body.body):wm(`Not`,Bm(e.body));case`Always`:case`Eventually`:case`Next`:return wm(e.kind,Bm(e.body));default:return e}},Vm=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Vm(e.operands[0]);let t=Math.floor(e.operands.length/2);return Tm(e.kind,Vm(Em(e.kind,e.operands.slice(0,t))),Vm(Em(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return wm(e.kind,Vm(e.body));default:return e}},Hm=(e,t)=>{e.kind===`Eventually`&&!Nm(t,e)&&t.push(e),`body`in e&&Hm(e.body,t),`operands`in e&&e.operands.forEach(e=>Hm(e,t))},Um=e=>{let t=e.filter(Cm),n=e.flatMap(e=>e.kind===`Not`&&Cm(e.body)?[e.body]:[]);return!t.some(e=>Nm(n,e))},Wm=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,wm(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new b(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Gm=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:wm(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Km=(e,t,n)=>e.flatMap(e=>{let r=Gm(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),qm=e=>[...new Set(e.map(jm))].sort().join(`|`),Jm=(e,t)=>{let n=new Set(t.map(qm));return[...e.filter(e=>!n.has(qm(e))),...t]},Ym=e=>{let t=Wm(e),n=Km(t,`Always`,`And`),r=Km(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Gm(t,`Eventually`,`Or`);if(n&&!(Nm(e,n.first)||Nm(e,n.second)))return Jm(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Nm(e,t.first)||Nm(e,t.second))&&!Nm(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Um(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Gm(t[e],`Always`,`And`);n&&(Nm(t,n.first)||t.push(n.first),Nm(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)Nm(t,e.first)&&Nm(t,e.second)&&!Nm(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Um(t)?[]:i(t)};return a(e)},Xm=e=>({particle:e,successors:[],statePredicates:e.filter(e=>Dm(e)<=1)}),Zm=e=>{let t=Ym([e]).map(Xm),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=qm(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 Ym(n)){let n=qm(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Xm(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Qm=(e,t)=>!Nm(e,t)||Nm(e,t.body),$m=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&Dm(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Rm(e);if(n){let e=Dm(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(Om(e))throw new b(`TLC cannot handle the temporal formula: actions may only appear as []<>A or <>[]A`);t.formulas.push(e)},eh=(e,t)=>{let n=e.findIndex(e=>Mm(e,t));return n===-1?(e.push(t),e.length-1):n},th=e=>{let t=zm(Lm(Fm(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Bm(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])$m(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:Em(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Mm(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Vm(e.formula),n=[];t&&Hm(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>eh(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>eh(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>eh(i,e))}));return{tableau:t&&Zm(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},nh=/* @__PURE__ */ new Set([`~>`,`-+->`]),rh=/* @__PURE__ */ new WeakMap,ih=/* @__PURE__ */ new WeakSet,ah=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),oh=(t,r)=>{try{return cc(t,r)}catch(t){if(!(t instanceof b)||t instanceof x)throw t;let r=o(t);throw r===void 0?n(new b(`${l}${t.message}`,t),e.error):n(t,r)}},sh=e=>new b(`TLC cannot handle the temporal formula at ${Fo(e)}`),ch=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=Ko(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return ch(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?ch(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=Zo(e,n);if(t)return lh(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:X(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return pa(e,(e,a)=>(i.value=Math.max(i.value,ch(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 nh.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},lh=(e,t)=>{let n=rh.get(e);if(n!==void 0)return n;rh.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(ch(e.body,void 0,t),...r.map(e=>ch(e.set,void 0,t)));return rh.set(e,i),i},uh=`Temporal formula is a tautology (its negation is unsatisfiable).`,dh=(t,r,i,a,o=``,s=/* @__PURE__ */ new Set)=>{let c=(e,t,n=o,r=s)=>dh(e,t,i,a,n,r);if(t.kind===`And`)return t.operands.flatMap(e=>c(e,r,Io(e)));if(t.kind===`Label`)return c(t.body,r);if(t.kind===`Let`)return c(t.body,fh(t,r,i));if(t.kind===`Identifier`){let o=X(t)?Ko(r,t.name):void 0;if(o?.kind===`Thunk`)return c(o.expression,o.scope);let l=i.constants.has(t.name)?void 0:Zo(t.name,i);if(!o&&l?.kind===`Operator`&&l.params.length===0&&lh(l,i)>0){if(s.has(l))throw n(new b(u),e.error);let r=c(l.body,void 0,t.name,/* @__PURE__ */ new Set([...s,l]));return!a&&lh(l,i)<2?[{expression:l.body,scope:void 0,name:t.name}]:r}}let l=ah(i,r);if(t.kind===`Apply`&&(e=>a||ch(e,r,i)===3)(t)){let e=_s(t,l),n=X(t)?void 0:Zo(t.operator,i);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive)return c(e.body,ks(e,t.args,l),t.operator)}if(a&&t.kind===`Forall`&&t.bounds.every(e=>ch(e.set,r,i)===0)){let r=[],i={count:0};if(ns(t.bounds,l,e=>(i.count++,r.push(...c(t.body,e,Io(t.body))),!1)),i.count===0)throw n(new b(uh),e.livenessEvaluationFailure);return r}return[{expression:t,scope:r,name:o}]},fh=(e,t,n)=>{let r=js(e.definitions,ah(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&ih.add(e.binding);return r},ph=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),mh=(t,r,i)=>{let a=(e,t,n)=>{let r=n===0?ch(e,t,i):n;if(r===0){let n=oh(e,ah(i,t));if(typeof n!=`boolean`)throw new b(`TLC expected a boolean in the temporal formula at ${Fo(e)}`);return xm(n)}return r===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},o={depth:0},s=(t,r,i,s)=>{if(o.depth>=100)throw n(new b(u),e.error);o.depth++;let c=f(t,r);o.depth--;let l=Dm(c);return l>2?c:a(i,s,l)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,r=ah(i,t),a=X(e)||Zo(n,i)===void 0?Ko(t,n):void 0;if(a?.kind===`Thunk`&&ih.has(a))return s(a.expression,a.scope,e,t);let o=a?.kind===`Operator`?a.operator:a?void 0:X(e)?vs(n,r):hs(n,i);if(o?.kind!==`Closure`)throw sh(e);let c=e.kind===`Apply`?e.args:[];return s(o.body,ks(o,c,r),e,t)},l=(e,t)=>{if(!e.bounds.every(e=>ch(e.set,t,i)===0))throw sh(e);let n=[];ns(e.bounds,ah(i,t),t=>(n.push(f(e.body,t)),!1));let r=e.kind===`Forall`;if(n.length===0)return xm(r);let o=Em(r?`And`:`Or`,n),s=Dm(o);return s>2?o:a(e,t,s)},d=(e,t)=>{switch(e.kind){case`Label`:f(e.body,t);return;case`Let`:f(e.body,fh(e,t,i));return;case`And`:case`Or`:for(let n of e.operands)f(n,t);return;case`Apply`:if(e.operator===`=>`||e.operator===`~`&&!X(e))for(let n of e.args)f(n,t);return;case`If`:{let n=f(e.condition,t),r=n.kind===`Boolean`?[n.value?e.consequent:e.alternative]:[e.consequent,e.alternative];for(let e of r)f(e,t)}}},f=(e,t)=>{let n=ch(e,t,i);if(n<=2)return d(e,t),a(e,t,n);switch(e.kind){case`Label`:return f(e.body,t);case`Let`:return f(e.body,fh(e,t,i));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?wm(`Always`,Tm(`Or`,wm(`Not`,f(n[0],t)),wm(`Eventually`,f(n[1],t)))):e.operator===`~`&&!X(e)?wm(`Not`,f(n[0],t)):e.operator===`=>`?Tm(`Or`,wm(`Not`,f(n[0],t)),f(n[1],t)):c(e,t)}case`And`:case`Or`:return Em(e.kind,e.operands.map(e=>f(e,t)));case`Forall`:case`Exists`:return l(e,t);case`If`:{if(ch(e.condition,t,i)===0){let n=oh(e.condition,ah(i,t));if(typeof n==`boolean`)return f(n?e.consequent:e.alternative,t)}let n=f(e.condition,t);return Tm(`Or`,Tm(`And`,n,f(e.consequent,t)),Tm(`And`,wm(`Not`,n),f(e.alternative,t)))}case`Always`:case`Eventually`:return wm(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=ph(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=wm(`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`?wm(`Always`,wm(`Eventually`,Tm(`Or`,i,a))):Tm(`Or`,wm(`Eventually`,wm(`Always`,i)),wm(`Always`,wm(`Eventually`,a)))}default:throw sh(e)}};return f(t,r)},hh=(e,t,n,r,i)=>{let a=e=>hh(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`?Xo(cc(e.expression,a),`a temporal property predicate`):Ao(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&&Xo(cc(e.unchanged,a),`a subscript`)?!1:Xo(cc(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 hh(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new b(`TLC cannot evaluate a temporal formula in a single step`)}},gh=(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)=>gh(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 hh(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},_h=(e,t)=>e.every((e,n)=>nt(e,t[n])),vh=e=>e.filter((t,n)=>n===0||e[n-1]!==t),yh=(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),bh=(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}},xh=(e,t)=>(e.offsets[t]??-1)!==-1,Sh=(e,t)=>e.pending[t]??=[],Ch=(e,t)=>{let n=e.edgeOffsets[t];return e.edges.ids.subarray(n+1,n+1+e.edges.ids[n])},wh=(e,t,n)=>e.results.bytes[e.offsets[t]+n]===1,Th=2**53-1,Eh=(t,r,i,a)=>{if(t.length===0)return;let o=r.map(e=>mh(e.expression,e.scope,i)),s=t.map(e=>wm(`Not`,mh(e.expression,e.scope,i))),c=s.length===1?s[0]:Em(`Or`,s),l=o.length===0?c:Em(`And`,[...o,c]),u=th(l);if(u.length===0)throw n(new b(uh),e.livenessEvaluationFailure);let d=/* @__PURE__ */ new Map,f=u.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=jm(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})),p={multiplier:1},m=!Us(i),h={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},g=e=>{let t=h.states.get(e)??/* @__PURE__ */ new Map;return h.states.set(e,t),t},_=(e,t)=>{i.runtime.setLivenessSource(e);let n=t();return i.runtime.setLivenessSource(void 0),n},v=(e,t)=>hh(e,t,void 0,i,m?g(t):/* @__PURE__ */ new Map),y=(e,t,n)=>_(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!v(e,n))),x=(e,t,n,r)=>_(t,()=>{let t=e.solution.actionChecks;if(!m)return Uint8Array.from(t,e=>+!!hh(e,n,r,i,/* @__PURE__ */ new Map));let a=g(n),o=h.actions.get(n)??/* @__PURE__ */ new Map;h.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]=+!!hh(t[o],n,r,i,a)),s[e]))}),S=(e,t,n,r)=>_(n,()=>e.nodes[t].statePredicates.every(e=>v(e,r))),C=(e,t)=>{let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},w=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),T=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=bh(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},ee=(e,t,n)=>{let r=yh(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),bh(i,e[t]-1,e[t+1]))}return i.slots.set([t+1,n,r],bh(i,t,n)),r},te=(e,t,n)=>t.nodes.flatMap((t,r)=>T(e,n,r)??[]).sort((e,t)=>e-t),ne=(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},E=(e,t,n)=>{let r={slots:Array.from({length:16*p.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&&_h(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*p.multiplier&&p.multiplier++,r.slots.filter(e=>e!==void 0)},re=(e,t,n,r,i)=>{let o=y(e,r,n),s=t.nodes[e.nodeTableaux[i]],c=[],l=Sh(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(C(t,a)&&e.errorNode===void 0&&w(e)){e.errorNode=i;return}let o=T(e,r,a);if(o!==void 0&&l.includes(o))continue;let s=o??ee(e,r,a);l.push(s),c.push(u),o===void 0&&re(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=T(e,i.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??ee(e,i.index,n);l.push(u),c.push(a),s===void 0&&o&&re(e,t,i.state,i.index,u)}}l.length>0&&ne(e,i,c,o)},D=(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 te(e,t,a)){let a=Sh(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=T(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??ee(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&re(e,t,n.state,n.index,d)}}),ne(e,s,c,i)}if(e.errorNode!==void 0)return vh(k(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},O=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)yh(e,e.nodeStates.length,-1);let a=Sh(e,i),o=[];t.forEach((t,r)=>{xh(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),ne(e,i,o,r)},k=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)xh(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 Ch(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}xh(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new b(`Couldn't re-create liveness trace (path) starting at: ${t}`)},A=(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=>xh(e,t)),l=[],u=t=>{let n=Ch(e,t).indexOf(t);return n!==-1&&o(t,n)},d=(t,r)=>n.tableau!==void 0&&Qm(n.tableau.nodes[e.nodeTableaux[t]].particle,r),f=r=>{let i=l.pop()??r;if(i===r&&!u(i)){s[i]=Th;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]=Th,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...c].some(n=>wh(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...c].some(n=>Ch(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(m&&h&&g)return p(r,c,f)},p=(r,i,s)=>{let c=vh(k(e,r).reverse().map(t=>e.nodeStates[t])),l=[],u=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),p=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g={count:f.length+p.length+h.length},_={node:r},v=e=>i.has(e),y=e=>{l.push(_.node),_.node=e};for(;g.count>0;){let r=g.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&wh(e,_.node,t)&&(f[n]=!0,g.count--)}),n.promises.forEach((e,t)=>{!h[t]&&d(_.node,e)&&(h[t]=!0,g.count--)}),!(g.count<=0);){let n={last:-1,unvisited:-1},i=g.count;if(Ch(e,_.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!v(r)||!o(_.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!p[t]&&a(_.node,c,e)&&(p[t]=!0,g.count--)})}return g.count<i?(y(r),u.clear(),!0):(v(r)&&!u.has(r)&&(n.unvisited=r),!1)}))break;if(g.count<r){y(n.last),u.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new b(`TLC failed to build the counterexample of a liveness property`);_.node=t,n.unvisited=Ch(e,t).find(e=>v(e)&&!u.has(e))??-1}y(n.unvisited),u.add(n.unvisited)}}let x=m(r,_.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()]}},m=(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 Ch(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 b(`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=f(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++};Ch(e,a).forEach((t,r)=>{xh(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)=>{h.states.clear(),h.actions.clear();for(let n of f){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(T(n,e,i)??ee(n,e,i))}},addState:(e,t,n)=>{h.states.clear(),h.actions.clear();let r=E(e,t,n);for(let n of f){let i=r.map(r=>x(n,e,t,r.state)),a=y(n,e,t),o=n.solution.tableau,s=o?D(n,o,r,i,a,e):O(n,r,i,a,e);if(s)return s}},findViolation:()=>{for(let e of f)for(let t of e.solution.models){let n=A(e,t);if(n)return n}},getViolatedProperties:(e,n)=>[...new Set(t.filter((t,r)=>!gh(s[r].body,e,n,0,i)).map(e=>e.name))]}},Dh=`UnnamedAction`,Oh={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},kh=e=>{let t=e.range??Oh;return Wt([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Ah=e=>{let t=[[`name`,e.name],[`location`,kh(e.location)]];return e.parameters.length===0?Wt(t):Wt([...t,[`context`,Wt(e.parameters)],[`parameters`,Ut(e.parameters.map(e=>e[0]))]])},jh=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),Mh=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Nh=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,Ph=e=>e.kind===`Apply`?e.args:[],Fh=(e,t,n)=>{let r=Nh(e);if(r===void 0)return;if(X(e)){let e=Ko(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=hs(r,n);return i?.kind===`Closure`?i:void 0},Ih=(e,t)=>{try{return cc(e,Mh(t,void 0)),!0}catch(e){if(e instanceof f)return!1;throw e}},Lh=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&$o(e,t)&&Ih(e.body,t),Rh=(e,t)=>{let n=Zo(e.name,t);return n?.body===e.body&&Lh(n,t)},zh=(e,t)=>{if(e.kind!==`Identifier`||!X(e))return;let n=Ko(t,e.name);return n?.kind===`Thunk`?n:void 0},Bh=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Ko(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Vh=(e,t)=>{try{return e()}catch(e){if(e instanceof f)return t();throw e}},Hh=(e,t,n,r,i)=>{let a=Ph(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=>ch(e,n,i)!==0)?o():Vh(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),cc(e,Mh(i,n))]),expression:t,scope:n}],o)},Uh=(e,t,n,r,i)=>{let a=()=>({name:n?.name??Dh,location:e.location,parameters:Bh(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return Uh(e.body,js(e.definitions,Mh(r,t)),n,r,i);case`Label`:return Uh(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>Uh(e,t,n,r,i));case`Exists`:return Vh(()=>{let o=[];return ns(e.bounds,Mh(r,t),t=>(o.push(...Uh(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=X(e)?void 0:i.get(Nh(e)??``),s=Fh(e,t,r);if(o)return Hh(o,e,t,s,r);if(!s)return[a()];let c=Ph(e),l=()=>[{name:s.name,location:e.location,parameters:[],expression:e,scope:t}];return Rh(s,r)||c.some(e=>ch(e,t,r)!==0)?l():Vh(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:cc(n,Mh(r,t))},parent:e}),s.scope);return Uh(s.body,e,s,r,i)},l)},Wh=(e,t,n,r,i)=>{let a=(e,t)=>Wh(e,t,n,r,i);if(e.kind===`Let`){a(e.body,js(e.definitions,Mh(n,t)));return}let o=zh(e,t);if(o){a(o.expression,o.scope);return}let s=Fh(e,t,n);if(s&&Rh(s,n))return;if(s&&s.params.length===0){if(ch(s.body,s.scope,n)===1){r.inits.push(jh(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,ks(s,e.args,Mh(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(jh(Dh,e));return}let c=ch(e,t,n);c<=1?r.inits.push(jh(Dh,e)):c===3&&r.temporals.push(jh(Dh,e))},Gh=(e,t,n,r,i)=>{let a=(t,n)=>Gh(e,t,n,r,i);if(t.kind===`Let`){a(t.body,js(t.definitions,Mh(r,n)));return}let o=zh(t,n);if(o){a(o.expression,o.scope);return}let s=Fh(t,n,r);if(s&&Rh(s,r))return;if(s&&s.params.length===Ph(t).length){a(s.body,t.kind===`Apply`?ks(s,t.args,Mh(r,n)):s.scope);return}if(t.kind===`Forall`&&Vh(()=>(ns(t.bounds,Mh(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(jh(e,a)):ch(a,n,r)<2?i.invariants.push(jh(e,a)):i.impliedTemporals.push(jh(e,t));return}let c=ch(t,n,r);c<=1?i.impliedInits.push(jh(e,t)):c===3&&i.impliedTemporals.push(jh(e,t))},Kh=(e,t)=>{let n=Zo(e,t);return n?.kind===`Operator`&&!Lh(n,t)?n:void 0},qh=e=>Wt([[`name`,e.name],[`location`,kh(e.location)]]),Jh=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:Kh(e.specification,t);a&&(Wh(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...Uh(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:hs(e.init,t);o?.kind===`Closure`&&r.inits.push(jh(e.init??``,o.body));let s=e.next===void 0?void 0:hs(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Uh(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=Kh(e,t);n&&r.invariants.push(jh(e,n.body))}),e.properties.forEach(e=>{let n=Kh(e,t);n&&Gh(e,n.body,void 0,t,r)}),r},Yh=(e,t,n)=>Jh(e,t,n).actions,Xh=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>Y(e[1])).join(`,`)})`,Zh=e=>`${e.name===Dh?`Action`:e.name}${Xh(e)} ${_(e.location.range??Oh)}`,Qh=e=>`${e.name}${Xh(e)}`,$h=(e,t,n,r)=>{let i=Jh(e,t,r),a=e=>Dt(e.map(Ah)),o=e=>Dt(e.flatMap(e=>{let n=Kh(e,t);return n?[qh(n)]:[]}));return Wt([[`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`,Dt(t.variables.map((e,t)=>Wt([[`name`,e],[`location`,kh(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},eg=`paired12`,tg=(e,t=16)=>e<=t*.75?t:tg(e,t*2),ng=(e,t)=>{let n=tg(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)},rg=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),ig=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),ag=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),og=e=>ag(e).replaceAll(`
429
+ `,`\\n`),sg=(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(``))}},cg=(e,t)=>{let n=[`strict digraph DiskGraph {
412
430
  `,`node [shape=box,style=rounded]
413
- `,e.colorize?`edge [colorscheme="${Dp}"]\n`:``,`nodesep=0.35;
431
+ `,e.colorize?`edge [colorscheme="${eg}"]\n`:``,`nodesep=0.35;
414
432
  `,`subgraph cluster_graph {
415
433
  `,`color="white";
416
434
  `],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="${Dp}",style=filled,shape=record ]\n`,...kp([...i.keys()],jp).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${i.get(e)}]\n`),`}`].join(``),c=()=>[...kp([...r],e=>e[0]).map(e=>`{rank = same; ${kp([...e[1]],Ap).map(e=>`${e};`).join(``)}}\n`),`}
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="${Np(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?Mp(s.signature):``;n.push(`${t.fingerprint} -> ${r.fingerprint} [label="${u}",color="${c}",fontcolor="${c}"];\n`),i||n.push(`${r.fingerprint} [label="${Np(r.getLabel())}",tooltip="${Np(r.getText())}"];\n`),a(t),l()},close:()=>t?.(e.path,n.join(``)+c())}},Ip=(e,t)=>e.dot?Fp(e,t):Pp(e,t),Lp=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),Rp=(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},zp=(e,t)=>{if(!M(e))throw new l(`The symmetry values of ${t} must be functions`);let n=V(e),r=/* @__PURE__ */ new Map;return n.domain.forEach((e,t)=>{let i=n.range[t];if(!N(e)||!N(i))throw new l(`Symmetry function must have model values as domain and range`);e.name!==i.name&&r.set(e.name,i)}),r},Bp=(e,t)=>{let n=t.definitions.get(e);if(n?.kind!==`Operator`||n.params.length>0)throw new l(`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(!j(r)||!R(r))throw new l(`The symmetry operator must specify a set of functions`);let i=z(r).elements.map(t=>zp(t,e));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(Lp(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=Rp(n,e),r=Lp(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}))},Vp=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=Wp(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(Wp(e[r],t));return a}},Hp=(e,t)=>{let n=[],r=[];for(let i of e){let e=Wp(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},Up=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,Wp=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=Up(e);if(n===0||n>64)return Gp(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=Gp(e,t),a=i!==e&&ze(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},Gp=(e,t)=>{let n=e.kind;if(n===`Set`){let n=Hp(e.elements,t);return n?Fe(n):e}if(n===`Function`||n===`LazyFunction`&&R(e.domain)){let n=V(e),r=Vp(n.domain,t),i=Vp(n.range,t)??n.range;if(r){let e=vt(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Ie(n.domain,e.range):e}return i===n.range?n:Ie(n.domain,i)}if(n===`Interval`||!j(e)||!R(e))return e;let r=z(e),i=Vp(r.elements,t);return i?ft(i):r},Kp=(e,t,n)=>{for(let r=t.length;r<e.length;r++)t.push(Wp(e[r],n));return t},qp=(e,t,n,r)=>{let i=[];for(let a=0;a<e.length;a++){let o=r?r[a]:a,s=Wp(e[o],n),c=L(s,t[o]);if(c>0)return;if(r||i.push(s),c<0)return r?e.map(e=>Wp(e,n)):Kp(e,i,n)}},Jp=(e,t,n)=>t.reduce((t,r)=>qp(e,t,r,n)??t,e),Yp=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],Xp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Zp=new Map(_u.flatMap(e=>e.map(t=>[t,e[0]]))),Qp=e=>Zp.get(e)??e,$p=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},em=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>($p(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()}},tm=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),nm=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:Qp(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:Qp(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}},rm=(e,t)=>{let n=[];for(let r=t;;){let t=nm(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},im=e=>({line:e.line,column:e.column}),am=(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=rm(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},om=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,sm={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},cm=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&om(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&om(e[n+1],e[n+2])?n+=om(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=>sm[e])}"`:r.text)}return t},lm=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},um=(e,t)=>e.find(e=>e.name===t)??e.map(e=>um(e.modules,t)).find(Boolean),dm=(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:xu.get(i)??t?.(i)??pc(e,i),s=o===void 0?[]:oe(o),c=lm(s),l=c.get(s[2]?.text??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=hc(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>um(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},fm=(e,t)=>{let n=dm(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],o=(e,n)=>{let i=rm(t,e+1);r.push({location:im(t[e]),apply:e=>i.forEach(t=>e.put(tm(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,a)=>{let l=e.start+a,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:im(u),apply:t=>t.put(tm(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&o(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&o(l,`variable`),u.text===`RECURSIVE`&&rm(t,l+1).every(e=>s.has(e))&&o(l,`definition`),Xp.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(im(u)),r.push({location:im(u),apply:e=>e.put(tm(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(tm(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=Qp(e.name);r.push({location:e.location,apply:n=>n.put(tm(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=a(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...i,...o].forEach(n=>{n.isLocal||t.put(tm(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(tm(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>jr(e.location,t.location)?-1:+!!jr(t.location,e.location))},i=/* @__PURE__ */ new Map,a=e=>{let t=i.get(e??``);if(t)return t;let o=em();i.set(e??``,o),gu.toReversed().forEach(e=>o.put(tm(e,`builtin`,!1)));let s=n(e);return s.getModule().extends.forEach(e=>a(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),r(s).forEach(e=>e.apply(o)),o};return a(void 0).enumerate().filter(e=>e.kind===`variable`).map(e=>e.name).reverse()},pm=(e,t,n)=>{let r=dm(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)}),vu.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=am(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;cm(s(void 0)).forEach((e,t)=>{t===3&&bu.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),cm(s(n)).forEach(a))}Yp.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),yu.forEach(a),[...i]},mm=(e,t)=>e*((t-e)/2**64),hm=e=>e.includes(`.`)?e:`${e}.0`,gm=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return hm(String(e));let[n,r]=e.toExponential().split(`e`);return`${hm(n)}E${r.replace(`+`,``)}`},_m=e=>e!==void 0&&e>=`0`&&e<=`9`,vm=e=>{if(e===0)return`0.0`;let t=gm(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;_m(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(;_m(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;_m(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(_m(t[n.next])&&Number(t[n.next])>=5&&(n.result=ym(n.result));_m(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},ym=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${ym(r)}.`:n===`9`?`${ym(r)}0`:`${r}${Number(n)+1}`},bm=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}`)},xm=(e,t,n)=>{if(mm(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},Sm=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}).`},Cm={line:0,column:0},wm=`Failed to recover the initial state from its fingerprint.`,Tm=`Failed to recover the next state from its fingerprint.`,Em=e=>({kind:`Identifier`,name:e,location:Cm}),Dm=/* @__PURE__ */ new Set([`name`,`property`]),Om=(e,t,n)=>{let r=$a(t,n);if(!r)throw new l(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new l(Dm.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=Om(e,t,n);if(to(r,n))throw new l(`The ${e} ${t} cannot be a constant.`);return r},Am=(e,t,n)=>{if(to(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return X(Em(e),Ym(n,void 0,void 0))}catch(e){if(e instanceof u)return;throw e}},jm=(e,t,n)=>{let r=Om(e,t,n),i=Am(t,r,n);if(i!==void 0&&i!==!0)throw new l(`The ${e} of ${t} is equal to ${H(i)}`);return i===void 0?r:void 0},Mm=(e,t)=>{let n=Rd({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>$a(e,t)});return e.flatMap(e=>{let r=jm(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2)throw new l(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${i.params.size===0?``:`
435
+ `,`node [ labeljust="l",colorscheme="${eg}",style=filled,shape=record ]\n`,...ng([...i.keys()],ig).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${i.get(e)}]\n`),`}`].join(``),c=()=>[...ng([...r],e=>e[0]).map(e=>`{rank = same; ${ng([...e[1]],rg).map(e=>`${e};`).join(``)}}\n`),`}
436
+ `,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="${og(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?ag(s.signature):``;n.push(`${t.fingerprint} -> ${r.fingerprint} [label="${u}",color="${c}",fontcolor="${c}"];\n`),i||n.push(`${r.fingerprint} [label="${og(r.getLabel())}",tooltip="${og(r.getText())}"];\n`),a(t),l()},close:()=>t?.(e.path,n.join(``)+c())}},lg=(e,t)=>e.dot?cg(e,t):sg(e,t),ug=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),dg=(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},fg=t=>n(new b(`${l}${t}`),e.error),pg=e=>{if(!P(e))throw fg(`The symmetry values must be function records.`);let t=xn(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!Pe(e)||!Pe(i))throw new y(`Symmetry function must have model values as domain and range`);e.name!==i.name&&n.set(e.name,i)}),n},mg=(e,t)=>{let n=t.definitions.get(e);if(n===void 0&&!t.constants.has(e))throw new y(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(n?.kind!==`Operator`||n.params.length>0)throw fg(`The symmetry function ${e} must specify a set of permutations.`);let r=cc(n.body,{environment:t,scope:void 0,state:void 0,next:void 0});if(!Me(r)||!Yt(r))throw fg(`The symmetry operator must specify a set of functions.`);let i=q(r).elements.map(pg);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(ug(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=dg(n,e),r=ug(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}))},hg=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=vg(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(vg(e[r],t));return a}},gg=(e,t)=>{let n=[],r=[];for(let i of e){let e=vg(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Ye);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Ye(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},_g=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,vg=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=_g(e);if(n===0||n>64)return yg(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=yg(e,t),a=i!==e&&nt(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},yg=(e,t)=>{let n=e.kind;if(n===`Set`){let n=gg(e.elements,t);return n?Qe(n):e}if(n===`Function`||n===`LazyFunction`&&Yt(e.domain)){let n=xn(e),r=hg(n.domain,t),i=hg(n.range,t)??n.range;if(r){let e=Nt(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?$e(n.domain,e.range):e}return i===n.range?n:$e(n.domain,i)}if(n===`Interval`||!Me(e)||!Yt(e))return e;let r=q(e),i=hg(r.elements,t);return i?Dt(i):r},bg=(e,t,n)=>{for(let r=t.length;r<e.length;r++)t.push(vg(e[r],n));return t},xg=(e,t,n,r)=>{let i=[];for(let a=0;a<e.length;a++){let o=r?r[a]:a,s=vg(e[o],n),c=Ye(s,t[o]);if(c>0)return;if(r||i.push(s),c<0)return r?e.map(e=>vg(e,n)):bg(e,i,n)}},Sg=(e,t,n)=>t.reduce((t,r)=>xg(e,t,r,n)??t,e),Cg=(e,t)=>e*((t-e)/2**64),wg=e=>e.includes(`.`)?e:`${e}.0`,Tg=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return wg(String(e));let[n,r]=e.toExponential().split(`e`);return`${wg(n)}E${r.replace(`+`,``)}`},Eg=e=>e!==void 0&&e>=`0`&&e<=`9`,Dg=e=>{if(e===0)return`0.0`;let t=Tg(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;Eg(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(;Eg(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;Eg(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(Eg(t[n.next])&&Number(t[n.next])>=5&&(n.result=Og(n.result));Eg(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},Og=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Og(r)}.`:n===`9`?`${Og(r)}0`:`${r}${Number(n)+1}`},kg=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}`)},Ag=(e,t,n)=>{if(Cg(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},jg=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}).`},Mg={line:0,column:0},Ng=`Failed to recover the initial state from its fingerprint.`,Pg=`Failed to recover the next state from its fingerprint.`,Fg=e=>({kind:`Identifier`,name:e,location:Mg}),Ig=/* @__PURE__ */ new Set([`name`,`property`]),Lg=(e,t,n)=>{let r=Zo(t,n);if(!r)throw new y(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new y(Ig.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},Rg=(e,t,n)=>{let r=Lg(e,t,n);if($o(r,n))throw new y(`The ${e} ${t} cannot be a constant.`);return r},zg=(e,t,n)=>{if($o(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return cc(Fg(e),i_(n,void 0,void 0))}catch(e){if(e instanceof b||d(e))return;throw e}},Bg=(e,t,n)=>{let r=Lg(e,t,n),i=zg(t,r,n);if(i!==void 0&&i!==!0)throw new y(`The ${e} of ${t} is equal to ${Y(i)}`);return i===void 0?r:void 0},Vg=(t,r)=>{let i=Ip({constants:new Set(r.constants.keys()),variables:new Set(r.variables),getDefinition:e=>Zo(e,r)});return t.flatMap(t=>{let a=Bg(`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
437
  Note that a bug can cause TLC to incorrectly report this error.
420
438
  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.`}`);return[{name:e,expression:Em(e),scope:void 0}]})},Nm=(e,t)=>{if(!M(e))return;let n=V(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])))},Pm=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Pm(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=$a(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Pm(n.body,t)}return[e]},Fm=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||$(r,e.scope,t)>0)return!1;let i=X(r,Ym(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 ${H(i)},\ncannot be used as a ${n}`);return!0},Im=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e===void 0)return;let n=Om(t,e,r).body,i=Em(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=Om(`name`,t.specification,r),c=Am(t.specification,s,r);if(c!==void 0)throw new l(`The value of ${t.specification} is equal to ${H(c)}`);if(Uf(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(Fm(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:Cm},next:a.length===0?void 0:p(a[0],i.length),scope:f,temporals:o}},Lm=(e,t)=>{let n={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let r=jm(`property`,e,t);r&&Uf(r.body,void 0,t,!0,e).forEach(r=>{let i=r.expression;if(Fm(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},Rm=(e,t,n)=>t.flatMap(t=>jm(e,t,n)?[{name:t,expression:Em(t),scope:void 0}]:[]),zm=(e,t)=>{let n=$a(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Bm=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new l(`_POSSIBLE lists ${n} more than once`);km(`possible`,n,t);let i=Em(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}}),Vm=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||U(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Hm=(e,t)=>e.flatMap(e=>Pm(e.expression,t).map(n=>{let r=e.scope===void 0?Fs(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Vm(n,r,t)}})),Um=(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},Wm=/[\u0100-\uffff]/,Gm=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Km=e=>e.kind===`String`?Wm.test(e.value):e.kind===`Set`&&e.elements.some(Km),qm=e=>e.kind===`String`&&Wm.test(e.value)||e.kind===`Apply`&&Gm.has(e.operator)||Ln(e).some(qm),Jm=(e,t)=>e.constants.some(e=>Km(e.value)||(e.args??[]).some(Km))||[...t.definitions.values()].some(e=>qm(e.body)||e.kind===`Function`&&e.bounds.some(e=>qm(e.set))),Ym=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),Xm=(e,t,n)=>Qa(X(e,t),n),Zm=(e,t,n=Qm)=>{let r=X(e,t);if(typeof r!=`boolean`)throw new u(n(e,t.environment));return r},Qm=(e,t)=>{let n=e.kind===`Identifier`?$a(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?za(i):Ba(r)}`},$m=()=>{},eh=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=Xm(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),th=(e,t,n)=>{try{return Xm(e,Ym(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof u)return{message:e.message};throw e}},nh=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=th(n.expression,t,`an assumption`);if(e)return{name:Ba(n.expression),trace:[],message:e.message}}},rh=(t,r,i)=>{let a=Mm(t.invariants,r),s=Im(t,r),c=Lm(t,r),u=Hm([...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=Hm(Rm(`constraint`,t.constraints,r),r),p=Rm(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&Om(`rlreward`,t.rlReward,r),t.periodic!==void 0&&Om(`periodic`,t.periodic,r);let m=Bm(t.possible,r);if(r.variables.length===0)return;let h=t.symmetry===void 0?[]:Bp(t.symmetry,r);t.view!==void 0&&Om(`view function`,t.view,r);let g=t.view===void 0?void 0:{name:t.view,expression:Em(t.view),scope:void 0},_=c.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Cm};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,Ym(r,t,void 0)),S=e=>{let t=te(),n=h.length===0?e:Jp(e,h,t);return Mc(g===void 0?t.map(e=>n[e]):[re(g.expression,n)])},ie=Jm(t,r);b.getFingerprint=S;let C=()=>{let e=m.find(e=>!b.possibleCounts.get(e.name));if(!e)return;let t=zm(e.name,r),n=t?` at ${za(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:A(H(Zc(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=Fc(te(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(ie)return[String(S(e))];let t=h.length===0?e:Jp(e,h,ne);return g===void 0?t:[re(g.expression,t)]},findViolatedInvariant:(t,i)=>u.find(a=>{if(Um(a,t,i))return!1;try{let e=Ym(r,t,void 0,a.scope),n=a.membership;return i&&n?!en(t[n.variable],i[n.variable],X(n.set,e)):!Zm(a.expression,e)}catch(t){throw i?ah(n(t,e.safetyEvaluationFailure),`Evaluating invariant ${a.name} failed.`):t}}),satisfiesConstraints:(e,t)=>f.every(n=>Um(n,e,t)||Zm(n.expression,Ym(r,e,void 0))),findFailedInitialPredicate:e=>c.initialPredicates.find(t=>!Zm(t.expression,Ym(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>_.find(n=>{try{return!Zm(n.action,Ym(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Ba(n.box)}`)&&!Xm(n.unchanged,Ym(r,e,t,n.scope),`a subscript`)}catch(e){throw ah(ih(e),`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>p.every(n=>Zm(n.expression,Ym(r,e,t),e=>`${o}${Qm(e,r)}`)),trackStatePossible:y.length===0?$m:e=>eh(y,b,Ym(r,e,void 0)),trackActionPossible:ee.length===0?$m:(e,t)=>eh(ee,b,Ym(r,e,t)),findUnwitnessedPossible:C,findPostconditionViolation:()=>{let e=C();if(e)return e;for(let e of t.postconditions){let t=th(Em(e),r,`a postcondition`);if(t)return{name:e,message:t.message??`Postcondition ${e} is false.`}}}}},ih=e=>e instanceof d?n(e,e.exitCode):e,ah=(e,t)=>e instanceof u?n(new u(`${t}\n${e.message}`,e),h(e)):e,oh=e=>{let t=e.dump&&Ip(e.dump,e.writeFile),n=sh(e,t);return t?.close(),n},sh=(e,t)=>{let n=typeof e.config==`string`?O(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};Te(pm(e.source,n,e.loadModule));let c=Qd(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=()=>Ep(n,f,c.variableLocations,c.instanceActions);let m={depth:0},g=(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=()=>({...g(`success`),outDegrees:[..._],fingerprintDistance:xm(p.distinctStates,p.generatedStates,()=>x?x.getStoredFingerprints(E,D):BigInt64Array.from(E,p.getFingerprint))}),x=rh(n,f,()=>fm(e.source,e.loadModule)),te=nh(c.assumptions,f);if(te)return g(`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=eu(t.trace,e===void 0||!n?void 0:{start:e,action:n()})}let r=x.findUnwitnessedPossible();return r||x.findPostconditionViolation(),g(e,r?{...t,unwitnessed:r}:t)},S=x.spec,ie=x.getFingerprintState,C={value:void 0},ae=n.view!==void 0||n.symmetry!==void 0,w=[],oe=a(()=>$f(x.properties.liveness,S.temporals,f,{getFingerprint:e=>w[e]??=Number(BigInt.asIntN(32,p.getFingerprint(E[e]))),getSuccessors:e=>{let t=[];return S.next===void 0||La(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=Ce(xe(r),r);return t.push({index:i,state:n.state}),!1},S.scope),t}})),T=x.isSymmetric||oe!==void 0,E=[],D=[],se=[],k=[],ce=[],le={slots:new Int32Array(1<<17),size:0,shift:16},ue=In(),A=e=>Object.fromEntries(x.getTlcOrder().map(t=>[f.variables[t],e[t]])),j=(e,t,n,r)=>(p.getLevel=()=>n+1,p.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),de(e,t[n].state,(t[n+1]??t[r??n]).state)),de=(e,t,n)=>{try{let r=km(`alias`,e,f).body,i=X(Em(e),Ym(f,t,n)),a=r.kind===`Record`?r.fields.map(e=>e.name):[];return Nm(i,a)??A(t)}catch(e){if(!(e instanceof l||e instanceof u))throw e;return{...A(t),_ALIASEvalError:e.message}}},M=(e,t,r)=>{C.value??=Sp(n,f,c.instanceActions);let i={...F};Object.assign(F,{index:e,isExpanding:!0,candidate:void 0});let a=ie(r),o=C.value.find(e=>Ra(e.expression,t,f,e.scope).some(e=>Se(ie(e.state),a)));return Object.assign(F,i),o&&wp(o)},N=(e,t,r)=>{let i=n.alias,a=s(()=>(e.length>1&&Go(f)&&fe(),e.map((n,r)=>r===0||n.action===`Stuttering`?void 0:M(t[r-1],e[r-1].state,n.state))));return e.map((t,n)=>({action:t.action,label:a[n],state:i===void 0?A(t.state):j(i,e,n,r)}))},fe=()=>S.init===void 0?[]:Ia(S.init,f,S.scope),pe=e=>S.next===void 0?[]:Ra(S.next,e,f,S.scope),me=(e,t)=>Se(ie(e),D[t]),he=(e,t)=>pe(e).find(e=>me(e.state,t)),ge=(e,t)=>{let n=ae||Go(f)?fe().find(t=>me(t,e[0])):E[e[0]];if(!n)throw new u(wm);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=he(i,e[n]);if(!a)throw new u(t);r.push(a)}return r},_e=(e,t)=>{let n=[];for(let t=e;t!==-1;t=se[t])n.unshift(t);let r=ae&&n.length>1?ge(n,wm):n.map(e=>({state:E[e],action:k[e]}));if(!t)return N(r,n);let i=ae?pe(E[e]).find(e=>Se(e.state,t.state))?.action:t.action;return N([...r,{state:t.state,action:i}],n)},ve=e=>se[e]===-1?[{action:void 0,label:void 0,state:A(E[e])}]:_e(e),ye=(e,t,n,r)=>{if(!(e instanceof u))throw e;return{...g(`error`,void 0,{message:e.message,trace:t,initialState:n&&!(e instanceof d)?A(n):void 0,exitCode:h(e)}),outDegrees:r}},be=(e,t)=>{let n=ge(e,Tm),r=n[n.length-1].state;if(ae&&t!==void 0&&t!==e.length-1&&he(r,e[t])===void 0)throw new u(Tm);return n},xe=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=fn(t,_n(e[n]));return t&1073741823},Se=(e,t)=>{for(let n=0;n<t.length;n++)if(!ze(e[n],t[n]))return!1;return!0},P=e=>Math.imul(e,2654435761)>>>le.shift<<1,Ce=(e,t)=>{let n=le.slots.length-1;for(let r=P(e);;r=r+2&n){let n=le.slots[r+1];if(n===0)return-1;if(le.slots[r]===e&&Se(D[n-1],t))return n-1}},we=(e,t)=>{let n=le.slots.length-1,r=P(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&&we(e[t],e[t+1])}we(e,t+1)},De=e=>{p.distinctStates=E.length+1,m.depth=Math.max(m.depth,e),p.diameter=Math.max(p.diameter,e)},Oe=(e,t,n,r)=>{let i=n===-1?1:ce[n]+1;E.push(e),D.push(t),se.push(n),k.push(r),ce.push(i)},F={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},I=e=>e===-1?[]:[...I(se[e]),E[e]];p.isSeen=e=>{let t=ie(e);return Ce(xe(t),t)!==-1},p.getBehavior=e=>{let t=e===F.candidate?-1:E.indexOf(e);return t===-1?[...I(F.index),e]:I(t)},p.getCurrentState=()=>F.index===-1?void 0:E[F.index],p.setLivenessSource=e=>{F.livenessSource=e??-1},p.getLevel=e=>{let t=F.livenessSource;return t===-1?e===F.candidate?F.candidateLevel:F.index===-1?0:e===E[F.index]?ce[F.index]:F.isExpanding?ce[F.index]+1:0:e===E[t]?ce[t]:ce[t]+1};let ke=(e,t)=>({fingerprint:BigInt.asIntN(64,p.getFingerprint(e)),level:t,getLabel:()=>Pn(n.alias===void 0?A(e):de(n.alias,e,void 0)),getText:()=>Pn(A(e))}),Ae=e=>{ue(e),p.generatedStates++,p.initialStates++,F.candidate=e,F.candidateLevel=1;let n=ie(e),r=xe(n),i=x.satisfiesConstraints(e);if(i&&x.trackStatePossible(e),i&&Ce(r,n)!==-1)return;i&&(De(1),p.queueSize++,oe?.addInitialState(E.length,e),t?.writeInitialState(ke(e,1)));let a=x.findViolatedInvariant(e);if(a)return re(`invariant-violation`,{name:a.name,trace:N([{action:void 0,state:e}],[])});let o=x.findFailedInitialPredicate(e);if(o)return re(`liveness-violation`,{name:o.name,trace:N([{action:void 0,state:e}],[])});i&&(Ee(r,E.length),Oe(e,n,-1,void 0))},je=(e,n,r,i,a)=>{let o=E[e];p.generatedStates++,F.candidate=n.state,F.candidateLevel=ce[e]+1,T&&ue(n.state);let s=ie(n.state),c=xe(s),l=Ce(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,ke(n.state,ce[e]+1),f!==-1,a&&{name:a.name,signature:Tp(a)}),f!==-1&&oe){let e=E[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&&(De(ce[e]+1),v.newStates++),f===-1)try{let t=x.findViolatedInvariant(n.state,o);if(t)return re(`invariant-violation`,{name:t.name,trace:_e(e,n)})}catch(t){return ye(t,_e(e,n),void 0,ee())}let h=x.findViolatedActionProperty(o,n.state);if(h)return re(`liveness-violation`,{name:h.name,trace:_e(e,n)});m&&(T||ue(n.state),Ee(c,E.length),oe&&r.push({index:E.length,state:n.state}),Oe(n.state,s,e,n.action),p.queueSize++)},Me={result:void 0};if(S.init!==void 0)try{Fa(S.init,f,e=>{try{Me.result=Ae(e)}catch(t){Me.result=ye(t,[],e)}return Me.result!==void 0},S.scope)}catch(e){return ye(e,[])}if(Me.result)return Me.result;let L=S.next;if(L===void 0){if(E.length>0)throw new u(`No next state actions defined to generate successor states from.`);return b()}let Ne=!!(e.dump?.dot&&(e.dump.actionLabels||e.dump.colorize)),Pe=(e,t)=>{if(!Ne)return La(L,e,f,e=>t(e,void 0),S.scope);C.value??=Sp(n,f,c.instanceActions);let r={isStopped:!1};return C.value.reduce((n,i)=>r.isStopped?n:n+La(i.expression,e,f,e=>(r.isStopped=t(e,i),r.isStopped),i.scope),0)},Fe=e=>{let r=E[e],i=[],a=t&&ke(r,ce[e]),o=Pe(r,(t,n)=>{try{Me.result=je(e,t,i,a,n)}catch(n){Me.result=ye(n,_e(e,t))}return Me.result!==void 0});if(F.isExpanding=!1,Me.result)return Me.result;if(o===0&&n.checkDeadlock)return re(`deadlock`,{name:`deadlock`,trace:ve(e)});try{let t=oe?.addState(e,r,i);if(!oe||!t)return;let n=be(t),a=oe.getViolatedProperties(n.map(e=>e.state),n.length-1);return re(`property-violation`,{name:a[0],properties:a,trace:N(n,t)})}catch(t){return ye(t,ve(e),void 0,ee())}},Ie=(e,t)=>{let n=[...t.prefix,...t.cycle],r=t.prefix.length,i=be(n,r),a=N(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(()=>M(l,u,E[c]));return re(`liveness-violation`,{name:o[0],properties:o,trace:a,loopStart:r,loopLabel:d},()=>c===l?a[a.length-1].action:he(u,c)?.action)},Le=oe!==void 0&&e.livenessCheck!==`final`,Re=performance.now(),Be={at:Re+3e3,size:1,time:0},Ve=e=>{let t=performance.now();if(Be.at=t+6e4,!((e-Be.size)/Be.size>.1)||Be.time>(t-Re)*.2)return;Be.size=e;let n=oe?.findViolation();return Be.time+=performance.now()-t,n};for(let e=0;e<E.length&&!p.isStopped;e++){F.index=e,F.candidate=void 0,p.queueSize=E.length-e-1,F.isExpanding=!0;try{Me.result=Fe(e)}catch(t){Me.result=ye(ih(t),ve(e))}if(Me.result)return Me.result;if(_[y()]++,v.newStates=0,Le&&performance.now()>=Be.at){let t=Ve(e+1);if(oe&&t)return Ie(oe,t)}}F.index=-1,F.candidate=void 0;let He=oe?.findViolation();if(oe&&He)return Ie(oe,He);let Ue=x.findPostconditionViolation();return Ue?g(`postcondition-violation`,{...Ue,trace:[]}):b()},ch=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},lh=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^_n(e[t]),16777619),r=Math.imul(r^wn(e[t]),1540483477);t[0]=ch(n)||1,t[1]=ch(r)},uh=()=>{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}},fh=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),ph=(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},mh=e=>Atomics.load(e.used,0)*2>=e.slots.length,hh=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}},gh=()=>{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=sn(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})}},_h=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 Pe(t.strings[n[r.index++]]);if(e===7){let e=n[r.index++],t=n[r.index++],a=Et({kind:`Interval`,low:e,high:e+t-1});return Ie(a,i(t))}let a=n[r.index++];if(e===5)return Fe(i(a));let o=i(a);return Ie(o,i(a))};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return O}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return e}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Ia}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return H}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Pn}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return f}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return c}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return m}}),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 De}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return u}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return p}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return Go}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return In}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return pm}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return hh}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return hc}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return lh}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return nh}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return vm}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return Sm}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return mm}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return fh}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return oe}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return Te}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return oh}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return xm}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return gh}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return ph}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return bm}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return uh}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return mh}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return _h}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return rh}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return fm}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Ra}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return gc}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return Qd}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return h}});
439
+ please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw n(new y(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${r}`),e.safetyEvaluationFailure)}return[{name:t,expression:Fg(t),scope:void 0}]})},Hg=(e,t)=>{if(!P(e))return;let n=xn(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])))},Ug=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Ug(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Zo(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Ug(n.body,t)}return[e]},Wg=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||ch(r,e.scope,t)>0)return!1;let i=cc(r,i_(t,void 0,void 0,e.scope));if(i===!1)throw new y(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new y(`The operator ${r.name}, which equals ${Y(i)},\ncannot be used as a ${n}`);return!0},Gg=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e===void 0)return;let n=Lg(t,e,r).body,i=Fg(e);if(n.kind!==`Number`&&n.kind!==`String`&&ch(i,void 0,r)===0)throw new y(`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=Lg(`name`,t.specification,r),c=zg(t.specification,s,r);if(c!==void 0)throw new y(`The value of ${t.specification} is equal to ${Y(c)}`);if(dh(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(Wg(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new y(`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`&&ch(c.expression,s.scope,r)<2)throw n(new y(`TLC cannot handle the temporal formula ${Io(c.expression)}`),e.error);let l=ch(c,s.scope,r);if(l===3)o.push(s);else{if(l===2)throw new y(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new y(`The specification ${t.specification} must contain at most one [][Next]_vars`);let l=[...i,...a],u=e=>`$specification${e}`,d=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),f=(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(f),location:Mg},next:a.length===0?void 0:f(a[0],i.length),scope:d,temporals:o}},Kg=(e,t)=>{let n={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let r=Bg(`property`,e,t);r&&dh(r.body,void 0,t,!0,e).forEach(r=>{let i=r.expression;if(Wg(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`&&ch(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=ch(i,r.scope,t);if(a<2)n.initialPredicates.push({name:r.name,expression:i,scope:r.scope});else{if(a===2)throw new y(`The property ${e} is an action-level formula`);n.liveness.push({name:e,expression:i,scope:r.scope})}})}),n},qg=(e,t,n)=>t.flatMap(t=>Bg(e,t,n)?[{name:t,expression:Fg(t),scope:void 0}]:[]),Jg=(e,t)=>{let n=Zo(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Yg=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new y(`_POSSIBLE lists ${n} more than once`);Rg(`possible`,n,t);let i=Fg(n);if(ch(i,void 0,t)===3)throw new y(`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}}),Xg=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||X(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Zg=(e,t)=>e.flatMap(e=>Ug(e.expression,t).map(n=>{let r=e.scope===void 0?Vc(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Xg(n,r,t)}})),Qg=(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},$g=/[\u0100-\uffff]/,e_=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),t_=e=>e.kind===`String`?$g.test(e.value):e.kind===`Set`&&e.elements.some(t_),n_=e=>e.kind===`String`&&$g.test(e.value)||e.kind===`Apply`&&e_.has(e.operator)||dr(e).some(n_),r_=(e,t)=>e.constants.some(e=>t_(e.value)||(e.args??[]).some(t_))||[...t.definitions.values()].some(e=>n_(e.body)||e.kind===`Function`&&e.bounds.some(e=>n_(e.set))),i_=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),a_=(e,t,n)=>Xo(cc(e,t),n),o_=(e,t,n=s_)=>{let r=cc(e,t);if(typeof r!=`boolean`)throw new b(n(e,t.environment));return r},s_=(e,t)=>{let n=e.kind===`Identifier`?Zo(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?_(i):Io(r)}`},c_=()=>{},l_=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=a_(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),u_=(e,t,n)=>{try{return a_(e,i_(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof b)return{message:e.message};throw e}},d_=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=u_(n.expression,t,`an assumption`);if(e)return{name:Io(n.expression),trace:[],message:e.message}}},f_=(t,r,i)=>{let a=Vg(t.invariants,r),o=Gg(t,r),s=Kg(t,r),c=Zg([...a,...s.invariants],r),l=c.length>0||s.actionProperties.length>0||s.liveness.length>0;if(o.init===void 0&&(l||s.initialPredicates.length>0||r.variables.length>0))throw new y(`The configuration file did not specify the initial state predicate.`);if(o.next===void 0&&l)throw new y(`The configuration file did not specify the next state predicate.`);let u=Zg(qg(`constraint`,t.constraints,r),r),d=qg(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&Lg(`rlreward`,t.rlReward,r),t.periodic!==void 0&&Lg(`periodic`,t.periodic,r);let f=Yg(t.possible,r);if(r.variables.length===0)return;let p=t.symmetry===void 0?[]:mg(t.symmetry,r);t.view!==void 0&&Lg(`view function`,t.view,r);let m=t.view===void 0?void 0:{name:t.view,expression:Fg(t.view),scope:void 0},h=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Mg};return{...e,unchanged:t}}),g=e=>ch(e.expression,void 0,r)>=2,v=f.filter(e=>!g(e)),b=f.filter(g),x=r.runtime,S={indices:void 0},C=()=>{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},w=p.length>0?C():void 0,T=(e,t)=>cc(e,i_(r,t,void 0)),ee=e=>{let t=C(),n=p.length===0?e:Sg(e,p,t);return Rl(m===void 0?t.map(e=>n[e]):[T(m.expression,n)])},te=r_(t,r);x.getFingerprint=ee;let ne=()=>{let e=f.find(e=>!x.possibleCounts.get(e.name));if(!e)return;let t=Jg(e.name,r),n=t?` at ${_(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:Oe(Y(ru(x),!0))}};return{properties:s,spec:o,isSymmetric:p.length>0,getTlcOrder:C,getStoredFingerprints:(e,t)=>{if(m!==void 0||te)return BigInt64Array.from(e,ee);let n=new BigInt64Array(t.length),r=Vl(C(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(te)return[String(ee(e))];let t=p.length===0?e:Sg(e,p,w);return m===void 0?t:[T(m.expression,t)]},findViolatedInvariant:(t,i)=>c.find(a=>{if(Qg(a,t,i))return!1;try{let e=i_(r,t,void 0,a.scope),n=a.membership;return i&&n?!bn(t[n.variable],i[n.variable],cc(n.set,e)):!o_(a.expression,e)}catch(t){throw i?v_(n(t,e.safetyEvaluationFailure),`Evaluating invariant ${a.name} failed.`):t}}),satisfiesConstraints:(e,t)=>u.every(n=>{try{return Qg(n,e,t)||o_(n.expression,i_(r,e,void 0))}catch(e){throw t?m_(e):e}}),findFailedInitialPredicate:e=>s.initialPredicates.find(t=>!o_(t.expression,i_(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>h.find(n=>{try{return!o_(n.action,i_(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Io(n.box)}`)&&!a_(n.unchanged,i_(r,e,t,n.scope),`a subscript`)}catch(e){throw v_(p_(e),`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>d.every(n=>{try{return o_(n.expression,i_(r,e,t))}catch(e){throw m_(e)}}),trackStatePossible:v.length===0?c_:e=>l_(v,x,i_(r,e,void 0)),trackActionPossible:b.length===0?c_:(e,t)=>l_(b,x,i_(r,e,t)),findUnwitnessedPossible:ne,findPostconditionViolation:()=>{let e=ne();if(e)return e;for(let e of t.postconditions){let t=u_(Fg(e),r,`a postcondition`);if(t)return{name:e,message:t.message??`Postcondition ${e} is false.`}}}}},p_=e=>e instanceof x?n(e,e.exitCode):e,m_=e=>e instanceof b&&!(e instanceof x)&&!(e instanceof C)?n(new b(`${l}${e.message}`,e),ne(e)):p_(e),h_=(e,t,n)=>t>0&&n[t-1]===e,g_=e=>e.flatMap(e=>e.location.range?[_(e.location.range)]:[]).filter((e,t,n)=>!h_(e,t,n)).map((e,t)=>`${t}) ${e}`).reverse(),__=(e,t)=>{try{return e(),{callStack:void 0}}catch(e){if(!(e instanceof b))return{callStack:[]};let n=t.flatMap(e=>{let t=e.location.range;return t?[`Line ${t.start.line}, column ${t.start.column} to line ${t.end.line}, column ${t.end.column} in ${t.module}`]:[]}).filter((e,t,n)=>!h_(e,t,n)),r=Ae(e);return{callStack:n,fingerprint:r&&{sources:g_(r),reason:e.message}}}},v_=(e,t)=>e instanceof b?n(new b(`${t}\n${e.message}`,e),ne(e)):e,y_=t=>{let r=t.dump&&lg(t.dump,t.writeFile);try{return b_(t,r)}catch(t){throw d(t)?n(new b(u),e.error):t}finally{r?.close()}},b_=(t,r)=>{let i=typeof t.config==`string`?Se(t.config):t.config,a=t.onPrint??console.log,o={isMuted:!1,replayed:void 0},s=e=>{o.replayed?o.replayed.push(e):o.isMuted||a(e)},l=e=>{o.isMuted=!0;let t=e();return o.isMuted=!1,t};ze(am(t.source,i,t.loadModule));let f=vm(i,{source:t.source,loadModule:t.loadModule,loadClass:t.loadClass,print:s,files:{readFile:t.readFile,writeFile:t.writeFile},seed:t.seed}),p=f.environment,m=p.runtime;m.pause=t.onPause??(()=>{}),m.getSpecification=()=>$h(i,p,f.variableLocations,f.instanceActions);let h={depth:0},g=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:m.generatedStates,distinctStates:m.distinctStates,queuedStates:m.queueSize,depth:m.generatedStates===0?0:Math.max(h.depth,1),outDegrees:void 0,fingerprintDistance:void 0}),_=Array.from({length:32},()=>0),v={newStates:0},S=()=>Math.min(v.newStates,31),T=()=>_.map((e,t)=>t===S()?e+1:e),ee=()=>({...g(`success`),outDegrees:[..._],fingerprintDistance:Ag(m.distinctStates,m.generatedStates,()=>E?E.getStoredFingerprints(M,me):BigInt64Array.from(M,m.getFingerprint))}),te=()=>im(t.source,t.loadModule,`variable`),E=f_(i,p,te),re=d_(f.assumptions,p);if(re)return g(`assumption-violation`,re);if(!E)return ee();let D=i.postconditions.length>0||i.possible.length>0,O=(e,t,n)=>{if(D){let e=t.loopStart;m.counterExample=Xd(t.trace,e===void 0||!n?void 0:{start:e,action:n()})}let r=E.findUnwitnessedPossible();return r||E.findPostconditionViolation(),g(e,r?{...t,unwitnessed:r}:t)},k=E.spec,A=E.getFingerprintState,ie={value:void 0},j=(e,t,n=!1)=>{if(!e.failure)return e;let r=[],a={...p,evaluators:/* @__PURE__ */ new WeakMap,trace:r},s=f_(i,a,te);if(!s)return e;let c=[];o.replayed=c,ke.current=/* @__PURE__ */ new WeakMap;let l=__(()=>t(s,a),r);return ke.current=void 0,o.replayed=void 0,{...e,failure:{...e.failure,replay:{output:c,...l,isBeforeError:n}}}},ae=(e,t)=>{try{Fe(A(e))}catch(e){throw t.trace&&Ae(e)&&(t.trace.length=0),e}},oe=e=>j(e,(e,t)=>{k.init!==void 0&&jo(k.init,t,n=>(e.satisfiesConstraints(n)&&ae(n,t),e.findViolatedInvariant(n)!==void 0||e.findFailedInitialPredicate(n)!==void 0),k.scope)}),se=e=>{let t=he[e];t===-1?Ee():(se(t),we(t,M[t],M[e]))},ce=(e,t)=>j(e,(e,n)=>{se(t);let r=M[t];ie.value??=Yh(i,p,f.instanceActions),ie.value.find(t=>Po(t.expression,r,n,t.scope).some(t=>{let i=e.satisfiesConstraints(t.state)&&e.satisfiesActionConstraints(r,t.state);return i&&ae(t.state,n),!i&&e.findViolatedInvariant(t.state)!==void 0||e.findViolatedActionProperty(r,t.state)!==void 0}))}),le=i.view!==void 0||i.symmetry!==void 0,ue=[],de={getFingerprint:e=>ue[e]??=Number(BigInt.asIntN(32,m.getFingerprint(M[e]))),getSuccessors:e=>{let t=[];return k.next===void 0||No(k.next,e,p,n=>{if(ye(n.state),!(E.satisfiesConstraints(n.state,e)&&E.satisfiesActionConstraints(e,n.state)))return!1;let r=A(n.state),i=Le(Fe(r),r);return t.push({index:i,state:n.state}),!1},k.scope),t}},fe=c(()=>Eh(E.properties.liveness,k.temporals,p,de)),pe=E.isSymmetric||fe!==void 0,M=[],me=[],he=[],ge=[],_e=[],ve={slots:new Int32Array(1<<17),size:0,shift:16},ye=ur(),be=e=>Object.fromEntries(E.getTlcOrder().map(t=>[p.variables[t],e[t]])),xe=(e,t,n,r)=>(m.getLevel=()=>n+1,m.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),Ce(e,t[n].state,(t[n+1]??t[r??n]).state)),Ce=(e,t,n)=>{try{let r=Rg(`alias`,e,p).body,i=cc(Fg(e),i_(p,t,n)),a=r.kind===`Record`?r.fields.map(e=>e.name):[];return Hg(i,a)??be(t)}catch(e){if(!(e instanceof y||e instanceof b))throw e;return{...be(t),_ALIASEvalError:e.message}}},we=(e,t,n)=>{ie.value??=Yh(i,p,f.instanceActions);let r={...B};Object.assign(B,{index:e,isExpanding:!0,candidate:void 0});let a=A(n),o=ie.value.find(e=>Po(e.expression,t,p,e.scope).some(e=>F(A(e.state),a)));return Object.assign(B,r),o&&Zh(o)},Te=(e,t,n)=>{let r=i.alias,a=l(()=>(e.length>1&&Hs(p)&&Ee(),e.map((n,r)=>r===0||n.action===`Stuttering`?void 0:we(t[r-1],e[r-1].state,n.state))));return e.map((t,i)=>({action:t.action,label:a[i],state:r===void 0?be(t.state):xe(r,e,i,n)}))},Ee=()=>k.init===void 0?[]:Mo(k.init,p,k.scope),De=e=>k.next===void 0?[]:Po(k.next,e,p,k.scope),Oe=(e,t)=>F(A(e),me[t]),N=(e,t)=>De(e).find(e=>Oe(e.state,t)),je=(e,t)=>{let n=le||Hs(p)?Ee().find(t=>Oe(t,e[0])):M[e[0]];if(!n)throw new b(Ng);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=N(i,e[n]);if(!a)throw new b(t);r.push(a)}return r},Me=(e,t)=>{let n=[];for(let t=e;t!==-1;t=he[t])n.unshift(t);let r=le&&n.length>1?je(n,Ng):n.map(e=>({state:M[e],action:ge[e]}));if(!t)return Te(r,n);let i=le?De(M[e]).find(e=>F(e.state,t.state))?.action:t.action;return Te([...r,{state:t.state,action:i}],n)},Ne=e=>he[e]===-1?[{action:void 0,label:void 0,state:be(M[e])}]:Me(e),P=(t,r,i,a)=>{if(d(t))return B.isExpanding?P(n(new b(u),e.error),Ne(B.index)):P(new b(u),r,i);if(!(t instanceof b))throw t;return{...g(`error`,void 0,{message:t.message,trace:r,initialState:i&&!(t instanceof x)?be(i):void 0,exitCode:ne(t)}),outDegrees:a}},Pe=(e,t)=>{let n=je(e,Pg),r=n[n.length-1].state;if(le&&t!==void 0&&t!==e.length-1&&N(r,e[t])===void 0)throw new b(Pg);return n},Fe=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Ln(t,Un(e[n]));return Gn(e),t&1073741823},F=(e,t)=>{for(let n=0;n<t.length;n++)if(!nt(e[n],t[n]))return!1;return!0},Ie=e=>Math.imul(e,2654435761)>>>ve.shift<<1,Le=(e,t)=>{let n=ve.slots.length-1;for(let r=Ie(e);;r=r+2&n){let n=ve.slots[r+1];if(n===0)return-1;if(ve.slots[r]===e&&F(me[n-1],t))return n-1}},I=(e,t)=>{let n=ve.slots.length-1,r=Ie(e);for(;ve.slots[r+1]!==0;)r=r+2&n;ve.slots[r]=e,ve.slots[r+1]=t},L=(e,t)=>{if(ve.size++,ve.size*4>ve.slots.length){let e=ve.slots;ve.slots=new Int32Array(e.length*2),ve.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&I(e[t],e[t+1])}I(e,t+1)},R=e=>{m.distinctStates=M.length+1,h.depth=Math.max(h.depth,e),m.diameter=Math.max(m.diameter,e)},z=(e,t,n,r)=>{let i=n===-1?1:_e[n]+1;M.push(e),me.push(t),he.push(n),ge.push(r),_e.push(i)},B={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,isFingerprinting:!1,livenessSource:-1},Re=e=>e===-1?[]:[...Re(he[e]),M[e]];m.isSeen=e=>{let t=A(e);return Le(Fe(t),t)!==-1},m.getBehavior=e=>{let t=e===B.candidate?-1:M.indexOf(e);return t===-1?[...Re(B.index),e]:Re(t)},m.getCurrentState=()=>B.index===-1?void 0:M[B.index],m.setLivenessSource=e=>{B.livenessSource=e??-1},m.getLevel=e=>{let t=B.livenessSource;return t===-1?e===B.candidate?B.candidateLevel:B.index===-1?0:e===M[B.index]?_e[B.index]:B.isExpanding?_e[B.index]+1:0:e===M[t]?_e[t]:_e[t]+1};let V=(e,t)=>({fingerprint:BigInt.asIntN(64,m.getFingerprint(e)),level:t,getLabel:()=>cr(i.alias===void 0?be(e):Ce(i.alias,e,void 0)),getText:()=>cr(be(e))}),H=e=>{ye(e),m.generatedStates++,m.initialStates++,B.candidate=e,B.candidateLevel=1;let t=A(e),n=Fe(t),i=E.satisfiesConstraints(e);if(i&&E.trackStatePossible(e),i&&Le(n,t)!==-1)return;i&&(R(1),m.queueSize++,fe?.addInitialState(M.length,e),r?.writeInitialState(V(e,1)));let a=E.findViolatedInvariant(e);if(a)return O(`invariant-violation`,{name:a.name,trace:Te([{action:void 0,state:e}],[])});let o=E.findFailedInitialPredicate(e);if(o)return O(`liveness-violation`,{name:o.name,trace:Te([{action:void 0,state:e}],[])});i&&(L(n,M.length),z(e,t,-1,void 0))},U=(e,t,n,i,a)=>{let o=M[e];m.generatedStates++,B.candidate=t.state,B.candidateLevel=_e[e]+1,pe&&ye(t.state),B.isFingerprinting=!0;let s=A(t.state),c=Fe(s);B.isFingerprinting=!1;let l=Le(c,s),u=E.satisfiesConstraints(t.state,o);u&&E.trackStatePossible(t.state);let d=u&&E.satisfiesActionConstraints(o,t.state);d&&E.trackActionPossible(o,t.state);let f=d?l:-1;if(i&&d&&r?.writeSuccessor(i,V(t.state,_e[e]+1),f!==-1,a&&{name:a.name,signature:Qh(a)}),f!==-1&&fe){let e=M[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&&(R(_e[e]+1),v.newStates++),f===-1)try{let n=E.findViolatedInvariant(t.state,o);if(n)return O(`invariant-violation`,{name:n.name,trace:Me(e,t)})}catch(n){return P(n,Me(e,t),void 0,T())}let h=E.findViolatedActionProperty(o,t.state);if(h)return O(`liveness-violation`,{name:h.name,trace:Me(e,t)});p&&(pe||ye(t.state),L(c,M.length),fe&&n.push({index:M.length,state:t.state}),z(t.state,s,e,t.action),m.queueSize++)},W={result:void 0};if(k.init!==void 0)try{jo(k.init,p,e=>{try{W.result=H(e)}catch(t){W.result=P(t,[],e)}return W.result!==void 0},k.scope)}catch(e){if(!(e instanceof w))return oe(P(e,[]));let t=P(e,[],e.state.map(e=>e??Ze(`null`)));return{...t,failure:t.failure&&{...t.failure,isWithoutStatistics:!0}}}if(W.result)return oe(W.result);let Be=k.next;if(Be===void 0){if(M.length>0)throw new b(`No next state actions defined to generate successor states from.`);return ee()}let Ve=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),He=(e,t)=>{if(!Ve)return No(Be,e,p,e=>t(e,void 0),k.scope);ie.value??=Yh(i,p,f.instanceActions);let n={isStopped:!1};return ie.value.reduce((r,i)=>n.isStopped?r:r+No(i.expression,e,p,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},Ue=e=>{let t=M[e],n=[],a=r&&V(t,_e[e]),o=He(t,(t,r)=>{try{W.result=U(e,t,n,a,r)}catch(n){if(B.isFingerprinting)throw n;let r=P(n,Me(e,t));W.result=d(n)?r:ce(r,e)}return W.result!==void 0});if(B.isExpanding=!1,W.result)return W.result;if(o===0&&i.checkDeadlock)return O(`deadlock`,{name:`deadlock`,trace:Ne(e)});try{let r=fe?.addState(e,t,n);if(!fe||!r)return;let i=Pe(r),a=fe.getViolatedProperties(i.map(e=>e.state),i.length-1);return O(`property-violation`,{name:a[0],properties:a,trace:Te(i,r)})}catch(r){return j(P(m_(r),Ne(e),void 0,T()),(r,i)=>Eh(E.properties.liveness,k.temporals,i,de)?.addState(e,t,n),!0)}},We=(e,t)=>{ie.value??=Yh(i,p,f.instanceActions);let n=ie.value,r=n.length===1?n[0]:n.find(t=>t.name===e.action),a=`variable${e.missing.length>1?`s are`:` is`} not defined: ${e.missing.join(`, `)}.\n`;return m.generatedStates++,P(n.length===1?e:new b(`Successor state is not completely specified by action ${e.action} of the next-state relation. The following ${a}`),[...Ne(t),{action:e.action,label:r&&Zh(r),state:be(e.state.map(e=>e??Ze(`null`)))}])},Ge=(e,t)=>{let n=[...t.prefix,...t.cycle],r=t.prefix.length,i=Pe(n,r),a=Te(i,n,r),o=e.getViolatedProperties(i.map(e=>e.state),r),s=n[r],c=n[n.length-1],u=i[i.length-1].state,d=s===c?void 0:l(()=>we(c,u,M[s]));return O(`liveness-violation`,{name:o[0],properties:o,trace:a,loopStart:r,loopLabel:d},()=>s===c?a[a.length-1].action:N(u,s)?.action)},Ke=fe!==void 0&&t.livenessCheck!==`final`,qe=performance.now(),Je={at:qe+3e3,size:1,time:0},Ye=e=>{let t=performance.now();if(Je.at=t+6e4,!((e-Je.size)/Je.size>.1)||Je.time>(t-qe)*.2)return;Je.size=e;let n=fe?.findViolation();return Je.time+=performance.now()-t,n};for(let e=0;e<M.length&&!m.isStopped;e++){B.index=e,B.candidate=void 0,m.queueSize=M.length-e-1,B.isExpanding=!0;try{W.result=Ue(e)}catch(t){let n=t instanceof C?We(t,e):P(m_(t),Ne(e));W.result=t instanceof C||d(t)?n:ce(n,e)}if(W.result)return W.result;if(_[S()]++,v.newStates=0,Ke&&performance.now()>=Je.at){let t=Ye(e+1);if(fe&&t)return Ge(fe,t)}}B.index=-1,B.candidate=void 0;let Xe=fe?.findViolation();if(fe&&Xe)return Ge(fe,Xe);let Qe=E.findPostconditionViolation();return Qe?g(`postcondition-violation`,{...Qe,trace:[]}):ee()},x_=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},S_=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Un(e[t]),16777619),r=Math.imul(r^Qn(e[t]),1540483477);Gn(e),t[0]=x_(n)||1,t[1]=x_(r)},C_=()=>{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)}}},w_=(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}},T_=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),E_=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return w_(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},D_=e=>Atomics.load(e.used,0)*2>=e.slots.length,O_=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&w_(t,n);return{slots:t,used:e.used}},k_=()=>{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=Mn(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})}},A_=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 Ze(t.strings[n[r.index++]]);if(e===7){let e=n[r.index++],t=n[r.index++],a=Vt({kind:`Interval`,low:e,high:e+t-1});return $e(a,i(t))}let a=n[r.index++];if(e===5)return Qe(i(a));let o=i(a);return $e(o,i(a))};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return ze}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return m}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Hs}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return cr}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return ur}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return b}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return ne}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return T}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return p}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return fe}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return y}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return Y}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return f}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return te}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return Sl}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Po}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return e}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return h}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return vm}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return O_}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return Ju}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return S_}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return d_}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return Dg}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return jg}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return Cg}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return T_}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return Se}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return Ve}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return y_}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return Ag}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return k_}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return E_}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return kg}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return C_}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return D_}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return A_}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return f_}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return im}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Mo}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return xl}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return am}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return ee}});