tla-ts 0.0.10-dev.96638cd93 → 0.0.10-dev.a17d6d9fa
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/deciders.cjs +30 -30
- package/dist/deciders.js +30 -30
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +1 -1
- package/dist/index.d.ts +1 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +60 -60
- package/dist/prove.js +73 -73
- package/dist/run.cjs +42 -42
- package/dist/run.js +42 -42
- package/dist/transfer.cjs +34 -34
- package/dist/transfer.js +29 -29
- package/dist/worker.cjs +1 -1
- package/dist/worker.js +1 -1
- package/package.json +1 -1
- package/src/bags.ts +5 -2
- package/src/builtins.ts +4 -3
- package/src/check-failure.ts +1 -1
- package/src/check-trace.ts +90 -51
- package/src/check.ts +251 -133
- package/src/cli/tlc.ts +3 -2
- package/src/codegen.ts +18 -5
- package/src/dfid.ts +13 -8
- package/src/environment.ts +1 -0
- package/src/evaluate.ts +25 -9
- package/src/exit-codes.ts +1 -0
- package/src/java-hash.ts +14 -0
- package/src/liveness-checker.ts +63 -31
- package/src/liveness.ts +48 -10
- package/src/parser.ts +6 -1
- package/src/prover/smt/solver/arith-rewriter.ts +11 -3
- package/src/prover/smt/solver/array-rewriter.ts +12 -2
- package/src/prover/smt/solver/asserted-formulas.ts +109 -63
- package/src/prover/smt/solver/ast.ts +5 -3
- package/src/prover/smt/solver/auf-solver.ts +23 -12
- package/src/prover/smt/solver/bit-blast-tactic.ts +26 -0
- package/src/prover/smt/solver/bound-simplifier.ts +10 -11
- package/src/prover/smt/solver/card2bv.ts +31 -15
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +39 -23
- package/src/prover/smt/solver/context.ts +24 -7
- package/src/prover/smt/solver/dependent-expr-state.ts +1 -1
- package/src/prover/smt/solver/elim-bounds.ts +89 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +1 -1
- package/src/prover/smt/solver/internalizer.ts +1 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +4 -0
- package/src/prover/smt/solver/model-evaluator.ts +2 -0
- package/src/prover/smt/solver/model-generator.ts +82 -42
- package/src/prover/smt/solver/opt-context.ts +11 -4
- package/src/prover/smt/solver/opt-pareto.ts +19 -0
- package/src/prover/smt/solver/opt-solver.ts +3 -2
- package/src/prover/smt/solver/poly-rewriter.ts +1 -0
- package/src/prover/smt/solver/proto-model.ts +4 -2
- package/src/prover/smt/solver/push-app-ite.ts +37 -0
- package/src/prover/smt/solver/qsat.ts +16 -6
- package/src/prover/smt/solver/rewriter.ts +31 -25
- package/src/prover/smt/solver/sat/goal2sat.ts +0 -1
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +13 -4
- package/src/prover/smt/solver/sat/sat-tactic.ts +9 -2
- package/src/prover/smt/solver/smt-kernel.ts +30 -2
- package/src/prover/smt/solver/smt-setup.ts +28 -4
- package/src/prover/smt/solver/smtlib-parser.ts +26 -3
- package/src/prover/smt/solver/smtlib-script.ts +34 -21
- package/src/prover/smt/solver/solve-eqs.ts +24 -17
- package/src/prover/smt/solver/solver.ts +18 -3
- package/src/prover/smt/solver/tactic.ts +68 -41
- package/src/prover/smt/solver/theory-bv.ts +11 -1
- package/src/prover/smt/solver/theory-fpa.ts +1 -1
- package/src/prover/smt/solver/theory-lra-final-check.ts +1 -0
- package/src/prover/smt/solver/theory-lra-internalize.ts +1 -0
- package/src/prover/smt/solver/theory-lra-propagate.ts +7 -1
- package/src/prover/smt/solver/theory-lra.ts +1 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +1 -0
- package/src/resolve.ts +120 -52
- package/src/runtime.ts +4 -0
- package/src/search.ts +117 -81
- package/src/simulate.ts +110 -50
- package/src/spec-description.ts +3 -4
- package/src/standard-modules.ts +15 -6
- package/src/subexpressions.ts +34 -9
- package/src/successors.ts +3 -2
- package/src/tlc/random.ts +2 -1
- package/src/tlc/replay.ts +3 -2
- package/src/tlc/tlc-operators.ts +7 -7
- package/src/tlc/tlcext-operators.ts +26 -10
- package/src/tlc/trace-spec.ts +6 -20
- package/src/typed-tier.ts +3 -2
- package/src/values.ts +95 -57
package/dist/transfer.js
CHANGED
|
@@ -16,10 +16,10 @@ import{$ as e,A as t,B as n,C as r,F as i,G as a,H as o,I as s,J as c,K as l,P a
|
|
|
16
16
|
\r`.includes(e[t]))n++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=s();if(e!==void 0)return e}else{let r=Ge(e,t);if(r.length===0){let n=Xe(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),a=r<e.length?n:i.length>1?i:``;return o(t,r,a)}let a=i(r.kind,t,r.length);return n+=r.length,a}}return a()}},Qe=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
|
|
17
17
|
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),$e=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>Qe.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),et=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${$e(n)}" (${n.charCodeAt(0)}), `}after : "${$e(r)}"`,tt=e=>{let t=Ze(e);for(let e=t();typeof e!=`string`&&e.kind!==A(`EOF`);e=t()){let t=e.image.split(``).findIndex(e=>{let t=e.charCodeAt(0);return t>255&&(t&255)<128});if(t===-1)continue;let n=e.image.slice(1,t+1).split(``).reduce((e,t)=>t===` `?Ke(e):e+1,e.beginColumn);return et(e.beginLine,n,e.image[t],e.image.slice(0,t))}},nt=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],rt=/* @__PURE__ */ new Set([...nt,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),it=[`TYPE`,`TYPE_CONSTRAINT`],at=/* @__PURE__ */ new Set([...nt,...it]),ot=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],j=e=>{let t=0,n=0;do{if(t>=e.length)return;let r=e.slice(t,t+2),i=r===`(*`?1:r===`*)`?-1:0;n+=i,t+=i===0?1:2}while(n>0);return t},st=e=>{let t=[],n=0,r=1,i=0,a=(n,a)=>{t.push({kind:`Error`,text:et(r,n-i+1,e[n],a),line:r})},o=e=>{t.push({kind:`Error`,text:et(r+1,0,void 0,e),line:r})},s=e=>{let t=e.split(`
|
|
18
18
|
`);t.length>1&&(r+=t.length-1,i=n+e.length-t[t.length-1].length),n+=e.length};for(;n<e.length;){let i=e.slice(n),c=/^\s+/.exec(i)?.[0];if(c){s(c);continue}if(i.startsWith(`\\*`)){let e=i.indexOf(`
|
|
19
|
-
`);s(e===-1?i:i.slice(0,e));continue}if(i.startsWith(`(*`)){let e=j(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=Te(e,n),d=u>0?i.slice(0,u):/^\d+(?![A-Za-z_])/.exec(i)?.[0];if(d){t.push({kind:`Number`,text:d,line:l}),s(d);continue}let f=/^[A-Za-z0-9_]+/.exec(i)?.[0];if(f){t.push({kind:`Word`,text:f,line:l}),s(f);continue}if(i.startsWith(`"`)){let r=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(i),c=r?.[0]??`"`;if(r?.[2]!==`"`)return s(c),n===e.length?o(`${c}\n`):a(n,c),t;t.push({kind:`String`,text:c,line:l}),s(c);continue}let p=ve(e,n)??ge(e,n),m=ot.find(e=>i.startsWith(e));if(m&&m.length>=(p?.length??0))t.push({kind:`Symbol`,text:m,line:l}),s(m);else{if(!p)return a(n,``),t;t.push({kind:`Word`,text:p.text,line:l}),s(e.slice(n,n+p.length))}}return t.push({kind:`End`,text:``,line:r}),t},ct=(e,t)=>new C(`TLC found an error in the configuration file at line ${e}\n${t}`),lt=(e,t)=>ct(e,`The keyword ${t} appeared twice.`),ut=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),dt=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),ft=(e,t=`master`)=>{let n=t===`1.7.4`?at:rt,r=st(e),i=0,a={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],rawConstants:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},o=!1,s=/* @__PURE__ */ new Set,c=()=>{let e=r[Math.min(i++,r.length-1)];if(e.kind===`Error`)throw new C(`TLC found an error in the configuration file:\n${e.text}`);return e},l=e=>{if(e.kind===`Number`&&e.text.startsWith(`\\`))throw x(new C(`${y(`java.lang.NumberFormatException`)}For input string: "${e.text}"`),S.error);if(e.kind===`Number`)return{kind:`Number`,value:Number(e.text)};if(e.kind===`String`&&e.text.includes(`\\`))throw new C(`TLC found an error in the configuration file:\nescape sequences are not supported in strings at line ${e.line}`);if(e.kind===`String`)return{kind:`String`,value:e.text.slice(1,-1)};if(e.text===`TRUE`||e.text===`FALSE`)return{kind:`Boolean`,value:e.text===`TRUE`};if(e.text===`{`){let e=[],t=c();if(t.text!==`}`)for(;e.push(l(t)),t=c(),t.text===`,`;)t=c();if(t.text!==`}`)throw ct(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 ct(e.line,`It was expecting a value, but did not find it.`)},u=e=>{let t=c();if(t.kind===`End`)throw ct(t.line,`Expected an identifier after ${e}[.`);let n=c();if(n.text!==`]`)throw ct(n.line,`It was expecting ], but did not find it.`);return t.text},d=(e,t)=>{let n=e.text,r=c();for(;r.text===`!`;)n=`${n}!${c().text}`,r=c();if(r.text===`<-`){if(r=c(),r.text===`[`){let e=u(`<-`),t=c();if(t.kind===`End`)throw ct(t.line,`Expected an identifier after <-[mod].`);a.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw ct(r.line,`Expected an identifier after <-.`);a.substitutions.push({name:n,target:r.text});return}let i=[],o=r.text===`(`;if(o){for(;i.push(l(c())),r=c(),r.text===`,`;);if(r.text!==`)`)throw ct(t,``);r=c()}if(r.text!==`=`)throw ct(r.line,`It was expecting = or <-, but did not find it.`);r=c();let s=r.text===`[`?u(`=`):void 0,d=l(s===void 0?r:c());a.constants.push({name:n,value:d,...o&&{args:i},...s!==void 0&&{module:s}})},f=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;let o=i-1;d(t,e),a.rawConstants.push(r.slice(o,i).map(e=>e.text).join(` `))}},p=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;e.push(t.text)}},m=c();for(;m.kind!==`End`;){let e=m.text,t=m.line,r=n.has(e)?ut.get(e):void 0,i=n.has(e)?dt.get(e):void 0,l=()=>{let n=c();if(n.kind===`End`)throw ct(t,`The keyword ${e} was not followed by an identifier.`);return n};if(r!==void 0){let n=l();if(a[r]!==void 0)throw lt(t,e);a[r]=n.text,m=c()}else if(i!==void 0)m=p(a[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)m=f(t);else if(e===`CHECK_DEADLOCK`){let n=l();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw ct(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(o)throw lt(t,e);o=!0,a.checkDeadlock=n.text===`TRUE`,m=c()}else{if(!n.has(e)||!it.includes(e))throw ct(t,`It was expecting a keyword, but did not find it.`);if(l(),s.has(e))throw lt(t,e);s.add(e),m=c()}}return a},pt=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],mt=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(pt),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},ht=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},M=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,gt=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},_t={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},vt=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},yt=e=>e!==void 0&&/^\p{Nd}$/u.test(e),bt=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),xt=e=>{let t=t=>{let n=ye(e,t,vt);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l=t(i);for(;l!==void 0&&e[l]!==a;){let n=o(l);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l=t(i)}if(l!==void 0)return c.last=l,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=ye(e,t,yt);if(e.startsWith(`..`,n)&&yt(e[n+2]))return{kind:`Constant`,first:t,last:ye(e,n+2,yt)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=yt(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:ye(e,t+1,yt)-1,children:[]};if(bt(n))return{kind:`Constant`,first:t,last:ye(e,t,bt)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},N=e=>{let t=e.length===0?void 0:xt(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=_t[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),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},St={general:1e3,stackOverflow:1005,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,unchangedVariableChanged:2143,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,initialStateIncomplete:2106,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,noInitialStates:2118,errorState:2120,behaviorUpToThisPoint:2121,backToState:2122,subscriptUndetermined:2139,subscriptMissingVariable:2140,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,simulating:2188,finished:2186,traceSpecWritten:2501,traceSpecFailed:2502,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,coverageStart:2201,coverageEnd:2202,coverageValue:2221,depthFirstStats:2204,depthFirstLevel:2205,depthFirstProgress:2206,depthFirstInitGenerated:2208,simulationProgress:2209,simulationStats:2210,temporalBranches:2212,statePrint1:2216,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,noInitialStatesInModel:2256,version:2262,depthFirstModelChecking:2271,noSpecificationButProperty:2257,fairnessTautology:2258,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,coverageNext:2772,coverageInit:2773,coverageProperty:2774,coverageValueCost:2775,coverageEndOverhead:2777,coverageConstraint:2778,coverageVariable:2779,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001,moduleOverrideStdout:2e4},Ct={none:0,error:1,warning:3,state:4},wt={0:``,1:`Error: `,3:`Warning: `,4:`State `},Tt=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${wt[n]}${r}`,Et=e=>{let t=/* @__PURE__ */ new Set;return{isTool:e.isTool,isDiffTrace:e.isDiffTrace??!1,version:e.version??`master`,print:(n,r,i)=>{let a=r===Ct.warning;if(a&&e.errorCodes?.includes(n))throw new o(n,i);if(a&&e.isWarningEnabled===!1||r!==Ct.error&&e.suppressedCodes?.includes(n))return;let s=a&&!e.isTool&&t.size===0?`
|
|
20
|
-
(Use the -nowarning option to disable this warning.)`:``,c=
|
|
19
|
+
`);s(e===-1?i:i.slice(0,e));continue}if(i.startsWith(`(*`)){let e=j(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=Te(e,n),d=u>0?i.slice(0,u):/^\d+(?![A-Za-z_])/.exec(i)?.[0];if(d){t.push({kind:`Number`,text:d,line:l}),s(d);continue}let f=/^[A-Za-z0-9_]+/.exec(i)?.[0];if(f){t.push({kind:`Word`,text:f,line:l}),s(f);continue}if(i.startsWith(`"`)){let r=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(i),c=r?.[0]??`"`;if(r?.[2]!==`"`)return s(c),n===e.length?o(`${c}\n`):a(n,c),t;t.push({kind:`String`,text:c,line:l}),s(c);continue}let p=ve(e,n)??ge(e,n),m=ot.find(e=>i.startsWith(e));if(m&&m.length>=(p?.length??0))t.push({kind:`Symbol`,text:m,line:l}),s(m);else{if(!p)return a(n,``),t;t.push({kind:`Word`,text:p.text,line:l}),s(e.slice(n,n+p.length))}}return t.push({kind:`End`,text:``,line:r}),t},ct=(e,t)=>new C(`TLC found an error in the configuration file at line ${e}\n${t}`),lt=(e,t)=>ct(e,`The keyword ${t} appeared twice.`),ut=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),dt=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),ft=(e,t=`master`)=>{let n=t===`1.7.4`?at:rt,r=st(e),i=0,a={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],rawConstants:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},o=!1,s=/* @__PURE__ */ new Set,c=()=>{let e=r[Math.min(i++,r.length-1)];if(e.kind===`Error`)throw new C(`TLC found an error in the configuration file:\n${e.text}`);return e},l=e=>{if(e.kind===`Number`&&e.text.startsWith(`\\`))throw x(new C(`${y(`java.lang.NumberFormatException`)}For input string: "${e.text}"`),S.error);if(e.kind===`Number`)return{kind:`Number`,value:Number(e.text)};if(e.kind===`String`&&e.text.includes(`\\`))throw new C(`TLC found an error in the configuration file:\nescape sequences are not supported in strings at line ${e.line}`);if(e.kind===`String`)return{kind:`String`,value:e.text.slice(1,-1)};if(e.text===`TRUE`||e.text===`FALSE`)return{kind:`Boolean`,value:e.text===`TRUE`};if(e.text===`{`){let e=[],t=c();if(t.text!==`}`)for(;e.push(l(t)),t=c(),t.text===`,`;)t=c();if(t.text!==`}`)throw ct(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 ct(e.line,`It was expecting a value, but did not find it.`)},u=e=>{let t=c();if(t.kind===`End`)throw ct(t.line,`Expected an identifier after ${e}[.`);let n=c();if(n.text!==`]`)throw ct(n.line,`It was expecting ], but did not find it.`);return t.text},d=(e,t)=>{let n=e.text,r=c();for(;r.text===`!`;)n=`${n}!${c().text}`,r=c();if(r.text===`<-`){if(r=c(),r.text===`[`){let e=u(`<-`),t=c();if(t.kind===`End`)throw ct(t.line,`Expected an identifier after <-[mod].`);a.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw ct(r.line,`Expected an identifier after <-.`);a.substitutions.push({name:n,target:r.text});return}let i=[],o=r.text===`(`;if(o){for(;i.push(l(c())),r=c(),r.text===`,`;);if(r.text!==`)`)throw ct(t,``);r=c()}if(r.text!==`=`)throw ct(r.line,`It was expecting = or <-, but did not find it.`);r=c();let s=r.text===`[`?u(`=`):void 0,d=l(s===void 0?r:c());a.constants.push({name:n,value:d,...o&&{args:i},...s!==void 0&&{module:s}})},f=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;let o=i-1;d(t,e),a.rawConstants.push(r.slice(o,i).map(e=>e.text).join(` `))}},p=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;e.push(t.text)}},m=c();for(;m.kind!==`End`;){let e=m.text,t=m.line,r=n.has(e)?ut.get(e):void 0,i=n.has(e)?dt.get(e):void 0,l=()=>{let n=c();if(n.kind===`End`)throw ct(t,`The keyword ${e} was not followed by an identifier.`);return n};if(r!==void 0){let n=l();if(a[r]!==void 0)throw lt(t,e);a[r]=n.text,m=c()}else if(i!==void 0)m=p(a[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)m=f(t);else if(e===`CHECK_DEADLOCK`){let n=l();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw ct(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(o)throw lt(t,e);o=!0,a.checkDeadlock=n.text===`TRUE`,m=c()}else{if(!n.has(e)||!it.includes(e))throw ct(t,`It was expecting a keyword, but did not find it.`);if(l(),s.has(e))throw lt(t,e);s.add(e),m=c()}}return a},pt=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],mt=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(pt),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},ht=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},M=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,gt=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},_t=e=>{let t=gt(e);return t^t>>>16},vt=e=>{let t=[...new Set(e)],n=2**Math.max(4,Math.ceil(Math.log2(t.length/.75)));return t.map((e,t)=>({name:e,index:t,bucket:_t(e)&n-1})).sort((e,t)=>e.bucket-t.bucket||e.index-t.index).map(e=>e.name)},yt={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:` `}},bt=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},xt=e=>e!==void 0&&/^\p{Nd}$/u.test(e),St=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),Ct=e=>{let t=t=>{let n=ye(e,t,bt);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l=t(i);for(;l!==void 0&&e[l]!==a;){let n=o(l);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l=t(i)}if(l!==void 0)return c.last=l,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=ye(e,t,xt);if(e.startsWith(`..`,n)&&xt(e[n+2]))return{kind:`Constant`,first:t,last:ye(e,n+2,xt)-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=xt(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:ye(e,t+1,xt)-1,children:[]};if(St(n))return{kind:`Constant`,first:t,last:ye(e,t,St)-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)},N=e=>{let t=e.length===0?void 0:Ct(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=yt[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},wt={general:1e3,stackOverflow:1005,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,unchangedVariableChanged:2143,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,initialStateIncomplete:2106,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,noInitialStates:2118,errorState:2120,behaviorUpToThisPoint:2121,backToState:2122,subscriptUndetermined:2139,subscriptMissingVariable:2140,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,simulating:2188,finished:2186,traceSpecWritten:2501,traceSpecFailed:2502,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,coverageStart:2201,coverageEnd:2202,coverageValue:2221,depthFirstStats:2204,depthFirstLevel:2205,depthFirstProgress:2206,depthFirstInitGenerated:2208,simulationProgress:2209,simulationStats:2210,temporalBranches:2212,statePrint1:2216,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,noInitialStatesInModel:2256,version:2262,depthFirstModelChecking:2271,noSpecificationButProperty:2257,fairnessTautology:2258,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,coverageNext:2772,coverageInit:2773,coverageProperty:2774,coverageValueCost:2775,coverageEndOverhead:2777,coverageConstraint:2778,coverageVariable:2779,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001,moduleOverrideStdout:2e4},Tt={none:0,error:1,warning:3,state:4},Et={0:``,1:`Error: `,3:`Warning: `,4:`State `},Dt=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${Et[n]}${r}`,Ot=e=>{let t=/* @__PURE__ */ new Set;return{isTool:e.isTool,isDiffTrace:e.isDiffTrace??!1,version:e.version??`master`,print:(n,r,i)=>{let a=r===Tt.warning;if(a&&e.errorCodes?.includes(n))throw new o(n,i);if(a&&e.isWarningEnabled===!1||r!==Tt.error&&e.suppressedCodes?.includes(n))return;let s=a&&!e.isTool&&t.size===0?`
|
|
20
|
+
(Use the -nowarning option to disable this warning.)`:``,c=Dt(e.isTool,n,r,`${i}${s}`);a&&t.has(c)||(a&&t.add(c),console.log(c))}}},kt=`The configuration file did not specify the initial state predicate.
|
|
21
21
|
Can also be caused by trying to run TLC on a specification from
|
|
22
|
-
a module imported with a parameterized INSTANCE statement.`,
|
|
22
|
+
a module imported with a parameterized INSTANCE statement.`,At=[[1005,ne,!1],[1e3,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable%1% %2% undefined).`,!1],[1e3,`Could not find operator: %1% in module: %2%`,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
|
|
23
23
|
%1%`,!0],[2143,`The variable %1% was changed while it is specified as UNCHANGED at
|
|
24
24
|
%2%`,!1],[2144,`The EXCEPT was applied to non-existing fields of the value at
|
|
25
25
|
%1%`,!1],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
|
|
@@ -44,7 +44,7 @@ element is not a bag:
|
|
|
44
44
|
%5%`,!0],[2184,`Attempted to apply %1% to the empty sequence.`,!0],[2115,`No next state actions defined to generate successor states from.`,!1],[2146,`The invariant %1% is not a state predicate (one with no primes or temporal operators).%2%`,!1],[2213,`TLC cannot handle the temporal formula %1%`,!1],[2214,`Temporal formulas containing actions must be of forms <>[]A or []<>A.`,!1],[2215,`TLC expected a %1% value, but did not find one. %2%`,!1],[2222,`The constant parameter %1% is not assigned a value by the configuration file.`,!1],[2223,`In the configuration file, the identifier %1% appears
|
|
45
45
|
on the right-hand side of a <- after already appearing on the
|
|
46
46
|
left-hand side of one.`,!1],[2224,`The configuration file substitutes for %1% with the undefined identifier %2%.`,!1],[2225,`The configuration file substitutes for %1% with %2% of different number of arguments.`,!1],[2226,`In the configuration file, the identifier %1% does not appear in the specification.`,!1],[2227,`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`,!1],[2228,`TLC requires %1% not to take any argument.`,!1],[2228,`TLC requires %1% not to take any argument, but one was given: %2%`,!1],[2229,`The %1% %2% specified in the configuration file
|
|
47
|
-
is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,
|
|
47
|
+
is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,kt,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2236,`The operator %1%, which equals %2%,
|
|
48
48
|
cannot be used as a %3%`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
|
|
49
49
|
%1%`,!1],[2240,`The specification contains more than one conjunct of the form [][Next]_v,
|
|
50
50
|
but TLC can handle only specifications with one next-state relation.`,!1],[2241,`The property %1% is not correctly defined.`,!1],[2242,`The arity of the operator %1% is inconsistent in the configuration file.`,!1],[2244,`TLC can't handle real numbers.
|
|
@@ -64,17 +64,17 @@ The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configurat
|
|
|
64
64
|
Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
|
|
65
65
|
It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
|
|
66
66
|
%1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
|
|
67
|
-
`,!1],[2250,`A state predicate was evaluated to a non-boolean value.`,!1],[2252,`Encountered an action predicate that's not a boolean.`,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]];let
|
|
67
|
+
`,!1],[2250,`A state predicate was evaluated to a non-boolean value.`,!1],[2252,`Encountered an action predicate that's not a boolean.`,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]];let jt;const Mt=()=>jt??=At.map(e=>({pattern:RegExp(`^${e[1].split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e[0],isEvalException:e[2]}})),Nt=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+: ))|\nis an element of a set of \d+-tuples\.$|^In computing ENABLED, TLC encountered a temporal formula \(a (~> b|-\+-> formula)\)\./,Pt=e=>Nt.test(e)?void 0:Mt().find(t=>t.pattern.test(e))?.message,Ft=e=>e instanceof t||Pt(e.message)?.isEvalException===!0,It=/* @__PURE__ */ new Map([[1e3,`
|
|
68
68
|
: `],[2105,`failed.
|
|
69
69
|
`],[2154,`but it produced the following error:
|
|
70
70
|
`],[2171,`Parsing or semantic analysis failed.`],[2213,`:
|
|
71
71
|
`],[2281,` - specifically: `],[2405,`failed.
|
|
72
|
-
`]]),
|
|
73
|
-
`)),Gt=`${l}tlc2.tool.EvalException: `,Kt=`${l}util.Assert$TLCRuntimeException: `,qt=e=>Nt(e)?Gt:Kt,Jt=e=>{try{return e()}catch(e){throw e instanceof w?Nt(e)?new w(`${a}${e.message}`):Mt(e.message)?e:new w(`${l}${e.message}`):e}},Yt=[Gt,Kt,l,a],Xt=(e,t)=>{let r=Bt.get(e);if(r)return`${r.headline}\n${Xt(r.inner,t)}`;let i=e.message;if(e instanceof n)return i;let a=Yt.find(e=>i.startsWith(e))??``;return`${a}${It(i.slice(a.length),t)}`},Zt=(e,t)=>{let r=Bt.get(e),a=e.message;if(r)return{code:r.code,message:a,toolMessage:Xt(e,!0)};if(e instanceof i)return{code:t?St.stackOverflow:St.general,message:a,toolMessage:a};if(t&&Nt(e))return{code:Mt(a)?.code??St.general,message:a,toolMessage:a};let o=t&&!a.startsWith(Wt)&&!(e instanceof n),s=e instanceof u?Ut:l,c=o?s:``;return{code:St.general,message:`${c}${a}`,toolMessage:`${c}${Xt(e,!0)}`}},Qt=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,$t=2147483647,en=1e6;let tn=en;const nn=()=>tn,rn=()=>Math.max(tn,10),an=()=>`Attempted to construct a set with too many elements (>${tn}).`,on=(e,t)=>{if(e.length===rn())throw new u(an());e.push(t)},sn=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=rn(),cn=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},ln=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,un=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),dn=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),fn=e=>typeof e==`object`&&e.kind===`ModelValue`,pn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),mn=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:ln(e)?`set`:`function`,hn=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let gn=!1;const _n=(e,t)=>(gn=!0,e.writtenKeys=t,e),vn=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,yn=e=>vn(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),bn=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):yn(e),xn=(e,t,n,r)=>_n(fi(e,t.map(e=>n[e])),r),Sn=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(Sn);e.writtenKeys=void 0,e.range.forEach(Sn)}},Cn=e=>e.every(e=>typeof e==`string`),wn=(e,t)=>e.length>0&&t.length>0&&Cn(e)!==Cn(t),Tn=(e,t)=>{gn&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return wn(n,r)?Fr(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Zn(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:Zn(t,n);if(r!==0)return r}return 0},En=(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=Zn(n[e],r[e]);if(t!==0)return t}return 0},Dn=e=>fn(e)?e.type:void 0,On=(e,t,n)=>{let r=Dn(e),i=Dn(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(fn(e)&&fn(t)){if(r===void 0||i===void 0||r===i)return;throw new w(`Attempted to ${a} the differently-typed model values ${L(e)} and ${L(t)}`)}throw r===void 0?new w(`Attempted to ${a} the typed model value ${L(t)} and the non-model value\n${L(e)}`):new w(`Attempted to ${a}${n?``:` the`} typed model value ${L(e)} and non-model value\n${L(t)}`)},kn=()=>({ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0}),An=kn(),jn=e=>{Object.assign(An,kn()),Qn.clear();for(let t of e)Vn(t)},Mn=()=>{An.searchRank=An.size},Nn=()=>An.unorderedString;let Pn=!1;const Fn={isExpanded:!0,isViewPrinted:!1},In=e=>{Pn=e.version===`1.7.4`,tn=e.maxSetSize??en,Fn.isExpanded=e.isLazyValueExpanded??!0,Fn.isViewPrinted=e.isViewPrinted??!1},Ln=/* @__PURE__ */ new WeakMap,Rn=(e,t)=>(Fn.isViewPrinted&&Ln.set(e,t),e),zn=/* @__PURE__ */ new WeakMap,Bn=(e,t)=>(zn.set(e,t),e),Vn=e=>(An.ranks[e]===void 0&&(An.ranks[e]=An.size++),e),Hn=e=>An.ranks[Vn(e)],Un=(e,t)=>{if(e===t)return 0;let n=An.ranks,r=n[e],i=n[t],a=An.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(An.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},Wn=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Gn=(e,t)=>(Wn(e)||Wn(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Kn=(e,t)=>new w(Wn(e)?`Attempted to compare overridden value ${L(e,!0)} with non-overridden value:\n${L(t)}`:`Attempted to compare ${mn(e)} ${L(e)} with ${mn(t)} ${L(t)}`),qn=(e,n,r)=>{if(!Wn(e))throw new w(`Attempted to ${r} the set ${L(P(e)?F(e):e,!0)} with the value:\n${L(n,!0)}`);if(!Wn(n))throw Kn(e,n);let i=e.kind===`InfiniteSet`?e.name:void 0,a=n.kind===`InfiniteSet`?n.name:void 0;if(i!==void 0&&i===a)return 0;if(i===`Nat`&&a===`Int`||i===`Int`&&a===`Nat`)return i===`Nat`?-1:1;throw new t(`Attempted to compare ${L(e,!0)} with the value\n${L(n,!0)}`)},Jn={kind:`InfiniteSet`,name:`Any`},Yn=e=>{throw new t(`Attempted to compare ANY with the value\n${L(e)}`)},Xn=e=>{gn&&Sn(e),e===Jn&&Yn(e),typeof e==`object`&&e.kind===`LazyFunction`&&I(e)},Zn=(e,t)=>{if(e===t)return Xn(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Tn(e,t);if(n===`Set`&&r===`Set`)return En(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&&On(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return On(e,t,!1),n===`ModelValue`?-1:1;if(e===Jn||t===Jn)return Yn(e===Jn?t:e);if(ln(e)&&ln(t)&&Gn(e,t))return qn(e,t,`compare`);let i=ln(e);if(i!==ln(t))throw Kn(e,t);if(n===`Interval`&&r===`Set`){let n=Ii(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-Ii(t);if(n!==0)return n}return i?En(F(e),F(t)):Tn(I(e),I(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Un(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(On(e,t,!1),fn(e))return-1;if(fn(t))return 1;throw Kn(e,t)},Qn=/* @__PURE__ */ new Map,$n=32768,er=e=>{let t=Qn.get(e);if(t)return t;if(Qn.size===$n)throw new f(`TLC supports at most ${$n} model values, but model value ${e} exceeds this limit.`);let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Hn(e),hash:pa(ma(ha(e),109)),fingerprint:wa(Ta(e)^60)};return Qn.set(e,n),n},tr=()=>[...Qn.values()],nr=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),rr=e=>{let t=nr(e);return t.isNormalized=!0,t},ir=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let ar=!1;const or=(e,t)=>(t===`lambda`&&(ar=!0),t!==void 0&&(e.functionClass=t),e),sr=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,cr=e=>or(e,`lambda`),lr=e=>Qt(e)&&e.isCached===!0;let ur=!1;const dr=e=>(ur=!0,e),fr=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),pr=e=>{ur&&typeof e==`object`&&Qt(e)&&fr.has(e.kind)&&(e.isCached=!0)},mr=e=>{(ar||ur)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(mr),e.range.forEach(mr)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(mr):ln(e)&&P(e)&&(pr(e),F(e).elements.forEach(mr))))},hr=(e,t)=>{if(pr(e),e===t)return Xn(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&On(e,t,!0),Zn(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return Tn(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return En(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&Ii(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==Ii(t))return!1;if(fn(e)||fn(t))return e.kind===`LazyFunction`&&I(e),On(e,t,!0),fn(e)&&fn(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return hr(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=Ni(e.domain),r=Ni(t.domain);if(n||r)return n===r;let i=Ni(e.range),a=Ni(t.range);return i||a?i===a:hr(e.domain,t.domain)&&hr(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(Ni(e))return Ni(t);if(Ni(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]&&hr(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return Ni(e)?Ni(t):!Ni(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>hr(e,t.factors[n]));let n=ln(e)&&ln(t)&&!(P(e)&&P(t));if(n&&Gn(e,t))return qn(e,t,`check equality of`)===0;if(n){if(!Wn(e)){let n=F(e);if(!Wn(t))return En(n,F(t))===0}return Aa(e)===Aa(t)}return Zn(e,t)===0},gr=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):Aa(n)===Aa(r);return n},_r=gr(!1),vr=gr(!0),yr=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},br=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Ca(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||vr(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||vr(i[e],n))return i[e]}return n.kind===`Set`?yr(n.elements,t):(yr(n.domain,t),yr(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}},xr=(e,t)=>t.length===0||sr(e)===`tuple`?1:ua(t)?.low,Sr=e=>{if(!dn(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:xr(e,t.domain)}},Cr=e=>{if(!dn(e))return;let t=I(e);return Cn(t.domain)?t:void 0},wr=(e,t,n)=>(On(t,e,n),1),Tr={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},Er=(e,t,n)=>{let r=Tr[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${L(e)} with ${r.other}:\n${L(t)}`},Dr=e=>e?`check equality of`:`compare`,Or=(e,t,n,r)=>{let i=Sr(n);if(!i){if(fn(n))return wr(n,t,r);throw new w(`Attempted to ${Dr(r)} the function ${L(t)} with the value:\n${L(n)}`)}if(e.range.length!==i.range.length)return e.range.length-i.range.length;let a=()=>kr(e.range,i.range,r);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&i.low!==void 0)return e.low===i.low?a():e.low-i.low;let o=e.low??i.low;if(o===void 0)return kr(e.domain,i.domain,r)||a();let s=e.low===void 0?e.domain:i.domain;for(let t=0;t<s.length;t++){let n=s[t];if(typeof n!=`number`)throw new w(`Attempted to compare ${r?`an `:``}integer with non-integer${r||e.low!==void 0?`:`:``}\n${L(n)}.`);let i=e.low===void 0?n-(o+t):o+t-n;if(i!==0)return i}return a()},kr=(e,t,n)=>{for(let r=0;r<e.length;r++){let i=Pr(e[r],t[r],n);if(i!==0)return i}return 0},Ar=(e,t,n)=>{let r=I(e);if(sr(e)===`tuple`){let i=dn(t)?Vi(t):void 0;return i?r.range.length-i.length||kr(r.range,i,n):Or({...r,low:1},e,t,n)}if(sr(e)===`record`){let i=Cr(t);if(!i){if(fn(t))return wr(t,e,n);throw new w(`Attempted to ${Dr(n)} record:\n${L(e)}\nwith non-record\n${L(t)}`)}return r.domain.length-i.domain.length||kr(r.domain,i.domain,n)||kr(r.range,i.range,n)}return Or({...r,low:xr(e,r.domain)},e,t,n)},jr=(e,t)=>Wn(e)||Wn(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),Mr=(e,t)=>{let n=pn(t)?t:F(t);return{elements:F(e).elements,otherElements:F(n).elements}},Nr=(e,t,n)=>{if(jr(e,t))return n?+!hr(e,t):Zn(e,t);if(!pn(e))return Nr(F(e),t,n);if(!ln(t)){if(fn(t))return wr(t,e,n);throw new w(`Attempted to ${Dr(n)} the set ${L(e)} with the value:\n${L(t)}`)}let r=Mr(e,t);return r.elements.length-r.otherElements.length||kr(r.elements,r.otherElements,n)},Pr=(e,t,n)=>{if(typeof e!=`object`){if(typeof t==typeof e)return n?e===t?0:1:Zn(e,t);if(fn(t))return wr(t,e,n);throw new w(Er(e,t,n))}return e.kind===`ModelValue`?(e.type!==void 0&&On(e,t,n),fn(t)?n?e.name===t.name?0:1:e.rank-t.rank:-1):dn(e)?Ar(e,t,n):Nr(e,t,n)},Fr=(e,t)=>Pr(e,t,!1),Ir=(e,t)=>Pr(e,t,!0)===0,Lr=e=>{let t=[];for(let n of e){let e=zr(n,t);e.isFound||t.splice(e.index,0,n)}return t},Rr=(e,t)=>{let n=Ui.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},zr=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=Rr(e,()=>Fr(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},Br=(e,t)=>t.some(t=>Rr(t,()=>Ir(t,e))),Vr=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,Hr=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(Hr)),e.kind===`Function`&&(e.domain.forEach(Hr),e.range.forEach(Hr)))},Ur=e=>{if(!(typeof e!=`object`||lr(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:F(e);return;case`FilteredSet`:case`Subset`:return Ur(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(Ur(e.left),Ur(e.right));case`FunctionSet`:return Ur(e.domain),Ur(e.range);case`RecordSet`:return e.sets.forEach(Ur);case`ProductSet`:return e.factors.forEach(Ur)}},Wr=(e,t)=>Wi(hr,Ir,e,t),Gr=e=>{for(let t=1;t<e.length;t++)if(Zn(e[t-1],e[t])>=0)return!1;return!0},Kr=e=>{for(let t=0;t<e.length;t++){let n=e[t],r=t>0?e[t-1]:void 0;if(typeof n!=`number`||typeof r==`number`&&r>=n)return!1}return!0},qr=e=>{for(let t=1;t<e.length;t++)pr(e[t]);if(e.length<2||Gr(e))return nr(e);let t=[...e].sort(Zn),n=[t[0]];for(let e=1;e<t.length;e++)Zn(n[n.length-1],t[e])!==0&&n.push(t[e]);return nr(n)},Jr=e=>{if(Kr(e))return nr(e);let t=Wi(qr,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},Yr=nr([]),Xr=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&Zn(r[a],t)<0;)a++;a<r.length&&Zn(r[a],t)===0||i.push(t)}return i.length===n.length?e:nr(i)},Zr=(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&&Zn(r[a],t)<0;)a++;a<r.length&&Zn(r[a],t)===0&&i.push(t)}return i.length===n.length?e:nr(i)},Qr=(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=Zn(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=nr(i);if(e.hash!==0&&e.hash!==va){let t=e.hash,n=0;for(;n<a.length;n++){let e=Ca(a[n]);if(e===va)break;t=t+ga(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Ea(a[e])|0;c.fingerprint=t}return c},$r=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Zn(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Zn(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return ir(n,r)},ei=e=>{let t=$r(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:_n(t,e.map(e=>e[0]))},ti=[],ni=/* @__PURE__ */ new Map,ri=[],ii=/* @__PURE__ */ new WeakMap,ai=e=>{let t=ti[e]??ni.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?ni.set(e,new WeakRef(n)):ti[e]=n,n},oi=e=>{if(Ii(e),e.low===1&&e.high>=1)return ai(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},si=e=>e.length>0&&(e===ti[e.length]||e===ni.get(e.length)?.deref())||ii.has(e),ci=e=>{let t=F(e).elements;return si(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},li=e=>{let t=ri[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return ri[e]=n,n},ui=e=>or(ir(ai(e.length),e),`tuple`),di=e=>or($r(e),`record`),fi=(e,t)=>or(ir(e,t),`record`),pi=e=>ln(e)&&!Wn(e),mi=(e,t=!1)=>`UNION(${L(e.base,t)})`,hi=(e,t=e=>F(e).elements)=>{if(!pi(e.base))throw new w(`Attempted to enumerate the nonenumerable set:\n${mi(e)}`);return t(e.base)},gi=(e,t,n)=>{if(pi(e))return e;throw new w(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${L(e)}\nwhen enumerating:\n${mi(n)}`)},P=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 P(e.base);case`FunctionSet`:return P(e.domain)&&P(e.range)||_i(e.domain)===!0||_i(e)===!0;case`RecordSet`:return e.sets.every(P)||_i(e)===!0;case`ProductSet`:return e.factors.every(P)||_i(e)===!0;case`Union`:return P(e.base)&&(pn(e.base)?Vr(e.base):Oi(e.base)).every(P);case`SetOperation`:return e.operator===`\\cup`?P(e.left)&&P(e.right):e.operator===`\\cap`?P(e.left)||P(e.right):P(e.left);default:return!1}},_i=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=_i(e.domain);return t===void 0?void 0:!t&&_i(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=_i(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return P(e)?F(e).elements.length===0:void 0;default:return}},vi=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},yi=(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},bi=e=>{if(typeof e!=`object`||e.kind!==`Subset`||Wn(e.base))return;let t=F(e.base).elements;if(t.length<=20)return;let n=-1,r=[0],i=e=>{for(e<=n&&(n=-1);n<e;)n===-1?r=[]:yi(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return nr(r.map(e=>t[e]))},a=2**t.length,o=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<a;return new Proxy([],{get:(e,t,n)=>t===`length`?a:o(t)?i(Number(t)):Reflect.get(e,t,n),has:(e,t)=>o(t)||Reflect.has(e,t)})},xi=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(nr(r.map(t=>e[t])));while(yi(r,e.length))}return t},Si=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(Wn(a))throw new w(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},Ci=(e,t=e=>F(e).elements)=>{if(typeof e!=`object`)throw new w(`Expected a set but found ${L(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return Lr(e.elements);case`Interval`:{let t=oi(e);return t!==ti[t.length]&&ii.set(t,e),t}case`Subset`:{if(Ii(e.base)===0)return xi([]);if(!ln(e.base))throw new w(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${N(L(e.base))}`);let t=F(e.base).elements;if(t.length>30)throw new w(Fi(e));return xi(t)}case`FunctionSet`:{if(!Pn&&Ni(e))return[];if(Wn(e.domain))throw new w(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${L(e.domain)}\ncannot be enumerated.`);let n=ci(e.domain);if((n.length>0||Pn)&&Wn(e.range))throw new w(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${L(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return vi(n.map(()=>r)).map(e=>ir(n,e))}case`RecordSet`:{if(!Pn&&Ni(e))return[];let n=Si(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${L(t)}`);return vi(n).map(t=>di(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!Pn&&Ni(e))return[];let n=Si(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${L(e)}`);return vi(n).map(ui)}case`FilteredSet`:if(!ln(e.base)||Wn(e.base))throw new w(`Attempted to enumerate { x \\in S : p(x) } when S:\n${L(e.base)}\nis not enumerable`);return F(Jr(Oi(e.base).filter(t=>e.test(t,!1)))).elements;case`Union`:{let t=[];return hi(e).forEach((n,r)=>{let i=gi(n,r,e);if(sn(i))throw new u(an());Oi(i).forEach(e=>on(t,e))}),F(Jr(t)).elements}case`SetOperation`:{if(e.operator===`\\cap`&&!pi(e.left)&&!pi(e.right))throw new w(`Attempted to enumerate S \\cap T when neither S:\n${L(e.left)}\nnor T:\n${L(e.right)}\nis enumerable`);if(e.operator===`\\`&&!pi(e.left))throw new w(`Attempted to enumerate S \\ T when S:\n${L(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return F(Jr(Ti(e))).elements;let t=e.operator===`\\`||pi(e.left),n=t?e.left:e.right,r=t?e.right:e.left,i=[];return cn(typeof n==`object`&&n.kind===`Interval`?n:Oi(n),t=>{Ki(t,r)===(e.operator===`\\cap`)&&on(i,t)}),F(Jr(i)).elements}case`InfiniteSet`:case`SequenceSet`:throw new w(`Attempted to enumerate the non-enumerable set ${L(e)}`);default:throw new w(`Expected a set but found ${L(e)}`)}},F=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return nr(Ci(e));let t=typeof e==`object`&&Qt(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=Ui.sets;n?.push(e);let r=Ci(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?nr(r):qr(r);return t&&(t.enumerated=i),i},wi=e=>{if(!(typeof e!=`object`||lr(e)))switch(e.kind){case`MixedSet`:F(e);return;case`FilteredSet`:return pi(e.base)||F(e),wi(e.base);case`Union`:if(!pn(e.base)&&pi(e.base))return wi(e.base);hi(e).slice(0,1).forEach(t=>wi(gi(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!pi(e.left)&&F(e),e.operator!==`\\cup`||pi(e.left)&&pi(e.right)||F(e),e.operator!==`\\cap`||pi(e.left)?wi(e.left):wi(e.right),e.operator===`\\cup`&&wi(e.right)}},Ti=e=>{if(!pi(e.left)||!pi(e.right))throw new w(`Attempted to enumerate S \\cup T when S:\n${L(e.left)}\nand T:\n${L(e.right)}\nare not both enumerable`);if(wi(e.left),wi(e.right),sn(e.left))throw new u(an());let t=Oi(e.left),n=sn(e.right)?void 0:Oi(e.right);if(!n||t.length+n.length>rn())throw new u(an());return[...t,...n]},Ei=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return F(e).elements;let t=Rr(e,()=>Ti(e)),n=F(Jr(t)).elements;return e.enumerated=nr(n),n},Di=(e,t)=>{if(typeof e!=`object`||lr(e))return F(e).elements.some(t);let n=Ui.sets;n?.push(e),wi(e);let r=Mi(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},Oi=e=>{let t=[];return Di(e,e=>(t.push(e),!1)),t},ki=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,Ai=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(Ai);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(Ai)&&e.range.every(Ai);case`SetOperation`:return e.operator!==`\\cup`&&Ai(e.left)&&Ai(e.right);case`FilteredSet`:return Ai(e.base);case`ProductSet`:return e.factors.every(Ai);default:return!1}},ji=e=>typeof e!=`object`||lr(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?ji(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||ji(e.left)||ji(e.right):ki(e)?.some(ji)??!1,Mi=(e,t)=>{if(e.kind===`Union`)return hi(e,Oi).some((n,r)=>Di(gi(n,r,e),t));if(e.kind===`FilteredSet`&&pi(e.base))return Di(e.base,n=>e.test(n,!1)&&t(n));if(ki(e)?.some(ji))return Ci(e,Oi).some(t);if(e.kind!==`SetOperation`)return F(e).elements.some(t);if(e.operator===`\\cup`)return!pi(e.left)||!pi(e.right)?F(e).elements.some(t):Di(e.left,t)||Di(e.right,t);let n=e.operator===`\\`||pi(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return pi(r)?Di(r,n=>Ki(n,i)===(e.operator===`\\cap`)&&t(n)):F(e).elements.some(t)},Ni=e=>{if(typeof e!=`object`||!ln(e))throw new w(`Shouldn't call isEmpty() on value ${L(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new w(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(Ni);case`RecordSet`:return e.sets.some(Ni);case`FunctionSet`:return!Ni(e.domain)&&Ni(e.range);case`Union`:return hi(e).every((t,n)=>Ni(gi(t,n,e)));default:return F(e).elements.length===0}},Pi=(e,t,n)=>e.reduce((e,r)=>{let i=e*Ii(r,t);if(i>2147483647)throw new w(n());return i},1),Fi=e=>`Overflow when computing the number of elements in:\n${L(e)}`,Ii=(e,t)=>{if(typeof e!=`object`)throw new w(`Attempted to compute the number of elements in the ${mn(e)} ${L(e)}.`);switch(e.kind){case`ModelValue`:throw new w(`Attempted to compute the number of elements in the model value ${L(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return Ii(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new w(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new w(`Attempted to compute the number of elements in the overridden value ${L(e)}.`);case`Subset`:{let n=Ii(e.base,t);if(n>=31)throw new w(Fi(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(Ni(e.domain))return 1;if(Ni(e.range))return 0;if(Ii(e.range,t)===1)return 1}let n=Ii(e.domain,t),r=Ii(e.range,t);if(r<=1)return n===0?1:r;let i=1;for(let t=0;t<n;t++)if(i*=r,i>2147483647)throw new w(Fi(e));return i}case`RecordSet`:return t!==`1.7.4`&&Ni(e)?0:Pi(e.sets,t,()=>Fi(e));case`ProductSet`:return t!==`1.7.4`&&Ni(e)?0:Pi(e.factors,t,()=>`Overflow when computing the number of elements in ${L(e)}`);default:return pr(e),F(e).elements.length}},Li=e=>`Attempted to check if the set ${L(e)}is finite.`,Ri=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new w(`Attempted to check if the ${mn(e)} ${L(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new w(`Attempted to check if the function:\n${L(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Ri(e.base)&&Ni(e.base);case`Subset`:return Ri(e.base);case`FunctionSet`:{let t=Ri(e.domain);if(t&&Ni(e.domain))return!0;let n=Ri(e.range);return n&&Ni(e.range)?!0:n&&(t||Ii(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n=!0;for(let e of t)if(!Ri(e))n=!1;else if(Ni(e))return!0;return n}case`Union`:if(!pi(e.base))throw new w(`Attempted to check if the nonenumerable set:\n${mi(e)}\nis a finite set.`);return F(e.base).elements.every(Ri);case`SetOperation`:if(e.operator===`\\cup`)return Ri(e.left)&&Ri(e.right);if(e.operator===`\\cap`){if(!Ri(e.left)&&!Ri(e.right))throw new w(Li(e));return!0}if(Ri(e.left))return!0;if(!Ri(e.right))throw new w(Li(e));return!1;case`FilteredSet`:if(!Ri(e.base))throw new w(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${L(e.base)}\nis finite.`);return!0}},zi=(e,t,n=Zn)=>{let r=0,i=e.length-1;for(;r<=i;){let a=r+i>>1,o=n(e[a],t);if(o===0)return a;o<0?r=a+1:i=a-1}return-1},Bi=(e,t)=>{let n=e.elements;if(n.length>rn())throw new u(an());let r=Array.from({length:n.length},()=>!1),i=t.filter(e=>{let t=zi(n,e);return!r[t]&&(r[t]=!0,!0)}),a=nr(n);return i.some((e,t)=>e!==n[t])&&(a.writtenElements=i),a},Vi=e=>{if(typeof e!=`object`||!dn(e))return;if(e.kind===`LazyFunction`&&(!ln(e.domain)||Wn(e.domain)))throw new w(`To convert a function of form [x \\in S |-> f(x)] to a tuple, the set S must be enumerable.`);let t=I(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Hi=(e,t)=>{let n=`Attempted to check if the value:\n${L(e)}\nis an element of the`;if(!dn(t))return`${n} ${mn(t)} ${L(t)}`;let r=sr(t);return r===`record`?`Attempted to check if element:\n${L(e)}\nis in the record:\n${L(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${L(t)}`},Ui={sets:void 0},Wi=(e,t,n,r)=>{let i=Ui.sets,a=Ui.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof w))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},Gi=e=>(Ui.sets??[]).slice(e).some(e=>typeof e==`object`&&Ui.callStack?.sources.has(e)===!0),Ki=(e,t)=>{let n=Ui.sets;if(n===void 0)return Zi(e,t);n.push(t);let r=Zi(e,t);return n.pop(),r},qi=(e,t)=>{let n=t.elements,r=0,i=n.length-1;for(;r<=i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;if(a===e)return!0;a<e?r=t+1:i=t-1}return!1},Ji=(e,t)=>zi(t.elements,e)!==-1,Yi=(e,t)=>t.isNormalized?zr(e,t.elements).isFound:Br(e,Vr(t)),Xi=(e,t)=>{if(e.type!==void 0)throw new w(`Attempted to check if the typed model value ${N(L(e))} is an element of\n${N(L(t))}`);return!1},Zi=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return qi(e,t)??Qi(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return Qi(e,t)},Qi=(e,n)=>{if(!ln(n))throw new w(Hi(e,n));switch(n.kind){case`Set`:return pr(e),Wi(Ji,Yi,e,n);case`MixedSet`:return Br(e,n.elements);case`Interval`:if(typeof e==`number`)return e>=n.low&&e<=n.high;if(n.low<=n.high&&(!fn(e)||e.type!==void 0))throw new w(`Attempted to check if the value:\n${L(e)}\nis in the integer interval ${L(n)}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(fn(e))return Xi(e,n);if(!(n.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new t(`Attempted to check if the value:\n${L(e)}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!ln(e)||Wn(e))throw new w(`Attempted to check if the non-enumerable value\n${N(L(e))}\nis element of\n${N(L(n))}`);return F(e).elements.every(e=>Ki(e,n.base));case`FunctionSet`:{if(!dn(e)){if(fn(e))return Xi(e,n);throw new w(`Attempted to check if \n${L(e)}\nwhich is not a TLC function value, is in the set of functions:\n${N(L(n))}`)}let t=I(e),r=xr(e,t.domain);return(r===void 0?Wr(n.domain,nr(t.domain)):Wr({kind:`Interval`,low:r,high:r+t.domain.length-1},n.domain))&&t.range.every(e=>Ki(e,n.range))}case`RecordSet`:{let t=dn(e)?I(e):void 0;if(!t||!Cn(t.domain)){if(fn(e))return Xi(e,n);throw new w(`Attempted to check if non-record\n${L(e)}\nis in the set of records:\n${L(n)}`)}return t.domain.length===n.names.length&&n.names.every((e,r)=>{let i=zi(t.domain,e);return i!==-1&&Ki(t.range[i],n.sets[r])})}case`ProductSet`:{let t=dn(e)?Vi(e):void 0;if(t===void 0){let t=dn(e)&&I(e).domain.every(e=>typeof e==`number`);if(fn(e))return Xi(e,n);if(t)return!1;throw new w(`Attempted to check if non-tuple\n${L(e)}\nis in the set of tuples:\n${L(n)}`)}return t.length===n.factors.length&&t.every((e,t)=>Ki(e,n.factors[t]))}case`FilteredSet`:try{return Ki(e,n.base)&&n.test(e,!0)}catch(t){throw!(t instanceof w)||!Nt(t)?t:new w(`Cannot decide if element:\n${N(L(e))}\n is element of:\n${N(L(n.base))}\nand satisfies the predicate ${n.source?.predicate}`)}case`Union`:{if(!pi(n.base))throw new w(`Attempted to check if:\n ${L(e)}\nis an element of the non-enumerable set:\n ${mi(n)}`);let t=F(n.base).elements;return t.length>1&&t.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),t.some(t=>Ki(e,t))}case`SetOperation`:return n.operator===`\\cup`?Ki(e,n.left)||Ki(e,n.right):Ki(e,n.left)&&Ki(e,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=Vi(e);if(r===void 0){if(fn(e))return Xi(e,n);throw new t(`Attempted to check if the value:\n${N(L(e))}\nis an element of ${N(L(n))}.`)}return r.every(e=>Ki(e,n.base))}default:throw new w(Hi(e,n))}},$i=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?Ki(e,n):e.range.every((e,r)=>$i(e,t.range[r],n.range)),I=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return e.enumerated;if(P(e.domain)||Ii(e.domain),!ln(e.domain))throw new w(`The domains of formal parameters must be enumerable.`);let t=ci(e.domain);return e.enumerated=ir(t,t.map(t=>e.apply(t))),e.enumerated}throw new w(`Expected a function but found ${L(e)}`)},ea=(e,t,n)=>{let r=N(L(e)),i=N(L(t)),a=n===`1.7.4`;switch(sr(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},ta=(e,t)=>{if(!Pn)return ea(e,t);let n=N(L(t));return sr(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},na=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},ra=e=>new w(`Attempted to apply function with integer domain to the non-integer argument ${N(L(e))}`),ia=(e,t)=>zi(e.domain,t),aa=(e,t,n)=>{let r=vn(e);throw Pn||r!==e.domain||r.length<32?r.forEach(e=>Ir(e,t)):zi(r,t,Fr),n},oa=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=sr(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new w(n(e,t));if(a===void 0&&!Pn&&typeof t!=`number`&&si(r))throw ra(t)}let i=na(r,t);return i===-1?Wi(ia,aa,e,t):i},sa=(e,t,n)=>{let r=e.domain,i=Vi(n),a=(t,n,r)=>`In applying the function\n${N(L(e))},\nthe ${t} is:\n${N(L(n))}\nwhich ${r}.\n`,o=()=>new w(a(`argument list`,n,`does not match its formal parameter`));if(i===void 0)throw o();if(typeof r!=`object`||r.kind!==`ProductSet`)throw new w(`Attempted to apply a function to ${L(n)}, which is not in its domain`);if(t.forEach((e,t)=>{if(t>=i.length)throw o();let n=i[t],s=`argument number ${t+1}`;if(!Ki(n,r.factors[t]))throw new w(a(s,n,e===void 0?`is not in the function's domain ${L(r)}`:`is not in its domain`));if(e!==void 0&&Vi(n)?.length!==e)throw new w(a(s,n,`does not match its formal parameter`))}),i.length>t.length)throw o()},ca=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!Ki(t,e.lambdaDomain),la=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return la(e.enumerated,t,n);let r=e.boundTupleLengths;if(r!==void 0)return sa(e,r,t),e.apply(t);if(!Ki(t,e.domain))throw new w(sr(e)===`lambda`?ea(e,t):`Attempted to apply a function to ${L(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new w(`Attempted to apply ${L(e)}, which is not a function`);let r=n??ea;if(ca(e,t))throw new w(r(e,t));let i=oa(e,t,r);if(i===-1)throw new w(r(e,t));return e.range[i]},ua=e=>si(e)?ii.get(e)??li(e.length):void 0,da=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=I(e);if(t.functionClass===`lambda`&&t.lambdaDomain)return t.lambdaDomain;let n=ua(t.domain);if(n)return n;let r=nr(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},fa=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||e.enumerated===void 0)){if(!Ki(t,e.domain))return e;let r=n(e.apply(t));return or({kind:`LazyFunction`,domain:e.domain,apply:n=>Wr(t,n)?r:e.apply(n),source:e.source,boundTupleLengths:e.boundTupleLengths},sr(e))}if(!dn(e))throw new w(`Attempted to apply EXCEPT construct to the value ${N(L(e))}.`);let i=I(e);if(ca(i,t))return i;let a=oa(i,t,ta);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=or(ir(i.domain,o),sr(i));if(l.writtenKeys=i.writtenKeys,l.lambdaDomain=i.lambdaDomain,i.hash!==0&&i.hash!==va){let e=Ca(c);if(e!==va){let t=Ca(i.domain[a]);l.hash=s===c?i.hash:i.hash-_a(t,Ca(s))+_a(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Da(e,s)+Da(e,c)|0}return l},pa=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},ma=(e,t)=>Math.imul(e^t,16777619),ha=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return pa(t)},ga=e=>pa(e+2654435769|0),_a=(e,t)=>pa(Math.imul(e,668265261)+t|0),va=795548749,ya=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Ca(t[e]);if(r===va)return va;n=n+ga(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Ca(e.domain[n]),i=Ca(e.range[n]);if(r===va||i===va)return va;t=t+_a(r,i)|0}return t},ba=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new w(`TLC has found a state in which the value of a variable contains ${L(e)}`);if(ln(e)){F(e).elements.forEach(ba);return}let t=I(e);t.domain.forEach(ba),t.range.forEach(ba)},xa=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Ca(e)===va&&ba(e);return}catch(e){if(!(e instanceof w))throw e;return e}},Sa=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},Ca=e=>typeof e==`number`?pa(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?ha(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=ya(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?P(e.domain)?Ca(I(e)):va:P(e)?Ca(F(e)):va,wa=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Ta=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return wa(t)},Ea=e=>wa(ka(e)+2135587861|0),Da=(e,t)=>wa(Math.imul(ka(e),374761393)+ka(t)|0),Oa=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Ea(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Da(e.domain[n],e.range[n])|0;return t},ka=e=>typeof e==`number`?wa(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?Ta(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Oa(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?ka(I(e)):P(e)?ka(F(e)):Ta(Aa(e)),Aa=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):ja(e),ja=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${Aa(e.base)}>`;if(e.kind===`FilteredSet`&&!P(e))throw new w(`Attempted to compare the non-enumerable set ${L(e)} with another value`);if(ln(e))return P(e)?`{${F(e).elements.map(Aa).join(`,`)}}`:`<${e.kind} ${L(e)}>`;let t=I(e);return`(${t.domain.map((e,n)=>`${Aa(e)}:${Aa(t.range[n])}`).join(`,`)})`},Ma={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},Na=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>Ma[e])}"`,Pa=1999,Fa=e=>e.reduce((e,t)=>e===0?0:e*Ii(t),1),Ia=e=>{if(e.kind===`Subset`)return Ii(e.base)<=6?F(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return F(e);if(e.kind===`FunctionSet`){let t=Ni(e.domain)?0:Ii(e.domain);return(t===0?1:Ii(e.range)**t)<=Pa?F(e):void 0}return Fa(e.kind===`RecordSet`?e.sets:e.factors)<=Pa?F(e):void 0},La=(e,t)=>{if(t||e.kind===`Union`||e.kind===`Subset`&&dn(e.base)&&(e.base.kind===`Function`||P(e.base.domain)))return Ia(e);if(P(e))try{return Ia(e)}catch(e){if(e instanceof w)return;throw e}},Ra=(e,t)=>{let n=e=>L(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return mi(e,t)}},za=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Ba=e=>{if(P(e.domain))try{return I(e)}catch(e){if(e instanceof w||b(e))return;throw e}},Va=e=>{let t=[],n=[],r=(e,i)=>{if(typeof e!=`object`)return;let a=e=>r(e,i);switch(e.kind){case`Set`:if(e.elements.forEach(a),e.isNormalized)return;e.isNormalized=!0,t.push(e);return;case`MixedSet`:e.elements.forEach(a),F(e);return;case`Function`:{let t=i||sr(e)===`lambda`;if(e.range.forEach(e=>r(e,t)),i||e.writtenKeys===void 0)return;n.push([e,e.writtenKeys]),e.writtenKeys=void 0;return}case`LazyFunction`:e.enumerated?r(e.enumerated,!0):a(e.domain);return;case`SetOperation`:a(e.left),a(e.right);return;case`FunctionSet`:a(e.domain),a(e.range);return;case`RecordSet`:e.sets.forEach(a);return;case`ProductSet`:e.factors.forEach(a);return;case`Subset`:case`Union`:case`FilteredSet`:case`SequenceSet`:a(e.base);return;default:return}};try{return e.forEach(e=>r(e,!1)),e.map(e=>L(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1}),n.forEach(e=>{e[0].writtenKeys=e[1]})}},L=(e,t=!1,n=!1)=>{let r=e=>L(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Na(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(F(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=Fn.isExpanded?La(e,t):void 0;return n?r(n):Ra(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?Fn.isExpanded||!e.source?Ba(e):void 0:e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${L(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Pn&&sr(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&sr(e)!==`lambda`);if(i.domain.length===0&&sr(e)===`record`)return`[]`;if(i.domain.every((e,t)=>e===t+1))return`<<${i.range.map(a).join(`, `)}>>`;let o=n?i.domain.map((e,t)=>[e,i.range[t]]):bn(i);return sr(e)===`record`||i.domain.every(e=>typeof e==`string`&&za(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},Ha=(e,t)=>{if(e===void 0)return!1;try{return hr(e,t)}catch(e){if(e instanceof w)return!1;throw e}},Ua=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,Wa=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(Ua,(e,a,o=``,s,c,l=``)=>{let u=e=>o.includes(`-`)?e.padEnd(Number(s)):e.padStart(Number(s??0)),d=o.includes(`<`),f=o.replace(`<`,``);if(l===`n`&&e===`%n`)return`
|
|
74
|
-
`;if(l===`%`&&c===void 0&&/^-?$/.test(f))return f===`-`&&s===void 0&&(i=!1),u(`%`);let p=d?r:a===void 0?n++:Number(a.slice(0,-1))-1;r=p;let m=t[p];if(!`sSbBhH`.includes(l)||l===``||!/^-?$/.test(f)||f===`-`&&s===void 0||m===void 0)return i=!1,e;let h=l.toLowerCase(),g=h===`s`?m:h===`b`?`true`:(gt(m)>>>0).toString(16),_=u(c===void 0?g:g.slice(0,Number(c.slice(1))));return l===h?_:_.toUpperCase()});return i?a:void 0},
|
|
72
|
+
`]]),Lt=(e,t,n)=>{let r=n?It.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${Rt(t.slice(a),n)}`},Rt=(e,t)=>{let n=t?Pt(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Tt.none} @!@!@\n${Lt(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},zt=(e,t=2)=>String(e).padStart(t,`0`),Bt=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${zt(r%24)}h`:e>36e5?`${zt(r%24)}h ${zt(n)}min`:e>6e4?`${zt(n)}min ${zt(t)}s`:`${zt(t)}s`},Vt=e=>`${e.getFullYear()}-${zt(e.getMonth()+1)}-${zt(e.getDate())} ${zt(e.getHours())}:${zt(e.getMinutes())}:${zt(e.getSeconds())}`,Ht=/* @__PURE__ */ new WeakMap,Ut=(t,n,r)=>{if(!(t instanceof w))return t;let i=x(new w(`${r}\n${t.message}`,t),e(t));return Ht.set(i,{code:n,headline:r,inner:t}),i},Wt=e=>Ht.has(e),Gt=y(`util.WrongInvocationException`),Kt=l.slice(0,l.indexOf(`
|
|
73
|
+
`)),qt=`${l}tlc2.tool.EvalException: `,Jt=`${l}util.Assert$TLCRuntimeException: `,Yt=e=>Ft(e)?qt:Jt,Xt=e=>{try{return e()}catch(e){throw e instanceof w?Ft(e)?new w(`${a}${e.message}`):Pt(e.message)?e:new w(`${l}${e.message}`):e}},Zt=[qt,Jt,l,a],Qt=(e,t)=>{let r=Ht.get(e);if(r)return`${r.headline}\n${Qt(r.inner,t)}`;let i=e.message;if(e instanceof n)return i;let a=Zt.find(e=>i.startsWith(e))??``;return`${a}${Rt(i.slice(a.length),t)}`},$t=(e,t)=>{let r=Ht.get(e),a=e.message;if(r)return{code:r.code,message:a,toolMessage:Qt(e,!0)};if(e instanceof i)return{code:t?wt.stackOverflow:wt.general,message:a,toolMessage:a};if(t&&Ft(e))return{code:Pt(a)?.code??wt.general,message:a,toolMessage:a};let o=t&&!a.startsWith(Kt)&&!(e instanceof n),s=e instanceof u?Gt:l,c=o?s:``;return{code:wt.general,message:`${c}${a}`,toolMessage:`${c}${Qt(e,!0)}`}},en=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,tn=2147483647,nn=1e6;let rn=nn;const an=()=>rn,on=()=>Math.max(rn,10),sn=()=>`Attempted to construct a set with too many elements (>${rn}).`,cn=(e,t)=>{if(e.length===on())throw new u(sn());e.push(t)},ln=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=on(),un=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},dn=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,fn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),pn=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),mn=e=>typeof e==`object`&&e.kind===`ModelValue`,hn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),gn=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:dn(e)?`set`:`function`,_n=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let vn=!1;const yn=(e,t)=>(vn=!0,e.writtenKeys=t,e),bn=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,xn=e=>bn(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),Sn=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):xn(e),Cn=(e,t,n,r)=>yn(mi(e,t.map(e=>n[e])),r),wn=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(wn);e.writtenKeys=void 0,e.range.forEach(wn)}},Tn=e=>e.every(e=>typeof e==`string`),En=(e,t)=>e.length>0&&t.length>0&&Tn(e)!==Tn(t),Dn=(e,t)=>{vn&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return En(n,r)?Lr(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=$n(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:$n(t,n);if(r!==0)return r}return 0},On=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=$n(n[e],r[e]);if(t!==0)return t}return 0},kn=e=>mn(e)?e.type:void 0,An=(e,t,n)=>{let r=kn(e),i=kn(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(mn(e)&&mn(t)){if(r===void 0||i===void 0||r===i)return;throw new w(`Attempted to ${a} the differently-typed model values ${N(L(e))} and ${N(L(t))}`)}throw r===void 0?new w(`Attempted to ${a} the typed model value ${N(L(t))} and the non-model value\n${N(L(e))}`):new w(`Attempted to ${a}${n?``:` the`} typed model value ${N(L(e))} and non-model value\n${N(L(t))}`)},jn=()=>({ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0}),Mn=jn(),Nn=e=>{Object.assign(Mn,jn()),er.clear();for(let t of e)Un(t)},Pn=()=>{Mn.searchRank=Mn.size},Fn=()=>Mn.unorderedString;let In=!1;const Ln={isExpanded:!0,isViewPrinted:!1},Rn=e=>{In=e.version===`1.7.4`,rn=e.maxSetSize??nn,Ln.isExpanded=e.isLazyValueExpanded??!0,Ln.isViewPrinted=e.isViewPrinted??!1},zn=/* @__PURE__ */ new WeakMap,Bn=(e,t)=>(Ln.isViewPrinted&&zn.set(e,t),e),Vn=/* @__PURE__ */ new WeakMap,Hn=(e,t)=>(Vn.set(e,t),e),Un=e=>(Mn.ranks[e]===void 0&&(Mn.ranks[e]=Mn.size++),e),Wn=e=>Mn.ranks[Un(e)],Gn=(e,t)=>{if(e===t)return 0;let n=Mn.ranks,r=n[e],i=n[t],a=Mn.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(Mn.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},Kn=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),qn=(e,t)=>(Kn(e)||Kn(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Jn=(e,t)=>new w(Kn(e)?`Attempted to compare overridden value ${N(L(e,!0))} with non-overridden value:\n${N(L(t))}`:`Attempted to compare ${gn(e)} ${L(e)} with ${gn(t)} ${L(t)}`),Yn=(e,n,r)=>{if(!Kn(e))throw new w(`Attempted to ${r} the set ${N(L(P(e)?F(e):e,!0))} with the value:\n${N(L(n,!0))}`);if(!Kn(n))throw Jn(e,n);let i=e.kind===`InfiniteSet`?e.name:void 0,a=n.kind===`InfiniteSet`?n.name:void 0;if(i!==void 0&&i===a)return 0;if(i===`Nat`&&a===`Int`||i===`Int`&&a===`Nat`)return i===`Nat`?-1:1;throw new t(`Attempted to compare ${N(L(e,!0))} with the value\n${N(L(n,!0))}`)},Xn={kind:`InfiniteSet`,name:`Any`},Zn=e=>{throw new t(`Attempted to compare ANY with the value\n${N(L(e))}`)},Qn=e=>{vn&&wn(e),e===Xn&&Zn(e),typeof e==`object`&&e.kind===`LazyFunction`&&I(e)},$n=(e,t)=>{if(e===t)return Qn(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Dn(e,t);if(n===`Set`&&r===`Set`)return On(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&&An(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return An(e,t,!1),n===`ModelValue`?-1:1;if(e===Xn||t===Xn)return Zn(e===Xn?t:e);if(dn(e)&&dn(t)&&qn(e,t))return Yn(e,t,`compare`);let i=dn(e);if(i!==dn(t))throw Jn(e,t);if(n===`Interval`&&r===`Set`){let n=Ri(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-Ri(t);if(n!==0)return n}return i?On(F(e),F(t)):Dn(I(e),I(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Gn(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(An(e,t,!1),mn(e))return-1;if(mn(t))return 1;throw Jn(e,t)},er=/* @__PURE__ */ new Map,tr=32768,nr=e=>{let t=er.get(e);if(t)return t;if(er.size===tr)throw new f(`TLC supports at most ${tr} model values, but model value ${e} exceeds this limit.`);let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Wn(e),hash:_a(va(ya(e),109)),fingerprint:Oa(ka(e)^60)};return er.set(e,n),n},rr=()=>[...er.values()],ir=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),ar=e=>{let t=ir(e);return t.isNormalized=!0,t},or=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let sr=!1;const cr=(e,t)=>(t===`lambda`&&(sr=!0),t!==void 0&&(e.functionClass=t),e),lr=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,ur=e=>cr(e,`lambda`),dr=e=>en(e)&&e.isCached===!0;let fr=!1;const pr=e=>(fr=!0,e),mr=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),hr=e=>{fr&&typeof e==`object`&&en(e)&&mr.has(e.kind)&&(e.isCached=!0)},gr=e=>{(sr||fr)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(gr),e.range.forEach(gr)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(gr):dn(e)&&P(e)&&(hr(e),F(e).elements.forEach(gr))))},_r=(e,t)=>{if(hr(e),e===t)return Qn(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&An(e,t,!0),$n(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return Dn(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return On(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&Ri(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==Ri(t))return!1;if(mn(e)||mn(t))return e.kind===`LazyFunction`&&I(e),An(e,t,!0),mn(e)&&mn(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return _r(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=Fi(e.domain),r=Fi(t.domain);if(n||r)return n===r;let i=Fi(e.range),a=Fi(t.range);return i||a?i===a:_r(e.domain,t.domain)&&_r(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(Fi(e))return Fi(t);if(Fi(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]&&_r(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return Fi(e)?Fi(t):!Fi(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>_r(e,t.factors[n]));let n=dn(e)&&dn(t)&&!(P(e)&&P(t));if(n&&qn(e,t))return Yn(e,t,`check equality of`)===0;if(n){if(!Kn(e)){let n=F(e);if(!Kn(t))return On(n,F(t))===0}return Pa(e)===Pa(t)}return $n(e,t)===0},vr=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):Pa(n)===Pa(r);return n},yr=vr(!1),br=vr(!0),xr=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Sr=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Da(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||br(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||br(i[e],n))return i[e]}return n.kind===`Set`?xr(n.elements,t):(xr(n.domain,t),xr(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}},Cr=(e,t)=>t.length===0||lr(e)===`tuple`?1:ma(t)?.low,wr=e=>{if(!pn(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:Cr(e,t.domain)}},Tr=e=>{if(!pn(e))return;let t=I(e);return Tn(t.domain)?t:void 0},Er=(e,t,n)=>(An(t,e,n),1),Dr={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`}},Or=(e,t,n)=>{let r=Dr[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${N(L(e))} with ${r.other}:\n${N(L(t))}`},kr=e=>e?`check equality of`:`compare`,Ar=(e,t,n,r)=>{let i=wr(n);if(!i){if(mn(n))return Er(n,t,r);throw new w(`Attempted to ${kr(r)} the function ${N(L(t))} with the value:\n${N(L(n))}`)}if(e.range.length!==i.range.length)return e.range.length-i.range.length;let a=()=>jr(e.range,i.range,r);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&i.low!==void 0)return e.low===i.low?a():e.low-i.low;let o=e.low??i.low;if(o===void 0)return jr(e.domain,i.domain,r)||a();let s=e.low===void 0?e.domain:i.domain;for(let t=0;t<s.length;t++){let n=s[t];if(typeof n!=`number`)throw new w(`Attempted to compare ${r?`an `:``}integer with non-integer${r||e.low!==void 0?`:`:``}\n${N(L(n))}.`);let i=e.low===void 0?n-(o+t):o+t-n;if(i!==0)return i}return a()},jr=(e,t,n)=>{for(let r=0;r<e.length;r++){let i=Ir(e[r],t[r],n);if(i!==0)return i}return 0},Mr=(e,t,n)=>{let r=I(e);if(lr(e)===`tuple`){let i=pn(t)?Ui(t):void 0;return i?r.range.length-i.length||jr(r.range,i,n):Ar({...r,low:1},e,t,n)}if(lr(e)===`record`){let i=Tr(t);if(!i){if(mn(t))return Er(t,e,n);throw new w(`Attempted to ${kr(n)} record:\n${N(L(e))}\nwith non-record\n${N(L(t))}`)}return r.domain.length-i.domain.length||jr(r.domain,i.domain,n)||jr(r.range,i.range,n)}return Ar({...r,low:Cr(e,r.domain)},e,t,n)},Nr=(e,t)=>Kn(e)||Kn(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),Pr=(e,t)=>{let n=hn(t)?t:F(t);return{elements:F(e).elements,otherElements:F(n).elements}},Fr=(e,t,n)=>{if(Nr(e,t))return n?+!_r(e,t):$n(e,t);if(!hn(e))return Fr(F(e),t,n);if(!dn(t)){if(mn(t))return Er(t,e,n);throw new w(`Attempted to ${kr(n)} the set ${N(L(e))} with the value:\n${N(L(t))}`)}let r=Pr(e,t);return r.elements.length-r.otherElements.length||jr(r.elements,r.otherElements,n)},Ir=(e,t,n)=>{if(typeof e!=`object`){if(typeof t==typeof e)return n?e===t?0:1:$n(e,t);if(mn(t))return Er(t,e,n);throw new w(Or(e,t,n))}return e.kind===`ModelValue`?(e.type!==void 0&&An(e,t,n),mn(t)?n?e.name===t.name?0:1:e.rank-t.rank:-1):pn(e)?Mr(e,t,n):Fr(e,t,n)},Lr=(e,t)=>Ir(e,t,!1),Rr=(e,t)=>Ir(e,t,!0)===0,zr=e=>{let t=[];for(let n of e){let e=Vr(n,t);e.isFound||t.splice(e.index,0,n)}return t},Br=(e,t)=>{let n=Gi.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Vr=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=Br(e,()=>Lr(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},Hr=(e,t)=>t.some(t=>Br(t,()=>Rr(t,e))),Ur=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,Wr=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(Wr)),e.kind===`Function`&&(e.writtenKeys=void 0,e.domain.forEach(Wr),e.range.forEach(Wr)))},Gr=e=>{if(!(typeof e!=`object`||dr(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:F(e);return;case`FilteredSet`:case`Subset`:return Gr(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(Gr(e.left),Gr(e.right));case`FunctionSet`:return Gr(e.domain),Gr(e.range);case`RecordSet`:return e.sets.forEach(Gr);case`ProductSet`:return e.factors.forEach(Gr)}},Kr=(e,t)=>Ki(_r,Rr,e,t),qr=e=>{for(let t=1;t<e.length;t++)if($n(e[t-1],e[t])>=0)return!1;return!0},Jr=e=>{for(let t=0;t<e.length;t++){let n=e[t],r=t>0?e[t-1]:void 0;if(typeof n!=`number`||typeof r==`number`&&r>=n)return!1}return!0},Yr=e=>{for(let t=1;t<e.length;t++)hr(e[t]);if(e.length<2||qr(e))return ir(e);let t=[...e].sort($n),n=[t[0]];for(let e=1;e<t.length;e++)$n(n[n.length-1],t[e])!==0&&n.push(t[e]);return ir(n)},Xr=e=>{if(Jr(e))return ir(e);let t=Ki(Yr,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},Zr=ir([]),Qr=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&$n(r[a],t)<0;)a++;a<r.length&&$n(r[a],t)===0||i.push(t)}return i.length===n.length?e:ir(i)},$r=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&$n(r[a],t)<0;)a++;a<r.length&&$n(r[a],t)===0&&i.push(t)}return i.length===n.length?e:ir(i)},ei=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=$n(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=ir(i);if(e.hash!==0&&e.hash!==Sa){let t=e.hash,n=0;for(;n<a.length;n++){let e=Da(a[n]);if(e===Sa)break;t=t+ba(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Aa(a[e])|0;c.fingerprint=t}return c},ti=e=>{let t=e.length<2?e:[...e].sort((e,t)=>$n(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&$n(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return or(n,r)},ni=e=>{let t=ti(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:yn(t,e.map(e=>e[0]))},ri=[],ii=/* @__PURE__ */ new Map,ai=[],oi=/* @__PURE__ */ new WeakMap,si=e=>{let t=ri[e]??ii.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?ii.set(e,new WeakRef(n)):ri[e]=n,n},ci=e=>{if(Ri(e),e.low===1&&e.high>=1)return si(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},li=e=>e.length>0&&(e===ri[e.length]||e===ii.get(e.length)?.deref())||oi.has(e),ui=e=>{let t=F(e).elements;return li(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},di=e=>{let t=ai[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return ai[e]=n,n},fi=e=>cr(or(si(e.length),e),`tuple`),pi=e=>cr(ti(e),`record`),mi=(e,t)=>cr(or(e,t),`record`),hi=e=>dn(e)&&!Kn(e),gi=(e,t=!1)=>`UNION(${L(e.base,t)})`,_i=(e,t=e=>F(e).elements)=>{if(!hi(e.base))throw new w(`Attempted to enumerate the nonenumerable set:\n${gi(e)}`);return t(e.base)},vi=(e,t,n)=>{if(hi(e))return e;throw new w(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${N(L(e))}\nwhen enumerating:\n${N(gi(n))}`)},P=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 P(e.base);case`FunctionSet`:return P(e.domain)&&P(e.range)||yi(e.domain)===!0||yi(e)===!0;case`RecordSet`:return e.sets.every(P)||yi(e)===!0;case`ProductSet`:return e.factors.every(P)||yi(e)===!0;case`Union`:return P(e.base)&&(hn(e.base)?Ur(e.base):Ai(e.base)).every(P);case`SetOperation`:return e.operator===`\\cup`?P(e.left)&&P(e.right):e.operator===`\\cap`?P(e.left)||P(e.right):P(e.left);default:return!1}},yi=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=yi(e.domain);return t===void 0?void 0:!t&&yi(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=yi(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return P(e)?F(e).elements.length===0:void 0;default:return}},bi=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},xi=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},Si=e=>{if(typeof e!=`object`||e.kind!==`Subset`||Kn(e.base))return;let t=F(e.base).elements;if(t.length<=20)return;let n=-1,r=[0],i=e=>{for(e<=n&&(n=-1);n<e;)n===-1?r=[]:xi(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return ir(r.map(e=>t[e]))},a=2**t.length,o=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<a;return new Proxy([],{get:(e,t,n)=>t===`length`?a:o(t)?i(Number(t)):Reflect.get(e,t,n),has:(e,t)=>o(t)||Reflect.has(e,t)})},Ci=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(ir(r.map(t=>e[t])));while(xi(r,e.length))}return t},wi=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(Kn(a))throw new w(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},Ti=(e,t=e=>F(e).elements)=>{if(typeof e!=`object`)throw new w(`Expected a set but found ${L(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return zr(e.elements);case`Interval`:{let t=ci(e);return t!==ri[t.length]&&oi.set(t,e),t}case`Subset`:{if(Ri(e.base)===0)return Ci([]);if(!dn(e.base))throw new w(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${N(L(e.base))}`);let t=F(e.base).elements;if(t.length>30)throw new w(Li(e));return Ci(t)}case`FunctionSet`:{if(!In&&Fi(e))return[];if(Kn(e.domain))throw new w(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${N(L(e.domain))}\ncannot be enumerated.`);let n=ui(e.domain);if((n.length>0||In)&&Kn(e.range))throw new w(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${N(L(e.range))}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return bi(n.map(()=>r)).map(e=>or(n,e))}case`RecordSet`:{if(!In&&Fi(e))return[];let n=wi(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${N(L(t))}`);return bi(n).map(t=>pi(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!In&&Fi(e))return[];let n=wi(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${N(L(e))}`);return bi(n).map(fi)}case`FilteredSet`:if(!dn(e.base)||Kn(e.base))throw new w(`Attempted to enumerate { x \\in S : p(x) } when S:\n${N(L(e.base))}\nis not enumerable`);return F(Xr(Ai(e.base).filter(t=>e.test(t,!1)))).elements;case`Union`:{let t=[];return _i(e).forEach((n,r)=>{let i=vi(n,r,e);if(ln(i))throw new u(sn());Ai(i).forEach(e=>cn(t,e))}),F(Xr(t)).elements}case`SetOperation`:{if(e.operator===`\\cap`&&!hi(e.left)&&!hi(e.right))throw new w(`Attempted to enumerate S \\cap T when neither S:\n${N(L(e.left))}\nnor T:\n${N(L(e.right))}\nis enumerable`);if(e.operator===`\\`&&!hi(e.left))throw new w(`Attempted to enumerate S \\ T when S:\n${N(L(e.left))}\nis not enumerable.`);if(e.operator===`\\cup`)return F(Xr(Di(e))).elements;let t=e.operator===`\\`||hi(e.left),n=t?e.left:e.right,r=t?e.right:e.left,i=[];return un(typeof n==`object`&&n.kind===`Interval`?n:Ai(n),t=>{Ji(t,r)===(e.operator===`\\cap`)&&cn(i,t)}),F(Xr(i)).elements}case`InfiniteSet`:case`SequenceSet`:throw new w(`Attempted to enumerate the non-enumerable set ${L(e)}`);default:throw new w(`Expected a set but found ${L(e)}`)}},F=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return ir(Ti(e));let t=typeof e==`object`&&en(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=Gi.sets;n?.push(e);let r=Ti(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?ir(r):Yr(r);return t&&(t.enumerated=i),i},Ei=e=>{if(!(typeof e!=`object`||dr(e)))switch(e.kind){case`MixedSet`:F(e);return;case`FilteredSet`:return hi(e.base)||F(e),Ei(e.base);case`Union`:if(!hn(e.base)&&hi(e.base))return Ei(e.base);_i(e).slice(0,1).forEach(t=>Ei(vi(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!hi(e.left)&&F(e),e.operator!==`\\cup`||hi(e.left)&&hi(e.right)||F(e),e.operator!==`\\cap`||hi(e.left)?Ei(e.left):Ei(e.right),e.operator===`\\cup`&&Ei(e.right)}},Di=e=>{if(!hi(e.left)||!hi(e.right))throw new w(`Attempted to enumerate S \\cup T when S:\n${N(L(e.left))}\nand T:\n${N(L(e.right))}\nare not both enumerable`);if(Ei(e.left),Ei(e.right),ln(e.left))throw new u(sn());let t=Ai(e.left),n=ln(e.right)?void 0:Ai(e.right);if(!n||t.length+n.length>on())throw new u(sn());return[...t,...n]},Oi=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return F(e).elements;let t=Br(e,()=>Di(e)),n=F(Xr(t)).elements;return e.enumerated=ir(n),n},ki=(e,t)=>{if(typeof e!=`object`||dr(e))return F(e).elements.some(t);let n=Gi.sets;n?.push(e),Ei(e);let r=Pi(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},Ai=e=>{let t=[];return ki(e,e=>(t.push(e),!1)),t},ji=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,Mi=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(Mi);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(Mi)&&e.range.every(Mi);case`SetOperation`:return e.operator!==`\\cup`&&Mi(e.left)&&Mi(e.right);case`FilteredSet`:return Mi(e.base);case`ProductSet`:return e.factors.every(Mi);default:return!1}},Ni=e=>typeof e!=`object`||dr(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?Ni(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||Ni(e.left)||Ni(e.right):ji(e)?.some(Ni)??!1,Pi=(e,t)=>{if(e.kind===`Union`)return _i(e,Ai).some((n,r)=>ki(vi(n,r,e),t));if(e.kind===`FilteredSet`&&hi(e.base))return ki(e.base,n=>e.test(n,!1)&&t(n));if(ji(e)?.some(Ni))return Ti(e,Ai).some(t);if(e.kind!==`SetOperation`)return F(e).elements.some(t);if(e.operator===`\\cup`)return!hi(e.left)||!hi(e.right)?F(e).elements.some(t):ki(e.left,t)||ki(e.right,t);let n=e.operator===`\\`||hi(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return hi(r)?ki(r,n=>Ji(n,i)===(e.operator===`\\cap`)&&t(n)):F(e).elements.some(t)},Fi=e=>{if(typeof e!=`object`||!dn(e))throw Gi.sets?.push(e),new w(`Shouldn't call isEmpty() on value ${L(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new w(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(Fi);case`RecordSet`:return e.sets.some(Fi);case`FunctionSet`:return!Fi(e.domain)&&Fi(e.range);case`Union`:return _i(e).every((t,n)=>Fi(vi(t,n,e)));default:return F(e).elements.length===0}},Ii=(e,t,n)=>e.reduce((e,r)=>{let i=e*Ri(r,t);if(i>2147483647)throw new w(n());return i},1),Li=e=>`Overflow when computing the number of elements in:\n${N(L(e))}`,Ri=(e,t)=>{if(typeof e!=`object`)throw new w(`Attempted to compute the number of elements in the ${gn(e)} ${N(L(e))}.`);switch(e.kind){case`ModelValue`:throw new w(`Attempted to compute the number of elements in the model value ${N(L(e))}.`);case`Function`:return e.domain.length;case`LazyFunction`:return Ri(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new w(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new w(`Attempted to compute the number of elements in the overridden value ${N(L(e))}.`);case`Subset`:{let n=Ri(e.base,t);if(n>=31)throw new w(Li(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(Fi(e.domain))return 1;if(Fi(e.range))return 0;if(Ri(e.range,t)===1)return 1}let n=Ri(e.domain,t),r=Ri(e.range,t);if(r<=1)return n===0?1:r;let i=1;for(let t=0;t<n;t++)if(i*=r,i>2147483647)throw new w(Li(e));return i}case`RecordSet`:return t!==`1.7.4`&&Fi(e)?0:Ii(e.sets,t,()=>Li(e));case`ProductSet`:return t!==`1.7.4`&&Fi(e)?0:Ii(e.factors,t,()=>`Overflow when computing the number of elements in ${N(L(e))}`);default:return hr(e),F(e).elements.length}},zi=e=>`Attempted to check if the set ${N(L(e))}is finite.`,Bi=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new w(`Attempted to check if the ${gn(e)} ${N(L(e))} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new w(`Attempted to check if the function:\n${N(L(e))}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Bi(e.base)&&Fi(e.base);case`Subset`:return Bi(e.base);case`FunctionSet`:{let t=Bi(e.domain);if(t&&Fi(e.domain))return!0;let n=Bi(e.range);return n&&Fi(e.range)?!0:n&&(t||Ri(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n=!0;for(let e of t)if(!Bi(e))n=!1;else if(Fi(e))return!0;return n}case`Union`:if(!hi(e.base))throw new w(`Attempted to check if the nonenumerable set:\n${gi(e)}\nis a finite set.`);return F(e.base).elements.every(Bi);case`SetOperation`:if(e.operator===`\\cup`)return Bi(e.left)&&Bi(e.right);if(e.operator===`\\cap`){if(!Bi(e.left)&&!Bi(e.right))throw new w(zi(e));return!0}if(Bi(e.left))return!0;if(!Bi(e.right))throw new w(zi(e));return!1;case`FilteredSet`:if(!Bi(e.base))throw new w(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${N(L(e.base))}\nis finite.`);return!0}},Vi=(e,t,n=$n)=>{let r=0,i=e.length-1;for(;r<=i;){let a=r+i>>1,o=n(e[a],t);if(o===0)return a;o<0?r=a+1:i=a-1}return-1},Hi=(e,t)=>{let n=e.elements;if(n.length>on())throw new u(sn());let r=Array.from({length:n.length},()=>!1),i=t.filter(e=>{let t=Vi(n,e);return!r[t]&&(r[t]=!0,!0)}),a=ir(n);return i.some((e,t)=>e!==n[t])&&(a.writtenElements=i),a},Ui=e=>{if(typeof e!=`object`||!pn(e))return;if(e.kind===`LazyFunction`&&(!dn(e.domain)||Kn(e.domain)))throw new w(`To convert a function of form [x \\in S |-> f(x)] to a tuple, the set S must be enumerable.`);let t=I(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Wi=(e,t)=>{let n=`Attempted to check if the value:\n${N(L(e))}\nis an element of the`;if(!pn(t))return`${n} ${gn(t)} ${N(L(t))}`;let r=lr(t);return r===`record`?`Attempted to check if element:\n${N(L(e))}\nis in the record:\n${N(L(t))}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${N(L(t))}`},Gi={sets:void 0},Ki=(e,t,n,r)=>{let i=Gi.sets,a=Gi.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof w))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},qi=e=>(Gi.sets??[]).slice(e).some(e=>typeof e==`object`&&Gi.callStack?.sources.has(e)===!0),Ji=(e,t)=>{let n=Gi.sets;if(n===void 0)return $i(e,t);n.push(t);let r=$i(e,t);return n.pop(),r},Yi=(e,t)=>{let n=t.elements,r=0,i=n.length-1;for(;r<=i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;if(a===e)return!0;a<e?r=t+1:i=t-1}return!1},Xi=(e,t)=>Vi(t.elements,e)!==-1,Zi=(e,t)=>t.isNormalized?Vr(e,t.elements).isFound:Hr(e,Ur(t)),Qi=(e,t)=>{if(e.type!==void 0)throw new w(`Attempted to check if the typed model value ${N(L(e))} is an element of\n${N(L(t))}`);return!1},$i=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return Yi(e,t)??ea(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return ea(e,t)},ea=(e,n)=>{if(!dn(n))throw new w(Wi(e,n));switch(n.kind){case`Set`:return hr(e),Ki(Xi,Zi,e,n);case`MixedSet`:return Hr(e,n.elements);case`Interval`:if(typeof e==`number`)return e>=n.low&&e<=n.high;if(n.low<=n.high&&(!mn(e)||e.type!==void 0))throw new w(`Attempted to check if the value:\n${N(L(e))}\nis in the integer interval ${N(L(n))}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(mn(e))return Qi(e,n);if(!(n.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new t(`Attempted to check if the value:\n${N(L(e))}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!dn(e)||Kn(e))throw new w(`Attempted to check if the non-enumerable value\n${N(L(e))}\nis element of\n${N(L(n))}`);return F(e).elements.every(e=>Ji(e,n.base));case`FunctionSet`:{if(!pn(e)){if(mn(e))return Qi(e,n);throw new w(`Attempted to check if \n${L(e)}\nwhich is not a TLC function value, is in the set of functions:\n${N(L(n))}`)}let t=I(e),r=Cr(e,t.domain);return(r===void 0?Kr(n.domain,ir(t.domain)):Kr({kind:`Interval`,low:r,high:r+t.domain.length-1},n.domain))&&t.range.every(e=>Ji(e,n.range))}case`RecordSet`:{let t=pn(e)?I(e):void 0;if(!t||!Tn(t.domain)){if(mn(e))return Qi(e,n);throw new w(`Attempted to check if non-record\n${L(e)}\nis in the set of records:\n${N(L(n))}`)}return t.domain.length===n.names.length&&n.names.every((e,r)=>{let i=Vi(t.domain,e);return i!==-1&&Ji(t.range[i],n.sets[r])})}case`ProductSet`:{let t=pn(e)?Ui(e):void 0;if(t===void 0){let t=pn(e)&&I(e).domain.every(e=>typeof e==`number`);if(mn(e))return Qi(e,n);if(t)return!1;throw new w(`Attempted to check if non-tuple\n${N(L(e))}\nis in the set of tuples:\n${N(L(n))}`)}return t.length===n.factors.length&&t.every((e,t)=>Ji(e,n.factors[t]))}case`FilteredSet`:try{return Ji(e,n.base)&&n.test(e,!0)}catch(t){throw!(t instanceof w)||!Ft(t)?t:new w(`Cannot decide if element:\n${N(L(e))}\n is element of:\n${N(L(n.base))}\nand satisfies the predicate ${n.source?.predicate}`)}case`Union`:{if(!hi(n.base))throw new w(`Attempted to check if:\n ${N(L(e))}\nis an element of the non-enumerable set:\n ${N(gi(n))}`);let t=F(n.base).elements;return t.length>1&&t.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),t.some(t=>Ji(e,t))}case`SetOperation`:return n.operator===`\\cup`?Ji(e,n.left)||Ji(e,n.right):Ji(e,n.left)&&Ji(e,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=Ui(e);if(r===void 0){if(mn(e))return Qi(e,n);throw new t(`Attempted to check if the value:\n${N(L(e))}\nis an element of ${N(L(n))}.`)}return r.every(e=>Ji(e,n.base))}default:throw new w(Wi(e,n))}},ta=(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?Ji(e,n):e.range.every((e,r)=>ta(e,t.range[r],n.range)),I=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return e.enumerated;if(P(e.domain)||Ri(e.domain),!dn(e.domain))throw new w(`The domains of formal parameters must be enumerable.`);let t=ui(e.domain);return e.enumerated=or(t,t.map(t=>e.apply(t))),e.enumerated}throw new w(`Expected a function but found ${L(e)}`)},na=(e,t,n)=>{let r=N(L(e)),i=N(L(t)),a=n===`1.7.4`;switch(lr(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},ra=(e,t)=>{if(!In)return na(e,t);let n=N(L(t));return lr(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},ia=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},aa=e=>new w(`Attempted to apply function with integer domain to the non-integer argument ${N(L(e))}`),oa=(e,t)=>Vi(e.domain,t),sa=(e,t,n)=>{let r=bn(e);throw In||r!==e.domain||r.length<32?r.forEach(e=>Rr(e,t)):Vi(r,t,Lr),n},ca=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=lr(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new w(n(e,t));if(a===void 0&&!In&&typeof t!=`number`&&li(r))throw aa(t)}let i=ia(r,t);return i===-1?Ki(oa,sa,e,t):i},la=(e,t,n,r)=>`In applying the function\n${N(L(e))},\nthe ${t} is:\n${N(L(n))}\nwhich ${r}.\n`,ua=(e,t)=>new w(la(e,`argument list`,t,`does not match its formal parameter`)),da=(e,t,n)=>{let r=e.domain,i=Ui(n);if(i===void 0)throw ua(e,n);if(typeof r!=`object`||r.kind!==`ProductSet`)throw new w(`Attempted to apply a function to ${L(n)}, which is not in its domain`);if(t.forEach((t,a)=>{if(a>=i.length)throw ua(e,n);let o=i[a],s=`argument number ${a+1}`;if(!Ji(o,r.factors[a]))throw new w(la(e,s,o,t===void 0?`is not in the function's domain ${L(r)}`:`is not in its domain`));if(t!==void 0&&Ui(o)?.length!==t)throw new w(la(e,s,o,`does not match its formal parameter`))}),i.length>t.length)throw ua(e,n)},fa=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!Ji(t,e.lambdaDomain),pa=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return pa(e.enumerated,t,n);let r=e.boundTupleLengths;if(r!==void 0)return da(e,r,t),e.apply(t);if(!Ji(t,e.domain))throw new w(lr(e)===`lambda`?na(e,t):`Attempted to apply a function to ${L(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new w(`Attempted to apply ${L(e)}, which is not a function`);let r=n??na;if(fa(e,t))throw new w(r(e,t));let i=ca(e,t,r);if(i===-1)throw new w(r(e,t));return e.range[i]},ma=e=>li(e)?oi.get(e)??di(e.length):void 0,ha=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=I(e);if(t.functionClass===`lambda`&&t.lambdaDomain)return t.lambdaDomain;let n=ma(t.domain);if(n)return n;let r=ir(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},ga=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||e.enumerated===void 0)){if(e.boundTupleLengths!==void 0&&Ui(t)===void 0)throw ua(e,t);if(!Ji(t,e.domain))return e;let r=n(e.apply(t));return cr({kind:`LazyFunction`,domain:e.domain,apply:n=>Kr(t,n)?r:e.apply(n),source:e.source,boundTupleLengths:e.boundTupleLengths},lr(e))}if(!pn(e))throw new w(`Attempted to apply EXCEPT construct to the value ${N(L(e))}.`);let i=I(e);if(fa(i,t))return i;let a=ca(i,t,ra);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=cr(or(i.domain,o),lr(i));if(l.writtenKeys=i.writtenKeys,l.lambdaDomain=i.lambdaDomain,i.hash!==0&&i.hash!==Sa){let e=Da(c);if(e!==Sa){let t=Da(i.domain[a]);l.hash=s===c?i.hash:i.hash-xa(t,Da(s))+xa(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-ja(e,s)+ja(e,c)|0}return l},_a=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},va=(e,t)=>Math.imul(e^t,16777619),ya=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return _a(t)},ba=e=>_a(e+2654435769|0),xa=(e,t)=>_a(Math.imul(e,668265261)+t|0),Sa=795548749,Ca=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Da(t[e]);if(r===Sa)return Sa;n=n+ba(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Da(e.domain[n]),i=Da(e.range[n]);if(r===Sa||i===Sa)return Sa;t=t+xa(r,i)|0}return t},wa=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new w(`TLC has found a state in which the value of a variable contains ${N(L(e))}`);if(dn(e)){F(e).elements.forEach(wa);return}let t=I(e);t.domain.forEach(wa),t.range.forEach(wa)},Ta=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Da(e)===Sa&&wa(e);return}catch(e){if(!(e instanceof w))throw e;return e}},Ea=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},Da=e=>typeof e==`number`?_a(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?ya(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=Ca(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?P(e.domain)?Da(I(e)):Sa:P(e)?Da(F(e)):Sa,Oa=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},ka=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Oa(t)},Aa=e=>Oa(Na(e)+2135587861|0),ja=(e,t)=>Oa(Math.imul(Na(e),374761393)+Na(t)|0),Ma=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Aa(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+ja(e.domain[n],e.range[n])|0;return t},Na=e=>typeof e==`number`?Oa(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?ka(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Ma(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?Na(I(e)):P(e)?Na(F(e)):ka(Pa(e)),Pa=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):Fa(e),Fa=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${Pa(e.base)}>`;if(e.kind===`FilteredSet`&&!P(e))throw new w(`Attempted to compare the non-enumerable set ${L(e)} with another value`);if(dn(e))return P(e)?`{${F(e).elements.map(Pa).join(`,`)}}`:`<${e.kind} ${L(e)}>`;let t=I(e);return`(${t.domain.map((e,n)=>`${Pa(e)}:${Pa(t.range[n])}`).join(`,`)})`},Ia={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},La=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>Ia[e])}"`,Ra=1999,za=e=>e.reduce((e,t)=>e===0?0:e*Ri(t),1),Ba=e=>{if(e.kind===`Subset`)return Ri(e.base)<=6?F(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return F(e);if(e.kind===`FunctionSet`){let t=Fi(e.domain)?0:Ri(e.domain);return(t===0?1:Ri(e.range)**t)<=Ra?F(e):void 0}return za(e.kind===`RecordSet`?e.sets:e.factors)<=Ra?F(e):void 0},Va=(e,t)=>{if(t||e.kind===`Union`||e.kind===`Subset`&&pn(e.base)&&(e.base.kind===`Function`||P(e.base.domain)))return Ba(e);if(P(e))try{return Ba(e)}catch(e){if(e instanceof w)return;throw e}},Ha=(e,t)=>{let n=e=>L(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return gi(e,t)}},Ua=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Wa=e=>{if(P(e.domain))try{return I(e)}catch(e){if(e instanceof w||b(e))return;throw e}},Ga=e=>{let t=[],n=[],r=[],i=(e,a,o)=>{if(typeof e!=`object`)return;let s=e=>i(e,a,!1);switch(e.kind){case`Set`:if(e.elements.forEach(s),e.isNormalized)return;e.isNormalized=!0,t.push(e);return;case`MixedSet`:e.elements.forEach(s),F(e);return;case`Function`:{let t=a||lr(e)===`lambda`;if(e.range.forEach(e=>i(e,t,o)),a||e.writtenKeys===void 0)return;n.push([e,e.writtenKeys]),e.writtenKeys=void 0;return}case`LazyFunction`:if(e.enumerated)return i(e.enumerated,!0,o);o&&r.push(e),s(e.domain);return;case`SetOperation`:s(e.left),s(e.right);return;case`FunctionSet`:s(e.domain),s(e.range);return;case`RecordSet`:e.sets.forEach(s);return;case`ProductSet`:e.factors.forEach(s);return;case`Subset`:case`Union`:case`FilteredSet`:case`SequenceSet`:s(e.base);return;default:return}};try{return e.forEach(e=>i(e,!1,!0)),e.map(e=>L(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1}),r.forEach(e=>{e.enumerated=void 0}),n.forEach(e=>{e[0].writtenKeys=e[1]})}},L=(e,t=!1,n=!1)=>{let r=e=>L(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return La(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(F(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=Ln.isExpanded?Va(e,t):void 0;return n?r(n):Ha(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?Ln.isExpanded||!e.source?Wa(e):void 0:e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${L(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&In&&lr(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&lr(e)!==`lambda`);if(i.domain.length===0&&lr(e)===`record`)return`[]`;if(i.domain.every((e,t)=>e===t+1))return`<<${i.range.map(a).join(`, `)}>>`;let o=n?i.domain.map((e,t)=>[e,i.range[t]]):Sn(i);return lr(e)===`record`||i.domain.every(e=>typeof e==`string`&&Ua(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},Ka=(e,t)=>{if(e===void 0)return!1;try{return _r(e,t)}catch(e){if(e instanceof w)return!1;throw e}},qa=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,Ja=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(qa,(e,a,o=``,s,c,l=``)=>{let u=e=>o.includes(`-`)?e.padEnd(Number(s)):e.padStart(Number(s??0)),d=o.includes(`<`),f=o.replace(`<`,``);if(l===`n`&&e===`%n`)return`
|
|
74
|
+
`;if(l===`%`&&c===void 0&&/^-?$/.test(f))return f===`-`&&s===void 0&&(i=!1),u(`%`);let p=d?r:a===void 0?n++:Number(a.slice(0,-1))-1;r=p;let m=t[p];if(!`sSbBhH`.includes(l)||l===``||!/^-?$/.test(f)||f===`-`&&s===void 0||m===void 0)return i=!1,e;let h=l.toLowerCase(),g=h===`s`?m:h===`b`?`true`:(gt(m)>>>0).toString(16),_=u(c===void 0?g:g.slice(0,Number(c.slice(1))));return l===h?_:_.toUpperCase()});return i?a:void 0},Ya=(e,t)=>{let n=t?void 0:zn.get(e);if(n)return n();let r=Object.entries(e),i=Vn.get(e),a=i!==void 0&&`_format`in e,o=a?e._format:r.length===1?`%s = %s
|
|
75
75
|
`:`/\\ %s = %s
|
|
76
|
-
`;if(typeof o!=`string`)throw new _(`The _format field of the ALIAS ${i} is ${L(o)}, but it must be a string.`);return r.filter(e=>!(a&&e[0]===`_format`)).filter(e=>!t||!Ha(t[e[0]],e[1])).map(e=>{let t=Wa(o,[e[0],N(L(e[1]))]);if(t===void 0)throw new _(`The _format field of the ALIAS ${i} is ${L(o)}, but it must format two strings, the name and the value of a field.`);return t}).join(``)},Ka=[10454148508367108822n,15747411856486957441n,13848313129918172575n,15427004735118145554n,14338780731064426356n,15931650522396165332n,17670238537108149059n,12816660938095048951n,13192168525635896882n,16119298732711755075n,13564417994159519395n,15831473429641889162n,17671735485712653535n,14582471876431321160n,9288673424107444897n,12345523232675890545n,13774063780198914517n,10636128657019767374n,13227535641082688945n,10085966873248490402n,17056045221983369811n,18027133543548002442n,13033986364717636900n,12663388180492401538n,11007194744055901935n,16251515628090973732n,18046429724439772544n,9876734796024595817n,14949643787442512870n,16960057143726945461n,10590203213448744021n,12248592797044284137n,9558805810925624286n,16993321702164258530n,11754329512098378960n,12074934892440206921n,15696745233288286746n,10531590977001201739n,18107999685377398317n,12149369488538049728n,12923655455904407421n,10507099144397364930n,17322088528956367024n,14653973644796244054n,15165509594857513400n,13554280709034297251n,16228911470502883382n,17115369786458865383n,11179220607102683830n,16708422618246866334n,12295941796329322556n,18336630348474106240n,13989616001589685348n,14822072159597151759n,14264172520427195041n,11642530518213145397n,11877331515501935358n,13913116192159715440n,17054474839259161580n,13461230878584418056n,16058025410470398786n,11100471369705097435n,11133782763824505275n,13192312712502684421n,17456091706045076157n,13237272598629075916n,12914531898895761383n,15801841604014567326n,16446055517513626294n,16780923767715884464n,15104658705803254918n,10882049990920163451n,12728112724252049190n,11720209067562733740n,16476221075563830086n,16602801460297162326n,16206898064012585915n,12158475401238648099n,13742285336487677729n,15543703592025073839n,9615783578189153721n,16710542608962839044n,11960730242263336692n,13328718558362718101n,12971616006464047952n,17057853503483465676n,16180230282101315295n,15483523553568578902n,17773465781871025571n,18047252642493037509n,11580640560664688668n,10121963531818974651n,14218267149826330657n,12715294421139777506n,10584764766358778171n,12666843443693621286n,17403948736867619210n,17907955559063099692n,15179434392748515198n,15413469521140985247n,13455040338347572751n,15419348191054617477n,12340568220039846914n,13236419189535069162n,18074463254581147189n,10818750974828329405n,9859349269386152082n,15035006154709018396n,13627907273947709876n,9549035931546940138n,16199589727945564820n,10285831968679942330n,17737018494601061698n,15477896647372134857n,13595764249822586512n,10556855812148546550n,12421897615105552821n,15477767459253848096n,17421607461439241175n,12409061346569762725n,13621778224251023638n,10680972825126675886n,16494492050207190715n,16801324317763555620n,12664650400804916358n,16134230614391269483n,10027806175083075147n,9259037851175017999n,11803214621941906429n,9537357587847606069n,10517495000576890277n];let qa=Ka[0];const Ja=()=>qa,Ya=/* @__PURE__ */ new Int32Array(256),Xa=/* @__PURE__ */ new Int32Array(256),Za=/* @__PURE__ */ new Int32Array(256),Qa=/* @__PURE__ */ new Int32Array(256),$a=/* @__PURE__ */ new Int32Array(256),eo=/* @__PURE__ */ new Int32Array(256),to=/* @__PURE__ */ new Int32Array(256),no=/* @__PURE__ */ new Int32Array(256);let ro=0,io=0,ao=0,oo=0;const so=e=>{let t=(e^oo)&255;oo=(oo>>>8|ao<<24)^$a[t],ao=ao>>>8^Ya[t]},co=e=>{let t=Ka[e];qa=t;let n=[];for(let e=1n<<63n;n.length<72;)n.push(e),e=e>>1n^((e&1n)==0n?0n:t);let r=n.slice(64,72).reverse();for(let e=0;e<256;e++){let t=r.reduce((t,n,r)=>e>>r&1?t^n:t,0n);Ya[e]=Number(BigInt.asIntN(32,t>>32n)),$a[e]=Number(BigInt.asIntN(32,t))}let i=[Ya,Xa,Za,Qa],a=[$a,eo,to,no];for(let e=1;e<4;e++){let t=i[e-1],n=a[e-1];for(let r=0;r<256;r++){let o=n[r]&255;a[e][r]=(n[r]>>>8|t[r]<<24)^$a[o],i[e][r]=t[r]>>>8^Ya[o]}}ro=Number(BigInt.asIntN(32,t>>32n)),io=Number(BigInt.asIntN(32,t))};co(0);const lo=e=>{let t=oo^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;oo=ao^no[n]^to[r]^eo[i]^$a[a],ao=Qa[n]^Za[r]^Xa[i]^Ya[a]},uo=e=>{if(typeof e==`boolean`)return so(0),so(e?116:102),2;if(typeof e==`number`)return so(1),lo(e),5;if(typeof e==`string`){so(3),lo(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)lo(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)so(e.charCodeAt(n));return 5+e.length}return so(21),lo(Hn(e.name)+1),5},fo=e=>{let t=ao,n=oo;ao=0,oo=0;let r=[uo(e),ao,oo];return ao=t,oo=n,r},po=e=>`m = (${e} ^ l) & 255; l = ((l >>> 8) | (h << 24)) ^ L0[m]; h = (h >>> 8) ^ H0[m];`,mo=e=>`m = l ^ ${e}; l = h ^ L3[m & 255] ^ L2[(m >>> 8) & 255] ^ L1[(m >>> 16) & 255] ^ L0[m >>> 24]; h = H3[m & 255] ^ H2[(m >>> 8) & 255] ^ H1[(m >>> 16) & 255] ^ H0[m >>> 24];`,ho={integer:e=>`${po(`1`)} ${mo(e)}`,boolean:e=>`${po(`0`)} ${po(`(${e} ? 116 : 102)`)}`,set:e=>`${po(`5`)} ${mo(e)}`,function:e=>`${po(`9`)} ${mo(e)}`,scalar:(e,t,n)=>`{ let r = ${e}; for (; r >= 4; r -= 4) { ${mo(`0`)} } for (; r > 0; r--) { ${po(`0`)} } h ^= ${t}; l ^= ${n}; }`},go=()=>({H0:Ya,H1:Xa,H2:Za,H3:Qa,L0:$a,L1:eo,L2:to,L3:no,initialHigh:ro,initialLow:io}),_o=(e,t)=>{let n=ao,r=oo;oo=e[0],ao=e[1],bo(t),e[0]=oo,e[1]=ao,ao=n,oo=r},vo=e=>{so(5),lo(e)},yo=e=>{so(9),lo(e)},bo=e=>{if(typeof e!=`object`||fn(e))uo(e);else if(dn(e)){let t=I(e);yo(t.domain.length);for(let e=0;e<t.domain.length;e++)bo(t.domain[e]),bo(t.range[e])}else{let t=F(e).elements;vo(t.length);for(let e of t)bo(e)}},xo=e=>{let t=ao,n=oo;ao=ro,oo=io;for(let t of e)bo(t);let r=BigInt(ao>>>0)<<32n|BigInt(oo>>>0);return ao=t,oo=n,r},So=(e,t)=>{let n=new BigInt64Array(e),r=new Int32Array(n.buffer),i=ao,a=oo;for(let n=0;n<e;n++)ao=ro,oo=io,t(n),r[2*n]=oo,r[2*n+1]=ao;return ao=i,oo=a,n},Co=(e,t)=>So(e.length,n=>{for(let r of t)bo(e[n][r])}),wo=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),To=1024,Eo=e=>({current:-1,expressions:[],ranges:[],firstChild:[],lastChild:[],nextSibling:[],prefixes:[],isPart:[],isPrimed:[],isUnchanged:[],recursive:[],lets:[],roots:[],primary:[],secondary:[],covered:/* @__PURE__ */ new WeakSet,values:/* @__PURE__ */ new WeakMap,registers:new Uint8Array(e*To),relations:[]}),Do=(e,t,n,r,i)=>{let a=e.expressions.length;if(e.expressions.push(t),e.ranges.push(n),e.firstChild.push(-1),e.lastChild.push(-1),e.nextSibling.push(-1),e.prefixes.push(-1),e.isPart.push(i),e.isPrimed.push(!1),e.isUnchanged.push(t?.kind===`Unchanged`),e.recursive.push(-1),e.lets.push(void 0),e.roots.push(r===-1?a:e.roots[r]),e.primary.push(0),e.secondary.push(0),t&&e.covered.add(t),r===-1)return a;let o=e.lastChild[r];return o===-1&&(e.firstChild[r]=a),o!==-1&&(e.nextSibling[o]=a),e.lastChild[r]=a,a},Oo=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,ko=(e,t,n,r,i)=>{let a=t===`next`?Oo(e,t,r):void 0;if(a!==void 0)return a;let o=Do(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},Ao=(e,t)=>e!==void 0&&t!==void 0&&e.module===t.module&&e.start.line===t.start.line&&e.start.column===t.start.column&&e.end.line===t.end.line&&e.end.column===t.end.column,jo=(e,t,n)=>{let r=e===void 0?void 0:n.definitions.get(e),i=r?.kind===`Operator`?r.head:void 0,a=t.location.range;return!r||!i?`Action ${a?g(a):`Unknown location`}`:Ao(r.body.location.range,a)||!a?`${r.name} ${g(i)}`:`${r.name} ${g(i)} (${a.start.line} ${a.start.column} ${a.end.line} ${a.end.column})`},Mo=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,No=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,Po=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},Fo=e=>{let t=Array.from({length:11},()=>[]);return e.forEach((e,n)=>{if(n>=Math.floor(t.length*.75)){let e=Array.from({length:t.length*2+1},()=>[]);for(let n=t.length-1;n>=0;n--)t[n].forEach(t=>e[(gt(t.name)&2147483647)%e.length].unshift(t));t=e}t[(gt(e.name)&2147483647)%t.length].unshift(e)}),t.toReversed().flat()},Io=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),Lo=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),Ro=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),zo=(e,t,n)=>{let r=new Set(n.map(Mo)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(M(e)){for(let e=r;e;e=e.parent)if(e.name===n)return e.definition&&{definition:e.definition,scope:e.scope};return}let i=t.substitutions.get(n)??n;if(t.variableIndex.has(i)||t.constants.has(i))return;let a=t.definitions.get(i),o=a?.location.range?.module??a?.body.location.range?.module;return a&&!wo.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=Do(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(Mo(n));let d=t&&s.get(t);if(d&&i.forEach(t=>{e.expressions[t]===d&&(e.lets[t]??=[]).push(u)}),l?.kind===`Operator`&&l.isRecursive){let t=i.findLast(e=>a[e]===l);t!==void 0&&(e.recursive[u]=t)}return a[u]=l,i.push(u),o(),i.pop(),u},u=e=>{let t=e.definition;if(o.includes(t))return;o.push(t);let n=t.kind===`Function`?Ro(t.bounds):t.params.map(e=>e.name);m(t.body,Lo(n,e.scope)),t.kind===`Function`&&Io(t.bounds).forEach(t=>m(t,e.scope)),o.pop()},d=e=>e?.definition.kind===`Operator`&&e.definition.params.length>0,f=(e,t,n,r)=>{if(e.kind===`Lambda`)m(e.body,Lo(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:case`Lambda`:m(e.body,Lo(e.params,t));return;case`Let`:{let n=e.definitions.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),Fo(e.definitions).forEach(e=>u({definition:e,scope:n})),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,No(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,Po(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,No(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,Lo(Ro(e.bounds),t)),r(Io(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,Lo(Ro(e.bounds),t)),r(Io(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,Lo(Ro([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,Lo(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,Lo(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}};e.relations.forEach(e=>{i.push(e.node),m(e.expression,void 0),i.pop()})},Bo=(e,t,n)=>{for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r]){if(e.expressions[r]===n)return r;if(e.isPart[r]){let t=Bo(e,r,n);if(t!==-1)return t}}return-1},Vo=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=Bo(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:Bo(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},Ho=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},Uo=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},Wo=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},Go=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},Ko=(e,t)=>t.forEach((t,n)=>{let r=xo([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*To+i;e.registers[o]=Math.max(e.registers[o],Go(a)+1)}),qo=(e,t)=>{let n=e.registers.subarray(t*To,(t+1)*To),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*To*To/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*To?a===0?i:To*Math.log(To/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},Jo=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},Yo=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>Jo(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},Xo=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},Zo=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],Qo=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},$o=(e,t)=>{let n=e.primary[t.node],r=e.secondary[t.node];return t.kind===`init`?{distinct:n,generated:n+r}:t.kind===`next`?{distinct:r,generated:n}:t.kind===`constraint`?{distinct:r,generated:n+r}:{distinct:0,generated:0}},es=(e,t)=>{let n=[],r=/* @__PURE__ */ new Map,i=t=>{let n=[],a={primary:e.primary[t],secondary:e.secondary[t]};return(a.primary>0||a.secondary>0||Zo(e,t))&&Xo(n,a),Qo(e,t).forEach(e=>i(e).forEach(e=>Xo(n,e))),r.set(t,n),n},a=(t,r,i,a)=>{let o=e.ranges[t];n.push({location:o?g(o):`Unknown location`,depth:r,count:i,cost:a})},o=(t,n)=>a(t,n,e.primary[t],e.secondary[t]),s=(t,n)=>{let c=Qo(e,t),l=[];c.forEach(e=>(r.get(e)??i(e)).forEach(e=>Xo(l,e)));let u={primary:e.primary[t],secondary:e.secondary[t]},d=Zo(e,t),f=e=>c.forEach(t=>s(t,e));if(e.isUnchanged[t]){let e=l.filter(e=>e.primary!==0||e.secondary!==0);e.length===0?o(t,n):a(t,n,Math.max(u.primary,Yo(e).primary),0);return}if(l.length===0){(u.primary!==0||d)&&o(t,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let e=l[0],r=e.primary===0&&e.secondary===0;if(e.primary<u.primary){o(t,n),f(n+1);return}if(!d&&p&&!r){a(t,n,e.primary,e.secondary);return}if(p&&r){d&&o(t,n),f(d?n+1:n);return}if(u.primary===e.primary&&u.secondary===e.secondary){o(t,n);return}}let m=!p||d;m&&o(t,n),f(m?n+1:n)};return Qo(e,t).forEach(e=>{i(e),s(e,0)}),n},ts=[`init`,`next`,`invariant`,`constraint`,`implied`],ns=(e,t)=>!e||!t?e?1:t?-1:0:e.module===t.module?e.start.line-t.start.line||e.start.column-t.start.column||e.end.line-t.end.line||e.end.column-t.end.column:e.module<t.module?-1:1,rs=e=>ts.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>ns(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||ns(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),is=(e,t,n,r)=>({variables:r.map(r=>{let i=n[r]?.range;return{label:`${t.variables[r]} ${i?g(i):`Unknown location`}`,distinct:qo(e,r)}}),relations:rs(e).map(t=>({kind:t.kind,label:t.label,...$o(e,t),expressions:es(e,t.node)}))}),as=(e,t,n)=>{let r=Oo(e,t,n);if(r===void 0)return;let i=e.primary[r],a=e.secondary[r];if(t===`init`)return[[`generated`,i+a],[`distinct`,i]];if(t===`next`)return[[`generated`,i],[`distinct`,a]];let o=e.firstChild[r];return[[`count`,o===-1?i:e.primary[o]]]},os=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),ss=(e,n)=>os.has(e)?new w(n):new t(n),cs=(e,n,r,i)=>new t(`The ${e} argument of ${n} should be a ${r}, but instead it is:\n${L(i)}`),ls=(e,n,r=e)=>{if(!ln(e)||Wn(e))throw new t(`Applying ${n} to the following value,\nwhich is not a finite set:\n${L(r)}`);return F(e)},us=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||us(r))throw ss(n,`${n} expects a value as argument ${t+1}`);return r},ds=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw ss(n,`${n} expects a boolean but received ${L(r)}`);return r},fs=(e,t,n)=>{let r=e[t];if(r===void 0||!us(r))throw ss(n,`${n} expects an operator as argument ${t+1}`);return r},ps=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),z=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),ms=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),hs=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),gs=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),_s=e=>e>2147483647||e<-2147483648,vs=e=>new t(`Overflow when computing ${e}`),ys={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`},bs={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},xs={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`},Ss={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Cs=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return bs[e.operator];if(e.kind!==`Function`)return ys[e.kind];let t=sr(e);return t===void 0?`FcnRcdValue`:Ss[t]},ws=e=>xs[Cs(e)],Ts=(e,t)=>new w(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Es=(e,n)=>{let r=r=>(...i)=>{let a=Ui.sets?.length??0;try{return r(...i)}catch(r){if(!(r instanceof w)||r instanceof T)throw r;let i=Gi(a);throw Ui.sets&&(Ui.sets.length=a),e.isLazy!==!0&&r instanceof t&&!i?r:Ts(n,r.message)}},i=r(e.evaluate);return{...e,evaluate:(t,r)=>{if(t.length!==e.arity)throw Ts(n,`array is not of length ${e.arity}`);return i(t,r)},evaluateUnary:e.evaluateUnary&&r(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&r(e.evaluateBinary)}},Ds=(e,t)=>{if(typeof e!=`number`)throw Ts(t,`Cannot cast tlc2.value.impl.${Cs(e)} to tlc2.value.impl.IntValue`);return e},Os=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,ks=(e,t,n,r)=>{let i=Os(e,n,`IntValue`,2);return gs(t,(e,n)=>{let a=Ds(n,i),o=Ds(e,i),s=r(o,a);if(_s(s))throw vs(`${o}${t}${a}`);return s})},As=(e,n,r)=>{if(typeof e!=`number`)throw new t(`The ${n} argument of ${r} should be an integer, but instead it is:\n${L(e)}`);return e},js=(e,t,n=e)=>gs(e,(e,r)=>t(As(e,`first`,n),As(r,`second`,n))),Ms=(e,t,n)=>({...hs(e,t,n),isLazy:!0}),Ns=(e,t,n)=>{let r=fs(e,t,n);return()=>r.call([])},Ps=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),Fs=()=>({implication:r_,negate:i_,equivalent:a_,body:o_,condition:(e,t)=>{if(typeof e!=`boolean`)throw Bg(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw Vg(t,n,e);return e},apply:la,expectFunction:$g,tuple:ui,set:Jr,record:fi,writtenRecord:xn,equal:hr,enumerate:p_,choiceElements:Bv,noChoice:e=>{throw Vv(e)},filterPredicate:zv,isReducible:un,finiteElements:e=>F(e).elements,addBounded:on,normalizedSet:rr,isBeyondBound:sn,cardinality:Ii,functionDomain:ci,sortedFunction:ir,unassigned:(e,t)=>{throw Jg(e,t)},prime:lv,keepLazyContext:e_,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>Zg(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let Is,Ls;const Rs=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},zs=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Bs=e=>`local${e.counter++}`,Vs=(e,t=/* @__PURE__ */ new Set)=>{let n=ht(e);return n!==void 0&&t.add(n),mt(e).forEach(e=>Vs(e,t)),t},Hs=(e,t,n)=>{let r=Vs(t),i=[...n.locals].filter(e=>r.has(e[0]));if(i.length===0)return n.context;let a=zs(e,i.map(e=>e[0]));return`extend(${n.context}, ${a}, [${i.map(e=>e[1]).join(`, `)}])`},Us=(e,t,n)=>`${zs(e,vv(t,e.environment))}(${Hs(e,t,n)})`,Ws=(e,t,n)=>{let r=`helper${e.counter++}`,i=[...t.locals.values()],a={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(t.locals)},o=i.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${r}(context, state, next${o}) { let primed; let applied; ${n(a)} }`),`${r}(${t.context}, ${t.state}, ${t.isPrimed?`undefined`:t.next}${o})`},Gs=(e,t,n,r)=>{let i=Bs(e),a=Bs(e),o=Bs(e);return`for (let ${i} = 0, ${a} = ${t}.low, ${o} = ${a} === undefined ? ${t}.length : ${t}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${t}[${i}] : ${a} + ${i}; ${r} }`},Ks=(e,t,n)=>{let r=t.kind===`Forall`;return Ws(e,n,n=>{let i=t.bounds.map(()=>Bs(e)),a=t.bounds.map((r,a)=>a>0&&t.bounds[a-1].set===r.set?`const ${i[a]} = ${i[a-1]};`:`const ${i[a]} = enumerate(${$s(e,r.set,n)}, ${zs(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=Bs(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${$s(e,t.body,n)}, ${zs(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>Gs(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},qs=(e,t,n,r,i)=>Ws(e,i,i=>{let a=Bs(e),o=Bs(e),s=zs(e,t),c=`choiceElements(${$s(e,n,i)}, ${s}, ${zs(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${$s(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${Gs(e,a,o,l)} return noChoice(${s});`}),Js=(e,t,n,r)=>Ws(e,r,r=>{let i=Bs(e),a=Bs(e),o=Bs(e),s=Bs(e),c=zs(e,t),l=`if (!isReducible(${i})) return ${zs(e,Rv(t,e.environment))}(${i}, ${Hs(e,t,r)});`,u=$s(e,t.bound.set,r);r.locals.set(n,s);let d=`if (filterPredicate(${$s(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${Gs(e,a,s,d)} return normalizedSet(${o});`}),Ys=(e,t,n,r)=>Ws(e,r,r=>{let i=Bs(e),a=Bs(e),o=Bs(e),s=Bs(e),c=Bs(e),l=Bs(e),u=zs(e,Fv(t,e.environment)),d=Hs(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=$s(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${$s(e,t.body,r)}; if (!${a}) ${s}.push(${l});`;return`const ${i} = ${p}; ${f} const ${a} = isBeyondBound(${i}); const ${o} = ${a} ? ${i} : functionDomain(${i}); if (${a}) cardinality(${i}); const ${s} = []; ${Gs(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),Xs=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=$s(e,r[0],n),a=$s(e,r[1],n),o=zs(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${$s(e,r[0],n)}, ${zs(e,t)})`;if(t.operator===`<=>`)return`equivalent(${$s(e,r[0],n)}, ${$s(e,r[1],n)}, ${zs(e,t)})`;if(M(t))return Us(e,t,n);let i=B_(t.operator,e.environment);if(i?.kind!==`Builtin`)return Us(e,t,n);if(i.name===`DOMAIN`)return`${zs(e,Wg(t))}(${$s(e,r[0],n)})`;if(i.name===`TLCEval`)return Us(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${zs(e,Gg(t,i))}(${$s(e,r[0],n)}, ${$s(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&xv(r[0],a))return`${zs(e,i.evaluateUnary)}(${$s(e,r[0],n)})`;let o=r.length===2&&xv(r[0],a)&&xv(r[1],a);return i.evaluateBinary&&o?`${zs(e,i.evaluateBinary)}(${$s(e,r[0],n)}, ${$s(e,r[1],n)})`:Us(e,t,n)},Zs=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(M(e))return!1;let r=Z_(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Zs(e.expression,t,n);case`FieldAccess`:return Zs(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Zs(e,t,n));default:return!1}},Qs=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Qs(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Qs);default:return!1}},$s=(e,t,n)=>{let r=(t,r=n)=>$s(e,t,r);switch(t.kind){case`Number`:return hn(t.value)?String(t.value):Us(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(M(t))return Us(e,t,n);let i=Z_(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=zs(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?zs(e,i.value):Us(e,t,n)}case`Apply`:return Xs(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=zs(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${zs(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Av(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Zs(t.function,n,e.environment)?r(t.function):Qs(t.function)?r(t.function,i):Us(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${zs(e,t)}))`,o=Ug(e.environment.runtime.version),s=o?`, ${zs(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${zs(e,Hg(t))}(${r(t.record)})`;case`Record`:{let i=Uv(t.fields);if(Wv(i))return Us(e,t,n);let a=zs(e,i.map(e=>e.name)),o=`[${t.fields.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}, ${zs(e,i.map(e=>t.fields.indexOf(e)))}, ${o}, ${zs(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:return n.isPrimed?Us(e,t,n):r(t.expression,{context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals});case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?Ks(e,t,n):Us(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?qs(e,t,t.set,t.pattern.name,n):Us(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!Pv(t)?Ys(e,t,r.pattern.name,n):Us(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?Js(e,t,t.bound.pattern.name,n):Us(e,t,n);default:return Us(e,t,n)}},ec=(e,t)=>{if(!Ps.has(e.kind)||(Ls??=Rs(),!Ls))return;let n={environment:t,references:[],helpers:[],counter:0},r=$s(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
|
|
77
|
-
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return
|
|
76
|
+
`;if(typeof o!=`string`)throw new _(`The _format field of the ALIAS ${i} is ${L(o)}, but it must be a string.`);return r.filter(e=>!(a&&e[0]===`_format`)).filter(e=>!t||!Ka(t[e[0]],e[1])).map(e=>{let t=Ja(o,[e[0],N(L(e[1]))]);if(t===void 0)throw new _(`The _format field of the ALIAS ${i} is ${L(o)}, but it must format two strings, the name and the value of a field.`);return t}).join(``)},Xa=[10454148508367108822n,15747411856486957441n,13848313129918172575n,15427004735118145554n,14338780731064426356n,15931650522396165332n,17670238537108149059n,12816660938095048951n,13192168525635896882n,16119298732711755075n,13564417994159519395n,15831473429641889162n,17671735485712653535n,14582471876431321160n,9288673424107444897n,12345523232675890545n,13774063780198914517n,10636128657019767374n,13227535641082688945n,10085966873248490402n,17056045221983369811n,18027133543548002442n,13033986364717636900n,12663388180492401538n,11007194744055901935n,16251515628090973732n,18046429724439772544n,9876734796024595817n,14949643787442512870n,16960057143726945461n,10590203213448744021n,12248592797044284137n,9558805810925624286n,16993321702164258530n,11754329512098378960n,12074934892440206921n,15696745233288286746n,10531590977001201739n,18107999685377398317n,12149369488538049728n,12923655455904407421n,10507099144397364930n,17322088528956367024n,14653973644796244054n,15165509594857513400n,13554280709034297251n,16228911470502883382n,17115369786458865383n,11179220607102683830n,16708422618246866334n,12295941796329322556n,18336630348474106240n,13989616001589685348n,14822072159597151759n,14264172520427195041n,11642530518213145397n,11877331515501935358n,13913116192159715440n,17054474839259161580n,13461230878584418056n,16058025410470398786n,11100471369705097435n,11133782763824505275n,13192312712502684421n,17456091706045076157n,13237272598629075916n,12914531898895761383n,15801841604014567326n,16446055517513626294n,16780923767715884464n,15104658705803254918n,10882049990920163451n,12728112724252049190n,11720209067562733740n,16476221075563830086n,16602801460297162326n,16206898064012585915n,12158475401238648099n,13742285336487677729n,15543703592025073839n,9615783578189153721n,16710542608962839044n,11960730242263336692n,13328718558362718101n,12971616006464047952n,17057853503483465676n,16180230282101315295n,15483523553568578902n,17773465781871025571n,18047252642493037509n,11580640560664688668n,10121963531818974651n,14218267149826330657n,12715294421139777506n,10584764766358778171n,12666843443693621286n,17403948736867619210n,17907955559063099692n,15179434392748515198n,15413469521140985247n,13455040338347572751n,15419348191054617477n,12340568220039846914n,13236419189535069162n,18074463254581147189n,10818750974828329405n,9859349269386152082n,15035006154709018396n,13627907273947709876n,9549035931546940138n,16199589727945564820n,10285831968679942330n,17737018494601061698n,15477896647372134857n,13595764249822586512n,10556855812148546550n,12421897615105552821n,15477767459253848096n,17421607461439241175n,12409061346569762725n,13621778224251023638n,10680972825126675886n,16494492050207190715n,16801324317763555620n,12664650400804916358n,16134230614391269483n,10027806175083075147n,9259037851175017999n,11803214621941906429n,9537357587847606069n,10517495000576890277n];let Za=Xa[0];const Qa=()=>Za,$a=/* @__PURE__ */ new Int32Array(256),eo=/* @__PURE__ */ new Int32Array(256),to=/* @__PURE__ */ new Int32Array(256),no=/* @__PURE__ */ new Int32Array(256),ro=/* @__PURE__ */ new Int32Array(256),io=/* @__PURE__ */ new Int32Array(256),ao=/* @__PURE__ */ new Int32Array(256),oo=/* @__PURE__ */ new Int32Array(256);let so=0,co=0,lo=0,uo=0;const fo=e=>{let t=(e^uo)&255;uo=(uo>>>8|lo<<24)^ro[t],lo=lo>>>8^$a[t]},po=e=>{let t=Xa[e];Za=t;let n=[];for(let e=1n<<63n;n.length<72;)n.push(e),e=e>>1n^((e&1n)==0n?0n:t);let r=n.slice(64,72).reverse();for(let e=0;e<256;e++){let t=r.reduce((t,n,r)=>e>>r&1?t^n:t,0n);$a[e]=Number(BigInt.asIntN(32,t>>32n)),ro[e]=Number(BigInt.asIntN(32,t))}let i=[$a,eo,to,no],a=[ro,io,ao,oo];for(let e=1;e<4;e++){let t=i[e-1],n=a[e-1];for(let r=0;r<256;r++){let o=n[r]&255;a[e][r]=(n[r]>>>8|t[r]<<24)^ro[o],i[e][r]=t[r]>>>8^$a[o]}}so=Number(BigInt.asIntN(32,t>>32n)),co=Number(BigInt.asIntN(32,t))};po(0);const mo=e=>{let t=uo^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;uo=lo^oo[n]^ao[r]^io[i]^ro[a],lo=no[n]^to[r]^eo[i]^$a[a]},ho=e=>{if(typeof e==`boolean`)return fo(0),fo(e?116:102),2;if(typeof e==`number`)return fo(1),mo(e),5;if(typeof e==`string`){fo(3),mo(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)mo(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)fo(e.charCodeAt(n));return 5+e.length}return fo(21),mo(Wn(e.name)+1),5},go=e=>{let t=lo,n=uo;lo=0,uo=0;let r=[ho(e),lo,uo];return lo=t,uo=n,r},_o=e=>`m = (${e} ^ l) & 255; l = ((l >>> 8) | (h << 24)) ^ L0[m]; h = (h >>> 8) ^ H0[m];`,vo=e=>`m = l ^ ${e}; l = h ^ L3[m & 255] ^ L2[(m >>> 8) & 255] ^ L1[(m >>> 16) & 255] ^ L0[m >>> 24]; h = H3[m & 255] ^ H2[(m >>> 8) & 255] ^ H1[(m >>> 16) & 255] ^ H0[m >>> 24];`,yo={integer:e=>`${_o(`1`)} ${vo(e)}`,boolean:e=>`${_o(`0`)} ${_o(`(${e} ? 116 : 102)`)}`,set:e=>`${_o(`5`)} ${vo(e)}`,function:e=>`${_o(`9`)} ${vo(e)}`,scalar:(e,t,n)=>`{ let r = ${e}; for (; r >= 4; r -= 4) { ${vo(`0`)} } for (; r > 0; r--) { ${_o(`0`)} } h ^= ${t}; l ^= ${n}; }`},bo=()=>({H0:$a,H1:eo,H2:to,H3:no,L0:ro,L1:io,L2:ao,L3:oo,initialHigh:so,initialLow:co}),xo=(e,t)=>{let n=lo,r=uo;uo=e[0],lo=e[1],wo(t),e[0]=uo,e[1]=lo,lo=n,uo=r},So=e=>{fo(5),mo(e)},Co=e=>{fo(9),mo(e)},wo=e=>{if(typeof e!=`object`||mn(e))ho(e);else if(pn(e)){let t=I(e);Co(t.domain.length);for(let e=0;e<t.domain.length;e++)wo(t.domain[e]),wo(t.range[e])}else{let t=F(e).elements;So(t.length);for(let e of t)wo(e)}},To=e=>{let t=lo,n=uo;lo=so,uo=co;for(let t of e)wo(t);let r=BigInt(lo>>>0)<<32n|BigInt(uo>>>0);return lo=t,uo=n,r},Eo=(e,t)=>{let n=new BigInt64Array(e),r=new Int32Array(n.buffer),i=lo,a=uo;for(let n=0;n<e;n++)lo=so,uo=co,t(n),r[2*n]=uo,r[2*n+1]=lo;return lo=i,uo=a,n},Do=(e,t)=>Eo(e.length,n=>{for(let r of t)wo(e[n][r])}),Oo=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),ko=1024,Ao=e=>({current:-1,expressions:[],ranges:[],firstChild:[],lastChild:[],nextSibling:[],prefixes:[],isPart:[],isPrimed:[],isUnchanged:[],recursive:[],lets:[],roots:[],primary:[],secondary:[],covered:/* @__PURE__ */ new WeakSet,values:/* @__PURE__ */ new WeakMap,registers:new Uint8Array(e*ko),relations:[]}),jo=(e,t,n,r,i)=>{let a=e.expressions.length;if(e.expressions.push(t),e.ranges.push(n),e.firstChild.push(-1),e.lastChild.push(-1),e.nextSibling.push(-1),e.prefixes.push(-1),e.isPart.push(i),e.isPrimed.push(!1),e.isUnchanged.push(t?.kind===`Unchanged`),e.recursive.push(-1),e.lets.push(void 0),e.roots.push(r===-1?a:e.roots[r]),e.primary.push(0),e.secondary.push(0),t&&e.covered.add(t),r===-1)return a;let o=e.lastChild[r];return o===-1&&(e.firstChild[r]=a),o!==-1&&(e.nextSibling[o]=a),e.lastChild[r]=a,a},Mo=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,No=(e,t,n,r,i)=>{let a=t===`next`?Mo(e,t,r):void 0;if(a!==void 0)return a;let o=jo(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},Po=(e,t)=>e!==void 0&&t!==void 0&&e.module===t.module&&e.start.line===t.start.line&&e.start.column===t.start.column&&e.end.line===t.end.line&&e.end.column===t.end.column,Fo=(e,t,n)=>{let r=e===void 0?void 0:n.definitions.get(e),i=r?.kind===`Operator`?r.head:void 0,a=t.location.range;return!r||!i?`Action ${a?g(a):`Unknown location`}`:Po(r.body.location.range,a)||!a?`${r.name} ${g(i)}`:`${r.name} ${g(i)} (${a.start.line} ${a.start.column} ${a.end.line} ${a.end.column})`},Io=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,Lo=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,Ro=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},zo=e=>{let t=Array.from({length:11},()=>[]);return e.forEach((e,n)=>{if(n>=Math.floor(t.length*.75)){let e=Array.from({length:t.length*2+1},()=>[]);for(let n=t.length-1;n>=0;n--)t[n].forEach(t=>e[(gt(t.name)&2147483647)%e.length].unshift(t));t=e}t[(gt(e.name)&2147483647)%t.length].unshift(e)}),t.toReversed().flat()},Bo=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),Vo=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),Ho=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),Uo=(e,t,n)=>{let r=new Set(n.map(Io)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(M(e)){for(let e=r;e;e=e.parent)if(e.name===n)return e.definition&&{definition:e.definition,scope:e.scope};return}let i=t.substitutions.get(n)??n;if(t.variableIndex.has(i)||t.constants.has(i))return;let a=t.definitions.get(i),o=a?.location.range?.module??a?.body.location.range?.module;return a&&!Oo.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=jo(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(Io(n));let d=t&&s.get(t);if(d&&i.forEach(t=>{e.expressions[t]===d&&(e.lets[t]??=[]).push(u)}),l?.kind===`Operator`&&l.isRecursive){let t=i.findLast(e=>a[e]===l);t!==void 0&&(e.recursive[u]=t)}return a[u]=l,i.push(u),o(),i.pop(),u},u=e=>{let t=e.definition;if(o.includes(t))return;o.push(t);let n=t.kind===`Function`?Ho(t.bounds):t.params.map(e=>e.name);m(t.body,Vo(n,e.scope)),t.kind===`Function`&&Bo(t.bounds).forEach(t=>m(t,e.scope)),o.pop()},d=e=>e?.definition.kind===`Operator`&&e.definition.params.length>0,f=(e,t,n,r)=>{if(e.kind===`Lambda`)m(e.body,Vo(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:case`Lambda`:m(e.body,Vo(e.params,t));return;case`Let`:{let n=e.definitions.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),zo(e.definitions).forEach(e=>u({definition:e,scope:n})),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,Lo(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,Ro(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,Lo(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,Vo(Ho(e.bounds),t)),r(Bo(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,Vo(Ho(e.bounds),t)),r(Bo(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,Vo(Ho([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,Vo(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,Vo(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}};e.relations.forEach(e=>{i.push(e.node),m(e.expression,void 0),i.pop()})},Wo=(e,t,n)=>{for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r]){if(e.expressions[r]===n)return r;if(e.isPart[r]){let t=Wo(e,r,n);if(t!==-1)return t}}return-1},Go=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=Wo(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:Wo(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},Ko=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},qo=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},Jo=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},Yo=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},Xo=(e,t)=>t.forEach((t,n)=>{let r=To([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*ko+i;e.registers[o]=Math.max(e.registers[o],Yo(a)+1)}),Zo=(e,t)=>{let n=e.registers.subarray(t*ko,(t+1)*ko),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*ko*ko/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*ko?a===0?i:ko*Math.log(ko/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},Qo=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},$o=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>Qo(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},es=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},ts=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],ns=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},rs=(e,t)=>{let n=e.primary[t.node],r=e.secondary[t.node];return t.kind===`init`?{distinct:n,generated:n+r}:t.kind===`next`?{distinct:r,generated:n}:t.kind===`constraint`?{distinct:r,generated:n+r}:{distinct:0,generated:0}},is=(e,t)=>{let n=[],r=/* @__PURE__ */ new Map,i=t=>{let n=[],a={primary:e.primary[t],secondary:e.secondary[t]};return(a.primary>0||a.secondary>0||ts(e,t))&&es(n,a),ns(e,t).forEach(e=>i(e).forEach(e=>es(n,e))),r.set(t,n),n},a=(t,r,i,a)=>{let o=e.ranges[t];n.push({location:o?g(o):`Unknown location`,depth:r,count:i,cost:a})},o=(t,n)=>a(t,n,e.primary[t],e.secondary[t]),s=(t,n)=>{let c=ns(e,t),l=[];c.forEach(e=>(r.get(e)??i(e)).forEach(e=>es(l,e)));let u={primary:e.primary[t],secondary:e.secondary[t]},d=ts(e,t),f=e=>c.forEach(t=>s(t,e));if(e.isUnchanged[t]){let e=l.filter(e=>e.primary!==0||e.secondary!==0);e.length===0?o(t,n):a(t,n,Math.max(u.primary,$o(e).primary),0);return}if(l.length===0){(u.primary!==0||d)&&o(t,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let e=l[0],r=e.primary===0&&e.secondary===0;if(e.primary<u.primary){o(t,n),f(n+1);return}if(!d&&p&&!r){a(t,n,e.primary,e.secondary);return}if(p&&r){d&&o(t,n),f(d?n+1:n);return}if(u.primary===e.primary&&u.secondary===e.secondary){o(t,n);return}}let m=!p||d;m&&o(t,n),f(m?n+1:n)};return ns(e,t).forEach(e=>{i(e),s(e,0)}),n},as=[`init`,`next`,`invariant`,`constraint`,`implied`],os=(e,t)=>!e||!t?e?1:t?-1:0:e.module===t.module?e.start.line-t.start.line||e.start.column-t.start.column||e.end.line-t.end.line||e.end.column-t.end.column:e.module<t.module?-1:1,ss=e=>as.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>os(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||os(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),cs=(e,t,n,r)=>({variables:r.map(r=>{let i=n[r]?.range;return{label:`${t.variables[r]} ${i?g(i):`Unknown location`}`,distinct:Zo(e,r)}}),relations:ss(e).map(t=>({kind:t.kind,label:t.label,...rs(e,t),expressions:is(e,t.node)}))}),ls=(e,t,n)=>{let r=Mo(e,t,n);if(r===void 0)return;let i=e.primary[r],a=e.secondary[r];if(t===`init`)return[[`generated`,i+a],[`distinct`,i]];if(t===`next`)return[[`generated`,i],[`distinct`,a]];let o=e.firstChild[r];return[[`count`,o===-1?i:e.primary[o]]]},us=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),ds=(e,n)=>us.has(e)?new w(n):new t(n),fs=(e,n,r,i)=>new t(`The ${e} argument of ${n} should be a ${r}, but instead it is:\n${N(L(i))}`),ps=(e,n,r=e)=>{if(!dn(e)||Kn(e))throw new t(`Applying ${n} to the following value,\nwhich is not a finite set:\n${N(L(r))}`);return F(e)},ms=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||ms(r))throw ds(n,`${n} expects a value as argument ${t+1}`);return r},hs=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw ds(n,`${n} expects a boolean but received ${L(r)}`);return r},gs=(e,t,n)=>{let r=e[t];if(r===void 0||!ms(r))throw ds(n,`${n} expects an operator as argument ${t+1}`);return r},_s=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),z=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),vs=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),ys=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),bs=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),xs=e=>e>2147483647||e<-2147483648,Ss=e=>new t(`Overflow when computing ${e}`),Cs={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`},ws={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Ts={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`},Es={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Ds=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return ws[e.operator];if(e.kind!==`Function`)return Cs[e.kind];let t=lr(e);return t===void 0?`FcnRcdValue`:Es[t]},Os=e=>Ts[Ds(e)],ks=(e,t)=>new w(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),As=(e,n)=>{let r=r=>(...i)=>{let a=Gi.sets?.length??0;try{return r(...i)}catch(r){if(!(r instanceof w)||r instanceof T)throw r;let i=qi(a);throw Gi.sets&&(Gi.sets.length=a),e.isLazy!==!0&&r instanceof t&&!i?r:ks(n,r.message)}},i=r(e.evaluate);return{...e,evaluate:(t,r)=>{if(t.length!==e.arity)throw ks(n,`array is not of length ${e.arity}`);return i(t,r)},evaluateUnary:e.evaluateUnary&&r(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&r(e.evaluateBinary)}},js=(e,t)=>{if(typeof e!=`number`)throw ks(t,`Cannot cast tlc2.value.impl.${Ds(e)} to tlc2.value.impl.IntValue`);return e},Ms=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Ns=(e,t,n,r)=>{let i=Ms(e,n,`IntValue`,2);return bs(t,(e,n)=>{let a=js(n,i),o=js(e,i),s=r(o,a);if(xs(s))throw Ss(`${o}${t}${a}`);return s})},Ps=(e,n,r)=>{if(typeof e!=`number`)throw new t(`The ${n} argument of ${r} should be an integer, but instead it is:\n${N(L(e))}`);return e},Fs=(e,t,n=e)=>bs(e,(e,r)=>t(Ps(e,`first`,n),Ps(r,`second`,n))),Is=(e,t,n)=>({...ys(e,t,n),isLazy:!0}),Ls=(e,t,n)=>{let r=gs(e,t,n);return()=>r.call([])},Rs=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),zs=()=>({implication:d_,negate:f_,equivalent:p_,body:m_,condition:(e,t)=>{if(typeof e!=`boolean`)throw Jg(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw Yg(t,n,e);return e},apply:pa,expectFunction:s_,tuple:fi,set:Xr,record:mi,writtenRecord:Cn,equal:_r,enumerate:x_,choiceElements:Jv,noChoice:e=>{throw Yv(e)},filterPredicate:qv,isReducible:fn,finiteElements:e=>F(e).elements,addBounded:cn,normalizedSet:ar,isBeyondBound:ln,cardinality:Ri,functionDomain:ui,sortedFunction:or,unassigned:(e,t)=>{throw n_(e,t)},prime:_v,keepLazyContext:c_,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>a_(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let Bs,Vs;const Hs=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Us=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Ws=e=>`local${e.counter++}`,Gs=(e,t=/* @__PURE__ */ new Set)=>{let n=ht(e);return n!==void 0&&t.add(n),mt(e).forEach(e=>Gs(e,t)),t},Ks=(e,t,n,r=!1)=>{let i=Gs(t),a=[...n.locals].filter(e=>r||i.has(e[0]));if(a.length===0)return n.context;let o=Us(e,a.map(e=>e[0]));return`extend(${n.context}, ${o}, [${a.map(e=>e[1]).join(`, `)}])`},qs=(e,t,n,r=!1)=>`${Us(e,Ev(t,e.environment))}(${Ks(e,t,n,r)})`,Js=(e,t,n)=>{let r=`helper${e.counter++}`,i=[...t.locals.values()],a={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(t.locals)},o=i.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${r}(context, state, next${o}) { let primed; let applied; ${n(a)} }`),`${r}(${t.context}, ${t.state}, ${t.isPrimed?`undefined`:t.next}${o})`},Ys=(e,t,n,r)=>{let i=Ws(e),a=Ws(e),o=Ws(e);return`for (let ${i} = 0, ${a} = ${t}.low, ${o} = ${a} === undefined ? ${t}.length : ${t}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${t}[${i}] : ${a} + ${i}; ${r} }`},Xs=(e,t,n)=>{let r=t.kind===`Forall`;return Js(e,n,n=>{let i=t.bounds.map(()=>Ws(e)),a=t.bounds.map((r,a)=>a>0&&t.bounds[a-1].set===r.set?`const ${i[a]} = ${i[a-1]};`:`const ${i[a]} = enumerate(${rc(e,r.set,n)}, ${Us(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=Ws(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${rc(e,t.body,n)}, ${Us(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>Ys(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},Zs=(e,t,n,r,i)=>Js(e,i,i=>{let a=Ws(e),o=Ws(e),s=Us(e,t),c=`choiceElements(${rc(e,n,i)}, ${s}, ${Us(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${rc(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${Ys(e,a,o,l)} return noChoice(${s});`}),Qs=(e,t,n,r)=>Js(e,r,r=>{let i=Ws(e),a=Ws(e),o=Ws(e),s=Ws(e),c=Us(e,t),l=`if (!isReducible(${i})) return ${Us(e,Kv(t,e.environment))}(${i}, ${Ks(e,t,r)});`,u=rc(e,t.bound.set,r);r.locals.set(n,s);let d=`if (filterPredicate(${rc(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${Ys(e,a,s,d)} return normalizedSet(${o});`}),$s=(e,t,n,r)=>Js(e,r,r=>{let i=Ws(e),a=Ws(e),o=Ws(e),s=Ws(e),c=Ws(e),l=Ws(e),u=Us(e,Uv(t,e.environment)),d=Ks(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=rc(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${rc(e,t.body,r)}; if (!${a}) ${s}.push(${l});`;return`const ${i} = ${p}; ${f} const ${a} = isBeyondBound(${i}); const ${o} = ${a} ? ${i} : functionDomain(${i}); if (${a}) cardinality(${i}); const ${s} = []; ${Ys(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),ec=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=rc(e,r[0],n),a=rc(e,r[1],n),o=Us(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${rc(e,r[0],n)}, ${Us(e,t)})`;if(t.operator===`<=>`)return`equivalent(${rc(e,r[0],n)}, ${rc(e,r[1],n)}, ${Us(e,t)})`;if(M(t))return qs(e,t,n);let i=J_(t.operator,e.environment);if(i?.kind!==`Builtin`)return qs(e,t,n);if(i.name===`DOMAIN`)return`${Us(e,Qg(t))}(${rc(e,r[0],n)})`;if(i.name===`TLCEval`)return qs(e,t,n,!0);if(i.name===`\\subseteq`&&r.length===2)return`${Us(e,$g(t,i))}(${rc(e,r[0],n)}, ${rc(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&kv(r[0],a))return`${Us(e,i.evaluateUnary)}(${rc(e,r[0],n)})`;let o=r.length===2&&kv(r[0],a)&&kv(r[1],a);return i.evaluateBinary&&o?`${Us(e,i.evaluateBinary)}(${rc(e,r[0],n)}, ${rc(e,r[1],n)})`:qs(e,t,n)},tc=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(M(e))return!1;let r=av(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return tc(e.expression,t,n);case`FieldAccess`:return tc(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>tc(e,t,n));default:return!1}},nc=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return nc(e.record);case`FunctionApplication`:return[e.function,...e.args].every(nc);default:return!1}},rc=(e,t,n)=>{let r=(t,r=n)=>rc(e,t,r);switch(t.kind){case`Number`:return _n(t.value)?String(t.value):qs(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(M(t))return qs(e,t,n);let i=av(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Us(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Us(e,i.value):qs(e,t,n)}case`Apply`:return ec(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=Us(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${Us(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Rv(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${tc(t.function,n,e.environment)?r(t.function):nc(t.function)?r(t.function,i):qs(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Us(e,t)}))`,o=Zg(e.environment.runtime.version),s=o?`, ${Us(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${Us(e,Xg(t))}(${r(t.record)})`;case`Record`:{let i=Zv(t.fields);if(Qv(i))return qs(e,t,n);let a=Us(e,i.map(e=>e.name)),o=`[${t.fields.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}, ${Us(e,i.map(e=>t.fields.indexOf(e)))}, ${o}, ${Us(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:return n.isPrimed?qs(e,t,n):r(t.expression,{context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals});case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?Xs(e,t,n):qs(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?Zs(e,t,t.set,t.pattern.name,n):qs(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!Hv(t)?$s(e,t,r.pattern.name,n):qs(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?Qs(e,t,t.bound.pattern.name,n):qs(e,t,n);default:return qs(e,t,n)}},ic=(e,t)=>{if(!Rs.has(e.kind)||(Vs??=Hs(),!Vs))return;let n={environment:t,references:[],helpers:[],counter:0},r=rc(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
|
|
77
|
+
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return Bs??=zs(),Function(...Object.keys(Bs),...i,a)(...Object.values(Bs),...n.references)},ac=/* @__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(`,`),oc=[[`\\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`,`≀`],[`^+`,`⁺`]],sc=new Map(oc.flatMap(e=>e.slice(1).map(t=>[t,e[0]]))),cc=e=>e.split(`!`).map(e=>sc.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),lc=/* @__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(`,`),uc=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs.beginLine.beginColumn.endLine.endColumn.module.name.location.context.parameters._action`.split(`.`),dc=/* @__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(`.`),fc=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
78
78
|
Nat == { }
|
|
79
79
|
a+b == {a, b}
|
|
80
80
|
a-b == CHOOSE n : b + n = a
|
|
@@ -390,18 +390,18 @@ _CheckName(name) ==
|
|
|
390
390
|
=> (PrintT(counts) /\\ FALSE)
|
|
391
391
|
_PrintCounts == PrintT(_Counts)
|
|
392
392
|
=============================================================================
|
|
393
|
-
`]]),lc=/* @__PURE__ */ new Map([[`Bags`,/* @__PURE__ */ new Map([[`IsABag`,`public static tlc2.value.IBoolValue tlc2.module.Bags.IsABag(tlc2.value.impl.Value)`],[`BagCardinality`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.BagCardinality(tlc2.value.impl.Value)`],[`BagIn`,`public static tlc2.value.IBoolValue tlc2.module.Bags.BagIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`CopiesIn`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.CopiesIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\oplus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagCup(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\ominus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagDiff(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagUnion`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagUnion(tlc2.value.impl.Value)`],[`\\sqsubseteq`,`public static tlc2.value.IBoolValue tlc2.module.Bags.SqSubseteq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagOfAll`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagOfAll(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagToSet`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagToSet(tlc2.value.impl.Value)`],[`SetToBag`,`public static tlc2.value.impl.Value tlc2.module.Bags.SetToBag(tlc2.value.impl.Value)`]])],[`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)`]])],[`TLCExt`,/* @__PURE__ */ new Map([[`AssertError`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`PickSuccessor`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`ToTrace`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.lassoOrdinal(tlc2.value.impl.Value)`],[`CounterExample`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.error(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`Trace`,`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`TLCDefer`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefer(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCNoOp`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcNoOp(tlc2.value.impl.Value)`],[`TLCModelValue`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.tlcModelValue(tlc2.value.impl.Value)`],[`TLCCache`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcEval2(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCFP`,`public static synchronized tlc2.value.impl.IntValue tlc2.module.TLCExt.tlcFingerprint(tlc2.value.impl.Value)`],[`TLCEvalDefinition`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefByName(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCGetOrDefault`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcGetOrDefault(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])]]),uc={kind:`Local`},dc=`$subexpression`,fc=/* @__PURE__ */ new WeakSet,pc=/* @__PURE__ */ new WeakMap,mc=/* @__PURE__ */ new WeakMap,hc=/* @__PURE__ */ new WeakMap,gc=/* @__PURE__ */ new WeakMap,_c=/* @__PURE__ */ new WeakMap,vc=/* @__PURE__ */ new WeakSet,yc=e=>e?.find(e=>vc.has(e.node))?.error,bc=/* @__PURE__ */ new WeakMap,xc=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Sc=new Map([...[`~>`,`-+->`,`\\cdot`,`\\X`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}]),[`'`,{key:`'`,arity:1,kind:`Builtin`}]]),Cc=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,wc=(e,t)=>Cc(e,t)?-1:+!!Cc(t,e),Tc=e=>e.kind===`Operator`?e.params.length:0,Ec=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Dc=e=>e.name.includes(`!`),Oc=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},kc=(e,t,n)=>{let r=t.bindings.get(e);return r&&Cc(r.position,t.location)&&(!n||Cc(r.position,n.start))?r:void 0},Ac=(e,t)=>e!==void 0&&t!==void 0&&g(e)===g(t),jc=(e,t,n,r)=>{if(t===void 0)return!0;if(Ac(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=g(i),o=t.range&&g(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${ic(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 '${ic(e)}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${ic(e)}. \nThis duplicates the one at ${o}.`}),!1},Mc=(e,t,n,r)=>jc(t,Oc(e,t)??kc(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Nc=(e,t,n)=>{jc(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Pc=(e,t,n,r)=>t.reduce((e,t,i)=>Mc(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Fc=(e,t,n)=>t.reduce((e,t)=>Mc(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Ic=e=>e.kind===`Name`?[e.name]:e.names,Lc=e=>e.flatMap(e=>Ic(e.pattern)),Rc=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.isRecursive:n.isRecursive?kc(e,t,void 0)!==void 0:Cc(n.location,t.location))?n:void 0},zc=(e,t)=>{let n=Rc(e,t);if(n){let r=n.isRecursive?t.bindings.get(e):void 0;return{key:t.getKey(n),arity:r?.arity??Tc(n),params:r?.params??Ec(n),kind:`Definition`}}let r=kc(e,t,void 0);return r?.isPending?{key:e,arity:r.arity,params:r.params,kind:r.kind}:r?t.imported.get(e):void 0},Bc=(e,t)=>t.facts.has(e)||t.bindings.get(e)?.kind===`Theorem`,Vc=(e,t)=>t.bindings.get(e)?.kind===`Theorem`?t.goals.get(e):void 0,Hc=(e,t,n)=>Oc(t,e)??zc(e,n),Uc=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Wc=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Uc(e.location,e.spelling??t)},Gc=e=>{if(!(e.kind!==`Apply`||e.argumentsRange)){if(e.args.length===2)return`infix`;if(e.args.length===1)return Cc(e.location,e.args[0].location)?`prefix`:`postfix`}},Kc=`In module --TLA+ BUILTINS--`,qc=/* @__PURE__ */ new Set([`Definition`,`Instance`,`Theorem`]),Jc=(e,t,n)=>n.errors.push({location:g(t),message:`Cannot take subexpression of \`${ic(e)}'.`}),Yc=e=>!/^[\p{L}\d_]/u.test(e),Xc=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Zc=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Qc=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},$c=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?Qc(e.name,[],void 0):Qc(e.operator,e.args,e.argumentCounts),el=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),tl=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Lc(e.bounds),body:e.body,sets:el(e.bounds)};case`SetMap`:return{names:Lc(e.bounds),body:e.expression,sets:el(e.bounds)};case`SetFilter`:return{names:Ic(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Ic(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}},nl=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}},rl=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,il=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),al=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?al(e.body,t):mt(e).reduce((e,n)=>e??al(n,t),void 0)},ol=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??ol(i,t,n||il(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&al(e.set,t):al(e,t)},sl=e=>e.kind===`Label`?sl(e.body):e,cl=e=>typeof e==`number`?`argument selector ${e}`:e,ll=`within the scope of a declaration
|
|
394
|
-
from outside that declaration's scope.`,ul=(e,t,n,r,i,a)=>{let o=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:g(r),message:n})},s=n.isSuffices===n.isInProof,c=n.statement,l={node:c,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,u=l.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return u.kind!==`NewSymbol`&&u.kind!==`AssumeProve`&&sl(u).kind===`Let`?u:o(a-1,`A name selector here must be from a LET clause.`);let e=c.kind===`AssumeProve`?[...c.assumptions,c.conclusion]:[c],r=a===1?e.map((e,t)=>({position:t,label:ol(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?al(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&il(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${ll}`);if(n.args.length!==r.label.params.length)return o(a,`Label \`${n.name}' used with wrong number of arguments.`);l.node=r.label,l.isGoal=!1,l.isSufficesOpen=!1;continue}if(n.kind===`Colon`)return u;let d=n.kind===`Operand`?cl(n.operand):n.kind===`At`?`@`:`!(...)`,f=e=>n.kind===`Operand`?Zc(n.operand,e):-1,p=`An unexpected null node specified by '${d}'.\nThis is probably due to a previous error.`;if(l.isSufficesOpen){if(f(1)!==0)return o(a,u.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);l.isSufficesOpen=!1;continue}if(u.kind===`NewSymbol`)return u;if(u.kind!==`AssumeProve`){let e=sl(u);if(vc.has(e))return o(a,`Subexpression selection failed, probably due to an error in the selected expression.`);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?Hc(e.name,r,i)?.kind:void 0;if(t===`Variable`||t?.startsWith(`New`))return o(a,`Choosing operand \`${d}' of subexpression with no operands.`);let s=tl(e)?.sets;if(s&&n.kind!==`Operand`)return u;let c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:nl(e);if(!c)return u;let m=e.kind===`Except`,h=f(m?e.updates.length+1:c.length);if(h===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(m&&h>0)return o(a,`Selecting subexpression of an EXCEPT not yet implemented.`);if(l.node=c[h],l.isGoal=!1,vc.has(l.node))return o(a,p);continue}let m=[...u.assumptions,u.conclusion],h=f(m.length);if(h===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(il(u,h)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${ll}`);let g=m[h];if(g.kind===`NewSymbol`&&a!==t.length-1)return o(a,`Selected a subexpression of a NEW clause of an ASSUME.`);if(l.node=g,l.isGoal=!1,g.kind!==`NewSymbol`&&g.kind!==`AssumeProve`&&vc.has(g))return o(a,p)}return a?l.node:l.node.kind===`AssumeProve`?o(void 0,`Selected ASSUME/PROVE instead of expression.`):l.node.kind===`NewSymbol`?o(void 0,`Selected a NEW declaration as an expression or operator.`):l.node},dl=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:g(e.location.range),message:n}),!0)},fl=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=g(r),a=e.params.filter((r,i)=>{let a=Oc(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:g(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},pl=(e,t,n,r)=>{if(!rl(e))return!1;let i=$c(e),a=i[0],o=i.length>1&&a.kind===`Name`?Oc(t,a.name)?.goal??Vc(a.name,n):void 0;return o&&{node:ul(e,i,o,t,n,r)}},ml=(e,t,n,r)=>{let i=e.location;if(El(e,n,r))return;let a=bc.get(e);if(a!==void 0)return a;if(xc(t))return e.kind===`Apply`?e.args.length:0;let o=Oc(n,t);if(o?.isNonFact){r.errors.push({location:g(Wc(e,t)),message:`Step number of non-expression step used as an expression.`});return}let s=o?.goal?.keyword;if(s){r.errors.push({location:g(Wc(e,t)),message:`${s} proof step selected instead of expression.`});return}if(pl(e,n,r,!1)||Xc(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=uc),o)return o.arity;let c=zc(t,r);if(c)return e.kind===`Identifier`?e.name=c.key:e.operator=c.key,bc.set(e,c.arity),c.arity;let l=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``,u=l===``?void 0:Oc(n,l)??zc(l,r);if(u&&!qc.has(u.kind)){Jc(l,e.kind!==`OperatorReference`&&e.selectorRanges?.[0]||Wc(e,t),r);return}if(e.kind!==`OperatorReference`&&l!==``&&Ol(l,e.kind===`Apply`&&e.argumentCounts?e.args.slice(0,e.argumentCounts[0]):[],e.selectorRanges?.[0],(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??i.range,n,r))return;if(u||l!==``&&Bc(l,r))return e.kind===`Apply`?e.args.length:0;let d=Gc(e),f=e.kind===`OperatorReference`||d!==void 0;if(!Yc(t)||Xc(t)||!f){r.errors.push({location:g(Wc(e,t)),message:`Unknown operator: \`${ic(t)}'.`});return}let p=e.spelling??t;r.errors.push({location:g(d===`prefix`&&p===`-.`?Uc(i,`-`):Wc(e,t)),message:`Could not find declaration or definition of symbol '${p}'.`}),d&&vc.add(e),d&&i.range&&r.errors.push({location:g(i.range),message:`Couldn't resolve ${d} operator symbol \`${p}'.`})},hl=(e,t,n)=>(e.forEach(e=>B(e.set,t,n)),e.reduce((e,t)=>Pc(e,Ic(t.pattern),t.pattern.ranges,n),t)),gl=(e,t)=>e.kind===`Identifier`&&e.name===t&&M(e)||mt(e).some(e=>gl(e,t)),_l=(e,t)=>{e.kind===`FunctionConstruction`&&gl(e.body,t)&&(e.isRecursive=!0),mt(e).forEach(e=>_l(e,t))},vl=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?Lc(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:g(o),message:e})},c=e.kind===`Function`?hl(e.bounds,t,i):Fc(t,e.params,i),l=Oc(c,a)??kc(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${ic(a)} defined at wrong LET/IN level.`):l&&!u?s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${ic(a)} already defined or declared.`):l&&e.kind===`Function`&&l.arity>0?s(`Function ${ic(a)} has operator arguments in its RECURSIVE declaration.`):l&&e.kind===`Operator`&&(l.arity!==e.params.length||e.params.some(e=>e.arity>0))&&s(`Definition of ${ic(a)} has different arity than its RECURSIVE declaration.`),l&&u&&e.kind===`Operator`&&(l.params=Ec(e)),e.kind===`Function`?(B(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),_l(e.body,a),e.isSelfReferential=gl(e.body,a)):B(e.body,c,i),l&&u?((e.kind===`Operator`||l.arity===0)&&(l.isPending=!1,l.range=o),!1):e.kind===`Function`?l===void 0:jc(a,Oc(t,a)??kc(a,i,o),{kind:`Definition`,arity:Tc(e),range:o},i)},yl=(e,t,n,r=[],i=[])=>{let a=/* @__PURE__ */ new Set,o=e.filter(e=>e.isRecursive&&i.every(t=>t.name!==e.name)).reduce((e,t)=>{if(Oc(e,t.name)?.isPending)return e;let n={name:t.name,arity:Tc(t),params:Ec(t),kind:`Definition`,parent:e,isPending:!0};return a.add(n),n},t),s=/* @__PURE__ */ new Map,c=(e,t)=>{let r={kind:`Definition`,arity:t.arity,params:Array(t.arity).fill(0),range:t.location.range},i=jc(t.name,Oc(e,t.name)??kc(t.name,n,r.range),r,n)?{...r,name:t.name,parent:e,isPending:!0}:void 0;return i&&a.add(i),s.set(t,i),i??e},l=[...n.isGenerated?[]:r,...i].toSorted((e,t)=>wc(e.location,t.location)),u=(e,t)=>{let r=l.findIndex(e=>!t(e));return l.splice(0,r===-1?l.length:r).reduce((e,t)=>`kind`in t?Rl(t,e,n):c(e,t),e)},d=u(e.reduce((e,t)=>{let i=xc(t.name)?e:u(e,e=>!Cc(t.location,e.location)),o={name:t.name,arity:Tc(t),kind:`Definition`,range:t.location.range,parent:i};if(Dc(t))return{...o,params:Ec(t)};let s=r.some(e=>e.location===t.location),c=n.isGenerated||t.isLocal||xc(t.name),l=s?{...n,isGenerated:!0,errors:[],warnings:[]}:c?{...n,isGenerated:c}:n;return vl(t,i,l,a)?{...o,params:Ec(t)}:i},o),()=>!0);return s.forEach((e,t)=>{let r=t.location.range;r&&!n.isGenerated&&(!e||e.isPending)&&n.errors.push({location:g(r),message:`Symbol ${ic(t.name)} declared in RECURSIVE statement but not defined.`})}),d},bl=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Oc(t,r)??kc(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},xl=(e,t,n)=>{if(!rl(e))return!1;let r=$c(e),i=r.findIndex(e=>e.kind!==`Name`),a=bl(r.slice(0,i===-1?r.length:i).flatMap(e=>e.kind===`Name`?[e.name]:[]).join(`!`),t,n),o=r[0],s=o.kind===`Name`?o.args.length:0;if(!a||s===a.arity)return!1;let c=(e.kind===`Identifier`?void 0:e.argumentRanges?.[0])??e.location.range;return c&&n.errors.push({location:g(c),message:`The operator ${a.name} requires ${a.arity} arguments.`}),!0},Sl=(e,t,n,r,i)=>{let a=e?.kind===`Definition`?e.params:void 0;return!e||!a||a.length===e.arity?!1:(r&&!i.isGenerated&&i.errors.push({location:g(r),message:`Wrong number of arguments (${n}) given to operator '${ic(t)}', \nwhich requires ${a.length} arguments.`}),!0)},Cl=(e,t,n,r,i,a,o)=>{let s=(e,t)=>{e&&o.errors.push({location:g(e),message:t})},c=e.location.range;if(t===0){let t=mc.get(e);if(e.kind===`Lambda`&&e.operator!==void 0)s(c,`The operator ${ic(e.operator)} requires 1 arguments.`);else if(t)o.errors.push(t);else if(e.kind===`Lambda`&&c)vc.add(e),s(c,`LAMBDA expression used where an expression is required.`);else if(e.kind===`OperatorReference`){let t=ml(e,e.operator,a,o);t!==void 0&&s(c,`The operator ${ic(e.operator)} requires ${t} arguments.`)}else B(e,a,o);return!0}if(e.kind===`Lambda`){fc.has(e)?B(e,a,o):Dl(e,a,o);let l=e.params.length===t;return!l&&fc.has(e)?s(c,`Expected arity ${t} but found operator of arity ${e.params.length}.`):!l&&c&&e.operator===void 0&&s(i,`Lambda expression with arity ${e.params.length} used as argument ${n+1} of operator \`${r}', \nbut an operator of arity ${t} is required.`),l}if(e.kind===`Subexpression`)return B(e,a,o),!0;if(e.kind===`Apply`&&e.argumentCounts?.at(-1)===0){let t=e.argumentCounts.findIndex(e=>e>0);return s(e.selectorRanges?.[t],`Selector \`${e.operator.split(`!`)[t]}' should not have argument(s).`),!1}if(e.kind!==`Identifier`&&e.kind!==`OperatorReference`)return s(c,`An expression appears as argument number ${n+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let l=e.kind===`Identifier`?e.name:e.operator,u=Hc(l,a,o)?.params??[],d=ml(e,l,a,o);return e.kind===`Identifier`&&d!==void 0&&d!==t&&s(Wc(e,l),`Expected arity ${t} but found operator of arity ${d}.`),d===t&&u.every(e=>e===0)},wl=(e,t,n)=>{if(xl(e,t,n))return;let r=e.operator,i=Hc(r,t,n),a=ml(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:g(e.argumentsRange??Wc(e,r)),message:`The operator ${ic(r)} requires ${a-(bl(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:e.args.map(()=>0));if(o===void 0){e.args.forEach(e=>Tl(e,t,n));return}let s=e.selectorRanges?.at(-1)??Wc(e,r),c=r===dc,l=e.args.slice(0,o.length).map((e,i)=>{let a=c?gc.get(e):void 0;return Cl(e,o[i],a?.index??i,a?.operator??r,a?.range??s,t,n)});Sl(i,r,e.args.length,e.location.range,n)||l.forEach((t,i)=>{!t&&e.location.range&&n.errors.push({location:g(e.location.range),message:`Argument number ${i+1} to operator '${c?`LAMBDA`:r}' \nshould be a ${o[i]}-parameter operator.`})})},Tl=(e,t,n)=>{e.kind===`Identifier`?ml(e,e.name,t,n):B(e,t,n)},El=(e,t,n)=>{let r=pc.get(e);return r?(r.applications.forEach(e=>e.args.slice(0,e.params.length).forEach((r,i)=>Cl(r,e.params[i],i,e.operator,e.range,t,n))),n.errors.push(yc(r.nulls)??r.error),!0):!1},Dl=(e,t,n)=>B(e.body,Pc(t,e.params,e.paramRanges,n),{...n,labelParams:[...n.labelParams,...e.params]}),B=(e,t,n)=>{if(fc.has(e)&&!n.isGenerated){let r=yc(_c.get(e));r?n.errors.push(r):B(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>B(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:return;case`ExceptAt`:!n.isInExcept&&e.location.range&&n.errors.push({location:g(e.location.range),message:`@ used where its meaning is not defined.`});return;case`Identifier`:{if(xl(e,t,n))return;let r=e.name,i=ml(e,r,t,n);i===0?Sl(Hc(r,t,n),r,0,Wc(e,r),n):i!==void 0&&n.errors.push({location:g(Wc(e,r)),message:`The operator ${ic(r)} requires ${i} arguments.`});return}case`OperatorReference`:ml(e,e.operator,t,n);return;case`Apply`:wl(e,t,n);return;case`Lambda`:fc.has(e)?Dl(e,t,n):e.location.range&&(vc.add(e),n.errors.push({location:g(e.location.range),message:`LAMBDA expression used where an expression is required.`}));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:B(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&B(e.other,t,n);return;case`Let`:B(e.body,yl(e.definitions,t,n,e.instances,e.recursive),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:B(e.body,hl(e.bounds,t,n),i(Lc(e.bounds)));return;case`UnboundedQuantifier`:B(e.body,Pc(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&B(e.set,t,n),B(e.body,Pc(t,Ic(e.pattern),e.pattern.ranges,n),i(Ic(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:B(e.predicate,hl([e.bound],t,n),i(Ic(e.bound.pattern)));return;case`SetMap`:B(e.expression,hl(e.bounds,t,n),i(Lc(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:g(r.location.range??Uc(r.location,r.name)),message:`Non-unique fields in constructor.`}),B(r.value,t,n)});return;case`Except`:B(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),B(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:B(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(dl(e,n))return;B(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),fl(e,t,n);return;case`Subexpression`:kl(e,t,n);return}},Ol=(e,t,n,r,i,a)=>{let o=Oc(i,e)??kc(e,a,void 0);return!o?.isPending||!n||!r?!1:t.length===o.arity?(t.forEach(e=>B(e,i,a)),a.errors.push({location:g(n),message:`Subexpression of \`${e}' used inside the operator's definition.`}),!0):(a.errors.push({location:g(r),message:`The operator ${e} requires ${o.arity} arguments.`}),!0)},kl=(e,t,n)=>{if(xl(e,t,n)||El(e,t,n))return!0;let r=e.selectors[0],i=e.selectorRanges?.[0],a=e.selectors.findIndex(e=>e.kind!==`Name`),o=e.selectors.slice(0,a).flatMap(e=>e.kind===`Name`?[e.name]:[]),s=o.findIndex((e,t)=>t>0&&zc(o.slice(0,t+1).join(`!`),n)),c=o.length>1&&(Oc(t,o[0])??kc(o[0],n,void 0))?.kind===`Instance`,l=e.selectorRanges?.[a-1];if(c&&s===-1&&i&&l)return n.errors.push({location:g({module:i.module,start:i.start,end:l.end}),message:`Unknown operator: \`${ic(o.join(`!`))}'.`}),!0;let u=o.slice(0,s+1).join(`!`),d=s>0?zc(u,n):void 0,f=e.selectors.slice(0,s+1).flatMap(e=>`args`in e?e.args:[]).length,p=e.argumentRanges?.[s]??e.location.range;if(d&&d.arity!==f&&p)return n.errors.push({location:g(p),message:`The operator ${ic(u)} requires ${d.arity} arguments.`}),!0;if(r.kind===`Name`&&e.selectors[1].kind!==`Name`&&i){let e=Oc(t,r.name),a=e??zc(r.name,n);if(a===void 0&&!Bc(r.name,n)||a?.kind===`Instance`)return n.errors.push({location:g(i),message:`Unknown operator: \`${ic(r.name)}'.`}),!0;if(a&&(!qc.has(a.kind)||e?.isNonFact))return Jc(r.name,i,n),!0}if(r.kind===`Name`&&Ol(r.name,r.args,i,e.argumentRanges?.[0]??e.location.range,t,n))return!0;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Tl(e,t,n));let m=pl(e,t,n,!1);return m?m.node===void 0:!1},Al=(e,t,n,r)=>{if(e.kind===`ModuleFact`)return;if(e.kind===`ExceptAt`&&e.location.range)return r.errors.push({location:g(e.location.range),message:"Unknown operator: `@'."}),Kc;let i=Ml(e,t,n,r);if(xl(e,n,r))return i;let a=pl(e,n,r,!0);if(a){let t=a.node?.kind;return t===void 0?Kc:t===`AssumeProve`||t===`NewSymbol`?void 0:e.location.range&&g(e.location.range)}if(e.kind===`Subexpression`)return kl(e,n,r)?Kc:i;let o=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;return e.kind===`Identifier`&&Oc(n,o)?.isNonFact?(r.errors.push({location:g(Wc(e,o)),message:`Step number of non-fact used as a fact`}),Kc):(!Bc(o,r)&&!Oc(n,o)?.goal&&B(e,n,r),i)},jl=(e,t,n)=>{let r=e.location.range,i=e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:``;if(i===``||!r)return!0;let a=Oc(t,i)??zc(i,n)??kc(i,n,r);return a===void 0&&(Bc(i,n)||Xc(i))||(a===void 0&&n.errors.push({location:g(r),message:`Unknown operator: \`${ic(i)}'.`}),a&&qc.has(a.kind)&&!Xc(i))?!0:(n.errors.push({location:g(r),message:`DEF clause entry should describe a defined operator.`}),!1)},Ml=(e,t,n,r)=>{let i=e.location.range&&g(e.location.range);if(fc.has(e))return t.location.range&&g(t.location.range);if(pc.has(e)||e.kind===`ExceptAt`)return Kc;switch(e.kind){case`Number`:case`String`:case`Decimal`:case`Let`:case`Label`:return;case`Identifier`:case`Apply`:case`Subexpression`:{let t=$c(e)[0];if(e.kind===`Subexpression`||t.kind!==`Name`)return;let a=e.kind===`Identifier`?e.name:e.operator,o=Oc(n,t.name)?.goal??Vc(t.name,r);if(Bc(a,r)||o||Xc(a)&&Oc(n,a))return;let s=Hc(a,n,r),c=e.kind===`Apply`?e.args.length:0;return s?.arity===c?i:Kc}default:return i}},Nl=(e,t,n)=>{let r=hc.get(e.facts)??e.facts,i=e.facts.map((e,i)=>Al(e,r[i],t,n)),a=e.defs.filter(e=>jl(e,t,n)).length;i.forEach(t=>{t&&e.kind===`Hide`&&n.errors.push({location:t,message:`The only expression allowed as a fact in a HIDE is
|
|
395
|
-
the name of a theorem, assumption, or step.`})});let o=e.location.range;e.facts.length+a===0&&o&&n.errors.push({location:g(o),message:e.kind===`By`?`Empty BY`:`Empty USE or HIDE statement.`})},Pl=(e,t,n)=>(e.set&&B(e.set,t,n),Mc(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Fl=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Pl(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Fl(t,e.scope,e.unit,!0):B(t,e.scope,e.unit),e),{scope:t,unit:n});return B(e.conclusion,i.scope,i.unit),i.scope},Il=(e,t,n)=>e.kind===`AssumeProve`?Fl(e,t,n):(B(e,t,n),t),Ll=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Nl(e,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Bl(t,e,r),t)},Rl=(e,t,n)=>{let r=Kl(e,t,n);return e.name===void 0?r:Mc(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},zl=(e,t)=>{let n=(e,t)=>({statement:t,isSuffices:!1,isInProof:!1,keyword:e});switch(e.kind){case`Have`:return n(`HAVE`,{kind:`Tuple`,elements:[e.expression],location:t});case`Case`:return n(`CASE`,{kind:`Tuple`,elements:[e.expression],location:t});case`Witness`:return n(`WITNESS`,{kind:`Tuple`,elements:e.expressions,location:t});case`Take`:return n(`TAKE`,{kind:`Tuple`,elements:el(e.bounds),location:t});case`Pick`:return n(`PICK`,e.bounds.length>0?{kind:`Exists`,bounds:e.bounds,body:e.body,location:t}:{kind:`UnboundedQuantifier`,quantifier:`Exists`,names:e.names,body:e.body,location:t});case`Qed`:return n(`QED step`,{kind:`Tuple`,elements:[],location:t});default:return}},Bl=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=zl(r,e.location),o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,goal:a},s=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=Il(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Ll(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0,keyword:r.isSuffices&&r.statement.kind!==`AssumeProve`?`SUFFICES`:void 0};return Ll(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 Nl(r,t,n),s(t);case`Instance`:return s(Rl(r,t,i));case`Define`:return s(r.definitions.reduce((e,t)=>t.kind===`Instance`?Rl(t,e,i):yl([t],e,n),t));case`Have`:case`Case`:return B(r.expression,t,i),Ll(e.proof,o(t),n),o(t);case`Witness`:return r.expressions.forEach(e=>B(e,t,i)),o(t);case`Take`:return o(Pc(hl(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let a=Pc(hl(r.bounds,t,i),r.names,r.nameRanges,i);return B(r.body,a,{...i,labelParams:[...i.labelParams,...Lc(r.bounds),...r.names]}),Ll(e.proof,o(t),n),o(a)}default:return Ll(e.proof,o(t),n),o(t)}},Vl=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Il(e.statement,void 0,t);e.name!==void 0&&Nc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Ll(e.proof,n,t),r&&(r.isInProof=!1)},Hl={line:0,column:0},Ul=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Wl=(e,t)=>{let n=new Map([...Sc,...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},Gl=(e,t,n,r,i)=>{let a=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),r),o=(e,t)=>i.errors.push({location:t,message:`An operator must be substituted for symbol '${ic(e.name)}', and it must have arity ${e.arity}.`}),s=(e,t)=>{let n=t.location.range;if(e.arity===0){B(t,a,i);return}if(t.kind===`Lambda`){Dl(t,a,i),t.params.length!==e.arity&&n&&o(e,g(n));return}if(t.kind===`OperatorReference`){let r=ml(t,t.operator,a,i);r===void 0?o(e,Kc):r!==e.arity&&n&&o(e,g(n));return}if(t.kind!==`Identifier`){n&&i.errors.push({location:g(n),message:`Arity ${e.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${ic(e.name)}'.`}),o(e,Kc);return}let r=ml(t,t.name,a,i);r!==void 0&&r!==e.arity&&i.errors.push({location:g(Wc(t,t.name)),message:`Expected arity ${e.arity} but found operator of arity ${r}.`}),r!==e.arity&&o(e,Kc)},c=e.location.range,l=t.filter(e=>Oc(a,e.name)!==void 0||zc(e.name,i)!==void 0).map(t=>({declaration:t,expression:{kind:`Identifier`,name:t.name,location:e.location}}));l.filter(e=>e.declaration.arity===0).forEach(e=>{let t=ml(e.expression,e.declaration.name,a,i);t&&c&&i.errors.push({location:g(c),message:`Wrong number of arguments (0) given to operator '${ic(e.declaration.name)}', \nwhich requires ${t} arguments.`})});let u=/* @__PURE__ */ new Map;return e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){i.errors.push({location:g(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let a=e.expression;s(r,a);let o=a.location.range;u.has(n)?o&&i.errors.push({location:g(o),message:`Multiple substitutions for symbol '${n}' in substitution.`}):u.set(n,a)}),l.filter(e=>!u.has(e.declaration.name)).forEach(e=>{(e.declaration.arity===0?0:ml(e.expression,e.declaration.name,a,i))!==e.declaration.arity&&c&&o(e.declaration,g(c)),u.set(e.declaration.name,e.expression)}),t.filter(e=>!u.has(e.name)).forEach(e=>{let t=e.location.range;c&&t&&i.errors.push({location:g(c),message:`Substitution missing for symbol ${ic(e.name)} declared at ${g(t)} \nand instantiated in module ${n}.`})}),u},Kl=(e,t,n)=>{let r=n.getInstance(e);return Gl(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,t)=>Mc(e,t[0],t[1],n),t)},ql=(e,t,n,r)=>{let i=Wl(n,r.imported),a=new Map([...n.constants,...n.variables].map(e=>[e.name,e.location])),o={location:e.location,errors:[],warnings:[]};return r.reports.push(o),Gl(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(e=>[e[0],{...e[1],position:a.get(e[0])??Hl}])),errors:o.errors,warnings:o.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Jl=(e,t)=>{let n=[],r=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>wc(e.location,t.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof s)||!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},Yl=(e,t)=>{let n=Wl(e,t.imported),r=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1,keyword:void 0}]]:[])),i=new Map([...Sc,...t.bound].map(e=>[e[0],{...e[1],position:Hl}])),a=/* @__PURE__ */ new Set,o=[],s=(e,a,o,s)=>({location:e,check:(c,l)=>s({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:a,facts:t.facts,goals:r,bindings:i,errors:c,warnings:l,hasLabelScope:o,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})}),c=(e,t)=>e.map(e=>s(e.location,void 0,!1,n=>Nc(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return Jl([...e.units.flatMap(e=>{let t=e.kind===`Variables`?{type:`A VARIABLE declaration`,location:e.location}:e.kind===`Constants`?{type:`A declaration`,location:e.location}:e.kind===`Module`?{type:`A MODULE `,location:e.module.location}:e.kind===`Theorem`?{type:`A THEOREM`,location:e.theorem.location}:e.kind===`Assumption`?{type:`An ASSUME`,location:e.assumption.location}:e.kind===`Use`?{type:`A USE or HIDE`,location:e.use.location}:void 0,n=t?.location.range;return!t||!n?[]:[{location:t.location,check:e=>{o.some(e=>e.binding?.isPending)&&e.push({location:g(n),message:`${t.type} may not appear within a recursive definition section.`})}}]}),...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...c(e.constants,`Constant`),...c(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>s(e.location,void 0,!1,t=>{let n={kind:`Definition`,arity:e.arity,params:Array(e.arity).fill(0),range:e.location.range,position:e.location,isPending:!0},r=jc(e.name,i.get(e.name),n,t);r&&(i.set(e.name,n),a.add(n)),o.push({declaration:e,binding:r?n:void 0})})),...e.definitions.map(t=>s(t.location,t,!0,n=>{Ul(e,t)?B(t.body,void 0,n):vl(t,void 0,n,a)&&i.set(t.name,{kind:`Definition`,arity:Tc(t),range:t.location.range,position:t.location})})),...e.instances.map(e=>s(e.location,void 0,!1,n=>{Fc(void 0,e.params,n),t.instanced.get(e)?.forEach((e,t)=>Nc(t,e,n)),e.name!==void 0&&Nc(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)})),...e.assumptions.map(e=>s(e.location,void 0,e.name!==void 0,t=>{B(e.expression,void 0,t),e.name!==void 0&&Nc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t)})),...e.theorems.map(e=>s(e.location,void 0,e.name!==void 0,t=>Vl(e,t))),...e.uses.map(e=>s(e.location,void 0,!1,t=>Nl(e,void 0,t))),{location:e.location.range?.end??e.location,check:e=>o.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:g(n),message:`Symbol ${ic(t.declaration.name)} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},Xl=/* @__PURE__ */ new WeakSet,Zl=/* @__PURE__ */ new WeakMap,Ql=(e,t)=>{if(t.length===0)return e;let n={...e};return Xl.has(e)&&Xl.add(n),Zl.set(n,[...t,...Zl.get(e)??[]]),n},$l=(e,t,n=/* @__PURE__ */ new Set)=>{let r=au(e,(e,r)=>$l(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&M(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&M(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},eu=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),tu=/* @__PURE__ */ new WeakMap,nu=e=>tu.get(e)??e.name,ru=(e,t)=>(nu(t)!==e.name&&tu.set(e,nu(t)),e),iu=(e,t)=>ru(e.kind===`Function`?{...e,bounds:eu(e.bounds,e=>t(e,[])),body:t(e.body,Lc(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),au=(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=>iu(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:eu(e.bounds,n),body:t(e.body,Lc(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,Ic(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,Ic(e.bound.pattern))};case`SetMap`:return{...e,bounds:eu(e.bounds,n),expression:t(e.expression,Lc(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},ou=(e,t)=>{au(e,(e,n)=>(t(e,n),e))},su=`LAMBDA`,cu=e=>`${e}@SUBSTITUTION`,lu=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(lu),uu=(e,t)=>{if(e.kind!==`Identifier`)return!lu(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=M(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!lu(n.body)},du=(e,t=/* @__PURE__ */ new Set)=>{let n=ht(e),r=n===void 0||t.has(n)?[]:[n];return ou(e,(e,n)=>r.push(...du(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},fu=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}},pu=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),mu=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},hu=(e,t)=>e.map(e=>({pattern:mu(e.pattern,t),set:e.set})),gu=(e,t)=>e.kind===`Function`?{...e,bounds:hu(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},_u=(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=>ru({...gu(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:hu(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:mu(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:mu(e.bound.pattern,n),set:e.bound.set}};default:return e}},vu=e=>`${e}@ENABLED`,yu=(e,t)=>e.modes.get(t)??e,bu=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!M(e)&&t.instantiation.variables.has(e.name),xu=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>xu(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(bu(e,t,n))return[e.name];let r=M(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?xu(r.body,t,/* @__PURE__ */ new Map):void 0},Su=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return bu(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:vu(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Ou(e.expression,yu(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Ou(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Ou(e.subscript,yu(t,`Primed`),n),location:r},Ou(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=xu(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:vu(r),location:e.location},location:e.location},Ou({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Cu=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:uc}),wu=(e,t)=>e.map(e=>Cu(e.name,t)),Tu=(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:wu(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),Eu=(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:[...wu(t,r),...i.map(e=>Cu(e,r))],location:r},location:r}},Du=(e,t)=>e.instantiation.isParameterized(t)?Au(e,t):void 0,Ou=(e,t,n)=>{let r=e=>Ou(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!M(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Ou(e.expression,yu(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:Ou(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},yu(t,`Enabled`),n)};let c=Su(e,t,n);if(c)return c;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name),r=t.bindings;if(n&&(r===void 0||!uu(n,i)))return Ql(n,[e]);if(n&&r){let t=cu(e.name);return r.set(t,n),Cu(t,e.location)}let o=Du(t,e.name);if(o===void 0)return e;if(a.length===0)return{...e,name:o};let s=i.getDefinition(e.name);return s&&Tc(s)>0?Eu(o,a,Tc(s),e.location):{kind:`Apply`,operator:o,args:wu(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),c=i.substitutions.size>0||a.length>0||Xl.has(e),l=e=>(c&&Xl.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:su,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:su,args:n,resolution:uc},location:e.location};if(o)throw new s(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=Du(t,e.operator);return u===void 0?l({...e,args:n}):{...e,operator:u,args:[...wu(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=i.substitutions.get(e.operator);if(n?.kind===`Identifier`||n?.kind===`OperatorReference`||n?.kind===`Lambda`)return Ql(n,[e]);let r=Du(t,e.operator);if(r===void 0)return e;let o=i.getDefinition(e.operator);return a.length>0&&o?Eu(r,a,Tc(o),e.location):{...e,operator:r}}let l=fu(t),u=au(e,(e,i)=>i.length===0?r(e):Ou(e,t,pu(n,i,l)));return _u(u,n,l)},ku=(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:Cu(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Au=(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=fu(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=gu(iu(i,(e,t)=>Ou(e,s,pu(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(e=>({kind:`Operator`,name:e[0],params:[],body:e[1],isLocal:!0,isRecursive:!1,location:e[1].location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&Zl.set(l,[u,...Zl.get(i.body)??[]]),ku({...c,body:l},r.params,i.location)}):t},ju=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>du(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=>Du(i,e)??e,getQualifiedKey:t=>{let n=Du(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>ku(r,e.params,r.location)):t}}},Mu=e=>e.kind===`Let`&&e.instances!==void 0||mt(e).some(Mu),Nu=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=au(e,e=>Nu(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Cc(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},Pu=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Fu=(e,t)=>e.definitions.some(e=>Mu(e.body))||e.assumptions.some(e=>Mu(e.expression))||e.theorems.some(e=>{let t=Pu(e);return t!==void 0&&Mu(t)})?{...e,definitions:e.definitions.map(e=>iu(e,e=>Nu(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Nu(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Pu(e);return n===void 0?e:{...e,statement:Nu(n,t,[])}})}:e,Iu=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]],[`_Track`,0,[0,0],[3,2],[0,0]],[`_Counts`,0,[],[],[]],[`_CheckName`,0,[0],[2],[1]],[`_PrintCounts`,0,[],[],[]]].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}])),Lu={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]}},Ru=(e,t)=>{let n=Lu[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},zu=(e,t)=>`${e}${t}`,Bu=(e,t,n)=>`${e}${t}${n}`,Vu=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Hu=(e,t,n)=>`${e},${t},${n}`,Uu=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Wu=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Gu=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Ku=(e,t)=>{t.constraints.forEach((t,n)=>Wu(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>Gu(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},V=(e,t,n,r)=>({...Uu(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),qu=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Ju=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Yu=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=>[e[0],{...V(e[0],e[1],[...e[2]],[...e[3]]),nonLeibniz:new Set(e[1]>1?[0,1]:[])}])),Xu=V(`'`,2,[1],[0]),Zu=V(`UNCHANGED`,2,[1],[0]),Qu=V(`ENABLED`,1,[2],[0]),$u=V(`[]`,3,[3],[0]),ed=V(`<>`,3,[3],[0]),td=V(`$ConjList`,0,[3],[1]),nd=V(`$DisjList`,0,[3],[1]),rd=V(`$IfThenElse`,0,[3],[1]),id=V(`$Case`,0,[3],[1]),ad=V(`$BoundedForall`,0,[3],[1]),od=V(`$BoundedExists`,0,[3],[1]),sd=V(`$UnboundedForall`,0,[3],[1]),cd=V(`$UnboundedExists`,0,[3],[1]),ld=V(`$TemporalForall`,3,[3],[0]),ud=V(`$TemporalExists`,3,[3],[0]),dd=V(`$BoundedChoose`,0,[2],[1]),fd=V(`$UnboundedChoose`,0,[2],[1]),pd=V(`$SetEnumerate`,0,[2],[1]),md=V(`$Tuple`,0,[2],[1]),hd=V(`$SetOfFcns`,0,[2],[1]),gd=V(`$CartesianProd`,0,[2],[1]),_d=V(`$SubsetOf`,0,[2],[1]),vd=V(`$SetOfAll`,0,[2],[1]),yd=V(`$FcnConstructor`,0,[3],[1]),bd=V(`$RcdConstructor`,0,[3],[1]),xd=V(`$SetOfRcds`,0,[2],[1]),Sd=V(`$Except`,0,[2],[1]),Cd=V(`$Pair`,0,[3],[1]),wd=V(`$Seq`,0,[2],[1]),Td=V(`$FcnApply`,0,[2,2],[1,1]),Ed=V(`$RcdSelect`,0,[2,0],[1,1]),Dd=V(`$SquareAct`,2,[2,1],[0,0]),Od=V(`$AngleAct`,2,[2,1],[0,0]),kd=V(`$WF`,3,[1,2],[0,0]),Ad=V(`$SF`,3,[1,2],[0,0]),jd=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Md=e=>e.map(e=>({name:e,arity:0})),Nd=(e,t)=>t.location.range?h(`${e}.`,t.location.range):new s(`${e} at line ${t.location.line}, column ${t.location.column}`),Pd=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Fd=e=>e.kind!==`Let`&&e.kind!==`Label`,Id=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:y(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=y(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Yu.get(t)??Iu.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=Uu(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(Bu(e,n,t))}),Gu(r.argConstraints,zu(e,n),t.data.level),Ku(r,t.data)}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);t.forEach((t,n)=>{if(t.kind===`Value`&&t.data.level>qu(e,n))throw new s(`Level error in applying operator ${ic(e.name)}:\nThe level of argument ${n+1} 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(Hu(t,n,r)),c=Uu(Math.max(e.level,...t.filter((t,n)=>Ju(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>c.params.add(e)),t.forEach((t,n)=>{Ju(e,n)===1&&t.data.params.forEach(e=>c.params.add(e))}),n.forEach(e=>e.params.forEach(e=>c.params.add(e))),r.forEach(e=>c.params.delete(e)),e.constraints.forEach((e,t)=>Wu(c.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Wu(c.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Wu(c.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Wu(c.constraints,t,qu(e,n))})),t.forEach((e,n)=>{if(e.kind!==`Operator`)return;let r=e.data;t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>Wu(c.constraints,e,qu(r,a)))}))}),e.argParams.forEach(e=>{let t=Vu(e),n=a(t.operator);n?.kind===`Operator`&&Wu(c.constraints,t.param,qu(n.data,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Gu(c.argConstraints,t,e))),t.forEach((n,r)=>{if(n.kind!==`Declared`)return;let i=n.declared;Array.from({length:i.arity},(t,n)=>Gu(c.argConstraints,zu(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&Gu(c.argConstraints,zu(i.name,a),e.data.level)}))}),e.argParams.forEach(e=>{let t=Vu(e),n=a(t.operator);n&&Gu(c.argConstraints,zu(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Vu(e).param)||c.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),e.argParams.forEach(e=>{let t=Vu(e),n=a(t.operator);if(n)n.kind===`Declared`&&c.argParams.add(Bu(n.declared.name,t.index,t.param));else{let n=a(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(Bu(t.operator,t.index,e)))}}),t.forEach((e,n)=>{if(e.kind!==`Declared`)return;let r=e.declared;t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>c.argParams.add(Bu(r.name,a,e)))}))}),c},a=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:v(`LAMBDA`,Md(e.params),e.body,t)};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{kind:`Operator`,data:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=Uu();return e.params.add(r),{kind:`Declared`,data:e,declared:{name:r,arity:i.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:Uu()}}return{kind:`Value`,data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),c=(e,t,n,r=[],a=Lc(r))=>{let c=o(t,jd(n,Md(a))),l=r.map(e=>m(e.set,n)),u=i(e,c,l,a),d=r[l.findIndex(e=>e.level>2)]?.pattern;if(d){let t=d.ranges?.[0];throw new s(`Level error in applying operator ${e.name}:\nThe level of the range for the bounded variable ${t?g(t):Ic(d)[0]} \nexceeds the maximum level allowed by the operator`)}return u},l=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),u=(e,t,n)=>{let r=e.map(e=>e.data.level);if(r.includes(2)&&r.includes(3))throw Nd(`${n} 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 Nd(`Action used where only temporal formula or state predicate allowed`,e);Pd.has(e.operator)&&u(t,e,ic(e.operator))},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Fd(n)&&n.kind!==r)throw Nd(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>Ku(i,y(e,n))),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof s)||t.sany?t:Nd(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Uu();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),r=e.kind===`And`;return u(n,e,e.isBulleted?`${r?`Conjunction`:`Disjunction`} list`:r?`\\land`:`\\lor`),i(r?td:nd,n)}case`Prime`:return c(Xu,[e.expression],t);case`Unchanged`:return c(Zu,[e.expression],t);case`Enabled`:return c(Qu,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(e.kind===`Always`?$u:ed,[n])}case`If`:return c(rd,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(id,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=c(e.kind===`Forall`?ad:od,[e.body],t,e.bounds),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Nd(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?e.quantifier===`Forall`?ld:ud:e.quantifier===`Forall`?sd:cd,[e.body],t,[],e.names);case`Choose`:return c(e.set?dd:fd,[e.body],t,e.set?[{pattern:e.pattern,set:e.set}]:[],Ic(e.pattern));case`SetEnumeration`:return c(pd,e.elements,t);case`Tuple`:return c(md,e.elements,t);case`FunctionSet`:return c(hd,[e.domain,e.range],t);case`Product`:return c(gd,e.factors,t);case`SetFilter`:return c(_d,[e.predicate],t,[e.bound]);case`SetMap`:return c(vd,[e.expression],t,e.bounds);case`FunctionConstruction`:return c(yd,[e.body],t,e.bounds);case`Record`:return c(bd,e.fields.map(e=>e.value),t);case`RecordSet`:return c(xd,e.fields.map(e=>e.value),t);case`Except`:return i(Sd,[a(e.function,t),...e.updates.map(e=>({kind:`Value`,data:i(Cd,[{kind:`Value`,data:i(wd,e.path.map(e=>e.kind===`Field`?{kind:`Value`,data:Uu()}:e.args.length===1?a(e.args[0],t):{kind:`Value`,data:c(md,e.args,t)}))},a(e.value,t)])}))]);case`FunctionApplication`:return i(Td,[a(e.function,t),e.args.length===1?a(e.args[0],t):{kind:`Value`,data:c(md,e.args,t)}]);case`Bracket`:return Uu();case`FieldAccess`:return i(Ed,[a(e.record,t),{kind:`Value`,data:Uu()}]);case`BoxAction`:case`AngleAction`:return c(e.kind===`BoxAction`?Dd:Od,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(e.kind===`WeakFairness`?kd:Ad,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Uu()}},_=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>_(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 mt(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,jd(t,Md(e.names))),i;default:return ou(e,(e,n)=>a(e,r,jd(t,Md(n)))),i}},v=(e,t,n,r)=>{let i=jd(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=_(n,i),c={...Uu(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(zu(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(Bu(e.name,n,t.name))).map(e=>Hu(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(Vu(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Vu(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},y=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...Uu(),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=v(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:y,toOperand:a}},Ld=(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`?Ld(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Uu(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),Ku(a,e)}),a},Rd=(e,t,n,r)=>{let i=Id(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`?Ld(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=g(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):[]}):[],l=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:g(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[],u=Jl([...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:()=>{let t=i.analyze(e.expression,/* @__PURE__ */ new Map).level,n=e.location.range;if(t!==0&&n)throw h(`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${t}.`,n)}})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?Ld(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...l(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw c(n)}})),...n],r);if(u.length>0)throw c(u,!1,void 0,r)},zd=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),Bd=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Vd=/* @__PURE__ */ new Set([...zd,...Bd,`Enabled`]),Hd=/* @__PURE__ */ new Set([`~>`,`-+->`]),Ud=/* @__PURE__ */ new Set([...Hd,`\\cdot`]),Wd=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Gd=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),Kd=/* @__PURE__ */ new Set([`RandomSubset`,`RandomSetOfSubsets`,`TestRandomSetOfSubsets`,`RandomSubsetSet`]),qd=(e,t)=>Wd.has(e)||t.builtins.get(e)?.isStateLevel===!0,Jd=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(zd.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(Bd.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&Hd.has(e.operator))return 224},o=(e,n,s)=>{let c=e.kind,l=s?1:513;(Vd.has(c)||c===`UnboundedQuantifier`&&e.isTemporal===!0||c===`Apply`&&Ud.has(e.operator))&&(r[0]|=l),Vd.has(c)&&(r[0]|=16);let u=a(e);n&&u!==void 0&&(r[0]|=u);let d=n&&u===void 0,f=ht(e);if(f!==void 0&&M(e)&&t.variableIndex.has(f)&&(s||(r[0]|=512),d&&(r[0]|=32)),f!==void 0&&!M(e)){let e=t.substitutions.get(f)??f,n=t.definitions.get(e),a=t.constants.has(f),o=t.variableIndex.get(f);if((o!==void 0||t.builtins.get(f)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=l),o!==void 0&&(d&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:d,isOperatorArgument:s||c===`OperatorReference`||c===`Identifier`&&n.kind===`Operator`&&n.params.length>0});else{qd(f,t)&&(r[0]|=2|(f===`Assert`?0:4)),Gd.has(f)&&(r[0]|=8),Kd.has(f)&&(r[0]|=256),!a&&qd(e,t)&&(r[0]|=16);let n=t.builtins.get(e);d&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}mt(e).forEach(e=>o(e,d,s||c===`Lambda`))};return e.forEach(e=>o(e,!0,!1)),{row:r,edges:i}},Yd=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},Xd=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&513),Zd=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=Jd(pt(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&270,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=Yd(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=Yd(i,r,u,224),f=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&!e.isOperatorArgument).map(s))),p=Yd(i,r,f,512),m=o.map(e=>new Int32Array(e.map(s).filter(e=>!Xd(t[e],l[e*r]|p[e*r])))),h=Yd(a,r,m,270);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|p[t]&512|d[t]&224|h[t]&270:e),words:r}},Qd=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?$d(pt(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},$d=(e,t)=>{let n=t.facts.words,r=Jd(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=Qd(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isOperatorArgument||(i[0]|=r[0]&512),e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}Xd(e.callee,r[0])||(i[0]|=r[0]&270)}),i},ef=(e,t)=>!(Qd(e,t)[0]&513),tf=(e,t)=>!(Qd(e,t)[0]&512),nf={any:2,repeated:4,streamed:8,replayed:260},rf=(e,t,n)=>($d(e,t)[0]&nf[n])!==0,af=(e,t,n=`any`)=>(Qd(e,t)[0]&nf[n])!==0,of=(e,t)=>{let n=Qd(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},sf=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},cf=(e,t)=>{let n=$d([e],t);return n[0]&16?void 0:sf(n)},lf=(e,t)=>!!($d([e],t)[0]&1),uf=(e,n,r)=>new t(`Applying ${e} to the following value,\nwhich is not ${n}:\n${L(r)}`),df=e=>dn(e)?I(e):void 0,ff=`a function with a finite domain`,pf=(e,t,n)=>{let r=R(e,t,n),i=df(r);if(!i)throw uf(n,ff,r);return i},mf=(e,t)=>{let n=R(e,1,t),r=df(n),i=r&&vf(r,R(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw cs(`second`,t,`bag`,n);return i},hf=(e,t,n)=>{let r=t[n];if(!r||!_f(r))throw cs(n===0?`first`:`second`,`(+)`,`bag`,R(e,n,`(+)`));return r},gf=(e,t)=>{if(!ln(e)||!P(e))throw t();return F(e).elements},_f=e=>e.range.every(e=>typeof e==`number`&&e>0),vf=(e,t)=>{let n=e.domain.findIndex(e=>Wr(t,e));return n===-1?void 0:e.range[n]},yf=(e,t)=>{if(typeof e==`number`)return e;throw t()},bf=(e,t,n)=>{let r=yf(e,n)+yf(t,n);if(_s(r))throw vs(`${e}+${t}`);return r},xf=(e,t,n,r,i)=>{let a=yf(e.range[t],r),o=vf(n,e.domain[t]);if(o===void 0)return a;let s=a-yf(o,i);if(_s(s))throw vs(`${a}-${o}`);return s},Sf=(e,t,n,r,i=e.length)=>{let a=e.slice(0,i).find(e=>Wr(t,e[0]));a?a[1]=bf(a[1],n,r):e.push([t,n])},Cf=e=>e.domain.map((t,n)=>[t,e.range[n]]),wf=ir([],[]),Tf=e=>[ps(`EmptyBag`,wf),z(`IsABag`,1,e=>{let t=df(R(e,0,`IsABag`));return t!==void 0&&_f(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`),n=pf(e,0,`BagCardinality`),r=()=>uf(`BagCardinality`,`a bag`,t);return n.range.reduce((e,t)=>{if(typeof t!=`number`||t<=0)throw r();return bf(e,t,r)},0)}),z(`BagIn`,2,e=>{let t=mf(e,`BagIn`);return t!==void 0&&t>0}),z(`CopiesIn`,2,e=>mf(e,`CopiesIn`)??0),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>df(R(e,t,`(+)`))),n=hf(e,t,0),r=hf(e,t,1),i=Cf(n),a=()=>cs(`second`,`(+)`,`bag`,R(e,1,`(+)`));return r.domain.forEach((e,t)=>Sf(i,e,r.range[t],a,n.domain.length)),$r(i)}),z(`\\ominus`,2,e=>{let t=R(e,0,`(-)`),n=R(e,1,`(-)`),r=df(t),i=df(n);if(!r)throw cs(`first`,`(-)`,`bag`,t);if(!i)throw cs(`second`,`(-)`,`bag`,n);let a=()=>cs(`first`,`(-)`,`bag`,t),o=()=>cs(`second`,`(-)`,`bag`,n);return $r(r.domain.flatMap((e,t)=>{let n=xf(r,t,i,a,o);return n>0?[[e,n]]:[]}))}),z(`BagUnion`,1,e=>{let n=R(e,0,`BagUnion`),r=gf(n,()=>uf(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??wf;let i=()=>new t(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${L(n)}`),a=e=>{let t=df(e);if(!t)throw i();return t},o=Cf(a(r[0]));return r.slice(1).forEach(e=>{let t=a(e);t.domain.forEach((e,n)=>Sf(o,e,t.range[n],i))}),$r(o)}),z(`\\sqsubseteq`,2,e=>{let t=R(e,0,`\\sqsubseteq`),n=R(e,1,`\\sqsubseteq`),r=df(t),i=df(n);if(!r)throw uf(`\\sqsubseteq`,ff,t);if(!i)throw uf(`\\sqsubseteq`,ff,n);let a=()=>uf(`\\sqsubseteq`,`a bag`,t),o=()=>uf(`\\sqsubseteq`,`a bag`,n);return r.domain.every((e,t)=>{let n=vf(i,e);return yf(r.range[t],a)<=(n===void 0?0:yf(n,o))})}),ms(`BagOfAll`,2,e=>{let t=fs(e,0,`BagOfAll`),n=R(e,1,`BagOfAll`),r=df(n);if(!r)throw cs(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[],a=()=>cs(`second`,`BagOfAll`,`bag`,n);return r.domain.forEach((e,n)=>Sf(i,t.call([e]),r.range[n],a)),$r(i)}),z(`SubBag`,1,t=>{let n=R(t,0,`SubBag`);if(!dn(n))throw new w(`Attempted to apply the operator DOMAIN to a non-function\n(${ws(n)})\nline 106, col 58 to line 106, col 65 of module Bags`);let r=I(n),i=F(Jr(r.range)).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new w(`Attempted to apply a function to ${L(r)}, which is not in its domain`);return qr(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>ir(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>da(pf(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=gf(t,()=>uf(`BagToSet`,ff,t));return ir([...n],n.map(()=>1))})],Ef={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},H={none:0,beginObject:1,endObject:2,beginArray:3,endArray:4,true:5,false:6,null:7,singleQuoted:8,doubleQuoted:9,unquoted:10,singleQuotedName:12,doubleQuotedName:13,unquotedName:14,number:16,eof:17},Df={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},Of=[{lower:`true`,upper:`TRUE`,token:H.true},{lower:`false`,upper:`FALSE`,token:H.false},{lower:`null`,upper:`NULL`,token:H.null}],kf=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
|
|
396
|
-
`],[`r`,`\r`],[`f`,`\f`]]),
|
|
393
|
+
`]]),pc=/* @__PURE__ */ new Map([[`Bags`,/* @__PURE__ */ new Map([[`IsABag`,`public static tlc2.value.IBoolValue tlc2.module.Bags.IsABag(tlc2.value.impl.Value)`],[`BagCardinality`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.BagCardinality(tlc2.value.impl.Value)`],[`BagIn`,`public static tlc2.value.IBoolValue tlc2.module.Bags.BagIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`CopiesIn`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.CopiesIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\oplus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagCup(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\ominus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagDiff(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagUnion`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagUnion(tlc2.value.impl.Value)`],[`\\sqsubseteq`,`public static tlc2.value.IBoolValue tlc2.module.Bags.SqSubseteq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagOfAll`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagOfAll(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagToSet`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagToSet(tlc2.value.impl.Value)`],[`SetToBag`,`public static tlc2.value.impl.Value tlc2.module.Bags.SetToBag(tlc2.value.impl.Value)`]])],[`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)`]])],[`TLCExt`,/* @__PURE__ */ new Map([[`AssertError`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`PickSuccessor`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`ToTrace`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.lassoOrdinal(tlc2.value.impl.Value)`],[`CounterExample`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.error(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`Trace`,`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`TLCDefer`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefer(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCNoOp`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcNoOp(tlc2.value.impl.Value)`],[`TLCModelValue`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.tlcModelValue(tlc2.value.impl.Value)`],[`TLCCache`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcEval2(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCFP`,`public static synchronized tlc2.value.impl.IntValue tlc2.module.TLCExt.tlcFingerprint(tlc2.value.impl.Value)`],[`TLCEvalDefinition`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefByName(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCGetOrDefault`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcGetOrDefault(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])]]),mc={kind:`Local`},hc=`$subexpression`,gc=/* @__PURE__ */ new WeakSet,_c=/* @__PURE__ */ new WeakMap,vc=/* @__PURE__ */ new WeakMap,yc=/* @__PURE__ */ new WeakMap,bc=/* @__PURE__ */ new WeakMap,xc=/* @__PURE__ */ new WeakMap,Sc=/* @__PURE__ */ new WeakMap,Cc=/* @__PURE__ */ new WeakSet,wc=/* @__PURE__ */ new WeakSet,Tc=e=>wc.has(e)||Ec(xc.get(e))!==void 0,Ec=e=>e?.find(e=>e.isEmpty?Tc(e.node):Cc.has(e.node))?.error,Dc=/* @__PURE__ */ new WeakMap,Oc=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},kc=new Map([...[`~>`,`-+->`,`\\cdot`,`\\X`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}]),[`'`,{key:`'`,arity:1,kind:`Builtin`}]]),Ac=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,jc=(e,t)=>Ac(e,t)?-1:+!!Ac(t,e),Mc=e=>e.kind===`Operator`?e.params.length:0,Nc=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Pc=e=>e.name.includes(`!`),Fc=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Ic=(e,t,n)=>{let r=t.bindings.get(e);return r&&Ac(r.position,t.location)&&(!n||Ac(r.position,n.start))?r:void 0},Lc=(e,t)=>e!==void 0&&t!==void 0&&g(e)===g(t),Rc=(e,t,n,r)=>{if(t===void 0)return!0;if(Lc(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=g(i),o=t.range&&g(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${cc(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 '${cc(e)}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${cc(e)}. \nThis duplicates the one at ${o}.`}),!1},zc=(e,t,n,r)=>Rc(t,Fc(e,t)??Ic(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Bc=(e,t,n)=>{Rc(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Vc=(e,t,n,r)=>t.reduce((e,t,i)=>zc(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Hc=(e,t,n)=>t.reduce((e,t)=>zc(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Uc=e=>e.kind===`Name`?[e.name]:e.names,Wc=e=>e.flatMap(e=>Uc(e.pattern)),Gc=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.isRecursive:n.isRecursive?Ic(e,t,void 0)!==void 0:Ac(n.location,t.location))?n:void 0},Kc=(e,t)=>{let n=Gc(e,t);if(n){let r=n.isRecursive?t.bindings.get(e):void 0;return{key:t.getKey(n),arity:r?.arity??Mc(n),params:r?.params??Nc(n),kind:`Definition`,range:n.location.range}}let r=Ic(e,t,void 0);return r?.isPending?{key:e,arity:r.arity,params:r.params,kind:r.kind}:r?t.imported.get(e):void 0},qc=(e,t)=>t.facts.has(e)||t.bindings.get(e)?.kind===`Theorem`,Jc=(e,t)=>t.bindings.get(e)?.kind===`Theorem`?t.goals.get(e):void 0,Yc=(e,t,n)=>Fc(t,e)??Kc(e,n),Xc=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Zc=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Xc(e.location,e.spelling??t)},Qc=e=>{if(!(e.kind!==`Apply`||e.argumentsRange)){if(e.args.length===2)return`infix`;if(e.args.length===1)return e.operator===`-.`?`prefix`:`postfix`}},$c=`In module --TLA+ BUILTINS--`,el=/* @__PURE__ */ new Set([`Definition`,`Instance`,`Theorem`]),tl=(e,t,n)=>n.errors.push({location:g(t),message:`Cannot take subexpression of \`${cc(e)}'.`}),nl=e=>!/^[\p{L}\d_]/u.test(e),rl=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),il=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,al=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},ol=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?al(e.name,[],void 0):al(e.operator,e.args,e.argumentCounts),sl=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),cl=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Wc(e.bounds),body:e.body,sets:sl(e.bounds)};case`SetMap`:return{names:Wc(e.bounds),body:e.expression,sets:sl(e.bounds)};case`SetFilter`:return{names:Uc(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Uc(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}},ll=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}},ul=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,dl=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),fl=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?fl(e.body,t):mt(e).reduce((e,n)=>e??fl(n,t),void 0)},pl=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??pl(i,t,n||dl(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&fl(e.set,t):fl(e,t)},ml=e=>e.kind===`Label`?ml(e.body):e,hl=e=>typeof e==`number`?`argument selector ${e}`:e,gl=`within the scope of a declaration
|
|
394
|
+
from outside that declaration's scope.`,_l=(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:g(i),message:n})},o=n.isSuffices===n.isInProof,s=n.statement,c={node:s,isGoal:!0,isSufficesOpen:n.isSuffices},l=0,u=0;for(let[e,n]of t.slice(1).entries()){let r=e+1,i=c.node;if(n.kind===`Name`){if(t[r-1].kind!==`Name`)return i.kind!==`NewSymbol`&&i.kind!==`AssumeProve`&&ml(i).kind===`Let`?i:a(r-1,`A name selector here must be from a LET clause.`);let e=s.kind===`AssumeProve`?[...s.assumptions,s.conclusion]:[s],l=r===1?e.map((e,t)=>({position:t,label:pl(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:i.kind===`Label`?fl(i.body,n.name):void 0};if(!l?.label)return a(r,`Cannot find label \`${n.name}'.`);if(r===1&&s.kind===`AssumeProve`&&dl(s,l.position)&&o)return a(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${gl}`);if(n.args.length!==l.label.params.length)return a(r,`Label \`${n.name}' used with wrong number of arguments.`);c.node=l.label,c.isGoal=!1,c.isSufficesOpen=!1;continue}if(n.kind===`Colon`)return i;let d=n.kind===`Operand`?hl(n.operand):n.kind===`At`?`@`:`!(...)`,f=e=>n.kind===`Operand`?il(n.operand,e):-1,p=`An unexpected null node specified by '${d}'.\nThis is probably due to a previous error.`;if(c.isSufficesOpen){if(f(1)!==0)return a(r,i.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);c.isSufficesOpen=!1;continue}if(i.kind===`NewSymbol`)return i;if(i.kind!==`AssumeProve`){let e=ml(i);if(Cc.has(e))return a(r,`Subexpression selection failed, probably due to an error in the selected expression.`);if([`Number`,`Decimal`,`String`].includes(e.kind))return a(r,`Selecting subexpression of expression that has none.`);if(Tc(e))return a(r,`Choosing operand \`${d}' of subexpression with no operands.`);let t=cl(e);if(t&&n.kind!==`Operand`){let e=n.kind===`Bound`?n.args.length:0;if(n.kind===`Bound`&&e!==t.names.length)return a(r,`Selector with ${e} argument(s) used for quantifier with ${t.names.length} bound identifier(s).`);l+=t.names.length,u+=e,c.node=t.body,c.isGoal=!1;continue}let o=t?.sets,s=e.kind===`Identifier`?[]:o?o.length>0?o:void 0:ll(e);if(!s)return i;let m=e.kind===`Except`,h=f(m?e.updates.length+1:s.length);if(h===-1)return a(r,`Nonexistent operand specified by \`${d}'.`);if(m&&h>0)return a(r,`Selecting subexpression of an EXCEPT not yet implemented.`);if(c.node=s[h],c.isGoal=!1,Cc.has(c.node))return a(r,p);continue}let m=[...i.assumptions,i.conclusion],h=f(m.length);if(h===-1)return a(r,`Nonexistent operand specified by \`${d}'.`);if(dl(i,h)&&(!c.isGoal||o))return a(r,`Accessing ASSUME/PROVE clause ${gl}`);let g=m[h];if(g.kind===`NewSymbol`&&r!==t.length-1)return a(r,`Selected a subexpression of a NEW clause of an ASSUME.`);if(c.node=g,c.isGoal=!1,g.kind!==`NewSymbol`&&g.kind!==`AssumeProve`&&Cc.has(g))return a(r,p)}return c.node.kind===`AssumeProve`?i?c.node:a(void 0,`Selected ASSUME/PROVE instead of expression.`):c.node.kind===`NewSymbol`?i?c.node:a(void 0,`Selected a NEW declaration as an expression or operator.`):l===u?c.node:a(void 0,`Expected ${l} arguments but found ${u}.`)},vl=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:g(e.location.range),message:n}),!0)},yl=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=g(r),a=e.params.filter((r,i)=>{let a=Fc(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:g(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},bl=(e,t,n,r)=>{if(!ul(e))return!1;let i=ol(e),a=i[0],o=i.length>1&&a.kind===`Name`?Fc(t,a.name)?.goal??Jc(a.name,n):void 0;return o&&{node:_l(e,i,o,n,r)}},xl=(e,t,n,r)=>{let i=e.location;if(Pl(e,n,r))return;let a=Dc.get(e);if(a!==void 0)return a;if(Oc(t))return e.kind===`Apply`?e.args.length:0;let o=Fc(n,t);if(o?.isNonFact){r.errors.push({location:g(Zc(e,t)),message:`Step number of non-expression step used as an expression.`});return}let s=o?.goal?.keyword;if(s){r.errors.push({location:g(Zc(e,t)),message:`${s} proof step selected instead of expression.`});return}if(bl(e,n,r,!1)||rl(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=mc),o)return o.arity;let c=Kc(t,r);if(c)return e.kind===`Identifier`?e.name=c.key:e.operator=c.key,Dc.set(e,c.arity),c.arity;let l=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``,u=l===``?void 0:Fc(n,l)??Kc(l,r);if(u&&!el.has(u.kind)){tl(l,e.kind!==`OperatorReference`&&e.selectorRanges?.[0]||Zc(e,t),r);return}if(e.kind!==`OperatorReference`&&l!==``&&Il(l,e.kind===`Apply`&&e.argumentCounts?e.args.slice(0,e.argumentCounts[0]):[],e.selectorRanges?.[0],(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??i.range,n,r))return;if(u||l!==``&&qc(l,r))return e.kind===`Apply`?e.args.length:0;let d=Qc(e),f=e.kind===`OperatorReference`||d!==void 0;if(!nl(t)||rl(t)||!f){r.errors.push({location:g(Zc(e,t)),message:`Unknown operator: \`${cc(t)}'.`});return}let p=e.spelling??t;r.errors.push({location:g(d===`prefix`&&p===`-.`?Xc(i,`-`):Zc(e,t)),message:`Could not find declaration or definition of symbol '${p}'.`}),d&&Cc.add(e),d&&i.range&&r.errors.push({location:g(i.range),message:`Couldn't resolve ${d} operator symbol \`${p}'.`})},Sl=(e,t,n)=>(e.forEach(e=>B(e.set,t,n)),e.reduce((e,t)=>Vc(e,Uc(t.pattern),t.pattern.ranges,n),t)),Cl=(e,t)=>e.kind===`Identifier`&&e.name===t&&M(e)||mt(e).some(e=>Cl(e,t)),wl=(e,t)=>{e.kind===`FunctionConstruction`&&Cl(e.body,t)&&(e.isRecursive=!0),mt(e).forEach(e=>wl(e,t))},Tl=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?Wc(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:g(o),message:e})},c=e.kind===`Function`?Sl(e.bounds,t,i):Hc(t,e.params,i),l=Fc(c,a)??Ic(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${cc(a)} defined at wrong LET/IN level.`):l&&!u?s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${cc(a)} already defined or declared.`):l&&e.kind===`Function`&&l.arity>0?s(`Function ${cc(a)} has operator arguments in its RECURSIVE declaration.`):l&&e.kind===`Operator`&&(l.arity!==e.params.length||e.params.some(e=>e.arity>0))&&s(`Definition of ${cc(a)} has different arity than its RECURSIVE declaration.`),l&&u&&e.kind===`Operator`&&(l.params=Nc(e)),e.kind===`Function`?(B(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),wl(e.body,a),e.isSelfReferential=Cl(e.body,a)):B(e.body,c,i),l&&u?((e.kind===`Operator`||l.arity===0)&&(l.isPending=!1,l.range=o),!1):e.kind===`Function`?l===void 0:Rc(a,Fc(t,a)??Ic(a,i,o),{kind:`Definition`,arity:Mc(e),range:o},i)},El=(e,t,n,r=[],i=[])=>{let a=/* @__PURE__ */ new Set,o=e.filter(e=>e.isRecursive&&i.every(t=>t.name!==e.name)).reduce((e,t)=>{if(Fc(e,t.name)?.isPending)return e;let n={name:t.name,arity:Mc(t),params:Nc(t),kind:`Definition`,parent:e,isPending:!0};return a.add(n),n},t),s=/* @__PURE__ */ new Map,c=(e,t)=>{let r={kind:`Definition`,arity:t.arity,params:Array(t.arity).fill(0),range:t.location.range},i=Rc(t.name,Fc(e,t.name)??Ic(t.name,n,r.range),r,n)?{...r,name:t.name,parent:e,isPending:!0}:void 0;return i&&a.add(i),s.set(t,i),i??e},l=[...n.isGenerated?[]:r,...i].toSorted((e,t)=>jc(e.location,t.location)),u=(e,t)=>{let r=l.findIndex(e=>!t(e));return l.splice(0,r===-1?l.length:r).reduce((e,t)=>`kind`in t?Kl(t,e,n):c(e,t),e)},d=u(e.reduce((e,t)=>{let i=Oc(t.name)?e:u(e,e=>!Ac(t.location,e.location)),o={name:t.name,arity:Mc(t),kind:`Definition`,range:t.location.range,parent:i};if(Pc(t))return{...o,params:Nc(t)};let s=r.some(e=>e.location===t.location),c=n.isGenerated||t.isLocal||Oc(t.name),l=s?{...n,isGenerated:!0,errors:[],warnings:[]}:c?{...n,isGenerated:c}:n;return Tl(t,i,l,a)?{...o,params:Nc(t)}:i},o),()=>!0);return s.forEach((e,t)=>{let r=t.location.range;r&&!n.isGenerated&&(!e||e.isPending)&&n.errors.push({location:g(r),message:`Symbol ${cc(t.name)} declared in RECURSIVE statement but not defined.`})}),d},Dl=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Fc(t,r)??Ic(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity,range:i.range}:void 0},Ol=(e,t,n)=>{if(!ul(e))return!1;let r=ol(e),i=r.findIndex(e=>e.kind!==`Name`),a=Dl(r.slice(0,i===-1?r.length:i).flatMap(e=>e.kind===`Name`?[e.name]:[]).join(`!`),t,n),o=r[0],s=o.kind===`Name`?o.args.length:0;if(!a||s===a.arity)return!1;let c=(e.kind===`Identifier`?void 0:e.argumentRanges?.[0])??e.location.range;return c&&n.errors.push({location:g(c),message:`The operator ${a.name} requires ${a.arity} arguments.`}),!0},kl=(e,t,n,r,i)=>{let a=e?.kind===`Definition`?e.params:void 0;return!e||!a||a.length===e.arity?!1:(r&&!i.isGenerated&&i.errors.push({location:g(r),message:`Wrong number of arguments (${n}) given to operator '${cc(t)}', \nwhich requires ${a.length} arguments.`}),!0)},Al=(e,t,n)=>{let r=e.location.range,i=e=>{r&&n.errors.push({location:g(r),message:e})},a=vc.get(e);if(e.kind===`Lambda`&&e.operator!==void 0)i(`The operator ${cc(e.operator)} requires 1 arguments.`);else if(a)n.errors.push(a);else if(e.kind===`Lambda`&&r)Cc.add(e),i(`LAMBDA expression used where an expression is required.`);else if(e.kind===`OperatorReference`){let r=xl(e,e.operator,t,n);r!==void 0&&i(`The operator ${cc(e.operator)} requires ${r} arguments.`)}else B(e,t,n)},jl=(e,t,n,r,i,a,o)=>{let s=(e,t)=>{e&&o.errors.push({location:g(e),message:t})},c=(e,c)=>{let l=Dl(r,a,o)?.range??Yc(r,a,o)?.range;l&&s(i,`Operator with incorrect arity passed as argument. \nOperator '${cc(e)}' of arity ${c} is argument number ${n+1} (counting from 1) to operator \`${g(l)}', \nbut an operator of arity ${t} was expected.`)},l=e.location.range;if(t===0)return Al(e,a,o),!0;if(e.kind===`Lambda`){gc.has(e)?B(e,a,o):Fl(e,a,o);let u=e.params.length===t;return!u&&gc.has(e)?s(l,`Expected arity ${t} but found operator of arity ${e.params.length}.`):!u&&l&&e.operator===void 0?s(i,`Lambda expression with arity ${e.params.length} used as argument ${n+1} of operator \`${r}', \nbut an operator of arity ${t} is required.`):!u&&e.operator!==void 0&&c(e.operator,e.params.length),u}if(e.kind===`Subexpression`)return B(e,a,o),!0;if(e.kind===`Apply`&&e.argumentCounts?.at(-1)===0){let t=e.argumentCounts.findIndex(e=>e>0);return s(e.selectorRanges?.[t],`Selector \`${e.operator.split(`!`)[t]}' should not have argument(s).`),!1}if(e.kind!==`Identifier`&&e.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${n+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=e.kind===`Identifier`?e.name:e.operator,d=Yc(u,a,o)?.params??[],f=xl(e,u,a,o);return e.kind===`Identifier`&&f!==void 0&&f!==t&&s(Zc(e,u),`Expected arity ${t} but found operator of arity ${f}.`),e.kind===`OperatorReference`&&f!==void 0&&f!==t&&c(u,f),f===t&&d.every(e=>e===0)},Ml=(e,t,n)=>{let r=e.operator,i=Yc(r,t,n),a=Ol(e,t,n)?void 0:xl(e,r,t,n);if(a!==void 0&&a!==e.args.length&&n.errors.push({location:g(e.argumentsRange??Zc(e,r)),message:`The operator ${cc(r)} requires ${a-(Dl(r,t,n)?.arity??0)} arguments.`}),a!==e.args.length){wc.add(e);return}let o=i&&(i.kind===`Definition`?i.params:e.args.map(()=>0));if(o===void 0){e.args.forEach(e=>Nl(e,t,n));return}let s=e.selectorRanges?.at(-1)??Zc(e,r),c=r===hc,l=e.args.slice(0,o.length).map((e,i)=>{let a=c?bc.get(e):void 0;return jl(e,o[i],a?.index??i,a?.operator??r,a?.range??s,t,c?{...n,isGenerated:!1}:n)});kl(i,r,e.args.length,e.location.range,n)||l.forEach((t,i)=>{!t&&e.location.range&&n.errors.push({location:g(e.location.range),message:`Argument number ${i+1} to operator '${c?`LAMBDA`:r}' \nshould be a ${o[i]}-parameter operator.`})})},Nl=(e,t,n)=>{e.kind===`Identifier`?xl(e,e.name,t,n):B(e,t,n)},Pl=(e,t,n)=>{let r=_c.get(e);return r?(r.applications.forEach(e=>e.args.slice(0,e.params.length).forEach((r,i)=>jl(r,e.params[i],i,e.operator,e.range,t,n))),n.errors.push(Ec(r.nulls)??r.error),!0):!1},Fl=(e,t,n)=>B(e.body,Vc(t,e.params,e.paramRanges,n),{...n,labelParams:[...n.labelParams,...e.params]}),B=(e,t,n)=>{if(gc.has(e)&&!n.isGenerated){let r=Ec(xc.get(e));if(r){n.errors.push(r);return}let i=Sc.get(e);if(i){Object.assign(e,i);let t=Dc.get(i);t!==void 0&&Dc.set(e,t)}B(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>B(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:return;case`ExceptAt`:!n.isInExcept&&e.location.range&&(wc.add(e),n.errors.push({location:g(e.location.range),message:`@ used where its meaning is not defined.`}));return;case`Identifier`:{let r=e.name,i=Ol(e,t,n)?void 0:xl(e,r,t,n);if(i===0){let i=Yc(r,t,n),a=i?.kind;(a===`Variable`||a===`Theorem`||a?.startsWith(`New`)||qc(r,n))&&wc.add(e),kl(i,r,0,Zc(e,r),n);return}i!==void 0&&n.errors.push({location:g(Zc(e,r)),message:`The operator ${cc(r)} requires ${i} arguments.`}),wc.add(e);return}case`OperatorReference`:xl(e,e.operator,t,n);return;case`Apply`:Ml(e,t,n);return;case`Lambda`:gc.has(e)?Fl(e,t,n):e.location.range&&(Cc.add(e),n.errors.push({location:g(e.location.range),message:`LAMBDA expression used where an expression is required.`}));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:B(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&B(e.other,t,n);return;case`Let`:B(e.body,El(e.definitions,t,n,e.instances,e.recursive),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:B(e.body,Sl(e.bounds,t,n),i(Wc(e.bounds)));return;case`UnboundedQuantifier`:B(e.body,Vc(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&B(e.set,t,n),B(e.body,Vc(t,Uc(e.pattern),e.pattern.ranges,n),i(Uc(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:B(e.predicate,Sl([e.bound],t,n),i(Uc(e.bound.pattern)));return;case`SetMap`:B(e.expression,Sl(e.bounds,t,n),i(Wc(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:g(r.location.range??Xc(r.location,r.name)),message:`Non-unique fields in constructor.`}),B(r.value,t,n)});return;case`Except`:B(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),B(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:B(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(vl(e,n))return;B(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),yl(e,t,n);return;case`Subexpression`:Ll(e,t,n)&&wc.add(e);return}},Il=(e,t,n,r,i,a)=>{let o=Fc(i,e)??Ic(e,a,void 0);return!o?.isPending||!n||!r?!1:t.length===o.arity?(t.forEach(e=>B(e,i,a)),a.errors.push({location:g(n),message:`Subexpression of \`${e}' used inside the operator's definition.`}),!0):(a.errors.push({location:g(r),message:`The operator ${e} requires ${o.arity} arguments.`}),!0)},Ll=(e,t,n)=>{if(Ol(e,t,n)||Pl(e,t,n))return!0;let r=e.selectors[0],i=e.selectorRanges?.[0],a=e.selectors.findIndex(e=>e.kind!==`Name`),o=e.selectors.slice(0,a).flatMap(e=>e.kind===`Name`?[e.name]:[]),s=o.findIndex((e,t)=>t>0&&Kc(o.slice(0,t+1).join(`!`),n)),c=o.length>1&&(Fc(t,o[0])??Ic(o[0],n,void 0))?.kind===`Instance`,l=e.selectorRanges?.[a-1];if(c&&s===-1&&i&&l)return n.errors.push({location:g({module:i.module,start:i.start,end:l.end}),message:`Unknown operator: \`${cc(o.join(`!`))}'.`}),!0;let u=o.slice(0,s+1).join(`!`),d=s>0?Kc(u,n):void 0,f=e.selectors.slice(0,s+1).flatMap(e=>`args`in e?e.args:[]).length,p=e.argumentRanges?.[s]??e.location.range;if(d&&d.arity!==f&&p)return n.errors.push({location:g(p),message:`The operator ${cc(u)} requires ${d.arity} arguments.`}),!0;if(r.kind===`Name`&&e.selectors[1].kind!==`Name`&&i){let e=Fc(t,r.name),a=e??Kc(r.name,n);if(a===void 0&&!qc(r.name,n)||a?.kind===`Instance`)return n.errors.push({location:g(i),message:`Unknown operator: \`${cc(r.name)}'.`}),!0;if(a&&(!el.has(a.kind)||e?.isNonFact))return tl(r.name,i,n),!0}if(r.kind===`Name`&&Il(r.name,r.args,i,e.argumentRanges?.[0]??e.location.range,t,n))return!0;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Nl(e,t,n));let m=bl(e,t,n,!1);return m?m.node===void 0:!1},Rl=(e,t,n,r)=>{if(e.kind===`ModuleFact`)return;if(e.kind===`ExceptAt`&&e.location.range)return r.errors.push({location:g(e.location.range),message:"Unknown operator: `@'."}),$c;let i=Bl(e,t,n,r);if(Ol(e,n,r))return i;let a=bl(e,n,r,!0);if(a){let t=a.node?.kind;return t===void 0?$c:t===`AssumeProve`||t===`NewSymbol`?void 0:e.location.range&&g(e.location.range)}if(e.kind===`Subexpression`)return Ll(e,n,r)?$c:i;let o=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;return e.kind===`Identifier`&&Fc(n,o)?.isNonFact?(r.errors.push({location:g(Zc(e,o)),message:`Step number of non-fact used as a fact`}),$c):(!qc(o,r)&&!Fc(n,o)?.goal&&B(e,n,r),i)},zl=(e,t,n)=>{let r=e.location.range,i=e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:``;if(i===``||!r)return!0;let a=Fc(t,i)??Kc(i,n)??Ic(i,n,r);return a===void 0&&(qc(i,n)||rl(i))||(a===void 0&&n.errors.push({location:g(r),message:`Unknown operator: \`${cc(i)}'.`}),a&&el.has(a.kind)&&!rl(i))?!0:(n.errors.push({location:g(r),message:`DEF clause entry should describe a defined operator.`}),!1)},Bl=(e,t,n,r)=>{let i=e.location.range&&g(e.location.range);if(gc.has(e))return t.location.range&&g(t.location.range);if(_c.has(e)||e.kind===`ExceptAt`)return $c;switch(e.kind){case`Number`:case`String`:case`Decimal`:case`Let`:case`Label`:return;case`Identifier`:case`Apply`:case`Subexpression`:{let t=ol(e)[0];if(e.kind===`Subexpression`||t.kind!==`Name`)return;let a=e.kind===`Identifier`?e.name:e.operator,o=Fc(n,t.name)?.goal??Jc(t.name,r);if(qc(a,r)||o||rl(a)&&Fc(n,a))return;let s=Yc(a,n,r),c=e.kind===`Apply`?e.args.length:0;return s?.arity===c?i:$c}default:return i}},Vl=(e,t,n)=>{let r=yc.get(e.facts)??e.facts,i=e.facts.map((e,i)=>Rl(e,r[i],t,n)),a=e.defs.filter(e=>zl(e,t,n)).length;i.forEach(t=>{t&&e.kind===`Hide`&&n.errors.push({location:t,message:`The only expression allowed as a fact in a HIDE is
|
|
395
|
+
the name of a theorem, assumption, or step.`})});let o=e.location.range;e.facts.length+a===0&&o&&n.errors.push({location:g(o),message:e.kind===`By`?`Empty BY`:`Empty USE or HIDE statement.`})},Hl=(e,t,n)=>(e.set&&B(e.set,t,n),zc(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Ul=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Hl(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Ul(t,e.scope,e.unit,!0):B(t,e.scope,e.unit),e),{scope:t,unit:n});return B(e.conclusion,i.scope,i.unit),i.scope},Wl=(e,t,n)=>e.kind===`AssumeProve`?Ul(e,t,n):(B(e,t,n),t),Gl=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Vl(e,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Jl(t,e,r),t)},Kl=(e,t,n)=>{let r=eu(e,t,n);return e.name===void 0?r:zc(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},ql=(e,t)=>{let n=(e,t)=>({statement:t,isSuffices:!1,isInProof:!1,keyword:e});switch(e.kind){case`Have`:return n(`HAVE`,{kind:`Tuple`,elements:[e.expression],location:t});case`Case`:return n(`CASE`,{kind:`Tuple`,elements:[e.expression],location:t});case`Witness`:return n(`WITNESS`,{kind:`Tuple`,elements:e.expressions,location:t});case`Take`:return n(`TAKE`,{kind:`Tuple`,elements:sl(e.bounds),location:t});case`Pick`:return n(`PICK`,e.bounds.length>0?{kind:`Exists`,bounds:e.bounds,body:e.body,location:t}:{kind:`UnboundedQuantifier`,quantifier:`Exists`,names:e.names,body:e.body,location:t});case`Qed`:return n(`QED step`,{kind:`Tuple`,elements:[],location:t});default:return}},Jl=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=ql(r,e.location),o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,goal:a},s=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=Wl(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Gl(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0,keyword:r.isSuffices&&r.statement.kind!==`AssumeProve`?`SUFFICES`:void 0};return Gl(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 Vl(r,t,n),s(t);case`Instance`:return s(Kl(r,t,i));case`Define`:return s(r.definitions.reduce((e,t)=>t.kind===`Instance`?Kl(t,e,i):El([t],e,n),t));case`Have`:case`Case`:return B(r.expression,t,i),Gl(e.proof,o(t),n),o(t);case`Witness`:return r.expressions.forEach(e=>B(e,t,i)),o(t);case`Take`:return o(Vc(Sl(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let a=Vc(Sl(r.bounds,t,i),r.names,r.nameRanges,i);return B(r.body,a,{...i,labelParams:[...i.labelParams,...Wc(r.bounds),...r.names]}),Gl(e.proof,o(t),n),o(a)}default:return Gl(e.proof,o(t),n),o(t)}},Yl=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Wl(e.statement,void 0,t);e.name!==void 0&&Bc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Gl(e.proof,n,t),r&&(r.isInProof=!1)},Xl={line:0,column:0},Zl=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Ql=(e,t)=>{let n=new Map([...kc,...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},$l=(e,t,n,r,i)=>{let a=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),r),o=(e,t)=>i.errors.push({location:t,message:`An operator must be substituted for symbol '${cc(e.name)}', and it must have arity ${e.arity}.`}),s=(e,t)=>{let n=t.location.range;if(e.arity===0){Al(t,a,i);return}if(t.kind===`Lambda`){Fl(t,a,i),t.params.length!==e.arity&&n&&o(e,g(n));return}if(t.kind===`OperatorReference`){let r=xl(t,t.operator,a,i);r===void 0?o(e,$c):r!==e.arity&&n&&o(e,g(n));return}if(t.kind!==`Identifier`){n&&i.errors.push({location:g(n),message:`Arity ${e.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${cc(e.name)}'.`}),o(e,$c);return}let r=xl(t,t.name,a,i);r!==void 0&&r!==e.arity&&i.errors.push({location:g(Zc(t,t.name)),message:`Expected arity ${e.arity} but found operator of arity ${r}.`}),r!==e.arity&&o(e,$c)},c=e.location.range,l=t.filter(e=>Fc(a,e.name)!==void 0||Kc(e.name,i)!==void 0).map(t=>({declaration:t,expression:{kind:`Identifier`,name:t.name,location:e.location}}));l.filter(e=>e.declaration.arity===0).forEach(e=>{let t=xl(e.expression,e.declaration.name,a,i);t&&c&&i.errors.push({location:g(c),message:`Wrong number of arguments (0) given to operator '${cc(e.declaration.name)}', \nwhich requires ${t} arguments.`})});let u=/* @__PURE__ */ new Map;return e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){i.errors.push({location:g(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let a=e.expression;s(r,a);let o=a.location.range;u.has(n)?o&&i.errors.push({location:g(o),message:`Multiple substitutions for symbol '${n}' in substitution.`}):u.set(n,a)}),l.filter(e=>!u.has(e.declaration.name)).forEach(e=>{(e.declaration.arity===0?0:xl(e.expression,e.declaration.name,a,i))!==e.declaration.arity&&c&&o(e.declaration,g(c)),u.set(e.declaration.name,e.expression)}),t.filter(e=>!u.has(e.name)).forEach(e=>{let t=e.location.range;c&&t&&i.errors.push({location:g(c),message:`Substitution missing for symbol ${cc(e.name)} declared at ${g(t)} \nand instantiated in module ${n}.`})}),u},eu=(e,t,n)=>{let r=n.getInstance(e);return $l(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,t)=>zc(e,t[0],t[1],n),t)},tu=(e,t,n,r)=>{let i=Ql(n,r.imported),a=new Map([...n.constants,...n.variables].map(e=>[e.name,e.location])),o={location:e.location,errors:[],warnings:[]};return r.reports.push(o),$l(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(e=>[e[0],{...e[1],position:a.get(e[0])??Xl}])),errors:o.errors,warnings:o.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},nu=(e,t)=>{let n=[],r=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>jc(e.location,t.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof s)||!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},ru=(e,t)=>{let n=Ql(e,t.imported),r=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1,keyword:void 0}]]:[])),i=new Map([...kc,...t.bound].map(e=>[e[0],{...e[1],position:Xl}])),a=/* @__PURE__ */ new Set,o=[],s=(e,a,o,s)=>({location:e,check:(c,l)=>s({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:a,facts:t.facts,goals:r,bindings:i,errors:c,warnings:l,hasLabelScope:o,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})}),c=(e,t)=>e.map(e=>s(e.location,void 0,!1,n=>Bc(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return nu([...e.units.flatMap(e=>{let t=e.kind===`Variables`?{type:`A VARIABLE declaration`,location:e.location}:e.kind===`Constants`?{type:`A declaration`,location:e.location}:e.kind===`Module`?{type:`A MODULE `,location:e.module.location}:e.kind===`Theorem`?{type:`A THEOREM`,location:e.theorem.location}:e.kind===`Assumption`?{type:`An ASSUME`,location:e.assumption.location}:e.kind===`Use`?{type:`A USE or HIDE`,location:e.use.location}:void 0,n=t?.location.range;return!t||!n?[]:[{location:t.location,check:e=>{o.some(e=>e.binding?.isPending)&&e.push({location:g(n),message:`${t.type} may not appear within a recursive definition section.`})}}]}),...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...c(e.constants,`Constant`),...c(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>s(e.location,void 0,!1,t=>{let n={kind:`Definition`,arity:e.arity,params:Array(e.arity).fill(0),range:e.location.range,position:e.location,isPending:!0},r=Rc(e.name,i.get(e.name),n,t);r&&(i.set(e.name,n),a.add(n)),o.push({declaration:e,binding:r?n:void 0})})),...e.definitions.map(t=>s(t.location,t,!0,n=>{Zl(e,t)?B(t.body,void 0,n):Tl(t,void 0,n,a)&&i.set(t.name,{kind:`Definition`,arity:Mc(t),range:t.location.range,position:t.location})})),...e.instances.map(e=>s(e.location,void 0,!1,n=>{Hc(void 0,e.params,n),t.instanced.get(e)?.forEach((e,t)=>Bc(t,e,n)),e.name!==void 0&&Bc(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)})),...e.assumptions.map(e=>s(e.location,void 0,e.name!==void 0,t=>{B(e.expression,void 0,t),e.name!==void 0&&Bc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t)})),...e.theorems.map(e=>s(e.location,void 0,e.name!==void 0,t=>Yl(e,t))),...e.uses.map(e=>s(e.location,void 0,!1,t=>Vl(e,void 0,t))),{location:e.location.range?.end??e.location,check:e=>o.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:g(n),message:`Symbol ${cc(t.declaration.name)} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},iu=/* @__PURE__ */ new WeakSet,au=/* @__PURE__ */ new WeakMap,ou=(e,t)=>{if(t.length===0)return e;let n={...e};return iu.has(e)&&iu.add(n),au.set(n,[...t,...au.get(e)??[]]),n},su=(e,t,n=/* @__PURE__ */ new Set)=>{let r=pu(e,(e,r)=>su(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&M(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&M(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},cu=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),lu=/* @__PURE__ */ new WeakMap,uu=e=>lu.get(e)??e.name,du=(e,t)=>(uu(t)!==e.name&&lu.set(e,uu(t)),e),fu=(e,t)=>du(e.kind===`Function`?{...e,bounds:cu(e.bounds,e=>t(e,[])),body:t(e.body,Wc(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),pu=(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=>fu(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:cu(e.bounds,n),body:t(e.body,Wc(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,Uc(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,Uc(e.bound.pattern))};case`SetMap`:return{...e,bounds:cu(e.bounds,n),expression:t(e.expression,Wc(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},mu=(e,t)=>{pu(e,(e,n)=>(t(e,n),e))},hu=`LAMBDA`,gu=e=>`${e}@SUBSTITUTION`,_u=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(_u),vu=(e,t)=>{if(e.kind!==`Identifier`)return!_u(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=M(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!_u(n.body)},yu=(e,t=/* @__PURE__ */ new Set)=>{let n=ht(e),r=n===void 0||t.has(n)?[]:[n];return mu(e,(e,n)=>r.push(...yu(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},bu=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}},xu=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Su=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Cu=(e,t)=>e.map(e=>({pattern:Su(e.pattern,t),set:e.set})),wu=(e,t)=>e.kind===`Function`?{...e,bounds:Cu(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Tu=(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=>du({...wu(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Cu(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Su(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Su(e.bound.pattern,n),set:e.bound.set}};default:return e}},Eu=e=>`${e}@ENABLED`,Du=(e,t)=>e.modes.get(t)??e,Ou=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!M(e)&&t.instantiation.variables.has(e.name),ku=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>ku(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Ou(e,t,n))return[e.name];let r=M(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?ku(r.body,t,/* @__PURE__ */ new Map):void 0},Au=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Ou(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Eu(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Iu(e.expression,Du(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Iu(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Iu(e.subscript,Du(t,`Primed`),n),location:r},Iu(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=ku(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:Eu(r),location:e.location},location:e.location},Iu({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},ju=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:mc}),Mu=(e,t)=>e.map(e=>ju(e.name,t)),Nu=(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:Mu(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),Pu=(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:[...Mu(t,r),...i.map(e=>ju(e,r))],location:r},location:r}},Fu=(e,t)=>e.instantiation.isParameterized(t)?Ru(e,t):void 0,Iu=(e,t,n)=>{let r=e=>Iu(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!M(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Iu(e.expression,Du(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:Iu(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Du(t,`Enabled`),n)};let c=Au(e,t,n);if(c)return c;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name),r=t.bindings;if(n&&(r===void 0||!vu(n,i)))return ou(n,[e]);if(n&&r){let t=gu(e.name);return r.set(t,n),ju(t,e.location)}let o=Fu(t,e.name);if(o===void 0)return e;if(a.length===0)return{...e,name:o};let s=i.getDefinition(e.name);return s&&Mc(s)>0?Pu(o,a,Mc(s),e.location):{kind:`Apply`,operator:o,args:Mu(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),c=i.substitutions.size>0||a.length>0||iu.has(e),l=e=>(c&&iu.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:hu,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:hu,args:n,resolution:mc},location:e.location};if(o)throw new s(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=Fu(t,e.operator);return u===void 0?l({...e,args:n}):{...e,operator:u,args:[...Mu(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=i.substitutions.get(e.operator);if(n?.kind===`Identifier`||n?.kind===`OperatorReference`||n?.kind===`Lambda`)return ou(n,[e]);let r=Fu(t,e.operator);if(r===void 0)return e;let o=i.getDefinition(e.operator);return a.length>0&&o?Pu(r,a,Mc(o),e.location):{...e,operator:r}}let l=bu(t),u=pu(e,(e,i)=>i.length===0?r(e):Iu(e,t,xu(n,i,l)));return Tu(u,n,l)},Lu=(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:ju(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Ru=(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=bu(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=wu(fu(i,(e,t)=>Iu(e,s,xu(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(e=>({kind:`Operator`,name:e[0],params:[],body:e[1],isLocal:!0,isRecursive:!1,location:e[1].location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&au.set(l,[u,...au.get(i.body)??[]]),Lu({...c,body:l},r.params,i.location)}):t},zu=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>yu(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=>Fu(i,e)??e,getQualifiedKey:t=>{let n=Fu(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Lu(r,e.params,r.location)):t}}},Bu=e=>e.kind===`Let`&&e.instances!==void 0||mt(e).some(Bu),Vu=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=pu(e,e=>Vu(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Ac(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},Hu=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Uu=(e,t)=>e.definitions.some(e=>Bu(e.body))||e.assumptions.some(e=>Bu(e.expression))||e.theorems.some(e=>{let t=Hu(e);return t!==void 0&&Bu(t)})?{...e,definitions:e.definitions.map(e=>fu(e,e=>Vu(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Vu(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Hu(e);return n===void 0?e:{...e,statement:Vu(n,t,[])}})}:e,Wu=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]],[`_Track`,0,[0,0],[3,2],[0,0]],[`_Counts`,0,[],[],[]],[`_CheckName`,0,[0],[2],[1]],[`_PrintCounts`,0,[],[],[]]].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}])),Gu={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]}},Ku=(e,t)=>{let n=Gu[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},qu=(e,t)=>`${e}${t}`,Ju=(e,t,n)=>`${e}${t}${n}`,Yu=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Xu=(e,t,n)=>`${e},${t},${n}`,Zu=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Qu=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),$u=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),ed=(e,t)=>{t.constraints.forEach((t,n)=>Qu(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>$u(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},V=(e,t,n,r)=>({...Zu(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),td=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,nd=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,rd=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=>[e[0],{...V(e[0],e[1],[...e[2]],[...e[3]]),nonLeibniz:new Set(e[1]>1?[0,1]:[])}])),id=V(`'`,2,[1],[0]),ad=V(`UNCHANGED`,2,[1],[0]),od=V(`ENABLED`,1,[2],[0]),sd=V(`[]`,3,[3],[0]),cd=V(`<>`,3,[3],[0]),ld=V(`$ConjList`,0,[3],[1]),ud=V(`$DisjList`,0,[3],[1]),dd=V(`$IfThenElse`,0,[3],[1]),fd=V(`$Case`,0,[3],[1]),pd=V(`$BoundedForall`,0,[3],[1]),md=V(`$BoundedExists`,0,[3],[1]),hd=V(`$UnboundedForall`,0,[3],[1]),gd=V(`$UnboundedExists`,0,[3],[1]),_d=V(`$TemporalForall`,3,[3],[0]),vd=V(`$TemporalExists`,3,[3],[0]),yd=V(`$BoundedChoose`,0,[2],[1]),bd=V(`$UnboundedChoose`,0,[2],[1]),xd=V(`$SetEnumerate`,0,[2],[1]),Sd=V(`$Tuple`,0,[2],[1]),Cd=V(`$SetOfFcns`,0,[2],[1]),wd=V(`$CartesianProd`,0,[2],[1]),Td=V(`$SubsetOf`,0,[2],[1]),Ed=V(`$SetOfAll`,0,[2],[1]),Dd=V(`$FcnConstructor`,0,[3],[1]),Od=V(`$RcdConstructor`,0,[3],[1]),kd=V(`$SetOfRcds`,0,[2],[1]),Ad=V(`$Except`,0,[2],[1]),jd=V(`$Pair`,0,[3],[1]),Md=V(`$Seq`,0,[2],[1]),Nd=V(`$FcnApply`,0,[2,2],[1,1]),Pd=V(`$RcdSelect`,0,[2,0],[1,1]),Fd=V(`$SquareAct`,2,[2,1],[0,0]),Id=V(`$AngleAct`,2,[2,1],[0,0]),Ld=V(`$WF`,3,[1,2],[0,0]),Rd=V(`$SF`,3,[1,2],[0,0]),zd=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Bd=e=>e.map(e=>({name:e,arity:0})),Vd=(e,t)=>t.location.range?h(`${e}.`,t.location.range):new s(`${e} at line ${t.location.line}, column ${t.location.column}`),Hd=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Ud=e=>e.kind!==`Let`&&e.kind!==`Label`,Wd=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:y(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=y(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=rd.get(t)??Wu.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=Zu(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(Ju(e,n,t))}),$u(r.argConstraints,qu(e,n),t.data.level),ed(r,t.data)}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);t.forEach((t,n)=>{if(t.kind===`Value`&&t.data.level>td(e,n))throw new s(`Level error in applying operator ${cc(e.name)}:\nThe level of argument ${n+1} 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(Xu(t,n,r)),c=Zu(Math.max(e.level,...t.filter((t,n)=>nd(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>c.params.add(e)),t.forEach((t,n)=>{nd(e,n)===1&&t.data.params.forEach(e=>c.params.add(e))}),n.forEach(e=>e.params.forEach(e=>c.params.add(e))),r.forEach(e=>c.params.delete(e)),e.constraints.forEach((e,t)=>Qu(c.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Qu(c.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Qu(c.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Qu(c.constraints,t,td(e,n))})),t.forEach((e,n)=>{if(e.kind!==`Operator`)return;let r=e.data;t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>Qu(c.constraints,e,td(r,a)))}))}),e.argParams.forEach(e=>{let t=Yu(e),n=a(t.operator);n?.kind===`Operator`&&Qu(c.constraints,t.param,td(n.data,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>$u(c.argConstraints,t,e))),t.forEach((n,r)=>{if(n.kind!==`Declared`)return;let i=n.declared;Array.from({length:i.arity},(t,n)=>$u(c.argConstraints,qu(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&$u(c.argConstraints,qu(i.name,a),e.data.level)}))}),e.argParams.forEach(e=>{let t=Yu(e),n=a(t.operator);n&&$u(c.argConstraints,qu(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Yu(e).param)||c.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),e.argParams.forEach(e=>{let t=Yu(e),n=a(t.operator);if(n)n.kind===`Declared`&&c.argParams.add(Ju(n.declared.name,t.index,t.param));else{let n=a(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(Ju(t.operator,t.index,e)))}}),t.forEach((e,n)=>{if(e.kind!==`Declared`)return;let r=e.declared;t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>c.argParams.add(Ju(r.name,a,e)))}))}),c},a=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:v(`LAMBDA`,Bd(e.params),e.body,t)};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{kind:`Operator`,data:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=Zu();return e.params.add(r),{kind:`Declared`,data:e,declared:{name:r,arity:i.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:Zu()}}return{kind:`Value`,data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),c=(e,t,n,r=[],a=Wc(r))=>{let c=o(t,zd(n,Bd(a))),l=r.map(e=>m(e.set,n)),u=i(e,c,l,a),d=r[l.findIndex(e=>e.level>2)]?.pattern;if(d){let t=d.ranges?.[0];throw new s(`Level error in applying operator ${e.name}:\nThe level of the range for the bounded variable ${t?g(t):Uc(d)[0]} \nexceeds the maximum level allowed by the operator`)}return u},l=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),u=(e,t,n)=>{let r=e.map(e=>e.data.level);if(r.includes(2)&&r.includes(3))throw Vd(`${n} 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 Vd(`Action used where only temporal formula or state predicate allowed`,e);Hd.has(e.operator)&&u(t,e,cc(e.operator))},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Ud(n)&&n.kind!==r)throw Vd(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>ed(i,y(e,n))),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof s)||t.sany?t:Vd(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Zu();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),r=e.kind===`And`;return u(n,e,e.isBulleted?`${r?`Conjunction`:`Disjunction`} list`:r?`\\land`:`\\lor`),i(r?ld:ud,n)}case`Prime`:return c(id,[e.expression],t);case`Unchanged`:return c(ad,[e.expression],t);case`Enabled`:return c(od,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(e.kind===`Always`?sd:cd,[n])}case`If`:return c(dd,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(fd,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=c(e.kind===`Forall`?pd:md,[e.body],t,e.bounds),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Vd(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?e.quantifier===`Forall`?_d:vd:e.quantifier===`Forall`?hd:gd,[e.body],t,[],e.names);case`Choose`:return c(e.set?yd:bd,[e.body],t,e.set?[{pattern:e.pattern,set:e.set}]:[],Uc(e.pattern));case`SetEnumeration`:return c(xd,e.elements,t);case`Tuple`:return c(Sd,e.elements,t);case`FunctionSet`:return c(Cd,[e.domain,e.range],t);case`Product`:return c(wd,e.factors,t);case`SetFilter`:return c(Td,[e.predicate],t,[e.bound]);case`SetMap`:return c(Ed,[e.expression],t,e.bounds);case`FunctionConstruction`:return c(Dd,[e.body],t,e.bounds);case`Record`:return c(Od,e.fields.map(e=>e.value),t);case`RecordSet`:return c(kd,e.fields.map(e=>e.value),t);case`Except`:return i(Ad,[a(e.function,t),...e.updates.map(e=>({kind:`Value`,data:i(jd,[{kind:`Value`,data:i(Md,e.path.map(e=>e.kind===`Field`?{kind:`Value`,data:Zu()}:e.args.length===1?a(e.args[0],t):{kind:`Value`,data:c(Sd,e.args,t)}))},a(e.value,t)])}))]);case`FunctionApplication`:return i(Nd,[a(e.function,t),e.args.length===1?a(e.args[0],t):{kind:`Value`,data:c(Sd,e.args,t)}]);case`Bracket`:return Zu();case`FieldAccess`:return i(Pd,[a(e.record,t),{kind:`Value`,data:Zu()}]);case`BoxAction`:case`AngleAction`:return c(e.kind===`BoxAction`?Fd:Id,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(e.kind===`WeakFairness`?Ld:Rd,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Zu()}},_=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>_(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 mt(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,zd(t,Bd(e.names))),i;default:return mu(e,(e,n)=>a(e,r,zd(t,Bd(n)))),i}},v=(e,t,n,r)=>{let i=zd(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=_(n,i),c={...Zu(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(qu(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(Ju(e.name,n,t.name))).map(e=>Xu(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(Yu(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Yu(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},y=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...Zu(),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=v(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:y,toOperand:a}},Gd=(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`?Gd(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Zu(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),ed(a,e)}),a},Kd=(e,t,n,r)=>{let i=Wd(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`?Gd(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=g(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):[]}):[],l=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:g(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[],u=nu([...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:()=>{let t=i.analyze(e.expression,/* @__PURE__ */ new Map).level,n=e.location.range;if(t!==0&&n)throw h(`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${t}.`,n)}})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?Gd(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...l(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw c(n)}})),...n],r);if(u.length>0)throw c(u,!1,void 0,r)},qd=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),Jd=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Yd=/* @__PURE__ */ new Set([...qd,...Jd,`Enabled`]),Xd=/* @__PURE__ */ new Set([`~>`,`-+->`]),Zd=/* @__PURE__ */ new Set([...Xd,`\\cdot`]),Qd=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),$d=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),ef=/* @__PURE__ */ new Set([`RandomSubset`,`RandomSetOfSubsets`,`TestRandomSetOfSubsets`,`RandomSubsetSet`]),tf=(e,t)=>Qd.has(e)||t.builtins.get(e)?.isStateLevel===!0,nf=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(qd.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(Jd.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&Xd.has(e.operator))return 224},o=(e,n,s)=>{let c=e.kind,l=s?1:513;(Yd.has(c)||c===`UnboundedQuantifier`&&e.isTemporal===!0||c===`Apply`&&Zd.has(e.operator))&&(r[0]|=l),Yd.has(c)&&(r[0]|=16);let u=a(e);n&&u!==void 0&&(r[0]|=u);let d=n&&u===void 0,f=ht(e);if(f!==void 0&&M(e)&&t.variableIndex.has(f)&&(s||(r[0]|=512),d&&(r[0]|=32)),f!==void 0&&!M(e)){let e=t.substitutions.get(f)??f,n=t.definitions.get(e),a=t.constants.has(f),o=t.variableIndex.get(f);if((o!==void 0||t.builtins.get(f)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=l),o!==void 0&&(d&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:d,isOperatorArgument:s||c===`OperatorReference`||c===`Identifier`&&n.kind===`Operator`&&n.params.length>0});else{tf(f,t)&&(r[0]|=2|(f===`Assert`?0:4)),$d.has(f)&&(r[0]|=8),ef.has(f)&&(r[0]|=256),!a&&tf(e,t)&&(r[0]|=16);let n=t.builtins.get(e);d&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}mt(e).forEach(e=>o(e,d,s||c===`Lambda`))};return e.forEach(e=>o(e,!0,!1)),{row:r,edges:i}},rf=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},af=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&513),of=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=nf(pt(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&270,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=rf(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=rf(i,r,u,224),f=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&!e.isOperatorArgument).map(s))),p=rf(i,r,f,512),m=o.map(e=>new Int32Array(e.map(s).filter(e=>!af(t[e],l[e*r]|p[e*r])))),h=rf(a,r,m,270);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|p[t]&512|d[t]&224|h[t]&270:e),words:r}},sf=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?cf(pt(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},cf=(e,t)=>{let n=t.facts.words,r=nf(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=sf(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isOperatorArgument||(i[0]|=r[0]&512),e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}af(e.callee,r[0])||(i[0]|=r[0]&270)}),i},lf=(e,t)=>!(sf(e,t)[0]&513),uf=(e,t)=>!(sf(e,t)[0]&512),df={any:2,repeated:4,streamed:8,replayed:260},ff=(e,t,n)=>(cf(e,t)[0]&df[n])!==0,pf=(e,t,n=`any`)=>(sf(e,t)[0]&df[n])!==0,mf=(e,t)=>{let n=sf(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},hf=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},gf=(e,t)=>{let n=cf([e],t);return n[0]&16?void 0:hf(n)},_f=(e,t)=>!!(cf([e],t)[0]&1),vf=(e,n,r)=>new t(`Applying ${e} to the following value,\nwhich is not ${n}:\n${N(L(r))}`),yf=e=>pn(e)?I(e):void 0,bf=`a function with a finite domain`,xf=(e,t,n)=>{let r=R(e,t,n),i=yf(r);if(!i)throw vf(n,bf,r);return i},Sf=(e,t)=>{let n=R(e,1,t),r=yf(n),i=r&&Ef(r,R(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw fs(`second`,t,`bag`,n);return i},Cf=(e,t,n)=>{let r=t[n];if(!r||!Tf(r))throw fs(n===0?`first`:`second`,`(+)`,`bag`,R(e,n,`(+)`));return r},wf=(e,t)=>{if(!dn(e)||!P(e))throw t();return F(e).elements},Tf=e=>e.range.every(e=>typeof e==`number`&&e>0),Ef=(e,t)=>{let n=e.domain.findIndex(e=>Kr(t,e));return n===-1?void 0:e.range[n]},Df=(e,t)=>{if(typeof e==`number`)return e;throw t()},Of=(e,t,n)=>{let r=Df(e,n)+Df(t,n);if(xs(r))throw Ss(`${e}+${t}`);return r},kf=(e,t,n,r,i)=>{let a=Df(e.range[t],r),o=Ef(n,e.domain[t]);if(o===void 0)return a;let s=a-Df(o,i);if(xs(s))throw Ss(`${a}-${o}`);return s},Af=(e,t,n,r,i=e.length)=>{let a=e.slice(0,i).find(e=>Kr(t,e[0]));a?a[1]=Of(a[1],n,r):e.push([t,n])},jf=e=>e.domain.map((t,n)=>[t,e.range[n]]),Mf=or([],[]),Nf=e=>[_s(`EmptyBag`,Mf),z(`IsABag`,1,e=>{let t=yf(R(e,0,`IsABag`));return t!==void 0&&Tf(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`),n=xf(e,0,`BagCardinality`),r=()=>vf(`BagCardinality`,`a bag`,t);return n.range.reduce((e,t)=>{if(typeof t!=`number`||t<=0)throw r();return Of(e,t,r)},0)}),z(`BagIn`,2,e=>{let t=Sf(e,`BagIn`);return t!==void 0&&t>0}),z(`CopiesIn`,2,e=>Sf(e,`CopiesIn`)??0),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>yf(R(e,t,`(+)`))),n=Cf(e,t,0),r=Cf(e,t,1),i=jf(n),a=()=>fs(`second`,`(+)`,`bag`,R(e,1,`(+)`));return r.domain.forEach((e,t)=>Af(i,e,r.range[t],a,n.domain.length)),ti(i)}),z(`\\ominus`,2,e=>{let t=R(e,0,`(-)`),n=R(e,1,`(-)`),r=yf(t),i=yf(n);if(!r)throw fs(`first`,`(-)`,`bag`,t);if(!i)throw fs(`second`,`(-)`,`bag`,n);let a=()=>fs(`first`,`(-)`,`bag`,t),o=()=>fs(`second`,`(-)`,`bag`,n);return ti(r.domain.flatMap((e,t)=>{let n=kf(r,t,i,a,o);return n>0?[[e,n]]:[]}))}),z(`BagUnion`,1,e=>{let n=R(e,0,`BagUnion`),r=wf(n,()=>vf(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??Mf;let i=()=>new t(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${N(L(n))}`),a=e=>{let t=yf(e);if(!t)throw i();return t},o=jf(a(r[0]));return r.slice(1).forEach(e=>{let t=a(e);t.domain.forEach((e,n)=>Af(o,e,t.range[n],i))}),ti(o)}),z(`\\sqsubseteq`,2,e=>{let t=R(e,0,`\\sqsubseteq`),n=R(e,1,`\\sqsubseteq`),r=yf(t),i=yf(n);if(!r)throw vf(`\\sqsubseteq`,bf,t);if(!i)throw vf(`\\sqsubseteq`,bf,n);let a=()=>vf(`\\sqsubseteq`,`a bag`,t),o=()=>vf(`\\sqsubseteq`,`a bag`,n);return r.domain.every((e,t)=>{let n=Ef(i,e);return Df(r.range[t],a)<=(n===void 0?0:Df(n,o))})}),vs(`BagOfAll`,2,e=>{let t=gs(e,0,`BagOfAll`),n=R(e,1,`BagOfAll`),r=yf(n);if(!r)throw fs(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[],a=()=>fs(`second`,`BagOfAll`,`bag`,n);return r.domain.forEach((e,n)=>Af(i,t.call([e]),r.range[n],a)),ti(i)}),z(`SubBag`,1,t=>{let n=R(t,0,`SubBag`);if(!pn(n))throw new w(`Attempted to apply the operator DOMAIN to a non-function\n(${Os(n)})\nline 106, col 58 to line 106, col 65 of module Bags`);let r=I(n),i=F(Xr(r.range)).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new w(`Attempted to apply a function to ${L(r)}, which is not in its domain`);return Yr(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>or(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>ha(xf(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=wf(t,()=>vf(`BagToSet`,bf,t));return or([...n],n.map(()=>1))})],Pf={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},H={none:0,beginObject:1,endObject:2,beginArray:3,endArray:4,true:5,false:6,null:7,singleQuoted:8,doubleQuoted:9,unquoted:10,singleQuotedName:12,doubleQuotedName:13,unquotedName:14,number:16,eof:17},Ff={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},If=[{lower:`true`,upper:`TRUE`,token:H.true},{lower:`false`,upper:`FALSE`,token:H.false},{lower:`null`,upper:`NULL`,token:H.null}],Lf=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
|
|
396
|
+
`],[`r`,`\r`],[`f`,`\f`]]),Rf=1024,zf=e=>{let t=+!!e.startsWith(``),n=t,r=0,i=t,a=!0,o=H.none,s=0,c=[Pf.emptyDocument],l=[void 0],u=[0],d=()=>`$${c.map((e,t)=>e===Pf.emptyArray||e===Pf.nonemptyArray?`[${u[t]}]`:e===Pf.emptyDocument||e===Pf.nonemptyDocument?``:`.${l[t]??``}`).join(``)}`,f=()=>` at line ${r+1} column ${n-i+1} path ${d()}`,p=e=>new w(`com.google.gson.stream.MalformedJsonException: ${e}${f()}
|
|
397
397
|
See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`),m=()=>new w(`java.io.EOFException: End of input${f()}`),h=()=>{if(!a)throw p(`Use JsonReader.setStrictness(Strictness.LENIENT) to accept malformed JSON`)},g=e=>`/\\;#=`.includes(e)?(h(),!1):!`{}[]:, \f\r
|
|
398
398
|
`.includes(e),_=()=>{for(;n<e.length;){let t=e[n++];if(t===`
|
|
399
399
|
`){r++,i=n;return}if(t===`\r`)return}},v=t=>{for(;n+t.length<=e.length;n++)if(e[n]===`
|
|
400
400
|
`)r++,i=n+1;else if(e.startsWith(t,n))return!0;return!1},y=()=>{for(;n<e.length;){let t=e[n++];if(t===`
|
|
401
|
-
`)r++,i=n;else if(t===`/`){if(n===e.length)return t;h();let r=e[n];if(r!==`*`&&r!==`/`)return t;if(n++,r===`/`)_();else if(v(`*/`))n+=2;else throw p(`Unterminated comment`)}else if(t===`#`)h(),_();else if(t!==` `&&t!==`\r`&&t!==` `)return t}},ee=()=>{let e=y();if(e===void 0)throw m();return e},b=()=>{let t=
|
|
402
|
-
`,n)&&(n+=5),c[t]=
|
|
401
|
+
`)r++,i=n;else if(t===`/`){if(n===e.length)return t;h();let r=e[n];if(r!==`*`&&r!==`/`)return t;if(n++,r===`/`)_();else if(v(`*/`))n+=2;else throw p(`Unterminated comment`)}else if(t===`#`)h(),_();else if(t!==` `&&t!==`\r`&&t!==` `)return t}},ee=()=>{let e=y();if(e===void 0)throw m();return e},b=()=>{let t=If.find(t=>e[n]===t.lower[0]||e[n]===t.upper[0]);if(!t)return H.none;let r=t.lower.length;for(let i=0;i<r;i++){let r=e[n+i];if(r!==t.lower[i]&&r!==t.upper[i])return H.none}return n+r<e.length&&g(e[n+r])?H.none:(n+=r,t.token)},x=()=>{let t=Ff.none,r=!1,i=0;for(;n+i<e.length;i++){if(i===Rf)return H.none;let a=e[n+i];if(a===`-`){if(t===Ff.none)t=Ff.sign;else if(t===Ff.exponentE)t=Ff.exponentSign;else return H.none}else if(a===`+`){if(t!==Ff.exponentE)return H.none;t=Ff.exponentSign}else if(a===`e`||a===`E`){if(t!==Ff.digit&&t!==Ff.fractionDigit)return H.none;t=Ff.exponentE}else if(a===`.`){if(t!==Ff.digit)return H.none;t=Ff.decimal}else if(a<`0`||a>`9`){if(g(a))return H.none;break}else if(t===Ff.sign||t===Ff.none)r=a===`0`,t=Ff.digit;else if(t===Ff.digit){if(r)return H.none}else t===Ff.decimal?t=Ff.fractionDigit:(t===Ff.exponentE||t===Ff.exponentSign)&&(t=Ff.exponentDigit)}return i===Rf||t!==Ff.digit&&t!==Ff.fractionDigit&&t!==Ff.exponentDigit?H.none:(s=i,H.number)},te=()=>{let t=c.length-1,r=c[t];if(r===Pf.emptyArray)c[t]=Pf.nonemptyArray;else if(r===Pf.nonemptyArray){let e=ee();if(e===`]`)return H.endArray;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated array`)}else if(r===Pf.emptyObject||r===Pf.nonemptyObject){if(c[t]=Pf.danglingName,r===Pf.nonemptyObject){let e=ee();if(e===`}`)return H.endObject;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated object`)}let e=ee();if(e===`"`)return H.doubleQuotedName;if(e===`'`)return h(),H.singleQuotedName;if(e===`}`){if(r!==Pf.nonemptyObject)return H.endObject;throw p(`Expected name`)}if(h(),n--,g(e))return H.unquotedName;throw p(`Expected name`)}else if(r===Pf.danglingName){c[t]=Pf.nonemptyObject;let r=ee();if(r===`=`)h(),e[n]===`>`&&n++;else if(r!==`:`)throw p(`Expected ':'`)}else if(r===Pf.emptyDocument){if(y()===void 0)return H.eof;n--,e.startsWith(`)]}'
|
|
402
|
+
`,n)&&(n+=5),c[t]=Pf.nonemptyDocument}else if(r===Pf.nonemptyDocument){if(y()===void 0)return H.eof;h(),n--}let i=y();if(i===void 0){if(r===Pf.emptyDocument)return H.eof;throw m()}if(i===`]`&&r===Pf.emptyArray)return H.endArray;if(i===`]`||i===`;`||i===`,`){if(r!==Pf.emptyArray&&r!==Pf.nonemptyArray)throw p(`Unexpected value`);return h(),n--,H.null}if(i===`'`)return h(),H.singleQuoted;if(i===`"`)return H.doubleQuoted;if(i===`[`)return H.beginArray;if(i===`{`)return H.beginObject;n--;let a=b();if(a!==H.none)return a;let o=x();if(o!==H.none)return o;if(!g(e[n]))throw p(`Expected value`);return h(),H.unquoted},S=()=>(o===H.none&&(o=te()),o),ne=()=>{if(n===e.length)throw p(`Unterminated escape sequence`);let t=e[n++];if(t===`u`){if(n+4>e.length)throw p(`Unterminated escape sequence`);let t=e.slice(n,n+4);if(!/^[\da-fA-F]{4}$/.test(t))throw p(`Malformed Unicode escape \\u${t}`);return n+=4,String.fromCharCode(Number.parseInt(t,16))}let a=Lf.get(t);if(a!==void 0)return a;if(t===`
|
|
403
403
|
`)return r++,i=n,t;if(`'"\\/`.includes(t))return t;throw p(`Invalid escape sequence`)},C=t=>{let a=``,o=n;for(;n<e.length;){let s=e[n++];if(s===t)return a+e.slice(o,n-1);s===`\\`?(a+=e.slice(o,n-1)+ne(),o=n):s===`
|
|
404
|
-
`&&(r++,i=n)}throw p(`Unterminated string`)},re=()=>{let t=n;for(;n<e.length&&g(e[n]);)n++;return e.slice(t,n)},T=e=>{if(c.length-1>=255)throw new w(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${f()}`);c.push(e),l.push(void 0),u.push(0),o=H.none},ie=()=>{c.pop(),l.pop(),u.pop(),u[c.length-1]++,o=H.none},ae=()=>{let e=S();return e!==H.endObject&&e!==H.endArray&&e!==H.eof},oe=()=>{let e=S(),t=e===H.unquotedName?re():C(e===H.singleQuotedName?`'`:`"`);return o=H.none,l[c.length-1]=t,t},se=t=>t===H.true||t===H.false?t===H.true:t===H.null?null:t===H.number?(n+=s,{literal:e.slice(n-s,n)}):t===H.unquoted?re():C(t===H.singleQuoted?`'`:`"`),ce=()=>{let e=S();if(e===H.beginArray){T(Ef.emptyArray);let e=[];for(;ae();)e.push(ce());return ie(),e}if(e===H.beginObject){T(Ef.emptyObject);let e=/* @__PURE__ */ new Map;for(;ae();)e.set(oe(),ce());return ie(),e}let t=se(e);return o=H.none,u[c.length-1]++,t};if(S()===H.eof)return null;let le=ce();return a=!1,le!==null&&S(),le},Mf=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),Nf=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),Pf=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),Ff=e=>{if(!dn(e))return;let t=I(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?di(n):void 0},If=(e,t)=>{let n=`tlc2.value.impl.${Cs(e)}`,r=`tlc2.value.impl.${t}`;return new w(`class ${n} cannot be cast to class ${r} (${n} and ${r} are in unnamed module of loader 'app')`)},Lf=e=>new w(`Cannot convert value: unsupported value type tlc2.value.impl.${Cs(e)}`),Rf=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),zf=e=>`[${e.map(Uf).join(`,`)}]`,Bf=e=>`{${bn(e).map(e=>`${Rf(typeof e[0]==`string`?e[0]:L(e[0]))}:${Uf(e[1])}`).join(`,`)}}`,Vf=e=>{let t=I(e),n=Vi(t);return n?zf(n):Bf(t)},Hf=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,Uf=e=>typeof e==`string`?Rf(e):typeof e==`object`?e.kind===`ModelValue`?Rf(e.name):Cs(e)===`RecordValue`?Bf(I(e)):Wf(e):String(e),Wf=e=>{let t=Cs(e);if(t===`TupleValue`)return zf(I(e).range);if(Hf(t))return Vf(e);if(pi(e))return zf(F(e).elements);throw Lf(e)},Gf=e=>e.map(e=>`${Uf(e)}\n`).join(``),Kf=e=>{let t=Cs(e);if(t===`RecordValue`)return Bf(I(e));if(t===`TupleValue`)return`{${I(e).range.map((e,t)=>`"${t}":${Uf(e)}`).join(`,`)}}`;if(Hf(t))return Vf(e);throw Lf(e)},qf=e=>{if(e===null)throw new w(`Cannot convert value: unsupported JSON value null`);if(typeof e==`boolean`)return e;if(typeof e==`string`)return Vn(e);if(Array.isArray(e))return ui(e.map(qf));if(e instanceof Map)return di([...e].map(e=>[Vn(e[0]),qf(e[1])]));let t=Number(e.literal);if(!/^-?\d+$/.test(e.literal)||_s(t))throw new w(`Cannot convert value: expected a 32-bit integer JSON number, but found ${e.literal}`);return t||0},Jf=e=>{if(typeof e!=`string`)throw new w(`Cannot cast tlc2.value.impl.${Cs(e)} to tlc2.value.impl.StringValue`);return e},Yf=(e,t)=>{let n=la(e,t);if(typeof n!=`string`)throw If(n,`StringValue`);return n},Xf=e=>{if(!Nf.has(e.toLowerCase()))throw Pf.has(e.toLowerCase())?new p(`IOUtils!Serialize does not support the charset ${e}`):new w(/^[a-zA-Z\d][\w.:+-]*$/.test(e)?`java.nio.charset.UnsupportedCharsetException: ${e}`:`java.nio.charset.IllegalCharsetNameException: ${e}`)},Zf=(e,t,n,r)=>{let i=n.find(e=>!Mf.has(e));if(i!==void 0)throw new w(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${i}`);if(n.includes(`READ`))throw new w(`java.lang.IllegalArgumentException: READ not allowed`);let a=new Set(n.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:n);if(a.has(`APPEND`)&&a.has(`TRUNCATE_EXISTING`))throw new w(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(a.has(`DELETE_ON_CLOSE`))throw new p(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let o=e.readFile?.(t);if(o===void 0&&!a.has(`CREATE`)&&!a.has(`CREATE_NEW`))throw new w(`java.nio.file.NoSuchFileException: ${t}`);if(o!==void 0&&a.has(`CREATE_NEW`))throw new w(`java.nio.file.FileAlreadyExistsException: ${t}`);o===void 0||a.has(`TRUNCATE_EXISTING`)?e.writeFile?.(t,r):e.writeFile?.(t,a.has(`APPEND`)?o+r:r+o.slice(r.length))},Qf=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},$f=(e,t)=>{let n=e.readFile?.(t);if(n===void 0)throw new w(`${t} (No such file or directory)`);return n},ep=e=>[Es(hs(`ToJson`,1,e=>Vn(Uf(R(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),Es(hs(`ToJsonArray`,1,e=>Vn(Wf(R(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),Es(hs(`ToJsonObject`,1,e=>Vn(Kf(R(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),Es(hs(`JsonSerialize`,2,t=>{let n=Jf(R(t,0,`JsonSerialize`)),r=R(t,1,`JsonSerialize`);if(!Vi(r)&&!Ff(r))throw cs(`second`,`JsonSerialize`,`sequence or record`,r);return Qf(e,n),e.writeFile?.(n,Uf(r)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Es(hs(`ndJsonSerialize`,2,t=>{let n=Jf(R(t,0,`ndJsonSerialize`)),r=R(t,1,`ndJsonSerialize`),i=Vi(r);if(!i)throw cs(`second`,`ndJsonSerialize`,`sequence`,r);return Qf(e,n),e.writeFile?.(n,Gf(i)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Es(hs(`JsonDeserialize`,1,t=>qf(jf($f(e,Jf(R(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),Es(hs(`ndJsonDeserialize`,1,t=>ui($f(e,Jf(R(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>qf(jf(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],tp=(e,t)=>[Es(Ms(`Serialize`,3,(n,r)=>{let i=Ns(n,2,`Serialize`)(),a=Ff(i);if(!a)throw cs(`third`,`ndJsonSerialize`,`sequence`,i);if(Yf(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Ns(n,0,`Serialize`)(),s=Vi(o);if(!s)throw cs(`first`,`Serialize`,`sequence`,o);let c=Ns(n,1,`Serialize`)();if(typeof c!=`string`)throw cs(`second`,`ndJsonSerialize`,`sequence`,c);let l=la(a,`openOptions`);if(Cs(l)!==`TupleValue`)throw If(l,`TupleValue`);let u=Yf(a,`charset`),d=I(l).range.map(e=>{if(typeof e!=`string`)throw If(e,`StringValue`);return e});return Xf(u),Zf(e,c,d,Gf(s)),!0}),`public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`)],np={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},rp=e=>{let t=[],n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=0,a=tr(),o=e=>t.push(e&255),s=e=>{o(e>>8),o(e)},c=e=>{s(e>>16),s(e)},l=e=>e>32767?c(-e):s(e),u=e=>{o(np.string),c(0),c(-1),c(e.length),e.split(``).forEach(e=>o(e.charCodeAt(0)))},d=e=>{o(np.handle),l(e)},f=e=>{if(typeof e==`boolean`){o(np.boolean),o(+!!e);return}if(typeof e==`number`){o(np.integer),c(e);return}if(typeof e==`string`){i++,u(e);return}if(e.kind===`ModelValue`){o(np.modelValue),s(a.indexOf(e));return}if(e.kind===`Interval`){o(np.interval),c(e.low),c(e.high);return}let t=n.get(e);if(t!==void 0){d(t);return}if(n.set(e,i++),ln(e)){let t=F(e).elements;o(np.set),c(t.length),t.forEach(f);return}let p=I(e),m=sr(e);m===`tuple`?(o(np.tuple),l(p.range.length),p.range.forEach(f)):m===`record`?(o(np.record),c(p.domain.length),p.domain.forEach((e,t)=>{let n=String(e),a=r.get(n);a===void 0?(r.set(n,i++),u(n)):d(a),f(p.range[t])})):(o(np.function),l(p.domain.length),o(1),p.domain.forEach((e,t)=>{f(e),f(p.range[t])}))};return f(e),ae(Uint8Array.from(t))},ip=e=>[Es(hs(`_TLCTraceSerialize`,2,t=>{let n=Jf(R(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,rp(R(t,0,`_TLCTraceSerialize`))),!0}),`public static final tlc2.value.IValue tlc2.module._TLCTrace.ioSerialize(tlc2.value.IValue,tlc2.value.impl.StringValue) throws java.io.IOException`)],ap=25214903917n,op=(1n<<48n)-1n,sp=e=>{let t=(BigInt.asUintN(64,e)^ap)&op,n=e=>(t=t*ap+11n&op,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^ap)&op},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<=2147483647)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},cp=[],lp=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},up=()=>{for(let e=1277011;cp.length<1341;e++)lp(e)&&cp.push(e);return cp},dp=e=>{let t=up(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},fp=e=>{let t=[],n=e;for(let e=2;e*e<=n;e++)for(;n%e===0;)t.push(e),n/=e;return n>1&&t.push(n),t},pp=e=>{for(let t=Math.max(e,9);;t++){let e=fp(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)}}},mp=(e,t,n)=>{if(t<=0)return[];let r=pp(t),i=BigInt(n.nextInt(t)),a=BigInt(dp(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},hp=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:$t),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},gp=(1n<<63n)-1n-24n,_p=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(gp*BigInt(n)+i)%t;return r<0n?r+t:r})},vp=(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,yp=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=ci(e.domain),n=F(e.range).elements;return{lists:t.map(()=>n),create:e=>ir(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>F(e).elements),create:t=>di(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>F(e).elements),create:ui}}},bp=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,xp=(e,t,n,r)=>{if(Ni(t))return[];let i=r===`1.7.4`?hp:mp;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=bp(t,r)?void 0:yp(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?_p(e,t,n):i(e,Number(t),n)).map(e=>a.create(vp(a.lists,e)))}let o=F(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},Sp=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...ls(e.domain,`RandomElement`,e).elements];return ir(n,n.map(()=>Sp(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return di(e.names.map((n,r)=>[n,Sp(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return ui(e.factors.map(e=>Sp(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 w(`Attempted to retrieve out-of-bounds element from the interval value ${L(e)}.`);return e.low+r}let n=ls(e,`RandomElement`).elements,r=Math.floor(t.nextDouble()*n.length);if(r>=n.length)throw new w(`Index ${r} out of bounds for length ${n.length}`);return n[r]},Cp=(e,t,n)=>{if(typeof e!=`number`||e<0)throw cs(t,n,`nonnegative integer`,e);return e},wp=(e,t,n,r)=>qr(Array.from({length:t},()=>qr(e.filter(()=>r.nextDouble()<n)))),Tp=(e,t)=>{let n=`RandomSetOfSubsets`,r=Cp(R(e,0,n),`first`,n),i=Cp(R(e,1,n),`second`,n),a=R(e,2,n);if(!ln(a)||!P(a))throw cs(`third`,n,`finite set`,a);let o=F(a).elements;if(o.length<31&&r>2**o.length)throw cs(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw cs(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return wp(o,r,o.length===0?0:i/o.length,t.getRandom())},Ep=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,Dp=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,Op=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(Ep.test(t))return Number(t.replace(/[fFdD]$/,``));let n=Dp.exec(t);if(!n)return;let r=n[3]??``,i=`${n[2]}${r}`;if(i===``)return;let a=Number.parseInt(i,16)*2**(Number(n[4])-4*r.length);return n[1]===`-`?-a:a},kp=e=>z(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=Cp(R(t,0,n),`first`,n),i=R(t,1,n);if(typeof i!=`string`)throw cs(`second`,n,`string literal representing a probability`,i);let a=Op(i);if(a===void 0||a<0||a>1)throw cs(`second`,n,`string literal does not represent a parsable probability`,i);let o=R(t,2,n);if(!ln(o)||Wn(o)||!Ri(o))throw cs(`third`,n,`finite set`,o);let s=Ii(o);if(32-Math.clz32(r)>s&&r>1<<s)throw cs(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return wp(F(o).elements,r,a,e.getRandom())}),Ap=e=>[Es(z(`RandomSubset`,2,t=>{let n=Cp(R(t,0,`RandomSubset`),`first`,`RandomSubset`),r=R(t,1,`RandomSubset`);if(!pi(r)||!Ri(r))throw cs(`second`,`RandomSubset`,`a finite set`,r);let i=bp(r,e.version);if(i&&i.reduce((e,t)=>e*F(t).elements.length,1)>rn())throw new w(an());return qr(xp(n,r,e.getRandom(),e.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),z(`RandomSetOfSubsets`,3,t=>Tp(t,e)),z(`TestRandomSetOfSubsets`,3,t=>ui(Array.from({length:5},()=>F(Tp(t,e)).elements.length)))],jp=(e,t=0n)=>{let n=sp(t),r=sp(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>di([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,markExplored:void 0,getSuccessorAction:()=>void 0,toRecord:()=>({}),setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:xo,getSimulationValue:void 0,getRandom:()=>{let e=a?void 0:o.getCurrentState();return e===void 0?n:(e!==i&&(r.setSeed(o.getFingerprint(e)^BigInt.asUintN(64,t)),i=e),r)},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,readLine:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return o},Mp=e=>$r([...e.possibleCounts].map(e=>[e[0],e[1]])),Np=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Mp(e)]]),Pp=e=>di([[`name`,e??`UnnamedAction`],[`location`,di([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),Fp=/* @__PURE__ */ new WeakSet,Ip=(e,t)=>{let n=di([[`action`,qr(e)],[`state`,qr(t)]]);return Fp.add(n),n},Lp=(e,t,n)=>{let r=e.map((e,t)=>ui([t+1,di(Object.entries(e))])),i=r.slice(1).map((e,n)=>ui([r[n],t[n],e])),a=n?[ui([r[r.length-1],n.action,r[n.start]])]:[];return Ip([...i,...a],r)},Rp=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Np(e).get(t)},zp=(e,n,r,i)=>{if(typeof r==`number`&&r>=0)e.registers.set(r,i);else if(r===`exit`)i===!0&&(e.isStopped=!0);else if(r===`pause`){if(i!==!0||!e.pause)return;n(`Press enter to resume model checking.`),e.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))e.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))e.properties.set(r.slice(2),L(i));else throw new t(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${L(r)}`)},Bp=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:U(e),Vp=e=>e.every(e=>e!==void 0),Hp=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!M(e);if(i&&t.variableIndex.has(r))return 1;let a=mt(e).map(e=>Hp(e,t,n)),o=i?s_(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(Hp(o.body,t,n))),Math.max(0,...a)},Up=(e,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[Ms(`AssertError`,2,e=>{let t=fs(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw new w(`In computing AssertError, a non-string expression (${Bp(t)}) was used as the err of an AssertError(err, exp).`);let r=Ns(e,0,`AssertError`)();try{Ns(e,1,`AssertError`)()}catch(e){if(e instanceof w)return It(e.message,n.isTool)===r;throw e}return!1}),hs(`TLCGetOrDefault`,2,e=>Rp(n,R(e,0,`TLCGetOrDefault`))??R(e,1,`TLCGetOrDefault`)),hs(`Trace`,0,(e,t)=>{let r=t?.environment.variables??[],i=t?.state??r.map(()=>void 0);if(!t||!Vp(i)){let e=r.filter((e,t)=>i[t]===void 0);throw new w(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return t.state?ui(n.getBehavior(i).map(e=>{let r=t.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return di(i===void 0?r:[[`_action`,i],...r])})):ui([di([])])}),hs(`CounterExample`,0,()=>n.counterExample??Ip([],[])),z(`ToTrace`,1,e=>{let n=R(e,0,`ToTrace`);if(typeof n!=`object`||!Fp.has(n))throw new t(`The argument of ToTrace should be a CounterExample, but instead it is:\n${L(n)}`);let r=F(la(n,`state`)).elements.map(e=>Vi(e)??[]);return ui(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,e=>{let n=R(e,0,`TLCModelValue`);if(typeof n!=`string`)throw new t(`The argument of ModelValue should be a string, but instead it is:\n${L(n)}`);return er(n)}),Ms(`TLCDefer`,1,(e,t)=>{let r=fs(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{W(r,{...t,next:e})}),!0}),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),{...Ms(`PickSuccessor`,1,(t,r)=>{let i=r?.next??(r?.environment.variables??[]).map(()=>void 0);if(n.getSimulationValue===void 0&&(!Vp(i)||r?.next&&n.isSeen(i)))return!0;let a=fs(t,0,`PickSuccessor`),o=a.call([]);if(typeof o!=`boolean`)throw new w(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${ws(o)}) was used as the condition of an IF.\n${a.expression?Bp(a.expression):``}`);if(o||!r?.next||!Vp(i)||!r.state||!Vp(r.state))return!0;let s=r.state,c=n.getSuccessorAction(s,i),l=t=>e(Tt(n.isTool,St.moduleOverrideStdout,Ct.none,t));for(;;){l(`Extend behavior of length ${n.getLevel(s)} with a "${c?.name}" step [<Action ${c?.location.range&&g(c.location.range)}>]? (Yes/no/explored/states/diff):`);let e=n.readLine?.();if(e===void 0)throw new T;if(/^[\0-\x20]*$/.test(e)||e.toLowerCase().startsWith(`y`))return!0;if(e[0]===`s`)l(`${Ga(n.toRecord(s)).trimEnd()}\n~>\n${Ga(n.toRecord(i)).trimEnd()}`);else if(e[0]===`d`)l(Ga(n.toRecord(i),n.toRecord(s)));else if(e[0]===`e`){if(n.markExplored)return n.markExplored(i),!0;if(n.getSimulationValue===void 0)throw new p(`tla-ts can't mark a state explored while it searches depth first.`);l(`Marking a state explored is unsupported by the current TLC mode. Is TLC running in simulation mode?`)}else if(e[0]===`n`)return!1}}),isActionLevel:!0},Ms(`TLCCache`,2,(e,t)=>{let i=fs(e,0,`TLCCache`),o=Aa(Ns(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=Hp(s,t.environment,/* @__PURE__ */ new Set);if(c===2)return i.call([]);let l=c===1;if(l&&t.state&&n.getSimulationValue===void 0)return i.call([]),i.call([]);let u=l&&t.state?a(t.state):r,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=i.call([]);return d.set(o,p),p}),z(`TLCFP`,1,e=>{let t=R(e,0,`TLCFP`),n=xa(t);if(n)throw n;return Number(BigInt.asIntN(32,xo([t])))}),Ms(`TLCEvalDefinition`,1,(e,n)=>{let r=Ns(e,0,`TLCEvalDefinition`)();if(typeof r!=`string`)throw new t(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${L(r)}`);let i=n?s_(r,n.environment):void 0,a=i?void 0:n?.environment.builtins.get(r);if(a?.arity===0)return a.evaluate([],n);if(!i||!n)throw new t(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${L(r)}`);if(i.kind===`Operator`&&i.params.length>0){let e=i.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new t(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${r}(${e.join(`, `)})`)}return i.kind===`Operator`?W(i.body,n):W({kind:`Identifier`,name:r,location:i.location},n)})]},Wp=(e,t)=>[hs(`_Track`,2,e=>{let n=String(R(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,R(e,0,`_Track`)===!0?r+1:r),!0}),hs(`_Counts`,0,()=>Mp(t)),hs(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(Mp(t),!0)),!1)}),hs(`_PrintCounts`,0,()=>(e(L(Mp(t),!0)),!0))],Gp=e=>`${e.getUTCFullYear()}.${Lt(e.getUTCMonth()+1)}.${Lt(e.getUTCDate())}.${Lt(e.getUTCHours())}${Lt(e.getUTCMinutes())}${Lt(e.getUTCSeconds())}`,Kp=e=>$r([...e].map(e=>[e[0],ui([e[1]])])),qp=e=>or(ei(e),`record`),Jp=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Yp=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Xp=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Zp=(e,n,r)=>{if(e.version===`1.7.4`?!Yp.has(n)||!e.isStarted&&Xp.has(n):!e.isStarted&&Jp.has(n))throw new t(`TLCGet(${n}) was undefined.`);let i=e.getSimulationValue?.(n,r);if(i!==void 0)return i;let a=Math.floor((Date.now()-e.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:e.getLevel(r);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return a;case`stats`:return qp([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,a],[`worker`,0]]);case`config`:return qp([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,String(BigInt.asIntN(64,Ja()))],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return qp([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Vn(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Vn(Gp(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Pp(void 0);case`all`:return Kp(e.registers);case`all:named`:return Kp(Np(e))}if(n.startsWith(`s:`)){let r=Np(e).get(n);if(r===void 0)throw new t(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return Vn(e.properties.get(n.slice(2))??n);throw new t(`TLCGet(${n}) was undefined.`)},Qp=(e,n,r)=>{if(typeof n==`number`&&n>=0){let r=e.registers.get(n);if(r===void 0)throw new t(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new t(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${L(n)}`);return Zp(e,n,r?.state)},$p=e=>e.length===0?[[]]:e.flatMap((t,n)=>$p([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),em=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&F(e).elements.forEach(em),e.kind===`Function`&&e.range.forEach(em))},tm=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`ModelValue`:case`Function`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return I(e);default:return F(e)}},nm=(e,n)=>[z(`Print`,2,t=>(e(Va([R(t,0,`Print`),R(t,1,`Print`)]).map(N).join(` `)),R(t,1,`Print`))),z(`PrintT`,1,t=>(e(N(Va([R(t,0,`PrintT`)])[0])),!0)),z(`Assert`,2,e=>{if(R(e,0,`Assert`)!==!0)throw new t(`The first argument of Assert evaluated to FALSE; the second argument was:\n${N(L(R(e,1,`Assert`)))}`,S.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>$r([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=R(e,0,`@@`),n=R(e,1,`@@`),r=dn(t)?I(t):void 0,i=dn(n)?I(n):void 0;if(!r)throw cs(`first`,`@@`,`function`,t);if(!i)throw cs(`second`,`@@`,`function`,n);let a=yn(r),o=yn(i).filter(e=>!a.some(t=>Wr(e[0],t[0])));return ei([...a,...o])}),z(`ToString`,1,e=>Vn(L(R(e,0,`ToString`),!0))),{...Ms(`TLCEval`,1,(e,t)=>{let n=tm(Ns(e,0,`TLCEval`)());return t===void 0&&em(n),n}),isStateLevel:!1},z(`Permutations`,1,e=>{let t=ls(R(e,0,`Permutations`),`Permutations`).elements;return qr($p(t).map(e=>$r(t.map((t,n)=>[t,e[n]]))))}),ms(`SortSeq`,2,e=>{let t=R(e,0,`SortSeq`),n=Vi(t);if(!n)throw cs(`first`,`SortSeq`,`natural number`,t);let r=fs(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw cs(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t=a.length;for(;t>0&&i(e,a[t-1]);)t--;a.splice(t,0,e)}),ui(a)}),n.version===`1.7.4`?Es({...hs(`TLCGet`,1,(e,t)=>Qp(n,R(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Es(Ms(`TLCGet`,1,(e,t)=>Qp(n,Ns(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),hs(`TLCSet`,2,t=>(zp(n,e,R(t,0,`TLCSet`),R(t,1,`TLCSet`)),!0)),ps(`Any`,Jn),z(`RandomElement`,1,e=>Sp(R(e,0,`RandomElement`),n.getRandom()))],rm=`----------------------------- MODULE Bags --------------------------------
|
|
404
|
+
`&&(r++,i=n)}throw p(`Unterminated string`)},re=()=>{let t=n;for(;n<e.length&&g(e[n]);)n++;return e.slice(t,n)},T=e=>{if(c.length-1>=255)throw new w(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${f()}`);c.push(e),l.push(void 0),u.push(0),o=H.none},ie=()=>{c.pop(),l.pop(),u.pop(),u[c.length-1]++,o=H.none},ae=()=>{let e=S();return e!==H.endObject&&e!==H.endArray&&e!==H.eof},oe=()=>{let e=S(),t=e===H.unquotedName?re():C(e===H.singleQuotedName?`'`:`"`);return o=H.none,l[c.length-1]=t,t},se=t=>t===H.true||t===H.false?t===H.true:t===H.null?null:t===H.number?(n+=s,{literal:e.slice(n-s,n)}):t===H.unquoted?re():C(t===H.singleQuoted?`'`:`"`),ce=()=>{let e=S();if(e===H.beginArray){T(Pf.emptyArray);let e=[];for(;ae();)e.push(ce());return ie(),e}if(e===H.beginObject){T(Pf.emptyObject);let e=/* @__PURE__ */ new Map;for(;ae();)e.set(oe(),ce());return ie(),e}let t=se(e);return o=H.none,u[c.length-1]++,t};if(S()===H.eof)return null;let le=ce();return a=!1,le!==null&&S(),le},Bf=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),Vf=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),Hf=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),Uf=e=>{if(!pn(e))return;let t=I(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?pi(n):void 0},Wf=(e,t)=>{let n=`tlc2.value.impl.${Ds(e)}`,r=`tlc2.value.impl.${t}`;return new w(`class ${n} cannot be cast to class ${r} (${n} and ${r} are in unnamed module of loader 'app')`)},Gf=e=>new w(`Cannot convert value: unsupported value type tlc2.value.impl.${Ds(e)}`),Kf=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),qf=e=>`[${e.map(Zf).join(`,`)}]`,Jf=e=>`{${Sn(e).map(e=>`${Kf(typeof e[0]==`string`?e[0]:L(e[0]))}:${Zf(e[1])}`).join(`,`)}}`,Yf=e=>{let t=I(e),n=Ui(t);return n?qf(n):Jf(t)},Xf=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,Zf=e=>typeof e==`string`?Kf(e):typeof e==`object`?e.kind===`ModelValue`?Kf(e.name):Ds(e)===`RecordValue`?Jf(I(e)):Qf(e):String(e),Qf=e=>{let t=Ds(e);if(t===`TupleValue`)return qf(I(e).range);if(Xf(t))return Yf(e);if(hi(e))return qf(F(e).elements);throw Gf(e)},$f=e=>e.map(e=>`${Zf(e)}\n`).join(``),ep=e=>{let t=Ds(e);if(t===`RecordValue`)return Jf(I(e));if(t===`TupleValue`)return`{${I(e).range.map((e,t)=>`"${t}":${Zf(e)}`).join(`,`)}}`;if(Xf(t))return Yf(e);throw Gf(e)},tp=e=>{if(e===null)throw new w(`Cannot convert value: unsupported JSON value null`);if(typeof e==`boolean`)return e;if(typeof e==`string`)return Un(e);if(Array.isArray(e))return fi(e.map(tp));if(e instanceof Map)return pi([...e].map(e=>[Un(e[0]),tp(e[1])]));let t=Number(e.literal);if(!/^-?\d+$/.test(e.literal)||xs(t))throw new w(`Cannot convert value: expected a 32-bit integer JSON number, but found ${e.literal}`);return t||0},np=e=>{if(typeof e!=`string`)throw new w(`Cannot cast tlc2.value.impl.${Ds(e)} to tlc2.value.impl.StringValue`);return e},rp=(e,t)=>{let n=pa(e,t);if(typeof n!=`string`)throw Wf(n,`StringValue`);return n},ip=e=>{if(!Vf.has(e.toLowerCase()))throw Hf.has(e.toLowerCase())?new p(`IOUtils!Serialize does not support the charset ${e}`):new w(/^[a-zA-Z\d][\w.:+-]*$/.test(e)?`java.nio.charset.UnsupportedCharsetException: ${e}`:`java.nio.charset.IllegalCharsetNameException: ${e}`)},ap=(e,t,n,r)=>{let i=n.find(e=>!Bf.has(e));if(i!==void 0)throw new w(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${i}`);if(n.includes(`READ`))throw new w(`java.lang.IllegalArgumentException: READ not allowed`);let a=new Set(n.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:n);if(a.has(`APPEND`)&&a.has(`TRUNCATE_EXISTING`))throw new w(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(a.has(`DELETE_ON_CLOSE`))throw new p(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let o=e.readFile?.(t);if(o===void 0&&!a.has(`CREATE`)&&!a.has(`CREATE_NEW`))throw new w(`java.nio.file.NoSuchFileException: ${t}`);if(o!==void 0&&a.has(`CREATE_NEW`))throw new w(`java.nio.file.FileAlreadyExistsException: ${t}`);o===void 0||a.has(`TRUNCATE_EXISTING`)?e.writeFile?.(t,r):e.writeFile?.(t,a.has(`APPEND`)?o+r:r+o.slice(r.length))},op=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},sp=(e,t)=>{let n=e.readFile?.(t);if(n===void 0)throw new w(`${t} (No such file or directory)`);return n},cp=e=>[As(ys(`ToJson`,1,e=>Un(Zf(R(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),As(ys(`ToJsonArray`,1,e=>Un(Qf(R(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),As(ys(`ToJsonObject`,1,e=>Un(ep(R(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),As(ys(`JsonSerialize`,2,t=>{let n=np(R(t,0,`JsonSerialize`)),r=R(t,1,`JsonSerialize`);if(!Ui(r)&&!Uf(r))throw fs(`second`,`JsonSerialize`,`sequence or record`,r);return op(e,n),e.writeFile?.(n,Zf(r)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),As(ys(`ndJsonSerialize`,2,t=>{let n=np(R(t,0,`ndJsonSerialize`)),r=R(t,1,`ndJsonSerialize`),i=Ui(r);if(!i)throw fs(`second`,`ndJsonSerialize`,`sequence`,r);return op(e,n),e.writeFile?.(n,$f(i)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),As(ys(`JsonDeserialize`,1,t=>tp(zf(sp(e,np(R(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),As(ys(`ndJsonDeserialize`,1,t=>fi(sp(e,np(R(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>tp(zf(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],lp=(e,t)=>[As(Is(`Serialize`,3,(n,r)=>{let i=Ls(n,2,`Serialize`)(),a=Uf(i);if(!a)throw fs(`third`,`ndJsonSerialize`,`sequence`,i);if(rp(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Ls(n,0,`Serialize`)(),s=Ui(o);if(!s)throw fs(`first`,`Serialize`,`sequence`,o);let c=Ls(n,1,`Serialize`)();if(typeof c!=`string`)throw fs(`second`,`ndJsonSerialize`,`sequence`,c);let l=pa(a,`openOptions`);if(Ds(l)!==`TupleValue`)throw Wf(l,`TupleValue`);let u=rp(a,`charset`),d=I(l).range.map(e=>{if(typeof e!=`string`)throw Wf(e,`StringValue`);return e});return ip(u),ap(e,c,d,$f(s)),!0}),`public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`)],up={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},dp=e=>{let t=[],n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=0,a=rr(),o=e=>t.push(e&255),s=e=>{o(e>>8),o(e)},c=e=>{s(e>>16),s(e)},l=e=>e>32767?c(-e):s(e),u=e=>{o(up.string),c(0),c(-1),c(e.length),e.split(``).forEach(e=>o(e.charCodeAt(0)))},d=e=>{o(up.handle),l(e)},f=e=>{if(typeof e==`boolean`){o(up.boolean),o(+!!e);return}if(typeof e==`number`){o(up.integer),c(e);return}if(typeof e==`string`){i++,u(e);return}if(e.kind===`ModelValue`){o(up.modelValue),s(a.indexOf(e));return}if(e.kind===`Interval`){o(up.interval),c(e.low),c(e.high);return}let t=n.get(e);if(t!==void 0){d(t);return}if(n.set(e,i++),dn(e)){let t=F(e).elements;o(up.set),c(t.length),t.forEach(f);return}let p=I(e),m=lr(e);m===`tuple`?(o(up.tuple),l(p.range.length),p.range.forEach(f)):m===`record`?(o(up.record),c(p.domain.length),p.domain.forEach((e,t)=>{let n=String(e),a=r.get(n);a===void 0?(r.set(n,i++),u(n)):d(a),f(p.range[t])})):(o(up.function),l(p.domain.length),o(1),p.domain.forEach((e,t)=>{f(e),f(p.range[t])}))};return f(e),ae(Uint8Array.from(t))},fp=e=>[As(ys(`_TLCTraceSerialize`,2,t=>{let n=np(R(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,dp(R(t,0,`_TLCTraceSerialize`))),!0}),`public static final tlc2.value.IValue tlc2.module._TLCTrace.ioSerialize(tlc2.value.IValue,tlc2.value.impl.StringValue) throws java.io.IOException`)],pp=25214903917n,mp=(1n<<48n)-1n,hp=e=>{let t=(BigInt.asUintN(64,e)^pp)&mp,n=e=>(t=t*pp+11n&mp,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^pp)&mp},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<=2147483647)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},gp=[],_p=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},vp=()=>{for(let e=1277011;gp.length<1341;e++)_p(e)&&gp.push(e);return gp},yp=e=>{let t=vp(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},bp=e=>{let t=[],n=e;for(let e=2;e*e<=n;e++)for(;n%e===0;)t.push(e),n/=e;return n>1&&t.push(n),t},xp=e=>{for(let t=Math.max(e,9);;t++){let e=bp(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)}}},Sp=(e,t,n)=>{if(t<=0)return[];let r=xp(t),i=BigInt(n.nextInt(t)),a=BigInt(yp(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},Cp=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:tn),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},wp=(1n<<63n)-1n-24n,Tp=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(wp*BigInt(n)+i)%t;return r<0n?r+t:r})},Ep=(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,Dp=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=ui(e.domain),n=F(e.range).elements;return{lists:t.map(()=>n),create:e=>or(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>F(e).elements),create:t=>pi(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>F(e).elements),create:fi}}},Op=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,kp=(e,t,n,r)=>{if(Fi(t))return[];let i=r===`1.7.4`?Cp:Sp;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=Op(t,r)?void 0:Dp(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?Tp(e,t,n):i(e,Number(t),n)).map(e=>a.create(Ep(a.lists,e)))}let o=F(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},Ap=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...ps(e.domain,`RandomElement`,e).elements];return or(n,n.map(()=>Ap(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return pi(e.names.map((n,r)=>[n,Ap(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return fi(e.factors.map(e=>Ap(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 w(`Attempted to retrieve out-of-bounds element from the interval value ${N(L(e))}.`);return e.low+r}let n=ps(e,`RandomElement`).elements,r=Math.floor(t.nextDouble()*n.length);if(r>=n.length)throw new w(`Index ${r} out of bounds for length ${n.length}`);return n[r]},jp=(e,t,n)=>{if(typeof e!=`number`||e<0)throw fs(t,n,`nonnegative integer`,e);return e},Mp=(e,t,n,r)=>Yr(Array.from({length:t},()=>Yr(e.filter(()=>r.nextDouble()<n)))),Np=(e,t)=>{let n=`RandomSetOfSubsets`,r=jp(R(e,0,n),`first`,n),i=jp(R(e,1,n),`second`,n),a=R(e,2,n);if(!dn(a)||!P(a))throw fs(`third`,n,`finite set`,a);let o=F(a).elements;if(o.length<31&&r>2**o.length)throw fs(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw fs(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return Mp(o,r,o.length===0?0:i/o.length,t.getRandom())},Pp=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,Fp=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,Ip=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(Pp.test(t))return Number(t.replace(/[fFdD]$/,``));let n=Fp.exec(t);if(!n)return;let r=n[3]??``,i=`${n[2]}${r}`;if(i===``)return;let a=Number.parseInt(i,16)*2**(Number(n[4])-4*r.length);return n[1]===`-`?-a:a},Lp=e=>z(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=jp(R(t,0,n),`first`,n),i=R(t,1,n);if(typeof i!=`string`)throw fs(`second`,n,`string literal representing a probability`,i);let a=Ip(i);if(a===void 0||a<0||a>1)throw fs(`second`,n,`string literal does not represent a parsable probability`,i);let o=R(t,2,n);if(!dn(o)||Kn(o)||!Bi(o))throw fs(`third`,n,`finite set`,o);let s=Ri(o);if(32-Math.clz32(r)>s&&r>1<<s)throw fs(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return Mp(F(o).elements,r,a,e.getRandom())}),Rp=e=>[As(z(`RandomSubset`,2,t=>{let n=jp(R(t,0,`RandomSubset`),`first`,`RandomSubset`),r=R(t,1,`RandomSubset`);if(!hi(r)||!Bi(r))throw fs(`second`,`RandomSubset`,`a finite set`,r);let i=Op(r,e.version);if(i&&i.reduce((e,t)=>e*F(t).elements.length,1)>on())throw new w(sn());return Yr(kp(n,r,e.getRandom(),e.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),z(`RandomSetOfSubsets`,3,t=>Np(t,e)),z(`TestRandomSetOfSubsets`,3,t=>fi(Array.from({length:5},()=>F(Np(t,e)).elements.length)))],zp=(e,t=0n)=>{let n=hp(t),r=hp(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>pi([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,markExplored:void 0,getSuccessorAction:()=>void 0,toRecord:()=>({}),setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:To,getSimulationValue:void 0,getRandom:()=>{let e=a?void 0:o.getCurrentState();return e===void 0?n:(e!==i&&(r.setSeed(o.getFingerprint(e)^BigInt.asUintN(64,t)),i=e),r)},reseedRandom:()=>{i=void 0},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,readLine:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return o},Bp=e=>ti([...e.possibleCounts].map(e=>[e[0],e[1]])),Vp=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Bp(e)]]),Hp=e=>pi([[`name`,e??`UnnamedAction`],[`location`,pi([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),Up=/* @__PURE__ */ new WeakSet,Wp=e=>cr(ni(e),`record`),Gp=(e,t,n=!0)=>{[`state`,`action`,`console`].forEach(Un);let r=[[`action`,Yr(e)],[`state`,Yr(t)]],i=Wp(n?r:[...r,[`console`,!1]]);return Up.add(i),i},Kp=(e,t,n,r=!0)=>{let i=e.map((e,t)=>fi([t+1,pi(Object.entries(e))])),a=i.slice(1).map((e,n)=>fi([i[n],t[n],e])),o=n?[fi([i[i.length-1],n.action,i[n.start]])]:[];return Gp([...a,...o],i,r)},qp=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Vp(e).get(t)},Jp=(e,n,r,i)=>{if(typeof r==`number`&&r>=0)e.registers.set(r,i);else if(r===`exit`)i===!0&&(e.isStopped=!0);else if(r===`pause`){if(i!==!0||!e.pause)return;n(`Press enter to resume model checking.`),e.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))e.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))e.properties.set(r.slice(2),L(i));else throw new t(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${N(L(r))}`)},Yp=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:U(e),Xp=e=>e.every(e=>e!==void 0),Zp=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!M(e);if(i&&t.variableIndex.has(r))return 1;let a=mt(e).map(e=>Zp(e,t,n)),o=i?h_(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(Zp(o.body,t,n))),Math.max(0,...a)},Qp=(e,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[Is(`AssertError`,2,e=>{let t=gs(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw new w(`In computing AssertError, a non-string expression (${Yp(t)}) was used as the err of an AssertError(err, exp).`);let r=Ls(e,0,`AssertError`)();try{Ls(e,1,`AssertError`)()}catch(e){if(e instanceof w)return Rt(e.message,n.isTool)===r;throw e}return!1}),ys(`TLCGetOrDefault`,2,e=>qp(n,R(e,0,`TLCGetOrDefault`))??R(e,1,`TLCGetOrDefault`)),ys(`Trace`,0,(e,t)=>{let r=t?.environment.variables??[],i=t?.state??r.map(()=>void 0);if(!t||!Xp(i)){let e=r.filter((e,t)=>i[t]===void 0);throw new w(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return t.state?fi(n.getBehavior(i).map(e=>{let r=t.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return pi(i===void 0?r:[[`_action`,i],...r])})):fi([pi([])])}),ys(`CounterExample`,0,()=>n.counterExample??Gp([],[])),z(`ToTrace`,1,e=>{let n=R(e,0,`ToTrace`);if(typeof n!=`object`||!Up.has(n))throw new t(`The argument of ToTrace should be a CounterExample, but instead it is:\n${N(L(n))}`);let r=F(pa(n,`state`)).elements.map(e=>Ui(e)??[]);return fi(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,e=>{let n=R(e,0,`TLCModelValue`);if(typeof n!=`string`)throw new t(`The argument of ModelValue should be a string, but instead it is:\n${N(L(n))}`);return nr(n)}),Is(`TLCDefer`,1,(e,t)=>{let r=gs(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{W(r,{...t,next:e})}),!0}),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),{...Is(`PickSuccessor`,1,(t,r)=>{let i=r?.next??(r?.environment.variables??[]).map(()=>void 0);if(n.getSimulationValue===void 0&&(!Xp(i)||r?.next&&n.isSeen(i)))return!0;let a=gs(t,0,`PickSuccessor`),o=a.call([]);if(typeof o!=`boolean`)throw new w(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${Os(o)}) was used as the condition of an IF.\n${a.expression?Yp(a.expression):``}`);if(o||!r?.next||!Xp(i)||!r.state||!Xp(r.state))return!0;let s=r.state,c=n.getSuccessorAction(s,i),l=t=>e(Dt(n.isTool,wt.moduleOverrideStdout,Tt.none,t));for(;;){l(`Extend behavior of length ${n.getLevel(s)} with a "${c?.name}" step [<Action ${c?.location.range&&g(c.location.range)}>]? (Yes/no/explored/states/diff):`);let e=n.readLine?.();if(e===void 0)throw new T;if(/^[\0-\x20]*$/.test(e)||e.toLowerCase().startsWith(`y`))return!0;if(e[0]===`s`)l(`${Ya(n.toRecord(s)).trimEnd()}\n~>\n${Ya(n.toRecord(i)).trimEnd()}`);else if(e[0]===`d`)l(Ya(n.toRecord(i),n.toRecord(s)));else if(e[0]===`e`){if(n.markExplored)return n.markExplored(i),!0;if(n.getSimulationValue===void 0)throw new p(`tla-ts can't mark a state explored while it searches depth first.`);l(`Marking a state explored is unsupported by the current TLC mode. Is TLC running in simulation mode?`)}else if(e[0]===`n`)return!1}}),isActionLevel:!0},Is(`TLCCache`,2,(e,t)=>{let i=gs(e,0,`TLCCache`),o=Pa(Ls(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=Zp(s,t.environment,/* @__PURE__ */ new Set);if(c===2)return i.call([]);let l=c===1;if(l&&t.state&&n.getSimulationValue===void 0)return i.call([]),i.call([]);let u=l&&t.state?a(t.state):r,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=i.call([]);return d.set(o,p),p}),z(`TLCFP`,1,e=>{let t=R(e,0,`TLCFP`),n=Ta(t);if(n)throw n;return Number(BigInt.asIntN(32,To([t])))}),Is(`TLCEvalDefinition`,1,(e,n)=>{let r=Ls(e,0,`TLCEvalDefinition`)();if(typeof r!=`string`)throw new t(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${N(L(r))}`);let i=n?h_(r,n.environment):void 0,a=i?void 0:n?.environment.builtins.get(r);if(a?.arity===0)return a.evaluate([],n);if(!i||!n)throw new t(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${N(L(r))}`);if(i.kind===`Operator`&&i.params.length>0){let e=i.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new t(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${r}(${e.join(`, `)})`)}return i.kind===`Operator`?W(i.body,n):W({kind:`Identifier`,name:r,location:i.location},n)})]},$p=(e,t)=>[ys(`_Track`,2,e=>{let n=String(R(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,R(e,0,`_Track`)===!0?r+1:r),!0}),ys(`_Counts`,0,()=>Bp(t)),ys(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(Bp(t),!0)),!1)}),ys(`_PrintCounts`,0,()=>(e(L(Bp(t),!0)),!0))],em=e=>`${e.getUTCFullYear()}.${zt(e.getUTCMonth()+1)}.${zt(e.getUTCDate())}.${zt(e.getUTCHours())}${zt(e.getUTCMinutes())}${zt(e.getUTCSeconds())}`,tm=e=>ti([...e].map(e=>[e[0],fi([e[1]])])),nm=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),rm=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),im=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),am=(e,n,r)=>{if(e.version===`1.7.4`?!rm.has(n)||!e.isStarted&&im.has(n):!e.isStarted&&nm.has(n))throw new t(`TLCGet(${n}) was undefined.`);let i=e.getSimulationValue?.(n,r);if(i!==void 0)return i;let a=Math.floor((Date.now()-e.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:e.getLevel(r);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return a;case`stats`:return Wp([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,a],[`worker`,0]]);case`config`:return Wp([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,String(BigInt.asIntN(64,Qa()))],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Wp([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Un(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Un(em(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Hp(void 0);case`all`:return tm(e.registers);case`all:named`:return tm(Vp(e))}if(n.startsWith(`s:`)){let r=Vp(e).get(n);if(r===void 0)throw new t(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return Un(e.properties.get(n.slice(2))??n);throw new t(`TLCGet(${n}) was undefined.`)},om=(e,n,r)=>{if(typeof n==`number`&&n>=0){let r=e.registers.get(n);if(r===void 0)throw new t(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new t(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${N(L(n))}`);return am(e,n,r?.state)},sm=e=>e.length===0?[[]]:e.flatMap((t,n)=>sm([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),cm=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&F(e).elements.forEach(cm),e.kind===`Function`&&e.range.forEach(cm))},lm=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`Function`:return e.functionClass===void 0?e:or(e.domain,e.range);case`ModelValue`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return I(e);default:return F(e)}},um=(e,n)=>[z(`Print`,2,t=>(e(Ga([R(t,0,`Print`),R(t,1,`Print`)]).map(N).join(` `)),R(t,1,`Print`))),z(`PrintT`,1,t=>(e(N(Ga([R(t,0,`PrintT`)])[0])),!0)),z(`Assert`,2,e=>{if(R(e,0,`Assert`)!==!0)throw new t(`The first argument of Assert evaluated to FALSE; the second argument was:\n${N(L(R(e,1,`Assert`)))}`,S.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>ti([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=R(e,0,`@@`),n=R(e,1,`@@`),r=pn(t)?I(t):void 0,i=pn(n)?I(n):void 0;if(!r)throw fs(`first`,`@@`,`function`,t);if(!i)throw fs(`second`,`@@`,`function`,n);let a=xn(r),o=xn(i).filter(e=>!a.some(t=>Kr(e[0],t[0])));return ni([...a,...o])}),z(`ToString`,1,e=>Un(L(R(e,0,`ToString`),!0))),{...Is(`TLCEval`,1,(e,t)=>{let n=lm(Ls(e,0,`TLCEval`)());return t===void 0&&cm(n),n}),isStateLevel:!1},z(`Permutations`,1,e=>{let t=ps(R(e,0,`Permutations`),`Permutations`).elements;return Yr(sm(t).map(e=>ti(t.map((t,n)=>[t,e[n]]))))}),vs(`SortSeq`,2,e=>{let t=R(e,0,`SortSeq`),n=Ui(t);if(!n)throw fs(`first`,`SortSeq`,`natural number`,t);let r=gs(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw fs(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t=a.length;for(;t>0&&i(e,a[t-1]);)t--;a.splice(t,0,e)}),fi(a)}),n.version===`1.7.4`?As({...ys(`TLCGet`,1,(e,t)=>om(n,R(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):As(Is(`TLCGet`,1,(e,t)=>om(n,Ls(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),ys(`TLCSet`,2,t=>(Jp(n,e,R(t,0,`TLCSet`),R(t,1,`TLCSet`)),!0)),_s(`Any`,Xn),z(`RandomElement`,1,e=>Ap(R(e,0,`RandomElement`),n.getRandom()))],dm=`----------------------------- MODULE Bags --------------------------------
|
|
405
405
|
(**************************************************************************)
|
|
406
406
|
(* A bag, also called a multiset, is a set that can contain multiple *)
|
|
407
407
|
(* copies of the same element. A bag can have infinitely many elements, *)
|
|
@@ -554,7 +554,7 @@ CopiesIn(e, B) ==
|
|
|
554
554
|
7 Dec 98 : Corrected error found by Stephan Merz.
|
|
555
555
|
6 Dec 98 : Modified comments based on suggestions by Lyle Ramshaw.
|
|
556
556
|
5 Dec 98 : Initial version.
|
|
557
|
-
`,
|
|
557
|
+
`,fm=/* @__PURE__ */ new Map([[`Bags`,dm],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
|
|
558
558
|
(***************************************************************************)
|
|
559
559
|
(* The two definitions in this standard module are overridden by TLC in *)
|
|
560
560
|
(* the Java class tlc2.module.FiniteSets. Each operator is overridden by *)
|
|
@@ -1686,7 +1686,7 @@ _TLCTrace ==
|
|
|
1686
1686
|
/\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
|
|
1687
1687
|
|
|
1688
1688
|
=============================================================================
|
|
1689
|
-
`]]),
|
|
1689
|
+
`]]),pm=new Map([...[...fm].filter(e=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e[0])),[`Bags`,dm.replace(`
|
|
1690
1690
|
LOCAL INSTANCE Naturals
|
|
1691
1691
|
`,`
|
|
1692
1692
|
EXTENDS TLC
|
|
@@ -1778,16 +1778,16 @@ _TEPosition ==
|
|
|
1778
1778
|
ELSE TLCGet("level") + 1
|
|
1779
1779
|
|
|
1780
1780
|
=============================================================================
|
|
1781
|
-
`]]),om=(e=`master`)=>e===`1.7.4`?am:im,sm=(e,t)=>e.every(e=>Ki(e,t)),cm=qr([!1,!0]);Hr(cm);const lm=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Qr(lm(e,t,r),lm(e,r,n))},um=[`\\cup`,`\\cap`,`\\`],dm=e=>typeof e==`object`&&e.kind===`MixedSet`,fm=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,pm=(e,t,n)=>{t.kind===`Interval`&&Ii(t);let r=t.kind===`Interval`?t:Vr(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return cn(r,e=>{Ki(e,n)===i&&on(a,e)}),fm(t)?rr(a):Jr(a)}if(Ni(t))return n;if(!un(n))return dr({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return cn(r,e=>on(i,e)),cn(n.kind===`Interval`?n:F(n).elements,e=>{Ki(e,t)||on(i,e)}),Jr(i)},mm=(e,t)=>{let n=(t,n)=>ds([Ns(t,n,e)()],0,e);return{...z(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},hm=[ps(`TRUE`,!0),ps(`FALSE`,!1),ps(`BOOLEAN`,cm),ps(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),gs(`=`,Wr),gs(`#`,(e,t)=>!Wr(e,t)),z(`~`,1,e=>!ds(e,0,`~`)),z(`<=>`,2,e=>ds(e,0,`<=>`)===ds(e,1,`<=>`)),mm(`/\\`,(e,t)=>e&&t()),mm(`\\/`,(e,t)=>e||t()),mm(`=>`,(e,t)=>!e||t()),z(`\\in`,2,e=>Ki(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!Ki(R(e,0,`\\notin`),R(e,1,`\\notin`))),gs(`\\subseteq`,(e,t)=>{if(!ln(e))throw new w(`\\subseteq expects a set but received ${L(e)}`);if(typeof e==`object`&&e.kind===`Subset`&&typeof t==`object`&&t.kind===`Subset`&&P(e.base))return sm(F(e.base).elements,t.base);if(typeof e==`object`&&e.kind===`Interval`){if(typeof t==`object`&&t.kind===`Interval`&&t.low<=e.low&&t.high>=e.high)return!0;for(let n=e.low;n<=e.high;n++)if(!Ki(n,t))return!1;return!0}return!Di(e,e=>!Ki(e,t))}),...um.map(e=>z(e,2,t=>{let n=R(t,0,e),r=R(t,1,e),i=e!==`\\cup`&&typeof r==`object`&&r.kind===`Interval`&&typeof n==`object`&&n.kind!==`Interval`;if(un(n)&&un(r)&&!dm(n)&&!dm(r)&&!i&&!sn(n)&&!sn(r)){if(e===`\\cup`&&Ni(n))return r;let t=e===`\\cup`?Qr:e===`\\cap`?Zr:Xr;return Wi((n,r)=>{let i=F(n),a=F(r),o=t(i,a);if(e===`\\cup`){let e=Vr(i),t=Xr(a,i).elements,n=e===i.elements&&(t.length===0||Zn(e[e.length-1],t[0])<0);if(e.length+t.length>rn())throw new u(an());if(n&&!i.isNormalized)return o;let r=o===i?nr(o.elements):o;return n||(r.writtenElements=[...e,...t]),r}return o===n||(o.isNormalized=fm(n),i.writtenElements&&!i.isNormalized&&(o.writtenElements=i.writtenElements.filter(e=>Ki(e,o)))),o},(t,n)=>pm(e,t,n),n,r)}return un(n)?pm(e,n,r):e!==`\\`&&un(r)?pm(e,r,n):dr({kind:`SetOperation`,operator:e,left:n,right:r})})),z(`SUBSET`,1,e=>({kind:`Subset`,base:R(e,0,`SUBSET`)})),z(`UNION`,1,e=>{let t=R(e,0,`UNION`),n=pn(t)?Vr(t):[],r=n.filter(pn);if(!pn(t)||r.length!==n.length)return dr({kind:`Union`,base:t});let i=r.flatMap(Vr),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{Ki(t,e)||on(e.elements,t)}),Jr(e.elements)};return dm(t)||r.some(dm)?a():r.length===0?Yr:Wi(e=>Bi(lm(e,0,e.length),i),a,r.map(F),void 0)}),z(`DOMAIN`,1,e=>{let t=R(e,0,`DOMAIN`);if(!dn(t))throw new w(`DOMAIN expects a function but received ${L(t)}`);return da(t)})],gm=Os(`Integers`,`Neg`,`IntValue`,1),_m=e=>{let n=Os(e,`DotDot`,`IntervalValue`,2);return[ks(e,`+`,`Plus`,(e,t)=>e+t),ks(e,`-`,`Minus`,(e,t)=>e-t),ks(e,`*`,`Times`,(e,t)=>e*t),ks(e,`^`,`Expt`,(e,n)=>{if(n<0)throw new t(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(e===0&&n===0)throw new t(`0^0 is undefined.`);return e**n}),ks(e,`\\div`,`Divide`,(e,n)=>{if(n===0)throw new t(`The second argument of \\div is 0.`);let r=Math.floor(e/n);if(_s(r))throw vs(`${e} \\div ${n}`);return r}),ks(e,`%`,`Mod`,(e,n)=>{if(n<=0)throw new t(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(e%n+n)%n}),z(`..`,2,e=>{let t=R(e,0,`..`),r=Ds(R(e,1,`..`),n);return{kind:`Interval`,low:Ds(t,n),high:r}})]},vm=_m(`Naturals`),ym=_m(`Integers`),bm=e=>{let t=vm.indexOf(e);return t===-1?void 0:ym[t]},xm=e=>{let t=(t,n=`tlc2.value.IBoolValue`)=>`public static ${n} tlc2.module.${e}.${t}(tlc2.value.impl.Value,tlc2.value.impl.Value)`,n=e===`Integers`;return[Es(js(`<`,(e,t)=>e<t),t(`LT`)),Es(js(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),Es(js(`<=`,(e,t)=>e<=t),t(`LE`)),Es(js(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},Sm=[ps(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...vm,...xm(`Naturals`)],Cm=[ps(`Int`,{kind:`InfiniteSet`,name:`Int`}),...ym,...xm(`Integers`),z(`-.`,1,e=>{let t=Ds(R(e,0,`-`),gm);if(_s(-t))throw vs(`-${t}`);return-t})],wm=(e,n,r)=>{let i=R(e,n,r),a=Vi(i);if(!a)throw new t(`${r}\n${L(i)}`);return a},Tm=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:wm(e,t,n)},Em=(e,t,n)=>{let r=R(e,t,`SubSeq`);if(typeof r!=`number`)throw cs(n,`SubSeq`,`natural number`,r);return r},Dm=(e,t,n)=>typeof e==`string`?Vn(e.slice(t,n)):ui(e.slice(t,n)),Om=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,km=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Am=(e,t)=>{let n=lc.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Es(e,t):e}):t},jm=e=>Am(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>Tm(e,0,Om(``,`Len`)).length),z(`\\o`,2,e=>{let n=Tm(e,0,km(`s \\o t`,`sequence`));if(typeof n!=`string`){let t=wm(e,1,km(`t \\o s`,`sequence`));return ui([...n,...t])}let r=R(e,1,`\\o`);if(typeof r!=`string`)throw new t(`${km(`t \\o s`,`string`)}\n${L(r)}`);return Vn(n+r)}),z(`Append`,2,t=>ui([...wm(t,0,km(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(t,1,`Append`)])),z(`Head`,1,e=>{let n=wm(e,0,Om(``,`Head`));if(n.length===0)throw new t(`Attempted to apply Head to the empty sequence.`);return n[0]}),z(`Tail`,1,e=>{let n=Tm(e,0,Om(``,`Tail`));if(n.length===0)throw new t(`Attempted to apply Tail to the empty sequence.`);return Dm(n,1)}),z(`SubSeq`,3,e=>{let n=Tm(e,0,Om(`first `,`SubSeq`)),r=Em(e,1,`second`),i=Em(e,2,`third`);if(r>i)return Dm(n,0,0);let a=r<1||r>n.length?{position:`second`,value:r}:i>n.length?{position:`third`,value:i}:void 0;if(a)throw new t(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${L(R(e,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return Dm(n,r-1,i)}),ms(`SelectSeq`,2,e=>{let n=fs(e,1,`SelectSeq`);return ui(wm(e,0,Om(`first `,`SelectSeq`)).filter(e=>{let r=n.call([e]);if(typeof r!=`boolean`)throw new t(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${n.name}>`);return r}))})]),Mm=e=>Am(`FiniteSets`,[z(`IsFiniteSet`,1,e=>Ri(R(e,0,`IsFiniteSet`))),z(`Cardinality`,1,n=>{let r=R(n,0,`Cardinality`);if(!ln(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new t(`Attempted to compute cardinality of the value\n${L(r)}`);return Ii(r,e)})]),Nm=[Es(z(`Warshall`,1,e=>{let n=R(e,0,`Warshall`);if(!ln(n)||Wn(n))throw new t(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${L(n)}`);Ii(n);let r=[],i=/* @__PURE__ */ new Map,a=e=>{let t=Aa(e),n=i.get(t)??r.length;return n===r.length&&(i.set(t,n),r.push(e)),n},o=F(n).elements.map(e=>{let n=Vi(e);if(n?.length!==2)throw new t(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${L(e)}`);return[a(n[0]),a(n[1])]}),s=r.map(()=>r.map(()=>!1));o.forEach(e=>{s[e[0]][e[1]]=!0});for(let e=0;e<r.length;e++)for(let t=0;t<r.length;t++)if(s[t][e])for(let n=0;n<r.length;n++)s[e][n]&&(s[t][n]=!0);return Jr(r.flatMap((e,t)=>r.flatMap((n,r)=>s[t][r]?[ui([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],Pm=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return Nm;if(e===`AnySet`)return[ps(`ANY`,Jn)];if(e===`IOUtils`)return tp(r,a);if(e===`_TLCTrace`)return ip(r);if(!om(n.version).has(e))return;let o=Lm(e,t,n,r,i);return e===`Randomization`&&o?[...o,kp(n)]:o},Fm=/* @__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`]]]),Im=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]]]),Lm=(e,t,n,r,i)=>{switch(e){case`Naturals`:return Sm;case`Integers`:return Cm;case`Sequences`:return jm(n.version);case`FiniteSets`:return Mm(n.version);case`TLC`:return Am(`TLC`,nm(t,n));case`Randomization`:return Ap(n);case`_Possible`:return Wp(t,n);case`Json`:return ep(r);case`Bags`:return Am(`Bags`,Tf(i));case`TLCExt`:return Am(`TLCExt`,Up(t,n));default:return}},Rm=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&Zl.get(t)||[];r.expressions.push(...i,t);let a=Ui.sets,o=a??[],s=o.length;Ui.sets=o;try{return n()}catch(e){throw fv(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,Ui.sets=a}},zm=(e,t,n)=>e.coverage?Vo(e.coverage,t,n):-1,Bm=(e,t,n)=>e.coverage?Uo(e.coverage,t,n):n(),Vm=(e,t,n,r)=>Bm(e,t,()=>W(n,r)),Hm=(e,t,n,r)=>{let i=Vm(e,t,n,r),a=e.coverage;if(a?.covered.has(n))for(let e=t;e!==-1;e=a.prefixes[e])a.primary[e]--;return i},Um=(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},Wm=e=>!e.includes(void 0),Gm=e=>e.variables.map(()=>void 0),Km=(e,t,n)=>{let r=[...e];return r[t]=n,r},qm=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},Jm=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,Ym=e=>e.kind===`Identifier`?e.name:void 0,Xm=(e,t,n)=>{if(t.kind===`Label`)return Xm(e,t.body,n);let r=Ym(t);if(r===void 0)return;let i=Xg(n,r);if(i?.kind===`Thunk`)return Xm(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=B_(r,e);return o?.kind===`Closure`&&o.params.length===0?Xm(e,o.body,o.scope):void 0},Zm=(e,t,n)=>{if(t.kind===`Prime`)return Xm(e,t.expression,n);if(t.kind===`Label`)return Zm(e,t.body,n);let r=Ym(t);if(r===void 0)return;let i=Xg(n,r);if(i?.kind===`Thunk`)return Zm(e,i.expression,i.scope);if(i)return;let a=B_(r,e);return a?.kind===`Closure`&&a.params.length===0?Zm(e,a.body,a.scope):void 0},Qm=e=>{if(typeof e!=`boolean`)throw new w(`TLC expected a boolean expression.`);return e},$m=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),eh=(e,t,n,r)=>{let i=nh(e,t,n,r);return i&&e.coverage&&!e.isInit&&Ho(e.coverage,r),i},th=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(Ho(r,n),Ho(r,r.roots[n])),e.onState(t),!0},nh=(e,t,n,r)=>t===void 0?Wm(n)?th(e,n,r):(e.onIncomplete?.(n),!1):Wm(n)&&$m(e)?ih(e,t,n,r):t.kind===`Predicate`?ah(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?xh(e,t.expression,t.rest,t.scope,n,t.node):rh(e,t,n)&&eh(e,t.rest,n,t.node),rh=(e,t,n)=>{let r=e.environment,i=Vm(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return Vm(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?Yg(t,r.runtime.version):t}})();try{return!Wr(i,a)}catch(t){throw e.callStack&&fv(e.callStack,[i],t),t}},ih=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return xh(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?rh(e,i,n):Qm(Vm(e,i.node,i.expression,Um(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return th(e,n,r)},ah=(e,t,n,r,i,a)=>oh(e,t,n,r,i,zm(e,a,t)),oh=(e,t,n,r,i,a)=>Rm(e,t,()=>{switch(t.kind){case`Let`:{let o=Um(e,r,i),s=t.definitions,c=e.coverage?rv(s,o,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):rv(s,o);return ah(e,t.body,n,c,i,a)}case`Label`:return ah(e,t.body,n,r,i,a);default:if(hh.has(t.kind))throw new w(`The state relation is not a boolean expression.`);return Rm(e,t,()=>yh(e,t,n,r,i,a))}}),sh=(e,t,n,r,i)=>Qm(t)&&eh(e,n,r,i),ch=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),lh=(e,t,n,r,i,a)=>{let o=Um(e,r,i);if(t.kind===`Identifier`){let s=Xg(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return ah(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return ah(e,s.operator.body,n,s.operator.scope,i,a);let c=s?void 0:e.environment.definitions.get(t.name),l=s?void 0:B_(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&ef(c,e.environment))?ah(e,l.body,n,l.scope,i,a):sh(e,Hm(e,a,t,o),n,i,a)}let s=V_(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=Bm(e,a,()=>$_(s,t.args,o));return ah(e,s.body,n,r,i,a)}let c=ch.has(t.operator)?Vm(e,a,t,o):Hm(e,a,t,o);return sh(e,c,n,i,a)},uh=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?eh(e,t,Km(n,r,i),a):Wr(o,i)&&eh(e,t,n,a)},dh=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),fh=(e,t,n)=>(e.coverage&&Wo(e.coverage,t,n.length+1),n),ph=(e,t,n,r,i,a)=>{let[o,s]=t.args,c=e.isInit?Xm(e.environment,o,r):Zm(e.environment,o,r),l=Um(e,r,i);if(c===void 0)return Vm(e,a,t,l)===!0&&eh(e,n,i,a);let u=Vm(e,a,s,l),d=i[c];if(t.operator===`=`)return uh(e,n,i,c,u,a);let f=t.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(typeof f==`object`&&f!==u&&e.callStack?.sources.set(f,s),d!==void 0)return Vm(e,a,t,l)===!0&&eh(e,n,i,a);if(!pi(f))throw new w(`The right side of \\IN is not enumerable.`);return fh(e,f,Oi(f)).reduce((t,r)=>eh(e,n,Km(i,c,r),a)||t,!1)},mh=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),hh=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),gh={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},_h=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:gh[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${U(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${U(e)}`:`In computing ENABLED, TLC encountered unbounded quantifier. Make sure that the expression is of form ${e.quantifier===`Forall`?`\\A`:`\\E`} x \\in S: P(x).\n${U(e)}`;if(e.kind===`Choose`&&e.set===void 0)return`In computing ENABLED, TLC encountered unbounded CHOOSE. Make sure that the expression is of form CHOOSE x \\in S: P(x).\n${U(e)}`},vh=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=Bm(e,r,()=>g_(t.bounds,t=>{let r=W(t,n),i=p_(r,t,a);return Array.isArray(i)&&fh(e,r,i),i}));return v_(t.bounds,o,n.scope,e=>(i.push(e),!1)),i},yh=(e,t,n,r,i,a)=>{let o=Um(e,r,i);switch(t.kind){case`Identifier`:return lh(e,t,n,r,i,a);case`Apply`:return mh.has(t.operator)&&t.args.length===2?ph(e,t,n,r,i,a):t.operator===`=>`&&t.args.length===2?Qm(Vm(e,a,t.args[0],o))?ah(e,t.args[1],n,r,i,a):eh(e,n,i,a):lh(e,t,n,r,i,a);case`And`:{let o=t.operands;if(t.isBulleted||o.length===2){let t=o.slice(1).reduceRight((e,t)=>dh(`Predicate`,t,r,a,e),n);return ah(e,o[0],t,r,i,a)}let s=o[o.length-1];return oh(e,qm(t,o.length-1),dh(`Predicate`,s,r,a,n),r,i,Jm(e,a))}case`Or`:{let o=t.operands;if(t.isBulleted||o.length===2)return o.reduce((t,o)=>ah(e,o,n,r,i,a)||t,!1);let s=oh(e,qm(t,o.length-1),n,r,i,Jm(e,a)),c=ah(e,o[o.length-1],n,r,i,a);return s||c}case`Exists`:return vh(e,t,o,a).reduce((r,o)=>ah(e,t.body,n,o,i,a)||r,!1);case`Forall`:{let r=vh(e,t,o,a);if(r.length===0)return eh(e,n,i,a);let s=r.slice(1).reduce((e,n)=>dh(`Predicate`,t.body,n,a,e),n);return ah(e,t.body,s,r[0],i,a)}case`If`:return ah(e,Qm(Vm(e,a,t.condition,o))?t.consequent:t.alternative,n,r,i,a);case`Case`:{let s=t.arms.find(t=>Qm(Vm(e,a,t.condition,o)))?.body??t.other;if(s===void 0)throw new w(`TLC encountered a CASE with no conditions true.`);return ah(e,s,n,r,i,a)}case`FunctionApplication`:{let r=w_(Vm(e,a,t.function,e.isInit?o:e_(o)));if(r){let s=Bm(e,a,()=>T_(r,t,o));return ah(e,r.body,n,s,i,a)}break}case`Unchanged`:if(!e.isInit)return xh(e,t.expression,n,r,i,a);break;case`BoxAction`:if(!e.isInit){let o=ah(e,t.action,n,r,i,a);return xh(e,t.subscript,n,r,i,a)||o}break;case`AngleAction`:if(!e.isInit)return ah(e,t.action,dh(`Changed`,t.subscript,r,a,n),r,i,a)}let s=e.isEnabled?_h(t):void 0;if(s!==void 0)throw new w(s);return sh(e,Vm(e,a,t,o),n,i,a)},bh=(e,t,n)=>e.runtime.warn(St.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${U(n)}`),xh=(e,t,n,r,i,a)=>Rm(e,t,()=>{let o=zm(e,a,t),s=Xm(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;let a=i[s];return a!==void 0&&!Wr(a,r)?(bh(e.environment,s,t),!1):uh(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return eh(e,n,i,o);let c=s.reduceRight((e,t)=>dh(`Unchanged`,t,r,o,e),n);return xh(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=Xg(r,t.name);if(a?.kind===`Thunk`)return xh(e,a.expression,n,a.scope,i,o);let s=a?void 0:B_(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return xh(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=Um(e,r,i),s=V_(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return xh(e,s.body,n,$_(s,t.args,a),i,o)}let c=e.environment,l=Vm(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=Vm(e,o,t,{environment:c,scope:r,state:i,next:void 0});return Wr(l,u)&&eh(e,n,i,o)}),Sh=(e,t,n,r,i)=>({environment:e,callStack:e.callStack,coverage:e.coverage,isInit:t===`init`,isEnabled:t===`enabled`,current:n,onState:r,onIncomplete:i}),Ch=/* @__PURE__ */ Error(`The replay found a successor`),wh=(e,t,n,r)=>{let i=Sh(r,`enabled`,n,()=>{throw Ch}),a=i.callStack,o=a?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=dh(`Changed`,e.subscript,t,-1,void 0);ah(i,e.action,n,t,Gm(r),-1)}else ah(i,e,void 0,t,Gm(r),-1);return!1}catch(e){if(e!==Ch)throw e;return a&&(a.expressions.length=o,a.isFrozen=!1),!0}},Th=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=Sh(t,`init`,void 0,n,r),s=a.reduceRight((e,t)=>dh(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);ah(o,i.expression,s,i.scope,Gm(t),i.node??-1)},Eh=(e,t,n,r)=>{e.some(e=>hh.has(e.expression.kind))||e.forEach(e=>{let i=[];Dh(e,-1,t,n,e=>i.push(e)),i.forEach(t=>r(t,e))})},Dh=(e,t,n,r,i,a)=>{let o=Sh(r,`next`,n,i,a);ah(o,e.expression,void 0,e.scope,Gm(r),t)},Oh=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(Xm(t,e,void 0)!==void 0&&e.kind===`Identifier`){n.push(e);return}if(e.kind===`Tuple`){e.elements.forEach(e=>i(e,r));return}if(e.kind!==`Identifier`)return;let a=Xg(r,e.name)?void 0:B_(e.name,t);a?.kind===`Closure`&&a.params.length===0&&i(a.body,a.scope)},a=(e,o,s)=>{switch(e.kind){case`Let`:a(e.body,rv(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`FunctionApplication`:a(e.function,o,s);return;case`If`:a(e.consequent,o,s),a(e.alternative,o,s);return;case`Case`:e.arms.forEach(e=>a(e.body,o,s)),e.other&&a(e.other,o,s);return;case`And`:case`Or`:e.operands.forEach(e=>a(e,o,s));return;case`Exists`:case`Forall`:a(e.body,o,s);return;case`Unchanged`:i(e.expression,o);return;case`AngleAction`:a(e.action,o,s);return;case`BoxAction`:a(e.action,o,s),n.push(e.subscript);return;case`Identifier`:case`Apply`:{if(e.kind===`Apply`){if(e.operator===`=>`){e.args.forEach(e=>a(e,o,s));return}if(e.operator===`=`||e.operator===`\\in`){Zm(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=Xg(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?V_(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:B_(i,t);if(l?.kind!==`Closure`||s.has(l.body)||t.definitions.get(i)?.isRecursive)return;let u=e.kind===`Apply`?e.args:[];if(l.params.length!==u.length)return;s.add(l.body),a(l.body,$_(l,u,r(o)),s),s.delete(l.body)}}};return e.forEach(e=>a(e.expression,e.scope,/* @__PURE__ */ new Set)),n.flatMap(e=>e.location.range??[])},kh=/* @__PURE__ */ new WeakMap,Ah=/* @__PURE__ */ new WeakMap,jh=(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},Mh=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Nh=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,Ph=(e,t)=>{let n=new w(t);return e.isInit?n:x(n,S.error)},Fh=(e,t,n,r)=>{let i=zg(n);return r&&hh.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${Nh(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},Ih=(e,t,n)=>{let r=ws(t),i=U(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${Nh(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
1782
|
-
`:``}${i}`},Lh=(e,t,n)=>Bh(e,t,W(t,n)),Rh=new Set(hm.map(e=>e.name)),zh=e=>e.kind===`Apply`?Rh.has(e.operator):e.kind!==`Identifier`&&!hh.has(e.kind),Bh=(e,t,r,i=!0)=>{if(typeof r==`boolean`)return r;let a=Fh(e,r,t,i);throw e.isInit&&i&&zh(t)?new n(a):Ph(e,a)},Vh=(e,t,n,r)=>r.environment.callStack?W(n,r):(e[t]??=yv(n,r.environment))(r),Hh=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Uh=(e,t,n)=>{let r=n?kh:Ah,i=r.get(e);if(i)return i;let a=Cg(e,t,n),o=n?void 0:Sg(e,t),s=o?(e,t,n,r,i,s)=>(e.generator?o:a)(e,t,n,r,i,s):a;return r.set(e,s),s},Wh=(e,t)=>{if(t.constants.has(e))return;let n=s_(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},Gh=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return Gh(e.expression,t,!1,r);if(e.kind!==`Identifier`||M(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Wh(e.name,t);if(a&&!r.has(a))return r.add(a),Gh(a.body,t,n,r)},Kh=(e,t,n)=>Gh(e,t,!n),qh=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return qh(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=rv(e.definitions,jh(r,t,n));return qh(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Xg(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return qh(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=Wh(e.name,r.environment);if(s)return qh(s.body,void 0,n,r,i)},Jh=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||M(e))||!t&&e.kind===`Prime`,Yh=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Yh(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[{index:r,expression:e}];let i=Wh(e.name,t);if(i)return n.add(e.name),Yh(i.body,t,n)},Xh=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Zh=(e,t,n)=>Xh.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Hh(e.operator)&&(Jh(e.args[0],n)||Kh(e.args[0],t,n)!==void 0)||M(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,Qh=/* @__PURE__ */ new Set,$h=(e,t)=>{if(M(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return ou(e,(e,i)=>{let a=r?$h(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];a?n.push(...a):r=!1}),r?n:void 0},eg=(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||M(e)?void 0:s_(r,t);return i&&!n.has(i)&&(n.add(i),eg(i.body,t,n))?!0:mt(e).some(e=>eg(e,t,n))},tg=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Kh(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=Yh(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return Zh(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Uh(e,t,n)}},ng=(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(cf(e,t)===void 0||eg(e,t,/* @__PURE__ */ new Set))return!0;let n=$h(e,Qh);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)}},rg=(e,t,n)=>{let r=e.map(e=>tg(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=$m(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Tg(u)){d??=jh(t,n,u);for(let e=s;e<r.length;e++){let n=r[e],i=t.current,o=i&&n.kind===`Unchanged`?n.variables.find(e=>{let t=u[e.index];return t!==void 0&&!Wr(t,i[e.index])}):void 0;if(o){bh(t.environment,o.index,o.expression);return}let s=n.expression,c=Vh(a,e,s,d);if(!Bh(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=jh(t,n,u);let r=Vh(i,s,e.expression,d);if(!Bh(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=jh(t,n,u);let r=Vh(i,s,e.value,d),a=u[e.index];if(a===void 0)u=Mh(u,e.index,r),d=void 0;else if(!Wr(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let i of e.variables){let e=(r??u)[i.index];if(e===void 0)r??=u.slice(),r[i.index]=n[i.index];else if(!Wr(e,n[i.index])){bh(t.environment,i.index,i.expression);return}}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},ig=e=>{let t=_h(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw Ph(n,t);Lh(n,e,jh(n,r,i))&&s(i,a)}},ag=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=jh(r,i,a);if(a[l]!==void 0){Lh(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!pi(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${Nh(r)}, the right side of \\IN is not enumerable.`;throw Ph(r,`${t}\n${U(e)}`)}let p=Oi(f);if(r.generator){for(let e of xp(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(Mh(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(Mh(a,l,p[e]),o)}},og=/* @__PURE__ */ new WeakMap,sg=e=>{let t=og.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(sg),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return og.set(e,n),n},cg=(e,t)=>{let n=e.args[0],r=ig(e),i=(e,r,i)=>qh(n,r,i,e,!t)??-1,a=ag(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=W(e.args[1],jh(t,n,o));l(Mh(o,u,d),s)}},lg=(e,t,n)=>{let r=U(e);return(i,a,o,s,c,l)=>{let u=jh(i,a,o),d=W(e.function,n?u:e_(u)),f=w_(d);if(f!==void 0){Uh(f.body,t,n)(i,T_(f,e,u),o,s,c,l);return}if(!dn(d))throw Ph(i,`In computing ${Nh(i)}, a non-function (${ws(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw Ph(i,`In computing ${Nh(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},ug=(e,t)=>{let n=sg(e);return Yh(e,t)?rg([n],t,!1):e.kind===`Tuple`?Uh(n,t,!1):(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Xg(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){Uh(sg(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=jh(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=V_(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){Uh(sg(n.body),t,!1)(r,$_(n,e.args,u),a,o,s,c);return}}Lh(r,n,u)&&c(a,o)}},dg=(e,t,n)=>{let r=e.operator,i=ig(e),a=M(e)?void 0:B_(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=wv(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=Uh(a.body,t,n),o(e,i(jh(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=jh(a,o,s),f=V_(e,d);f?.kind===`Closure`?Uh(f.body,t,n)(a,$_(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},fg=(e,t,n)=>{let r=ig(e),i=M(e)?void 0:Wh(e.name,t),a;return(o,s,c,l,u,d)=>{let f=Xg(s,e.name);f?.kind===`Thunk`&&!f.isReleased?Uh(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&F_(i,t)!==void 0?r(o,s,c,l,u,d):(a??=Uh(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},pg=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||M(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!M(i))return;let a=Gh(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},mg=e=>e.kind===`And`?e.operands.flatMap(mg):[e],hg=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&Zh(e,t,!1),gg=e=>{let t=[];return(n,r,i)=>{let a=jh(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!Bh(n,i,Vh(t,r,i,a)))return}}},_g=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=mg(e),r=n.findIndex(e=>!hg(e,t)||pg(e,t)),i=r===-1?void 0:pg(n[r],t);return i?{...i,before:r===0?void 0:gg(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>_g(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||M(e))return;let r=B_(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=_g(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`||!M(o))return;let s=i.before,c=s&&wv(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(jh(e,t,n)),n))}},vg=(e,t,n)=>{let r=Xg(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},yg=(e,t,n)=>{let r=e.map(e=>Uh(e,t,n)),i=n?[]:e.map(e=>_g(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&vg(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},bg=e=>(t,n,r,i,a,o)=>{let s=t.generator;if(!s)throw Error(`A random choice needs the run's generator`);let c=Math.floor(s.nextDouble()*e.length),l=dp(s);for(let s=0;s<e.length;s++)if(e[(c+s*l)%e.length](t,n,r,i,a,o),t.successors>0||t.isStopped)return},xg=(e,t)=>{let n=Uh(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=jh(r,i,a),u=t.runtime.version,d=g_(e.bounds,e=>W(e,l)).map((n,r)=>xp(d_(n,e.bounds[r].set,u).length,n,t.runtime.getRandom(),u)),f=(t,i)=>{if(t<0)return n(r,i,a,o,s,c),r.successors>0||r.isStopped;let l=e.bounds[t].pattern;return d[t].some(e=>f(t-1,Qg(i,l,e)))};f(d.length-1,i)}},Sg=(e,t)=>{if(e.kind===`Exists`)return xg(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>Uh(e,t,!1));return e.isBulleted?bg(n):n.reduce((e,t)=>bg([e,t]))},Cg=(e,t,n)=>{let r=e=>Uh(e,t,n);switch(e.kind){case`And`:return rg(e.operands,t,n);case`Or`:return yg(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(n,r,o,s,c,l)=>{let u=d_(W(a.set,jh(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,Zg(r,e,u[t]),o,s,c,l)}}let o=n?void 0:ng(e,t);if(o){let r=rg(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=jh(n,i,a),d=g_(e.bounds,e=>d_(W(e,u),e,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=Zg(t,o.names[e],r);if(e===d.length-1){let e=jh(n,i,a);if(!o.guards.every(t=>Lh(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{y_(e.bounds,jh(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&cf(e,t)!==void 0&&!eg(e.body,t,/* @__PURE__ */ new Set)?$h(e,Qh):void 0;return(t,n,r,o,s,c)=>{let l=[];y_(e.bounds,jh(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Xg(n,e)?.kind===`Value`)){u.every(n=>Lh(t,e.body,jh(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Tg(r)?u.slice(n).every(n=>Lh(t,e.body,jh(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=W(e.condition,jh(r,i,a));if(typeof l!=`boolean`)throw Ph(r,Ih(r,l,e));(l?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,source:e.body,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=jh(r,i,a),u=t.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw Ph(r,`In computing ${Nh(r)}, a non-boolean expression${r.isEnabled?``:` `}(${ws(t)}) was used as a guard condition of a CASE.\n${zg(e.source)}`)})?.body??n;if(!u)throw Ph(r,`In computing ${Nh(r)}, TLC encountered a CASE with no conditions true.\n${U(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=av(e.definitions,t);return(t,r,a,o,s,c)=>n(t,rv(e.definitions,jh(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new w(`UNCHANGED appears in an initial predicate at ${Ig(e)}`)}:ug(e.expression,t);case`AngleAction`:{let n=r(e.action),i={kind:`Unchanged`,expression:e.subscript,location:e.subscript.location},a=(e,n,r)=>{try{return Lh(e,i,jh(e,n,r))}catch(n){throw e.isEnabled?Yg(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return yg([e.action,sg(e.subscript)],t,n);case`Label`:return r(e.body);case`Identifier`:return fg(e,t,n);case`FunctionApplication`:return lg(e,t,n);case`Apply`:{let i=e.args;if(Hh(e.operator)){let r=Kh(i[0],t,n);if(r!==void 0)return e.operator===`=`?rg([e],t,n):ag(e,()=>r);if(Jh(i[0],n))return cg(e,n)}if(e.operator===`=>`){let t=r(i[1]);return(n,r,a,o,s,c)=>{let l=W(i[0],jh(n,r,a));if(typeof l!=`boolean`){let t=ws(l),r=U(e);throw Ph(n,n.isInit?`In computing initial states of a predicate of form P => Q, P was ${t}\n.${r}`:n.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${t}.\n${r}`:`In computing next states of a predicate of the form P => Q, P was\n${t}.\n${r}`)}l?t(n,r,a,o,s,c):c(a,o)}}return dg(e,t,n)}default:return ig(e)}},wg=e=>e.variables.map(()=>void 0),Tg=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Eg=(e,t)=>{let n=t.state;if(!n||!Tg(n))throw new w(`ENABLED needs a complete state at ${Ig(e)}`);let r=t.environment;if(r.callStack)return wh(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1,generator:void 0,successors:0};return Uh(e,r,!1)(i,t.scope,wg(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Dg=(e,t,n,i,a)=>{let o={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};Uh(e,t,!0)(o,i,wg(t),void 0,!1,e=>{if(!o.isStopped){if(!Tg(e)){if(a){o.isStopped=a([...e]);return}throw x(new r([...e]),S.error)}o.isStopped=n(e)}})},Og=(e,t,n)=>{let r=[];return Dg(e,t,e=>(r.push(e),!1),n),r},kg=(e,t,n,r,i,a,o)=>{let s={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:a,successors:0,onUnsatisfied:o};return Uh(e,n,!1)(s,i,wg(n),void 0,!1,(e,t)=>{if(!s.isStopped){if(!Tg(e)){let r=n.variables.filter((t,n)=>e[n]===void 0);throw new re(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)}s.successors++,s.isStopped=r({state:e,action:t})}}),s.successors},Ag=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return Uh(e,n,!1)(i,r,wg(n),void 0,!1,e=>{Tg(e)||(i.isStopped=!0)}),i.isStopped},jg=(e,t,n,r)=>{let i=[];return kg(e,t,n,e=>(i.push(e),!1),r),i},Mg=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Ng=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Pg=e=>Ng.has(e.kind)||e.kind===`Apply`&&Mg.has(e.operator),Fg=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&un(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Ig=e=>`line ${e.location.line}, column ${e.location.column}`,U=e=>{let t=e.location.range;return t?g(t):Ig(e)},Lg={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},Rg=(e,t)=>new w(`TLC encountered a temporal formula (${e}) when evaluating a predicate or action.\n${U(t)}`),zg=e=>e.kind===`Number`?e.text??String(e.value):U(e),Bg=(e,t)=>new w(`A non-boolean expression (${ws(t)}) was used as the condition of an IF.\n${U(e)}`),Vg=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new w(`A non-boolean expression (${ws(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${zg(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new w(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${ws(n)}.\n${U({...e,location:{...e.location,range:{...r,end:i}}})}`)},Hg=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${N(L(n))}\n${U(e)}`,r=e=>`Attempted to apply function:\n${N(L(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!dn(i))throw new w(`Attempted to select field "${t}" from a non-record value ${N(L(i))}\n${U(e)}`);let a=sr(i);if(a===`tuple`)throw ra(t);return la(i.kind===`LazyFunction`?I(i):i,t,a===`record`?n:r)}},Ug=e=>e===`1.7.4`?(t,n)=>ea(t,n,e):void 0,Wg=e=>t=>{if(!dn(t))throw new w(`Attempted to apply the operator DOMAIN to a non-function\n(${ws(t)})\n${U(e)}`);return da(t)},Gg=(e,t)=>(n,r)=>{if(!ln(n)||Wn(n))throw new w(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${U(e)}`);return t.evaluateBinary?t.evaluateBinary(n,r):t.evaluate([n,r])},Kg=e=>x(new w(`TLC can't handle real numbers.\n${e.text}`),S.configParseError),qg=e=>x(new w(`TLC can't handle a number this big.\n${e.text??e.value}`),S.error),Jg=(e,t)=>new ie(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${U(t)}`,e),Yg=(e,t)=>e instanceof ie&&t!==`1.7.4`?new w(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,Xg=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},Zg=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Qg=(e,t,n)=>{if(t.kind===`Name`)return Zg(e,t.name,n);let r=Vi(n);if(!r||r.length!==t.names.length){let e=t.ranges?.[0];throw new w(`Argument mismatch in operator application.${e?g(e):``}`)}return t.names.reduce((e,t,n)=>Zg(e,t,r[n]),e)},$g=(e,t)=>{if(dn(e))return e;throw new w(`A non-function (${ws(e)}) was applied as a function.\n${U(t)}`)},e_=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},t_=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),n_=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Expected ${t} to be a boolean but found ${L(e)}`);return e},r_=(e,t,n)=>{if(typeof e!=`boolean`)throw new w(`Attempted to evaluate an expression of form P => Q when ${n} was\n${ws(e)}.\n${U(t)}`);return e},i_=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Attempted to apply the operator ~ to a non-boolean\n(${ws(e)})\n${U(t)}`);return!e},a_=(e,t,n)=>{if(typeof e!=`boolean`||typeof t!=`boolean`)throw new w(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${U(n)}`);return e===t},o_=(e,t)=>{if(typeof e!=`boolean`)throw new w(`TLC expected a boolean value, but did not find one. ${zg(t)}`);return e},s_=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),c_=(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.`},l_=(e,t,n)=>{if(!ln(e)||Wn(e)){let r=L(e),i=n===`1.7.4`?void 0:c_(e,r);throw new w(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${zg(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${zg(t)}\n${i}`)}},u_=(e,t,n)=>(l_(e,t,n),typeof e==`object`&&e.kind===`Interval`?oi(e):bi(e)??Ei(e)),d_=(e,t,n)=>n===`1.7.4`?(l_(e,t,n),bi(e)??Oi(e)):u_(e,t,n),f_=e=>{if(typeof e==`object`&&e.kind===`Interval`)return Ii(e),e},p_=(e,t,n)=>f_(e)??d_(e,t,n),m_=(e,t,n)=>f_(e)??u_(e,t,n),h_=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},g_=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set)),n),[]),__=(e,t)=>g_(e,e=>p_(W(e,t),e,t.environment.runtime.version)),v_=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):h_(t[n],t=>i(n-1,Qg(a,e[n].pattern,t)));return i(e.length-1,n)},y_=(e,t,n)=>v_(e,__(e,t),t.scope,n),b_=(e,t)=>{let n=g_(e,e=>W(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},x_=(e,t,n)=>{if(e.length===1)return Qg(t,e[0].pattern,n);let r=Vi(n)??[];return e.reduce((e,t,n)=>Qg(e,t.pattern,r[n]),t)},S_=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,C_=e=>Object.assign(e.value,{lambda:e}),w_=e=>S_(e)?e.lambda:void 0,T_=(e,t,n)=>{let r=e.value,i=t.args.map(e=>W(e,n)),a=i.length===1?i[0]:ui(i),o=(e,n,i)=>`In applying the function\n${N(L(r))},\nthe ${e} is:\n${N(L(n))}${i}.\n${U(t.function)}`,s=e.bounds;if(s.length===1){if(!Ki(a,r.domain))throw new w(o(`first argument`,a,`which is not in its domain`));return x_(s,e.scope,a)}let c=Vi(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0)throw new w(`Attempted to apply a function to an argument not in its domain.\n${U(t.function)}`);let u=()=>new w(`In applying the function\n${N(L(r))},\nthe argument list is:\n${N(L(a))}\nwhich does not match its formal parameter.\n`);if(s.forEach((e,t)=>{if(t>=c.length)throw u();let n=c[t],r=`argument number ${t+1}`;if(!Ki(n,l[t]))throw new w(o(r,n,`${e.pattern.kind===`Name`?``:`
|
|
1783
|
-
`}which is not in its domain`));if(e.pattern.kind===`Tuple`&&Vi(n)?.length!==e.pattern.names.length)throw new w(o(r,n,`which does not match its formal parameter`))}),c.length>s.length)throw u();return x_(s,e.scope,a)},E_=(e,t)=>{if(t.location.range)return{parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:zg(t)}},D_=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},O_=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},k_=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),A_=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),j_=(e,t)=>{let n=b_(e.bounds,t),r=O_(n,(n,r)=>W(e.body,t_(t,x_(e.bounds,Zg(void 0,e.name,r),n))),D_(E_(e.bounds,e.body),e.bounds,n),k_(e.bounds));C_({value:r,bounds:e.bounds,body:e.body,scope:Zg(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=j_(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?cr(i):i},M_=(e,t)=>{if(typeof t!=`object`||sr(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!un(t.domain))return t;try{let e=I(t);return ir(e.domain,e.range)}catch(e){if(e instanceof w)return t;throw e}},N_=(e,t)=>e.kind===`Operator`&&e.params.length>0?()=>{throw new w(`Operator ${e.name} requires ${e.params.length} arguments`)}:e.kind===`Function`?e.isSelfReferential?t=>j_(e,t):yv(A_(e),t):yv(e.body,t),P_=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=N_(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(t_(e,void 0)):e=>a[i]??r(t_(e,void 0));return t.definitionEvaluators.set(e,o),o},F_=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},I_=(e,t)=>e.forEach(e=>{if(e.kind===`Operator`&&e.params.length>0)return;let n=e.name;if(t.constants.has(n)||t.substitutions.has(n)||!tf(e,t))return;let r=t.facts.ids.get(e);if(r===void 0||t.startupValues[r]!==void 0)return;let i={environment:t,scope:void 0,state:void 0,next:void 0};try{let n=t.runtime.evaluateAtStartup(()=>M_(e,N_(e,t)(i)));Hr(n),t.startupValues[r]=n}catch(e){if(!(e instanceof w)&&!b(e))throw e}}),L_=(e,t)=>{if(t===void 0||e===t)return!0;try{return t.every((t,n)=>t===void 0||e?.[n]!==void 0&&hr(e[n],t))}catch(e){if(e instanceof w)return!1;throw e}},R_=(e,t)=>{let n=e.cache;if(n!==void 0&&L_(t.state,e.state)&&L_(t.next,e.next))return n;let r=t.environment.coverage,i=r?.current===-1?void 0:r?.values.get(e),a=r&&i!==void 0?Uo(r,i,()=>W(e.expression,t_(t,e.scope))):W(e.expression,t_(t,e.scope));return(!e.isStreamed||Ai(a))&&(e.cache=a,e.state=t.state,e.next=t.next),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),a},z_=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),B_=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return B_(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?z_(r):t.builtins.get(e)},V_=(e,t)=>M(e)?H_(e.operator,t):B_(e.operator,t.environment)??H_(e.operator,t),H_=(e,t)=>{let n=Xg(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return B_(e,t.environment)},U_=e=>e.kind===`Closure`?e.params.length:e.arity,W_=(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:H_(n,t);if(!r)throw new w(`Expected an operator argument at ${Ig(e)}`);return r},G_=(e,t,n)=>{if(e.kind===`Builtin`&&e.isLazy)return e.evaluate(t.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>e})),n);if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>Zg(e,n.name,t[r]),e.scope);return W(e.body,t_(n,r))},K_=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:U_(e),call:n=>G_(e,n,t)},q_=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=H_(e.name,t);return n!==void 0&&U_(n)>0},J_=(e,t)=>e.map(e=>q_(e,t)?K_(W_(e,t),t):W(e,t)),Y_=(e,t)=>new w(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),X_=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),Z_=(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 Z_(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([])}},Q_=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&hn(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=X_(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=M(e)?void 0:Z_(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0&&!t.callStack)return t=>{let n=Xg(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:X_(e,t)}}return t=>X_(e,t)},$_=(e,t,n,r)=>{if(t.length!==e.params.length)throw Y_(e,t.length);let i=e.scope;for(let a=0;a<t.length;a++){let o=e.params[a],s=o.arity>0?{kind:`Operator`,operator:W_(t[a],n)}:(r?.[a]??Q_(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},ev=(e,t,n,r)=>e.kind===`Closure`?W(e.body,t_(n,$_(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(Sv(t,n),n):e.evaluate(J_(t,n),n),tv=/* @__PURE__ */ new WeakMap,nv=e=>{let t=tv.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return tv.set(e,n),n},rv=(e,t,n)=>{let r=e.map(e=>({name:e.name,binding:{kind:`Value`,value:!1},parent:void 0})),i=r.reduce((e,t)=>(t.parent=e,t),t.scope);e.forEach((e,a)=>{r[a].binding=e.kind===`Function`?{kind:`Thunk`,expression:nv(e),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1}:e.params.length>0||n?.impure.has(e)?{kind:`Operator`,operator:{kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:i}}:{kind:`Thunk`,expression:e.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(e)??!1}});let a=t.environment.coverage;return a&&a.current!==-1&&r.forEach(e=>{e.binding.kind===`Thunk`&&a.values.set(e.binding,a.current)}),i},iv=(e,t,n)=>{let r=Xg(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return R_(r,n);if(r?.kind===`Operator`){if(U_(r.operator)===0)return G_(r.operator,[],n);throw new w(`Operator ${e} is used without arguments`)}let i=Z_(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Jg(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return P_(i.definition,n.environment)(n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new w(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${U(t)}`)},av=(e,t)=>({impure:new Set(e.filter(e=>af(e,t))),streamed:new Set(e.filter(e=>af(e,t,`streamed`)))}),ov=e=>[...e.facts.ids.keys()].some(t=>af(t,e)),sv=e=>[...e.facts.ids.keys()].some(t=>af(t,e,`repeated`)),cv=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,lv=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),uv=e=>t=>{let n=e(t);return hr(n,e(lv(t)))},dv=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Ui.sets,o=Ui.callStack,s=a??[],c=s.length;Ui.sets=s,Ui.callStack=r;try{let a=t(i),o=cv(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Pg(e)&&r.sources.set(o,e),o}catch(t){t instanceof u&&!r.isFrozen&&(r.expressions.length=0,r.isFrozen=!0);let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Fg(e,r.values),a=i&&!mt(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!dn(a)?void 0:a;throw fv(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,Ui.sets=a,Ui.callStack=o}},fv=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof w){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},pv=(e,t,n)=>{if(!(n instanceof w))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},mv=e=>({...e,coverage:void 0,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),hv=(e,t,n)=>{let r=e.location.range,i=e.prefixEnds;if(!n||e.isBulleted||!r||!i||t.length<3)return;let a=i.slice(0,t.length-2).map(t=>({...e,location:{...e.location,range:{...r,end:t}}})).reverse(),o=e.kind===`And`;return r=>{n.expressions.push(...a);for(let i=0;i<t.length;i++){i>=2&&!n.isFrozen&&n.expressions.pop();let s=t[i](r);if(typeof s!=`boolean`)throw Vg(e,i,s);if(s!==o)return n.isFrozen||(n.expressions.length-=a.length-Math.max(i-1,0)),s}return o}},gv=(e,t,n,r)=>i=>{if(r.expressions.at(-1)===e)return n(i);r.expressions.push(...t);try{return n(i)}finally{r.isFrozen||(r.expressions.length-=t.length)}},_v=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=Vo(n,i,e);Ho(n,a),n.current=a;try{let i=t(r);return typeof i==`object`&&e.kind===`SetEnumeration`&&n.values.set(i,a),i}finally{n.current=i}},vv=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Kv(e,t),i=t.callStack,a=i&&Zl.get(e),o=i?dv(e,r,t,i):r,s=i&&a?gv(e,a,o,i):o,c=t.coverage,l=c?_v(e,s,c):s;return t.evaluators.set(e,l),l},yv=(e,t)=>{if(t.callStack||t.coverage)return vv(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=ec(e,t)??vv(e,t);return t.entryEvaluators.set(e,r),r},W=(e,t)=>yv(e,t.environment)(t),bv=(e,t)=>{let n=e.name,r=M(e)?void 0:Z_(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Jg(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n;return r=>(n??=P_(e,t))(r)}return t=>iv(n,e,t)},xv=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||M(e))return!0;let n=B_(e.name,t);return n===void 0||U_(n)===0},Sv=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),Cv=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Sv(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&xv(t[0],n)){let e=vv(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&xv(t[0],n)&&xv(t[1],n);if(i&&a){let e=vv(t[0],n),r=vv(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(J_(t,n),n)},wv=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw Y_(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Q_(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:W_(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Tv=(e,t,n)=>{let r=wv(e,t,n),i;return t=>(i??=yv(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},Ev=(e,t)=>{let n=e.args;if(e.operator===`=>`){let r=vv(n[0],t),i=vv(n[1],t);return t=>!r_(r(t),e,`P`)||r_(i(t),e,`Q`)}if(e.operator===`~`&&n.length===1){let r=vv(n[0],t);return t=>i_(r(t),e)}if(e.operator===`<=>`){let r=vv(n[0],t),i=vv(n[1],t);return t=>a_(r(t),i(t),e)}if(e.operator===`~>`||e.operator===`-+->`)return()=>{throw Rg(e.operator===`~>`?`a ~> b`:`a -+-> formula`,e)};let r=M(e)?void 0:B_(e.operator,t);if(r?.kind===`Closure`)return Tv(r,n,t);if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=vv(n[0],t),i=Wg(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=!Xl.has(e)&&!lf(n[0],t);return e=>r.evaluate(Sv(n,e),i&&e.scope===void 0?void 0:e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=vv(n[0],t),a=vv(n[1],t),o=Gg(e,r);return e=>o(i(e),a(e))}if(r?.kind===`Builtin`)return Cv(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new w(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let i=n.map(e=>Q_(e,t));return r=>{let a=H_(e.operator,r);if(a)return ev(a,n,r,i);throw t.definitions.get(e.operator)?.kind===`Function`?new w(`${e.operator} is a function; apply it with brackets`):new w(`Unknown operator ${e.operator} at ${Ig(e)}`)}},Dv=(e,t)=>{let n=e.kind===`Forall`,r=vv(e.body,t),i=e.bounds[0];if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=vv(i.set,t);return s=>h_(p_(o(s),i.set,t.runtime.version),t=>o_(r(t_(s,Zg(s.scope,a,t))),e)!==n)?!n:n}let a=e.bounds;if(a.every(e=>e.pattern.kind===`Name`)){let i=a.map(e=>e.pattern.kind===`Name`?e.pattern.name:``);return o=>{let s=g_(a,e=>p_(vv(e,t)(o),e,t.runtime.version)),c=(t,a)=>t<0?o_(r(t_(o,a)),e)!==n:h_(s[t],e=>c(t-1,Zg(a,i[t],e)));return c(a.length-1,o.scope)?!n:n}}return t=>y_(a,t,i=>o_(r(t_(t,i)),e)!==n)?!n:n},Ov=(e,t)=>{if(e.kind===`Tuple`)return ui(e.names.map(e=>{let n=Xg(t,e);return n?.kind===`Value`&&n.value}));let n=Xg(t,e.name);return n?.kind===`Value`?n.value:void 0},kv=/* @__PURE__ */ new WeakSet,Av=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&kv.add(e)},jv=/* @__PURE__ */ new WeakMap,Mv=e=>{if(jv.has(e))return jv.get(e);let t=/* @__PURE__ */ new Set,n=e=>{if(e.kind===`Subexpression`)return!1;let r=ht(e);return r!==void 0&&t.add(r),e.kind===`ExceptAt`&&t.add(`@`),mt(e).every(n)},r=n(e)?[...t]:void 0;return jv.set(e,r),r},Nv=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=Xg(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),Pv=e=>kv.has(e),Fv=(e,t)=>{let n=Pv(e),r=vv(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=e=>r(t_(t,Zg(t.scope,n,e)));if(sn(e))return Ii(e),cn(e,i),d(e,t);let o=ci(e),s=ir(o,o.map(i));return un(e)?s:(s.lambdaDomain=e,cr(s))}let n=[],s=g_(i,e=>m_(W(e,t),e,t.environment.runtime.version));return v_(i,s,t.scope,e=>{let o=i.length===1?Ov(a.pattern,e)??!1:ui(i.map(t=>Ov(t.pattern,e)??!1));return n.push([o,r(t_(t,e))]),!1}),$r(n)},c=E_(i,e.body),l=k_(i),u=Mv(e.body),d=(t,n)=>{let a=Nv(n.scope,u),o=t_(n,a),s=C_({value:O_(t,e=>r(t_(o,x_(i,a,e))),D_(c,i,t),l),bounds:i,body:e.body,scope:a});return i.length===1?cr(s):s},f=t.callStack;return{build:(t,r)=>{if(e.isRecursive||n||r.isKeepLazy||!P(t))return d(t,r);if(!(i.length===1?un(t):typeof t==`object`&&t.kind===`ProductSet`&&t.factors.every(un))){if(f)return d(t,r);try{return s(t,r)}catch(e){if(!(e instanceof w))throw e;return d(t,r)}}if(!f)return s(t,r);try{return s(t,r)}catch(t){throw pv(f,e,t),t}},createLazy:d}},Iv=(e,t)=>{let n=Fv(e,t).build,r=e.bounds;if(r.length===1&&r[0].pattern.kind===`Name`){let e=vv(r[0].set,t);return t=>n(e(t),t)}return e=>n(b_(r,e),e)},Lv=(e,t)=>{let n=kv.has(e);n&&Av(e.function);let r=vv(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=>vv(e,t))}),value:vv(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):ui(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(t_(i,Zg(i.scope,`@`,e))):fa(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i=!1;n=o(n,r.path,0,t,e=>(i=!0,r.value(e))),i||t.environment.runtime.warn(St.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${U(e.function)}`)}return n}},Rv=(e,t)=>{let n=vv(e.predicate,t),r=e.bound.pattern,i=zg(e.predicate),a=e.predicate.location.range&&{names:r.kind===`Name`?r.name:r.names.join(`, `),predicate:i},o=t.coverage,s=(e,t,n)=>{if(!o||e===-1)return n();t||o.secondary[e]++;let r=Uo(o,t?-1:e,n);return!t&&r===!0&&o.secondary[e]++,r},c=(t,n,o,l)=>({kind:`FilteredSet`,base:t,test:(e,t)=>{if(r.kind===`Tuple`&&Vi(e)?.length!==r.names.length)throw new w(`Attempted to check if the value:\n${N(L(e))}\nis an element of a set of ${r.names.length}-tuples.`);let a=s(l,t,()=>o(t_(n,Qg(n.scope,r,e))));if(typeof a!=`boolean`)throw new w(`${t?`The evaluation of predicate`:`Evaluating predicate`} ${i} yielded non-Boolean value.`);return a},source:a,rebind:r=>c(t,{...n,environment:r},vv(e.predicate,r),-1)});return(e,t,r=-1)=>c(e,t,n,r)},zv=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${ws(e)}.\n${zg(t.predicate)}`);return e},Bv=(e,t,n,r)=>{if(!ln(e)||Wn(e))throw new w(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${U(t)}`);return Ur(e),m_(e,n,r)},Vv=e=>new w(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${U(e)}`),Hv=(e,t)=>{if(e.kind===`SetFilter`){let n=vv(e.predicate,t),r=vv(e.bound.set,t),i=Rv(e,t),a=e.bound.pattern,o=t.coverage;return t=>{let s=r(t);if(!un(s))return i(s,t,o?.current);let c=[],l=r=>{let i=n(t_(t,Qg(t.scope,a,r)));zv(i,e)&&on(c,r)},u=s.kind===`Interval`?s:F(s).elements;return cn(u,l),o&&o.current!==-1&&(o.secondary[o.current]+=(Array.isArray(u)?u.length:u.high-u.low+1)+c.length),rr(c)}}if(e.kind===`SetMap`){let n=vv(e.expression,t);return t=>{let r=[];return y_(e.bounds,t,e=>(on(r,n(t_(t,e))),!1)),Jr(r)}}let n=e.set;if(!n)return()=>{throw new w(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${U(e)}`)};let r=vv(e.body,t),i=vv(n,t);return t=>{let a=Bv(i(t),e,n,t.environment.runtime.version),o,s=e.pattern;if(h_(a,n=>{if(s.kind===`Tuple`&&Vi(n)?.length!==s.names.length)throw new w(`Attempted to compute the value of an expression of form\nCHOOSE <<x1, ... , xN>> \\in S: P, but S was not a set\nof N-tuples.\n${U(e)}`);let i=Qg(t.scope,s,n);return o_(r(t_(t,i)),e)?(o=Ov(s,i),!0):!1}),o===void 0)throw Vv(e);return o}},Uv=e=>[...e].sort((e,t)=>Zn(e.name,t.name)),Wv=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),Gv=(e,t)=>{let n=Uv(e),r=e.map(e=>vv(e.value,t));if(Wv(n))return t=>di(e.map((e,n)=>[e.name,r[n](t)]));let i=n.map(e=>e.name),a=e.map(e=>e.name);if(a.some((e,t)=>e!==i[t])){let t=n.map(t=>e.indexOf(t));return e=>xn(i,t,r.map(t=>t(e)),a)}return e=>fi(i,r.map(t=>t(e)))},Kv=(e,t)=>{let n=e=>vv(e,t);switch(e.kind){case`Number`:{let t=e.value;return hn(t)?()=>t:()=>{throw qg(e)}}case`Decimal`:return()=>{throw Kg(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return bv(e,t);case`Apply`:return Ev(e,t);case`Bracket`:return()=>{throw new w(`A bracket without a function or subscript is not an expression at ${Ig(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new w(`An operator cannot be used as a value at ${Ig(e)}`)};case`And`:{let r=e.operands.map(n);return hv(e,r,t.callStack)??(t=>{for(let n=0;n<r.length;n++){let i=r[n](t);if(typeof i!=`boolean`)throw Vg(e,n,i);if(!i)return!1}return!0})}case`Or`:{let r=e.operands.map(n);return hv(e,r,t.callStack)??(t=>{for(let n=0;n<r.length;n++){let i=r[n](t);if(typeof i!=`boolean`)throw Vg(e,n,i);if(i)return!0}return!1})}case`Prime`:{let t=n(e.expression);return e=>t(lv(e))}case`Unchanged`:return uv(n(e.expression));case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw Bg(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new w(`A non-boolean expression (${ws(t)}) was used as a condition of a CASE. ${zg(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new w(`Attempted to evaluate a CASE with no conditions true.\n${U(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(t_(n,rv(e.definitions,n)))}case`Forall`:case`Exists`:return Dv(e,t);case`UnboundedQuantifier`:return()=>{let t=e.quantifier===`Forall`?`\\A`:`\\E`;throw e.isTemporal?Rg(e.quantifier===`Forall`?`\\AA`:`\\EE`,e):new w(`TLC attempted to evaluate an unbounded ${t}.\nMake sure that the expression is of form ${t} x \\in S: P(x).\n${U(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Hv(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Jr(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>ui(t.map(t=>t(e)))}case`FunctionConstruction`:return Iv(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 Gv(e.fields,t);case`RecordSet`:{let t=Uv(e.fields),r=t.map(e=>e.name),i=t.map(t=>e.fields.indexOf(t)),a=e.fields.map(e=>n(e.value));return i.every((e,t)=>e===t)?e=>({kind:`RecordSet`,names:r,sets:a.map(t=>t(e))}):e=>{let t=a.map(t=>t(e));return{kind:`RecordSet`,names:r,sets:i.map(e=>t[e])}}}case`Except`:return Lv(e,t);case`ExceptAt`:return t=>{let n=Xg(t.scope,`@`);if(n?.kind!==`Value`)throw new w(`@ appears outside an EXCEPT at ${Ig(e)}`);return n.value};case`FunctionApplication`:{Av(e.function);let r=n(e.function),i=t=>$g(r(e_(t)),e),a=e.args.map(n),o=Ug(t.runtime.version);if(a.length===1){let e=a[0];return t=>la(i(t),e(t),o)}return e=>la(i(e),ui(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=Hg(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=uv(n(e.subscript)),i=e.kind===`BoxAction`,a=i?`[A]_e`:`<A>_e`;return n=>{let o=t(n);if(typeof o!=`boolean`)throw new w(`Attempted to evaluate an expression of form ${a}, but A was not a boolean.\n${U(e)}`);return i?o||r(n):o&&!r(n)}}case`Enabled`:{let t=e.expression;return e=>Eg(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new w(`The subexpression reference at ${Ig(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw Rg(Lg[e.kind],e)}}},qv=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Jv=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Ca(e[t]),16777619),r=Math.imul(r^ka(e[t]),1540483477);t[0]=qv(n)||1,t[1]=qv(r)},Yv=()=>{let e=/* @__PURE__ */ new Int32Array(8192),t=0,n=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},r=()=>{let t=e,r=new Int32Array(t.length*2);for(let e=0;e<t.length;e+=2){if(t[e]===0)continue;let i=n(r,t[e],t[e+1]);r[i*2]=t[e],r[i*2+1]=t[e+1]}e=r};return{insert:(i,a)=>{t*4>=e.length&&r();let o=n(e,i,a);return e[o*2]!==i&&(e[o*2]=i,e[o*2+1]=a,t++,!0)}}},Xv=e=>({slots:new Int32Array(1<<17),size:0,shift:16,states:e}),Zv=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=ma(t,Ca(e[n]));return t&1073741823},Qv=(e,t)=>{for(let n=0;n<t.length;n++)if(!_r(e[n],t[n]))return!1;return!0},$v=(e,t)=>Math.imul(t,2654435761)>>>e.shift<<1,ey=(e,t,n)=>{let r=e.slots.length-1;for(let i=$v(e,t);;i=i+2&r){let r=e.slots[i+1];if(r===0)return-1;if(e.slots[i]===t&&Qv(e.states[r-1],n))return r-1}},ty=(e,t,n)=>{let r=e.slots.length-1,i=$v(e,t);for(;e.slots[i+1]!==0;)i=i+2&r;e.slots[i]=t,e.slots[i+1]=n},ny=(e,t,n)=>{if(e.size++,e.size*4>e.slots.length){let t=e.slots;e.slots=new Int32Array(t.length*2),e.shift--;for(let n=0;n<t.length;n+=2)t[n+1]!==0&&ty(e,t[n],t[n+1])}ty(e,t,n+1)},ry=(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}},iy=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),ay=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return ry(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},oy=e=>Atomics.load(e.used,0)*2>=e.slots.length,sy=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&ry(t,n);return{slots:t,used:e.used}},cy={kind:`Boolean`,value:!0},ly={kind:`Boolean`,value:!1},uy=e=>e?cy:ly,dy=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,fy=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,py=(e,t)=>({kind:e,body:t}),my=(e,t,n)=>({kind:e,operands:[t,n]}),hy=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?hy(e,t.operands).operands:[t])}),gy=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return gy(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,gy(t)),0)}},_y=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 _y(e.body);case`And`:case`Or`:return e.operands.some(_y)}},vy=/* @__PURE__ */ new WeakMap;let yy=0;const by=e=>{let t=vy.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`#${yy++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(by).join(`,`)})`;default:return`${e.kind}(${by(e.body)})`}})();return vy.set(e,n),n},xy=(e,t)=>e===t||by(e)===by(t),Sy=(e,t)=>{let n=by(t);return e.some(e=>e===t||by(e)===n)},Cy=e=>e===`And`?`Or`:`And`,wy=(e,t)=>{switch(e.kind){case`Boolean`:return t?uy(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?py(`Not`,e):e;case`Not`:return wy(e.body,!t);case`And`:case`Or`:return hy(t?Cy(e.kind):e.kind,e.operands.map(e=>wy(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return py(n,wy(e.body,t))}}},Ty=e=>{switch(e.kind){case`Boolean`:return uy(!e.value);case`Not`:return e.body;case`And`:case`Or`:return hy(Cy(e.kind),e.operands.map(Ty));case`Always`:return py(`Eventually`,Ty(e.body));case`Eventually`:return py(`Always`,Ty(e.body));default:return py(`Not`,e)}},Ey=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Ey(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return uy(t)}return n.length===0?uy(!t):n.length===1?n[0]:hy(e.kind,n)}case`Not`:{let t=Ey(e.body);return t.kind===`Boolean`?uy(!t.value):py(`Not`,t)}case`Always`:case`Eventually`:{let t=Ey(e.body);return py(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Dy=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Oy=e=>{switch(e.kind){case`And`:{let t=[],n=1;for(let r of e.operands){let e=Oy(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n*=e.operands.length,n>2147483647))throw new w(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n===1)return{kind:`And`,operands:t};let r=Array.from({length:n},()=>[]),i=1,a=n;for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}a/=e.operands.length;let t=0;for(let n=0;n<i;n++)for(let n of e.operands)for(let e=0;e<a;e++)r[t++].push(n);i*=e.operands.length}return{kind:`Or`,operands:r.map(e=>hy(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Oy(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Dy(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:hy(`Or`,t);n.push(py(`Always`,py(`Eventually`,e)))}return hy(`Or`,n)}case`Not`:return dy(e.body)?e:Oy(Ty(e.body));default:return e}},ky=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?ky(e.operands[0]):hy(e.kind,e.operands.map(ky));case`Not`:return e.body.kind===`Not`?ky(e.body.body):py(`Not`,ky(e.body));case`Always`:case`Eventually`:case`Next`:return py(e.kind,ky(e.body));default:return e}},Ay=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Ay(e.operands[0]);let t=Math.floor(e.operands.length/2);return my(e.kind,Ay(hy(e.kind,e.operands.slice(0,t))),Ay(hy(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return py(e.kind,Ay(e.body));default:return e}},jy=(e,t)=>{e.kind===`Eventually`&&!Sy(t,e)&&t.push(e),`body`in e&&jy(e.body,t),`operands`in e&&e.operands.forEach(e=>jy(e,t))},My=e=>{let t=e.filter(fy),n=e.flatMap(e=>e.kind===`Not`&&fy(e.body)?[e.body]:[]);return!t.some(e=>Sy(n,e))},Ny=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,py(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new w(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Py=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:py(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Fy=(e,t,n)=>e.flatMap(e=>{let r=Py(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Iy=e=>[...new Set(e.map(by))].sort().join(`|`),Ly=(e,t)=>{let n=new Set(t.map(Iy));return[...e.filter(e=>!n.has(Iy(e))),...t]},Ry=e=>{let t=Ny(e),n=Fy(t,`Always`,`And`),r=Fy(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Py(t,`Eventually`,`Or`);if(n&&!(Sy(e,n.first)||Sy(e,n.second)))return Ly(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Sy(e,t.first)||Sy(e,t.second))&&!Sy(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!My(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Py(t[e],`Always`,`And`);n&&(Sy(t,n.first)||t.push(n.first),Sy(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)Sy(t,e.first)&&Sy(t,e.second)&&!Sy(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!My(t)?[]:i(t)};return a(e)},zy=e=>({particle:e,successors:[],statePredicates:e.filter(e=>gy(e)<=1)}),By=e=>{let t=Ry([e]).map(zy),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Iy(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 Ry(n)){let n=Iy(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(zy(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Vy=(e,t)=>!Sy(e,t)||Sy(e,t.body),Hy=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&gy(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Dy(e);if(n){let e=gy(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(_y(e))throw new w(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Uy=(e,t)=>{let n=e.findIndex(e=>xy(e,t));return n===-1?(e.push(t),e.length-1):n},Wy=e=>{let t=Oy(Ey(wy(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=ky(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Hy(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:hy(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:xy(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Ay(e.formula),n=[];t&&jy(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Uy(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Uy(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Uy(i,e))}));return{tableau:t&&By(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Gy=()=>x(new w(`Temporal formula is a tautology (its negation is unsatisfiable).`),S.livenessEvaluationFailure),Ky=/* @__PURE__ */ new Set([`~>`,`-+->`]),qy=/* @__PURE__ */ new WeakSet,Jy=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),Yy=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Xy=(e,t)=>new w(`TLC cannot handle the temporal formula ${U(e)}${t===void 0?``:`:\n${t}`}`),Zy=(e,t,n,r=/* @__PURE__ */ new Set,i=/* @__PURE__ */ new Set)=>{let a=(e,t,r)=>{if(i.has(e))return 0;i.add(e);let a=Zy(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=Xg(t,e);if(!n)return;if(n.kind===`Value`)return 0;if(n.kind===`Thunk`)return n.isReleased?0:a(n,n.expression,n.scope);let r=n.operator;return r.kind===`Closure`?a(r,r.body,r.scope):0},s=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=s_(e,n);if(t)return of(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isActionLevel?2:r.isStateLevel&&!r.isLevelConstant?1:0},c=(e,t)=>r.has(e)?0:M(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return au(e,(e,o)=>(a=Math.max(a,Zy(e,t,n,o.length===0?r:/* @__PURE__ */ new Set([...r,...o]),i)),e)),a};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:l(e);case`Identifier`:return c(e.name,e);case`OperatorReference`:return c(e.operator,e);case`Apply`:{if(Ky.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=M(e)?void 0:B_(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,$_(o,e.args,Yy(n,t)))}default:return l(e)}},Qy=(e,t)=>{try{return __(e,t)}catch(e){if(!(e instanceof w))throw e;if(!Nt(e))return;throw x(new w(`${a}${e.message}`),S.error)}},$y=(e,t,n,r,i={name:void 0,path:[],expanding:/* @__PURE__ */ new Set,isSubstituted:!1})=>{let a=(e,t,a=i.name,o=i.expanding,s)=>$y(e,t,n,r,{name:a,path:s?.kind===`Operator`&&s.params.length===0?[...i.path,s.name]:i.path,expanding:o,isSubstituted:i.isSubstituted||s!==void 0&&n.substitutedDefinitions.has(s)});if(e.kind===`And`)return e.operands.flatMap(e=>a(e,t,U(e)));if(e.kind===`Label`)return a(e.body,t);if(e.kind===`Let`)return a(e.body,eb(e,t,n));if(e.kind===`Identifier`){let r=M(e)?Xg(t,e.name):void 0;if(r?.kind===`Thunk`&&!r.isReleased)return a(r.expression,r.scope,qy.has(r)?e.name:i.name);let o=n.constants.has(e.name)?void 0:s_(e.name,n);if(!r&&o?.kind===`Operator`&&o.params.length===0&&(of(o,n)>0||F_(o,n)===void 0)){if(i.expanding.has(o))throw m();return a(o.body,void 0,!i.isSubstituted&&n.instanceNames.get(e.name)||o.name,/* @__PURE__ */ new Set([...i.expanding,o]),o)}}let o=Yy(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||Zy(e,t,n)===3)){let t=V_(e,o),r=M(e)?void 0:s_(e.operator,n),s=t?.kind===`Closure`&&t.params.every(e=>n.instanceParams.has(e));if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&(!i.isSubstituted||s))return a(t.body,$_(t,e.args,o),i.isSubstituted&&r?r.name:e.operator,i.expanding,r)}let s=r&&e.kind===`Forall`&&e.bounds.every(e=>Zy(e.set,t,n)===0),c=s?Qy(e.bounds,o):void 0;if(s&&c){let n=[];if(v_(e.bounds,c,t,t=>(n.push(...a(e.body,t,U(e.body))),!1)),n.length===0)throw Gy();return n}return[{expression:e,scope:t,name:i.name,path:i.path}]},eb=(e,t,n)=>{let r=rv(e.definitions,Yy(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&qy.add(e.binding);return r},tb=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,a=(e,t,i)=>{let a=i===0&&!r?Zy(e,t,n):i;if(a===0){let r=W(e,Yy(n,t));if(typeof r!=`boolean`)throw new w(`TLC expected a boolean value, but did not find one. ${zg(e)}`);return uy(r)}return a===1?{kind:`State`,expression:e,scope:t}:e.kind===`AngleAction`?{kind:`Action`,expression:e.action,subscript:e.subscript,scope:t}:{kind:`Action`,expression:e,subscript:void 0,scope:t}},o=0,s=(e,t,r,i)=>{if(o>=100)throw m();o++;let s=f(e,t);o--;let c=gy(s),l=c===0&&Zy(r,i,n)>2;return c>2||l?s:a(r,i,c)},c=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=Yy(n,t),o=M(e)||s_(i,n)===void 0?Xg(t,i):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&qy.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:M(e)?H_(i,a):B_(i,n),u=e.kind===`Apply`?e.args:[],p=c?.kind===`Builtin`&&u.length===2?Jy.get(c.name):void 0;if(p){let n=u.map(e=>f(e,t));return d(e,t,hy(p,n))}if(c?.kind!==`Closure`)throw Xy(e);let m=!M(e)&&s_(i,n)?.isRecursive===!0;return l(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),s(c.body,$_(c,u,a),e,t)),m)},l=(e,t,n=!1)=>{try{return t()}catch(t){let a=t instanceof i||n&&!r;throw!(t instanceof w)||a?t:Xy(e)}},u=(e,t)=>{let r=Zy(e,t,n),o=[],s=e.kind===`Forall`;try{y_(e.bounds,Yy(n,t),t=>(o.push(f(e.body,t)),!1))}catch(n){if(!(n instanceof w)||n instanceof i)throw n;if(r<=2)return a(e,t,r);throw Xy(e,s&&!Nt(n)?n.message:void 0)}return o.length===0?uy(s):d(e,t,hy(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=gy(n);return r>2?n:a(e,t,r)},f=(e,t)=>{let i=Zy(e,t,n);switch(e.kind){case`Label`:return f(e.body,t);case`Let`:return f(e.body,eb(e,t,n));case`Apply`:{let n=e.args;if(e.operator===`~`&&!M(e))return d(e,t,py(`Not`,f(n[0],t)));if(e.operator===`=>`)return d(e,t,my(`Or`,py(`Not`,f(n[0],t)),f(n[1],t)));break}case`And`:case`Or`:return d(e,t,hy(e.kind,e.operands.map(e=>f(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!r&&Zy(e.condition,t,n)===0){let r=W(e.condition,Yy(n,t));if(typeof r==`boolean`)return f(r?e.consequent:e.alternative,t)}let i=f(e.condition,t);return d(e,t,my(`Or`,my(`And`,i,f(e.consequent,t)),my(`And`,py(`Not`,i),f(e.alternative,t))))}}if(i<=2)return a(e,t,i);switch(e.kind){case`Identifier`:return c(e,t);case`Apply`:return e.operator===`~>`?py(`Always`,my(`Or`,py(`Not`,f(e.args[0],t)),py(`Eventually`,f(e.args[1],t)))):c(e,t);case`Always`:case`Eventually`:return py(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=py(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?py(`Always`,py(`Eventually`,my(`Or`,i,a))):my(`Or`,py(`Eventually`,py(`Always`,i)),py(`Always`,py(`Eventually`,a)))}default:throw Xy(e)}};return f(e,t)},nb=e=>({holdsState:(t,n)=>{let r={environment:e,scope:t.scope,state:n,next:void 0},i=t.kind===`State`?W(t.expression,r):Eg(t.step,r);if(typeof i!=`boolean`)throw new w(`A state predicate was evaluated to a non-boolean value.`);return i},holdsAction:(t,n,r)=>{let i=t.scope,a=t.subscript;if(a&&Wr(W(a,{environment:e,scope:i,state:n,next:void 0}),W(a,{environment:e,scope:i,state:r,next:void 0})))return!1;let o=W(t.expression,{environment:e,scope:i,state:n,next:r});if(typeof o!=`boolean`)throw new w(`Encountered an action predicate that's not a boolean.`);return o}}),rb=(e,t,n,r,i)=>{let a=e=>rb(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=r.holdsState(e,t);return i.set(e,a),a}case`Action`:return e.enabled&&i.get(e.enabled)===!1?!1:n!==void 0&&r.holdsAction(e,t,n);case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return rb(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new w(`TLC cannot evaluate a temporal formula in a single step`)}},ib=(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)=>ib(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 rb(e,t[r],t[a(r)],nb(i),/* @__PURE__ */ new Map)}},ab=`UnnamedAction`,ob={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},sb=e=>{let t=e.range??ob;return di([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},cb=(e,t)=>{let n=[[`name`,e.name],[`location`,sb(e.location)]];return e.parameters.length>0&&n.push([`context`,di(e.parameters)],[`parameters`,ui(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),di(n)},lb=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),ub=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),db=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,fb=e=>e.kind===`Apply`?e.args:[],pb=(e,t,n)=>{let r=db(e);if(r===void 0)return;if(M(e)){let e=Xg(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=B_(r,n);return i?.kind===`Closure`?i:void 0},mb=(e,t)=>{try{return W(e,ub(t,void 0)),!0}catch(e){if(e instanceof v)return!1;throw e}},hb=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&tf(e,t)&&mb(e.body,t),gb=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&hb(e,t),_b=(e,t)=>{let n=s_(e.name,t);return n?.body===e.body&&gb(n,t)},vb=(e,t)=>{if(e.kind!==`Identifier`||!M(e))return;let n=Xg(t,e.name);return n?.kind===`Thunk`?n:void 0},yb=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:rv(e.definitions,ub(n,t))};let r=vb(e,t);return r&&{expression:r.expression,scope:r.scope}},bb=(e,t,n,r)=>t.kind===`Apply`?$_(e,t.args,ub(r,n)):e.scope,xb=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Xg(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Sb=(e,t)=>{try{return e()}catch(e){if(e instanceof v)return t();throw e}},Cb=(e,t,n,r,i)=>{let a=fb(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return r&&a.length===0?[{...e,parameters:[],expression:r.body,scope:r.scope}]:r?a.some(e=>Zy(e,n,i)!==0)?o():Sb(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,ub(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},wb=(e,t,n,r,i)=>{let a=()=>({name:n?.name??ab,location:e.location,parameters:xb(n,t),expression:e,scope:t});if(hh.has(e.kind))throw x(new w(`${l}The next state relation is not a boolean expression.\n${zg(e)}`),S.error);switch(e.kind){case`Let`:return wb(e.body,rv(e.definitions,ub(r,t)),n,r,i);case`Label`:return wb(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>wb(e,t,n,r,i));case`Exists`:return Sb(()=>{let o=[];return y_(e.bounds,ub(r,t),t=>(o.push(...wb(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=M(e)?void 0:i.get(db(e)??``),s=pb(e,t,r);if(o)return Cb(o,e,t,s,r);if(!s)return[a()];let c=fb(e),u=M(e)?s.name:r.instanceNames.get(db(e)??``)??s.name,d=()=>[{name:u,location:e.location,parameters:[],expression:e,scope:t}];return _b(s,r)||c.some(e=>Zy(e,t,r)!==0)?d():Sb(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:W(n,ub(r,t))},parent:e}),s.scope);return wb(s.body,e,{...s,name:u},r,i)},d)},Tb=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>Tb(e,t,n,r,i,o),s=(e,t,n)=>lb(e,Ql(t,a),n),c=yb(e,t,n);if(c){o(c.expression,c.scope);return}let l=pb(e,t,n);if(l&&_b(l,n))return;let u=l?[...a,...Zl.get(l.body)??[]]:a;if(l&&l.params.length===0){if(Zy(l.body,l.scope,n)===1){r.inits.push(s(l.name,l.body,l.scope));return}o(l.body,l.scope,u);return}if(l&&e.kind===`Apply`&&l.params.length===e.args.length){o(l.body,$_(l,e.args,ub(n,t)),u);return}if(e.kind===`And`){e.operands.forEach(e=>o(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t,frames:a});return}r.temporals.push(s(ab,e,t));return}let d=Zy(e,t,n);d<=1?r.inits.push(s(ab,e,t)):d===3&&r.temporals.push(s(ab,e,t))},Eb=(e,t,n,r,i)=>{let a=(t,n)=>Eb(e,t,n,r,i),o=yb(t,n,r);if(o){a(o.expression,o.scope);return}let s=pb(t,n,r);if(s&&_b(s,r))return;if(s&&s.params.length===fb(t).length){a(s.body,bb(s,t,n,r));return}if(t.kind===`Forall`&&Sb(()=>(y_(t.bounds,ub(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(lb(e,a)):Zy(a,n,r)<2?i.invariants.push(lb(e,a)):i.impliedTemporals.push(lb(e,t));return}let c=Zy(t,n,r);c<=1?i.impliedInits.push(lb(e,t)):c===3&&i.impliedTemporals.push(lb(e,t))},Db=(e,t)=>{let n=s_(e,t);return n?.kind===`Operator`&&!gb(n,t)?n:void 0},Ob=(e,t,n)=>{let r={inits:[],actions:[],temporals:[]},i=[],a=e.specification===void 0?void 0:Db(e.specification,t);a&&(Tb(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:ab,location:e.frames[0].location,parameters:[],expression:Ql(e.expression,e.frames),scope:e.scope}]:wb(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:B_(e.init,t);o?.kind===`Closure`&&r.inits.push(lb(e.init??``,o.body));let s=e.next===void 0?void 0:B_(e.next,t);return s?.kind===`Closure`&&r.actions.push(...wb(s.body,s.scope,s,t,n)),r},kb=(e,t,n)=>{let r=[],i=(e,t)=>{if(e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`)return!1;if(e.kind===`Tuple`)return e.elements.every(e=>i(e,t));if(e.kind===`Label`)return i(e.body,t);let a=yb(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&M(e)?Xg(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!M(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=pb(e,t,n);if(!s||s.params.length!==fb(e).length)return!0;let c=s_(s.name,n);return c?.body===s.body&&hb(c,n)?!0:i(s.body,bb(s,e,t,n))};return i(e,t)?r:void 0},Ab=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>L(e[1])).join(`,`)})`,jb=(e,t,n=!1)=>`${e.name===ab?n?`Initial predicate`:`Action`:e.name}${t===`1.7.4`?``:Ab(e)} ${g(e.location.range??ob)}`,Mb=e=>`${e.name}${Ab(e)}`,Nb=(e,t,n,r)=>{let i={invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]};t.invariants.forEach(e=>{let t=Db(e,n);t&&i.invariants.push(lb(e,t.body))}),t.properties.forEach(e=>{let t=Db(e,n);t&&Eb(e,t.body,void 0,n,i)});let a=n.coverage,o=(e,t)=>qr(e.map(e=>{let n=a&&t&&as(a,t,e.expression);return cb(e,n&&di(n))})),s=e=>qr(e.flatMap(e=>{let t=Db(e,n);return t?[di([[`name`,t.name],[`location`,sb(t.location)]])]:[]}));return di([[`inits`,o(e.inits,`init`)],[`actions`,o(e.actions,`next`)],[`temporals`,o(e.temporals)],[`invariants`,o(i.invariants,`invariant`)],[`impliedinits`,o(i.impliedInits,`implied`)],[`impliedactions`,o(i.impliedActions,`implied`)],[`impliedtemporals`,o(i.impliedTemporals)],[`variables`,qr(n.variables.map((e,t)=>di([[`name`,e],[`location`,sb(r[t])],...a?[[`coverage`,di([[`distinct`,qo(a,t)]])]]:[]])))],[`actionconstraints`,s(t.actionConstraints)],[`constraints`,s(t.constraints)]])},Pb=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return Pb(e.body);case`And`:case`Or`:return e.operands.some(Pb);default:return!1}},Fb=e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0,Ib=e=>e.promises.some(e=>Pb(e.body))||e.models.some(e=>!Fb(e)),Lb=(e,t)=>e.every((e,n)=>_r(e,t[n])),Rb=e=>e.filter((t,n)=>n===0||e[n-1]!==t),zb=e=>({data:e(1024),length:0,create:e}),Bb=(e,t,n,r=0,i=n.length-r)=>{let a=t+i;if(a>e.data.length){let t=e.create(Math.max(2*e.data.length,a));t.set(e.data),e.data=t}for(let a=0;a<i;a++)e.data[t+a]=n[r+a];e.length=Math.max(e.length,a)},Vb=(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}},Hb=e=>new Int32Array(e).fill(-1),Ub=(e,t)=>(e.edgeStarts[t]??-1)!==-1,Wb=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},Gb=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,Kb=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.edgeStarts.push(-1),e.edgeCounts.push(0),e.nextSiblings.push(-1),e.nodeStates.length-1),qb=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},Jb=2**53-1,Yb=(e,t,n)=>{let r=t.map(e=>tb(e.expression,e.scope,n)),i=e.map(e=>py(`Not`,tb(e.expression,e.scope,n))),a=i.length===1?i[0]:hy(`Or`,i);return{formula:r.length===0?a:hy(`And`,[...r,a]),negations:i}},Xb=e=>{switch(e.kind){case`State`:return[e];case`Enabled`:return[{expression:e.step,scope:e.scope}];case`Action`:return[e.expression,e.subscript].flatMap(t=>t?[{expression:t,scope:e.scope}]:[])}},Zb=(e,t)=>{switch(e.kind){case`Boolean`:return;case`State`:case`Enabled`:case`Action`:t.add(e);return;case`And`:case`Or`:e.operands.forEach(e=>Zb(e,t));return;default:Zb(e.body,t)}},Qb=e=>{let t=/* @__PURE__ */ new Set;for(let n of e)[...n.stateChecks,...n.actionChecks,...n.tableau?.nodes.flatMap(e=>e.statePredicates)??[]].forEach(e=>Zb(e,t));return[...t]},$b=e=>Qb(e).flatMap(e=>Xb(e).map(e=>e.expression)),ex=(e,t,n,r)=>{if(e.length===0)return;let i=Yb(e,t,n),a=/* @__PURE__ */ new Set;Zb(i.formula,a);let o=[...a].flatMap(Xb),s=o.every(e=>e.scope===void 0)?!rf(o.map(e=>e.expression),n,`repeated`):!sv(n),c={environment:n,atoms:nb(n)},l=Wy(i.formula),u=tx(l,{atoms:{holdsState:(e,t)=>c.atoms.holdsState(e,t),holdsAction:(e,t,n)=>c.atoms.holdsAction(e,t,n)},isShared:s,isSame:Lb,evaluateFrom:(e,t)=>{n.runtime.setLivenessSource(e);try{return t()}finally{n.runtime.setLivenessSource(void 0)}}},r,n.runtime.version!==`1.7.4`),d=(e,t)=>{if(e===void 0)return t();c.atoms=nb(e);try{return t()}finally{c.atoms=nb(n)}};return{branches:u.branches,solutions:l,addInitialState:(e,t,n)=>d(n,()=>u.addInitialState(e,t)),addState:(e,t,n,r)=>d(r,()=>u.addState(e,t,n)),storeState:u.storeState,getStateCounts:u.getStateCounts,findViolation:u.findViolation,getViolatedProperties:(t,r)=>[...new Set(e.filter((e,a)=>!ib(i.negations[a].body,t,r,0,n)).map(e=>e.name))]}},tx=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map,a=1,o=t.isShared,s=t.atoms,c=t.evaluateFrom,l=/* @__PURE__ */ new Map,u=[],d=e=>{let t=l.get(e)??l.size;return l.set(e,t),u[t]=e,t},f=e=>{if(e.kind===`State`||e.kind===`Enabled`)return[d(e)*2+1];if(e.kind===`Not`){let t=e.body;return t.kind===`State`||t.kind===`Enabled`?[d(t)*2]:void 0}if(e.kind!==`And`)return;let t=e.operands.map(f);return t.every(e=>e!==void 0)?t.flat():void 0},p=e=>new Int8Array(e*l.size).fill(-1),m=e=>new Int8Array(e*i.size).fill(-1),h=(e,t,n,r,i)=>o?e(t,n,r,i):e(t,p(1),0,i),g=e=>{switch(e.kind){case`Boolean`:{let t=e.value;return()=>t}case`State`:case`Enabled`:{let t=d(e);return(n,r,i)=>(r[i+t]===-1&&(r[i+t]=+!!s.holdsState(e,n)),r[i+t]===1)}case`Action`:{let t=e.enabled&&d(e.enabled);return(n,r,i,a)=>(t===void 0||r[i+t]!==0)&&a!==void 0&&s.holdsAction(e,n,a)}case`Not`:{let t=g(e.body);return(e,n,r,i)=>!t(e,n,r,i)}case`And`:{let t=e.operands.map(g);return(e,n,r,i)=>t.every(t=>t(e,n,r,i))}case`Or`:{let t=e.operands.map(g);return(e,n,r,i)=>t.some(t=>t(e,n,r,i))}case`Next`:{let t=g(e.body);return(e,n,r,i)=>t(i??e,p(1),0,void 0)}case`Always`:case`Eventually`:return()=>{throw new w(`TLC cannot evaluate a temporal formula in a single step`)}}},_=e.map(e=>({solution:e,checks:{states:e.stateChecks.map(g),actions:e.actionChecks.map(g),nodes:e.tableau?.nodes.map(e=>{let t=o?f({kind:`And`,operands:e.statePredicates}):void 0;return t?Int32Array.from(t):e.statePredicates.map(g)})??[]},actionIds:Int32Array.from(e.actionChecks,e=>{let t=by(e),n=i.get(t)??i.size;return i.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:zb(e=>new Int32Array(e)),edgeActions:zb(e=>new Uint8Array(e)),stateResults:zb(e=>new Uint8Array(e)),initial:[],firstNodes:zb(Hb),lastNodes:zb(Hb),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],stateCount:0,errorNode:void 0})),v=(e,t,n,r,i)=>c(t,()=>{let t=e.checks.states,a=new Uint8Array(t.length);return t.forEach((e,t)=>{a[t]=+!!h(e,n,r,i)}),a}),y=(e,t,n,r,i,a,s,l,u,d)=>c(t,()=>{let t=e.checks.actions;for(let c=0;c<t.length;c++){if(!o){u[d+c]=+!!h(t[c],n,r,i,a);continue}let f=l+e.actionIds[c];s[f]===-1&&(s[f]=+!!t[c](n,r,i,a)),u[d+c]=s[f]}}),ee=(e,t,n,r,i)=>{let a=e.checks.nodes[t];if(!(a instanceof Int32Array))return a.every(e=>h(e,n,r,i));for(let e=0;e<a.length;e++){let t=a[e],o=i+(t>>1);if(r[o]===-1&&(r[o]=+!!s.holdsState(u[t>>1],n)),r[o]!==(t&1))return!1}return!0},b=(e,t,n,r,i,a)=>c(n,()=>ee(e,t,r,i,a)),x=(e,t)=>{if(!r)return!1;let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},te=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=Vb(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},S=(e,t,n,r)=>{let 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),Vb(i,e[t]-1,e[t+1]))}if(i.slots.set([t+1,n,r],Vb(i,t,n)),t<0)return r;let a=e.lastNodes.data[t]??-1;return a===-1?Bb(e.firstNodes,t,[r]):e.nextSiblings[a]=r,Bb(e.lastNodes,t,[r]),r},ne=(e,t)=>t<0?e.checks.nodes.some((n,r)=>te(e,t,r)!==void 0):e.isDone[t]===!0||(e.firstNodes.data[t]??-1)!==-1,C=(e,t,n)=>(ne(e,t)||e.stateCount++,S(e,t,n,Kb(e,t,n))),re=(e,t,n,r,i,a)=>{let o=e.edgeTargets.length,s=e.solution.actionChecks.length;Bb(e.edgeTargets,o,n),i.forEach((t,n)=>Bb(e.edgeActions,(o+n)*s,r,t*s,s)),Bb(e.stateResults,e.nodeStates[t]*a.length,a),e.edgeStarts[t]=o,e.edgeCounts[t]=n.length},T={slots:/* @__PURE__ */ new Int32Array},ie=(e,r,i)=>{let o=[...i,{index:e,state:r}],s=16*a;T.slots=T.slots.length===s?T.slots.fill(0):new Int32Array(s);let c=e=>{let r=T.slots,i=o[e];for(let a=(n.getFingerprint(i)&2147483647)%r.length;;a=(a+1)%r.length){let n=r[a];if(n===0)return r[a]=e+1,!0;let s=o[n-1];if(s.index===i.index&&t.isSame(s.state,i.state))return!1}},l=0;for(let e=0;e<o.length;e++){if(l>=T.slots.length>>1){let e=T.slots;T.slots=new Int32Array(2*e.length+1);for(let t of e)t!==0&&c(t-1)}c(e)&&l++}T.slots.length>s&&a++;let u=[];for(let e of T.slots)e!==0&&u.push(o[e-1]);return u},ae=(e,t,r,a,o,s,c)=>{let l=v(e,a,r,s,c),u=t.nodes[e.nodeTableaux[o]],d=e.checks.actions.length,f=[],h=[],g=new Uint8Array(d);u.successors.length>0&&y(e,a,r,s,c,r,m(1),0,g,0);for(let n of u.successors){if(!b(e,n,a,r,s,c))continue;if(x(t,n)&&e.errorNode===void 0&&e.solution.models.some(Fb)){e.errorNode=o;return}let i=te(e,a,n);if(i!==void 0&&h.includes(i))continue;let l=i??C(e,a,n);h.push(l),f.push(0),i===void 0&&ae(e,t,r,a,l,s,c)}let _=n.getSuccessors(a,r),ee=new Uint8Array((_.length+1)*d);ee.set(g);let S=m(_.length);_.forEach((n,o)=>{let l=p(1);y(e,a,r,s,c,n.state,S,o*i.size,ee,(o+1)*d);let m=e.isDone[n.index]===!0;for(let r of u.successors){if(!b(e,r,a,n.state,l,0))continue;let i=te(e,n.index,r);if(i!==void 0&&h.includes(i))continue;let s=i??C(e,n.index,r);h.push(s),f.push(o+1),i===void 0&&m&&ae(e,t,n.state,n.index,s,l,0)}}),h.length>0&&re(e,o,h,ee,f,l)},oe=(e,t,n,r,i,a,o)=>{let s=l.size,u=new Uint8Array(t.nodes.length*n.length);c(o,()=>{for(let i=0;i<t.nodes.length;i++)for(let t=0;t<n.length;t++)ee(e,i,n[t].state,r,t*s)&&(u[i*n.length+t]=1)}),ne(e,o)||e.stateCount++,e.isDone[o]=!0;for(let c of qb(e,o)){let o=[],l=[];n.forEach((i,a)=>{let d=e.isDone[i.index]===!0;for(let f of t.nodes[e.nodeTableaux[c]].successors){if(u[f*n.length+a]===0)continue;let c=te(e,i.index,f);if(c!==void 0&&o.includes(c))continue;let p=c??C(e,i.index,f);o.push(p),l.push(a),c===void 0&&d&&ae(e,t,i.state,i.index,p,r,a*s)}}),re(e,c,o,i,l,a)}return e.errorNode===void 0?void 0:le(e,e.errorNode)},se=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)Kb(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,n)=>{Ub(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n))}),Ub(e,i)||e.stateCount++,re(e,i,a,n,o,r)},ce=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)Ub(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 Wb(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}Ub(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new w(`Couldn't re-create liveness trace (path) starting at: ${t}`)},le=(e,t)=>Rb(ce(e,t).reverse().map(t=>e.nodeStates[t])),E=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.edgeActions.data[(e.edgeStarts[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=>Ub(e,t)),c=[],l=t=>{let n=Wb(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&Vy(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=Jb;return}let d=/* @__PURE__ */ new Set,p=/* @__PURE__ */ new Map;for(let t=s;;t=c.pop()??r){d.add(t);let n=p.get(e.nodeStates[t]);if(n?n.push(t):p.set(e.nodeStates[t],[t]),o[t]=Jb,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>Gb(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>Wb(e,n).some((e,r)=>d.has(e)&&a(n,r)&&i(n,r,t)))),g=n.promises.every(e=>[...d].some(t=>u(t,e)));if(m&&h&&g)return f(r,d,p)},f=(r,o,s)=>{let c=le(e,r),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g=f.length+m.length+h.length,_=r,v=e=>{l.push(_),_=e};for(;g>0;){let r=g;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&Gb(e,_,t)&&(f[n]=!0,g--)}),n.promises.forEach((e,t)=>{!h[t]&&u(_,e)&&(h[t]=!0,g--)}),!(g<=0);){let n=-1,c=-1,u=g;if(Wb(e,_).some((r,l)=>{if(s.has(e.nodeStates[r])){if(!o.has(r)||!a(_,l))return!1;n=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(_,l,e)&&(m[t]=!0,g--)})}return g<u?(v(r),d.clear(),!0):(o.has(r)&&!d.has(r)&&(c=r),!1)}))break;if(g<r){v(n),d.clear();break}for(;c===-1;){let t=l.pop();if(t===void 0)throw new w(`TLC failed to build the counterexample of a liveness property`);_=t,c=Wb(e,t).find(e=>o.has(e)&&!d.has(e))??-1}v(c),d.add(c)}}let y=p(r,_,s);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];y[y.length-1]!==n&&y.push(n)}let ee=c[c.length-1];return y[y.length-1]===ee&&y.pop(),{prefix:c.slice(0,-1),cycle:[ee,...y.reverse()],isCycleConstrained:Ib(n)}},p=(t,n,r)=>{if(n===t)return[];let i=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([i]),c=[];for(let n=i,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of Wb(e,u).entries()){if(f===u||!a(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==i;)e.push(t),t=r,r=o.get(t)??-1;return e.push(i),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 w(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<s.length;t++){let n=[s[t],-1,0],r=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=d(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,n.push(t,l,-42),c.push(l);let u=r++;Wb(e,l).forEach((t,r)=>{Ub(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u=Math.min(u,o[t]):o[t]===-1&&s.push(t))}),n.push(u)}}};return{branches:_.length,addInitialState:(e,t)=>{let n=p(1);for(let r of _){let i=r.solution.tableau;if(!i)r.initial.push(e);else for(let a=0;a<i.initialCount;a++)b(r,a,void 0,t,n,0)&&r.initial.push(te(r,e,a)??C(r,e,a))}},addState:(e,t,n)=>{let r=ie(e,t,n),a=p(r.length),o=r.findIndex(t=>t.index===e)*l.size,s=m(r.length);for(let n of _){let c=n.checks.actions.length,l=new Uint8Array(r.length*c);r.forEach((r,u)=>y(n,e,t,a,o,r.state,s,u*i.size,l,u*c));let u=v(n,e,t,a,o),d=n.solution.tableau;if(!d){se(n,r,l,u,e);continue}let f=oe(n,d,r,a,l,u,e);if(f)return f}},storeState:(e,t)=>{for(let n of _){let r=n.solution.tableau;if(!r)continue;let i=[];for(let t=0;t<r.nodes.length;t++){let r=te(n,e,t);r!==void 0&&i.push(r)}for(let e of i.sort((e,t)=>e-t))n.nodeStates[e]=t,S(n,t,n.nodeTableaux[e],e)}},getStateCounts:()=>_.map(e=>e.stateCount),findViolation:()=>{for(let e of _)for(let t of e.solution.models){let n=E(e,t);if(n)return n}}}},nx=e=>{switch(e.kind){case`Number`:if(!hn(e.value))throw x(new t(`TLC can't handle a number this big.\n${e.value}`),S.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return er(e.name);case`Set`:return F({kind:`MixedSet`,elements:e.elements.map(nx)})}},rx=e=>{try{return nx(e)}catch(e){throw!(e instanceof w)||e instanceof t||e instanceof f?e:x(new w(`${l}${e.message}`),S.error)}},ix=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>L(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new w(`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`)&&hr(t,r)})});if(t)return t[1];throw new w(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:L(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},ax=e=>new C(`In the configuration file, the identifier ${e} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`),ox=(e,t)=>{let n=e=>t.root.visible.get(e)?.key??e,r=t.root.constants.map(e=>e.name),i=t.root.variables,a=e=>{let n=t.moduleSymbols.get(e.module??``)?.get(e.name);return n?.kind===`Definition`?n:void 0},o=e=>{if(e.module===void 0)return[e.name,n(e.name)];let t=a(e);return t?[t.key]:[]},s=e=>e.module===t.root.module.name?[]:o(e),c=e=>{let n=t.definitions.get(e);return n?.kind===`Operator`?n.params.length:t.root.constants.find(t=>t.name===e)?.arity??t.builtins.get(e)?.arity??0},l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Set,d=(e,n)=>{t.builtins.set(e,n),t.definitions.delete(e),l.delete(e),u.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=rx(e.value);Hr(t),s(e).forEach(e=>{let n=c(e);n===0?l.set(e,t):d(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let f=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=f.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new C(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(nx),nx(e.value)]),f.set(t,n)}),f.forEach(e=>s(e).forEach(t=>d(t,ix(e.name,c(t),e.rows))));let p=new Map(e.substitutions.flatMap(e=>o(e).map(t=>[t,n(e.target)])));[...p.keys()].forEach(e=>l.delete(e));let m=(e,a,o)=>{let s=n(a),c=t.definitions.get(s);if(!(c!==void 0||t.builtins.has(s)||l.has(s)||r.includes(a)||i.includes(a)))throw new C(`The configuration file substitutes for ${e} with the undefined identifier ${a}.`);if(c?.kind===`Operator`&&c.params.length!==o)throw new C(`The configuration file substitutes for ${e} with ${a} of different number of arguments.`)};e.substitutions.filter(e=>e.module===void 0).forEach(n=>{let i=n.name,a=n.target;if(!r.includes(i)&&!t.root.visible.has(i))throw new C(`In the configuration file, the identifier ${i} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===a))throw ax(a);m(i,a,t.root.constants.find(e=>e.name===i)?.arity??t.root.visible.get(i)?.arity)});let h=e.substitutions.filter(e=>e.module!==void 0);[...t.moduleSymbols.keys()].forEach(e=>{let t=h.filter(t=>t.module===e);t.forEach(e=>{let n=a(e);if(n){if(t.some(t=>t.name===e.target))throw ax(e.target);m(e.name,e.target,n.arity)}});let n=t.find(e=>!a(e));if(n)throw new C(`In the configuration file, the identifier ${n.name} does not appear in the specification.`)});let g=h.find(e=>!t.moduleSymbols.has(e.module??``));if(g)throw new C(`In the configuration file, the module name ${g.module} is not a module in the specification.`);let _=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(s)),v=(e,n)=>{if(_.has(e))return{key:e,prefix:n};let r=t.copySources.get(e);return r&&v(r.source,n+r.prefix)};t.copySources.forEach((e,n)=>{let r=v(e.source,e.prefix),i=t.definitions.get(n);if(!r||!i)return;let a=i.kind===`Operator`?i.params:[],o=Tu(n,r.key,a,a.slice(r.prefix),i.location);t.definitions.set(n,o),t.root.visible.forEach((e,r)=>{e.key===n&&r!==n&&t.definitions.set(r,o)})}),t.operatorConstants.forEach((e,t)=>l.set(t,e));let y=r.filter(e=>!l.has(e)&&!p.has(e)&&!u.has(e));if(y.length>0){let e=t.order.getDeclarationOrder(`constant`).find(e=>y.includes(e))??y[0];throw new C(`The constant parameter ${e} is not assigned a value by the configuration file.`)}return{constants:l,substitutions:p}},sx=`tlc2/value/impl/`,cx={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},lx={iconstM1:2,iconst0:3,iconst5:8,bipush:16,sipush:17,ldc:18,ldcW:19,dup:89,areturn:176,getstatic:178,invokespecial:183,invokestatic:184,new:187},ux=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n=0,r=e=>{let t=n;return n+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n)}},dx=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),fx=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],px=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??dx.get(e[3])}${`[]`.repeat(e[1].length)}`),mx=(e,t)=>e[e[t].first].text,hx=(e,t)=>mx(e,t).replaceAll(`/`,`.`),gx=e=>{let t=ux(e);if(t.readUint32()!==3405691582)throw new s(`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===cx.utf8?a.text=i.decode(t.readBytes(t.readUint16())):r===cx.integer?a.value=t.readInt32():r===cx.float?t.readUint32():r===cx.long||r===cx.double?(t.readBytes(8),e++):r===cx.class||r===cx.string||r===cx.methodType||r===cx.module||r===cx.package?a.first=t.readUint16():r===cx.methodHandle?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16();let a=hx(n,t.readUint16());t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let o=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,s=i.indexOf(`)`),c=px(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:ux(t.readBytes(t.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>hx(n,d.readUint16())):[],p=fx.filter(t=>(e&t[0])!==0).map(e=>e[1]),m=px(i.slice(s+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;o.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${a}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:o}},_x=(e,t)=>{let n=e[t],r=e[n.second];return{className:mx(e,n.first),name:e[r.first].text}},vx=(e,t,n,r)=>{let i=()=>new p(`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===cx.integer)return n.value;if(n.tag===cx.string)return t[n.first].text;throw i()};for(let e=0;e<a.length;){let n=a[e],l=()=>a[e+1]<<8|a[e+2];if(n>=lx.iconstM1&&n<=lx.iconst5)o.push(n-lx.iconst0),e+=1;else if(n===lx.bipush)o.push(a[e+1]<<24>>24),e+=2;else if(n===lx.sipush)o.push(l()<<16>>16),e+=3;else if(n===lx.ldc)o.push(c(a[e+1])),e+=2;else if(n===lx.ldcW)o.push(c(l())),e+=3;else if(n===lx.dup){let t=s();o.push(t,t),e+=1}else if(n===lx.getstatic){let n=_x(t,l());if(n.className!==`${sx}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===lx.invokestatic){let n=_x(t,l()),a=s();if(n.className!==`${sx}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===lx.new)o.push({className:mx(t,l()),value:void 0}),e+=3;else if(n===lx.invokespecial){let n=_x(t,l()),a=s(),o=s();if(!(n.className===`${sx}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===lx.areturn){let e=s();if(typeof e!=`object`)throw i();if(`className`in e){if(!e.value)throw i();return e.value}return e}else throw i()}throw i()},yx=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=gx(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:vx(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},bx=A(`EOF`),xx=A(`IDENTIFIER`),Sx=A(`DEFBREAK`),Cx=(e,t)=>Array.from({length:A(t)-A(e)+1},(t,n)=>A(e)+n),wx=new Set(Cx(`op_57`,`op_119`)),Tx=new Set(Cx(`op_1`,`op_119`)),Ex=new Set(Cx(`op_57`,`op_70`)),Dx=/* @__PURE__ */ new Set([...Cx(`ACTION`,`EXCEPT`),A(`EXTENDS`),...Cx(`IF`,`SF`),A(`STATE`),...Cx(`THEN`,`WITH`),A(`US`),...Cx(`op_112`,`op_116`)]),Ox=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),kx=new Map([...Ox(`postfix`,160,160,!0,`[`),...Ox(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...Ox(`prefix`,120,120,!1,`-.`),...Ox(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...Ox(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...Ox(`prefix`,40,40,!0,`\\lnot`),...Ox(`nfix`,100,130,!0,`\\times`),...Ox(`infix`,140,140,!1,`^`,`^^`),...Ox(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...Ox(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...Ox(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...Ox(`infix`,100,110,!0,`|`,`||`,`%%`),...Ox(`infix`,100,110,!1,`%`),...Ox(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...Ox(`infix`,90,140,!1,`\\wr`),...Ox(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...Ox(`infix`,90,130,!1,`!!`),...Ox(`infix`,90,90,!1,`...`,`..`),...Ox(`infix`,80,80,!0,`\\intersect`,`\\union`),...Ox(`infix`,80,80,!1,`\\`),...Ox(`infix`,70,70,!1,`<:`,`:>`),...Ox(`infix`,60,60,!0,`@@`),...Ox(`infix`,50,140,!0,`\\cdot`),...Ox(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...Ox(`infix`,30,30,!0,`\\land`,`\\lor`),...Ox(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...Ox(`infix`,10,10,!1,`=>`)]),Ax=new Map([...kx,...nc.flatMap(e=>e.slice(1).map(t=>[t,kx.get(e[0])]))]),jx=Ax.get(`[`),Mx={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},Nx=e=>({type:`tokens`,kinds:new Set(e)}),Px=e=>typeof e==`string`?e.startsWith(`<`)?Nx([A(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(Px)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),Fx=e=>(...t)=>({type:e,body:G(...t)}),q=Fx(`zeroOrMore`),Ix=Fx(`oneOrMore`),J=Fx(`optional`),Y=e=>({type:`action`,run:t=>e(t)??void 0}),X=e=>Y(t=>{t.expecting=e}),Z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&G(...e.expansion),semantic:e.semantic}),Lx=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Rx=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=Lx(e,n);return n},zx=(...e)=>{let t=e.map(A);return e=>t.includes(Rx(e,1).kind)},Bx=(e,t=Rx(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Vx=e=>{let t=Rx(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Hx=e=>zx(`CASESEP`)(e)&&Bx(e),Ux=e=>{let t=Rx(e,1);Dx.has(t.kind)&&(t.kind=xx)},Wx=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,Gx=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),Kx=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},qx=e=>e.operatorStacks[e.operatorStacks.length-1],Jx=(e,t)=>e.low>t.high,Yx=(e,t)=>e.high<t.low,Xx=e=>e.fix===`prefix`?e:Ax.get(`${e.name}.`),Zx=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===jx?Gx(`FcnAppl`,[n,...r.node.heirs]):Gx(`PostfixExpr`,[n,r.node]),operator:void 0})},Qx=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Gx(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:Gx(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},$x=e=>{let t=qx(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return Zx(t,n),$x(e);if(i.operator!==void 0){let t=Xx(r.operator);return t!==void 0&&Jx(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Wx(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${Wx(e,a.node.first,a.node.last)} and expression at location ${Wx(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Yx(a.operator,r.operator)?void 0:Jx(a.operator,r.operator)?(Qx(t,a.operator),$x(e)):`Precedence conflict between ops ${a.operator.name} in block ${Wx(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Xx(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Yx(s,r.operator))return;if(!Jx(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Wx(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Qx(t,s),$x(e);let c=Wx(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===Mx?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},eS=e=>Y(t=>{let n=qx(t),r=Kx(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:$x(t)}),tS=eS(()=>!1),nS=eS(()=>!0),rS=Y(e=>{e.lastOperator=Ax.get(e.token.image)}),iS=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},aS=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?iS(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},oS=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Bx(e,n.first.beginColumn))return n;let t=oS(e,n);if(t!==void 0)return t}},sS=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(A),n=(e,...t)=>t.some(t=>e.kind===A(t)),r=e=>e!==void 0&&wx.has(e.kind),i=e.token,a=Lx(e,i);i.next=void 0;let o=Lx(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===xx&&(e=e.next)}else if(e.kind===xx){let t=e.next;!r(t)||Ex.has(t.kind)||Tx.has(t.kind)&&t.next?.kind!==xx||(e=t.next?.kind===A(`SUBSTITUTE`)?i:Tx.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Sx&&(e.next={kind:Sx,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=Lx(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},cS=e=>{let t=Rx(e,1);if(t.kind===A(`LAB`)){let n=1;for(;n!==0;)if(t=Lx(e,t),t.kind===A(`LAB`)&&n++,t.kind===A(`RAB`)&&n--,t.kind===bx)return!1;return Lx(e,t).kind===A(`IN`)}if(t.kind!==xx)return!1;for(t=Lx(e,t);t.kind===A(`COMMA`);){if(t=Lx(e,t),t.kind!==xx)return!1;t=Lx(e,t)}return t.kind===A(`IN`)},lS=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),uS=e=>e.proofLevels.at(-1)??-1,dS=e=>{let t=Rx(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:zx(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||uS(e)>=0&&lS(t)>uS(e):zx(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},fS=(e,t)=>{let n=lS(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},pS=e=>Y(t=>fS(t,t.token)?void 0:`${Wx(t,t.token)}: ${e}`),mS=Nx([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(A)),hS=Nx([...mS.kinds,A(`op_76`)]),gS=Nx(Tx),_S=Nx(Ex),vS=Nx([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(A)),yS=()=>q(Z({expansion:[K(mS,`<op_77>`)],semantic:Bx}),K(`PrefixOp`,`InfixOp`),nS),bS=()=>K(G(Z({expansion:[`OpenStart`],semantic:Bx}),`OpenExpression`,tS),G(Z({semantic:Bx}),`ExtendableExpr`)),xS=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),SS=()=>K(G(Z({semantic:e=>zx(`ASSUME`,`BOXASSUME`)(e)||Rx(e,2).kind===A(`COLONCOLON`)&&[A(`ASSUME`),A(`BOXASSUME`)].includes(Rx(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),CS=()=>[`JuncItem`,q(Z({semantic:Vx}),`JuncItem`)],wS=e=>Y(t=>{t.expecting=e,Ux(t)}),TS=e=>Y(t=>{t.isTerminalProof=e}),ES=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{sS(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),DS={CompilationUnit:Q(void 0,[Y(sS),J(`Prelude`),`Module`]),Prelude:Q(void 0,[`<BEGIN_PRAGMA>`,q(K(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Q(`Module definition`,[X(`---- MODULE`),`BeginModule`,X(`EXTENDS clause or module body`),`Extends`,X(`Module body`),`Body`,X(`==== or more Module body`),`EndModule`]),BeginModule:Q(`Begin module`,[X(`---- MODULE (beginning of module)`),K(`<_BM0>`,`<_BM1>`,`<_BM2>`),wS(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,wS(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,wS(`Identifier`),`Identifier`))]),Body:Q(`Module body`,[X(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),q(K(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,G(Z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,G(Z({amount:2}),`Instance`),G(Z({amount:2}),`Assumption`),G(Z({amount:2}),`Theorem`),G(Z({amount:1}),`Module`,Y(sS)),G(Z({semantic:e=>zx(`USE`)(e)&&Rx(e,2).kind!==A(`ONLY`)||zx(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Q(`variable declaration`,[`<VARIABLE>`,X(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,X(`Identifier`),`Identifier`)]),ParamDeclaration:Q(`Parameter declaration`,[X(`CONSTANT`),`ParamSubDecl`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Q(`Recursive`,[X(`RECURSIVE`),`<RECURSIVE>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X("`,' or `)'"))]),ConstantDeclarationItems:Q(`Constant declaration items`,[X(`Identifier, _ or prefix op`),K(G(`Identifier`,X(`(, comma, or Module Body`),J(Z({amount:2}),`<LBR>`,X(`_`),`<US>`,X(`comma or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`comma or )`)),`<RBR>`)),G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`prefix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Q(`Definition`,[X(`LOCAL, Identifier or Operator Symbol`),J(`<LOCAL>`),`<DEFBREAK>`,X(`LOCAL, Identifier or Operator Symbol`),K(ES(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),ES(`Expression`,Z({expansion:[`<IDENTIFIER>`,_S]}),`PostfixLHS`,`Expression`),ES(`Expression`,Z({expansion:[`<IDENTIFIER>`,gS]}),`InfixLHS`,`Expression`),ES(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),ES(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Q(`Identifier tuple`,[`<LAB>`,X(`Identifier or >>`),J(`Identifier`,X(`COMMA or >>`),q(`<COMMA>`,X(`COMMA or >>`),`Identifier`,X(`COMMA or >>`))),`<RAB>`]),IdentLHS:Q(`Identifier LHS`,[`Identifier`,X(`( or ==`),J(`<LBR>`,X(`Identifier Declaration, prefix op, _ or )`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`),q(`<COMMA>`,X(`Identifier Declaration, prefix op or _`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Q(`Prefix LHS`,[hS,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,gS,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,_S]),IdentDecl:Q(`Identifier Declation`,[`Identifier`,X(`( or ...`),J(`<LBR>`,X(`_`),`<US>`,X(`COMMA or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Q(`Op. Symbol Declaration`,[K(G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`infix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),Instance:Q(`Instance`,[X(`LOCAL or instance`),J(`<LOCAL>`),`Instantiation`,X(`COMMA or Module Body`)]),Instantiation:Q(`NonLocalInstance`,[`<INSTANCE>`,wS(`Module identifier`),`Identifier`,X(`WITH or another definition.`),J(`<WITH>`,X(``),`Substitution`,X(``),q(Z({amount:3}),`<COMMA>`,X(``),`Substitution`,X(``)))]),Substitution:Q(`Substitution`,[K(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),X(`<-`),`<SUBSTITUTE>`,X(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Q(void 0,[mS,rS]),NonExpPrefixOp:Q(void 0,[hS,rS]),InfixOp:Q(`Infix Op`,[gS,rS]),PostfixOp:Q(void 0,[_S,rS]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{sS(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),SS(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),SS(),X("PROVE or `,'")),K(`<PROVE>`,`<BOXPROVE>`),X(`Expression`),`Expression`))]),NewSymb:Q(`NEW symbol declaration`,[X(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),K(G(Z({amount:2}),K(G(Z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),X(`Constant declaration`),K(G(Z({amount:2}),`IdentDecl`,J(`<IN>`,Y(e=>{let t=Kx(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Wx(e,t.first,t.last)}`:void 0}),X(`Expression`),`Expression`)),`SomeFixDecl`)),G(Z({amount:2}),J(`<NEW>`),`<VARIABLE>`,X(`Identifier`),`Identifier`),G(Z({amount:2}),J(`<NEW>`),K(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),X(`Declaration`),K(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Q(`Domain binding`,[J(`<IN>`,X(`Expression`),`Expression`)]),Theorem:Q(`Theorem`,[X(`THEOREM, PROPOSITION`),K(`<THEOREM>`,`<PROPOSITION>`),X(`Identifier, Assume-Prove or Expression`),J(Z({amount:2}),`Identifier`,X(`==`),`<DEF>`),Y(sS),K(G(Z({amount:3}),Z({semantic:zx(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:dS}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>zx(`BY`)(e)||Rx(e,2).kind===A(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>Rx(e,2).kind!==A(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,TS(!0),J(`<ONLY>`)),G(`<USE>`,TS(!1),J(`<ONLY>`)),G(`<HIDE>`,TS(!1))),X("an expression, `MODULE' or `DEF'"),J(xS(),q(`<COMMA>`,X(`MODULE or expression`),xS(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),xS(),q(`<COMMA>`,X(`MODULE or expression`),xS(),Y(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),Y(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Q(`QED step`,[X(`Step number`),vS,pS(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:dS}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),vS,pS(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:zx(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:zx(`INSTANCE`)}),`Instantiation`),G(Z({semantic:zx(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:dS}),Y(e=>{let t=Kx(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Wx(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),Ix(Z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Q(`HaveStep`,[`<HAVE>`,X(`expression`),`Expression`]),TakeStep:Q(`TakeStep`,[`<TAKE>`,X(`identifier`),K(G(Z({expansion:[K(G(`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,X(`comma or step`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or proof step`))),G(`Identifier`,X(`comma or proof step`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or proof step`))))]),WitnessStep:Q(`WitnessStep`,[`<WITNESS>`,X(`expression`),`Expression`,q(`<COMMA>`,X(`expression`),`Expression`,X(`comma or colon`))]),PickStep:Q(`PickStep`,[`<PICK>`,X(`identifier`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,X(`comma, or colon`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or colon`))),G(`QuantBound`,X(`comma or colon`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or colon`)))),`<COLON>`,X(`expression`),`Expression`]),CaseStep:Q(`CaseStep`,[`<CASE>`,X(`expression`),`Expression`]),AssertStep:Q(`AssertStep`,[J(`<SUFFICES>`,X(`expression or ASSUME/PROVE`)),K(`Expression`,G(Z({semantic:zx(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Q(void 0,[K(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Q(void 0,[K(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Q(`String`,[`<STRING_LITERAL>`]),Number:Q(void 0,[`<NUMBER_LITERAL>`,J(Z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,q(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Q(void 0,[K(G(Z({amount:2,expansion:[K(hS,gS,_S),Nx([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(A))],semantic:Bx}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Wx(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:Bx}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Q(`Quantified form`,[K(`<EXISTS>`,`<FORALL>`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,q(`<COMMA>`,`Identifier`)),G(`QuantBound`,q(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Q(`Bound Quantified Expression`,[K(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,q(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Q(`Quant Bound`,[K(`IdentifierTuple`,G(`Identifier`,q(`<COMMA>`,`Identifier`,X(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Q(`Some { } form`,[`<LBC>`,J(K(G(Z({semantic:cS}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),Ix(`<COMMA>`,`Expression`)))),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,q(`<COMMA>`,`Expression`)),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,q(`<COMMA>`,`QuantBound`)),G(`Expression`,J(K(G(`<COLON>`,Y(e=>{let t=Kx(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,q(`<COMMA>`,`QuantBound`)),Ix(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:cS}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>Rx(e,2).kind===A(`MAPTO`)&&Dx.has(Rx(e,1).kind)}),Y(e=>{Rx(e,1).kind=xx}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,q(`<COMMA>`,`FieldSet`),`<RSB>`),G(`Expression`,K(G(q(`<COMMA>`,`Expression`),`<RSB>`,Y(e=>{let t=e.frames[e.frames.length-1];t.node=Gx(`FcnAppl`,t.heirs),e.lastOperator=jx})),G(`<ARROW>`,`Expression`,`<RSB>`),G(`<EXCEPT>`,`ExceptSpec`,q(`<COMMA>`,`ExceptSpec`),`<RSB>`),G(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Q(`Except Spec`,[`<BANG>`,Ix(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(Ux),`Identifier`,Y(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===A(`RBR`)}))]),ReducedExpression:Q(`restricted form of expression`,[K(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Q(`Fairness Expression`,[Y(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),K(`<WF>`,`<SF>`),`ReducedExpression`,J(Z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,Y(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Q(`CASE Expression`,[`<CASE>`,`CaseArm`,q(Z({semantic:e=>Hx(e)&&Rx(e,2).kind!==A(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:Hx}),`<CASESEP>`,`OtherArm`)]),CaseArm:Q(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Q(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Q(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Q(`Let Definitions`,[Ix(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=Rx(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...CS()),G(Z({expansion:[`<AND>`]}),...CS())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=oS(t,e.heirs[1]);return n&&`Item at ${Wx(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Wx(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Q(`(Un)Bounded Choose`,[`<CHOOSE>`,K(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Q(`Lambda`,[`<LAMBDA>`,X(`Identifier`),`Identifier`,X("`,' or `:'"),q(`<COMMA>`,X(`Identifier`),`Identifier`,X("`,' or `:'")),`<COLON>`,X(`Expression`),`Expression`]),Expression:Q(`Expression`,[Y(e=>{e.operatorStacks.push([])}),yS(),bS()],(e,t)=>{let n=qx(t);n.push({node:e.heirs[0],operator:Mx});let r=$x(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Q(`ExtendableExpr`,[K(G(Z({expansion:[K(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),tS,q(K(G(Z({expansion:[`PostfixOp`],semantic:Bx}),`PostfixOp`,nS),G(Z({expansion:[`<DOT>`],semantic:Bx}),`<DOT>`,Y(Ux),Z({semantic:Bx}),`Identifier`,Y(e=>{let t=qx(e);t[t.length-1].operator!==void 0&&Zx(t,t.length),t[t.length-1]={node:Gx(`RecordComponent`,[t[t.length-1].node,Kx(e,2),Kx(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:Bx}),X(`function argument`),`SBracketCases`,eS(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:Bx}),`InfixOp`,nS,yS(),bS()),G(Z({expansion:[`<COLONCOLON>`],semantic:Bx}),`<COLONCOLON>`,Y(e=>{let t=qx(e);if(!aS(t[t.length-1].node))return`\`::' at ${Wx(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=qx(e),n=Kx(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Yx(r,e.lastOperator)){let t=Kx(e,3);return`Removing label at ${Wx(e,t.first,t.last)} would change expression parsing.`}t.push({node:Gx(`Label`,[Kx(e,3),Kx(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:Bx}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:Bx}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>uS(e)<0&&e.proofLevels.length<=1?`${Wx(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Wx(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,G(Z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),J(Z({amount:2}),`OpArgs`),q(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:iS(e.heirs)===void 0?e.heirs.length===1?Gx(`GeneralId`,e.heirs):void 0:Gx(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>Rx(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),J(Z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Q(`StructOp`,[X("`<<' , `>>' , `:' , `@' , or number"),K(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,G(Z({semantic:e=>Rx(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Wx(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},OS=/* @__PURE__ */ new Map,kS=e=>{let t=OS.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=kS(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,kS(DS[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return OS.set(e,n),n},AS=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},jS=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=Lx(e,e.scanPosition)),e.scanPosition=Lx(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},MS=(e,t)=>{if(t.type===`tokens`)return jS(e,t.kinds);if(t.type===`call`)return MS(e,DS[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||AS(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=MS(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||AS(e,t.semantic)?MS(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=MS(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=MS(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},NS=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=MS(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},PS=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||kS(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!kS(a).hasSemanticStart?kS(a).first.has(Rx(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):NS(e,i,a)&&(o===void 0||o(e))}),FS=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,MS(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=Lx(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===bx){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=Lx(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${$e(e.token.image)}" `},IS=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??FS(e)}\n\nResidual stack trace follows:\n${r}`,!1},LS=(e,t)=>{let n=Lx(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,IS(e))},RS=(e,t)=>{let n=DS[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Rx(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!zS(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return IS(e,i);let a=r.node??(r.heirs.length===0?void 0:Gx(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},zS=(e,t)=>{if(t.type===`tokens`)return LS(e,t.kinds);if(t.type===`call`)return RS(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||IS(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||IS(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||zS(e,t));if(t.type===`choice`){let n=PS(e,t.alternatives);return n===-1?IS(e):zS(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!zS(e,t.body))return!1;if(t.type===`optional`)return PS(e,[t.body])===-1||zS(e,t.body);for(;PS(e,[t.body])===0;)if(!zS(e,t.body))return!1;return!0},BS=e=>{let t=Ze(e),n={kind:bx,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],pushedErrors:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=zS(r,{type:`call`,name:`CompilationUnit`});if(r.lexicalError!==void 0)return r.lexicalError;let a=[...r.pushedErrors,...i||r.report===void 0?[]:[`***Parse Error***\n${r.report}`]];return a.length===0?void 0:a.join(`
|
|
1784
|
-
`)},
|
|
1785
|
-
`,set:``},
|
|
1781
|
+
`]]),mm=(e=`master`)=>e===`1.7.4`?pm:fm,hm=(e,t)=>e.every(e=>Ji(e,t)),gm=Yr([!1,!0]);Wr(gm);const _m=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return ei(_m(e,t,r),_m(e,r,n))},vm=[`\\cup`,`\\cap`,`\\`],ym=e=>typeof e==`object`&&e.kind===`MixedSet`,bm=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,xm=(e,t,n)=>{t.kind===`Interval`&&Ri(t);let r=t.kind===`Interval`?t:Ur(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return un(r,e=>{Ji(e,n)===i&&cn(a,e)}),bm(t)?ar(a):Xr(a)}if(Fi(t))return n;if(!fn(n))return pr({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return un(r,e=>cn(i,e)),un(n.kind===`Interval`?n:F(n).elements,e=>{Ji(e,t)||cn(i,e)}),Xr(i)},Sm=(e,t)=>{let n=(t,n)=>hs([Ls(t,n,e)()],0,e);return{...z(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},Cm=[_s(`TRUE`,!0),_s(`FALSE`,!1),_s(`BOOLEAN`,gm),_s(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),bs(`=`,Kr),bs(`#`,(e,t)=>!Kr(e,t)),z(`~`,1,e=>!hs(e,0,`~`)),z(`<=>`,2,e=>hs(e,0,`<=>`)===hs(e,1,`<=>`)),Sm(`/\\`,(e,t)=>e&&t()),Sm(`\\/`,(e,t)=>e||t()),Sm(`=>`,(e,t)=>!e||t()),z(`\\in`,2,e=>Ji(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!Ji(R(e,0,`\\notin`),R(e,1,`\\notin`))),bs(`\\subseteq`,(e,t)=>{if(!dn(e))throw new w(`\\subseteq expects a set but received ${L(e)}`);if(typeof e==`object`&&e.kind===`Subset`&&typeof t==`object`&&t.kind===`Subset`&&P(e.base))return hm(F(e.base).elements,t.base);if(typeof e==`object`&&e.kind===`Interval`){if(typeof t==`object`&&t.kind===`Interval`&&t.low<=e.low&&t.high>=e.high)return!0;for(let n=e.low;n<=e.high;n++)if(!Ji(n,t))return!1;return!0}return!ki(e,e=>!Ji(e,t))}),...vm.map(e=>z(e,2,t=>{let n=R(t,0,e),r=R(t,1,e),i=e!==`\\cup`&&typeof r==`object`&&r.kind===`Interval`&&typeof n==`object`&&n.kind!==`Interval`;if(fn(n)&&fn(r)&&!ym(n)&&!ym(r)&&!i&&!ln(n)&&!ln(r)){if(e===`\\cup`&&Fi(n))return r;let t=e===`\\cup`?ei:e===`\\cap`?$r:Qr;return Ki((n,r)=>{let i=F(n),a=F(r),o=t(i,a);if(e===`\\cup`){let e=Ur(i),t=Qr(a,i).elements,n=e===i.elements&&(t.length===0||$n(e[e.length-1],t[0])<0);if(e.length+t.length>on())throw new u(sn());if(n&&!i.isNormalized)return o;let r=o===i?ir(o.elements):o;return n||(r.writtenElements=[...e,...t]),r}return o===n||(o.isNormalized=bm(n),i.writtenElements&&!i.isNormalized&&(o.writtenElements=i.writtenElements.filter(e=>Ji(e,o)))),o},(t,n)=>xm(e,t,n),n,r)}return fn(n)?xm(e,n,r):e!==`\\`&&fn(r)?xm(e,r,n):pr({kind:`SetOperation`,operator:e,left:n,right:r})})),z(`SUBSET`,1,e=>({kind:`Subset`,base:R(e,0,`SUBSET`)})),z(`UNION`,1,e=>{let t=R(e,0,`UNION`),n=hn(t)?Ur(t):[],r=n.filter(hn);if(!hn(t)||r.length!==n.length)return pr({kind:`Union`,base:t});let i=r.flatMap(Ur),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{Ji(t,e)||cn(e.elements,t)}),Xr(e.elements)};return ym(t)||r.some(ym)?a():r.length===0?Zr:Ki(e=>Hi(_m(e,0,e.length),i),a,r.map(F),void 0)}),z(`DOMAIN`,1,e=>{let t=R(e,0,`DOMAIN`);if(!pn(t))throw new w(`DOMAIN expects a function but received ${L(t)}`);return ha(t)})],wm=Ms(`Integers`,`Neg`,`IntValue`,1),Tm=e=>{let n=Ms(e,`DotDot`,`IntervalValue`,2);return[Ns(e,`+`,`Plus`,(e,t)=>e+t),Ns(e,`-`,`Minus`,(e,t)=>e-t),Ns(e,`*`,`Times`,(e,t)=>e*t),Ns(e,`^`,`Expt`,(e,n)=>{if(n<0)throw new t(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(e===0&&n===0)throw new t(`0^0 is undefined.`);return e**n}),Ns(e,`\\div`,`Divide`,(e,n)=>{if(n===0)throw new t(`The second argument of \\div is 0.`);let r=Math.floor(e/n);if(xs(r))throw Ss(`${e} \\div ${n}`);return r}),Ns(e,`%`,`Mod`,(e,n)=>{if(n<=0)throw new t(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(e%n+n)%n}),z(`..`,2,e=>{let t=R(e,0,`..`),r=js(R(e,1,`..`),n);return{kind:`Interval`,low:js(t,n),high:r}})]},Em=Tm(`Naturals`),Dm=Tm(`Integers`),Om=e=>{let t=Em.indexOf(e);return t===-1?void 0:Dm[t]},km=e=>{let t=(t,n=`tlc2.value.IBoolValue`)=>`public static ${n} tlc2.module.${e}.${t}(tlc2.value.impl.Value,tlc2.value.impl.Value)`,n=e===`Integers`;return[As(Fs(`<`,(e,t)=>e<t),t(`LT`)),As(Fs(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),As(Fs(`<=`,(e,t)=>e<=t),t(`LE`)),As(Fs(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},Am=[_s(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Em,...km(`Naturals`)],jm=[_s(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Dm,...km(`Integers`),z(`-.`,1,e=>{let t=js(R(e,0,`-`),wm);if(xs(-t))throw Ss(`-${t}`);return-t})],Mm=(e,n,r)=>{let i=R(e,n,r),a=Ui(i);if(!a)throw new t(`${r}\n${N(L(i))}`);return a},Nm=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:Mm(e,t,n)},Pm=(e,t,n)=>{let r=R(e,t,`SubSeq`);if(typeof r!=`number`)throw fs(n,`SubSeq`,`natural number`,r);return r},Fm=(e,t,n)=>typeof e==`string`?Un(e.slice(t,n)):fi(e.slice(t,n)),Im=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Lm=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Rm=(e,t)=>{let n=pc.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?As(e,t):e}):t},zm=e=>Rm(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>Nm(e,0,Im(``,`Len`)).length),z(`\\o`,2,e=>{let n=Nm(e,0,Lm(`s \\o t`,`sequence`));if(typeof n!=`string`){let t=Mm(e,1,Lm(`t \\o s`,`sequence`)),r=n.length===0?R(e,1,`\\o`):t.length===0?R(e,0,`\\o`):void 0;return r!==void 0&&lr(r)===`tuple`?r:fi([...n,...t])}let r=R(e,1,`\\o`);if(typeof r!=`string`)throw new t(`${Lm(`t \\o s`,`string`)}\n${N(L(r))}`);return Un(n+r)}),z(`Append`,2,t=>fi([...Mm(t,0,Lm(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(t,1,`Append`)])),z(`Head`,1,e=>{let n=Mm(e,0,Im(``,`Head`));if(n.length===0)throw new t(`Attempted to apply Head to the empty sequence.`);return n[0]}),z(`Tail`,1,e=>{let n=Nm(e,0,Im(``,`Tail`));if(n.length===0)throw new t(`Attempted to apply Tail to the empty sequence.`);return Fm(n,1)}),z(`SubSeq`,3,e=>{let n=Nm(e,0,Im(`first `,`SubSeq`)),r=Pm(e,1,`second`),i=Pm(e,2,`third`);if(r>i)return Fm(n,0,0);let a=r<1||r>n.length?{position:`second`,value:r}:i>n.length?{position:`third`,value:i}:void 0;if(a)throw new t(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${N(L(R(e,0,`SubSeq`)))}\n, but instead it is\n${a.value}`);return Fm(n,r-1,i)}),vs(`SelectSeq`,2,e=>{let n=gs(e,1,`SelectSeq`);return fi(Mm(e,0,Im(`first `,`SelectSeq`)).filter(e=>{let r=n.call([e]);if(typeof r!=`boolean`)throw new t(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${n.name}>`);return r}))})]),Bm=e=>Rm(`FiniteSets`,[z(`IsFiniteSet`,1,e=>Bi(R(e,0,`IsFiniteSet`))),z(`Cardinality`,1,n=>{let r=R(n,0,`Cardinality`);if(!dn(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new t(`Attempted to compute cardinality of the value\n${N(L(r))}`);return Ri(r,e)})]),Vm=[As(z(`Warshall`,1,e=>{let n=R(e,0,`Warshall`);if(!dn(n)||Kn(n))throw new t(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${N(L(n))}`);Ri(n);let r=[],i=/* @__PURE__ */ new Map,a=e=>{let t=Pa(e),n=i.get(t)??r.length;return n===r.length&&(i.set(t,n),r.push(e)),n},o=F(n).elements.map(e=>{let n=Ui(e);if(n?.length!==2)throw new t(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${N(L(e))}`);return[a(n[0]),a(n[1])]}),s=r.map(()=>r.map(()=>!1));o.forEach(e=>{s[e[0]][e[1]]=!0});for(let e=0;e<r.length;e++)for(let t=0;t<r.length;t++)if(s[t][e])for(let n=0;n<r.length;n++)s[e][n]&&(s[t][n]=!0);return Xr(r.flatMap((e,t)=>r.flatMap((n,r)=>s[t][r]?[fi([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],Hm=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return Vm;if(e===`AnySet`)return[_s(`ANY`,Xn)];if(e===`IOUtils`)return lp(r,a);if(e===`_TLCTrace`)return fp(r);if(!mm(n.version).has(e))return;let o=Gm(e,t,n,r,i);return e===`Randomization`&&o?[...o,Lp(n)]:o},Um=/* @__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`]]]),Wm=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]]]),Gm=(e,t,n,r,i)=>{switch(e){case`Naturals`:return Am;case`Integers`:return jm;case`Sequences`:return zm(n.version);case`FiniteSets`:return Bm(n.version);case`TLC`:return Rm(`TLC`,um(t,n));case`Randomization`:return Rp(n);case`_Possible`:return $p(t,n);case`Json`:return cp(r);case`Bags`:return Rm(`Bags`,Nf(i));case`TLCExt`:return Rm(`TLCExt`,Qp(t,n));default:return}},Km=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&au.get(t)||[];r.expressions.push(...i,t);let a=Gi.sets,o=a??[],s=o.length;Gi.sets=o;try{return n()}catch(e){throw bv(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,Gi.sets=a}},qm=(e,t,n)=>e.coverage?Go(e.coverage,t,n):-1,Jm=(e,t,n)=>e.coverage?qo(e.coverage,t,n):n(),Ym=(e,t,n,r)=>Jm(e,t,()=>W(n,r)),Xm=(e,t,n,r)=>{let i=Ym(e,t,n,r),a=e.coverage;if(a?.covered.has(n))for(let e=t;e!==-1;e=a.prefixes[e])a.primary[e]--;return i},Zm=(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},Qm=e=>!e.includes(void 0),$m=e=>e.variables.map(()=>void 0),eh=(e,t,n)=>{let r=[...e];return r[t]=n,r},th=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},nh=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,rh=e=>e.kind===`Identifier`?e.name:void 0,ih=(e,t,n)=>{if(t.kind===`Label`)return ih(e,t.body,n);let r=rh(t);if(r===void 0)return;let i=i_(n,r);if(i?.kind===`Thunk`)return ih(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=J_(r,e);return o?.kind===`Closure`&&o.params.length===0?ih(e,o.body,o.scope):void 0},ah=(e,t,n)=>{if(t.kind===`Prime`)return ih(e,t.expression,n);if(t.kind===`Label`)return ah(e,t.body,n);let r=rh(t);if(r===void 0)return;let i=i_(n,r);if(i?.kind===`Thunk`)return ah(e,i.expression,i.scope);if(i)return;let a=J_(r,e);return a?.kind===`Closure`&&a.params.length===0?ah(e,a.body,a.scope):void 0},oh=e=>{if(typeof e!=`boolean`)throw new w(`TLC expected a boolean expression.`);return e},sh=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),ch=(e,t,n,r)=>{let i=uh(e,t,n,r);return i&&e.coverage&&!e.isInit&&Ko(e.coverage,r),i},lh=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(Ko(r,n),Ko(r,r.roots[n])),e.onState(t),!0},uh=(e,t,n,r)=>t===void 0?Qm(n)?lh(e,n,r):(e.onIncomplete?.(n),!1):Qm(n)&&sh(e)?fh(e,t,n,r):t.kind===`Predicate`?ph(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?kh(e,t.expression,t.rest,t.scope,n,t.node):dh(e,t,n)&&ch(e,t.rest,n,t.node),dh=(e,t,n)=>{let r=e.environment,i=Ym(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return Ym(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?r_(t,r.runtime.version):t}})();try{return!Kr(i,a)}catch(t){throw e.callStack&&bv(e.callStack,[i],t),t}},fh=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return kh(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?dh(e,i,n):oh(Ym(e,i.node,i.expression,Zm(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return lh(e,n,r)},ph=(e,t,n,r,i,a)=>mh(e,t,n,r,i,qm(e,a,t)),mh=(e,t,n,r,i,a)=>Km(e,t,()=>{switch(t.kind){case`Let`:{let o=Zm(e,r,i),s=t.definitions,c=e.coverage?dv(s,o,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):dv(s,o);return ph(e,t.body,n,c,i,a)}case`Label`:return ph(e,t.body,n,r,i,a);default:if(Ch.has(t.kind))throw new w(`The state relation is not a boolean expression.`);return Km(e,t,()=>Dh(e,t,n,r,i,a))}}),hh=(e,t,n,r,i)=>oh(t)&&ch(e,n,r,i),gh=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),_h=(e,t,n,r,i,a)=>{let o=Zm(e,r,i);if(t.kind===`Identifier`){let s=i_(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return ph(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return ph(e,s.operator.body,n,s.operator.scope,i,a);let c=s?void 0:e.environment.definitions.get(t.name),l=s?void 0:J_(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&lf(c,e.environment))?ph(e,l.body,n,l.scope,i,a):hh(e,Xm(e,a,t,o),n,i,a)}let s=Y_(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=Jm(e,a,()=>sv(s,t.args,o));return ph(e,s.body,n,r,i,a)}let c=gh.has(t.operator)?Ym(e,a,t,o):Xm(e,a,t,o);return hh(e,c,n,i,a)},vh=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?ch(e,t,eh(n,r,i),a):Kr(o,i)&&ch(e,t,n,a)},yh=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),bh=(e,t,n)=>(e.coverage&&Jo(e.coverage,t,n.length+1),n),xh=(e,t,n,r,i,a)=>{let[o,s]=t.args,c=e.isInit?ih(e.environment,o,r):ah(e.environment,o,r),l=Zm(e,r,i);if(c===void 0)return Ym(e,a,t,l)===!0&&ch(e,n,i,a);let u=Ym(e,a,s,l),d=i[c];if(t.operator===`=`)return vh(e,n,i,c,u,a);let f=t.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(typeof f==`object`&&f!==u&&e.callStack?.sources.set(f,s),d!==void 0)return Ym(e,a,t,l)===!0&&ch(e,n,i,a);if(!hi(f))throw new w(`The right side of \\IN is not enumerable.`);return bh(e,f,Ai(f)).reduce((t,r)=>ch(e,n,eh(i,c,r),a)||t,!1)},Sh=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Ch=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),wh={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},Th=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:wh[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${U(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${U(e)}`:`In computing ENABLED, TLC encountered unbounded quantifier. Make sure that the expression is of form ${e.quantifier===`Forall`?`\\A`:`\\E`} x \\in S: P(x).\n${U(e)}`;if(e.kind===`Choose`&&e.set===void 0)return`In computing ENABLED, TLC encountered unbounded CHOOSE. Make sure that the expression is of form CHOOSE x \\in S: P(x).\n${U(e)}`},Eh=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=Jm(e,r,()=>w_(t.bounds,t=>{let r=W(t,n),i=x_(r,t,a);return Array.isArray(i)&&bh(e,r,i),i}));return E_(t.bounds,o,n.scope,e=>(i.push(e),!1)),i},Dh=(e,t,n,r,i,a)=>{let o=Zm(e,r,i);switch(t.kind){case`Identifier`:return _h(e,t,n,r,i,a);case`Apply`:return Sh.has(t.operator)&&t.args.length===2?xh(e,t,n,r,i,a):t.operator===`=>`&&t.args.length===2?oh(Ym(e,a,t.args[0],o))?ph(e,t.args[1],n,r,i,a):ch(e,n,i,a):_h(e,t,n,r,i,a);case`And`:{let o=t.operands;if(t.isBulleted||o.length===2){let t=o.slice(1).reduceRight((e,t)=>yh(`Predicate`,t,r,a,e),n);return ph(e,o[0],t,r,i,a)}let s=o[o.length-1];return mh(e,th(t,o.length-1),yh(`Predicate`,s,r,a,n),r,i,nh(e,a))}case`Or`:{let o=t.operands;if(t.isBulleted||o.length===2)return o.reduce((t,o)=>ph(e,o,n,r,i,a)||t,!1);let s=mh(e,th(t,o.length-1),n,r,i,nh(e,a)),c=ph(e,o[o.length-1],n,r,i,a);return s||c}case`Exists`:return Eh(e,t,o,a).reduce((r,o)=>ph(e,t.body,n,o,i,a)||r,!1);case`Forall`:{let r=Eh(e,t,o,a);if(r.length===0)return ch(e,n,i,a);let s=r.slice(1).reduce((e,n)=>yh(`Predicate`,t.body,n,a,e),n);return ph(e,t.body,s,r[0],i,a)}case`If`:return ph(e,oh(Ym(e,a,t.condition,o))?t.consequent:t.alternative,n,r,i,a);case`Case`:{let s=t.arms.find(t=>oh(Ym(e,a,t.condition,o)))?.body??t.other;if(s===void 0)throw new w(`TLC encountered a CASE with no conditions true.`);return ph(e,s,n,r,i,a)}case`FunctionApplication`:{let r=M_(Ym(e,a,t.function,e.isInit?o:c_(o)));if(r){let s=Jm(e,a,()=>N_(r,t,o));return ph(e,r.body,n,s,i,a)}break}case`Unchanged`:if(!e.isInit)return kh(e,t.expression,n,r,i,a);break;case`BoxAction`:if(!e.isInit){let o=ph(e,t.action,n,r,i,a);return kh(e,t.subscript,n,r,i,a)||o}break;case`AngleAction`:if(!e.isInit)return ph(e,t.action,yh(`Changed`,t.subscript,r,a,n),r,i,a)}let s=e.isEnabled?Th(t):void 0;if(s!==void 0)throw new w(s);return hh(e,Ym(e,a,t,o),n,i,a)},Oh=(e,t,n)=>e.runtime.warn(wt.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${U(n)}`),kh=(e,t,n,r,i,a)=>Km(e,t,()=>{let o=qm(e,a,t),s=ih(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;let a=i[s];return a!==void 0&&!Kr(a,r)?(Oh(e.environment,s,t),!1):vh(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return ch(e,n,i,o);let c=s.reduceRight((e,t)=>yh(`Unchanged`,t,r,o,e),n);return kh(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=i_(r,t.name);if(a?.kind===`Thunk`)return kh(e,a.expression,n,a.scope,i,o);let s=a?void 0:J_(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return kh(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=Zm(e,r,i),s=Y_(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return kh(e,s.body,n,sv(s,t.args,a),i,o)}let c=e.environment,l=Ym(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=Ym(e,o,t,{environment:c,scope:r,state:i,next:void 0});return Kr(l,u)&&ch(e,n,i,o)}),Ah=(e,t,n,r,i)=>({environment:e,callStack:e.callStack,coverage:e.coverage,isInit:t===`init`,isEnabled:t===`enabled`,current:n,onState:r,onIncomplete:i}),jh=/* @__PURE__ */ Error(`The replay found a successor`),Mh=(e,t,n,r)=>{let i=()=>{throw jh},a=Ah(r,`enabled`,n,i,i),o=a.callStack,s=o?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=yh(`Changed`,e.subscript,t,-1,void 0);ph(a,e.action,n,t,$m(r),-1)}else ph(a,e,void 0,t,$m(r),-1);return!1}catch(e){if(e!==jh)throw e;return o&&(o.expressions.length=s,o.isFrozen=!1),!0}},Nh=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=Ah(t,`init`,void 0,n,r),s=a.reduceRight((e,t)=>yh(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);ph(o,i.expression,s,i.scope,$m(t),i.node??-1)},Ph=(e,t,n,r)=>{e.some(e=>Ch.has(e.expression.kind))||e.forEach(e=>{let i=[];Fh(e,-1,t,n,e=>i.push(e)),i.forEach(t=>r(t,e))})},Fh=(e,t,n,r,i,a)=>{let o=Ah(r,`next`,n,i,a);ph(o,e.expression,void 0,e.scope,$m(r),t)},Ih=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(ih(t,e,void 0)!==void 0&&e.kind===`Identifier`){n.push(e);return}if(e.kind===`Tuple`){e.elements.forEach(e=>i(e,r));return}if(e.kind!==`Identifier`)return;let a=i_(r,e.name)?void 0:J_(e.name,t);a?.kind===`Closure`&&a.params.length===0&&i(a.body,a.scope)},a=(e,o,s)=>{switch(e.kind){case`Let`:a(e.body,dv(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`FunctionApplication`:a(e.function,o,s);return;case`If`:a(e.consequent,o,s),a(e.alternative,o,s);return;case`Case`:e.arms.forEach(e=>a(e.body,o,s)),e.other&&a(e.other,o,s);return;case`And`:case`Or`:e.operands.forEach(e=>a(e,o,s));return;case`Exists`:case`Forall`:a(e.body,o,s);return;case`Unchanged`:i(e.expression,o);return;case`AngleAction`:a(e.action,o,s);return;case`BoxAction`:a(e.action,o,s),n.push(e.subscript);return;case`Identifier`:case`Apply`:{if(e.kind===`Apply`){if(e.operator===`=>`){e.args.forEach(e=>a(e,o,s));return}if(e.operator===`=`||e.operator===`\\in`){ah(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=i_(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?Y_(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:J_(i,t);if(l?.kind!==`Closure`||s.has(l.body)||t.definitions.get(i)?.isRecursive)return;let u=e.kind===`Apply`?e.args:[];if(l.params.length!==u.length)return;s.add(l.body),a(l.body,sv(l,u,r(o)),s),s.delete(l.body)}}};return e.forEach(e=>a(e.expression,e.scope,/* @__PURE__ */ new Set)),n.flatMap(e=>e.location.range??[])},Lh=/* @__PURE__ */ new WeakMap,Rh=/* @__PURE__ */ new WeakMap,zh=(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},Bh=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Vh=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,Hh=(e,t)=>{let n=new w(t);return e.isInit?n:x(n,S.error)},Uh=(e,t,n,r)=>{let i=qg(n);return r&&Ch.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${Vh(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},Wh=(e,t,n)=>{let r=Os(t),i=U(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${Vh(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
1782
|
+
`:``}${i}`},Gh=(e,t,n)=>Jh(e,t,W(t,n)),Kh=new Set(Cm.map(e=>e.name)),qh=e=>e.kind===`Apply`?Kh.has(e.operator):e.kind!==`Identifier`&&!Ch.has(e.kind),Jh=(e,t,r,i=!0)=>{if(typeof r==`boolean`)return r;let a=Uh(e,r,t,i);throw e.isInit&&i&&qh(t)?new n(a):Hh(e,a)},Yh=(e,t,n,r)=>r.environment.callStack?W(n,r):(e[t]??=Dv(n,r.environment))(r),Xh=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Zh=(e,t,n)=>{let r=n?Lh:Rh,i=r.get(e);if(i)return i;let a=jg(e,t,n),o=n?void 0:Ag(e,t),s=o?(e,t,n,r,i,s)=>(e.generator?o:a)(e,t,n,r,i,s):a;return r.set(e,s),s},Qh=(e,t)=>{if(t.constants.has(e))return;let n=h_(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},$h=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return $h(e.expression,t,!1,r);if(e.kind!==`Identifier`||M(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Qh(e.name,t);if(a&&!r.has(a))return r.add(a),$h(a.body,t,n,r)},eg=(e,t,n)=>$h(e,t,!n),tg=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return tg(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=dv(e.definitions,zh(r,t,n));return tg(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=i_(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return tg(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=Qh(e.name,r.environment);if(s)return tg(s.body,void 0,n,r,i)},ng=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||M(e))||!t&&e.kind===`Prime`,rg=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>rg(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[{index:r,expression:e}];let i=Qh(e.name,t);if(i)return n.add(e.name),rg(i.body,t,n)},ig=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),ag=(e,t,n)=>ig.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Xh(e.operator)&&(ng(e.args[0],n)||eg(e.args[0],t,n)!==void 0)||M(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,og=/* @__PURE__ */ new Set,sg=(e,t)=>{if(M(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return mu(e,(e,i)=>{let a=r?sg(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];a?n.push(...a):r=!1}),r?n:void 0},cg=(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||M(e)?void 0:h_(r,t);return i&&!n.has(i)&&(n.add(i),cg(i.body,t,n))?!0:mt(e).some(e=>cg(e,t,n))},lg=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=eg(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=rg(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return ag(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Zh(e,t,n)}},ug=(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(gf(e,t)===void 0||cg(e,t,/* @__PURE__ */ new Set))return!0;let n=sg(e,og);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)}},dg=(e,t,n)=>{let r=e.map(e=>lg(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=sh(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Ng(u)){d??=zh(t,n,u);for(let e=s;e<r.length;e++){let n=r[e],i=t.current,o=i&&n.kind===`Unchanged`?n.variables.find(e=>{let t=u[e.index];return t!==void 0&&!Kr(t,i[e.index])}):void 0;if(o){Oh(t.environment,o.index,o.expression);return}let s=n.expression,c=Yh(a,e,s,d);if(!Jh(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=zh(t,n,u);let r=Yh(i,s,e.expression,d);if(!Jh(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=zh(t,n,u);let r=Yh(i,s,e.value,d),a=u[e.index];if(a===void 0)u=Bh(u,e.index,r),d=void 0;else if(!Kr(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let i of e.variables){let e=(r??u)[i.index];if(e===void 0)r??=u.slice(),r[i.index]=n[i.index];else if(!Kr(e,n[i.index])){Oh(t.environment,i.index,i.expression);return}}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},fg=e=>{let t=Th(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw Hh(n,t);Gh(n,e,zh(n,r,i))&&s(i,a)}},pg=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=zh(r,i,a);if(a[l]!==void 0){Gh(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!hi(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${Vh(r)}, the right side of \\IN is not enumerable.`;throw Hh(r,`${t}\n${U(e)}`)}let p=Ai(f);if(r.generator){for(let e of kp(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(Bh(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(Bh(a,l,p[e]),o)}},mg=/* @__PURE__ */ new WeakMap,hg=e=>{let t=mg.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(hg),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return mg.set(e,n),n},gg=(e,t)=>{let n=e.args[0],r=fg(e),i=(e,r,i)=>tg(n,r,i,e,!t)??-1,a=pg(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=W(e.args[1],zh(t,n,o));l(Bh(o,u,d),s)}},_g=(e,t,n)=>{let r=U(e);return(i,a,o,s,c,l)=>{let u=zh(i,a,o),d=W(e.function,n?u:c_(u)),f=M_(d);if(f!==void 0){Zh(f.body,t,n)(i,N_(f,e,u),o,s,c,l);return}if(!pn(d))throw Hh(i,`In computing ${Vh(i)}, a non-function (${Os(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw Hh(i,`In computing ${Vh(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},vg=(e,t)=>{let n=hg(e);return rg(e,t)?dg([n],t,!1):e.kind===`Tuple`?Zh(n,t,!1):(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?i_(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){Zh(hg(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=zh(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=Y_(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){Zh(hg(n.body),t,!1)(r,sv(n,e.args,u),a,o,s,c);return}}Gh(r,n,u)&&c(a,o)}},yg=(e,t,n)=>{let r=e.operator,i=fg(e),a=M(e)?void 0:J_(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Mv(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=Zh(a.body,t,n),o(e,i(zh(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=zh(a,o,s),f=Y_(e,d);f?.kind===`Closure`?Zh(f.body,t,n)(a,sv(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},bg=(e,t,n)=>{let r=fg(e),i=M(e)?void 0:Qh(e.name,t),a;return(o,s,c,l,u,d)=>{let f=i_(s,e.name);f?.kind===`Thunk`&&!f.isReleased?Zh(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&U_(i,t)!==void 0?r(o,s,c,l,u,d):(a??=Zh(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},xg=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||M(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!M(i))return;let a=$h(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},Sg=e=>e.kind===`And`?e.operands.flatMap(Sg):[e],Cg=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&ag(e,t,!1),wg=e=>{let t=[];return(n,r,i)=>{let a=zh(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!Jh(n,i,Yh(t,r,i,a)))return}}},Tg=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=Sg(e),r=n.findIndex(e=>!Cg(e,t)||xg(e,t)),i=r===-1?void 0:xg(n[r],t);return i?{...i,before:r===0?void 0:wg(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>Tg(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||M(e))return;let r=J_(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Tg(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`||!M(o))return;let s=i.before,c=s&&Mv(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(zh(e,t,n)),n))}},Eg=(e,t,n)=>{let r=i_(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},Dg=(e,t,n)=>{let r=e.map(e=>Zh(e,t,n)),i=n?[]:e.map(e=>Tg(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&Eg(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},Og=e=>(t,n,r,i,a,o)=>{let s=t.generator;if(!s)throw Error(`A random choice needs the run's generator`);let c=Math.floor(s.nextDouble()*e.length),l=yp(s);for(let s=0;s<e.length;s++)if(e[(c+s*l)%e.length](t,n,r,i,a,o),t.successors>0||t.isStopped)return},kg=(e,t)=>{let n=Zh(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=zh(r,i,a),u=t.runtime.version,d=w_(e.bounds,e=>W(e,l)).map((n,r)=>kp(y_(n,e.bounds[r].set,u).length,n,t.runtime.getRandom(),u)),f=(t,i)=>{if(t<0)return n(r,i,a,o,s,c),r.successors>0||r.isStopped;let l=e.bounds[t].pattern;return d[t].some(e=>f(t-1,o_(i,l,e)))};f(d.length-1,i)}},Ag=(e,t)=>{if(e.kind===`Exists`)return kg(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>Zh(e,t,!1));return e.isBulleted?Og(n):n.reduce((e,t)=>Og([e,t]))},jg=(e,t,n)=>{let r=e=>Zh(e,t,n);switch(e.kind){case`And`:return dg(e.operands,t,n);case`Or`:return Dg(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(n,r,o,s,c,l)=>{let u=y_(W(a.set,zh(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,a_(r,e,u[t]),o,s,c,l)}}let o=n?void 0:ug(e,t);if(o){let r=dg(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=zh(n,i,a),d=w_(e.bounds,e=>y_(W(e,u),e,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=a_(t,o.names[e],r);if(e===d.length-1){let e=zh(n,i,a);if(!o.guards.every(t=>Gh(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{D_(e.bounds,zh(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&gf(e,t)!==void 0&&!cg(e.body,t,/* @__PURE__ */ new Set)?sg(e,og):void 0;return(t,n,r,o,s,c)=>{let l=[];D_(e.bounds,zh(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>i_(n,e)?.kind===`Value`)){u.every(n=>Gh(t,e.body,zh(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Ng(r)?u.slice(n).every(n=>Gh(t,e.body,zh(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=W(e.condition,zh(r,i,a));if(typeof l!=`boolean`)throw Hh(r,Wh(r,l,e));(l?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,source:e.body,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=zh(r,i,a),u=t.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw Hh(r,`In computing ${Vh(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Os(t)}) was used as a guard condition of a CASE.\n${qg(e.source)}`)})?.body??n;if(!u)throw Hh(r,`In computing ${Vh(r)}, TLC encountered a CASE with no conditions true.\n${U(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=pv(e.definitions,t);return(t,r,a,o,s,c)=>n(t,dv(e.definitions,zh(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new w(`UNCHANGED appears in an initial predicate at ${Wg(e)}`)}:vg(e.expression,t);case`AngleAction`:{let n=r(e.action),i={kind:`Unchanged`,expression:e.subscript,location:e.subscript.location},a=(e,n,r)=>{try{return Gh(e,i,zh(e,n,r))}catch(n){throw e.isEnabled?r_(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return Dg([e.action,hg(e.subscript)],t,n);case`Label`:return r(e.body);case`Identifier`:return bg(e,t,n);case`FunctionApplication`:return _g(e,t,n);case`Apply`:{let i=e.args;if(Xh(e.operator)){let r=eg(i[0],t,n);if(r!==void 0)return e.operator===`=`?dg([e],t,n):pg(e,()=>r);if(ng(i[0],n))return gg(e,n)}if(e.operator===`=>`){let t=r(i[1]);return(n,r,a,o,s,c)=>{let l=W(i[0],zh(n,r,a));if(typeof l!=`boolean`){let t=Os(l),r=U(e);throw Hh(n,n.isInit?`In computing initial states of a predicate of form P => Q, P was ${t}\n.${r}`:n.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${t}.\n${r}`:`In computing next states of a predicate of the form P => Q, P was\n${t}.\n${r}`)}l?t(n,r,a,o,s,c):c(a,o)}}return yg(e,t,n)}default:return fg(e)}},Mg=e=>e.variables.map(()=>void 0),Ng=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Pg=(e,t)=>{let n=t.state;if(!n||!Ng(n))throw new w(`ENABLED needs a complete state at ${Wg(e)}`);let r=t.environment;if(r.callStack)return Mh(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1,generator:void 0,successors:0};return Zh(e,r,!1)(i,t.scope,Mg(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Fg=(e,t,n,i,a)=>{let o={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};Zh(e,t,!0)(o,i,Mg(t),void 0,!1,e=>{if(!o.isStopped){if(!Ng(e)){if(a){o.isStopped=a([...e]);return}throw x(new r([...e]),S.error)}o.isStopped=n(e)}})},Ig=(e,t,n)=>{let r=[];return Fg(e,t,e=>(r.push(e),!1),n),r},Lg=(e,t,n,r,i,a,o)=>{let s={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:a,successors:0,onUnsatisfied:o};return Zh(e,n,!1)(s,i,Mg(n),void 0,!1,(e,t)=>{if(!s.isStopped){if(!Ng(e)){let r=n.variables.filter((t,n)=>e[n]===void 0);throw new re(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)}s.successors++,s.isStopped=r({state:e,action:t})}}),s.successors},Rg=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return Zh(e,n,!1)(i,r,Mg(n),void 0,!1,e=>{Ng(e)||i.successors++}),i.successors>0},zg=(e,t,n,r)=>{let i=[];return Lg(e,t,n,e=>(i.push(e),!1),r),i},Bg=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Vg=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Hg=e=>Vg.has(e.kind)||e.kind===`Apply`&&Bg.has(e.operator),Ug=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&fn(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Wg=e=>`line ${e.location.line}, column ${e.location.column}`,U=e=>{let t=e.location.range;return t?g(t):Wg(e)},Gg={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},Kg=(e,t)=>new w(`TLC encountered a temporal formula (${e}) when evaluating a predicate or action.\n${U(t)}`),qg=e=>e.kind===`Number`?e.text??String(e.value):U(e),Jg=(e,t)=>new w(`A non-boolean expression (${Os(t)}) was used as the condition of an IF.\n${U(e)}`),Yg=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new w(`A non-boolean expression (${Os(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${qg(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new w(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${Os(n)}.\n${U({...e,location:{...e.location,range:{...r,end:i}}})}`)},Xg=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${N(L(n))}\n${U(e)}`,r=e=>`Attempted to apply function:\n${N(L(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!pn(i))throw new w(`Attempted to select field "${t}" from a non-record value ${N(L(i))}\n${U(e)}`);let a=lr(i);if(a===`tuple`)throw aa(t);return pa(i.kind===`LazyFunction`?I(i):i,t,a===`record`?n:r)}},Zg=e=>e===`1.7.4`?(t,n)=>na(t,n,e):void 0,Qg=e=>t=>{if(!pn(t))throw new w(`Attempted to apply the operator DOMAIN to a non-function\n(${Os(t)})\n${U(e)}`);return ha(t)},$g=(e,t)=>(n,r)=>{if(!dn(n)||Kn(n))throw new w(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${U(e)}`);return t.evaluateBinary?t.evaluateBinary(n,r):t.evaluate([n,r])},e_=e=>x(new w(`TLC can't handle real numbers.\n${e.text}`),S.configParseError),t_=e=>x(new w(`TLC can't handle a number this big.\n${e.text??e.value}`),S.error),n_=(e,t)=>new ie(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${U(t)}`,e),r_=(e,t)=>e instanceof ie&&t!==`1.7.4`?new w(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,i_=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},a_=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),o_=(e,t,n)=>{if(t.kind===`Name`)return a_(e,t.name,n);let r=Ui(n);if(!r||r.length!==t.names.length){let e=t.ranges?.[0];throw new w(`Argument mismatch in operator application.${e?g(e):``}`)}return t.names.reduce((e,t,n)=>a_(e,t,r[n]),e)},s_=(e,t)=>{if(pn(e))return e;throw new w(`A non-function (${Os(e)}) was applied as a function.\n${U(t)}`)},c_=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},l_=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),u_=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Expected ${t} to be a boolean but found ${L(e)}`);return e},d_=(e,t,n)=>{if(typeof e!=`boolean`)throw new w(`Attempted to evaluate an expression of form P => Q when ${n} was\n${Os(e)}.\n${U(t)}`);return e},f_=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Attempted to apply the operator ~ to a non-boolean\n(${Os(e)})\n${U(t)}`);return!e},p_=(e,t,n)=>{if(typeof e!=`boolean`||typeof t!=`boolean`)throw new w(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${U(n)}`);return e===t},m_=(e,t)=>{if(typeof e!=`boolean`)throw new w(`TLC expected a boolean value, but did not find one. ${qg(t)}`);return e},h_=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),g_=(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.`},__=(e,t,n)=>{if(!dn(e)||Kn(e)){let r=L(e),i=n===`1.7.4`?void 0:g_(e,r);throw new w(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${qg(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${qg(t)}\n${i}`)}},v_=(e,t,n)=>(__(e,t,n),typeof e==`object`&&e.kind===`Interval`?ci(e):Si(e)??Oi(e)),y_=(e,t,n)=>n===`1.7.4`?(__(e,t,n),Si(e)??Ai(e)):v_(e,t,n),b_=e=>{if(typeof e==`object`&&e.kind===`Interval`)return Ri(e),e},x_=(e,t,n)=>b_(e)??y_(e,t,n),S_=(e,t,n)=>b_(e)??v_(e,t,n),C_=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},w_=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set,i)),n),[]),T_=(e,t)=>w_(e,e=>x_(W(e,t),e,t.environment.runtime.version)),E_=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):C_(t[n],t=>i(n-1,o_(a,e[n].pattern,t)));return i(e.length-1,n)},D_=(e,t,n)=>E_(e,T_(e,t),t.scope,n),O_=(e,t)=>{let n=w_(e,e=>W(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},k_=(e,t,n)=>{if(e.length===1)return o_(t,e[0].pattern,n);let r=Ui(n)??[];return e.reduce((e,t,n)=>o_(e,t.pattern,r[n]),t)},A_=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,j_=e=>Object.assign(e.value,{lambda:e}),M_=e=>A_(e)?e.lambda:void 0,N_=(e,t,n)=>{let r=e.value,i=t.args.map(e=>W(e,n)),a=i.length===1?i[0]:fi(i),o=(e,n,i)=>`In applying the function\n${N(L(r))},\nthe ${e} is:\n${N(L(n))}${i}.\n${U(t.function)}`,s=e.bounds;if(s.length===1){if(!Ji(a,r.domain))throw new w(o(`first argument`,a,`which is not in its domain`));return k_(s,e.scope,a)}let c=Ui(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0)throw new w(`Attempted to apply a function to an argument not in its domain.\n${U(t.function)}`);let u=()=>new w(`In applying the function\n${N(L(r))},\nthe argument list is:\n${N(L(a))}\nwhich does not match its formal parameter.\n`);if(s.forEach((e,t)=>{if(t>=c.length)throw u();let n=c[t],r=`argument number ${t+1}`;if(!Ji(n,l[t]))throw new w(o(r,n,`${e.pattern.kind===`Name`?``:`
|
|
1783
|
+
`}which is not in its domain`));if(e.pattern.kind===`Tuple`&&Ui(n)?.length!==e.pattern.names.length)throw new w(o(r,n,`which does not match its formal parameter`))}),c.length>s.length)throw u();return k_(s,e.scope,a)},P_=(e,t)=>{if(t.location.range)return{parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:qg(t)}},F_=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},I_=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},L_=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),R_=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),z_=(e,t)=>{let n=O_(e.bounds,t),r=I_(n,(n,r)=>W(e.body,l_(t,k_(e.bounds,a_(void 0,e.name,r),n))),F_(P_(e.bounds,e.body),e.bounds,n),L_(e.bounds));j_({value:r,bounds:e.bounds,body:e.body,scope:a_(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=z_(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?ur(i):i},B_=(e,t)=>{if(typeof t!=`object`||lr(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!fn(t.domain))return t;try{let e=I(t);return or(e.domain,e.range)}catch(e){if(e instanceof w)return t;throw e}},V_=(e,t)=>e.kind===`Operator`&&e.params.length>0?()=>{throw new w(`Operator ${e.name} requires ${e.params.length} arguments`)}:e.kind===`Function`?e.isSelfReferential?t=>z_(e,t):Dv(R_(e),t):Dv(e.body,t),H_=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=V_(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(l_(e,void 0)):e=>a[i]??r(l_(e,void 0));return t.definitionEvaluators.set(e,o),o},U_=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},W_=(e,t)=>e.forEach(e=>{if(e.kind===`Operator`&&e.params.length>0)return;let n=e.name;if(t.constants.has(n)||t.substitutions.has(n)||!uf(e,t))return;let r=t.facts.ids.get(e);if(r===void 0||t.startupValues[r]!==void 0)return;let i={environment:t,scope:void 0,state:void 0,next:void 0};try{let n=t.runtime.evaluateAtStartup(()=>B_(e,V_(e,t)(i)));Wr(n),t.startupValues[r]=n}catch(e){if(!(e instanceof w)&&!b(e))throw e}}),G_=(e,t)=>{if(t===void 0||e===t)return!0;try{return t.every((t,n)=>t===void 0||e?.[n]!==void 0&&_r(e[n],t))}catch(e){if(e instanceof w)return!1;throw e}},K_=(e,t)=>{let n=e.cache;if(n!==void 0&&G_(t.state,e.state)&&G_(t.next,e.next))return n;let r=t.environment.coverage,i=r?.current===-1?void 0:r?.values.get(e),a=r&&i!==void 0?qo(r,i,()=>W(e.expression,l_(t,e.scope))):W(e.expression,l_(t,e.scope));return(!e.isStreamed||Mi(a))&&(e.cache=a,e.state=t.state,e.next=t.next),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),a},q_=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),J_=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return J_(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?q_(r):t.builtins.get(e)},Y_=(e,t)=>M(e)?X_(e.operator,t):J_(e.operator,t.environment)??X_(e.operator,t),X_=(e,t)=>{let n=i_(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return J_(e,t.environment)},Z_=e=>e.kind===`Closure`?e.params.length:e.arity,Q_=(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:X_(n,t);if(!r)throw new w(`Expected an operator argument at ${Wg(e)}`);return r},$_=(e,t,n)=>{if(e.kind===`Builtin`&&e.isLazy)return e.evaluate(t.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>e})),n);if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>a_(e,n.name,t[r]),e.scope);return W(e.body,l_(n,r))},ev=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Z_(e),call:n=>$_(e,n,t)},tv=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=X_(e.name,t);return n!==void 0&&Z_(n)>0},nv=(e,t)=>e.map(e=>tv(e,t)?ev(Q_(e,t),t):W(e,t)),rv=(e,t)=>new w(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),iv=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),av=(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 av(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([])}},ov=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&_n(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=iv(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=M(e)?void 0:av(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0&&!t.callStack)return t=>{let n=i_(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:iv(e,t)}}return t=>iv(e,t)},sv=(e,t,n,r)=>{if(t.length!==e.params.length)throw rv(e,t.length);let i=e.scope;for(let a=0;a<t.length;a++){let o=e.params[a],s=o.arity>0?{kind:`Operator`,operator:Q_(t[a],n)}:(r?.[a]??ov(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},cv=(e,t,n,r)=>e.kind===`Closure`?W(e.body,l_(n,sv(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(Av(t,n),n):e.evaluate(nv(t,n),n),lv=/* @__PURE__ */ new WeakMap,uv=e=>{let t=lv.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return lv.set(e,n),n},dv=(e,t,n)=>{let r=e.map(e=>({name:e.name,binding:{kind:`Value`,value:!1},parent:void 0})),i=r.reduce((e,t)=>(t.parent=e,t),t.scope);e.forEach((e,a)=>{r[a].binding=e.kind===`Function`?{kind:`Thunk`,expression:uv(e),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1}:e.params.length>0||n?.impure.has(e)?{kind:`Operator`,operator:{kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:i}}:{kind:`Thunk`,expression:e.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(e)??!1}});let a=t.environment.coverage;return a&&a.current!==-1&&r.forEach(e=>{e.binding.kind===`Thunk`&&a.values.set(e.binding,a.current)}),i},fv=(e,t,n)=>{let r=i_(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return K_(r,n);if(r?.kind===`Operator`){if(Z_(r.operator)===0)return $_(r.operator,[],n);throw new w(`Operator ${e} is used without arguments`)}let i=av(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw n_(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return H_(i.definition,n.environment)(n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new w(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${U(t)}`)},pv=(e,t)=>({impure:new Set(e.filter(e=>pf(e,t))),streamed:new Set(e.filter(e=>pf(e,t,`streamed`)))}),mv=e=>[...e.facts.ids.keys()].some(t=>pf(t,e)),hv=e=>[...e.facts.ids.keys()].some(t=>pf(t,e,`repeated`)),gv=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,_v=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),vv=e=>t=>{let n=e(t);return _r(n,e(_v(t)))},yv=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Gi.sets,o=Gi.callStack,s=a??[],c=s.length;Gi.sets=s,Gi.callStack=r;try{let a=t(i),o=gv(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Hg(e)&&r.sources.set(o,e),o}catch(t){t instanceof u&&!r.isFrozen&&(r.expressions.length=0,r.isFrozen=!0);let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Ug(e,r.values),a=i&&!mt(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!pn(a)?void 0:a;throw bv(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,Gi.sets=a,Gi.callStack=o}},bv=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof w){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},xv=(e,t,n)=>{if(!(n instanceof w))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},Sv=e=>({...e,coverage:void 0,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),Cv=(e,t,n)=>{let r=e.location.range,i=e.prefixEnds;if(!n||e.isBulleted||!r||!i||t.length<3)return;let a=i.slice(0,t.length-2).map(t=>({...e,location:{...e.location,range:{...r,end:t}}})).reverse(),o=e.kind===`And`;return r=>{n.expressions.push(...a);for(let i=0;i<t.length;i++){i>=2&&!n.isFrozen&&n.expressions.pop();let s=t[i](r);if(typeof s!=`boolean`)throw Yg(e,i,s);if(s!==o)return n.isFrozen||(n.expressions.length-=a.length-Math.max(i-1,0)),s}return o}},wv=(e,t,n,r)=>i=>{if(r.expressions.at(-1)===e)return n(i);r.expressions.push(...t);try{return n(i)}finally{r.isFrozen||(r.expressions.length-=t.length)}},Tv=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=Go(n,i,e);Ko(n,a),n.current=a;try{let i=t(r);return typeof i==`object`&&e.kind===`SetEnumeration`&&n.values.set(i,a),i}finally{n.current=i}},Ev=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=ey(e,t),i=t.callStack,a=i&&au.get(e),o=i?yv(e,r,t,i):r,s=i&&a?wv(e,a,o,i):o,c=t.coverage,l=c?Tv(e,s,c):s;return t.evaluators.set(e,l),l},Dv=(e,t)=>{if(t.callStack||t.coverage)return Ev(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=ic(e,t)??Ev(e,t);return t.entryEvaluators.set(e,r),r},W=(e,t)=>Dv(e,t.environment)(t),Ov=(e,t)=>{let n=e.name,r=M(e)?void 0:av(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw n_(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n;return r=>(n??=H_(e,t))(r)}return t=>fv(n,e,t)},kv=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||M(e))return!0;let n=J_(e.name,t);return n===void 0||Z_(n)===0},Av=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),jv=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Av(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&kv(t[0],n)){let e=Ev(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&kv(t[0],n)&&kv(t[1],n);if(i&&a){let e=Ev(t[0],n),r=Ev(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(nv(t,n),n)},Mv=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw rv(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:ov(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:Q_(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Nv=(e,t,n)=>{let r=Mv(e,t,n),i;return t=>(i??=Dv(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},Pv=(e,t)=>{let n=e.args;if(e.operator===`=>`){let r=Ev(n[0],t),i=Ev(n[1],t);return t=>!d_(r(t),e,`P`)||d_(i(t),e,`Q`)}if(e.operator===`~`&&n.length===1){let r=Ev(n[0],t);return t=>f_(r(t),e)}if(e.operator===`<=>`){let r=Ev(n[0],t),i=Ev(n[1],t);return t=>p_(r(t),i(t),e)}if(e.operator===`~>`||e.operator===`-+->`)return()=>{throw Kg(e.operator===`~>`?`a ~> b`:`a -+-> formula`,e)};let r=M(e)?void 0:J_(e.operator,t);if(r?.kind===`Closure`)return Nv(r,n,t);if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=Ev(n[0],t),i=Qg(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=!iu.has(e)&&!_f(n[0],t),a=t.tlcEvalValues;return t=>{if(!i||t.scope!==void 0)return r.evaluate(Av(n,t),t);let o=a.get(e);if(o!==void 0)return o;let s=r.evaluate(Av(n,t),void 0);return a.set(e,s),s}}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=Ev(n[0],t),a=Ev(n[1],t),o=$g(e,r);return e=>o(i(e),a(e))}if(r?.kind===`Builtin`)return jv(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new w(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let i=n.map(e=>ov(e,t));return r=>{let a=X_(e.operator,r);if(a)return cv(a,n,r,i);throw t.definitions.get(e.operator)?.kind===`Function`?new w(`${e.operator} is a function; apply it with brackets`):new w(`Unknown operator ${e.operator} at ${Wg(e)}`)}},Fv=(e,t)=>{let n=e.kind===`Forall`,r=Ev(e.body,t),i=e.bounds[0];if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=Ev(i.set,t);return s=>C_(x_(o(s),i.set,t.runtime.version),t=>m_(r(l_(s,a_(s.scope,a,t))),e)!==n)?!n:n}let a=e.bounds;if(a.every(e=>e.pattern.kind===`Name`)){let i=a.map(e=>e.pattern.kind===`Name`?e.pattern.name:``);return o=>{let s=w_(a,e=>x_(Ev(e,t)(o),e,t.runtime.version)),c=(t,a)=>t<0?m_(r(l_(o,a)),e)!==n:C_(s[t],e=>c(t-1,a_(a,i[t],e)));return c(a.length-1,o.scope)?!n:n}}return t=>D_(a,t,i=>m_(r(l_(t,i)),e)!==n)?!n:n},Iv=(e,t)=>{if(e.kind===`Tuple`)return fi(e.names.map(e=>{let n=i_(t,e);return n?.kind===`Value`&&n.value}));let n=i_(t,e.name);return n?.kind===`Value`?n.value:void 0},Lv=/* @__PURE__ */ new WeakSet,Rv=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&Lv.add(e)},zv=/* @__PURE__ */ new WeakMap,Bv=e=>{if(zv.has(e))return zv.get(e);let t=/* @__PURE__ */ new Set,n=e=>{if(e.kind===`Subexpression`)return!1;let r=ht(e);return r!==void 0&&t.add(r),e.kind===`ExceptAt`&&t.add(`@`),mt(e).every(n)},r=n(e)?[...t]:void 0;return zv.set(e,r),r},Vv=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=i_(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),Hv=e=>Lv.has(e),Uv=(e,t)=>{let n=Hv(e),r=Ev(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=e=>r(l_(t,a_(t.scope,n,e)));if(ln(e))return Ri(e),un(e,i),d(e,t);let o=ui(e),s=or(o,o.map(i));return fn(e)?s:(s.lambdaDomain=e,ur(s))}let n=[],s=w_(i,(n,r)=>S_(i.length>1&&typeof e==`object`&&e.kind===`ProductSet`?e.factors[r]:e,n,t.environment.runtime.version));return E_(i,s,t.scope,e=>{let o=i.length===1?Iv(a.pattern,e)??!1:fi(i.map(t=>Iv(t.pattern,e)??!1));return n.push([o,r(l_(t,e))]),!1}),ti(n)},c=P_(i,e.body),l=L_(i),u=Bv(e.body),d=(t,n)=>{let a=Vv(n.scope,u),o=l_(n,a),s=j_({value:I_(t,e=>r(l_(o,k_(i,a,e))),F_(c,i,t),l),bounds:i,body:e.body,scope:a});return i.length===1?ur(s):s},f=t.callStack;return{build:(t,r)=>{if(e.isRecursive||n||r.isKeepLazy||!P(t))return d(t,r);if(!(i.length===1?fn(t):typeof t==`object`&&t.kind===`ProductSet`&&t.factors.every(fn))){if(f)return d(t,r);try{return s(t,r)}catch(e){if(!(e instanceof w))throw e;return d(t,r)}}if(!f)return s(t,r);try{return s(t,r)}catch(t){throw xv(f,e,t),t}},createLazy:d}},Wv=(e,t)=>{let n=Uv(e,t).build,r=e.bounds;if(r.length===1&&r[0].pattern.kind===`Name`){let e=Ev(r[0].set,t);return t=>n(e(t),t)}return e=>n(O_(r,e),e)},Gv=(e,t)=>{let n=Lv.has(e);n&&Rv(e.function);let r=Ev(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=>Ev(e,t))}),value:Ev(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):fi(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(l_(i,a_(i.scope,`@`,e))):ga(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i=!1;n=o(n,r.path,0,t,e=>(i=!0,r.value(e))),i||t.environment.runtime.warn(wt.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${U(e.function)}`)}return n}},Kv=(e,t)=>{let n=Ev(e.predicate,t),r=e.bound.pattern,i=qg(e.predicate),a=e.predicate.location.range&&{names:r.kind===`Name`?r.name:r.names.join(`, `),predicate:i},o=t.coverage,s=(e,t,n)=>{if(!o||e===-1)return n();t||o.secondary[e]++;let r=qo(o,t?-1:e,n);return!t&&r===!0&&o.secondary[e]++,r},c=(t,n,o,l)=>({kind:`FilteredSet`,base:t,test:(e,t)=>{if(r.kind===`Tuple`&&Ui(e)?.length!==r.names.length)throw new w(`Attempted to check if the value:\n${N(L(e))}\nis an element of a set of ${r.names.length}-tuples.`);let a=s(l,t,()=>o(l_(n,o_(n.scope,r,e))));if(typeof a!=`boolean`)throw new w(`${t?`The evaluation of predicate`:`Evaluating predicate`} ${i} yielded non-Boolean value.`);return a},source:a,rebind:r=>c(t,{...n,environment:r},Ev(e.predicate,r),-1)});return(e,t,r=-1)=>c(e,t,n,r)},qv=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${Os(e)}.\n${qg(t.predicate)}`);return e},Jv=(e,t,n,r)=>{if(!dn(e)||Kn(e))throw new w(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${U(t)}`);return Gr(e),S_(e,n,r)},Yv=e=>new w(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${U(e)}`),Xv=(e,t)=>{if(e.kind===`SetFilter`){let n=Ev(e.predicate,t),r=Ev(e.bound.set,t),i=Kv(e,t),a=e.bound.pattern,o=t.coverage;return t=>{let s=r(t);if(!fn(s))return i(s,t,o?.current);let c=[],l=r=>{let i=n(l_(t,o_(t.scope,a,r)));qv(i,e)&&cn(c,r)},u=s.kind===`Interval`?s:F(s).elements;return un(u,l),o&&o.current!==-1&&(o.secondary[o.current]+=(Array.isArray(u)?u.length:u.high-u.low+1)+c.length),ar(c)}}if(e.kind===`SetMap`){let n=Ev(e.expression,t);return t=>{let r=[];return D_(e.bounds,t,e=>(cn(r,n(l_(t,e))),!1)),Xr(r)}}let n=e.set;if(!n)return()=>{throw new w(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${U(e)}`)};let r=Ev(e.body,t),i=Ev(n,t);return t=>{let a=Jv(i(t),e,n,t.environment.runtime.version),o,s=e.pattern;if(C_(a,n=>{if(s.kind===`Tuple`&&Ui(n)?.length!==s.names.length)throw new w(`Attempted to compute the value of an expression of form\nCHOOSE <<x1, ... , xN>> \\in S: P, but S was not a set\nof N-tuples.\n${U(e)}`);let i=o_(t.scope,s,n);return m_(r(l_(t,i)),e)?(o=Iv(s,i),!0):!1}),o===void 0)throw Yv(e);return o}},Zv=e=>[...e].sort((e,t)=>$n(e.name,t.name)),Qv=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),$v=(e,t)=>{let n=Zv(e),r=e.map(e=>Ev(e.value,t));if(Qv(n))return t=>pi(e.map((e,n)=>[e.name,r[n](t)]));let i=n.map(e=>e.name),a=e.map(e=>e.name);if(a.some((e,t)=>e!==i[t])){let t=n.map(t=>e.indexOf(t));return e=>Cn(i,t,r.map(t=>t(e)),a)}return e=>mi(i,r.map(t=>t(e)))},ey=(e,t)=>{let n=e=>Ev(e,t);switch(e.kind){case`Number`:{let t=e.value;return _n(t)?()=>t:()=>{throw t_(e)}}case`Decimal`:return()=>{throw e_(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return Ov(e,t);case`Apply`:return Pv(e,t);case`Bracket`:return()=>{throw new w(`A bracket without a function or subscript is not an expression at ${Wg(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new w(`An operator cannot be used as a value at ${Wg(e)}`)};case`And`:{let r=e.operands.map(n);return Cv(e,r,t.callStack)??(t=>{for(let n=0;n<r.length;n++){let i=r[n](t);if(typeof i!=`boolean`)throw Yg(e,n,i);if(!i)return!1}return!0})}case`Or`:{let r=e.operands.map(n);return Cv(e,r,t.callStack)??(t=>{for(let n=0;n<r.length;n++){let i=r[n](t);if(typeof i!=`boolean`)throw Yg(e,n,i);if(i)return!0}return!1})}case`Prime`:{let t=n(e.expression);return e=>t(_v(e))}case`Unchanged`:return vv(n(e.expression));case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw Jg(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new w(`A non-boolean expression (${Os(t)}) was used as a condition of a CASE. ${qg(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new w(`Attempted to evaluate a CASE with no conditions true.\n${U(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(l_(n,dv(e.definitions,n)))}case`Forall`:case`Exists`:return Fv(e,t);case`UnboundedQuantifier`:return()=>{let t=e.quantifier===`Forall`?`\\A`:`\\E`;throw e.isTemporal?Kg(e.quantifier===`Forall`?`\\AA`:`\\EE`,e):new w(`TLC attempted to evaluate an unbounded ${t}.\nMake sure that the expression is of form ${t} x \\in S: P(x).\n${U(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Xv(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Xr(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>fi(t.map(t=>t(e)))}case`FunctionConstruction`:return Wv(e,t);case`FunctionSet`:{let t=n(e.domain),r=n(e.range);return e=>({kind:`FunctionSet`,domain:t(e),range:r(e)})}case`Record`:return $v(e.fields,t);case`RecordSet`:{let t=Zv(e.fields),r=t.map(e=>e.name),i=t.map(t=>e.fields.indexOf(t)),a=e.fields.map(e=>n(e.value));return i.every((e,t)=>e===t)?e=>({kind:`RecordSet`,names:r,sets:a.map(t=>t(e))}):e=>{let t=a.map(t=>t(e));return{kind:`RecordSet`,names:r,sets:i.map(e=>t[e])}}}case`Except`:return Gv(e,t);case`ExceptAt`:return t=>{let n=i_(t.scope,`@`);if(n?.kind!==`Value`)throw new w(`@ appears outside an EXCEPT at ${Wg(e)}`);return n.value};case`FunctionApplication`:{Rv(e.function);let r=n(e.function),i=t=>s_(r(c_(t)),e),a=e.args.map(n),o=Zg(t.runtime.version);if(a.length===1){let e=a[0];return t=>pa(i(t),e(t),o)}return e=>pa(i(e),fi(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=Xg(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=vv(n(e.subscript)),i=e.kind===`BoxAction`,a=i?`[A]_e`:`<A>_e`;return n=>{let o=t(n);if(typeof o!=`boolean`)throw new w(`Attempted to evaluate an expression of form ${a}, but A was not a boolean.\n${U(e)}`);return i?o||r(n):o&&!r(n)}}case`Enabled`:{let t=e.expression;return e=>Pg(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new w(`The subexpression reference at ${Wg(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw Kg(Gg[e.kind],e)}}},ty=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},ny=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Da(e[t]),16777619),r=Math.imul(r^Na(e[t]),1540483477);t[0]=ty(n)||1,t[1]=ty(r)},ry=()=>{let e=/* @__PURE__ */ new Int32Array(8192),t=0,n=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},r=()=>{let t=e,r=new Int32Array(t.length*2);for(let e=0;e<t.length;e+=2){if(t[e]===0)continue;let i=n(r,t[e],t[e+1]);r[i*2]=t[e],r[i*2+1]=t[e+1]}e=r};return{insert:(i,a)=>{t*4>=e.length&&r();let o=n(e,i,a);return e[o*2]!==i&&(e[o*2]=i,e[o*2+1]=a,t++,!0)}}},iy=e=>({slots:new Int32Array(1<<17),size:0,shift:16,states:e}),ay=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=va(t,Da(e[n]));return t&1073741823},oy=(e,t)=>{for(let n=0;n<t.length;n++)if(!yr(e[n],t[n]))return!1;return!0},sy=(e,t)=>Math.imul(t,2654435761)>>>e.shift<<1,cy=(e,t,n)=>{let r=e.slots.length-1;for(let i=sy(e,t);;i=i+2&r){let r=e.slots[i+1];if(r===0)return-1;if(e.slots[i]===t&&oy(e.states[r-1],n))return r-1}},ly=(e,t,n)=>{let r=e.slots.length-1,i=sy(e,t);for(;e.slots[i+1]!==0;)i=i+2&r;e.slots[i]=t,e.slots[i+1]=n},uy=(e,t,n)=>{if(e.size++,e.size*4>e.slots.length){let t=e.slots;e.slots=new Int32Array(t.length*2),e.shift--;for(let n=0;n<t.length;n+=2)t[n+1]!==0&&ly(e,t[n],t[n+1])}ly(e,t,n+1)},dy=(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}},fy=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),py=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return dy(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},my=e=>Atomics.load(e.used,0)*2>=e.slots.length,hy=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&dy(t,n);return{slots:t,used:e.used}},gy={kind:`Boolean`,value:!0},_y={kind:`Boolean`,value:!1},vy=e=>e?gy:_y,yy=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,by=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,xy=(e,t)=>({kind:e,body:t}),Sy=(e,t,n)=>({kind:e,operands:[t,n]}),Cy=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?Cy(e,t.operands).operands:[t])}),wy=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return wy(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,wy(t)),0)}},Ty=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 Ty(e.body);case`And`:case`Or`:return e.operands.some(Ty)}},Ey=/* @__PURE__ */ new WeakMap;let Dy=0;const Oy=e=>{let t=Ey.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`#${Dy++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(Oy).join(`,`)})`;default:return`${e.kind}(${Oy(e.body)})`}})();return Ey.set(e,n),n},ky=(e,t)=>e===t||Oy(e)===Oy(t),Ay=(e,t)=>{let n=Oy(t);return e.some(e=>e===t||Oy(e)===n)},jy=e=>e===`And`?`Or`:`And`,My=(e,t)=>{switch(e.kind){case`Boolean`:return t?vy(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?xy(`Not`,e):e;case`Not`:return My(e.body,!t);case`And`:case`Or`:return Cy(t?jy(e.kind):e.kind,e.operands.map(e=>My(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return xy(n,My(e.body,t))}}},Ny=e=>{switch(e.kind){case`Boolean`:return vy(!e.value);case`Not`:return e.body;case`And`:case`Or`:return Cy(jy(e.kind),e.operands.map(Ny));case`Always`:return xy(`Eventually`,Ny(e.body));case`Eventually`:return xy(`Always`,Ny(e.body));default:return xy(`Not`,e)}},Py=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Py(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return vy(t)}return n.length===0?vy(!t):n.length===1?n[0]:Cy(e.kind,n)}case`Not`:{let t=Py(e.body);return t.kind===`Boolean`?vy(!t.value):xy(`Not`,t)}case`Always`:case`Eventually`:{let t=Py(e.body);return xy(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Fy=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Iy=e=>{switch(e.kind){case`And`:{let t=[],n=1;for(let r of e.operands){let e=Iy(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n*=e.operands.length,n>2147483647))throw new w(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n===1)return{kind:`And`,operands:t};let r=Array.from({length:n},()=>[]),i=1,a=n;for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}a/=e.operands.length;let t=0;for(let n=0;n<i;n++)for(let n of e.operands)for(let e=0;e<a;e++)r[t++].push(n);i*=e.operands.length}return{kind:`Or`,operands:r.map(e=>Cy(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Iy(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Fy(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:Cy(`Or`,t);n.push(xy(`Always`,xy(`Eventually`,e)))}return Cy(`Or`,n)}case`Not`:return yy(e.body)?e:Iy(Ny(e.body));default:return e}},Ly=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Ly(e.operands[0]):Cy(e.kind,e.operands.map(Ly));case`Not`:return e.body.kind===`Not`?Ly(e.body.body):xy(`Not`,Ly(e.body));case`Always`:case`Eventually`:case`Next`:return xy(e.kind,Ly(e.body));default:return e}},Ry=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Ry(e.operands[0]);let t=Math.floor(e.operands.length/2);return Sy(e.kind,Ry(Cy(e.kind,e.operands.slice(0,t))),Ry(Cy(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return xy(e.kind,Ry(e.body));default:return e}},zy=(e,t)=>{e.kind===`Eventually`&&!Ay(t,e)&&t.push(e),`body`in e&&zy(e.body,t),`operands`in e&&e.operands.forEach(e=>zy(e,t))},By=e=>{let t=e.filter(by),n=e.flatMap(e=>e.kind===`Not`&&by(e.body)?[e.body]:[]);return!t.some(e=>Ay(n,e))},Vy=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,xy(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new w(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Hy=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:xy(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Uy=(e,t,n)=>e.flatMap(e=>{let r=Hy(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Wy=e=>[...new Set(e.map(Oy))].sort().join(`|`),Gy=(e,t)=>{let n=new Set(t.map(Wy));return[...e.filter(e=>!n.has(Wy(e))),...t]},Ky=e=>{let t=Vy(e),n=Uy(t,`Always`,`And`),r=Uy(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Hy(t,`Eventually`,`Or`);if(n&&!(Ay(e,n.first)||Ay(e,n.second)))return Gy(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Ay(e,t.first)||Ay(e,t.second))&&!Ay(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!By(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Hy(t[e],`Always`,`And`);n&&(Ay(t,n.first)||t.push(n.first),Ay(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)Ay(t,e.first)&&Ay(t,e.second)&&!Ay(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!By(t)?[]:i(t)};return a(e)},qy=e=>({particle:e,successors:[],statePredicates:e.filter(e=>wy(e)<=1)}),Jy=e=>{let t=Ky([e]).map(qy),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Wy(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 Ky(n)){let n=Wy(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(qy(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Yy=(e,t)=>!Ay(e,t)||Ay(e,t.body),Xy=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&wy(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Fy(e);if(n){let e=wy(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(Ty(e))throw new w(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Zy=(e,t)=>{let n=e.findIndex(e=>ky(e,t));return n===-1?(e.push(t),e.length-1):n},Qy=e=>{let t=Iy(Py(My(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Ly(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Xy(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:Cy(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:ky(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Ry(e.formula),n=[];t&&zy(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Zy(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Zy(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Zy(i,e))}));return{tableau:t&&Jy(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},$y=()=>x(new w(`Temporal formula is a tautology (its negation is unsatisfiable).`),S.livenessEvaluationFailure),eb=/* @__PURE__ */ new Set([`~>`,`-+->`]),tb=/* @__PURE__ */ new WeakSet,nb=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),rb=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),ib=(e,t)=>new w(`TLC cannot handle the temporal formula ${U(e)}${t===void 0?``:`:\n${t}`}`),ab=(e,t,n,r=/* @__PURE__ */ new Set,i=/* @__PURE__ */ new Set)=>{let a=(e,t,r)=>{if(i.has(e))return 0;i.add(e);let a=ab(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=i_(t,e);if(!n)return;if(n.kind===`Value`)return 0;if(n.kind===`Thunk`)return n.isReleased?0:a(n,n.expression,n.scope);let r=n.operator;return r.kind===`Closure`?a(r,r.body,r.scope):0},s=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=h_(e,n);if(t)return mf(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isActionLevel?2:r.isStateLevel&&!r.isLevelConstant?1:0},c=(e,t)=>r.has(e)?0:M(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return pu(e,(e,o)=>(a=Math.max(a,ab(e,t,n,o.length===0?r:/* @__PURE__ */ new Set([...r,...o]),i)),e)),a};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:l(e);case`Identifier`:return c(e.name,e);case`OperatorReference`:return c(e.operator,e);case`Apply`:{if(eb.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=M(e)?void 0:J_(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,sv(o,e.args,rb(n,t)))}default:return l(e)}},ob=(e,t)=>{try{return T_(e,t)}catch(e){if(!(e instanceof w))throw e;if(!Ft(e))return;throw x(new w(`${a}${e.message}`),S.error)}},sb=(e,t,n,r,i={name:void 0,path:[],expanding:/* @__PURE__ */ new Set,isSubstituted:!1})=>{let a=(e,t,a=i.name,o=i.expanding,s)=>sb(e,t,n,r,{name:a,path:s?.kind===`Operator`&&s.params.length===0?[...i.path,s.name]:i.path,expanding:o,isSubstituted:i.isSubstituted||s!==void 0&&n.substitutedDefinitions.has(s)});if(e.kind===`And`)return e.operands.flatMap(e=>a(e,t,U(e)));if(e.kind===`Label`)return a(e.body,t);if(e.kind===`Let`)return a(e.body,cb(e,t,n));if(e.kind===`Identifier`){let r=M(e)?i_(t,e.name):void 0;if(r?.kind===`Thunk`&&!r.isReleased)return a(r.expression,r.scope,tb.has(r)?e.name:i.name);let o=n.constants.has(e.name)?void 0:h_(e.name,n);if(!r&&o?.kind===`Operator`&&o.params.length===0&&(mf(o,n)>0||U_(o,n)===void 0)){if(i.expanding.has(o))throw m();return a(o.body,void 0,!i.isSubstituted&&n.instanceNames.get(e.name)||o.name,/* @__PURE__ */ new Set([...i.expanding,o]),o)}}let o=rb(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||ab(e,t,n)===3)){let t=Y_(e,o),r=M(e)?void 0:h_(e.operator,n),s=t?.kind===`Closure`&&t.params.every(e=>n.instanceParams.has(e));if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&(!i.isSubstituted||s))return a(t.body,sv(t,e.args,o),i.isSubstituted&&r?r.name:e.operator,i.expanding,r)}let s=r&&e.kind===`Forall`&&e.bounds.every(e=>ab(e.set,t,n)===0),c=s?ob(e.bounds,o):void 0;if(s&&c){let n=[];if(E_(e.bounds,c,t,t=>(n.push(...a(e.body,t,U(e.body))),!1)),n.length===0)throw $y();return n}return[{expression:e,scope:t,name:i.name,path:i.path}]},cb=(e,t,n)=>{let r=dv(e.definitions,rb(n,t),pv(e.definitions,n));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&tb.add(e.binding);return r},lb=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,a=(e,t,i)=>{let a=i===0&&!r?ab(e,t,n):i;if(a===0){let r=W(e,rb(n,t));if(typeof r!=`boolean`)throw new w(`TLC expected a boolean value, but did not find one. ${qg(e)}`);return vy(r)}return a===1?{kind:`State`,expression:e,scope:t}:e.kind===`AngleAction`?{kind:`Action`,expression:e.action,subscript:e.subscript,scope:t}:{kind:`Action`,expression:e,subscript:void 0,scope:t}},o=0,s=(e,t,r,i)=>{if(o>=100)throw m();o++;let s=p(e,t);o--;let c=wy(s),l=c===0&&ab(r,i,n)>2;return c>2||l?s:a(r,i,c)},c=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=rb(n,t),o=M(e)||h_(i,n)===void 0?i_(t,i):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&tb.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:M(e)?X_(i,a):J_(i,n),u=e.kind===`Apply`?e.args:[],f=c?.kind===`Builtin`&&u.length===2?nb.get(c.name):void 0;if(f){let n=u.map(e=>p(e,t));return d(e,t,Cy(f,n))}if(c?.kind!==`Closure`)throw ib(e);let m=!M(e)&&h_(i,n)?.isRecursive===!0;return l(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),s(c.body,sv(c,u,a),e,t)),m)},l=(e,t,n=!1)=>{try{return t()}catch(t){let a=t instanceof i||n&&!r;throw!(t instanceof w)||a?t:ib(e)}},u=(e,t)=>{let r=ab(e,t,n),o=[],s=e.kind===`Forall`;try{D_(e.bounds,rb(n,t),t=>(o.push(p(e.body,t)),!1))}catch(n){if(!(n instanceof w)||n instanceof i)throw n;if(r<=2)return a(e,t,r);throw ib(e,s&&!Ft(n)?n.message:void 0)}return o.length===0?vy(s):d(e,t,Cy(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=wy(n);return r>2?n:a(e,t,r)},f=(e,t)=>{let n=e.operands,r=e.location.range,i=e.prefixEnds;return e.isBulleted||!r||!i?d(e,t,Cy(e.kind,n.map(e=>p(e,t)))):n.slice(1).reduce((a,o,s)=>{let c=s===n.length-2?e:{...e,operands:n.slice(0,s+2),prefixEnds:i.slice(0,s+1),location:{...e.location,range:{...r,end:i[s]}}};return d(c,t,Cy(e.kind,[a,p(o,t)]))},p(n[0],t))},p=(e,t)=>{let i=ab(e,t,n);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,cb(e,t,n));case`Apply`:{let n=e.args;if(e.operator===`~`&&!M(e))return d(e,t,xy(`Not`,p(n[0],t)));if(e.operator===`=>`)return d(e,t,Sy(`Or`,xy(`Not`,p(n[0],t)),p(n[1],t)));break}case`And`:case`Or`:return f(e,t);case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!r&&ab(e.condition,t,n)===0){let r=W(e.condition,rb(n,t));if(typeof r==`boolean`)return p(r?e.consequent:e.alternative,t)}let i=p(e.condition,t);return d(e,t,Sy(`Or`,Sy(`And`,i,p(e.consequent,t)),Sy(`And`,xy(`Not`,i),p(e.alternative,t))))}}if(i<=2)return a(e,t,i);switch(e.kind){case`Identifier`:return c(e,t);case`Apply`:return e.operator===`~>`?xy(`Always`,Sy(`Or`,xy(`Not`,p(e.args[0],t)),xy(`Eventually`,p(e.args[1],t)))):c(e,t);case`Always`:case`Eventually`:return xy(e.kind,p(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=xy(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?xy(`Always`,xy(`Eventually`,Sy(`Or`,i,a))):Sy(`Or`,xy(`Eventually`,xy(`Always`,i)),xy(`Always`,xy(`Eventually`,a)))}default:throw ib(e)}};return p(e,t)},ub=e=>({holdsState:(t,n)=>{let r={environment:e,scope:t.scope,state:n,next:void 0},i=t.kind===`State`?W(t.expression,r):Pg(t.step,r);if(typeof i!=`boolean`)throw new w(`A state predicate was evaluated to a non-boolean value.`);return i},holdsAction:(t,n,r)=>{let i=t.scope,a=t.subscript;if(a&&Kr(W(a,{environment:e,scope:i,state:n,next:void 0}),W(a,{environment:e,scope:i,state:r,next:void 0})))return!1;let o=W(t.expression,{environment:e,scope:i,state:n,next:r});if(typeof o!=`boolean`)throw new w(`Encountered an action predicate that's not a boolean.`);return o}}),db=(e,t,n,r,i)=>{let a=e=>db(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=r.holdsState(e,t);return i.set(e,a),a}case`Action`:return e.enabled&&i.get(e.enabled)===!1?!1:n!==void 0&&r.holdsAction(e,t,n);case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return db(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new w(`TLC cannot evaluate a temporal formula in a single step`)}},fb=(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)=>fb(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 db(e,t[r],t[a(r)],ub(i),/* @__PURE__ */ new Map)}},pb=`UnnamedAction`,mb={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},hb=e=>{let t=e.range??mb;return pi([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},gb=(e,t)=>{let n=[[`name`,e.name],[`location`,hb(e.location)]];return e.parameters.length>0&&n.push([`context`,pi(e.parameters)],[`parameters`,fi(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),pi(n)},_b=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),vb=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),yb=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,bb=e=>e.kind===`Apply`?e.args:[],xb=(e,t,n)=>{let r=yb(e);if(r===void 0)return;if(M(e)){let e=i_(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=J_(r,n);return i?.kind===`Closure`?i:void 0},Sb=(e,t)=>{try{return W(e,vb(t,void 0)),!0}catch(e){if(e instanceof v)return!1;throw e}},Cb=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&uf(e,t)&&Sb(e.body,t),wb=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&Cb(e,t),Tb=(e,t)=>{let n=h_(e.name,t);return n?.body===e.body&&wb(n,t)},Eb=(e,t)=>{if(e.kind!==`Identifier`||!M(e))return;let n=i_(t,e.name);return n?.kind===`Thunk`?n:void 0},Db=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:cb(e,t,n)};let r=Eb(e,t);return r&&{expression:r.expression,scope:r.scope}},Ob=(e,t,n,r)=>t.kind===`Apply`?sv(e,t.args,vb(r,n)):e.scope,kb=(e,t)=>(e?.params??[]).flatMap(e=>{let n=i_(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Ab=(e,t)=>{try{return e()}catch(e){if(e instanceof v)return t();throw e}},jb=(e,t,n,r,i)=>{let a=bb(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return r&&a.length===0?[{...e,parameters:[],expression:r.body,scope:r.scope}]:r?a.some(e=>ab(e,n,i)!==0)?o():Ab(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,vb(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},Mb=(e,t,n,r,i)=>{let a=()=>({name:n?.name??pb,location:e.location,parameters:kb(n,t),expression:e,scope:t});if(Ch.has(e.kind))throw x(new w(`${l}The next state relation is not a boolean expression.\n${qg(e)}`),S.error);switch(e.kind){case`Let`:return Mb(e.body,cb(e,t,r),n,r,i);case`Label`:return Mb(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>Mb(e,t,n,r,i));case`Exists`:return Ab(()=>{let o=[];return D_(e.bounds,vb(r,t),t=>(o.push(...Mb(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=M(e)?void 0:i.get(yb(e)??``),s=xb(e,t,r);if(o)return jb(o,e,t,s,r);if(!s)return[a()];let c=bb(e),u=M(e)?s.name:r.instanceNames.get(yb(e)??``)??s.name,d=()=>[{name:u,location:e.location,parameters:[],expression:e,scope:t}];return Tb(s,r)||c.some(e=>ab(e,t,r)!==0)?d():Ab(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:W(n,vb(r,t))},parent:e}),s.scope);return Mb(s.body,e,{...s,name:u},r,i)},d)},Nb=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>Nb(e,t,n,r,i,o),s=(e,t,n)=>_b(e,ou(t,a),n),c=Db(e,t,n);if(c){o(c.expression,c.scope);return}let l=xb(e,t,n);if(l&&Tb(l,n))return;let u=l?[...a,...au.get(l.body)??[]]:a;if(l&&l.params.length===0){if(ab(l.body,l.scope,n)===1){r.inits.push(s(l.name,l.body,l.scope));return}o(l.body,l.scope,u);return}if(l&&e.kind===`Apply`&&l.params.length===e.args.length){o(l.body,sv(l,e.args,vb(n,t)),u);return}if(e.kind===`And`){e.operands.forEach(e=>o(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t,frames:a});return}r.temporals.push(s(pb,e,t));return}let d=ab(e,t,n);d<=1?r.inits.push(s(pb,e,t)):d===3&&r.temporals.push(s(pb,e,t))},Pb=(e,t,n,r,i)=>{let a=(t,n)=>Pb(e,t,n,r,i),o=Db(t,n,r);if(o){a(o.expression,o.scope);return}let s=xb(t,n,r);if(s&&Tb(s,r))return;if(s&&s.params.length===bb(t).length){a(s.body,Ob(s,t,n,r));return}if(t.kind===`Forall`&&Ab(()=>(D_(t.bounds,vb(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(_b(e,a)):ab(a,n,r)<2?i.invariants.push(_b(e,a)):i.impliedTemporals.push(_b(e,t));return}let c=ab(t,n,r);c<=1?i.impliedInits.push(_b(e,t)):c===3&&i.impliedTemporals.push(_b(e,t))},Fb=(e,t)=>{let n=h_(e,t);return n?.kind===`Operator`&&!wb(n,t)?n:void 0},Ib=(e,t,n)=>{let r={inits:[],actions:[],temporals:[]},i=[],a=e.specification===void 0?void 0:Fb(e.specification,t);a&&(Nb(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:pb,location:e.frames[0].location,parameters:[],expression:ou(e.expression,e.frames),scope:e.scope}]:Mb(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:J_(e.init,t);o?.kind===`Closure`&&r.inits.push(_b(e.init??``,o.body));let s=e.next===void 0?void 0:J_(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Mb(s.body,s.scope,s,t,n)),r},Lb=(e,t,n)=>{let r=[],i=(e,t)=>{if(e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`)return!1;if(e.kind===`Tuple`)return e.elements.every(e=>i(e,t));if(e.kind===`Label`)return i(e.body,t);let a=Db(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&M(e)?i_(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!M(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=xb(e,t,n);if(!s||s.params.length!==bb(e).length)return!0;let c=h_(s.name,n);return c?.body===s.body&&Cb(c,n)?!0:i(s.body,Ob(s,e,t,n))};return i(e,t)?r:void 0},Rb=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>L(e[1])).join(`,`)})`,zb=(e,t,n=!1)=>`${e.name===pb?n?`Initial predicate`:`Action`:e.name}${t===`1.7.4`?``:Rb(e)} ${g(e.location.range??mb)}`,Bb=e=>`${e.name}${Rb(e)}`,Vb=(e,t,n,r)=>{let i={invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]};t.invariants.forEach(e=>{let t=Fb(e,n);t&&i.invariants.push(_b(e,t.body))}),t.properties.forEach(e=>{let t=Fb(e,n);t&&Pb(e,t.body,void 0,n,i)});let a=n.coverage,o=(e,t)=>Yr(e.map(e=>{let n=a&&t&&ls(a,t,e.expression);return gb(e,n&&pi(n))})),s=e=>Yr(e.flatMap(e=>{let t=Fb(e,n);return t?[pi([[`name`,t.name],[`location`,hb(t.location)]])]:[]}));return pi([[`inits`,o(e.inits,`init`)],[`actions`,o(e.actions,`next`)],[`temporals`,o(e.temporals)],[`invariants`,o(i.invariants,`invariant`)],[`impliedinits`,o(i.impliedInits,`implied`)],[`impliedactions`,o(i.impliedActions,`implied`)],[`impliedtemporals`,o(i.impliedTemporals)],[`variables`,Yr(n.variables.map((e,t)=>pi([[`name`,e],[`location`,hb(r[t])],...a?[[`coverage`,pi([[`distinct`,Zo(a,t)]])]]:[]])))],[`actionconstraints`,s(t.actionConstraints)],[`constraints`,s(t.constraints)]])},Hb=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return Hb(e.body);case`And`:case`Or`:return e.operands.some(Hb);default:return!1}},Ub=e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0,Wb=e=>e.promises.some(e=>Hb(e.body))||e.models.some(e=>!Ub(e)),Gb=(e,t)=>e.every((e,n)=>yr(e,t[n])),Kb=e=>e.filter((t,n)=>n===0||e[n-1]!==t),qb=e=>({data:e(1024),length:0,create:e}),Jb=(e,t,n,r=0,i=n.length-r)=>{let a=t+i;if(a>e.data.length){let t=e.create(Math.max(2*e.data.length,a));t.set(e.data),e.data=t}for(let a=0;a<i;a++)e.data[t+a]=n[r+a];e.length=Math.max(e.length,a)},Yb=(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}},Xb=e=>new Int32Array(e).fill(-1),Zb=(e,t)=>(e.edgeStarts[t]??-1)!==-1,Qb=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},$b=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,ex=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.edgeStarts.push(-1),e.edgeCounts.push(0),e.nextSiblings.push(-1),e.nodeStates.length-1),tx=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},nx=2**53-1,rx=(e,t,n)=>{let r=t.map(e=>lb(e.expression,e.scope,n)),i=e.map(e=>xy(`Not`,lb(e.expression,e.scope,n))),a=i.length===1?i[0]:Cy(`Or`,i);return{formula:r.length===0?a:Cy(`And`,[...r,a]),negations:i}},ix=e=>{switch(e.kind){case`State`:return[e];case`Enabled`:return[{expression:e.step,scope:e.scope}];case`Action`:return[e.expression,e.subscript].flatMap(t=>t?[{expression:t,scope:e.scope}]:[])}},ax=(e,t)=>{switch(e.kind){case`Boolean`:return;case`State`:case`Enabled`:case`Action`:t.add(e);return;case`And`:case`Or`:e.operands.forEach(e=>ax(e,t));return;default:ax(e.body,t)}},ox=e=>{let t=/* @__PURE__ */ new Set;for(let n of e)[...n.stateChecks,...n.actionChecks,...n.tableau?.nodes.flatMap(e=>e.statePredicates)??[]].forEach(e=>ax(e,t));return[...t]},sx=e=>ox(e).flatMap(e=>ix(e).map(e=>e.expression)),cx=(e,t,n,r)=>{if(e.length===0)return;let i=rx(e,t,n),a=/* @__PURE__ */ new Set;ax(i.formula,a);let o=[...a].flatMap(ix),s=o.every(e=>e.scope===void 0)?!ff(o.map(e=>e.expression),n,`repeated`):!hv(n),c={environment:n,atoms:ub(n)},l=Qy(i.formula),u=lx(l,{atoms:{holdsState:(e,t)=>c.atoms.holdsState(e,t),holdsAction:(e,t,n)=>c.atoms.holdsAction(e,t,n)},isShared:s,isSame:Gb,evaluateFrom:(e,t)=>{n.runtime.setLivenessSource(e);try{return t()}finally{n.runtime.setLivenessSource(void 0)}}},r,n.runtime.version!==`1.7.4`),d=(e,t)=>{if(e===void 0)return t();c.atoms=ub(e);try{return t()}finally{c.atoms=ub(n)}};return{branches:u.branches,solutions:l,addInitialState:(e,t,n)=>d(n,()=>u.addInitialState(e,t)),addState:(e,t,n,r)=>d(r,()=>u.addState(e,t,n,r!==void 0)),storeState:u.storeState,getStateCounts:u.getStateCounts,findViolation:u.findViolation,getViolatedProperties:(t,r)=>[...new Set(e.filter((e,a)=>!fb(i.negations[a].body,t,r,0,n)).map(e=>e.name))]}},lx=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map,a=1,o=t.isShared,s=t.atoms,c=t.evaluateFrom,l=/* @__PURE__ */ new Map,u=[],d=e=>{let t=l.get(e)??l.size;return l.set(e,t),u[t]=e,t},f=e=>{if(e.kind===`State`||e.kind===`Enabled`)return[d(e)*2+1];if(e.kind===`Not`){let t=e.body;return t.kind===`State`||t.kind===`Enabled`?[d(t)*2]:void 0}if(e.kind!==`And`)return;let t=e.operands.map(f);return t.every(e=>e!==void 0)?t.flat():void 0},p=e=>new Int8Array(e*l.size).fill(-1),m=e=>new Int8Array(e*i.size).fill(-1),h=(e,t,n,r,i)=>o?e(t,n,r,i):e(t,p(1),0,i),g=e=>{switch(e.kind){case`Boolean`:{let t=e.value;return()=>t}case`State`:case`Enabled`:{let t=d(e);return(n,r,i)=>(r[i+t]===-1&&(r[i+t]=+!!s.holdsState(e,n)),r[i+t]===1)}case`Action`:{let t=e.enabled&&d(e.enabled);return(n,r,i,a)=>(t===void 0||r[i+t]!==0)&&a!==void 0&&s.holdsAction(e,n,a)}case`Not`:{let t=g(e.body);return(e,n,r,i)=>!t(e,n,r,i)}case`And`:{let t=e.operands.map(g);return(e,n,r,i)=>t.every(t=>t(e,n,r,i))}case`Or`:{let t=e.operands.map(g);return(e,n,r,i)=>t.some(t=>t(e,n,r,i))}case`Next`:{let t=g(e.body);return(e,n,r,i)=>t(i??e,p(1),0,void 0)}case`Always`:case`Eventually`:return()=>{throw new w(`TLC cannot evaluate a temporal formula in a single step`)}}},_=e.map(e=>({solution:e,checks:{states:e.stateChecks.map(g),actions:e.actionChecks.map(g),nodes:e.tableau?.nodes.map(e=>{let t=o?f({kind:`And`,operands:e.statePredicates}):void 0;return t?Int32Array.from(t):e.statePredicates.map(g)})??[]},actionIds:Int32Array.from(e.actionChecks,e=>{let t=Oy(e),n=i.get(t)??i.size;return i.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:qb(e=>new Int32Array(e)),edgeActions:qb(e=>new Uint8Array(e)),stateResults:qb(e=>new Uint8Array(e)),initial:[],firstNodes:qb(Xb),lastNodes:qb(Xb),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],stateCount:0,errorNode:void 0})),v=(e,t,n,r,i)=>c(t,()=>{let t=e.checks.states,a=new Uint8Array(t.length);return t.forEach((e,t)=>{a[t]=+!!h(e,n,r,i)}),a}),y=(e,t,n,r,i,a,s,l,u,d)=>c(t,()=>{let t=e.checks.actions;for(let c=0;c<t.length;c++){if(!o){u[d+c]=+!!h(t[c],n,r,i,a);continue}let f=l+e.actionIds[c];s[f]===-1&&(s[f]=+!!t[c](n,r,i,a)),u[d+c]=s[f]}}),ee=(e,t,n,r,i)=>{let a=e.checks.nodes[t];if(!(a instanceof Int32Array))return a.every(e=>h(e,n,r,i));for(let e=0;e<a.length;e++){let t=a[e],o=i+(t>>1);if(r[o]===-1&&(r[o]=+!!s.holdsState(u[t>>1],n)),r[o]!==(t&1))return!1}return!0},b=(e,t,n,r,i,a)=>c(n,()=>ee(e,t,r,i,a)),x=(e,t)=>{if(!r)return!1;let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},te=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=Yb(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},S=(e,t,n,r)=>{let 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),Yb(i,e[t]-1,e[t+1]))}if(i.slots.set([t+1,n,r],Yb(i,t,n)),t<0)return r;let a=e.lastNodes.data[t]??-1;return a===-1?Jb(e.firstNodes,t,[r]):e.nextSiblings[a]=r,Jb(e.lastNodes,t,[r]),r},ne=(e,t)=>t<0?e.checks.nodes.some((n,r)=>te(e,t,r)!==void 0):e.isDone[t]===!0||(e.firstNodes.data[t]??-1)!==-1,C=(e,t,n)=>(ne(e,t)||e.stateCount++,S(e,t,n,ex(e,t,n))),re=(e,t,n,r,i,a)=>{let o=e.edgeTargets.length,s=e.solution.actionChecks.length;Jb(e.edgeTargets,o,n),i.forEach((t,n)=>Jb(e.edgeActions,(o+n)*s,r,t*s,s)),Jb(e.stateResults,e.nodeStates[t]*a.length,a),e.edgeStarts[t]=o,e.edgeCounts[t]=n.length},T={slots:/* @__PURE__ */ new Int32Array},ie=(e,r,i)=>{let o=[...i,{index:e,state:r}],s=16*a;T.slots=T.slots.length===s?T.slots.fill(0):new Int32Array(s);let c=e=>{let r=T.slots,i=o[e];for(let a=(n.getFingerprint(i)&2147483647)%r.length;;a=(a+1)%r.length){let n=r[a];if(n===0)return r[a]=e+1,!0;let s=o[n-1];if(s.index===i.index&&t.isSame(s.state,i.state))return!1}},l=0;for(let e=0;e<o.length;e++){if(l>=T.slots.length>>1){let e=T.slots;T.slots=new Int32Array(2*e.length+1);for(let t of e)t!==0&&c(t-1)}c(e)&&l++}T.slots.length>s&&a++;let u=[];for(let e of T.slots)e!==0&&u.push(o[e-1]);return u},ae=(e,t,r,a,o,s,c)=>{let l=v(e,a,r,s,c),u=t.nodes[e.nodeTableaux[o]],d=e.checks.actions.length,f=[],h=[],g=new Uint8Array(d);u.successors.length>0&&y(e,a,r,s,c,r,m(1),0,g,0);for(let n of u.successors){if(!b(e,n,a,r,s,c))continue;if(x(t,n)&&e.errorNode===void 0&&e.solution.models.some(Ub)){e.errorNode=o;return}let i=te(e,a,n);if(i!==void 0&&h.includes(i))continue;let l=i??C(e,a,n);h.push(l),f.push(0),i===void 0&&ae(e,t,r,a,l,s,c)}let _=[g],ee=1;if(n.forEachActionSuccessors(a,r,n=>{let o=m(n.length),l=new Uint8Array(n.length*d);_.push(l);for(let m=0;m<n.length;m++){let g=n[m],_=p(1);y(e,a,r,s,c,g.state,o,m*i.size,l,m*d);let v=e.isDone[g.index]===!0;for(let n of u.successors){if(!b(e,n,a,g.state,_,0))continue;let r=te(e,g.index,n);if(r!==void 0&&h.includes(r))continue;let i=r??C(e,g.index,n);h.push(i),f.push(ee+m),r===void 0&&v&&ae(e,t,g.state,g.index,i,_,0)}}ee+=n.length}),h.length>0){let t=new Uint8Array(ee*d);for(let e=0,n=0;e<_.length;e++)t.set(_[e],n),n+=_[e].length;re(e,o,h,t,f,l)}},oe=(e,t,n,r,i,a,o)=>{let s=l.size,u=new Uint8Array(t.nodes.length*n.length);c(o,()=>{for(let i=0;i<t.nodes.length;i++)for(let t=0;t<n.length;t++)ee(e,i,n[t].state,r,t*s)&&(u[i*n.length+t]=1)}),ne(e,o)||e.stateCount++,e.isDone[o]=!0;for(let c of tx(e,o)){let o=[],l=[];n.forEach((i,a)=>{let d=e.isDone[i.index]===!0;for(let f of t.nodes[e.nodeTableaux[c]].successors){if(u[f*n.length+a]===0)continue;let c=te(e,i.index,f);if(c!==void 0&&o.includes(c))continue;let p=c??C(e,i.index,f);o.push(p),l.push(a),c===void 0&&d&&ae(e,t,i.state,i.index,p,r,a*s)}}),re(e,c,o,i,l,a)}return e.errorNode===void 0?void 0:le(e,e.errorNode)},se=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)ex(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,n)=>{Zb(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n))}),Zb(e,i)||e.stateCount++,re(e,i,a,n,o,r)},ce=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)Zb(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 Qb(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}Zb(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new w(`Couldn't re-create liveness trace (path) starting at: ${t}`)},le=(e,t)=>Kb(ce(e,t).reverse().map(t=>e.nodeStates[t])),E=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.edgeActions.data[(e.edgeStarts[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=>Zb(e,t)),c=[],l=t=>{let n=Qb(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&Yy(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=nx;return}let d=/* @__PURE__ */ new Set,p=/* @__PURE__ */ new Map;for(let t=s;;t=c.pop()??r){d.add(t);let n=p.get(e.nodeStates[t]);if(n?n.push(t):p.set(e.nodeStates[t],[t]),o[t]=nx,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>$b(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>Qb(e,n).some((e,r)=>d.has(e)&&a(n,r)&&i(n,r,t)))),g=n.promises.every(e=>[...d].some(t=>u(t,e)));if(m&&h&&g)return f(r,d,p)},f=(r,o,s)=>{let c=le(e,r),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g=f.length+m.length+h.length,_=r,v=e=>{l.push(_),_=e};for(;g>0;){let r=g;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&$b(e,_,t)&&(f[n]=!0,g--)}),n.promises.forEach((e,t)=>{!h[t]&&u(_,e)&&(h[t]=!0,g--)}),!(g<=0);){let n=-1,c=-1,u=g;if(Qb(e,_).some((r,l)=>{if(s.has(e.nodeStates[r])){if(!o.has(r)||!a(_,l))return!1;n=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(_,l,e)&&(m[t]=!0,g--)})}return g<u?(v(r),d.clear(),!0):(o.has(r)&&!d.has(r)&&(c=r),!1)}))break;if(g<r){v(n),d.clear();break}for(;c===-1;){let t=l.pop();if(t===void 0)throw new w(`TLC failed to build the counterexample of a liveness property`);_=t,c=Qb(e,t).find(e=>o.has(e)&&!d.has(e))??-1}v(c),d.add(c)}}let y=p(r,_,s);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];y[y.length-1]!==n&&y.push(n)}let ee=c[c.length-1];return y[y.length-1]===ee&&y.pop(),{prefix:c.slice(0,-1),cycle:[ee,...y.reverse()],isCycleConstrained:Wb(n)}},p=(t,n,r)=>{if(n===t)return[];let i=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([i]),c=[];for(let n=i,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of Qb(e,u).entries()){if(f===u||!a(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==i;)e.push(t),t=r,r=o.get(t)??-1;return e.push(i),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 w(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<s.length;t++){let n=[s[t],-1,0],r=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=d(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,n.push(t,l,-42),c.push(l);let u=r++;Qb(e,l).forEach((t,r)=>{Zb(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u=Math.min(u,o[t]):o[t]===-1&&s.push(t))}),n.push(u)}}};return{branches:_.length,addInitialState:(e,t)=>{let n=p(1);for(let r of _){let i=r.solution.tableau;if(!i)r.initial.push(e);else for(let a=0;a<i.initialCount;a++)b(r,a,void 0,t,n,0)&&r.initial.push(te(r,e,a)??C(r,e,a))}},addState:(e,t,n,r)=>{let a=ie(e,t,n),o=p(a.length),s=a.findIndex(t=>t.index===e)*l.size,c=m(a.length);for(let n of _){let l=n.checks.actions.length,u=new Uint8Array(a.length*l);a.forEach((r,a)=>y(n,e,t,o,s,r.state,c,a*i.size,u,a*l));let d=v(n,e,t,o,s),f=n.solution.tableau;if(r&&(f?tx(n,e).some(e=>n.edgeCounts[e]>0):a.every(e=>Zb(n,e.index))))throw new w(`The behavior graph holds every edge of the state already.`);if(!f){se(n,a,u,d,e);continue}let p=oe(n,f,a,o,u,d,e);if(p)return p}},storeState:(e,t)=>{for(let n of _){let r=n.solution.tableau;if(!r)continue;let i=[];for(let t=0;t<r.nodes.length;t++){let r=te(n,e,t);r!==void 0&&i.push(r)}for(let e of i.sort((e,t)=>e-t))n.nodeStates[e]=t,S(n,t,n.nodeTableaux[e],e)}},getStateCounts:()=>_.map(e=>e.stateCount),findViolation:()=>{for(let e of _)for(let t of e.solution.models){let n=E(e,t);if(n)return n}}}},ux=e=>{switch(e.kind){case`Number`:if(!_n(e.value))throw x(new t(`TLC can't handle a number this big.\n${e.value}`),S.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return nr(e.name);case`Set`:return F({kind:`MixedSet`,elements:e.elements.map(ux)})}},dx=e=>{try{return ux(e)}catch(e){throw!(e instanceof w)||e instanceof t||e instanceof f?e:x(new w(`${l}${e.message}`),S.error)}},fx=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>L(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new w(`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`)&&_r(t,r)})});if(t)return t[1];throw new w(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:L(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},px=e=>new C(`In the configuration file, the identifier ${e} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`),mx=(e,t)=>{let n=e=>t.root.visible.get(e)?.key??e,r=t.root.constants.map(e=>e.name),i=t.root.variables,a=e=>{let n=t.moduleSymbols.get(e.module??``)?.get(e.name);return n?.kind===`Definition`?n:void 0},o=e=>{if(e.module===void 0)return[e.name,n(e.name)];let t=a(e);return t?[t.key]:[]},s=e=>e.module===t.root.module.name?[]:o(e),c=e=>{let n=t.definitions.get(e);return n?.kind===`Operator`?n.params.length:t.root.constants.find(t=>t.name===e)?.arity??t.builtins.get(e)?.arity??0},l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Set,d=(e,n)=>{t.builtins.set(e,n),t.definitions.delete(e),l.delete(e),u.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=dx(e.value);Wr(t),s(e).forEach(e=>{let n=c(e);n===0?l.set(e,t):d(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let f=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=f.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new C(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(ux),ux(e.value)]),f.set(t,n)}),f.forEach(e=>s(e).forEach(t=>d(t,fx(e.name,c(t),e.rows))));let p=new Map(e.substitutions.flatMap(e=>o(e).map(t=>[t,n(e.target)])));[...p.keys()].forEach(e=>l.delete(e));let m=(e,a,o)=>{let s=n(a),c=t.definitions.get(s);if(!(c!==void 0||t.builtins.has(s)||l.has(s)||r.includes(a)||i.includes(a)))throw new C(`The configuration file substitutes for ${e} with the undefined identifier ${a}.`);if(c?.kind===`Operator`&&c.params.length!==o)throw new C(`The configuration file substitutes for ${e} with ${a} of different number of arguments.`)};e.substitutions.filter(e=>e.module===void 0).forEach(n=>{let i=n.name,a=n.target;if(!r.includes(i)&&!t.root.visible.has(i))throw new C(`In the configuration file, the identifier ${i} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===a))throw px(a);m(i,a,t.root.constants.find(e=>e.name===i)?.arity??t.root.visible.get(i)?.arity)});let h=e.substitutions.filter(e=>e.module!==void 0);[...t.moduleSymbols.keys()].forEach(e=>{let t=h.filter(t=>t.module===e);t.forEach(e=>{let n=a(e);if(n){if(t.some(t=>t.name===e.target))throw px(e.target);m(e.name,e.target,n.arity)}});let n=t.find(e=>!a(e));if(n)throw new C(`In the configuration file, the identifier ${n.name} does not appear in the specification.`)});let g=h.find(e=>!t.moduleSymbols.has(e.module??``));if(g)throw new C(`In the configuration file, the module name ${g.module} is not a module in the specification.`);let _=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(s)),v=(e,n)=>{if(_.has(e))return{key:e,prefix:n};let r=t.copySources.get(e);return r&&v(r.source,n+r.prefix)};t.copySources.forEach((e,n)=>{let r=v(e.source,e.prefix),i=t.definitions.get(n);if(!r||!i)return;let a=i.kind===`Operator`?i.params:[],o=Nu(n,r.key,a,a.slice(r.prefix),i.location);t.definitions.set(n,o),t.root.visible.forEach((e,r)=>{e.key===n&&r!==n&&t.definitions.set(r,o)})}),t.operatorConstants.forEach((e,t)=>l.set(t,e));let y=r.filter(e=>!l.has(e)&&!p.has(e)&&!u.has(e));if(y.length>0){let e=t.order.getDeclarationOrder(`constant`).find(e=>y.includes(e))??y[0];throw new C(`The constant parameter ${e} is not assigned a value by the configuration file.`)}return{constants:l,substitutions:p}},hx=`tlc2/value/impl/`,gx={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},_x={iconstM1:2,iconst0:3,iconst5:8,bipush:16,sipush:17,ldc:18,ldcW:19,dup:89,areturn:176,getstatic:178,invokespecial:183,invokestatic:184,new:187},vx=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n=0,r=e=>{let t=n;return n+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n)}},yx=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),bx=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],xx=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??yx.get(e[3])}${`[]`.repeat(e[1].length)}`),Sx=(e,t)=>e[e[t].first].text,Cx=(e,t)=>Sx(e,t).replaceAll(`/`,`.`),wx=e=>{let t=vx(e);if(t.readUint32()!==3405691582)throw new s(`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===gx.utf8?a.text=i.decode(t.readBytes(t.readUint16())):r===gx.integer?a.value=t.readInt32():r===gx.float?t.readUint32():r===gx.long||r===gx.double?(t.readBytes(8),e++):r===gx.class||r===gx.string||r===gx.methodType||r===gx.module||r===gx.package?a.first=t.readUint16():r===gx.methodHandle?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16();let a=Cx(n,t.readUint16());t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let o=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,s=i.indexOf(`)`),c=xx(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:vx(t.readBytes(t.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>Cx(n,d.readUint16())):[],p=bx.filter(t=>(e&t[0])!==0).map(e=>e[1]),m=xx(i.slice(s+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;o.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${a}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:o}},Tx=(e,t)=>{let n=e[t],r=e[n.second];return{className:Sx(e,n.first),name:e[r.first].text}},Ex=(e,t,n,r)=>{let i=()=>new p(`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===gx.integer)return n.value;if(n.tag===gx.string)return t[n.first].text;throw i()};for(let e=0;e<a.length;){let n=a[e],l=()=>a[e+1]<<8|a[e+2];if(n>=_x.iconstM1&&n<=_x.iconst5)o.push(n-_x.iconst0),e+=1;else if(n===_x.bipush)o.push(a[e+1]<<24>>24),e+=2;else if(n===_x.sipush)o.push(l()<<16>>16),e+=3;else if(n===_x.ldc)o.push(c(a[e+1])),e+=2;else if(n===_x.ldcW)o.push(c(l())),e+=3;else if(n===_x.dup){let t=s();o.push(t,t),e+=1}else if(n===_x.getstatic){let n=Tx(t,l());if(n.className!==`${hx}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===_x.invokestatic){let n=Tx(t,l()),a=s();if(n.className!==`${hx}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===_x.new)o.push({className:Sx(t,l()),value:void 0}),e+=3;else if(n===_x.invokespecial){let n=Tx(t,l()),a=s(),o=s();if(!(n.className===`${hx}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===_x.areturn){let e=s();if(typeof e!=`object`)throw i();if(`className`in e){if(!e.value)throw i();return e.value}return e}else throw i()}throw i()},Dx=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=wx(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:Ex(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},Ox=A(`EOF`),kx=A(`IDENTIFIER`),Ax=A(`DEFBREAK`),jx=(e,t)=>Array.from({length:A(t)-A(e)+1},(t,n)=>A(e)+n),Mx=new Set(jx(`op_57`,`op_119`)),Nx=new Set(jx(`op_1`,`op_119`)),Px=new Set(jx(`op_57`,`op_70`)),Fx=/* @__PURE__ */ new Set([...jx(`ACTION`,`EXCEPT`),A(`EXTENDS`),...jx(`IF`,`SF`),A(`STATE`),...jx(`THEN`,`WITH`),A(`US`),...jx(`op_112`,`op_116`)]),Ix=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),Lx=new Map([...Ix(`postfix`,160,160,!0,`[`),...Ix(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...Ix(`prefix`,120,120,!1,`-.`),...Ix(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...Ix(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...Ix(`prefix`,40,40,!0,`\\lnot`),...Ix(`nfix`,100,130,!0,`\\times`),...Ix(`infix`,140,140,!1,`^`,`^^`),...Ix(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...Ix(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...Ix(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...Ix(`infix`,100,110,!0,`|`,`||`,`%%`),...Ix(`infix`,100,110,!1,`%`),...Ix(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...Ix(`infix`,90,140,!1,`\\wr`),...Ix(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...Ix(`infix`,90,130,!1,`!!`),...Ix(`infix`,90,90,!1,`...`,`..`),...Ix(`infix`,80,80,!0,`\\intersect`,`\\union`),...Ix(`infix`,80,80,!1,`\\`),...Ix(`infix`,70,70,!1,`<:`,`:>`),...Ix(`infix`,60,60,!0,`@@`),...Ix(`infix`,50,140,!0,`\\cdot`),...Ix(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...Ix(`infix`,30,30,!0,`\\land`,`\\lor`),...Ix(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...Ix(`infix`,10,10,!1,`=>`)]),Rx=new Map([...Lx,...oc.flatMap(e=>e.slice(1).map(t=>[t,Lx.get(e[0])]))]),zx=Rx.get(`[`),Bx={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},Vx=e=>({type:`tokens`,kinds:new Set(e)}),Hx=e=>typeof e==`string`?e.startsWith(`<`)?Vx([A(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(Hx)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),Ux=e=>(...t)=>({type:e,body:G(...t)}),q=Ux(`zeroOrMore`),Wx=Ux(`oneOrMore`),J=Ux(`optional`),Y=e=>({type:`action`,run:t=>e(t)??void 0}),X=e=>Y(t=>{t.expecting=e}),Z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&G(...e.expansion),semantic:e.semantic}),Gx=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Kx=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=Gx(e,n);return n},qx=(...e)=>{let t=e.map(A);return e=>t.includes(Kx(e,1).kind)},Jx=(e,t=Kx(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Yx=e=>{let t=Kx(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Xx=e=>qx(`CASESEP`)(e)&&Jx(e),Zx=e=>{let t=Kx(e,1);Fx.has(t.kind)&&(t.kind=kx)},Qx=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,$x=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),eS=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},tS=e=>e.operatorStacks[e.operatorStacks.length-1],nS=(e,t)=>e.low>t.high,rS=(e,t)=>e.high<t.low,iS=e=>e.fix===`prefix`?e:Rx.get(`${e.name}.`),aS=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===zx?$x(`FcnAppl`,[n,...r.node.heirs]):$x(`PostfixExpr`,[n,r.node]),operator:void 0})},oS=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:$x(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:$x(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},sS=e=>{let t=tS(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return aS(t,n),sS(e);if(i.operator!==void 0){let t=iS(r.operator);return t!==void 0&&nS(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Qx(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${Qx(e,a.node.first,a.node.last)} and expression at location ${Qx(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return rS(a.operator,r.operator)?void 0:nS(a.operator,r.operator)?(oS(t,a.operator),sS(e)):`Precedence conflict between ops ${a.operator.name} in block ${Qx(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=iS(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(rS(s,r.operator))return;if(!nS(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Qx(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return oS(t,s),sS(e);let c=Qx(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===Bx?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},cS=e=>Y(t=>{let n=tS(t),r=eS(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:sS(t)}),lS=cS(()=>!1),uS=cS(()=>!0),dS=Y(e=>{e.lastOperator=Rx.get(e.token.image)}),fS=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},pS=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?fS(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},mS=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Jx(e,n.first.beginColumn))return n;let t=mS(e,n);if(t!==void 0)return t}},hS=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(A),n=(e,...t)=>t.some(t=>e.kind===A(t)),r=e=>e!==void 0&&Mx.has(e.kind),i=e.token,a=Gx(e,i);i.next=void 0;let o=Gx(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===kx&&(e=e.next)}else if(e.kind===kx){let t=e.next;!r(t)||Px.has(t.kind)||Nx.has(t.kind)&&t.next?.kind!==kx||(e=t.next?.kind===A(`SUBSTITUTE`)?i:Nx.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Ax&&(e.next={kind:Ax,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=Gx(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},gS=e=>{let t=Kx(e,1);if(t.kind===A(`LAB`)){let n=1;for(;n!==0;)if(t=Gx(e,t),t.kind===A(`LAB`)&&n++,t.kind===A(`RAB`)&&n--,t.kind===Ox)return!1;return Gx(e,t).kind===A(`IN`)}if(t.kind!==kx)return!1;for(t=Gx(e,t);t.kind===A(`COMMA`);){if(t=Gx(e,t),t.kind!==kx)return!1;t=Gx(e,t)}return t.kind===A(`IN`)},_S=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),vS=e=>e.proofLevels.at(-1)??-1,yS=e=>{let t=Kx(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:qx(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||vS(e)>=0&&_S(t)>vS(e):qx(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},bS=(e,t)=>{let n=_S(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},xS=e=>Y(t=>bS(t,t.token)?void 0:`${Qx(t,t.token)}: ${e}`),SS=Vx([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(A)),CS=Vx([...SS.kinds,A(`op_76`)]),wS=Vx(Nx),TS=Vx(Px),ES=Vx([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(A)),DS=()=>q(Z({expansion:[K(SS,`<op_77>`)],semantic:Jx}),K(`PrefixOp`,`InfixOp`),uS),OS=()=>K(G(Z({expansion:[`OpenStart`],semantic:Jx}),`OpenExpression`,lS),G(Z({semantic:Jx}),`ExtendableExpr`)),kS=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),AS=()=>K(G(Z({semantic:e=>qx(`ASSUME`,`BOXASSUME`)(e)||Kx(e,2).kind===A(`COLONCOLON`)&&[A(`ASSUME`),A(`BOXASSUME`)].includes(Kx(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),jS=()=>[`JuncItem`,q(Z({semantic:Yx}),`JuncItem`)],MS=e=>Y(t=>{t.expecting=e,Zx(t)}),NS=e=>Y(t=>{t.isTerminalProof=e}),PS=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{hS(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),FS={CompilationUnit:Q(void 0,[Y(hS),J(`Prelude`),`Module`]),Prelude:Q(void 0,[`<BEGIN_PRAGMA>`,q(K(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Q(`Module definition`,[X(`---- MODULE`),`BeginModule`,X(`EXTENDS clause or module body`),`Extends`,X(`Module body`),`Body`,X(`==== or more Module body`),`EndModule`]),BeginModule:Q(`Begin module`,[X(`---- MODULE (beginning of module)`),K(`<_BM0>`,`<_BM1>`,`<_BM2>`),MS(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,MS(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,MS(`Identifier`),`Identifier`))]),Body:Q(`Module body`,[X(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),q(K(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,G(Z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,G(Z({amount:2}),`Instance`),G(Z({amount:2}),`Assumption`),G(Z({amount:2}),`Theorem`),G(Z({amount:1}),`Module`,Y(hS)),G(Z({semantic:e=>qx(`USE`)(e)&&Kx(e,2).kind!==A(`ONLY`)||qx(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Q(`variable declaration`,[`<VARIABLE>`,X(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,X(`Identifier`),`Identifier`)]),ParamDeclaration:Q(`Parameter declaration`,[X(`CONSTANT`),`ParamSubDecl`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Q(`Recursive`,[X(`RECURSIVE`),`<RECURSIVE>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X("`,' or `)'"))]),ConstantDeclarationItems:Q(`Constant declaration items`,[X(`Identifier, _ or prefix op`),K(G(`Identifier`,X(`(, comma, or Module Body`),J(Z({amount:2}),`<LBR>`,X(`_`),`<US>`,X(`comma or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`comma or )`)),`<RBR>`)),G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`prefix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Q(`Definition`,[X(`LOCAL, Identifier or Operator Symbol`),J(`<LOCAL>`),`<DEFBREAK>`,X(`LOCAL, Identifier or Operator Symbol`),K(PS(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),PS(`Expression`,Z({expansion:[`<IDENTIFIER>`,TS]}),`PostfixLHS`,`Expression`),PS(`Expression`,Z({expansion:[`<IDENTIFIER>`,wS]}),`InfixLHS`,`Expression`),PS(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),PS(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Q(`Identifier tuple`,[`<LAB>`,X(`Identifier or >>`),J(`Identifier`,X(`COMMA or >>`),q(`<COMMA>`,X(`COMMA or >>`),`Identifier`,X(`COMMA or >>`))),`<RAB>`]),IdentLHS:Q(`Identifier LHS`,[`Identifier`,X(`( or ==`),J(`<LBR>`,X(`Identifier Declaration, prefix op, _ or )`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`),q(`<COMMA>`,X(`Identifier Declaration, prefix op or _`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Q(`Prefix LHS`,[CS,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,wS,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,TS]),IdentDecl:Q(`Identifier Declation`,[`Identifier`,X(`( or ...`),J(`<LBR>`,X(`_`),`<US>`,X(`COMMA or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Q(`Op. Symbol Declaration`,[K(G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`infix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),Instance:Q(`Instance`,[X(`LOCAL or instance`),J(`<LOCAL>`),`Instantiation`,X(`COMMA or Module Body`)]),Instantiation:Q(`NonLocalInstance`,[`<INSTANCE>`,MS(`Module identifier`),`Identifier`,X(`WITH or another definition.`),J(`<WITH>`,X(``),`Substitution`,X(``),q(Z({amount:3}),`<COMMA>`,X(``),`Substitution`,X(``)))]),Substitution:Q(`Substitution`,[K(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),X(`<-`),`<SUBSTITUTE>`,X(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Q(void 0,[SS,dS]),NonExpPrefixOp:Q(void 0,[CS,dS]),InfixOp:Q(`Infix Op`,[wS,dS]),PostfixOp:Q(void 0,[TS,dS]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{hS(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),AS(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),AS(),X("PROVE or `,'")),K(`<PROVE>`,`<BOXPROVE>`),X(`Expression`),`Expression`))]),NewSymb:Q(`NEW symbol declaration`,[X(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),K(G(Z({amount:2}),K(G(Z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),X(`Constant declaration`),K(G(Z({amount:2}),`IdentDecl`,J(`<IN>`,Y(e=>{let t=eS(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Qx(e,t.first,t.last)}`:void 0}),X(`Expression`),`Expression`)),`SomeFixDecl`)),G(Z({amount:2}),J(`<NEW>`),`<VARIABLE>`,X(`Identifier`),`Identifier`),G(Z({amount:2}),J(`<NEW>`),K(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),X(`Declaration`),K(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Q(`Domain binding`,[J(`<IN>`,X(`Expression`),`Expression`)]),Theorem:Q(`Theorem`,[X(`THEOREM, PROPOSITION`),K(`<THEOREM>`,`<PROPOSITION>`),X(`Identifier, Assume-Prove or Expression`),J(Z({amount:2}),`Identifier`,X(`==`),`<DEF>`),Y(hS),K(G(Z({amount:3}),Z({semantic:qx(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:yS}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>qx(`BY`)(e)||Kx(e,2).kind===A(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>Kx(e,2).kind!==A(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,NS(!0),J(`<ONLY>`)),G(`<USE>`,NS(!1),J(`<ONLY>`)),G(`<HIDE>`,NS(!1))),X("an expression, `MODULE' or `DEF'"),J(kS(),q(`<COMMA>`,X(`MODULE or expression`),kS(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),kS(),q(`<COMMA>`,X(`MODULE or expression`),kS(),Y(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),Y(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Q(`QED step`,[X(`Step number`),ES,xS(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:yS}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),ES,xS(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:qx(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:qx(`INSTANCE`)}),`Instantiation`),G(Z({semantic:qx(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:yS}),Y(e=>{let t=eS(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Qx(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),Wx(Z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Q(`HaveStep`,[`<HAVE>`,X(`expression`),`Expression`]),TakeStep:Q(`TakeStep`,[`<TAKE>`,X(`identifier`),K(G(Z({expansion:[K(G(`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,X(`comma or step`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or proof step`))),G(`Identifier`,X(`comma or proof step`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or proof step`))))]),WitnessStep:Q(`WitnessStep`,[`<WITNESS>`,X(`expression`),`Expression`,q(`<COMMA>`,X(`expression`),`Expression`,X(`comma or colon`))]),PickStep:Q(`PickStep`,[`<PICK>`,X(`identifier`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,X(`comma, or colon`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or colon`))),G(`QuantBound`,X(`comma or colon`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or colon`)))),`<COLON>`,X(`expression`),`Expression`]),CaseStep:Q(`CaseStep`,[`<CASE>`,X(`expression`),`Expression`]),AssertStep:Q(`AssertStep`,[J(`<SUFFICES>`,X(`expression or ASSUME/PROVE`)),K(`Expression`,G(Z({semantic:qx(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Q(void 0,[K(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Q(void 0,[K(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Q(`String`,[`<STRING_LITERAL>`]),Number:Q(void 0,[`<NUMBER_LITERAL>`,J(Z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,q(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Q(void 0,[K(G(Z({amount:2,expansion:[K(CS,wS,TS),Vx([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(A))],semantic:Jx}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Qx(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:Jx}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Q(`Quantified form`,[K(`<EXISTS>`,`<FORALL>`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,q(`<COMMA>`,`Identifier`)),G(`QuantBound`,q(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Q(`Bound Quantified Expression`,[K(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,q(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Q(`Quant Bound`,[K(`IdentifierTuple`,G(`Identifier`,q(`<COMMA>`,`Identifier`,X(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Q(`Some { } form`,[`<LBC>`,J(K(G(Z({semantic:gS}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),Wx(`<COMMA>`,`Expression`)))),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,q(`<COMMA>`,`Expression`)),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,q(`<COMMA>`,`QuantBound`)),G(`Expression`,J(K(G(`<COLON>`,Y(e=>{let t=eS(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,q(`<COMMA>`,`QuantBound`)),Wx(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:gS}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>Kx(e,2).kind===A(`MAPTO`)&&Fx.has(Kx(e,1).kind)}),Y(e=>{Kx(e,1).kind=kx}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,q(`<COMMA>`,`FieldSet`),`<RSB>`),G(`Expression`,K(G(q(`<COMMA>`,`Expression`),`<RSB>`,Y(e=>{let t=e.frames[e.frames.length-1];t.node=$x(`FcnAppl`,t.heirs),e.lastOperator=zx})),G(`<ARROW>`,`Expression`,`<RSB>`),G(`<EXCEPT>`,`ExceptSpec`,q(`<COMMA>`,`ExceptSpec`),`<RSB>`),G(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Q(`Except Spec`,[`<BANG>`,Wx(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(Zx),`Identifier`,Y(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===A(`RBR`)}))]),ReducedExpression:Q(`restricted form of expression`,[K(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Q(`Fairness Expression`,[Y(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),K(`<WF>`,`<SF>`),`ReducedExpression`,J(Z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,Y(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Q(`CASE Expression`,[`<CASE>`,`CaseArm`,q(Z({semantic:e=>Xx(e)&&Kx(e,2).kind!==A(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:Xx}),`<CASESEP>`,`OtherArm`)]),CaseArm:Q(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Q(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Q(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Q(`Let Definitions`,[Wx(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=Kx(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...jS()),G(Z({expansion:[`<AND>`]}),...jS())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=mS(t,e.heirs[1]);return n&&`Item at ${Qx(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Qx(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Q(`(Un)Bounded Choose`,[`<CHOOSE>`,K(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Q(`Lambda`,[`<LAMBDA>`,X(`Identifier`),`Identifier`,X("`,' or `:'"),q(`<COMMA>`,X(`Identifier`),`Identifier`,X("`,' or `:'")),`<COLON>`,X(`Expression`),`Expression`]),Expression:Q(`Expression`,[Y(e=>{e.operatorStacks.push([])}),DS(),OS()],(e,t)=>{let n=tS(t);n.push({node:e.heirs[0],operator:Bx});let r=sS(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Q(`ExtendableExpr`,[K(G(Z({expansion:[K(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),lS,q(K(G(Z({expansion:[`PostfixOp`],semantic:Jx}),`PostfixOp`,uS),G(Z({expansion:[`<DOT>`],semantic:Jx}),`<DOT>`,Y(Zx),Z({semantic:Jx}),`Identifier`,Y(e=>{let t=tS(e);t[t.length-1].operator!==void 0&&aS(t,t.length),t[t.length-1]={node:$x(`RecordComponent`,[t[t.length-1].node,eS(e,2),eS(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:Jx}),X(`function argument`),`SBracketCases`,cS(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:Jx}),`InfixOp`,uS,DS(),OS()),G(Z({expansion:[`<COLONCOLON>`],semantic:Jx}),`<COLONCOLON>`,Y(e=>{let t=tS(e);if(!pS(t[t.length-1].node))return`\`::' at ${Qx(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=tS(e),n=eS(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!rS(r,e.lastOperator)){let t=eS(e,3);return`Removing label at ${Qx(e,t.first,t.last)} would change expression parsing.`}t.push({node:$x(`Label`,[eS(e,3),eS(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:Jx}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:Jx}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>vS(e)<0&&e.proofLevels.length<=1?`${Qx(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Qx(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,G(Z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),J(Z({amount:2}),`OpArgs`),q(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:fS(e.heirs)===void 0?e.heirs.length===1?$x(`GeneralId`,e.heirs):void 0:$x(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>Kx(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),J(Z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Q(`StructOp`,[X("`<<' , `>>' , `:' , `@' , or number"),K(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,G(Z({semantic:e=>Kx(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Qx(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},IS=/* @__PURE__ */ new Map,LS=e=>{let t=IS.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=LS(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,LS(FS[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return IS.set(e,n),n},RS=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},zS=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=Gx(e,e.scanPosition)),e.scanPosition=Gx(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},BS=(e,t)=>{if(t.type===`tokens`)return zS(e,t.kinds);if(t.type===`call`)return BS(e,FS[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||RS(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=BS(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||RS(e,t.semantic)?BS(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=BS(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=BS(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},VS=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=BS(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},HS=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||LS(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!LS(a).hasSemanticStart?LS(a).first.has(Kx(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):VS(e,i,a)&&(o===void 0||o(e))}),US=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,BS(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=Gx(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Ox){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=Gx(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${$e(e.token.image)}" `},WS=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??US(e)}\n\nResidual stack trace follows:\n${r}`,!1},GS=(e,t)=>{let n=Gx(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,WS(e))},KS=(e,t)=>{let n=FS[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Kx(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!qS(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return WS(e,i);let a=r.node??(r.heirs.length===0?void 0:$x(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},qS=(e,t)=>{if(t.type===`tokens`)return GS(e,t.kinds);if(t.type===`call`)return KS(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||WS(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||WS(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||qS(e,t));if(t.type===`choice`){let n=HS(e,t.alternatives);return n===-1?WS(e):qS(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!qS(e,t.body))return!1;if(t.type===`optional`)return HS(e,[t.body])===-1||qS(e,t.body);for(;HS(e,[t.body])===0;)if(!qS(e,t.body))return!1;return!0},JS=e=>{let t=Ze(e),n={kind:Ox,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],pushedErrors:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=qS(r,{type:`call`,name:`CompilationUnit`});if(r.lexicalError!==void 0)return r.lexicalError;let a=[...r.pushedErrors,...i||r.report===void 0?[]:[`***Parse Error***\n${r.report}`]];return a.length===0?void 0:a.join(`
|
|
1784
|
+
`)},YS={low:15,high:15},XS={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),ZS=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)]]),QS=(e,t)=>t.isAssociative||e===`%`||e===`\\X`,$S=/* @__PURE__ */ new Map([[`~`,{low:4,high:4}],[`[]`,{low:4,high:15}],[`<>`,{low:4,high:15}],[`ENABLED`,{low:4,high:15}],[`UNCHANGED`,{low:4,high:15}],[`SUBSET`,{low:8,high:8}],[`UNION`,{low:8,high:8}],[`DOMAIN`,{low:9,high:9}],[`-`,{low:12,high:12}],[`-.`,{low:12,high:12}]]),eC={low:17,high:17},tC=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`@`,`\\A`,`\\E`,`\\AA`,`\\EE`,`IF`,`CASE`,`LET`,`CHOOSE`,`LAMBDA`,`WF_`,`SF_`]),nC=/* @__PURE__ */ new Set([`(`,`{`,`<<`]),rC=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),iC=/* @__PURE__ */ new Set([...rC,`'`]),aC=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),oC=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),sC=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),cC=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),lC=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...iC]),uC=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),dC=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),fC=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),pC=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),mC=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),hC=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),gC=/* @__PURE__ */ new Set([``,`*`,`-`]),_C={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},vC=(e,t)=>e.line-t.line||e.column-t.column,yC=(e,t)=>({start:vC(e.start,t.start)<=0?e.start:t.start,stop:vC(e.stop,t.stop)>=0?e.stop:t.stop}),bC=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),xC={printed:``,set:``},SC={printed:`
|
|
1785
|
+
`,set:``},CC={printed:`
|
|
1786
1786
|
`,set:`
|
|
1787
|
-
`},
|
|
1788
|
-
`)}\n`},OC=(e,t,n=Ee(e,t===`tlapm`))=>{let r=t===`tlapm`,i=r?n:n.map(xe),a=0,o=[],c,l,u=[],d=[],f,p=0,m=[],h=/* @__PURE__ */ new WeakMap,g=e=>u[u.length-1].has(e),_=e=>({line:e.line,column:r&&e.kind===`String`?e.endColumn:e.column,range:void 0}),v=[],y=[],ee=[],b=(e,t=a-1)=>{let n=e===t?ee[e]:void 0;if(n)return n;let r=i[t];v[e]??=_(i[e]),y[t]??={line:r.line,column:r.endColumn};let o={module:d[0].name,start:v[e],end:y[t]};return e===t&&(ee[e]=o),o},x=(e,t)=>(e.location.range=b(t),e),te=(e=0)=>i[Math.min(a+e,i.length-1)],S=(e=0)=>{let t=te(e),n=o[o.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ne=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),C=e=>r&&(e.kind===`Keyword`||SC.has(e.text)),re=e=>{let t=i.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},w=e=>e.kind===`End`?`EOF`:/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:sC.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:C(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,T=(e,t=te(),n)=>{let r=i[i.length-1],a=t.line===r.line&&t.column===r.column,o=new s(`${e} at line ${t.line}, column ${t.column}`,void 0,ie(e,t,a,n));return f!==void 0&&h.set(o,f),o},ie=(e,t,n,a)=>{if(!r)return{reason:e,line:t.line,column:t.column,isEnd:n};let o=i[m[0]-1],s=a?`Unexpected ${w(a)}`:e;if(o)return{reason:s,line:o.line,column:o.endColumn+1,isEnd:n};let c=a?re(a):t;return{reason:s,line:c.line,column:c.column,isEnd:n}},ae=(e,t=te())=>T(e,t,t),oe=e=>{let t={cursor:a,frame:f,restorePoints:m.length,offsideColumns:o.length,recursiveScopes:u.length},n=++p;f=n;try{let n=e();return f=t.frame,n}catch(e){if(!(e instanceof s)||h.get(e)!==n)throw e;a=t.cursor,f=t.frame,m.length=t.restorePoints,o.length=t.offsideColumns,u.length=t.recursiveScopes;return}},se=e=>{let t=f;f=void 0;let n=e();return f=t,n},ce=e=>{m.push(a);let t=e();return m.pop(),t},le=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!C(e),E=(e,t=0)=>{let n=S(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},D=()=>{let e=S();if(e.kind===`End`)throw ae(`Unexpected end of expression`);return a++,e},O=e=>E(e)?(a++,!0):!1,k=e=>{if(!E(e))throw ae(`Expected ${JSON.stringify(e)} but found ${ne(S())}`);return D()},de=()=>{let e=S();if(e.kind!==`Identifier`)throw ae(`Expected an identifier but found ${ne(e)}`);if(C(e))throw ae(`Unexpected keyword ${e.text}`);return a++,e.text},fe=()=>{let e=a;return{name:de(),range:b(e)}},pe=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),me=()=>{let e=S();return e.kind!==`String`&&(QS.has(e.text)||US.has(e.text)||XS.has(e.text))?(a++,e.text):de()},he=!1,ge=()=>S().kind===`Identifier`||!le(S())?de():(he=!0,D().text),_e=e=>{if(!r)return e();o.push(-1);let t=e();return o.pop(),t},ve=(e,t=`,`)=>{let n=[e()];for(;O(t);)n.push(e());return n},ye=(e=0)=>{if(E(`<<`,e)){let t=e+1;for(;S(t).kind===`Identifier`||E(`,`,t);)t++;return E(`>>`,t)&&E(`\\in`,t+1)}let t=e;for(;S(t).kind===`Identifier`;){if(E(`\\in`,t+1))return!0;if(!E(`,`,t+1))return!1;t+=2}return!1},be=()=>{if(E(`::`))return!0;if(!E(`(`))return!1;let e=1;for(;S(e).kind===`Identifier`&&E(`,`,e+1);)e+=2;return S(e).kind===`Identifier`&&E(`)`,e+1)&&E(`::`,e+2)},Se=()=>{if(!O(`<<`)){let e=fe();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=pe(E(`>>`)?[]:ve(fe));return k(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Ce=()=>{let e=()=>{let e=ve(Se);k(`\\in`);let t=se(j);return e.map(e=>({pattern:e,set:t}))},t=[e()];for(;E(`,`)&&(!r||ye(1));)D(),t.push(e());return t.flat()},we=()=>{let e=S();if(r&&SC.has(e.text)){let t=a;D();let n={kind:`Identifier`,name:e.text,location:_(e)};return{subscript:x(n,t),lastArgs:[]}}let t=r&&(e.kind===`Number`||e.kind===`String`||E(`@`));if(e.kind===`Identifier`){let t=a,n=[],i=[],o=e=>(i.push(b(a,a)),n.push(de()),e&&E(`(`)?A():[]),s=[o(!r)];for(;E(`!`)&&S(1).kind===`Identifier`;)D(),s.push(o(!0));let c=s.slice(0,-1),l=_(e);l.range={...b(t),end:i[i.length-1].end};let u=n.join(`!`);return{subscript:c.every(e=>e.length===0)?{kind:`Identifier`,name:u,location:l}:{kind:`Apply`,operator:u,args:c.flat(),argumentCounts:[...c.map(e=>e.length),0],argumentsRange:l.range,selectorRanges:i,location:l},lastArgs:s[s.length-1]}}if(E(`<<`)||E(`(`)||E(`{`)||E(`[`)||t){let e=a,t=Be();return{subscript:t.location.range?t:x(t,e),lastArgs:[]}}throw ae(`Expected a subscript but found ${ne(e)}`)},Te=e=>{let t=S(1),n=S(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`&&E(`==`,XS.has(n.text)?3:4))},De=e=>{let t=S(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||E(`,`,1)||E(`)`,1)||t.kind===`Keyword`&&rC.has(t.text)||Te(e)},Oe=()=>{let e=S(),t=e.kind===`Operator`&&(US.has(e.text)||ZS.has(e.text))&&De(e);if(r&&e.kind!==`String`&&(ZS.has(e.text)||tC.has(e.text)&&e.text!==`'`&&!YS.has(e.text)||eC.has(e.text)&&S(-1).text===`(`&&S(-1).line===e.line&&S(-1).endColumn+1===e.column&&S(1).text===`)`&&S(1).line===e.line&&S(1).column===e.endColumn+1)&&De(e))throw T(`incomplete expression`,e);if(t&&!r&&e.text===`\\X`&&e.spelling!==`×`)throw T(`\\X may not be used as an infix operator`,e);if(t)return a++,x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:_(e)},a-1);if(e.kind!==`String`&&tC.has(e.text)&&De(e)){a++;let t=_(e);if(YS.has(e.text))return x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},a-1);let n={kind:`Identifier`,name:`argument`,location:t};return x({kind:`Lambda`,params:[n.name],body:EC(e.text,n,t),operator:e.text,location:_(e)},a-1)}if(E(`LAMBDA`)){let t=a;D();let n=pe(ve(fe));k(`:`);let r=j();return x({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:_(e)},t)}if(!r)return j();let n=oe(j);if(n)return n;throw ae(`Unexpected ${ne(S())}`)},ke,A=()=>_e(()=>{let e=a;k(`(`);let t=ve(Oe);return k(`)`),ke=b(e),t}),Ae=()=>{let e=D();o.push(e.column);let t=[j()],n=()=>{for(;wC(te())&&te().text===e.text&&te().column===e.column;)a++,t.push(j())};return r?se(n):n(),o.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:_(e)}},je=e=>_e(()=>{let t=_(e),n=S().kind===`Identifier`,i=E(`|->`,1)&&(n||le(S()));if(i||n&&E(`:`,1)){let e=i?`Record`:`RecordSet`,r=e=>{let t=a,n=_(S()),r=e();return n.range=b(t),k(i?`|->`:`:`),{name:r,value:j(),location:n}},o=[r(()=>n?de():D().text),...O(`,`)?ve(()=>r(de)):[]];return k(`]`),{kind:e,fields:o,location:t}}if(ye()){let e=a,n=Ce();if(!r||E(`|->`)){k(`|->`);let e=j();return k(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}a=e}let o=j();if(O(`->`)){let e=j();return k(`]`),{kind:`FunctionSet`,domain:o,range:e,location:t}}if(O(`EXCEPT`)){let e=ve(()=>{k(`!`);let e=[];for(;E(`.`)||E(`[`);)if(O(`.`)){if(!le(S()))throw ae(`Expected a field name but found ${ne(S())}`);if(!r&&E(`@`))throw ae(`@ used in !.@`);e.push({kind:`Field`,name:D().text})}else k(`[`),e.push({kind:`Index`,args:ve(()=>j())}),k(`]`);return k(`=`),{path:e,value:j()}});return k(`]`),{kind:`Except`,function:o,updates:e,location:t}}if(!r&&!E(`]_`)){let e=[o];for(;O(`,`);)e.push(j());return k(`]`),{kind:`Bracket`,args:e,location:t}}return k(`]_`),{kind:`BoxAction`,action:o,subscript:we().subscript,location:t}}),Me=()=>{let e=a,t=x(He(),e),n=_(D());return x({kind:`Apply`,operator:`\\in`,args:[t,se(j)],location:n},e)},Ne=e=>_e(()=>{let t=_(e);if(O(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ye()&&(S(1).text===`\\in`||E(`<<`))){let e=a,n=Se();k(`\\in`);let r=se(j);if(O(`:`)){let e=se(j);return k(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}a=e}let n=S().kind===`Identifier`&&E(`\\in`,1)?Me():j();if(O(`:`)){let e=Ce();return k(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;O(`,`);)r.push(j());return k(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Pe=e=>{let t=_(e),n=_e(()=>E(`>>`)||E(`>>_`)?[]:ve(()=>j()));if(O(`>>_`)){if(n.length!==1)throw T(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:se(we).subscript,location:t}}return k(`>>`),{kind:`Tuple`,elements:n,location:t}},Fe=e=>{let t=_(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ye()){let e=Ce();return k(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=pe(ve(fe));return k(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},Ie=e=>{let t=[];do{let n=a;if(O(`OTHER`))return k(`->`),{kind:`Case`,arms:t,other:j(),otherRange:b(n),location:_(e)};let r=j();k(`->`),t.push({condition:r,body:j()})}while(O(`[]`));return{kind:`Case`,arms:t,other:void 0,location:_(e)}},Le=()=>{let e=S(1);return E(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||nC.has(e.text)||e.kind===`Operator`&&(US.has(e.text)||XS.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&QS.has(e.text))},Re=()=>{let e=D();if(e.kind===`Number`)return{kind:`Operand`,operand:ue(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return a--,{kind:`Bound`,args:A()}}return{kind:`Name`,name:e.text,args:E(`(`)?A():[]}},ze=(e,t,n,r,i)=>{let o=[{kind:`Name`,name:e,args:t}],s=[b(r,r)],c=[n];for(;Le();){D();let e=a;ke=void 0;let t=Re();s.push(t.kind===`Bound`?b(e):b(e,e)),o.push(t),c.push(ke)}let l=o.flatMap(e=>e.kind===`Name`?[e.name]:[]),u=l.join(`!`),d=o.flatMap(e=>`args`in e?e.args:[]),f=o.map(e=>`args`in e?e.args.length:0);return l.length<o.length?{kind:`Subexpression`,selectors:o,selectorRanges:s,argumentRanges:c,location:i}:d.length===0?{kind:`Identifier`,name:u,selectorRanges:s,location:i}:{kind:`Apply`,operator:u,args:d,...f.slice(0,-1).some(e=>e>0)&&{argumentCounts:f},argumentsRange:c.at(-1)??b(r),selectorRanges:s,argumentRanges:c,location:i}},Be=e=>{let n=a,i=D(),o=_(i);if(r&&i.kind===`Keyword`&&i.text===`LAMBDA`){let e=ve(de);return k(`:`),{kind:`Lambda`,params:e,body:j(),location:o}}if(i.kind===`Number`)return{kind:`Number`,value:ue(i.text),text:i.text,location:o};if(i.kind===`Decimal`)return{kind:`Decimal`,text:i.text,location:o};if(i.kind===`String`)return{kind:`String`,value:i.text,location:o};let s=i.kind===`Step`&&N(i);if(!r&&s&&yt()<0&&vt.length<=1)throw T(`Step number used outside proof`,i);if(s&&i.text[1]===`+`)throw T(`<+> step number used in an expression`,i);if(i.kind===`Identifier`||s){let t=s?St(i)??i.text:i.text;if(be()){let a=pe(O(`(`)?ve(fe):[]);a.names.length>0&&k(`)`),k(`::`);let s=b(n),l=j();if(!r&&e!==void 0&&c!==void 0&&CC(l)&&e.high>=c.low)throw T(`Removing the label would change expression parsing`,i);return{kind:`Label`,name:t,params:a.names,paramRanges:a.ranges,head:s,body:l,location:o}}let a=E(`(`);if(t===`@`&&!a&&!Le())return{kind:`ExceptAt`,location:o};let l=a?A():[];return Le()?ze(t,l,a?ke:void 0,n,o):a?{kind:`Apply`,operator:t,args:l,argumentsRange:ke,location:o}:{kind:`Identifier`,name:t,location:o}}let l=i.kind===`Operator`&&(TC(i.text)||i.text===`'`&&!r);if(l&&E(`(`)){let e=A();return!r&&Le()?ze(i.text,e,ke,n,o):t===`tlc`&&i.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:o}:i.text===`'`&&e.length===1?{kind:`Prime`,expression:e[0],location:o}:{kind:`Apply`,operator:i.text,spelling:i.spelling,args:e,argumentsRange:ke,location:o}}if(l&&!r)return Le()?ze(i.text,[],void 0,n,o):{kind:`Identifier`,name:i.text,spelling:i.spelling,location:o};switch(i.text){case`(`:{let e=_e(()=>j());return k(`)`),e}case`[`:return je(i);case`{`:return Ne(i);case`<<`:return Pe(i);case`@`:return{kind:`ExceptAt`,location:o};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Fe(i);case`IF`:{let e=j();k(`THEN`);let t=j();return k(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:o}}case`CASE`:return Ie(i);case`LET`:{let e=[],t=[],n=[];for(u.push(/* @__PURE__ */ new Set);!O(`IN`);){if(r&&E(`RECURSIVE`))throw ae(`Unexpected keyword RECURSIVE`);if(O(`RECURSIVE`)){n.push(...M());continue}let i=lt(!r&&O(`LOCAL`));i.kind===`Instance`?t.push(i):e.push(i)}return u.pop(),{kind:`Let`,definitions:e,...t.length>0&&{instances:t},...n.length>0&&{recursive:n},body:j(),location:o}}case`CHOOSE`:{let e=Se(),t=O(`\\in`)?j():void 0;return k(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:o}}case`WF_`:case`SF_`:{let e=we(),t=!E(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:_e(()=>{k(`(`);let e=j();return k(`)`),e});return{kind:i.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:o}}}throw ae(`Unexpected ${ne(i)}`,i)},Ve=(e,t,n)=>{c=l={low:t,high:n};let r=j(n+1),i=S(),a=XS.has(i.text)?VS.high:US.get(i.text)?.high;if(i.kind===`Operator`&&a!==void 0&&a>=t)throw T(`Precedence conflict between ${e.text} and ${i.text}`,i);return r},He=()=>{let e=l;l=void 0;let t=S(),n=_(t);if(t.kind===`Operator`&&wC(t))return Ae();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return D(),{kind:`Apply`,operator:`~`,args:[Ve(t,4,4)],location:n};case`-`:return D(),{kind:`Apply`,operator:`-.`,args:[Ve(t,12,12)],location:n};case`[]`:case`<>`:case`ENABLED`:case`UNCHANGED`:return D(),EC(t.text,Ve(t,4,15),n);case`SUBSET`:case`UNION`:case`DOMAIN`:return D(),{kind:`Apply`,operator:t.text,args:[Ve(t,10,13)],location:n}}return Be(e)},Ue=(e,t,n,r,i)=>{let a=_(e);if(e.text===`/\\`||e.text===`\\/`){let o=e.text===`/\\`?`And`:`Or`;return t.kind===o&&r?{...t,operands:[...t.operands,n],prefixEnds:[...t.prefixEnds??[],i]}:{kind:o,operands:[t,n],prefixEnds:[i],location:a}}return e.text===`\\X`?t.kind===`Product`&&r?{...t,factors:[...t.factors,n]}:{kind:`Product`,factors:[t,n],location:a}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t,n],location:a}},We=(e,t)=>e.text===`'`?{kind:`Prime`,expression:t,location:_(e)}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t],location:_(e)},Ge=()=>{D();let e=_e(()=>ve(()=>j()));return _e(()=>k(`]`)),e},Ke=e=>{let t=a,n=He(),r=n.location.range?n:x(n,t),i;for(;;){let n=S();if(n.kind!==`Operator`)break;let a=_(n);if(XS.has(n.text)&&e<=15){D(),c=VS,r=x(We(n,r),t);continue}if(n.text===`[`){let e=Ge();c=HS,r=x({kind:`FunctionApplication`,function:r,args:e,location:a},t);continue}if(n.text===`.`&&le(S(1))){D();let e=D().text;r=x({kind:`FieldAccess`,record:r,field:e,location:a},t);continue}let o=US.get(n.text);if(!o||o.low<e)break;if(i){let e=!(i.low>o.high||i.high<o.low),t=i.text===n.text&&o.isAssociative;if(e&&!t&&(i.text!==`\\X`||n.text!==`\\X`))throw T(`Precedence conflict between ${i.text} and ${n.text}`,n)}if(D(),o.low>12&&E(`-`))throw T(`Precedence conflict between ${n.text} and -`,S());c=l=o;let s=j(o.high+1),u=i?.text===n.text;r=x(Ue(n,r,s,u,b(t).end),t),i={...o,text:n.text}}return r},qe=e=>e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`||e.kind===`Identifier`||e.kind===`Step`&&N(e)&&/^<\d/.test(e.text)||(e.kind===`Operator`||e.kind===`Keyword`)&&qS.has(e.text),Je=(e,t)=>({start:t,end:a-1,expression:e.location.range?e:x(e,t)}),Ye=(e,t,n,r)=>({...n,start:e,end:a-1,fixity:t,isLeft:!1,apply:r}),Xe=e=>e.kind===`Operator`&&XS.has(e.text)&&E(`(`,1)?oe(()=>_e(()=>{D(),D();let t=j(),n=a-1;return k(`)`),{end:n,expression:We(e,t)}})):void 0,Ze=()=>{let e=0;for(let t=a+1;t<i.length;t++){let n=i[t];if(n.kind===`Operator`){if(e===1&&n.text===`,`)return!0;if(i[t-1].text!==`!`&&(bC.has(n.text)&&e++,xC.has(n.text)&&--e===0))return!1}}return!1},Qe=e=>E(`(`,1)&&Ze()?oe(()=>_e(()=>{D(),D();let t=j();k(`,`);let n=j();return k(`)`),{kind:`Apply`,operator:e.text,args:[t,n],location:_(e)}})):void 0,$e=e=>{let t=a,n=S(),r=_(n),i=n.kind===`Operator`||n.kind===`Keyword`,o=i?US.get(n.text):void 0;if(!e){if(E(`[`)){let e=Ge();return Ye(t,`Postfix`,KS,t=>({kind:`FunctionApplication`,function:t[0].expression,args:e,location:r}))}if(E(`.`)&&le(S(1))){D();let e=D().text;return Ye(t,`Postfix`,KS,t=>({kind:`FieldAccess`,record:t[0].expression,field:e,location:r}))}if(o){if(Qe(n)){a=t;return}return D(),{...Ye(t,`Infix`,o,e=>Ue(n,e[0].expression,e[1].expression,e[0].joinedBy===n.text,b(e[0].start,e[1].end).end)),isLeft:WS(n.text,o),joins:n.text}}if(n.kind!==`Operator`||!XS.has(n.text))return;if(Xe(n)){a=t;return}return D(),Ye(t,`Postfix`,VS,e=>We(n,e[0].expression))}if(n.kind===`Operator`&&wC(n))return Je(Ae(),t);let s=o?Qe(n):void 0;if(s)return Je(s,t);let c=Xe(n);if(c)return c.expression.location.range=b(t,c.end),{start:t,end:c.end,expression:c.expression};let l=i?GS.get(n.text):void 0;if(l)return D(),Ye(t,`Prefix`,l,e=>EC(n.text===`-`?`-.`:n.text,e[0].expression,r));if(!qe(n))return;let u=n.kind===`Operator`&&JS.has(n.text);return Je(u?Be():se(Be),t)},et=e=>e!==void 0&&`fixity`in e,tt=e=>e!==void 0&&!(`fixity`in e),nt=(e,t)=>{let n=Math.min(e.start,t[0].start),r=Math.max(e.end,t[t.length-1].end),i=e.apply(t);return i.location.range=b(n,r),{start:n,end:r,expression:i,joinedBy:e.joins}},rt=e=>{let t=e.pop(),n=e.pop();if(!tt(t)||!et(n))throw T(`incomplete expression`);let r=n.fixity===`Infix`?e.pop():void 0;e.push(nt(n,tt(r)?[r,t]:[t]))},it=e=>{let t=e[e.length-2];return et(t)?t:void 0},at=(e,t)=>t!==void 0&&e.high<t.low,ot=()=>ce(()=>{let e=oe(()=>$e(!0));if(e===void 0){let e=te();throw e.kind===`End`?ae(`Unexpected end of expression`,e):T(`required expressions(s) missing before '${w(e)}'`,e)}return se(()=>{let t=[e];for(;;){let e=oe(()=>$e(et(t[t.length-1])));if(e===void 0)break;if(tt(e)||e.fixity===`Prefix`){t.push(e);continue}for(;at(e,it(t));)rt(t);let n=t[t.length-1];if(e.fixity===`Postfix`&&tt(n)){t.splice(-1,1,nt(e,[n]));continue}let r=it(t);r?.fixity===`Infix`&&r.isLeft&&e.isLeft&&!at(r,e)&&rt(t),t.push(e)}for(;t.length>1;)rt(t);let n=t[0];if(!tt(n))throw T(`incomplete expression`);return n.expression})}),j=(e=0)=>r?ot():Ke(e),st=()=>{if(!O(`(`))return[];let e=ht();return k(`)`),e},ct=()=>{let e=_(S()),t=j(),n=i[a-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:d[0].name,start:e,end:r}}},lt=e=>{let t=a;return x(dt(e),t)},ut=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),dt=e=>{let t=S(),n=a,r=_(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:b(n,a-2),...ct(),isLocal:e,isRecursive:g(t),location:r});if(t.kind===`Identifier`&&S(1).kind===`Operator`&&US.has(S(1).text)&&S(2).kind===`Identifier`&&E(`==`,3)){let e=fe(),t=D().text,n=fe();return k(`==`),i(t,[ut(e),ut(n)])}let o=t.kind!==`String`&&QS.has(t.text),s=t.kind===`Identifier`&&XS.has(S(1).text)&&E(`==`,2);if(o||s){let e=o?t.text:S(1).text;o&&D();let n=fe();return s&&D(),k(`==`),i(e,[ut(n)])}let c=de();if(O(`[`)){let t=_e(()=>Ce());return k(`]`),k(`==`),{kind:`Function`,name:c,bounds:t,body:j(),isLocal:e,isRecursive:g(c),location:r}}let l=a,u=st();return k(`==`),E(`INSTANCE`)?{...ft(c,u,e,r),definitionRange:b(l)}:i(c,u)},ft=(e,t,n,r)=>{let i=a;return k(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ge(),substitutions:O(`WITH`)?ve(()=>{let e=a,t=me(),n=b(e);return k(`<-`),{name:t,nameRange:n,expression:Oe()}}):[],isLocal:n,location:r,instanceRange:b(i)}},pt=()=>{let e=a;return x(mt(),e)},mt=()=>{let e=_(S());if(E(`_`)&&S(1).kind===`Operator`)return D(),{name:D().text,arity:O(`_`)?2:1,location:e};if(S().kind!==`String`&&(QS.has(S().text)||r&&S().kind===`Operator`)&&E(`_`,1)){let t=D().text;return D(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=de();if(!O(`(`))return{name:t,arity:0,location:e};let n=ve(()=>k(`_`));return k(`)`),{name:t,arity:n.length,location:e}},ht=()=>ve(pt),M=()=>{let e=ht();return e.forEach(e=>u[u.length-1].add(e.name)),e},gt=e=>{let t=0,n=e;do{let e=S(n);if(e.kind===`End`)return n;e.kind===`Operator`&&bC.has(e.text)&&t++,e.kind===`Operator`&&xC.has(e.text)&&t--,n++}while(t>0);return n},_t=()=>{let e=S(),t=S(1);return e.kind===`Identifier`?E(`(`,1)||E(`[`,1)?E(`==`,gt(1)):t.kind===`Operator`&&XS.has(t.text)?E(`==`,2):t.kind===`Operator`&&US.has(t.text)?S(2).kind===`Identifier`&&E(`==`,3):E(`==`,1):e.kind!==`String`&&QS.has(e.text)&&t.kind===`Identifier`&&E(`==`,2)},vt=[],yt=()=>vt[vt.length-1]??-1,bt=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),xt=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},N=e=>!e.text.endsWith(`.`)&&!cC.has(xt(e)),St=e=>{let t=xt(e);if(cC.has(t))return;let n=bt(e);if(n>=0)return`<${n}>${t}`;let r=yt(),i=vt[vt.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},Ct=e=>{if(e.kind===`Keyword`)return aC.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return vt.length===0;if(e.text[1]===`+`||vt.length===0)return!0;let t=yt();return t>=0&&bt(e)>t},wt=e=>{let t=bt(e),n=vt.length-1,r=vt[n-1]??-1,i=vt[n]<0;return i&&(vt[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:vt[n]===t},Tt=()=>{let e=S();return e.kind===`Step`?N(e):e.kind===`Keyword`?_C.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!_t()},Et=()=>{let e=a,t=S();return t.kind===`Operator`&&!$S.has(t.text)&&TC(t.text)?(a++,x({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:_(t)},e)):O(`MODULE`)?x({kind:`ModuleFact`,name:de(),location:_(t)},e):j()},Dt=()=>{let e=a,t=S(),n=ve(()=>{let e=S();if((e.kind!==`Identifier`||C(e))&&e.kind!==`Operator`)throw ae(`Expected a definition name but found ${ne(e)}`,e);return a++,e.text},`!`),r=_(t);return x(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},Ot=()=>ve(r?Dt:Et),kt=()=>{let e=oe(j);if(!e)return[];let t=[e];return ce(()=>{for(;E(`,`);){let e=oe(()=>(D(),j()));if(!e)return;t.push(e)}}),t},At=()=>{let e=r?kt():Tt()?ve(Et):[],t=O(`DEF`)||O(`DEFS`);if(r&&e.length===0&&!t)throw ae(`Expected a fact`);return{facts:e,defs:t?Ot():[]}},jt=()=>{let e=a,t=D(),n=t.text===`USE`&&O(`ONLY`),r=b(e);return x({kind:t.text===`USE`?`Use`:`Hide`,isOnly:n,...At(),keyword:r,location:_(t)},e)},Mt=()=>{let e=a,t=_(S()),n=O(`NEW`),i=r?a:e,o=r?_(S()):t,s=S().kind===`Keyword`?vC.get(S().text):void 0;if(!n&&s===void 0)throw ae(`Expected a declaration but found ${ne(S())}`);if(s!==void 0&&D(),s===`Variable`){let e=fe();return x({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:o},i)}let c=pt(),l=(s??`Constant`)===`Constant`&&E(`\\in`);if(l&&c.arity>0)throw T(`declared symbol with arguments before \\in`);return l&&D(),x({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?j():void 0,nameRange:c.location.range,location:o},i)},Nt=()=>{if(S().kind===`Identifier`&&E(`::`,1)&&E(`ASSUME`,2)&&(D(),D()),E(`ASSUME`))return Ft();if(S().kind===`Keyword`&&yC.has(S().text))return r?se(Mt):Mt();if(!r)return j();let e=oe(j);if(e===void 0)throw ae(`Expected a hypothesis`);return e},Pt=()=>{let e=[Nt()];return ce(()=>{for(;;){let t=oe(()=>(k(`,`),Nt()));if(t===void 0)break;e.push(t)}}),e},Ft=()=>{let e=a,t=_(k(`ASSUME`)),n=()=>{let n=r?Pt():ve(Nt);return k(`PROVE`),x({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)};return r?se(n):n()},It=e=>{let t=0;for(;S(t).kind===`Identifier`&&E(`,`,t+1);)t+=2;return S(t).kind===`Identifier`&&E(e,t+1)},Lt=()=>{let e=S();if(E(`USE`)||E(`HIDE`))return jt();if(!r&&E(`INSTANCE`)){let t=a;return x(ft(void 0,[],!1,_(e)),t)}if(E(`DEFINE`)||_t()){let t=a;O(`DEFINE`);let n=[lt(!1)];for(;_t();)n.push(lt(!1));let r={kind:`Define`,definitions:n,location:_(e)};return x(r,t)}if(O(`HAVE`))return{kind:`Have`,expression:j()};if(O(`TAKE`)){let e=ye(),t=pe(e?[]:ve(fe)),n=e?Ce():[];return{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(O(`WITNESS`))return{kind:`Witness`,expressions:ve(()=>j())};if(O(`PICK`)){let e=It(`:`),t=pe(e?ve(fe):[]),n=e?[]:Ce();return k(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return O(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:O(`SUFFICES`),statement:E(`ASSUME`)?Ft():j()}},Rt=e=>{let n=S();if(n.kind!==`Step`)throw ae(`Expected a step number but found ${ne(n)}`,n);if(!wt(n))throw T(`${e?`QED step`:`step`}'s number has bad level`,n);if(t!==`sany`&&bt(n)<0&&St(n)!==void 0)throw T(`<*> and <+> cannot be used for a named step`,n);return a++,{name:St(n),token:n.text,location:_(n)}},zt=()=>{let e=a,t=Rt(E(`QED`,1)),n=a,r=O(`QED`)?{kind:`Qed`}:Lt(),i=b(e),o=b(n),s=Ct(S());if(s&&!oC.has(r.kind))throw T(`Proof of a step that does not take a proof`);let c=s?Ht():void 0;return x({...t,body:r,head:i,statement:o,proof:c},e)},Bt=e=>{if(O(`BY`)){let t=b(a-1);return{kind:`By`,isOnly:O(`ONLY`),...At(),keyword:t,location:e}}let t=S();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;D();let n=b(a-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Vt=()=>{let e=_(S());O(`PROOF`);let t=Bt(e);if(t)return t;let n=[zt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(zt());return{kind:`Steps`,level:yt(),steps:n,location:e}},Ht=()=>{let e=a;vt.push(-1);let t=Vt();return vt.pop(),x(t,e)},Ut=()=>S().kind===`Step`||S().kind===`Keyword`&&aC.has(S().text),Wt=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return fC(e);let n=t.defs[t.defs.length-1]?.location.range;return dC(fC({...e,end:e.start}),fC(n??t.keyword))},Gt=()=>{let e=a,t=_(S()),n=O(`PROOF`),r=Bt(t);if(r){let t=x(r,e);return{kind:`Leaf`,proof:t,span:fC(t.keyword),first:e,end:a-1}}let i=S();if(i.kind!==`Step`)throw ae(`Expected a step number but found ${ne(i)}`);let o=a;D();let s=a,c=O(`QED`)?{kind:`Qed`}:Lt(),l=b(o);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:b(s),span:Wt(l,c),first:e,start:o,end:a-1}},Kt=(e,t,n,r)=>{let a=e[t];if(!a)return{proof:void 0,span:r,next:t,end:void 0};if(a.kind===`Leaf`)return{proof:a.proof,span:a.span,next:t+1,end:a.end};let o=qt(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={..._(i[a.first]),range:b(a.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},qt=(e,t,n,r,i)=>{let a=e[t];if(!a)throw gC(`Unexpected end of (sub)proof at level ${n} before QED step`,r,hC);if(a.kind===`Leaf`)throw gC(`Expecting a proof step but found a${lC[a.proof.kind]} leaf proof`,a.span,hC);if(!i&&a.isProof)throw gC(`PROOF keyword found in step that does not begin subproof`,a.span,mC);let o=a.token.text[1];if(o===`+`&&!i)throw gC(`<+> used but no subproof expected`,a.span,mC);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:bt(a.token);if(s<n||!i&&s>n)return;let c=oC.has(a.body.kind)?Kt(e,t+1,s+1,a.span):{proof:void 0,span:a.span,next:t+1,end:void 0},l=c.end??a.end,u={name:St(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{..._(a.token),range:b(a.start,l)}},d=dC(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=qt(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:dC(d,f.span)}},Jt=()=>{if(!Ut())return;let e=[];for(;Ut();)e.push(Gt());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=Kt(e,0,0,t.span),r=e[n.next];if(r)throw gC(`extra step(s) after finished proof`,r.span,pC,`Proof.Parser.toplevel`);return n.proof},Yt=(e,t,n,r)=>{e.definitions.some(e=>e.name===t)||e.definitions.push({kind:`Operator`,name:t,params:[],body:n,isLocal:!1,isRecursive:!1,location:r})},Xt=()=>{if(S().kind!==`Identifier`||!E(`==`,1))return;let e=de();return D(),e},Zt=()=>{if(!r)return j();let e=te(),t=oe(j);if(t)return t;throw ae(`Expected "====" but found ${ne(e)}`,e)},Qt=e=>{let t=a,n=D(),i=Xt(),o=E(`ASSUME`)?Ft():Zt(),s=r?Jt():Ct(S())?Ht():void 0,c=x({name:i,statement:o,proof:s,location:_(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),i!==void 0&&o.kind!==`AssumeProve`&&Yt(e,i,o,c.location)},$t=()=>{let e=a,t=D(),n=Xt();return x({name:n,expression:j(),isAxiom:t.text===`AXIOM`,location:_(t)},e)},en=()=>{let e=_(k(`----`));k(`MODULE`);let t=ge();k(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(d.push(n),u.push(/* @__PURE__ */ new Set),O(`EXTENDS`)&&ve(()=>{let e=a;n.extends.push(ge()),n.extendsRanges.push(b(e))});;){let t=a,r=S();if(r.kind===`ModuleEnd`)return e.range={module:d[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},d.pop(),u.pop(),n;if(r.kind===`Separator`){if(E(`MODULE`,1)){let e=en();n.modules.push(e),n.units.push({kind:`Module`,module:e}),k(`====`);continue}D()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=_(D()),r=ht();n.constants.push(...r),e.range=b(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=_(D()),r=ve(()=>{let e=a,t=_(S());return x({name:de(),arity:0,location:t},e)});n.variables.push(...r),e.range=b(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=$t();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&Yt(n,e.name,e.expression,e.location);continue}case`USE`:case`HIDE`:{if(E(`USE`)&&E(`ONLY`,1))throw ae(`Expected a module unit but found ${ne(r)}`);let e=jt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=_(D()),r=M();e.range=b(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:tn(n,x(ft(void 0,[],!1,_(r)),t));continue;case`LOCAL`:if(D(),E(`INSTANCE`)){tn(n,x(ft(void 0,[],!0,_(r)),t));continue}tn(n,x(dt(!0),t));continue}r.kind===`Keyword`&&iC.has(r.text)?Qt(n):tn(n,lt(!1))}}},tn=(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}))},nn=en(),rn=he?BS(e):void 0;if(rn!==void 0)throw new s(rn);return nn},kC=e=>OC(e,`tlc`),AC=(e,t)=>OC(e,`tlc`,t),jC=e=>OC(e,`tlapm`),MC=e=>OC(e,`sany`),NC=/* @__PURE__ */ new WeakMap,PC=(e,t)=>e.forEach(e=>{let n=t.find(t=>t.isRecursive&&t.name===e.name);n&&NC.set(n,e.arity)}),FC=e=>{switch(e.kind){case`Name`:return e.name;case`Operand`:return typeof e.operand==`number`?`argument selector ${e.operand}`:e.operand;case`Bound`:return`!(...)`;case`At`:return`@`;case`Colon`:return`:`}},IC=(e,t,n)=>({operator:e,range:t,args:n,params:n.map(()=>0)}),LC=(e,t)=>new s(`${e} at line ${t.line}, column ${t.column}`),RC=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return RC(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of mt(e)){let e=RC(r,t,n);if(e)return e}},zC=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),BC=(e,t)=>{let n=e.location,r=zC(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 LC(`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 LC(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:dc,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:dc,args:e.args,location:n,resolution:uc},location:n}},VC=(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:uc})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:uc}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:uc};return BC({...t,params:[...t.params,...r]},a)},HC=(e,t,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s=0,c,l=!1,u=[],d=[],f,p=(e,t)=>{!f&&e&&(f={location:g(e),message:t})},m=(e,t)=>{let n=r.selectorRanges?.[s];e&&n&&u.push({node:e,error:{location:g(n),message:t}})},h=(e,t)=>{if(!e)throw LC(t,a);pc.set(r,{applications:d,nulls:u,error:{location:g(e),message:t}}),l=!0},_=n=>{let r=[],i=[];for(;s<e.length;){let o=e[s];if(o.kind!==`Name`&&!n)return;if(o.kind!==`Name`)throw LC(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=n?n.find(e=>nu(e)===c):t(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s++}throw LC(`Unknown operator ${r.join(`!`)}`,a)},v=t=>{let n=_(t);if(!n){l=!0;return}let u=n.definition,f=NC.get(u)??Tc(u),m=s===e.length-1;if(n.args.length!==f){let e=r.argumentRanges?.[s]??a.range,t=`The operator ${ic(n.name)} requires ${f-n.earlier} arguments.`;if(!i||n.args.length!==0)return h(e,t);p(e,t)}if(n.args.forEach((e,t)=>gc.set(e,{operator:n.name,index:t,range:r.selectorRanges?.[s]})),m)return{definition:u,args:n.args};let g=u.location.range,v=NC.has(u)&&g?.module===a.range?.module&&Cc(a,u.location);if(d.push({operator:n.name,range:r.selectorRanges?.[s],args:n.args,params:v?Array(f).fill(0):Ec(u)}),u.isRecursive&&g&&g.module===a.range?.module&&Cc(a,g.end))return h(r.selectorRanges?.[s],`Subexpression of \`${n.name}' used inside the operator's definition.`);if(u.kind!==`Operator`)throw LC(`Cannot select a subexpression of ${u.name}`,a);o.params.push(...u.params),o.args.push(...n.args),c=u.body,s++},y=()=>{for(;s<e.length&&!l;){let t=e[s];if(t.kind!==`Name`)return;let n=r.selectorRanges?.[s],a=c&&RC(c,t.name,[]);if(!a)return h(n,`Cannot find label \`${t.name}'.`);let l=a.label.params;if(t.args.length!==l.length){let e=`Label \`${t.name}' used with wrong number of arguments.`;if(!i)return h(n,e);p(n,e)}o.lets.push(...a.lets),o.params.push(...l.map(e=>({name:e,arity:0}))),o.args.push(...t.args),d.push(IC(t.name,n,t.args)),c=a.label.body,s++}},ee=i=>{if(!c)throw LC(`Subexpression selection failed`,a);if(i.kind===`Colon`)return;let l=r.selectorRanges?.[s],u=c.location.range;if((c.kind===`Subexpression`||c.kind===`Identifier`&&c.name.includes(`!`)||c.kind===`Apply`&&c.operator.includes(`!`))&&(u?.module!==a.range?.module||Cc(c.location,a))){let e=GC(c,t,n);if(pc.has(e)){h(l,`Choosing operand \`${FC(i)}' of subexpression with no operands.`);return}fc.has(e)&&e.kind!==`Lambda`&&(c=e.kind===`Let`&&e.body.kind===`Apply`&&e.body.operator===`$subexpression`?e.body:{kind:`Tuple`,elements:[e],location:e.location})}if(c.kind===`Label`){c=c.body,ee(i);return}let f=`Nonexistent operand specified by \`${FC(i)}'.`;if(c.kind===`Let`){if(i.kind!==`Operand`||Zc(i.operand,1)!==0){h(l,`A LET/IN expression has only one operand.`);return}o.lets.push(c.definitions),c=c.body;return}let p=tl(c);if(p&&(i.kind===`Bound`||i.kind===`At`)){o.params.push(...p.names.map(e=>({name:e,arity:0}))),i.kind===`Bound`&&(o.args.push(...i.args),d.push(IC(``,l,i.args))),c=p.body;return}if(c.kind===`Case`){let t=[...c.arms,...c.other?[{condition:void 0,body:c.other}]:[]];if(s===e.length-1){h(l,`Subexpression of CASE must have form !i!j.`);return}let n=i.kind===`Operand`?t[Zc(i.operand,t.length)]:void 0;if(!n){h(l,f);return}s++;let a=e[s],o=a.kind===`Operand`?Zc(a.operand,2):-1,u=r.selectorRanges?.[s];if(o===-1){h(u,`Second selector for CASE subexpression must specify one of two operands.`);return}let d=o===0?n.condition:n.body;if(!d){h(u,`Selecting OTHER in a CASE statement.`);return}c=d;return}if(c.kind===`Except`&&i.kind===`Operand`&&Zc(i.operand,c.updates.length+1)>0){h(l,`Selecting subexpression of an EXCEPT not yet implemented.`);return}let m=p?p.sets:nl(c);if(!m&&c.kind!==`Identifier`){h(l,`Selecting subexpression of expression that has none.`);return}if(i.kind!==`Operand`){h(l,f);return}let g=m?.[Zc(i.operand,m.length)];g?c=g:h(l,f)},b=v(void 0);if(l)return r;if(b)return VC(b.definition,{...o,args:b.args});for(y();s<e.length&&!l;){let t=e[s];if(t.kind===`Name`){for(;c?.kind===`Label`;)c=c.body;if(c?.kind!==`Let`)return h(r.selectorRanges?.[s-1],`A name selector here must be from a LET clause.`),r;o.lets.push(c.definitions);let e=v(c.definitions);if(l)return r;if(e)return VC(e.definition,{...o,args:[...o.args,...e.args]});y()}else t.kind!==`Colon`&&m(c,`Subexpression selection failed, probably due to an error in the selected expression.`),ee(t),m(c,`An unexpected null node specified by '${FC(e[s])}'.\nThis is probably due to a previous error.`),s++}if(l)return r;if(!c)throw LC(`Subexpression selection failed`,a);let x=o.params.length,te=o.args.length;if(x!==te){let e=`Expected ${x} arguments but found ${te}.`;if(!i||te>0)return h(a.range,e),r;p(a.range,e)}let S=BC(o,c);return _c.set(S,u),f&&mc.set(S,f),S},UC=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return Qc(e,t,n)},WC=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||mt(e).some(WC),GC=(e,t,n,r=!1)=>{if(!WC(e))return e;if(e.kind===`Let`){e.recursive&&PC(e.recursive,e.definitions);let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=t=>!e.definitions.some(e=>e.name===t)&&n(t),a=au(e,e=>GC(e,r,i));return a.kind===`Let`&&a.instances?{...a,instances:a.instances.map(e=>KC(e,r,i))}:a}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>GC(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:au(e,e=>GC(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?UC(a.name,[],void 0,t):a.kind===`Apply`?UC(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o)return a;let c=o.findIndex(e=>e.kind!==`Name`),l=o.slice(0,c===-1?o.length:c),u=l.some((e,n)=>n>0&&t(l.slice(0,n+1).map(FC).join(`!`)));if(s?.kind===`Name`&&n(s.name)&&!u||s?.kind===`Name`&&o[1].kind!==`Name`&&!t(s.name))return a;let d=HC(o,t,n,a,r);return d!==a&&fc.add(d),d},KC=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:GC(e.expression,t,n,!0)}))}),qC=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},JC=(e,t)=>KC(e,qC(t.definitions),()=>!1),YC=(e,t)=>{let n=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),r=e.theorems.flatMap(e=>{let t=e.statement;if(e.name===void 0||t.kind!==`AssumeProve`)return[];let n=t.assumptions.filter(e=>e.kind!==`NewSymbol`&&e.kind!==`AssumeProve`);return n.length===t.assumptions.length?[{kind:`Operator`,name:e.name,params:[],body:{kind:`Tuple`,elements:[...n,t.conclusion],location:t.location},isLocal:!0,isRecursive:!1,location:e.location}]:[]}),i=/* @__PURE__ */ new Set([...e.definitions,...r]);PC(e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]),e.definitions);let a=new Map(e.units.flatMap(e=>e.kind===`Recursive`?e.declarations.map(e=>[e.name,e.location]):[])),o=(e,t)=>{let n=a.get(e.name);return Cc(e.location,t)||e.isRecursive&&n!==void 0&&Cc(n,t)},s=(e,t)=>n=>{let r=e(n);return r&&(!i.has(r)||o(r,t))?r:void 0},c=qC([...t,...e.definitions]),l=e=>n.has(e),u=qC([...t,...e.definitions,...r]),d=(e,t)=>GC(e,s(u,t),e=>l(e)&&r.every(t=>t.name!==e)),f=e=>{let t=t=>l(t)||!e(t),n=n=>GC(n,e,t),r=e=>{let t=e.map(e=>e.kind===`ModuleFact`?e:n(e));return hc.set(t,e),t},i=e=>e.map(e=>({...e,set:n(e.set)})),a=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&n(e.set)}:a(e)),conclusion:n(e.conclusion)}:n(e),o=o=>{switch(o.kind){case`Use`:case`Hide`:return{...o,facts:r(o.facts)};case`Instance`:return KC(o,e,t);case`Define`:return{...o,definitions:o.definitions.map(r=>r.kind===`Instance`?KC(r,e,t):iu(r,n))};case`Have`:case`Case`:return{...o,expression:n(o.expression)};case`Witness`:return{...o,expressions:o.expressions.map(n)};case`Take`:return{...o,bounds:i(o.bounds)};case`Pick`:return{...o,bounds:i(o.bounds),body:n(o.body)};case`Assert`:return{...o,statement:a(o.statement)};default:return o}},s=t=>{if(t?.kind===`By`)return{...t,facts:r(t.facts)};if(t?.kind!==`Steps`)return t;let n={lookup:e,resolveStep:o,resolveProof:s};return{...t,steps:t.steps.map(e=>{let t={...e,body:n.resolveStep(e.body),proof:n.resolveProof(e.proof)};if(e.body.kind===`Define`){let t=e.body.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),r=n.lookup;n=f(e=>t.find(t=>t.name===e)??r(e))}return t})}};return{lookup:e,resolveFacts:r,resolveStatement:a,resolveStep:o,resolveProof:s}},p={...e,theorems:e.theorems.map(e=>{let t=f(s(c,e.location));return{...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:t.resolveStatement(e.statement),proof:e.proof&&f(s(c,e.proof.location)).resolveProof(e.proof)}}),uses:e.uses.map(e=>({...e,facts:f(s(c,e.location)).resolveFacts(e.facts)}))};return e.definitions.some(e=>WC(e.body))||e.assumptions.some(e=>WC(e.expression))?{...p,definitions:e.definitions.map(e=>iu(e,t=>d(t,e.location))),assumptions:e.assumptions.map(e=>({...e,expression:d(e.expression,e.location)}))}:p},XC=(e,t)=>e.maxLevels[t]??3,ZC=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=Id({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=>Wu(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Wu(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Gu(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Vu(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)&&Wu(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(Ld(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=g(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),l=i(t.module),u=n(t.instancer),d=/* @__PURE__ */ new Map;t.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...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=u.analyze(n,d);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(n,d),i=r.kind===`Operator`?r.data:void 0;return[{...e,level:r.data.level,operator:i,isLeibniz:i===void 0||i.nonLeibniz.size===0}]}),p=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&o(p(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let n=l.constraints.get(e.name);n!==void 0&&e.level>n&&o(p(e.name,n));let r=e.operator;if(r)for(let n=0;n<e.arity;n++){let i=l.argConstraints.get(zu(e.name,n));i!==void 0&&XC(r,n)<i&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${n+1} of the operator ${r.name} \nmust be at least ${i}.`)}}),l.argParams.forEach(e=>{let n=Vu(e),r=f.find(e=>e.name===n.operator)?.operator,i=f.find(e=>e.name===n.param);if(!r||!i)return;let a=XC(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 c([...r.values()])}},QC=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],$C=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),ew=new Map(nc.flatMap(e=>e.map(t=>[t,e[0]]))),tw=e=>ew.get(e)??e,nw=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},rw=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:gt(e)&2147483647,kind:t,isLocal:n}),iw=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:tw(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:tw(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},aw=(e,t)=>{let n=[];for(let r=t;;){let t=iw(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},ow=e=>({line:e.line,column:e.column}),sw=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text!==`.`){if(a.text===`EXTENDS`){let n=aw(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},cw=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,lw={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},uw=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&cw(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&cw(e[n+1],e[n+2])?n+=cw(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=>lw[e])}"`:r.text)}return t},dw=e=>e[2]?.text,fw=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},pw=(e,t)=>e.find(e=>e.name===t)??e.map(e=>pw(e.modules,t)).find(Boolean),mw=e=>{let t=e===void 0?[]:Ee(e),n;return{tokens:t,ranges:fw(t),getModule:()=>n??=e===void 0?kC(``):AC(e,t)}},hw=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=mw(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:t?.(i)??cc.get(i)??im.get(i)??DC(e,i),c=a(s),l=c.tokens,u=c.ranges.get(dw(l)??``)??{start:0,end:0},d={tokens:l,...u,getModule:c.getModule};return n.set(i??``,d),c.ranges.forEach((e,t)=>{e.start===u.start||r.has(t)||r.set(t,{tokens:l,...e,getModule:()=>pw(d.getModule().modules,t)??d.getModule()})}),d};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},gw=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=aw(t,e+1);i.push({location:ow(t[e]),apply:e=>r.forEach(t=>e.put(rw(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c=new Set(n.units.flatMap(e=>e.kind===`Constants`||e.kind===`Variables`?[`${e.location.line}:${e.location.column}`]:[])),l=0;t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r;if(n.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l++,l===2){let e=t[u+2].text;i.push({location:ow(n),apply:t=>t.put(rw(e,`module`,!1))})}return}if(n.kind===`ModuleEnd`&&l--,l!==1||n.kind!==`Keyword`)return;let d=c.has(`${n.line}:${n.column}`);d&&(n.text===`CONSTANT`||n.text===`CONSTANTS`)&&o(u,`constant`),d&&(n.text===`VARIABLE`||n.text===`VARIABLES`)&&o(u,`variable`),n.text===`RECURSIVE`&&aw(t,u+1).every(e=>s.has(e))&&o(u,`definition`),$C.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(ow(n)),i.push({location:ow(n),apply:e=>e.put(rw(t[u+1].text,`theorem`,!1))}))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(rw(t,`theorem`,!1))})});let u=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(u(e.location))return;let t=tw(e.name);i.push({location:e.location,apply:n=>n.put(rw(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(rw(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(rw(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>Cc(e.location,t.location)?-1:+!!Cc(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=nw();n.set(i??``,o),tc.toReversed().forEach(e=>o.put(rw(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},_w=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=e=>{r.add(e)},a=e=>{e.kind===`ModelValue`&&i(e.name),e.kind===`String`&&i(e.value),e.kind===`Set`&&e.elements.forEach(a)};t.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),ac.forEach(i);let o=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=sw(o(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),g=m(e=>e.instances),_=/* @__PURE__ */ new Set([void 0]),v=/* @__PURE__ */ new Map;uw(o(void 0)).forEach((e,t)=>{t===3&&sc.forEach(i),i(e)});let y=l(void 0);for(;;){let t=h(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!t)break;let[n,r]=t;if(d.add(`${n.key}>${r}`),v.set(n.unit,[...v.get(n.unit)??[],r]),!_.has(r)){if(_.add(r),e(r).tokens.length===0){let t=n.unit??dw(e(void 0).tokens);throw te(r,t)}uw(o(r)).forEach(i)}}QC.forEach(i);let ee=/* @__PURE__ */ new Set,b=e=>{if(ee.has(e))return;ee.add(e);let t=v.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(b),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return b(void 0),n.forEach(e=>{let t=o(e);uw(t).forEach(i),t.forEach(e=>{e.kind===`String`&&i(e.text)})}),oc.forEach(i),[...r]},vw=(e,t)=>{let n=hw(e,t),r=n.getParsed,i,a=()=>i??=gw(r);return{getStringOrder:(e,t)=>_w(r,e,t),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},yw=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),bw=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],xw=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof s))throw n;let r=BS(e);throw r===void 0?n:c([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},Sw=e=>new s(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),Cw=(e,t)=>e.location.range&&t.location.range&&{location:g(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${g(t.location.range)}.`},ww=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,Tw=e=>e===`Theorem`?`ThmOrAssumpDefNode`:ww(e),Ew=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:Cu(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),Dw=(e,t)=>{let n=ht(e);return n!==void 0&&t.has(n)||mt(e).some(e=>Dw(e,t))},Ow=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(vu(e),n.get(e)??n.size)),n},kw=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Aw=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Kg(e);if(e.kind===`Number`&&!hn(e.value))throw qg(e);Aw(e.kind===`Let`?[...mt(e),...kw(e.instances??[])]:mt(e))}),jw=(e,t)=>{let n=t.order??vw(t.source,t.loadModule),r=n.parseModule(t.source),i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Set,f=new Map(hm.map(e=>[e.name,e])),p=/* @__PURE__ */ new Map,m=jp(e.checkDeadlock,t.seed);m.isWarningEnabled=t.isWarningEnabled??!0,m.isTool=t.isTool??!1,m.version=t.version??`master`,m.readLine=t.readLine;let h=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Map,v=[],y=/* @__PURE__ */ new Map,ee=[],b=[],x=(e,t)=>ee.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),S=0,ne=e=>`${e}#${S++}`,re=[],T=[],ie=ZC(e=>{let t=_.get(e)??O(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>i.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>i.get(t.visible.get(e)?.key??e)}}),ae=/* @__PURE__ */ new Map,oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,ce=e=>{let n=p.get(e);if(n)return n;let r=Lm(e,t.print,m,t.files,f);if(!r)return;Fm.get(e)?.forEach(ce);let i=/* @__PURE__ */ new Map;return Im.get(e)?.forEach(e=>ce(e)?.forEach((e,t)=>i.set(t,e))),r.forEach(t=>{f.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Iu.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Ru(e,t.name)??i.get(t.name)?.range})}),p.set(e,i),i},le=e=>{let n=Fm.get(e)??[];if(e===`TLCExt`||[e,...n].some(e=>t.loadModule?.(e)!==void 0))return;let r=ce(e);return r&&x(e,n),r&&n.includes(`Integers`)&&ce(`Integers`),r},E=e=>(Aw([...e.definitions.flatMap(pt),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...kw(e.instances)]),e.modules.forEach(E),e);E(r);let D=(e,r)=>{let i=t.loadModule?.(e)??om(m.version).get(e)??DC(t.source,e);if(i===void 0)throw te(e,r);let a=xw(i,e,n);if(a.name!==e)throw c([{location:`Unknown location`,message:`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return E(a)},ue=e=>{let t=b.indexOf(e.name);if(t!==-1){let n=[...b.slice(t),e.name].map(e=>`${e}.tla`);throw new s(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];b.push(e.name),ee.push(n);let o=ve(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:T,levelChecks:a});if(ee.pop(),b.pop(),i.length>0)throw c(i,!1,void 0,T);let l=r.find(e=>n.has(e.name)),u=l&&h.get(l.name),d=u&&Cw(l,u.module);if(d)throw c([d],!1,void 0,T);if(l)throw Sw(l);return a.forEach(e=>e()),{linked:o,closure:n}},O=(e,n)=>{let r=h.get(e);if(r)return x(e,y.get(e)??[]),r;let a=ue(D(e,n)),o=/* @__PURE__ */ new Map;return Pm(e,t.print,m,t.files,f,(e,t,n)=>{let r=o.get(e),i=t.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(r?.kind!==`Operator`||!n||i.length!==t.length)throw new w(`No definition of ${e} to fall back to`);return W(r.body,{environment:n.environment,scope:$_(z_(r),i,n),state:n.state,next:n.next,isKeepLazy:n.isKeepLazy})})?.forEach(t=>{let n=a.linked.visible.get(t.name);if(n?.kind!==`Definition`||n.arity!==t.arity&&yw.has(e))return;let r=i.get(n.key);r&&o.set(t.name,r),f.set(n.key,t),i.delete(n.key)}),h.set(e,a.linked),y.set(e,a.closure),x(e,a.closure),a.linked},k=(e,t,n,r,s)=>{let c=s?void 0:le(e.module);if(c)return de(e,c);let d=s??O(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=bw(d),p=`#${S++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=ql(JC(e,t),f,t,n);re.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>u.add(e));let _=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,v=ju({params:g,substitutions:new Map([...h].map(e=>[e[0],$l(e[1],m)])),variables:new Set(d.variables),getDefinition:e=>i.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>a.get(e)===!0,addDefinition:(n,s,c)=>{let u=ne(`${s}@${t.name}`),d=c(u);return i.set(u,d),f.length>0&&l.add(d),e.name!==void 0&&oe.set(u,`${e.name}!${oe.get(n)??s}`),a.set(u,!r),o.set(u,{source:n,prefix:e.params.length}),u},createName:ne,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return fe(e,d.exported,f,(t,n)=>{let r=e.name===void 0?v.getKey(t):v.getQualifiedKey(t);return f.length>0&&ae.set(r,{name:n,location:e.location}),e.name!==void 0&&se.set(r,n),r})},de=(e,t)=>e.name===void 0?t:new Map([...t].map(t=>[`${e.name}!${t[0]}`,{key:t[1].key,arity:t[1].arity,params:t[1].params,kind:t[1].kind}])),fe=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(e=>!i.has(e[0])).map(t=>{if(e.name===void 0)return[t[0],{key:r(t[1].key,t[0]),arity:t[1].arity,params:t[1].params,kind:t[1].kind,range:a.get(t[1].key)===!0?e.location.range:t[1].range}];let n=`${e.name}!${t[0]}`;return[n,{key:r(t[1].key,n),arity:t[1].arity+e.params.length,params:t[1].params&&[...e.params.map(e=>e.arity),...t[1].params],kind:t[1].kind}]}))},pe=(e,t)=>Array.from({length:e},(e,n)=>({name:`argument${n}`,arity:t?.[n]??0})),me=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=pe(t.arity,void 0);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:wu(r,n),location:n}}},he=(e,t,n,r)=>{let o=e.location,s=r?void 0:le(e.module);if(s)return e.name===void 0?[]:[...s].map(t=>{let n=pe(t[1].arity,t[1].params);return Tu(`${e.name}!${t[0]}`,t[1].key,[...e.params,...n],n,o)});let c=r??O(e.module,n),l=`#${S++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=bw(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};re.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=>Dw(f(e),p),h=d.map(t=>{let n=me(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=[],_=ju({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:wu(e.params,o),location:o,resolution:uc}:Cu(`${t.name}${l}`,o)])),variables:new Set(c.variables),getDefinition:e=>i.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>a.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}:Ew(a,i)),i},createName:ne}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(e=>!v.has(e[0])).map(t=>{let n=_.getKey(t[1].key),r=pe(t[1].arity,t[1].params),i=[...e.params,...r];return Tu(e.name===void 0?t[0]:`${e.name}!${t[0]}`,n,i,n===t[1].key?r:i,o)});return[...h,...g,...y]},ge=e=>[...e].flatMap(e=>{let t=i.get(e[1].key);return t?[{...t,name:e[0]}]:[]}),_e=/* @__PURE__ */ new Map,ve=(e,n)=>{let o=yx(e,t.loadClass?.(e.name),e===r);_e.set(e.name,o.overrides);let s=o.module,c=re.length,l=new Map([...hm.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...n.symbols]),u=/* @__PURE__ */ new Map,d={location:Hl,errors:[],warnings:[]},f=[d],p=e=>e.forEach((e,t)=>{let n=m.get(t);if(!n){l.set(t,e),m.set(t,e);return}if(!n.range||!e.range||g(n.range)===g(e.range))return;let r=g(e.range),i=g(n.range);Tw(n.kind)===Tw(e.kind)?d.warnings.push({location:r,message:`Warning: the ${ww(n.kind)} of '${t}' conflicts with \nits ${ww(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${ww(e.kind)} of '${t}' conflicts with \nits ${ww(n.kind)} at ${i}.`})}),m=/* @__PURE__ */ new Map,h=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,ee=[],b=[...s.constants],x=s.variables.filter((e,t)=>s.variables.findIndex(t=>t.name===e.name)===t),te=x.map(e=>e.name),S=x.map(e=>e.location);s.extends.forEach(e=>{let t=n.modules.get(e),r=t?void 0:le(e);if(r){p(r);return}let i=t??O(e,s.name);b.push(...i.constants.filter(e=>b.every(t=>t.name!==e.name)&&!te.includes(e.name))),i.variables.forEach((e,t)=>{te.includes(e)||b.some(t=>t.name===e)||(te.push(e),S.push(i.variableLocations[t]))}),p(i.exported),i.facts.forEach(e=>h.add(e)),i.modules.forEach((e,t)=>y.set(t,e)),ee.push(i)});let ne=new Map(l),C=[...s.constants.map(e=>({...e,kind:`Constant`})),...s.variables.map(e=>({...e,kind:`Variable`}))],w=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});C.forEach(e=>m.set(e.name,w(e)));let ae=e=>({key:ce(e),arity:Tc(e),params:Ec(e),kind:Ul(s,e)?`Theorem`:`Definition`,range:e.location.range}),oe=b.length===0&&te.length===0,ce=e=>s===r?e.name:`${e.name}@${n.id}`,E=/* @__PURE__ */ new Map,D=()=>new Map([...n.modules,...y]),ue=e=>{let t=s.modules.find(t=>t.name===e.module);return t?Cc(t.location,e.location)?y.get(t.name):void 0:D().get(e.module)},pe=e=>({imported:l,getInstance:e=>{let t=ue(e),n=t?void 0:le(e.module);if(n)return{declarations:[],symbols:de(e,n),instancer:s.name};let r=t??O(e.module,s.name),i=bw(r);return{declarations:i,symbols:fe(e,r.exported,i,e=>e),instancer:s.name}},bound:ne,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:ce,instanced:E,facts:h,reports:f,warnings:n.warnings}),me=e=>[...C.filter(t=>Cc(t.location,e)).map(e=>[e.name,w(e)]),...s.definitions.filter(t=>Cc(t.location,e)).map(e=>[e.name,ae(e)])].reduce((e,t)=>e.has(t[0])?e:e.set(t[0],t[1]),new Map(l)),ye=e=>{let t=D(),r=t.get(e.name),i=r&&Cw(e,r.module);if(r&&!i)throw Sw(e);n.nested.push(e);let a={location:e.location,errors:[],warnings:[]};f.push(a);let o=ve(e,{id:`${n.id}/${e.name}`,symbols:me(e.location),modules:t,nested:n.nested,errors:a.errors,warnings:a.warnings,levelChecks:n.levelChecks});i&&a.errors.push(i),r||y.set(e.name,o)};[...s.instances.map(e=>({location:e.location,link:()=>{let t=k(e,s,pe(s),oe,D().get(e.module));E.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||m.set(n,t))})}})),...s.modules.map(e=>({location:e.location,link:()=>ye(e)}))].sort((e,t)=>Cc(e.location,t.location)?-1:1).forEach(e=>e.link());let be=YC(Fu(s,(e,t)=>he(e,t,s.name,ue(e))),ge(l));n.errors.push(...Yl(be,pe(be))),be.definitions.forEach(e=>{let t=ce(e);i.set(t,e),a.set(t,!oe);let n=ae(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!Cc(r,e.location))&&(l.set(e.name,n),e.isLocal||m.set(e.name,n))});let xe={module:be,constants:b,variables:te,variableLocations:S,visible:l,exported:m,modules:y,extended:ee,facts:/* @__PURE__ */ new Set([...h,...[...be.theorems,...be.assumptions].flatMap(e=>e.name??[])])};_.has(s.name)||_.set(s.name,xe);let Se=re.splice(c).map(e=>({location:e.location,check:()=>ie(e)}));return n.levelChecks.push(()=>Rd(be,{constants:new Set(b.map(e=>e.name)),variables:new Set(te),getDefinition:e=>i.get(l.get(e)?.key??e),getQualifiedName:e=>se.get(l.get(e)?.key??e)},Se,T)),v.push(xe),xe},ye=ue(r).linked,be=t.traceFile,xe=be===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:be}}],Se=[...t.moduleOperators??[],...xe].map(e=>{let t=O(e.module,r.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});v.push(...v.splice(v.indexOf(ye),1)),T.length>0&&!t.isSanyReported&&t.print(d(T));let Ce=t.runtimeInvariants??[];Ce.forEach(e=>{if(e.module===void 0)return;h.set(r.name,ye);let t=O(e.module,r.name);v.splice(v.indexOf(t),1);let n=i.get(t.visible.get(e.name)?.key??e.name);n&&i.set(e.name,n)}),ye.visible.forEach((e,t)=>{let n=i.get(e.key);n&&e.key!==t&&i.set(t,n)}),Se.forEach(e=>{let t=e.key===void 0?void 0:i.get(e.key);e.kind!==`postcondition`&&t&&i.set(e.operator,t)});let we=[],Te=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Te(e,t)),we.push(...e.module.assumptions))};Te(ye,/* @__PURE__ */ new Set);let Ee=ye.constants.map(e=>e.name),De=ye.variables,Oe=ox(e,{root:ye,moduleSymbols:new Map([...p,...[...h].map(e=>[e[0],e[1].visible]),[r.name,ye.visible]]),definitions:i,builtins:f,copySources:o,operatorConstants:new Map(Se.flatMap(e=>O(e.module,r.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:n}),ke=Oe.constants,A=Oe.substitutions;be!==void 0&&f.forEach((e,t)=>{let n=bm(e);n&&f.set(t,n)});let Ae=Ow(De,v.flatMap(e=>e.module.variables.map(e=>e.name))),je=Zd({definitions:i,substitutions:A,constants:ke,variableIndex:Ae,builtins:f,variables:De}),Me={runtime:m,definitions:i,builtins:f,constants:ke,substitutions:A,instanceNames:oe,variables:De,variableIndex:Ae,facts:je,startupValues:Array.from({length:je.ids.size},()=>void 0),substitutedDefinitions:l,instanceParams:u,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Ne=Id({constants:new Set(ke.keys()),variables:/* @__PURE__ */ new Set([...De,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>f.has(e))]),getDefinition:e=>s_(e,Me)}),Pe=e=>{try{W(e,{environment:Me,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof w)return e;throw e}};A.forEach((e,t)=>{let n=i.get(e),r=Ee.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ne.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Pe(n.body):void 0;if(r){let n=Nt(r)?``:` - specifically: ${r.message}`;throw new C(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),m.version!==`1.7.4`&&(m.isStarted=!0);let Fe=new Set(v.flatMap(e=>e.module.instances.map(e=>e.module))),Ie=n.createDefinitionOrder();return{environment:Me,assumptions:we,variableLocations:ye.variableLocations,instanceActions:ae,startupDefinitions:v.filter(e=>!Fe.has(e.module.name)||bw(e).length===0).flatMap(e=>Ie(e===ye?void 0:e.module.name).flatMap(t=>{let n=i.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:v.flatMap(e=>_e.get(e.module.name)??[]),moduleOperators:Se,runtimeInvariants:Ce,rootName:r.name}},Mw=e=>[...e].map(e=>`${e[0]}>${e[1].name}`).sort().join(`,`),Nw=(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},Pw=e=>x(new w(`${l}${e}`),S.error),Fw=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!fn(e)||!fn(i))throw Pw(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},Iw=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${Lw(t)}`:n},Lw=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Number`)return e.text??String(e.value);if(e.kind===`SetEnumeration`)return`{${e.elements.map(Lw).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${Iw(e.pattern,e.set)}:${Lw(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(Lw).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${Lw(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>Iw(e.pattern,e.set)).join(`,`)}|->${Lw(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(Lw);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},Rw=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,zw=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new C(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw Pw(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>W(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!ln(a)||!P(a))throw Pw(`The symmetry operator must specify a set of functions.`);let o=F(a).elements;if(!o.every(dn))throw Pw(`The symmetry values must be function records.`);let s=r.body,c=s.kind===`Apply`?s.args:s.kind===`SetEnumeration`?s.elements:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=Lw(Rw(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(St.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;o.map(Fw).forEach(e=>{e.size>0&&d.set(Mw(e),e)});let f=[...d.values()],p=0;for(;p<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p,t).forEach(e=>{let t=Nw(n,e),r=Mw(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!Rw(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>fn(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},Bw=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=Hw(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(Hw(e[r],t));return a}},Vw=(e,t)=>{let n=[],r=[];for(let i of e){let e=Hw(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Zn);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Zn(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},Hw=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=Vw(e.elements,t);return n?nr(n):e}if(n===`Function`||n===`LazyFunction`&&P(e.domain)){let n=I(e),r=Bw(n.domain,t),i=Bw(n.range,t)??n.range;if(r){let e=$r(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?ir(n.domain,e.range):e}return i===n.range?n:ir(n.domain,i)}if(n===`Interval`||!ln(e)||!P(e))return e;let r=F(e),i=Bw(r.elements,t);return i?qr(i):r},Uw=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=Hw(e[o],i),a===0&&(a=Zn(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},Ww={line:0,column:0},Gw=e=>({kind:`Identifier`,name:e,location:Ww}),Kw=e=>({name:e,expression:Gw(e),scope:void 0}),qw=/* @__PURE__ */ new Set([`name`,`property`]),Jw=(e,t,n)=>{let r=s_(t,n);if(!r)throw new C(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new C(qw.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},Yw=e=>e.body.kind===`Number`||e.body.kind===`String`,Xw=(e,t,n)=>n.constants.has(e)?n.constants.get(e):Yw(t)?void 0:F_(t,n),Zw=(e,t,n)=>{if(n.constants.has(t))throw new C(`The ${e} ${t} cannot be a constant.`);let r=Jw(e,t,n);if(Xw(t,r,n)!==void 0)throw new C(`The ${e} ${t} cannot be a constant.`);return r},Qw=(e,t,n)=>{let r=n.constants.has(t)?void 0:Jw(e,t,n),i=r?Xw(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new C(`The ${e} of ${t} is equal to ${L(i)}`);return i===void 0?r:void 0},$w=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},eT=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),I_(e.startupDefinitions,r),t.invariants.forEach(e=>{Qw(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},tT=(e,t)=>{let n=Id({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>t.definitions.get(e)});return e.flatMap(e=>{let r=Qw(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
|
|
1787
|
+
`},wC=(e,t,n,r=`Proof.Parser`)=>new s(e,void 0,{reason:`${e}${n.set}`,line:t.start.line,column:t.start.column,isEnd:!1,proof:{stop:t.stop,exception:r,printed:`${e}${n.printed}`}}),TC=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),EC=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),DC=/* @__PURE__ */ new Set([`NEW`,...EC.keys()]),OC=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),kC=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),AC=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),jC=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?ZS.has(e.operator):rC.has(e.operator)),MC=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,NC=e=>ZS.has(e)||rC.has(e)||e===`-.`,PC=(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}}},FC=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.replace(/\r?\n$/,``).split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
|
|
1788
|
+
`)}\n`},IC=(e,t,n=Ee(e,t===`tlapm`))=>{let r=t===`tlapm`,i=r?n:n.map(xe),a=0,o=[],c,l,u=[],d=[],f,p=0,m=[],h=/* @__PURE__ */ new WeakMap,g=e=>u[u.length-1].has(e),_=e=>({line:e.line,column:r&&e.kind===`String`?e.endColumn:e.column,range:void 0}),v=[],y=[],ee=[],b=(e,t=a-1)=>{let n=e===t?ee[e]:void 0;if(n)return n;let r=i[t];v[e]??=_(i[e]),y[t]??={line:r.line,column:r.endColumn};let o={module:d[0].name,start:v[e],end:y[t]};return e===t&&(ee[e]=o),o},x=(e,t)=>(e.location.range=b(t),e),te=(e=0)=>i[Math.min(a+e,i.length-1)],S=(e=0)=>{let t=te(e),n=o[o.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ne=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),C=e=>r&&(e.kind===`Keyword`||AC.has(e.text)),re=e=>{let t=i.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},w=e=>e.kind===`End`?`EOF`:/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:hC.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:C(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,T=(e,t=te(),n)=>{let r=i[i.length-1],a=t.line===r.line&&t.column===r.column,o=new s(`${e} at line ${t.line}, column ${t.column}`,void 0,ie(e,t,a,n));return f!==void 0&&h.set(o,f),o},ie=(e,t,n,a)=>{if(!r)return{reason:e,line:t.line,column:t.column,isEnd:n};let o=i[m[0]-1],s=a?`Unexpected ${w(a)}`:e;if(o)return{reason:s,line:o.line,column:o.endColumn+1,isEnd:n};let c=a?re(a):t;return{reason:s,line:c.line,column:c.column,isEnd:n}},ae=(e,t=te())=>T(e,t,t),oe=e=>{let t={cursor:a,frame:f,restorePoints:m.length,offsideColumns:o.length,recursiveScopes:u.length},n=++p;f=n;try{let n=e();return f=t.frame,n}catch(e){if(!(e instanceof s)||h.get(e)!==n)throw e;a=t.cursor,f=t.frame,m.length=t.restorePoints,o.length=t.offsideColumns,u.length=t.recursiveScopes;return}},se=e=>{let t=f;f=void 0;let n=e();return f=t,n},ce=e=>{m.push(a);let t=e();return m.pop(),t},le=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!C(e),E=(e,t=0)=>{let n=S(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},D=()=>{let e=S();if(e.kind===`End`)throw ae(`Unexpected end of expression`);return a++,e},O=e=>E(e)?(a++,!0):!1,k=e=>{if(!E(e))throw ae(`Expected ${JSON.stringify(e)} but found ${ne(S())}`);return D()},de=()=>{let e=S();if(e.kind!==`Identifier`)throw ae(`Expected an identifier but found ${ne(e)}`);if(C(e))throw ae(`Unexpected keyword ${e.text}`);return a++,e.text},fe=()=>{let e=a;return{name:de(),range:b(e)}},pe=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),me=()=>{let e=S();return e.kind!==`String`&&(oC.has(e.text)||ZS.has(e.text)||iC.has(e.text))?(a++,e.text):de()},he=!1,ge=()=>S().kind===`Identifier`||!le(S())?de():(he=!0,D().text),_e=e=>{if(!r)return e();o.push(-1);let t=e();return o.pop(),t},ve=(e,t=`,`)=>{let n=[e()];for(;O(t);)n.push(e());return n},ye=(e=0)=>{if(E(`<<`,e)){let t=e+1;for(;S(t).kind===`Identifier`||E(`,`,t);)t++;return E(`>>`,t)&&E(`\\in`,t+1)}let t=e;for(;S(t).kind===`Identifier`;){if(E(`\\in`,t+1))return!0;if(!E(`,`,t+1))return!1;t+=2}return!1},be=()=>{if(E(`::`))return!0;if(!E(`(`))return!1;let e=1;for(;S(e).kind===`Identifier`&&E(`,`,e+1);)e+=2;return S(e).kind===`Identifier`&&E(`)`,e+1)&&E(`::`,e+2)},Se=()=>{if(!O(`<<`)){let e=fe();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=pe(E(`>>`)?[]:ve(fe));return k(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Ce=()=>{let e=()=>{let e=ve(Se);k(`\\in`);let t=se(j);return e.map(e=>({pattern:e,set:t}))},t=[e()];for(;E(`,`)&&(!r||ye(1));)D(),t.push(e());return t.flat()},we=()=>{let e=S();if(r&&AC.has(e.text)){let t=a;D();let n={kind:`Identifier`,name:e.text,location:_(e)};return{subscript:x(n,t),lastArgs:[]}}let t=r&&(e.kind===`Number`||e.kind===`String`||E(`@`));if(e.kind===`Identifier`){let t=a,n=[],i=[],o=e=>(i.push(b(a,a)),n.push(de()),e&&E(`(`)?A():[]),s=[o(!r)];for(;E(`!`)&&S(1).kind===`Identifier`;)D(),s.push(o(!0));let c=s.slice(0,-1),l=_(e);l.range={...b(t),end:i[i.length-1].end};let u=n.join(`!`);return{subscript:c.every(e=>e.length===0)?{kind:`Identifier`,name:u,location:l}:{kind:`Apply`,operator:u,args:c.flat(),argumentCounts:[...c.map(e=>e.length),0],argumentsRange:l.range,selectorRanges:i,location:l},lastArgs:s[s.length-1]}}if(E(`<<`)||E(`(`)||E(`{`)||E(`[`)||t){let e=a,t=Be();return{subscript:t.location.range?t:x(t,e),lastArgs:[]}}throw ae(`Expected a subscript but found ${ne(e)}`)},Te=e=>{let t=S(1),n=S(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`&&E(`==`,iC.has(n.text)?3:4))},De=e=>{let t=S(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||E(`,`,1)||E(`)`,1)||t.kind===`Keyword`&&dC.has(t.text)||Te(e)},Oe=()=>{let e=S(),t=e.kind===`Operator`&&(ZS.has(e.text)||aC.has(e.text))&&De(e);if(r&&e.kind!==`String`&&(aC.has(e.text)||lC.has(e.text)&&e.text!==`'`&&!rC.has(e.text)||cC.has(e.text)&&S(-1).text===`(`&&S(-1).line===e.line&&S(-1).endColumn+1===e.column&&S(1).text===`)`&&S(1).line===e.line&&S(1).column===e.endColumn+1)&&De(e))throw T(`incomplete expression`,e);if(t&&!r&&e.text===`\\X`&&e.spelling!==`×`)throw T(`\\X may not be used as an infix operator`,e);if(t)return a++,x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:_(e)},a-1);if(e.kind!==`String`&&lC.has(e.text)&&De(e)){a++;let t=_(e);if(rC.has(e.text))return x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},a-1);let n={kind:`Identifier`,name:`argument`,location:t};return x({kind:`Lambda`,params:[n.name],body:PC(e.text,n,t),operator:e.text,location:_(e)},a-1)}if(E(`LAMBDA`)){let t=a;D();let n=pe(ve(fe));k(`:`);let r=j();return x({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:_(e)},t)}if(!r)return j();let n=oe(j);if(n)return n;throw ae(`Unexpected ${ne(S())}`)},ke,A=()=>_e(()=>{let e=a;k(`(`);let t=ve(Oe);return k(`)`),ke=b(e),t}),Ae=()=>{let e=D();o.push(e.column);let t=[j()],n=()=>{for(;MC(te())&&te().text===e.text&&te().column===e.column;)a++,t.push(j())};return r?se(n):n(),o.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:_(e)}},je=e=>_e(()=>{let t=_(e),n=S().kind===`Identifier`,i=E(`|->`,1)&&(n||le(S()));if(i||n&&E(`:`,1)){let e=i?`Record`:`RecordSet`,r=e=>{let t=a,n=_(S()),r=e();return n.range=b(t),k(i?`|->`:`:`),{name:r,value:j(),location:n}},o=[r(()=>n?de():D().text),...O(`,`)?ve(()=>r(de)):[]];return k(`]`),{kind:e,fields:o,location:t}}if(ye()){let e=a,n=Ce();if(!r||E(`|->`)){k(`|->`);let e=j();return k(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}a=e}let o=j();if(O(`->`)){let e=j();return k(`]`),{kind:`FunctionSet`,domain:o,range:e,location:t}}if(O(`EXCEPT`)){let e=ve(()=>{k(`!`);let e=[];for(;E(`.`)||E(`[`);)if(O(`.`)){if(!le(S()))throw ae(`Expected a field name but found ${ne(S())}`);if(!r&&E(`@`))throw ae(`@ used in !.@`);e.push({kind:`Field`,name:D().text})}else k(`[`),e.push({kind:`Index`,args:ve(()=>j())}),k(`]`);return k(`=`),{path:e,value:j()}});return k(`]`),{kind:`Except`,function:o,updates:e,location:t}}if(!r&&!E(`]_`)){let e=[o];for(;O(`,`);)e.push(j());return k(`]`),{kind:`Bracket`,args:e,location:t}}return k(`]_`),{kind:`BoxAction`,action:o,subscript:we().subscript,location:t}}),Me=()=>{let e=a,t=x(He(),e),n=_(D());return x({kind:`Apply`,operator:`\\in`,args:[t,se(j)],location:n},e)},Ne=e=>_e(()=>{let t=_(e);if(O(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ye()&&(S(1).text===`\\in`||E(`<<`))){let e=a,n=Se();k(`\\in`);let r=se(j);if(O(`:`)){let e=se(j);return k(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}a=e}let n=S().kind===`Identifier`&&E(`\\in`,1)?Me():j();if(O(`:`)){let e=Ce();return k(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;O(`,`);)r.push(j());return k(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Pe=e=>{let t=_(e),n=_e(()=>E(`>>`)||E(`>>_`)?[]:ve(()=>j()));if(O(`>>_`)){if(n.length!==1)throw T(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:se(we).subscript,location:t}}return k(`>>`),{kind:`Tuple`,elements:n,location:t}},Fe=e=>{let t=_(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ye()){let e=Ce();return k(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=pe(ve(fe));return k(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},Ie=e=>{let t=[];do{let n=a;if(O(`OTHER`))return k(`->`),{kind:`Case`,arms:t,other:j(),otherRange:b(n),location:_(e)};let r=j();k(`->`),t.push({condition:r,body:j()})}while(O(`[]`));return{kind:`Case`,arms:t,other:void 0,location:_(e)}},Le=()=>{let e=S(1);return E(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||uC.has(e.text)||e.kind===`Operator`&&(ZS.has(e.text)||iC.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&oC.has(e.text))},Re=()=>{let e=D();if(e.kind===`Number`)return{kind:`Operand`,operand:ue(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return a--,{kind:`Bound`,args:A()}}return{kind:`Name`,name:e.text,args:E(`(`)?A():[]}},ze=(e,t,n,r,i)=>{let o=[{kind:`Name`,name:e,args:t}],s=[b(r,r)],c=[n];for(;Le();){D();let e=a;ke=void 0;let t=Re();s.push(t.kind===`Bound`?b(e):b(e,e)),o.push(t),c.push(ke)}let l=o.flatMap(e=>e.kind===`Name`?[e.name]:[]),u=l.join(`!`),d=o.flatMap(e=>`args`in e?e.args:[]),f=o.map(e=>`args`in e?e.args.length:0);return l.length<o.length?{kind:`Subexpression`,selectors:o,selectorRanges:s,argumentRanges:c,location:i}:d.length===0?{kind:`Identifier`,name:u,selectorRanges:s,location:i}:{kind:`Apply`,operator:u,args:d,...f.slice(0,-1).some(e=>e>0)&&{argumentCounts:f},argumentsRange:c.at(-1)??b(r),selectorRanges:s,argumentRanges:c,location:i}},Be=e=>{let n=a,i=D(),o=_(i);if(r&&i.kind===`Keyword`&&i.text===`LAMBDA`){let e=ve(de);return k(`:`),{kind:`Lambda`,params:e,body:j(),location:o}}if(i.kind===`Number`)return{kind:`Number`,value:ue(i.text),text:i.text,location:o};if(i.kind===`Decimal`)return{kind:`Decimal`,text:i.text,location:o};if(i.kind===`String`)return{kind:`String`,value:i.text,location:o};let s=i.kind===`Step`&&St(i);if(!r&&s&&yt()<0&&vt.length<=1)throw T(`Step number used outside proof`,i);if(s&&i.text[1]===`+`)throw T(`<+> step number used in an expression`,i);if(i.kind===`Identifier`||s){let t=s?Ct(i)??i.text:i.text;if(be()){let a=pe(O(`(`)?ve(fe):[]);a.names.length>0&&k(`)`),k(`::`);let s=b(n),l=j();if(!r&&e!==void 0&&c!==void 0&&jC(l)&&e.high>=c.low)throw T(`Removing the label would change expression parsing`,i);return{kind:`Label`,name:t,params:a.names,paramRanges:a.ranges,head:s,body:l,location:o}}let a=E(`(`);if(t===`@`&&!a&&!Le())return{kind:`ExceptAt`,location:o};let l=a?A():[];return Le()?ze(t,l,a?ke:void 0,n,o):a?{kind:`Apply`,operator:t,args:l,argumentsRange:ke,location:o}:{kind:`Identifier`,name:t,location:o}}let l=i.kind===`Operator`&&(NC(i.text)||i.text===`'`&&!r);if(l&&E(`(`)){let e=A();return!r&&Le()?ze(i.text,e,ke,n,o):t===`tlc`&&i.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:o}:i.text===`'`&&e.length===1?{kind:`Prime`,expression:e[0],location:o}:{kind:`Apply`,operator:i.text,spelling:i.spelling,args:e,argumentsRange:ke,location:o}}if(l&&!r)return Le()?ze(i.text,[],void 0,n,o):{kind:`Identifier`,name:i.text,spelling:i.spelling,location:o};switch(i.text){case`(`:{let e=_e(()=>j());return k(`)`),e}case`[`:return je(i);case`{`:return Ne(i);case`<<`:return Pe(i);case`@`:return{kind:`ExceptAt`,location:o};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Fe(i);case`IF`:{let e=j();k(`THEN`);let t=j();return k(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:o}}case`CASE`:return Ie(i);case`LET`:{let e=[],t=[],n=[];for(u.push(/* @__PURE__ */ new Set);!O(`IN`);){if(r&&E(`RECURSIVE`))throw ae(`Unexpected keyword RECURSIVE`);if(O(`RECURSIVE`)){n.push(...M());continue}let i=lt(!r&&O(`LOCAL`));i.kind===`Instance`?t.push(i):e.push(i)}return u.pop(),{kind:`Let`,definitions:e,...t.length>0&&{instances:t},...n.length>0&&{recursive:n},body:j(),location:o}}case`CHOOSE`:{let e=Se(),t=O(`\\in`)?j():void 0;return k(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:o}}case`WF_`:case`SF_`:{let e=we(),t=!E(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:_e(()=>{k(`(`);let e=j();return k(`)`),e});return{kind:i.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:o}}}throw ae(`Unexpected ${ne(i)}`,i)},Ve=(e,t,n)=>{c=l={low:t,high:n};let r=j(n+1),i=S(),a=iC.has(i.text)?YS.high:ZS.get(i.text)?.high;if(i.kind===`Operator`&&a!==void 0&&a>=t)throw T(`Precedence conflict between ${e.text} and ${i.text}`,i);return r},He=()=>{let e=l;l=void 0;let t=S(),n=_(t);if(t.kind===`Operator`&&MC(t))return Ae();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return D(),{kind:`Apply`,operator:`~`,args:[Ve(t,4,4)],location:n};case`-`:return D(),{kind:`Apply`,operator:`-.`,args:[Ve(t,12,12)],location:n};case`[]`:case`<>`:case`ENABLED`:case`UNCHANGED`:return D(),PC(t.text,Ve(t,4,15),n);case`SUBSET`:case`UNION`:case`DOMAIN`:return D(),{kind:`Apply`,operator:t.text,args:[Ve(t,10,13)],location:n}}return Be(e)},Ue=(e,t,n,r,i)=>{let a=_(e);if(e.text===`/\\`||e.text===`\\/`){let o=e.text===`/\\`?`And`:`Or`;return t.kind===o&&r?{...t,operands:[...t.operands,n],prefixEnds:[...t.prefixEnds??[],i]}:{kind:o,operands:[t,n],prefixEnds:[i],location:a}}return e.text===`\\X`?t.kind===`Product`&&r?{...t,factors:[...t.factors,n]}:{kind:`Product`,factors:[t,n],location:a}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t,n],location:a}},We=(e,t)=>e.text===`'`?{kind:`Prime`,expression:t,location:_(e)}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t],location:_(e)},Ge=()=>{D();let e=_e(()=>ve(()=>j()));return _e(()=>k(`]`)),e},Ke=e=>{let t=a,n=He(),r=n.location.range?n:x(n,t),i;for(;;){let n=S();if(n.kind!==`Operator`)break;let a=_(n);if(iC.has(n.text)&&e<=15){D(),c=YS,r=x(We(n,r),t);continue}if(n.text===`[`){let e=Ge();c=XS,r=x({kind:`FunctionApplication`,function:r,args:e,location:a},t);continue}if(n.text===`.`&&le(S(1))){D();let e=D().text;r=x({kind:`FieldAccess`,record:r,field:e,location:a},t);continue}let o=ZS.get(n.text);if(!o||o.low<e)break;if(i){let e=!(i.low>o.high||i.high<o.low),t=i.text===n.text&&o.isAssociative;if(e&&!t&&(i.text!==`\\X`||n.text!==`\\X`))throw T(`Precedence conflict between ${i.text} and ${n.text}`,n)}if(D(),o.low>12&&E(`-`))throw T(`Precedence conflict between ${n.text} and -`,S());c=l=o;let s=j(o.high+1),u=i?.text===n.text;r=x(Ue(n,r,s,u,b(t).end),t),i={...o,text:n.text}}return r},qe=e=>e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`||e.kind===`Identifier`||e.kind===`Step`&&St(e)&&/^<\d/.test(e.text)||(e.kind===`Operator`||e.kind===`Keyword`)&&tC.has(e.text),Je=(e,t)=>({start:t,end:a-1,expression:e.location.range?e:x(e,t)}),Ye=(e,t,n,r)=>({...n,start:e,end:a-1,fixity:t,isLeft:!1,apply:r}),Xe=e=>e.kind===`Operator`&&iC.has(e.text)&&E(`(`,1)?oe(()=>_e(()=>{D(),D();let t=j(),n=a-1;return k(`)`),{end:n,expression:We(e,t)}})):void 0,Ze=()=>{let e=0;for(let t=a+1;t<i.length;t++){let n=i[t];if(n.kind===`Operator`){if(e===1&&n.text===`,`)return!0;if(i[t-1].text!==`!`&&(OC.has(n.text)&&e++,kC.has(n.text)&&--e===0))return!1}}return!1},Qe=e=>E(`(`,1)&&Ze()?oe(()=>_e(()=>{D(),D();let t=j();k(`,`);let n=j();return k(`)`),{kind:`Apply`,operator:e.text,args:[t,n],location:_(e)}})):void 0,$e=e=>{let t=a,n=S(),r=_(n),i=n.kind===`Operator`||n.kind===`Keyword`,o=i?ZS.get(n.text):void 0;if(!e){if(E(`[`)){let e=Ge();return Ye(t,`Postfix`,eC,t=>({kind:`FunctionApplication`,function:t[0].expression,args:e,location:r}))}if(E(`.`)&&le(S(1))){D();let e=D().text;return Ye(t,`Postfix`,eC,t=>({kind:`FieldAccess`,record:t[0].expression,field:e,location:r}))}if(o){if(Qe(n)){a=t;return}return D(),{...Ye(t,`Infix`,o,e=>Ue(n,e[0].expression,e[1].expression,e[0].joinedBy===n.text,b(e[0].start,e[1].end).end)),isLeft:QS(n.text,o),joins:n.text}}if(n.kind!==`Operator`||!iC.has(n.text))return;if(Xe(n)){a=t;return}return D(),Ye(t,`Postfix`,YS,e=>We(n,e[0].expression))}if(n.kind===`Operator`&&MC(n))return Je(Ae(),t);let s=o?Qe(n):void 0;if(s)return Je(s,t);let c=Xe(n);if(c)return c.expression.location.range=b(t,c.end),{start:t,end:c.end,expression:c.expression};let l=i?$S.get(n.text):void 0;if(l)return D(),Ye(t,`Prefix`,l,e=>PC(n.text===`-`?`-.`:n.text,e[0].expression,r));if(!qe(n))return;let u=n.kind===`Operator`&&nC.has(n.text);return Je(u?Be():se(Be),t)},et=e=>e!==void 0&&`fixity`in e,tt=e=>e!==void 0&&!(`fixity`in e),nt=(e,t)=>{let n=Math.min(e.start,t[0].start),r=Math.max(e.end,t[t.length-1].end),i=e.apply(t);return i.location.range=b(n,r),{start:n,end:r,expression:i,joinedBy:e.joins}},rt=e=>{let t=e.pop(),n=e.pop();if(!tt(t)||!et(n))throw T(`incomplete expression`);let r=n.fixity===`Infix`?e.pop():void 0;e.push(nt(n,tt(r)?[r,t]:[t]))},it=e=>{let t=e[e.length-2];return et(t)?t:void 0},at=(e,t)=>t!==void 0&&e.high<t.low,ot=()=>ce(()=>{let e=oe(()=>$e(!0));if(e===void 0){let e=te();throw e.kind===`End`?ae(`Unexpected end of expression`,e):T(`required expressions(s) missing before '${w(e)}'`,e)}return se(()=>{let t=[e];for(;;){let e=oe(()=>$e(et(t[t.length-1])));if(e===void 0)break;if(tt(e)||e.fixity===`Prefix`){t.push(e);continue}for(;at(e,it(t));)rt(t);let n=t[t.length-1];if(e.fixity===`Postfix`&&tt(n)){t.splice(-1,1,nt(e,[n]));continue}let r=it(t);r?.fixity===`Infix`&&r.isLeft&&e.isLeft&&!at(r,e)&&rt(t),t.push(e)}for(;t.length>1;)rt(t);let n=t[0];if(!tt(n))throw T(`incomplete expression`);return n.expression})}),j=(e=0)=>r?ot():Ke(e),st=()=>{if(!O(`(`))return[];let e=ht();return k(`)`),e},ct=()=>{let e=_(S()),t=j(),n=i[a-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:d[0].name,start:e,end:r}}},lt=e=>{let t=a;return x(dt(e),t)},ut=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),dt=e=>{let t=S(),n=a,r=_(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:b(n,a-2),...ct(),isLocal:e,isRecursive:g(t),location:r});if(t.kind===`Identifier`&&S(1).kind===`Operator`&&ZS.has(S(1).text)&&S(2).kind===`Identifier`&&E(`==`,3)){let e=fe(),t=D().text,n=fe();return k(`==`),i(t,[ut(e),ut(n)])}let o=t.kind!==`String`&&oC.has(t.text),s=t.kind===`Identifier`&&iC.has(S(1).text)&&E(`==`,2);if(o||s){let e=o?t.text:S(1).text;o&&D();let n=fe();return s&&D(),k(`==`),i(e,[ut(n)])}let c=de();if(O(`[`)){let t=_e(()=>Ce());return k(`]`),k(`==`),{kind:`Function`,name:c,bounds:t,body:j(),isLocal:e,isRecursive:g(c),location:r}}let l=a,u=st();return k(`==`),E(`INSTANCE`)?{...ft(c,u,e,r),definitionRange:b(l)}:i(c,u)},ft=(e,t,n,r)=>{let i=a;return k(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ge(),substitutions:O(`WITH`)?ve(()=>{let e=a,t=me(),n=b(e);return k(`<-`),{name:t,nameRange:n,expression:Oe()}}):[],isLocal:n,location:r,instanceRange:b(i)}},pt=()=>{let e=a;return x(mt(),e)},mt=()=>{let e=_(S());if(E(`_`)&&S(1).kind===`Operator`&&(ZS.has(S(1).text)||iC.has(S(1).text)))return D(),{name:D().text,arity:O(`_`)?2:1,location:e};if(S().kind!==`String`&&(oC.has(S().text)||r&&S().kind===`Operator`)&&E(`_`,1)){let t=D().text;return D(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=de();if(!O(`(`))return{name:t,arity:0,location:e};let n=ve(()=>k(`_`));return k(`)`),{name:t,arity:n.length,location:e}},ht=()=>ve(pt),M=()=>{let e=ht();return e.forEach(e=>u[u.length-1].add(e.name)),e},gt=e=>{let t=0,n=e;do{let e=S(n);if(e.kind===`End`)return n;e.kind===`Operator`&&OC.has(e.text)&&t++,e.kind===`Operator`&&kC.has(e.text)&&t--,n++}while(t>0);return n},_t=()=>{let e=S(),t=S(1);return e.kind===`Identifier`?E(`(`,1)||E(`[`,1)?E(`==`,gt(1)):t.kind===`Operator`&&iC.has(t.text)?E(`==`,2):t.kind===`Operator`&&ZS.has(t.text)?S(2).kind===`Identifier`&&E(`==`,3):E(`==`,1):e.kind!==`String`&&oC.has(e.text)&&t.kind===`Identifier`&&E(`==`,2)},vt=[],yt=()=>vt[vt.length-1]??-1,bt=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),xt=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},St=e=>!e.text.endsWith(`.`)&&!gC.has(xt(e)),Ct=e=>{let t=xt(e);if(gC.has(t))return;let n=bt(e);if(n>=0)return`<${n}>${t}`;let r=yt(),i=vt[vt.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},N=e=>{if(e.kind===`Keyword`)return pC.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return vt.length===0;if(e.text[1]===`+`||vt.length===0)return!0;let t=yt();return t>=0&&bt(e)>t},wt=e=>{let t=bt(e),n=vt.length-1,r=vt[n-1]??-1,i=vt[n]<0;return i&&(vt[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:vt[n]===t},Tt=()=>{let e=S();return e.kind===`Step`?St(e):e.kind===`Keyword`?TC.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!_t()},Et=()=>{let e=a,t=S();return t.kind===`Operator`&&!sC.has(t.text)&&NC(t.text)?(a++,x({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:_(t)},e)):O(`MODULE`)?x({kind:`ModuleFact`,name:de(),location:_(t)},e):j()},Dt=()=>{let e=a,t=S(),n=ve(()=>{let e=S();if((e.kind!==`Identifier`||C(e))&&e.kind!==`Operator`)throw ae(`Expected a definition name but found ${ne(e)}`,e);return a++,e.text},`!`),r=_(t);return x(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},Ot=()=>ve(r?Dt:Et),kt=()=>{let e=oe(j);if(!e)return[];let t=[e];return ce(()=>{for(;E(`,`);){let e=oe(()=>(D(),j()));if(!e)return;t.push(e)}}),t},At=()=>{let e=r?kt():Tt()?ve(Et):[],t=O(`DEF`)||O(`DEFS`);if(r&&e.length===0&&!t)throw ae(`Expected a fact`);return{facts:e,defs:t?Ot():[]}},jt=()=>{let e=a,t=D(),n=t.text===`USE`&&O(`ONLY`),r=b(e);return x({kind:t.text===`USE`?`Use`:`Hide`,isOnly:n,...At(),keyword:r,location:_(t)},e)},Mt=()=>{let e=a,t=_(S()),n=O(`NEW`),i=r?a:e,o=r?_(S()):t,s=S().kind===`Keyword`?EC.get(S().text):void 0;if(!n&&s===void 0)throw ae(`Expected a declaration but found ${ne(S())}`);if(s!==void 0&&D(),s===`Variable`){let e=fe();return x({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:o},i)}let c=pt(),l=(s??`Constant`)===`Constant`&&E(`\\in`);if(l&&c.arity>0)throw T(`declared symbol with arguments before \\in`);return l&&D(),x({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?j():void 0,nameRange:c.location.range,location:o},i)},Nt=()=>{if(S().kind===`Identifier`&&E(`::`,1)&&E(`ASSUME`,2)&&(D(),D()),E(`ASSUME`))return Ft();if(S().kind===`Keyword`&&DC.has(S().text))return r?se(Mt):Mt();if(!r)return j();let e=oe(j);if(e===void 0)throw ae(`Expected a hypothesis`);return e},Pt=()=>{let e=[Nt()];return ce(()=>{for(;;){let t=oe(()=>(k(`,`),Nt()));if(t===void 0)break;e.push(t)}}),e},Ft=()=>{let e=a,t=_(k(`ASSUME`)),n=()=>{let n=r?Pt():ve(Nt);return k(`PROVE`),x({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)};return r?se(n):n()},It=e=>{let t=0;for(;S(t).kind===`Identifier`&&E(`,`,t+1);)t+=2;return S(t).kind===`Identifier`&&E(e,t+1)},Lt=()=>{let e=S();if(E(`USE`)||E(`HIDE`))return jt();if(!r&&E(`INSTANCE`)){let t=a;return x(ft(void 0,[],!1,_(e)),t)}if(E(`DEFINE`)||_t()){let t=a;O(`DEFINE`);let n=[lt(!1)];for(;_t();)n.push(lt(!1));let r={kind:`Define`,definitions:n,location:_(e)};return x(r,t)}if(O(`HAVE`))return{kind:`Have`,expression:j()};if(O(`TAKE`)){let e=ye(),t=pe(e?[]:ve(fe)),n=e?Ce():[];return{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(O(`WITNESS`))return{kind:`Witness`,expressions:ve(()=>j())};if(O(`PICK`)){let e=It(`:`),t=pe(e?ve(fe):[]),n=e?[]:Ce();return k(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return O(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:O(`SUFFICES`),statement:E(`ASSUME`)?Ft():j()}},Rt=e=>{let n=S();if(n.kind!==`Step`)throw ae(`Expected a step number but found ${ne(n)}`,n);if(!wt(n))throw T(`${e?`QED step`:`step`}'s number has bad level`,n);if(t!==`sany`&&bt(n)<0&&Ct(n)!==void 0)throw T(`<*> and <+> cannot be used for a named step`,n);return a++,{name:Ct(n),token:n.text,location:_(n)}},zt=()=>{let e=a,t=Rt(E(`QED`,1)),n=a,r=O(`QED`)?{kind:`Qed`}:Lt(),i=b(e),o=b(n),s=N(S());if(s&&!mC.has(r.kind))throw T(`Proof of a step that does not take a proof`);let c=s?Ht():void 0;return x({...t,body:r,head:i,statement:o,proof:c},e)},Bt=e=>{if(O(`BY`)){let t=b(a-1);return{kind:`By`,isOnly:O(`ONLY`),...At(),keyword:t,location:e}}let t=S();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;D();let n=b(a-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Vt=()=>{let e=_(S());O(`PROOF`);let t=Bt(e);if(t)return t;let n=[zt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(zt());return{kind:`Steps`,level:yt(),steps:n,location:e}},Ht=()=>{let e=a;vt.push(-1);let t=Vt();return vt.pop(),x(t,e)},Ut=()=>S().kind===`Step`||S().kind===`Keyword`&&pC.has(S().text),Wt=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return bC(e);let n=t.defs[t.defs.length-1]?.location.range;return yC(bC({...e,end:e.start}),bC(n??t.keyword))},Gt=()=>{let e=a,t=_(S()),n=O(`PROOF`),r=Bt(t);if(r){let t=x(r,e);return{kind:`Leaf`,proof:t,span:bC(t.keyword),first:e,end:a-1}}let i=S();if(i.kind!==`Step`)throw ae(`Expected a step number but found ${ne(i)}`);let o=a;D();let s=a,c=O(`QED`)?{kind:`Qed`}:Lt(),l=b(o);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:b(s),span:Wt(l,c),first:e,start:o,end:a-1}},Kt=(e,t,n,r)=>{let a=e[t];if(!a)return{proof:void 0,span:r,next:t,end:void 0};if(a.kind===`Leaf`)return{proof:a.proof,span:a.span,next:t+1,end:a.end};let o=qt(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={..._(i[a.first]),range:b(a.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},qt=(e,t,n,r,i)=>{let a=e[t];if(!a)throw wC(`Unexpected end of (sub)proof at level ${n} before QED step`,r,CC);if(a.kind===`Leaf`)throw wC(`Expecting a proof step but found a${_C[a.proof.kind]} leaf proof`,a.span,CC);if(!i&&a.isProof)throw wC(`PROOF keyword found in step that does not begin subproof`,a.span,SC);let o=a.token.text[1];if(o===`+`&&!i)throw wC(`<+> used but no subproof expected`,a.span,SC);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:bt(a.token);if(s<n||!i&&s>n)return;let c=mC.has(a.body.kind)?Kt(e,t+1,s+1,a.span):{proof:void 0,span:a.span,next:t+1,end:void 0},l=c.end??a.end,u={name:Ct(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{..._(a.token),range:b(a.start,l)}},d=yC(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=qt(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:yC(d,f.span)}},Jt=()=>{if(!Ut())return;let e=[];for(;Ut();)e.push(Gt());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=Kt(e,0,0,t.span),r=e[n.next];if(r)throw wC(`extra step(s) after finished proof`,r.span,xC,`Proof.Parser.toplevel`);return n.proof},Yt=(e,t,n,r)=>{e.definitions.some(e=>e.name===t)||e.definitions.push({kind:`Operator`,name:t,params:[],body:n,isLocal:!1,isRecursive:!1,location:r})},Xt=()=>{if(S().kind!==`Identifier`||!E(`==`,1))return;let e=de();return D(),e},Zt=()=>{if(!r)return j();let e=te(),t=oe(j);if(t)return t;throw ae(`Expected "====" but found ${ne(e)}`,e)},Qt=e=>{let t=a,n=D(),i=Xt(),o=E(`ASSUME`)?Ft():Zt(),s=r?Jt():N(S())?Ht():void 0,c=x({name:i,statement:o,proof:s,location:_(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),i!==void 0&&o.kind!==`AssumeProve`&&Yt(e,i,o,c.location)},$t=()=>{let e=a,t=D(),n=Xt();return x({name:n,expression:j(),isAxiom:t.text===`AXIOM`,location:_(t)},e)},en=()=>{let e=_(k(`----`));k(`MODULE`);let t=ge();k(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(d.push(n),u.push(/* @__PURE__ */ new Set),O(`EXTENDS`)&&ve(()=>{let e=a;n.extends.push(ge()),n.extendsRanges.push(b(e))});;){let t=a,r=S();if(r.kind===`ModuleEnd`)return e.range={module:d[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},d.pop(),u.pop(),n;if(r.kind===`Separator`){if(E(`MODULE`,1)){let e=en();n.modules.push(e),n.units.push({kind:`Module`,module:e}),k(`====`);continue}D()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=_(D()),r=ht();n.constants.push(...r),e.range=b(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=_(D()),r=ve(()=>{let e=a,t=_(S());return x({name:de(),arity:0,location:t},e)});n.variables.push(...r),e.range=b(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=$t();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&Yt(n,e.name,e.expression,e.location);continue}case`USE`:case`HIDE`:{if(E(`USE`)&&E(`ONLY`,1))throw ae(`Expected a module unit but found ${ne(r)}`);let e=jt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=_(D()),r=M();e.range=b(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:tn(n,x(ft(void 0,[],!1,_(r)),t));continue;case`LOCAL`:if(D(),E(`INSTANCE`)){tn(n,x(ft(void 0,[],!0,_(r)),t));continue}tn(n,x(dt(!0),t));continue}r.kind===`Keyword`&&fC.has(r.text)?Qt(n):tn(n,lt(!1))}}},tn=(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}))},nn=en(),rn=he?JS(e):void 0;if(rn!==void 0)throw new s(rn);return nn},LC=e=>IC(e,`tlc`),RC=(e,t)=>IC(e,`tlc`,t),zC=e=>IC(e,`tlapm`),BC=e=>IC(e,`sany`),VC=/* @__PURE__ */ new WeakMap,HC=(e,t)=>e.forEach(e=>{let n=t.find(t=>t.isRecursive&&t.name===e.name);n&&VC.set(n,e.arity)}),UC=e=>{switch(e.kind){case`Name`:return e.name;case`Operand`:return typeof e.operand==`number`?`argument selector ${e.operand}`:e.operand;case`Bound`:return`!(...)`;case`At`:return`@`;case`Colon`:return`:`}},WC=(e,t,n)=>({operator:e,range:t,args:n,params:n.map(()=>0)}),GC=(e,t)=>new s(`${e} at line ${t.line}, column ${t.column}`),KC=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return KC(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of mt(e)){let e=KC(r,t,n);if(e)return e}},qC=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),JC=(e,t)=>{let n=e.location,r=qC(t,e.lets,n);if(e.params.length===0&&r!==t)return r;if(e.params.length===0){let e={...t};return Sc.set(e,Sc.get(t)??t),e}if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw GC(`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 GC(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:hc,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:hc,args:e.args,location:n,resolution:mc},location:n}},YC=(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:mc})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:mc}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:mc};return JC({...t,params:[...t.params,...r]},a)},XC=(e,t,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s=0,c,l=!1,u=[],d=[],f,p=(e,t)=>{!f&&e&&(f={location:g(e),message:t})},m=(e,t,n=!1)=>{let i=r.selectorRanges?.[s];e&&i&&u.push({node:e,error:{location:g(i),message:t},isEmpty:n})},h=(e,t)=>{if(!e)throw GC(t,a);_c.set(r,{applications:d,nulls:u,error:{location:g(e),message:t}}),l=!0},_=n=>{let r=[],i=[];for(;s<e.length;){let o=e[s];if(o.kind!==`Name`&&!n)return;if(o.kind!==`Name`)throw GC(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=n?n.find(e=>uu(e)===c):t(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s++}throw GC(`Unknown operator ${r.join(`!`)}`,a)},v=t=>{let n=_(t);if(!n){l=!0;return}let u=n.definition,f=VC.get(u)??Mc(u),m=s===e.length-1;if(n.args.length!==f){let e=r.argumentRanges?.[s]??a.range,t=`The operator ${cc(n.name)} requires ${f-n.earlier} arguments.`;if(!i||n.args.length!==0)return h(e,t);p(e,t)}if(n.args.forEach((e,t)=>bc.set(e,{operator:n.name,index:t,range:r.selectorRanges?.[s]})),m)return{definition:u,args:n.args};let g=u.location.range,v=VC.has(u)&&g?.module===a.range?.module&&Ac(a,u.location);if(d.push({operator:n.name,range:r.selectorRanges?.[s],args:n.args,params:v?Array(f).fill(0):Nc(u)}),u.isRecursive&&g&&g.module===a.range?.module&&Ac(a,g.end))return h(r.selectorRanges?.[s],`Subexpression of \`${n.name}' used inside the operator's definition.`);if(u.kind!==`Operator`)throw GC(`Cannot select a subexpression of ${u.name}`,a);o.params.push(...u.params),o.args.push(...n.args),c=u.body,s++},y=()=>{for(;s<e.length&&!l;){let t=e[s];if(t.kind!==`Name`)return;let n=r.selectorRanges?.[s],a=c&&KC(c,t.name,[]);if(!a)return h(n,`Cannot find label \`${t.name}'.`);let l=a.label.params;if(t.args.length!==l.length){let e=`Label \`${t.name}' used with wrong number of arguments.`;if(!i)return h(n,e);p(n,e)}o.lets.push(...a.lets),o.params.push(...l.map(e=>({name:e,arity:0}))),o.args.push(...t.args),d.push(WC(t.name,n,t.args)),c=a.label.body,s++}},ee=i=>{if(!c)throw GC(`Subexpression selection failed`,a);if(i.kind===`Colon`)return;let l=r.selectorRanges?.[s],u=c.location.range;if((c.kind===`Subexpression`||c.kind===`Identifier`&&c.name.includes(`!`)||c.kind===`Apply`&&c.operator.includes(`!`))&&(u?.module!==a.range?.module||Ac(c.location,a))){let e=_c.has(c)?c:$C(c,t,n),r=`Choosing operand \`${UC(i)}' of subexpression with no operands.`;if(_c.has(e)){h(l,r);return}gc.has(e)&&e.kind!==`Lambda`&&(m(e,r,!0),c=e.kind===`Let`&&e.body.kind===`Apply`&&e.body.operator===`$subexpression`?e.body:{kind:`Tuple`,elements:[e],location:e.location})}if(c.kind===`Label`){c=c.body,ee(i);return}let f=`Nonexistent operand specified by \`${UC(i)}'.`;if(c.kind===`Let`){if(i.kind!==`Operand`||il(i.operand,1)!==0){h(l,`A LET/IN expression has only one operand.`);return}o.lets.push(c.definitions),c=c.body;return}let p=cl(c);if(p&&(i.kind===`Bound`||i.kind===`At`)){if(i.kind===`Bound`&&i.args.length!==p.names.length){h(l,`Selector with ${i.args.length} argument(s) used for quantifier with ${p.names.length} bound identifier(s).`);return}o.params.push(...p.names.map(e=>({name:e,arity:0}))),i.kind===`Bound`&&(o.args.push(...i.args),d.push(WC(``,l,i.args))),c=p.body;return}if(c.kind===`Case`){let t=[...c.arms,...c.other?[{condition:void 0,body:c.other}]:[]];if(s===e.length-1){h(l,`Subexpression of CASE must have form !i!j.`);return}let n=i.kind===`Operand`?t[il(i.operand,t.length)]:void 0;if(!n){h(l,f);return}s++;let a=e[s],o=a.kind===`Operand`?il(a.operand,2):-1,u=r.selectorRanges?.[s];if(o===-1){h(u,`Second selector for CASE subexpression must specify one of two operands.`);return}let d=o===0?n.condition:n.body;if(!d){h(u,`Selecting OTHER in a CASE statement.`);return}c=d;return}if(c.kind===`Except`&&i.kind===`Operand`&&il(i.operand,c.updates.length+1)>0){h(l,`Selecting subexpression of an EXCEPT not yet implemented.`);return}let g=p?p.sets:ll(c);if(!g&&c.kind!==`Identifier`){h(l,`Selecting subexpression of expression that has none.`);return}if(i.kind!==`Operand`){h(l,f);return}let _=g?.[il(i.operand,g.length)];_?c=_:h(l,f)},b=v(void 0);if(l)return r;if(b)return YC(b.definition,{...o,args:b.args});for(y();s<e.length&&!l;){let t=e[s];if(t.kind===`Name`){for(;c?.kind===`Label`;)c=c.body;if(c?.kind!==`Let`)return h(r.selectorRanges?.[s-1],`A name selector here must be from a LET clause.`),r;o.lets.push(c.definitions);let e=v(c.definitions);if(l)return r;if(e)return YC(e.definition,{...o,args:[...o.args,...e.args]});y()}else t.kind!==`Colon`&&(m(c,`Subexpression selection failed, probably due to an error in the selected expression.`),m(c,`Choosing operand \`${UC(t)}' of subexpression with no operands.`,!0)),ee(t),m(c,`An unexpected null node specified by '${UC(e[s])}'.\nThis is probably due to a previous error.`),s++}if(l)return r;if(!c)throw GC(`Subexpression selection failed`,a);let x=o.params.length,te=o.args.length;if(x!==te){let e=`Expected ${x} arguments but found ${te}.`;if(!i||te>0)return h(a.range,e),r;p(a.range,e)}let S=JC(o,c);return xc.set(S,u),f&&vc.set(S,f),S},ZC=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return al(e,t,n)},QC=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||mt(e).some(QC),$C=(e,t,n,r=!1)=>{if(!QC(e))return e;if(e.kind===`Let`){e.recursive&&HC(e.recursive,e.definitions);let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=t=>!e.definitions.some(e=>e.name===t)&&n(t),a=pu(e,e=>$C(e,r,i));return a.kind===`Let`&&a.instances?{...a,instances:a.instances.map(e=>ew(e,r,i))}:a}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>$C(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:pu(e,e=>$C(e,t,n)),o=mt(e),s=mt(a).every((e,t)=>e===o[t])?e:a,c=s.kind===`Subexpression`?s.selectors:s.kind===`Identifier`?ZC(s.name,[],void 0,t):s.kind===`Apply`?ZC(s.operator,s.args,s.argumentCounts,t):void 0,l=c?.[0];if(!c)return s;let u=c.findIndex(e=>e.kind!==`Name`),d=c.slice(0,u===-1?c.length:u),f=d.some((e,n)=>n>0&&t(d.slice(0,n+1).map(UC).join(`!`)));if(l?.kind===`Name`&&n(l.name)&&!f||l?.kind===`Name`&&c[1].kind!==`Name`&&!t(l.name))return s;let p=XC(c,t,n,s,r);return p!==s&&gc.add(p),p},ew=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:$C(e.expression,t,n,!0)}))}),tw=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},nw=(e,t)=>ew(e,tw(t.definitions),()=>!1),rw=(e,t)=>{let n=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),r=e.theorems.flatMap(e=>{let t=e.statement;if(e.name===void 0||t.kind!==`AssumeProve`)return[];let n=t.assumptions.filter(e=>e.kind!==`NewSymbol`&&e.kind!==`AssumeProve`);return n.length===t.assumptions.length?[{kind:`Operator`,name:e.name,params:[],body:{kind:`Tuple`,elements:[...n,t.conclusion],location:t.location},isLocal:!0,isRecursive:!1,location:e.location}]:[]}),i=/* @__PURE__ */ new Set([...e.definitions,...r]);HC(e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]),e.definitions);let a=new Map(e.units.flatMap(e=>e.kind===`Recursive`?e.declarations.map(e=>[e.name,e.location]):[])),o=(e,t)=>{let n=a.get(e.name);return Ac(e.location,t)||e.isRecursive&&n!==void 0&&Ac(n,t)},s=(e,t)=>n=>{let r=e(n);return r&&(!i.has(r)||o(r,t))?r:void 0},c=tw([...t,...e.definitions]),l=e=>n.has(e),u=tw([...t,...e.definitions,...r]),d=(e,t)=>$C(e,s(u,t),e=>l(e)&&r.every(t=>t.name!==e)),f=e=>{let t=t=>l(t)||!e(t),n=n=>$C(n,e,t),r=e=>{let t=e.map(e=>e.kind===`ModuleFact`?e:n(e));return yc.set(t,e),t},i=e=>e.map(e=>({...e,set:n(e.set)})),a=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&n(e.set)}:a(e)),conclusion:n(e.conclusion)}:n(e),o=o=>{switch(o.kind){case`Use`:case`Hide`:return{...o,facts:r(o.facts)};case`Instance`:return ew(o,e,t);case`Define`:return{...o,definitions:o.definitions.map(r=>r.kind===`Instance`?ew(r,e,t):fu(r,n))};case`Have`:case`Case`:return{...o,expression:n(o.expression)};case`Witness`:return{...o,expressions:o.expressions.map(n)};case`Take`:return{...o,bounds:i(o.bounds)};case`Pick`:return{...o,bounds:i(o.bounds),body:n(o.body)};case`Assert`:return{...o,statement:a(o.statement)};default:return o}},s=t=>{if(t?.kind===`By`)return{...t,facts:r(t.facts)};if(t?.kind!==`Steps`)return t;let n={lookup:e,resolveStep:o,resolveProof:s};return{...t,steps:t.steps.map(e=>{let t={...e,body:n.resolveStep(e.body),proof:n.resolveProof(e.proof)};if(e.body.kind===`Define`){let t=e.body.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),r=n.lookup;n=f(e=>t.find(t=>t.name===e)??r(e))}return t})}};return{lookup:e,resolveFacts:r,resolveStatement:a,resolveStep:o,resolveProof:s}},p={...e,theorems:e.theorems.map(e=>{let t=f(s(c,e.location));return{...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:t.resolveStatement(e.statement),proof:e.proof&&f(s(c,e.proof.location)).resolveProof(e.proof)}}),uses:e.uses.map(e=>({...e,facts:f(s(c,e.location)).resolveFacts(e.facts)}))};return e.definitions.some(e=>QC(e.body))||e.assumptions.some(e=>QC(e.expression))?{...p,definitions:e.definitions.map(e=>fu(e,t=>d(t,e.location))),assumptions:e.assumptions.map(e=>({...e,expression:d(e.expression,e.location)}))}:p},iw=(e,t)=>e.maxLevels[t]??3,aw=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=Wd({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=>Qu(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Qu(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>$u(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Yu(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)&&Qu(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(Gd(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=g(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),l=i(t.module),u=n(t.instancer),d=/* @__PURE__ */ new Map;t.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...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=u.analyze(n,d);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(n,d),i=r.kind===`Operator`?r.data:void 0;return[{...e,level:r.data.level,operator:i,isLeibniz:i===void 0||i.nonLeibniz.size===0}]}),p=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&o(p(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let n=l.constraints.get(e.name);n!==void 0&&e.level>n&&o(p(e.name,n));let r=e.operator;if(r)for(let n=0;n<e.arity;n++){let i=l.argConstraints.get(qu(e.name,n));i!==void 0&&iw(r,n)<i&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${n+1} of the operator ${r.name} \nmust be at least ${i}.`)}}),l.argParams.forEach(e=>{let n=Yu(e),r=f.find(e=>e.name===n.operator)?.operator,i=f.find(e=>e.name===n.param);if(!r||!i)return;let a=iw(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 c([...r.values()])}},ow=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],sw=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),cw=new Map(oc.flatMap(e=>e.map(t=>[t,e[0]]))),lw=e=>cw.get(e)??e,uw=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},dw=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:gt(e)&2147483647,kind:t,isLocal:n}),fw=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:lw(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:lw(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},pw=(e,t)=>{let n=[];for(let r=t;;){let t=fw(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},mw=e=>({line:e.line,column:e.column}),hw=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text!==`.`){if(a.text===`EXTENDS`){let n=pw(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},gw=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,_w={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},vw=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&gw(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&gw(e[n+1],e[n+2])?n+=gw(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=>_w[e])}"`:r.text)}return t},yw=e=>e[2]?.text,bw=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},xw=(e,t)=>e.find(e=>e.name===t)??e.map(e=>xw(e.modules,t)).find(Boolean),Sw=e=>{let t=e===void 0?[]:Ee(e),n;return{tokens:t,ranges:bw(t),getModule:()=>n??=e===void 0?LC(``):RC(e,t)}},Cw=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=Sw(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:t?.(i)??fc.get(i)??fm.get(i)??FC(e,i),c=a(s),l=c.tokens,u=c.ranges.get(yw(l)??``)??{start:0,end:0},d={tokens:l,...u,getModule:c.getModule};return n.set(i??``,d),c.ranges.forEach((e,t)=>{e.start===u.start||r.has(t)||r.set(t,{tokens:l,...e,getModule:()=>xw(d.getModule().modules,t)??d.getModule()})}),d};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},ww=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=pw(t,e+1);i.push({location:mw(t[e]),apply:e=>r.forEach(t=>e.put(dw(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c=new Set(n.units.flatMap(e=>e.kind===`Constants`||e.kind===`Variables`?[`${e.location.line}:${e.location.column}`]:[])),l=0;t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r;if(n.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l++,l===2){let e=t[u+2].text;i.push({location:mw(n),apply:t=>t.put(dw(e,`module`,!1))})}return}if(n.kind===`ModuleEnd`&&l--,l!==1||n.kind!==`Keyword`)return;let d=c.has(`${n.line}:${n.column}`);d&&(n.text===`CONSTANT`||n.text===`CONSTANTS`)&&o(u,`constant`),d&&(n.text===`VARIABLE`||n.text===`VARIABLES`)&&o(u,`variable`),n.text===`RECURSIVE`&&pw(t,u+1).every(e=>s.has(e))&&o(u,`definition`),sw.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(mw(n)),i.push({location:mw(n),apply:e=>e.put(dw(t[u+1].text,`theorem`,!1))}))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(dw(t,`theorem`,!1))})});let u=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(u(e.location))return;let t=lw(e.name);i.push({location:e.location,apply:n=>n.put(dw(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(dw(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(dw(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>Ac(e.location,t.location)?-1:+!!Ac(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=uw();n.set(i??``,o),ac.toReversed().forEach(e=>o.put(dw(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},Tw=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=e=>{r.add(e)},a=e=>{e.kind===`ModelValue`&&i(e.name),e.kind===`String`&&i(e.value),e.kind===`Set`&&e.elements.forEach(a)};t.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),lc.forEach(i);let o=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=hw(o(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),g=m(e=>e.instances),_=/* @__PURE__ */ new Set([void 0]),v=/* @__PURE__ */ new Map;vw(o(void 0)).forEach((e,t)=>{t===3&&dc.forEach(i),i(e)});let y=l(void 0);for(;;){let t=h(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!t)break;let[n,r]=t;if(d.add(`${n.key}>${r}`),v.set(n.unit,[...v.get(n.unit)??[],r]),!_.has(r)){if(_.add(r),e(r).tokens.length===0){let t=n.unit??yw(e(void 0).tokens);throw te(r,t)}vw(o(r)).forEach(i)}}ow.forEach(i);let ee=/* @__PURE__ */ new Set,b=e=>{if(ee.has(e))return;ee.add(e);let t=v.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(b),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return b(void 0),n.forEach(e=>{let t=o(e);vw(t).forEach(i),t.forEach(e=>{e.kind===`String`&&i(e.text)})}),uc.forEach(i),[...r]},Ew=(e,t)=>{let n=Cw(e,t),r=n.getParsed,i,a=()=>i??=ww(r);return{getStringOrder:(e,t)=>Tw(r,e,t),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},Dw=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),Ow=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],kw=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof s))throw n;let r=JS(e);throw r===void 0?n:c([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},Aw=e=>new s(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),jw=(e,t)=>e.location.range&&t.location.range&&{location:g(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${g(t.location.range)}.`},Mw=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,Nw=e=>e===`Theorem`?`ThmOrAssumpDefNode`:Mw(e),Pw=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:ju(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),Fw=(e,t)=>{let n=ht(e);return n!==void 0&&t.has(n)||mt(e).some(e=>Fw(e,t))},Iw=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Eu(e),n.get(e)??n.size)),n},Lw=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Rw=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw e_(e);if(e.kind===`Number`&&!_n(e.value))throw t_(e);Rw(e.kind===`Let`?[...mt(e),...Lw(e.instances??[])]:mt(e))}),zw=(e,t)=>{let n=t.order??Ew(t.source,t.loadModule),r=n.parseModule(t.source),i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Set,f=new Map(Cm.map(e=>[e.name,e])),p=/* @__PURE__ */ new Map,m=zp(e.checkDeadlock,t.seed);m.isWarningEnabled=t.isWarningEnabled??!0,m.isTool=t.isTool??!1,m.version=t.version??`master`,m.readLine=t.readLine;let h=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Map,v=[],y=/* @__PURE__ */ new Map,ee=[],b=[],x=(e,t)=>ee.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),S=0,ne=e=>`${e}#${S++}`,re=[],T=[],ie=aw(e=>{let t=_.get(e)??O(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>i.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>i.get(t.visible.get(e)?.key??e)}}),ae=/* @__PURE__ */ new Map,oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,ce=e=>{let n=p.get(e);if(n)return n;let r=Gm(e,t.print,m,t.files,f);if(!r)return;Um.get(e)?.forEach(ce);let i=/* @__PURE__ */ new Map;return Wm.get(e)?.forEach(e=>ce(e)?.forEach((e,t)=>i.set(t,e))),r.forEach(t=>{f.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Wu.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Ku(e,t.name)??i.get(t.name)?.range})}),p.set(e,i),i},le=e=>{let n=Um.get(e)??[];if(e===`TLCExt`||[e,...n].some(e=>t.loadModule?.(e)!==void 0))return;let r=ce(e);return r&&x(e,n),r&&n.includes(`Integers`)&&ce(`Integers`),r},E=e=>(Rw([...e.definitions.flatMap(pt),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...Lw(e.instances)]),e.modules.forEach(E),e);E(r);let D=(e,r)=>{let i=t.loadModule?.(e)??mm(m.version).get(e)??FC(t.source,e);if(i===void 0)throw te(e,r);let a=kw(i,e,n);if(a.name!==e)throw c([{location:`Unknown location`,message:`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return E(a)},ue=e=>{let t=b.indexOf(e.name);if(t!==-1){let n=[...b.slice(t),e.name].map(e=>`${e}.tla`);throw new s(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];b.push(e.name),ee.push(n);let o=ve(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:T,levelChecks:a});if(ee.pop(),b.pop(),i.length>0)throw c(i,!1,void 0,T);let l=r.find(e=>n.has(e.name)),u=l&&h.get(l.name),d=u&&jw(l,u.module);if(d)throw c([d],!1,void 0,T);if(l)throw Aw(l);return a.forEach(e=>e()),{linked:o,closure:n}},O=(e,n)=>{let r=h.get(e);if(r)return x(e,y.get(e)??[]),r;let a=ue(D(e,n)),o=/* @__PURE__ */ new Map;return Hm(e,t.print,m,t.files,f,(e,t,n)=>{let r=o.get(e),i=t.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(r?.kind!==`Operator`||!n||i.length!==t.length)throw new w(`No definition of ${e} to fall back to`);return W(r.body,{environment:n.environment,scope:sv(q_(r),i,n),state:n.state,next:n.next,isKeepLazy:n.isKeepLazy})})?.forEach(t=>{let n=a.linked.visible.get(t.name);if(n?.kind!==`Definition`||n.arity!==t.arity&&Dw.has(e))return;let r=i.get(n.key);r&&o.set(t.name,r),f.set(n.key,t),i.delete(n.key)}),h.set(e,a.linked),y.set(e,a.closure),x(e,a.closure),a.linked},k=(e,t,n,r,s)=>{let c=s?void 0:le(e.module);if(c)return de(e,c);let d=s??O(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=Ow(d),p=`#${S++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=tu(nw(e,t),f,t,n);re.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>u.add(e));let _=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,v=zu({params:g,substitutions:new Map([...h].map(e=>[e[0],su(e[1],m)])),variables:new Set(d.variables),getDefinition:e=>i.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>a.get(e)===!0,addDefinition:(n,s,c)=>{let u=ne(`${s}@${t.name}`),d=c(u);return i.set(u,d),f.length>0&&l.add(d),e.name!==void 0&&oe.set(u,`${e.name}!${oe.get(n)??s}`),a.set(u,!r),o.set(u,{source:n,prefix:e.params.length}),u},createName:ne,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return fe(e,d.exported,f,(t,n)=>{let r=e.name===void 0?v.getKey(t):v.getQualifiedKey(t);return f.length>0&&ae.set(r,{name:n,location:e.location}),e.name!==void 0&&se.set(r,n),r})},de=(e,t)=>e.name===void 0?t:new Map([...t].map(t=>[`${e.name}!${t[0]}`,{key:t[1].key,arity:t[1].arity,params:t[1].params,kind:t[1].kind}])),fe=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(e=>!i.has(e[0])).map(t=>{if(e.name===void 0)return[t[0],{key:r(t[1].key,t[0]),arity:t[1].arity,params:t[1].params,kind:t[1].kind,range:a.get(t[1].key)===!0?e.location.range:t[1].range}];let n=`${e.name}!${t[0]}`;return[n,{key:r(t[1].key,n),arity:t[1].arity+e.params.length,params:t[1].params&&[...e.params.map(e=>e.arity),...t[1].params],kind:t[1].kind}]}))},pe=(e,t)=>Array.from({length:e},(e,n)=>({name:`argument${n}`,arity:t?.[n]??0})),me=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=pe(t.arity,void 0);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:Mu(r,n),location:n}}},he=(e,t,n,r)=>{let o=e.location,s=r?void 0:le(e.module);if(s)return e.name===void 0?[]:[...s].map(t=>{let n=pe(t[1].arity,t[1].params);return Nu(`${e.name}!${t[0]}`,t[1].key,[...e.params,...n],n,o)});let c=r??O(e.module,n),l=`#${S++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=Ow(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};re.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=>Fw(f(e),p),h=d.map(t=>{let n=me(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=[],_=zu({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:Mu(e.params,o),location:o,resolution:mc}:ju(`${t.name}${l}`,o)])),variables:new Set(c.variables),getDefinition:e=>i.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>a.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}:Pw(a,i)),i},createName:ne}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(e=>!v.has(e[0])).map(t=>{let n=_.getKey(t[1].key),r=pe(t[1].arity,t[1].params),i=[...e.params,...r];return Nu(e.name===void 0?t[0]:`${e.name}!${t[0]}`,n,i,n===t[1].key?r:i,o)});return[...h,...g,...y]},ge=e=>[...e].flatMap(e=>{let t=i.get(e[1].key);return t?[{...t,name:e[0]}]:[]}),_e=/* @__PURE__ */ new Map,ve=(e,n)=>{let o=Dx(e,t.loadClass?.(e.name),e===r);_e.set(e.name,o.overrides);let s=o.module,c=re.length,l=new Map([...Cm.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...n.symbols]),u=/* @__PURE__ */ new Map,d={location:Xl,errors:[],warnings:[]},f=[d],p=e=>e.forEach((e,t)=>{let n=m.get(t);if(!n){l.set(t,e),m.set(t,e);return}if(!n.range||!e.range||g(n.range)===g(e.range))return;let r=g(e.range),i=g(n.range);Nw(n.kind)===Nw(e.kind)?d.warnings.push({location:r,message:`Warning: the ${Mw(n.kind)} of '${t}' conflicts with \nits ${Mw(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${Mw(e.kind)} of '${t}' conflicts with \nits ${Mw(n.kind)} at ${i}.`})}),m=/* @__PURE__ */ new Map,h=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,ee=[],b=[...s.constants],x=s.variables.filter((e,t)=>s.variables.findIndex(t=>t.name===e.name)===t),te=x.map(e=>e.name),S=x.map(e=>e.location);s.extends.forEach(e=>{let t=n.modules.get(e),r=t?void 0:le(e);if(r){p(r);return}let i=t??O(e,s.name);b.push(...i.constants.filter(e=>b.every(t=>t.name!==e.name)&&!te.includes(e.name))),i.variables.forEach((e,t)=>{te.includes(e)||b.some(t=>t.name===e)||(te.push(e),S.push(i.variableLocations[t]))}),p(i.exported),i.facts.forEach(e=>h.add(e)),i.modules.forEach((e,t)=>y.set(t,e)),ee.push(i)});let ne=new Map(l),C=[...s.constants.map(e=>({...e,kind:`Constant`})),...s.variables.map(e=>({...e,kind:`Variable`}))],w=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});C.forEach(e=>m.set(e.name,w(e)));let ae=e=>({key:ce(e),arity:Mc(e),params:Nc(e),kind:Zl(s,e)?`Theorem`:`Definition`,range:e.location.range}),oe=b.length===0&&te.length===0,ce=e=>s===r?e.name:`${e.name}@${n.id}`,E=/* @__PURE__ */ new Map,D=()=>new Map([...n.modules,...y]),ue=e=>{let t=s.modules.find(t=>t.name===e.module);return t?Ac(t.location,e.location)?y.get(t.name):void 0:D().get(e.module)},pe=e=>({imported:l,getInstance:e=>{let t=ue(e),n=t?void 0:le(e.module);if(n)return{declarations:[],symbols:de(e,n),instancer:s.name};let r=t??O(e.module,s.name),i=Ow(r);return{declarations:i,symbols:fe(e,r.exported,i,e=>e),instancer:s.name}},bound:ne,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:ce,instanced:E,facts:h,reports:f,warnings:n.warnings}),me=e=>[...C.filter(t=>Ac(t.location,e)).map(e=>[e.name,w(e)]),...s.definitions.filter(t=>Ac(t.location,e)).map(e=>[e.name,ae(e)])].reduce((e,t)=>e.has(t[0])?e:e.set(t[0],t[1]),new Map(l)),ye=e=>{let t=D(),r=t.get(e.name),i=r&&jw(e,r.module);if(r&&!i)throw Aw(e);n.nested.push(e);let a={location:e.location,errors:[],warnings:[]};f.push(a);let o=ve(e,{id:`${n.id}/${e.name}`,symbols:me(e.location),modules:t,nested:n.nested,errors:a.errors,warnings:a.warnings,levelChecks:n.levelChecks});i&&a.errors.push(i),r||y.set(e.name,o)};[...s.instances.map(e=>({location:e.location,link:()=>{let t=k(e,s,pe(s),oe,D().get(e.module));E.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||m.set(n,t))})}})),...s.modules.map(e=>({location:e.location,link:()=>ye(e)}))].sort((e,t)=>Ac(e.location,t.location)?-1:1).forEach(e=>e.link());let be=rw(Uu(s,(e,t)=>he(e,t,s.name,ue(e))),ge(l));n.errors.push(...ru(be,pe(be))),be.definitions.forEach(e=>{let t=ce(e);i.set(t,e),a.set(t,!oe);let n=ae(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!Ac(r,e.location))&&(l.set(e.name,n),e.isLocal||m.set(e.name,n))});let xe={module:be,constants:b,variables:te,variableLocations:S,visible:l,exported:m,modules:y,extended:ee,facts:/* @__PURE__ */ new Set([...h,...[...be.theorems,...be.assumptions].flatMap(e=>e.name??[])])};_.has(s.name)||_.set(s.name,xe);let Se=re.splice(c).map(e=>({location:e.location,check:()=>ie(e)}));return n.levelChecks.push(()=>Kd(be,{constants:new Set(b.map(e=>e.name)),variables:new Set(te),getDefinition:e=>i.get(l.get(e)?.key??e),getQualifiedName:e=>se.get(l.get(e)?.key??e)},Se,T)),v.push(xe),xe},ye=ue(r).linked,be=t.traceFile,xe=be===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:be}}],Se=[...t.moduleOperators??[],...xe].map(e=>{let t=O(e.module,r.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});v.push(...v.splice(v.indexOf(ye),1)),T.length>0&&!t.isSanyReported&&t.print(d(T));let Ce=t.runtimeInvariants??[];Ce.forEach(e=>{if(e.module===void 0)return;h.set(r.name,ye);let t=O(e.module,r.name);v.splice(v.indexOf(t),1);let n=i.get(t.visible.get(e.name)?.key??e.name);n&&i.set(e.name,n)}),ye.visible.forEach((e,t)=>{let n=i.get(e.key);n&&e.key!==t&&i.set(t,n)}),Se.forEach(e=>{let t=e.key===void 0?void 0:i.get(e.key);e.kind!==`postcondition`&&t&&i.set(e.operator,t)});let we=[],Te=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Te(e,t)),we.push(...e.module.assumptions))};Te(ye,/* @__PURE__ */ new Set);let Ee=ye.constants.map(e=>e.name),De=ye.variables,Oe=mx(e,{root:ye,moduleSymbols:new Map([...p,...[...h].map(e=>[e[0],e[1].visible]),[r.name,ye.visible]]),definitions:i,builtins:f,copySources:o,operatorConstants:new Map(Se.flatMap(e=>O(e.module,r.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:n}),ke=Oe.constants,A=Oe.substitutions;be!==void 0&&f.forEach((e,t)=>{let n=Om(e);n&&f.set(t,n)});let Ae=Iw(De,v.flatMap(e=>e.module.variables.map(e=>e.name))),je=of({definitions:i,substitutions:A,constants:ke,variableIndex:Ae,builtins:f,variables:De}),Me={runtime:m,definitions:i,builtins:f,constants:ke,substitutions:A,instanceNames:oe,variables:De,variableIndex:Ae,facts:je,startupValues:Array.from({length:je.ids.size},()=>void 0),tlcEvalValues:/* @__PURE__ */ new WeakMap,substitutedDefinitions:l,instanceParams:u,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Ne=Wd({constants:new Set(ke.keys()),variables:/* @__PURE__ */ new Set([...De,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>f.has(e))]),getDefinition:e=>h_(e,Me)}),Pe=e=>{try{W(e,{environment:Me,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof w)return e;throw e}};A.forEach((e,t)=>{let n=i.get(e),r=Ee.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ne.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Pe(n.body):void 0;if(r){let n=Ft(r)?``:` - specifically: ${r.message}`;throw new C(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),m.version!==`1.7.4`&&(m.isStarted=!0);let Fe=new Set(v.flatMap(e=>e.module.instances.map(e=>e.module))),Ie=n.createDefinitionOrder();return{environment:Me,assumptions:we,variableLocations:ye.variableLocations,instanceActions:ae,startupDefinitions:v.filter(e=>!Fe.has(e.module.name)||Ow(e).length===0).flatMap(e=>Ie(e===ye?void 0:e.module.name).flatMap(t=>{let n=i.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:v.flatMap(e=>_e.get(e.module.name)??[]),moduleOperators:Se,runtimeInvariants:Ce,rootName:r.name}},Bw=e=>[...e].map(e=>`${e[0]}>${e[1].name}`).sort().join(`,`),Vw=(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},Hw=e=>x(new w(`${l}${e}`),S.error),Uw=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!mn(e)||!mn(i))throw Hw(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},Ww=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${Gw(t)}`:n},Gw=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Number`)return e.text??String(e.value);if(e.kind===`SetEnumeration`)return`{${e.elements.map(Gw).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${Ww(e.pattern,e.set)}:${Gw(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(Gw).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${Gw(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>Ww(e.pattern,e.set)).join(`,`)}|->${Gw(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(Gw);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},Kw=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,qw=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new C(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw Hw(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>W(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!dn(a)||!P(a))throw Hw(`The symmetry operator must specify a set of functions.`);let o=F(a).elements;if(!o.every(pn))throw Hw(`The symmetry values must be function records.`);let s=r.body,c=s.kind===`Apply`?s.args:s.kind===`SetEnumeration`?s.elements:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=Gw(Kw(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(wt.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;o.map(Uw).forEach(e=>{e.size>0&&d.set(Bw(e),e)});let f=[...d.values()],p=0;for(;p<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p,t).forEach(e=>{let t=Vw(n,e),r=Bw(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!Kw(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>mn(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},Jw=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=Xw(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(Xw(e[r],t));return a}},Yw=(e,t)=>{let n=[],r=[];for(let i of e){let e=Xw(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort($n);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push($n(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},Xw=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=Yw(e.elements,t);return n?ir(n):e}if(n===`Function`||n===`LazyFunction`&&P(e.domain)){let n=I(e),r=Jw(n.domain,t),i=Jw(n.range,t)??n.range;if(r){let e=ti(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?or(n.domain,e.range):e}return i===n.range?n:or(n.domain,i)}if(n===`Interval`||!dn(e)||!P(e))return e;let r=F(e),i=Jw(r.elements,t);return i?Yr(i):r},Zw=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=Xw(e[o],i),a===0&&(a=$n(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},Qw={line:0,column:0},$w=e=>({kind:`Identifier`,name:e,location:Qw}),eT=e=>({name:e,expression:$w(e),scope:void 0}),tT=/* @__PURE__ */ new Set([`name`,`property`]),nT=(e,t,n)=>{let r=h_(t,n);if(!r)throw new C(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new C(tT.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},rT=e=>e.body.kind===`Number`||e.body.kind===`String`,iT=(e,t,n)=>n.constants.has(e)?n.constants.get(e):rT(t)?void 0:U_(t,n),aT=(e,t,n)=>{if(n.constants.has(t))throw new C(`The ${e} ${t} cannot be a constant.`);let r=nT(e,t,n);if(iT(t,r,n)!==void 0)throw new C(`The ${e} ${t} cannot be a constant.`);return r},oT=(e,t,n)=>{let r=n.constants.has(t)?void 0:nT(e,t,n),i=r?iT(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new C(`The ${e} of ${t} is equal to ${L(i)}`);return i===void 0?r:void 0},sT=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},cT=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),W_(e.startupDefinitions,r),t.invariants.forEach(e=>{oT(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},lT=(e,t)=>{let n=Wd({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>t.definitions.get(e)});return e.flatMap(e=>{let r=oT(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
|
|
1789
1789
|
Note that a bug can cause TLC to incorrectly report this error.
|
|
1790
1790
|
If you believe your TLA+ or PlusCal specification to be correct,
|
|
1791
|
-
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw x(new C(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),S.safetyEvaluationFailure)}return[
|
|
1792
|
-
all state variables. Proceed with fingers crossed.`}),r().filter(e=>n!==void 0&&!n.includes(e)).forEach(e=>i?.({kind:`warning`,code:
|
|
1793
|
-
but TLC can handle only specifications with one next-state relation.`);o.push({expression:c.expression.action,scope:e.scope});return}if(c.kind===`Always`&&c.expression.kind!==`Let`&&c.expression.kind!==`Label`&&Zy(c.expression,e.scope,t)<2)throw x(new w(`TLC cannot handle the temporal formula ${U(c.expression)}`),S.error);let p=Zy(c,e.scope,t);if(p===3)u!==void 0&&e.path.includes(u)||(d=!0),s.push(e);else{if(p===2)throw new C(`TLC cannot handle this conjunct of the spec:\n${U(c)}`);a.push(e)}});let f=[...a,...o],p=e=>`$specification${e}`,m=f.reduce((e,t,n)=>t.scope===void 0?e:{name:p(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),h=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:p(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:a.length===0?void 0:{kind:`And`,operands:a.map(h),location:Ww},next:o.length===0?void 0:h(o[0],a.length),scope:m,temporals:s,isPropertyFairness:s.length>0&&!d}},aT=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=Qw(`property`,e,t);if(!i)return;Zy(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;$y(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(rT(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&Zy(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!M(e)?s_(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=Zy(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2){let e=U(i),t=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,n=i.kind===`BoxAction`?`To check that action ${a} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${e} (compare page 90 of ${t}).`:i.kind===`AngleAction`?`To check that infinitely many ${a} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${e} (compare page 91 of ${t}).`:`To check that action ${a} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${e}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${t}).`;throw new C(`The formula ${a} at ${e} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${n}`)}r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},oT=e=>{let t=[],n=/* @__PURE__ */ new Set,r=e=>{if(e===void 0||n.has(e))return!0;n.add(e);let i=e.binding;return i.kind===`Thunk`?(t.push(i.expression),r(i.scope)&&r(e.parent)):i.kind===`Operator`?i.operator.kind===`Closure`&&(t.push(i.operator.body),r(i.operator.scope)&&r(e.parent)):r(e.parent)};return r(e)?t:void 0},sT=(e,t,n)=>t.flatMap(t=>Qw(e,t,n)?[Kw(t)]:[]),cT=(e,t)=>{let n=s_(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},lT=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new C(`_POSSIBLE lists ${n} more than once`);Zw(`possible`,n,t);let i=Kw(n);if(Zy(i.expression,void 0,t)===3)throw new C(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return i}),uT=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||M(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},dT=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=s_(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},fT=(e,t)=>e.flatMap(e=>nT(e.expression,t).map(n=>{let r=e.scope===void 0?cf(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:uT(n,r,t),predicate:dT(e.expression,t)}})),pT=(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},mT=/[\u0100-\uffff]/,hT=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),gT=e=>e.kind===`String`?mT.test(e.value):e.kind===`Set`&&e.elements.some(gT),_T=e=>e.kind===`String`&&mT.test(e.value)||e.kind===`Apply`&&hT.has(e.operator)||mt(e).some(_T),vT=(e,t)=>e.constants.some(e=>gT(e.value)||(e.args??[]).some(gT))||[...t.definitions.values()].some(e=>_T(e.body)||e.kind===`Function`&&e.bounds.some(e=>_T(e.set))),yT=e=>{if(!dn(e))return;let t=yn(I(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},bT=(e,t,n,r)=>{let i=n===1?`the next-state action`:`action ${t} of the next-state relation`,a=r===`1.7.4`?`assigned`:`defined`;return`Successor state is not completely specified by ${i}. The following variable${e.length>1?`s are`:` is`} not ${a}: ${e.join(`, `)}.\n`},xT=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),ST=(e,t,n)=>n_(W(e,t),n),CT=(e,t,n=TT)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new w(n(e,t.environment));return r},wT=(e,t,n)=>{let r=t.kind===`Identifier`?s_(t.name,n):void 0,i=r?.kind===`Operator`?r.body:t,a=r?.kind===`Operator`?r.bodyRange:void 0;return`TLC expected a ${e} value, but did not find one. ${a&&i.kind!==`Number`?g(a):zg(i)}`},TT=(e,t)=>wT(`boolean`,e,t),ET=(e,t)=>CT(e.expression,t,(n,r)=>(CT(e.predicate,t),TT(n,r))),DT=()=>{},OT=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=ST(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),kT=(e,t)=>{try{return e(xT(t,void 0,void 0))?void 0:{message:void 0}}catch(e){if(e instanceof w)return{message:e.message};throw e}},AT=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=kT(e=>o_(W(n.expression,e),n.expression),t);if(e)return{name:zg(n.expression),trace:[],message:e.message}}},jT=(e,t,n,r=!1)=>{let i=vw(t.source,t.loadModule);return jn(i.getStringOrder(e,(t.runtimeInvariants??[]).flatMap(e=>e.module??[]))),In(t),co(t.fingerprintPolynomial??0),r&&Mn(),{order:i,specification:jw(e,{source:t.source,loadModule:t.loadModule,order:i,loadClass:t.loadClass,print:n,files:{readFile:t.readFile,writeFile:t.writeFile,makeDirectory:t.makeDirectory},seed:t.seed,isTool:t.isTool,traceFile:t.traceSpec?.traceFile,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version,moduleOperators:t.moduleOperators,readLine:t.readLine,runtimeInvariants:t.runtimeInvariants})}},MT=e=>{let t=typeof e.config==`string`?ft(e.config,e.version):e.config,n=jT(t,e,e.onPrint??console.log),r=n.specification;eT(r,t,e.onProgress);let i=r.environment,a,o=()=>a??=Ob(t,i,r.instanceActions);return i.runtime.getSpecification=()=>Nb(o(),t,i,r.variableLocations),{config:t,specification:r,environment:i,search:FT(t,i,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators,r.runtimeInvariants),getDescription:o}},NT=(e,t,n)=>{let r=AT(e,t);if(!r)return;if(r.message===void 0){let e=`Assumption ${r.name} is false.`;return n(St.assumptionFalse,e,e),S.assumptionViolation}let i=`Evaluating assumption ${r.name} failed.\n${r.message}`;return n(St.assumptionEvaluationError,i,Ft(St.assumptionEvaluationError,i,!0)),S.assumptionViolation},PT=e=>x(new w(`${l}Could not find operator: ${e.operator} in module: ${e.module}`),S.error),FT=(e,t,n,r,i,a=[],o=[])=>{let s=e=>a.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw PT(e);return{name:e.operator,key:e.key}}),c=tT(e.invariants,t),u=iT(e,t,n,r,i),d=aT(e,t,i),f=e.properties[0],p=f&&s_(f,t)?.location.range,m=e.specification,h=m&&s_(m,t)?.location.range;u.isPropertyFairness&&p&&h&&i?.({kind:`warning`,code:St.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${f} at ${g(p)} equals\nthe fairness constraints of the behavior specification ${m} at ${g(h)}.\nTherefore, checking whether ${m} => ${f} using TLC will never result in a violation of ${f}.`});let _=fT([...c,...d.invariants],t),v=_.length>0||d.actionProperties.length>0||d.liveness.length>0;if(u.init===void 0&&(v||d.initialPredicates.length>0||t.variables.length>0))throw new C(t.runtime.version===`1.7.4`?Dt:`The configuration file did not specify the initial state predicate.`);if(u.next===void 0&&v)throw new C(`The configuration file did not specify the next state predicate.`);let y=fT(o.map(e=>{let n=s_(e.name,t);return{name:e.name,expression:n?.kind===`Operator`?n.body:Gw(e.name),scope:void 0}}),t),ee=[..._,...y],b=[...new Map(ee.map(e=>[e.predicate,e])).values()],te=sT(`constraint`,[...e.constraints,...s(`constraint`).map(e=>e.name)],t),ne=fT(te,t),re=sT(`action constraint`,e.actionConstraints,t),T=t.coverage,ie=(e,n,r=!0)=>n.flatMap(n=>{if(!T)return[];let i=r?dT(n.expression,t):n.expression,a=jo(r?n.name:void 0,i,t),o=ko(T,e,a,i,n.scope);return[{expression:i,scope:n.scope,node:o}]}),ae=[...ie(`invariant`,c),...ie(`invariant`,d.invariants,!1)],oe=ie(`constraint`,re),se=ie(`constraint`,te),ce=ie(`implied`,d.initialPredicates,!1),le=ie(`implied`,d.actionProperties.map(e=>({...e,expression:e.box})),!1),E=(e,n,r,i)=>{try{return Uo(e,n.node,()=>W(n.expression,xT(t,r,i,n.scope)))}catch{return}},D=(e,t,n)=>T!==void 0&&e.every(e=>E(T,e,t,n)===!0),ue=(e,t,n)=>{if(T){for(let r of e){let e=E(T,r,t,n);if(typeof e!=`boolean`)return;if(!e)return T.primary[r.node]++,!1;T.secondary[r.node]++}return!0}};e.rlReward!==void 0&&Jw(`rlreward`,e.rlReward,t),e.periodic!==void 0&&Jw(`periodic`,e.periodic,t);let O=lT(e.possible,t);if(t.variables.length===0)return;let k=e.symmetry===void 0?void 0:zw(e.symmetry,t,e.substitutions),de=e.view===void 0?void 0:Zw(`view function`,e.view,t),fe=e.view??s(`view`)[0]?.name,pe=fe===void 0?void 0:Kw(fe),me=d.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Ww};return{...e,unchanged:t}}),he=e=>Zy(e.expression,void 0,t)>=2,ge=O.filter(e=>!he(e)),_e=O.filter(he),ve=t.runtime,ye,be=()=>{if(ye)return ye;let e=r(),n=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return ye=t.variables.map((e,t)=>t).sort((e,t)=>n(e)-n(t)),ye},xe=(e,n)=>W(e,xT(t,n,void 0)),Se=e=>{let t=k===void 0?e:Uw(e,k,be());return xo(pe===void 0?be().map(e=>t[e]):[xe(pe.expression,t)])},Ce=e=>D(ce,e)?void 0:d.initialPredicates.find(n=>!CT(n.expression,xT(t,e,void 0,n.scope))),we=/* @__PURE__ */ new WeakSet,Te=(e,n,r)=>{let i=r&&!we.has(r)?r:void 0;if(pT(e,n,i))return!1;try{let r=xT(t,n,void 0,e.scope),a=e.membership;return i&&a?!$i(n[a.variable],i[a.variable],W(a.set,r)):!ET(e,r)}catch(t){throw r?Vt(x(t,S.safetyEvaluationFailure),St.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},Ee=vT(e,t);ve.getFingerprint=Se;let De=()=>{let e=O.find(e=>!ve.possibleCounts.get(e.name));if(!e)return;let n=cT(e.name,t),r=n?` at ${g(n)}`:``;return{name:e.name,code:St.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:N(L(Mp(ve),!0))}},Oe=de?.body.kind===`Tuple`?de.body.elements:[],ke=Oe.flatMap(e=>e.kind===`Identifier`&&t.variables.includes(e.name)?[e.name]:[]),A=de?.body.kind===`Tuple`&&ke.length===Oe.length&&new Set(ke).size===ke.length,Ae=(e,n)=>A?be().filter(e=>ke.includes(t.variables[e])).map(e=>`/\\ ${t.variables[e]} = ${N(L(n[e]))}\n`).join(``):N(L(xe(e,n))),je=(e,n,r)=>CT(e.expression,xT(t,n,r),e=>`${l}${TT(e,t)}`),Me=e=>{let n=Object.fromEntries(be().map(n=>[t.variables[n],e[n]]));return pe===void 0?n:Rn(n,()=>Ae(pe.expression,e))};return ve.toRecord=Me,{properties:d,spec:u,toRecord:Me,evaluateAlias:(e,n,r,i)=>{try{Zw(`alias`,e,t);let i=W(Gw(e),xT(t,n,r)),a=yT(i);return a===void 0?Me(n):Bn(a,e)}catch(e){if(!(e instanceof C||e instanceof w))throw e;return{...Me(n),_ALIASEvalError:It(e.message,i)}}},isSymmetric:k!==void 0,isConstrained:ne.length>0||re.length>0,getTypedChecks:n=>{if(T!==void 0||O.length>0||e.periodic!==void 0||[...ee,...ne].some(e=>e.scope!==void 0)||re.length>0||d.actionProperties.some(e=>e.scope!==void 0)||d.liveness.length>0&&(n===void 0||pe!==void 0)||u.init===void 0||u.next===void 0)return;let r=b.map(e=>e.predicate),i=[...new Set(ne.map(e=>e.predicate))],a=d.initialPredicates.map(e=>e.expression),o=[...t.facts.ids.keys()],s=oT(u.scope),c=e=>F_(e,t)===void 0&&af(e,t,`replayed`);return(s===void 0?o.some(c):o.some(e=>!(e.kind===`Operator`&&e.params.length>0)&&ef(e,t)&&c(e))||rf([u.init,u.next,...r,...i,...a,...d.actionProperties.flatMap(e=>[e.action,e.subscript]),...pe?[pe.expression]:[],...s,...$b(n??[])],t,`replayed`))?void 0:{init:u.init,next:u.next,scope:u.scope,invariants:r,constraints:i,holdsInitialPredicates:e=>Ce(e)===void 0,actionProperties:d.actionProperties,symmetry:k,view:pe?.expression,variableOrder:be(),liveness:n}},getTlcOrder:be,getStoredFingerprints:(e,t)=>pe!==void 0||Ee?BigInt64Array.from(e,Se):Co(t,be()),getFingerprintState:e=>{if(Ee)return[String(Se(e))];let t=k===void 0?e:Uw(e,k,be());return pe===void 0?t:[xe(pe.expression,t)]},findViolatedInvariant:(e,t)=>{let n=(D(ae,e)?y:ee).find(n=>Te(n,e,t));return n&&we.add(e),n},getViolatedInvariants:e=>{let t=b.filter(t=>ee.some(n=>n.predicate===t.predicate&&Te(n,e,void 0)));return t.length>0&&we.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>CT(n,xT(t,e,void 0,r));ne.every(e=>r(e.predicate,e.scope))&&n();let i=b.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=d.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(ne.every(e=>CT(e.predicate,xT(n,t,void 0,e.scope)))&&re.every(r=>CT(r.expression,xT(n,e,t,r.scope))))||r())||b.every(e=>CT(e.predicate,xT(n,t,void 0,e.scope))))&&me.every(r=>CT(r.box,xT(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>ue(se,e)??ne.every(r=>pT(r,e,n)||ET(r,xT(t,e,void 0))),findFailedInitialPredicate:Ce,findViolatedActionProperty:(e,n)=>D(le,e,n)?void 0:me.find(r=>{try{return!CT(r.action,xT(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${U(r.box)}`)&&!ST(r.unchanged,xT(t,e,n,r.scope),`a subscript`)}catch(e){throw Vt(IT(e),St.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>ue(oe,e,t)??re.every(n=>je(n,e,t)),getExcludingConstraints:(e,n)=>[...ne.filter(e=>!ET(e,xT(t,n,void 0))),...re.filter(t=>!je(t,e,n))].map(e=>{let n=cT(e.name,t);return n?g(n):e.name}),trackStatePossible:ge.length===0?DT:e=>OT(ge,ve,xT(t,e,void 0)),trackActionPossible:_e.length===0?DT:(e,n)=>OT(_e,ve,xT(t,e,n)),findUnwitnessedPossible:De,getReward:(n,r,i)=>{if(e.rlReward===void 0)return i;let a=Gw(e.rlReward),o=W(a,xT(t,n,r));if(typeof o!=`number`)throw new w(wT(`integer`,a,t));return o},findPostconditionViolation:(n=!1)=>{let r=s(`postcondition`),i=e.postconditions.map(e=>{let n=s_(e,t);return n?n.kind===`Operator`&&n.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!Yw(n)&&F_(n,t)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(i!==void 0){if(n)return;throw x(new w(i),S.configParseError)}let a=(e,n)=>{let r=kT(e=>CT(Gw(n),e),t);if(!r)return;let i=s_(n,t)?.body,a=cT(n,t),o=a?` at ${i?.kind===`Number`?zg(i):g(a)}`:``;return r.message===void 0?{name:e,code:St.postconditionFalse,message:`Postcondition ${e}${o} is false.`}:{name:e,code:St.postconditionFailed,message:`Evaluating postcondition ${e}${o} failed.\n${r.message}`}};for(let e of r){let t=a(e.name,e.key);if(t)return t}let o=De();if(o)return o;for(let t of e.postconditions){let e=a(t,t);if(e)return e}}}},IT=e=>e instanceof t?x(e,e.exitCode):e,LT=(e,t)=>e*((t-e)/2**64),RT=e=>e.includes(`.`)?e:`${e}.0`,zT=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return RT(String(e));let[n,r]=e.toExponential().split(`e`);return`${RT(n)}E${r.replace(`+`,``)}`},BT=e=>e!==void 0&&e>=`0`&&e<=`9`,VT=e=>{if(e===0)return`0.0`;let t=zT(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;BT(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;BT(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;BT(t[n])&&r<2;)i+=t[n++],r++;for(BT(t[n])&&Number(t[n])>=5&&(i=HT(i));BT(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},HT=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${HT(r)}.`:n===`9`?`${HT(r)}0`:`${r}${Number(n)+1}`},UT=e=>{let t=0;for(;10n**BigInt(t+1)<e*10n;)t++;let n=10n**BigInt(t+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t+1}`)},WT=(e,t,n)=>{if(LT(e,t)<1e-10)return;let r=1/0,i=9223372036854775807n,a;if(n(e=>{if(e.length===0)return;let t=e.sort();if(a!==void 0&&a<0n==t[0]<0n){let e=t[0]-a;e<i&&(i=e)}a=t[t.length-1];let n=new Int32Array(t.buffer,t.byteOffset,t.length*2);for(let e=1;e<t.length;e++){let a=n[2*e+1],o=n[2*e-1];if(a<0!=o<0)continue;let s=a-o;if(s<=1048576){let t=s*4294967296+(n[2*e]>>>0)-(n[2*e-2]>>>0);r=Math.min(r,t)}else{let n=t[e]-t[e-1];n<i&&(i=n)}}}),r===1/0)return i;let o=BigInt(r);return o<i?o:i},GT=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a=0,o=n.find(t=>(a+=e[t],a>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},KT=[void 0,`lambda`,`tuple`,`record`],qT=()=>{let e=/* @__PURE__ */ new Int32Array(1024),t=0,n=0,r=[],i=/* @__PURE__ */ new Map,a=n=>{if(t===e.length){let t=new Int32Array(e.length*2);t.set(e),e=t}e[t++]=n},o=e=>{let t=i.get(e);if(t!==void 0)return a(t);i.set(e,r.length),a(r.length),r.push(e)},s=e=>{if(typeof e==`boolean`)return a(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(a(2),a(e),!0);if(typeof e==`string`)return a(3),o(e),!0;if(e.kind===`ModelValue`)return a(4),o(e.name),!0;if(e.kind===`Set`)return a(5),a(e.elements.length),e.elements.every(s);if(e.kind===`Function`){let t=ua(e.domain);return t?(a(7),a(KT.indexOf(sr(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(KT.indexOf(sr(e))),a(e.domain.length),e.domain.every(s)&&e.range.every(s))}return!1};return{encode:e=>{let r=t;return e.every(s)?(n++,!0):(t=r,!1)},finish:()=>({words:e.slice(0,t),strings:r,count:n})}},JT=e=>t=>{let n=t.words,r=0,i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r++];if(e===3)return t.strings[n[r++]];if(e===4)return er(t.strings[n[r++]]);if(e===5)return nr(i(n[r++]));let a=KT[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=ci({kind:`Interval`,low:e,high:e+t-1});return or(ir(o,i(t)),a)}let o=n[r++],s=i(o);return or(ir(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{kg as $,F as $t,Ob as A,$t as At,ay as B,ui as Bt,jC as C,jo as Ct,Qb as D,go as Dt,ex as E,_o as Et,iy as F,di as Ft,mv as G,rn as Gt,oy as H,L as Ht,Xv as I,qr as It,Z_ as J,Oi as Jt,U as K,tr as Kt,ey as L,ir as Lt,cb as M,br as Mt,Gy as N,$r as Nt,jb as O,fo as Ot,Yv as P,er as Pt,Dg as Q,mr as Qt,Zv as R,fi as Rt,MC as S,Eo as St,tx as T,ho as Tt,ny as U,xa as Ut,Qv as V,Ga as Vt,Jv as W,Sa as Wt,F_ as X,P as Xt,s_ as Y,Nn as Yt,ov as Z,_r as Zt,eT as _,tt as _n,Cc as _t,WT as a,zt as an,Th as at,DC as b,Ee as bn,zo as bt,jT as c,Zt as cn,am as ct,AT as d,Ht as dn,Pp as dt,St as en,Og as et,xT as f,Jt as fn,Lp as ft,$w as g,ft as gn,rf as gt,NT as h,mt as hn,ef as ht,UT as i,It as in,Oh as it,Nb as j,Zn as jt,Mb as k,xo as kt,PT as l,qt as ln,im as lt,MT as m,gt as mn,dp as mt,qT as n,Et as nn,eg as nt,LT as o,Rt as on,Eh as ot,bT as p,Lt as pn,sp as pt,W as q,nn as qt,VT as r,Ft as rn,Ag as rt,GT as s,Mt as sn,Dh as st,JT as t,Ct as tn,jg as tt,FT as u,Nt as un,om as ut,IT as v,Ke as vn,ic as vt,BS as w,is as wt,kC as x,Ko as xt,Hw as y,xe as yn,ko as yt,sy as z,nr as zt};
|
|
1791
|
+
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw x(new C(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),S.safetyEvaluationFailure)}return[eT(e)]})},uT=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>uT(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=h_(e.name,t);if(n?.kind===`Operator`&&n.params.length===0&&U_(n,t)===void 0)return uT(n.body,t)}return[e]},dT=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||ab(r,e.scope,t)>0)return!1;let i=W(r,kT(t,void 0,void 0,e.scope));if(i===!1)throw new C(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new C(`The operator ${r.name}, which equals ${L(i)},\ncannot be used as a ${n}`);return!0},fT=(e,t,n,r,i)=>{if(e.specification===void 0){let n=(e,n)=>{if(e!==void 0)return aT(n,e,t),$w(e)};return{init:n(e.init,`initial predicate`),next:n(e.next,`next state action`),scope:void 0,temporals:[],isPropertyFairness:!1}}if(e.init!==void 0||e.next!==void 0)throw new C(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let a=[],o=[],s=[],c=t.constants.has(e.specification)?t.constants.get(e.specification):iT(e.specification,nT(`name`,e.specification,t),t);if(c!==void 0)throw new C(`The value of ${e.specification} is equal to ${L(c)}`);let l=nT(`name`,e.specification,t),u=e.properties.length===1?e.properties[0]:void 0,d=!1;sb(l.body,void 0,t,!1).forEach(e=>{let c=e.expression,l=e.path.some(e=>{let n=h_(e,t);return n?.kind===`Operator`&&ab(n.body,void 0,t)===1});if(!l&&dT(e,t,`spec`))return;let f=c.kind===`Identifier`&&!M(c)?t.variableIndex.get(c.name):void 0;if(!l&&c.kind===`Identifier`&&f!==void 0){let e=n[f].range;throw new C(`The operator ${c.name}, which equals ${e?g(e):c.name},\ncannot be used as a spec`)}if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw x(new C(`TLC does not support temporal existential, nor universal, quantification over state variables.`),S.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){let n=Lb(c.expression.subscript,e.scope,t);if(n===void 0&&i?.({kind:`warning`,code:wt.subscriptUndetermined,text:`TLC could not determine if the subscript of the next-state relation contains
|
|
1792
|
+
all state variables. Proceed with fingers crossed.`}),r().filter(e=>n!==void 0&&!n.includes(e)).forEach(e=>i?.({kind:`warning`,code:wt.subscriptMissingVariable,text:`The subscript of the next-state relation specified by the specification\ndoes not seem to contain the state variable ${e}`})),o.length>0)throw new C(`The specification contains more than one conjunct of the form [][Next]_v,
|
|
1793
|
+
but TLC can handle only specifications with one next-state relation.`);o.push({expression:c.expression.action,scope:e.scope});return}if(c.kind===`Always`&&c.expression.kind!==`Let`&&c.expression.kind!==`Label`&&ab(c.expression,e.scope,t)<2)throw x(new w(`TLC cannot handle the temporal formula ${U(c.expression)}`),S.error);let p=ab(c,e.scope,t);if(p===3)u!==void 0&&e.path.includes(u)||(d=!0),s.push(e);else{if(p===2)throw new C(`TLC cannot handle this conjunct of the spec:\n${U(c)}`);a.push(e)}});let f=[...a,...o],p=e=>`$specification${e}`,m=f.reduce((e,t,n)=>t.scope===void 0?e:{name:p(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),h=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:p(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:a.length===0?void 0:{kind:`And`,operands:a.map(h),location:Qw},next:o.length===0?void 0:h(o[0],a.length),scope:m,temporals:s,isPropertyFairness:s.length>0&&!d}},pT=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=oT(`property`,e,t);if(!i)return;ab(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;sb(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(dT(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&ab(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!M(e)?h_(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=ab(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2){let e=U(i),t=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,n=i.kind===`BoxAction`?`To check that action ${a} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${e} (compare page 90 of ${t}).`:i.kind===`AngleAction`?`To check that infinitely many ${a} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${e} (compare page 91 of ${t}).`:`To check that action ${a} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${e}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${t}).`;throw new C(`The formula ${a} at ${e} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${n}`)}r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},mT=e=>{let t=[],n=/* @__PURE__ */ new Set,r=e=>{if(e===void 0||n.has(e))return!0;n.add(e);let i=e.binding;return i.kind===`Thunk`?(t.push(i.expression),r(i.scope)&&r(e.parent)):i.kind===`Operator`?i.operator.kind===`Closure`&&(t.push(i.operator.body),r(i.operator.scope)&&r(e.parent)):r(e.parent)};return r(e)?t:void 0},hT=(e,t,n)=>t.flatMap(t=>oT(e,t,n)?[eT(t)]:[]),gT=(e,t)=>{let n=h_(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},_T=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new C(`_POSSIBLE lists ${n} more than once`);aT(`possible`,n,t);let i=eT(n);if(ab(i.expression,void 0,t)===3)throw new C(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return i}),vT=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||M(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},yT=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=h_(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},bT=(e,t)=>e.flatMap(e=>{let n=yT(e.expression,t);return(e.scope===void 0&&gf(n,t)===void 0?[n]:uT(e.expression,t)).map(r=>{let i=e.scope===void 0?gf(r,t):void 0;return{name:e.name,expression:r,scope:e.scope,variables:i,membership:vT(r,i,t),predicate:n}})}),xT=(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},ST=/[\u0100-\uffff]/,CT=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),wT=e=>e.kind===`String`?ST.test(e.value):e.kind===`Set`&&e.elements.some(wT),TT=e=>e.kind===`String`&&ST.test(e.value)||e.kind===`Apply`&&CT.has(e.operator)||mt(e).some(TT),ET=(e,t)=>e.constants.some(e=>wT(e.value)||(e.args??[]).some(wT))||[...t.definitions.values()].some(e=>TT(e.body)||e.kind===`Function`&&e.bounds.some(e=>TT(e.set))),DT=e=>{if(!pn(e))return;let t=xn(I(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},OT=(e,t,n,r)=>{let i=n===1?`the next-state action`:`action ${t} of the next-state relation`,a=r===`1.7.4`?`assigned`:`defined`;return`Successor state is not completely specified by ${i}. The following variable${e.length>1?`s are`:` is`} not ${a}: ${e.join(`, `)}.\n`},kT=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),AT=(e,t,n)=>u_(W(e,t),n),jT=(e,t,n=NT)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new w(n(e,t.environment));return r},MT=(e,t,n)=>{let r=t.kind===`Identifier`?h_(t.name,n):void 0,i=r?.kind===`Operator`?r.body:t,a=r?.kind===`Operator`?r.bodyRange:void 0;return`TLC expected a ${e} value, but did not find one. ${a&&i.kind!==`Number`?g(a):qg(i)}`},NT=(e,t)=>MT(`boolean`,e,t),PT=(e,t)=>jT(e.expression,t,(n,r)=>(e.predicate!==e.expression&&jT(e.predicate,t),NT(n,r))),FT=()=>{},IT=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=AT(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),LT=(e,t)=>{try{return e(kT(t,void 0,void 0))?void 0:{message:void 0}}catch(e){if(e instanceof w)return{message:e.message};throw e}},RT=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=LT(e=>m_(W(n.expression,e),n.expression),t);if(e)return{name:qg(n.expression),trace:[],message:e.message}}},zT=(e,t,n,r=!1)=>{let i=Ew(t.source,t.loadModule);return Nn(i.getStringOrder(e,(t.runtimeInvariants??[]).flatMap(e=>e.module??[]))),Rn(t),po(t.fingerprintPolynomial??0),r&&Pn(),{order:i,specification:zw(e,{source:t.source,loadModule:t.loadModule,order:i,loadClass:t.loadClass,print:n,files:{readFile:t.readFile,writeFile:t.writeFile,makeDirectory:t.makeDirectory},seed:t.seed,isTool:t.isTool,traceFile:t.traceSpec?.traceFile,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version,moduleOperators:t.moduleOperators,readLine:t.readLine,runtimeInvariants:t.runtimeInvariants})}},BT=e=>{let t=typeof e.config==`string`?ft(e.config,e.version):e.config,n=zT(t,e,e.onPrint??console.log),r=n.specification;cT(r,t,e.onProgress);let i=r.environment,a,o=()=>a??=Ib(t,i,r.instanceActions);return i.runtime.getSpecification=()=>Vb(o(),t,i,r.variableLocations),{config:t,specification:r,environment:i,search:UT(t,i,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators,r.runtimeInvariants),getDescription:o}},VT=(e,t,n)=>{let r=RT(e,t);if(!r)return;if(r.message===void 0){let e=`Assumption ${r.name} is false.`;return n(wt.assumptionFalse,e,e),S.assumptionViolation}let i=`Evaluating assumption ${r.name} failed.\n${r.message}`;return n(wt.assumptionEvaluationError,i,Lt(wt.assumptionEvaluationError,i,!0)),S.assumptionViolation},HT=e=>x(new w(`${l}Could not find operator: ${e.operator} in module: ${e.module}`),S.error),UT=(e,t,n,r,i,a=[],o=[])=>{let s=e=>a.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw HT(e);return{name:e.operator,key:e.key}}),c=lT(e.invariants,t),u=fT(e,t,n,r,i),d=pT(e,t,i),f=e.properties[0],p=f&&h_(f,t)?.location.range,m=e.specification,h=m&&h_(m,t)?.location.range;u.isPropertyFairness&&p&&h&&i?.({kind:`warning`,code:wt.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${f} at ${g(p)} equals\nthe fairness constraints of the behavior specification ${m} at ${g(h)}.\nTherefore, checking whether ${m} => ${f} using TLC will never result in a violation of ${f}.`});let _=bT([...c,...d.invariants],t),v=_.length>0||d.actionProperties.length>0||d.liveness.length>0;if(u.init===void 0&&(v||d.initialPredicates.length>0||t.variables.length>0))throw new C(t.runtime.version===`1.7.4`?kt:`The configuration file did not specify the initial state predicate.`);if(u.next===void 0&&v)throw new C(`The configuration file did not specify the next state predicate.`);let y=bT(o.map(e=>{let n=h_(e.name,t);return{name:e.name,expression:n?.kind===`Operator`?n.body:$w(e.name),scope:void 0}}),t),ee=[..._,...y],b=[...new Map(ee.map(e=>[e.predicate,e])).values()],te=hT(`constraint`,[...e.constraints,...s(`constraint`).map(e=>e.name)],t),ne=bT(te,t),re=hT(`action constraint`,e.actionConstraints,t),T=t.coverage,ie=(e,n,r=!0)=>n.flatMap(n=>{if(!T)return[];let i=r?yT(n.expression,t):n.expression,a=Fo(r?n.name:void 0,i,t),o=No(T,e,a,i,n.scope);return[{expression:i,scope:n.scope,node:o}]}),ae=[...ie(`invariant`,c),...ie(`invariant`,d.invariants,!1)],oe=new Map([...c,...d.invariants].map((e,n)=>[yT(e.expression,t),ae[n]])),se=ie(`constraint`,re),ce=ie(`constraint`,te),le=ie(`implied`,d.initialPredicates,!1),E=ie(`implied`,d.actionProperties.map(e=>({...e,expression:e.box})),!1),D=(e,n,r,i)=>{try{return qo(e,n.node,()=>W(n.expression,kT(t,r,i,n.scope)))}catch{return}},ue=(e,t,n)=>{if(T){for(let r of e){let e=D(T,r,t,n);if(typeof e!=`boolean`)return;if(!e)return T.primary[r.node]++,!1;T.secondary[r.node]++}return!0}};e.rlReward!==void 0&&nT(`rlreward`,e.rlReward,t),e.periodic!==void 0&&nT(`periodic`,e.periodic,t);let O=_T(e.possible,t);if(t.variables.length===0)return;let k=e.symmetry===void 0?void 0:qw(e.symmetry,t,e.substitutions),de=e.view===void 0?void 0:aT(`view function`,e.view,t),fe=e.view??s(`view`)[0]?.name,pe=fe===void 0?void 0:eT(fe),me=d.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Qw};return{...e,unchanged:t}}),he=e=>ab(e.expression,void 0,t)>=2,ge=O.filter(e=>!he(e)),_e=O.filter(he),ve=t.runtime,ye,be=()=>{if(ye)return ye;let e=r(),n=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return ye=t.variables.map((e,t)=>t).sort((e,t)=>n(e)-n(t)),ye},xe=(e,n)=>W(e,kT(t,n,void 0)),Se=e=>(pe!==void 0&&e.forEach(Wr),k===void 0?e:Zw(e,k,be())),Ce=e=>{let t=Se(e);return To(pe===void 0?be().map(e=>t[e]):[xe(pe.expression,t)])},we=e=>d.initialPredicates.find((n,r)=>{let i=T&&D(T,le[r],e,void 0);return typeof i==`boolean`?!i:!jT(n.expression,kT(t,e,void 0,n.scope))}),Te=/* @__PURE__ */ new WeakSet,Ee=(e,n,r)=>{let i=r&&!Te.has(r)?r:void 0;if(xT(e,n,i))return!1;try{let r=kT(t,n,void 0,e.scope),a=e.membership;return i&&a?!ta(n[a.variable],i[a.variable],W(a.set,r)):!PT(e,r)}catch(t){throw r?Ut(x(t,S.safetyEvaluationFailure),wt.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},De=(e,t,n)=>{let r=oe.get(e.predicate),i=T&&r?D(T,r,t,void 0):void 0;return typeof i==`boolean`?!i:ee.some(r=>r.predicate===e.predicate&&Ee(r,t,n))},Oe=ET(e,t);ve.getFingerprint=Ce;let ke=()=>{let e=O.find(e=>!ve.possibleCounts.get(e.name));if(!e)return;let n=gT(e.name,t),r=n?` at ${g(n)}`:``;return{name:e.name,code:wt.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:N(L(Bp(ve),!0))}},A=de?.body.kind===`Tuple`?de.body.elements:[],Ae=A.flatMap(e=>e.kind===`Identifier`&&t.variables.includes(e.name)?[e.name]:[]),je=de?.body.kind===`Tuple`&&Ae.length===A.length&&new Set(Ae).size===Ae.length,Me=(e,n)=>je?be().filter(e=>Ae.includes(t.variables[e])).map(e=>`/\\ ${t.variables[e]} = ${N(L(n[e]))}\n`).join(``):N(L(xe(e,n))),Ne=(e,n,r)=>jT(e.expression,kT(t,n,r),e=>`${l}${NT(e,t)}`),Pe=e=>{let n=Object.fromEntries(be().map(n=>[t.variables[n],e[n]]));return pe===void 0?n:Bn(n,()=>Me(pe.expression,e))};return ve.toRecord=Pe,{properties:d,spec:u,toRecord:Pe,evaluateAlias:(e,n,r,i)=>{let a=()=>Pe(n.map(e=>e??nr(`null`)));try{aT(`alias`,e,t);let i=W($w(e),kT(t,n,r)),o=DT(i);return o===void 0?a():Hn(o,e)}catch(e){if(!(e instanceof C||e instanceof w))throw e;return{...a(),_ALIASEvalError:Rt(e.message,i)}}},isSymmetric:k!==void 0,isConstrained:ne.length>0||re.length>0,getTypedChecks:n=>{if(T!==void 0||O.length>0||e.periodic!==void 0||[...ee,...ne].some(e=>e.scope!==void 0)||re.length>0||d.actionProperties.some(e=>e.scope!==void 0)||d.liveness.length>0&&(n===void 0||pe!==void 0)||u.init===void 0||u.next===void 0)return;let r=b.map(e=>e.predicate),i=[...new Set(ne.map(e=>e.predicate))],a=d.initialPredicates.map(e=>e.expression),o=[...t.facts.ids.keys()],s=mT(u.scope),c=e=>U_(e,t)===void 0&&pf(e,t,`replayed`);return(s===void 0?o.some(c):o.some(e=>!(e.kind===`Operator`&&e.params.length>0)&&lf(e,t)&&c(e))||ff([u.init,u.next,...r,...i,...a,...d.actionProperties.flatMap(e=>[e.action,e.subscript]),...pe?[pe.expression]:[],...s,...sx(n??[])],t,`replayed`))?void 0:{init:u.init,next:u.next,scope:u.scope,invariants:r,constraints:i,holdsInitialPredicates:e=>we(e)===void 0,actionProperties:d.actionProperties,symmetry:k,view:pe?.expression,variableOrder:be(),liveness:n}},getTlcOrder:be,getStoredFingerprints:(e,t)=>pe!==void 0||Oe?BigInt64Array.from(e,Ce):Do(t,be()),getFingerprintState:e=>{if(Oe)return[String(Ce(e))];let t=Se(e);return pe===void 0?t:[xe(pe.expression,t)]},findViolatedInvariant:(e,t)=>{let n=T===void 0?ee.find(n=>Ee(n,e,t)):b.find(n=>De(n,e,t));return n&&Te.add(e),n},forEachViolatedInvariant:(e,t)=>{for(let n of b)De(n,e,void 0)&&(Te.add(e),t(n))},checkReplayedInitialState:(e,t,n,r)=>{let i=(n,r)=>jT(n,kT(t,e,void 0,r));ne.every(e=>i(e.predicate,e.scope))&&n();for(let e of b)i(e.predicate,e.scope)||r({status:`invariant-violation`,name:e.name});let a=d.initialPredicates.find(e=>!i(e.expression,e.scope));a&&r({status:`liveness-violation`,name:a.name})},checkReplayedSuccessor:(e,t,n,r)=>(!(!(ne.every(e=>jT(e.predicate,kT(n,t,void 0,e.scope)))&&re.every(r=>jT(r.expression,kT(n,e,t,r.scope))))||r())||b.every(e=>jT(e.predicate,kT(n,t,void 0,e.scope))))&&me.every(r=>jT(r.box,kT(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>ue(ce,e)??ne.every(r=>xT(r,e,n)||PT(r,kT(t,e,void 0))),findFailedInitialPredicate:we,findViolatedActionProperty:(e,n)=>me.find((r,i)=>{let a=T&&D(T,E[i],e,n);if(typeof a==`boolean`)return!a;try{return!jT(r.action,kT(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${U(r.box)}`)&&!AT(r.unchanged,kT(t,e,n,r.scope),`a subscript`)}catch(e){throw Ut(WT(e),wt.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>ue(se,e,t)??re.every(n=>Ne(n,e,t)),getExcludingConstraints:(e,n)=>[...ne.filter(e=>!PT(e,kT(t,n,void 0))),...re.filter(t=>!Ne(t,e,n))].map(e=>{let n=gT(e.name,t);return n?g(n):e.name}),trackStatePossible:ge.length===0?FT:e=>IT(ge,ve,kT(t,e,void 0)),trackActionPossible:_e.length===0?FT:(e,n)=>IT(_e,ve,kT(t,e,n)),findUnwitnessedPossible:ke,getReward:(n,r,i)=>{if(e.rlReward===void 0)return i;let a=$w(e.rlReward),o=W(a,kT(t,n,r));if(typeof o!=`number`)throw new w(MT(`integer`,a,t));return o},findPostconditionViolation:(n=!1)=>{let r=s(`postcondition`),i=e.postconditions.map(e=>{let n=h_(e,t);return n?n.kind===`Operator`&&n.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!rT(n)&&U_(n,t)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(i!==void 0){if(n)return;throw x(new w(i),S.configParseError)}let a=(e,n)=>{let r=LT(e=>jT($w(n),e),t);if(!r)return;let i=h_(n,t)?.body,a=gT(n,t),o=a?` at ${i?.kind===`Number`?qg(i):g(a)}`:``;return r.message===void 0?{name:e,code:wt.postconditionFalse,message:`Postcondition ${e}${o} is false.`}:{name:e,code:wt.postconditionFailed,message:`Evaluating postcondition ${e}${o} failed.\n${r.message}`}};for(let e of r){let t=a(e.name,e.key);if(t)return t}let o=ke();if(o)return o;for(let t of e.postconditions){let e=a(t,t);if(e)return e}}}},WT=e=>e instanceof t?x(e,e.exitCode):e,GT=(e,t)=>e*((t-e)/2**64),KT=e=>e.includes(`.`)?e:`${e}.0`,qT=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return KT(String(e));let[n,r]=e.toExponential().split(`e`);return`${KT(n)}E${r.replace(`+`,``)}`},JT=e=>e!==void 0&&e>=`0`&&e<=`9`,YT=e=>{if(e===0)return`0.0`;let t=qT(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;JT(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;JT(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;JT(t[n])&&r<2;)i+=t[n++],r++;for(JT(t[n])&&Number(t[n])>=5&&(i=XT(i));JT(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},XT=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${XT(r)}.`:n===`9`?`${XT(r)}0`:`${r}${Number(n)+1}`},ZT=e=>{let t=0;for(;10n**BigInt(t+1)<e*10n;)t++;let n=10n**BigInt(t+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t+1}`)},QT=(e,t,n)=>{if(GT(e,t)<1e-10)return;let r=1/0,i=9223372036854775807n,a;if(n(e=>{if(e.length===0)return;let t=e.sort();if(a!==void 0&&a<0n==t[0]<0n){let e=t[0]-a;e<i&&(i=e)}a=t[t.length-1];let n=new Int32Array(t.buffer,t.byteOffset,t.length*2);for(let e=1;e<t.length;e++){let a=n[2*e+1],o=n[2*e-1];if(a<0!=o<0)continue;let s=a-o;if(s<=1048576){let t=s*4294967296+(n[2*e]>>>0)-(n[2*e-2]>>>0);r=Math.min(r,t)}else{let n=t[e]-t[e-1];n<i&&(i=n)}}}),r===1/0)return i;let o=BigInt(r);return o<i?o:i},$T=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a=0,o=n.find(t=>(a+=e[t],a>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},eE=[void 0,`lambda`,`tuple`,`record`],tE=()=>{let e=/* @__PURE__ */ new Int32Array(1024),t=0,n=0,r=[],i=/* @__PURE__ */ new Map,a=n=>{if(t===e.length){let t=new Int32Array(e.length*2);t.set(e),e=t}e[t++]=n},o=e=>{let t=i.get(e);if(t!==void 0)return a(t);i.set(e,r.length),a(r.length),r.push(e)},s=e=>{if(typeof e==`boolean`)return a(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(a(2),a(e),!0);if(typeof e==`string`)return a(3),o(e),!0;if(e.kind===`ModelValue`)return a(4),o(e.name),!0;if(e.kind===`Set`)return a(5),a(e.elements.length),e.elements.every(s);if(e.kind===`Function`){let t=ma(e.domain);return t?(a(7),a(eE.indexOf(lr(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(eE.indexOf(lr(e))),a(e.domain.length),e.domain.every(s)&&e.range.every(s))}return!1};return{encode:e=>{let r=t;return e.every(s)?(n++,!0):(t=r,!1)},finish:()=>({words:e.slice(0,t),strings:r,count:n})}},nE=e=>t=>{let n=t.words,r=0,i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r++];if(e===3)return t.strings[n[r++]];if(e===4)return nr(t.strings[n[r++]]);if(e===5)return ir(i(n[r++]));let a=eE[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=ui({kind:`Interval`,low:e,high:e+t-1});return cr(or(o,i(t)),a)}let o=n[r++],s=i(o);return cr(or(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Lg as $,yr as $t,Ib as A,To as At,py as B,mi as Bt,zC as C,Ke as Cn,Ao as Ct,ox as D,xo as Dt,cx as E,yo as Et,fy as F,ti as Ft,Sv as G,Ta as Gt,my as H,fi as Ht,iy as I,nr as It,av as J,rr as Jt,U as K,Ea as Kt,cy as L,pi as Lt,gb as M,$n as Mt,$y as N,Ki as Nt,zb as O,bo as Ot,ry as P,Sr as Pt,Fg as Q,P as Qt,ay as R,Yr as Rt,BC as S,tt as Sn,Xo as St,lx as T,Ee as Tn,cs as Tt,uy as U,Ya as Ut,oy as V,ir as Vt,ny as W,L as Wt,U_ as X,Ai as Xt,h_ as Y,an as Yt,mv as Z,Fn as Zt,cT as _,zt as _n,ff as _t,QT as a,Tt as an,Nh as at,FC as b,mt as bn,No as bt,zT as c,Rt as cn,pm as ct,RT as d,Pt as dn,Hp as dt,gr as en,Ig as et,kT as f,$t as fn,Kp as ft,sT as g,Xt as gn,lf as gt,VT as h,Wt as hn,yp as ht,ZT as i,wt as in,Ih as it,Vb as j,tn as jt,Bb as k,go as kt,HT as l,Vt as ln,fm as lt,BT as m,Ft as mn,hp as mt,tE as n,F as nn,cg as nt,GT as o,Ot as on,Ph as ot,OT as p,Yt as pn,Wp as pt,W as q,on as qt,YT as r,_r as rn,Rg as rt,$T as s,Lt as sn,Fh as st,nE as t,Wr as tn,zg as tt,UT as u,Bt as un,mm as ut,WT as v,vt as vn,Ac as vt,JS as w,xe as wn,Fo as wt,LC as x,ft as xn,Uo as xt,Xw as y,gt as yn,cc as yt,hy as z,or as zt};
|