tla-ts 0.0.10-dev.3a85c3a9e → 0.0.10-dev.4a2a53c48
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/run.cjs +15 -15
- package/dist/run.js +38 -38
- package/dist/transfer.cjs +4 -4
- package/dist/transfer.js +4 -4
- package/package.json +1 -1
- package/src/cli/tlc-output.ts +3 -3
- package/src/cli/tlc.ts +15 -1
- package/src/environment.ts +10 -5
- package/src/resolve.ts +1 -2
- package/src/runtime.ts +4 -0
- package/src/search.ts +29 -20
- package/src/simulate.ts +3 -0
- package/src/standard-definitions.ts +4 -0
- package/src/tlc/tlcext-operators.ts +44 -12
package/dist/transfer.cjs
CHANGED
|
@@ -75,7 +75,7 @@ It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the
|
|
|
75
75
|
`:`/\\ %s = %s
|
|
76
76
|
`;if(typeof s!=`string`)throw new e.g(`The _format field of the ALIAS ${a} is ${R(s)}, but it must be a string.`);return i.filter(([e])=>!(o&&e===`_format`)).filter(([e,t])=>!n||!da(n[e],t)).map(([t,n])=>{let r=pa(s,[t,M(R(n))]);if(r===void 0)throw new e.g(`The _format field of the ALIAS ${a} is ${R(s)}, but it must format two strings, the name and the value of a field.`);return r}).join(``)},ha=[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 ga=ha[0];const _a=()=>ga,va=/* @__PURE__ */ new Int32Array(256),ya=/* @__PURE__ */ new Int32Array(256),ba=/* @__PURE__ */ new Int32Array(256),xa=/* @__PURE__ */ new Int32Array(256),Sa=/* @__PURE__ */ new Int32Array(256),Ca=/* @__PURE__ */ new Int32Array(256),wa=/* @__PURE__ */ new Int32Array(256),Ta=/* @__PURE__ */ new Int32Array(256);let Ea=0,Da=0,Oa=0,ka=0;const Aa=e=>{let t=(e^ka)&255;ka=(ka>>>8|Oa<<24)^Sa[t],Oa=Oa>>>8^va[t]},ja=e=>{let t=ha[e];ga=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);va[e]=Number(BigInt.asIntN(32,t>>32n)),Sa[e]=Number(BigInt.asIntN(32,t))}let i=[va,ya,ba,xa],a=[Sa,Ca,wa,Ta];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)^Sa[o],i[e][r]=t[r]>>>8^va[o]}}Ea=Number(BigInt.asIntN(32,t>>32n)),Da=Number(BigInt.asIntN(32,t))};ja(0);const Ma=e=>{let t=ka^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;ka=Oa^Ta[n]^wa[r]^Ca[i]^Sa[a],Oa=xa[n]^ba[r]^ya[i]^va[a]},Na=e=>{if(typeof e==`boolean`)return Aa(0),Aa(e?116:102),2;if(typeof e==`number`)return Aa(1),Ma(e),5;if(typeof e==`string`){Aa(3),Ma(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)Ma(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++)Aa(e.charCodeAt(n));return 5+e.length}return Aa(21),Ma(dn(e.name)+1),5},Pa=e=>{let t=Oa,n=ka;Oa=0,ka=0;let r=[Na(e),Oa,ka];return Oa=t,ka=n,r},Fa=e=>`m = (${e} ^ l) & 255; l = ((l >>> 8) | (h << 24)) ^ L0[m]; h = (h >>> 8) ^ H0[m];`,Ia=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];`,La={integer:e=>`${Fa(`1`)} ${Ia(e)}`,boolean:e=>`${Fa(`0`)} ${Fa(`(${e} ? 116 : 102)`)}`,set:e=>`${Fa(`5`)} ${Ia(e)}`,function:e=>`${Fa(`9`)} ${Ia(e)}`,scalar:(e,t,n)=>`{ let r = ${e}; for (; r >= 4; r -= 4) { ${Ia(`0`)} } for (; r > 0; r--) { ${Fa(`0`)} } h ^= ${t}; l ^= ${n}; }`},Ra=()=>({H0:va,H1:ya,H2:ba,H3:xa,L0:Sa,L1:Ca,L2:wa,L3:Ta,initialHigh:Ea,initialLow:Da}),za=(e,t)=>{let n=Oa,r=ka;ka=e[0],Oa=e[1],Ha(t),e[0]=ka,e[1]=Oa,Oa=n,ka=r},Ba=e=>{Aa(5),Ma(e)},Va=e=>{Aa(9),Ma(e)},Ha=e=>{if(typeof e!=`object`||Pt(e))Na(e);else if(Nt(e)){let t=L(e);Va(t.domain.length);for(let e=0;e<t.domain.length;e++)Ha(t.domain[e]),Ha(t.range[e])}else{let t=I(e).elements;Ba(t.length);for(let e of t)Ha(e)}},Ua=e=>{let t=Oa,n=ka;Oa=Ea,ka=Da;for(let t of e)Ha(t);let r=BigInt(Oa>>>0)<<32n|BigInt(ka>>>0);return Oa=t,ka=n,r},Wa=(e,t)=>{let n=new BigInt64Array(e),r=new Int32Array(n.buffer),i=Oa,a=ka;for(let n=0;n<e;n++)Oa=Ea,ka=Da,t(n),r[2*n]=ka,r[2*n+1]=Oa;return Oa=i,ka=a,n},Ga=(e,t)=>Wa(e.length,n=>{for(let r of t)Ha(e[n][r])}),Ka=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),qa=1024,Ja=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*qa),relations:[]}),Ya=(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},Xa=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,Za=(e,t,n,r,i)=>{let a=t===`next`?Xa(e,t,r):void 0;if(a!==void 0)return a;let o=Ya(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},Qa=(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,$a=(t,n,r)=>{let i=t===void 0?void 0:r.definitions.get(t),a=i?.kind===`Operator`?i.head:void 0,o=n.location.range;return!i||!a?`Action ${o?e.X(o):`Unknown location`}`:Qa(i.body.location.range,o)||!o?`${i.name} ${e.X(a)}`:`${i.name} ${e.X(a)} (${o.start.line} ${o.start.column} ${o.end.line} ${o.end.column})`},eo=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,to=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,no=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},ro=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[(Ve(t.name)&2147483647)%e.length].unshift(t));t=e}t[(Ve(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]),ao=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),oo=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),so=(e,t,n)=>{let r=new Set(n.map(eo)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(j(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&&!Ka.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=Ya(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(eo(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`?oo(t.bounds):t.params.map(e=>e.name);m(t.body,ao(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,ao(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:case`Lambda`:m(e.body,ao(e.params,t));return;case`Let`:{let n=e.definitions.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),ro(e.definitions).forEach(e=>u({definition:e,scope:n})),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,to(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,no(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,to(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,ao(oo(e.bounds),t)),r(io(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,ao(oo(e.bounds),t)),r(io(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,ao(oo([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,ao(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,ao(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}};e.relations.forEach(e=>{i.push(e.node),m(e.expression,void 0),i.pop()})},co=(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=co(e,r,n);if(t!==-1)return t}}return-1},lo=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=co(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:co(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},uo=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},fo=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},po=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},mo=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},ho=(e,t)=>t.forEach((t,n)=>{let r=Ua([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*qa+i;e.registers[o]=Math.max(e.registers[o],mo(a)+1)}),go=(e,t)=>{let n=e.registers.subarray(t*qa,(t+1)*qa),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*qa*qa/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*qa?a===0?i:qa*Math.log(qa/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},_o=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},vo=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>_o(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},yo=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},bo=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],xo=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},So=(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}},Co=(t,n)=>{let r=[],i=/* @__PURE__ */ new Map,a=e=>{let n=[],r={primary:t.primary[e],secondary:t.secondary[e]};return(r.primary>0||r.secondary>0||bo(t,e))&&yo(n,r),xo(t,e).forEach(e=>a(e).forEach(e=>yo(n,e))),i.set(e,n),n},o=(n,i,a,o)=>{let s=t.ranges[n];r.push({location:s?e.X(s):`Unknown location`,depth:i,count:a,cost:o})},s=(e,n)=>o(e,n,t.primary[e],t.secondary[e]),c=(e,n)=>{let r=xo(t,e),l=[];r.forEach(e=>(i.get(e)??a(e)).forEach(e=>yo(l,e)));let u={primary:t.primary[e],secondary:t.secondary[e]},d=bo(t,e),f=e=>r.forEach(t=>c(t,e));if(t.isUnchanged[e]){let t=l.filter(e=>e.primary!==0||e.secondary!==0);t.length===0?s(e,n):o(e,n,Math.max(u.primary,vo(t).primary),0);return}if(l.length===0){(u.primary!==0||d)&&s(e,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let t=l[0],r=t.primary===0&&t.secondary===0;if(t.primary<u.primary){s(e,n),f(n+1);return}if(!d&&p&&!r){o(e,n,t.primary,t.secondary);return}if(p&&r){d&&s(e,n),f(d?n+1:n);return}if(u.primary===t.primary&&u.secondary===t.secondary){s(e,n);return}}let m=!p||d;m&&s(e,n),f(m?n+1:n)};return xo(t,n).forEach(e=>{a(e),c(e,0)}),r},wo=[`init`,`next`,`invariant`,`constraint`,`implied`],To=(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,Eo=e=>wo.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>To(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||To(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),Do=(t,n,r,i)=>({variables:i.map(i=>{let a=r[i]?.range;return{label:`${n.variables[i]} ${a?e.X(a):`Unknown location`}`,distinct:go(t,i)}}),relations:Eo(t).map(e=>({kind:e.kind,label:e.label,...So(t,e),expressions:Co(t,e.node)}))}),Oo=(e,t,n)=>{let r=Xa(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]]]},ko=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),Ao=(t,n)=>ko.has(t)?new e.b(n):new e.k(n),jo=(t,n,r,i)=>new e.k(`The ${t} argument of ${n} should be a ${r}, but instead it is:\n${R(i)}`),Mo=(t,n,r=t)=>{if(!P(t)||pn(t))throw new e.k(`Applying ${n} to the following value,\nwhich is not a finite set:\n${R(r)}`);return I(t)},No=e=>typeof e==`object`&&e.kind===`Operator`,z=(e,t,n)=>{let r=e[t];if(r===void 0||No(r))throw Ao(n,`${n} expects a value as argument ${t+1}`);return r},Po=(e,t,n)=>{let r=z(e,t,n);if(typeof r!=`boolean`)throw Ao(n,`${n} expects a boolean but received ${R(r)}`);return r},Fo=(e,t,n)=>{let r=e[t];if(r===void 0||!No(r))throw Ao(n,`${n} expects an operator as argument ${t+1}`);return r},Io=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),B=(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}),Lo=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Ro=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),zo=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(z(n,0,e),z(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Bo=e=>e>2147483647||e<-2147483648,Vo=t=>new e.k(`Overflow when computing ${t}`),Ho={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`},Uo={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Wo={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`},Go={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Ko=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Uo[e.operator];if(e.kind!==`Function`)return Ho[e.kind];let t=An(e);return t===void 0?`FcnRcdValue`:Go[t]},qo=e=>Wo[Ko(e)],Jo=(t,n)=>new e.b(`Attempted to apply the operator overridden by the Java method\n${t},\nbut it produced the following error:\n${n}`),Yo=(t,n)=>{let r=r=>(...i)=>{let a=fi.sets?.length??0;try{return r(...i)}catch(r){if(!(r instanceof e.b)||r instanceof e.v)throw r;let i=mi(a);throw fi.sets&&(fi.sets.length=a),t.isLazy!==!0&&r instanceof e.k&&!i?r:Jo(n,r.message)}},i=r(t.evaluate);return{...t,evaluate:(e,r)=>{if(e.length!==t.arity)throw Jo(n,`array is not of length ${t.arity}`);return i(e,r)},evaluateUnary:t.evaluateUnary&&r(t.evaluateUnary),evaluateBinary:t.evaluateBinary&&r(t.evaluateBinary)}},Xo=(e,t)=>{if(typeof e!=`number`)throw Jo(t,`Cannot cast tlc2.value.impl.${Ko(e)} to tlc2.value.impl.IntValue`);return e},Zo=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Qo=(e,t,n,r)=>{let i=Zo(e,n,`IntValue`,2);return zo(t,(e,n)=>{let a=Xo(n,i),o=Xo(e,i),s=r(o,a);if(Bo(s))throw Vo(`${o}${t}${a}`);return s})},$o=(t,n,r)=>{if(typeof t!=`number`)throw new e.k(`The ${n} argument of ${r} should be an integer, but instead it is:\n${R(t)}`);return t},es=(e,t,n=e)=>zo(e,(e,r)=>t($o(e,`first`,n),$o(r,`second`,n))),ts=(e,t,n)=>({...Ro(e,t,n),isLazy:!0}),ns=(e,t,n)=>{let r=Fo(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`]),is=()=>({implication:Nh,negate:Ph,equivalent:Fh,body:Ih,condition:(e,t)=>{if(typeof e!=`boolean`)throw gh(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw _h(t,n,e);return e},apply:Mi,expectFunction:kh,tuple:Nr,set:_r,record:Fr,writtenRecord:Ut,equal:Rn,enumerate:Uh,choiceElements:h_,noChoice:e=>{throw g_(e)},filterPredicate:m_,isReducible:Mt,finiteElements:e=>I(e).elements,addBounded:kt,normalizedSet:En,isBeyondBound:At,cardinality:ai,functionDomain:jr,sortedFunction:Dn,unassigned:(e,t)=>{throw wh(e,t)},prime:zg,keepLazyContext:Ah,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>Dh(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let as,os;const ss=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},cs=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),ls=e=>`local${e.counter++}`,us=(e,t=/* @__PURE__ */ new Set)=>{let n=Be(e);return n!==void 0&&t.add(n),ze(e).forEach(e=>us(e,t)),t},ds=(e,t,n)=>{let r=us(t),i=[...n.locals].filter(([e])=>r.has(e));if(i.length===0)return n.context;let a=cs(e,i.map(([e])=>e));return`extend(${n.context}, ${a}, [${i.map(([,e])=>e).join(`, `)}])`},fs=(e,t,n)=>`${cs(e,qg(t,e.environment))}(${ds(e,t,n)})`,ps=(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})`},ms=(e,t,n,r)=>{let i=ls(e),a=ls(e),o=ls(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} }`},hs=(e,t,n)=>{let r=t.kind===`Forall`;return ps(e,n,n=>{let i=t.bounds.map(()=>ls(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(${Ss(e,r.set,n)}, ${cs(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=ls(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${Ss(e,t.body,n)}, ${cs(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>ms(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},gs=(e,t,n,r,i)=>ps(e,i,i=>{let a=ls(e),o=ls(e),s=cs(e,t),c=`choiceElements(${Ss(e,n,i)}, ${s}, ${cs(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${Ss(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${ms(e,a,o,l)} return noChoice(${s});`}),_s=(e,t,n,r)=>ps(e,r,r=>{let i=ls(e),a=ls(e),o=ls(e),s=ls(e),c=cs(e,t),l=`if (!isReducible(${i})) return ${cs(e,p_(t,e.environment))}(${i}, ${ds(e,t,r)});`,u=Ss(e,t.bound.set,r);r.locals.set(n,s);let d=`if (filterPredicate(${Ss(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${ms(e,a,s,d)} return normalizedSet(${o});`}),vs=(e,t,n,r)=>ps(e,r,r=>{let i=ls(e),a=ls(e),o=ls(e),s=ls(e),c=ls(e),l=ls(e),u=cs(e,u_(t,e.environment)),d=ds(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=Ss(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${Ss(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} = []; ${ms(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),ys=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=Ss(e,r[0],n),a=Ss(e,r[1],n),o=cs(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${Ss(e,r[0],n)}, ${cs(e,t)})`;if(t.operator===`<=>`)return`equivalent(${Ss(e,r[0],n)}, ${Ss(e,r[1],n)}, ${cs(e,t)})`;if(j(t))return fs(e,t,n);let i=gg(t.operator,e.environment);if(i?.kind!==`Builtin`)return fs(e,t,n);if(i.name===`DOMAIN`)return`${cs(e,bh(t))}(${Ss(e,r[0],n)})`;if(i.name===`TLCEval`)return fs(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${cs(e,xh(t,i))}(${Ss(e,r[0],n)}, ${Ss(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Xg(r[0],a))return`${cs(e,i.evaluateUnary)}(${Ss(e,r[0],n)})`;let o=r.length===2&&Xg(r[0],a)&&Xg(r[1],a);return i.evaluateBinary&&o?`${cs(e,i.evaluateBinary)}(${Ss(e,r[0],n)}, ${Ss(e,r[1],n)})`:fs(e,t,n)},bs=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(j(e))return!1;let r=Dg(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return bs(e.expression,t,n);case`FieldAccess`:return bs(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>bs(e,t,n));default:return!1}},xs=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return xs(e.record);case`FunctionApplication`:return[e.function,...e.args].every(xs);default:return!1}},Ss=(e,t,n)=>{let r=(t,r=n)=>Ss(e,t,r);switch(t.kind){case`Number`:return Lt(t.value)?String(t.value):fs(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(j(t))return fs(e,t,n);let i=Dg(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=cs(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?cs(e,i.value):fs(e,t,n)}case`Apply`:return ys(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=cs(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)}, ${cs(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{a_(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${bs(t.function,n,e.environment)?r(t.function):xs(t.function)?r(t.function,i):fs(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${cs(e,t)}))`,o=yh(e.environment.runtime.version),s=o?`, ${cs(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`${cs(e,vh(t))}(${r(t.record)})`;case`Record`:{let i=v_(t.fields);if(y_(i))return fs(e,t,n);let a=cs(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${cs(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?fs(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`)?hs(e,t,n):fs(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?gs(e,t,t.set,t.pattern.name,n):fs(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!l_(t)?vs(e,t,r.pattern.name,n):fs(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?_s(e,t,t.bound.pattern.name,n):fs(e,t,n);default:return fs(e,t,n)}},Cs=(e,t)=>{if(!rs.has(e.kind)||(os??=ss(),!os))return;let n={environment:t,references:[],helpers:[],counter:0},r=Ss(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
77
|
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return as??=is(),Function(...Object.keys(as),...i,a)(...Object.values(as),...n.references)},ws={kind:`Local`},Ts=/* @__PURE__ */ new WeakSet,Es=/* @__PURE__ */ new WeakMap,Ds=/* @__PURE__ */ new WeakMap,Os=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ks=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),As=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,js=e=>e.kind===`Operator`?e.params.length:0,Ms=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Ns=e=>e.name.includes(`!`),Ps=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Fs=(e,t,n)=>{let r=t.bindings.get(e);return r&&As(r.position,t.location)&&(!n||As(r.position,n.start))?r:void 0},Is=(t,n)=>t!==void 0&&n!==void 0&&e.X(t)===e.X(n),Ls=(t,n,r,i)=>{if(n===void 0)return!0;if(Is(n.range,r.range))return!1;let a=r.range;if(a===void 0||i.isGenerated||n.kind!==`Builtin`&&!n.range)return!0;let o=e.X(a),s=n.range&&e.X(n.range);return n.kind===`Builtin`?i.errors.push({location:o,message:`Symbol ${t} is a built-in operator, and cannot be redefined.`}):r.kind===`Parameter`||n.kind!==r.kind||n.arity!==r.arity?i.errors.push({location:o,message:`Multiply-defined symbol '${t}': this definition or declaration conflicts \nwith the one at ${s}.`}):i.warnings.push({location:o,message:`Multiple declarations or definitions for symbol ${t}. \nThis duplicates the one at ${s}.`}),!1},Rs=(e,t,n,r)=>Ls(t,Ps(e,t)??Fs(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,zs=(e,t,n)=>{Ls(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Bs=(e,t,n,r)=>t.reduce((e,t,i)=>Rs(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Vs=(e,t,n)=>t.reduce((e,t)=>Rs(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Hs=e=>e.kind===`Name`?[e.name]:e.names,Us=e=>e.flatMap(e=>Hs(e.pattern)),Ws=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||As(n.location,t.location))?n:void 0},Gs=(e,t)=>{let n=Ws(e,t);return n?{key:t.getKey(n),arity:js(n),params:Ms(n),kind:`Definition`}:t.imported.get(e)},Ks=(e,t,n)=>Ps(t,e)??Gs(e,n),qs=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Js=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:qs(e.location,e.spelling??t)},Ys=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return As(e.location,e.args[0].location)?`prefix`:`postfix`}},Xs=e=>!/^[\p{L}\d_]/u.test(e),Zs=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Qs=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,$s=(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])}})},ec=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?$s(e.name,[],void 0):$s(e.operator,e.args,e.argumentCounts),tc=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),nc=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Us(e.bounds),body:e.body,sets:tc(e.bounds)};case`SetMap`:return{names:Us(e.bounds),body:e.expression,sets:tc(e.bounds)};case`SetFilter`:return{names:Hs(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Hs(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}},rc=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}},ic=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,ac=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),oc=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?oc(e.body,t):ze(e).reduce((e,n)=>e??oc(n,t),void 0)},sc=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??sc(i,t,n||ac(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&oc(e.set,t):oc(e,t)},cc=e=>e.kind===`Label`?cc(e.body):e,lc=e=>typeof e==`number`?`argument selector ${e}`:e,uc=`within the scope of a declaration
|
|
78
|
-
from outside that declaration's scope.`,dc=(t,n,r,i,a,o)=>{let s=(n,r)=>{let i=(n===void 0?void 0:t.selectorRanges?.[n])??t.location.range;i&&a.errors.push({location:e.X(i),message:r})},c=r.isSuffices===r.isInProof,l=r.statement,u={node:l,isGoal:!0,isSufficesOpen:r.isSuffices};for(let[e,t]of n.slice(1).entries()){let r=e+1,o=u.node;if(t.kind===`Name`){if(n[r-1].kind!==`Name`)return o.kind!==`NewSymbol`&&o.kind!==`AssumeProve`&&cc(o).kind===`Let`?void 0:s(r-1,`A name selector here must be from a LET clause.`);let e=l.kind===`AssumeProve`?[...l.assumptions,l.conclusion]:[l],i=r===1?e.map((e,n)=>({position:n,label:sc(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:o.kind===`Label`?oc(o.body,t.name):void 0};if(!i?.label)return s(r,`Cannot find label \`${t.name}'.`);if(r===1&&l.kind===`AssumeProve`&&ac(l,i.position)&&c)return s(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${uc}`);if(t.args.length!==i.label.params.length)return s(r,`Label \`${t.name}' used with wrong number of arguments.`);u.node=i.label,u.isGoal=!1,u.isSufficesOpen=!1;continue}if(t.kind!==`Operand`)return;let d=lc(t.operand);if(u.isSufficesOpen){if(Qs(t.operand,1)!==0)return s(r,o.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);u.isSufficesOpen=!1;continue}if(o.kind===`NewSymbol`)return;if(o.kind!==`AssumeProve`){let e=cc(o);if([`Number`,`Decimal`,`String`].includes(e.kind))return s(r,`Selecting subexpression of expression that has none.`);let n=e.kind===`Identifier`?Ks(e.name,i,a)?.kind:void 0;if(n===`Variable`||n?.startsWith(`New`))return s(r,`Choosing operand \`${d}' of subexpression with no operands.`);let c=nc(e)?.sets,l=e.kind===`Identifier`?[]:c?c.length>0?c:void 0:e.kind===`Except`?void 0:rc(e);if(!l)return;let f=Qs(t.operand,l.length);if(f===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);u.node=l[f],u.isGoal=!1;continue}let f=[...o.assumptions,o.conclusion],p=Qs(t.operand,f.length);if(p===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);if(ac(o,p)&&(!u.isGoal||c))return s(r,`Accessing ASSUME/PROVE clause ${uc}`);let m=f[p];if(m.kind===`NewSymbol`&&r!==n.length-1)return s(r,`Selected a subexpression of a NEW clause of an ASSUME.`);u.node=m,u.isGoal=!1}o||(u.node.kind===`AssumeProve`&&s(void 0,`Selected ASSUME/PROVE instead of expression.`),u.node.kind===`NewSymbol`&&s(void 0,`Selected a NEW declaration as an expression or operator.`))},fc=(t,n)=>{let r=n.isGenerated?void 0:n.hasLabelScope?n.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:n.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return r===void 0||!t.location.range?!1:(n.errors.push({location:e.X(t.location.range),message:r}),!0)},pc=(t,n,r)=>{let i=t.location.range;if(!i||r.isGenerated)return;let a=e.X(i),o=t.params.filter((i,a)=>{let o=Ps(n,i)?.kind===`Parameter`,s=t.paramRanges?.[a];return!o&&s&&r.errors.push({location:e.X(s),message:`Illegal parameter ${i} of label \`${t.name}'.`}),o});o.filter((e,t)=>o.indexOf(e)!==t).forEach(e=>r.errors.push({location:a,message:`Repeated formal parameter ${e} \nin label \`${t.name}'.`})),r.labelParams.filter(e=>!o.includes(e)).forEach(e=>r.errors.push({location:a,message:`Label ${t.name} must contain formal parameter \`${e}'.`}));let s=[...new Set(o.filter(e=>!r.labelParams.includes(e))),...t.params.filter(e=>!o.includes(e))];s.length>0&&r.errors.push({location:a,message:`Label ${t.name} declares extra parameter(s) ${s.map(e=>`${e} `).join(``)}`}),r.labels.has(t.name)&&r.errors.push({location:a,message:`Duplicate label \`${t.name}'.`}),r.labels.add(t.name)},mc=(e,t,n,r)=>{if(!ic(e))return!1;let i=ec(e),a=i[0],o=i.length>1&&a.kind===`Name`?Ps(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&dc(e,i,o,t,n,r),o!==void 0},hc=(t,n,r,i)=>{let a=t.location;if(Tc(t,r,i))return;let o=Ds.get(t);if(o!==void 0)return o;if(Os(n))return t.kind===`Apply`?t.args.length:0;let s=Ps(r,n);if(s?.isNonFact){i.errors.push({location:e.X(Js(t,n)),message:`Step number of non-expression step used as an expression.`});return}if(mc(t,r,i,!1)||Zs(n)&&s)return t.kind===`Apply`?t.args.length:0;if(s&&t.kind!==`OperatorReference`&&(t.resolution=ws),s)return s.arity;let c=Gs(n,i);if(c)return t.kind===`Identifier`?t.name=c.key:t.operator=c.key,Ds.set(t,c.arity),c.arity;let l=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``;if(l!==``&&(Ps(r,l)!==void 0||Gs(l,i)!==void 0||i.facts.has(l)))return t.kind===`Apply`?t.args.length:0;let u=(t.kind===`Identifier`?void 0:t.spelling)??n,d=e.X(t.kind===`Apply`&&u===`-.`?qs(a,`-`):Js(t,n));if(!Xs(n)||Zs(n)){i.errors.push({location:d,message:`Unknown operator: \`${n}'.`});return}i.errors.push({location:d,message:`Could not find declaration or definition of symbol '${u}'.`});let f=Ys(t);f&&a.range&&i.errors.push({location:e.X(a.range),message:`Couldn't resolve ${f} operator symbol \`${u}'.`})},gc=(e,t,n)=>(e.forEach(e=>V(e.set,t,n)),e.reduce((e,t)=>Bs(e,Hs(t.pattern),t.pattern.ranges,n),t)),_c=(e,t)=>e.kind===`Identifier`&&e.name===t&&j(e)||ze(e).some(e=>_c(e,t)),vc=(e,t)=>{e.kind===`FunctionConstruction`&&_c(e.body,t)&&(e.isRecursive=!0),ze(e).forEach(e=>vc(e,t))},yc=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?Us(t.bounds):[],labels:/* @__PURE__ */ new Set},o=t.name,s=t.location.range,c=t=>{s&&!a.isGenerated&&a.errors.push({location:e.X(s),message:t})},l=t.kind===`Function`?gc(t.bounds,n,a):Vs(n,t.params,a),u=Ps(l,o)??Fs(o,a,s),d=u?.isPending===!0&&i.has(u);return u?.isPending&&!d?c(`Recursive ${t.kind===`Function`?`function`:`operator`} ${o} defined at wrong LET/IN level.`):u&&!d&&c(t.kind===`Function`?`Function name \`${o}' already defined or declared.`:`Operator ${o} already defined or declared.`),t.kind===`Function`?(V(t.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),vc(t.body,o),t.isSelfReferential=_c(t.body,o)):V(t.body,l,a),u&&d?(u.isPending=!1,u.range=s,!1):t.kind===`Function`?u===void 0:Ls(o,Ps(n,o)??Fs(o,a,s),{kind:`Definition`,arity:js(t),range:s},a)},bc=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Ps(e,t.name)?.isPending)return e;let n={name:t.name,arity:js(t),params:Ms(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>jc(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Os(t.name)?e:s(e,e=>!As(t.location,e.location)),o={name:t.name,arity:js(t),kind:`Definition`,range:t.location.range,parent:a};if(Ns(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Os(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return yc(t,a,u,i)?{...o,params:Ms(t)}:a},a),()=>!0)},xc=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Ps(t,r)??Fs(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},Sc=(t,n,r)=>{if(t.kind!==`Identifier`&&t.kind!==`Apply`)return!1;let i=xc(t.kind===`Identifier`?t.name:t.operator,n,r),a=t.kind===`Apply`?t.argumentCounts?.[0]??0:0;if(!i||a===i.arity)return!1;let o=(t.kind===`Apply`?t.argumentRanges?.[0]:void 0)??t.location.range;return o&&r.errors.push({location:e.X(o),message:`The operator ${i.name} requires ${i.arity} arguments.`}),!0},Cc=(t,n,r)=>{if(Sc(t,n,r))return;let i=t.operator,a=Ks(i,n,r),o=hc(t,i,n,r);if(o===void 0)return;if(o!==t.args.length){r.errors.push({location:e.X(t.argumentsRange??Js(t,i)),message:`The operator ${i} requires ${o-(xc(i,n,r)?.arity??0)} arguments.`});return}let s=a&&(a.kind===`Definition`?a.params:[]);if(s===void 0){t.args.forEach(e=>wc(e,n,r));return}let c=(t,n)=>{t&&r.errors.push({location:e.X(t),message:n})};t.args.map((e,a)=>{let o=s[a]??0,l=e.location.range;if(o===0){if(e.kind===`Lambda`&&e.operator!==void 0)c(l,`The operator ${e.operator} requires 1 arguments.`);else if(e.kind===`Lambda`&&l)c(l,`LAMBDA expression used where an expression is required.`);else if(e.kind===`OperatorReference`){let t=hc(e,e.operator,n,r);t!==void 0&&c(l,`The operator ${e.operator} requires ${t} arguments.`)}else V(e,n,r);return!0}if(e.kind===`Lambda`){V(e,n,r);let s=e.params.length===o;return!s&&Ts.has(e)?c(l,`Expected arity ${o} but found operator of arity ${e.params.length}.`):!s&&l&&e.operator===void 0&&c(t.selectorRanges?.at(-1)??Js(t,i),`Lambda expression with arity ${e.params.length} used as argument ${a+1} of operator \`${i}', \nbut an operator of arity ${o} is required.`),s}if(e.kind===`Subexpression`)return V(e,n,r),!0;if(e.kind===`Apply`&&e.argumentCounts?.at(-1)===0){let t=e.argumentCounts.findIndex(e=>e>0);return c(e.selectorRanges?.[t],`Selector \`${e.operator.split(`!`)[t]}' should not have argument(s).`),!1}if(e.kind!==`Identifier`&&e.kind!==`OperatorReference`)return c(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${i}', in a position an operator is required.`),!1;let u=e.kind===`Identifier`?e.name:e.operator,d=Ks(u,n,r)?.params??[],f=hc(e,u,n,r);return e.kind===`Identifier`&&f!==void 0&&f!==o&&c(Js(e,u),`Expected arity ${o} but found operator of arity ${f}.`),f===o&&d.every(e=>e===0)}).forEach((e,n)=>{e||c(t.location.range,`Argument number ${n+1} to operator '${i}' \nshould be a ${s[n]}-parameter operator.`)})},wc=(e,t,n)=>{e.kind===`Identifier`?hc(e,e.name,t,n):V(e,t,n)},Tc=(e,t,n)=>{let r=Es.get(e);return r?(r.args.forEach(e=>wc(e,t,n)),n.errors.push(r.error),!0):!1},V=(t,n,r)=>{if(Ts.has(t)&&!r.isGenerated){V(t,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>V(e,n,r)),a=e=>({...r,labelParams:[...r.labelParams,...e]});switch(t.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(Sc(t,n,r))return;let i=t.name,a=hc(t,i,n,r);a!==void 0&&a>0&&r.errors.push({location:e.X(Js(t,i)),message:`The operator ${i} requires ${a} arguments.`});return}case`OperatorReference`:hc(t,t.operator,n,r);return;case`Apply`:Cc(t,n,r);return;case`Lambda`:V(t.body,Bs(n,t.params,t.paramRanges,r),a(t.params));return;case`And`:case`Or`:i(t.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:V(t.expression,n,r);return;case`If`:i([t.condition,t.consequent,t.alternative]);return;case`Case`:i(t.arms.flatMap(e=>[e.condition,e.body])),t.other&&V(t.other,n,r);return;case`Let`:V(t.body,bc(t.definitions,n,r,t.instances),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:V(t.body,gc(t.bounds,n,r),a(Us(t.bounds)));return;case`UnboundedQuantifier`:V(t.body,Bs(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&V(t.set,n,r),V(t.body,Bs(n,Hs(t.pattern),t.pattern.ranges,r),a(Hs(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:V(t.predicate,gc([t.bound],n,r),a(Hs(t.bound.pattern)));return;case`SetMap`:V(t.expression,gc(t.bounds,n,r),a(Us(t.bounds)));return;case`FunctionSet`:i([t.domain,t.range]);return;case`Record`:case`RecordSet`:t.fields.forEach((i,a)=>{t.fields.slice(0,a).some(e=>e.name===i.name)&&r.errors.push({location:e.X(i.location.range??qs(i.location,i.name)),message:`Non-unique fields in constructor.`}),V(i.value,n,r)});return;case`Except`:V(t.function,n,r),t.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),V(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:i([t.function,...t.args]);return;case`FieldAccess`:V(t.record,n,r);return;case`Product`:i(t.factors);return;case`BoxAction`:case`AngleAction`:i([t.action,t.subscript]);return;case`WeakFairness`:case`StrongFairness`:i([t.subscript,t.action]);return;case`Label`:if(fc(t,r))return;V(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),pc(t,n,r);return;case`Subexpression`:if(Tc(t,n,r))return;t.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>wc(e,n,r)),mc(t,n,r,!1)}},Ec=(t,n,r)=>t.forEach(t=>{if(t.kind===`ModuleFact`||Sc(t,n,r)||mc(t,n,r,!0))return;let i=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;t.kind===`Identifier`&&Ps(n,i)?.isNonFact?r.errors.push({location:e.X(Js(t,i)),message:`Step number of non-fact used as a fact`}):r.facts.has(i)||V(t,n,r)}),Dc=(e,t,n)=>(e.set&&V(e.set,t,n),Rs(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Oc=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Dc(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Oc(t,e.scope,e.unit,!0):V(t,e.scope,e.unit),e),{scope:t,unit:n});return V(e.conclusion,i.scope,i.unit),i.scope},kc=(e,t,n)=>e.kind===`AssumeProve`?Oc(e,t,n):(V(e,t,n),t),Ac=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Ec(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Mc(t,e,r),t)},jc=(e,t,n)=>{let r=Rc(e,t,n);return e.name===void 0?r:Rs(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Mc=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=kc(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Ac(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Ac(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 Ec(r.facts,t,n),o(t);case`Instance`:return o(jc(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?jc(t,e,i):bc([t],e,n),t));case`Have`:case`Case`:return V(r.expression,t,i),Ac(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>V(e,t,i)),a(t);case`Take`:return a(Bs(gc(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Bs(gc(r.bounds,t,i),r.names,r.nameRanges,i);return V(r.body,o,{...i,labelParams:[...i.labelParams,...Us(r.bounds),...r.names]}),Ac(e.proof,a(t),n),a(o)}default:return Ac(e.proof,a(t),n),a(t)}},Nc=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:kc(e.statement,void 0,t);e.name!==void 0&&zs(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Ac(e.proof,n,t),r&&(r.isInProof=!1)},Pc={line:0,column:0},Fc=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Ic=(e,t)=>{let n=new Map([...ks,...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},Lc=(t,n,r,i,a)=>{let o=t.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(n,r)=>{if(n.arity===0||r.kind!==`Identifier`){V(r,o,a);return}let i=hc(r,r.name,o,a);if(i!==void 0&&i!==n.arity)throw new e.F(`An operator must be substituted for symbol '${n.name}', and it must have arity ${n.arity} in the instance of ${t.module} at line ${t.location.line}, column ${t.location.column}`)},c=/* @__PURE__ */ new Map;t.substitutions.forEach(t=>{let r=t.name,i=n.find(e=>e.name===r);if(!i){a.errors.push({location:e.X(t.nameRange),message:`Identifier '${r}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let o=t.expression;s(i,o);let l=o.location.range;c.has(r)?l&&a.errors.push({location:e.X(l),message:`Multiple substitutions for symbol '${r}' in substitution.`}):c.set(r,o)});let l=n.filter(e=>!c.has(e.name)),u=e=>!Ps(o,e.name)&&!Gs(e.name,a);return l.filter(e=>!u(e)).forEach(e=>{let n={kind:`Identifier`,name:e.name,location:t.location};s(e,n),c.set(e.name,n)}),l.filter(u).forEach(n=>{let i=t.location.range,o=n.location.range;i&&o&&a.errors.push({location:e.X(i),message:`Substitution missing for symbol ${n.name} declared at ${e.X(o)} \nand instantiated in module ${r}.`})}),c},Rc=(e,t,n)=>{let r=n.getInstance(e);return Lc(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Rs(e,t,r,n),t)},zc=(e,t,n,r)=>{let i=Ic(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Lc(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:Pc}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Bc=(t,n)=>{let r=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return t.toSorted((e,t)=>As(e.location,t.location)?-1:+!!As(t.location,e.location)).forEach(t=>{let a=[],o=[];try{t.check(a,o)}catch(t){if(!(t instanceof e.F)||!t.sany&&a.length===0)throw t;a.push(...t.sany?.errors??[])}a.forEach(e=>i(r,e)),o.forEach(e=>i(n,e))}),r},Vc=(t,n)=>{let r=Ic(t,n.imported),i=/* @__PURE__ */ new Set([...n.facts,...[...t.theorems,...t.assumptions].flatMap(e=>e.name??[])]),a=new Map(t.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),o=new Map([...ks,...n.bound].map(([e,t])=>[e,{...t,position:Pc}])),s=/* @__PURE__ */ new Set,c=[],l=(e,t,s,c)=>({location:e,check:(l,u)=>c({imported:r,getInstance:n.getInstance,definitions:n.definitions,getKey:n.getKey,location:e,self:t,facts:i,goals:a,bindings:o,errors:l,warnings:u,hasLabelScope:s,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})}),u=(e,t)=>e.map(e=>l(e.location,void 0,!1,n=>zs(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return Bc([...n.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...u(t.constants,`Constant`),...u(t.variables,`Variable`),...t.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>l(e.location,void 0,!1,t=>{let n={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},r=Ls(e.name,o.get(e.name),n,t);r&&(o.set(e.name,n),s.add(n)),c.push({declaration:e,binding:r?n:void 0})})),...t.definitions.map(e=>l(e.location,e,!0,n=>{Fc(t,e)?V(e.body,void 0,n):yc(e,void 0,n,s)&&o.set(e.name,{kind:`Definition`,arity:js(e),range:e.location.range,position:e.location})})),...t.instances.map(e=>l(e.location,void 0,!1,t=>{Vs(void 0,e.params,t),n.instanced.get(e)?.forEach((e,n)=>zs(n,e,t)),e.name!==void 0&&zs(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},t)})),...t.assumptions.map(e=>l(e.location,void 0,e.name!==void 0,t=>{V(e.expression,void 0,t),e.name!==void 0&&zs(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t)})),...t.theorems.map(e=>l(e.location,void 0,e.name!==void 0,t=>Nc(e,t))),...t.uses.map(e=>l(e.location,void 0,!1,t=>Ec(e.facts,void 0,t))),{location:t.location.range?.end??t.location,check:t=>c.forEach(n=>{let r=n.declaration.location.range;r&&(!n.binding||n.binding.isPending)&&t.push({location:e.X(r),message:`Symbol ${n.declaration.name} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},Hc=/* @__PURE__ */ new WeakSet,Uc=/* @__PURE__ */ new WeakMap,Wc=(e,t)=>{if(t.length===0)return e;let n={...e};return Hc.has(e)&&Hc.add(n),Uc.set(n,[...t,...Uc.get(e)??[]]),n},Gc=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Zc(e,(e,r)=>Gc(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&j(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&j(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Kc=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),qc=/* @__PURE__ */ new WeakMap,Jc=e=>qc.get(e)??e.name,Yc=(e,t)=>(Jc(t)!==e.name&&qc.set(e,Jc(t)),e),Xc=(e,t)=>Yc(e.kind===`Function`?{...e,bounds:Kc(e.bounds,e=>t(e,[])),body:t(e.body,Us(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Zc=(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=>Xc(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Kc(e.bounds,n),body:t(e.body,Us(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,Hs(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,Hs(e.bound.pattern))};case`SetMap`:return{...e,bounds:Kc(e.bounds,n),expression:t(e.expression,Us(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)}}},Qc=(e,t)=>{Zc(e,(e,n)=>(t(e,n),e))},$c=`LAMBDA`,el=e=>`${e}@SUBSTITUTION`,tl=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(tl),nl=(e,t)=>{if(e.kind!==`Identifier`)return!tl(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=j(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!tl(n.body)},rl=(e,t=/* @__PURE__ */ new Set)=>{let n=Be(e),r=n===void 0||t.has(n)?[]:[n];return Qc(e,(e,n)=>r.push(...rl(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},il=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}},al=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),ol=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},sl=(e,t)=>e.map(e=>({pattern:ol(e.pattern,t),set:e.set})),cl=(e,t)=>e.kind===`Function`?{...e,bounds:sl(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},ll=(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=>Yc({...cl(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:sl(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:ol(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:ol(e.bound.pattern,n),set:e.bound.set}};default:return e}},ul=e=>`${e}@ENABLED`,dl=(e,t)=>e.modes.get(t)??e,fl=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!j(e)&&t.instantiation.variables.has(e.name),pl=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>pl(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(fl(e,t,n))return[e.name];let r=j(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?pl(r.body,t,/* @__PURE__ */ new Map):void 0},ml=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return fl(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:ul(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:bl(e.expression,dl(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[bl(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:bl(e.subscript,dl(t,`Primed`),n),location:r},bl(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=pl(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:ul(r),location:e.location},location:e.location},bl({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},hl=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:ws}),gl=(e,t)=>e.map(e=>hl(e.name,t)),_l=(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:gl(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),vl=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...gl(t,r),...i.map(e=>hl(e,r))],location:r},location:r}},yl=(e,t)=>e.instantiation.isParameterized(t)?Sl(e,t):void 0,bl=(t,n,r)=>{let i=e=>bl(e,n,r),a=n.instantiation,o=a.params,s=e=>!r.has(e)&&!j(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:bl(t.expression,dl(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:bl(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},dl(n,`Enabled`),r)};let c=ml(t,n,r);if(c)return c;if(t.kind===`Identifier`&&s(t.name)){let e=a.substitutions.get(t.name),r=n.bindings;if(e&&(r===void 0||!nl(e,a)))return Wc(e,[t]);if(e&&r){let n=el(t.name);return r.set(n,e),hl(n,t.location)}let i=yl(n,t.name);if(i===void 0)return t;if(o.length===0)return{...t,name:i};let s=a.getDefinition(t.name);return s&&js(s)>0?vl(i,o,js(s),t.location):{kind:`Apply`,operator:i,args:gl(o,t.location),location:t.location}}if(t.kind===`Apply`&&s(t.operator)){let r=t.args.map(i),s=a.substitutions.get(t.operator),c=a.substitutions.size>0||o.length>0||Hc.has(t),l=e=>(c&&Hc.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let e=s.kind===`Identifier`?s.name:s.operator;return l({...t,operator:e,args:r,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...t,operator:s.operator,args:[...s.args,...r],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:$c,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:$c,args:r,resolution:ws},location:t.location};if(s)throw new e.F(`The operator ${t.operator} can only be substituted by an operator at line ${t.location.line}, column ${t.location.column}`);let u=yl(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[...gl(o,t.location),...r]}}if(t.kind===`OperatorReference`&&s(t.operator)){let e=a.substitutions.get(t.operator);if(e?.kind===`Identifier`||e?.kind===`OperatorReference`||e?.kind===`Lambda`)return Wc(e,[t]);let r=yl(n,t.operator);if(r===void 0)return t;let i=a.getDefinition(t.operator);return o.length>0&&i?vl(r,o,js(i),t.location):{...t,operator:r}}let l=il(n),u=Zc(t,(e,t)=>t.length===0?i(e):bl(e,n,al(r,t,l)));return ll(u,r,l)},xl=(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:hl(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Sl=(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=il(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=cl(Xc(i,(e,t)=>bl(e,s,al(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(([e,t])=>({kind:`Operator`,name:e,params:[],body:t,isLocal:!0,isRecursive:!1,location:t.location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&Uc.set(l,[u,...Uc.get(i.body)??[]]),xl({...c,body:l},r.params,i.location)}):t},Cl=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>rl(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=>yl(i,e)??e,getQualifiedKey:t=>{let n=yl(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>xl(r,e.params,r.location)):t}}},wl=e=>e.kind===`Let`&&e.instances!==void 0||ze(e).some(wl),Tl=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Zc(e,e=>Tl(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>As(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}},El=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Dl=(e,t)=>e.definitions.some(e=>wl(e.body))||e.assumptions.some(e=>wl(e.expression))||e.theorems.some(e=>{let t=El(e);return t!==void 0&&wl(t)})?{...e,definitions:e.definitions.map(e=>Xc(e,e=>Tl(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Tl(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=El(e);return n===void 0?e:{...e,statement:Tl(n,t,[])}})}:e,Ol=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),kl={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]}},Al=(e,t)=>{let n=kl[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},jl=(e,t)=>`${e}${t}`,Ml=(e,t,n)=>`${e}${t}${n}`,Nl=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Pl=(e,t,n)=>`${e},${t},${n}`,Fl=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Il=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Ll=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Rl=(e,t)=>{t.constraints.forEach((t,n)=>Il(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>Ll(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},zl=(e,t,n,r)=>({...Fl(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Bl=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Vl=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Hl=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{...zl(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Ul=zl(`$Set`,0,[2],[1]),Wl=zl(`$Junction`,0,[3],[1]),Gl=zl(`$Choose`,0,[2],[1]),Kl=zl(`$Function`,0,[3],[1]),ql=zl(`$FcnApply`,0,[2,2],[1,1]),Jl=zl(`$RcdSelect`,0,[2,0],[1,1]),Yl=zl(`'`,2,[1],[0]),Xl=zl(`ENABLED`,1,[2],[0]),Zl=zl(`[]`,3,[3],[0]),Ql=zl(`$SquareAct`,2,[2,1],[0,0]),$l=zl(`$WF`,3,[1,2],[0,0]),eu=zl(`$TemporalExists`,3,[3],[0]),tu=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),nu=e=>e.map(e=>({name:e,arity:0})),ru=(t,n)=>n.location.range?e.J(`${t}.`,n.location.range):new e.F(`${t} at line ${n.location.line}, column ${n.location.column}`),iu=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),au=e=>e.kind!==`Let`&&e.kind!==`Label`,ou=t=>{let n=/* @__PURE__ */ new Map,r=(e,n)=>{let r=n.get(e);if(r?.kind===`Formal`)return{kind:`Declared`,name:e,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:v(r.definition,r.scope)};if(t.constants.has(e))return{kind:`Declared`,name:e,level:0,arity:0};if(t.variables.has(e))return{kind:`Declared`,name:e,level:1,arity:0};let i=t.getDefinition(e);if(i){let n=v(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Hl.get(e)??Ol.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},i=(e,t,n)=>{let r=Fl(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(Ml(e,n,t))}),Ll(r.argConstraints,jl(e,n),t.data.level),Rl(r,t.data)}),r},a=(t,n,r=[],i=[])=>{let a=e=>i.includes(e);if(n.forEach((n,r)=>{if(n.kind===`Value`&&n.data.level>Bl(t,r))throw new e.F(`Level error in applying operator ${t.name}:\nThe level of argument ${r+1} exceeds the maximum level allowed by the operator`)}),r.some(e=>e.level>2))throw new e.F(`Level error in applying operator ${t.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let o=e=>{let r=t.formals.findIndex(t=>t.name===e);return r===-1?void 0:n[r]},s=(e,n,r)=>t.conditions.has(Pl(e,n,r)),c=Fl(Math.max(t.level,...n.filter((e,n)=>Vl(t,n)===1).map(e=>e.data.level),...r.map(e=>e.level)));return t.params.forEach(e=>c.params.add(e)),n.forEach((e,n)=>{Vl(t,n)===1&&e.data.params.forEach(e=>c.params.add(e))}),r.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),t.constraints.forEach((e,t)=>Il(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||Il(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>Il(c.constraints,t,e))),n.forEach((e,n)=>e.data.params.forEach(e=>{a(e)||Il(c.constraints,e,Bl(t,n))})),n.forEach((e,t)=>{if(e.kind!==`Operator`)return;let r=e.data;n.forEach((e,n)=>r.formals.forEach((i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>Il(c.constraints,e,Bl(r,a)))}))}),t.argParams.forEach(e=>{let t=Nl(e),n=o(t.operator);n?.kind===`Operator`&&Il(c.constraints,t.param,Bl(n.data,t.index))}),[t.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Ll(c.argConstraints,t,e))),n.forEach((e,r)=>{if(e.kind!==`Declared`)return;let i=e.declared;Array.from({length:i.arity},(e,n)=>Ll(c.argConstraints,jl(i.name,n),t.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&Ll(c.argConstraints,jl(i.name,a),e.data.level)}))}),t.argParams.forEach(e=>{let t=Nl(e),n=o(t.operator);n&&Ll(c.argConstraints,jl(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a(Nl(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),t.argParams.forEach(e=>{let t=Nl(e),n=o(t.operator);if(n)n.kind===`Declared`&&c.argParams.add(Ml(n.declared.name,t.index,t.param));else{let n=o(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(Ml(t.operator,t.index,e)))}}),n.forEach((e,t)=>{if(e.kind!==`Declared`)return;let r=e.declared;n.forEach((e,n)=>Array.from({length:r.arity},(i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>c.argParams.add(Ml(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:_(`LAMBDA`,nu(e.params),e.body,t)};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let i=r(n,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=Fl();return e.params.add(n),{kind:`Declared`,data:e,declared:{name:n,arity:i.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:Fl()}}return{kind:`Value`,data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=tu(n,nu(i));return a(e,s(t,o),r.map(e=>m(e,n)),i)},l=(e,t)=>e.kind===`Declared`?i(e.name,e.level,t):a(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw ru(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw ru(`Action used where only temporal formula or state predicate allowed`,e);iu.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&au(n)&&n.kind!==r)throw ru(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=>Rl(i,v(e,n))),i},m=(t,n)=>{try{return h(t,n)}catch(n){throw!(n instanceof e.F)||n.sany?n:ru(n.message,t)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Fl();case`Identifier`:return l(r(e.name,t),[]);case`Apply`:{let n=s(e.args,t);return d(e,n),l(r(e.operator,t),n)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(Wl,n)}case`Prime`:case`Unchanged`:return c(Yl,[e.expression],t);case`Enabled`:return c(Xl,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(Zl,[n])}case`If`:return c(Wl,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(Wl,[...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(Wl,[e.body],t,e.bounds.map(e=>e.set),Us(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw ru(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?eu:Wl,[e.body],t,[],e.names);case`Choose`:return c(Gl,[e.body],t,e.set?[e.set]:[],Hs(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(Ul,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(Ul,[e.predicate],t,[e.bound.set],Hs(e.bound.pattern));case`SetMap`:return c(Ul,[e.expression],t,e.bounds.map(e=>e.set),Us(e.bounds));case`FunctionConstruction`:return c(Kl,[e.body],t,e.bounds.map(e=>e.set),Us(e.bounds));case`Record`:return c(Kl,e.fields.map(e=>e.value),t);case`RecordSet`:return c(Ul,e.fields.map(e=>e.value),t);case`Except`:return c(Ul,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(ql,[o(e.function,t),e.args.length===1?o(e.args[0],t):{kind:`Value`,data:c(Ul,e.args,t)}]);case`Bracket`:return Fl();case`FieldAccess`:return a(Jl,[o(e.record,t),{kind:`Value`,data:Fl()}]);case`BoxAction`:case`AngleAction`:return c(Ql,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c($l,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Fl()}},g=(e,t,n=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,r=n,a=t)=>g(e,a,r,i),o=(e,o)=>{let s=r(e,t);s.kind===`Declared`?(n&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,n||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 ze(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,tu(t,nu(e.names))),i;default:return Qc(e,(e,r)=>a(e,n,tu(t,nu(r)))),i}},_=(e,t,n,r)=>{let i=tu(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...Fl(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(jl(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(Ml(e.name,n,t.name))).map(e=>Pl(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(Nl(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Nl(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},v=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{...Fl(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,t);return n.set(e,o),o};return{analyze:m,analyzeDefinition:v,toOperand:o}},su=(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`?su(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Fl(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),Rl(a,e)}),a},cu=(t,n,r,i)=>{let a=ou(n),o=e=>Math.max(0,...e.map(e=>a.analyze(e,/* @__PURE__ */ new Map).level)),s=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?o([t.expression]):t.kind===`Witness`?o(t.expressions):t.kind===`Take`?o(t.bounds.map(e=>e.set)):t.kind===`Pick`?o([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?su(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},c=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=e.X(t.statement),r=()=>s(t)===0;return t.body.kind===`Have`||t.body.kind===`Take`||t.body.kind===`Witness`?r()?[]:[{location:n,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:t.body.kind===`Case`?[...r()?[]:[{location:n,message:`Non-constant CASE for temporal goal.`}],...c(t.proof)]:t.body.kind===`Qed`?c(t.proof):[]}):[],l=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=t.body,r=()=>s(t)===3,i=n.kind===`Pick`&&n.bounds.length>0&&r()?n.bounds.filter(e=>o([e.set])!==0).flatMap(t=>t.set.location.range?[{location:e.X(t.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(t.proof),...i,...t.proof?.kind===`Steps`&&r()?c(t.proof):[]]}):[],u=Bc([...t.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>a.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...t.assumptions.map(e=>({location:e.location,check:()=>a.analyze(e.expression,/* @__PURE__ */ new Map)})),...t.theorems.map(t=>({location:t.location,check:()=>{let n=t.statement.kind===`AssumeProve`?su(t.statement,/* @__PURE__ */ new Map,a):a.analyze(t.statement,/* @__PURE__ */ new Map),r=[...l(t.proof),...n.level===3?c(t.proof):[]];if(r.length>0)throw e.q(r)}})),...r],i);if(u.length>0)throw e.q(u,!1,void 0,i)},lu=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),uu=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),du=/* @__PURE__ */ new Set([...lu,...uu,`Enabled`]),fu=/* @__PURE__ */ new Set([`~>`,`-+->`]),pu=/* @__PURE__ */ new Set([...fu,`\\cdot`]),mu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),hu=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),gu=/* @__PURE__ */ new Set([`RandomSubset`,`RandomSetOfSubsets`,`TestRandomSetOfSubsets`,`RandomSubsetSet`]),_u=(e,t)=>mu.has(e)||t.builtins.get(e)?.isStateLevel===!0,vu=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(lu.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(uu.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&fu.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(du.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&pu.has(e.operator))&&(r[0]|=1),du.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=Be(e);if(u!==void 0&&!j(e)){let e=t.substitutions.get(u)??u,n=t.definitions.get(e),a=t.constants.has(u),o=t.variableIndex.get(u);if((o!==void 0||t.builtins.get(u)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=1),o!==void 0&&(l&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:l});else{_u(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),hu.has(u)&&(r[0]|=8),gu.has(u)&&(r[0]|=256),!a&&_u(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}ze(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},yu=(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},bu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),xu=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=vu(Re(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=yu(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=yu(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!bu(t[e],l[e*r])))),p=yu(a,r,f,270);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|d[t]&224|p[t]&270:e),words:r}},Su=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?Cu(Re(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},Cu=(e,t)=>{let n=t.facts.words,r=vu(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=Su(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}bu(e.callee,r[0])||(i[0]|=r[0]&270)}),i},wu=(e,t)=>!(Su(e,t)[0]&1),Tu={any:2,repeated:4,streamed:8,replayed:260},Eu=(e,t,n)=>(Cu(e,t)[0]&Tu[n])!==0,Du=(e,t,n=`any`)=>(Su(e,t)[0]&Tu[n])!==0,Ou=(e,t)=>{let n=Su(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},ku=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},Au=(e,t)=>{let n=Cu([e],t);return n[0]&16?void 0:ku(n)},ju=(e,t)=>!!(Cu([e],t)[0]&1),Mu=(t,n,r)=>new e.k(`Applying ${t} to the following value,\nwhich is not ${n}:\n${R(r)}`),Nu=e=>Nt(e)?L(e):void 0,Pu=`a function with a finite domain`,Fu=(e,t,n)=>{let r=z(e,t,n),i=Nu(r);if(!i)throw Mu(n,Pu,r);return i},Iu=(e,t)=>{let n=z(e,1,t),r=Nu(n),i=r&&Bu(r,z(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw jo(`second`,t,`bag`,n);return i},Lu=(e,t,n)=>{let r=t[n];if(!r||!zu(r))throw jo(n===0?`first`:`second`,`(+)`,`bag`,z(e,n,`(+)`));return r},Ru=(e,t)=>{if(!P(e)||!F(e))throw t();return I(e).elements},zu=e=>e.range.every(e=>typeof e==`number`&&e>0),Bu=(e,t)=>{let n=e.domain.findIndex(e=>pr(t,e));return n===-1?void 0:e.range[n]},Vu=t=>{if(typeof t==`number`)return t;let n=`tlc2.value.impl.${Ko(t)}`;throw new e.b(`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},Hu=(e,t)=>{let n=Vu(e)+Vu(t);if(Bo(n))throw Vo(`${e}+${t}`);return n},Uu=(e,t,n)=>{let r=Vu(e.range[t]),i=Bu(n,e.domain[t]);if(i===void 0)return r;let a=r-Vu(i);if(Bo(a))throw Vo(`${r}-${i}`);return a},Wu=(e,t,n,r=e.length)=>{let i=e.slice(0,r).find(e=>pr(t,e[0]));i?i[1]=Hu(i[1],n):e.push([t,n])},Gu=e=>e.domain.map((t,n)=>[t,e.range[n]]),Ku=Dn([],[]),qu=t=>[Io(`EmptyBag`,Ku),B(`IsABag`,1,e=>{let t=Nu(z(e,0,`IsABag`));return t!==void 0&&zu(t)}),B(`BagCardinality`,1,e=>{let t=z(e,0,`BagCardinality`);return Fu(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Mu(`BagCardinality`,`a bag`,t);return Hu(e,n)},0)}),B(`BagIn`,2,e=>{let t=Iu(e,`BagIn`);return t!==void 0&&t>0}),B(`CopiesIn`,2,e=>Iu(e,`CopiesIn`)??0),B(`\\oplus`,2,e=>{let t=[0,1].map(t=>Nu(z(e,t,`(+)`))),n=Lu(e,t,0),r=Lu(e,t,1),i=Gu(n);return r.domain.forEach((e,t)=>Wu(i,e,r.range[t],n.domain.length)),Sr(i)}),B(`\\ominus`,2,e=>{let t=z(e,0,`(-)`),n=z(e,1,`(-)`),r=Nu(t),i=Nu(n);if(!r)throw jo(`first`,`(-)`,`bag`,t);if(!i)throw jo(`second`,`(-)`,`bag`,n);return Sr(r.domain.flatMap((e,t)=>{let n=Uu(r,t,i);return n>0?[[e,n]]:[]}))}),B(`BagUnion`,1,t=>{let n=z(t,0,`BagUnion`),r=Ru(n,()=>Mu(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??Ku;let i=t=>{let r=Nu(t);if(!r)throw new e.k(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${R(n)}`);return r},a=Gu(i(r[0]));return r.slice(1).forEach(e=>{let t=i(e);t.domain.forEach((e,n)=>Wu(a,e,t.range[n]))}),Sr(a)}),B(`\\sqsubseteq`,2,e=>{let t=z(e,0,`\\sqsubseteq`),n=z(e,1,`\\sqsubseteq`),r=Nu(t),i=Nu(n);if(!r)throw Mu(`\\sqsubseteq`,Pu,t);if(!i)throw Mu(`\\sqsubseteq`,Pu,n);return r.domain.every((e,t)=>{let n=Bu(i,e);return Vu(r.range[t])<=(n===void 0?0:Vu(n))})}),Lo(`BagOfAll`,2,e=>{let t=Fo(e,0,`BagOfAll`),n=z(e,1,`BagOfAll`),r=Nu(n);if(!r)throw jo(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[];return r.domain.forEach((e,n)=>Wu(i,t.call([e]),r.range[n])),Sr(i)}),B(`SubBag`,1,n=>{let r=z(n,0,`SubBag`);if(!Nt(r))throw new e.b(`Attempted to apply the operator DOMAIN to a non-function\n(${qo(r)})\nline 106, col 58 to line 106, col 65 of module Bags`);let i=L(r),a=I(_r(i.range)).elements,o=a.find(e=>typeof e!=`number`);o!==void 0&&t.get(`>=`)?.evaluateBinary?.(a[0],o);let s=i.range.filter(e=>typeof e==`number`);if(s.some(e=>e<1))throw new e.b(`Attempted to apply a function to ${R(i)}, which is not in its domain`);return gr(i.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:s[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Dn(e.map(e=>e[0]),e.map(e=>e[1]))))}),B(`BagToSet`,1,e=>Pi(Fu(e,0,`BagToSet`))),B(`SetToBag`,1,e=>{let t=z(e,0,`SetToBag`),n=Ru(t,()=>Mu(`BagToSet`,Pu,t));return Dn([...n],n.map(()=>1))})],Ju={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},Yu={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},Xu=[{lower:`true`,upper:`TRUE`,token:H.true},{lower:`false`,upper:`FALSE`,token:H.false},{lower:`null`,upper:`NULL`,token:H.null}],Zu=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
|
|
78
|
+
from outside that declaration's scope.`,dc=(t,n,r,i,a,o)=>{let s=(n,r)=>{let i=(n===void 0?void 0:t.selectorRanges?.[n])??t.location.range;i&&a.errors.push({location:e.X(i),message:r})},c=r.isSuffices===r.isInProof,l=r.statement,u={node:l,isGoal:!0,isSufficesOpen:r.isSuffices};for(let[e,t]of n.slice(1).entries()){let r=e+1,o=u.node;if(t.kind===`Name`){if(n[r-1].kind!==`Name`)return o.kind!==`NewSymbol`&&o.kind!==`AssumeProve`&&cc(o).kind===`Let`?void 0:s(r-1,`A name selector here must be from a LET clause.`);let e=l.kind===`AssumeProve`?[...l.assumptions,l.conclusion]:[l],i=r===1?e.map((e,n)=>({position:n,label:sc(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:o.kind===`Label`?oc(o.body,t.name):void 0};if(!i?.label)return s(r,`Cannot find label \`${t.name}'.`);if(r===1&&l.kind===`AssumeProve`&&ac(l,i.position)&&c)return s(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${uc}`);if(t.args.length!==i.label.params.length)return s(r,`Label \`${t.name}' used with wrong number of arguments.`);u.node=i.label,u.isGoal=!1,u.isSufficesOpen=!1;continue}if(t.kind!==`Operand`)return;let d=lc(t.operand);if(u.isSufficesOpen){if(Qs(t.operand,1)!==0)return s(r,o.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);u.isSufficesOpen=!1;continue}if(o.kind===`NewSymbol`)return;if(o.kind!==`AssumeProve`){let e=cc(o);if([`Number`,`Decimal`,`String`].includes(e.kind))return s(r,`Selecting subexpression of expression that has none.`);let n=e.kind===`Identifier`?Ks(e.name,i,a)?.kind:void 0;if(n===`Variable`||n?.startsWith(`New`))return s(r,`Choosing operand \`${d}' of subexpression with no operands.`);let c=nc(e)?.sets,l=e.kind===`Identifier`?[]:c?c.length>0?c:void 0:e.kind===`Except`?void 0:rc(e);if(!l)return;let f=Qs(t.operand,l.length);if(f===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);u.node=l[f],u.isGoal=!1;continue}let f=[...o.assumptions,o.conclusion],p=Qs(t.operand,f.length);if(p===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);if(ac(o,p)&&(!u.isGoal||c))return s(r,`Accessing ASSUME/PROVE clause ${uc}`);let m=f[p];if(m.kind===`NewSymbol`&&r!==n.length-1)return s(r,`Selected a subexpression of a NEW clause of an ASSUME.`);u.node=m,u.isGoal=!1}o||(u.node.kind===`AssumeProve`&&s(void 0,`Selected ASSUME/PROVE instead of expression.`),u.node.kind===`NewSymbol`&&s(void 0,`Selected a NEW declaration as an expression or operator.`))},fc=(t,n)=>{let r=n.isGenerated?void 0:n.hasLabelScope?n.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:n.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return r===void 0||!t.location.range?!1:(n.errors.push({location:e.X(t.location.range),message:r}),!0)},pc=(t,n,r)=>{let i=t.location.range;if(!i||r.isGenerated)return;let a=e.X(i),o=t.params.filter((i,a)=>{let o=Ps(n,i)?.kind===`Parameter`,s=t.paramRanges?.[a];return!o&&s&&r.errors.push({location:e.X(s),message:`Illegal parameter ${i} of label \`${t.name}'.`}),o});o.filter((e,t)=>o.indexOf(e)!==t).forEach(e=>r.errors.push({location:a,message:`Repeated formal parameter ${e} \nin label \`${t.name}'.`})),r.labelParams.filter(e=>!o.includes(e)).forEach(e=>r.errors.push({location:a,message:`Label ${t.name} must contain formal parameter \`${e}'.`}));let s=[...new Set(o.filter(e=>!r.labelParams.includes(e))),...t.params.filter(e=>!o.includes(e))];s.length>0&&r.errors.push({location:a,message:`Label ${t.name} declares extra parameter(s) ${s.map(e=>`${e} `).join(``)}`}),r.labels.has(t.name)&&r.errors.push({location:a,message:`Duplicate label \`${t.name}'.`}),r.labels.add(t.name)},mc=(e,t,n,r)=>{if(!ic(e))return!1;let i=ec(e),a=i[0],o=i.length>1&&a.kind===`Name`?Ps(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&dc(e,i,o,t,n,r),o!==void 0},hc=(t,n,r,i)=>{let a=t.location;if(Tc(t,r,i))return;let o=Ds.get(t);if(o!==void 0)return o;if(Os(n))return t.kind===`Apply`?t.args.length:0;let s=Ps(r,n);if(s?.isNonFact){i.errors.push({location:e.X(Js(t,n)),message:`Step number of non-expression step used as an expression.`});return}if(mc(t,r,i,!1)||Zs(n)&&s)return t.kind===`Apply`?t.args.length:0;if(s&&t.kind!==`OperatorReference`&&(t.resolution=ws),s)return s.arity;let c=Gs(n,i);if(c)return t.kind===`Identifier`?t.name=c.key:t.operator=c.key,Ds.set(t,c.arity),c.arity;let l=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``;if(l!==``&&(Ps(r,l)!==void 0||Gs(l,i)!==void 0||i.facts.has(l)))return t.kind===`Apply`?t.args.length:0;let u=(t.kind===`Identifier`?void 0:t.spelling)??n,d=e.X(t.kind===`Apply`&&u===`-.`?qs(a,`-`):Js(t,n));if(!Xs(n)||Zs(n)){i.errors.push({location:d,message:`Unknown operator: \`${n}'.`});return}i.errors.push({location:d,message:`Could not find declaration or definition of symbol '${u}'.`});let f=Ys(t);f&&a.range&&i.errors.push({location:e.X(a.range),message:`Couldn't resolve ${f} operator symbol \`${u}'.`})},gc=(e,t,n)=>(e.forEach(e=>V(e.set,t,n)),e.reduce((e,t)=>Bs(e,Hs(t.pattern),t.pattern.ranges,n),t)),_c=(e,t)=>e.kind===`Identifier`&&e.name===t&&j(e)||ze(e).some(e=>_c(e,t)),vc=(e,t)=>{e.kind===`FunctionConstruction`&&_c(e.body,t)&&(e.isRecursive=!0),ze(e).forEach(e=>vc(e,t))},yc=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?Us(t.bounds):[],labels:/* @__PURE__ */ new Set},o=t.name,s=t.location.range,c=t=>{s&&!a.isGenerated&&a.errors.push({location:e.X(s),message:t})},l=t.kind===`Function`?gc(t.bounds,n,a):Vs(n,t.params,a),u=Ps(l,o)??Fs(o,a,s),d=u?.isPending===!0&&i.has(u);return u?.isPending&&!d?c(`Recursive ${t.kind===`Function`?`function`:`operator`} ${o} defined at wrong LET/IN level.`):u&&!d&&c(t.kind===`Function`?`Function name \`${o}' already defined or declared.`:`Operator ${o} already defined or declared.`),t.kind===`Function`?(V(t.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),vc(t.body,o),t.isSelfReferential=_c(t.body,o)):V(t.body,l,a),u&&d?(u.isPending=!1,u.range=s,!1):t.kind===`Function`?u===void 0:Ls(o,Ps(n,o)??Fs(o,a,s),{kind:`Definition`,arity:js(t),range:s},a)},bc=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Ps(e,t.name)?.isPending)return e;let n={name:t.name,arity:js(t),params:Ms(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>jc(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Os(t.name)?e:s(e,e=>!As(t.location,e.location)),o={name:t.name,arity:js(t),kind:`Definition`,range:t.location.range,parent:a};if(Ns(t))return{...o,params:Ms(t)};let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Os(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return yc(t,a,u,i)?{...o,params:Ms(t)}:a},a),()=>!0)},xc=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Ps(t,r)??Fs(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},Sc=(t,n,r)=>{if(t.kind!==`Identifier`&&t.kind!==`Apply`)return!1;let i=xc(t.kind===`Identifier`?t.name:t.operator,n,r),a=t.kind===`Apply`?t.argumentCounts?.[0]??0:0;if(!i||a===i.arity)return!1;let o=(t.kind===`Apply`?t.argumentRanges?.[0]:void 0)??t.location.range;return o&&r.errors.push({location:e.X(o),message:`The operator ${i.name} requires ${i.arity} arguments.`}),!0},Cc=(t,n,r)=>{if(Sc(t,n,r))return;let i=t.operator,a=Ks(i,n,r),o=hc(t,i,n,r);if(o===void 0)return;if(o!==t.args.length){r.errors.push({location:e.X(t.argumentsRange??Js(t,i)),message:`The operator ${i} requires ${o-(xc(i,n,r)?.arity??0)} arguments.`});return}let s=a&&(a.kind===`Definition`?a.params:[]);if(s===void 0){t.args.forEach(e=>wc(e,n,r));return}let c=(t,n)=>{t&&r.errors.push({location:e.X(t),message:n})};t.args.map((e,a)=>{let o=s[a]??0,l=e.location.range;if(o===0){if(e.kind===`Lambda`&&e.operator!==void 0)c(l,`The operator ${e.operator} requires 1 arguments.`);else if(e.kind===`Lambda`&&l)c(l,`LAMBDA expression used where an expression is required.`);else if(e.kind===`OperatorReference`){let t=hc(e,e.operator,n,r);t!==void 0&&c(l,`The operator ${e.operator} requires ${t} arguments.`)}else V(e,n,r);return!0}if(e.kind===`Lambda`){V(e,n,r);let s=e.params.length===o;return!s&&Ts.has(e)?c(l,`Expected arity ${o} but found operator of arity ${e.params.length}.`):!s&&l&&e.operator===void 0&&c(t.selectorRanges?.at(-1)??Js(t,i),`Lambda expression with arity ${e.params.length} used as argument ${a+1} of operator \`${i}', \nbut an operator of arity ${o} is required.`),s}if(e.kind===`Subexpression`)return V(e,n,r),!0;if(e.kind===`Apply`&&e.argumentCounts?.at(-1)===0){let t=e.argumentCounts.findIndex(e=>e>0);return c(e.selectorRanges?.[t],`Selector \`${e.operator.split(`!`)[t]}' should not have argument(s).`),!1}if(e.kind!==`Identifier`&&e.kind!==`OperatorReference`)return c(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${i}', in a position an operator is required.`),!1;let u=e.kind===`Identifier`?e.name:e.operator,d=Ks(u,n,r)?.params??[],f=hc(e,u,n,r);return e.kind===`Identifier`&&f!==void 0&&f!==o&&c(Js(e,u),`Expected arity ${o} but found operator of arity ${f}.`),f===o&&d.every(e=>e===0)}).forEach((e,n)=>{e||c(t.location.range,`Argument number ${n+1} to operator '${i}' \nshould be a ${s[n]}-parameter operator.`)})},wc=(e,t,n)=>{e.kind===`Identifier`?hc(e,e.name,t,n):V(e,t,n)},Tc=(e,t,n)=>{let r=Es.get(e);return r?(r.args.forEach(e=>wc(e,t,n)),n.errors.push(r.error),!0):!1},V=(t,n,r)=>{if(Ts.has(t)&&!r.isGenerated){V(t,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>V(e,n,r)),a=e=>({...r,labelParams:[...r.labelParams,...e]});switch(t.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(Sc(t,n,r))return;let i=t.name,a=hc(t,i,n,r);a!==void 0&&a>0&&r.errors.push({location:e.X(Js(t,i)),message:`The operator ${i} requires ${a} arguments.`});return}case`OperatorReference`:hc(t,t.operator,n,r);return;case`Apply`:Cc(t,n,r);return;case`Lambda`:V(t.body,Bs(n,t.params,t.paramRanges,r),a(t.params));return;case`And`:case`Or`:i(t.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:V(t.expression,n,r);return;case`If`:i([t.condition,t.consequent,t.alternative]);return;case`Case`:i(t.arms.flatMap(e=>[e.condition,e.body])),t.other&&V(t.other,n,r);return;case`Let`:V(t.body,bc(t.definitions,n,r,t.instances),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:V(t.body,gc(t.bounds,n,r),a(Us(t.bounds)));return;case`UnboundedQuantifier`:V(t.body,Bs(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&V(t.set,n,r),V(t.body,Bs(n,Hs(t.pattern),t.pattern.ranges,r),a(Hs(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:V(t.predicate,gc([t.bound],n,r),a(Hs(t.bound.pattern)));return;case`SetMap`:V(t.expression,gc(t.bounds,n,r),a(Us(t.bounds)));return;case`FunctionSet`:i([t.domain,t.range]);return;case`Record`:case`RecordSet`:t.fields.forEach((i,a)=>{t.fields.slice(0,a).some(e=>e.name===i.name)&&r.errors.push({location:e.X(i.location.range??qs(i.location,i.name)),message:`Non-unique fields in constructor.`}),V(i.value,n,r)});return;case`Except`:V(t.function,n,r),t.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),V(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:i([t.function,...t.args]);return;case`FieldAccess`:V(t.record,n,r);return;case`Product`:i(t.factors);return;case`BoxAction`:case`AngleAction`:i([t.action,t.subscript]);return;case`WeakFairness`:case`StrongFairness`:i([t.subscript,t.action]);return;case`Label`:if(fc(t,r))return;V(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),pc(t,n,r);return;case`Subexpression`:if(Tc(t,n,r))return;t.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>wc(e,n,r)),mc(t,n,r,!1)}},Ec=(t,n,r)=>t.forEach(t=>{if(t.kind===`ModuleFact`||Sc(t,n,r)||mc(t,n,r,!0))return;let i=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;t.kind===`Identifier`&&Ps(n,i)?.isNonFact?r.errors.push({location:e.X(Js(t,i)),message:`Step number of non-fact used as a fact`}):r.facts.has(i)||V(t,n,r)}),Dc=(e,t,n)=>(e.set&&V(e.set,t,n),Rs(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Oc=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Dc(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Oc(t,e.scope,e.unit,!0):V(t,e.scope,e.unit),e),{scope:t,unit:n});return V(e.conclusion,i.scope,i.unit),i.scope},kc=(e,t,n)=>e.kind===`AssumeProve`?Oc(e,t,n):(V(e,t,n),t),Ac=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Ec(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Mc(t,e,r),t)},jc=(e,t,n)=>{let r=Rc(e,t,n);return e.name===void 0?r:Rs(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Mc=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=kc(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Ac(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Ac(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 Ec(r.facts,t,n),o(t);case`Instance`:return o(jc(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?jc(t,e,i):bc([t],e,n),t));case`Have`:case`Case`:return V(r.expression,t,i),Ac(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>V(e,t,i)),a(t);case`Take`:return a(Bs(gc(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Bs(gc(r.bounds,t,i),r.names,r.nameRanges,i);return V(r.body,o,{...i,labelParams:[...i.labelParams,...Us(r.bounds),...r.names]}),Ac(e.proof,a(t),n),a(o)}default:return Ac(e.proof,a(t),n),a(t)}},Nc=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:kc(e.statement,void 0,t);e.name!==void 0&&zs(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Ac(e.proof,n,t),r&&(r.isInProof=!1)},Pc={line:0,column:0},Fc=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Ic=(e,t)=>{let n=new Map([...ks,...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},Lc=(t,n,r,i,a)=>{let o=t.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(n,r)=>{if(n.arity===0||r.kind!==`Identifier`){V(r,o,a);return}let i=hc(r,r.name,o,a);if(i!==void 0&&i!==n.arity)throw new e.F(`An operator must be substituted for symbol '${n.name}', and it must have arity ${n.arity} in the instance of ${t.module} at line ${t.location.line}, column ${t.location.column}`)},c=/* @__PURE__ */ new Map;t.substitutions.forEach(t=>{let r=t.name,i=n.find(e=>e.name===r);if(!i){a.errors.push({location:e.X(t.nameRange),message:`Identifier '${r}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let o=t.expression;s(i,o);let l=o.location.range;c.has(r)?l&&a.errors.push({location:e.X(l),message:`Multiple substitutions for symbol '${r}' in substitution.`}):c.set(r,o)});let l=n.filter(e=>!c.has(e.name)),u=e=>!Ps(o,e.name)&&!Gs(e.name,a);return l.filter(e=>!u(e)).forEach(e=>{let n={kind:`Identifier`,name:e.name,location:t.location};s(e,n),c.set(e.name,n)}),l.filter(u).forEach(n=>{let i=t.location.range,o=n.location.range;i&&o&&a.errors.push({location:e.X(i),message:`Substitution missing for symbol ${n.name} declared at ${e.X(o)} \nand instantiated in module ${r}.`})}),c},Rc=(e,t,n)=>{let r=n.getInstance(e);return Lc(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Rs(e,t,r,n),t)},zc=(e,t,n,r)=>{let i=Ic(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Lc(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:Pc}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Bc=(t,n)=>{let r=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return t.toSorted((e,t)=>As(e.location,t.location)?-1:+!!As(t.location,e.location)).forEach(t=>{let a=[],o=[];try{t.check(a,o)}catch(t){if(!(t instanceof e.F)||!t.sany&&a.length===0)throw t;a.push(...t.sany?.errors??[])}a.forEach(e=>i(r,e)),o.forEach(e=>i(n,e))}),r},Vc=(t,n)=>{let r=Ic(t,n.imported),i=/* @__PURE__ */ new Set([...n.facts,...[...t.theorems,...t.assumptions].flatMap(e=>e.name??[])]),a=new Map(t.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),o=new Map([...ks,...n.bound].map(([e,t])=>[e,{...t,position:Pc}])),s=/* @__PURE__ */ new Set,c=[],l=(e,t,s,c)=>({location:e,check:(l,u)=>c({imported:r,getInstance:n.getInstance,definitions:n.definitions,getKey:n.getKey,location:e,self:t,facts:i,goals:a,bindings:o,errors:l,warnings:u,hasLabelScope:s,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})}),u=(e,t)=>e.map(e=>l(e.location,void 0,!1,n=>zs(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return Bc([...n.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...u(t.constants,`Constant`),...u(t.variables,`Variable`),...t.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>l(e.location,void 0,!1,t=>{let n={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},r=Ls(e.name,o.get(e.name),n,t);r&&(o.set(e.name,n),s.add(n)),c.push({declaration:e,binding:r?n:void 0})})),...t.definitions.map(e=>l(e.location,e,!0,n=>{Fc(t,e)?V(e.body,void 0,n):yc(e,void 0,n,s)&&o.set(e.name,{kind:`Definition`,arity:js(e),range:e.location.range,position:e.location})})),...t.instances.map(e=>l(e.location,void 0,!1,t=>{Vs(void 0,e.params,t),n.instanced.get(e)?.forEach((e,n)=>zs(n,e,t)),e.name!==void 0&&zs(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},t)})),...t.assumptions.map(e=>l(e.location,void 0,e.name!==void 0,t=>{V(e.expression,void 0,t),e.name!==void 0&&zs(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t)})),...t.theorems.map(e=>l(e.location,void 0,e.name!==void 0,t=>Nc(e,t))),...t.uses.map(e=>l(e.location,void 0,!1,t=>Ec(e.facts,void 0,t))),{location:t.location.range?.end??t.location,check:t=>c.forEach(n=>{let r=n.declaration.location.range;r&&(!n.binding||n.binding.isPending)&&t.push({location:e.X(r),message:`Symbol ${n.declaration.name} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},Hc=/* @__PURE__ */ new WeakSet,Uc=/* @__PURE__ */ new WeakMap,Wc=(e,t)=>{if(t.length===0)return e;let n={...e};return Hc.has(e)&&Hc.add(n),Uc.set(n,[...t,...Uc.get(e)??[]]),n},Gc=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Zc(e,(e,r)=>Gc(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&j(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&j(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Kc=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),qc=/* @__PURE__ */ new WeakMap,Jc=e=>qc.get(e)??e.name,Yc=(e,t)=>(Jc(t)!==e.name&&qc.set(e,Jc(t)),e),Xc=(e,t)=>Yc(e.kind===`Function`?{...e,bounds:Kc(e.bounds,e=>t(e,[])),body:t(e.body,Us(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Zc=(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=>Xc(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Kc(e.bounds,n),body:t(e.body,Us(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,Hs(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,Hs(e.bound.pattern))};case`SetMap`:return{...e,bounds:Kc(e.bounds,n),expression:t(e.expression,Us(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)}}},Qc=(e,t)=>{Zc(e,(e,n)=>(t(e,n),e))},$c=`LAMBDA`,el=e=>`${e}@SUBSTITUTION`,tl=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(tl),nl=(e,t)=>{if(e.kind!==`Identifier`)return!tl(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=j(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!tl(n.body)},rl=(e,t=/* @__PURE__ */ new Set)=>{let n=Be(e),r=n===void 0||t.has(n)?[]:[n];return Qc(e,(e,n)=>r.push(...rl(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},il=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}},al=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),ol=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},sl=(e,t)=>e.map(e=>({pattern:ol(e.pattern,t),set:e.set})),cl=(e,t)=>e.kind===`Function`?{...e,bounds:sl(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},ll=(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=>Yc({...cl(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:sl(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:ol(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:ol(e.bound.pattern,n),set:e.bound.set}};default:return e}},ul=e=>`${e}@ENABLED`,dl=(e,t)=>e.modes.get(t)??e,fl=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!j(e)&&t.instantiation.variables.has(e.name),pl=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>pl(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(fl(e,t,n))return[e.name];let r=j(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?pl(r.body,t,/* @__PURE__ */ new Map):void 0},ml=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return fl(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:ul(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:bl(e.expression,dl(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[bl(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:bl(e.subscript,dl(t,`Primed`),n),location:r},bl(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=pl(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:ul(r),location:e.location},location:e.location},bl({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},hl=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:ws}),gl=(e,t)=>e.map(e=>hl(e.name,t)),_l=(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:gl(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),vl=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...gl(t,r),...i.map(e=>hl(e,r))],location:r},location:r}},yl=(e,t)=>e.instantiation.isParameterized(t)?Sl(e,t):void 0,bl=(t,n,r)=>{let i=e=>bl(e,n,r),a=n.instantiation,o=a.params,s=e=>!r.has(e)&&!j(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:bl(t.expression,dl(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:bl(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},dl(n,`Enabled`),r)};let c=ml(t,n,r);if(c)return c;if(t.kind===`Identifier`&&s(t.name)){let e=a.substitutions.get(t.name),r=n.bindings;if(e&&(r===void 0||!nl(e,a)))return Wc(e,[t]);if(e&&r){let n=el(t.name);return r.set(n,e),hl(n,t.location)}let i=yl(n,t.name);if(i===void 0)return t;if(o.length===0)return{...t,name:i};let s=a.getDefinition(t.name);return s&&js(s)>0?vl(i,o,js(s),t.location):{kind:`Apply`,operator:i,args:gl(o,t.location),location:t.location}}if(t.kind===`Apply`&&s(t.operator)){let r=t.args.map(i),s=a.substitutions.get(t.operator),c=a.substitutions.size>0||o.length>0||Hc.has(t),l=e=>(c&&Hc.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let e=s.kind===`Identifier`?s.name:s.operator;return l({...t,operator:e,args:r,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...t,operator:s.operator,args:[...s.args,...r],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:$c,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:$c,args:r,resolution:ws},location:t.location};if(s)throw new e.F(`The operator ${t.operator} can only be substituted by an operator at line ${t.location.line}, column ${t.location.column}`);let u=yl(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[...gl(o,t.location),...r]}}if(t.kind===`OperatorReference`&&s(t.operator)){let e=a.substitutions.get(t.operator);if(e?.kind===`Identifier`||e?.kind===`OperatorReference`||e?.kind===`Lambda`)return Wc(e,[t]);let r=yl(n,t.operator);if(r===void 0)return t;let i=a.getDefinition(t.operator);return o.length>0&&i?vl(r,o,js(i),t.location):{...t,operator:r}}let l=il(n),u=Zc(t,(e,t)=>t.length===0?i(e):bl(e,n,al(r,t,l)));return ll(u,r,l)},xl=(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:hl(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Sl=(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=il(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=cl(Xc(i,(e,t)=>bl(e,s,al(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(([e,t])=>({kind:`Operator`,name:e,params:[],body:t,isLocal:!0,isRecursive:!1,location:t.location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&Uc.set(l,[u,...Uc.get(i.body)??[]]),xl({...c,body:l},r.params,i.location)}):t},Cl=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>rl(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=>yl(i,e)??e,getQualifiedKey:t=>{let n=yl(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>xl(r,e.params,r.location)):t}}},wl=e=>e.kind===`Let`&&e.instances!==void 0||ze(e).some(wl),Tl=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Zc(e,e=>Tl(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>As(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}},El=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Dl=(e,t)=>e.definitions.some(e=>wl(e.body))||e.assumptions.some(e=>wl(e.expression))||e.theorems.some(e=>{let t=El(e);return t!==void 0&&wl(t)})?{...e,definitions:e.definitions.map(e=>Xc(e,e=>Tl(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Tl(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=El(e);return n===void 0?e:{...e,statement:Tl(n,t,[])}})}:e,Ol=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}])),kl={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]}},Al=(e,t)=>{let n=kl[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},jl=(e,t)=>`${e}${t}`,Ml=(e,t,n)=>`${e}${t}${n}`,Nl=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Pl=(e,t,n)=>`${e},${t},${n}`,Fl=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Il=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Ll=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Rl=(e,t)=>{t.constraints.forEach((t,n)=>Il(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>Ll(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},zl=(e,t,n,r)=>({...Fl(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Bl=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Vl=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Hl=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{...zl(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Ul=zl(`$Set`,0,[2],[1]),Wl=zl(`$Junction`,0,[3],[1]),Gl=zl(`$Choose`,0,[2],[1]),Kl=zl(`$Function`,0,[3],[1]),ql=zl(`$FcnApply`,0,[2,2],[1,1]),Jl=zl(`$RcdSelect`,0,[2,0],[1,1]),Yl=zl(`'`,2,[1],[0]),Xl=zl(`ENABLED`,1,[2],[0]),Zl=zl(`[]`,3,[3],[0]),Ql=zl(`$SquareAct`,2,[2,1],[0,0]),$l=zl(`$WF`,3,[1,2],[0,0]),eu=zl(`$TemporalExists`,3,[3],[0]),tu=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),nu=e=>e.map(e=>({name:e,arity:0})),ru=(t,n)=>n.location.range?e.J(`${t}.`,n.location.range):new e.F(`${t} at line ${n.location.line}, column ${n.location.column}`),iu=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),au=e=>e.kind!==`Let`&&e.kind!==`Label`,ou=t=>{let n=/* @__PURE__ */ new Map,r=(e,n)=>{let r=n.get(e);if(r?.kind===`Formal`)return{kind:`Declared`,name:e,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:v(r.definition,r.scope)};if(t.constants.has(e))return{kind:`Declared`,name:e,level:0,arity:0};if(t.variables.has(e))return{kind:`Declared`,name:e,level:1,arity:0};let i=t.getDefinition(e);if(i){let n=v(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Hl.get(e)??Ol.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},i=(e,t,n)=>{let r=Fl(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(Ml(e,n,t))}),Ll(r.argConstraints,jl(e,n),t.data.level),Rl(r,t.data)}),r},a=(t,n,r=[],i=[])=>{let a=e=>i.includes(e);if(n.forEach((n,r)=>{if(n.kind===`Value`&&n.data.level>Bl(t,r))throw new e.F(`Level error in applying operator ${t.name}:\nThe level of argument ${r+1} exceeds the maximum level allowed by the operator`)}),r.some(e=>e.level>2))throw new e.F(`Level error in applying operator ${t.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let o=e=>{let r=t.formals.findIndex(t=>t.name===e);return r===-1?void 0:n[r]},s=(e,n,r)=>t.conditions.has(Pl(e,n,r)),c=Fl(Math.max(t.level,...n.filter((e,n)=>Vl(t,n)===1).map(e=>e.data.level),...r.map(e=>e.level)));return t.params.forEach(e=>c.params.add(e)),n.forEach((e,n)=>{Vl(t,n)===1&&e.data.params.forEach(e=>c.params.add(e))}),r.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),t.constraints.forEach((e,t)=>Il(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||Il(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>Il(c.constraints,t,e))),n.forEach((e,n)=>e.data.params.forEach(e=>{a(e)||Il(c.constraints,e,Bl(t,n))})),n.forEach((e,t)=>{if(e.kind!==`Operator`)return;let r=e.data;n.forEach((e,n)=>r.formals.forEach((i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>Il(c.constraints,e,Bl(r,a)))}))}),t.argParams.forEach(e=>{let t=Nl(e),n=o(t.operator);n?.kind===`Operator`&&Il(c.constraints,t.param,Bl(n.data,t.index))}),[t.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Ll(c.argConstraints,t,e))),n.forEach((e,r)=>{if(e.kind!==`Declared`)return;let i=e.declared;Array.from({length:i.arity},(e,n)=>Ll(c.argConstraints,jl(i.name,n),t.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&Ll(c.argConstraints,jl(i.name,a),e.data.level)}))}),t.argParams.forEach(e=>{let t=Nl(e),n=o(t.operator);n&&Ll(c.argConstraints,jl(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a(Nl(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),t.argParams.forEach(e=>{let t=Nl(e),n=o(t.operator);if(n)n.kind===`Declared`&&c.argParams.add(Ml(n.declared.name,t.index,t.param));else{let n=o(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(Ml(t.operator,t.index,e)))}}),n.forEach((e,t)=>{if(e.kind!==`Declared`)return;let r=e.declared;n.forEach((e,n)=>Array.from({length:r.arity},(i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>c.argParams.add(Ml(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:_(`LAMBDA`,nu(e.params),e.body,t)};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let i=r(n,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=Fl();return e.params.add(n),{kind:`Declared`,data:e,declared:{name:n,arity:i.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:Fl()}}return{kind:`Value`,data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=tu(n,nu(i));return a(e,s(t,o),r.map(e=>m(e,n)),i)},l=(e,t)=>e.kind===`Declared`?i(e.name,e.level,t):a(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw ru(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw ru(`Action used where only temporal formula or state predicate allowed`,e);iu.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&au(n)&&n.kind!==r)throw ru(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=>Rl(i,v(e,n))),i},m=(t,n)=>{try{return h(t,n)}catch(n){throw!(n instanceof e.F)||n.sany?n:ru(n.message,t)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Fl();case`Identifier`:return l(r(e.name,t),[]);case`Apply`:{let n=s(e.args,t);return d(e,n),l(r(e.operator,t),n)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(Wl,n)}case`Prime`:case`Unchanged`:return c(Yl,[e.expression],t);case`Enabled`:return c(Xl,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(Zl,[n])}case`If`:return c(Wl,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(Wl,[...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(Wl,[e.body],t,e.bounds.map(e=>e.set),Us(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw ru(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?eu:Wl,[e.body],t,[],e.names);case`Choose`:return c(Gl,[e.body],t,e.set?[e.set]:[],Hs(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(Ul,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(Ul,[e.predicate],t,[e.bound.set],Hs(e.bound.pattern));case`SetMap`:return c(Ul,[e.expression],t,e.bounds.map(e=>e.set),Us(e.bounds));case`FunctionConstruction`:return c(Kl,[e.body],t,e.bounds.map(e=>e.set),Us(e.bounds));case`Record`:return c(Kl,e.fields.map(e=>e.value),t);case`RecordSet`:return c(Ul,e.fields.map(e=>e.value),t);case`Except`:return c(Ul,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(ql,[o(e.function,t),e.args.length===1?o(e.args[0],t):{kind:`Value`,data:c(Ul,e.args,t)}]);case`Bracket`:return Fl();case`FieldAccess`:return a(Jl,[o(e.record,t),{kind:`Value`,data:Fl()}]);case`BoxAction`:case`AngleAction`:return c(Ql,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c($l,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Fl()}},g=(e,t,n=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,r=n,a=t)=>g(e,a,r,i),o=(e,o)=>{let s=r(e,t);s.kind===`Declared`?(n&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,n||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 ze(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,tu(t,nu(e.names))),i;default:return Qc(e,(e,r)=>a(e,n,tu(t,nu(r)))),i}},_=(e,t,n,r)=>{let i=tu(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...Fl(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(jl(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(Ml(e.name,n,t.name))).map(e=>Pl(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(Nl(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Nl(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},v=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{...Fl(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,t);return n.set(e,o),o};return{analyze:m,analyzeDefinition:v,toOperand:o}},su=(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`?su(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Fl(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),Rl(a,e)}),a},cu=(t,n,r,i)=>{let a=ou(n),o=e=>Math.max(0,...e.map(e=>a.analyze(e,/* @__PURE__ */ new Map).level)),s=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?o([t.expression]):t.kind===`Witness`?o(t.expressions):t.kind===`Take`?o(t.bounds.map(e=>e.set)):t.kind===`Pick`?o([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?su(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},c=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=e.X(t.statement),r=()=>s(t)===0;return t.body.kind===`Have`||t.body.kind===`Take`||t.body.kind===`Witness`?r()?[]:[{location:n,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:t.body.kind===`Case`?[...r()?[]:[{location:n,message:`Non-constant CASE for temporal goal.`}],...c(t.proof)]:t.body.kind===`Qed`?c(t.proof):[]}):[],l=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=t.body,r=()=>s(t)===3,i=n.kind===`Pick`&&n.bounds.length>0&&r()?n.bounds.filter(e=>o([e.set])!==0).flatMap(t=>t.set.location.range?[{location:e.X(t.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(t.proof),...i,...t.proof?.kind===`Steps`&&r()?c(t.proof):[]]}):[],u=Bc([...t.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>a.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...t.assumptions.map(e=>({location:e.location,check:()=>a.analyze(e.expression,/* @__PURE__ */ new Map)})),...t.theorems.map(t=>({location:t.location,check:()=>{let n=t.statement.kind===`AssumeProve`?su(t.statement,/* @__PURE__ */ new Map,a):a.analyze(t.statement,/* @__PURE__ */ new Map),r=[...l(t.proof),...n.level===3?c(t.proof):[]];if(r.length>0)throw e.q(r)}})),...r],i);if(u.length>0)throw e.q(u,!1,void 0,i)},lu=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),uu=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),du=/* @__PURE__ */ new Set([...lu,...uu,`Enabled`]),fu=/* @__PURE__ */ new Set([`~>`,`-+->`]),pu=/* @__PURE__ */ new Set([...fu,`\\cdot`]),mu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),hu=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),gu=/* @__PURE__ */ new Set([`RandomSubset`,`RandomSetOfSubsets`,`TestRandomSetOfSubsets`,`RandomSubsetSet`]),_u=(e,t)=>mu.has(e)||t.builtins.get(e)?.isStateLevel===!0,vu=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(lu.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(uu.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&fu.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(du.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&pu.has(e.operator))&&(r[0]|=1),du.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=Be(e);if(u!==void 0&&!j(e)){let e=t.substitutions.get(u)??u,n=t.definitions.get(e),a=t.constants.has(u),o=t.variableIndex.get(u);if((o!==void 0||t.builtins.get(u)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=1),o!==void 0&&(l&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:l});else{_u(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),hu.has(u)&&(r[0]|=8),gu.has(u)&&(r[0]|=256),!a&&_u(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}ze(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},yu=(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},bu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),xu=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=vu(Re(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=yu(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=yu(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!bu(t[e],l[e*r])))),p=yu(a,r,f,270);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|d[t]&224|p[t]&270:e),words:r}},Su=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?Cu(Re(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},Cu=(e,t)=>{let n=t.facts.words,r=vu(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=Su(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}bu(e.callee,r[0])||(i[0]|=r[0]&270)}),i},wu=(e,t)=>!(Su(e,t)[0]&1),Tu={any:2,repeated:4,streamed:8,replayed:260},Eu=(e,t,n)=>(Cu(e,t)[0]&Tu[n])!==0,Du=(e,t,n=`any`)=>(Su(e,t)[0]&Tu[n])!==0,Ou=(e,t)=>{let n=Su(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},ku=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},Au=(e,t)=>{let n=Cu([e],t);return n[0]&16?void 0:ku(n)},ju=(e,t)=>!!(Cu([e],t)[0]&1),Mu=(t,n,r)=>new e.k(`Applying ${t} to the following value,\nwhich is not ${n}:\n${R(r)}`),Nu=e=>Nt(e)?L(e):void 0,Pu=`a function with a finite domain`,Fu=(e,t,n)=>{let r=z(e,t,n),i=Nu(r);if(!i)throw Mu(n,Pu,r);return i},Iu=(e,t)=>{let n=z(e,1,t),r=Nu(n),i=r&&Bu(r,z(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw jo(`second`,t,`bag`,n);return i},Lu=(e,t,n)=>{let r=t[n];if(!r||!zu(r))throw jo(n===0?`first`:`second`,`(+)`,`bag`,z(e,n,`(+)`));return r},Ru=(e,t)=>{if(!P(e)||!F(e))throw t();return I(e).elements},zu=e=>e.range.every(e=>typeof e==`number`&&e>0),Bu=(e,t)=>{let n=e.domain.findIndex(e=>pr(t,e));return n===-1?void 0:e.range[n]},Vu=t=>{if(typeof t==`number`)return t;let n=`tlc2.value.impl.${Ko(t)}`;throw new e.b(`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},Hu=(e,t)=>{let n=Vu(e)+Vu(t);if(Bo(n))throw Vo(`${e}+${t}`);return n},Uu=(e,t,n)=>{let r=Vu(e.range[t]),i=Bu(n,e.domain[t]);if(i===void 0)return r;let a=r-Vu(i);if(Bo(a))throw Vo(`${r}-${i}`);return a},Wu=(e,t,n,r=e.length)=>{let i=e.slice(0,r).find(e=>pr(t,e[0]));i?i[1]=Hu(i[1],n):e.push([t,n])},Gu=e=>e.domain.map((t,n)=>[t,e.range[n]]),Ku=Dn([],[]),qu=t=>[Io(`EmptyBag`,Ku),B(`IsABag`,1,e=>{let t=Nu(z(e,0,`IsABag`));return t!==void 0&&zu(t)}),B(`BagCardinality`,1,e=>{let t=z(e,0,`BagCardinality`);return Fu(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Mu(`BagCardinality`,`a bag`,t);return Hu(e,n)},0)}),B(`BagIn`,2,e=>{let t=Iu(e,`BagIn`);return t!==void 0&&t>0}),B(`CopiesIn`,2,e=>Iu(e,`CopiesIn`)??0),B(`\\oplus`,2,e=>{let t=[0,1].map(t=>Nu(z(e,t,`(+)`))),n=Lu(e,t,0),r=Lu(e,t,1),i=Gu(n);return r.domain.forEach((e,t)=>Wu(i,e,r.range[t],n.domain.length)),Sr(i)}),B(`\\ominus`,2,e=>{let t=z(e,0,`(-)`),n=z(e,1,`(-)`),r=Nu(t),i=Nu(n);if(!r)throw jo(`first`,`(-)`,`bag`,t);if(!i)throw jo(`second`,`(-)`,`bag`,n);return Sr(r.domain.flatMap((e,t)=>{let n=Uu(r,t,i);return n>0?[[e,n]]:[]}))}),B(`BagUnion`,1,t=>{let n=z(t,0,`BagUnion`),r=Ru(n,()=>Mu(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??Ku;let i=t=>{let r=Nu(t);if(!r)throw new e.k(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${R(n)}`);return r},a=Gu(i(r[0]));return r.slice(1).forEach(e=>{let t=i(e);t.domain.forEach((e,n)=>Wu(a,e,t.range[n]))}),Sr(a)}),B(`\\sqsubseteq`,2,e=>{let t=z(e,0,`\\sqsubseteq`),n=z(e,1,`\\sqsubseteq`),r=Nu(t),i=Nu(n);if(!r)throw Mu(`\\sqsubseteq`,Pu,t);if(!i)throw Mu(`\\sqsubseteq`,Pu,n);return r.domain.every((e,t)=>{let n=Bu(i,e);return Vu(r.range[t])<=(n===void 0?0:Vu(n))})}),Lo(`BagOfAll`,2,e=>{let t=Fo(e,0,`BagOfAll`),n=z(e,1,`BagOfAll`),r=Nu(n);if(!r)throw jo(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[];return r.domain.forEach((e,n)=>Wu(i,t.call([e]),r.range[n])),Sr(i)}),B(`SubBag`,1,n=>{let r=z(n,0,`SubBag`);if(!Nt(r))throw new e.b(`Attempted to apply the operator DOMAIN to a non-function\n(${qo(r)})\nline 106, col 58 to line 106, col 65 of module Bags`);let i=L(r),a=I(_r(i.range)).elements,o=a.find(e=>typeof e!=`number`);o!==void 0&&t.get(`>=`)?.evaluateBinary?.(a[0],o);let s=i.range.filter(e=>typeof e==`number`);if(s.some(e=>e<1))throw new e.b(`Attempted to apply a function to ${R(i)}, which is not in its domain`);return gr(i.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:s[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Dn(e.map(e=>e[0]),e.map(e=>e[1]))))}),B(`BagToSet`,1,e=>Pi(Fu(e,0,`BagToSet`))),B(`SetToBag`,1,e=>{let t=z(e,0,`SetToBag`),n=Ru(t,()=>Mu(`BagToSet`,Pu,t));return Dn([...n],n.map(()=>1))})],Ju={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},Yu={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},Xu=[{lower:`true`,upper:`TRUE`,token:H.true},{lower:`false`,upper:`FALSE`,token:H.false},{lower:`null`,upper:`NULL`,token:H.null}],Zu=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
|
|
79
79
|
`],[`r`,`\r`],[`f`,`\f`]]),Qu=1024,$u=t=>{let n=+!!t.startsWith(``),r=n,i=0,a=n,o=!0,s=H.none,c=0,l=[Ju.emptyDocument],u=[void 0],d=[0],f=()=>`$${l.map((e,t)=>e===Ju.emptyArray||e===Ju.nonemptyArray?`[${d[t]}]`:e===Ju.emptyDocument||e===Ju.nonemptyDocument?``:`.${u[t]??``}`).join(``)}`,p=()=>` at line ${i+1} column ${r-a+1} path ${f()}`,m=t=>new e.b(`com.google.gson.stream.MalformedJsonException: ${t}${p()}
|
|
80
80
|
See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`),h=()=>new e.b(`java.io.EOFException: End of input${p()}`),g=()=>{if(!o)throw m(`Use JsonReader.setStrictness(Strictness.LENIENT) to accept malformed JSON`)},_=e=>`/\\;#=`.includes(e)?(g(),!1):!`{}[]:, \f\r
|
|
81
81
|
`.includes(e),v=()=>{for(;r<t.length;){let e=t[r++];if(e===`
|
|
@@ -84,7 +84,7 @@ See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`)
|
|
|
84
84
|
`)i++,a=r;else if(e===`/`){if(r===t.length)return e;g();let n=t[r];if(n!==`*`&&n!==`/`)return e;if(r++,n===`/`)v();else if(y(`*/`))r+=2;else throw m(`Unterminated comment`)}else if(e===`#`)g(),v();else if(e!==` `&&e!==`\r`&&e!==` `)return e}},x=()=>{let e=b();if(e===void 0)throw h();return e},ee=()=>{let e=Xu.find(e=>t[r]===e.lower[0]||t[r]===e.upper[0]);if(!e)return H.none;let n=e.lower.length;for(let i=0;i<n;i++){let n=t[r+i];if(n!==e.lower[i]&&n!==e.upper[i])return H.none}return r+n<t.length&&_(t[r+n])?H.none:(r+=n,e.token)},te=()=>{let e=Yu.none,n=!1,i=0;for(;r+i<t.length;i++){if(i===Qu)return H.none;let a=t[r+i];if(a===`-`){if(e===Yu.none)e=Yu.sign;else if(e===Yu.exponentE)e=Yu.exponentSign;else return H.none}else if(a===`+`){if(e!==Yu.exponentE)return H.none;e=Yu.exponentSign}else if(a===`e`||a===`E`){if(e!==Yu.digit&&e!==Yu.fractionDigit)return H.none;e=Yu.exponentE}else if(a===`.`){if(e!==Yu.digit)return H.none;e=Yu.decimal}else if(a<`0`||a>`9`){if(_(a))return H.none;break}else if(e===Yu.sign||e===Yu.none)n=a===`0`,e=Yu.digit;else if(e===Yu.digit){if(n)return H.none}else e===Yu.decimal?e=Yu.fractionDigit:(e===Yu.exponentE||e===Yu.exponentSign)&&(e=Yu.exponentDigit)}return i===Qu||e!==Yu.digit&&e!==Yu.fractionDigit&&e!==Yu.exponentDigit?H.none:(c=i,H.number)},ne=()=>{let e=l.length-1,n=l[e];if(n===Ju.emptyArray)l[e]=Ju.nonemptyArray;else if(n===Ju.nonemptyArray){let e=x();if(e===`]`)return H.endArray;if(e===`;`)g();else if(e!==`,`)throw m(`Unterminated array`)}else if(n===Ju.emptyObject||n===Ju.nonemptyObject){if(l[e]=Ju.danglingName,n===Ju.nonemptyObject){let e=x();if(e===`}`)return H.endObject;if(e===`;`)g();else if(e!==`,`)throw m(`Unterminated object`)}let t=x();if(t===`"`)return H.doubleQuotedName;if(t===`'`)return g(),H.singleQuotedName;if(t===`}`){if(n!==Ju.nonemptyObject)return H.endObject;throw m(`Expected name`)}if(g(),r--,_(t))return H.unquotedName;throw m(`Expected name`)}else if(n===Ju.danglingName){l[e]=Ju.nonemptyObject;let n=x();if(n===`=`)g(),t[r]===`>`&&r++;else if(n!==`:`)throw m(`Expected ':'`)}else if(n===Ju.emptyDocument){if(b()===void 0)return H.eof;r--,t.startsWith(`)]}'
|
|
85
85
|
`,r)&&(r+=5),l[e]=Ju.nonemptyDocument}else if(n===Ju.nonemptyDocument){if(b()===void 0)return H.eof;g(),r--}let i=b();if(i===void 0){if(n===Ju.emptyDocument)return H.eof;throw h()}if(i===`]`&&n===Ju.emptyArray)return H.endArray;if(i===`]`||i===`;`||i===`,`){if(n!==Ju.emptyArray&&n!==Ju.nonemptyArray)throw m(`Unexpected value`);return g(),r--,H.null}if(i===`'`)return g(),H.singleQuoted;if(i===`"`)return H.doubleQuoted;if(i===`[`)return H.beginArray;if(i===`{`)return H.beginObject;r--;let a=ee();if(a!==H.none)return a;let o=te();if(o!==H.none)return o;if(!_(t[r]))throw m(`Expected value`);return g(),H.unquoted},S=()=>(s===H.none&&(s=ne()),s),re=()=>{if(r===t.length)throw m(`Unterminated escape sequence`);let e=t[r++];if(e===`u`){if(r+4>t.length)throw m(`Unterminated escape sequence`);let e=t.slice(r,r+4);if(!/^[\da-fA-F]{4}$/.test(e))throw m(`Malformed Unicode escape \\u${e}`);return r+=4,String.fromCharCode(Number.parseInt(e,16))}let n=Zu.get(e);if(n!==void 0)return n;if(e===`
|
|
86
86
|
`)return i++,a=r,e;if(`'"\\/`.includes(e))return e;throw m(`Invalid escape sequence`)},C=e=>{let n=``,o=r;for(;r<t.length;){let s=t[r++];if(s===e)return n+t.slice(o,r-1);s===`\\`?(n+=t.slice(o,r-1)+re(),o=r):s===`
|
|
87
|
-
`&&(i++,a=r)}throw m(`Unterminated string`)},ie=()=>{let e=r;for(;r<t.length&&_(t[r]);)r++;return t.slice(e,r)},w=t=>{if(l.length-1>=255)throw new e.b(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${p()}`);l.push(t),u.push(void 0),d.push(0),s=H.none},T=()=>{l.pop(),u.pop(),d.pop(),d[l.length-1]++,s=H.none},ae=()=>{let e=S();return e!==H.endObject&&e!==H.endArray&&e!==H.eof},oe=()=>{let e=S(),t=e===H.unquotedName?ie():C(e===H.singleQuotedName?`'`:`"`);return s=H.none,u[l.length-1]=t,t},se=e=>e===H.true||e===H.false?e===H.true:e===H.null?null:e===H.number?(r+=c,{literal:t.slice(r-c,r)}):e===H.unquoted?ie():C(e===H.singleQuoted?`'`:`"`),ce=()=>{let e=S();if(e===H.beginArray){w(Ju.emptyArray);let e=[];for(;ae();)e.push(ce());return T(),e}if(e===H.beginObject){w(Ju.emptyObject);let e=/* @__PURE__ */ new Map;for(;ae();)e.set(oe(),ce());return T(),e}let t=se(e);return s=H.none,d[l.length-1]++,t};if(S()===H.eof)return null;let le=ce();return o=!1,le!==null&&S(),le},ed=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),td=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),nd=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),rd=e=>{if(!Nt(e))return;let t=L(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?Pr(n):void 0},id=(t,n)=>{let r=`tlc2.value.impl.${Ko(t)}`,i=`tlc2.value.impl.${n}`;return new e.b(`class ${r} cannot be cast to class ${i} (${r} and ${i} are in unnamed module of loader 'app')`)},ad=t=>new e.b(`Cannot convert value: unsupported value type tlc2.value.impl.${Ko(t)}`),od=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),sd=e=>`[${e.map(dd).join(`,`)}]`,cd=e=>`{${Ht(e).map(e=>`${od(typeof e[0]==`string`?e[0]:R(e[0]))}:${dd(e[1])}`).join(`,`)}}`,ld=e=>{let t=L(e),n=ui(t);return n?sd(n):cd(t)},ud=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,dd=e=>typeof e==`string`?od(e):typeof e==`object`?e.kind===`ModelValue`?od(e.name):Ko(e)===`RecordValue`?cd(L(e)):fd(e):String(e),fd=e=>{let t=Ko(e);if(t===`TupleValue`)return sd(L(e).range);if(ud(t))return ld(e);if(Ir(e))return sd(I(e).elements);throw ad(e)},pd=e=>e.map(e=>`${dd(e)}\n`).join(``),md=e=>{let t=Ko(e);if(t===`RecordValue`)return cd(L(e));if(t===`TupleValue`)return`{${L(e).range.map((e,t)=>`"${t}":${dd(e)}`).join(`,`)}}`;if(ud(t))return ld(e);throw ad(e)},hd=t=>{if(t===null)throw new e.b(`Cannot convert value: unsupported JSON value null`);if(typeof t==`boolean`)return t;if(typeof t==`string`)return un(t);if(Array.isArray(t))return Nr(t.map(hd));if(t instanceof Map)return Pr([...t].map(e=>[un(e[0]),hd(e[1])]));let n=Number(t.literal);if(!/^-?\d+$/.test(t.literal)||Bo(n))throw new e.b(`Cannot convert value: expected a 32-bit integer JSON number, but found ${t.literal}`);return n||0},gd=t=>{if(typeof t!=`string`)throw new e.b(`Cannot cast tlc2.value.impl.${Ko(t)} to tlc2.value.impl.StringValue`);return t},_d=(e,t)=>{let n=Mi(e,t);if(typeof n!=`string`)throw id(n,`StringValue`);return n},vd=t=>{if(!td.has(t.toLowerCase()))throw nd.has(t.toLowerCase())?new e.B(`IOUtils!Serialize does not support the charset ${t}`):new e.b(/^[a-zA-Z\d][\w.:+-]*$/.test(t)?`java.nio.charset.UnsupportedCharsetException: ${t}`:`java.nio.charset.IllegalCharsetNameException: ${t}`)},yd=(t,n,r,i)=>{let a=r.find(e=>!ed.has(e));if(a!==void 0)throw new e.b(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${a}`);if(r.includes(`READ`))throw new e.b(`java.lang.IllegalArgumentException: READ not allowed`);let o=new Set(r.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:r);if(o.has(`APPEND`)&&o.has(`TRUNCATE_EXISTING`))throw new e.b(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(o.has(`DELETE_ON_CLOSE`))throw new e.B(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let s=t.readFile?.(n);if(s===void 0&&!o.has(`CREATE`)&&!o.has(`CREATE_NEW`))throw new e.b(`java.nio.file.NoSuchFileException: ${n}`);if(s!==void 0&&o.has(`CREATE_NEW`))throw new e.b(`java.nio.file.FileAlreadyExistsException: ${n}`);s===void 0||o.has(`TRUNCATE_EXISTING`)?t.writeFile?.(n,i):t.writeFile?.(n,o.has(`APPEND`)?s+i:i+s.slice(i.length))},bd=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},xd=(t,n)=>{let r=t.readFile?.(n);if(r===void 0)throw new e.b(`${n} (No such file or directory)`);return r},Sd=e=>[Yo(Ro(`ToJson`,1,e=>un(dd(z(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),Yo(Ro(`ToJsonArray`,1,e=>un(fd(z(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),Yo(Ro(`ToJsonObject`,1,e=>un(md(z(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),Yo(Ro(`JsonSerialize`,2,t=>{let n=gd(z(t,0,`JsonSerialize`)),r=z(t,1,`JsonSerialize`);if(!ui(r)&&!rd(r))throw jo(`second`,`JsonSerialize`,`sequence or record`,r);return bd(e,n),e.writeFile?.(n,dd(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`),Yo(Ro(`ndJsonSerialize`,2,t=>{let n=gd(z(t,0,`ndJsonSerialize`)),r=z(t,1,`ndJsonSerialize`),i=ui(r);if(!i)throw jo(`second`,`ndJsonSerialize`,`sequence`,r);return bd(e,n),e.writeFile?.(n,pd(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`),Yo(Ro(`JsonDeserialize`,1,t=>hd($u(xd(e,gd(z(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),Yo(Ro(`ndJsonDeserialize`,1,t=>Nr(xd(e,gd(z(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>hd($u(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],Cd=(e,t)=>[Yo(ts(`Serialize`,3,(n,r)=>{let i=ns(n,2,`Serialize`)(),a=rd(i);if(!a)throw jo(`third`,`ndJsonSerialize`,`sequence`,i);if(_d(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=ns(n,0,`Serialize`)(),s=ui(o);if(!s)throw jo(`first`,`Serialize`,`sequence`,o);let c=ns(n,1,`Serialize`)();if(typeof c!=`string`)throw jo(`second`,`ndJsonSerialize`,`sequence`,c);let l=Mi(a,`openOptions`);if(Ko(l)!==`TupleValue`)throw id(l,`TupleValue`);let u=_d(a,`charset`),d=L(l).range.map(e=>{if(typeof e!=`string`)throw id(e,`StringValue`);return e});return vd(u),yd(e,c,d,pd(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)`)],wd={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},Td=e=>{let n=[],r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=0,o=wn(),s=e=>n.push(e&255),c=e=>{s(e>>8),s(e)},l=e=>{c(e>>16),c(e)},u=e=>e>32767?l(-e):c(e),d=e=>{s(wd.string),l(0),l(-1),l(e.length),e.split(``).forEach(e=>s(e.charCodeAt(0)))},f=e=>{s(wd.handle),u(e)},p=e=>{if(typeof e==`boolean`){s(wd.boolean),s(+!!e);return}if(typeof e==`number`){s(wd.integer),l(e);return}if(typeof e==`string`){a++,d(e);return}if(e.kind===`ModelValue`){s(wd.modelValue),c(o.indexOf(e));return}if(e.kind===`Interval`){s(wd.interval),l(e.low),l(e.high);return}let t=r.get(e);if(t!==void 0){f(t);return}if(r.set(e,a++),P(e)){let t=I(e).elements;s(wd.set),l(t.length),t.forEach(p);return}let n=L(e),m=An(e);m===`tuple`?(s(wd.tuple),u(n.range.length),n.range.forEach(p)):m===`record`?(s(wd.record),l(n.domain.length),n.domain.forEach((e,t)=>{let r=String(e),o=i.get(r);o===void 0?(i.set(r,a++),d(r)):f(o),p(n.range[t])})):(s(wd.function),u(n.domain.length),s(1),n.domain.forEach((e,t)=>{p(e),p(n.range[t])}))};return p(e),(0,t.gzipSync)(Uint8Array.from(n))},Ed=e=>[Yo(Ro(`_TLCTraceSerialize`,2,t=>{let n=gd(z(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,Td(z(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`)],Dd=25214903917n,Od=(1n<<48n)-1n,kd=e=>{let t=(BigInt.asUintN(64,e)^Dd)&Od,n=e=>(t=t*Dd+11n&Od,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^Dd)&Od},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}},Ad=[],jd=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Md=()=>{for(let e=1277011;Ad.length<1341;e++)jd(e)&&Ad.push(e);return Ad},Nd=e=>{let t=Md(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},Pd=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},Fd=e=>{for(let t=Math.max(e,9);;t++){let e=Pd(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)}}},Id=(e,t,n)=>{if(t<=0)return[];let r=Fd(t),i=BigInt(n.nextInt(t)),a=BigInt(Nd(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},Ld=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Ct),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},Rd=(1n<<63n)-1n-24n,zd=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Rd*BigInt(n)+i)%t;return r<0n?r+t:r})},Bd=(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,Vd=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=jr(e.domain),n=I(e.range).elements;return{lists:t.map(()=>n),create:e=>Dn(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>I(e).elements),create:t=>Pr(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>I(e).elements),create:Nr}}},Hd=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,Ud=(e,t,n,r)=>{if(ni(t))return[];let i=r===`1.7.4`?Ld:Id;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=Hd(t,r)?void 0:Vd(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?zd(e,t,n):i(e,Number(t),n)).map(e=>a.create(Bd(a.lists,e)))}let o=I(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},Wd=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[...Mo(t.domain,`RandomElement`,t).elements];return Dn(e,e.map(()=>Wd(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return Pr(t.names.map((e,r)=>[e,Wd(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return Nr(t.factors.map(e=>Wd(e,n)));if(typeof t==`object`&&t.kind===`Interval`){let r=Math.max(0,t.high-t.low+1),i=Math.floor(n.nextDouble()*r);if(i>=r)throw new e.b(`Attempted to retrieve out-of-bounds element from the interval value ${R(t)}.`);return t.low+i}let r=Mo(t,`RandomElement`).elements,i=Math.floor(n.nextDouble()*r.length);if(i>=r.length)throw new e.b(`Index ${i} out of bounds for length ${r.length}`);return r[i]},Gd=(e,t,n)=>{if(typeof e!=`number`||e<0)throw jo(t,n,`nonnegative integer`,e);return e},Kd=(e,t,n,r)=>gr(Array.from({length:t},()=>gr(e.filter(()=>r.nextDouble()<n)))),qd=(e,t)=>{let n=`RandomSetOfSubsets`,r=Gd(z(e,0,n),`first`,n),i=Gd(z(e,1,n),`second`,n),a=z(e,2,n);if(!P(a)||!F(a))throw jo(`third`,n,`finite set`,a);let o=I(a).elements;if(o.length<31&&r>2**o.length)throw jo(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw jo(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return Kd(o,r,o.length===0?0:i/o.length,t.getRandom())},Jd=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,Yd=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,Xd=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(Jd.test(t))return Number(t.replace(/[fFdD]$/,``));let n=Yd.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},Zd=e=>B(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=Gd(z(t,0,n),`first`,n),i=z(t,1,n);if(typeof i!=`string`)throw jo(`second`,n,`string literal representing a probability`,i);let a=Xd(i);if(a===void 0||a<0||a>1)throw jo(`second`,n,`string literal does not represent a parsable probability`,i);let o=z(t,2,n);if(!P(o)||pn(o)||!si(o))throw jo(`third`,n,`finite set`,o);let s=ai(o);if(32-Math.clz32(r)>s&&r>1<<s)throw jo(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return Kd(I(o).elements,r,a,e.getRandom())}),Qd=t=>[Yo(B(`RandomSubset`,2,n=>{let r=Gd(z(n,0,`RandomSubset`),`first`,`RandomSubset`),i=z(n,1,`RandomSubset`);if(!Ir(i)||!si(i))throw jo(`second`,`RandomSubset`,`a finite set`,i);let a=Hd(i,t.version);if(a&&a.reduce((e,t)=>e*I(t).elements.length,1)>Dt())throw new e.b(Ot());return gr(Ud(r,i,t.getRandom(),t.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),B(`RandomSetOfSubsets`,3,e=>qd(e,t)),B(`TestRandomSetOfSubsets`,3,e=>Nr(Array.from({length:5},()=>I(qd(e,t)).elements.length)))],$d=(e,t=0n)=>{let n=kd(t),r=kd(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Pr([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,getSuccessorAction:()=>void 0,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Ua,getSimulationValue:void 0,getRandom:()=>{let e=a?void 0:o.getCurrentState();return e===void 0?n:(e!==i&&(r.setSeed(o.getFingerprint(e)^BigInt.asUintN(64,t)),i=e),r)},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return o},ef=e=>Sr([...e.possibleCounts].map(([e,t])=>[e,t])),tf=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,ef(e)]]),nf=e=>Pr([[`name`,e??`UnnamedAction`],[`location`,Pr([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),rf=/* @__PURE__ */ new WeakSet,af=(e,t)=>{let n=Pr([[`action`,gr(e)],[`state`,gr(t)]]);return rf.add(n),n},of=(e,t,n)=>{let r=e.map((e,t)=>Nr([t+1,Pr(Object.entries(e))])),i=r.slice(1).map((e,n)=>Nr([r[n],t[n],e])),a=n?[Nr([r[r.length-1],n.action,r[n.start]])]:[];return af([...i,...a],r)},sf=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return tf(e).get(t)},cf=(t,n,r,i)=>{if(typeof r==`number`&&r>=0)t.registers.set(r,i);else if(r===`exit`)i===!0&&(t.isStopped=!0);else if(r===`pause`){if(i!==!0||!t.pause)return;n(`Press enter to resume model checking.`),t.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))t.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))t.properties.set(r.slice(2),R(i));else throw new e.k(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${R(r)}`)},lf=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:U(e),uf=e=>e.every(e=>e!==void 0),df=(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&&!j(e);if(i&&t.variableIndex.has(r))return 1;let a=ze(e).map(e=>df(e,t,n)),o=i?Lh(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(df(o.body,t,n))),Math.max(0,...a)},ff=(t,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[ts(`AssertError`,2,t=>{let r=Fo(t,0,`AssertError`).expression;if(r&&r.kind!==`String`)throw new e.b(`In computing AssertError, a non-string expression (${lf(r)}) was used as the err of an AssertError(err, exp).`);let i=ns(t,0,`AssertError`)();try{ns(t,1,`AssertError`)()}catch(t){if(t instanceof e.b)return ot(t.message,n.isTool)===i;throw t}return!1}),Ro(`TLCGetOrDefault`,2,e=>sf(n,z(e,0,`TLCGetOrDefault`))??z(e,1,`TLCGetOrDefault`)),Ro(`Trace`,0,(t,r)=>{let i=r?.environment.variables??[],a=r?.state??i.map(()=>void 0);if(!r||!uf(a)){let t=i.filter((e,t)=>a[t]===void 0);throw new e.b(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${t.length>1?`s`:``} ${t.join(`, `)} undefined).`)}return r.state?Nr(n.getBehavior(a).map(e=>{let t=r.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return Pr(i===void 0?t:[[`_action`,i],...t])})):Nr([Pr([])])}),Ro(`CounterExample`,0,()=>n.counterExample??af([],[])),B(`ToTrace`,1,t=>{let n=z(t,0,`ToTrace`);if(typeof n!=`object`||!rf.has(n))throw new e.k(`The argument of ToTrace should be a CounterExample, but instead it is:\n${R(n)}`);let r=I(Mi(n,`state`)).elements.map(e=>ui(e)??[]);return Nr(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),B(`TLCModelValue`,1,t=>{let n=z(t,0,`TLCModelValue`);if(typeof n!=`string`)throw new e.k(`The argument of ModelValue should be a string, but instead it is:\n${R(n)}`);return Cn(n)}),ts(`TLCDefer`,1,(e,t)=>{let r=Fo(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{W(r,{...t,next:e})}),!0}),B(`TLCNoOp`,1,e=>z(e,0,`TLCNoOp`)),{...ts(`PickSuccessor`,1,(r,i)=>{let a=i?.next??(i?.environment.variables??[]).map(()=>void 0);if(!uf(a)||i?.next&&n.isSeen(a))return!0;let o=Fo(r,0,`PickSuccessor`),s=o.call([]);if(typeof s!=`boolean`)throw new e.b(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${qo(s)}) was used as the condition of an IF.\n${o.expression?lf(o.expression):``}`);if(s||!i?.next||!i.state||!uf(i.state))return!0;let c=n.getSuccessorAction(i.state,a);throw t(Xe(n.isTool,qe.moduleOverrideStdout,Je.none,`Extend behavior of length ${n.getLevel(i.state)} with a "${c?.name}" step [<Action ${c?.location.range&&e.X(c.location.range)}>]? (Yes/no/explored/states/diff):`)),new e.v}),isActionLevel:!0},ts(`TLCCache`,2,(e,t)=>{let i=Fo(e,0,`TLCCache`),o=$i(ns(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=df(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}),B(`TLCFP`,1,e=>{let t=z(e,0,`TLCFP`),n=Wi(t);if(n)throw n;return Number(BigInt.asIntN(32,Ua([t])))}),ts(`TLCEvalDefinition`,1,(t,n)=>{let r=ns(t,0,`TLCEvalDefinition`)();if(typeof r!=`string`)throw new e.k(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${R(r)}`);let i=n?Lh(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 e.k(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${R(r)}`);if(i.kind===`Operator`&&i.params.length>0){let t=i.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new e.k(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${r}(${t.join(`, `)})`)}return i.kind===`Operator`?W(i.body,n):W({kind:`Identifier`,name:r,location:i.location},n)})]},pf=(e,t)=>[Ro(`_Track`,2,e=>{let n=String(z(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,z(e,0,`_Track`)===!0?r+1:r),!0}),Ro(`_Counts`,0,()=>ef(t)),Ro(`_CheckName`,1,n=>{let r=String(z(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(R(ef(t),!0)),!1)}),Ro(`_PrintCounts`,0,()=>(e(R(ef(t),!0)),!0))],mf=e=>`${e.getUTCFullYear()}.${st(e.getUTCMonth()+1)}.${st(e.getUTCDate())}.${st(e.getUTCHours())}${st(e.getUTCMinutes())}${st(e.getUTCSeconds())}`,hf=e=>Sr([...e].map(([e,t])=>[e,Nr([t])])),gf=e=>kn(Cr(e),`record`),_f=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),vf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),yf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),bf=(t,n,r)=>{if(t.version===`1.7.4`?!vf.has(n)||!t.isStarted&&yf.has(n):!t.isStarted&&_f.has(n))throw new e.k(`TLCGet(${n}) was undefined.`);let i=t.getSimulationValue?.(n,r);if(i!==void 0)return i;let a=Math.floor((Date.now()-t.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:t.getLevel(r);case`diameter`:return t.diameter;case`generated`:return t.generatedStates;case`distinct`:return t.distinctStates;case`queue`:return t.queueSize;case`duration`:return a;case`stats`:return gf([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,a],[`worker`,0]]);case`config`:return gf([[`mode`,`bfs`],[`deadlock`,t.checkDeadlock],[`worker`,1],[`seed`,String(t.seed)],[`fingerprint`,String(BigInt.asIntN(64,_a()))],[`install`,`unknown`]]);case`revision`:{let e=/* @__PURE__ */ new Date;return gf([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,un(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,un(mf(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return nf(void 0);case`all`:return hf(t.registers);case`all:named`:return hf(tf(t))}if(n.startsWith(`s:`)){let r=tf(t).get(n);if(r===void 0)throw new e.k(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return un(t.properties.get(n.slice(2))??n);throw new e.k(`TLCGet(${n}) was undefined.`)},xf=(t,n,r)=>{if(typeof n==`number`&&n>=0){let r=t.registers.get(n);if(r===void 0)throw new e.k(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new e.k(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${R(n)}`);return bf(t,n,r?.state)},Sf=e=>e.length===0?[[]]:e.flatMap((t,n)=>Sf([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Cf=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&I(e).elements.forEach(Cf),e.kind===`Function`&&e.range.forEach(Cf))},wf=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 L(e);default:return I(e)}},Tf=(t,n)=>[B(`Print`,2,e=>(t(ua([z(e,0,`Print`),z(e,1,`Print`)]).map(M).join(` `)),z(e,1,`Print`))),B(`PrintT`,1,e=>(t(M(ua([z(e,0,`PrintT`)])[0])),!0)),B(`Assert`,2,t=>{if(z(t,0,`Assert`)!==!0)throw new e.k(`The first argument of Assert evaluated to FALSE; the second argument was:\n${M(R(z(t,1,`Assert`)))}`,e.nt.assertViolation);return!0}),B(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),B(`:>`,2,e=>Sr([[z(e,0,`:>`),z(e,1,`:>`)]])),B(`@@`,2,e=>{let t=z(e,0,`@@`),n=z(e,1,`@@`),r=Nt(t)?L(t):void 0,i=Nt(n)?L(n):void 0;if(!r)throw jo(`first`,`@@`,`function`,t);if(!i)throw jo(`second`,`@@`,`function`,n);let a=Vt(r),o=Vt(i).filter(e=>!a.some(t=>pr(e[0],t[0])));return Cr([...a,...o])}),B(`ToString`,1,e=>un(R(z(e,0,`ToString`),!0))),{...ts(`TLCEval`,1,(e,t)=>{let n=wf(ns(e,0,`TLCEval`)());return t===void 0&&Cf(n),n}),isStateLevel:!1},B(`Permutations`,1,e=>{let t=Mo(z(e,0,`Permutations`),`Permutations`).elements;return gr(Sf(t).map(e=>Sr(t.map((t,n)=>[t,e[n]]))))}),Lo(`SortSeq`,2,e=>{let t=z(e,0,`SortSeq`),n=ui(t);if(!n)throw jo(`first`,`SortSeq`,`natural number`,t);let r=Fo(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw jo(`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)}),Nr(a)}),n.version===`1.7.4`?Yo({...Ro(`TLCGet`,1,(e,t)=>xf(n,z(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Yo(ts(`TLCGet`,1,(e,t)=>xf(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)`),Ro(`TLCSet`,2,e=>(cf(n,t,z(e,0,`TLCSet`),z(e,1,`TLCSet`)),!0)),Io(`Any`,_n),B(`RandomElement`,1,e=>Wd(z(e,0,`RandomElement`),n.getRandom()))],Ef=/* @__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(`,`),Df=[[`\\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`,`≀`],[`^+`,`⁺`]],Of=/* @__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(`,`),kf=/* @__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(`.`),Af=/* @__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(`.`),jf=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
87
|
+
`&&(i++,a=r)}throw m(`Unterminated string`)},ie=()=>{let e=r;for(;r<t.length&&_(t[r]);)r++;return t.slice(e,r)},w=t=>{if(l.length-1>=255)throw new e.b(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${p()}`);l.push(t),u.push(void 0),d.push(0),s=H.none},T=()=>{l.pop(),u.pop(),d.pop(),d[l.length-1]++,s=H.none},ae=()=>{let e=S();return e!==H.endObject&&e!==H.endArray&&e!==H.eof},oe=()=>{let e=S(),t=e===H.unquotedName?ie():C(e===H.singleQuotedName?`'`:`"`);return s=H.none,u[l.length-1]=t,t},se=e=>e===H.true||e===H.false?e===H.true:e===H.null?null:e===H.number?(r+=c,{literal:t.slice(r-c,r)}):e===H.unquoted?ie():C(e===H.singleQuoted?`'`:`"`),ce=()=>{let e=S();if(e===H.beginArray){w(Ju.emptyArray);let e=[];for(;ae();)e.push(ce());return T(),e}if(e===H.beginObject){w(Ju.emptyObject);let e=/* @__PURE__ */ new Map;for(;ae();)e.set(oe(),ce());return T(),e}let t=se(e);return s=H.none,d[l.length-1]++,t};if(S()===H.eof)return null;let le=ce();return o=!1,le!==null&&S(),le},ed=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),td=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),nd=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),rd=e=>{if(!Nt(e))return;let t=L(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?Pr(n):void 0},id=(t,n)=>{let r=`tlc2.value.impl.${Ko(t)}`,i=`tlc2.value.impl.${n}`;return new e.b(`class ${r} cannot be cast to class ${i} (${r} and ${i} are in unnamed module of loader 'app')`)},ad=t=>new e.b(`Cannot convert value: unsupported value type tlc2.value.impl.${Ko(t)}`),od=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),sd=e=>`[${e.map(dd).join(`,`)}]`,cd=e=>`{${Ht(e).map(e=>`${od(typeof e[0]==`string`?e[0]:R(e[0]))}:${dd(e[1])}`).join(`,`)}}`,ld=e=>{let t=L(e),n=ui(t);return n?sd(n):cd(t)},ud=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,dd=e=>typeof e==`string`?od(e):typeof e==`object`?e.kind===`ModelValue`?od(e.name):Ko(e)===`RecordValue`?cd(L(e)):fd(e):String(e),fd=e=>{let t=Ko(e);if(t===`TupleValue`)return sd(L(e).range);if(ud(t))return ld(e);if(Ir(e))return sd(I(e).elements);throw ad(e)},pd=e=>e.map(e=>`${dd(e)}\n`).join(``),md=e=>{let t=Ko(e);if(t===`RecordValue`)return cd(L(e));if(t===`TupleValue`)return`{${L(e).range.map((e,t)=>`"${t}":${dd(e)}`).join(`,`)}}`;if(ud(t))return ld(e);throw ad(e)},hd=t=>{if(t===null)throw new e.b(`Cannot convert value: unsupported JSON value null`);if(typeof t==`boolean`)return t;if(typeof t==`string`)return un(t);if(Array.isArray(t))return Nr(t.map(hd));if(t instanceof Map)return Pr([...t].map(e=>[un(e[0]),hd(e[1])]));let n=Number(t.literal);if(!/^-?\d+$/.test(t.literal)||Bo(n))throw new e.b(`Cannot convert value: expected a 32-bit integer JSON number, but found ${t.literal}`);return n||0},gd=t=>{if(typeof t!=`string`)throw new e.b(`Cannot cast tlc2.value.impl.${Ko(t)} to tlc2.value.impl.StringValue`);return t},_d=(e,t)=>{let n=Mi(e,t);if(typeof n!=`string`)throw id(n,`StringValue`);return n},vd=t=>{if(!td.has(t.toLowerCase()))throw nd.has(t.toLowerCase())?new e.B(`IOUtils!Serialize does not support the charset ${t}`):new e.b(/^[a-zA-Z\d][\w.:+-]*$/.test(t)?`java.nio.charset.UnsupportedCharsetException: ${t}`:`java.nio.charset.IllegalCharsetNameException: ${t}`)},yd=(t,n,r,i)=>{let a=r.find(e=>!ed.has(e));if(a!==void 0)throw new e.b(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${a}`);if(r.includes(`READ`))throw new e.b(`java.lang.IllegalArgumentException: READ not allowed`);let o=new Set(r.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:r);if(o.has(`APPEND`)&&o.has(`TRUNCATE_EXISTING`))throw new e.b(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(o.has(`DELETE_ON_CLOSE`))throw new e.B(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let s=t.readFile?.(n);if(s===void 0&&!o.has(`CREATE`)&&!o.has(`CREATE_NEW`))throw new e.b(`java.nio.file.NoSuchFileException: ${n}`);if(s!==void 0&&o.has(`CREATE_NEW`))throw new e.b(`java.nio.file.FileAlreadyExistsException: ${n}`);s===void 0||o.has(`TRUNCATE_EXISTING`)?t.writeFile?.(n,i):t.writeFile?.(n,o.has(`APPEND`)?s+i:i+s.slice(i.length))},bd=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},xd=(t,n)=>{let r=t.readFile?.(n);if(r===void 0)throw new e.b(`${n} (No such file or directory)`);return r},Sd=e=>[Yo(Ro(`ToJson`,1,e=>un(dd(z(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),Yo(Ro(`ToJsonArray`,1,e=>un(fd(z(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),Yo(Ro(`ToJsonObject`,1,e=>un(md(z(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),Yo(Ro(`JsonSerialize`,2,t=>{let n=gd(z(t,0,`JsonSerialize`)),r=z(t,1,`JsonSerialize`);if(!ui(r)&&!rd(r))throw jo(`second`,`JsonSerialize`,`sequence or record`,r);return bd(e,n),e.writeFile?.(n,dd(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`),Yo(Ro(`ndJsonSerialize`,2,t=>{let n=gd(z(t,0,`ndJsonSerialize`)),r=z(t,1,`ndJsonSerialize`),i=ui(r);if(!i)throw jo(`second`,`ndJsonSerialize`,`sequence`,r);return bd(e,n),e.writeFile?.(n,pd(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`),Yo(Ro(`JsonDeserialize`,1,t=>hd($u(xd(e,gd(z(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),Yo(Ro(`ndJsonDeserialize`,1,t=>Nr(xd(e,gd(z(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>hd($u(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],Cd=(e,t)=>[Yo(ts(`Serialize`,3,(n,r)=>{let i=ns(n,2,`Serialize`)(),a=rd(i);if(!a)throw jo(`third`,`ndJsonSerialize`,`sequence`,i);if(_d(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=ns(n,0,`Serialize`)(),s=ui(o);if(!s)throw jo(`first`,`Serialize`,`sequence`,o);let c=ns(n,1,`Serialize`)();if(typeof c!=`string`)throw jo(`second`,`ndJsonSerialize`,`sequence`,c);let l=Mi(a,`openOptions`);if(Ko(l)!==`TupleValue`)throw id(l,`TupleValue`);let u=_d(a,`charset`),d=L(l).range.map(e=>{if(typeof e!=`string`)throw id(e,`StringValue`);return e});return vd(u),yd(e,c,d,pd(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)`)],wd={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},Td=e=>{let n=[],r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=0,o=wn(),s=e=>n.push(e&255),c=e=>{s(e>>8),s(e)},l=e=>{c(e>>16),c(e)},u=e=>e>32767?l(-e):c(e),d=e=>{s(wd.string),l(0),l(-1),l(e.length),e.split(``).forEach(e=>s(e.charCodeAt(0)))},f=e=>{s(wd.handle),u(e)},p=e=>{if(typeof e==`boolean`){s(wd.boolean),s(+!!e);return}if(typeof e==`number`){s(wd.integer),l(e);return}if(typeof e==`string`){a++,d(e);return}if(e.kind===`ModelValue`){s(wd.modelValue),c(o.indexOf(e));return}if(e.kind===`Interval`){s(wd.interval),l(e.low),l(e.high);return}let t=r.get(e);if(t!==void 0){f(t);return}if(r.set(e,a++),P(e)){let t=I(e).elements;s(wd.set),l(t.length),t.forEach(p);return}let n=L(e),m=An(e);m===`tuple`?(s(wd.tuple),u(n.range.length),n.range.forEach(p)):m===`record`?(s(wd.record),l(n.domain.length),n.domain.forEach((e,t)=>{let r=String(e),o=i.get(r);o===void 0?(i.set(r,a++),d(r)):f(o),p(n.range[t])})):(s(wd.function),u(n.domain.length),s(1),n.domain.forEach((e,t)=>{p(e),p(n.range[t])}))};return p(e),(0,t.gzipSync)(Uint8Array.from(n))},Ed=e=>[Yo(Ro(`_TLCTraceSerialize`,2,t=>{let n=gd(z(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,Td(z(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`)],Dd=25214903917n,Od=(1n<<48n)-1n,kd=e=>{let t=(BigInt.asUintN(64,e)^Dd)&Od,n=e=>(t=t*Dd+11n&Od,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^Dd)&Od},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}},Ad=[],jd=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Md=()=>{for(let e=1277011;Ad.length<1341;e++)jd(e)&&Ad.push(e);return Ad},Nd=e=>{let t=Md(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},Pd=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},Fd=e=>{for(let t=Math.max(e,9);;t++){let e=Pd(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)}}},Id=(e,t,n)=>{if(t<=0)return[];let r=Fd(t),i=BigInt(n.nextInt(t)),a=BigInt(Nd(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},Ld=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Ct),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},Rd=(1n<<63n)-1n-24n,zd=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Rd*BigInt(n)+i)%t;return r<0n?r+t:r})},Bd=(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,Vd=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=jr(e.domain),n=I(e.range).elements;return{lists:t.map(()=>n),create:e=>Dn(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>I(e).elements),create:t=>Pr(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>I(e).elements),create:Nr}}},Hd=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,Ud=(e,t,n,r)=>{if(ni(t))return[];let i=r===`1.7.4`?Ld:Id;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=Hd(t,r)?void 0:Vd(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?zd(e,t,n):i(e,Number(t),n)).map(e=>a.create(Bd(a.lists,e)))}let o=I(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},Wd=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[...Mo(t.domain,`RandomElement`,t).elements];return Dn(e,e.map(()=>Wd(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return Pr(t.names.map((e,r)=>[e,Wd(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return Nr(t.factors.map(e=>Wd(e,n)));if(typeof t==`object`&&t.kind===`Interval`){let r=Math.max(0,t.high-t.low+1),i=Math.floor(n.nextDouble()*r);if(i>=r)throw new e.b(`Attempted to retrieve out-of-bounds element from the interval value ${R(t)}.`);return t.low+i}let r=Mo(t,`RandomElement`).elements,i=Math.floor(n.nextDouble()*r.length);if(i>=r.length)throw new e.b(`Index ${i} out of bounds for length ${r.length}`);return r[i]},Gd=(e,t,n)=>{if(typeof e!=`number`||e<0)throw jo(t,n,`nonnegative integer`,e);return e},Kd=(e,t,n,r)=>gr(Array.from({length:t},()=>gr(e.filter(()=>r.nextDouble()<n)))),qd=(e,t)=>{let n=`RandomSetOfSubsets`,r=Gd(z(e,0,n),`first`,n),i=Gd(z(e,1,n),`second`,n),a=z(e,2,n);if(!P(a)||!F(a))throw jo(`third`,n,`finite set`,a);let o=I(a).elements;if(o.length<31&&r>2**o.length)throw jo(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw jo(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return Kd(o,r,o.length===0?0:i/o.length,t.getRandom())},Jd=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,Yd=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,Xd=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(Jd.test(t))return Number(t.replace(/[fFdD]$/,``));let n=Yd.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},Zd=e=>B(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=Gd(z(t,0,n),`first`,n),i=z(t,1,n);if(typeof i!=`string`)throw jo(`second`,n,`string literal representing a probability`,i);let a=Xd(i);if(a===void 0||a<0||a>1)throw jo(`second`,n,`string literal does not represent a parsable probability`,i);let o=z(t,2,n);if(!P(o)||pn(o)||!si(o))throw jo(`third`,n,`finite set`,o);let s=ai(o);if(32-Math.clz32(r)>s&&r>1<<s)throw jo(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return Kd(I(o).elements,r,a,e.getRandom())}),Qd=t=>[Yo(B(`RandomSubset`,2,n=>{let r=Gd(z(n,0,`RandomSubset`),`first`,`RandomSubset`),i=z(n,1,`RandomSubset`);if(!Ir(i)||!si(i))throw jo(`second`,`RandomSubset`,`a finite set`,i);let a=Hd(i,t.version);if(a&&a.reduce((e,t)=>e*I(t).elements.length,1)>Dt())throw new e.b(Ot());return gr(Ud(r,i,t.getRandom(),t.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),B(`RandomSetOfSubsets`,3,e=>qd(e,t)),B(`TestRandomSetOfSubsets`,3,e=>Nr(Array.from({length:5},()=>I(qd(e,t)).elements.length)))],$d=(e,t=0n)=>{let n=kd(t),r=kd(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Pr([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,getSuccessorAction:()=>void 0,toRecord:()=>({}),setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Ua,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},ef=e=>Sr([...e.possibleCounts].map(([e,t])=>[e,t])),tf=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,ef(e)]]),nf=e=>Pr([[`name`,e??`UnnamedAction`],[`location`,Pr([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),rf=/* @__PURE__ */ new WeakSet,af=(e,t)=>{let n=Pr([[`action`,gr(e)],[`state`,gr(t)]]);return rf.add(n),n},of=(e,t,n)=>{let r=e.map((e,t)=>Nr([t+1,Pr(Object.entries(e))])),i=r.slice(1).map((e,n)=>Nr([r[n],t[n],e])),a=n?[Nr([r[r.length-1],n.action,r[n.start]])]:[];return af([...i,...a],r)},sf=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return tf(e).get(t)},cf=(t,n,r,i)=>{if(typeof r==`number`&&r>=0)t.registers.set(r,i);else if(r===`exit`)i===!0&&(t.isStopped=!0);else if(r===`pause`){if(i!==!0||!t.pause)return;n(`Press enter to resume model checking.`),t.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))t.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))t.properties.set(r.slice(2),R(i));else throw new e.k(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${R(r)}`)},lf=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:U(e),uf=e=>e.every(e=>e!==void 0),df=(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&&!j(e);if(i&&t.variableIndex.has(r))return 1;let a=ze(e).map(e=>df(e,t,n)),o=i?Lh(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(df(o.body,t,n))),Math.max(0,...a)},ff=(t,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[ts(`AssertError`,2,t=>{let r=Fo(t,0,`AssertError`).expression;if(r&&r.kind!==`String`)throw new e.b(`In computing AssertError, a non-string expression (${lf(r)}) was used as the err of an AssertError(err, exp).`);let i=ns(t,0,`AssertError`)();try{ns(t,1,`AssertError`)()}catch(t){if(t instanceof e.b)return ot(t.message,n.isTool)===i;throw t}return!1}),Ro(`TLCGetOrDefault`,2,e=>sf(n,z(e,0,`TLCGetOrDefault`))??z(e,1,`TLCGetOrDefault`)),Ro(`Trace`,0,(t,r)=>{let i=r?.environment.variables??[],a=r?.state??i.map(()=>void 0);if(!r||!uf(a)){let t=i.filter((e,t)=>a[t]===void 0);throw new e.b(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${t.length>1?`s`:``} ${t.join(`, `)} undefined).`)}return r.state?Nr(n.getBehavior(a).map(e=>{let t=r.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return Pr(i===void 0?t:[[`_action`,i],...t])})):Nr([Pr([])])}),Ro(`CounterExample`,0,()=>n.counterExample??af([],[])),B(`ToTrace`,1,t=>{let n=z(t,0,`ToTrace`);if(typeof n!=`object`||!rf.has(n))throw new e.k(`The argument of ToTrace should be a CounterExample, but instead it is:\n${R(n)}`);let r=I(Mi(n,`state`)).elements.map(e=>ui(e)??[]);return Nr(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),B(`TLCModelValue`,1,t=>{let n=z(t,0,`TLCModelValue`);if(typeof n!=`string`)throw new e.k(`The argument of ModelValue should be a string, but instead it is:\n${R(n)}`);return Cn(n)}),ts(`TLCDefer`,1,(e,t)=>{let r=Fo(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{W(r,{...t,next:e})}),!0}),B(`TLCNoOp`,1,e=>z(e,0,`TLCNoOp`)),{...ts(`PickSuccessor`,1,(r,i)=>{let a=i?.next??(i?.environment.variables??[]).map(()=>void 0);if(!uf(a)||i?.next&&n.isSeen(a))return!0;let o=Fo(r,0,`PickSuccessor`),s=o.call([]);if(typeof s!=`boolean`)throw new e.b(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${qo(s)}) was used as the condition of an IF.\n${o.expression?lf(o.expression):``}`);if(s||!i?.next||!i.state||!uf(i.state))return!0;let c=i.state,l=n.getSuccessorAction(c,a),u=e=>t(Xe(n.isTool,qe.moduleOverrideStdout,Je.none,e));for(;;){u(`Extend behavior of length ${n.getLevel(c)} with a "${l?.name}" step [<Action ${l?.location.range&&e.X(l.location.range)}>]? (Yes/no/explored/states/diff):`);let t=n.readLine?.();if(t===void 0)throw new e.v;if(/^[\0-\x20]*$/.test(t)||t.toLowerCase().startsWith(`y`))return!0;if(t[0]===`s`)u(`${ma(n.toRecord(c)).trimEnd()}\n~>\n${ma(n.toRecord(a)).trimEnd()}`);else if(t[0]===`d`)u(ma(n.toRecord(a),n.toRecord(c)));else if(t[0]===`e`){if(n.getSimulationValue===void 0)throw new e.B(`tla-ts can't mark a state explored while it checks a model.`);u(`Marking a state explored is unsupported by the current TLC mode. Is TLC running in simulation mode?`)}else if(t[0]===`n`)return!1}}),isActionLevel:!0},ts(`TLCCache`,2,(e,t)=>{let i=Fo(e,0,`TLCCache`),o=$i(ns(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=df(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}),B(`TLCFP`,1,e=>{let t=z(e,0,`TLCFP`),n=Wi(t);if(n)throw n;return Number(BigInt.asIntN(32,Ua([t])))}),ts(`TLCEvalDefinition`,1,(t,n)=>{let r=ns(t,0,`TLCEvalDefinition`)();if(typeof r!=`string`)throw new e.k(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${R(r)}`);let i=n?Lh(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 e.k(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${R(r)}`);if(i.kind===`Operator`&&i.params.length>0){let t=i.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new e.k(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${r}(${t.join(`, `)})`)}return i.kind===`Operator`?W(i.body,n):W({kind:`Identifier`,name:r,location:i.location},n)})]},pf=(e,t)=>[Ro(`_Track`,2,e=>{let n=String(z(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,z(e,0,`_Track`)===!0?r+1:r),!0}),Ro(`_Counts`,0,()=>ef(t)),Ro(`_CheckName`,1,n=>{let r=String(z(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(R(ef(t),!0)),!1)}),Ro(`_PrintCounts`,0,()=>(e(R(ef(t),!0)),!0))],mf=e=>`${e.getUTCFullYear()}.${st(e.getUTCMonth()+1)}.${st(e.getUTCDate())}.${st(e.getUTCHours())}${st(e.getUTCMinutes())}${st(e.getUTCSeconds())}`,hf=e=>Sr([...e].map(([e,t])=>[e,Nr([t])])),gf=e=>kn(Cr(e),`record`),_f=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),vf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),yf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),bf=(t,n,r)=>{if(t.version===`1.7.4`?!vf.has(n)||!t.isStarted&&yf.has(n):!t.isStarted&&_f.has(n))throw new e.k(`TLCGet(${n}) was undefined.`);let i=t.getSimulationValue?.(n,r);if(i!==void 0)return i;let a=Math.floor((Date.now()-t.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:t.getLevel(r);case`diameter`:return t.diameter;case`generated`:return t.generatedStates;case`distinct`:return t.distinctStates;case`queue`:return t.queueSize;case`duration`:return a;case`stats`:return gf([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,a],[`worker`,0]]);case`config`:return gf([[`mode`,`bfs`],[`deadlock`,t.checkDeadlock],[`worker`,1],[`seed`,String(t.seed)],[`fingerprint`,String(BigInt.asIntN(64,_a()))],[`install`,`unknown`]]);case`revision`:{let e=/* @__PURE__ */ new Date;return gf([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,un(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,un(mf(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return nf(void 0);case`all`:return hf(t.registers);case`all:named`:return hf(tf(t))}if(n.startsWith(`s:`)){let r=tf(t).get(n);if(r===void 0)throw new e.k(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return un(t.properties.get(n.slice(2))??n);throw new e.k(`TLCGet(${n}) was undefined.`)},xf=(t,n,r)=>{if(typeof n==`number`&&n>=0){let r=t.registers.get(n);if(r===void 0)throw new e.k(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new e.k(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${R(n)}`);return bf(t,n,r?.state)},Sf=e=>e.length===0?[[]]:e.flatMap((t,n)=>Sf([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Cf=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&I(e).elements.forEach(Cf),e.kind===`Function`&&e.range.forEach(Cf))},wf=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 L(e);default:return I(e)}},Tf=(t,n)=>[B(`Print`,2,e=>(t(ua([z(e,0,`Print`),z(e,1,`Print`)]).map(M).join(` `)),z(e,1,`Print`))),B(`PrintT`,1,e=>(t(M(ua([z(e,0,`PrintT`)])[0])),!0)),B(`Assert`,2,t=>{if(z(t,0,`Assert`)!==!0)throw new e.k(`The first argument of Assert evaluated to FALSE; the second argument was:\n${M(R(z(t,1,`Assert`)))}`,e.nt.assertViolation);return!0}),B(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),B(`:>`,2,e=>Sr([[z(e,0,`:>`),z(e,1,`:>`)]])),B(`@@`,2,e=>{let t=z(e,0,`@@`),n=z(e,1,`@@`),r=Nt(t)?L(t):void 0,i=Nt(n)?L(n):void 0;if(!r)throw jo(`first`,`@@`,`function`,t);if(!i)throw jo(`second`,`@@`,`function`,n);let a=Vt(r),o=Vt(i).filter(e=>!a.some(t=>pr(e[0],t[0])));return Cr([...a,...o])}),B(`ToString`,1,e=>un(R(z(e,0,`ToString`),!0))),{...ts(`TLCEval`,1,(e,t)=>{let n=wf(ns(e,0,`TLCEval`)());return t===void 0&&Cf(n),n}),isStateLevel:!1},B(`Permutations`,1,e=>{let t=Mo(z(e,0,`Permutations`),`Permutations`).elements;return gr(Sf(t).map(e=>Sr(t.map((t,n)=>[t,e[n]]))))}),Lo(`SortSeq`,2,e=>{let t=z(e,0,`SortSeq`),n=ui(t);if(!n)throw jo(`first`,`SortSeq`,`natural number`,t);let r=Fo(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw jo(`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)}),Nr(a)}),n.version===`1.7.4`?Yo({...Ro(`TLCGet`,1,(e,t)=>xf(n,z(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Yo(ts(`TLCGet`,1,(e,t)=>xf(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)`),Ro(`TLCSet`,2,e=>(cf(n,t,z(e,0,`TLCSet`),z(e,1,`TLCSet`)),!0)),Io(`Any`,_n),B(`RandomElement`,1,e=>Wd(z(e,0,`RandomElement`),n.getRandom()))],Ef=/* @__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(`,`),Df=[[`\\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`,`≀`],[`^+`,`⁺`]],Of=/* @__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(`,`),kf=/* @__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(`.`),Af=/* @__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(`.`),jf=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
88
88
|
Nat == { }
|
|
89
89
|
a+b == {a, b}
|
|
90
90
|
a-b == CHOOSE n : b + n = a
|
|
@@ -1785,9 +1785,9 @@ _TEPosition ==
|
|
|
1785
1785
|
`,set:`
|
|
1786
1786
|
`},Gx=(t,n,r,i=`Proof.Parser`)=>new e.F(t,void 0,{reason:`${t}${r.set}`,line:n.start.line,column:n.start.column,isEnd:!1,proof:{stop:n.stop,exception:i,printed:`${t}${r.printed}`}}),Kx=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),qx=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),Jx=/* @__PURE__ */ new Set([`NEW`,...qx.keys()]),Yx=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Xx=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Zx=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Qx=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?vx.has(e.operator):wx.has(e.operator)),$x=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,eS=e=>vx.has(e)||wx.has(e)||e===`-.`,tS=(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}}},nS=(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(`
|
|
1787
1787
|
`)}\n`},rS=(t,n,r=re(t,n===`tlapm`))=>{let i=n===`tlapm`,a=i?r:r.map(x),o=0,s=[],l,u,d=[],f=/* @__PURE__ */ new Set,p=[],m=[],h,g=0,_=[],v=/* @__PURE__ */ new WeakMap,y=e=>d[d.length-1].has(e),b=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),ee=[],te=[],ne=[],S=(e,t=o-1)=>{let n=e===t?ne[e]:void 0;if(n)return n;let r=a[t];ee[e]??=b(a[e]),te[t]??={line:r.line,column:r.endColumn};let i={module:m[0].name,start:ee[e],end:te[t]};return e===t&&(ne[e]=i),i},C=(e,t)=>(e.location.range=S(t),e),ie=(e=0)=>a[Math.min(o+e,a.length-1)],w=(e=0)=>{let t=ie(e),n=s[s.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},T=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ae=e=>i&&(e.kind===`Keyword`||Zx.has(e.text)),oe=e=>{let t=a.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},se=e=>e.kind===`End`?`EOF`:/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Ix.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:ae(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,ce=(t,n=ie(),r)=>{let i=a[a.length-1],o=n.line===i.line&&n.column===i.column,s=new e.F(`${t} at line ${n.line}, column ${n.column}`,void 0,le(t,n,o,r));return h!==void 0&&v.set(s,h),s},le=(e,t,n,r)=>{if(!i)return{reason:e,line:t.line,column:t.column,isEnd:n};let o=a[_[0]-1],s=r?`Unexpected ${se(r)}`:e;if(o)return{reason:s,line:o.line,column:o.endColumn+1,isEnd:n};let c=r?oe(r):t;return{reason:s,line:c.line,column:c.column,isEnd:n}},ue=(e,t=ie())=>ce(e,t,t),de=t=>{let n={cursor:o,frame:h,restorePoints:_.length,offsideColumns:s.length,recursiveScopes:d.length},r=++g;h=r;try{let e=t();return h=n.frame,e}catch(t){if(!(t instanceof e.F)||v.get(t)!==r)throw t;o=n.cursor,h=n.frame,_.length=n.restorePoints,s.length=n.offsideColumns,d.length=n.recursiveScopes;return}},fe=e=>{let t=h;h=void 0;let n=e();return h=t,n},pe=e=>{_.push(o);let t=e();return _.pop(),t},me=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ae(e),E=(e,t=0)=>{let n=w(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},D=()=>{let e=w();if(e.kind===`End`)throw ue(`Unexpected end of expression`);return o++,e},O=e=>E(e)?(o++,!0):!1,k=e=>{if(!E(e))throw ue(`Expected ${JSON.stringify(e)} but found ${T(w())}`);return D()},he=()=>{let e=w();if(e.kind!==`Identifier`)throw ue(`Expected an identifier but found ${T(e)}`);if(ae(e))throw ue(`Unexpected keyword ${e.text}`);return o++,e.text},ge=()=>{let e=o;return{name:he(),range:S(e)}},_e=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),ve=()=>{let e=w();return e.kind!==`String`&&(Dx.has(e.text)||vx.has(e.text)||Tx.has(e.text))?(o++,e.text):he()},ye=!1,be=()=>w().kind===`Identifier`||!me(w())?he():(ye=!0,D().text),xe=e=>{if(!i)return e();s.push(-1);let t=e();return s.pop(),t},A=(e,t=`,`)=>{let n=[e()];for(;O(t);)n.push(e());return n},Se=(e=0)=>{if(E(`<<`,e)){let t=e+1;for(;w(t).kind===`Identifier`||E(`,`,t);)t++;return E(`>>`,t)&&E(`\\in`,t+1)}let t=e;for(;w(t).kind===`Identifier`;){if(E(`\\in`,t+1))return!0;if(!E(`,`,t+1))return!1;t+=2}return!1},Ce=()=>{if(E(`::`))return!0;if(!E(`(`))return!1;let e=1;for(;w(e).kind===`Identifier`&&E(`,`,e+1);)e+=2;return w(e).kind===`Identifier`&&E(`)`,e+1)&&E(`::`,e+2)},we=()=>{if(!O(`<<`)){let e=ge();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=_e(E(`>>`)?[]:A(ge));return k(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Te=()=>{let e=()=>{let e=A(we);k(`\\in`);let t=fe(N);return e.map(e=>({pattern:e,set:t}))},t=[e()];for(;E(`,`)&&(!i||Se(1));)D(),t.push(e());return t.flat()},Ee=()=>{let e=w();if(i&&Zx.has(e.text)){let t=o;D();let n={kind:`Identifier`,name:e.text,location:b(e)};return{subscript:C(n,t),lastArgs:[]}}let t=i&&(e.kind===`Number`||e.kind===`String`||E(`@`));if(e.kind===`Identifier`){let t=o,n=[],r=[],a=e=>(r.push(S(o,o)),n.push(he()),e&&E(`(`)?je():[]),s=[a(!i)];for(;E(`!`)&&w(1).kind===`Identifier`;)D(),s.push(a(!0));let c=s.slice(0,-1),l=b(e);l.range={...S(t),end:r[r.length-1].end};let u=n.join(`!`);return{subscript:c.every(e=>e.length===0)?{kind:`Identifier`,name:u,location:l}:{kind:`Apply`,operator:u,args:c.flat(),argumentCounts:[...c.map(e=>e.length),0],argumentsRange:l.range,selectorRanges:r,location:l},lastArgs:s[s.length-1]}}if(E(`<<`)||E(`(`)||E(`{`)||E(`[`)||t){let e=o,t=j();return{subscript:t.location.range?t:C(t,e),lastArgs:[]}}throw ue(`Expected a subscript but found ${T(e)}`)},De=e=>{let t=w(1),n=w(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(`==`,Tx.has(n.text)?3:4))},Oe=e=>{let t=w(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||E(`,`,1)||E(`)`,1)||t.kind===`Keyword`&&Mx.has(t.text)||De(e)},ke=()=>{let e=w(),t=e.kind===`Operator`&&(vx.has(e.text)||Ex.has(e.text))&&Oe(e);if(i&&e.kind!==`String`&&(Ex.has(e.text)||Ax.has(e.text)&&e.text!==`'`&&!wx.has(e.text)||kx.has(e.text)&&w(-1).text===`(`&&w(-1).line===e.line&&w(-1).endColumn+1===e.column&&w(1).text===`)`&&w(1).line===e.line&&w(1).column===e.endColumn+1)&&Oe(e))throw ce(`incomplete expression`,e);if(t&&!i&&e.text===`\\X`&&e.spelling!==`×`)throw ce(`\\X may not be used as an infix operator`,e);if(t)return o++,C({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:b(e)},o-1);if(e.kind!==`String`&&Ax.has(e.text)&&Oe(e)){o++;let t=b(e);if(wx.has(e.text))return C({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o-1);let n={kind:`Identifier`,name:`argument`,location:t};return C({kind:`Lambda`,params:[n.name],body:tS(e.text,n,t),operator:e.text,location:b(e)},o-1)}if(E(`LAMBDA`)){let t=o;D();let n=_e(A(ge));k(`:`);let r=N();return C({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:b(e)},t)}if(!i)return N();let n=de(N);if(n)return n;throw ue(`Unexpected ${T(w())}`)},Ae,je=()=>xe(()=>{let e=o;k(`(`);let t=A(ke);return k(`)`),Ae=S(e),t}),Me=()=>{let e=D();s.push(e.column);let t=[N()],n=()=>{for(;$x(ie())&&ie().text===e.text&&ie().column===e.column;)o++,t.push(N())};return i?fe(n):n(),s.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:b(e)}},Ne=e=>xe(()=>{let t=b(e),n=w().kind===`Identifier`,r=E(`|->`,1)&&(n||me(w()));if(r||n&&E(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o,n=b(w()),i=e();return n.range=S(t),k(r?`|->`:`:`),{name:i,value:N(),location:n}},a=[i(()=>n?he():D().text),...O(`,`)?A(()=>i(he)):[]];return k(`]`),{kind:e,fields:a,location:t}}if(Se()){let e=o,n=Te();if(!i||E(`|->`)){k(`|->`);let e=N();return k(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}o=e}let a=N();if(O(`->`)){let e=N();return k(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(O(`EXCEPT`)){let e=A(()=>{k(`!`);let e=[];for(;E(`.`)||E(`[`);)if(O(`.`)){if(!me(w()))throw ue(`Expected a field name but found ${T(w())}`);if(!i&&E(`@`))throw ue(`@ used in !.@`);e.push({kind:`Field`,name:D().text})}else k(`[`),e.push({kind:`Index`,args:A(()=>N())}),k(`]`);return k(`=`),{path:e,value:N()}});return k(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!E(`]_`)){let e=[a];for(;O(`,`);)e.push(N());return k(`]`),{kind:`Bracket`,args:e,location:t}}return k(`]_`),{kind:`BoxAction`,action:a,subscript:Ee().subscript,location:t}}),Pe=()=>{let e=o,t=C(He(),e),n=b(D());return C({kind:`Apply`,operator:`\\in`,args:[t,fe(N)],location:n},e)},Fe=e=>xe(()=>{let t=b(e);if(O(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(Se()&&(w(1).text===`\\in`||E(`<<`))){let e=o,n=we();k(`\\in`);let r=fe(N);if(O(`:`)){let e=fe(N);return k(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o=e}let n=w().kind===`Identifier`&&E(`\\in`,1)?Pe():N();if(O(`:`)){let e=Te();return k(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;O(`,`);)r.push(N());return k(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Ie=e=>{let t=b(e),n=xe(()=>E(`>>`)||E(`>>_`)?[]:A(()=>N()));if(O(`>>_`)){if(n.length!==1)throw ce(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:fe(Ee).subscript,location:t}}return k(`>>`),{kind:`Tuple`,elements:n,location:t}},Le=e=>{let t=b(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&Se()){let e=Te();return k(`:`),{kind:n,bounds:e,body:N(),location:t}}let i=_e(A(ge));return k(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:N(),isTemporal:r,location:t}},Re=e=>{let t=[];do{let n=o;if(O(`OTHER`))return k(`->`),{kind:`Case`,arms:t,other:N(),otherRange:S(n),location:b(e)};let r=N();k(`->`),t.push({condition:r,body:N()})}while(O(`[]`));return{kind:`Case`,arms:t,other:void 0,location:b(e)}},ze=()=>{let e=w(1);return E(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||jx.has(e.text)||e.kind===`Operator`&&(vx.has(e.text)||Tx.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&Dx.has(e.text))},Be=()=>{let e=D();if(e.kind===`Number`)return{kind:`Operand`,operand:c(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return o--,{kind:`Bound`,args:je()}}return{kind:`Name`,name:e.text,args:E(`(`)?je():[]}},j=e=>{let t=o,r=D(),a=b(r);if(i&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=A(he);return k(`:`),{kind:`Lambda`,params:e,body:N(),location:a}}if(r.kind===`Number`)return{kind:`Number`,value:c(r.text),text:r.text,location:a};if(r.kind===`Decimal`)return{kind:`Decimal`,text:r.text,location:a};if(r.kind===`String`)return{kind:`String`,value:r.text,location:a};let s=r.kind===`Step`&&St(r);if(!i&&s&&yt()<0&&vt.length<=1)throw ce(`Step number used outside proof`,r);if(s&&r.text[1]===`+`)throw ce(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||s){let n=s?Ct(r)??r.text:r.text;if(Ce()){let o=_e(O(`(`)?A(ge):[]);o.names.length>0&&k(`)`),k(`::`);let s=S(t),c=N();if(!i&&e!==void 0&&l!==void 0&&Qx(c)&&e.high>=l.low)throw ce(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:n,params:o.names,paramRanges:o.ranges,head:s,body:c,location:a}}let c=E(`(`);if(n===`@`&&!c&&!ze())return{kind:`ExceptAt`,location:a};let u=c?je():[],d=[c?Ae:void 0];if(!ze())return c?{kind:`Apply`,operator:n,args:u,argumentsRange:Ae,location:a}:{kind:`Identifier`,name:n,location:a};let f=[{kind:`Name`,name:n,args:u}],p=[S(t,t)];for(;ze();)D(),p.push(S(o,o)),Ae=void 0,f.push(Be()),d.push(Ae);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),g=f.flatMap(e=>`args`in e?e.args:[]),_=f.map(e=>`args`in e?e.args.length:0),v=d.at(-1)??S(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:a}:g.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:a}:{kind:`Apply`,operator:h,args:g,..._.slice(0,-1).some(e=>e>0)&&{argumentCounts:_},argumentsRange:v,selectorRanges:p,argumentRanges:d,location:a}}if(r.kind===`Operator`&&eS(r.text)&&E(`(`)){let e=je();return n===`tlc`&&r.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:a}:{kind:`Apply`,operator:r.text,spelling:r.spelling,args:e,location:a}}if(r.kind===`Operator`&&eS(r.text)&&!i)return{kind:`Identifier`,name:r.text,spelling:r.spelling,location:a};switch(r.text){case`(`:{let e=xe(()=>N());return k(`)`),e}case`[`:return Ne(r);case`{`:return Fe(r);case`<<`:return Ie(r);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Le(r);case`IF`:{let e=N();k(`THEN`);let t=N();return k(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:N(),location:a}}case`CASE`:return Re(r);case`LET`:{let e=[],t=[];for(d.push(/* @__PURE__ */ new Set);!O(`IN`);){if(i&&E(`RECURSIVE`))throw ue(`Unexpected keyword RECURSIVE`);if(O(`RECURSIVE`)){ht();continue}let n=ct(!i&&O(`LOCAL`));n.kind===`Instance`?t.push(n):e.push(n)}d.pop();let n=N();return t.length===0?{kind:`Let`,definitions:e,body:n,location:a}:{kind:`Let`,definitions:e,instances:t,body:n,location:a}}case`CHOOSE`:{let e=we(),t=O(`\\in`)?N():void 0;return k(`:`),{kind:`Choose`,pattern:e,set:t,body:N(),location:a}}case`WF_`:case`SF_`:{let e=Ee(),t=!E(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:xe(()=>{k(`(`);let e=N();return k(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:a}}}throw ue(`Unexpected ${T(r)}`,r)},Ve=(e,t,n)=>{l=u={low:t,high:n};let r=N(n+1),i=w(),a=Tx.has(i.text)?gx.high:vx.get(i.text)?.high;if(i.kind===`Operator`&&a!==void 0&&a>=t)throw ce(`Precedence conflict between ${e.text} and ${i.text}`,i);return r},He=()=>{let e=u;u=void 0;let t=w(),n=b(t);if(t.kind===`Operator`&&$x(t))return Me();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(),tS(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 j(e)},Ue=(e,t,n,r,i)=>{let a=b(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:b(e)}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t],location:b(e)},Ge=()=>{D();let e=xe(()=>A(()=>N()));return xe(()=>k(`]`)),e},Ke=e=>{let t=o,n=He(),r=n.location.range?n:C(n,t),i;for(;;){let n=w();if(n.kind!==`Operator`)break;let a=b(n);if(Tx.has(n.text)&&e<=15){D(),l=gx,r=C(We(n,r),t);continue}if(n.text===`[`){let e=Ge();l=_x,r=C({kind:`FunctionApplication`,function:r,args:e,location:a},t);continue}if(n.text===`.`&&me(w(1))){D();let e=D().text;r=C({kind:`FieldAccess`,record:r,field:e,location:a},t);continue}let o=vx.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 ce(`Precedence conflict between ${i.text} and ${n.text}`,n)}if(D(),o.low>12&&E(`-`))throw ce(`Precedence conflict between ${n.text} and -`,w());l=u=o;let s=N(o.high+1),c=i?.text===n.text;r=C(Ue(n,r,s,c,S(t).end),t),i={...o,text:n.text}}return r},M=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`)&&Sx.has(e.text),qe=(e,t)=>({start:t,end:o-1,expression:e.location.range?e:C(e,t)}),Je=(e,t,n,r)=>({...n,start:e,end:o-1,fixity:t,isLeft:!1,apply:r}),Ye=e=>e.kind===`Operator`&&Tx.has(e.text)&&E(`(`,1)?de(()=>xe(()=>{D(),D();let t=N(),n=o-1;return k(`)`),{end:n,expression:We(e,t)}})):void 0,Xe=()=>{let e=0;for(let t=o+1;t<a.length;t++){let n=a[t];if(n.kind===`Operator`){if(e===1&&n.text===`,`)return!0;if(a[t-1].text!==`!`&&(Yx.has(n.text)&&e++,Xx.has(n.text)&&--e===0))return!1}}return!1},Ze=e=>E(`(`,1)&&Xe()?de(()=>xe(()=>{D(),D();let t=N();k(`,`);let n=N();return k(`)`),{kind:`Apply`,operator:e.text,args:[t,n],location:b(e)}})):void 0,Qe=e=>{let t=o,n=w(),r=b(n),i=n.kind===`Operator`||n.kind===`Keyword`,a=i?vx.get(n.text):void 0;if(!e){if(E(`[`)){let e=Ge();return Je(t,`Postfix`,xx,t=>({kind:`FunctionApplication`,function:t[0].expression,args:e,location:r}))}if(E(`.`)&&me(w(1))){D();let e=D().text;return Je(t,`Postfix`,xx,t=>({kind:`FieldAccess`,record:t[0].expression,field:e,location:r}))}if(a){if(Ze(n)){o=t;return}return D(),{...Je(t,`Infix`,a,e=>Ue(n,e[0].expression,e[1].expression,e[0].joinedBy===n.text,S(e[0].start,e[1].end).end)),isLeft:yx(n.text,a),joins:n.text}}if(n.kind!==`Operator`||!Tx.has(n.text))return;if(Ye(n)){o=t;return}return D(),Je(t,`Postfix`,gx,e=>We(n,e[0].expression))}if(n.kind===`Operator`&&$x(n))return qe(Me(),t);let s=a?Ze(n):void 0;if(s)return qe(s,t);let c=Ye(n);if(c)return c.expression.location.range=S(t,c.end),{start:t,end:c.end,expression:c.expression};let l=i?bx.get(n.text):void 0;if(l)return D(),Je(t,`Prefix`,l,e=>tS(n.text===`-`?`-.`:n.text,e[0].expression,r));if(!M(n))return;let u=n.kind===`Operator`&&Cx.has(n.text);return qe(u?j():fe(j),t)},$e=e=>e!==void 0&&`fixity`in e,et=e=>e!==void 0&&!(`fixity`in e),tt=(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=S(n,r),{start:n,end:r,expression:i,joinedBy:e.joins}},nt=e=>{let t=e.pop(),n=e.pop();if(!et(t)||!$e(n))throw ce(`incomplete expression`);let r=n.fixity===`Infix`?e.pop():void 0;e.push(tt(n,et(r)?[r,t]:[t]))},rt=e=>{let t=e[e.length-2];return $e(t)?t:void 0},it=(e,t)=>t!==void 0&&e.high<t.low,at=()=>pe(()=>{let e=de(()=>Qe(!0));if(e===void 0){let e=ie();throw e.kind===`End`?ue(`Unexpected end of expression`,e):ce(`required expressions(s) missing before '${se(e)}'`,e)}return fe(()=>{let t=[e];for(;;){let e=de(()=>Qe($e(t[t.length-1])));if(e===void 0)break;if(et(e)||e.fixity===`Prefix`){t.push(e);continue}for(;it(e,rt(t));)nt(t);let n=t[t.length-1];if(e.fixity===`Postfix`&&et(n)){t.splice(-1,1,tt(e,[n]));continue}let r=rt(t);r?.fixity===`Infix`&&r.isLeft&&e.isLeft&&!it(r,e)&&nt(t),t.push(e)}for(;t.length>1;)nt(t);let n=t[0];if(!et(n))throw ce(`incomplete expression`);return n.expression})}),N=(e=0)=>i?at():Ke(e),ot=()=>{if(!O(`(`))return[];let e=mt();return k(`)`),e},st=()=>{let e=b(w()),t=N(),n=a[o-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:m[0].name,start:e,end:r}}},ct=e=>{let t=o;return C(ut(e),t)},lt=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),ut=e=>{let t=w(),n=o,r=b(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:S(n,o-2),...st(),isLocal:e,isRecursive:y(t),location:r});if(t.kind===`Identifier`&&w(1).kind===`Operator`&&vx.has(w(1).text)&&w(2).kind===`Identifier`&&E(`==`,3)){let e=ge(),t=D().text,n=ge();return k(`==`),i(t,[lt(e),lt(n)])}let a=t.kind!==`String`&&Dx.has(t.text),s=t.kind===`Identifier`&&Tx.has(w(1).text)&&E(`==`,2);if(a||s){let e=a?t.text:w(1).text;a&&D();let n=ge();return s&&D(),k(`==`),i(e,[lt(n)])}let c=he();if(O(`[`)){let t=xe(()=>Te());return k(`]`),k(`==`),{kind:`Function`,name:c,bounds:t,body:N(),isLocal:e,isRecursive:y(c),location:r}}let l=o,u=ot();return k(`==`),E(`INSTANCE`)?{...dt(c,u,e,r),definitionRange:S(l)}:i(c,u)},dt=(e,t,n,r)=>{let i=o;return k(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:be(),substitutions:O(`WITH`)?A(()=>{let e=o,t=ve(),n=S(e);return k(`<-`),{name:t,nameRange:n,expression:ke()}}):[],isLocal:n,location:r,instanceRange:S(i)}},ft=()=>{let e=o;return C(pt(),e)},pt=()=>{let e=b(w());if(E(`_`)&&w(1).kind===`Operator`)return D(),{name:D().text,arity:O(`_`)?2:1,location:e};if(w().kind!==`String`&&(Dx.has(w().text)||i&&w().kind===`Operator`)&&E(`_`,1)){let t=D().text;return D(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=he();if(!O(`(`))return{name:t,arity:0,location:e};let n=A(()=>k(`_`));return k(`)`),{name:t,arity:n.length,location:e}},mt=()=>A(ft),ht=()=>{let e=mt();return e.forEach(e=>d[d.length-1].add(e.name)),e},gt=e=>{let t=0,n=e;do{let e=w(n);if(e.kind===`End`)return n;e.kind===`Operator`&&Yx.has(e.text)&&t++,e.kind===`Operator`&&Xx.has(e.text)&&t--,n++}while(t>0);return n},_t=()=>{let e=w(),t=w(1);return e.kind===`Identifier`?E(`(`,1)||E(`[`,1)?E(`==`,gt(1)):t.kind===`Operator`&&Tx.has(t.text)?E(`==`,2):t.kind===`Operator`&&vx.has(t.text)?w(2).kind===`Identifier`&&E(`==`,3):E(`==`,1):e.kind!==`String`&&Dx.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(`.`)&&!Lx.has(xt(e)),Ct=e=>{let t=xt(e);if(Lx.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}`},wt=e=>{if(e.kind===`Keyword`)return Px.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},Tt=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},Et=e=>!f.has(e)&&m.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),Dt=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Zx.has(e.name)&&!Et(e.name):!1,Ot=()=>{let e=w();return e.kind===`Step`?St(e):e.kind===`Keyword`?Kx.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!_t()},kt=()=>{let e=o,t=w();return t.kind===`Operator`&&!Ox.has(t.text)&&eS(t.text)?(o++,C({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:b(t)},e)):O(`MODULE`)?C({kind:`ModuleFact`,name:he(),location:b(t)},e):N()},At=e=>p[p.length-1]?.add(e),jt=e=>{p.push(/* @__PURE__ */ new Set);let t=e();return p.pop(),t},P=e=>p.some(t=>t.has(e))||m.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),Mt=()=>{let e=o,t=w(),n=A(()=>{let e=w();if((e.kind!==`Identifier`||ae(e))&&e.kind!==`Operator`)throw ue(`Expected a definition name but found ${T(e)}`,e);return o++,e.text},`!`),r=b(t);return C(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},Nt=()=>{if(i)return A(Mt);let e=A(kt),t=n===`tlc`?e.find(e=>e.kind===`Identifier`&&P(e.name)):void 0;if(t)throw ce(`DEF clause entry should describe a defined operator`,t.location);return e},Pt=()=>{let e=de(N);if(!e)return[];let t=[e];return pe(()=>{for(;E(`,`);){let e=de(()=>(D(),N()));if(!e)return;t.push(e)}}),t},Ft=()=>{let e=i?Pt():Ot()?A(kt):[],t=O(`DEF`)||O(`DEFS`);if(i&&e.length===0&&!t)throw ue(`Expected a fact`);return{facts:e,defs:t?Nt():[]}},It=()=>{let t=o,r=D(),i=r.text===`USE`&&O(`ONLY`),a=S(t),s={kind:r.text===`USE`?`Use`:`Hide`,isOnly:i,...Ft(),keyword:a,location:b(r)},c=s.kind===`Hide`&&n===`tlc`?s.facts.filter(e=>!Dt(e)):[];if(c.length>0)throw e.q(c.map(n=>({location:e.X(n.location.range??S(t)),message:`The only expression allowed as a fact in a HIDE is
|
|
1788
|
-
the name of a theorem, assumption, or step.`})));return C(s,t)},Lt=()=>{let e=o,t=b(w()),n=O(`NEW`),r=i?o:e,a=i?b(w()):t,s=w().kind===`Keyword`?qx.get(w().text):void 0;if(!n&&s===void 0)throw ue(`Expected a declaration but found ${T(w())}`);if(s!==void 0&&D(),s===`Variable`){let e=ge();return At(e.name),C({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:a},r)}let c=ft();At(c.name);let l=(s??`Constant`)===`Constant`&&E(`\\in`);if(l&&c.arity>0)throw ce(`declared symbol with arguments before \\in`);return l&&D(),C({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?N():void 0,nameRange:c.location.range,location:a},r)},Rt=()=>{if(w().kind===`Identifier`&&E(`::`,1)&&E(`ASSUME`,2)&&(D(),D()),E(`ASSUME`))return jt(Bt);if(w().kind===`Keyword`&&Jx.has(w().text))return i?fe(Lt):Lt();if(!i)return N();let e=de(N);if(e===void 0)throw ue(`Expected a hypothesis`);return e},zt=()=>{let e=[Rt()];return pe(()=>{for(;;){let t=de(()=>(k(`,`),Rt()));if(t===void 0)break;e.push(t)}}),e},Bt=()=>{let e=o,t=b(k(`ASSUME`)),n=()=>{let n=i?zt():A(Rt);return k(`PROVE`),C({kind:`AssumeProve`,assumptions:n,conclusion:N(),location:t},e)};return i?fe(n):n()},Vt=e=>{let t=0;for(;w(t).kind===`Identifier`&&E(`,`,t+1);)t+=2;return w(t).kind===`Identifier`&&E(e,t+1)},Ht=(e,t)=>{e.forEach(At),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(At))},Ut=()=>{let e=w();if(E(`USE`)||E(`HIDE`))return It();if(!i&&E(`INSTANCE`)){let t=o;return C(dt(void 0,[],!1,b(e)),t)}if(E(`DEFINE`)||_t()){let t=o;O(`DEFINE`);let n=[ct(!1)];for(;_t();)n.push(ct(!1));let r={kind:`Define`,definitions:n,location:b(e)};return C(r,t)}if(O(`HAVE`))return{kind:`Have`,expression:N()};if(O(`TAKE`)){let e=Se(),t=_e(e?[]:A(ge)),n=e?Te():[];return Ht(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(O(`WITNESS`))return{kind:`Witness`,expressions:A(()=>N())};if(O(`PICK`)){let e=Vt(`:`),t=_e(e?A(ge):[]),n=e?[]:Te();return Ht(t.names,n),k(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:N()}}return O(`CASE`)?{kind:`Case`,expression:N()}:{kind:`Assert`,isSuffices:O(`SUFFICES`),statement:E(`ASSUME`)?Bt():N()}},Wt=e=>{let t=w();if(t.kind!==`Step`)throw ue(`Expected a step number but found ${T(t)}`,t);if(!Tt(t))throw ce(`${e?`QED step`:`step`}'s number has bad level`,t);if(n!==`sany`&&bt(t)<0&&Ct(t)!==void 0)throw ce(`<*> and <+> cannot be used for a named step`,t);return o++,{name:Ct(t),token:t.text,location:b(t)}},Gt=()=>{let e=o,t=Wt(E(`QED`,1)),n=o,r=/* @__PURE__ */ new Set;p.push(r);let i=O(`QED`)?{kind:`Qed`}:Ut(),a=S(e),s=S(n),c=wt(w());if(c&&!Fx.has(i.kind))throw ce(`Proof of a step that does not take a proof`);let l=c?Jt():void 0;return p.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(At),C({...t,body:i,head:a,statement:s,proof:l},e)},Kt=e=>{if(O(`BY`)){let t=S(o-1);return{kind:`By`,isOnly:O(`ONLY`),...Ft(),keyword:t,location:e}}let t=w();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;D();let n=S(o-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},qt=()=>{let e=b(w());O(`PROOF`);let t=Kt(e);if(t)return t;let n=[Gt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(Gt());return{kind:`Steps`,level:yt(),steps:n,location:e}},Jt=()=>{let e=o;vt.push(-1);let t=jt(qt);return vt.pop(),C(t,e)},Yt=()=>w().kind===`Step`||w().kind===`Keyword`&&Px.has(w().text),Xt=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return Vx(e);let n=t.defs[t.defs.length-1]?.location.range;return Bx(Vx({...e,end:e.start}),Vx(n??t.keyword))},Zt=()=>{let e=o,t=b(w()),n=O(`PROOF`),r=Kt(t);if(r){let t=C(r,e);return{kind:`Leaf`,proof:t,span:Vx(t.keyword),first:e,end:o-1}}let i=w();if(i.kind!==`Step`)throw ue(`Expected a step number but found ${T(i)}`);let a=o;D();let s=o,c=O(`QED`)?{kind:`Qed`}:Ut(),l=S(a);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:S(s),span:Xt(l,c),first:e,start:a,end:o-1}},Qt=(e,t,n,r)=>{let i=e[t];if(!i)return{proof:void 0,span:r,next:t,end:void 0};if(i.kind===`Leaf`)return{proof:i.proof,span:i.span,next:t+1,end:i.end};let o=$t(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={...b(a[i.first]),range:S(i.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},$t=(e,t,n,r,i)=>{let a=e[t];if(!a)throw Gx(`Unexpected end of (sub)proof at level ${n} before QED step`,r,Wx);if(a.kind===`Leaf`)throw Gx(`Expecting a proof step but found a${Rx[a.proof.kind]} leaf proof`,a.span,Wx);if(!i&&a.isProof)throw Gx(`PROOF keyword found in step that does not begin subproof`,a.span,Ux);let o=a.token.text[1];if(o===`+`&&!i)throw Gx(`<+> used but no subproof expected`,a.span,Ux);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:bt(a.token);if(s<n||!i&&s>n)return;let c=Fx.has(a.body.kind)?Qt(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:{...b(a.token),range:S(a.start,l)}},d=Bx(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=$t(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:Bx(d,f.span)}},en=()=>{if(!Yt())return;let e=[];for(;Yt();)e.push(Zt());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=Qt(e,0,0,t.span),r=e[n.next];if(r)throw Gx(`extra step(s) after finished proof`,r.span,Hx,`Proof.Parser.toplevel`);return n.proof},tn=(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})},nn=()=>{if(w().kind!==`Identifier`||!E(`==`,1))return;let e=he();return f.add(e),D(),e},rn=()=>{if(!i)return N();let e=ie(),t=de(N);if(t)return t;throw ue(`Expected "====" but found ${T(e)}`,e)},an=e=>{let t=o,n=D(),r=nn(),a=jt(()=>{let e=E(`ASSUME`)?Bt():rn();return i?{statement:e,proof:en()}:{statement:e,proof:wt(w())?Jt():void 0}}),s=a.statement,c=C({name:r,statement:s,proof:a.proof,location:b(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&s.kind!==`AssumeProve`&&tn(e,r,s,c.location)},on=()=>{let e=o,t=D(),n=nn();return C({name:n,expression:N(),isAxiom:t.text===`AXIOM`,location:b(t)},e)},sn=()=>{let e=b(k(`----`));k(`MODULE`);let t=be();k(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(m.push(n),d.push(/* @__PURE__ */ new Set),O(`EXTENDS`)&&A(()=>{let e=o;n.extends.push(be()),n.extendsRanges.push(S(e))});;){let t=o,r=w();if(r.kind===`ModuleEnd`)return e.range={module:m[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},m.pop(),d.pop(),n;if(r.kind===`Separator`){if(E(`MODULE`,1)){let e=sn();n.modules.push(e),n.units.push({kind:`Module`,module:e}),k(`====`);continue}D()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=b(D()),r=mt();n.constants.push(...r),e.range=S(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=b(D()),r=A(()=>{let e=o,t=b(w());return C({name:he(),arity:0,location:t},e)});n.variables.push(...r),e.range=S(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=on();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&tn(n,e.name,e.expression,e.location);continue}case`USE`:case`HIDE`:{if(E(`USE`)&&E(`ONLY`,1))throw ue(`Expected a module unit but found ${T(r)}`);let e=It();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=b(D()),r=ht();e.range=S(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:cn(n,C(dt(void 0,[],!1,b(r)),t));continue;case`LOCAL`:if(D(),E(`INSTANCE`)){cn(n,C(dt(void 0,[],!0,b(r)),t));continue}cn(n,C(ut(!0),t));continue}r.kind===`Keyword`&&Nx.has(r.text)?an(n):cn(n,ct(!1))}}},cn=(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}))},ln=sn(),un=ye?hx(t):void 0;if(un!==void 0)throw new e.F(un);return ln},iS=e=>rS(e,`tlc`),aS=(e,t)=>rS(e,`tlc`,t),oS=e=>rS(e,`tlapm`),sS=e=>rS(e,`sany`),cS=`$subexpression`,lS=(t,n)=>new e.F(`${t} at line ${n.line}, column ${n.column}`),uS=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return uS(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of ze(e)){let e=uS(r,t,n);if(e)return e}},dS=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),fS=(e,t)=>{let n=e.location,r=dS(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 lS(`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 lS(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:cS,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:cS,args:e.args,location:n,resolution:ws},location:n}},pS=(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:ws})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:ws}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:ws};return fS({...t,params:[...t.params,...r]},a)},mS=(t,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s=0,c,l=!1,u=(n,i)=>{if(!n)throw lS(i,a);Es.set(r,{args:t.slice(0,s).flatMap(e=>`args`in e?e.args:[]),error:{location:e.X(n),message:i}}),l=!0},d=e=>{let r=[],i=[];for(;s<t.length;){let o=t[s];if(o.kind!==`Name`)throw lS(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=e?e.find(e=>Jc(e)===c):n(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s++}throw lS(`Unknown operator ${r.join(`!`)}`,a)},f=e=>{let n=d(e),l=n.definition,f=js(l),p=s===t.length-1;if(n.args.length!==f&&(!i||n.args.length!==0))return u(r.argumentRanges?.[s]??a.range,`The operator ${n.name} requires ${f-n.earlier} arguments.`);if(p)return{definition:l,args:n.args};if(l.kind!==`Operator`)throw lS(`Cannot select a subexpression of ${l.name}`,a);o.params.push(...l.params),o.args.push(...n.args),c=l.body,s++},p=()=>{for(;s<t.length&&!l;){let e=t[s];if(e.kind!==`Name`)return;let n=r.selectorRanges?.[s],a=c&&uS(c,e.name,[]);if(!a)return u(n,`Cannot find label \`${e.name}'.`);let l=a.label.params;if(!i&&e.args.length!==l.length)return u(n,`Label \`${e.name}' used with wrong number of arguments.`);o.lets.push(...a.lets),o.params.push(...l.map(e=>({name:e,arity:0}))),o.args.push(...e.args),c=a.label.body,s++}},m=e=>{if(!c)throw lS(`Subexpression selection failed`,a);if(e.kind===`Colon`)return;if(c.kind===`Label`){c=c.body,m(e);return}if(c.kind===`Let`){if(e.kind!==`Operand`||Qs(e.operand,1)!==0)throw lS(`A LET/IN expression has only one operand`,a);o.lets.push(c.definitions),c=c.body;return}let n=nc(c);if(n&&(e.kind===`Bound`||e.kind===`At`)){o.params.push(...n.names.map(e=>({name:e,arity:0}))),e.kind===`Bound`&&o.args.push(...e.args),c=n.body;return}if(c.kind===`Case`&&e.kind===`Operand`){let n=[...c.arms,...c.other?[{condition:void 0,body:c.other}]:[]],r=n[Qs(e.operand,n.length)],i=t[s+1];if(!r||i?.kind!==`Operand`)throw lS(`A subexpression of CASE must have the form !i!j`,a);s++;let o=Qs(i.operand,2),l=o===0?r.condition:o===1?r.body:void 0;if(!l)throw lS(`Nonexistent CASE operand`,a);c=l;return}if(e.kind!==`Operand`)throw lS(`Unexpected subexpression selector`,a);let r=n?n.sets:rc(c),i=r?.[Qs(e.operand,r.length)];if(!i)throw lS(`Nonexistent operand specified by the selector`,a);c=i},h=f(void 0);if(l)return r;if(h)return pS(h.definition,{...o,args:h.args});for(p();s<t.length&&!l;){let e=t[s];if(e.kind===`Name`){for(;c?.kind===`Label`;)c=c.body;if(c?.kind!==`Let`)throw lS(`A name selector here must be from a LET clause`,a);o.lets.push(c.definitions);let e=f(c.definitions);if(l)return r;if(e)return pS(e.definition,{...o,args:[...o.args,...e.args]});p()}else m(e),s++}if(l)return r;if(!c)throw lS(`Subexpression selection failed`,a);return fS(o,c)},hS=(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 $s(e,t,n)},gS=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||ze(e).some(gS),_S=(e,t,n,r=!1)=>{if(!gS(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Zc(e,e=>_S(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>vS(e,r,n))}:i}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>_S(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Zc(e,e=>_S(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?hS(a.name,[],void 0,t):a.kind===`Apply`?hS(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=mS(o,t,a,r);return c!==a&&Ts.add(c),c},vS=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:_S(e.expression,t,n,!0)}))}),yS=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},bS=(e,t)=>vS(e,yS(t.definitions),()=>!1),xS=(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=yS([...t,...e.definitions]),a=e=>n.has(e),o=yS([...t,...e.definitions,...r]),s=e=>_S(e,o,e=>a(e)&&r.every(t=>t.name!==e)),c=e=>a(e)||!i(e),l=e=>_S(e,i,c),u=e=>e.map(e=>e.kind===`ModuleFact`?e:l(e)),d=e=>e.map(e=>({...e,set:l(e.set)})),f=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&l(e.set)}:f(e)),conclusion:l(e.conclusion)}:l(e),p=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:u(e.facts)};case`Instance`:return vS(e,i,c);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?vS(e,i,c):Xc(e,l))};case`Have`:case`Case`:return{...e,expression:l(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(l)};case`Take`:return{...e,bounds:d(e.bounds)};case`Pick`:return{...e,bounds:d(e.bounds),body:l(e.body)};case`Assert`:return{...e,statement:f(e.statement)};default:return e}},m=e=>e?.kind===`By`?{...e,facts:u(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:p(e.body),proof:m(e.proof)}))}:e,h={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:f(e.statement),proof:m(e.proof)})),uses:e.uses.map(e=>({...e,facts:u(e.facts)}))};return e.definitions.some(e=>gS(e.body))||e.assumptions.some(e=>gS(e.expression))?{...h,definitions:e.definitions.map(e=>Xc(e,s)),assumptions:e.assumptions.map(e=>({...e,expression:s(e.expression)}))}:h},SS=(e,t)=>e.maxLevels[t]??3,CS=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=ou({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(e,a),a},i=/* @__PURE__ */ new Map,a=e=>{let n=i.get(e);if(n)return n;let a=t(e),o=r(e),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Il(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Il(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ll(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Nl(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)&&Il(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(su(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c};return n=>{let i=/* @__PURE__ */ new Map,o=e.X(n.location.range??{module:n.instancer,start:n.location,end:n.location}),s=e=>i.set(`${o}\n${e}`,{location:o,message:e}),c=t(n.module),l=a(n.module),u=r(n.instancer),d=/* @__PURE__ */ new Map;n.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...c.constants.map(e=>({...e,maximumLevel:0})),...c.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let t=n.substitutions.get(e.name);if(!t)return[];if(e.arity===0){let n=u.analyze(t,d);return[{...e,level:n.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(t,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,t)=>`Level error in instantiating module '${n.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${t}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&s(p(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${n.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let t=l.constraints.get(e.name);t!==void 0&&e.level>t&&s(p(e.name,t));let r=e.operator;if(r)for(let t=0;t<e.arity;t++){let i=l.argConstraints.get(jl(e.name,t));i!==void 0&&SS(r,t)<i&&s(`Level error in instantiating module '${n.module}':\nThe level of the argument ${t+1} of the operator ${r.name} \nmust be at least ${i}.`)}}),l.argParams.forEach(e=>{let t=Nl(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=SS(r,t.index);i.level>a&&s(`Level error when instantiating module '${n.module}':\nThe level of the argument ${t.index} of the operator ${t.operator}' \nmust be at most ${a}.`)}),i.size>0)throw e.q([...i.values()])}},wS=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],TS=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),ES=new Map(Df.flatMap(e=>e.map(t=>[t,e[0]]))),DS=e=>ES.get(e)??e,OS=()=>{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}}},kS=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:Ve(e)&2147483647,kind:t,isLocal:n}),AS=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:DS(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:DS(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}},jS=(e,t)=>{let n=[];for(let r=t;;){let t=AS(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},MS=e=>({line:e.line,column:e.column}),NS=(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=jS(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},PS=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,FS={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},IS=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&PS(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&PS(e[n+1],e[n+2])?n+=PS(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=>FS[e])}"`:r.text)}return t},LS=e=>e[2]?.text,RS=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},zS=(e,t)=>e.find(e=>e.name===t)??e.map(e=>zS(e.modules,t)).find(Boolean),BS=e=>{let t=e===void 0?[]:re(e),n;return{tokens:t,ranges:RS(t),getModule:()=>n??=e===void 0?iS(``):aS(e,t)}},VS=(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=BS(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)??jf.get(i)??Pf.get(i)??nS(e,i),c=a(s),l=c.tokens,u=c.ranges.get(LS(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:()=>zS(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()}},HS=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=jS(t,e+1);i.push({location:MS(t[e]),apply:e=>r.forEach(t=>e.put(kS(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:MS(n),apply:t=>t.put(kS(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`&&jS(t,u+1).every(e=>s.has(e))&&o(u,`definition`),TS.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(MS(n)),i.push({location:MS(n),apply:e=>e.put(kS(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(kS(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=DS(e.name);i.push({location:e.location,apply:n=>n.put(kS(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(kS(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(kS(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>As(e.location,t.location)?-1:+!!As(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=OS();n.set(i??``,o),Ef.toReversed().forEach(e=>o.put(kS(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)}}},US=(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)};n.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),Of.forEach(i);let o=e=>{let n=t(e);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=NS(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;IS(o(void 0)).forEach((e,t)=>{t===3&&Af.forEach(i),i(e)});let y=l(void 0);for(;;){let n=h(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!n)break;let[r,a]=n;if(d.add(`${r.key}>${a}`),v.set(r.unit,[...v.get(r.unit)??[],a]),!_.has(a)){if(_.add(a),t(a).tokens.length===0){let n=r.unit??LS(t(void 0).tokens);throw e.K(a,n)}IS(o(a)).forEach(i)}}wS.forEach(i);let b=/* @__PURE__ */ new Set,x=e=>{if(b.has(e))return;b.add(e);let t=v.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(x),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return x(void 0),kf.forEach(i),[...r]},WS=(e,t)=>{let n=VS(e,t),r=n.getParsed,i,a=()=>i??=HS(r);return{getStringOrder:e=>US(r,e),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},GS=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),KS=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],qS=(t,n,r)=>{try{return r.parseModule(t)}catch(r){if(!(r instanceof e.F))throw r;let i=hx(t);throw i===void 0?r:e.q([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},JS=t=>new e.F(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),YS=(t,n)=>t.location.range&&n.location.range&&{location:e.X(t.location.range),message:`Multiply-defined module '${t.name}': this definition or declaration conflicts \nwith the one at ${e.X(n.location.range)}.`},XS=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,ZS=e=>e===`Theorem`?`ThmOrAssumpDefNode`:XS(e),QS=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:hl(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),$S=(e,t)=>{let n=Be(e);return n!==void 0&&t.has(n)||ze(e).some(e=>$S(e,t))},eC=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(ul(e),n.get(e)??n.size)),n},tC=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),nC=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Sh(e);if(e.kind===`Number`&&!Lt(e.value))throw Ch(e);nC(e.kind===`Let`?[...ze(e),...tC(e.instances??[])]:ze(e))}),rC=(t,n)=>{let r=n.order??WS(n.source,n.loadModule),i=r.parseModule(n.source),a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Set,l=/* @__PURE__ */ new Set,u=new Map(Gf.map(e=>[e.name,e])),d=/* @__PURE__ */ new Map,f=$d(t.checkDeadlock,n.seed);f.isWarningEnabled=n.isWarningEnabled??!0,f.isTool=n.isTool??!1,f.version=n.version??`master`;let p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,h=[],g=/* @__PURE__ */ new Map,_=[],v=[],y=(e,t)=>_.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),b=0,x=e=>`${e}#${b++}`,ee=[],te=[],ne=CS(e=>{let t=m.get(e)??se(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>a.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>a.get(t.visible.get(e)?.key??e)}}),S=/* @__PURE__ */ new Map,re=/* @__PURE__ */ new Map,C=/* @__PURE__ */ new Map,ie=e=>{let t=d.get(e);if(t)return t;let r=pp(e,n.print,f,n.files,u);if(!r)return;dp.get(e)?.forEach(ie);let i=/* @__PURE__ */ new Map;return fp.get(e)?.forEach(e=>ie(e)?.forEach((e,t)=>i.set(t,e))),r.forEach(t=>{u.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Ol.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Al(e,t.name)??i.get(t.name)?.range})}),d.set(e,i),i},w=e=>{let t=dp.get(e)??[];if(e===`TLCExt`||[e,...t].some(e=>n.loadModule?.(e)!==void 0))return;let r=ie(e);return r&&y(e,t),r&&t.includes(`Integers`)&&ie(`Integers`),r},T=e=>(nC([...e.definitions.flatMap(Re),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...tC(e.instances)]),e.modules.forEach(T),e);T(i);let ae=(t,i)=>{let a=n.loadModule?.(t)??If(f.version).get(t)??nS(n.source,t);if(a===void 0)throw e.K(t,i);let o=qS(a,t,r);if(o.name!==t)throw e.q([{location:`Unknown location`,message:`File name '${t}' does not match the name '${o.name}' of the top level module it contains.`}],!0);return T(o)},oe=t=>{let n=v.indexOf(t.name);if(n!==-1){let r=[...v.slice(n),t.name].map(e=>`${e}.tla`);throw new e.F(`Circular dependency among .tla files; dependency cycle is: ${r.join(` --> `)}`)}let r=/* @__PURE__ */ new Set,i=[],a=[],o=[];v.push(t.name),_.push(r);let s=D(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:te,levelChecks:o});if(_.pop(),v.pop(),a.length>0)throw e.q(a,!1,void 0,te);let c=i.find(e=>r.has(e.name)),l=c&&p.get(c.name),u=l&&YS(c,l.module);if(u)throw e.q([u],!1,void 0,te);if(c)throw JS(c);return o.forEach(e=>e()),{linked:s,closure:r}},se=(t,r)=>{let i=p.get(t);if(i)return y(t,g.get(t)??[]),i;let o=oe(ae(t,r)),s=/* @__PURE__ */ new Map;return up(t,n.print,f,n.files,u,(t,n,r)=>{let i=s.get(t),a=n.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(i?.kind!==`Operator`||!r||a.length!==n.length)throw new e.b(`No definition of ${t} to fall back to`);return W(i.body,{environment:r.environment,scope:kg(hg(i),a,r),state:r.state,next:r.next,isKeepLazy:r.isKeepLazy})})?.forEach(e=>{let n=o.linked.visible.get(e.name);if(n?.kind!==`Definition`||n.arity!==e.arity&&GS.has(t))return;let r=a.get(n.key);r&&s.set(e.name,r),u.set(n.key,e),a.delete(n.key)}),p.set(t,o.linked),g.set(t,o.closure),y(t,o.closure),o.linked},ce=(e,t,n,r,i)=>{let u=i?void 0:w(e.module);if(u)return le(e,u);let d=i??se(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=KS(d),p=`#${b++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=zc(bS(e,t),f,t,n);ee.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=>l.add(e));let _=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,v=Cl({params:g,substitutions:new Map([...h].map(([e,t])=>[e,Gc(t,m)])),variables:new Set(d.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>o.get(e)===!0,addDefinition:(n,i,l)=>{let u=x(`${i}@${t.name}`),d=l(u);return a.set(u,d),f.length>0&&c.add(d),e.name!==void 0&&re.set(u,`${e.name}!${re.get(n)??i}`),o.set(u,!r),s.set(u,{source:n,prefix:e.params.length}),u},createName:x,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return ue(e,d.exported,f,(t,n)=>{let r=e.name===void 0?v.getKey(t):v.getQualifiedKey(t);return f.length>0&&S.set(r,{name:n,location:e.location}),e.name!==void 0&&C.set(r,n),r})},le=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),ue=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:o.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},de=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),fe=(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=de(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:gl(r,n),location:n}}},pe=(e,t,n,r)=>{let i=e.location,s=r?void 0:w(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=de(n.arity);return _l(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??se(e.module,n),l=`#${b++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=KS(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};ee.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>$S(f(e),p),h=d.map(t=>{let n=fe(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),g=[],_=Cl({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:gl(e.params,i),location:i,resolution:ws}:hl(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>o.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:QS(a,i)),i},createName:x}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),a=de(n.arity),o=[...e.params,...a];return _l(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...g,...y]},me=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),E=/* @__PURE__ */ new Map,D=(t,r)=>{let s=Jy(t,n.loadClass?.(t.name),t===i);E.set(t.name,s.overrides);let c=s.module,l=ee.length,u=new Map([...Gf.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:Pc,errors:[],warnings:[]},p=[f],g=t=>t.forEach((t,n)=>{let r=_.get(n);if(!r){u.set(n,t),_.set(n,t);return}if(!r.range||!t.range||e.X(r.range)===e.X(t.range))return;let i=e.X(t.range),a=e.X(r.range);ZS(r.kind)===ZS(t.kind)?f.warnings.push({location:i,message:`Warning: the ${XS(r.kind)} of '${n}' conflicts with \nits ${XS(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${XS(t.kind)} of '${n}' conflicts with \nits ${XS(r.kind)} at ${a}.`})}),_=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,b=[],x=[...c.constants],S=c.variables.filter((e,t)=>c.variables.findIndex(t=>t.name===e.name)===t),re=S.map(e=>e.name),ie=S.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:w(e);if(n){g(n);return}let i=t??se(e,c.name);x.push(...i.constants.filter(e=>x.every(t=>t.name!==e.name)&&!re.includes(e.name))),i.variables.forEach((e,t)=>{re.includes(e)||x.some(t=>t.name===e)||(re.push(e),ie.push(i.variableLocations[t]))}),g(i.exported),i.facts.forEach(e=>v.add(e)),i.modules.forEach((e,t)=>y.set(t,e)),b.push(i)});let T=new Map(u),ae=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],oe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});ae.forEach(e=>_.set(e.name,oe(e)));let de=e=>({key:O(e),arity:js(e),params:Ms(e),kind:Fc(c,e)?`Theorem`:`Definition`,range:e.location.range}),fe=x.length===0&&re.length===0,O=e=>c===i?e.name:`${e.name}@${r.id}`,k=/* @__PURE__ */ new Map,he=()=>new Map([...r.modules,...y]),ge=e=>{let t=c.modules.find(t=>t.name===e.module);return t?As(t.location,e.location)?y.get(t.name):void 0:he().get(e.module)},_e=e=>({imported:u,getInstance:e=>{let t=ge(e),n=t?void 0:w(e.module);if(n)return{declarations:[],symbols:le(e,n),instancer:c.name};let r=t??se(e.module,c.name),i=KS(r);return{declarations:i,symbols:ue(e,r.exported,i,e=>e),instancer:c.name}},bound:T,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:O,instanced:k,facts:v,reports:p,warnings:r.warnings}),ve=e=>[...ae.filter(t=>As(t.location,e)).map(e=>[e.name,oe(e)]),...c.definitions.filter(t=>As(t.location,e)).map(e=>[e.name,de(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(u)),ye=e=>{let t=he(),n=t.get(e.name),i=n&&YS(e,n.module);if(n&&!i)throw JS(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};p.push(a);let o=D(e,{id:`${r.id}/${e.name}`,symbols:ve(e.location),modules:t,nested:r.nested,errors:a.errors,warnings:a.warnings,levelChecks:r.levelChecks});i&&a.errors.push(i),n||y.set(e.name,o)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=ce(e,c,_e(c),fe,he().get(e.module));k.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||_.set(n,t))})}})),...c.modules.map(e=>({location:e.location,link:()=>ye(e)}))].sort((e,t)=>As(e.location,t.location)?-1:1).forEach(e=>e.link());let be=xS(Dl(c,(e,t)=>pe(e,t,c.name,ge(e))),me(u));r.errors.push(...Vc(be,_e(be))),be.definitions.forEach(e=>{let t=O(e);a.set(t,e),o.set(t,!fe);let n=de(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!As(r,e.location))&&(u.set(e.name,n),e.isLocal||_.set(e.name,n))});let xe={module:be,constants:x,variables:re,variableLocations:ie,visible:u,exported:_,modules:y,extended:b,facts:/* @__PURE__ */ new Set([...v,...[...be.theorems,...be.assumptions].flatMap(e=>e.name??[])])};m.has(c.name)||m.set(c.name,xe);let A=ee.splice(l).map(e=>({location:e.location,check:()=>ne(e)}));return r.levelChecks.push(()=>cu(be,{constants:new Set(x.map(e=>e.name)),variables:new Set(re),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>C.get(u.get(e)?.key??e)},A,te)),h.push(xe),xe},O=oe(i).linked,k=n.traceFile,he=k===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:k}}],ge=[...n.moduleOperators??[],...he].map(e=>{let t=se(e.module,i.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});h.push(...h.splice(h.indexOf(O),1)),te.length>0&&!n.isSanyReported&&n.print(e.Z(te)),O.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)}),ge.forEach(e=>{let t=e.key===void 0?void 0:a.get(e.key);e.kind!==`postcondition`&&t&&a.set(e.operator,t)});let _e=[],ve=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>ve(e,t)),_e.push(...e.module.assumptions))};ve(O,/* @__PURE__ */ new Set);let ye=O.constants.map(e=>e.name),be=O.variables,xe=Fy(t,{root:O,moduleSymbols:new Map([...d,...[...p].map(([e,t])=>[e,t.visible]),[i.name,O.visible]]),definitions:a,builtins:u,copySources:s,operatorConstants:new Map(ge.flatMap(e=>se(e.module,i.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:r}),A=xe.constants,Se=xe.substitutions;k!==void 0&&u.forEach((e,t)=>{let n=Xf(e);n&&u.set(t,n)});let Ce=eC(be,h.flatMap(e=>e.module.variables.map(e=>e.name))),we=xu({definitions:a,substitutions:Se,constants:A,variableIndex:Ce,builtins:u,variables:be}),Te={runtime:f,definitions:a,builtins:u,constants:A,substitutions:Se,instanceNames:re,variables:be,variableIndex:Ce,facts:we,startupValues:Array.from({length:we.ids.size},()=>void 0),substitutedDefinitions:c,instanceParams:l,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Ee=ou({constants:new Set(A.keys()),variables:/* @__PURE__ */ new Set([...be,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>u.has(e))]),getDefinition:e=>Lh(e,Te)}),De=t=>{try{W(t,{environment:Te,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e.b)return t;throw t}};Se.forEach((t,n)=>{let r=a.get(t),i=ye.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&Ee.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?De(r.body):void 0;if(i){let r=it(i)?``:` - specifically: ${i.message}`;throw new e._(`The configuration file substitutes constant ${n} with non-constant ${t}${r}`)}}),f.version!==`1.7.4`&&(f.isStarted=!0);let Oe=new Set(h.flatMap(e=>e.module.instances.map(e=>e.module))),ke=r.createDefinitionOrder();return{environment:Te,assumptions:_e,variableLocations:O.variableLocations,instanceActions:S,startupDefinitions:h.filter(e=>!Oe.has(e.module.name)||KS(e).length===0).flatMap(e=>ke(e===O?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:h.flatMap(e=>E.get(e.module.name)??[]),moduleOperators:ge,rootName:i.name}},iC=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),aC=(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},oC=t=>e.at(new e.b(`${e.G}${t}`),e.nt.error),sC=e=>{let t=L(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!Pt(e)||!Pt(i))throw oC(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},cC=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${lC(t)}`:n},lC=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(lC).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${cC(e.pattern,e.set)}:${lC(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(lC).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${lC(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>cC(e.pattern,e.set)).join(`,`)}|->${lC(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(lC);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},uC=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,dC=(t,n,r)=>{let i=n.definitions.get(t);if(i===void 0&&!n.constants.has(t))throw new e._(`The symmetry function ${t} specified in the configuration file\nis not defined in the specification.`);if(i?.kind!==`Operator`||i.params.length>0)throw oC(`The symmetry function ${t} must specify a set of permutations.`);let a=e=>W(e,{environment:n,scope:void 0,state:void 0,next:void 0}),o=a(i.body);if(!P(o)||!F(o))throw oC(`The symmetry operator must specify a set of functions.`);let s=I(o).elements;if(!s.every(Nt))throw oC(`The symmetry values must be function records.`);let c=i.body,l=c.kind===`Apply`?c.args:c.kind===`SetEnumeration`?c.elements:[],u=new Map(r.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),d=e=>{if(e.length===0)return;let t=e.map(e=>{let t=lC(uC(e)?e.args[0]:e);return u.get(t)??t}),r=e.length>1;n.runtime.warn(qe.symmetrySetTooSmall,`The set${r?`s`:``} ${t.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(l.length>=s.length){d(l);return}let f=/* @__PURE__ */ new Map;s.map(sC).forEach(e=>{e.size>0&&f.set(iC(e),e)});let p=[...f.values()],m=0;for(;m<f.size;){let e=[...f.values()],t=e.length;p.forEach(n=>e.slice(m,t).forEach(e=>{let t=aC(n,e),r=iC(t);t.size>0&&!f.has(r)&&f.set(r,t)})),m=t}let h=new Set([...f.values()].flatMap(e=>[...e.values()].map(e=>e.name))),g=new Set(r.map(e=>e.name));if(d(l.filter(e=>{if(!uC(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||g.has(t.name))return!1;let n=a(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>Pt(e)&&h.has(e.name))})),f.size!==0)return[...f.values()]},fC=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=mC(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(mC(e[r],t));return a}},pC=(e,t)=>{let n=[],r=[];for(let i of e){let e=mC(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(bn);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(bn(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},mC=(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=pC(e.elements,t);return n?Tn(n):e}if(n===`Function`||n===`LazyFunction`&&F(e.domain)){let n=L(e),r=fC(n.domain,t),i=fC(n.range,t)??n.range;if(r){let e=Sr(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Dn(n.domain,e.range):e}return i===n.range?n:Dn(n.domain,i)}if(n===`Interval`||!P(e)||!F(e))return e;let r=I(e),i=fC(r.elements,t);return i?gr(i):r},hC=(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]=mC(e[o],i),a===0&&(a=bn(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},gC={line:0,column:0},_C=e=>({kind:`Identifier`,name:e,location:gC}),vC=e=>({name:e,expression:_C(e),scope:void 0}),yC=/* @__PURE__ */ new Set([`name`,`property`]),bC=(t,n,r)=>{let i=Lh(n,r);if(!i)throw new e._(`The ${t} ${n} specified in the configuration file\nis not defined in the specification.`);if(i.kind===`Operator`&&i.params.length>0)throw new e._(yC.has(t)?`TLC requires ${n} not to take any argument.`:`TLC requires ${t} not to take any argument, but one was given: ${n}`);return i},xC=e=>e.body.kind===`Number`||e.body.kind===`String`,SC=(t,n,r)=>{if(r.constants.has(t))return r.constants.get(t);if(wu(n,r)&&!xC(n))try{return W(_C(t),qC(r,void 0,void 0))}catch(t){if(t instanceof e.b||e.tt(t))return;throw t}},CC=(t,n,r)=>{if(r.constants.has(n))throw new e._(`The ${t} ${n} cannot be a constant.`);let i=bC(t,n,r);if(SC(n,i,r)!==void 0)throw new e._(`The ${t} ${n} cannot be a constant.`);return i},wC=(t,n,r)=>{let i=r.constants.has(n)?void 0:bC(t,n,r),a=i?SC(n,i,r):r.constants.get(n);if(a!==void 0&&a!==!0)throw new e._(`The ${t} of ${n} is equal to ${R(a)}`);return a===void 0?i:void 0},TC=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},EC=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),fg(e.startupDefinitions,r),t.invariants.forEach(e=>{wC(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},DC=(t,n)=>{let r=ou({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>n.definitions.get(e)});return t.flatMap(t=>{let i=wC(`invariant`,t,n);if(!i)return[];let a=r.analyzeDefinition(i,/* @__PURE__ */ new Map);if(a.level>=2){let n=a.params.size===0?``:`
|
|
1788
|
+
the name of a theorem, assumption, or step.`})));return C(s,t)},Lt=()=>{let e=o,t=b(w()),n=O(`NEW`),r=i?o:e,a=i?b(w()):t,s=w().kind===`Keyword`?qx.get(w().text):void 0;if(!n&&s===void 0)throw ue(`Expected a declaration but found ${T(w())}`);if(s!==void 0&&D(),s===`Variable`){let e=ge();return At(e.name),C({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:a},r)}let c=ft();At(c.name);let l=(s??`Constant`)===`Constant`&&E(`\\in`);if(l&&c.arity>0)throw ce(`declared symbol with arguments before \\in`);return l&&D(),C({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?N():void 0,nameRange:c.location.range,location:a},r)},Rt=()=>{if(w().kind===`Identifier`&&E(`::`,1)&&E(`ASSUME`,2)&&(D(),D()),E(`ASSUME`))return jt(Bt);if(w().kind===`Keyword`&&Jx.has(w().text))return i?fe(Lt):Lt();if(!i)return N();let e=de(N);if(e===void 0)throw ue(`Expected a hypothesis`);return e},zt=()=>{let e=[Rt()];return pe(()=>{for(;;){let t=de(()=>(k(`,`),Rt()));if(t===void 0)break;e.push(t)}}),e},Bt=()=>{let e=o,t=b(k(`ASSUME`)),n=()=>{let n=i?zt():A(Rt);return k(`PROVE`),C({kind:`AssumeProve`,assumptions:n,conclusion:N(),location:t},e)};return i?fe(n):n()},Vt=e=>{let t=0;for(;w(t).kind===`Identifier`&&E(`,`,t+1);)t+=2;return w(t).kind===`Identifier`&&E(e,t+1)},Ht=(e,t)=>{e.forEach(At),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(At))},Ut=()=>{let e=w();if(E(`USE`)||E(`HIDE`))return It();if(!i&&E(`INSTANCE`)){let t=o;return C(dt(void 0,[],!1,b(e)),t)}if(E(`DEFINE`)||_t()){let t=o;O(`DEFINE`);let n=[ct(!1)];for(;_t();)n.push(ct(!1));let r={kind:`Define`,definitions:n,location:b(e)};return C(r,t)}if(O(`HAVE`))return{kind:`Have`,expression:N()};if(O(`TAKE`)){let e=Se(),t=_e(e?[]:A(ge)),n=e?Te():[];return Ht(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(O(`WITNESS`))return{kind:`Witness`,expressions:A(()=>N())};if(O(`PICK`)){let e=Vt(`:`),t=_e(e?A(ge):[]),n=e?[]:Te();return Ht(t.names,n),k(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:N()}}return O(`CASE`)?{kind:`Case`,expression:N()}:{kind:`Assert`,isSuffices:O(`SUFFICES`),statement:E(`ASSUME`)?Bt():N()}},Wt=e=>{let t=w();if(t.kind!==`Step`)throw ue(`Expected a step number but found ${T(t)}`,t);if(!Tt(t))throw ce(`${e?`QED step`:`step`}'s number has bad level`,t);if(n!==`sany`&&bt(t)<0&&Ct(t)!==void 0)throw ce(`<*> and <+> cannot be used for a named step`,t);return o++,{name:Ct(t),token:t.text,location:b(t)}},Gt=()=>{let e=o,t=Wt(E(`QED`,1)),n=o,r=/* @__PURE__ */ new Set;p.push(r);let i=O(`QED`)?{kind:`Qed`}:Ut(),a=S(e),s=S(n),c=wt(w());if(c&&!Fx.has(i.kind))throw ce(`Proof of a step that does not take a proof`);let l=c?Jt():void 0;return p.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(At),C({...t,body:i,head:a,statement:s,proof:l},e)},Kt=e=>{if(O(`BY`)){let t=S(o-1);return{kind:`By`,isOnly:O(`ONLY`),...Ft(),keyword:t,location:e}}let t=w();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;D();let n=S(o-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},qt=()=>{let e=b(w());O(`PROOF`);let t=Kt(e);if(t)return t;let n=[Gt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(Gt());return{kind:`Steps`,level:yt(),steps:n,location:e}},Jt=()=>{let e=o;vt.push(-1);let t=jt(qt);return vt.pop(),C(t,e)},Yt=()=>w().kind===`Step`||w().kind===`Keyword`&&Px.has(w().text),Xt=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return Vx(e);let n=t.defs[t.defs.length-1]?.location.range;return Bx(Vx({...e,end:e.start}),Vx(n??t.keyword))},Zt=()=>{let e=o,t=b(w()),n=O(`PROOF`),r=Kt(t);if(r){let t=C(r,e);return{kind:`Leaf`,proof:t,span:Vx(t.keyword),first:e,end:o-1}}let i=w();if(i.kind!==`Step`)throw ue(`Expected a step number but found ${T(i)}`);let a=o;D();let s=o,c=O(`QED`)?{kind:`Qed`}:Ut(),l=S(a);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:S(s),span:Xt(l,c),first:e,start:a,end:o-1}},Qt=(e,t,n,r)=>{let i=e[t];if(!i)return{proof:void 0,span:r,next:t,end:void 0};if(i.kind===`Leaf`)return{proof:i.proof,span:i.span,next:t+1,end:i.end};let o=$t(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={...b(a[i.first]),range:S(i.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},$t=(e,t,n,r,i)=>{let a=e[t];if(!a)throw Gx(`Unexpected end of (sub)proof at level ${n} before QED step`,r,Wx);if(a.kind===`Leaf`)throw Gx(`Expecting a proof step but found a${Rx[a.proof.kind]} leaf proof`,a.span,Wx);if(!i&&a.isProof)throw Gx(`PROOF keyword found in step that does not begin subproof`,a.span,Ux);let o=a.token.text[1];if(o===`+`&&!i)throw Gx(`<+> used but no subproof expected`,a.span,Ux);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:bt(a.token);if(s<n||!i&&s>n)return;let c=Fx.has(a.body.kind)?Qt(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:{...b(a.token),range:S(a.start,l)}},d=Bx(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=$t(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:Bx(d,f.span)}},en=()=>{if(!Yt())return;let e=[];for(;Yt();)e.push(Zt());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=Qt(e,0,0,t.span),r=e[n.next];if(r)throw Gx(`extra step(s) after finished proof`,r.span,Hx,`Proof.Parser.toplevel`);return n.proof},tn=(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})},nn=()=>{if(w().kind!==`Identifier`||!E(`==`,1))return;let e=he();return f.add(e),D(),e},rn=()=>{if(!i)return N();let e=ie(),t=de(N);if(t)return t;throw ue(`Expected "====" but found ${T(e)}`,e)},an=e=>{let t=o,n=D(),r=nn(),a=jt(()=>{let e=E(`ASSUME`)?Bt():rn();return i?{statement:e,proof:en()}:{statement:e,proof:wt(w())?Jt():void 0}}),s=a.statement,c=C({name:r,statement:s,proof:a.proof,location:b(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&s.kind!==`AssumeProve`&&tn(e,r,s,c.location)},on=()=>{let e=o,t=D(),n=nn();return C({name:n,expression:N(),isAxiom:t.text===`AXIOM`,location:b(t)},e)},sn=()=>{let e=b(k(`----`));k(`MODULE`);let t=be();k(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(m.push(n),d.push(/* @__PURE__ */ new Set),O(`EXTENDS`)&&A(()=>{let e=o;n.extends.push(be()),n.extendsRanges.push(S(e))});;){let t=o,r=w();if(r.kind===`ModuleEnd`)return e.range={module:m[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},m.pop(),d.pop(),n;if(r.kind===`Separator`){if(E(`MODULE`,1)){let e=sn();n.modules.push(e),n.units.push({kind:`Module`,module:e}),k(`====`);continue}D()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=b(D()),r=mt();n.constants.push(...r),e.range=S(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=b(D()),r=A(()=>{let e=o,t=b(w());return C({name:he(),arity:0,location:t},e)});n.variables.push(...r),e.range=S(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=on();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&tn(n,e.name,e.expression,e.location);continue}case`USE`:case`HIDE`:{if(E(`USE`)&&E(`ONLY`,1))throw ue(`Expected a module unit but found ${T(r)}`);let e=It();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=b(D()),r=ht();e.range=S(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:cn(n,C(dt(void 0,[],!1,b(r)),t));continue;case`LOCAL`:if(D(),E(`INSTANCE`)){cn(n,C(dt(void 0,[],!0,b(r)),t));continue}cn(n,C(ut(!0),t));continue}r.kind===`Keyword`&&Nx.has(r.text)?an(n):cn(n,ct(!1))}}},cn=(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}))},ln=sn(),un=ye?hx(t):void 0;if(un!==void 0)throw new e.F(un);return ln},iS=e=>rS(e,`tlc`),aS=(e,t)=>rS(e,`tlc`,t),oS=e=>rS(e,`tlapm`),sS=e=>rS(e,`sany`),cS=`$subexpression`,lS=(t,n)=>new e.F(`${t} at line ${n.line}, column ${n.column}`),uS=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return uS(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of ze(e)){let e=uS(r,t,n);if(e)return e}},dS=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),fS=(e,t)=>{let n=e.location,r=dS(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 lS(`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 lS(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:cS,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:cS,args:e.args,location:n,resolution:ws},location:n}},pS=(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:ws})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:ws}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:ws};return fS({...t,params:[...t.params,...r]},a)},mS=(t,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s=0,c,l=!1,u=(n,i)=>{if(!n)throw lS(i,a);Es.set(r,{args:t.slice(0,s).flatMap(e=>`args`in e?e.args:[]),error:{location:e.X(n),message:i}}),l=!0},d=e=>{let r=[],i=[];for(;s<t.length;){let o=t[s];if(o.kind!==`Name`)throw lS(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=e?e.find(e=>Jc(e)===c):n(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s++}throw lS(`Unknown operator ${r.join(`!`)}`,a)},f=e=>{let n=d(e),l=n.definition,f=js(l),p=s===t.length-1;if(n.args.length!==f&&(!i||n.args.length!==0))return u(r.argumentRanges?.[s]??a.range,`The operator ${n.name} requires ${f-n.earlier} arguments.`);if(p)return{definition:l,args:n.args};if(l.kind!==`Operator`)throw lS(`Cannot select a subexpression of ${l.name}`,a);o.params.push(...l.params),o.args.push(...n.args),c=l.body,s++},p=()=>{for(;s<t.length&&!l;){let e=t[s];if(e.kind!==`Name`)return;let n=r.selectorRanges?.[s],a=c&&uS(c,e.name,[]);if(!a)return u(n,`Cannot find label \`${e.name}'.`);let l=a.label.params;if(!i&&e.args.length!==l.length)return u(n,`Label \`${e.name}' used with wrong number of arguments.`);o.lets.push(...a.lets),o.params.push(...l.map(e=>({name:e,arity:0}))),o.args.push(...e.args),c=a.label.body,s++}},m=e=>{if(!c)throw lS(`Subexpression selection failed`,a);if(e.kind===`Colon`)return;if(c.kind===`Label`){c=c.body,m(e);return}if(c.kind===`Let`){if(e.kind!==`Operand`||Qs(e.operand,1)!==0)throw lS(`A LET/IN expression has only one operand`,a);o.lets.push(c.definitions),c=c.body;return}let n=nc(c);if(n&&(e.kind===`Bound`||e.kind===`At`)){o.params.push(...n.names.map(e=>({name:e,arity:0}))),e.kind===`Bound`&&o.args.push(...e.args),c=n.body;return}if(c.kind===`Case`&&e.kind===`Operand`){let n=[...c.arms,...c.other?[{condition:void 0,body:c.other}]:[]],r=n[Qs(e.operand,n.length)],i=t[s+1];if(!r||i?.kind!==`Operand`)throw lS(`A subexpression of CASE must have the form !i!j`,a);s++;let o=Qs(i.operand,2),l=o===0?r.condition:o===1?r.body:void 0;if(!l)throw lS(`Nonexistent CASE operand`,a);c=l;return}if(e.kind!==`Operand`)throw lS(`Unexpected subexpression selector`,a);let r=n?n.sets:rc(c),i=r?.[Qs(e.operand,r.length)];if(!i)throw lS(`Nonexistent operand specified by the selector`,a);c=i},h=f(void 0);if(l)return r;if(h)return pS(h.definition,{...o,args:h.args});for(p();s<t.length&&!l;){let e=t[s];if(e.kind===`Name`){for(;c?.kind===`Label`;)c=c.body;if(c?.kind!==`Let`)throw lS(`A name selector here must be from a LET clause`,a);o.lets.push(c.definitions);let e=f(c.definitions);if(l)return r;if(e)return pS(e.definition,{...o,args:[...o.args,...e.args]});p()}else m(e),s++}if(l)return r;if(!c)throw lS(`Subexpression selection failed`,a);return fS(o,c)},hS=(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 $s(e,t,n)},gS=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||ze(e).some(gS),_S=(e,t,n,r=!1)=>{if(!gS(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Zc(e,e=>_S(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>vS(e,r,n))}:i}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>_S(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Zc(e,e=>_S(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?hS(a.name,[],void 0,t):a.kind===`Apply`?hS(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=mS(o,t,a,r);return c!==a&&Ts.add(c),c},vS=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:_S(e.expression,t,n,!0)}))}),yS=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},bS=(e,t)=>vS(e,yS(t.definitions),()=>!1),xS=(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=yS([...t,...e.definitions]),a=e=>n.has(e),o=yS([...t,...e.definitions,...r]),s=e=>_S(e,o,e=>a(e)&&r.every(t=>t.name!==e)),c=e=>a(e)||!i(e),l=e=>_S(e,i,c),u=e=>e.map(e=>e.kind===`ModuleFact`?e:l(e)),d=e=>e.map(e=>({...e,set:l(e.set)})),f=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&l(e.set)}:f(e)),conclusion:l(e.conclusion)}:l(e),p=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:u(e.facts)};case`Instance`:return vS(e,i,c);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?vS(e,i,c):Xc(e,l))};case`Have`:case`Case`:return{...e,expression:l(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(l)};case`Take`:return{...e,bounds:d(e.bounds)};case`Pick`:return{...e,bounds:d(e.bounds),body:l(e.body)};case`Assert`:return{...e,statement:f(e.statement)};default:return e}},m=e=>e?.kind===`By`?{...e,facts:u(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:p(e.body),proof:m(e.proof)}))}:e,h={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:f(e.statement),proof:m(e.proof)})),uses:e.uses.map(e=>({...e,facts:u(e.facts)}))};return e.definitions.some(e=>gS(e.body))||e.assumptions.some(e=>gS(e.expression))?{...h,definitions:e.definitions.map(e=>Xc(e,s)),assumptions:e.assumptions.map(e=>({...e,expression:s(e.expression)}))}:h},SS=(e,t)=>e.maxLevels[t]??3,CS=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=ou({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(e,a),a},i=/* @__PURE__ */ new Map,a=e=>{let n=i.get(e);if(n)return n;let a=t(e),o=r(e),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Il(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Il(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ll(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Nl(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)&&Il(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(su(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c};return n=>{let i=/* @__PURE__ */ new Map,o=e.X(n.location.range??{module:n.instancer,start:n.location,end:n.location}),s=e=>i.set(`${o}\n${e}`,{location:o,message:e}),c=t(n.module),l=a(n.module),u=r(n.instancer),d=/* @__PURE__ */ new Map;n.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...c.constants.map(e=>({...e,maximumLevel:0})),...c.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let t=n.substitutions.get(e.name);if(!t)return[];if(e.arity===0){let n=u.analyze(t,d);return[{...e,level:n.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(t,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,t)=>`Level error in instantiating module '${n.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${t}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&s(p(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${n.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let t=l.constraints.get(e.name);t!==void 0&&e.level>t&&s(p(e.name,t));let r=e.operator;if(r)for(let t=0;t<e.arity;t++){let i=l.argConstraints.get(jl(e.name,t));i!==void 0&&SS(r,t)<i&&s(`Level error in instantiating module '${n.module}':\nThe level of the argument ${t+1} of the operator ${r.name} \nmust be at least ${i}.`)}}),l.argParams.forEach(e=>{let t=Nl(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=SS(r,t.index);i.level>a&&s(`Level error when instantiating module '${n.module}':\nThe level of the argument ${t.index} of the operator ${t.operator}' \nmust be at most ${a}.`)}),i.size>0)throw e.q([...i.values()])}},wS=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],TS=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),ES=new Map(Df.flatMap(e=>e.map(t=>[t,e[0]]))),DS=e=>ES.get(e)??e,OS=()=>{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}}},kS=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:Ve(e)&2147483647,kind:t,isLocal:n}),AS=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:DS(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:DS(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}},jS=(e,t)=>{let n=[];for(let r=t;;){let t=AS(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},MS=e=>({line:e.line,column:e.column}),NS=(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=jS(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},PS=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,FS={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},IS=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&PS(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&PS(e[n+1],e[n+2])?n+=PS(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=>FS[e])}"`:r.text)}return t},LS=e=>e[2]?.text,RS=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},zS=(e,t)=>e.find(e=>e.name===t)??e.map(e=>zS(e.modules,t)).find(Boolean),BS=e=>{let t=e===void 0?[]:re(e),n;return{tokens:t,ranges:RS(t),getModule:()=>n??=e===void 0?iS(``):aS(e,t)}},VS=(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=BS(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)??jf.get(i)??Pf.get(i)??nS(e,i),c=a(s),l=c.tokens,u=c.ranges.get(LS(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:()=>zS(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()}},HS=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=jS(t,e+1);i.push({location:MS(t[e]),apply:e=>r.forEach(t=>e.put(kS(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:MS(n),apply:t=>t.put(kS(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`&&jS(t,u+1).every(e=>s.has(e))&&o(u,`definition`),TS.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(MS(n)),i.push({location:MS(n),apply:e=>e.put(kS(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(kS(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=DS(e.name);i.push({location:e.location,apply:n=>n.put(kS(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(kS(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(kS(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>As(e.location,t.location)?-1:+!!As(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=OS();n.set(i??``,o),Ef.toReversed().forEach(e=>o.put(kS(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)}}},US=(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)};n.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),Of.forEach(i);let o=e=>{let n=t(e);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=NS(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;IS(o(void 0)).forEach((e,t)=>{t===3&&Af.forEach(i),i(e)});let y=l(void 0);for(;;){let n=h(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!n)break;let[r,a]=n;if(d.add(`${r.key}>${a}`),v.set(r.unit,[...v.get(r.unit)??[],a]),!_.has(a)){if(_.add(a),t(a).tokens.length===0){let n=r.unit??LS(t(void 0).tokens);throw e.K(a,n)}IS(o(a)).forEach(i)}}wS.forEach(i);let b=/* @__PURE__ */ new Set,x=e=>{if(b.has(e))return;b.add(e);let t=v.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(x),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return x(void 0),kf.forEach(i),[...r]},WS=(e,t)=>{let n=VS(e,t),r=n.getParsed,i,a=()=>i??=HS(r);return{getStringOrder:e=>US(r,e),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},GS=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),KS=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],qS=(t,n,r)=>{try{return r.parseModule(t)}catch(r){if(!(r instanceof e.F))throw r;let i=hx(t);throw i===void 0?r:e.q([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},JS=t=>new e.F(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),YS=(t,n)=>t.location.range&&n.location.range&&{location:e.X(t.location.range),message:`Multiply-defined module '${t.name}': this definition or declaration conflicts \nwith the one at ${e.X(n.location.range)}.`},XS=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,ZS=e=>e===`Theorem`?`ThmOrAssumpDefNode`:XS(e),QS=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:hl(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),$S=(e,t)=>{let n=Be(e);return n!==void 0&&t.has(n)||ze(e).some(e=>$S(e,t))},eC=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(ul(e),n.get(e)??n.size)),n},tC=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),nC=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Sh(e);if(e.kind===`Number`&&!Lt(e.value))throw Ch(e);nC(e.kind===`Let`?[...ze(e),...tC(e.instances??[])]:ze(e))}),rC=(t,n)=>{let r=n.order??WS(n.source,n.loadModule),i=r.parseModule(n.source),a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Set,l=/* @__PURE__ */ new Set,u=new Map(Gf.map(e=>[e.name,e])),d=/* @__PURE__ */ new Map,f=$d(t.checkDeadlock,n.seed);f.isWarningEnabled=n.isWarningEnabled??!0,f.isTool=n.isTool??!1,f.version=n.version??`master`,f.readLine=n.readLine;let p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,h=[],g=/* @__PURE__ */ new Map,_=[],v=[],y=(e,t)=>_.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),b=0,x=e=>`${e}#${b++}`,ee=[],te=[],ne=CS(e=>{let t=m.get(e)??se(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>a.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>a.get(t.visible.get(e)?.key??e)}}),S=/* @__PURE__ */ new Map,re=/* @__PURE__ */ new Map,C=/* @__PURE__ */ new Map,ie=e=>{let t=d.get(e);if(t)return t;let r=pp(e,n.print,f,n.files,u);if(!r)return;dp.get(e)?.forEach(ie);let i=/* @__PURE__ */ new Map;return fp.get(e)?.forEach(e=>ie(e)?.forEach((e,t)=>i.set(t,e))),r.forEach(t=>{u.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Ol.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Al(e,t.name)??i.get(t.name)?.range})}),d.set(e,i),i},w=e=>{let t=dp.get(e)??[];if(e===`TLCExt`||[e,...t].some(e=>n.loadModule?.(e)!==void 0))return;let r=ie(e);return r&&y(e,t),r&&t.includes(`Integers`)&&ie(`Integers`),r},T=e=>(nC([...e.definitions.flatMap(Re),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...tC(e.instances)]),e.modules.forEach(T),e);T(i);let ae=(t,i)=>{let a=n.loadModule?.(t)??If(f.version).get(t)??nS(n.source,t);if(a===void 0)throw e.K(t,i);let o=qS(a,t,r);if(o.name!==t)throw e.q([{location:`Unknown location`,message:`File name '${t}' does not match the name '${o.name}' of the top level module it contains.`}],!0);return T(o)},oe=t=>{let n=v.indexOf(t.name);if(n!==-1){let r=[...v.slice(n),t.name].map(e=>`${e}.tla`);throw new e.F(`Circular dependency among .tla files; dependency cycle is: ${r.join(` --> `)}`)}let r=/* @__PURE__ */ new Set,i=[],a=[],o=[];v.push(t.name),_.push(r);let s=D(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:te,levelChecks:o});if(_.pop(),v.pop(),a.length>0)throw e.q(a,!1,void 0,te);let c=i.find(e=>r.has(e.name)),l=c&&p.get(c.name),u=l&&YS(c,l.module);if(u)throw e.q([u],!1,void 0,te);if(c)throw JS(c);return o.forEach(e=>e()),{linked:s,closure:r}},se=(t,r)=>{let i=p.get(t);if(i)return y(t,g.get(t)??[]),i;let o=oe(ae(t,r)),s=/* @__PURE__ */ new Map;return up(t,n.print,f,n.files,u,(t,n,r)=>{let i=s.get(t),a=n.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(i?.kind!==`Operator`||!r||a.length!==n.length)throw new e.b(`No definition of ${t} to fall back to`);return W(i.body,{environment:r.environment,scope:kg(hg(i),a,r),state:r.state,next:r.next,isKeepLazy:r.isKeepLazy})})?.forEach(e=>{let n=o.linked.visible.get(e.name);if(n?.kind!==`Definition`||n.arity!==e.arity&&GS.has(t))return;let r=a.get(n.key);r&&s.set(e.name,r),u.set(n.key,e),a.delete(n.key)}),p.set(t,o.linked),g.set(t,o.closure),y(t,o.closure),o.linked},ce=(e,t,n,r,i)=>{let u=i?void 0:w(e.module);if(u)return le(e,u);let d=i??se(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=KS(d),p=`#${b++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=zc(bS(e,t),f,t,n);ee.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=>l.add(e));let _=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,v=Cl({params:g,substitutions:new Map([...h].map(([e,t])=>[e,Gc(t,m)])),variables:new Set(d.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>o.get(e)===!0,addDefinition:(n,i,l)=>{let u=x(`${i}@${t.name}`),d=l(u);return a.set(u,d),f.length>0&&c.add(d),e.name!==void 0&&re.set(u,`${e.name}!${re.get(n)??i}`),o.set(u,!r),s.set(u,{source:n,prefix:e.params.length}),u},createName:x,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return ue(e,d.exported,f,(t,n)=>{let r=e.name===void 0?v.getKey(t):v.getQualifiedKey(t);return f.length>0&&S.set(r,{name:n,location:e.location}),e.name!==void 0&&C.set(r,n),r})},le=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),ue=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:o.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},de=(e,t)=>Array.from({length:e},(e,n)=>({name:`argument${n}`,arity:t?.[n]??0})),fe=(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=de(t.arity,void 0);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:gl(r,n),location:n}}},pe=(e,t,n,r)=>{let i=e.location,s=r?void 0:w(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=de(n.arity,n.params);return _l(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??se(e.module,n),l=`#${b++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=KS(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};ee.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>$S(f(e),p),h=d.map(t=>{let n=fe(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),g=[],_=Cl({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:gl(e.params,i),location:i,resolution:ws}:hl(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>o.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:QS(a,i)),i},createName:x}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),a=de(n.arity,n.params),o=[...e.params,...a];return _l(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...g,...y]},me=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),E=/* @__PURE__ */ new Map,D=(t,r)=>{let s=Jy(t,n.loadClass?.(t.name),t===i);E.set(t.name,s.overrides);let c=s.module,l=ee.length,u=new Map([...Gf.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:Pc,errors:[],warnings:[]},p=[f],g=t=>t.forEach((t,n)=>{let r=_.get(n);if(!r){u.set(n,t),_.set(n,t);return}if(!r.range||!t.range||e.X(r.range)===e.X(t.range))return;let i=e.X(t.range),a=e.X(r.range);ZS(r.kind)===ZS(t.kind)?f.warnings.push({location:i,message:`Warning: the ${XS(r.kind)} of '${n}' conflicts with \nits ${XS(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${XS(t.kind)} of '${n}' conflicts with \nits ${XS(r.kind)} at ${a}.`})}),_=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,b=[],x=[...c.constants],S=c.variables.filter((e,t)=>c.variables.findIndex(t=>t.name===e.name)===t),re=S.map(e=>e.name),ie=S.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:w(e);if(n){g(n);return}let i=t??se(e,c.name);x.push(...i.constants.filter(e=>x.every(t=>t.name!==e.name)&&!re.includes(e.name))),i.variables.forEach((e,t)=>{re.includes(e)||x.some(t=>t.name===e)||(re.push(e),ie.push(i.variableLocations[t]))}),g(i.exported),i.facts.forEach(e=>v.add(e)),i.modules.forEach((e,t)=>y.set(t,e)),b.push(i)});let T=new Map(u),ae=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],oe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});ae.forEach(e=>_.set(e.name,oe(e)));let de=e=>({key:O(e),arity:js(e),params:Ms(e),kind:Fc(c,e)?`Theorem`:`Definition`,range:e.location.range}),fe=x.length===0&&re.length===0,O=e=>c===i?e.name:`${e.name}@${r.id}`,k=/* @__PURE__ */ new Map,he=()=>new Map([...r.modules,...y]),ge=e=>{let t=c.modules.find(t=>t.name===e.module);return t?As(t.location,e.location)?y.get(t.name):void 0:he().get(e.module)},_e=e=>({imported:u,getInstance:e=>{let t=ge(e),n=t?void 0:w(e.module);if(n)return{declarations:[],symbols:le(e,n),instancer:c.name};let r=t??se(e.module,c.name),i=KS(r);return{declarations:i,symbols:ue(e,r.exported,i,e=>e),instancer:c.name}},bound:T,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:O,instanced:k,facts:v,reports:p,warnings:r.warnings}),ve=e=>[...ae.filter(t=>As(t.location,e)).map(e=>[e.name,oe(e)]),...c.definitions.filter(t=>As(t.location,e)).map(e=>[e.name,de(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(u)),ye=e=>{let t=he(),n=t.get(e.name),i=n&&YS(e,n.module);if(n&&!i)throw JS(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};p.push(a);let o=D(e,{id:`${r.id}/${e.name}`,symbols:ve(e.location),modules:t,nested:r.nested,errors:a.errors,warnings:a.warnings,levelChecks:r.levelChecks});i&&a.errors.push(i),n||y.set(e.name,o)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=ce(e,c,_e(c),fe,he().get(e.module));k.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||_.set(n,t))})}})),...c.modules.map(e=>({location:e.location,link:()=>ye(e)}))].sort((e,t)=>As(e.location,t.location)?-1:1).forEach(e=>e.link());let be=xS(Dl(c,(e,t)=>pe(e,t,c.name,ge(e))),me(u));r.errors.push(...Vc(be,_e(be))),be.definitions.forEach(e=>{let t=O(e);a.set(t,e),o.set(t,!fe);let n=de(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!As(r,e.location))&&(u.set(e.name,n),e.isLocal||_.set(e.name,n))});let xe={module:be,constants:x,variables:re,variableLocations:ie,visible:u,exported:_,modules:y,extended:b,facts:/* @__PURE__ */ new Set([...v,...[...be.theorems,...be.assumptions].flatMap(e=>e.name??[])])};m.has(c.name)||m.set(c.name,xe);let A=ee.splice(l).map(e=>({location:e.location,check:()=>ne(e)}));return r.levelChecks.push(()=>cu(be,{constants:new Set(x.map(e=>e.name)),variables:new Set(re),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>C.get(u.get(e)?.key??e)},A,te)),h.push(xe),xe},O=oe(i).linked,k=n.traceFile,he=k===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:k}}],ge=[...n.moduleOperators??[],...he].map(e=>{let t=se(e.module,i.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});h.push(...h.splice(h.indexOf(O),1)),te.length>0&&!n.isSanyReported&&n.print(e.Z(te)),O.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)}),ge.forEach(e=>{let t=e.key===void 0?void 0:a.get(e.key);e.kind!==`postcondition`&&t&&a.set(e.operator,t)});let _e=[],ve=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>ve(e,t)),_e.push(...e.module.assumptions))};ve(O,/* @__PURE__ */ new Set);let ye=O.constants.map(e=>e.name),be=O.variables,xe=Fy(t,{root:O,moduleSymbols:new Map([...d,...[...p].map(([e,t])=>[e,t.visible]),[i.name,O.visible]]),definitions:a,builtins:u,copySources:s,operatorConstants:new Map(ge.flatMap(e=>se(e.module,i.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:r}),A=xe.constants,Se=xe.substitutions;k!==void 0&&u.forEach((e,t)=>{let n=Xf(e);n&&u.set(t,n)});let Ce=eC(be,h.flatMap(e=>e.module.variables.map(e=>e.name))),we=xu({definitions:a,substitutions:Se,constants:A,variableIndex:Ce,builtins:u,variables:be}),Te={runtime:f,definitions:a,builtins:u,constants:A,substitutions:Se,instanceNames:re,variables:be,variableIndex:Ce,facts:we,startupValues:Array.from({length:we.ids.size},()=>void 0),substitutedDefinitions:c,instanceParams:l,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Ee=ou({constants:new Set(A.keys()),variables:/* @__PURE__ */ new Set([...be,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>u.has(e))]),getDefinition:e=>Lh(e,Te)}),De=t=>{try{W(t,{environment:Te,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e.b)return t;throw t}};Se.forEach((t,n)=>{let r=a.get(t),i=ye.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&Ee.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?De(r.body):void 0;if(i){let r=it(i)?``:` - specifically: ${i.message}`;throw new e._(`The configuration file substitutes constant ${n} with non-constant ${t}${r}`)}}),f.version!==`1.7.4`&&(f.isStarted=!0);let Oe=new Set(h.flatMap(e=>e.module.instances.map(e=>e.module))),ke=r.createDefinitionOrder();return{environment:Te,assumptions:_e,variableLocations:O.variableLocations,instanceActions:S,startupDefinitions:h.filter(e=>!Oe.has(e.module.name)||KS(e).length===0).flatMap(e=>ke(e===O?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:h.flatMap(e=>E.get(e.module.name)??[]),moduleOperators:ge,rootName:i.name}},iC=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),aC=(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},oC=t=>e.at(new e.b(`${e.G}${t}`),e.nt.error),sC=e=>{let t=L(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!Pt(e)||!Pt(i))throw oC(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},cC=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${lC(t)}`:n},lC=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(lC).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${cC(e.pattern,e.set)}:${lC(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(lC).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${lC(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>cC(e.pattern,e.set)).join(`,`)}|->${lC(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(lC);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},uC=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,dC=(t,n,r)=>{let i=n.definitions.get(t);if(i===void 0&&!n.constants.has(t))throw new e._(`The symmetry function ${t} specified in the configuration file\nis not defined in the specification.`);if(i?.kind!==`Operator`||i.params.length>0)throw oC(`The symmetry function ${t} must specify a set of permutations.`);let a=e=>W(e,{environment:n,scope:void 0,state:void 0,next:void 0}),o=a(i.body);if(!P(o)||!F(o))throw oC(`The symmetry operator must specify a set of functions.`);let s=I(o).elements;if(!s.every(Nt))throw oC(`The symmetry values must be function records.`);let c=i.body,l=c.kind===`Apply`?c.args:c.kind===`SetEnumeration`?c.elements:[],u=new Map(r.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),d=e=>{if(e.length===0)return;let t=e.map(e=>{let t=lC(uC(e)?e.args[0]:e);return u.get(t)??t}),r=e.length>1;n.runtime.warn(qe.symmetrySetTooSmall,`The set${r?`s`:``} ${t.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(l.length>=s.length){d(l);return}let f=/* @__PURE__ */ new Map;s.map(sC).forEach(e=>{e.size>0&&f.set(iC(e),e)});let p=[...f.values()],m=0;for(;m<f.size;){let e=[...f.values()],t=e.length;p.forEach(n=>e.slice(m,t).forEach(e=>{let t=aC(n,e),r=iC(t);t.size>0&&!f.has(r)&&f.set(r,t)})),m=t}let h=new Set([...f.values()].flatMap(e=>[...e.values()].map(e=>e.name))),g=new Set(r.map(e=>e.name));if(d(l.filter(e=>{if(!uC(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||g.has(t.name))return!1;let n=a(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>Pt(e)&&h.has(e.name))})),f.size!==0)return[...f.values()]},fC=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=mC(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(mC(e[r],t));return a}},pC=(e,t)=>{let n=[],r=[];for(let i of e){let e=mC(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(bn);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(bn(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},mC=(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=pC(e.elements,t);return n?Tn(n):e}if(n===`Function`||n===`LazyFunction`&&F(e.domain)){let n=L(e),r=fC(n.domain,t),i=fC(n.range,t)??n.range;if(r){let e=Sr(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Dn(n.domain,e.range):e}return i===n.range?n:Dn(n.domain,i)}if(n===`Interval`||!P(e)||!F(e))return e;let r=I(e),i=fC(r.elements,t);return i?gr(i):r},hC=(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]=mC(e[o],i),a===0&&(a=bn(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},gC={line:0,column:0},_C=e=>({kind:`Identifier`,name:e,location:gC}),vC=e=>({name:e,expression:_C(e),scope:void 0}),yC=/* @__PURE__ */ new Set([`name`,`property`]),bC=(t,n,r)=>{let i=Lh(n,r);if(!i)throw new e._(`The ${t} ${n} specified in the configuration file\nis not defined in the specification.`);if(i.kind===`Operator`&&i.params.length>0)throw new e._(yC.has(t)?`TLC requires ${n} not to take any argument.`:`TLC requires ${t} not to take any argument, but one was given: ${n}`);return i},xC=e=>e.body.kind===`Number`||e.body.kind===`String`,SC=(t,n,r)=>{if(r.constants.has(t))return r.constants.get(t);if(wu(n,r)&&!xC(n))try{return W(_C(t),qC(r,void 0,void 0))}catch(t){if(t instanceof e.b||e.tt(t))return;throw t}},CC=(t,n,r)=>{if(r.constants.has(n))throw new e._(`The ${t} ${n} cannot be a constant.`);let i=bC(t,n,r);if(SC(n,i,r)!==void 0)throw new e._(`The ${t} ${n} cannot be a constant.`);return i},wC=(t,n,r)=>{let i=r.constants.has(n)?void 0:bC(t,n,r),a=i?SC(n,i,r):r.constants.get(n);if(a!==void 0&&a!==!0)throw new e._(`The ${t} of ${n} is equal to ${R(a)}`);return a===void 0?i:void 0},TC=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},EC=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),fg(e.startupDefinitions,r),t.invariants.forEach(e=>{wC(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},DC=(t,n)=>{let r=ou({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>n.definitions.get(e)});return t.flatMap(t=>{let i=wC(`invariant`,t,n);if(!i)return[];let a=r.analyzeDefinition(i,/* @__PURE__ */ new Map);if(a.level>=2){let n=a.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
1791
|
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw e.at(new e._(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${n}`),e.nt.safetyEvaluationFailure)}return[vC(t)]})},OC=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>OC(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Lh(e.name,t);if(n?.kind===`Operator`&&n.params.length===0&&dg(n,t)===void 0)return OC(n.body,t)}return[e]},kC=(t,n,r)=>{let i=t.expression;if(i.kind!==`Identifier`||Ev(i,t.scope,n)>0)return!1;let a=W(i,qC(n,void 0,void 0,t.scope));if(a===!1)throw new e._(`The spec is trivially false because ${i.name} is false.`);if(a!==!0)throw new e._(`The operator ${i.name}, which equals ${R(a)},\ncannot be used as a ${r}`);return!0},AC=(t,n,r,i,a)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return CC(t,e,n),_C(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[],isPropertyFairness:!1}}if(t.init!==void 0||t.next!==void 0)throw new e._(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let o=[],s=[],c=[],l=n.constants.has(t.specification)?n.constants.get(t.specification):SC(t.specification,bC(`name`,t.specification,n),n);if(l!==void 0)throw new e._(`The value of ${t.specification} is equal to ${R(l)}`);let u=bC(`name`,t.specification,n),d=t.properties.length===1?t.properties[0]:void 0,f=!1;Ov(u.body,void 0,n,!1).forEach(t=>{let l=t.expression;if(kC(t,n,`spec`))return;let u=l.kind===`Identifier`&&!j(l)?n.variableIndex.get(l.name):void 0;if(l.kind===`Identifier`&&u!==void 0){let t=r[u].range;throw new e._(`The operator ${l.name}, which equals ${t?e.X(t):l.name},\ncannot be used as a spec`)}if(l.kind===`UnboundedQuantifier`&&l.isTemporal)throw e.at(new e._(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.nt.error);if(l.kind===`Always`&&l.expression.kind===`BoxAction`){let r=iy(l.expression.subscript,t.scope,n);if(r===void 0&&a?.({kind:`warning`,code:qe.subscriptUndetermined,text:`TLC could not determine if the subscript of the next-state relation contains
|
|
1792
1792
|
all state variables. Proceed with fingers crossed.`}),i().filter(e=>r!==void 0&&!r.includes(e)).forEach(e=>a?.({kind:`warning`,code:qe.subscriptMissingVariable,text:`The subscript of the next-state relation specified by the specification\ndoes not seem to contain the state variable ${e}`})),s.length>0)throw new e._(`The specification contains more than one conjunct of the form [][Next]_v,
|
|
1793
|
-
but TLC can handle only specifications with one next-state relation.`);s.push({expression:l.expression.action,scope:t.scope});return}if(l.kind===`Always`&&l.expression.kind!==`Let`&&l.expression.kind!==`Label`&&Ev(l.expression,t.scope,n)<2)throw e.at(new e.b(`TLC cannot handle the temporal formula ${U(l.expression)}`),e.nt.error);let p=Ev(l,t.scope,n);if(p===3)d!==void 0&&t.path.includes(d)||(f=!0),c.push(t);else{if(p===2)throw new e._(`TLC cannot handle this conjunct of the spec:\n${U(l)}`);o.push(t)}});let p=[...o,...s],m=e=>`$specification${e}`,h=p.reduce((e,t,n)=>t.scope===void 0?e:{name:m(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),g=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:m(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:o.length===0?void 0:{kind:`And`,operands:o.map(g),location:gC},next:s.length===0?void 0:g(s[0],o.length),scope:h,temporals:c,isPropertyFairness:c.length>0&&!f}},jC=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=wC(`property`,t,n);if(!a)return;Ev(a.body,void 0,n)===1&&r?.({kind:`state-level-property`,name:t});let o=n.runtime.version!==`1.7.4`;Ov(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(kC(r,n,`property`))return;let o=r.name??t;if(a.kind===`Always`&&a.expression.kind===`BoxAction`){i.actionProperties.push({name:o,box:a.expression,action:a.expression.action,subscript:a.expression.subscript,scope:r.scope});return}if(a.kind===`Always`&&Ev(a.expression,r.scope,n)<=1){let e=a.expression,t=e.kind===`Identifier`&&!j(e)?Lh(e.name,n):void 0;i.invariants.push({name:t?.name??(e.kind===`Identifier`?e.name:o),expression:e,scope:r.scope});return}let s=Ev(a,r.scope,n);if(s<2)i.initialPredicates.push({name:o,expression:a,scope:r.scope});else{if(s===2){let t=U(a),n=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,r=a.kind===`BoxAction`?`To check that action ${o} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${t} (compare page 90 of ${n}).`:a.kind===`AngleAction`?`To check that infinitely many ${o} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${t} (compare page 91 of ${n}).`:`To check that action ${o} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${t}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${n}).`;throw new e._(`The formula ${o} at ${t} 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. ${r}`)}i.liveness.push({name:t,expression:a,scope:r.scope})}})}),i},MC=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},NC=(e,t,n)=>t.flatMap(t=>wC(e,t,n)?[vC(t)]:[]),PC=(e,t)=>{let n=Lh(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},FC=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e._(`_POSSIBLE lists ${r} more than once`);CC(`possible`,r,n);let a=vC(r);if(Ev(a.expression,void 0,n)===3)throw new e._(`The possible of ${r} is equal to a temporal formula; only state- and action-level predicates are supported`);return a}),IC=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||j(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},LC=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=Lh(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},RC=(e,t)=>e.flatMap(e=>OC(e.expression,t).map(n=>{let r=e.scope===void 0?Au(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:IC(n,r,t),predicate:LC(e.expression,t)}})),zC=(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},BC=/[\u0100-\uffff]/,VC=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),HC=e=>e.kind===`String`?BC.test(e.value):e.kind===`Set`&&e.elements.some(HC),UC=e=>e.kind===`String`&&BC.test(e.value)||e.kind===`Apply`&&VC.has(e.operator)||ze(e).some(UC),WC=(e,t)=>e.constants.some(e=>HC(e.value)||(e.args??[]).some(HC))||[...t.definitions.values()].some(e=>UC(e.body)||e.kind===`Function`&&e.bounds.some(e=>UC(e.set))),GC=e=>{if(!Nt(e))return;let t=Vt(L(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},KC=(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`},qC=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),JC=(e,t,n)=>Mh(W(e,t),n),YC=(t,n,r=ZC)=>{let i=W(t,n);if(typeof i!=`boolean`)throw new e.b(r(t,n.environment));return i},XC=(t,n,r)=>{let i=n.kind===`Identifier`?Lh(n.name,r):void 0,a=i?.kind===`Operator`?i.body:n,o=i?.kind===`Operator`?i.bodyRange:void 0;return`TLC expected a ${t} value, but did not find one. ${o&&a.kind!==`Number`?e.X(o):hh(a)}`},ZC=(e,t)=>XC(`boolean`,e,t),QC=(e,t)=>YC(e.expression,t,(n,r)=>(YC(e.predicate,t),ZC(n,r))),$C=()=>{},ew=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=JC(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),tw=(t,n)=>{try{return t(qC(n,void 0,void 0))?void 0:{message:void 0}}catch(t){if(t instanceof e.b)return{message:t.message};throw t}},nw=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=tw(e=>Ih(W(n.expression,e),n.expression),t);if(e)return{name:hh(n.expression),trace:[],message:e.message}}},rw=(e,t,n,r=!1)=>{let i=WS(t.source,t.loadModule);return $t(i.getStringOrder(e)),an(t),ja(t.fingerprintPolynomial??0),r&&en(),{order:i,specification:rC(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})}},iw=e=>{let t=typeof e.config==`string`?Le(e.config,e.version):e.config,n=rw(t,e,e.onPrint??console.log),r=n.specification;EC(r,t,e.onProgress);let i=r.environment,a,o=()=>a??=ry(t,i,r.instanceActions);return i.runtime.getSpecification=()=>cy(o(),t,i,r.variableLocations),{config:t,specification:r,environment:i,search:sw(t,i,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators),getDescription:o}},aw=(t,n,r)=>{let i=nw(t,n);if(!i)return;if(i.message===void 0){let t=`Assumption ${i.name} is false.`;return r(qe.assumptionFalse,t,t),e.nt.assumptionViolation}let a=`Evaluating assumption ${i.name} failed.\n${i.message}`;return r(qe.assumptionEvaluationError,a,N(qe.assumptionEvaluationError,a,!0)),e.nt.assumptionViolation},ow=t=>e.at(new e.b(`${e.G}Could not find operator: ${t.operator} in module: ${t.module}`),e.nt.error),sw=(t,n,r,i,a,o=[])=>{let s=e=>o.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw ow(e);return{name:e.operator,key:e.key}}),c=DC(t.invariants,n),l=AC(t,n,r,i,a),u=jC(t,n,a),d=t.properties[0],f=d&&Lh(d,n)?.location.range,p=t.specification,m=p&&Lh(p,n)?.location.range;l.isPropertyFairness&&f&&m&&a?.({kind:`warning`,code:qe.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${d} at ${e.X(f)} equals\nthe fairness constraints of the behavior specification ${p} at ${e.X(m)}.\nTherefore, checking whether ${p} => ${d} using TLC will never result in a violation of ${d}.`});let h=RC([...c,...u.invariants],n),g=[...new Map(h.map(e=>[e.predicate,e])).values()],_=h.length>0||u.actionProperties.length>0||u.liveness.length>0;if(l.init===void 0&&(_||u.initialPredicates.length>0||n.variables.length>0))throw new e._(n.runtime.version===`1.7.4`?Qe:`The configuration file did not specify the initial state predicate.`);if(l.next===void 0&&_)throw new e._(`The configuration file did not specify the next state predicate.`);let v=NC(`constraint`,[...t.constraints,...s(`constraint`).map(e=>e.name)],n),y=RC(v,n),b=NC(`action constraint`,t.actionConstraints,n),x=n.coverage,ee=(e,t,r=!0)=>t.flatMap(t=>{if(!x)return[];let i=r?LC(t.expression,n):t.expression,a=$a(r?t.name:void 0,i,n),o=Za(x,e,a,i,t.scope);return[{expression:i,scope:t.scope,node:o}]}),te=[...ee(`invariant`,c),...ee(`invariant`,u.invariants,!1)],ne=ee(`constraint`,b),S=ee(`constraint`,v),re=ee(`implied`,u.initialPredicates,!1),C=ee(`implied`,u.actionProperties.map(e=>({...e,expression:e.box})),!1),ie=(e,t,r,i)=>{try{return fo(e,t.node,()=>W(t.expression,qC(n,r,i,t.scope)))}catch{return}},w=(e,t,n)=>x!==void 0&&e.every(e=>ie(x,e,t,n)===!0),T=(e,t,n)=>{if(x){for(let r of e){let e=ie(x,r,t,n);if(typeof e!=`boolean`)return;if(!e)return x.primary[r.node]++,!1;x.secondary[r.node]++}return!0}};t.rlReward!==void 0&&bC(`rlreward`,t.rlReward,n),t.periodic!==void 0&&bC(`periodic`,t.periodic,n);let ae=FC(t.possible,n);if(n.variables.length===0)return;let oe=t.symmetry===void 0?void 0:dC(t.symmetry,n,t.substitutions),se=t.view===void 0?void 0:CC(`view function`,t.view,n),ce=t.view??s(`view`)[0]?.name,le=ce===void 0?void 0:vC(ce),ue=u.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:gC};return{...e,unchanged:t}}),de=e=>Ev(e.expression,void 0,n)>=2,fe=ae.filter(e=>!de(e)),pe=ae.filter(de),me=n.runtime,E,D=()=>{if(E)return E;let e=i(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return E=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),E},O=(e,t)=>W(e,qC(n,t,void 0)),k=e=>{let t=oe===void 0?e:hC(e,oe,D());return Ua(le===void 0?D().map(e=>t[e]):[O(le.expression,t)])},he=e=>w(re,e)?void 0:u.initialPredicates.find(t=>!YC(t.expression,qC(n,e,void 0,t.scope))),ge=/* @__PURE__ */ new WeakSet,_e=(t,r,i)=>{let a=i&&!ge.has(i)?i:void 0;if(zC(t,r,a))return!1;try{let e=qC(n,r,void 0,t.scope),i=t.membership;return a&&i?!Si(r[i.variable],a[i.variable],W(i.set,e)):!QC(t,e)}catch(n){throw i?dt(e.at(n,e.nt.safetyEvaluationFailure),qe.invariantEvaluationFailed,`Evaluating invariant ${t.name} failed.`):n}},ve=WC(t,n);me.getFingerprint=k;let ye=()=>{let t=ae.find(e=>!me.possibleCounts.get(e.name));if(!t)return;let r=PC(t.name,n),i=r?` at ${e.X(r)}`:``;return{name:t.name,code:qe.possibleUnwitnessed,message:`The _POSSIBLE predicate ${t.name}${i} 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:M(R(ef(me),!0))}},be=se?.body.kind===`Tuple`?se.body.elements:[],xe=be.flatMap(e=>e.kind===`Identifier`&&n.variables.includes(e.name)?[e.name]:[]),A=se?.body.kind===`Tuple`&&xe.length===be.length&&new Set(xe).size===xe.length,Se=(e,t)=>A?D().filter(e=>xe.includes(n.variables[e])).map(e=>`/\\ ${n.variables[e]} = ${M(R(t[e]))}\n`).join(``):M(R(O(e,t))),Ce=(t,r,i)=>YC(t.expression,qC(n,r,i),t=>`${e.G}${ZC(t,n)}`),we=e=>{let t=Object.fromEntries(D().map(t=>[n.variables[t],e[t]]));return le===void 0?t:sn(t,()=>Se(le.expression,e))};return{properties:u,spec:l,toRecord:we,evaluateAlias:(t,r,i,a)=>{try{CC(`alias`,t,n);let e=W(_C(t),qC(n,r,i)),a=GC(e);return a===void 0?we(r):ln(a,t)}catch(t){if(!(t instanceof e._||t instanceof e.b))throw t;return{...we(r),_ALIASEvalError:ot(t.message,a)}}},isSymmetric:oe!==void 0,isConstrained:y.length>0||b.length>0,getTypedChecks:e=>{if(x!==void 0||ae.length>0||t.periodic!==void 0||[...h,...y].some(e=>e.scope!==void 0)||b.length>0||u.actionProperties.some(e=>e.scope!==void 0)||u.liveness.length>0&&(e===void 0||le!==void 0)||l.init===void 0||l.next===void 0)return;let r=g.map(e=>e.predicate),i=[...new Set(y.map(e=>e.predicate))],a=u.initialPredicates.map(e=>e.expression),o=[...n.facts.ids.keys()],s=MC(l.scope),c=e=>dg(e,n)===void 0&&Du(e,n,`replayed`);return(s===void 0?o.some(c):o.some(e=>!(e.kind===`Operator`&&e.params.length>0)&&wu(e,n)&&c(e))||Eu([l.init,l.next,...r,...i,...a,...u.actionProperties.flatMap(e=>[e.action,e.subscript]),...le?[le.expression]:[],...s,...Oy(e??[])],n,`replayed`))?void 0:{init:l.init,next:l.next,scope:l.scope,invariants:r,constraints:i,holdsInitialPredicates:e=>he(e)===void 0,actionProperties:u.actionProperties,symmetry:oe,view:le?.expression,variableOrder:D(),liveness:e}},getTlcOrder:D,getStoredFingerprints:(e,t)=>le!==void 0||ve?BigInt64Array.from(e,k):Ga(t,D()),getFingerprintState:e=>{if(ve)return[String(k(e))];let t=oe===void 0?e:hC(e,oe,D());return le===void 0?t:[O(le.expression,t)]},findViolatedInvariant:(e,t)=>{if(w(te,e))return;let n=h.find(n=>_e(n,e,t));return n&&ge.add(e),n},getViolatedInvariants:e=>{let t=g.filter(t=>h.some(n=>n.predicate===t.predicate&&_e(n,e,void 0)));return t.length>0&&ge.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>YC(n,qC(t,e,void 0,r));y.every(e=>r(e.predicate,e.scope))&&n();let i=g.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=u.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(y.every(e=>YC(e.predicate,qC(n,t,void 0,e.scope)))&&b.every(r=>YC(r.expression,qC(n,e,t,r.scope))))||r())||g.every(e=>YC(e.predicate,qC(n,t,void 0,e.scope))))&&ue.every(r=>YC(r.box,qC(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>T(S,e)??y.every(r=>zC(r,e,t)||QC(r,qC(n,e,void 0))),findFailedInitialPredicate:he,findViolatedActionProperty:(e,t)=>w(C,e,t)?void 0:ue.find(r=>{try{return!YC(r.action,qC(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${U(r.box)}`)&&!JC(r.unchanged,qC(n,e,t,r.scope),`a subscript`)}catch(e){throw dt(cw(e),qe.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>T(ne,e,t)??b.every(n=>Ce(n,e,t)),getExcludingConstraints:(t,r)=>[...y.filter(e=>!QC(e,qC(n,r,void 0))),...b.filter(e=>!Ce(e,t,r))].map(t=>{let r=PC(t.name,n);return r?e.X(r):t.name}),trackStatePossible:fe.length===0?$C:e=>ew(fe,me,qC(n,e,void 0)),trackActionPossible:pe.length===0?$C:(e,t)=>ew(pe,me,qC(n,e,t)),findUnwitnessedPossible:ye,getReward:(r,i,a)=>{if(t.rlReward===void 0)return a;let o=_C(t.rlReward),s=W(o,qC(n,r,i));if(typeof s!=`number`)throw new e.b(XC(`integer`,o,n));return s},findPostconditionViolation:(r=!1)=>{let i=s(`postcondition`),a=t.postconditions.map(e=>{let t=Lh(e,n);return t?t.kind===`Operator`&&t.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!xC(t)&&dg(t,n)!==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(a!==void 0){if(r)return;throw e.at(new e.b(a),e.nt.configParseError)}let o=(t,r)=>{let i=tw(e=>YC(_C(r),e),n);if(!i)return;let a=Lh(r,n)?.body,o=PC(r,n),s=o?` at ${a?.kind===`Number`?hh(a):e.X(o)}`:``;return i.message===void 0?{name:t,code:qe.postconditionFalse,message:`Postcondition ${t}${s} is false.`}:{name:t,code:qe.postconditionFailed,message:`Evaluating postcondition ${t}${s} failed.\n${i.message}`}};for(let e of i){let t=o(e.name,e.key);if(t)return t}let c=ye();if(c)return c;for(let e of t.postconditions){let t=o(e,e);if(t)return t}}}},cw=t=>t instanceof e.k?e.at(t,t.exitCode):t,lw=(e,t)=>e*((t-e)/2**64),uw=e=>e.includes(`.`)?e:`${e}.0`,dw=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return uw(String(e));let[n,r]=e.toExponential().split(`e`);return`${uw(n)}E${r.replace(`+`,``)}`},fw=e=>e!==void 0&&e>=`0`&&e<=`9`,pw=e=>{if(e===0)return`0.0`;let t=dw(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;fw(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;fw(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;fw(t[n])&&r<2;)i+=t[n++],r++;for(fw(t[n])&&Number(t[n])>=5&&(i=mw(i));fw(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},mw=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${mw(r)}.`:n===`9`?`${mw(r)}0`:`${r}${Number(n)+1}`},hw=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}`)},gw=(e,t,n)=>{if(lw(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},_w=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}).`},vw=[void 0,`lambda`,`tuple`,`record`],yw=()=>{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=Ni(e.domain);return t?(a(7),a(vw.indexOf(An(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(vw.indexOf(An(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})}},bw=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 Cn(t.strings[n[r++]]);if(e===5)return Tn(i(n[r++]));let a=vw[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=jr({kind:`Interval`,low:e,high:e+t-1});return kn(Dn(o,i(t)),a)}let o=n[r++],s=i(o);return kn(Dn(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return ah}}),Object.defineProperty(exports,"$t",{enumerable:!0,get:function(){return I}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return ry}}),Object.defineProperty(exports,"At",{enumerable:!0,get:function(){return Ct}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return P_}}),Object.defineProperty(exports,"Bt",{enumerable:!0,get:function(){return Nr}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return oS}}),Object.defineProperty(exports,"Ct",{enumerable:!0,get:function(){return $a}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return Dy}}),Object.defineProperty(exports,"Dt",{enumerable:!0,get:function(){return Ra}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return ky}}),Object.defineProperty(exports,"Et",{enumerable:!0,get:function(){return za}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return N_}}),Object.defineProperty(exports,"Ft",{enumerable:!0,get:function(){return Pr}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return Wg}}),Object.defineProperty(exports,"Gt",{enumerable:!0,get:function(){return Dt}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return F_}}),Object.defineProperty(exports,"Ht",{enumerable:!0,get:function(){return R}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return T_}}),Object.defineProperty(exports,"It",{enumerable:!0,get:function(){return gr}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return Dg}}),Object.defineProperty(exports,"Jt",{enumerable:!0,get:function(){return Zr}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return U}}),Object.defineProperty(exports,"Kt",{enumerable:!0,get:function(){return wn}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return k_}}),Object.defineProperty(exports,"Lt",{enumerable:!0,get:function(){return Dn}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return Lv}}),Object.defineProperty(exports,"Mt",{enumerable:!0,get:function(){return Un}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return bv}}),Object.defineProperty(exports,"Nt",{enumerable:!0,get:function(){return Sr}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return oy}}),Object.defineProperty(exports,"Ot",{enumerable:!0,get:function(){return Pa}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return w_}}),Object.defineProperty(exports,"Pt",{enumerable:!0,get:function(){return Cn}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return rh}}),Object.defineProperty(exports,"Qt",{enumerable:!0,get:function(){return Ln}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return E_}}),Object.defineProperty(exports,"Rt",{enumerable:!0,get:function(){return Fr}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return sS}}),Object.defineProperty(exports,"St",{enumerable:!0,get:function(){return Ja}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Ay}}),Object.defineProperty(exports,"Tt",{enumerable:!0,get:function(){return La}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return j_}}),Object.defineProperty(exports,"Ut",{enumerable:!0,get:function(){return Wi}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return D_}}),Object.defineProperty(exports,"Vt",{enumerable:!0,get:function(){return ma}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return C_}}),Object.defineProperty(exports,"Wt",{enumerable:!0,get:function(){return Gi}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return dg}}),Object.defineProperty(exports,"Xt",{enumerable:!0,get:function(){return F}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return Lh}}),Object.defineProperty(exports,"Yt",{enumerable:!0,get:function(){return tn}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return Ig}}),Object.defineProperty(exports,"Zt",{enumerable:!0,get:function(){return Bn}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return EC}}),Object.defineProperty(exports,"_n",{enumerable:!0,get:function(){return Te}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return Eu}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return gw}}),Object.defineProperty(exports,"an",{enumerable:!0,get:function(){return lt}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return tm}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return nS}}),Object.defineProperty(exports,"bn",{enumerable:!0,get:function(){return re}}),Object.defineProperty(exports,"bt",{enumerable:!0,get:function(){return so}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return rw}}),Object.defineProperty(exports,"cn",{enumerable:!0,get:function(){return xt}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return Ff}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return nw}}),Object.defineProperty(exports,"dn",{enumerable:!0,get:function(){return ft}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return Df}}),Object.defineProperty(exports,"en",{enumerable:!0,get:function(){return qe}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return ih}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return qC}}),Object.defineProperty(exports,"fn",{enumerable:!0,get:function(){return vt}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return nf}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return TC}}),Object.defineProperty(exports,"gn",{enumerable:!0,get:function(){return Le}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return wu}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return aw}}),Object.defineProperty(exports,"hn",{enumerable:!0,get:function(){return ze}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return Nd}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return hw}}),Object.defineProperty(exports,"in",{enumerable:!0,get:function(){return ot}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return im}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return cy}}),Object.defineProperty(exports,"jt",{enumerable:!0,get:function(){return bn}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return sy}}),Object.defineProperty(exports,"kt",{enumerable:!0,get:function(){return Ua}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return ow}}),Object.defineProperty(exports,"ln",{enumerable:!0,get:function(){return _t}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return Pf}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return iw}}),Object.defineProperty(exports,"mn",{enumerable:!0,get:function(){return Ve}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return kd}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return yw}}),Object.defineProperty(exports,"nn",{enumerable:!0,get:function(){return Ze}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return Am}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return lw}}),Object.defineProperty(exports,"on",{enumerable:!0,get:function(){return ct}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return nm}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return KC}}),Object.defineProperty(exports,"pn",{enumerable:!0,get:function(){return st}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return of}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return W}}),Object.defineProperty(exports,"qt",{enumerable:!0,get:function(){return Et}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return pw}}),Object.defineProperty(exports,"rn",{enumerable:!0,get:function(){return N}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return oh}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return _w}}),Object.defineProperty(exports,"sn",{enumerable:!0,get:function(){return rt}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return rm}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return bw}}),Object.defineProperty(exports,"tn",{enumerable:!0,get:function(){return Je}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return sh}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return sw}}),Object.defineProperty(exports,"un",{enumerable:!0,get:function(){return it}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return If}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return cw}}),Object.defineProperty(exports,"vn",{enumerable:!0,get:function(){return _e}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return As}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return hx}}),Object.defineProperty(exports,"wt",{enumerable:!0,get:function(){return Do}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return iS}}),Object.defineProperty(exports,"xt",{enumerable:!0,get:function(){return ho}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return mC}}),Object.defineProperty(exports,"yn",{enumerable:!0,get:function(){return x}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return Za}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return I_}}),Object.defineProperty(exports,"zt",{enumerable:!0,get:function(){return Tn}});
|
|
1793
|
+
but TLC can handle only specifications with one next-state relation.`);s.push({expression:l.expression.action,scope:t.scope});return}if(l.kind===`Always`&&l.expression.kind!==`Let`&&l.expression.kind!==`Label`&&Ev(l.expression,t.scope,n)<2)throw e.at(new e.b(`TLC cannot handle the temporal formula ${U(l.expression)}`),e.nt.error);let p=Ev(l,t.scope,n);if(p===3)d!==void 0&&t.path.includes(d)||(f=!0),c.push(t);else{if(p===2)throw new e._(`TLC cannot handle this conjunct of the spec:\n${U(l)}`);o.push(t)}});let p=[...o,...s],m=e=>`$specification${e}`,h=p.reduce((e,t,n)=>t.scope===void 0?e:{name:m(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),g=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:m(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:o.length===0?void 0:{kind:`And`,operands:o.map(g),location:gC},next:s.length===0?void 0:g(s[0],o.length),scope:h,temporals:c,isPropertyFairness:c.length>0&&!f}},jC=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=wC(`property`,t,n);if(!a)return;Ev(a.body,void 0,n)===1&&r?.({kind:`state-level-property`,name:t});let o=n.runtime.version!==`1.7.4`;Ov(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(kC(r,n,`property`))return;let o=r.name??t;if(a.kind===`Always`&&a.expression.kind===`BoxAction`){i.actionProperties.push({name:o,box:a.expression,action:a.expression.action,subscript:a.expression.subscript,scope:r.scope});return}if(a.kind===`Always`&&Ev(a.expression,r.scope,n)<=1){let e=a.expression,t=e.kind===`Identifier`&&!j(e)?Lh(e.name,n):void 0;i.invariants.push({name:t?.name??(e.kind===`Identifier`?e.name:o),expression:e,scope:r.scope});return}let s=Ev(a,r.scope,n);if(s<2)i.initialPredicates.push({name:o,expression:a,scope:r.scope});else{if(s===2){let t=U(a),n=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,r=a.kind===`BoxAction`?`To check that action ${o} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${t} (compare page 90 of ${n}).`:a.kind===`AngleAction`?`To check that infinitely many ${o} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${t} (compare page 91 of ${n}).`:`To check that action ${o} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${t}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${n}).`;throw new e._(`The formula ${o} at ${t} 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. ${r}`)}i.liveness.push({name:t,expression:a,scope:r.scope})}})}),i},MC=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},NC=(e,t,n)=>t.flatMap(t=>wC(e,t,n)?[vC(t)]:[]),PC=(e,t)=>{let n=Lh(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},FC=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e._(`_POSSIBLE lists ${r} more than once`);CC(`possible`,r,n);let a=vC(r);if(Ev(a.expression,void 0,n)===3)throw new e._(`The possible of ${r} is equal to a temporal formula; only state- and action-level predicates are supported`);return a}),IC=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||j(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},LC=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=Lh(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},RC=(e,t)=>e.flatMap(e=>OC(e.expression,t).map(n=>{let r=e.scope===void 0?Au(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:IC(n,r,t),predicate:LC(e.expression,t)}})),zC=(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},BC=/[\u0100-\uffff]/,VC=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),HC=e=>e.kind===`String`?BC.test(e.value):e.kind===`Set`&&e.elements.some(HC),UC=e=>e.kind===`String`&&BC.test(e.value)||e.kind===`Apply`&&VC.has(e.operator)||ze(e).some(UC),WC=(e,t)=>e.constants.some(e=>HC(e.value)||(e.args??[]).some(HC))||[...t.definitions.values()].some(e=>UC(e.body)||e.kind===`Function`&&e.bounds.some(e=>UC(e.set))),GC=e=>{if(!Nt(e))return;let t=Vt(L(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},KC=(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`},qC=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),JC=(e,t,n)=>Mh(W(e,t),n),YC=(t,n,r=ZC)=>{let i=W(t,n);if(typeof i!=`boolean`)throw new e.b(r(t,n.environment));return i},XC=(t,n,r)=>{let i=n.kind===`Identifier`?Lh(n.name,r):void 0,a=i?.kind===`Operator`?i.body:n,o=i?.kind===`Operator`?i.bodyRange:void 0;return`TLC expected a ${t} value, but did not find one. ${o&&a.kind!==`Number`?e.X(o):hh(a)}`},ZC=(e,t)=>XC(`boolean`,e,t),QC=(e,t)=>YC(e.expression,t,(n,r)=>(YC(e.predicate,t),ZC(n,r))),$C=()=>{},ew=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=JC(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),tw=(t,n)=>{try{return t(qC(n,void 0,void 0))?void 0:{message:void 0}}catch(t){if(t instanceof e.b)return{message:t.message};throw t}},nw=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=tw(e=>Ih(W(n.expression,e),n.expression),t);if(e)return{name:hh(n.expression),trace:[],message:e.message}}},rw=(e,t,n,r=!1)=>{let i=WS(t.source,t.loadModule);return $t(i.getStringOrder(e)),an(t),ja(t.fingerprintPolynomial??0),r&&en(),{order:i,specification:rC(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})}},iw=e=>{let t=typeof e.config==`string`?Le(e.config,e.version):e.config,n=rw(t,e,e.onPrint??console.log),r=n.specification;EC(r,t,e.onProgress);let i=r.environment,a,o=()=>a??=ry(t,i,r.instanceActions);return i.runtime.getSpecification=()=>cy(o(),t,i,r.variableLocations),{config:t,specification:r,environment:i,search:sw(t,i,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators),getDescription:o}},aw=(t,n,r)=>{let i=nw(t,n);if(!i)return;if(i.message===void 0){let t=`Assumption ${i.name} is false.`;return r(qe.assumptionFalse,t,t),e.nt.assumptionViolation}let a=`Evaluating assumption ${i.name} failed.\n${i.message}`;return r(qe.assumptionEvaluationError,a,N(qe.assumptionEvaluationError,a,!0)),e.nt.assumptionViolation},ow=t=>e.at(new e.b(`${e.G}Could not find operator: ${t.operator} in module: ${t.module}`),e.nt.error),sw=(t,n,r,i,a,o=[])=>{let s=e=>o.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw ow(e);return{name:e.operator,key:e.key}}),c=DC(t.invariants,n),l=AC(t,n,r,i,a),u=jC(t,n,a),d=t.properties[0],f=d&&Lh(d,n)?.location.range,p=t.specification,m=p&&Lh(p,n)?.location.range;l.isPropertyFairness&&f&&m&&a?.({kind:`warning`,code:qe.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${d} at ${e.X(f)} equals\nthe fairness constraints of the behavior specification ${p} at ${e.X(m)}.\nTherefore, checking whether ${p} => ${d} using TLC will never result in a violation of ${d}.`});let h=RC([...c,...u.invariants],n),g=[...new Map(h.map(e=>[e.predicate,e])).values()],_=h.length>0||u.actionProperties.length>0||u.liveness.length>0;if(l.init===void 0&&(_||u.initialPredicates.length>0||n.variables.length>0))throw new e._(n.runtime.version===`1.7.4`?Qe:`The configuration file did not specify the initial state predicate.`);if(l.next===void 0&&_)throw new e._(`The configuration file did not specify the next state predicate.`);let v=NC(`constraint`,[...t.constraints,...s(`constraint`).map(e=>e.name)],n),y=RC(v,n),b=NC(`action constraint`,t.actionConstraints,n),x=n.coverage,ee=(e,t,r=!0)=>t.flatMap(t=>{if(!x)return[];let i=r?LC(t.expression,n):t.expression,a=$a(r?t.name:void 0,i,n),o=Za(x,e,a,i,t.scope);return[{expression:i,scope:t.scope,node:o}]}),te=[...ee(`invariant`,c),...ee(`invariant`,u.invariants,!1)],ne=ee(`constraint`,b),S=ee(`constraint`,v),re=ee(`implied`,u.initialPredicates,!1),C=ee(`implied`,u.actionProperties.map(e=>({...e,expression:e.box})),!1),ie=(e,t,r,i)=>{try{return fo(e,t.node,()=>W(t.expression,qC(n,r,i,t.scope)))}catch{return}},w=(e,t,n)=>x!==void 0&&e.every(e=>ie(x,e,t,n)===!0),T=(e,t,n)=>{if(x){for(let r of e){let e=ie(x,r,t,n);if(typeof e!=`boolean`)return;if(!e)return x.primary[r.node]++,!1;x.secondary[r.node]++}return!0}};t.rlReward!==void 0&&bC(`rlreward`,t.rlReward,n),t.periodic!==void 0&&bC(`periodic`,t.periodic,n);let ae=FC(t.possible,n);if(n.variables.length===0)return;let oe=t.symmetry===void 0?void 0:dC(t.symmetry,n,t.substitutions),se=t.view===void 0?void 0:CC(`view function`,t.view,n),ce=t.view??s(`view`)[0]?.name,le=ce===void 0?void 0:vC(ce),ue=u.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:gC};return{...e,unchanged:t}}),de=e=>Ev(e.expression,void 0,n)>=2,fe=ae.filter(e=>!de(e)),pe=ae.filter(de),me=n.runtime,E,D=()=>{if(E)return E;let e=i(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return E=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),E},O=(e,t)=>W(e,qC(n,t,void 0)),k=e=>{let t=oe===void 0?e:hC(e,oe,D());return Ua(le===void 0?D().map(e=>t[e]):[O(le.expression,t)])},he=e=>w(re,e)?void 0:u.initialPredicates.find(t=>!YC(t.expression,qC(n,e,void 0,t.scope))),ge=/* @__PURE__ */ new WeakSet,_e=(t,r,i)=>{let a=i&&!ge.has(i)?i:void 0;if(zC(t,r,a))return!1;try{let e=qC(n,r,void 0,t.scope),i=t.membership;return a&&i?!Si(r[i.variable],a[i.variable],W(i.set,e)):!QC(t,e)}catch(n){throw i?dt(e.at(n,e.nt.safetyEvaluationFailure),qe.invariantEvaluationFailed,`Evaluating invariant ${t.name} failed.`):n}},ve=WC(t,n);me.getFingerprint=k;let ye=()=>{let t=ae.find(e=>!me.possibleCounts.get(e.name));if(!t)return;let r=PC(t.name,n),i=r?` at ${e.X(r)}`:``;return{name:t.name,code:qe.possibleUnwitnessed,message:`The _POSSIBLE predicate ${t.name}${i} 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:M(R(ef(me),!0))}},be=se?.body.kind===`Tuple`?se.body.elements:[],xe=be.flatMap(e=>e.kind===`Identifier`&&n.variables.includes(e.name)?[e.name]:[]),A=se?.body.kind===`Tuple`&&xe.length===be.length&&new Set(xe).size===xe.length,Se=(e,t)=>A?D().filter(e=>xe.includes(n.variables[e])).map(e=>`/\\ ${n.variables[e]} = ${M(R(t[e]))}\n`).join(``):M(R(O(e,t))),Ce=(t,r,i)=>YC(t.expression,qC(n,r,i),t=>`${e.G}${ZC(t,n)}`),we=e=>{let t=Object.fromEntries(D().map(t=>[n.variables[t],e[t]]));return le===void 0?t:sn(t,()=>Se(le.expression,e))};return me.toRecord=we,{properties:u,spec:l,toRecord:we,evaluateAlias:(t,r,i,a)=>{try{CC(`alias`,t,n);let e=W(_C(t),qC(n,r,i)),a=GC(e);return a===void 0?we(r):ln(a,t)}catch(t){if(!(t instanceof e._||t instanceof e.b))throw t;return{...we(r),_ALIASEvalError:ot(t.message,a)}}},isSymmetric:oe!==void 0,isConstrained:y.length>0||b.length>0,getTypedChecks:e=>{if(x!==void 0||ae.length>0||t.periodic!==void 0||[...h,...y].some(e=>e.scope!==void 0)||b.length>0||u.actionProperties.some(e=>e.scope!==void 0)||u.liveness.length>0&&(e===void 0||le!==void 0)||l.init===void 0||l.next===void 0)return;let r=g.map(e=>e.predicate),i=[...new Set(y.map(e=>e.predicate))],a=u.initialPredicates.map(e=>e.expression),o=[...n.facts.ids.keys()],s=MC(l.scope),c=e=>dg(e,n)===void 0&&Du(e,n,`replayed`);return(s===void 0?o.some(c):o.some(e=>!(e.kind===`Operator`&&e.params.length>0)&&wu(e,n)&&c(e))||Eu([l.init,l.next,...r,...i,...a,...u.actionProperties.flatMap(e=>[e.action,e.subscript]),...le?[le.expression]:[],...s,...Oy(e??[])],n,`replayed`))?void 0:{init:l.init,next:l.next,scope:l.scope,invariants:r,constraints:i,holdsInitialPredicates:e=>he(e)===void 0,actionProperties:u.actionProperties,symmetry:oe,view:le?.expression,variableOrder:D(),liveness:e}},getTlcOrder:D,getStoredFingerprints:(e,t)=>le!==void 0||ve?BigInt64Array.from(e,k):Ga(t,D()),getFingerprintState:e=>{if(ve)return[String(k(e))];let t=oe===void 0?e:hC(e,oe,D());return le===void 0?t:[O(le.expression,t)]},findViolatedInvariant:(e,t)=>{if(w(te,e))return;let n=h.find(n=>_e(n,e,t));return n&&ge.add(e),n},getViolatedInvariants:e=>{let t=g.filter(t=>h.some(n=>n.predicate===t.predicate&&_e(n,e,void 0)));return t.length>0&&ge.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>YC(n,qC(t,e,void 0,r));y.every(e=>r(e.predicate,e.scope))&&n();let i=g.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=u.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(y.every(e=>YC(e.predicate,qC(n,t,void 0,e.scope)))&&b.every(r=>YC(r.expression,qC(n,e,t,r.scope))))||r())||g.every(e=>YC(e.predicate,qC(n,t,void 0,e.scope))))&&ue.every(r=>YC(r.box,qC(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>T(S,e)??y.every(r=>zC(r,e,t)||QC(r,qC(n,e,void 0))),findFailedInitialPredicate:he,findViolatedActionProperty:(e,t)=>w(C,e,t)?void 0:ue.find(r=>{try{return!YC(r.action,qC(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${U(r.box)}`)&&!JC(r.unchanged,qC(n,e,t,r.scope),`a subscript`)}catch(e){throw dt(cw(e),qe.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>T(ne,e,t)??b.every(n=>Ce(n,e,t)),getExcludingConstraints:(t,r)=>[...y.filter(e=>!QC(e,qC(n,r,void 0))),...b.filter(e=>!Ce(e,t,r))].map(t=>{let r=PC(t.name,n);return r?e.X(r):t.name}),trackStatePossible:fe.length===0?$C:e=>ew(fe,me,qC(n,e,void 0)),trackActionPossible:pe.length===0?$C:(e,t)=>ew(pe,me,qC(n,e,t)),findUnwitnessedPossible:ye,getReward:(r,i,a)=>{if(t.rlReward===void 0)return a;let o=_C(t.rlReward),s=W(o,qC(n,r,i));if(typeof s!=`number`)throw new e.b(XC(`integer`,o,n));return s},findPostconditionViolation:(r=!1)=>{let i=s(`postcondition`),a=t.postconditions.map(e=>{let t=Lh(e,n);return t?t.kind===`Operator`&&t.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!xC(t)&&dg(t,n)!==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(a!==void 0){if(r)return;throw e.at(new e.b(a),e.nt.configParseError)}let o=(t,r)=>{let i=tw(e=>YC(_C(r),e),n);if(!i)return;let a=Lh(r,n)?.body,o=PC(r,n),s=o?` at ${a?.kind===`Number`?hh(a):e.X(o)}`:``;return i.message===void 0?{name:t,code:qe.postconditionFalse,message:`Postcondition ${t}${s} is false.`}:{name:t,code:qe.postconditionFailed,message:`Evaluating postcondition ${t}${s} failed.\n${i.message}`}};for(let e of i){let t=o(e.name,e.key);if(t)return t}let c=ye();if(c)return c;for(let e of t.postconditions){let t=o(e,e);if(t)return t}}}},cw=t=>t instanceof e.k?e.at(t,t.exitCode):t,lw=(e,t)=>e*((t-e)/2**64),uw=e=>e.includes(`.`)?e:`${e}.0`,dw=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return uw(String(e));let[n,r]=e.toExponential().split(`e`);return`${uw(n)}E${r.replace(`+`,``)}`},fw=e=>e!==void 0&&e>=`0`&&e<=`9`,pw=e=>{if(e===0)return`0.0`;let t=dw(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;fw(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;fw(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;fw(t[n])&&r<2;)i+=t[n++],r++;for(fw(t[n])&&Number(t[n])>=5&&(i=mw(i));fw(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},mw=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${mw(r)}.`:n===`9`?`${mw(r)}0`:`${r}${Number(n)+1}`},hw=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}`)},gw=(e,t,n)=>{if(lw(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},_w=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}).`},vw=[void 0,`lambda`,`tuple`,`record`],yw=()=>{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=Ni(e.domain);return t?(a(7),a(vw.indexOf(An(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(vw.indexOf(An(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})}},bw=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 Cn(t.strings[n[r++]]);if(e===5)return Tn(i(n[r++]));let a=vw[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=jr({kind:`Interval`,low:e,high:e+t-1});return kn(Dn(o,i(t)),a)}let o=n[r++],s=i(o);return kn(Dn(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return ah}}),Object.defineProperty(exports,"$t",{enumerable:!0,get:function(){return I}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return ry}}),Object.defineProperty(exports,"At",{enumerable:!0,get:function(){return Ct}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return P_}}),Object.defineProperty(exports,"Bt",{enumerable:!0,get:function(){return Nr}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return oS}}),Object.defineProperty(exports,"Ct",{enumerable:!0,get:function(){return $a}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return Dy}}),Object.defineProperty(exports,"Dt",{enumerable:!0,get:function(){return Ra}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return ky}}),Object.defineProperty(exports,"Et",{enumerable:!0,get:function(){return za}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return N_}}),Object.defineProperty(exports,"Ft",{enumerable:!0,get:function(){return Pr}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return Wg}}),Object.defineProperty(exports,"Gt",{enumerable:!0,get:function(){return Dt}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return F_}}),Object.defineProperty(exports,"Ht",{enumerable:!0,get:function(){return R}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return T_}}),Object.defineProperty(exports,"It",{enumerable:!0,get:function(){return gr}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return Dg}}),Object.defineProperty(exports,"Jt",{enumerable:!0,get:function(){return Zr}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return U}}),Object.defineProperty(exports,"Kt",{enumerable:!0,get:function(){return wn}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return k_}}),Object.defineProperty(exports,"Lt",{enumerable:!0,get:function(){return Dn}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return Lv}}),Object.defineProperty(exports,"Mt",{enumerable:!0,get:function(){return Un}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return bv}}),Object.defineProperty(exports,"Nt",{enumerable:!0,get:function(){return Sr}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return oy}}),Object.defineProperty(exports,"Ot",{enumerable:!0,get:function(){return Pa}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return w_}}),Object.defineProperty(exports,"Pt",{enumerable:!0,get:function(){return Cn}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return rh}}),Object.defineProperty(exports,"Qt",{enumerable:!0,get:function(){return Ln}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return E_}}),Object.defineProperty(exports,"Rt",{enumerable:!0,get:function(){return Fr}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return sS}}),Object.defineProperty(exports,"St",{enumerable:!0,get:function(){return Ja}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Ay}}),Object.defineProperty(exports,"Tt",{enumerable:!0,get:function(){return La}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return j_}}),Object.defineProperty(exports,"Ut",{enumerable:!0,get:function(){return Wi}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return D_}}),Object.defineProperty(exports,"Vt",{enumerable:!0,get:function(){return ma}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return C_}}),Object.defineProperty(exports,"Wt",{enumerable:!0,get:function(){return Gi}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return dg}}),Object.defineProperty(exports,"Xt",{enumerable:!0,get:function(){return F}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return Lh}}),Object.defineProperty(exports,"Yt",{enumerable:!0,get:function(){return tn}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return Ig}}),Object.defineProperty(exports,"Zt",{enumerable:!0,get:function(){return Bn}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return EC}}),Object.defineProperty(exports,"_n",{enumerable:!0,get:function(){return Te}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return Eu}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return gw}}),Object.defineProperty(exports,"an",{enumerable:!0,get:function(){return lt}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return tm}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return nS}}),Object.defineProperty(exports,"bn",{enumerable:!0,get:function(){return re}}),Object.defineProperty(exports,"bt",{enumerable:!0,get:function(){return so}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return rw}}),Object.defineProperty(exports,"cn",{enumerable:!0,get:function(){return xt}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return Ff}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return nw}}),Object.defineProperty(exports,"dn",{enumerable:!0,get:function(){return ft}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return Df}}),Object.defineProperty(exports,"en",{enumerable:!0,get:function(){return qe}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return ih}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return qC}}),Object.defineProperty(exports,"fn",{enumerable:!0,get:function(){return vt}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return nf}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return TC}}),Object.defineProperty(exports,"gn",{enumerable:!0,get:function(){return Le}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return wu}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return aw}}),Object.defineProperty(exports,"hn",{enumerable:!0,get:function(){return ze}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return Nd}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return hw}}),Object.defineProperty(exports,"in",{enumerable:!0,get:function(){return ot}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return im}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return cy}}),Object.defineProperty(exports,"jt",{enumerable:!0,get:function(){return bn}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return sy}}),Object.defineProperty(exports,"kt",{enumerable:!0,get:function(){return Ua}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return ow}}),Object.defineProperty(exports,"ln",{enumerable:!0,get:function(){return _t}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return Pf}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return iw}}),Object.defineProperty(exports,"mn",{enumerable:!0,get:function(){return Ve}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return kd}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return yw}}),Object.defineProperty(exports,"nn",{enumerable:!0,get:function(){return Ze}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return Am}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return lw}}),Object.defineProperty(exports,"on",{enumerable:!0,get:function(){return ct}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return nm}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return KC}}),Object.defineProperty(exports,"pn",{enumerable:!0,get:function(){return st}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return of}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return W}}),Object.defineProperty(exports,"qt",{enumerable:!0,get:function(){return Et}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return pw}}),Object.defineProperty(exports,"rn",{enumerable:!0,get:function(){return N}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return oh}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return _w}}),Object.defineProperty(exports,"sn",{enumerable:!0,get:function(){return rt}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return rm}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return bw}}),Object.defineProperty(exports,"tn",{enumerable:!0,get:function(){return Je}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return sh}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return sw}}),Object.defineProperty(exports,"un",{enumerable:!0,get:function(){return it}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return If}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return cw}}),Object.defineProperty(exports,"vn",{enumerable:!0,get:function(){return _e}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return As}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return hx}}),Object.defineProperty(exports,"wt",{enumerable:!0,get:function(){return Do}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return iS}}),Object.defineProperty(exports,"xt",{enumerable:!0,get:function(){return ho}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return mC}}),Object.defineProperty(exports,"yn",{enumerable:!0,get:function(){return x}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return Za}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return I_}}),Object.defineProperty(exports,"zt",{enumerable:!0,get:function(){return Tn}});
|